ppxscal/embedding_network huggingface dataset:
Hands-Free Input Interface Using Mimetic Muscle Movements for Wearable Computer
Authors: Atsushi Hiyama, Tomohiro Tanikawa, Michitaka Hirose
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

In recent years, we have many chances to operate cellular phone to browse e-mails or web sites. However, operating cellular phone in transit may cause dangerous conditions. This paper describes the ergonomic evaluation of hands-free input interface for wearable computing. The Interface is designed to operate the computer by mimetic muscle movements, which are detected by piezo films attached to the surface of the skin. In order to evaluate the input interface using facial actions, we measured user's behavior and mental state by wearable measuring device. The user's behavior is observed by the CCD camera and pedometer, and user's mental workload is measured by the RRV (variance of R-R intervals of ECG). We evaluated the efficiency of the developed interface by comparing with cellular phone, which can connect to the Internet. We proved that the input interface using mimetic muscle movements has high compatibility between computer operation and daily activities.
Affective Emotion Processing Research and Application
Authors: Qi Luo
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Affective computing is a very hot and an innovative research in Artificial intelligence, it is computing that related to, arise from, or deliberately influence emotion, which is firstly proposed by Professor Picard at MIT in 1997. Affective computing consists of recognition, expression, and modeling, communicating and responding to emotion. In the paper, affective computing research scope and application are proposed according to Picard’ s research. And then, the author proposed an affective emotion computing research on Web- based Education field, which can recognize human emotion in the facial expression and speech signal. This is a belief abstract for an invited talk at the symposium on Information Processing.
Socio-contextual Filters for Discovering Similar Knowledge-Gathering Tasks in Generic Information Systems
Authors: Balaji Rajendran
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

The task of knowledge-gathering through an Information System has become increasingly challenging, due to the multitude of activities that are being facilitated through the system. A user-centric approach is presented in this paper where various activities executed by a user, for a knowledge-gathering task, are mapped to certain cognitive states in our model and the transitions between those states are used to indicate the progress made by the user. We propose a socio-contextual filtering algorithm for discovering similar tasks that were executed by other users and claim that such a socio-contextually related task would help in reducing the cognitive load, efforts and the time required for a user, naïve to a given knowledge gathering task. We demonstrate this through the fewer number of state transitions that occur in our model for a guided user.
Absolute Stability of Single-Input Single-Output Systems with Constant Internal Point Time Delays
Authors: Manuel de la Sen
Venue: Informatica (2003)

This paper deals with the absolute stability of single-input single-output time-delay systems with, in general, a finite number of non commensurate constant internal point delays for any nonlinearity satisfying a time positivity inequality related to the first and third quadrants. The results are obtained based on Lyapunov's stability analysis via appropriate Lyapunov's functions and the related stability study is performed to obtain both delay independent and delay dependent results.
Nonparametric Independence Tests: Space Partitioning and Kernel Approaches
Authors: Arthur Gretton, László Györfi
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L 1, log-likelihood) are defined when the empirical distribution of the variables is restricted to finite partitions. A third test statistic is defined as a kernel-based independence measure. All tests reject the null hypothesis of independence if the test statistics become large. The large deviation and limit distribution properties of all three test statistics are given. Following from these results, distribution-free strong consistent tests of independence are derived, as are asymptotically ¿-level tests. The performance of the tests is evaluated experimentally on benchmark data.
Labeled Step Sequences in Petri Nets
Authors: Matthias Jantzen, Georg Zetzsche
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

We compare various modes of firing transitions in Petri nets and investigate classes of languages specified by them. We define languages through steps, (i. e., sets of transitions), maximal steps, multi-steps, (i. e., multisets of transitions), and maximal multi-steps of transitions in Petri nets. However, by considering labeled transitions, we do this in a different manner than in [Burk 81a, Burk 83]. Namely, we allow only sets and multisets of transitions to form a (multi-)step, if they all share the same label. In a sequence of (multi-)steps, each of them contributes its label once to the generated word. Through different firing modes that allow multiple use of transitions in a single multi-step, we obtain a hierarchy of families of languages. Except for the maximal multi-steps all classes can be simulated by sequential firing of transitions.
A Dynamic Swarm for Visual Location Tracking
Authors: Marcel Kronfeld, Christian Weiss, Andreas Zell
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

The visual localization problem in robotics poses a dynamically changing environment due to the movement of the robot compared to a static image set serving as environmental map. We develop a particle swarm method adapted to this task and apply elements from dynamic optimization research. We show that our algorithm is able to outperform a Particle Filter, which is a standard localization approach in robotics, in a scenario of two visual outdoor datasets, being computationally more effective and delivering a better localization result.
Survey of some automotive integrated-starter-generators and their control
Authors: Dorin Dumitru Lucache
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The induction machine, the interior permanent magnet machine and the switched reluctance motor are the strongest candidates to be used as integrated-starter-generators in automotive applications. Their advantages and drawbacks are discussed. To get the requested ISG performances and flexibility, the vector control must be used. Two practical control schemes, using the induction machine and the interior permanent magnet machine consequently, are depicted. An indoor test bed based on a mean-torque-value engine simulator was used.
Execution-time communication decisions for coordination of multi-agent teams
Authors: Reid Simmons, Manuela Veloso
Venue:  (2007)

Although multi-agent teams provide additional functionality and robustness over single-agent systems, they also present additional challenges, mainly due to the difficulty of coordinating multiple agents in the presence of uncertainty and partial observability. Agents must reason about the collective state and behaviors of the team as well as uncertainty in their own environment. In this thesis, we employ Decentralized Partially Observable Markov Decision Processes (Dec-POMDPs), an extension of single-agent POMDPs that can be used to model and coordinate teams of agents. Although the problem of finding optimal policies for Dec-POMDPs is highly intractable, it is known that the presence of free communication transforms a multi-agent Dec-POMDP into a more tractable single-agent POMDP. We use this transformation to generate "centralized" policies for multi-agent teams modeled by Dec-POMDPs. We facilitate the decentralize execution of these centralized policies by providing algorithms that allow agents to reason about communication at execution-time. Our approach trades off the need to do some computation at execution-time for the ability to generate policies more tractably at plan-lime. This thesis explores the question of how communication can be used effectively to enable the coordination of cooperative multi-agent teams making sequential decisions under uncertainty and partial observability. We identify two fundamental questions that must be answered when reasoning about communication: "When should agents communicate," and "What should agents communicate?" We present two basic approaches to enabling a team of distributed agents to avoid coordination errors, The first is an algorithm that reasons over the possible joint beliefs the team. We provide algorithms that address the questions of when and what agents should communicate. The second approach presented in this thesis avoids coordination errors by creating individual factored policy for each agent. Factored policies provide a means for determining which state features agents should communicate, answering the questions of when and what agents should communicate. We use factored policies to identify instances of context-specific independence, in which agents can act without needing to consider the actions or observations of their teammates.
Network discovery from passive measurements
Authors: Brian Eriksson, Paul Barford, Robert Nowak
Venue: ACM SIGCOMM Computer Communication Review (2008)

Understanding the Internet's structure through empirical measurements is important in the development of new topology generators, new protocols, traffic engineering, and troubleshooting, among other things. While prior studies of Internet topology have been based on active (traceroute-like) measurements, passive measurements of packet traffic offer the possibility of a greatly expanded perspective of Internet structure with much lower impact and management overhead. In this paper we describe a methodology for inferring network structure from passive measurements of IP packet traffic. We describe algorithms that enable 1) traffic sources that share network paths to be clustered accurately without relying on IP address or autonomous system information, 2) topological structure to be inferred accurately with only a small number of active measurements, 3) missing information to be recovered, which is a serious challenge in the use of passive packet measurements. We demonstrate our techniques using a series of simulated topologies and empirical data sets. Our experiments show that the clusters established by our method closely correspond to sources that actually share paths. We also show the trade-offs between selectively applied active probes and the accuracy of the inferred topology between sources. Finally, we characterize the degree to which missing information can be recovered from passive measurements, which further enhances the accuracy of the inferred topologies.
Round-Efficient Secure Computation in Point-to-Point Networks
Authors: Jonathan Katz, Chiu-Yuen Koo
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

Essentially all work studying the round complexity of secure computation assume broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poor round complexity when compiled for a point-to-point network due to the high overhead of emulating each invocation of broadcast. This problem is compounded when broadcast is used in more than one round of the original protocol due to the complexity of handling sequential composition (when using round-efficient emulation of broadcast).We argue that if the goal is to optimize round complexity in point-to-point networks, then it is preferable to design protocols -- assuming a broadcast channel -- minimizing the number of rounds in which broadcast is used rather than minimizing the total number of rounds. With this in mind, we present protocols for secure computation in a number of settings that use only a single round of broadcast. In all cases, we achieve optimal security threshold for adaptive adversaries, and obtain protocols whose round complexity (in a point-to-point network) improves on prior work.
The Design and Implementation of Open ORB 2
Authors: Gordon S. Blair, Geoff Coulson, Anders Andersen, Lynne Blair, Michael Clarke, Fabio Costa, Hector Duran-Limon, Tom Fitzpatrick, Lee Johnston, Rui Moreira, Nikos Parlavantzas, Katia Saikoski
Venue: IEEE Distributed Systems Online (2001)

Established middleware platforms such as CORBA and DCOM are not flexible enough to meet the needs of emerging distributed applications. This article discusses the architecture of Open ORB 2, a middleware platform based on reflection and component technology.
Analysis of Chaotic Dynamics Using Measures of the Complex Network Theory
Authors: Yutaka Shimada, Takayuki Kimura, Tohru Ikeguchi
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Complex phenomena are observed in various situations. These complex phenomena are produced from deterministic dynamical systems or stochastic systems. Then, it is an important issue to clarify what is a source of the complex phenomena and to analyze what kind of response will emerge. Then, in this paper, we analyze deterministic chaos from a new aspect. The analysis method is based on the idea that attractors of nonlinear dynamical systems and networks are characterized by a two-dimensional matrix: a recurrence plot and an adjacent matrix. Then, we transformed the attractors to the networks, and evaluated the clustering coefficients and the characteristic path length to the networks. As a result, the networks constructed from the chaotic systems show a small world property.
MB-AIM-FSI: a model based framework for exploiting gradient ascent multiagent learners in strategic interactions
Authors: Doran Chakraborty, Sandip Sen
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need to develop algorithmic approaches that can learn to recognize commonalities in opponent strategies and exploit such commonalities to improve strategic response. Recently a framework [9] has been proposed that aims for targeted optimality against a set of finite memory opponents. We propose an approach that aims for targeted optimality against the set of all possible multiagent learning algorithms that perform gradient search to select a single stage Nash Equilibria of a repeated game. Such opponents induce a Markov Decision Process as the learning environment and appropriate responses to such environments are learned by assuming a generative model of the environment. In the absence of a generative model, we present a framework, MB-AIM-FSI, that models the opponent online based on interactions, solves the model off-line when sufficient information has been gathered, stores the strategy in the repository and finally uses it judiciously when playing against the same or similar opponent at a later time.
Adaptive Layout for Interactive Documents
Authors: Kamran Ali, Knut Hartmann, Georg Fuchs, Heidrun Schumann
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

In many application domains there is a strong need to produce content both for traditional print media and for interactive media. In order to fully benefit from digital devices, online documents must provide mechanisms to support interactivity and for the personalization of content. Thus, powerful authoring tools as well as flexible layout techniques are needed to display dynamic information effectively. In this paper we present a novel approach to template-based design of complex non-grid layouts and propose a unique combination of constraint-based and force-based layout mechanisms. Our authoring tool enables designer to specify designs pattern with overlapping content elements that are transformed into layout constraints and force systems by the layout engine. The smooth integration of interactive illustrations into complex layouts also induces constraints to achieve temporal coherent layout. We propose algorithms to achieve graceful layouts even when the space consumption of content elements significantly differs from the defaults specified in layout templates.
High dimensional model representation (HDMR) and trigonometric transformational HDMR
Authors: Nihal Sen, N. Abdülabki Baykara, Metin Demiralp
Venue: Proceedings of the 1st WSEAS International Conference on Multivariate Analysis and its Application in Science and Engineering (2008)

It is well known that mathematical modeling of physical systems is a must in most cases. Amongst many approximation techniques is the High Dimensional Model Representation Method. Here, preliminary analytical attemps are made for a newly developed version of HDMR the Trigonometric Transformational HDMR.
A Pairing-Based User Authentication Scheme for Wireless Clients with Smart Cards
Authors: Yuh-Min Tseng, Tsu-Yang Wu, Jui-Di Wu
Venue: Informatica (2008)

With rapid growth of mobile wireless networks, handheld devices are popularly used by people and many mobile applications have been rapidly developed. Considering the limited computing capability of smart cards or mobile devices, the security scheme design suitable for these mobile devices is a nontrivial challenge. A user authentication scheme is a mechanism to authenticate a remote user over an open network. In 2006, Das et al. proposed an identity (ID)-based remote user authentication scheme with smart cards using bilinear pairings. Unfortunately, their scheme is insecure against forgery attack. Recently, Giri and Srivastava proposed an improved scheme to overcome the forgery attack. The computational cost required by the Giri-Srivastava scheme is expensive, especially for smart cards with limited computing capability. In addition, the Giri-Srivastava scheme is unable to be used for a multi-server environment. This paper presents an efficient and secure ID-based remote user authentication scheme using bilinear pairings. Based on the computational Diffie-Hellman assumption, we show that the proposed scheme is secure against existential forgery on adaptively chosen-message and ID attack in the random oracle model. As compared with the recently proposed pairing-based authentication schemes, our scheme has better performance in term of the computational cost and it is suitable for a multi-server environment in distributed networks. Performance analysis and experimental data of related pairing operations on smartcards are given to demonstrate that our scheme is well suited for mobile devices with limited computing capability.
On the adaptiveness of Quicksort
Authors: Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz
Venue: Journal of Experimental Algorithmics (JEA) (2008)

Quicksort was first introduced in 1961 by Hoare. Many variants have been developed, the best of which are among the fastest generic-sorting algorithms available, as testified by the choice of Quicksort as the default sorting algorithm in most programming libraries. Some sorting algorithms are adaptive, i.e., they have a complexity analysis that is better for inputs, which are nearly sorted, according to some specified measure of presortedness. Quicksort is not among these, as it uses &Omega;(n log n) comparisons even for sorted inputs. However, in this paper, we demonstrate empirically that the actual running time of Quicksort is adaptive with respect to the presortedness measure Inv. Differences close to a factor of two are observed between instances with low and high Inv value. We then show that for the randomized version of Quicksort, the number of element swaps performed is provably adaptive with respect to the measure Inv. More precisely, we prove that randomized Quicksort performs expected O(n(1 + log(1 + Inv/n))) element swaps, where Inv denotes the number of inversions in the input sequence. This result provides a theoretical explanation for the observed behavior and gives new insights on the behavior of Quicksort. We also give some empirical results on the adaptive behavior of Heapsort and Mergesort.
Computerized Classification of Breast Tumors with Morphologic and Texture Features of Ultrasonic Images
Authors: Yuanyuan Wang, Jialin Shen, Yi Guo, Weiqi Wang
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

A computerized classification based on morphologic and texture features is proposed to increase the accuracy of the ultrasonic diagnosis of breast tumors. Firstly, tumor boundaries are obtained with the gray-level threshold segmentation algorithm and the dynamic programming method. Then five morphologic features and two texture features are extracted. Finally, an artificial neural network with the error back propagation algorithm is applied to classify breast tumors as benign or malignant. Experiments on 168 cases show that the proposed system yields the high accuracy, sensitivity and specificity. Therefore, it is concluded that this system performs well in the ultrasonic classification of breast tumors.
Feature Selection in in vivo1H-MRS Single Voxel Spectra
Authors: Félix F. González-Navarro, Lluís A. Belanche-Muñoz
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Machine learning is a powerful paradigm within which to analyze 1H-MRS spectral data for the classification of tumour pathologies. An important characteristic of this task is the high dimensionality of the involved data sets. In this study we apply several feature selection algorithms in order to reduce the complexity of the problem on two types of 1H-MRS spectral data: long-echo and short-echo time, which present considerable differences in the spectrum for the same cases. The obtained experimental results show that the feature selection algorithms enhance the classification performance of the final induced models both in terms of prediction accuracy and number of involved spectral frequencies. The results obtained using a fast algorithm based on entropic measures of subsets of spectral data are specially promising.
Generating Sharp Features on Non-regular Triangular Meshes
Authors: Tetsuo Oya, Shinji Seo, Masatake Higashi
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

This paper presents a method to create sharp features such as creases or corners on non-regular triangular meshes. To represent sharp features on a triangular spline surface we have studied a method that enables designers to control the sharpness of the feature parametrically. Extended meshes are placed to make parallelograms, and then we have an extended vertex which is used to compute control points for a triangular Bézier patch. This extended vertex expressed with a parameter enables designers to change the shape of the sharp features. The former method we presented deals with regular meshes, however, it can be a strong restriction against the actual variety of meshes. Therefore, we developed a method to express sharp features around an extraordinary vertex. In this paper, we present algorithms to express creases and corners for a triangular mesh including extraordinary vertices.