ppxscal/embedding_network huggingface dataset:
From Analysis to Design
Authors: Bruce H. Krogh
Venue: Proceedings of the 5th international conference on Formal Modeling and Analysis of Timed Systems (2007)

Research in formal methods has emphasized analysis techniques for system verification and testing. Despite the successful and growing integration of tools using formal methods into production design flows, there is very limited use of formal methods for design per se. This is understandable, given the considerable complexity of synthesis relative to analysis. Direct synthesis may not be the only way formal methods could contribute more significantly to design, however. Most tools used for design are actually analysis tools that have been extended in various ways to provide information useful for design, such as sensitivities from numerical optimization and simulation. Using embedded control systems as an application context, this plenary talk will review how analysis tools, including formal methods, are currently used in the design flow. We will then suggest research directions for strengthening the use of formal methods for design. One approach will be illustrated using extensions to a recently developed abstraction-based method for verifying linear hybrid automata with a large number of continuous state variables.
Synthesis of quaternary reversible/quantum comparators
Authors: Mozammel H. A. Khan
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

Multiple-valued quantum circuits are promising choices for future quantum computing technology, since they have several advantages over binary quantum circuits. Quaternary logic has the advantage that classical binary functions can be very easily represented as quaternary functions by grouping two bits together into quaternary values. Grover's quantum search algorithm requires a sub-circuit called oracle, which takes a set of inputs and gives an output stating whether a given search condition is satisfied or not. Equality, less-than, and greater-than comparisons are widely used as search conditions. In this paper, we show synthesis of quaternary equality, less-than, and greater-than comparators on the top of ion-trap realizable 1-qudit gates and 2-qudit Muthukrishnan-Stroud gates.
Multi-Agent System for Collaboration in Hybrid Control
Authors: Dariusz Choiński, Witold Nocoń, Mieczyslaw Metzger
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Research and design in novel branches of technology usually require experts with different skills to cooperate on the same project. Participation of external experts is crucial for the best possible results of any significant experimentations and research. Successive iterations in these tasks need flexible validation. An ontology-based Multi-Agent System augmented with Web engineering is proposed for validation of hybrid control of biotechnological plant. For acquiring knowledge through Web, the proposed system carries out reduction, selection and validation of data and of its structures and then reconfiguration of multi agent hybrid control system.
Principal Typings for Explicit Substitutions Calculi
Authors: Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Having principal typings (for short PT) is an important property of type systems. In simply typed systems, this property guarantees the possibility of a complete and terminating type inference mechanism. It is well-known that the simply typed ¿-calculus has this property but recently J.B. Wells has introduced a system-independent definition of PT, which allows to prove that some type systems, e.g. the Hindley/Milner type system, do not satisfy PT. Explicit substitutions address a major computational drawback of the ¿-calculus and allow the explicit treatment of the substitution operation to formally correspond to its implementation. Several extensions of the ¿-calculus with explicit substitution have been given but some of which do not preserve basic properties such as the preservation of strong normalization. We consider two systems of explicit substitutions (¿s e and ¿¿) and show that they can be accommodated with an adequate notion of PT. Specifically, our results are as follows:¿ We introduce PT notions for the simply typed versions of the ¿s e - and the ¿¿-calculi and prove that they agree with Wells' notion of PT.¿ We show that these versions satisfy PT by revisiting previously introduced type inference algorithms.
A People Counting System Based on Dense and Close Stereovision
Authors: Tarek Yahiaoui, Cyril Meurie, Louahdi Khoudour, François Cabestaing
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

We present in this paper a system for passengers counting in buses based on stereovision. The objective of this work is to provide a precise counting system well adapted to buses environment. The processing chain corresponding to this counting system involves several blocks dedicated to the detection, segmentation, tracking and counting. From original stereoscopic images, the system operates primarily on the information contained in disparity maps previously calculated with a novel algorithm. We show that one can obtain a counting accuracy of 99% on a large data set including specific scenarios played in laboratory and on some video sequences shot in a bus during exploitation period.
The Agents' Attitudes in Fuzzy Constraint Based Automated Purchase Negotiations
Authors: Miguel A. Lopez-Carmona, Juan R. Velasco, Ivan Marsa-Maestre
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

In this paper we present an experimental analysis of a fuzzy constraint based framework for automated purchase negotiations in competitive trading environments. The main goal of this work is to show by experimental analysis which combination of different agents' negotiation attitudes allows buyer and seller agents to improve the multi-attribute bilateral negotiation processes. Agents' attitudes are related to the agents' strategic behaviour in the negotiation process, where strategic behaviours are described in terms of expressiveness and receptiveness.
Enhancing Automated Test Selection in Probabilistic Networks
Authors: Danielle Sent, Linda C. Gaag
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Most test-selection algorithms currently in use with probabilistic networks select variables myopically, that is, test variables are selected sequentially, on a one-by-one basis, based upon expected information gain. While myopic test selection is not realistic for many medical applications, non-myopic test selection, in which information gain would be computed for all combinations of variables, would be too demanding. We present three new test-selection algorithms for probabilistic networks, which all employ knowledge-based clusterings of variables; these are a myopic algorithm, a non-myopic algorithm and a semi-myopic algorithm. In a preliminary evaluation study, the semi-myopic algorithm proved to generate a satisfactory test strategy, with little computational burden.
The Most Reliable Subgraph Problem
Authors: Petteri Hintsanen
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

We introduce the problem of finding the most reliable subgraph: given a probabilistic graph G subject to random edge failures, a set of terminal vertices, and an integer K find a subgraph H ¿ G having K fewer edges than G, such that the probability of connecting the terminals in H is maximized. The solution has applications in link analysis and visualization. We begin by formally defining the problem in a general form, after which we focus on a two-terminal, undirected case. Although the problem is most likely computationally intractable, we give a polynomial-time algorithm for a special case where G is seriesparallel. For the general case, we propose a computationally efficient greedy heuristic. Our experiments on simulated graphs illustrate the usefulness of the concept of most reliable subgraph, and suggest that the heuristic for the general case is quite competitive.
Valuing Asian options using the finite element method and duality techniques
Authors: Georgios Foufas, Mats G. Larson
Venue: Journal of Computational and Applied Mathematics (2008)

The main objective of this paper is to develop an adaptive finite element method for computation of the values, and different sensitivity measures, of the Asian option with both fixed and floating strike. The pricing is based on Black-Scholes PDE-model and a method developed by Vecer where the resulting PDEs are of parabolic type in one spatial dimension and can be applied to both continuous and discrete Asian options. We propose using an adaptive finite element method which is based on a posteriori estimates of the error in desired quantities, which we derive using duality techniques. The a posteriori error estimates are tested and verified, and are used to calculate optimal meshes for each type of option. The use of adapted meshes gives superior accuracy and performance with less degrees of freedom than using uniform meshes. The suggested adaptive finite element method is stable, gives fast and accurate results, and can be applied to other types of options as well.
Adaptive classification of temporal signals in fixed-weight recurrent neural networks: An existence proof
Authors: Ivan Y. Tyukin, Danil Prokhorov, Cees van Leeuwen
Venue: Neural Computation (2008)

Recurrent neural networks with fixed weights have been shown in practice to successfully classify adaptively signals that vary as a function of time in the presence of additive noise and parametric perturbations. We address the question: Can this ability be explained theoretically? We provide a mathematical proof that these networks have this ability even when parametric perturbations enter the signals nonlinearly. The restrictions that we impose on the signals to be classified are that they satisfy an assumption of nondegeneracy and that noise amplitude is sufficiently small. Further, we demonstrate that the recurrent neural networks may not only classify uncertain signals adaptively but also can recover the values of uncertain parameters of the signals, up to their equivalence classes.
Characterizing Relations between Architectural Views
Authors: Nelis Boucké, Danny Weyns, Rich Hilliard, Tom Holvoet, Alexander Helleboogh
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

It is commonly agreed that an architectural description (AD) consists of multiple views. Each view describes the architecture from the perspective of particular stakeholder concerns. Although views are constructed separately, they are related as they describe the same system.A thorough study of the literature reveals that research on relations between views is fragmented and that a comprehensive study is hampered by an absence of common terminology. This has become apparent in the discussion on inter-view relational concepts in the revision of IEEE 1471 as ISO/IEC 42010 (Systems and Software Engineering -- Architectural Description).This paper puts forward a framework that employs a consistent terminology to characterize relations between views. The framework sheds light on the usage, scope and mechanisms for relations, and is illustrated using several representative approaches from the literature. We conclude with a reflection on whether the revision of ISO 42010 aligns with our findings.
A Framework for Managing Multimodal Digitized Music Collections
Authors: Frank Kurth, David Damm, Christian Fremerey, Meinard Müller, Michael Clausen
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

In this paper, we present a framework for managing heterogeneous, multimodal digitized music collections containing visual music representations (scanned sheet music) as well as acoustic music material (audio recordings). As a first contribution, we propose a preprocessing workflow comprising feature extraction, audio indexing, and music synchronization (linking the visual with the acoustic data). Then, as a second contribution, we introduce novel user interfaces for multimodal music presentation, navigation, and content-based retrieval. In particular, our system offers high quality audio playback with time-synchronous display of the digitized sheet music. Furthermore, our system allows a user to select regions within the scanned pages of a musical score in order to search for musically similar sections within the audio documents. Our novel user interfaces and search functionalities will be integrated into the library service system of the Bavarian State Library as part of the Probado project.
On the Virtues of Generic Programming for Symbolic Computation
Authors: Xin Li, Marc Moreno Maza, Éric Schost
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM high-level algorithms, such as polynomial factorization. More precisely, given a high-level AXIOMpackage P parametrized by a univariate polynomial domain U, we have compared the performances of P when applied to different U's, including an AXIOM wrapper for our C level code.Our experiments show that when P relies on U for its univariate polynomial computations, our specialized C level code can provide a significant speed-up. For instance, the improved implementation of square-free factorization in AXIOM is 7 times faster than the one in Maple and very close to the one in MAGMA. On the contrary, when P does not rely much on the operations of U and implements its private univariate polynomial operation, then P cannot benefit from our highly optimized C level code. Consequently, code which is poorly generic reduces the speed-up opportunities when applied to highly efficient and specialized
Requirements Modeling and Validation Using Bi-layer Use Case Descriptions
Authors: Avik Sinha, Matthew Kaplan, Amit Paradkar, Clay Williams
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Extension of the modeling notations and formal languages for use case description are the commonly suggested solutions for adding precision to use case models. Practitioners have often argued against adoption of such techniques citing reasons like the steep learning curve for formal languages; and the quickness in using imprecise use case descriptions for communicating to different stake-holders of the system. In this paper we introduce the Archetest modeling environment, which through a unique bi-layer approach accepts use case descriptions in their imprecise form and then assists in adding precision through a wizard driven process. Thereby, it lends itself to both quick and precise modeling. Also the two forms of the use case models are self contained and cross-linked. This allows different modelers, the precise and the imprecise, to collaborate and also supports stake-holder specific feedbacks of the automated analysis. We describe the structure of Archetest's use case models, and show how these models are amenable to automated processing. We present a case study which reports on typical modeling times using Archetest and demonstrates its scalability.
Busy person patterns
Authors: James F. Kile, Donald J. Little, Samir Shah
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

This paper presents thirteen patterns that, when used together, we have found helpful to manage our busy lives. Recording these patterns in a format that others can both understand and use is the result of an assignment for a course on Patterns at Pace University with instructors Dr. Joe Bergin and Dr. Fred Grossman. Surprisingly, many of these patterns have general applicability to other areas of study. <u>Good Enough</u>, for example, draws from Linda Rising's same-named pattern for software development [1]. Others, like <u>Just Start</u>, can be found in various forms in other pattern languages (e.g. Coplien and Harrison's Get On With It [2] or Manns and Rising's Just Do It [3]).
Space-Time Coded MB-OFDM UWB System with Multi-channel Estimation for Wireless Personal Area Networks
Authors: Bon-Wook Koo, Myung-Sun Baek, Jee-Hoon Kim, Hyoung-Kyu Song
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, we apply multiple antennas to MB-OFDM UWB system for high performance. With an emphasis on a preamble design for multi-channel separation, we address the channel estimation in MB-OFDM system with multiple antennas. By properly designing each preamble for multiple antennas to be orthogonal in time domain, the channel estimation can be applied to the MB-OFDM proposal for IEEE 802.15.3a standard in the case of more than 2 transmit antennas. By using the multi-antenna scheme and proposed channel estimation technique, the reliability and performance of MB-OFDM system can be improved.
A Dynamic Hashing Approach to Supporting Load Balance in P2P Systems
Authors: Ye-In Chang, Hue-Ling Chen, Sih-Ning Li, Hung-Ze Liu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In a structured P2P system, peers maintain information about what resources neighbor peers offer. Chord is one of well-known structured P2P systems to efficiently support resource finding based on the hashing approach. However, in Chord, most of data keys may be assigned to the same peer, since it uses the static hashing scheme, resulting in the case that the load of Chord is unbalanced. Therefore, we propose a strategy which uses the dynamic hashing scheme to locate the data key based on the Chord architecture, and to maintain the load balance. From our simulation results, we show that the load of the P2P system based on our strategy is much more balanced than that based on the original strategy used in Chord.
ACL Semantics Between Social Commitments and Mental Attitudes
Authors: Guido Boella, Rossana Damiano, Joris Hulstijn, Leendert Torre
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

There are two main traditions in defining a semantics for agent communication languages, based either on mental attitudes or on social commitments. In this paper, we translate both traditions in a different approach in which the dialogue state is represented by the beliefs and goals publicly attributed to the roles played by the dialogue participants. On the one hand, this approach avoids the problems of mentalistic semantics, such as the unverifiability of private mental states. On the other hand, it allows to reuse the logics and implementations developed for FIPA compliant approaches.
Abstractions of Multi-agent Systems
Authors: Constantin Enea, Catalin Dima
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

With the recent development of many model-checkers for the temporal logic of knowledge, abstraction techniques are necessary to increase the size of the systems that can be verified. In this paper, we introduce several abstraction techniques for interpreted systems and we prove several preservation results. These results consider the temporal logic of knowledge under Kleene's 3-valued interpretation along infinite and maximal finite paths.
Performance implications of virtualizing multicore cluster machines
Authors: Adit Ranadive, Mukil Kesavan, Ada Gavrilovska, Karsten Schwan
Venue: Proceedings of the 2nd workshop on System-level virtualization for high performance computing (2008)

High performance computers are typified by cluster machines constructed from multicore nodes and using high performance interconnects like Infiniband. Virtualizing such 'capacity computing' platforms implies the shared use of not only the nodes and node cores, but also of the cluster interconnect (e.g., Infiniband). This paper presents a detailed study of the implications of sharing these resources, using the Xen hypervisor to virtualize platform nodes and exploiting Infiniband's native hardware support for its simultaneous use by multiple virtual machines. Measurements are conducted with multiple VMs deployed per node, using modern techniques for hypervisor bypass for high performance network access, and evaluating the implications of resource sharing with different patterns of application behavior. Results indicate that multiple applications can share the cluster's multicore nodes without undue effects on the performance of Infiniband access and use. Higher degrees of sharing are possible with communication-conscious VM placement and scheduling.
What Are You Feeling? Investigating Student Affective States During Expert Human Tutoring Sessions
Authors: Blair Lehman, Melanie Matthews, Sidney D'Mello, Natalie Person
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

One-to-one tutoring is an extremely effective method for producing learning gains in students and for contributing to greater understanding and positive attitudes towards learning. However, learning inevitably involves failure and a host of positive and negative affective states. In an attempt to explore the link between emotions and learning this research has collected data on student affective states and engagement levels during high stakes learning in one-to-one expert tutoring sessions. Our results indicate that only the affective states of confusion, happiness, anxious, and frustration occurred at significant levels. We also investigated the extent to which expert tutors adapt their pedagogical and motivational strategies in response to learners' affective and cognitive states.
Providing Integrated Development Environments for Multi-Agent Systems
Authors: Simon Lynch, Keerthi Rajendran
Venue: Proceedings of the 6th German conference on Multiagent System Technologies (2008)

The computing industry has yet to take up agent technology as a new approach to software development. While other paradigms are supported by various tools, including generic IDEs, these are not well developed for agent-ware. Many agent platforms provide some form of IDE but these are platform-specific and are typically so tightly coupled to their agent platforms that they offer little re-use. There has been too little discussion about which tools an IDE should contain and few attempts to produce a generic IDE. In this paper, we identify two levels of abstraction requiring IDE tool support and draw on current research to categorise a set of generic tools for each level. We describe the reasons why existing MAS IDEs are coupled to their platforms and present an extendible software architecture which avoids this coupling. We build an IDE using this architecture and demonstrate its decoupling and extensibility by experimentation.