ppxscal/embedding_network huggingface dataset:
Deterministic Graphical Games Revisited
Authors: Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we allow arbitrary real payoffs but disallow moves of chance. We study the complexity of solving deterministic graphical games and obtain an almost-linear time comparison-based algorithm for computing an equilibrium of such a game. The existence of a linear time comparison-based algorithm remains an open problem.
Marine Sensor Networks and Ocean Observatories. A Policy Based Management Approach
Authors: J. Sorribas, A. Barba, E. Trullols, J. del Río, A. Manuel, M. de la Muela
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Sensor networks for environmental data acquisition will play an important role in the development of future large data acquisition systems, particularly in oceanographic observation and operational oceanography. This paper will show the applicability of Policy Based Network Management (PBNM) on Marine Sensor Networks (MSN) and Networked Ocean Observatories aiming to overcome the lack of flexibility imposed by more traditional network management paradigms.
Development of a Sit-to-Stand Assistance System
Authors: Yoshiyuki Takahashi, Osamu Nitta, Kosuke Tomuro, Takashi Komeda
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

A sit-to-stand assistance system with a moving handrail was developed, and experiments were conducted with individuals with Parkinson's disease. This is an outline of the sit-to-stand assistance system and the experiment. The system permits the user to stand up when, ordinarily, he would not be able to do so. The experiment was carried out with individuals who had been diagnosed with Parkinson's disease and could or could not stand up without aid. Comparisons were made using three handrail trajectories.
Motion2Sound
Authors: Aggelos Bousbouras
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Motion2Sound is a program that translates motion properties into sound ones. This is done by using a motion detection system(Open Cv) and one can have as an input a live web-cam or a video. Several parameters are used to enhance the results such as 'intervals' for different scales, 'tunit'(based on psychophysics principles) for minimum time unit of sound generation and 'threshold' for deciding how much of the motion shall be captured and thus translated into sound. It can be a useful tool for different art forms such as video art, experimental dance, theater, e.t.c.It works as a plug-in to sequencer programs such as fruity loops, cubase and others and as a stand alone as well. One can choose whichever virtual instrument he wants for generating sound or the in-built one.
Prolog-Based Real-Time Intelligent Control of the Hexor Mobile Robot
Authors: Piotr Matyasik, Grzegorz J. Nalepa, Piotr Zięcik
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

The paper presents a concept of an intelligent control platform for the Hexor mobile robot, based on the XTT knowledge representation method for rule-based systems. The control systems is implemented in Prolog, with use of the Embedded Prolog Platform. The paper presents real-time control capabilities provided by this solution.
Misuse Cases: Use Cases with Hostile Intent
Authors: Ian Alexander
Venue: IEEE Software (2003)

A misuse case is the negative form of a use case; it documents a negative scenario. Its actor is an agent with hostile intent toward the system under design. The relationships between use and misuse cases document threats and their mitigations. Use- and misuse-case diagrams (shown in the article) are valuable in threat and hazard analysis, system design, eliciting requirements, and generating test cases.
Applying clustering algorithms to web-based adaptive virtual environments
Authors: George Lepouras
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The emergence of the World Wide Web during the past few years has provided a medium for communicating information faster and to more people than before. The technologies used allow for the development of personalised, adaptive to the users' needs, information systems. So far, the complexity of the design and implementation of Virtual Environments has restricted their usage in locally executed, stand-alone applications. In this paper we propose an architecture that permits and facilitates the dynamic, on-the-fly creation of Virtual Environments on the Web that adapt to the users' preferences and profiles. We focus on the algorithms available for creating an efficient virtual environment generation engine. We illustrate the proposed architecture with examples from a case study of a Virtual Museum.
Finding Outlying Items in Sets of Partial Rankings
Authors: Antti Ukkonen, Heikki Mannila
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Partial rankings are totally ordered subsets of a set of items. For example, the sequence in which a user browses through different parts of a website is a partial ranking. We consider the following problem. Given a set D of partial rankings, find items that have strongly different status in different parts of D. To do this, we first compute a clustering of D and then look at items whose average rank in the cluster substantially deviates from its average rank in D. Such items can be seen as those that contribute the most to the differences between the clusters. To test the statistical significance of the found items, we propose a method that is based on a MCMC algorithm for sampling random sets of partial rankings with exactly the same statistics as D. We also demonstrate the method on movie rankings and gene expression data.
A Further Characterization on the Sampling Theorem for Wavelet Subspaces
Authors: Xiuzhen Li, Deyun Yang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Sampling theory is one of the most powerful results in signal analysis. The objective of sampling is to reconstruct a signal from its samples. Walter extended the Shannon sampling theorem to wavelet subspaces. In this paper we give a further characterization on some shift-invariant subspaces, especially the closed subspaces on which the sampling theorem holds. For some shift-invariant subspaces with sampling property, the sampling functions are explicitly given.
The Effectiveness of TriAccess Reading System on Comprehending Nature Science Text for Students with Learning Disabilities
Authors: Ming-Chung Chen, Chun-Han Chiang, Chien-Chuan Ko
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The major purpose of this paper was to explore the effectiveness of an individualized reading system, TriAccess, for students with learning difficulties to comprehend the nature science text. Twenty 5th and 6th grade students with learning disabilities participated in the experiment. All the students read the articles presented with and without multiple representations on the TriAcees system. Six articles related to Endemic species in Taiwan served as experimental material. The results of the experiment indicated that the performance of reading comprehension was better when the participants read with multiple representations.
A Case Study on an Ambient Display as a Persuasive Medium for Exercise Awareness
Authors: Kaori Fujinami, Jukka Riekki
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

In this paper, we propose a persuasive display to motivate walking exercise. The display is an ambient display that is originally daily object like a mirror, and provides information about one's exercise level on the periphery of a line of sight. The presentation is designed to have an unpredictable nature as well as competition/collaboration aspects with others so that he/she could continue the exercise to have a fun with it. We describe an initial case study on information presentation to demonstrate our approach's feasibility and effectiveness, where a mirror is augmented.
Physics and Computation: The Status of Landauer's Principle
Authors: James Ladyman
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

Realism about computation is the view that whether or not a particular physical system is performing a particular computation is at least sometimes a mindindependent feature of reality. The caveat 'at least sometimes' is necessary here because a realist about computation need not believe that all instances of computation should be realistically construed. The computational theory of mind presupposes realism about computation. If whether or not the human nervous system implements particular computations is not a natural fact about the world that is independent of whether we represent it as doing so, then the computational theory of mind fails to naturalise the mind. Realism about computation is also presupposed by attempts to use computational principles such as Landauer's Principle to dispel Maxwell's Demon. Realism about computation has been challenged by Hilary Putnam and John Searle among others. Various arguments have been put forward purporting to show that any physical system of sufficient complexity trivially implements all computations. Ladyman et al. (2007) offer a precisification and general proof Landauer's Principle. In order to do this they present an analysis of what it is for a physical process to implement a logical transformation. In this paper, their analysis is explained and its implications for realism about computation and the use of Landauer's Principle in foundational debates is assessed.
A New Orthogonal Discriminant Projection Based Prediction Method for Bioinformatic Data
Authors: Chao Wang, Bo Li
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

DNA microarray allows the measurement of transcript abundances for thousands of genes in parallel. Though, it is an important procedure to select informative genes related to tumor from those gene expression profiles (GEP) because of its characteristics such as high dimensionality, small sample set and many noises. In this paper we proposed a novel method for feature extraction that is named as Orthogonal Discriminant Projection (ODP). This method is a linear approximation base on manifold learning approach. The ODP method characterizes the local and non-local information of manifold distributed data and explores an optimum subspace which can maximize the difference between non-local scatter and the local scatter. Moreover, it introduces the class information to enhance the recognition ability. A trick has been employed to handle the Small Sample Site (SSS). Experimental results on Non-small Cell Lung Cancer (NSCLC) and glioma dataset validates its efficiency compared to other widely used dimensionality reduction methods such as Principle Component Analysis (PCA), Linear Discriminant Analysis (LDA).
Programmed Graph Rewriting with Time for Simulation-Based Design
Authors: Eugene Syriani, Hans Vangheluwe
Venue: Proceedings of the 1st international conference on Theory and Practice of Model Transformations (2008)

The Discrete EVent system Specification (DEVS) formalism allows for highly modular, hierarchical modelling of timed, reactive systems. DEVS can be used to describe complex control structures for programmed graph transformation. A side-effect of this approach is the introduction of an explicit notion of time. In this paper we show how the explicit notion of time allows for the simulation-based design of reactive systems such as modern computer games. We use the well-known game of PacMan as an example and model its dynamics with programmed graph transformation based on DEVS. This also allows the modelling of player behaviour, incorporating data about human players' behaviour and reaction times. Thus, a model of both player and game is obtained which can be used to evaluate, through simulation, the playability of a game design. We propose a playability performance measure and vary parameters of the PacMan game. For each variant of the game thus obtained, simulation yields a value for the quality of the game. This allows us to choose an "optimal" (from a playability point of view) game configuration. The user model is subsequently replaced by a visual interface to a real player and the game model is executed using a real-time DEVS simulator.
Study on the Optimization Measures of Reducing Supply Chain Cooperation Risks
Authors: Haiyan Yan, Bo Xu, Chen Wang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

In today’s dynamic business environment, the competition pattern is essentially the competition of one supply chain with another rather than single enterprise. Thus, collaborations in enterprises emerge as the times require. Along with the benefits brought by these kinds of collaborations, the risks arising in the cooperation process produce extra costs as well. Therefore, cost control is extending from the internal microscopic focus to the external interactive processes. The traditional cost control methods have limitations in coping with the new risks resulted from the supply chain. By taking into account the external risks level, this paper constitutes a cost control model based on supply chain operational risks which has improved the Activity-based costing and put forward a new perspective in supply chain cost optimization.
Sequent Calculi for Temporal Logics of Common Knowledge and Belief
Authors: Jūratė Sakalauskaitė
Venue: Informatica (2006)

In this paper we consider two logics: temporal logic of common knowledge and temporal logic of common belief. These logics involve the discrete time linear temporal logic operators &ldquo;next&rdquo; and &ldquo;until&rdquo;. In addition the first logic contains an indexed set of unary modal operators &ldquo;agent i knows&rdquo;, the second one contains an indexed set of unary modal operators &ldquo;agent i believes&rdquo;. Also the first logic contains the modality of common knowledge and the second one contains the modality of common belief. For these logics we present sequent calculi with an analytic cut rule. The soundness and completeness for these calculi are proved.
Software Development and Globalization
Authors: H. Dieter Rombach
Venue: Proceedings of the 8th international conference on Product-Focused Software Process Improvement (2007)

Developing software across borders has become an emerging area of software engineering. It is one of the important competitive advantages in today's industry. However, the increased globalization of software development creates many challenges brought by distribution of software life cycle activities among teams separated by various boundaries, such as contextual, organizational, cultural, temporal, geographical, and political.
Biometrics Driven Smart Environments: Abstract Framework and Evaluation
Authors: Vivek Menon, Bharat Jayaraman, Venu Govindaraju
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

We present an abstract framework for `smart indoor environments' that are monitored unobtrusively by biometrics capture devices, such as video cameras, microphones, etc. Our interest is in developing smart environments that keep track of their occupants and are capable of answering questions about the whereabouts of the occupants. We abstract the smart environment by a state transition system: Each state records a set of individuals who are present in various zones of the environment. Since biometric recognition is inexact, state information is probabilistic in nature. An event abstracts a biometric recognition step, and the transition function abstracts the reasoning necessary to effect state transitions. In this manner, we are able to accommodate different types of biometric sensors and also different criteria for state transitions. We define the notions of `precision' and `recall' of a smart environment in terms of how well it is capable of identifying occupants. We have developed a prototype smart environment based upon our proposed concepts, and provide experimental results in this paper. Our conclusion is that the state transition model is an effective abstraction of a smart environment and serves as a basis for integrating various recognition and reasoning capabilities.
Systematic Component-Oriented development with Axiomatic Design
Authors: Cengiz Togay, Ali H. Dogru, John Urcun Tanik
Venue: Journal of Systems and Software (2008)

A form of design guidance is offered through a process that applies Axiomatic Design Theory to Component-Orientation. Axiomatic Design has been proposed by Do and Suh for object-oriented software development. Our approach leverages divide-and-conquer and find-integrate techniques that support service-based development as an alternative to developing code from scratch. Using this process, missing or conflicting components can be identified, and missing components can be defined. The effectiveness of our proposed system is demonstrated through an example based on High Level Architecture (HLA) simulations. Our Component-Oriented approach utilizing axiomatic design theory has been adapted to HLA Federation Development and Execution Process (FEDEP). As one of the Component-Oriented approaches proposed, FEDEP is able to obtain interoperability and reusability of available components, namely federates.
The Non-market Value Assessment in E-Learning
Authors: Lei Yang, Xiaopeng Zhang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The amount of capital investment made by Chinese government on e-learning is on the rise annually. The value generated from these investments has attracted the great attention in the entire society. However, e-learning’s output values often exist as a form of non-market values with uncertainty and there are few evaluation methods at present. It is important to find an effective and reasonable approach to e-learning value assessment. In this paper, the features of e-learning as a kind of public product are analyzed, and a general economic model of users’ WTP (willingness to pay) is set up on the basis of alternation between traditional processes in education and e-learning then a brand new non-market value estimation method and its operational procedures are brought up . Finally, a case of WTP on e-recourse pools is given.
Nonsynonymous to Synonymous Substitution Ratio ka/ks: Measurement for Rate of Evolution in Evolutionary Computation
Authors: Ting Hu, Wolfgang Banzhaf
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Measuring fitness progression using numeric quantification in an Evolutionary Computation (EC) system may not be sufficient to capture the rate of evolution precisely. In this paper, we define the rate of evolution R e in an EC system based on the rate of efficient genetic variations being accepted by the EC population. This definition is motivated by the measurement of "amino acid to synonymous substitution ratio" k a/k s in biology, which has been widely accepted to measure the rate of gene sequence evolution. Experimental applications to investigate the effects of four major configuration parameters on our rate of evolution measurement show that R e well reflects how evolution proceeds underneath fitness development and provides some insights into the effectiveness of EC parameters in evolution acceleration.
Using OS Observations to Improve Performance in Multicore Systems
Authors: Rob Knauerhase, Paul Brett, Barbara Hohlt, Tong Li, Scott Hahn
Venue: IEEE Micro (2008)

Today's operating systems don't adequately handle the complexities of Multicore processors. Architectural features confound existing OS techniques for task scheduling, load balancing, and power management. This article shows that the OS can use data obtained from dynamic runtime observation of task behavior to ameliorate performance variability and more effectively exploit multicore processor resources. The authors' research prototypes demonstrate the utility of observation-based policy.
A Watershed Algorithmic Approach for Gray-Scale Skeletonization in Thermal Vein Pattern Biometrics
Authors: Lingyu Wang, Graham Leedham
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In vein pattern biometrics, analysis of the shape of the vein pattern is the most critical task for person identification. One of best representations of the shape of vein patterns is the skeleton of the pattern. Many traditional skeletonization algorithms are based on binary images. In this paper, we propose a novel technique that utilizes the watershed algorithm to extract the skeletons of vein patterns directly from gray-scale images. This approach eliminates the segmentation stage, and hence prevents any error occurring during this process from propagating to the skeletonization stage. Experiments are carried out on a thermal vein pattern images database. Results show that watershed algorithm is capable of extracting the skeletons of the veins effectively, and also avoids any artifacts introduced by the binarization stage.
Efficient lip-synch tool for 3D cartoon animation
Authors: Shin-ichi Kawamoto
Venue: Computer Animation and Virtual Worlds (2008)

We propose a set of algorithms to efficiently make speech animation for 3D cartoon characters. Our prototype system is based on blendshapes, a linear interpolation technique, which is widely used in facial animation practice. In our system, a few base target shapes of the character, prerecorded voice, and its transcription are required as input. We describe a simple technique that amplifies the target shapes from few inputs using a generic database of viseme mouth shapes. We also introduce additional lip-synch editing parameters that allow designers to quickly tune the lip movements. Based on these, we implement our prototype system as a Maya plug-in. The demonstration movies created with this system illustrate well the practicality of our approach. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Evolutionary-Based Design of a Brazilian Portuguese Recording Script for a Concatenative Synthesis System
Authors: Monique Vitório Nicodem, Izabel Christine Seara, Daiana Anjos, Rui Seara,  Jr., Rui Seara
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

Modifications of prosodic parameters in concatenative synthesis systems may lead to a degradation in speech quality, especially when significant pitch changes are accomplished. Aiming to avoid large changes in the speech signal parameters, the speech corpus should present segments with phonetic and prosodic features close to the predicted ones. This condition is more often fulfilled by a speech corpus specially designed to be both phonetic and prosodically rich. The design of this corpus is strongly dependent on the script chosen for recording. For such, a procedure to select the recording script of a TTS system is proposed for the Brazilian Portuguese language. Selected sentences include declarative, exclamatory, and interrogative ones. Phonetic and prosodic information are firstly represented as a set of feature vectors. Next, the amount of distinct feature vectors is used as a fitness value for a genetic-based sentence selection. Experimental results point out a considerable improvement in script variability for speech synthesis applications.