ppxscal/embedding_network huggingface dataset:
Performance related energy exchange in haptic human-human interaction in a shared virtual object manipulation task
Authors: Daniela Feth, Raphaela Groten, Angelika Peer, Sandra Hirche, Martin Buss
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

In order to enable intuitive physical interaction with autonomous robots as well as in collaborative multi-user virtual reality and tele-operation systems a deep understanding of human-human haptic interaction is required. In this paper the effect of haptic interaction in single and dyadic conditions is investigated. Furthermore, an energy-based framework suitable for the analysis of the underlying processes is introduced. A pursuit tracking task experiment is performed where a virtual object is manipulated, jointly by two humans and alone. The performance in terms of the root-mean-square tracking error is improved in dyadic compared to individual conditions, even though the virtual object mass is reduced to one half in the latter. Our results indicate that the interacting partners benefit from role distributions which can be associated with different energy flows.
Lemmatization of Polish person names
Authors: Jakub Piskorski, Marcin Sydow, Anna Kupść
Venue: Proceedings of the Workshop on Balto-Slavonic Natural Language Processing: Information Extraction and Enabling Technologies (2007)

The paper presents two techniques for lemmatization of Polish person names. First, we apply a rule-based approach which relies on linguistic information and heuristics. Then, we investigate an alternative knowledge-poor method which employs string distance measures. We provide an evaluation of the adopted techniques using a set of newspaper texts.
Designing exploratory search tasks for user studies of information seeking support systems
Authors: Bill Kules, Robert Capra
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This poster describes a procedure for designing exploratory tasks for use in laboratory evaluations of information seeking interfaces. This procedure is grounded in the literature on information seeking and information retrieval and has been refined by an evaluation of four tasks designed for a study of a faceted library catalog. The procedure is intended to be extensible to generate exploratory tasks for other types of interfaces and domains.
Comparison of dynamic system modeling methods
Authors: A. Terry Bahill, Ferenc Szidarovszky
Venue: Systems Engineering (2009)

This paper compares state-equation models to state-machine models. It compares continuous system models to discrete system models. The examples were designed to be at the same level of abstraction. This paper models these systems with the following methods: the state-space approach of Linear Systems Theory, set-theoretic notation, block diagrams, use cases, UML diagrams and SysML diagrams. This is the first paper to use all of these modeling methods on the same examples. &copy; 2008 Wiley Periodicals Inc. Syst Eng
Scheduling and Flow-Related Problems in Networks
Authors: Alexander Hall
Venue:  (2007)

Recently the number of applications in the Internet which use data broadcasts, such as pay-per-view services, has increased greatly. In broadcast scheduling one is interested in answering user requests in such services with as little bandwidth as possible by bundling the answers appropriately. Flows over time are an important notion arising in connection with various applications in communication and transportation networks. One of the basic question here is how can demands in a given network be routed to their destinations as quickly as possible? Economic relationships in the Internet are of great interest, e.g., when investigating robustness issues. Since they are treated as trade secrets, it is a challenge to infer them form samples of routes taken by packets in the Internet. The author Alexander Hall gives introductions and several novel results for these three problem areas. Some of the main results resolve the complexity of the major optimization problems encountered in the three areas. Thereby, important and in some cases long-standing open questions have been answered. From an algorithmic point of view, optimal and approximation algorithms for each of the three areas are proposed. This book is of interest to scientists in academia and industry working on research problems pertaining to communication and transportation networks. 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
Mixed convection boundary layer flow near the lower stagnation point of a solid sphere with newtonian heating
Authors: Mohd. Zuki Salleh, Roslinda Nazar, Kamarulzaman Ibrahim
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The steady mixed convection boundary layer flow near the lower stagnation point of a solid sphere, generated by Newtonian heating in which the heat transfer from the surface is proportional to the local surface temperature, is considered in this study. The governing boundary layer equations are first transformed into a system of non-dimensional equations via the non-dimensional variables, and then into non-similar equations before they are solved numerically using an implicit finite-difference scheme known as the Keller-box method. Numerical solutions are obtained for the velocity and temperature profiles with two parameters, namely the mixed convection parameter λ and the Prandtl number Pr.
Cognitive Wireless Networks: Concepts, Methodologies and Visions Inspiring the Age of Enlightenment of Wireless Communications, 1st edition
Authors: Frank H. P. Fitzek, Marcos D. Katz
Venue:  (2007)

In the Age of Enlightenment the German philosopher Immanuel Kant encouraged people to use their own mind as the basis for reasoning instead of following dogmatic religious rules - Sapere aude! (dare to know!) - Today wireless communication networks are increasingly becoming aware of the conditions of its their component parts and surrounding environment. Cognition, a continuous process involving sensing, reasoning, understanding and reacting, can be applied to wireless networks in order to adapt the system to the highly dynamic wireless ecosystem. The ultimate goals are to enhance the efficiency in the use of radio resources as well as to improve both link and network performance. This book presents a detailed overview of a rapidly emerging topic in modern communications: cognitive wireless networks. The key aspects of cognitive and cooperative principles in wireless networks are discussed in this book. Furthermore, Cognitive Wireless Networks advocates the concept of breaking up the cellular communication architecture by introducing cooperative strategies among wireless devices. Cognitive wireless networking is the key to success in handling the upcoming dynamic network configurations and exploiting this cross-over to the fullest extent. As wireless networks become pervasive, highly populated and increasingly complex, the essential preconditions for exploiting rich interactions among mobile devices are better fulfilled. Today, these trends are giving rise to new communications paradigms making use of cooperation and cognition as the main underlying principles. Cognition, together with its complementary principle cooperation, confer to the wireless networks some degree of consciousness or understanding about their own existence, such as internal structure, capabilities, relationships to the outside world, limitations, current use of radio resources and many more. Current wireless networks are aware of their surrounding environment to a very limited extent, but in future wireless networks this capability will be highly developed, as a consequence of exploiting jointly cooperative and cognitive principles. Especially for cooperative wireless networks, where the communication scenario is highly dynamic, the mobile devices need to adapt their capabilities in a flexible manner, taking advantage of cognitive principles.
Engineering the divide-and-conquer closest pair algorithm
Authors: Minghui Jiang, Joel Gillespie
Venue: Journal of Computer Science and Technology (2007)

We improve the famous divide-and-conquer algorithm by Bentley and Shamos for the planar closest-pair problem. For n points on the plane, our algorithm keeps the optimal O(n log n) time complexity and, using a circle-packing property, computes at most 7n/2 Euclidean distances, which improves Ge et al.'s bound of (3n log n)/2 Euclidean distances. We present experimental results of our comparative studies on four different versions of the divide-and-conquer closest pair algorithm and propose two effective heuristics.
Large-Scale Linguistic Ontology as a Basis for Text Categorization of Legislative Documents
Authors: Natalia Loukachevitch, Boris Dobrov
Venue: Proceeding of the 2005 conference on Legal Knowledge and Information Systems: JURIX 2005: The Eighteenth Annual Conference (2005)

The paper describes the structure and properties of a large linguistic ontology --a new kind of information retrieval thesaurus-Thesaurus on Sociopolitical Life for Conceptual Indexing. The thesaurus is used in various real-scale information-retrieval applications in the legal domain. At present one of the main applications of the Thesaurus is knowledge-based text categorization. Categories are connected with the Thesaurus by flexible relationships. The categorization system can process text collections containing texts different in sizes and types.
Computer Simulation as an Instructional Technology in AutoTutor
Authors: Hyun-Jeong Joyce Kim, Art Graesser, Tanner Jackson, Andrew Olney, Patrick Chipman
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

We explored the impact on learning of interactive simulations that were coordinated with AutoTutor, a learning environment that helps students by holding a conversation in natural language. We randomly assigned 132 college students to one of three conditions: AutoTutor without simulations, AutoTutor with simulations, and a Monte Carlo AutoTutor that randomly generated dialogue moves. A pretest-posttest design was used to measure learning gains, as measured by objective multiple choice questions. All versions of AutoTutor were successful in promoting learning. The Monte Carlo AutoTutor produced significantly lower gains than the interactive simulation version for higher knowledge learners, and the direction of the three means were in the predicted direction. Improved simulation dialogues, modeling of good simulation manipulation strategies, and faster display of simulations are expected to enhance learning in future versions of AutoTutor.
Interval neutrosophic sets and topology
Authors: Francisco Gallego Lupiáñez
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

On 2005, F. Smarandache generalized the Atanassov's intuitionistic fuzzy setsto neutrosophic sets. Also, this author and some co-workers introduced the notion of interval neutrosophic set, which is an instance of neutrosophic set and studied various properties. The notion of neutro- sophic topology on the non-standard interval is also due to Smarandache. We study in this paper relations between interval neutrosophic sets and topology.
A Heuristic for Fair Correlation-Aware Resource Placement
Authors: Raouf Boutaba, Martin Karsten, Maxwell Young
Venue: Proceedings of the 8th International Symposium on Experimental Algorithms (2009)

The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenance of networks. To address the issue of resource placement, we analyze and implement a semidefinite programming-based heuristic for solving a known NP-complete graph optimization problem called Maximum Size Bounded Capacity Cut. Experimental results for our heuristic demonstrate promising performance on both synthetic and real world data. Next our heuristic is used as a sub-routine to solve another known NP-complete problem called Min-Max Multiway Cut whose traits we adapt to yield a resource placement scheme that exploits correlations between network resources. Our experimental results show that the resulting placement scheme achieves a significant savings in communication overhead.
Concentration of Measure for the Analysis of Randomized Algorithms, 1st edition
Authors: Devdatt Dubhashi, Alessandro Panconesi
Venue:  (2009)

Randomized algorithms have become a central part of the algorithms curriculum based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high- probability estimates on the performance of randomized algorithms. It covers the basic tool kit from the Chernoff-Hoeffding (CH) bounds to more sophisticated techniques like Martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities, and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as CH bounds in dependent settings. The authors emphasize comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.
Five-fingered haptic interface robot: HIRO III
Authors: Takahiro Endo, Haruhisa Kawasaki, Tetsuya Mouri, Yasutoshi Doi, Tetsunori Yoshida, Yasuhiko Ishigure, Hisayuki Shimomura, Masato Matsumura, Kazumi Koketsu
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

This paper presents the design and characteristics of a five-fingered haptic interface robot: HIRO III. The aim of the paper is to provide a high-precision force representation at the five human fingertips. HIRO III consists of a 15-degree-of-freedom (DOF) haptic hand, a 6 DOF interface arm and a control system. The haptic interface, which consists of a robot arm and hand, can be used in a large workspace and can provide multipoint contact between the user and a virtual environment. However, the following problems peculiar to a multi-DOF robot have resulted: a backlash, a large amount of friction, many motors, and many sensors. In order to solve these problems, a new mechanism and a wire-saving control system have been designed and developed. Furthermore, experiments in both free space and constraint space have been carried out. In comparison with the previous HIRO, the force errors in free space and in constraint space have been reduced to 30% and 57%, respectively. These results show a high-precision force representation and the great potential of HIRO III.
Integrated System Analysis Environment for the Continuous Consistency and Completeness Checking
Authors: Erki Eessaar
Venue: Proceeding of the 2006 conference on Knowledge-Based Software Engineering: Proceedings of the Seventh Joint Conference on Knowledge-Based Software Engineering (2006)

Modelers create models of a system during information system development. Models should be correct, complete and consistent in order to be most useful. Modeler must have possibility to use software that helps to automate these kinds of checks in order to raise the speed of work and quality of its results. This article describes the software system that allows to perform strategic-and detailed analysis of a database-centric information system without using complicated visual notations. System supports methodological framework for the Enterprise Information System (EIS) strategic analysis (like the one that is described by Roost et al. [1]). User of the proposed system records specification in a database as a single integrated model. We propose database queries that help to find consistency and completeness (CC) problems of the recorded models.
Data Parallel Bin-Based Indexing for Answering Queries on Multi-core Architectures
Authors: Luke J. Gosink, Kesheng Wu, E. Wes Bethel, John D. Owens, Kenneth I. Joy
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

The multi-core trend in CPUs and general purpose graphics processing units (GPUs) offers new opportunities for the database community. The increase of cores at exponential rates is likely to affect virtually every server and client in the coming decade, and presents database management systems with a huge, compelling disruption that will radically change how processing is done. This paper presents a new parallel indexing data structure for answering queries that takes full advantage of the increasing thread-level parallelism emerging in multi-core architectures. In our approach, our Data Parallel Bin-based Index Strategy (DP-BIS) first bins the base data, and then partitions and stores the values in each bin as a separate, bin-based data cluster. In answering a query, the procedures for examining the bin numbers and the bin-based data clusters offer the maximum possible level of concurrency; each record is evaluated by a single thread and all threads are processed simultaneously in parallel.We implement and demonstrate the effectiveness of DP-BIS on two multi-core architectures: a multi-core CPU and a GPU. The concurrency afforded by DP-BIS allows us to fully utilize the thread-level parallelism provided by each architecture---for example, our GPU-based DP-BIS implementation simultaneously evaluates over 12,000 records with an equivalent number of concurrently executing threads. In comparing DP-BIS's performance across these architectures, we show that the GPU-based DP-BIS implementation requires significantly less computation time to answer a query than the CPU-based implementation. We also demonstrate in our analysis that DP-BIS provides better overall performance than the commonly utilized CPU and GPU-based projection index. Finally, due to data encoding, we show that DP-BIS accesses significantly smaller amounts of data than index strategies that operate solely on a column's base data; this smaller data footprint is critical for parallel processors that possess limited memory resources (e.g. GPUs).
Stochastic scheduling on parallel machines to minimize discounted holding costs
Authors: Xiaoqiang Cai, Xianyi Wu, Xian Zhou
Venue: Journal of Scheduling (2009)

We study stochastic scheduling on m parallel identical machines with random processing times. The cost involved in the problem is discounted to the present value and the objective is to minimize the expected discounted holding cost, which covers in a unified framework many performance measures discussed in the literature as special cases, including discounted rewards, flowtime, and makespan. We prove that the SEPT rule is optimal, on a fairly general ground, in the class of preemptive dynamic policies, the class of nonpreemptive dynamic policies, and the class of nonpreemptive static list policies. The LEPT rule, on the other hand, is optimal to minimize the expected discounted makespan only under certain restrictive conditions. Without such conditions, the LEPT rule is found no longer optimal for discounted makespan by a counterexample, in contrast to the case without discounting.
Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis, 1st edition
Authors: Uffe B. Kjaerulff, Anders L. Madsen
Venue:  (2007)

Probabilistic networks, also known as Bayesian networks and influence diagrams, have become one of the most promising technologies in the area of applied artificial intelligence, offering intuitive, efficient, and reliable methods for diagnosis, prediction, decision making, classification, troubleshooting, and data mining under uncertainty. Bayesian Networks and Influence Diagrams: A Guide to Construction and Analysis provides a comprehensive guide for practitioners who wish to understand, construct, and analyze intelligent systems for decision support based on probabilistic networks. Intended primarily for practitioners, this book does not require sophisticated mathematical skills or deep understanding of the underlying theory and methods nor does it discuss alternative technologies for reasoning under uncertainty. The theory and methods presented are illustrated through more than 140 examples, and exercises are included for the reader to check his/her level of understanding. The techniques and methods presented for knowledge elicitation, model construction and verification, modeling techniques and tricks, learning models from data, and analyses of models have all been developed and refined on the basis of numerous courses that the authors have held for practitioners worldwide.
ABAP Basics
Authors: Gnther Frber, Julia Kirchner
Venue:  (2007)

If you'd like to learn how to program your first executable ABAP applications, then this book is your ideal companion. Whether or not you're already familiar with another programming language, you'll benefit from straightforward explanations and step-by-step instruction to efficiently master the basics of programming business-critical applications with ABAP. Comprehensive, easy-to-follow descriptions introduce you to each of the relevant concepts and an ongoing practical scenario that continues throughout the book ensures that you familiarize yourself with all major areas of ABAP development. Numerous step-by-step procedures, screenshots, and solution tips are employed by the authors to describe procedural and object-oriented language elements in a clear and easy-to-understand way. In each chapter, you'll further extend the sample application, allowing you to build the skills needed to easily reproduce the development of a comprehensive ABAP application - including all of its intricate details. Highlights Getting Started with the System Object Navigator Procedural Language Elements Database Accesses User Interfaces and Screen Input and Output Object-Oriented Language Elements Software Architecture and Software Design SAP Programming Guidelines and Tools
Conceptual Modelling and Automated Implementation of Rule-Based Systems
Authors: Grzegorz J. Nalepa, Antoni Ligęza
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

The paper presents the elements of a novel approach to joint modelling and implementation process of rule-based systems. The design is performed top-down with a three-level, hierarchical approach. It covers conceptual design, logical design and physical design. A new tool, Attribute-Relationship Diagrams (ARD) for logical design stage are put forward. Another logical knowledge representation tool, used at logical design stage consists of the eXtended Tree Tables (XTT). The final, physical design stage consists in mapping to PROLOG meta code. The proposed approach is supported with visual design tool MIRELLA and offers possibility of amalgamating design and implementation into a single procedure. Moreover, incremental verification is also enabled.