ppxscal/embedding_network huggingface dataset:
Verification of COMDES-II Systems Using UPPAAL with Model Transformation
Authors: Xu Ke, Paul Pettersson, Krzysztof Sierszecki, Christo Angelov
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

COMDES-II is a component-based software framework intended for model-integrated development of embedded control systems with hard real-time constraints. It provides various kinds of component models to address critical domain-specific issues, such as real-time concurrency and communication in a timed multitasking environment, modal continuous operation combining reactive control behavior with continuous data processing, etc., by following the principle of separation-of-concerns. In the paper we pesent a transformational approach to the formal verification of both timing and reactive behaviors of COMDES-II systems using UPPAAL, based on a semantic anchoring methodology. The proposed approach adopts UPPAAL timed automata as the semantic units, to which different behavioral concerns of COMDES-II are anchored, such that a COMDES-II system can be precisely specified in UPPAAL, and verified against a set of desired requirements with the preservation of system original operation semantics.
LISP history
Authors: Herbert Stoyan
Venue: Issue 3 (December 1979) (1979)

For the SIGPLAN conference on history of programming languages held in Los Angeles in this June, J. McCarthy had to write a paper about LISP-history (1). He was very able to do this because he has given a talk on LISP history in summer 1974 at M.I.T. (2) and has contributed since then a lot of remarks and comments to my work on compiling a complete history of our language. His paper corresponds to the state of our knowledge in May of this year (1978) before D. Park found the original LISP 1 manual (3).
On an infinite family of solvable Hanoi graphs
Authors: Dany Azriel, Noam Solomon, Shay Solomon
Venue: ACM Transactions on Algorithms (TALG) (2008)

The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs of this graph. An optimal solution for such a graph G is an algorithm that completes the task of moving a tower of any given number of disks from S to D in a minimal number of disk moves. In this article we present an algorithm which solves the problem for two infinite families of graphs, and prove its optimality. To the best of our knowledge, this is the first optimality proof for an infinite family of graphs. Furthermore, we present a unified algorithm that solves the problem for a wider family of graphs and conjecture its optimality.
Information Exchange for Controlling Internet Robots
Authors: Soon Hyuk Hong, Ji-Hwan Park, Key Ho Kwon, Jae Wook Jeon
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In order to control a remote robot over the internet, the operator needs to be able to exchange information with it in real-time. However, the camera image generally used for providing feedback information is too large to send in real-time over the internet. Furthermore, it takes a long time for the operator to send complex robot commands repetitively. These time delays in exchanging feedback and command information between the remote robot and its operator make it difficult to control internet robots efficiently. This paper proposes an information exchange technique for controlling a remote robot over the internet, in which the desired information is extracted from the image in order to reduce the time required to send the feedback information, and a task-level command is used to reduce the time required to send the robot commands. As a result, the proposed technique can help an operator to control a remote robot in real-time over the internet.
Performance analysis of antipodal modulated direct sequence ultra-wide bandwidth
Authors: Shahab Asoodeh
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

Ultra-wide bandwidth radio systems are considered as proper candidate of multi access wireless communication due to its high bit rate and low power consumption. In these systems, data is transmitted through extremely narrow pulses with duration less than 1ns instead of sinusoidal carriers. In this paper the direct sequence ultra-wide bandwidth systems with antipodal modulation are analyzed. The performance of these systems in the dense multiple access fading environments is studied and simulated using PRAKE (Partial RAKE) receiver. Results show that direct sequence ultra-wide bandwidth systems can reach error probability of 10-5 even in the strong fading channels and the performance of these systems can be ameliorated up to 12dB if the branches of RAKE receiver be increased to 10.
Supporting OpenMP on Cell
Authors: Kevin O'Brien, Kathryn O'Brien, Zehra Sura, Tong Chen, Tao Zhang
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

The Cell processor is a heterogeneous multi-core processor with one Power Processing Engine (PPE) core and eight Synergistic Processing Engine (SPE) cores. Each SPE has a directly accessible small local memory (256K), and it can access the system memory through DMA operations. Cell programming is complicated both by the need to explicitly manage DMA data transfers for SPE computation, as well as the multiple layers of parallelism provided in the architecture, including heterogeneous cores, multiple SPE cores, multithreading, SIMD units, and multiple instruction issue. There is a significant amount of ongoing research in programming models and tools that attempts to make it easy to exploit the computation power of the Cell architecture. In our work, we explore supporting OpenMP on the Cell processor. OpenMP is a widely used API for parallel programming. It is attractive to support OpenMP because programmers can continue using their familiar programming model, and existing code can be re-used. We base our work on IBM's XL compiler, which already has OpenMP support for AIX multi-processor systems built with Power processors. We developed new components in the XL compiler and a new runtime library for Cell OpenMP that utilizes the Cell SDK libraries to target specific features of the new hardware platform. To describe the design of our Cell OpenMP implementation, we focus on three major issues in our system: 1) how to use the heterogeneous cores and synchronization support in the Cell to optimize OpenMP threads; 2) how to generate thread code targeting the different instruction sets of the PPE and SPE from within a compiler that takes single-source input; 3) how to implement the OpenMP memory model on the Cell memory system. We present experimental results for some SPEC OMP 2001 and NAS benchmarks to demonstrate the effectiveness of this approach. Also, we can observe detailed runtime event sequences using the visualization tool Paraver, and we use the insight into actual thread and synchronization behaviors to direct further optimizations.
A Ticking Clock: Performance Analysis of a Circadian Rhythm with Stochastic Process Algebra
Authors: Jeremy T. Bradley
Venue: Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering (2008)

We apply performance analysis techniques to a biological modelling problem, that of capturing and reproducing the Circadian rhythm. A Circadian rhythm provides cells with a clock by which to regulate their behaviour. We consider two distinct stochastic models of the Circadian rhythm --- one unbounded and the other bounded. We consider a fluid approximation of the models, and, by conversion to a set of ordinary differential equations, we are able to reproduce the correct rhythm. We show that with a bounded model, the clock phase can be affected by modifying the ability to manufacture some proteins.
Coordinated Exploration in Conflicting Multi-stage Games
Authors: Maarten Peeters, Ville Könönen, Katja Verbeeck, Sven Segbroeck, Ann Nowé
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

The analysis of the collective behavior of agents in a distributed multi-agent environment received a lot of attention in the past decade. More accurately, coordination was studied intensely because it enables agents to converge to Pareto optimal solutions and Nash equilibria. Most of these studies focussed on team games. In this paper we report on a technique for finding fair solutions in conflicting interest multi-stage games. Our hierarchical periodic policies algorithm is based on the characteristics of a homo egualis society in which the players also care about the proportional distribution of the pay-off in relation to the pay-off of the other players. This feature is built into a hierarchy of learning automata which is suited for playing sequential decision problems.
Query-trail-mediated topology reconstruction for exploring performance trade-off in unstructured P2P networks
Authors: Kei Ohnishi, Satoshi Nagamatsu, Yuji Oie
Venue: International Journal of Hybrid Intelligent Systems (2008)

This paper presents a topology reconstruction method to explore better trade-off points between search and access load balancing performance in unstructured Peer-to-Peer (P2P) file sharing networks. The proposed topology reconstruction method changes a network topology in a dynamic, autonomous, and decentralized manner. The topology reconstruction is based on local threshold-based rules that use query trails, which stand for information on previous successful search paths. The scenario for the evaluation of the proposed method is that the topology reconstruction method consisting of the local threshold-based rules operates to explore the performance trade-off in the situation that new kinds of files are about to spread over a power-law network. The simulation results show that, depending on the setting of the threshold values, compared to the case without topology reconstruction, the proposed method can explore better trade-off points between search and storage access load balancing performance in the assumed scenario.
Visual Tracking Achieved by Adaptive Sampling from Hierarchical and Parallel Predictions
Authors: Tomohiro Shibata, Takashi Bando, Shin Ishii
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Because the inevitable ill-posedness exists in the visual information, the brain essentially needs some prior knowledge, prediction, or hypothesis to acquire a meaningful solution. From computational point of view, visual tracking is the real-time process of statistical spatiotemporal filtering of target states from an image stream, and incremental Bayesian computation is one of the most important devices. To make Bayesian computation of the posterior density of state variables tractable for any types of probability distribution, Particle Filters (PFs) have been often employed in the real-time vision area. In this paper, we briefly review incremental Bayesian computation and PFs for visual tracking, indicate drawbacks of PFs, and then propose our framework, in which hierarchical and parallel predictions are integrated by adaptive sampling to achieve appropriate balancing of tracking accuracy and robustness. Finally, we discuss the proposed model from the viewpoint of neuroscience.
Personal Recognition Using Single-Sensor Multimodal Hand Biometrics
Authors: Andreas Uhl, Peter Wild
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

Single-sensor approaches to multimodal biometric authentication targeting the human hand in multiple-matcher scenarios provide higher security in terms of accuracy and resistance to biometric system attacks than unimodal systems. This paper introduces a novel multimodal hand biometric system using palmar images acquired by a commercially available flatbed scanner. Hence, the presented approach to personal recognition is independent of specific biometric sensors, such as fingerprint readers or palmprint scanners. Experimental results with a minimum half total error rate of 0.003% using a database of 443 hand images will illustrate the performance improvement when hand-geometry, fingerprint and palmprint-based features are combined.
An Empirical Comparison of Ideal and Empirical ROC-Based Reject Rules
Authors: Claudio Marrocco, Mario Molinara, Francesco Tortorella
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Two class classifiers are used in many complex problems in which the classification results could have serious consequences. In such situations the cost for a wrong classification can be so high that can be convenient to avoid a decision and reject the sample. This paper presents a comparison between two different reject rules (the Chow's and the ROC rule). In particular, the experiments show that the Chow's rule is inappropriate when the estimates of the a posteriori probabilities are not reliable.
Recognizing the Enemy: Combining Reinforcement Learning with Strategy Selection Using Case-Based Reasoning
Authors: Bryan Auslander, Stephen Lee-Urban, Chad Hogg, Héctor Muñoz-Avila
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

This paper presents CBRetaliate, an agent that combines Case-Based Reasoning (CBR) and Reinforcement Learning (RL) algorithms. Unlike most previous work where RL is used to improve accuracy in the action selection process, CBRetaliate uses CBR to allow RL to respond more quickly to changing conditions. CBRetaliate combines two key features: it uses a time window to compute similarity and stores and reuses complete Q-tables for continuous problem solving. We demonstrate CBRetaliate on a team-based first-person shooter game, where our combined CBR+RL approach adapts quicker to changing tactics by an opponent than standalone RL.
The Abella Interactive Theorem Prover (System Description)
Authors: Andrew Gacek
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

Abella [3] is an interactive system for reasoning about aspects of object languages that have been formally presented through recursive rules based on syntactic structure. Abella utilizes a two-level logic approach to specification and reasoning. One level is defined by a specification logic which supports a transparent encoding of structural semantics rules and also enables their execution. The second level, called the reasoning logic, embeds the specification logic and allows the development of proofs of properties about specifications. An important characteristic of both logics is that they exploit the ¿-tree syntax approach to treating binding in object languages. Amongst other things, Abella has been used to prove normalizability properties of the ¿-calculus, cut admissibility for a sequent calculus and type uniqueness and subject reduction properties. This paper discusses the logical foundations of Abella, outlines the style of theorem proving that it supports and finally describes some of its recent applications.
Topic 2 Performance Prediction and Evaluation
Authors: Wolfgang Nagel, Bruno Gaujal, Tugrul Dayar, Nihal Pekergin
Venue: Proceedings of the 13th European international conference on Parallel Processing (2007)

Parallel algorithms used to be evaluated using some version of the PRAM model where actual execution platforms are abstracted as ideal parallel machines. On the other hand the performance of hardware is often given in terms of individual pick performances which can be useless for actual applications. The real challenge for performance predictions and evaluations of parallel systems is to combine the top and low layers points of view, where congestions, controlmechanisms, failures or even breakdowns do alter the behavior of a large distributed platform running a parallel application. In many different ways, this challenge is addressed in all the papers presented in the track, using either new modelling techniques, or sophisticated measures, or experimental approaches.
Analysis and Adaptation of Workplaces for People with Cognitive Disabilities Using Software Tools
Authors: Alberto Ferreras, Alicia Piedrabuena, Juan Manuel Belda, Ricard Barberà, Alfonso Oltra, Rakel Poveda, Jaime Prat, Lourdes Tortosa
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper describes the results of a study in which software tools were used to analyse and adapt workplaces occupied by people with cognitive disabilities. To do this, the work and the workers were evaluated in order to identify the most relevant problems, using the ErgoDis/IBV method. This is a computer software intended for fitting workplaces to people with disabilities. Once evaluated the workplaces, some adaptations were proposed and implemented. One of the main measures adopted was the use of PDAs to help workers in performing their tasks. After the adaptation of the workplaces, an assessment process was carried out to evaluate the adequacy of the executed measures. The results of the study were implemented in a web page in order to provide information about real cases to professionals and users.
Global Asymptotical Stability of Internet Congestion Control
Authors: Hong-Yong Yang, Fu-Sheng Wang, Xun-Lin Zhu, Si-Ying Zhang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

A class of Internet congestion control algorithms with communication delays is studied. The algorithm is a pieced continuous function that will be switched on the rate of the source. Based on the Lyapunov theorem, the Lyapunov stability of the system is analyzed. By applying Barbalat Lemma, the global asymptotical stability (GAS) of the algorithm is proved, and a more concise criterion is presented.
A Side Information Based Packet Loss Recovery Algorithm in VoIP
Authors: Zhongbo Li, Shenghui Zhao, Jing Wang, Jingming Kuang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

In VoIP (Voice over Internet Protocol) applications, packet loss affects the received speech quality greatly. PCM (Pulse Code Modulation) coders are often used for VoIP and also face such problems. In this paper a side information based packet loss recovery algorithm is proposed, which introduces a small part of corrective information to provide an enhanced reconstruction of the lost packets. A virtual reconstruction is implemented for every original packet with side information and the redundancy is obtained with MMSE criterion at the sender endpoint. When packet loss happens, the lost packets will be recovered with side information and redundancy at the receiver endpoint. The simulation results show that the speech quality over IP network is obviously improved at the price of only a low bandwidth consumption with the proposed method.
3D Body Scanning in a Mirror Cabinet
Authors: Sven Molkenstruck, Simon Winkelbach, Friedrich M. Wahl
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

Body scanners offer significant potential for use in many applications like clothing industry, orthopedy, surgery, healthcare, monument conservation, art, as well as film- and computer game industry. In order to avoid distortions due to body movements (e.g. breathing or balance control), it is necessary to scan the entire surface in one pass within a few seconds. Most body scanners commercially available nowadays require several scans to obtain all sides, or they consist of several sensors making them unnecessarily expensive. We propose a new body scanning system, which is able to fully scan a person's body or an object from three sides at the same time. By taking advantage of two mirrors, we only require a single grayscale camera and at least one standard line laser, making the system far more affordable than previously possible. Our experimental results prove efficiency and usability of the proposed setup.
Emergence of Interaction among Adaptive Agents
Authors: Georg Martius, Stefano Nolfi, J. Michael Herrmann
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

Robotic agents can self-organize their interaction with the environment by an adaptive "homeokinetic" controller that simultaneously maximizes sensitivity of the behavior and predictability of sensory inputs. Based on previous work with single robots, we study the interaction of two homeokinetic agents. We show that this paradigm also produces quasi-social interactions among artificial agents. The results suggest that homeokinetic learning generates social behavior only in the the context of an actual encounter of the interaction partner while this does not happen for an identical stimulus pattern that is only replayed. This is in agreement with earlier experiments with human subjects.
Rough Rule Extracting From Various Conditions: Incremental and Approximate Approaches for Inconsistent Data
Authors: Yong Liu, Congfu Xu, Qiong Zhang, Yunhe Pan
Venue: Fundamenta Informaticae (2008)

Rough rule extraction refers to the rule induction method by using rough set theory. Although rough set theory is a powerful mathematical tool in dealing with vagueness and uncertainty in data sets, it is lack of effective rule extracting approach under complex conditions. This paper proposes several algorithms to perform rough rule extraction from data sets with different properties. Firstly, in order to obtain uncertainty rules from inconsistent data, we introduce the concept of confidence factor into the rule extracting process. Then, an improved incremental rule extracting algorithm is proposed based on the analysis of the incremental data categories. Finally, above algorithms are further extended to perform approximate rule extraction from huge data sets. Preliminary experiment results are encouraging.
Intuitive Plan Construction and Adaptive Plan Selection
Authors: Kai Stoye, Carsten Elfers
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Typical tasks of multi agent systems are effective coordination of single agents and their cooperation. Especially in dynamic environments, like the RoboCup soccer domain, the uncertainty of an opponent's team behavior complicates coordinated team action. This paper presents a novel approach for intuitive multi agent plan construction and adaptive plan selection to attempt these tasks. We introduce a tool designed to represent plans like in tactical playbooks in human soccer which allows easy plan construction, editing and managing. Further we introduce a technique that provides adaptive plan selection in offensive situations by evaluating effectiveness of plans and their actions with statistically interpreted results to improve a team's style of play. Using experts as a concept for abstracting information about a team's interaction with another, makes fast accommodated plan selection possible. We briefly describe our software components, examine the performance of our implementation and give an example for rational plan selection in the RoboCup Small Size League.