ppxscal/embedding_network huggingface dataset:
Implication of multimodality in ambient interfaces
Authors: Priyamvada Tripathi, Sethuraman Panchanathan
Venue: Proceedings of the 2008 Ambi-Sys workshop on Haptic user interfaces in ambient media systems (2008)

Ambient interfaces have long held the promise of enhanced and effective human machine interaction. Ambient interfaces can adapt to human activity allowing seamless exchange of information. This goal requires a coordinated development effort that incorporates a thorough understanding of human perceptual system in the design of interfaces. In this way, ambient interfaces can not only supplement the current activities of humans but also expand their functionality to novel approaches in interaction. Since humans interact with their environments through multiple channels, multimodality is an indispensable aspect of ambient interfaces. Multimodality is a broad term that encompasses not only sensory aspects of human- machine interaction but also cognitive interaction that is responsible for a unified perception. Thus, sensory formats are essential in construction of ambient interfaces but do not constitute the complete picture. In this paper, we propose that ambience can only be achieved when multiple modalities are considered in toto. In addition, multimodality cannot be implemented in isolation from the desired tasks and their pertaining contexts. We propose an integrated view of multimodal interfaces that differentiates itself from the previous conception of multimodal human-machine interaction. Multimodal interfaces have become synonymous with voice-and-gesture interaction. We propose that this category of multimodality does not fully exploit or include the human user's capability of effectively interacting and communicating with the machine. Both concepts of semantic congruence and syntactic constraints can be dealt with only when we attempt to create interfaces that include the human perceptual system in its design. This can be achieved by a staged evaluation process where in each interface is associated with its joint performance value and accessibility. Besides this, the interface and human must share the same real-world model for effective reference.
Decentralized algorithms for collision avoidance in airspace
Authors: David Šišlák, Jiří Samek, Michal Pěchouček
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

The paper proposes decentralized deconfliction algorithms deployed on multiple autonomous aerial vehicles in freeflight operations. The paper provides two separate algorithms for collision avoidance - one based on the iterative peer-to-peer negotiation solving a singular collision and second based on multi-party negotiation about a cluster of collisions. The presented decentralized algorithms allow the vehicles operating in the same area to utilize the given airspace more efficiently. The algorithms have been developed and tested on a multi-agent prototype and the properties of both algorithms are discussed on a set of large scale experiments.
On Multi Agent Coordination in the Presence of Incomplete Information
Authors: Krzysztof Skrzypczyk
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper presents the problem of the coordination of actions in a multi-agent system. The main difficulty in resolving this problem is the limited information. Each agent is provided only with partial information about the state of the team of agents. This paper presents a hybrid technique that combines the game theory tool and the voting schema, which is applied to create the method of coordination that deals with this problem. Appropriate simulation results of the proposed techniques are presented.
A note on phase transitions and computational pitfalls of learning from sequences
Authors: Antoine Cornuéjols, Michèle Sebag
Venue: Journal of Intelligent Information Systems (2008)

An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its properties and limits. This paper presents a new type of analysis for inductive learning. A few years ago, the discovery of a phase transition phenomenon in inductive logic programming proved that fundamental characteristics of the learning problems may affect the very possibility of learning under very general conditions. We show that, in the case of grammatical inference, while there is no phase transition when considering the whole hypothesis space, there is a much more severe "gap" phenomenon affecting the effective search space of standard grammatical induction algorithms for deterministic finite automata (DFA). Focusing on standard search heuristics, we show that they overcome this difficulty to some extent, but that they are subject to overgeneralization. The paper last suggests some directions to alleviate this problem.
A Barrier-Based Model for Justifying New ICT Support Potential Value: Focusing on Mobile Support
Authors: Chihab BenMoussa
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

Decisions and actions taken before a new technology gets introduced into the organization are critical to the new technology adoption and success. Unfortunately, this is a neglected research area. Most of the research on technology adoption and success has concentrated on the post-introduction rather than pre-introduction phase. The aim of this paper is to suggest a barrier-based model aimed at assessing the value of new Information and Communication Technologies (ICT) support, before the new technology actually gets introduced into the workplace. The model distinguishes between freedom, opportunity, convenience and feature new ICT based on its potential value to prospective users. In addition the paper translates the model into an approach for analyzing the potential value of Mobile Information and Communication (M-ICT) support for the workforce.
Malan: a mapping language for the data manipulation
Authors: Arnaud Blouin, Olivier Beaudoux, Stéphane Loiseau
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

Malan is a MApping LANguage that allows the generation of transformation programs by specifying a schema mapping between a source and target data schema. By working at the schema level, Malan remains independent of any transformation process; it also naturally guarantees the correctness of the transformation target relative to its schema. Moreover, by expressing schemas as UML class diagrams, Malan schema mappings can be written on top of UML modellers. This paper describes the overall approach by focusing on the Malan language itself, and its use within a transformation process.
Filtering Techniques for Rewriting XPath Queries Using Views
Authors: Rui Zhou, Chengfei Liu, Jianxin Li, Junhu Wang
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

In this paper, we propose several filtering techniques for rewriting XPath queries using views. The work is motivated by scenarios dealing with large quantities of queries and views, such as semantic query caching and data integration. Considerable rewriting computation could be saved if we manage to efficiently discover that, given a query Q and a view V, there does not exist a rewriting for Q using V. In contrast to O(|Q||V|) (O(|Q||V|2)) time complexity to compute an equivalent rewriting (contained rewriting) for XP {/,//,[] } , we devise linear algorithms running in O(|Q|) to filter queries for both equivalent rewriting and contained rewriting. Our filtering algorithms can be extended to support queries and views in XP {/,//,[],* } , where the equivalent (or contained) rewriting existence problem is still coNP-hard.
A Stochastic ARG Matching Based Video Scene Search System with a Sketch Query Interface
Authors: Naoto Nakamura, Shigeru Takano, Yoshihiro Okada
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

This paper proposes a video scene search system with a sketch query interface, whose search algorithm is based on a stochastic ARG (Attributed Relational Graph) matching. In this system, using the sketch query interface, the user can enter a sketch image as his/her query intuitively for searching scenes of a video. As its preprocessing, the system divides a video into several different scenes by extracting scene-change (cut-change) frames using a kind of chi-square test between color distributions of two adjoining frame images of the video. For searching the user's required scenes similar to his/her entered sketch query image, the system decomposes each of the scene-change frame images into some layers and an ARG is constructed from the layers. The ARG is used as the feature of the scene for the similarity search. Each sketch image entered as a query is also decomposed into layers and represented as an ARG. Hence, the system finds scenes of the video similar to the user's sketch image entered as his/her query by a stochastic ARG matching algorithm.
Stabilization of a 3D axially symmetric pendulum
Authors: N. A. Chaturvedi, N. H. McClamroch, D. S. Bernstein
Venue: Automatica (Journal of IFAC) (2008)

Stabilizing controllers are developed for a 3D pendulum assuming that the pendulum has a single axis of symmetry and that the center of mass lies on the axis of symmetry. This assumption allows development of a reduced model that forms the basis for controller design and global closed-loop analysis; this reduced model is parameterized by the constant angular velocity component of the 3D pendulum about its axis of symmetry. Several different controllers are proposed. Controllers based on angular velocity feedback only, asymptotically stabilize the hanging equilibrium. Then controllers are introduced, based on angular velocity and reduced attitude feedback, that asymptotically stabilize either the hanging equilibrium or the inverted equilibrium. These problems can be viewed as stabilization of a Lagrange top. Finally, if the angular velocity about the axis of symmetry is assumed to be zero, controllers are introduced, based on angular velocity and reduced attitude feedback, that asymptotically stabilize either the hanging equilibrium or the inverted equilibrium. This problem can be viewed as stabilization of a spherical pendulum.
With anti-counterfeit ownership transfer for RFID system
Authors: Chen Chin-Ling, Yu-Cheng Huang, Yu-Yi Chen, Chen-Shen Liu, Chia-I Lin, Tzay-Farn Shih
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

Radio Frequency Identification (RFID) is a new technology. In recent years, it is convenient and feasible in many applications. However, it also addresses many security issues which are worth discussing. In this paper, we propose an anti-counterfeit ownership transfer protocol for low cost RFID system, which only use the tag to be a storage media. It can ensure a secure transaction.
Abstract vs. social roles - Towards a general theoretical account of roles
Authors: Frank Loebe
Venue: Applied Ontology (2007)

For decades, roles have been discussed and applied in different ways in various fields of computer science, but apparently no consensus on their understanding is available. Thus, role terms like &ldquo;patient&rdquo;, &ldquo;runner&rdquo;, or &ldquo;factor&rdquo; qualify for further investigation, which aims at covering and generalizing recurrent understandings and uses of roles. The generality of roles suggests their inclusion in top-level ontologies. This paper extends and refines analyses of roles for the top-level ontology General Formal Ontology (GFO). The primary foundation of this account comprises the notions of role, player, and context and their interrelations, associated with situations of, for instance, some human who plays a patient role in a hospital context. Further, a classification of roles is introduced, which at top distinguishes two role types: abstract roles, providing a means of viewing something in a context, and social roles, which are complex social objects in vaguely defined contexts. These types are mixed in the literature, and their differences restrict the theory common to all roles. Based on this framework, the paper discusses controversial issues of roles, demonstrating the expressiveness of the overall account, which allows for fine-grained distinctions and the integration of prior work.
Message Correlation and Business Protocol Discovery in Service Interaction Logs
Authors: Belkacem Serrour, Daniel P. Gasparotto, Hamamache Kheddouci, Boualem Benatallah
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

The problem of discovering protocols and business processes based on the analysis of log files is a real challenge. The behavior of a Web service can be specified using a Business Protocol, hence the importance of this discovery. The construction of the Business Protocol begins by correlating the logged messages into their conversations (i.e. instances of the business protocol). The accomplishment of this task is easy if we assume that the logs contain the right identifiers, which would allow us to associate every message to a conversation. But in real-world situations, this kind of information rarely exists inside the log files.Our work consists in correlating the messages present in Web service logs into the conversations they belong to, and then generating automatically the Business Protocol that reflects the messaging behavior perceived in the log. Contrary to other approaches, we do not assume the existence of a conversation identifier. We first model logged message relations using graphs and then we use graph theory techniques to extract the conversations and finally the Business Protocol. Logs are often incomplete and contain errors. This induces some uncertainty on the results. To address this problem, we apply the Dempster-Shafer theory of evidence. Our approach is implemented and tested using synthetic logs.
Weighing Down "The Unbearable Lightness of PIN Cracking"
Authors: Mohammad Mannan, P. C. Oorschot
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Responding to the PIN cracking attacks from Berkman and Ostrovsky (FC 2007), we outline a simple solution called salted-PIN. Instead of sending the regular user PIN, salted-PIN requires an ATM to generate a Transport Final PIN from a user PIN, account number, and a salt value (stored on the bank card) through, e.g., a pseudo-random function. We explore different attacks on this solution, and propose a variant of salted-PIN that can significantly restrict known attacks. Salted-PIN requires modifications to service points (e.g. ATMs), issuer/verification facilities, and bank cards; however, changes to intermediate switches are not required.
Cooperative CBR System for Sharing Student Models in Cooperative Intelligent Tutoring Systems
Authors: Carolina González, Juan C. Burguillo, Martín Llamas
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

Cooperation is the fundamental characteristic of multi-agent systems where the overall system exhibits significantly greater functionality than the individual components. In this paper, we propose a P2P cooperation framework for multiple Case-based Reasoning (CBR) agents to handle the student models initialization problem in Intelligent Tutoring Systems (ITSs). Our work shows that using the "committee" collaboration policy the agents can obtain better results that working alone, allowing to enhance the system overall performance.
Deontic Relevant Logic as the Logical Basis for Representing and Reasoning about Legal Knowledge in Legal Information Systems
Authors: Jingde Cheng
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

To represent and reason about various laws, legal rules, and precedents in legal information systems, we need a right fundamental logic system to provide us with a logical validity criterion of legal reasoning as well as a formal representation language. This position paper discusses why classical mathematical logic, its classical conservative extensions, or its non-classical alternatives are not suitable candidates for the fundamental logic, and shows that deontic relevant logic is a more hopeful candidate for the fundamental logic we need.
An Interactive Simulator for Information Communication Models
Authors: Mohamed Hamada
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Information theory is the science which deals with the concept `information', its measurement and its applications. In common practice information is used in terms of a Communication Model in which the emphasis lies on the transport of information, as generated by a source, to a destination. The communication system should transmit the information generated by the source to the destination as fast and accurately as possible. To achieve this goal several coding techniques were developed based on mathematical concepts. Due to this mathematical nature, information theory course is used to be taught by a traditional lecture-driven style. Studies showed that lecture-driven style is not effective with computer engineering students due to their active learning preferences. In this paper we introduce an interactive communication model simulator to facilitate teaching and learning of the basic concepts of information theory course. We also show the effectiveness of using the simulator in classroom.
Using Graphics Hardware for Enhancing Edge and Circle Detection
Authors: Antonio Ruiz, Manuel Ujaldón, Nicolás Guil
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

A broad family of problems in computer vision and image analysis require edge and circle detection. This paper explores the properties of the Hough transform for such tasks, improving them under a novel implementation on commodity graphics hardware. We demonstrate both a faster execution and a more reliable detection under different scenarios and a range of parameters selection. Overall, a consistent 3-6 acceleration factor and beyond is achieved for a 500 MHz GeForce 7950 GX2 graphics card versus a typical 3 GHz Pentium 4 dual-core CPU.
Learning a Kernel Matrix for Time Series Data from DTW Distances
Authors: Hiroyuki Narita, Yasumasa Sawamura, Akira Hayashi
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

One of the advantages of the kernel methods is that they can deal with various kinds of objects, not necessarily vectorial data with a fixed number of attributes. In this paper, we develop kernels for time series data using dynamic time warping (DTW) distances. Since DTW distances are pseudo distances that do not satisfy the triangle inequality, a kernel matrix based on them is not positive semidefinite, in general. We use semidefinite programming (SDP) to guarantee the positive definiteness of a kernel matrix. We present neighborhood preserving embedding (NPE), an SDP formulation to obtain a kernel matrix that best preserves the local geometry of time series data. We also present an out-of-sample extension (OSE) for NPE. We use two applications, time series classification and time series embedding for similarity search to validate our approach.
Hybrid automated fault localization in programs written by novice programmers
Authors: Peter Anthony Jensen
Venue:  (2008)

Locating errors in a faulty program is a challenging step in diagnosing and understanding programming mistakes. Fault localization is especially time-consuming for teachers and frustrating for students. To promote learning, it is important for teachers to provide constructive feedback to students about their programming mistakes. Unfortunately, teachers often test programs for correct output only. The opportunity for constructive feedback is lost because of the tedious nature of fault localization.Prior research has shown that static and dynamic program analysis techniques can be used to automate the fault localization process. While existing approaches can be applied to student programs, they are unsatisfactory because they either require too much teacher time and expertise, produce results that are not sufficiently precise, or employ algorithms that work only on trivially small programs.In this research I invented five hybrid automated fault localization methods that combine relevant slicing, program comparison, and machine learning algorithms to locate faults in Java programs written by novice programmers. Through a detailed quantitative evaluation I showed that the hybrid methods perform with greater precision than existing relevant slicing or program comparison methods. I also demonstrated that correct student-written programs can be used to aid fault localization in incorrect student-written programs, and that programming competitions can provide a vast supply of unbiased programs and data. Finally, I developed the FaultFinder system in Eclipse, which is a collection of program analysis, fault localization, and visualization tools that are based upon this research.
A New Load Balanced Routing Algorithm for Torus Networks
Authors: Jiyun Niu, Huaxi Gu, Changshan Wang
Venue: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies: First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers (2007)

Originated from gas diffusion phenomenon, a new load balanced routing algorithm named Gas Diffusion Based Load balanced Routing (GDLR) is proposed for torus networks. GDLR estimates global congestion in the network by the number of potential deadlocked packets. Based on this information, the probabilities of all possible ports a packet may use are accordingly determined. Subsequently, packets are sent out with the stochastic policy, which leads to data load spreading with consequent automatic load balancing. Finally, simulations have been carried out on 2D torus networks by using OPNET software. The results obtained show that GDLR achieves a better performance than other popular algorithms such as Dimension Order, Duato, and GAL.
Classification Method Utilizing Reliably Labeled Data
Authors: Kouta Nakata, Shigeaki Sakurai, Ryohei Orihara
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Making an accurate classifier needs accurate labeling, and accurate labeling needs accurate domain knowledge, experience and criteria, that is, experts to label. In reality, having such experts label all data that we need is often impossible because it requires of the high cost, and sometimes we have to make use of 'cheaper' data labeled by non-experts. In such case, experts' and non-experts' data are not discriminated in learning, even if mislabeled data in non-experts' data may make the resultant classifier poor. In this paper, we propose a classification method utilizing reliably labeled data. We utilize the previous knowledge of how reliable persons have given the labels, and set the degrees of label confidence on non-experts' data based on neighboring reliable experts data. The degrees of confidence are reflected in learning as data with higher confidence make a greater contribution to the classifier. With these assumptions, the results of experiments with publicly available data suggest that our method can make a more precise classifier than the conventional method that adopts all data equally.