ppxscal/embedding_network huggingface dataset:
Autonomous functional configuration of a network robot system
Authors: Robert Lundh, Lars Karlsson, Alessandro Saffiotti
Venue: Robotics and Autonomous Systems (2008)

We consider distributed systems of networked robots in which: (1) each robot includes sensing, acting and/or processing modular functionalities; and (2) robots can help each other by offering those functionalities. A functional configuration is any way to allocate and connect functionalities among the robots. An interesting feature of a system of this type is the possibility to use different functional configurations to make the same set of robots perform different tasks, or to perform the same task under different conditions. In this paper, we propose an approach to automatically generate at run time a functional configuration of a network robot system to perform a given task in a given environment, and to dynamically change this configuration in response to failures. Our approach is based on artificial intelligence planning techniques, and it is provably sound, complete and optimal. Moreover, our configuration planner can be combined with an action planner to deal with tasks that require sequences of configurations. We illustrate our approach on a specific type of network robot system, called Peis-Ecology, and show experiments in which a sequence of configurations is automatically generated and executed on real robots. These experiments demonstrate that our self-configuration approach can help the system to achieve greater autonomy, flexibility and robustness.
Model Dependencies, Fine-Grained Relations, and Integrator Tools
Authors: S. Becker, W. Marquardt, J. Morbach, M. Nagl
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

The models developed within subprojects A2 and B2 together form one of the vertical columns of the process/product model. The application domain models of A2 are refined to tool models of B2 such that integrator tools can be realized. The process of building integrators is rather well understood in general, as is the process of refining the application domain models of A2 to tool models of B2. Nevertheless, important parts are missing for a concise and layered process/product model.
Swapping Strategy to Improve I/O Performance of Mobile Embedded Systems Using Compressed File Systems
Authors: Ohhoon Kwon, Yunjung Yoo, Kern Koh
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Compressed file systems are suitable for mobile embedded systems with small capacity of storage systems because the contents of files are stored in a compressed form to save the space of storage in the compressed file systems. Therefore a data should be decompressed before it is accessed by an application program. That is a computational overhead of compressed file systems. Furthermore, the mobile embedded systems exploit demand paging mechanism to cut down their cost and size as well as the compressed file systems. And also, to extend a main memory space, the mobile embedded systems use "swapping" mechanism which stores the data evicted from a main memory in a swap area, and serves the data when the application requests it again. In this paper, we propose the new swapping strategy for the mobile embedded systems using the compressed file systems, which aims to keep the decompressed data of compressed file systems in the swap space and serves them directly from the swap space if necessary. This strategy reduces several copying overhead and decompressing operation of compressed file systems. As a result, it could improve the I/O performance of mobile embedded systems. Trace-driven simulations show that the proposed strategy performs better than existing swapping mechanism in terms of the total I/O performance, page fault ratio, and page fault latency.
Traps and Pitfalls of Topic-Biased PageRank
Authors: Paolo Boldi, Roberto Posenato, Massimo Santini, Sebastiano Vigna
Venue: Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007)

We discuss a number of issues in the definition, computation and comparison of PageRank values that have been addressed sparsely in the literature, often with contradictory approaches. We study the difference between weakly and strongly preferential PageRank, which patch the dangling nodes with different distributions, extending analytical formulae known for the strongly preferential case, and corroborating our results with experiments on a snapshot of 100 millions of pages of the .uk domain. The experiments show that the two PageRank versions are poorly correlated, and results about each one cannot be blindly applied to the other; moreover, our computations highlight some new concerns about the usage of exchange-based correlation indices (such as Kendall's ¿) on approximated rankings.
Impact of Selfish Rate Adaptation on the Performance in IEEE 802.11-Based Wireless Multi-Hop Networks
Authors: Pei Li, Yinlong Xu, Chunpeng Zhang
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Multiple physical layer rates are supported in IEEE 802.11-based wireless networks, where links can adopt joint transmission power control and rate adaptation to achieve energy efficiency. This paper studies the selfish rate adaptation behavior under throughput requirement. A round-based non-cooperative game is proposed assuming there is only one link which can adjust its transmission strategy in each unit time. It is shown that there is an optimal transmission strategy for a link, and a greedy algorithm is presented to select a near-optimal transmission strategy. It is observed that scheduling order affects the feasibility and the total power consumption. To alleviate the influence of scheduling order, pricing function is introduced, which motivates selfish links to share the channel fairly and efficiently. Simulation results show the proposed approach leads to not only more feasible solutions, but also power efficiency.
Data Format and Bus Compatibility in Multiprocessors
Authors: Hubert Kirrmann
Venue: IEEE Micro (1983)

Which end of the data egg gets broken first?big or little? Do you start with the MSB or the LSB? For the proposed IEEE 896 bus, the most practical approach may be the little-endian one.
Controlling deliberation in a Markov decision process-based agent
Authors: George Alexander, Anita Raja, David J. Musliner
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Meta-level control manages the allocation of limited resources to deliberative actions. This paper discusses efforts in adding meta-level control capabilities to a Markov Decision Process (MDP)-based scheduling agent. The agent's reasoning process involves continuous partial unrolling of the MDP state space and periodic reprioritization of the states to be expanded. The meta-level controller makes situation-specific decisions on when the agent should stop unrolling in order to derive a partial policy while bounding the costs of state reprioritization. The described approach uses performance profiling combined with multi-level strategies in its decision making. We present results showing the performance advantage of dynamic meta-level control for this complex agent.
Parameterized Learnability of k-Juntas and Related Problems
Authors: Vikraman Arvind, Johannes Köbler, Wolfgang Lindner
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

We study the parameterized complexity of learning k-juntas and some variations of juntas. We show the hardness of learning k-juntas and subclasses of k-juntas in the PAC model by reductions from a W[2]-complete problem. On the other hand, as a consequence of a more general result we show that k-juntas are exactly learnable with improper equivalence queries and access to a W[P] oracle.
Building Scientific Workflows for Earth System Modelling with Windows Workflow Foundation
Authors: Matthew J. Fairman, Andrew R. Price, Gang Xue, Marc Molinari, Denis A. Nicole, Timothy M. Lenton, Robert Marsh, Kenji Takeda, Simon J. Cox
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

The GENIE project has built a Grid enabled framework that facilitates the integration, execution and management of component models for the study of the Earth system over millennial timescales. The existing framework supports collaborative study of GENIE models across heterogeneous compute grids through scripted workflows in the Matlab environment. In this paper, Windows Workflow Foundation technologies are applied to demonstrate the benefits of an environment that provides rapid composition, event driven logic and reliable hosting of scientific workflows. These improvements are demonstrated through a parametric study of bi-stability of the oceanic thermohaline circulation in a GENIE model.
A New Framework for Plot-Based Interactive Storytelling Generation
Authors: Hussein Karam Hussein Abd El-Sattar
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Interactive storytelling (IS) is a promising growth area in computer-based technologies, in the entertainment computer industry, and other applied areas. Content/story production is a major bottleneck in the entertainment industry. The plot of the story and the character(s) are the two most important elements of a story. Previous work has identified key problems, such as narrative control, the duality between character and plot, and the tension between interactivity and storytelling. In this paper we developed a new framework for solving the narrative control problem and model the story plot generation based on Petri nets reachability analysis. The idea is derived from the study of both Petri nets (PN) and interactive storytelling technology. The approach uses a Petri nets as a state-based model for story plot generation, where each scene in a plot is regarded as a goal to be reached. A complex scene is represented as a composite goal, and a simple scene is represented as an atomic goal. Validation of our approach is given by discussion, analysis and an illustration of some experimental results. 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
Predicting Grid Performance Based on Novel Reduct Algorithm
Authors: Kun Gao
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Because of the irregular characteristic of Grid environment, we are unable to predict the performance using the traditional method. In this paper, we propose a novel method for predicting the performance in Grid Computing environment. The method, based on frequencies of application attributes appeared in discernibility matrix collected during a period of time; predict the applications performance that the traditional methods can't obtain. We use the novel method in Data Ming Grid and obtain better result than traditional methods. The results of the experiment show that the use of reduct algorithm can process uncertain problem in Data Mining Grid. The theoretical foundation of ruduct provides a feasible solution to the problem of predicting Data Mining Grid.
Toward Efficient Support for Multithreaded MPI Communication
Authors: Pavan Balaji, Darius Buntinas, David Goodell, William Gropp, Rajeev Thakur
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

To make the most effective use of parallel machines that are being built out of increasingly large multicore chips, researchers are exploring the use of programming models comprising a mixture of MPI and threads. Such hybrid models require efficient support from an MPI implementation for MPI messages sent from multiple threads simultaneously. In this paper, we explore the issues involved in designing such an implementation. We present four approaches to building a fully thread-safe MPI implementation, with decreasing levels of critical-section granularity (from coarse-grain locks to fine-grain locks to lock-free operations) and correspondingly increasing levels of complexity. We describe how we have structured our implementation to support all four approaches and enable one to be selected at build time. We present performance results with a message-rate benchmark to demonstrate the performance implications of the different approaches.
Caspian: A Tunable Performance Model for Multi-core Systems
Authors: Abbas Eslami Kiasari, Hamid Sarbazi-Azad, Shaahin Hessabi
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Performance evaluation is an important engineering tool that provides valuable feedback on design choices in the implementation of multi-core systems such as parallel systems, multicomputers, and Systems-on-Chip (SoCs). The significant advantage of analytical models over simulation is that they can be used to obtain performance results for large systems under different configurations and working conditions which may not be feasible to study using simulation on conventional computers due to the excessive computation demands. We present Caspian, a novel analytic performance model, aimed to minimize prediction cost, while providing prediction accuracy. This is accomplished by using a G/G/1 priority queueing model which is used for arbitrary network topology with wormhole routing under arbitrary traffic pattern. The accuracy of this model is examined through extensive simulation results.
Application Server for Wireless Sensor Networks
Authors: Janne Rintanen, Jukka Suhonen, Marko Hännikäinen, Timo D. Hämäläinen
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

Wireless Sensor Networks (WSN) can be used in various applications for home and industrial environments. The main challenges in these applications come from the requirement of collecting and presenting continuously changing sensor data. Powerful abstractions are required in order to support diverse WSN configurations and the varying user requirements for sensor data visualization. In this paper, we present the design of an application server for WSNs and the implementation of a server prototype referred to as TUTWSN Application Server (TAS). TAS offers services for permission management, information storing, visualization of sensor data, and messaging required for receiving sensor data from the WSNs in real-time.
Towards background emotion modeling for embodied virtual agents
Authors: Luís Morgado, Graça Gaspar
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

For the realistic simulation of embodied agents we need a model of emotion that represents both structural and dynamic aspects of emotional phenomena to serve as background support for multifaceted emotion characterization. In this paper we present an emotion model oriented towards that aim, which provides a continuous modeling of the evolution of emotional phenomena. We also illustrate how it can be used to provide different perspectives of an emotional situation, namely by identifying emotional patterns that can be characterized as discrete emotional states.
Research on the Application of Improved Text Classific Algorithm in Intelligent Learning Platform
Authors: Rurui Zhou, You-fu Du, Ming Zhao
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

With the rapid developing of the network information, it seems to be quite important to provide a more reasonable text classification algorithm for learners. In this paper,we adopt a sensitivity method to modify the characteristic weight in the distance formula and put up with a cutting method of training sample database based on CURE algorithm and Tabu algorithm; then adopt CURE cluster algorithm to acquire each representative sample in order to constitute a new training sample collection, then use Tabu algorithm to make a further maintenance to this sample collection. While appending the sample, it is only necessary to consider appending the samples of different type boundary. Append or delete sample with classification accuracy highest and with the original training sample database nearest to the rule, and provide learners with reasonable text classification system.
Experimental analysis of pattern similarity between Bessel kernel and born-Jordan kernel
Authors: Ming Li, Xue-Kang Gu, Wei Zhao
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

Kernels play a role in time-frequency (TF) analysis of signals. Various types of kernels have been introduced in TF analysis. Usually, different types of kernels (i.e., kernels in different function form) correspond different types of TF distributions (TFDs). From a view of pattern matching, however, different TFDs may achieve the similar TFD result for a same signal if the used kernels are arranged such that they are similar in pattern under a certain condition. Essential issues in this regard are 1) which kernels may be similar in pattern and 2) under what conditions their patterns are similar. The answers to those issues are meaningful in TF analysis. As a stage work, this paper gives an experimental analysis of the pattern similarity between two types of kernels, the typical Born-Jordan kernel (i.e., Sinc kernel) and the Bessel one. Correlation coefficient is used to measure the pattern similarity. We present the correlation curve between them and propose the quantitative conditions that both kernels are similar and dissimilar. The analysis shows that the maximum similarity between them may reach 0.987 when the value of a scaling factor of Bessel kernel equals to 0.18. On the other hand, the minimum of the correlation between them is less than or equal to 0.55 when the scaling factor is less than or equal to 0.01. Hence, this paper suggests that Bessel kernel is more flexible than the typical Born-Jordan's in TF analysis. A case study is demonstrated.
Learning Models for the Integration of Adaptive Educational Games in Virtual Learning Environments
Authors: Javier Torrente, Pablo Moreno-Ger, Baltasar Fernandez-Manjon
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

There is a trend in Virtual Learning Environments (VLE) towards flexible and adapted learning experiences that modify their contents and behavior to suit the needs of different learners. On the other hand, the use of educational videogames is also an emerging trend to address diverse aspects, such as student engagement and exploratory learning. Additionally, videogames support adaptation in a natural way. This suggests that they may be a good vehicle to enhance the adaptive features of VLE. However, all those ideas are partially disconnected and, in spite of all the work done, there is still a need for effective learning models that leverage the potential of games, integrating them with the available learning materials and VLE. In this work, we discuss such models and describe how the <e-Adventure> educational game platform supports them.
The Evaluation of Effects on Breast Cancer Diagnoses When Using Mammographic Semantic Information
Authors: Da Qi, Erika R. Denton, Joanna M. Leason, Diaa Othman, Reyer Zwiggelaar
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

In this paper, we describe the evaluation of the effects of mammographic semantic information in breast cancer diagnoses. A brief description of relations between semantic information and image features are given. We demonstrate the experiments based on mammographic semantic information and the MIAS database. Mammograms were annotated by expert radiologists with semantic information and assigned NHSBSP five-point score. Two classifiers were applied to automatically classify the mammogram into NHSBSP five-point score using the semantic information and radiologists also classified the mammograms by their own annotated semantic information. The analysis of the experimental results provides further understanding when using mammographic semantic information in breast cancer diagnosis. It also indicated a common knowledge base and links between computers and human experts.
How Do We Build Trust into E-commerce Web Sites?
Authors: Ejike Ofuonye, Patricia Beatty, Ian Reay, Scott Dick, James Miller
Venue: IEEE Software (2008)

Trust is a subjective, user-centric, context-dependent concept, and is thus difficult to define universally. On the Internet, several factors make trust more difficult to build, explaining why some successful brick-and-mortar retail chains have been unable to translate their reputation to the virtual platform the Web offers. Researchers in many fields have been interested in how to build trust in e-commerce sites. To address this issue, the authors reviewed the available literature on the topic, examining 28 relevant publications in depth to identify relationships among factors that impact trust.
Adversary Lower Bounds for Nonadaptive Quantum Algorithms
Authors: Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

We present general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Our results are based on the adversary method of Ambainis.
Towards an Intelligent Emotional Detection in an E-Learning Environment
Authors: Iness Nedji Milat, Hassina Seridi, Mokhtar Sellami
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Several research in psycho-pedagogy showed that the relevance of the training implies as many intellectual aspects as socio-emotional and the emotional state of the learner influence directly his performance in a positive or negative way. For that, the e-learning systems must take into account the emotional state of learners in order to favor their training. However, it is important to underline the implementation problem which is posed and summarized in the detection and the interpretation of the emotions which are not directly observable by the machine and which are generally expressed by a whole of behaviours whose indicators are either the words used, or the voice ton, the gestures and body attitudes or facial expressions. In this paper, we propose emotionally intelligent system architecture dedicated to the learning activities. We focus ourselves more particularly on the process of emotional recognition, ensured by agent EMOTIO, from a bimodal analysis of the speech and text used by a speaker's learner, in a training session, in order to improve the recognition precision (precision in acoustical analysis is 63.44 % but precision in bimodal analysis is 71.2%). This analysis is based on the indices extraction on two linguistic levels: prosodic and lexical.