ppxscal/embedding_network huggingface dataset:
Genetic Repair for Optimization under Constraints Inspired by Arabidopsis Thaliana
Authors: Amy Fitzgerald, Diarmuid P. O'Donoghue
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

It has recently been proposed that the model plant, Arabidopsis thaliana (thale cress), uses a newly discovered genetic repair system to repair errors at the genetic level. A. thaliana uses information from the grandparent's genes as a basis for this correction --- so genetic information appears to skip a generation. We apply this gene repair strategy to a combinatory optimization problem, firstly comparing the performance of parent and grandparent based repair. Subsequent experiments expand our understanding of the GeneRepair algorithm, by examining the parameters of fitness and direction involved in the generepair process. Our results point to a tentative explanation as to why A. thaliana might have evolved such an apparently complex inheritance process.
Towards Real-Time Distributed Signal Modeling for Brain-Machine Interfaces
Authors: Jack Digiovanna, Loris Marchal, Prapaporn Rattanatamrong, Ming Zhao, Shalom Darmanjian, Babak Mahmoudi, Justin C. Sanchez, José C. Príncipe, Linda Hermer-Vazquez, Renato Figueiredo, José A. Fortes
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

New architectures for Brain-Machine Interface communication and control use mixture models for expanding rehabilitation capabilities of disabled patients. Here we present and test a dynamic data-driven (BMI) Brain-Machine Interface architecture that relies on multiple pairs of forward-inverse models to predict, control, and learn the trajectories of a robotic arm in a real-time closed-loop system. A method of window-RLS was used to compute the forward-inverse model pairs in real-time and a model switching mechanism based on reinforcement learning was used to test the ability to map neural activity to elementary behaviors. The architectures were tested with in vivo data and implemented using remote computing resources.
The Research on the Case Learning Activity Sustained by a Web-Based Case Assisted Study Environment--Take the Introduction of Industry System Course for Example
Authors: Xinyu Zhang, Nianlong Luo, Li Zheng
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

This article aims to introduce the study process and outcome of case learning activity sustained by a web-based case assisted study environment (or WebCASE for short), including the choosing of learning object, the implementing of study proposal and the discussion of initial conclusion. Our research mainly concerns problems from two levels: one is how to organize case study activities; the other is how to design effective on-line study environment to support case study activities. We exactly follow the design-based research pattern to improving our research result and conclusion, so we develop two sections of research work, as follows: prototype implementing section, practice research section. In prototype implementing section, we study the current situations of popular case databases all over the world and the requirement for online case study environment of users by literature review, questionnaire statistics, and personal interviews. Based on the initial requirement, we design and implement a prototype system of Web-based Case Assisted Study Environment, WebCASE. Research work and results of prototype system implementation can be found in. In practice research section, we study the case study activities supported by WebCASE prototype system, with the course "Industry System Introduction" provided by Professor Darong Lu as our reference. In this paper, we mainly concern problems in four aspects: first is the study environment, studying overall teaching effectiveness and main functions of WebCASE; second is learning object, studying how original cases developing in WebCASE systems; third is study process, how to organize case studies under the support by WebCASE; finally is study evaluation, how to generally and effectively evaluate students' performance in case study activities.
Vertex-Uncertainty in Graph-Problems
Authors: Cécile Murat, Vangelis Th. Paschos
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We study a probabilistic model for graph-problems under vertex-uncertainty. We assume that any vertex v i of the input-graph G has only a probability p i to be present in the final graph to be optimized (i.e., the final instance for the problem tackled will be only a sub-graph of the initial graph). Under this model, the original "deterministic" problem gives rise to a new (deterministic) problem on the same input-graph G, having the same set of feasible solutions as the former one, but its objective function can be very different from the original one, the set of its optimal solutions too. Moreover, this objective function is a sum of 2|V| terms, where V is the vertex-set of G; hence, its computation is not immediately polynomial. We give sufficient conditions for large classes of graph-problems under which objective functions of the probabilistic counterparts are polynomially computable and optimal solutions are well-characterized.
INGENIAS development kit: a visual multi-agent system development environment
Authors: Jorge J. Gomez-Sanz, Rubén Fuentes, Juan Pavón, Ivan García-Magariño
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

The INGENIAS Development Kit, IDK from now on, is the development support tool for the INGENIAS methodology [2]. It is distributed as GPL software and developed in Java. The distribution can be downloaded from http://ingenias.sourceforge.net while updated versions are always available in the subversion repositores hosted within the INGENIAS sourceforge project.
Dynamic analysis of electric arcs based on energetic and Clarke approach
Authors: Francesco Della Torre, Sonia Leva, Adriano Paolo Morando
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

In the present paper an innovative approach to the transient study of interrupted single- and three-phase networks is proposed. It is based on state-equations and it is independent on the mathematical model adopted to represent the electric arc. In the three-phase case, the application of Clarke transformation allows us to perform the energy analysis of the three-phase electric arc during the unbalanced transient conditions without the use of empirical coefficient normally adopted in literature.
Gathering Multiple Robotic Agents with Crude Distance Sensing Capabilities
Authors: Noam Gordon, Yotam Elor, Alfred M. Bruckstein
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

In this follow-up to an ANTS 2004 paper we continue to investigate the problem of gathering a swarm of multiple robotic agents on the plane using very limited local sensing capabilities. In our previous work, we assumed that the agents cannot measure their distance to neighboring agents at all. In this paper, we consider a crude range-limited sensing capability that can only tell if neighboring agents are either near or far. We introduce two new variants of our previously proposed algorithm that utilize this capability. We prove the correctness of our algorithms, and show that the newly added capability can improve the performance of the algorithm significantly.
Hard and soft magnetic materials for electromagnetic microactuators
Authors: M. Bedenbecker, R. Bandorf, G. Br&#x00e4;uer, H. L&#x00fc;thje, H. H. Gatzen
Venue: Microsystem Technologies (2008)

An important aspect of the development of electromagnetic microactuators is the search for suitable materials as well as the development of the respective deposition and patterning processes. Within the Collaborative Research Center 516 &#x201c;Design and Fabrication of Active Microsystems&#x201d;, it is the task of the subproject B1 &#x201c;fabrication of magnetic thin films for electromagnetic microactuators&#x201d; to perform these investigations. The materials of interest can be divided into two groups: hard magnetic materials and soft magnetic materials. Materials with optimized properties and fabrication processes have been developed within both groups. An example is Samarium&#x2013;Cobalt (SmCo), which can either be deposited using magnetron sputtering as Sm2Co17 with a very high energy product or in the SmCo5 phase using gas flow sputtering with very high deposition rates. In the area of soft magnetic materials, investigations on Nickel-Iron (NiFe) especially NiFe81/19 were followed by the evaluation of NiFe45/55, which features a higher saturation flux density B s and relative permeability &#x03bc; r. Furthermore, current investigations focus on Cobalt-Iron (CoFe) and its further increased saturation flux density B s and relative permeability &#x03bc; r. Current tasks include the stabilization of the fabrication processes to achieve good material properties (i.e. electroplating of CoFe) or a shortening (e.g. by using heated substrates during deposition) by using process alternative not used so far. Another topic is the integration into fabrication processes, i.e. the investigation of process stability and compatibility.
A Program Slicing Based Method to Filter XML/DTD Documents
Authors: Josep Silva
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Program slicing is a well-known technique to extract the program statements that (potentially) affect the values computed at some point of interest. In this work, we introduce a novel slicing method for XML documents. Essentially, given an XML document (which is valid w.r.t. some DTD), we produce a new XML document (a slice) that contains the relevant information in the original XML document according to some criterion. Furthermore, we also output a new DTD such that the computed slice is valid w.r.t. this DTD. A prototype implementation of the XML slicer has been undertaken.
Modeling Consciousness for Autonomous Robot Exploration
Authors: Raúl Arrabales Moreno, Agapito Ledezma Espino, Araceli Sanchis De Miguel
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)

This work aims to describe the application of a novel machine consciousness model to a particular problem of unknown environment exploration. This relatively simple problem is analyzed from the point of view of the possible benefits that cognitive capabilities like attention, environment awareness and emotional learning can offer. The model we have developed integrates these concepts into a situated agent control framework, whose first version is being tested in an advanced robotics simulator. The implementation of the relationships and synergies between the different cognitive functionalities of consciousness in the domain of autonomous robotics is also discussed.
On the Optimal Object-Oriented Program Re-modularization
Authors: Saeed Parsa, Omid Bushehrian
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

In this paper a new criterion for automatic re-modularization of object-oriented programs is presented. The aim of re-modularization here is to determine a distributed execution of a program over a dedicated network of computers with the shortest execution time. To achieve this, a criterion to quantitatively evaluate performance of a re-modularized program is presented as a function. This function is automatically constructed while traversing the program call flow graph once before the search for the optimal re-modularization of the program and considers both synchronous and asynchronous types for each call within the call flow graph.
How Is Individuality Expressed in Voice? An Introduction to Speech Production and Description for Speaker Classification
Authors: Volker Dellwo, Mark Huckvale, Michael Ashby
Venue: Speaker Classification I: Fundamentals, Features, and Methods (2007)

As well as conveying a message in words and sounds, the speech signal carries information about the speaker's own anatomy, physiology, linguistic experience and mental state. These speaker characteristics are found in speech at all levels of description: from the spectral information in the sounds to the choice of words and utterances themselves. This chapter presents an introduction to speech production and to the phonetic description of speech to facilitate discussion of how speech can be a carrier for speaker characteristics as well as a carrier for messages. The chapter presents an overview of the physical structures of the human vocal tract used in speech, it introduces the standard phonetic classification system for the description of spoken gestures and it presents a catalogue of the different ways in which individuality can be expressed through speech. The chapter ends with a brief description of some applications which require access to information about speaker characteristics in speech.
Peer-to-Peer Shared Ride Systems
Authors: Yun Hui Wu, Lin Jie Guan, Stephan Winter
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

Shared ride systems match the travel demand of transport clients with the supply by vehicles, or hosts, such that the clients find rides to their destinations. A peer-to-peer shared ride system allows clients to find rides in an ad-hoc manner, by negotiating directly with nearby hosts via radio-based communication. Such a peer-to-peer shared ride system has to deal with various types of hosts, such as private cars and mass transit vehicles. Their different behaviors affect the negotiation process, and consequently the travel choices. In this paper, we present and discuss a model of a peer-to-peer shared ride system with different types of agents. The behavior of the model is investigated in a simulation of different communication and way-finding strategies. We demonstrate that different types of agents enrich the choices of the clients, and lead to local solutions that are nearly optimal.
Trace-Context Sensitive Performance Profiling for Enterprise Software Applications
Authors: Matthias Rohr, André van Hoorn, Simon Giesecke, Jasminka Matevska, Wilhelm Hasselbring, Sergej Alekseev
Venue: Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks (2008)

Software response time distributions can be of high variance and multi-modal. Such characteristics reduce confidence or applicability in various statistical evaluations.We contribute an approach to correlating response times to their corresponding operation execution sequence. This provides calling-context sensitive timing behavior models. The approach is based on three equivalence relations: caller-context, stack-context, and trace-context equivalence. To prevent model size explosion, a tree-based hierarchy provides timing behavior models that provide a trade-off between timing behavior model size and the amount of calling-context information considered.In the case study, our approach provides response time distributions with significantly lower standard deviation, compared to using less or no calling-context information. An example from a performance analysis of an industry system demonstrates that multi-modal distributions can be replaced by multiple unimodal distributions using trace-context analysis.
Automated Identification of Tasks in Development Sessions
Authors: Irina Diana Coman, Alberto Sillitti
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Task switching occurs frequently during the work of software developers. While there are already several approaches aiming at assisting developers in recovering their contexts of previous tasks, they generally rely on the developer to identify the beginning of each task. We propose a new technique for automatically splitting a development session into task-related subsections, based on the interaction of the developer with the IDE. The technique also shows potential benefits for automatic concern detection and for suggestions for code investigation. We present the technique, the results of a study conducted for its initial validation, and we discuss the additional potential benefits under investigation.
An improved particle swarm optimization algorithm for flowshop scheduling problem
Authors: Changsheng Zhang, Jigui Sun, Xingjun Zhu, Qingyun Yang
Venue: Information Processing Letters (2008)

The flowshop scheduling problem has been widely studied and many techniques have been applied to it, but few algorithms based on particle swarm optimization (PSO) have been proposed to solve it. In this paper, an improved PSO algorithm (IPSO) based on the ''alldifferent'' constraint is proposed to solve the flow shop scheduling problem with the objective of minimizing makespan. It combines the particle swarm optimization algorithm with genetic operators together effectively. When a particle is going to stagnate, the mutation operator is used to search its neighborhood. The proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The results show that the proposed IPSO algorithm is more effective and better than the other compared algorithms. It can be used to solve large scale flow shop scheduling problem effectively.
OP-ELM: Theory, Experiments and a Toolbox
Authors: Yoan Miche, Antti Sorjamaa, Amaury Lendasse
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

This paper presents the Optimally-Pruned Extreme Learning Machine (OP-ELM) toolbox. This novel, fast and accurate methodology is applied to several regression and classification problems. The results are compared with widely known Multilayer Perceptron (MLP) and Least-Squares Support Vector Machine (LS-SVM) methods. As the experiments (regression and classification) demonstrate, the OP-ELM methodology is considerably faster than the MLP and the LS-SVM, while maintaining the accuracy in the same level. Finally, a toolbox performing the OP-ELM is introduced and instructions are presented.
Effects of Co-location and Crossmodal Interaction between Haptic, Auditory and Visual Cues in Presence
Authors: Raquel Viciana-Abad, Arcadio Reyes-Lecuona
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

The elicited sense of presence in a virtual environment (VE) is affected by the sensory cues provided during the interaction. Moreover multimodal integration may also be a contributing effect in this factor. The experiment presented analyzes the extent in which the addition of haptic, auditory and visual cues, as well as the integration that may take place between them, affects presence. We also analyze the effects of co-location between visual and haptic sensory modalities. Thus the experiment has a between subject design, where 16 subjects interact in a co-located condition (C)using the Reachin display and the other 16 in a non co-located condition (NC). The system used is a virtual version of the "Simon" game and subjects are requested to complete a memory task which consists in reproducing sequences, via selecting buttons. Results of this experiment have shown how firstly haptic cues are the principal modality for eliciting sense of presence and secondly the existence of differences in the benefits of multimodality between the two conditions.
Sparse coding via thresholding and local competition in neural circuits
Authors: Christopher J. Rozell, Don H. Johnson, Richard G. Baraniuk, Bruno A. Olshausen
Venue: Neural Computation (2008)

While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We describe a locally competitive algorithm (LCA) that solves a collection of sparse coding principles minimizing a weighted combination of mean-squared error and a coefficient cost function. LCAs are designed to be implemented in a dynamical system composed of many neuron-like elements operating in parallel. These algorithms use thresholding functions to induce local (usually one-way) inhibitory competitions between nodes to produce sparse representations. LCAs produce coefficients with sparsity levels comparable to the most popular centralized sparse coding algorithms while being readily suited for neural implementation. Additionally, LCA coefficients for video sequences demonstrate inertial properties that are both qualitatively and quantitatively more regular (i.e., smoother and more predictable) than the coefficients produced by greedy algorithms.
A UML Model of the Client Tracking System at the Learning Enrichment Foundation in Toronto, Canada: A Study of Class, Object, and State Diagrams
Authors: Lan Anh Tran
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

This paper represents a part of the case studies of the UML model for designing the Client Tracking System (CTS) at the Learning Enrichment Foundation (LEF) in Toronto, Canada by Tran [1]. It attempts to apply UML concepts to design UML diagrams that reflect the functional processes within the Client Tracking System. In addition it investigates the task of constructing the design elements for CTS that can be used to manage the client information within LEF. Specifically, this paper investigates class, object, and state diagrams of CTS. Through a study of how the CTS has been structured and how it operates, we may learn lessons that may be useful in other community networks serving significant immigrant communities.
The Personality-Enabled Architecture for Cognition (PAC)
Authors: Stephen Read, Lynn Miller, Anna Kostygina, Gurveen Chopra, John L. Christensen, Charisse Corsbie-Massay, Wayne Zachary, Jean-Christophe Lementec, Vassil Iordanov, Andrew Rosoff
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

The Personality-enabled Architecture for Cognition (PAC) is a new modeling architecture designed to create Intelligent Virtual Agents (IVAs) with specific personality traits. PAC integrates theory and empirical data from personality psychology, social psychology, cognitive science, and neuroscience to build a model of personality that is based on fundamental underlying human motivational systems.
Some related problems from network flows, game theory and integer programming
Authors: Sartaj Sahni
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

We consider several important problems for which no polynomially time bounded algorithm is known. These problems are shown to be related in that a polynomial algorithm for one implies a polynomial algorithm for the others. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On sets of numbers recognized by push-down automat
Authors: Jean Berstel
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

A set of positive integers is said to be recognizable by a push-down automaton if its elements, written in k-ary notation for some k ≥ 2, form a context-free language. Some general properties of this type of sets are given. The set of squares is shown not to be recognizable. A necessary condition is proved for a subset of a set defined by a linear recurrence relation of some special form to be recognizable. The set of square-free integers is investigated.