ppxscal/embedding_network huggingface dataset:
Exploiting Common Subexpressions in Numerical CSPs
Authors: Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only a few automatic transformations of the system have been proposed so far. Vu, Schichl, Sam-Haroud, Neumaier have exploited common subexpressions by transforming the equation system into a unique directed acyclic graph. They claim that the impact of common subexpressions elimination on the gain in CPU time would be only due to a reduction in the number of operations.This paper brings two main contributions. First, we prove theoretically and experimentally that, due to interval arithmetics, exploiting certain common subexpressions might also bring additional filtering/contraction during propagation. Second, based on a better exploitation of n-ary plus and times operators, we propose a new algorithm I-CSE that identifies and exploits all the "useful" common subexpressions. We show on a sample of benchmarks that I-CSE detects more useful common subexpressions than traditional approaches and leads generally to significant gains in performance, of sometimes several orders of magnitude.
Robust Stability of Uncertain Neural Networks with Time-Varying Delays
Authors: Wei Feng, Haixia Wu, Wei Zhang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

This paper is concerned the robust stability analysis problem for neural networks with time-varying delay and time-varying parametric uncertainties. By utilizing a Lyapunov-Krasovskii functional, we show that the addressed neural networks are robustly, asymptotically stable if a convex optimization problem is feasible. A stability criterion is derived and formulated by means of the feasibility of a linear matrix inequality (LMI), which can be effectively solved by some standard numerical packages. Two numerical examples are given to demonstrate the usefulness of the proposed robust stability criterion.
Data Dependency Based Recovery Approaches in Survival Database Systems
Authors: Jiping Zheng, Xiaolin Qin, Jin Sun
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Recovering from malicious attacks in survival database systems is vital in mission-critical information systems. Traditional rollback and re-execute techniques are too time-consuming and can not be applied in survival environments. In this paper, two efficient approaches - transaction dependency based and data dependency based are proposed. Comparing to transaction dependency based approach, data dependency recovery approaches need not undo innocent operations in malicious and affected transactions even some benign blind writes on bad data item speed up recovery process.
An Analysis of the Manufacturing Messaging Specification Protocol
Authors: Jan Tore Sørensen, Martin Gilje Jaatun
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

The Manufacturing Messaging Specification (MMS) protocol is widely used in industrial process control applications, but it is poorly documented. In this paper we present an analysis of the MMS protocol in order to improve understanding of MMS in the context of information security. Our findings show that MMS has insufficient security mechanisms, and the meagre security mechanisms that are available are not implemented in commercially available industrial devices.
Aggregate documents: making sense of a patchwork of topical documents
Authors: Michael Shilman
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

With the dramatic increase in quantity and diversity of online content, particularly in the form of user generated content, we now have access to unprecedented amounts of information. Whether you are researching the purchase of a new cell phone, planning a vacation, or trying to assess a political candidate, there are now countless resources at your fingertips. However, finding and making sense of all this information is laborious and it is difficult to assess high-level trends in what is said. Web sites like Wikipedia and Digg democratize the process of organizing the information from countless document into a single source where it is somewhat easier to understand what is important and interesting. In this talk, I describe a complementary set of automated alternatives to these approaches, demonstrate these approaches with a working example, the commercial web site Wize.com, and derive some basic principles for aggregating a diverse set of documents into a coherent and useful summary.
Phototacs: an image-based cell phone interface
Authors: Michael J. Astrauskas
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

As new features have been added to cellular phones, their user interfaces have become increasingly complex, making it difficult for people with cognitive or visual impairments to use them. This paper describes the development and preliminary testing of a simplified, intuitive image-based cell phone interface.
Attack and Improvement of a Secure S-Box Calculation Based on the Fourier Transform
Authors: Jean-Sébastien Coron, Christophe Giraud, Emmanuel Prouff, Matthieu Rivain
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

At CHES 2006, a DPA countermeasure based on the Fourier Transform was published. This generic countermeasure aims at protecting from DPA any S-box calculation used in symmetric cryptosystems implementations. In this paper, we show that this countermeasure has a flaw and that it can be broken by first order DPA. Moreover, we have successfully put into practice our attack on two different S-box implementations. Finally, we propose an improvement of the original countermeasure and we prove its security against first order DPA.
A Set-Pair Analysis Method Based on Grey System Theory
Authors: Sun Jinzhong
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The expression forms of uncertainty are various in true lives. Research and processing of the uncertainty are a much important question which is not only faced currently by many subjects but also must be resolved. Among the numerous methods, the Grey System theory and Set Pair Analysis are newly evolved and acquire broad applications in many fields. The paper utilizes the grey system theory to process the poor information questions existed in the prediction of set-pair analysis. The innovations in this paper lies in: 1) propose a kind of entropy transform method ; 2) bring forward a kind of whitening method based on fuzzy set-valued statistics; 3) improve the AGO method and provide a kind of Increase accumulated generating operation. The method is applied to predict the performance of human resource and displays good effect.
Speaker Classification by Means of Orthographic and Broad Phonetic Transcriptions of Speech
Authors: Christophe Bael, Hans Halteren
Venue: Speaker Classification II: Selected Projects (2007)

In this study we investigate whether a classification algorithm originally designed for authorship verification can be used to classify speakers according to their gender, age, regional background and level of education by investigating the lexical content and the pronunciation of their speech. Contrary to other speaker classification techniques, our algorithm does not base its decisions on direct measurements of the speech signal; rather it learns characteristic speech features of speaker classes by analysing the orthographic and broad phonetic transcription of speech from members of these classes. The resulting class profiles are subsequently used to verify whether unknown speakers belong to these classes.
Note: An algorithm for constructing magic squares
Authors: Yangkok Kim, Jaechil Yoo
Venue: Discrete Applied Mathematics (2008)

In this paper we introduce a product operation on the set of all matrices of integers. Using this operation we give an algorithm to construct an infinite family of magic squares and show that the set of all magic squares forms a free monoid.
Corporate strategy and technology alignment factors that contribute to strategy and technology alignment
Authors: Charles Newman
Venue:  (2008)

Information technology professionals and business leaders are continuously looking for management practices to help them align their business and information technology (IT) strategies. Even though alignment has been determined to be important, what organizations are not clear on is "how to achieve and sustain harmony among business and IT". Researchers contend that there are two approaches to the subject of alignment; the first concentrates on examining the strategies, structure, and planning methodologies in organizations; and, the second investigates the social factors such as the actors in organizations, their values, communications with each other, and ultimately their understanding of each other's domain. This dissertation examines the alignment theories that attempt to give organizations a construct that would assist them with successfully aligning their business strategy with their technology. The key purpose of this research is to determine the factors that organizations contend with in order to develop strategic alignment strategies as well as how organizations address what has been termed the social dimensions of alignment which have been found to contribute to organizations aligning their overall business strategy with its technology. The intended outcome of this research is discover how those social dimensions, once measured contribute to the organization&rsquo;s overall level of alignment within organizations that are contacted for this research.
What Happened in CLEF 2007
Authors: Carol Peters
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The organization of the CLEF 2007 evaluation campaign is described and details are provided concerning the tracks, test collections, evaluation infrastructure, and participation. The main results are commented and future evolutions in the organization of CLEF are discussed.
Visualization and Characterization of Small-Scale Spanwise Vortices in Turbulent Channel Flow
Authors: K. T. Christensen, Y. Wu
Venue: Journal of Visualization (2005)

High-resolution particle-image velocimetry (PIV) measurements are made in the streamwise - wall-normal plane of turbulent channel flow at Re$_{&tau;}$=566, 1184 and 1759, facilitating documentation of the population trends and core diameters of small-scale spanwise vortices. Swirling strength, an unambiguous vortex-identification criterion and hence a local marker of rotation, is used to extract small-scale spanwise vortex cores from the instantaneous velocity fields. Once the small-scale vortices are properly extracted from the PIV realizations, their characteristics are studied in detail. The present results indicate that the very-near-wall region (y < 0.1 h) is densely populated by spanwise vortices with clockwise (negative) rotation. This behavior supports the notion that hairpin-like vortices are generated very close to the wall and grow into the outer layer as they advect downstream. In contrast, counterclockwise (positive) spanwise vortices are scarce in the very-near-wall region, but their presence steadily increases within the logarithmic layer presumably due to a localized generation mechanism. The average core diameter of negative spanwise vortices is found to be larger than the average diameter of positive vortices, with few positive vortices having core diameters exceeding 80 y$_*$.
Generalizations of the Global Cardinality Constraint for Hierarchical Resources
Authors: Alessandro Zanarini, Gilles Pesant
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such constraints allow the expression of requirements, in terms of lower and upper bounds, for resources with different capabilities. Alternate models using gcc's are shown to be weaker. We present filtering algorithms based on flow theory that achieve domain consistency and give experimental evidence of the usefulness of such constraints. We consider an optimization version of the constraints and discuss its relationship with the cost_gcc.
A Decision Method for Air-Pressure Limit Value Based on the Respiratory Model with RBF Expression of Elastance
Authors: Shunshoku Kanae, Zi-Jiang Yang, Kiyoshi Wada
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Air-pressure limit value is an important conditional parameter of artificial respiration. The pulmonary characteristics are very different according to the person. For setting appropriate ventilation conditions fitting to each patient, it is necessary to establish a mathematical model describing the mechanism of human respiratory system, and to know the pulmonary characteristic of each patient via identification of the model. For this purpose, two types of respiratory system models have been proposed by the authors. These models are expressed as second order nonlinear differential equations with air-volume variant elastic coefficient and air-volume variant resistive coefficient. In the first type of model, elastic coefficient is expressed as polynomial function of air-volume, while in the second type of model, elastic coefficient is expressed by RBF network. The model with polynomial expression of elastance has the advantage that the structure is simple. On the other hand, the model with RBF expression of elastance has better numerical stability against to the model with polynomial expression of elastance. In this paper, a decision method of air-pressure limit value based on the respiration model with RBF expression of elastance is proposed. This method adopt a numerical technique to find the point of saturation starting point in the elastance curve, So direct calculation of radius of curvature can be avoided. The proposed method is validated by an example of application to practical clinical data.
Scalable Vector Processors for Embedded Systems
Authors: Christoforos E. Kozyrakis, David A. Patterson
Venue: IEEE Micro (2003)

For embedded applications with data-level parallelism, a vector processor offers high performance at low power consumption and low design complexity. Unlike superscalar and VLIW designs, a vector processor is scalable and can optimally match specific application requirements.
Improving self defense by learning from limited experience
Authors: Karen Z. Haigh, Steven A. Harp
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

Prevalence of new attacks or attack variants presents an interesting challenge for autonomic cyber-defense: how does the autonomic defense mechanism learn from previous failures, acquiring immunity with experience, and do so as rapidly as possible. In the limiting case, only a single a single observed failure may be available for learning.
Creating the secure software testing target list
Authors: Robert A. Martin, Sean Barnum
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

Most organizations want assurance that their software has been tested for known security issues. Government, industry and academia are working together to make this more economical and effective. In addition to the obvious relevance to software development groups, acquisition groups in large government and private organizations are also moving to require that these types of testing be part of contracts. The capabilities for evaluating code, design, and architecture are maturing, however, there are currently no standards defining these types of capabilities and how to evaluate them. This lack of defined standards leaves open the question of which technique, service or tool is most appropriate for particular jobs and how effective they are at performing them.
Fuzzy Backpropagation Neural Networks for Nonstationary Data Prediction
Authors: Ramon Soto C.
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

The backpropagation neural network is one of the most widely used connectionist model, especially in the solution of real life problems. The main reasons for the popularity of this model are its conceptual simplicity and its ability to tackle a broad range of problems. But, on the other hand, this architecture shows a well known problem for dealing with nonstationary data. In this paper, a variation of feedforward neural model which uses qualitative data both for feeding the network and for back propagating the error correction is presented. The data are coded by means of a fuzzy concept of local stability.
Long-Range Monitoring System of Water-Supply Based on Multi-agent
Authors: LiZhi Yang, TingHong Zhao, JunHu Yang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

In the present Water-Supply Monitoring System, every pipe network monitoring point is distributed in the range wide, in large quantity, in long distance, and not centralized, so there is certain difficulty to control. Through bringing in the theory of Multi-Agent, this text has proposed a kind of new-type long-range Monitoring System of Water-Supply based on Multi-Agent. The system consists of Control Center Agent, Monitoring Agent Federation, as well as Inquiring-Pay Agent. Monitoring Agent Federation completes the function such as measuring and treatment of the full parameters of all the monitoring points in the entire Water-Supply system, and is responsible for sending measured data to the Control Center; After analyses and processes the received messages, Control Center Agent sends the handled data to Monitoring Agent to go on the new regulation running on the one hand, on the other hand to Inquiring-Pay Agent for users to inquire and pay. This system, which has many advantages such as communication swift and coordination convenient, is of greater practical value to the monitoring field of Water-Supply in which monitoring points are dispersed, the amount of data transmission is larger, and nobody is on duty.
Conceptual Fingerprints: Lexical Decomposition by Means of Frames --- a Neuro-cognitive Model
Authors: Wiebke Petersen, Markus Werning
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

Frames, i.e., recursive attribute-value structures, are a general format for the decomposition of lexical concepts. Attributes assign unique values to objects and thus describe functional relations. Concepts can be classified into four groups: sortal, individual, relational and functional concepts. The classification is reflected by different grammatical roles of the corresponding nouns. The paper aims at a cognitively adequate decomposition, particularly, of sortal concepts by means of frames. Using typed feature structures, an explicit formalism for the characterization of cognitive frames is developed. The frame model can be extended to account for typicality effects. Applying the paradigm of object-related neural synchronization, furthermore, a biologically motivated model for the cortical implementation of frames is developed. Cortically distributed synchronization patterns may be regarded as the fingerprints of concepts.
Practical Password-Based Authenticated Key Exchange Protocol
Authors: Shuhua Wu, Yuefei Zhu
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Due to the low entropy of human-memorable passwords, it is not easy to conduct password authenticated key agreement in a secure manner. Though there are many protocols achieving this goal, they may require a large amount of computation especially in the augmented model which is contrived to resist server compromise. In this paper, we propose a simple and efficient password authenticated key exchange protocol, which is in the augmented model. It is considered much more from the practical perspective. Moreover, the scheme is provably forward secure under the Diffie-Hellman intractability assumptions in the random-oracle model.
Automatic generation of path conditions for concurrent timed systems
Authors: Saddek Bensalem, Doron Peled, Hongyang Qu, Stavros Tripakis
Venue: Theoretical Computer Science (2008)

This paper presents an automatic method for calculating the path condition for programs with real time constraints. We model concurrent systems using timed transition systems and translate them into extended timed automata. Then an acyclic extended timed automaton is constructed and the path condition is calculated backwards over it. This method can be used for semiautomatic verification of a unit of code in isolation, i.e., without providing the exact values of parameters with which it is called. It can also be used for test case generation for real-time systems. Such a symbolic model checking algorithm was implemented previous in the PET system [E. Gunter, D. Peled, Unit checking: Symbolic model checking for a unit of code, Verification: Theory and Practice 2003, Essays Dedicated to Zohar Manna on the Occasion of his 64th Birthday, Lecture Notes in Computer Science, vol. 2772, Springer, 548-567] for untimed systems. Our method can also be used for the automatic generation of test cases for unit testing. The current generalization of the calculation of path condition for the timed case turns out to be quite tricky, since not only the selected path contributes to the path condition, but also timing constraints of alternative choices in the code.
Can the Learning Process in a Distance University Be Improved?
Authors: Elisabet Ruiz, Helena Chuliá
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

In a distance university, the materials are one key element in the learning process. The main objective of this paper is to describe a project undertaken by the Open University of Catalonia (UOC) to develop an innovative set of electronic learning materials for Introduction to Financial Mathematics. The purpose of this set of materials is twofold. First, they are designed to facilitate the learning process through content and timing. Second, they give the students a methodology to be followed when solving financial problems. In addition to describing the materials, we report on students' learning experiences using this set of electronic materials. Results show that the number of students passing the subject has increased considerably. Furthermore, the new material has helped the students become familiar with the methodology employed in solving financial problems.