ppxscal/embedding_network huggingface dataset:
Inferring interpretable pattern-based classification models from data using frequent pattern discovery algorithms and maximum entropy probability distributions
Authors: Alan Ableson
Venue:  (2006)

One of the central challenges in business and medical applications is the classification problem. Classification is the development of a mapping from a set of measurable characteristics, or attributes of an object to a class label for the object. Examples are using credit card histories to identify fraudulent use, or mapping the results of a patient's medical tests to their diagnosis. The field of machine learning has developed tools to infer such classification mappings from a collection of objects, called the training data for which both the attributes and the class label are known. In our research, we have developed a novel combination of machine learning and statistical techniques that generate classification mappings-that-are straightforward to interpret and capable of classification accuracies rivaling less interpretable methods, such as neural networks and support vector machines. The classification algorithm is a combination of frequent pattern discovery tools with maximum entropy probability models. Frequent pattern discovery tools allow the discovery and enumeration of frequent multi-variate patterns in data, while maximum entropy models are used to build Bayesian probability models from these multi-variate patterns. It is our thesis that this combination of approaches allows users to generate high accuracy classification mappings which are interpretable by the user. It is also our thesis that the inference of such mappings is practicable, requiring run times comparable to other machine learning methods. In our experiments, we found that combining frequent patterns and maximum entropy models to generate classifier mappings produces accurate classifiers on a wide variety of classification problems. The relatively simple parameterized form of the classifier mappings allowed us to immediately interpret the impact and importance of each selected pattern on the class predictions. Finally, with careful implementation, the time required to infer these mappings is comparable with other classification algorithms.
A Reconfigurable Implementation of the New Secure Hash Algorithm
Authors: M. Zeghida, B. Bouallegue, A. Baganne, M. Machhout, R. Tourki
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The main applications of the hash functions are met in the fields of communication's integrity and signature authentication. Many hash algorithms have been investigated and developed in the last years. This work is related to hash functions FPGA implementation. Field programmable gate arrays (FPGAs) being reconfigurable, flexible and physically secure are a natural choice for implementation of hash functions in a broad range of applications with different areaperformance requirements. We propose a configurable Secure Hash Algorithm (SHA) processor for extended signature authentication. This paper investigates different optimizations algorithms of recent Techniques that have been proposed in the literature. In our implementation based on Xilinx Virtex FPGAs, the throughput of SHA processor is equal to 1296 Mbit/s. Speed/area results from these processors are analyzed and shown to compare favorably with other FPGAbased implementations. A fastest data throughput is achieved by our optimized algorithm.
An Engineering Learning Center; description, results, and lessons learned
Authors: F. Azadivar
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The Engineering Learning Center (ELC) of Kansas State University provides internship opportunities for engineering students in the same way a teaching hospital trains medical school students. The center consists of state-of-the-art manufacturing and engineering design hardware and software, a staff of experienced engineers, and a group of faculty associates from various engineering disciplines. In this center, graduate and undergraduate students from engineering and business colleges work as interns on product and process development projects contracted with industrial partners. To each project contracted with client companies, an interdisciplinary group of interns is assigned to work under the supervision of an experienced staff member and deliver new designs, prototypes and manufacturing processes. This operation provides a unique and innovative active learning environment for junior and senior students from several engineering disciplines. Students learn to perform as members of an interdisciplinary team, develop outstanding communication skills (because they have to sell their ideas to a paying customer), and realize the business side of engineering activities. The paper presents the detailed results of the operation of ELC since its inception in 1995. It also details the lessons learned in establishing and operating this center with a guide for things to emphasize and pitfalls to avoid.
Computing the 3D Voronoi Diagram Robustly: An Easy Explanation
Authors: Hugo Ledoux
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Many algorithms exist for computing the 3D Voronoi diagram, but in most cases they assume that the input is in general position. Because of the many degeneracies that arise in 3D geometric computing, their implementation is still problematic in practice. In this paper, I describe a simple 3D Voronoi diagram (and Delaunay tetrahedralization) algorithm, and I explain, by giving as many details and insights as possible, how to ensure that it outputs a correct structure, regardless of the spatial distribution of the points in the input.
The Past, Present, and Future
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2007)

Editor-in-chief Norman Chonacky describes the current editorial board and his plans for balancing out the two communities that CiSE serves, computational scientists and scientists who use computation.
Hierarchical Replication Control in a Global File System
Authors: Jiaying Zhang, Peter Honeyman
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

We develop a consistent mutable replication extension for NFSv4 tuned to meet the rigorous demands of largescale data sharing in global collaborations. The system uses a hierarchical replication control protocol that dynamically elects a primary server at various granularities. Experimental evaluation indicates a substantial performance advantage over a single server system. With the introduction of the hierarchical replication control, the overhead of replication is negligible even when applications mostly write and replication servers are widely distributed.
A brief history of mobile communication in Europe
Authors: Theo Dunnewijk, Staffan Hultén
Venue: Telematics and Informatics (2007)

Since the introduction of mobile telephony in the early 1950s in Europe, US and Japan the demand for this service exploded. It seems that the latent demand for mobile telecommunication services for decade's continued to be very strong. After the introduction of cellular technology the capacity of the services became able to meet the massive demand. Next and future generations of mobile telecommunication technologies bring increased transmission speed and more versatile services. This forces network operators to organise multi sourced information flows supplied by service providers to increase the network effect of the system instead of providing the network infrastructure and leave the content to the users as in pure voice telephony. The drivers and inhibitors behind the emergence and recent developments of mobile telecommunications systems in Europe, are highlighted in this paper. Liberalisation of the telecom markets in Europe drove new entrants to the market and curbed excessive pricing. However, in recent years the lack of challenging service is the main cause for the wavering development of newer generations of mobile telecommunication services.
Active vs passive touch: the state of play and the future
Authors: Mark A. Symmons, Barry L. Richardson, Dianne B. Wuillemin
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The active explorer has full control over their own movements, while a passive counterpart surrenders that control to some outside agency. The results of a number of experiments comparing active and passive exploration of two- and three-dimensional haptic stimuli are presented. In some circumstances active touch is superior, in others passive touch excels, while in still other instances no difference is found. A number of studies in progress are also described.
Puppeteer: Component-based adaptation for mobile computing
Authors: Eyal De Lara, Dan S. Wallach, Willy Zwaenepoel
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

Puppeteer is a system for adapting component-based applications in mobile environments. Puppeteer takes advantage of the exported interfaces of these applications and the structured nature of the documents they manipulate to perform adaptation without modifying the applications. The system is structured in a modular fashion, allowing easy addition of new applications and adaptation policies. Our initial prototype focuses on adaptation to limited bandwidth. It runs on Windows NT, and includes support for a variety of adaptation policies for Microsoft PowerPoint and Internet Explorer 5. We demonstrate that Puppeteer can support complex policies without any modification to the application and with little overhead. To the best of our knowledge, previous implementations of adaptations of this nature have relied on modifying the application.
Constructing negotiation of meaning model for task-based language training online game
Authors: Kazuhito Shiratori, Rai Chan, Junichi Hoshino
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In this paper, we propose a model of 'negotiation of meaning' for a task-based language training online game. In the process of acquiring language skill through task-based learning, it is important for learners to try to convey information to one another and reach mutual comprehension through restating, clarifying, and confirming information via the process of communication. Therefore, we constructed a model of negotiation of meaning for an NPC (Non-player Character). When the learner has a conversation with an NPC, the NPC could help the learner get started on or work through a stumbling block via the negotiation of meaning function.
Cache-Aware Timing Analysis of Streaming Applications
Authors: Samarjit Chakraborty, Tulika Mitra, Abhik Roychoudhury, Lothar Thiele, Unmesh D. Bordoloi, Cem Derdiyok
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

Of late, there has been a considerable interest in models, algorithms and methodologies specifically targeted towards designing hardware and software for streaming applications. Such applications process potentially infinite streams of audio/video data or network packets and are found in a wide range of devices, starting from mobile phones to set-top boxes. Given a streaming application and an architecture, the timing analysis problem is to determine the timing properties of the processed data stream, given the timing properties of the input stream. Most of the previous work related to estimating or optimizing these timing properties take a high-level view of the architecture and neglect microarchitectural features such as caches. In this paper, we show that an accurate estimation of a streaming application's timing properties, however, heavily relies on an appropriate modeling of the processor micro-architecture, such as its instruction cache. Towards this, we present a novel framework for timing analysis of stream processing applications. Our framework accurately models the evolution of the instruction cache of the underlying processor as a stream is processed, and the fact that the execution time involved in processing any data item depends on all the previous data items occurring in the stream. We have implemented a prototype of this framework partly in C and partly in Mathematica and plan to integrate it into a design-space exploration tool for system-level design of hardware-software architectures for streaming applications.
Enhancement of esophageal speech using formant synthesis
Authors: K. Matsui
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The feasibility of using the formant analysis-synthesis approach to replace the voicing sources of esophageal speech was explored. The voicing sources were generated by using inverse-filtered signals extracted from normal speakers. Pitch extraction was tested with various pitch extraction methods, then a simple auto-correlation method was chosen. A special hardware unit was designed to perform the analysis-synthesis process in real-time. Results of a subjective test showed that the synthesized speech was significantly improved.
A note on polynomial complexity optimal multiuser detection for certain non-orthogonal CDMA signals
Authors: Song Wentso, M. Motani
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

It is well known that jointly-optimum multiuser detection (MUD) in code division multiple access (CDMA) systems has a computational complexity that increases exponentially with the number of users. If the signal cross-correlations between different users are non-positive, then optimum MUD can be done with polynomial complexity using graph theory. The MUD problem is transformed into one that solves for the minimum cut (min-cut) or maximum flow (max-flow) in an associated graph or network. An alternative method to transform the MUD problem into a network, that sees a reduction in the number of edges by 50 percent, is proposed. This results in minimizing the already polynomial-complexity of existing multiuser detection techniques based on edge-dependent max-flow algorithms.
Multi-Dimensional Performance Framework for Enterprise Knowledge Infrastructures
Authors: Joe Bolinger, Jay Ramanathan
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Within service-oriented business environments, the non-routine processing of requests requires a greater degree of social interaction and learning to elicit an effective response. Specific practices arise and evolve through these cooperative interactions, however traditional enterprise systems are often "closed' and do not support the evolution of practices within a network of practitioners. Enterprise Knowledge Infrastructures (EKI) can support such a phenomenon but adequate support for capture and re-use of practical knowledge has many known challenges. We propose a general EKI framework to support business-social interactions and monitor their value to accelerate the creation and evolution of practice through reflexive knowledge. The main contributions of the framework are: 1) a multi-dimensional model for monitoring the value of social interactions to stakeholders, 2) living objects that capture and feedback multi-dimensional performance as reflexive knowledge for task execution, and 3) a generalized architecture for effective implementation.
Scalable training of L1-regularized log-linear models
Authors: Galen Andrew, Jianfeng Gao
Venue: Proceedings of the 24th international conference on Machine learning (2007)

The L-BFGS limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be used for an L1-regularized loss due to its non-differentiability whenever some parameter is zero. Efficient algorithms have been proposed for this task, but they are impractical when the number of parameters is very large. We present an algorithm Orthant-Wise Limited-memory Quasi-Newton (OWL-QN), based on L-BFGS, that can efficiently optimize the L1-regularized log-likelihood of log-linear models with millions of parameters. In our experiments on a parse reranking task, our algorithm was several orders of magnitude faster than an alternative algorithm, and substantially faster than L-BFGS on the analogous L2-regularized problem. We also present a proof that OWL-QN is guaranteed to converge to a globally optimal parameter vector.
Routing sets in the integer lattice
Authors: Peter Hamburger, Robert Vandell, Matt Walsh
Venue: Discrete Applied Mathematics (2007)

A set of vertices S in a graph G is a routing set if it ensures some kind of connectivity between all pairs of vertices outside of S. Additional constraints may apply; a connected dominating set, for instance, is a special case of a routing set. We determine the size of a minimum routing set in subgraphs of the integer lattice, as well as (asymptotically) for the lattice itself.
An object-oriented framework for distributed computational simulation of aerospace propulsion systems
Authors: John A. Reed, Abdollah A. Afjeh
Venue: Proceedings of the 4th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 4 (1998)

Designing and developing new aerospace propulsion systems is time-consuming and expensive. Computational simulation is a promising means for alleviating this cost, but requires a flexible software simulation system capable of integrating advanced multidisciplinary and multifidelity analysis methods, dynamically constructing arbitrary simulation models, and distributing computationally complex tasks. To address these issues, we have developed Onyx, a Java-based object-oriented application framework for aerospace propulsion system simulation. The Onyx framework defines a common component object model which provides a consistent component interface for the construction of hierarchal object models. Because Onyx is a framework, component analysis models may be changed dynamically to adapt simulation behavior as required. A customizable visual interface provides high-level symbolic control of propulsion system construction and execution. For computationally-intensive analysis, components may be distributed across heterogeneous computing architectures and operating systems. This paper describes the design concepts and object-oriented architecture of Onyx. As a representative simulation, a set of lumped-parameter gas turbine engine components are developed and used to simulate a turbojet engine.
Evolution from a Scientific Application to an Applicable Product
Authors: Matthias Wagner
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Software developments in a scientific environment often serve a very special purpose and a limited number of users. When need arises to make the software usable in a more general way, the software has to be improved in terms of quality and meeting the users' needs. To apply it for a longer period, it also has to take into account changes of state-of-the-art software and technologies. This paper describes an example for such an evolution of scientific applications over the course of ten years. Developed initially as an environment for a specific numerical simulation project, the software has been applied to other simulation projects in various sectors. Keeping a relative stable software design, more functionality and features have been added. New features make use of emerging technologies and widen the application range. The development of software engineering methods and tools has been steadily evaluated and the software development environment has been adapted accordingly.
Timed Concurrent Constraint Programming for Analysing Biological Systems
Authors: Julian Gutiérrez, Jorge A. Pérez, Camilo Rueda, Frank D. Valencia
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this paper we present our first approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information constructs in ntcc can provide a suitable language for such systems. We also illustrate how ntcc may provide a unified framework for the analysis of biological systems, as they can be described, simulated and verified using the elements provided by the calculus.
Using the effect of information delay in differential pursuit games
Authors: G. Ts. Chikrii
Venue: Cybernetics and Systems Analysis (2007)

An approach to solving linear differential pursuit games is substantiated. It consists in generating the pursuer's control based on the evader's previous behavior. The results are illustrated with model soft-meeting problems.
Consensus Clustering for Detection of Overlapping Clusters in Microarray Data
Authors: Meghana Deodhar, Joydeep Ghosh
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Most clustering algorithms are partitional in nature, assigning each data point to exactly one cluster. However, several real world datasets have inherently overlapping clusters in which a single data point can belong entirely to more than one cluster. This is often the case with gene microarray data since it is possible for a single gene to participate in more than one biological process. This paper deals with a novel application of consensus clustering for detecting overlapping clusters. Our approach takes advantage of the fact that results obtained by applying different clustering algorithms to the same dataset could be different and a consensus across these results could be used to detect overlapping clusters. Moreover we extend a popular model selection approach called X-means [10] to detect the inherent number of overlapping clusters in the data.
Domain decomposition for multiscale PDEs
Authors: I. G. Graham, P. O. Lechner, R. Scheichl
Venue: Numerische Mathematik (2007)

We consider additive Schwarz domain decomposition preconditioners for piecewise linear finite element approximations of elliptic PDEs with highly variable coefficients. In contrast to standard analyses, we do not assume that the coefficients can be resolved by a coarse mesh. This situation arises often in practice, for example in the computation of flows in heterogeneous porous media, in both the deterministic and (Monte&#x2013;Carlo simulated) stochastic cases. We consider preconditioners which combine local solves on general overlapping subdomains together with a global solve on a general coarse space of functions on a coarse grid. We perform a new analysis of the preconditioned matrix, which shows rather explicitly how its condition number depends on the variable coefficient in the PDE as well as on the coarse mesh and overlap parameters. The classical estimates for this preconditioner with linear coarsening guarantee good conditioning only when the coefficient varies mildly inside the coarse grid elements. By contrast, our new results show that, with a good choice of subdomains and coarse space basis functions, the preconditioner can still be robust even for large coefficient variation inside domains, when the classical method fails to be robust. In particular our estimates prove very precisely the previously made empirical observation that the use of low-energy coarse spaces can lead to robust preconditioners. We go on to consider coarse spaces constructed from multiscale finite elements and prove that preconditioners using this type of coarsening lead to robust preconditioners for a variety of binary (i.e., two-scale) media model problems. Moreover numerical experiments show that the new preconditioner has greatly improved performance over standard preconditioners even in the random coefficient case. We show also how the analysis extends in a straightforward way to multiplicative versions of the Schwarz method.