ppxscal/embedding_network huggingface dataset:
Application of Multi-agents in Control of Hydrogen Powered Car to Optimize Fuel Consumption
Authors: Bohumil Horak, Jiri Koziorek, Vilem Srovnal
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Mobile embedded systems belong among typical applications of the distributed systems control in real time. An example of a mobile control system is the hydrogen powered prototype car control system. The design and realization of such distributed control system represent demanding and complex task of real time control for minimization of race car fuel consumption. The design and realization of distributed control system, mention above, is prepared for testing as a complex laboratory task. The control system software uses multi-agent technology with dynamic mutual negotiation of mobile system parts. The real hardware and software model is also important motivation for extended study.
Integrating KM learning activities into business management curriculum instruction
Authors: Rong-Jyue Fang, Chien-Chung Lin, Yu-Fei Chang, Hua-Lin Tsai
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

The purpose of this study is to discuss the importance of knowledge management for enterprises and individuals and to gain abilities of knowledge management through a finance investing management activity in college business course learning. The learning activity includes designing a personal fund management chart and discussing how to develop a student's ability of knowledge management. After participating the activity, students can learn how to express and share their opinions in fund investment. The anticipated benefit of this study for students is to learn the abilities of knowledge obtaining, transformation, application, innovation, protection and so on.
Using Ants' Task Division for Better Game Engines --- A Contribution to Game Accessibility for Impaired Players
Authors: Alexis Sepchat, Romain Clair, Nicolas Monmarché, Mohamed Slimane
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Designing a relevant artificial intelligence engine for video games does not always consist in finding the best solution (best opponent, best path, etc.): it can sometimes consist in offering the player the best gaming experience. Such a good experience is linked with the difficulty level of the proposed challenge. A game that is too easy will be boring whereas a game that is too difficult will be stressful. So, to be interesting for everyone, an artificial intelligence engine should provide an adaptive game level for every player. This game tuning is particularly prominent in the especial case of accessible games for impaired player. In this paper we show that the task division model based on ant colonies can be an interesting way to provide adaptive behaviors in game engines for simple one-player games.
Haptic Interaction with Soft Tissues Based on State-Space Approximation
Authors: Igor Peterlík, Luděk Matyska
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

The well known property of haptic interaction is the high refresh rate of the haptic loop that is necessary for the stability of the interaction. Therefore, only simple computations can be done within the loop. On the other hand, physically-based deformation modeling requires heavy computations. Moreover, if realistic behavior is desired, the models are non-linear and iterative solution is necessary.In this paper, the technique for haptic interaction with non-linear complex model is presented. Our approach, based on approximations of configuration space, is described and the accuracy of the approximation is experimentally determined.
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
Authors: Thomas Colcombet, Christof Löding
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Given a Rabin tree-language and natural numbers i,j, the language is said to be i,j-feasible if it is accepted by a parity automaton using priorities {i,i + 1,...,j}. The i,j-feasibility induces a hierarchy over the Rabin-tree languages called the Mostowski hierarchy.In this paper we prove that the problem of deciding if a language is i,j-feasible is reducible to the uniform universality problem for distance-parity automata. Distance-parity automata form a new model of automata extending both the nested distance desert automata introduced by Kirsten in his proof of decidability of the star-height problem, and parity automata over infinite trees. Distance-parity automata, instead of accepting a language, attach to each tree a cost in ¿ + 1. The uniform universality problem consists in determining if this cost function is bounded by a finite value.
Simulation of mobility models in vehicular ad hoc networks
Authors: Djamel Djenouri, Elmalik Nekka, Wassim Soualhi
Venue: Proceedings of the 2008 Ambi-Sys workshop on Software Organisation and MonIToring of Ambient Systems (2008)

One of the emerging applications that belongs to ambient systems is to transparently and directly interconnect vehicles in roads, making an ad hoc network that enables a variety of applications through distritbuted softwares without the need of any fixed and dedicated infrastructure. The network as well as the embedded computers and sensors in the vehicle will be invisible to the driver, who will get the required services during his journey. The most important kind of services are the ones related to his safety. Before Proceeding to the real implementation of any software or communication protocol in vehicular ad hoc networks (VANETs) it is mandatory to first evaluate it through a comprehensive simulation study. Mobility is an essential parameter that features VANET, and should be carefully considered in the evaluation. To get faithful and correct results in a simulation study, the mobility model should be as realistic as possible. The earlier models used in general mobile ad hoc networks (MANETs), such as the random waypoint, are unsuitable for the VANET application, where the movements cannot take place freely in the open area. Indeed, vehicles move on the existing routes, constrained by many parameters (route intersections, stop and traffic light signals, the presence of other vehicles in front the vehicle, etc.). Some new models taking into account these features have been recently proposed. In this paper we provide an overview of the mobility models newly proposed in literature, which can be used for simulating VANET. After that, we will present our mobility simulator that mimics many of the recent models. Finally, we use this simulator to illustrate the impact of the overtaking on mobility, a parameter ignored by all the previous simulation studies.
Combining Classical and Intuitionistic Implications
Authors: Carlos Caleiro, Jaime Ramos
Venue: Proceedings of the 6th international symposium on Frontiers of Combining Systems (2007)

We present a simple logic that combines, in a conservative way, the implicative fragments of both classical and intuitionistic logics, thus settling a problem posed by Dov Gabbay in [5]. We also show that the logic can be given a nice complete axiomatization by adding four simple mixed axioms to the usual axiomatizations of classical and intuitionistic implications.
LH*RSP2P: a scalable distributed data structure for P2P environment
Authors: Witold Litwin, Hanafi Yakouben, Thomas Schwarz
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

LH*RSP2P is a Scalable Distributed Data Structure (SDDS) designed for P2P applications. It stores and processes data on SDDS peer nodes. Each node is both an SDDS client and, actually or potentially, an SDDS server with application or parity data. The scheme improves on LH*RS. The basic difference is that now key-based queries require at most one forwarding message, instead of possibly two for LH*RS. This property makes LH*RSP2P the fastest P2P or SDDS addressing scheme. The scan operation now also takes at most two rounds. LH*RSP2P parity management reuses the LH*RS Reed Salomon erasure correction scheme to deal efficiently with churn. The file supports unavailability or withdrawal of up to any k &ge; 1 peers, where k is a parameter that can scale dynamically. We discuss the LH*RSP2P design, implementation issues and variants, as well as related work.
A Type System for Client Progress in a Service-Oriented Calculus
Authors: Lucia Acciai, Michele Boreale
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We introduce a type system providing a guarantee of client progress for a fragment of CaSPiS, a recently proposed process calculus for serviceoriented applications. The interplay of sessioning and data-orchestration primitives makes the design of a type system for CaSPiS challenging. Our main result states that in a well-typed CaSPiS system, and in absence of divergence, any client invoking a service is guaranteed not to get stuck during the execution of a conversation protocol because of inadequate service communication capabilities.
Temperature-Aware Computer Systems: Opportunities and Challenges
Authors: Kevin Skadron, Mircea R. Stan, Wei Huang, Sivakumar Velusamy, Karthik Sankaranarayanan, David Tarjan
Venue: IEEE Micro (2003)

Temperature-aware design techniques have an important role to play in addition to traditional techniques like power-aware design and package- and board-level thermal engineering. These authors define the role of architecture techniques and describe HotSpot, an accurate yet fast thermal model suitable for computer architecture research.
A fuzzy approach to define sample size for attributes control chart in multistage processes: An application in engine valve manufacturing process
Authors: Orhan Engin, Ahmet Çelik, İhsan Kaya
Venue: Applied Soft Computing (2008)

Control charts are a basic means for monitoring the quality characteristics of processes to ensure the required quality level. Determine the sample size is a problem for attribute control charts (ACC). Kaya and Engin [I. Kaya, O. Engin, A new approach to define sample size at attributes control chart in multistage processes: an application in engine piston manufacturing process, J. Mater. Process. Technol. 183 (2007) 38-48] developed a model to determine sample size in multistage process and it was solved by Genetic Algorithms (GAs). In their model, the parameters such as defective item rates for raw materials and benches were assumed to be known exactly. But in many real world applications, these parameters may be changed very dynamically due to material, human factors or operating faults. In this study a fuzzy approach for ACC in multistage process is presented and it is solved by GAs. Formulations of this model are calculated based on acceptance sampling approach and, two main parameters are determined for every stage by GAs. These are: sample size, n, and acceptance number, c. The sample size, n, is suggested for ACC. The main contributions of this paper are to develop a fuzzy model for ACC in multistage processes. The proposed approach is applied in an engine valve manufacturing firm and the model is solved by GAs.
On Determination of Early Warning Grade Based on AHP Analysis in Warranty Database
Authors: Sanghyun Lee, Mintae Lee, Culhyun Kim, Chulsu Park, Seungbeom Park, Yuyang Liu, Byungki Kim
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

A warranty claims information system is in general developed as three steps. The first step is a quantitative analysis through the time series detection of warranty claims data. The second step is early warning grade determination, considering both of the quantitave analysis and qualitative factors related to the early warning one. The third step is unit list sampling with pure warranty claims in all these activities. Especially, the considerations in early warning grade determination are the qualitative factors such as change due to complaints of customers, variations between regions, unit types and models, parts significance and so on. AHP analysis is appropriate in connection with these problems. This paper suggests a neural network learning model in determining early warning grade of warranty claims data, which includes AHP analysis and knowledge of quality experts. The early warning grade of warranty claims data using this model can compromise a dispute with rapid quality improvement and cost efficiency. The test result also suggests that the proposed method enhances accuracy of early warning grades in warranty claims database, which is at national famous automobile company.
Exploring Parallel Algorithms for Volumetric Mass-Spring-Damper Models in CUDA
Authors: Allan Rasmusson, Jesper Mosegaard, Thomas Sangild Sørensen
Venue: Proceedings of the 4th international symposium on Biomedical Simulation (2008)

Since the advent of programmable graphics processors (GPUs) their computational powers have been utilized for general purpose computation. Initially by "exploiting" graphics APIs and recently through dedicated parallel computation frameworks such as the Compute Unified Device Architecture (CUDA) from Nvidia. This paper investigates multiple implementations of volumetric Mass-Spring-Damper systems in CUDA. The obtained performance is compared to previous implementations utilizing the GPU through the OpenGL graphics API. We find that both performance and optimization strategies differ widely between the OpenGL and CUDA implementations. Specifically, the previous recommendation of using implicitly connected particles is replaced by a recommendation that supports unstructured meshes and run-time topological changes with an insignificant performance reduction.
Automated inference of software development behaviors: design, implementation and validation of zorro for test-driven development
Authors: Philip M. Johnson
Venue:  (2007)

A recent focus of interest in software engineering research is on low-level software processes, which define how software developers or development teams should carry on development activities in short phases that last from several minutes to a few hours. Anecdotal evidence exists for the positive impact on quality and productivity of certain low-level software processes such as test-driven development and continuous integration. However, empirical research on low-level software processes often yields conflicting results. A significant threat to the validity of the empirical studies on low-level software processes is that they lack the ability to rigorously assess process conformance. That is to say, the degree to which developers follow the low-level software processes can not be evaluated. In order to improve the quality of empirical research on low-level software processes, I developed a technique called Software Development Stream Analysis (SDSA) that can infer development behaviors using automatically collected in-process software metrics. The collection of development activities is supported by Hackystat, a framework for automated software process and product metrics collection and analysis. SDSA abstracts the collected software metrics into a software development stream, a time-series data structure containing time-stamped development events. It then partitions the development stream into episodes, and then uses a rule-based system to infer low-level development behaviors exhibited in episodes. With the capabilities provided by Hackystat and SDSA, I developed the Zorro software system to study a specific low-level software process called Test-Driven Development (TDD). Experience reports have shown that TDD can greatly improve software quality with increased developer productivity, but empirical research findings on TDD are often mixed. An inability to rigorously assess process conformance is a possible explanation. Zorro can rigorously assess process conformance to a specific operational definition for TDD, and thus enable more controlled, comparable empirical studies.
Laplace Equation Inside a Cylinder: Computational Analysis and Asymptotic Behavior of the Solution
Authors: Suvra Sarkar, Sougata Patra
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

The Laplacian in the cylindrical coordinate space has been considered to approximate the solution of a conservative field within a restricted domain. $$ {{\partial^{2}\psi} \over {\partial\rho^2}} + {{1\delta\psi} \over {\rho\partial\rho}} + {{1} \over {\rho^2}}{ {\partial^{2}\psi} \over {\partial\phi^2}} +{{\partial^{2}\psi} \over {\partial{z}^2} } =0 $$Solutions of the Laplacian are represented by expansion in series of the appropriate orthonormal functions. By using asymptotic relations of Bessel Series and Fourier Bessel series, we establish some criteria for the solution to properly reflect the nature of the conservative field.
Physical Basis of Quantum Computation and Cryptography
Authors: Manuel Calixto
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)

The new Quantum Information Theory augurs powerful machines that obey the "entangled" logic of the subatomic world. Parallelism, entanglement, teleportation, no-cloning and quantum cryptography are typical peculiarities of this novel way of understanding computation. In this article, we highlight and explain these fundamental ingredients that make Quantum Computing potentially powerful. 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
Trust-Based Inter-temporal Decision Making: Emergence of Altruism in a Simulated Society
Authors: Tibor Bosse, Martijn C. Schut, Jan Treur, David Wendt
Venue: Multi-Agent-Based Simulation VIII: International Workshop, MABS 2007, Honolulu, HI, USA, May 15, 2007, Revised and Invited Papers (2008)

This paper contributes to the analysis of the question how altruistic behaviour can be in an agent's own interest. The question is addressed by involving a temporal dimension in which altruist behaviour at one point in time can be in the agent's interest at a future point in time, depending on the environment. The claim is that to be able to make reasonable decisions, an agent needs a cognitive system for intertemporal decision making, in relation to a model of the environment. To address this, a society of agents has been modelled, simulated and analysed. Some of the agents have a cognitive system including a model of the environment based on a dynamic model for trust in other agents. This environment model is combined with a model for intertemporal decision making. Agents with this cognitive system show more altruistic behaviour, they get a larger social network, and become in the end healthier than agents without such a cognitive system.
Avoiding semantic and temporal gaps in developing software intensive systems
Authors: Wayne O'Brien
Venue: Journal of Systems and Software (2008)

Development of software intensive systems (systems) in practice involves a series of self-contained phases for the lifecycle of a system. Semantic and temporal gaps, which occur among phases and among developer disciplines within and across phases, hinder the ongoing development of a system because of the interdependencies among phases and among disciplines. Such gaps are magnified among systems that are developed at different times by different development teams, which may limit reuse of artifacts of systems development and interoperability among the systems. This article discusses such gaps and a systems development process for avoiding them.
Proceedings of the 10th ACM workshop on Multimedia and security
Venue: International Multimedia Conference (2008)

Welcome to the ACM Workshop on Multimedia & Security: MM&Sec 2008,. This year the workshop is held in Oxford University Computing Laboratory in the historic city of Oxford, UK. Once again supported by the ACM Special Interest Group on Multimedia, this is the 10th in the workshop series presenting cutting-edge research in security of multimedia processing, transmission and consumption. This year's call for papers attracted a record number of submissions: 61 in total, from a wide variety of countries across Asia, Europe, and North America. The field of submissions was notably strong, and the program committee had to work hard to choose 28 papers (17 long and 11 short) for presentation at the workshop, which also features a short rump session. Topics include traditional areas such as steganography, steganalysis, and digital watermarking, as well as relative newcomers including multimodal authentication and the rapidly-growing topic of digital forensics. The keynote address, given by Prof. Ingemar Cox, BT Chair of Communications at University College London, considers similarities and differences between these research areas. The conference banquet is to be held in the oldest of the Oxford colleges (University College, founded 1249). After presenting the very latest research in the brand new Computing Laboratory building, I hope all participants find time to explore some of the more ancient parts of the English-speaking world's oldest University.
Self-Localization in a Low Cost Bluetooth Environment
Authors: Julio Oliveira Filho, Ana Bunoza, Jürgen Sommer, Wolfgang Rosenstiel
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

Personal navigation systems enjoy great popularity. This work presents an indoor self-localization system that resembles outdoor GPS-Positioning. An user-friendly Bluetooth-based solution has been implemented that provides the user with orientation information within a building. Bluetooth technology allows to keep a low budget and low power system. Our region-based localization method is tailored to run completely on the personal platform, and though assures user privacy. Our approach stands out with platform independence, privacy and power awareness.
Dynamics Analysis of Trust Computing Evolution in P2P Networks
Authors: Fengming Liu, Yongsheng Ding
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Induced by computing of more general networks, such as social networks, trust has been shown to have fundamental effects on the dynamics of evolution. Inspired this, we derive the dynamics governing the evolution of such a system, P2P network, starting from fundamental individual level of trust. We show that how computing is modeled based on game theory and how the ideas of evolutionary theory apply to a specific trust game to analysis the evolutionary dynamics of trust computing. Simulation result concerning the dynamics of evolution in networking lead to the emergence of a trust scenario.