ppxscal/embedding_network huggingface dataset:
Practical use of polynomials over the reals in proofs of termination
Authors: Salvador Lucas
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

Nowadays, polynomial interpretations are an essential ingredient in the development of tools for proving termination. We have recently proven that polynomial interpretations over the reals are strictly better for proving polynomial termination of rewriting than those which only use integer coefficients. Some essential aspects of their practical use, though, remain unexplored or underdeveloped. In this paper, we compare the two current frameworks for using polynomial intepretations over the reals and show that one of them is strictly better than the other, thus making a suitable choice for implementations. We also prove that the use of algebraic real co-efficients in the interpretations suffice for termination proofs. We also discuss the use of algorithms and techniques from Tarski's first-order logic of the real closed fields for implementing their use in proofs of termination. We argue that more standard constraint-solving techniques are better suited for this. We propose an algorithm to solve the polynomial constraints which arise when specific finite subsets of rational (or even algebraic real) numbers are considered for giving value to the coefficients. We provide a preliminary experimental evaluation of the algorithm which has been implemented as part of the termination tool MU-TERM.
Uniform Data Sampling from a Peer-to-Peer Network
Authors: Souptik Datta, Hillol Kargupta
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distributed in a peer-to-peer (P2P) network with different amount of data in different peers, collecting a uniform sample of data becomes a challenging task. A random sampling can be performed using random-walk, but due to varying degrees of connectivity and different sizes of data owned by each peer, this random walk gives a biased sample. In this paper, we propose a random walk-based sampling algorithm that can be used to sample data tuples uniformly from a large, unstructured P2P network. We model the random walk as aMarkov chain and derive conditions to bound the length of the random walk necessary to achieve uniformity. A formal communication analysis shows logarithmic communication cost to discover a uniform data sample.
Information Discriminant Analysis: Feature Extraction with an Information-Theoretic Objective
Authors: Zoran Nenadic
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Using elementary information-theoretic tools, we develop a novel technique for linear transformation from the space of observations into a low-dimensional (feature) subspace for the purpose of classification. The technique is based on a numerical optimization of an information-theoretic objective function, which can be computed analytically. The advantages of the proposed method over several other techniques are discussed and the conditions under which the method reduces to linear discriminant analysis are given. We show that the novel objective function enjoys many of the properties of the mutual information and the Bayes error and we give sufficient conditions for the method to be Bayes-optimal. Since the objective function is maximized numerically, we show how the calculations can be accelerated to yield feasible solutions. The performance of the method compares favorably to other linear discriminant-based feature extraction methods on a number of simulated and real-world data sets.
Problem based learning via open ended projects in Carnegie Mellon University's Chemical Engineering undergraduate laboratory
Authors: M. Cline
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Following an extensive physical renovation of our undergraduate Chemical Engineering laboratory, revisions in the philosophy and practice of the laboratory courses were made. We sought to add flexibility and variety to the experiments that can be performed in our lab space while using space more efficiently. Further, problem-based learning (PBL) methods were applied to experiments so students could hone skills in solving open ended problems while meeting other educational and behavioral objectives. This paper discusses the application of PBL in our undergraduate chemical engineering lab courses, considers how modular and mobile equipment facilitates this learning approach, and offers some preliminary findings.
Towards an Emotion Specification Method: Representing Emotional Physiological Signals
Authors: Andrej Luneski, Panagiotis D. Bamidis
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

This paper introduces initial attempts towards an emotion specification method for physiological signals. The core elements of a complete emotion record are identified and their structure is represented. The XML annotation is proposed as the most appropriate since it provides platform independency and easier intercommunication. The emotion record is described in both quantitative statistical and qualitative analytical manners. The former is a standard way of representing signals by specifying their true numerical values. The second, though is additional description that is characteristic for each signal and describes the main features of the signal in a more free and informal annotation.
Non-Interference Control Synthesis for Security Timed Automata
Authors: Guillaume Gardey, John Mullins, Olivier H. Roux
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In this paper, the problem of synthesizing controllers that ensures non interference for multilevel security dense timed discrete event systems modeled by an extension of Timed Automata, is addressed for the first time. We first discuss a notion of non interference for dense real-time systems that refines notions existing in the literature and investigate decidability issues raised by the verification problem for dense time properties. We then prove the decidability of the problem of synthesis of the timed controller for some of these timed non interference properties, providing so a symbolic method to synthesize a controller that ensures them.
Invited Talk: Solutions for a Service Architecture in Pervasive Environments Based on WWRF WG2 Requirements
Authors: Klaus David, Olaf Drogehorn, Mika Klemettinen
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

The vision of pervasive computing and communication is likely to have a major impact on our lives. The WWRF (Wireless World Research Forum) has summarized this vision by the statement: "7 trillion wireless devices serving 7 billion people by 2017". Following this vision, the goal for new business sectors will be to provide an easy way of creating and deploying different kinds of service environments. This paper introduces the requirements on and the problem of overall architectures for service execution environments and identifies an architectural approach, the requirements and design guidelines to built service execution environments and related platforms. The concepts presented in this paper have partly been developed by the Wireless World Research Forum (WWRF) Working Group 2 (WG2) and are under ongoing discussion.
A working spatio-temporal model of the human visual system for image restoration and quality assessment applications
Authors: C. J. van den Branden Lambrecht
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper describes a spatio-temporal model of the human visual system (HVS) for video imaging applications, predicting the response of the neurons of the primary visual cortex. The model simulates the behavior of the HVS with a three-dimensional filter bank which decomposes the data into perceptual channels, each one being tuned to a specific spatial frequency, orientation and temporal frequency. It further accounts for contrast sensitivity, inter-stimuli masking and spatio-temporal interaction. The free parameters of the model have been estimated by psychophysics. The model can then be used as the basis for many applications. As an example, a quality metric for coded video sequences is presented.
Comparing SVM sequence kernels: a protein subcellular localization theme
Authors: Lynne Davis, John Hawkins, Stefan Maetschke, Mikael Bodén
Venue: Proceedings of the 2006 workshop on Intelligent systems for bioinformatics - Volume 73 (2006)

Kernel-based machine learning algorithms are versatile tools for biological sequence data analysis. Special sequence kernels can endow Support Vector Machines with biological knowledge to perform accurate classification of diverse sequence data. The kernels relative strengths and weaknesses are difficult to evaluate on single data sets. We examine a range of recent kernels tailor-made for biological sequence data (including the Spectrum, Mismatch, Wildcard, Substitution, Local Alignment and a new Profile-based Local Alignment kernel) on a range of classification problems (protein localization in bacteria, peroxisomal protein import signals and sub-nuclear localization). The profile-based local alignment kernel ranks highest, but its computational cost is also higher than for any of the other kernels in contention. The kernels that consistently perform well and tend to produce the most distinct classifications are the Local Alignment, Substitution and Mismatch kernels, suggesting that the exploration of new problem sets should start with these three.
Protecting Private Information by Data Separation in Distributed Spatial Data Warehouse
Authors: Marcin Gorawski, Jakub Bularz
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Both transactional and analytical systems store data, which being accessible to unauthorized persons may result in privacy violation. This issue has become especially important nowadays, due to more restrictive legislation concerning personal data protection and preserving data privacy. We introduce relation decomposition as a method to preserve the data confidentiality in distributed spatial data warehouses. Data separation between nodes of distributed system can easily protect data privacy without requiring encrypting sensitive data. Using the relation decomposition strongly reduces the possibility of a disclosure of private information contained in data warehouse. The article presents how specified secure policy can be implemented into the data warehouse system as well as how analytical applications can retrieve protected data from the database. Finally, we present test results verifying efficiency of the latter operations including comparison between relation decomposition and the most popular method of preserving data privacy i.e. data encryption using symmetric encryption algorithms.
Single to Multiplayer Bluetooth Gaming Framework
Authors: Kevin Duggan, Daniel C. Doolan, Sabin Tabirca, Laurence T. Yang
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

It is estimated that by the end of 2007 approximately two billion bluetooth enabled devices will have been produced to date. The mobile phone market has a significant share of this. The gaming sector has done little to promote the use of bluetooth for gaming. This reflects the limited number of bluetooth enabled games currently available. Why should the modern day phone user have to compete only against the device, when a far more competitive, and enjoyable game can be achieved by the interaction of two or more human players. The development of such games, typically requires significant bluetooth specific api calls to setup the communications mechanism, and carry out communication. This paper details how the Mobile Message Passing Interface (MMPI) may be applied the the realm of bluetooth gaming. In particular this paper introduces a framework that allows for the transformation of a single player game, to a multiplayer bluetooth enabled game with the minimum of code changes.
Organizing electronic services into security taxonomies
Authors: Sean W. Smith, Paul S. Pedersen
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

With increasing numbers of commercial and government services being considered for electronic delivery, effective vulnerability analysis will become increasingly critical. Organizing sets of proposed electronic services into security taxonomies will be a key part of this work. However, brute force enumeration of services and risks is inefficient, and ad hoc methods require reinvention with each new set of services. Furthermore, both such approaches fail to communicate effectively the tradeoffs between vulnerabilities and features in a set of electronic services, and fail to scale to large sets of services. From our experience advising players considering electronic delivery, we have developed a general, systematic, and scalable methodology that addresses these concerns. In this paper, we present this methodology, and apply it to the example of electronic services offered via kiosks (since kiosk systems are representative of a wide range of security issues in electronic commerce).
Optimal model for warehouse location and retailer allocation: Research Articles
Authors: Avninder Gill, M. Ishaq Bhatti
Venue: Applied Stochastic Models in Business and Industry (2007)

Warehouse location and retailer allocation is a high-level strategic decision problem that is commonly encountered by logisticians and supply chain managers, especially during the supply chain design phase. Considering the product distribution cost and warehouse capital cost trade-offs, this paper models the warehouse location and retailer allocation problem as a 0&ndash;1 integer programming problem and provides an efficient two-stage set covering heuristic algorithm to solve large-sized problems. Finally, concluding remarks and some recommendations for further research are also presented. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Sinusoidal modeling using frame-based perceptually weighted matching pursuits
Authors: T. S. Verma
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We propose a method for sinusoidal modeling that takes into account the psychoacoustics of human hearing using a frame-based perceptually weighted matching pursuit. Working on blocks of the input signal, a set of sinusoidal components for each block is iteratively extracted taking into consideration perceptual significance by using extensions to the well known matching pursuits algorithm. These extensions allow including information about the time-varying masking threshold of the input signal during the pursuit. The blocks overlap-add together to reconstruct the entire signal. Although the perceptually weighted matching pursuit on each block can iterate until the error between the original and the reconstructed signal is zero, lower order approximations are possible by stopping the pursuit when the error becomes imperceptible to the human ear or by stopping the pursuit after a number of the perceptually most significant sinusoidal elements are found. The proposed sinusoidal model finds use in many applications including signal modifications and compression.
Release Pattern Discovery via Partitioning: Methodology and Case Study
Authors: Abram Hindle, Michael W. Godfrey, Richard C. Holt
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The development of Open Source systems produces a variety of software artifacts such as source code, version control records, bug reports, and email discussions. Since the development is distributed across different tool environments and developer practices, any analysis of project behavior must be inferred from whatever common artifacts happen to be available. In this paper, we propose an approach to characterizing a project's behavior around the time of major and minor releases; we do this by partitioning the observed activities, such as artifact check-ins, around the dates of major and minor releases, and then look for recognizable patterns. We validate this approach by means of a case study on the MySQL database system; in this case study, we found patterns which suggested MySQL was behaving consistently within itself. These patterns included testing and documenting that took place more before a release than after and that the rate of source code changes dipped around release time.
A Scalable Optical Interconnection Network for Fine-Grain Parallel Architectures
Authors: D. Scott Wills, Matthias Grossglauser
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

This paper introduces a scalable inter connection network based on integrated optical devices developed at Georgia Tech. It incorporates arrays of optical transmitters and detectors placed on top of sil icon chips which are then arranged on a silicon sub strate. Staggering these substrates to overlap chips in different planes forms an offset cube topology. This paper examines this novel optoelectric communication network. It explains the physical network architecture and the offset cube topology, and summarizes its per formance. Combining this optoelectronic communica tion network with new fine-grain machine architectures (multi-node per chip) can lead to extremely dense, high performance parallel systems
Guarded models for intrusion detection
Authors: Hassen Saïdi
Venue: Proceedings of the 2007 workshop on Programming languages and analysis for security (2007)

Host-based intrusion detection systems that monitor an application execution and report any deviation from its statically built model have seen tremendous progress in recent years. However, the weakness of these systems is that they often rely on overly abstracted models that reflect only the control flow structure of programs, and therefore are subject to so-called âmimicry attacksâ. Authors of these models have argued that capturing more of the data flow characteristics of a program is necessary to prevent a large class of attacks, in particular, non-control-data attacks. In this paper, we present the guarded model, a novel model that addresses the various deficiencies of the state-of-the-art intrusion detection systems. Our model is a generalization of previous models that offers no false alarms, a very low monitoring overhead, and is automatically generated. Our model detects mimicry attacks by combining control flow and data flow analysis, but can also tackle the ever increasingly threatening non-control-data flow attacks. Our model is the first model built automatically by combining control flow and data flow analysis using state-of-the-art tools for automatic generation and propagation of invariants. Our model not only prevents intrusions, but allows in some cases the detection of application logic bugs. Such bugs are beyond the reach of current intrusion detection systems
Ontology Driven Requirements Query
Authors: Jordi Conesa Caralt, Jong Woo Kim
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Use cases are commonly used to represent customers' requirements during systems development. In a large software development environment, finding a relevant use case from a large use case library created in the past or related projects is a complex, error-prone and expensive task. Based on the semantic web approach, we propose an ontological methodology to support this task. We use an ontology to augment use cases with semantic information. This ontology is derived from ResearchCyc ontology. We also propose the augmentation of queries used to retrieve use cases with this ontology. We present this approach to better capture, reuse and query use cases
Multichannel active noise control algorithms using inverse filters
Authors: F. Yu. M. Bouchard
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper, a simple inverse structure for multichannel active noise control (ANC) is introduced. This structure, combined with adaptive FIR filters and filtered-x LMS-based algorithms, can produce both a reduction of the computational load and an increase of the convergence speed, compared to the standard multichannel filtered-x LMS algorithm or its fast exact realizations. The proposed structure is based on the use of delayed non-causal models of the inverse plant between some error sensors (typically microphones in ANC systems) and some actuators (typically loudspeakers). Simulations using models of a realistic acoustic plant and inverse plant were performed, and the convergence gain that can be achieved with the proposed structure was demonstrated, while reducing the computational load of the control algorithm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Explode to Explain - Illustrative Information Visualization
Authors: Martin Luboschik, Heidrun Schumann
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Due to complexity, modern visualization techniques for large data volumes and complex interrelationships are difficult to understand for non-expert users and even for expert users the visualization result may be difficult to interpret. Often the limited screen space and the risk of occlusion hinders a meaningful explanation of techniques or datasets by additional visual elements. This paper presents a novel way how views from information visualization can be adapted by the use of the well-known illustrative technique "exploded view", to successfully face the problems described above. The application of exploded views gains screen space for an explanation in a smart way and acts explanatory itself. With our approach of illustrating visual representations, the understanding of complex visualization techniques is eased and new comprehensible views on data are given.