ppxscal/embedding_network huggingface dataset:
Factors of gestures of robots for smooth communication with humans
Authors: Hisayuki Narahara, Takashi Maeno
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Four steps of research are conducted in order to analyze a relationship between robot's actions and human's emotions who is taking a look at an acting robot. First, 138 physical properties of robot's movements are measured by using a simple humanoid robot with upper half of the body with three degrees of freedom (DOF) in each arm and three DOF in head. Second, from the 138 physical properties, ten typical physical properties are selected by use of hierarchical cluster analysis. Third, sensory evaluation is conducted to extract three emotional factors by use of factor analysis. Finally, the relationship between three emotional factors and ten typical physical properties are analyzed by use of multi regression analysis. By conducting those steps, a model is made explaining the relationship between the physical properties of gesture and the human's emotions. This model is expected to be used to generate gestures that can give rise to desired emotions of humans.
Real-Coded Quantum Inspired Evolution Algorithm Applied to Engineering Optimization Problems
Authors: F. S. Alfares, I. I. Esat
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

A novel evolutionary algorithm based on quantum computing concepts is applied to engineering optimization problems. Quantum computing mimics behavior of atoms in processing information. Quantum inspired algorithm is a concept, which employs certain elements of quantum computing to use in a wider class of search and optimization problems. The main parts of a quantum-inspired algorithm are the qubits (quantum equivalent of bits) and the quantum gates. Qubits hold the information in a superposition of all the states, while the quantum gates evolve the qubit to achieve the desired objective, which is, optimization the maximum or the minimum. The paper addresses the ability of the Quantum-Inspired Evolution Algorithm (QIEA) to solve practical engineering optimization problems. QIEA, which is developed by authors, is based on their previous work and it is extended to acquire the floating-point representation of the information. The RQIEA is tested on a four benchmark engineering optimization problems. The results showed that the new algorithm has the ability to compete and even overcome other well known methods.
Prospects for logic-on-a-wire
Authors: K. E. Moselund, D. Bouvet, M. H. Ben Jamaa, D. Atienza, Y. Leblebici, G. De Micheli, A. M. Ionescu
Venue: Microelectronic Engineering (2008)

In this paper we present the top-down fabrication of gate-all-around (GAA) and body-tied @W-gate devices by a combination of etching and oxidation steps resulting in a local silicon-on-insulator structure. The GAA has advantages in terms of enhanced current drive, whereas the body-strapped structures allow for active leakage control and in some cases impact ionization devices. We demonstrate an inverter fabricated along a single silicon rib. The inverter consists of two enhancement mode body-strapped @W-gate NMOS transistors. Static and dynamic experiments demonstrate a fully functional inverter with the output experiencing V"D"D/2 voltage swing, as expected for an NMOS inverter with identical driver and load dimensions. In addition, we propose the use of these devices for cross-bar memory addressing.
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Authors: Xiaochun Yang, Bin Wang, Chen Li
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in data as well as queries. Several existing algorithms use the concept of "grams," which are substrings of strings used as signatures for the strings to build index structures. A recently proposed technique, called VGRAM, improves the performance of these algorithms by using a carefully chosen dictionary of variable-length grams based on their requencies in the string collection. Since an index structure using fixed-length grams can be viewed as a special case of VGRAM, a fundamental problem arises naturally: what is the relationship between the gram dictionary and the performance of queries? We study this problem in this paper. We propose a dynamic programming algorithm for computing a tight lower bound on the number of common grams shared by two similar strings in order to improve query performance. We analyze how a gram dictionary affects the index structure of the string collection and ultimately the performance of queries. We also propose an algorithm for automatically computing a dictionary of high-quality grams for a workload of queries. Our experiments on real data sets show the improvement on query performance achieved by these techniques. To our best knowledge, this study is the first cost-based quantitative approach to deciding good grams for approximate string queries.
GRIDCC: A Real-time Grid workflow system with QoS
Authors: A. Stephen McGough, Asif Akram, Li Guo, Marko Krznaric, Luke Dickens, David Colling, Janusz Martyniak, Roger Powell, Paul Kyberd, Chenxi Huang, Constantinos Kotsokalis, Panayiotis Tsanakas
Venue: Scientific Programming (2007)

The over-arching aim of Grid computing is to move computational resources from individual institutions where they can only be used for in-house work, to a more open vision of vast online ubiquitous `virtual computational' resources which support individuals and collaborative projects. A major step towards realizing this vision is the provision of instrumentation - such as telescopes, accelerators or electrical power stations - as Grid resources, and the tools to manage these resources online. The GRIDCC project attempts to satisfy these requirements by providing the following four co-dependent components; a flexible wrapper for publishing instruments as Grid resources; workflow support for the orchestration of multiple Grid resources in a timely manner; the machinery to make reservation agreements on Grid resources; and the facility to satisfy quality of service (QoS) requirements on elements within workflows. In this paper we detail the set of services developed as part of the GRIDCC project to provide the last three of these components. We provide a detailed architecture for these services along with experimental results from load testing experiments. These services are currently deployed as a test-bed at a number of institutions across Europe, and are poised to provide a 'virtual lab' to production level applications.
Fast retransmit and fast recovery schemes of transport protocols: A survey and taxonomy
Authors: Cheng-Yuan Ho, Yaw-Chung Chen, Yi-Cheng Chan, Cheng-Yun Ho
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Although there are two standard transport protocols, TCP and UDP, offering services in the Internet, the majority of the traffic over the Internet is TCP-based. TCP-based applications can react to packet losses; however, many performance problems have been recently observed in the Internet. To resolve these problems, several new TCP fast retransmit and fast recovery algorithms have been proposed. This article surveys state-of-the-art fast retransmit and fast recovery mechanisms of TCP to address the lost packet problem, and presents a description of some useful algorithms, design issues, advantages, and disadvantages. The objective of this article is fourfold: to provide an introduction to TCP protocol; to discuss problems degrading TCP retransmission performance in the present-day Internet; to describe some proposed transport protocols that solve a number of throughput issues; and finally, to gain new insight into these protocols and thereby suggest avenues for future research. Based on our taxonomy, existing fast retransmit and fast recovery schemes of transport protocols are described in this survey.
Information systems security and human behaviour
Authors: Denis Trcek, Roman Trobec, Nikola Pavesic, J. F. Tasic
Venue: Behaviour & Information Technology (2007)

Until recently, most of the effort for providing security in information systems has been focused on technology. However, it turned out during the last years that human factors have played a central role. Therefore, to ensure appropriate security in contemporary information systems, it is necessary to address not only technology-related issues, but also human behaviour and organisation-related issues that are usually embodied in security policies. This paper presents a template model, which is intended to support risk management for information systems, and which is concentrated on human factors. The model is based on business dynamics that provide the means for qualitative and quantitative treatment of the above-mentioned issues.
A preliminary report on the use of robots with elementary school students
Authors: Scott Bell, Linda Heeler, Phillip Heeler
Venue: Journal of Computing Sciences in Colleges (2008)

Computing with robots has become a popular educational activity at several different levels for several different educational purposes. This paper examines the use of mobile robots in learning about computing at the fifth and sixth grade level. The authors have conducted several robot programming sessions with elementary school students over two semesters. This paper is a preliminary report of those activities.
Efficient channel-aware rate adaptation in dynamic environments
Authors: Glenn Judd, Xiaohui Wang, Peter Steenkiste
Venue: Proceeding of the 6th international conference on Mobile systems, applications, and services (2008)

Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithms are dominated by probe-based approaches that search for the best transmission rate using trial-and-error. In mobile environments, probe-based techniques often perform poorly because they inefficiently search for the moving target presented by the constantly changing channel. We have developed a channel-aware rate adaptation algorithm CHARM - that uses signal strength measurements collected by the wireless cards to help select the transmission rate. Moreover, unlike previous approaches CHARM leverages channel reciprocity to obtain channel information, so the information is available to the transmitter without incurring RTS/CTS overhead. This combination of techniques allows CHARM to respond quickly to dynamic channel changes. We implemented CHARM in the Madwifi driver for wireless cards using the Atheros chipset. Our evaluation both in the real world and on a controlled testbed shows that channel-aware rate selection can significantly outperform probe-based rate adaptation, especially over dynamic channels.
A middleware for ecologies of robotic devices
Authors: Mathias Broxvall
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

The fields of autonomous robotics and ambient intelligence are converging toward the vision of smart robotic environments, or ubiquitous robotics, in which tasks are performed via the cooperation of many simple networked robotic devices. The concept of Ecology of Physically Embedded Intelligent Systems, or PEIS-Ecology, combines insights from these fields to provide a new solution to building intelligent robots in the service of people. To enable this vision, we need a common communication and cooperation model that allows dynamically assembled ad-hoc networks of robotic devices, a flexible introspection and configuration model allowing automatic (re)configuration and that can be shared between robotic devices at different scales, ranging from standard mobile robots to tiny networked embedded devices. In this paper we discuss the development of a middleware suitable for ubiquitous robotics in general and PEIS-Ecologies in specific. Our middleware is suitable for building truly ubiquitous robotics applications, in which devices of very different scales and capabilities can cooperate in a uniform way. We discuss the principles and implementation of our middleware, and also point to experimental results that show the viability of this concept.
Efficient reuse of replicated parallel data segments in computational grids
Authors: Sandip Tikar, Sathish Vadhiyar
Venue: Future Generation Computer Systems (2008)

Grids are being used for executing parallel applications over remote resources. For executing a parallel application on a set of grid resources chosen by a user or a grid scheduler, the input data needed by the application is segmented according to the data distribution followed in the application and the data segments are distributed to the grid resources. The same input data may be used subsequently by different applications leading to multiple copies (replicas) of parallel data segments in various grid resources. The data needed for a parallel application can be gathered from the existing replicas onto the computational resources chosen by the grid scheduler for application execution. In this work, we have devised novel algorithms for determining ''nearest'' replica sites containing data segments needed by a parallel application executing on a set of resources with the objective of minimizing the time needed for transferring the data segments from the replica sites to the resources. We have tested our algorithms on different kinds of experimental setups. We find that the best algorithm varies according to the configuration of data servers and clients. In all cases, our algorithms performed better than the existing algorithms by at least 15%.
Fuzzy conditional temporal problems: Strong and weak consistency
Authors: Marco Falda, Francesca Rossi, K. Brent Venable
Venue: Engineering Applications of Artificial Intelligence (2008)

In real life scenarios there is often the need for modeling conditional plans where external events determine the actual execution sequence. Conditional temporal problems (CTPs) have addressed such a need by extending the classical temporal constraint models with conditions on the occurrence of some events. Preferences are also a key aspect in many temporal reasoning tasks, since they allow for modeling in a natural way desires and different satisfaction levels. In this paper, we generalize CTPs to CTPPs by adding fuzzy preferences to the temporal constraints and by allowing fuzzy thresholds for the occurrence of some events. This allows us to generalize the conditions: events are allowed to determine not only which variables are executed, but also the preferences associated to their execution time. We consider two consistency notions (that is, strong and weak) and we provide their corresponding testing algorithms. We show that the complexity of these algorithms is not larger than their classical counterparts for CTPs. We also compare CTPPs with STPPUs, another temporal framework with uncertainty and preferences, by providing a polynomial mapping from STPPUs to CTPPs which allows to identify a strong theoretical connection among the two formalisms. Finally, we describe a tool to define CTPPs and to test if they are strongly or weakly consistent.
Inverse NP Problems
Authors: Hubie Chen
Venue: Computational Complexity (2008)

The inverse problem relative to a verifier V of proofs of membership for a NP language is the problem of deciding, given a set ¿ of proofs, whether or not there exists a string x having exactly ¿ as its set of proofs. In this paper, we study the complexity of inverse problems.We develop a new notion of reduction which allows one to compare the complexity of inverse problems. Using this notion, we classify as coNP-complete the inverse problems for the "natural" verifiers of many NP-complete problems. We also show that the inverse complexity of a verifier for a language L cannot be predicted solely from the complexity of L, but rather, is highly dependent upon the choice of verifier used to accept L. In this context, a verifier with a Σ 2 p -complete inverse problem is exhibited, giving a new and natural example of a Σ 2 p -complete problem.
PCITMiner: prefix-based closed induced tree miner for finding closed induced frequent subtrees
Authors: Sangeetha Kutty, Richi Nayak, Yuefeng Li
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informatics, XML processing, computational linguistics, and web usage mining. Despite the advances in frequent subtree mining, mining for the entire frequent subtrees is infeasible due to the combinatorial explosion of the frequent subtrees with the size of the datasets. In order to provide a reduced and concise representation without information loss, we propose a novel algorithm, PCITMiner (Prefix-based Closed Induced Tree Miner). PCITMiner adopts the prefix-based pattern growth strategy to provide the closed induced frequent subtrees efficiently. The empirical analysis reveals that our algorithm significantly outperforms the current state of the art algorithm, PrefixTreeISpan(Zou, Lu, Zhang, Hu and Zhou 2006b).
An investigation of the brusselator on the mesoscopic scale
Authors: Yasuhiro Suzuki
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

In the unconventional model of computation with biochemical media, such as DNA computing, membrane computing, etc. most of the system is on a mesoscopic scale and its kinetics may vary compared to on a macroscopic scale. In order to consider the reason for the difference between macroscopic and mesoscopic, we introduce a novel model of computation: Abstract Rewriting System on Multisets (ARMS), which is inspired by chemical reactions. By using this model, we investigate the behavior of the brusselator model and confirm that the system on a mesoscopic scale is more likely to be destabilized than on a macroscopic scale. Furthermore, we consider an application of this destabilization in order to compose a novel computational framework.
Video transmission over wireless networks: rate control for bursty throughput channels
Authors: Maria Teresa Carta, Tatiana Onali, Nicola Aste, Luigi Atzori
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

This paper addresses the problem of source-rate control in video streaming over wireless networks. The wireless channel resources are assumed to be shared among a variable number of stations using a contention-based access mechanism. In this context, the resulting throughput available for the video server has been proved to be bursty, which is a feature that makes the high-quality video streaming quite difficult. To face the channel burstiness, we propose a solution that focuses on the fluidity of the video playback by controlling the occupancy of the playback buffer so as not to exceed a desired rate of buffer starvation occurrences. While this constraint has been guaranteed, the encoder maximizes the source bit rate. Rate control is performed adaptively on the basis of a per-interval approach, which has the advantage to reduce the fluctuations in the source bit rate, ensuring smooth variations in video quality and avoiding the "saw" effect that is typically observed in frame-based rate control. Because of its low computational complexity, the proposed scheme is attractive for real-time operation. Simulations are carried out to assess the performance of the proposed scheme.
Fostering an informal learning community of computer technologies at school
Authors: Lu Xiao, John M. Carroll
Venue: Behaviour & Information Technology (2007)

Computer technologies develop at a challenging fast pace. Formal education should not only teach students basic computer skills to meet current computer needs, but also foster student development of informal learning ability for a lifelong learning process. On the other hand, students growing up in the digital world are often more skilled with computer technologies than their teachers. We describe an online course design project in which a group of students designed an online health course for their middle school, and teachers played the roles of facilitators and learners. We suggest fostering an informal learning community of computer technologies at school as a supplemental method of formal computer education to address the shift in educational context and as a place offering opportunities for students to work on real-life projects and solve real-life problems.
Analysis of E-bank Innovation in China Using a Hypercube Model
Authors: HaiBo Zhu, Ying Zou
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Information and communication technologies innovating applications have posed technical, organizational and commercial challenges in financial industry. This study uses a hypercube model to investigate E-bank innovative changes in China and discuss their impacts on stakeholders: customers, banks, complementary providers and regulators. The results indicate that Internet bank (I-bank) differs substantially from telephone bank (Tele-bank) in technological components and business model. From Tele-bank to I-bank, innovation is radical to customers, banks and complementary providers, architectural regulators. However, From I-bank to Mobile bank (M-bank), innovation is architectural to customers and banks, modular to regulators, radical to complementary providers. We think that the innovation from Tele-bank to I-bank is not a simple supplement process. The changes will widely influence on the whole banking industry. The innovations from I-bank to M-bank, it is thought to be primarily a process of supplement rather than a process of substitute.
An Organizational Framework for Building Secure Software
Authors: Abdelwahab Hamou-Lhadj, AbdelKrim Hamou-Lhadj
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

In this paper, we argue that building a secure software system requires more than just a good understanding of technology. It requires an organized framework for the business context in which the system is being built. Unlike existing studies that focus on security only from the technological point of view, in this paper, we present a framework for building secure software that facilitates the linkage between security requirements, software development practices, and business process management. Our framework consists of four main components: Governance, People, Process, and Technology. We believe that this framework, if implemented properly, can be a powerful tool that can be used by software companies to cope with the increasing customer demand for secure software.
Application of Coulomb wave functions to an orthogonal series associated with steady axisymmetric Euler flows
Authors: Takahiro Nishiyama
Venue: Journal of Approximation Theory (2008)

The regular Coulomb wave function of order zero is applied to an orthogonal series which is associated with the steady axisymmetric Euler equations. The series expansion of a function of bounded variation is proved to converge to the mean value of the left- and the right-hand limits of the original function at each point. In this proof, some complex functions related to the regular and the irregular Coulomb wave functions of orders zero and one are used.