ppxscal/embedding_network huggingface dataset:
Varying Personality in Spoken Dialogue with a Virtual Human
Authors: Michael Rushforth, Sudeep Gandhe, Ron Artstein, Antonio Roque, Sarrah Ali, Nicolle Whitman, David Traum
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

This poster reports the results of two experiments to test a personality framework for virtual characters. We use the Tactical Questioning dialogue system architecture (TACQ) [1] as a testbed for this effort. Characters built using the TACQ architecture can be used by trainees to practice their questioning skills by engaging in a role-play with a virtual human. The architecture supports advanced behavior in a questioning setting, including deceptive behavior, simple negotiations about whether to answer, tracking subdialogues for offers/threats, grounding behavior, and maintenance of the affective state of the virtual human. Trainees can use different questioning tactics in their sessions. In order for the questioning training to be effective, trainees should have experience of interacting with virtual humans with different personalities, who react in different ways to the same questioning tactics.
A Lower Bound for Scheduling Mechanisms
Authors: George Christodoulou, Elias Koutsoupias, Angelina Vidali
Venue: Algorithmica (2009)

We study the mechanism design problem of scheduling tasks on n unrelated machines in which the machines are the players of the mechanism. The problem was proposed and studied in the seminal paper of Nisan and Ronen on algorithmic mechanism design, where it was shown that the approximation ratio of mechanisms is between 2 and n. We improve the lower bound to $1+\sqrt{2}$for 3 or more machines.
Scalable Link-Based Relay Selection for Anonymous Routing
Authors: Micah Sherr, Matt Blaze, Boon Thau Loo
Venue: Proceedings of the 9th International Symposium on Privacy Enhancing Technologies (2009)

The performance of an anonymous path can be described using many network metrics --- e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have focused exclusively on producing paths with high bandwidth. In contrast to traditional node-based path techniques in which relay selection is biased by relays' node-characteristics (i.e., bandwidth), this paper presents the case for link-based path generation in which relay selection is weighted in favor of the highest performing links. Link-based relay selection supports more flexible routing, enabling anonymous paths with low latency, jitter, and loss, in addition to high bandwidth. Link-based approaches are also more secure than node-based techniques, eliminating "hotspots" in the network that attract a disproportionate amount of traffic. For example, misbehaving relays cannot advertise themselves as "low-latency" nodes to attract traffic, since latency has meaning only when measured between two endpoints. We argue that link-based path selection is practical for certain anonymity networks, and describe mechanisms for efficiently storing and disseminating link information.
The 7 Basic Functions of a Digital Library - Analysis of Focus Groups about the Usefulness of a Thematic Digital Library on the History of European Integration
Authors: Eric Brangier, Jérôme Dinet, Laurent Eilrich
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

This paper presents the main results of a study involving an original user-centred design approach to modify and improve a specific digital library (DL) related to the history of European integration. The ultimate goal of the project is twofold: (1) to find ways to improve end-users' use of this thematic DL; (2) to develop an original method to measure real users' needs and mental representation. This user-centred approach is based on focus groups, this technique being a powerful means to evaluate services or test new ideas. In our study, more precisely, focus groups were set up by conducting interviews with 58 users (researchers, professionals in documentation, journalists, historians, teachers, students, ergonomists, politicians, computer engineers, etc.), but including four to five people at the same time in the same group. Each of these 14 focus groups was videotaped for a 3-hour period and all verbalisations (needs, viewpoints, etc.) were transcribed. Our analysis showed that the users' needs can be expressed through seven basic functions which match the users' expectations. This paper brings together the process by which these functions were identified and also discusses the interests, limitations and possible generalisations of these functions in the context of all digital libraries.
A Review on Augmented Reality for Virtual Heritage System
Authors: Zakiah Noh, Mohd Shahrizal Sunar, Zhigeng Pan
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Augmented reality is one of the emerging technologies to reconstruct the historical building and monument in the previous era, where the user experiences with the real environment or virtual scene. In education, Virtual Heritage becomes as a platform of learning, motivating and understanding of certain events and historical elements for the students and researchers. The significance of reconstruction of digital culture heritage are to preserve, protect and interpret of our cultural and history. In recent year, there are a number of significant researches and techniques that have been developed, which is focusing on virtual restitution of historical sites. This paper will present an overview on augmented reality in Virtual Heritage system and also consists with the explanation of techniques to reconstruct the historical sites.
Generalized Theoroidal Institution Comorphisms
Authors: Mihai Codescu
Venue: Recent Trends in Algebraic Development Techniques: 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers (2009)

We propose a generalization of the notion of theoroidal comorphism, motivated by several logic translations of practical importance, encountered in the implementation of Heterogeneous Tool Set Hets. We discuss the impact of this generalization on the level of heterogenous specifications, by presenting the Grothendieck construction over a diagram of institutions and translations modelled as generalized comorphisms. Conditions for heterogeneous proofs are also evaluated. 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
Research on Structure Security Evaluation and Fault Diagnosis of Gate Crane Jib
Authors: Siqun Ma, Xiaopeng Wu, Yanbin Sun, Shaoze Zhou
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

The service of gate crane is the age limit, and there are many problems, such as the fallen rivets and the thinner steel plates due to corrosion. The author makes three dimensional modeling and performs the finite element computation of jib system with the I-DEAS software in this paper, and then carries out failure and effects analyses and fault tree analyses based on the computations. Simulation results shown the stress computation values of jib system at certain observation points have surpassed allowable stress of structural strength. But they are smaller than the metal structure material strength limit. The RPN value and fault tree smallest cutest of the jib system got by the reliability can provide the important reference for the enterprise users in the use and maintenance of gate cranes in future.The research work indicates that the user should make the inspection regularly for jib systems and take measures to make reasonable repair in order to avoid grave accidents.
Non-feedback Control on Chaotic Logistic System
Authors: Dongmei Wu, Yongqing Fu, Wusheng Zhao, Shangguo Yang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Non-feedback chaos control of logistic map is realized by means of periodic parameter perturbations. The feasibility of this scheme is proved by bifurcation diagram and Lyapunov exponent method, and the control parameters are obtained. Numerical simulations show that as long as the proper intensity and periods of periodic perturbation are chosen, the system can be controlled from chaos to the steady periodic orbit rapidly.
Enhancing pair learning of pupils with cognitive disabilities: structural support with help of floor control
Authors: Martina Bientzle, Katrin Wodzicki, Andreas Lingnau, Ulrike Cress
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Computer-supported collaborative learning has the potential to be an effective learning method for pupils with cognitive disabilities, but there is just little research in this area. A computer-supported environment offers several possibilities to handle the specific demands of this target group, for example, by structuring the learning situation with Floor Control. Floor Control explicitly structures the activities in the learning environment and implicitly enhances communication. To examine whether the Floor Control supports the collaboration process on activity level as well as on communication level or not, two versions of a CSCL environment were realized and compared with each other. The results revealed an improved task-related communication and a higher quality of learning results.
Designing interorganizational networks for innovation: An empirical examination of network configuration, formation and governance
Authors: Sara Thorgren, Joakim Wincent, Daniel Örtqvist
Venue: Journal of Engineering and Technology Management (2009)

Strategic SME networks have received significant policy attention, yet a review of the current literature reveals limited attention to the factors that contribute to network innovation. This study examines the influence of the number of member firms (network size), the extent to which a network is based on firm incentives (bottom-up formation), and the extent of development of the governance structure (size of administrative function) on a network's innovative performance. Latent growth modeling with longitudinal data from 53 networks reveals that larger networks and bottom-up formed networks achieve greater innovative performance, and that the administrative function partially mediates these effects.
Classifier combination techniques applied to coreference resolution
Authors: Smita Vemulapalli, Xiaoqiang Luo, John F. Pitrelli, Imed Zitouni
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium (2009)

This paper examines the applicability of classifier combination approaches such as bagging and boosting for coreference resolution. To the best of our knowledge, this is the first effort that utilizes such techniques for coreference resolution. In this paper, we provide experimental evidence which indicates that the accuracy of the coreference engine can potentially be increased by use of bagging and boosting methods, without any additional features or training data. We implement and evaluate combination techniques at the mention, entity and document level, and also address issues like entity alignment, that are specific to coreference resolution.
Inducing temporal graphs
Authors: Philip Bramsen, Pawan Deshpande, Yoong Keok Lee, Regina Barzilay
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of text that maintains temporal coherence. The strength of our approach lies in its ability to simultaneously optimize pairwise ordering preferences and global constraints on the graph topology. Our learning method achieves 83% F-measure in temporal segmentation and 84% accuracy in inferring temporal relations between two segments.
CIGAR: concurrent and interleaving goal and activity recognition
Authors: Derek Hao Hu, Qiang Yang
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recognition is that users often pursue several high-level goals in a concurrent and interleaving manner, where the pursuit of goals may spread over different parts of an activity sequence and may be pursued in parallel. Existing approaches to recognizing multiple goals often formulate this problem either as a single-goal recognition problem or in a deterministic way, ignoring uncertainty. In this paper, we propose CIGAR (Concurrent and Interleaving Goal and Activity Recognition) - a novel and simple two-level probabilistic framework for multiple-goal recognition where we can recognize both concurrent and interleaving goals. We use skip-chain conditional random fields (SCCRF) for modeling interleaving goals and we model concurrent goals by adjusting inferred probabilities through a correlation graph, which is a major advantage in that we are able to reason about goal interactions explicitly through the correlation graph. The two-level framework also avoids the high training complexity when modeling concurrency and interleaving together in a unified CRF model. Experimental results show that our method can effectively improve recognition accuracies on several real-world datasets collected from various wireless and sensor networks.
A metaobject protocol for CLforJava
Authors: Jay Cotton, Jerry Boetje
Venue: Proceedings of the 2007 International Lisp Conference (2007)

CLforJava is a new implementation of Common Lisp that intertwines its architecture and operation with Java. The authors describe a new architecture for a CLOS MOP that supports transparent, bi-directional access between Lisp and Java. The access requires no special techniques nor syntactic mechanisms on the part of the programmer - being either Java or Lisp. The core of the new MOP is a data structure that melds the fundamental structures of Java instances (N-tuples) and CLOS instances (2-tuples) in such a way that the respective object systems can interact without cumbersome translations. Methods from their respective object systems can interact freely. We discuss certain aspects of the respective MOPs that prevent a complete integration and replacement of one system by the other.
Properties of variations in the periods of ring neural oscillators with noise
Authors: Yo Horikawa, Hiroyuki Kitajima
Venue: Neurocomputing (2009)

Effects of additive noise on a series of the periods of oscillations in unidirectionally coupled ring neural networks of ring oscillator type are studied. Kinematical models of the traveling waves of an inconsistency, i.e. the successive same signs in the states of adjacent neurons in the network, are derived. A series of the half periods in the network of N neuron is then expressed by the sum of N sequences of the N-first order autoregressive process, the process with the spectrum of exponential type and the first-order autoregressive process. Noise and the interaction of the inconsistency cause characteristic positive correlations in a series of the half periods of the oscillations. Further, an experiment on an analog circuit of the ring neural oscillator was done and it is shown that correlations in the obtained periods of the oscillations agree with the derived three expressions.
Applications of Visible Light Path Laser Projector
Authors: Nobuchika Sakata, Shu Okamoto, Shogo Nishida
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

We proposed and developed a method to visualize the light path of a laser with jetting mists along light axis of a laser pointer. The estimation accuracy for the position of a laser spot occluded behind an object was improved when the light path of the laser was visualized. In this paper, we propose visible light path laser projector (VLLP) for remote collaboration. VLLP is equipped with a laser projector and a mist generator. With the laser projector, VLLP can instruct with not only a laser spot but also simple line drawings. Furthermore, we propose several VLLP application prototypes.
A framework for representing and solving NP search problems
Authors: David G. Mitchell, Eugenia Ternovska
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

NP search and decision problems occur widely in AI, and a number of general-purpose methods for solving them have been developed. The dominant approaches include propositional satisfiability (SAT), constraint satisfaction problems (CSP), and answer set programming (ASP). Here, we propose a declarative constraint programming framework which we believe combines many strengths of these approaches, while addressing weaknesses in each of them. We formalize our approach as a model extension problem, which is based on the classical notion of extension of a structure by new relations. A parameterized version of this problem captures NP. We discuss properties of the formal framework intended to support effective modelling, and prospects for effective solver design.
Hixosfs_Music: A Filesystem in Linux Kernel Space for Musical Files
Authors: Nicola Corriero, Vittoria Cozza
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

Hixosfs_music is a Linux ﬁle system that could be included in the standard Linux kernel. Differences respect to the widely used ext2 ﬁle system are additional features for storing and efﬁciently retrieving musical data. Specially it extends the inode for each musical ﬁle with new proprieties relatives to the ﬁle content such as album, author, title, year. Beside standard user mode tools (stats, chmod, ls and so on), speciﬁc command are needed to directly handle with new ﬁle tags (statmusic, chmusic, orderby, and so on).
Combinator Parsing: A Short Tutorial
Authors: S. Doaitse Swierstra
Venue: Language Engineering and Rigorous Software Development: International LerNet ALFA Summer School 2008, Piriapolis, Uruguay, February 24 - March 1, 2008, Revised Tutorial Lectures (2009)

There are numerous ways to implement a parser for a given syntax; using parser combinators is a powerful approach to parsing which derives much of its power and expressiveness from the type system and semantics of the host programming language. This tutorial begins with the construction of a small library of parsing combinators. This library introduces the basics of combinator parsing and, more generally, demonstrates how domain specific embedded languages are able to leverage the facilities of the host language. After having constructed our small combinator library, we investigate some shortcomings of the naïve implementation introduced in the first part, and incrementally develop an implementation without these problems. Finally we discuss some further extensions of the presented library and compare our approach with similar libraries.
Measuring Cognitive Workload in Non-military Scenarios Criteria for Sensor Technologies
Authors: Jörg Voskamp, Bodo Urban
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Augmented Cognition manifesting in the DARPA project is becoming of more and more interest to non-military application areas. First areas it is going to be applied are in flight control and power plant control. Measuring cognitive workload in the context of Augmented Cognition is bound to the application of sensor technologies and frameworks which are going to be applied to users. It is necessary to make Augmented Cognition Application in non-military areas as comfortable to the user as possible as we do not want to disturb her but to support her in her tasks. In this paper we will define criteria to be considered when designing Augmented Cognition applications in non-military environments.
The Architecture of the XtreemOS Grid Checkpointing Service
Authors: John Mehnert-Spahn, Thomas Ropars, Michael Schoettner, Christine Morin
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The EU-funded XtreemOS project implements a grid operating system (OS) transparently exploiting distributed resources through the SAGA and POSIX interfaces. XtreemOS uses an integrated grid checkpointing service (XtreemGCP) for implementing migration and fault tolerance for grid applications. Checkpointing and restarting applications in a grid requires saving and restoring distributed/parallel applications in distributed heterogeneous environments. In this paper we present the architecture of the XtreemGCP service integrating existing system-specific checkpointer solutions. We propose to bridge the gap between grid semantics and system-specific checkpointers by introducing a common kernel checkpointer API that allows using different checkpointers in a uniform way. Our architecture is open to support different checkpointing strategies that can be adapted according to evolving failure situations or changing application requirements. Finally, we discuss measurements numbers showing that the XtreemGGP architecture introduces only minimal overhead.
Poster abstract: Multihop routing in camera sensor networks - An experimental study
Authors: Kirak Hong, Posu Yan, Phoebus Chen, Shankar Sastry, Songhwai Oh
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

While the traditional wireless sensor networks (WSN) consist of low-bandwidth sensors with limited capabilities, e.g., acoustic, vibration, and infrared sensors, camera sensor networks can provide visual verification, in-depth situational awareness, recognition, and other capabilities ([1], and references therein).
Level sets and the representation theorem for intuitionistic fuzzy sets
Authors: Ronald R. Yager
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

We discuss the concept of a level set of a fuzzy set and the related ideas of the representation theorem and Zadeh&#x2019;s extension principle. We then describe the extension of these ideas to the case of interval valued fuzzy sets (IVFS). We then recall the formal equivalence between IVFS and intuitionistic fuzzy sets (IFS). This equivalence allows us to naturally extend the concepts of level sets, representation theorem and extension principle from the domain of IVFS to the domain of IFS. What is important to note here is that in the case of these non-standard fuzzy sets, interval valued and intuitionistic, the number of distinct level sets can be greater then the number of distinct membership grades of the fuzzy set being represented. This is a result of the fact that the distinct level sets are generated by the power set of the membership grades. In particular, the minimum of each subset of membership grades provides a level set. In the case of the standard fuzzy sets the minimum of a subset of membership grades results in one of the elements in the subset. In the case of the non-standard fuzzy sets, the membership grades are not linearly ordered and hence taking the minimum of a subset of these can result in a value that was not one of the members of the subset.