ppxscal/embedding_network huggingface dataset:
Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index
Authors: Tae Sik Han, Seung-Kyu Ko, Jaewoo Kang
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

The purpose of subsequence matching is to find a query sequence from a long data sequence. Due to the abundance of applications, many solutions have been proposed. Virtually all previous solutions use the Euclidean measure as the basis for measuring distance between sequences. Recent studies, however, suggest that the Euclidean distance often fails to produce proper results due to the irregularity in the data, which is not so uncommon in our problem domain. Addressing this problem, some non-Euclidean measures, such as Dynamic Time Warping (DTW) and Longest Common Subsequence (LCS), have been proposed. However, most of the previous work in this direction focused on the whole sequence matching problem where query and data sequences are the same length. In this paper, we propose a novel subsequence matching framework using a non-Euclidean measure, in particular, LCS, and a new index query scheme. The proposed framework is based on the Dual Match framework where data sequences are divided into a series of disjoint equi-length subsequences and then indexed in an R-tree. We introduced similarity bound for index matching with LCS. The proposed query matching scheme reduces significant numbers of false positives in the match result. Furthermore, we developed an algorithm to skip expensive LCS computations through observing the warping paths. We validated our framework through extensive experiments using 48 different time series datasets. The results of the experiments suggest that our approach significantly improves the subsequence matching performance in various metrics.
Numerical Properties of Fuzzy Regions: Surface Area
Authors: Jörg Verstraete, Axel Hallez
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

This paper concerns the modelling of fuzzy information in geographic databases. In the past, a theoretical model for fuzzy regions has been presented, along with various operations useful in a geographic database: union, intersection, topology, bounding rectangle, etc. and feasible models for implementation based on this theoretical model. Now, the attention is directed at some of the problems that can occur when determining numerical properties of fuzzy regions: what type of result is expected (and desired), and how does this impact the definitions of the operations. As an example, the definition of the surface area of a fuzzy set is studied in more detail.
The Power of Choice in a Generalized Pólya Urn Model
Authors: Gregory B. Sorkin
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We establish some basic properties of a "Pólya choice" generalization of the standard Pólya urn process. From a set of k urns, the ith occupied by n i balls, choose c distinct urns i 1,...,i c with probability proportional to $n_{i_1}^\gamma \times \cdots\times n_{i_c}^\gamma$, where ¿> 0 is a constant parameter, and increment one with the smallest occupancy (breaking ties arbitrarily). We show that this model has a phase transition. If 0 < ¿< 1, the urn occupancies are asymptotically equal with probability 1. For ¿> 1, this still occurs with positive probability, but there is also positive probability that some urns get only finitely many balls while others get infinitely many.
Automated Web Services Composition with the Event Calculus
Authors: Onur Aydın, Nihan Kesim Cicekli, Ilyas Cicekli
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

As the web services proliferate and complicate it is becoming an overwhelming job to manually prepare the web service compositions which describe the communication and integration between web services. This paper analyzes the usage of the Event Calculus, which is one of the logical action-effect definition languages, for the automated preparation and execution of web service compositions. In this context, abductive planning capabilities of the Event Calculus are utilized. It is shown that composite process definitions in OWL-S can be translated into Event Calculus axioms so that planning with generic process definitions is possible within this framework.
Prediction of Binding Sites in HCV Protein Complexes Using a Support Vector Machine
Authors: Taihui Yoo, Jaetak Lee, Kyungsook Han
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Hepatitis C virus (HCV) infection is a major cause of liver disease and a dangerous threat to public health. Hence, the problem of interactions between HCV and human proteins has received much attention. In the present study, we propose a support vector machine (SVM) model for predicting the binding residues in HCV protein complexes. The SVM model achieved an average sensitivity of 76.06% and specificity of 75.94% for 18 non-redundant HCV protein complexes. This approach can efficiently search potential protein-binding sites in proteins and a wide range of protein-protein interaction sites.
Design, Prototype, and Evaluation of a Network Monitoring Library
Authors: Karl-André Skevik, Vera Goebel, Thomas Plagemann
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

This article describes a library for customization of overlays. The custcom library optimizes and maintains the results of network measurement operations, allowing applications to specify requests for how to prioritize overlay nodes in an abstract manner, without having to implement network measurements operations in order to achieve network awareness.The library is used in the context of the Autonomic Network Architecture (ANA) project where application functionality is implemented in independent units called bricks. A network latency measurement brick and a node monitoring brick have been implemented using the custcom library. The custcom optimization code has been tested with a real-world dataset, demonstrating how it can reduce network overhead and measurement time.
Gaining Insights into Laser Pulse Shaping by Evolution Strategies
Authors: Ofer M. Shir, Joost N. Kok, Thomas Bäck, Marc J. Vrakking
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

We consider the numerical evolutionary optimization of dynamic molecular alignment by shaped femtosecond laser pulses. We study a simplified model of this quantum control problem, which allows the full physical investigation of the optimal solutions. By using specific variants of Derandomized Evolution Strategies, subject to parameterizations which are known to be superior for this problem, the numerical results reveal different conceptual physics structures for the different optimization procedures. These results are strong both from the algorithmic as well as from the physics perspectives. This shows that Natural Computing techniques can be used to derive new insights into Physics.
Quantifying Breast Thickness for Density Measurement
Authors: Jennifer Diffey, Alan Hufton, Christine Beeston, Julia Smith, Tom Marchant, Susan Astley
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

The largest source of error in the estimation of volumetric breast density typically arises from inaccuracies in the measurement of breast thickness. We present a method which accounts for paddle tilt and show that the variation within the compressed breast region may be as much as 21.2mm in the chest wall to nipple direction. The system-indicated value of breast thickness results in an average underestimation of compressed breast volume of 10.5% which has implications for density measurement. Paddle deformation in the lateral direction is shown to be insignificant in comparison. A method of modelling the thickness at the breast periphery is presented with examples of the thickness maps generated.
Conditioned semantic slicing for abstraction; industrial experiment
Authors: Martin Ward, Hussein Zedan, Matthias Ladkau, Stefan Natelberg
Venue: Software&mdash;Practice Experience (2008)

One of the most challenging tasks a programmer can face is attempting to analyse and understand a legacy assembler system. Many features of assembler make analysis difficult, and these are the same features that make migration from assembler to a high-level language difficult. In this paper, we discuss the application of program transformation technology to assist with analysing and understanding legacy assembler systems. We briefly introduce the fundamentals of our program transformation theory and program slicing, which generalizes to conditional semantic slicing. These transformations are applied to a large commercial assembler system to automatically generate high-level abstract descriptions of the behaviour of each assembler module, with error handling code sliced away. The assembler system was then migrated to C. The result is a dramatic improvement in the understandability of the programs; on average a 6000-line assembler listing is condensed down to a 132-line high-level language abstraction. A second case study, involving over one million lines of source code from many different assembler systems, showed equally dramatic results. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A New Web Services Model Based on CORBA and Push Technology in Network Management System
Authors: Jingyang Wang, Xiaohong Wang, Liwei Guo, Min Huang, Huiyong Wang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Because the traditional network management model based on Web and CORBA which adopts pull technology can not obtain info actively and in time, this paper put forward a new Web services model based on CORBA and push technology in network management system, which combines information push technology with CORBA notification service. This model changes the passive status of server and implements network management in an active style. It can push the trap information to manager actively through the TCP connection established when logging in. Compared with the traditional Web and CORBA based network management model, it has advantages of high efficiency, low time delay, and can save network bandwidth and CPU time. Furthermore, it is important for the manager to acquire alarm information in time.
Implementing the COntext INterchange (COIN) Approach through Use of Semantic Web Tools
Authors: Mihai Lupu, Stuart Madnick
Venue: Semantic Web, Ontologies and Databases: VLDB Workshop, SWDB-ODBIS 2007, Vienna, Austria, September 24, 2007, Revised Selected Papers (2008)

The COntext INterchange (COIN) strategy is an approach to solving the problem of interoperability of semantically heterogeneous data sources through context mediation. The existing implementation of COIN uses its own notation and syntax for representing ontologies. More recently, the OWL Web Ontology Language is becoming established as the W3C recommended ontology language. A bridge is needed between these two areas and an explanation on how each of the two approaches can learn from each other. We propose the use of the COIN strategy to solve context disparity and ontology interoperability problems in the emerging Semantic Web both at the ontology level and at the data level. In this work we showcase how the problems that arise from context-dependant representation of facts can be mitigated by Semantic Web techniques, as tools of the conceptual framework developed over 15 years of COIN research.
Multi-resolution parametric synthesis of manipulative dynamic textures
Authors: Leilei Xu
Venue: Computer Animation and Virtual Worlds (2008)

Dynamic textures are composed of spatially multi-scale and temporally coherent visual signals. In this paper, we propose a novel approach for multi-resolution parametric synthesis (MPS) of manipulative dynamic textures, including learning, analysis, and motion manipulation of layered feature spaces. The proposed approach separates the motions into different scales or frequencies, and the dynamic feature spaces are analyzed in modeling and then mapped to a global coordinate system to expose the multi-scale structures. Our approach emphasizes the importance of fine-scale data appearing more informative, while coarse signals are less focused. The synthesized dynamic textures using our MPS approach are strongly enhanced in dynamic appearance than the single-scale LDS model, and also flexible in manipulating the decomposed feature spaces for creating different dynamic textures of the real world. Our experimental results showed the more faithful synthesized dynamic textures from input short videos, and their manipulative controls by simple editing of feature space basis, not only the whole video data. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A Weakly 2-Random Set That Is Not Generalized Low
Authors: Andrew Lewis, Antonio Montalbán, André Nies
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2-randomness. Recent research indicates that the first alternative holds. We add further evidence in this direction by showing that, in contrast to the case for 2-randomness, a weakly 2-random set can fail to be generalized low.
Identifying Acceptable Common Proposals for Handling Inconsistent Software Requirements
Authors: Kedian Mu, Zhi Jin
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

The requirements specifications of complex systems are increasingly developed in a distributed fashion. It makes inconsistency management necessary during the requirements stage. However, identifying appropriate inconsistency handling proposals is still an important challenge. In particular, for inconsistencies involving many different stakeholders with different concerns, it is difficult to reach an agreement on inconsistency handling. To address this, this paper presents a vote-based approach to choosing acceptable common proposals for handling inconsistency. This approach focuses on the inconsistency in requirements that results from conflicting intentions of stakeholders. Informally speaking, we consider each distinct stakeholder (or a distributed artifact) involved in the inconsistency as a voter. Then we transform identification of an acceptable common proposal into a problem of combinatorial vote. Based on each stakeholder's preferences on the set of proposals, an acceptable common proposal is identified in an automated way according to a given social vote rule.
Orientation-Aware Indoor Localization Path Loss Prediction Model for Wireless Sensor Networks
Authors: Marc Lihan, Takeshi Tsuchiya, Keiichi Koyanagi
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

There have been a large amount of research and interest in the area of ubiquitous and indoor location aware computing in the past decade. Among several proposed algorithms, fingerprint algorithm stands as one of the most accurate systems for localization. However, there is a lack of theoretical basis and understanding on the orientation of the user. This paper presents a model for orientation-aware indoor location tracking system using a Zigbee based protocol wireless sensor called Sun's SPOT (Small Programmable Object Technology). Our experiment shows better accuracy in location tracking when orientation and attenuation factors are considered for the path loss prediction model than the traditional path loss model. Orientation-aware fingerprint algorithm is also examined in our experiment to have a basis of comparison on an empirical algorithm.
A Model of Motivation for Virtual-Worlds Avatars
Authors: Genaro Rebolledo-Mendez, David Burden, Sara Freitas
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

This paper presents a model of motivation for AI-driven avatars in virtual worlds. This work aims at providing the avatar with motivational capabilities to detect and react to different motivational states aiming to enhance and maintain user's motivation. The algorithm and its associated rules are presented. Future work consists of assessing this model in virtual world applications in the context of a quiz.
Efficient and Scalable Induction of Logic Programs Using a Deductive Database System
Authors: Michel Ferreira, Nuno A. Fonseca, Ricardo Rocha, Tiago Soares
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

A consequence of ILP systems being implemented in Prolog or using Prolog libraries is that, usually, these systems use a Prolog internal database to store and manipulate data. However, in real-world problems, the original data is rarely in Prolog format. In fact, the data is often kept in Relational Database Management Systems (RDBMS) and then converted to a format acceptable by the ILP system. Therefore, a more interesting approach is to link the ILP system to the RDBMS and manipulate the data without converting it. This scheme has the advantage of being more scalable since the whole data does not need to be loaded into memory by the ILP system. In this paper we study several approaches of coupling ILP systems with RDBMS systems and evaluate their impact on performance. We propose to use a Deductive Database (DDB) system to transparently translate the hypotheses to relational algebra expressions. The empirical evaluation performed shows that the execution time of ILP algorithms can be effectively reduced using a DDB and that the size of the problems can be increased due to a non-memory storage of the data.
A Study of Feedback Strategies in Foreign Language Classrooms and Tutorials with Implications for Intelligent Computer-Assisted Language Learning Systems
Authors: Anita Ferreira, Johanna D. Moore, Chris Mellish
Venue: International Journal of Artificial Intelligence in Education (2007)

This paper presents two new corpus-based studies of feedback in the domain of teaching Spanish as a foreign language, concentrating on the type and frequency of different feedback moves, as well as what happens in the moves that follow the feedback. In particular, as well as looking at positive feedback, it concentrates on two general kinds of negative feedback strategies: (1) Giving-Answer Strategies (GAS), where the teacher directly gives the desired target form or indicates the location of the error, and (2) Prompting-Answer Strategies (PAS), where the teacher pushes the student less directly to notice and repair their own error. Investigating the GAS/PAS distinction sheds light on the relative importance for Intelligent Computer-Assisted Language Learning (ICALL) systems of knowledge construction from interaction, which many believe is crucial for effective learning from ITS. The main finding here is that, although GAS occur more frequently than PAS in both corpora, it is the PAS that are more effective, in terms of eliciting explicit repairs by the students. The first study takes place in a classroom context, whereas the second, smaller, study looks at tutorial interactions. This makes it possible to investigate the extent to which the mode of interaction influences the frequency and effectiveness of feedback moves, as well as to look at how concepts such as "wait time" are relevant to explain moves that are ineffective. The paper concludes by using these results to make recommendations about how to choose appropriate feedback moves in ICALL systems.
Using ASM to Achieve Executability within a Family of DSL
Authors: Ileana Ober, Ali Abou Dib
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

We propose an approach to achieve interoperability in a family of domain specific language based on the use of their ASM semantics and of the category theory. The approach is based on the construction of a unifying language of the family, by using categorical colimits. Since the unifying language is obtained by construction, translators to this one are obtained easily. These are the premises for using ASM tools for symbolically executing systems made of components specified in domain specific languages of a same family.
Processes of membrane systems with promoters and inhibitors
Authors: Jetty Kleijn, Maciej Koutny
Venue: Theoretical Computer Science (2008)

Membrane systems (with promoters and inhibitors) are a computational model inspired by the way living cells are divided by membranes into compartments where chemical reactions may take place. We consider synchrony and asynchrony between executed reactions in the computations of such systems using Petri nets and their processes as a formal behavioural model. We first discuss different definitions of individual computational steps, and show how they can be rendered within the Petri net domain by assigning all transitions localities corresponding to the compartments, and using activator and inhibitor arcs. The non-sequential semantics of the resulting nets is formalised through processes based on occurrence nets augmented with additional information about localities and activator/inhibitor arcs. Such processes provide a convenient tool for analysing synchrony and asynchrony in the executions of membrane systems and shed light on the causal relationships between the reactions taking place.
Automated Verification of Dense-Time MTL Specifications Via Discrete-Time Approximation
Authors: Carlo A. Furia, Matteo Pradella, Matteo Rossi
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

This paper presents a verification technique for dense-time MTL based on discretization. The technique reduces the validity problem of MTL formulas from dense to discrete time, through the notion of sampling invariance, introduced in previous work [13]. Since the reduction is from an undecidable problem to a decidable one, the technique is necessarily incomplete, so it fails to provide conclusive answers for some formulas. The paper discusses this shortcoming and hints at how it can be mitigated in practice. The verification technique has been implemented on top of the ¿ot tool [19] for discrete-time bounded validity checking; the paper also reports on in-the-small experiments with the tool, which show some results that are promising in terms of performance.
Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
Authors: Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi, Allen Clement
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

We present a general implementation for providing the properties of digital signatures using MACs in a system consisting of any number of untrusted clients and n servers, up to f of which are Byzantine. At the heart of the implementation is a novel matrix signature that captures the collective knowledge of the servers about the authenticity of a message. Matrix signatures can be generated or verified by the servers in response to client requests and they can be transmitted and exchanged between clients independently of the servers. The implementation requires that no more than one third of the servers be faulty, which we show to be optimal. The implementation places no synchrony requirements on the communication and only require fair channels between clients and servers.