ppxscal/embedding_network huggingface dataset:
Using the Average Landmark Vector Method for Robot Homing
Authors: Alex Goldhoorn, Arnau Ramisa, Ramón López de Mántaras, Ricardo Toledo
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

Several methods can be used for a robot to return to a previously visited position. In our approach we use the average landmark vector method to calculate a homing vector which should point the robot to the destination. This approach was tested in a simulated environment, where panoramic projections of features were used. To evaluate the robustness of the method, several parameters of the simulation were changed such as the length of the walls and the number of features, and also several disturbance factors were added to the simulation such as noise and occlusion. The simulated robot performed really well. Randomly removing 50% of the features resulted in a mean of 85% successful runs. Even adding more than 100% fake features did not have any signi.cant result on the performance.
Haptics technologies: theory and applications
Authors: Abdel-Motaleb El-Saddik
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

Multimedia and information technology are reaching limits in terms of what can be done in multimedia applications with only sight and sound. The next critical step is to bring the sense of "touch" over network connections, which is commonly known as Tele-haptics. Haptics, a term which was derived from the Greek verb "haptesthai" meaning "to touch", introduces the sense of touch and force into the human-computer interaction. Currently, research on haptics is broadly categorized into human haptics, machine haptics, and computer haptics. Human haptics is mostly conducted by psychologists to study the mechanism of the "touch" modality, while machine haptics refers to the design of haptic devices to reproduce the sense of "touch". Computer haptics covers all the aspects in haptics applications. The potential of haptics as a new media is quite significant for many applications such as tele-presence, tele-learning, tele-medicine, tele-operation in hazardous environments, industrial design and testing, gaming, and any related interactive virtual reality application. The advent of recent devices such as multitouch screens, next generation movement based gaming systems such as the Nintendo Wii&reg;, have made touch based interfaces as an intriguing novelty. Our tutorial is timely as it would enable the IT research community to gain an understanding of haptic devices and systems and how to effectively employ them in their systems and interfaces.
Towards Secrecy for Rewriting in Weakly Adhesive Categories
Authors: Tobias Heindel
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Inspired by the scope extrusion phenomenon of name passing calculi that allow to reason about knowledge of (secret) names, we propose an abstract formulation of the concept of secret in any weakly adhesive category. The guiding idea is to mark part of a system state as visible or publicly accessible; further, in principle, something that has become public knowledge will stay accessible indefinitely. The main technical contribution consists in providing a proof which shows that a recently proposed categorical construction, which produces a category having monomorphisms as objects and pullback squares as morphisms, preserves weak adhesivity. Finally we sketch how it is possible to verify certain secrecy properties using unfolding based verification approaches that lately have been generalized to rewriting systems in weakly adhesive categories.
Optimal deterministic broadcasting in known topology radio networks
Authors: Dariusz R. Kowalski, Andrzej Pelc
Venue: Distributed Computing (2007)

We consider deterministic broadcasting in radio networks whose nodes have full topological information about the network. The aim is to design a polynomial algorithm, which, given a graph G with source s, produces a fast broadcast scheme in the radio network represented by G. The problem of finding a fastest broadcast scheme for a given graph is NP-hard, hence it is only possible to get an approximation algorithm. We give a deterministic polynomial algorithm which produces a broadcast scheme of length O(D + log2n), for every n-node graph of diameter D, thus improving a result of Gasieniec et al. (PODC 2005) [17] and solving a problem stated there. Unless the inclusion NP ⊆ BPTIME(nO(log log n)) holds, the length O(D + log2n) of a polynomially constructible deterministic broadcast scheme is optimal.
ReflectiveSigns: Digital Signs That Adapt to Audience Attention
Authors: Jörg Müller, Juliane Exeler, Markus Buzeck, Antonio Krüger
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

This paper presents ReflectiveSigns, i.e. digital signage (public electronic displays) that automatically learns the audience preferences for certain content in different contexts and presents content accordingly. Initially, content (videos, images and news) are presented in a random manner. Using cameras installed on the signs, the system observes the audience and detects if someone is watching the content (via face detection). The anonymous view time duration is then stored in a central database, together with date, time and sign location. When scheduling content, the signs calculate the expected view time for each content type depending on sign location and time using a Naive Bayes classifier. Content is then selected randomly, with the probability for each content weighted by the expected view time. The system has been deployed for two months on four digital signs in a university setting using semi-realistic content content types. We present a first evaluation of this approach that concentrates on major effects and results from interviews with 15 users.
Robot Brains: Circuits and Systems for Conscious Machines
Authors: Pentti O. Haikonen
Venue:  (2007)

Haikonen envisions autonomous robots that perceive and understand the world directly, acting in it in a natural human-like way without the need of programs and numerical representation of information. By developing higher-level cognitive functions through the power of artificial associative neuron architectures, the author approaches the issues of machine consciousness. Robot Brains expertly outlines a complete system approach to cognitive machines, offering practical design guidelines for the creation of non-numeric autonomous creative machines. It details topics such as component parts and realization principles, so that different pieces may be implemented in hardware or software. Real-world examples for designers and researchers are provided, including circuit and systems examples that few books on this topic give. In novel technical and practical detail, this book also considers: the limitations and remedies of traditional neural associators in creating true machine cognition; basic circuit assemblies cognitive neural architectures; how motors can be interfaced with the associative neural system in order for fluent motion to be achieved without numeric computations; memorization, imagination, planning and reasoning in the machine; the concept of machine emotions for motivation and value systems; an approach towards the use and understanding of natural language in robots. The methods presented in this book have important implications for computer vision, signal processing, speech recognition and other information technology fields. Systematic and thoroughly logical, it will appeal to practising engineers involved in the development and design of robots and cognitive machines, also researchers in Artificial Intelligence. Postgraduate students in computational neuroscience and robotics, and neuromorphic engineers will find it an exciting source of information.
Note: A construction of mutually disjoint Steiner systems from isomorphic Golay codes
Authors: Masakazu Jimbo, Keisuke Shiromoto
Venue: Journal of Combinatorial Theory Series A (2009)

It is well known that the extended binary Golay [24,12,8] code yields 5-designs. In particular, the supports of all the weight 8 codewords in the code form a Steiner system S(5,8,24). In this paper, we give a construction of mutually disjoint Steiner systems S(5,8,24) by constructing isomorphic Golay codes. As a consequence, we show that there exists at least 22 mutually disjoint Steiner systems S(5,8,24). Finally, we prove that there exists at least 46 mutually disjoint 5-(48,12,8) designs from the extended binary quadratic residue [48,24,12] code.
Automating Argumentation for Deliberation in Cases of Conflict of Interest
Authors: Alison Chorley, Trevor Bench-Capon, Peter McBurney
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

One approach to deliberation about the choice of what to do in a particular situation is to use an argument scheme based on the practical syllogism to supply a presumptive reason for the action, which is then subjected to a process of critical questioning to see if the presumption can be maintained. In this paper we describe an implemented realisation of this approach. We describe a representation which permits the instantiation of the argument scheme and the generation and consideration of critical questions to it. In order to automate the process we supply operational interpretations of the argument scheme, the critical questions and rebuttals to those questions. Our realisation is illustrated with a detailed example of a particular case.
Modeling Software Evolution with Game Theory
Authors: Vibha Sazawal, Nikita Sudan
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

A wrong design decision at any point in the software lifecycle can lead to cost overruns and competitive disadvantage. We describe how lightweight game theory can help software engineering teams plan for future design and maintenance decisions. To demonstrate our approach, we model the real-world evolution of java.util.Calendar using our lightweight Basic Software Evolution Game. The game expressively models both what actually happened as well as circumstances when alternate design decisions would be optimal.
Correlated itemset mining in ROC space: a constraint programming approach
Authors: Siegfried Nijssen, Tias Guns, Luc De Raedt
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting correlation measures in ROC space and formulating correlated itemset mining as a constraint programming problem, we obtain new theoretical insights with practical benefits. More specifically, we contribute 1) an improved bound for correlated itemset miners, 2) a novel iterative pruning algorithm to exploit the bound, and 3) an adaptation of this algorithm to mine all itemsets on the convex hull in ROC space. The algorithm does not depend on a minimal frequency threshold and is shown to outperform several alternative approaches by orders of magnitude, both in runtime and in memory requirements.
Analytically bounding data cache behavior for real-time systems
Authors: Frank Mueller
Venue:  (2008)

This dissertation presents data cache analysis techniques that make it feasible to predict data cache behavior and to bound the worst-case execution time for a large class of real-time programs. Data Caches are an increasingly important architectural feature in most modern computer systems. They help bridge the gap between processor speeds and memory access times. One inherent difficulty of using data caches in a real-time system is the unpredictability of memory accesses, which makes it difficult to calculate worst-case execution times of real-time tasks. This dissertation presents an analytical framework that characterizes data cache behavior in the context of independent, periodic tasks with deadlines less than or equal to their periods, executing on a single, in-order processor. The framework presented has three major components. (1) The first component analytically derives data cache reference patterns for all scalar and non-scalar references in a task. Using these, it produces a safe and tight upper bound on the worst-case execution time of the task without considering interference from other tasks. (2) The second component calculates the worst-case execution time and response time of a task in the context of a multi-task, prioritized, preemptive environment. This component calculates Data-Cache Related Preemption Delay for tasks assuming that all tasks in the system are completely preemptive. (3) In the third component, tasks are allowed to have critical sections in which they access shared resources. In this context, two analysis techniques are presented. In the first one, a task executing in a critical section is not allowed to be preempted by any other task. In the second one, the framework incorporates Resource Sharing Policies to arbitrate accesses to shared resources, thereby improving responsiveness of high-priority tasks that do not use a particular resource. In all the components presented in this dissertation, a direct-mapped data cache is assumed. Experimental results demonstrate the value of all the analysis techniques described above in the context of data cache usage in a hard real-time system.
Genetic Sequencing Research Approach for users' satisfaction in grid environments
Authors: Y. Ben Halima, Y. Jamoussi, H. Ben Gezala
Venue: Proceeding of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008 (2008)

Nowadays, the satisfaction of the users' requirements of a composition process execution in a grid environment remains a difficult task to be accomplished. It is done by brokers or using simple mechanisms of matchmaking. There users must express their needs in the grid language and then the grid determines the way to execute. In this article we propose a genetic sequencing approach for the research of the best way to execute a composition of services in a grid environment satisfying the user's need. This paper presents the genetic sequencing approach and then presents how to adapt this approach for the determination of the best time to execute the service composition.
Fastest parallel molecular algorithms for the elliptic curve discrete logarithm problem over GF(2n)
Authors: Gennaro Iaccarino, Tommaso Mazza
Venue: Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems (2009)

Cryptography based on Elliptic Curves (ECC) has emerged as an effective alternative to the existing public-key cryptosystems (RSA and DSA). Its success was due both to the fact that no fast algorithms were known to break it and that exceptional security levels could be obtained by using short keys. The Elliptic Curve Discrete Logarithm (ECDL) problem is the cornerstone of much of present-day ECCs. It was classifed as a computationally intractable problem and, consequently, as a reliable and unbreakable cryptosystem. In a recent work, Li et al. built a molecular computer designed to solve it over GF(2n). It was based on two DNA-inspired al gorithms: a parallel adder and a parallel multiplier, working in O(n) and O(n2) respectively, where n is the input size. In this paper, we first present two faster biological implementations, working in O(log(n)) and O(n • log(n))respectively (worst case). Then, we propose our model as a reference parallel solution of the ECDL problem and finally we highlight the computational power of such natureinspired paradigm.
SOC chip interconnect embodying I-slip algorithm
Authors: Neetu N. Gyanchandani, Vilas A. Nitnaware
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

With the improvement in fabrication technology, smaller feature size allow more integration of system components onto a single die, hence communication becomes limiting factor for performance, so we need a design so that the efficiency of interconnect increases. This can be achieved by On-chip interconnect embodying I-slip algorithm for efficient communication between 8 soc devices This algorithm is derived from slip algorithm which is an improvement upon the round robin scheduling algorithm. The design described consists of implementation of the three main blocks of a 8 by 8 input buffered crossbar switch or interconnect: the input block, scheduler block and finally the output block. All the blocks are implemented in VHDL using xilinix tool project navigator and modelsim software. The interconnect is capable of handling 72 bit packets and a total of 32 packets at a time. There are total 8 devices and we have to establish the communication between them. Each device consists of an input block and the output block. The input block first receives the 72 bit packet and the total of 32 packets one by one. The input block internally consists of four arrays-destination head, destination tail, packet array and linked list array and also a shift register. It stores the packets in an array called packet array. When scheduler sends transmit request these packets are given to the scheduler. Scheduler internally consists of grant and accept arbiters. Scheduler performs its operation in three steps i.e request, grant and accept. It works on the principle of i-slip algorithm. Finally the scheduler decides that which packet should be send from the input block to the output block of the device. Output block of the device simply receives the packet. These packets are send and received in two phases. In the first phase 36 bits are send and in the second phase 36 bits are send. Thus the connection is established between the devices using interconnect. Using these optimization techniques the design is able to achieve best timing and area, also this interconnect design provides fast communication and full N-to-N routing capabilities. Thus this interconnect acts as a switch connecting input blocks to output blocks.
Online blind source separation based on time-frequency sparseness
Authors: Benedikt Loesch, Bin Yang
Venue: Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing (2009)

Recently, blind source separation (BSS) has been proposed to separate signals recorded by a microphone array in a reverberant environment. This paper deals with BSS of a time-varying number of moving sources, which often occurs in practical situations. We develop two online algorithms based on time-frequency (TF) sparseness that are able to deal with moving sources: A block-online algorithm that estimates the number of sources and a gradient-based online algorithm with prespecified maximum number of sources. Both algorithms are evaluated in simulations and real-world scenarios and show good separation performance.
Professional IIS 7 and ASP.NET Integrated Programming
Authors: Shahram Khosravi
Venue:  (2007)

The deep integration of IIS7 and ASP.NET provides both IIS7 administrators and ASP.NET developers with new and exciting programming tools, techniques, and approaches that were not possible with earlier versions of IIS. With this book, Dr. Shahram Khosravi presents you with the only resource to focus exclusively on the key features of this exciting integration. Youll get in-depth coverage of all the major systems that make up the IIS7 and ASP.NET integrated infrastructure, detailed explanations on how they work, guidance on how to use them in your own applications, and techniques for extending them to meet your application requirements. Packed with detailed code walkthroughs and in-depth analyses of numerous real-world examples - all written and tested with Windows Vista, Windows Server 2008, ASP.NET 2.0, and ASP.NET 3.5 (Visual Studio 2008), this book helps you gain the skills, knowledge, and experience you need to use and to extend the major systems that make up the IIS7 and ASP.NET integrated infrastructure. Some of the key topics covered include: How to write integrated IIS7 and ASP.NET code that works with Windows Vista, Windows Server 2008, ASP.NET 2.0, and ASP.NET 3.5 (Visual Studio 2008) Techniques for implementing and plugging custom HTTP modules, handlers, and handler factories into the IIS7 and ASP.NET integrated request processing pipeline How to manage the IIS7 and ASP.NET integrated configuration system from IIS7 Manager, appcmd.exe, and managed code Tips for using the IIS7 and ASP.NET integrated declarative schema extension markup language (, , , , and so on) to implement custom configuration sections Techniques for using and extending the IIS7 and ASP.NET integrated managed code system (ConfigurationElement, ConfigurationElementCollectionBase, ConfigurationSection, ApplicationPool, Site, Application, ServerManager and so on) to add support for custom managed classes Tips for extending the IIS7 and ASP.NET integrated graphical management system (ModuleServiceProxy, ModuleDialogPage, ModuleListPage, TaskForm, Module, ModuleService, ModuleProvider, TextTaskItem, MethodTaskItem, and so on) to add new graphical components to IIS7 Manager Techniques for using and extending the IIS7 and ASP.NET integrated providers system (ProviderConfigurationFeature, ProviderConfigurationSettings, IProviderConfigurationService, ConfigurationModuleProvider, and so on) and ways to implement and to plug custom provider-based services into this system and IIS7 Manager Ways to use the IIS7 and ASP.NET integrated tracing and diagnostics - TraceSource, SourceSwitch, IisTraceListener, EventTypeFilter, RSCA, Request, WorkerProcess, Failed Request Tracing, and so on ASP.NET and Windows Communication Foundation integration in IIS7 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
Mechanics of Terrestrial Locomotion: With a Focus on Non-pedal Motion Systems, 1st edition
Authors: Klaus Zimmermann, Igor Zeidis, C. Behn
Venue:  (2009)

This book covers the specific aspects of mechanics and control theory that are applied in terrestrial locomotion systems. In addition to the theoretical basics exercises are provided. The book also comes packaged with: - Video files of prototypes of wheeled and worm-like locomotion systems; - E-learning Software on the mechanical background; - MAPLE programs for the dynamic simulation of locomotion systems.