ppxscal/embedding_network huggingface dataset:
A Generic Spoken Dialogue Manager Applied to an Interactive 2D Game
Authors: Andrea Corradini, Christer Samuelsson
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

A generic dialogue manager, previously used in real-world spoken language applications for databases and call-routing, was redeployed in an existing spoken language interface to a 2D game system, which required spatial reasoning, absent in previous applications. This was accomplished by separating general, domain, and application specific knowledge from the machinery, reusing the machinery and the general knowledge, and exploiting ergonomic specification languages for the remaining knowledge. The clear-cut agent-based architecture also contributed strongly to the success of the undertaking.
Testing Properties of Sets of Points in Metric Spaces
Authors: Krzysztof Onak
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Given query access to a set of points in a metric space, we wish to quickly check if it has a specific property. More precisely, we wish to distinguish sets of points that have the property from those that need to have at least an &epsilon; fraction of points modified to achieve it. We show one-sided error testers that immediately follow from known characterizations of metric spaces. Among other things, we give testers for tree metrics and ultrametrics which are optimal among one-sided error testers. Our tester for embeddability into the line is optimal even among two-sided error testers, and runs in sublinear time. We complement our algorithms with several lower bounds. For instance, we present lower bounds for testing dimensionality reduction in the ℓ1 and ℓ&infin; metrics, which improve upon lower bounds given by Krauthgamer and Sasson (SODA 2003). All our lower bounds are constructed by using a generic approach. We also look at the problem from a streaming perspective, and give a method for converting each of our property testers into a streaming tester.
Fine-grained parallelization of lattice QCD kernel routine on GPUs
Authors: Khaled Z. Ibrahim, François Bodin, Olivier Pène
Venue: Journal of Parallel and Distributed Computing (2008)

Simulation time for the classical problem of Lattice Quantum Chromodynamics (Lattice QCD) is dominated by one kernel routine responsible for computing the actions of a Dirac operator. This paper describes an experience in parallelizing this kernel routine. We explore parallelization granularities for this kernel routine on Graphical Processing Units (GPUs). We show that fine-grained parallelism can outperform coarse-grained parallelization, given that control-flow and communication effects are minimized. We propose two techniques for transforming control-flow-based code to control-free code. We also show how to reduce the communication effect by optimizing for commonly used sequences of calls to this routine. In our implementation on NVIDIA 8800 GTX, we were able to achieve an 8.3x speedup over an SSE2 optimized version on 2.8 GHz Intel Xeon CPU.
A PTD-based transaction protocol for public transportation
Authors: Chin-Ling Chen
Venue: International Journal of Communication Systems (2008)

Advances in wireless network technology and the increasing number of users of the personal trusted device (PTD) make the PTD an ideal channel for offering personalized services to mobile users. In this paper, we propose using a PTD as a payment tool in a mobile transaction system for public transportation. To overcome the inherent weakness of computing resources in a PTD, we use a trusted observer to coordinate the mobile transaction and to integrate cryptology (such as a digital signature and a one-way hash function). The proposed scheme satisfies the requirements for mobile transactions. These requirements include fairness, non-repudiation, anonymity, off-line capability, no forgery, efficient verification, simplicity, and practicability. Because a PTD is more portable and personal than a personal computer and because the public transportation can be a necessity in our daily lives, our scheme proposes a novel use of PTDs in mobile commerce. Copyright &copy; 2008 John Wiley & Sons, Ltd.
L-CAN: Locality Aware Structured Overlay for P2P Live Streaming
Authors: Nikolaos Efthymiopoulos, Athanasios Christakidis, Spyros Denazis, Odysseas Koufopavlou
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

A p2p streaming system must be able to exploit the locality information between peers, in order to deliver a stream quickly to all peers with high level of bandwidth utilization. In this paper we propose a locality aware and balanced overlay for p2p live streaming which can adapt to the dynamic behavior of the participating peers and the underlying network. Our overlay is created and maintained through the use of two algorithms, called the placement and the swapping algorithm that we consider as the major contributions in this paper. These are responsible for the insertion of a node and the dynamic and distributed optimization of the overlay in order to reflect the underlying network. The proposed overlay is evaluated through extensive simulations that show that the bandwidth utilization of the peers and the set-up time are significantly improved through locality between peers.
An Authoring Tool That Facilitates the Rapid Development of Dialogue Agents for Intelligent Tutoring Systems
Authors: Yue Cui, Carolyn Penstein Rosé
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Natural language dialogues have been demonstrated to be effective for instruction in a variety of settings. However, previous research has demonstrated that the hierarchical structure of dialogue, which is a natural representation for linguists, is difficult for non-linguists to understand and work with. Even for linguists, it is possible to lose track of where one is in this hierarchical structure during authoring. We refer to difficulty in working with this hierarchical representation as the hierarchical navigation problem. In this short paper we present a simple but powerful tool designed to facilitate the authoring process, which includes innovative interface elements that specifically target the hierarchical navigation problem. Our user study demonstrates progress towards overcoming this difficulty.
An Intelligent Tutoring System for Improving Application Accessibility of Disabled Learners
Authors: Hussein Karam Hussein Abd El-Sattar
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

The field of computer to help users with special needs, and/or users with disabilities has now reached a very exciting watershed. Users who are physically disabled require a variety of access technology and learning depending on the nature of their disability. The intention of modern technology policy is to enable users with intellectual disabilities to have as much choice and control as possible over their lives, be involved in their communities, and make a valued contribution to the world at work. However, in order to achieve these aims, more effective educational and training media are needed as well as an intelligent tutoring system (ITS) for improving their skills and removing the barriers that turn cognitive impairments into intellectual disability. This paper proposes an (ITS) framework dedicated to users who are deaf as a solution for such a challenge. The proposed system help to meet these needs solves accessibility problem and enables access to information technologies by users with disabilities in a simple and reliable way. 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
An Approach to Domain-Specific Reuse in Service-Oriented Environments
Authors: Jianwu Wang, Jian Yu, Paolo Falcarin, Yanbo Han, Maurizio Morisio
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Domain engineering is successful in promoting reuse. An approach to domain-specific reuse in service-oriented environments is proposed to facilitate service requesters to reuse Web services. In the approach, we present a conceptual model of domain-specific services (called domain service). Domain services in a certain business domain are modeled by semantic and feature modeling techniques, and bound to Web services with diverse capabilities through a variability-supported matching mechanism. By reusing pre-modeled domain services, service requesters can describe their requests easily through a service customization mechanism. Web service selection based on customized results can also be optimized by reusing the pre-matching results between domain services and Web services. Feasibility of the whole approach is demonstrated on an example.
Conversational Case-Based Reasoning in Self-healing and Recovery
Authors: David Mcsherry, Sa'Adah Hassan, David Bustard
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

Self-healing and recovery informed by environment knowledge (SHRIEK) is an autonomic computing approach to improving the robustness of computing systems. Case-based reasoning (CBR) is used to guide fault diagnosis and enable learning from experience, and rule-based reasoning to enable fault remediation and recovery informed by environment knowledge. Focusing on the role of conversational CBR (CCBR) in the management of faults that rely on user interaction for their detection and diagnosis, we present a hypothesis-driven approach to question selection in CCBR that aims to increase the transparency of CCBR dialogues by enabling the system to explain the relevance of any question the user is asked. We also present empirical results which suggest that there is no loss of problem-solving efficiency in the approach. Finally, we investigate the effects of the environment awareness provided by autonomous information gathering in SHRIEK on the efficiency of CCBR dialogues.
Making Business Software Usable for Handicapped Employees
Authors: Annett Hardt, Martin Schrepp
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The accessibility of business software is a prerequisite for the successful integration of disabled persons into the labor market. But because of the dynamic and complex nature of business applications it is often difficult to reach a satisfying level of accessibility and usability for disabled users. A special problem for business software is that it is not sufficient to make all functions of the product accessible to disabled users. It must also be guaranteed that disabled users can work efficiently with the product. We demonstrate these problems on the example of a CRM business web application.
A Hybrid Approach for Data Preprocessing in the QSAR Problem
Authors: Adina Cocu, Luminita Dumitriu, Marian Craciun, Cristina Segal
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

One of the approaches in the Knowledge Discovery in Databases (KDD) domain is Predictive Toxicology (PT). Its aim is to discover and represent the relationships between the chemical structure of chemical compounds and biological and toxicological processes. The challenges in real toxicology problems are big amount of the chemical descriptors and imperfect data (means noisy, redundant, incomplete, and irrelevant). The main goals in knowledge discovery field are to detect these undesirable proprieties and to eliminate or correct them. This supposes noise reduction, data cleaning and feature selection because the performance of the applied Machine Learning algorithms is strongly related with the quality of the used data. In this paper, we present some of the issues that can be performed for preparing data before the knowledge discovery process begin.
Face Recognition Using Principal Geodesic Analysis and Manifold Learning
Authors: Matthew P. Dickens, William A. Smith, Jing Wu, Edwin R. Hancock
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

This paper describes how face recognition can be effected using 3D shape information extracted from single 2D image views. We characterise the shape of the field of facial normals using a statistical model based on principal geodesic analysis. The model can be fitted to 2D brightness images of faces to recover a vector of shape parameters. Since it captures variations in a field of surface normals, the dimensionality of the shape vector is twice the number of image pixels. We investigate how to perform face recognition using the output of PGA by applying a number of dimensionality reduction techniques including principal components analysis, locally linear embedding, locality preserving projection and Isomap.
Predicting Affective States expressed through an Emote-Aloud Procedure from AutoTutor's Mixed-Initiative Dialogue
Authors: Sidney K. D'Mello, Scotty D. Craig, Jeremiah Sullins, Arthur C. Graesser
Venue: International Journal of Artificial Intelligence in Education (2006)

This paper investigates how frequent conversation patterns from a mixed-initiative dialogue with an intelligent tutoring system, AutoTutor, can significantly predict users' affective states (e.g. confusion, eureka, frustration). This study adopted an emote-aloud procedure in which participants were recorded as they verbalized their affective states while interacting with AutoTutor. The tutor-tutee interaction was coded on scales of conversational directness (the amount of information provided by the tutor to the learner, with a theoretical ordering of assertion > prompt for particular information > hint), feedback (positive, neutral, negative), and content coverage scores for each student contribution obtained from the tutor's log files. Correlation and regression analyses confirmed the hypothesis that dialogue features could significantly predict the affective states of confusion, eureka, and frustration. Standard classification techniques were used to assess the reliability of the automatic detection of learners' affect from the conversation features. We discuss the prospects of extending AutoTutor into an affect-sensing intelligent tutoring system.
Symbiotic Simulation Control in Semiconductor Manufacturing
Authors: Heiko Aydt, Stephen John Turner, Wentong Cai, Malcolm Yoke Low, Peter Lendermann, Boon Ping Gan
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Semiconductor manufacturing is a highly complex and asset intensive process. Solutions are needed to automate control of equipment and improve efficiency. We describe a symbiotic simulation control system which uses reactive what-if analysis to find a stable configuration of a wet bench tool set. This control system is based on a generic framework for symbiotic simulation. We show that symbiotic simulation can be used to make control decisions in near real-time. Furthermore, we show that our approach yields a notable performance improvement over common practise.
Intrinsic Limitations in Context Modelling
Authors: Maria E. Orłowska
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Where are the limits in context modelling? Can we ever model context? Do we understand the limits in context modelling, in the context of business process execution?
Event-Driven Database Information Sharing
Authors: Luis Vargas, Jean Bacon, Ken Moody
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

Database systems have been designed to manage business critical information and provide this information on request to connected clients, a passive model. Increasingly, applications need to share information actively with clients and/or external systems, so that they can react to relevant information as soon as it becomes available. Event-driven architecture (EDA) is a software architectural pattern that models these requirements based on the production of, consumption of, and reaction to events. Publish/subscribe provides a loosely-coupled communication paradigm between the components of a system, through many-to-many, push-based event delivery. In this paper, we describe our work integrating distributed content-based publish/subscribe functionality into a database system. We have extended existing database technology with new capabilities to realise EDA in a reliable, scalable, and secure manner. We discuss the design, architecture, and implementation of PostgreSQL-PS, a prototype built on the PostgreSQL open-source database system.
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
Authors: Hartmut Ehrig, Ulrike Prange
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The corresponding rules also contain these parts and describe the simultaneous construction of both the source and the target model. From these rules, forward rules can be derived which describe the model transformation from a given source model to a target model. The forward transformation must be source consistent in order to define a valid model transformation. Source consistency implies that the source and the target model correspond to each other according to a triple transformation.In this paper, the relationship between the source consistency of forward transformations, and NAC consistency and termination used in other model transformation approaches is analysed from a formal point of view. We define the kernel of a forward rule and construct NACs based on this kernel. Then we give sufficient conditions such that source consistency implies NAC consistency and termination. Moreover, we analyse how to achieve local confluence independent of source consistency. Both results together provide sufficient conditions for functional behaviour of model transformations. Our results are illustrated by an example describing a model transformation from activity diagrams to CSP.
A Design Method for Heterogeneous Adders
Authors: Jeong-Gun Lee, Jeong-A Lee, Byeong-Seok Lee, Milos D. Ercegovac
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

The performance of existing adders varies widely in their speed and area requirements, which in turn sometimes makes designers pay a high cost in area especially when the delay requirements exceeds the fastest speed of a specific adder, no matter how small the difference is. To expand the design space and manage delay/area tradeoffs, we propose new adder architecture and a design methodology. The proposed adder architecture, named heterogeneous adder, decomposes an adder into blocks (sub-adders) consisting of carry-propagate adders of different types and precision. The flexibility in selecting the characteristics of sub-adders is the basis in achieving adder designs with desirable characteristics.We consider the area optimization under delay constraints and the delay optimization under area constraints by determining the bit-width of sub-adders using Integer Linear Programming. We demonstrate the effectiveness of the proposed architecture and the design method on 128-bit operands.
The Computability Path Ordering: The End of a Quest
Authors: Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.
Comparing program techniques in the solution of EM type problems using FEM
Authors: N. Füsun Serteller, Dursun Üstündaǧ
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

Numerical modeling is now an essential part of electrical engineering education. This paper reviews electrostatic field distribution (EM) using the finite element method (FEM) programming language Mathematica 6.0 and MATLAB. The results from the two different programs were tested using the finite difference method (FD). Computer programs and formulations of the finite element technique have been constructed to make the concept more understandable and explicit for engineering students and practicing engineers.
Concurrency, Synchronization, and Conflicts in Petri Nets
Authors: Hsu-Chun Yen
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

Petri nets represent one of the most popular formalisms for specifying, modeling, and analyzing concurrent systems. In spite of their popularity, many interesting problems concerning Petri nets are either undecidable or of very high complexity. Lipton [7] and Rackoff [10] showed exponential space lower and upper bounds, respectively, for the boundedness problem. As for the containment and the equivalence problems, Rabin [1] and Hack [5], respectively, showed these two problems to be undecidable. The reachability problem is known to be decidable [8] and exponential-space-hard [7].
A comparison of discrete cosine and discrete wavelet transforms for efficient low-power oriented embedded design
Authors: Dokouzyannis Stavros, Kechagias Asterios
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

Two popular transforms for image coding are the Discrete Cosine Transform and the Discrete Wavelet Transform. Both perform well in image processing and have certain similarities. The two algorithms are compared regarding the implementation efficiency as well as an adequate reconstruction of the original image. The scope of this work is to determine the degree of some loss of coded/decoded image quality, accepted by psycho-visual human criteria, in order to combine this loss with the reduction of hardware, necessary during low-power design of the respective coders/decoders. The analysis is based on psycho-visual experiments made on benchmark images, being coded/decoded by the mentioned two transforms.
Class Noise Mitigation Through Instance Weighting
Authors: Umaa Rebbapragada, Carla E. Brodley
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We describe a novel framework for class noise mitigation that assigns a vector of class membership probabilities to each training instance, and uses the confidence on the current label as a weight during training. The probability vector should be calculated such that clean instances have a high confidence on its current label, while mislabeled instances have a low confidence on its current label and a high confidence on its correct label. Past research focuses on techniques that either discard or correct instances. This paper proposes that discarding and correcting are special cases of instance weighting, and thus, part of this framework. We propose a method that uses clustering to calculate a probability distribution over the class labels for each instance. We demonstrate that our method improves classifier accuracy over the original training set. We also demonstrate that instance weighting can outperform discarding.