ppxscal/embedding_network huggingface dataset:
Online Phase-Adaptive Data Layout Selection
Authors: Chengliang Zhang, Martin Hirzel
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Good data layouts improve cache and TLB performance of object-oriented software, but unfortunately, selecting an optimal data layout a priori is NP-hard. This paper introduces layout auditing, a technique that selects the best among a set of layouts online (while the program is running). Layout auditing randomly applies different layouts over time and observes their performance. As it becomes confident about which layout performs best, it selects that layout with higher probability. But if a phase shift causes a different layout to perform better, layout auditing learns the new best layout. We implemented our technique in a product Java virtual machine, using copying generational garbage collection to produce different layouts, and tested it on 20 long-running benchmarks and 4 hardware platforms. Given any combination of benchmark and platform, layout auditing consistently performs close to the best layout for that combination, without requiring offline training.
Genetic Programming for Proactive Aggregation Protocols
Authors: Thomas Weise, Kurt Geihs, Philipp A. Baer
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

We present an approach for automated generation of proactive aggregation protocols using Genetic Programming. First a short introduction into aggregation and proactive protocols is given. We then show how proactive aggregation protocols can be specified abstractly. To be able to use Genetic Programming to derive such protocol specifications, we describe a simulation based fitness assignment method. We have applied our approach successfully to the derivation of aggregation protocols. Experimental results are presented that were obtained using our own Distributed Genetic Programming Framework. The results are very encouraging and demonstrate clearly the utility of our approach.
Learning to Generalize through Predictive Representations: A Computational Model of Mediated Conditioning
Authors: Elliot A. Ludvig, Anna Koop
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

Learning when and how to generalize knowledge from past experience to novel circumstances is a challenging problem many agents face. In animals, this generalization can be caused by mediated conditioning--when two stimuli gain a relationship through the mediation of a third stimulus. For example, in sensory preconditioning, if a light is always followed by a tone, and that tone is later paired with a shock, the light will come to elicit a fear reaction, even though the light was never directly paired with shock. In this paper, we present a computational model of mediated conditioning based on reinforcement learning with predictive representations. In the model, animals learn to predict future observations through the temporal-difference algorithm. These predictions are generated using both current observations and other predictions. The model was successfully applied to a range of animal learning phenomena, including sensory preconditioning, acquired equivalence, and mediated aversion. We suggest that animals and humans are fruitfully understood as representing their world as a set of chained predictions and propose that generalization in artificial agents may benefit from a similar approach.
Exploring Music Collections in Virtual Landscapes
Authors: Peter Knees, Markus Schedl, Tim Pohle, Gerhard Widmer
Venue: IEEE MultiMedia (2007)

A user interface to music repositories called nepTune creates a virtual landscape for an arbitrary collection of digital music files, letting users freely navigate the collection. Automatically extracting features from the audio signal and clustering the music pieces accomplish this. The clustering helps generate a 3D island landscape.
Assisting Human Decision Making with Intelligent Technologies
Authors: Gloria Phillips-Wren
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

The human decision making process has been characterized as relatively sequential, limited by cognitive processes, and influenced by previous experience. Under conditions associated with real-time decisions, humans can experience emotional intensity, information overload, and other stressors that often affect their choices. Decision making becomes more complex with distributed teams, collaboration across global boundaries, the speed of information refresh, and the quantity of information available through networked sources. Intelligent decision support systems attempt to address these issues and assist human decision making by developing systems that integrate capabilities from the human user and computational intelligence. This keynote address presents background and research directions needed to advance intelligent decision support systems, and proposes an architectural framework to guide design and evaluation.
Dynamic Overlay Node Activation Algorithms for Large-Scale Service Deployments
Authors: Jeroen Famaey, Tim Wauters, Filip Turck, Bart Dhoedt, Piet Demeester
Venue: Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment (2008)

Due to overprovisioning of infrastructure nodes in overlay networks, many nodes remain idle at times of low network load. Some of these nodes could be temporary removed from the overlay topology and could then be used for other purposes or alternatively be temporarily shut down, to save energy.In this paper we present several algorithms to select the subset of overlay nodes that should be part of the overlay topology. This decision is made based on the current and (estimated) future network load and the locality of the clients and servers connected to the overlay network. As network load or conditions change, additional nodes can be dynamically (de)activated. Our algorithms can be used in conjunction with existing overlay topology construction protocols.Through extensive simulations, we have evaluated and compared the performance of our algorithms.
A Uniformization-Based Algorithm for Model Checking the CSL Until Operator on Labeled Queueing Networks
Authors: Anne Remke, Boudewijn R. Haverkort
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

We present a model checking procedure for the CSL until operator on the CTMCs that underly Jackson queueing networks. The key issue lies in the fact that the underlying CTMC is infinite in as many dimensions as there are queues in the JQN. We need to compute the transient state probabilities for all goal states and for all possible starting states. However, for these transient probabilities no computational procedures are readily available. The contribution of this paper is the proposal of a new uniformization-based approach to compute the transient state probabilities. Furthermore, we show how the highly structured state space of JQNs allows us to compute the possible infinite satisfaction set for until formulas. A case study on an e-business site shows the feasibility of our approach.
Roles, players and adaptable organizations
Authors: Alan Colman, Jun Han
Venue: Applied Ontology (2007)

Role is a commonly used concept in software development, but a concept with divergent definitions. This paper discusses the characteristics of roles in software organizations, and contrasts such organization roles with other player-centric conceptions. Roles in organizations have their own identity and do not depend on role players for their existence. In software terms, such roles are first-class runtime entities rather than just design concepts. We define characteristic properties of both roles and players in organizational contexts, and show how the boundary between a role and its player varies depending on the level of autonomy the player is allowed. We show how roles can facilitate the separation of structure from process facilitating greater adaptivity in software. The problem of preservation of state in role-based organizations is also discussed. Possible implementation strategies for both roles and players are discussed and illustrated with various role-oriented approaches to building software organizations.
Integration: Bridge Gap between Data Model and Process Model
Authors: Ning Chen
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The infrastructure of separation between data and process has evolved as basis of Computer Integration Manufacturing System (CIMS), in which case many corresponding techniques are emerging in multitude for designing an CIMS system, such as OLE for Process Control (OPC), grid service etc. Generally speaking, a data model is used to describe and represent storage and a process model is used to define production flow, including structure, categorization and classification of data operations that deal with the operations of data such as drawing, simulation, cost calculation, report, visualization etc. Although there have been standardization efforts for data model and process model (for example, BPEL4WS defines both abstract and executable processes and ER Modeling defines the data model), how to bride the gap between them is still a challengedue to its complication. In the paper, a few prevalent infrastructures are discussed; furthermore anautomatic middleware-based technique for bridging the gap between them is presented.
Real-time tumor tracking: modeling and simulating the process
Authors: Muhammad Ali Yousuf, Alejandro Staines Sanders, Ana Isabel Salgueiro Ochoa, Rosa Maria Ferradas Somoza
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

Real-time motion tracking and compensation in surgeries has been investigated by various researchers using different methods. We look at the problem from control point of view and try to solve it using a simple mechanical prototype of the treatment couch and an electronic circuitry to feed the signal from the sensor to correct for the random movements of the tumor. Our physical model shows stable response under the given conditions. We also present a simple mathematical model of the lung-tumor system needed to guide the control system at intermediate points. The project was developed as an undergraduate design project.
Toward Approximate Adaptive Learning
Authors: James F. Peters
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The problem considered in this paper is how the classification of observed behaviour of organisms can be used to influence adaptive learning, beneficially. The solution to this problem hearkens back to the pioneering work during the 1980s by Zdzisław Pawlak and others on classification of objects and approximation spaces, where elementary sets of equivalent objects a framework for perceptions concerning observed behaviours. The seminal work by Oliver Selfridge and Chris J.C.H. Watkins on delay rewards and adaptive learning, also during the 1980s, combined with more recent work on reinforcement learning provide a basis for the forms of adaptive learning introduced in this article. In addition, recent work on approximation spaces has led to what is known as approximate adaptive learning. This article presents two forms of run-and-twiddle (RT) adaptive learning, each using the Watkins' stopping time strategy to mark the end of an episode. Twiddling amounts to adjusting what one does to achieve a better result. This becomes more apparent in approximate RT adaptive learning introduced in this article, where a record of observed behaviour patterns during each episode recorded in an ethogram makes it possible to define a pattern-based learning rate in the context of approximation spaces. Both forms of adaptive learning are actor-critic methods. The contribution of this article is the introduction of two forms of adaptive learning with Watkins' stopping time strategy with differential discount on returns in both cases and differential learning rate for adaptive learning in the context of approximation spaces.
Nonlinear system identification: From multiple-model networks to Gaussian processes
Authors: Gregor Gregorčič, Gordon Lightbody
Venue: Engineering Applications of Artificial Intelligence (2008)

Neural networks have been widely used to model nonlinear systems for control. The curse of dimensionality and lack of transparency of such neural network models has forced a shift towards local model networks and recently towards the nonparametric Gaussian processes approach. Assuming common validity functions, all of these models have a similar structure. This paper examines the evolution from the radial basis function network to the local model network and finally to the Gaussian process model. A simulated example is used to explain the advantages and disadvantages of each structure.
Managing Probabilistic Data with MystiQ: The Can-Do, the Could-Do, and the Can't-Do
Authors: Christopher Re, Dan Suciu
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

MystiQ is a system that allows users to define a probabilistic database, then to evaluate SQL queries over this database. MystiQ is a middleware: the data itself is stored in a standard relational database system, and MystiQ is providing the probabilistic semantics. The advantage of a middleware over a re-implementation from scratch is that it can leverage the infrastructure of an existing database engine, e.g. indexes, query evaluation, query optimization, etc. Furthermore, MystiQ attempts to perform most of the probabilistic inference inside the relational database engine. MystiQ is currently available from mystiq.cs.washington.edu.
Dynamic Bayesian network based interest estimation for visual attentive presentation agents
Authors: Boris Brandherm, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

In this paper, we report on an interactive system and the results ofa formal user study that was carried out with the aim of comparing two approaches to estimating users' interest in a multimodal presentation based on their eye gaze. The scenario consists of a virtual showroom where two 3D agents present product items in an entertaining way, and adapt their performance according to users' (in)attentiveness. In order to infer users' attention and visual interest with regard to interface objects, our system analyzes eye movements in real-time. Interest detection algorithms used in previous research determine an object of interest based on the time that eye gaze dwells on that object. However, this kind of algorithm does not seem to be well suited for dynamic presentations where the goal is to assess the user's focus of attention with regard to a dynamically changing presentation. Here, the current context of the object of interest has to be considered, i.e., whether the visual object is part of (or contributes to) the current presentation content or not. Therefore, we propose to estimate the interest (or non-interest) of a user by means of dynamic Bayesian networks that may take into account the current context of the attention receiving object. In this way, the presentation agents can provide timely and appropriate response. The benefits of our approach will be demonstrated both theoretically and empirically.
Adapting Secure Tropos for Security Risk Management in the Early Phases of Information Systems Development
Authors: Raimundas Matulevičius, Nicolas Mayer, Haralambos Mouratidis, Eric Dubois, Patrick Heymans, Nicolas Genon
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Security is a major target for today's information systems (IS) designers. Security modelling languages exist to reason on security in the early phases of IS development, when the most crucial design decisions are made. Reasoning on security involves analysing risk, and effectively communicating risk-related information. However, we think that current languages can be improved in this respect. In this paper, we discuss this issue for Secure Tropos, the language supporting the eponymous agent-based IS development. We analyse it and suggest improvements in the light of an existing reference model for IS security risk management. This allows for checking Secure Tropos concepts and terminology against those of current risk management standards, thereby improving the conceptual appropriateness of the language. The paper follows a running example, called eSAP, located in the healthcare domain.
Dynamical Patterns in Scalefree Trees of Coupled 2D Chaotic Maps
Authors: Zoran Levnajić, Bosiljka Tadić
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

New insights have been gained recently into the interplay between complex network architectures and the collective dynamics of simple elements coupled through them. The usual paradigm for studying systems of this kind is a network of one-dimensional interacting logistic maps, which provides a plausible model for a variety of complex systems. In this work we consider a network of two-dimensional standard maps coupled through a scalefree tree topology. The coupling is solely in the angle coordinate and involves a time-delay: this approach is motivated by the node-to-node information flow view of the collective dynamics. We observe a rich variety of dynamical behavior including self-organized patterns: nodes synchronize in clusters each having specific motion quantities whose values are belonging to a discrete set of possible values. We conclude by studying the relationship between dynamically induced cluster-organization of the nodes and their network-structurization.
A Network Service for DSP Multicomputers
Authors: Juan A. Rico-Gallego, Jesús M. Álvarez-Llorente, Juan C. Díaz-Martín, Francisco J. Perogil-Duque
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

Programmers of embedded digital signal processors often have to deal with the devices of the platform or with low level hardware abstraction layers in order to reach the better performance from a given algorithm. This complexity increases when the application is distributed on multicomputers such as those by SundanceTM, Hunt EngineeringTM, etc. These machines are loosely coupled networks based on carrier boards hosting modules of digital signal processors and FPGAs. This paper describes the design and implementation of a network layer library for these platforms. We show how, without a significative lost of performance, it improves the portability of target applications by avoiding the hardware communication complexities. More important yet, it broadens the spectrum of network applications and middlewares that these powerful platforms can support.
Development and evaluation of a centaur robot
Authors: Kuniya Shinozaki, Satoshi Tsuda, Ryohei Nakatsu
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Recently various types of robots are being studied and developed, which can be classified into two groups: humanoid type and animal type. Since each group has its own merits and demerits, a new type of robot is expected to emerge with greater strengths and fewer weaknesses. In this paper we propose a new type of robot called the "Centaur Robot" by merging the concepts of these two types of robots. This robot has a human-like upper body and a four-legged animal-like lower body. Due to this basic architecture, the robot has several merits, including human-like behaviors and stable walking even on non-smooth ground. We describe its hardware and software architectures. Also we describe the experiments to evaluate its walking capability.
Multi-modal Interface for Fluid Dynamics Simulations Using 3---D Localized Sound
Authors: Robyn Taylor, Maryia Kazakevich, Pierre Boulanger, Manuel Garcia, Walter F. Bischof
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

Multi-modal capabilities can be added to a simulation system in order to enhance data comprehension. We describe a system for adding sonification capabilities to a real-time computational fluid dynamics (CFD) simulator. Our system uses Max/MSP modules to add sonic properties to CFD solutions. The enhancements described in this paper allow users to locate sound sources in a 3---D environment using stereo auditory cues to identify data features.
Quantum Experiments Can Test Mathematical Undecidability
Authors: Časlav Brukner
Venue: Proceedings of the 7th international conference on Unconventional Computing (2008)

Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, within this axiomatic system. I will show that certain mathematical propositions can be encoded in quantum states and truth values of the propositions can be tested in quantum measurements. I will then show that whenever a proposition is undecidable within the system of axioms encoded in the state, the measurement associated with the proposition gives random outcomes. This suggests a view according to which randomness in quantum mechanics is of irreducible nature. 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
Impact of Cheating and Non-Cooperation on the Stability and the Performances of Application-Level Multicast Sessions
Authors: Mothanna Alkubeily, Hatem Bettahar, Abdelmadjid Bouabdallah
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Application Level Multicast protocols construct an overlay tree between end-hosts participating in the multicast session. The efficiently of the constructed overlay tree depends entirely on the honesty and on the cooperation of all participating members. However such behavior can not be guaranteed and some selfish and non-cooperative nodes may take profit from the honesty of other members in the overlay. In this paper we investigate the negative impact of cheating nodes on the performances and on the stability ofoverlay tree constructed by our MDA-ALM protocol.