ppxscal/embedding_network huggingface dataset:
Formalizing Complex Task Libraries in Golog
Authors: Alfredo Gabaldon
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

We present an approach to building libraries of tasks in complex action languages, such as Golog, for query answering. Our formalization is based on a situation calculus framework that allows probabilistic, temporal actions. Once a knowledge base is built containing domain knowledge including type information and a library of tasks and the goals they can achieve, we are interested in queries about the achievability of goals. We consider cases where, using domain object type and goal information in the KB, a user is able to get specific answers to a query while leaving some of the details for the system to figure out. In some cases where the specifics are missing from the KB, the user is provided with possible alternative answers that are compatible with the incomplete information in the KB. This approach is being explored in the context of a military operations planning domain for decision support.
On the Origin of Grid Species: The Living Application
Authors: Derek Groen, Stefan Harfst, Simon Portegies Zwart
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

We present the living application, a method to autonomously manage applications on the grid. During its execution on the grid, the living application makes choices on the resources to use in order to complete its tasks. These choices can be based on the internal state, or on autonomously acquired knowledge from external sensors. By giving limited user capabilities to a living application, the living application is able to port itself from one resource topology to another. The application performs these actions at run-time without depending on users or external workflow tools. We have applied this new concept in a special case of a living application: the living simulation. Today, many simulations require a wide range of numerical solvers and run most efficiently if specialized nodes are matched to the solvers. The idea of the living simulation is that it decides itself which grid machines to use based on the numerical solver currently in use. 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
Realistic Passive Packet Loss Measurement for High-Speed Networks
Authors: Aleš Friedl, Sven Ubik, Alexandros Kapravelos, Michalis Polychronakis, Evangelos P. Markatos
Venue: Proceedings of the First International Workshop on Traffic Monitoring and Analysis (2009)

Realistic and accurate packet loss measurement of production traffic has been challenging, since the frequently-used active monitoring approaches using probe packets cannot capture the packet loss experienced by the traffic of individual user applications. In this paper, we present a new approach for the accurate measurement of the packet loss rate faced by actual production traffic based on passive network monitoring. In contrast to previous work, our method is able to pinpoint the packet loss rate experienced by the individual traffic flows of concurrently running applications. Experimental results suggest that our approach measures packet loss with 100% accuracy for network speeds as high as 12 Gbit/s, while traditional ICMP-based approaches were usually much less accurate. We also report experiences from a real-world deployment of our method in several 10 Gbit/s links of European research networks, where it has been successfully operational for several months.
Force & torque feedback vs force only feedback
Authors: Lawton N. Verner, Allison M. Okamura
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

Providing force and torque feedback in every degree of freedom of a haptic device can be complex and costly, often prohibitively so. Consequently, devices that reduce the number of actuators such as SensAble's PHANTOM Omni, a 6-degree-of-freedom (DOF) positioning, 3-degree-of-freedom force feedback haptic device, have gained popularity. While these devices have been widely accepted, no previous study has examined how performance with force feedback alone differs from performance with force and torque feedback for a 6-DOF positioning device. Results from this user study show that for simple tasks like drawing and tracing, performance with force feedback alone can approximate the performance with force and torque feedback. Similarly, torque feedback alone is sufficient to minimize contact forces, but is disconcerting to users.
An implementing framework for holonic manufacturing control with multiple robot-vision stations
Authors: Theodor Borangiu, Pascal Gilbert, Nick-Andrei Ivanescu, Andrei Rosu
Venue: Engineering Applications of Artificial Intelligence (2009)

The paper describes a holonic control architecture and implementing issues for agile job shop assembly with networked intelligent robots, based on the dynamic simulation of material processing and transportation. The holarchy was defined considering the PROSA reference architecture relative to which in-line vision-based quality control was added by help of feature-based descriptions of the material flow. Two solutions for production planning are proposed: a knowledge-based algorithm using production rules, and an OO resolved scheduling rate planner (RSRP) based on variable-timing simulation. Failure- and recovery-management are developed as generic scenarios embedding the CNP mechanism into production self-rescheduling. Aggregate Order Holon execution is realized by OPC-based PLC software integration and event-driven product transportation. The holonic control of multiple networked robot-vision stations also features tolerance to station computer- (IBM PC-type), station controller- (robot controller), quality control- (machine vision) and communication- (LAN) failure. Fault tolerance and high availability at shop-floor level are provided due to the multiple physical communication capabilities of the robot controllers, to their multiple-axis multitasking operating capability, and to hardware redundancy of single points of failure (SPOF). Implementing solutions and experiments are reported for a 6-station robot-vision assembly cell with twin-track closed-loop pallet transportation system and product-racking RD/WR devices. Future developments will consider manufacturing integration at enterprise level.
Theoretical principles of quantum information science
Authors: Miroslav Svítek
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

Paper presents main principles of quantum informatics together with the basic approach to quantum information measures. Quantum informatics is very promising way for future development of information technologies and computers. Paper summarizes the current author's results achieved in theoretical area of quantum informatics.
Standards, Adaptation & Pedagogy: Quality Assessment in e-Learning
Authors: Silvia Sanz-Santamaría, Julián Gutiérrez Serrano, José A. Vadillo Zorita
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This is a summary about a paper that presents a new authoring tool for e-learning assessment that lets teachers testing students efficiently. The combination of different research fields inside the tool, namely pedagogy, learner adaptation and standards, makes possible a better and complete assessment adapted to learners' knowledge and preferences.
The hp finite element method for singularly perturbed systems of reaction-diffusion equations
Authors: Christos Xenophontos
Venue: Neural, Parallel Scientific Computations (2008)

We consider the approximation of a coupled system of two singularly perturbed reaction-diffusion equations, with the finite element method. The solution to such problems contains boundary layers which overlap and interact, and the numerical approximation must take this into account in order for the resulting scheme to converge uniformly with respect to the singular perturbation parameters. We present results on a high order hpfinite element scheme which includes elements of size O(Ɛp) and O(µp) near the boundary, where Ɛ, µ are the singular perturbation parameters and pis the degree of the approximating polynomials. Under the assumption of analytic input data, the method yields exponential rates of convergence as p→ ∞, independently of Ɛ and µ. Numerical computations supporting the theory are also presented.
TMSP: Terminal Mobility Support Protocol
Authors: Teck Meng Lim, Chai Kiat Yeo, Francis Bu Sung Lee, Quang Vinh Le
Venue: IEEE Transactions on Mobile Computing (2009)

Mobile IP enables IP mobility support for mobile node (MN), but it suffers from triangular routing, packet redirecting, increase in IP header size, and the need for new infrastructure support. This paper details an alternative to enable terminal mobility support for MN. This scheme does not suffer from triangular routing effect and does not require dedicated infrastructure support such as home agent. It also does not increase the size of the IP header and does not require redirection of packets. These benefits are enabled with a tradeoff, which requires modifications on MN and its correspondent node. It uses an innovative IP-to-IP address mapping method to provide IP address transparency for applications and taps on the pervasiveness of SIP as a location service. From our analysis, we show that TMSP is much more efficient than mobile IP in terms of the number of hops as well as overhead. Our prototype implementation also shows that TMSP provides seamless communication for both TCP and UDP connections and the computational overhead for TMSP has minimal impact on packet transmission.
Efficient multimedia transmission using adaptive packet bursting for wireless LANs
Authors: J. Wall, Jamil Y. Khan
Venue: Computer Communications (2009)

In addition to an unprecedented 600Mb/s physical data rate in upcoming standards with greater than 1Gb/s being considered for future systems, 802.11 has evolved from its earlier incarnations to become a ubiquitous, high-throughput wireless access technology utilized in heterogeneous networks. Although capable of advanced QoS provisioning, commercial 802.11 implementations often support only a subset of QoS specifications, utilize manufacturer-specific QoS enhancements, or use sub-optimal MAC reference specifications with limited capability in achieving optimal system throughput and QoS provisioning. Although more efficient ARQ modes have been defined in the 802.11e and imminent 802.11n amendment standards, opportunities exist within this framework for further optimization through dynamic adaptation of key ARQ-related parameters, which is out of scope of current 802.11 standard specifications. Considering such opportunities, this article presents a novel adaptive ARQ scheme designed to improve the quality and reliability of multimedia transmission through the real-time adaptation of the maximum packet burst size and actual ARQ mode employed. Comprehensive simulation studies show that this scheme can potentially improve the QoS and throughput performance of multimedia traffic in both existing and future 802.11 wireless LANs.
The Process of Integrating Ontologies for Knowledge Base Systems
Authors: Jarosław Koźlak, Anna Zygmunt, Adam Łuszpaj, Kamil Szymański
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Ontologies are currently more and more frequently used to represent knowledge in distributed heterogeneous environments. This approach supports knowledge sharing and knowledge reuse. In order to increase the effectiveness of such solutions, a method should be developed which would enable us to integrate ontologies coming from various sources. The article presents a concept for integration of knowledge, based on structural and lexical similarity measures, including the Similarity Flooding algorithm. The proposed concepts are demonstrated on the basis of a selected area of medical studies: the analysis of the incidence of hospital infections. Sample ontologies (exhibiting structural or lexical similarities) have been developed and for each case a suitable algorithm is proposed.
Expressiveness of the data flow and data state models in visualization systems
Authors: Ed H. Chi
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

Visualization can be viewed as a process that transforms raw data (value) into views. There has been two major category of data process models that have been proposed to model the visualization transformation process. This paper seeks to compare the Data Flow Models and the Data State Models. Specifically, it proves that, in terms of expressiveness, anything that can represented using the Data Flow Model can also be represented using the Data State Model, and vice versa.
GRID Resource Searching on the GridSim Simulator
Authors: Antonia Gallardo, Luis Díaz Cerio, Roque Messeguer, Andreu Pere Isern-Deyà, Kana Sanjeevan
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Nowadays, the Grid is the focus of multiple researches. Our work is centered on Resource Management for Grids as it is an opened and current research area. Decentralized, scalable and efficient resource search algorithms are one of the key issues for resource management in large Grid systems. Resource search is required in order to allocate applications and data efficiently and to maintain the quality of service at runtime, just to mention some examples. In this work, we propose a scheme that presents essential characteristics for self-configuring search and is able to handle dynamic resources, such as memory capacity. Our approach consists on a hypercube topology connecting the nodes and a scalable and self-configuring search procedure. The algorithm improves the probability of reaching the alive nodes in the Grid even in the presence of non-alive ones (inaccessible, crashed or heavy loaded nodes). In this paper, after the theory's description, we present some results obtained by running our search protocol on the GridSim simulator. We have evaluated 6 different metrics performing several resources searches and we show the arithmetic media for each measure.
A novel physical carrier sensing scheme for enhancing spatial reuse in multihop wireless networks
Authors: Yongning Zhang, Bassel Alawieh, Chadi Assi
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Recently, tuning the physical carrier sensing threshold (CSth) has been proposed as an efficient mechanism to enhance the network throughput in an IEEE 802.11-based multihop ad hoc networks. The physical carrier sensing method reduces the likelihood of collision by preventing nodes in the vicinity of each other from transmitting simultaneously, while allowing nodes that are separated by a safe margin to engage in concurrent transmission. In this paper, we propose a distributed adaptive scheme through which nodes dynamically adjust their CSth to eliminate the likelihood of collisions from hidden terminals and in turn enhances spatial reuse by reducing the number of exposed terminals. Specifically, a node adjusts its CSth based on both its success/ failure history attempts and the information it receives from neighboring nodes through CTS packets. Moreover, to reduce the effect of exposed terminals, the proposed scheme employs the RTS/CTS exchange only for the purpose of informing neighboring nodes of their CSth but not to silence them. The proposed scheme adaptively performs a dynamic switch between the RTS/CTS access scheme and the basic scheme based on a predefined policy in order to avoid the additional overhead caused by the RTS/CTS exchange. Simulations results have demonstrated the significant throughput gains that can be achieved by the proposed scheme, compared with other methods in recent literature.
Panel Discussion: What are the bottlenecks, and how soon to AGI?
Authors: Stan Franklin, Hugo de Garis, Sam S. Adams, Eric Baum, Pei Wang, Steve Grand, Ben Goertzel, Phil Goetz
Venue: Proceeding of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006 (2007)

At the end of the 2006 AGI Workshop, a number of presenters were invited to participate in a panel discussion on the theme “What Are the Bottlenecks, and How Soon to AGI?” This chapter presents a record of that dialogue, including audience participation, lightly edited by the presenters themselves for greater readability.
Confidence management in FIPA environments: agent unique representation
Authors: Amadeu Albós, Alan Ward
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

In this article a possible solution to the problem of confidence management in multi-agent systems based on the FIPA specification, and containing both autonomous and mobile agents, is presented. Through ensuring unique original agent representation, using a Public Key Infrastructure and validating agent actions, the validity and uniqueness of actors and interactions is demonstrated.
Computer Organization and Architecture: WITH Discrete Mathematics for Computer Scientists AND Digital Design Designing for Performance
Authors: William Stallings, J. K. Truss, M. Morris Mano, Michael D. Ciletti
Venue:  (2007)

Discrete Mathematics for Computer Scientists 2/E This popular introduction to discrete mathematics for computer scientists combines a rigorous approach to mathematical concepts with strong motivation of these techniques via practical examples. Computer Organization and Architecture: Designing for Performance 7/E With up-to-date coverage of modern architectural approaches, this new edition provides a thorough discussion of the fundamentals of computer organization and architecture, as well as the critical role of performance in driving computer design. Coverage is supported by a wealth of concrete examples emphasizing modern RISC, CISC, and superscalar systems. Digital Design 4/E Digital Design, fourth edition is a modern update of the classic authoritative text on digital design. This book teaches the basic concepts of digital design in a clear, accessible manner. The book presents the basic tools for the design of digital circuits and provides procedures suitable for a variety of digital applications.
New Perspectives on Microsoft Office Access 2007, Brief, 1st edition
Authors: Joseph J. Adamski, Kathy T. Finnegan
Venue: New Perspectives Series (2007)

Following the critical thinking, problem-solving approach of the New Perspectives Series learners will gain a comprehensive understanding of Microsoft Access 2007, including the new features of the software. The case-based tutorials challenge learners to apply what they are learning to real-life tasks, preparing them to easily transfer skills to new situations. With the New Perspectives Series approach, learners understand why theyre learning what theyre learning, and are better situated to retain skills.
A Unified Framework for Sub-stream Scheduling in P2P Hybrid Streaming Systems and How to Do Better?
Authors: Zhenjiang Li, Yao Yu, Xiaojun Hei, Danny Hin-Kwok Tsang
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

The pull-push hybrid P2P streaming, as an emerging and promising approach, has achieved some success in delivering live video traffic. The sub-stream scheduling problem is a key design issue in a hybrid system. In this paper, we propose a max-flow model for unifying this sub-stream scheduling problem. We find that the sub-stream scheduling problem in GridMedia, CoolStreaming+ and LStreaming can be formulated into a special case of the proposed max-flow model. We further propose a min-cost flow model to combat peer heterogeneity in scheduling sub-streams. This min-cost flow model is implemented in a prototype system, LStreaming+. The accuracy of the max-flow model and the outstanding performance of LStreaming+ are demonstrated by extensive simulations. We also show that LStreaming+ achieves excellent performance in prototype experiments.
An Integrative Methodology for Teaching Embodied Non-Linguistic Agents, Applied to Virtual Animals in Second Life
Authors: Ben Goertzel, Cassio Pennachin, Nil Geissweiller, Moshe Looks, Andre Senna, Welter Silva, Ari Heljakka, Carlos Lopes
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

A teaching methodology called Imitative-Reinforcement-Corrective (IRC) learning is described, and proposed as a general approach for teaching embodied non-linguistic AGI systems. IRC may be used with a variety of different learning algorithms, but it is particularly easily described in EC lingo. In these terms, it is a framework for automatically learning a procedure that generates a desired type of behavior, in which: a set of exemplars of the target behavior-type are utilized for fitness estimation; reinforcement signals from a human teacher are used for fitness evaluation; and the execution of candidate procedures may be modified by the teacher via corrections delivered in real-time. An example application of IRC to teach behaviors to AI-controlled artificial animals embodied in the Second Life virtual world is described in detail, including a review of the overall virtual-animal-control software architecture and how the integrative teaching/learning methodology fits into it. In this example application architecture, the learning algorithm may be toggled between hillclimbing and probabilistic evolutionary learning. Envisioned future applications are also discussed, including an application to embodied language learning applicable to agents in Second Life and other virtual worlds.
Diversity Combining and SNR Estimation for Turbo-Coded Frequency-Hopped Spread-Spectrum in Partial-Band Interference and Fading Channels
Authors: Ayman Elezabi, Ahmad Gomaa
Venue: Wireless Personal Communications: An International Journal (2009)

We compare different combinations of the repetition diversity order L and code rate R for turbo-coded Frequency-Hopped Spread-Spectrum (FH/SS) communication systems in the presence of fading and partial-band Gaussian interference. For a fixed overall channel code rate R/L we show that using the lowest code rate and no repetition diversity always performs better than using a higher code rate and some repetition for both coherent and non-coherent schemes. We then propose a simple maximum-likelihood-based method for signal-to-noise-ratio (SNR) estimation in Non-Coherent Binary Frequency Shift Keying (NCBFSK) without training symbols. Except for impractically small hop sizes of 8 bits or less we obtain performance virtually equal to that of perfect SNR knowledge but with much less complexity than iterative schemes previously proposed. For the case of Coherent Binary Phase Shift Keying (CBPSK) we derive the Expectation Maximization (EM) estimate of the SNR without training symbols and iteratively feed the estimator with the extrinsic information from the turbo decoder. The performance for CBPSK is near that of perfect SNR knowledge for hop sizes of 64 bits or more. Unlike previously proposed methods for CBPSK the EM estimate of SNR does not require knowledge of the noise and interference variance, received bit energy, or the fading channel model.