ppxscal/embedding_network huggingface dataset:
A Grammar Formalism for Specifying ISU-Based Dialogue Systems
Authors: Peter Ljunglöf, Staffan Larsson
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

We describe how to give a full specification of an ISU-based dialogue system as a grammar. For this we use Grammatical Framework (GF), which separates grammars into abstract and concrete syntax. All components necessary for a working GoDiS dialogue system are specified in the abstract syntax, while the linguistic details are defined in the concrete syntax. Since GF is a multilingual grammar formalism, it is straightforward to extend the dialogue system to several languages. Furthermore, the GF Resource Grammar Library can be used to write a single concrete instance covering 13 different languages.
Open 3D Shared Space Construction Scheme for Symbiotic Collaborative Works
Authors: Takayuki Kuroda, Akira Sakatoku, Gen Kitagata, Debasish Chakraborty, Norio Shiratori
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In this paper, we propose an open 3D shared space construction scheme based on the concept of Symbiotic Computing which we have been promoting. Existing 3D collaborative work supporting systems have some limitations with their 3D shared space construction and inter-application cooperation because these systems are basically closed nature. To break these limitations, we are developing symbiotic collaborative work supporting system which can effectively support remote collaborative work. Our scheme enables us to easily and flexibly build collaborative work environment by reusing and combining space definitions and applications designed by the general public such as WWW environment. In addition, we describe design and implementation of a prototype system, and confirm feasibility of our proposed scheme through experiments by using the prototype system.
Discovering tactical behavior patterns supported by topological structures in soccer agent domains
Authors: Fernando Ramos, Huberto Ayanegui
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Behaviors in soccer-agent domains can involve individual plays, several players involved in tactical plays or the whole team trying to follow strategies supported by specific formations. The discovery of such behaviors needs the tracking of both the positions of players at any instant of the game and relevant relations able to represent particular interactions between players. Nevertheless, the tracking task becomes very complicated because the dynamic conditions of the game implying drastic changes of positions and interactions between players. We propose in this work a model able to manage the constant changes occurring in the game, which consists in building topological structures based on triangular planar graphs. Thus, based on this model tactical behavior patterns have been discovered even the dynamic conditions. Experimental results show that the proposed model is able to manage the constant changes of the world and discover tactical behaviors patterns. For that, an important number of matches have been analyzed from the RoboCup Simulation league.
Quality Evaluation of Color Demosaicing According to Image Resolution
Authors: Yanqin Yang, Olivier Losson, Luc Duvieubourg
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

To obtain a true color image from the Bayer CFA samples, an estimation process using interpolation is performed to retrieve the missing color components of each pixel. This is commonly referred to as CFA demosaicing. In this paper, we study the relationship between the resolution of the acquired CFA image and the quality of the demosaiced color image. For this purpose, we propose new criteria based especially on the detected edges of the objects present in the scene.
Segmentation of Vessels Cluttered with Cells Using a Physics Based Model
Authors: Stephen J. Schmugge, Steve Keller, Nhat Nguyen, Richard Souvenir, Toan Huynh, Mark Clemens, Min C. Shin
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Segmentation of vessels in biomedical images is important as it can provide insight into analysis of vascular morphology, topology and is required for kinetic analysis of flow velocity and vessel permeability. Intravital microscopy is a powerful tool as it enables in vivo imaging of both vasculature and circulating cells. However, the analysis of vasculature in those images is difficult due to the presence of cells and their image gradient. In this paper, we provide a novel method of segmenting vessels with a high level of cell related clutter. A set of virtual point pairs ("vessel probes") are moved reacting to forces including Vessel Vector Flow (VVF) and Vessel Boundary Vector Flow (VBVF) forces. Incorporating the cell detection, the VVF force attracts the probes toward the vessel, while the VBVF force attracts the virtual points of the probes to localize the vessel boundary without being distracted by the image features of the cells. The vessel probes are moved according to Newtonian Physics reacting to the net of forces applied on them. We demonstrate the results on a set of five real in vivo images of liver vasculature cluttered by white blood cells. When compared against the ground truth prepared by the technician, the Root Mean Squared Error (RMSE) of segmentation with VVF and VBVF was 55% lower than the method without VVF and VBVF.
Fine Processing
Authors: Ian Bogost
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

This article first presents a series of concerns about the concept and field called persuasive technology, including an overly broad focus on technology instead of computation, and a focus on ends instead of means. As a possible solution, an alternative perspective is offered, dubbed fine processing, which is modeled after the concept of belles lettres.
Levels of Assurance and Reauthentication in Federated Environments
Authors: Manuel Sánchez, Óscar Cánovas, Gabriel López, Antonio F. Gómez-Skarmeta
Venue: Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice (2008)

This paper presents a generic proposal for improving existing IdM systems, by enabling service providers to determine whether the SSO credentials presented by a user satisfy some minimum requirements. For example, a service provider may require the users to have been authenticated using a method labelled with a particular level of assurance or a credential issued by a specific identity provider. Thus, a user initially authenticated by a username and password might not access a service that requires a stronger mechanism, such as public key certificates. Similarly, the access to some critical service may be restricted to users belonging to a specific organization. The main contribution of this paper is a generic infrastructure that defines the mechanisms to enforce access control policies based on levels of assurance and multiple identities, and it also provides the means to find and redirect the users to the appropriate authentication service when reauthentication is required.
Using Cases Utility for Heuristic Planning Improvement
Authors: Tomás La Rosa, Angel García Olaya, Daniel Borrajo
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue, in order to select efficiently nodes to evaluate from the successors of the current search node. In a previous work, we successfully applied a CBR approach to order nodes for evaluation, thus reducing the number of calls to the heuristic function. However, once cases were learned, they were not modified according to their utility on solving planning problems. We present in this work a scheme for learning case quality based on its utility during a validation phase. The qualities obtained determine the way in which these cases are preferred in the retrieval and replay processes. Then, the paper shows some experimental results for several benchmarks taken from the International Planning Competition (IPC). These results show the planning performance improvement when case utilities are used.
Recovering Secret Keys from Weak Side Channel Traces of Differing Lengths
Authors: Colin D. Walter
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

Secret key recovery from weak side channel leakage is always a challenge in the presence of standard counter-measures. The use of randomised exponent recodings in RSA or ECC means that, over multiple re-uses of a key, operations which correspond to a given key bit are not aligned in the traces. This enhances the difficulties because traces cannot be averaged to improve the signal-to-noise ratio.The situation can be described using a hidden Markov model (HMM) but the standard solution is computationally infeasible when many traces have to be processed. Previous work has not provided a satisfactory way out. Here, instead of ad hoc sequential processing of complete traces, trace prefixes are combined naturally in parallel. This results in the systematic extraction of a much higher proportion of the information theoretic content of the leakage, enabling many keys of typical ECC length to be recovered with a computationally feasible search through a list of most likely values. Moreover, likely errors can now be located very easily.
Property-Based Attestation without a Trusted Third Party
Authors: Liqun Chen, Hans Löhr, Mark Manulis, Ahmad-Reza Sadeghi
Venue: Proceedings of the 11th international conference on Information Security (2008)

The Trusted Computing Group (TCG) has proposed the binary attestation mechanism that enables a computing platform with a dedicated security chip, the Trusted Platform Module (TPM), to report its state to remote parties. The concept of property-based attestation (PBA) improves the binary attestation and compensates for some of its main deficiencies. In particular, PBA enhances user privacy by allowing the trusted platform to prove to a remote entity that it has certain properties without revealing its own configuration.The existing PBA solutions, however, require a Trusted Third Party (TTP) to provide a reliable link of configurations to properties, e.g., by means of certificates. We present a new privacy-preserving PBA approach that avoids such a TTP. We define a formal model, propose an efficient protocol based on the ideas of ring signatures, and prove its security. The cryptographic technique deployed in our protocol is of independent interest, as it shows how ring signatures can be used to efficiently prove the knowledge of an element in a list without disclosing it.
Strong Accumulators from Collision-Resistant Hashing
Authors: Philippe Camacho, Alejandro Hevia, Marcos Kiwi, Roberto Opazo
Venue: Proceedings of the 11th international conference on Information Security (2008)

Accumulator schemes were introduced in order to represent a large set of values as one short value called the accumulator. These schemes allow one to generate membership proofs, i.e. short witnesses that a certain value belongs to the set. In universal accumulator schemes, efficient proofs of non-membership can also be created. Li, Li and Xue [11], building on the work of Camenisch and Lysyanskaya [5], proposed an efficient accumulator scheme which relies on a trusted accumulator manager. Specifically, a manager that correctly performs accumulator updates.In this work we introduce the notion of strong universal accumulator schemes which are similar in functionality to universal accumulator schemes, but do not assume the accumulator manager is trusted. We also formalize the security requirements for such schemes. We then give a simple construction of a strong universal accumulator scheme which is provably secure under the assumption that collision-resistant hash functions exist. The weaker requirement on the accumulator manager comes at a price; our scheme is less efficient than known universal accumulator schemes -- the size of (non)membership witnesses is logarithmic in the size of the accumulated set in contrast to constant in the scheme of Camenisch and Lysyanskaya.Finally, we show how to use strong universal accumulators to solve a practical concern, the so called e-Invoice Factoring Problem.
Trajectories Mining for Traffic Condition Renewing
Authors: Danhuai Guo
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Advances in wireless transmission and increasing quantity of GPS in vehicles flood us with massive amount of trajectory data. The large amounts of trajectories imply considerable quantity of interesting road condition that current traffic database lacks. Mining live traffic condition from trajectories is a challenge due to complexity of road network model, uncertainty of driving behavior as well as imprecision of trajectories. In this paper, road linear reference system, road segmentation and road condition models are employed in preprocessing trajectory data to lower dimension of trajectory mining problems and reduce uncertainties and imprecision of raw trajectories. The trajectory mining problem includes the one near road intersection and the one in general road segment. The former focuses on finding turn information of road intersection, while the latter focuses on extracting road live condition. The experimental results show that the mining algorithm is effective and efficient in traffic condition mining. 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
Heart Rate Prediction Based on Physical Activity Using Feedforwad Neural Network
Authors: Ming Yuchi, Jun Jo
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The technique of combining heart rate (HR) and physical activity (PA) has been adopted in a number of research areas, such as energy expenditure measurement, autonomic nervous system assessment, sports research, etc. However, there have been few studies on the direct relationship between HR and PA. This paper proposes a HR prediction model based on the relationship between HR and PA. The predictor has the potential to be used in various areas, such as: cardiopathy research and diagnosis, heart attack warning indicator, sports capability measure and mental activity evaluation. The method has the following steps: first, the recorded HR and PA signals are preprocessed as two synchronized time sequences: HR(n) and PA(n). The inputs of the predictor are HR(n) and PA(n) in the current time step, and the output is the predicted sequence HR(n + 1) in the next time step. The Feed forward Neural Network (FFNN) was chosen as the mathematical model of the predictor. Experiments was conducted based on the real-life signals from a healthy male. A set of 90 minute signals were collected. One half of the signal set was used to train the FFNN and the other half to validate the training. The mean absolute error of the predicted heart rate was restricted inside 5. The result shows the potential of the proposed method.
A unified handling of immiscible and miscible fluids
Authors: Jinho Park
Venue: Computer Animation and Virtual Worlds (2008)

Conventional level set-based approaches have an inherent difficulty in tracking miscible fluids due to its discrete treatment for interface. This paper proposes a unified framework to efficiently handle both miscible and immiscible fluid simulations. Based on the chemical potential energy, our method describes the evolution of multiple fluids as time-varying concentration fields. Handling of multiple fluids is straightforward and, unlike level set methods, ad hoc reinitialization or fictitious particle deployment is not necessary. For numerical computation of the Navier&mdash;Stokes equations, we adopt advanced lattice Boltzmann methods (LBMs) for computational efficiency. The experiments show that our approach works well with immiscible fluids, miscible fluids, and interaction with objects. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Light-Weight Instruction Set Extensions for Bit-Sliced Cryptography
Authors: Philipp Grabher, Johann Großschädl, Dan Page
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in SIMD mode. Particularly when implementing symmetric ciphers, the bit-slicing approach has several advantages over more conventional alternatives: it often allows one to reduce memory footprint by eliminating large look-up tables, and it permits more predictable performance characteristics that can foil time based side-channel attacks. Both features are attractive for mobile and embedded processors, but the performance overhead that results from bit-sliced implementation often represents a significant disadvantage. In this paper we describe a set of light-weight Instruction Set Extensions (ISEs) that can improve said performance while retaining all advantages of bit-sliced implementation. Contrary to other crypto-ISE, our design is generic and allows for a high degree of algorithm agility: we demonstrate applicability to several well-known cryptographic primitives including four block ciphers (DES, Serpent, AES, and PRESENT), a hash function (SHA-1), as well as multiplication of ternary polynomials.
Reflex Contributions to the Directional Tuning of Arm Stiffness
Authors: Gary Liaw, David W. Franklin, Etienne Burdet, Abdelhamid Kadi-Allah, Mitsuo Kawato
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

It has been shown that during arm movement, humans selectively change the endpoint stiffness of their arm to compensate for the instability in an unstable environment. When the direction of the instability is rotated with respect to the direction of movement, it was found that humans modify the antisymmetric component of their endpoint stiffness. The antisymmetric component of stiffness arises due to reflex responses suggesting that the subjects may have tuned their reflex responses as part of the feedforward adaptive control. The goal of this study was to examine whether the CNS modulates the gain of the reflex response for selective tuning of endpoint impedance. Subjects performed reaching movements in three unstable force fields produced by a robotic manipulandum, each field differing only in the rotational component. After subjects had learned to compensate for the field, allowing them to make unperturbed movements to the target, the endpoint stiffness of the arm was estimated in the middle of the movements. At the same time electromyographic activity (EMG) of six arm muscles was recorded. Analysis of the EMG revealed differences across force fields in the reflex gain of these muscles consistent with stiffness changes. This study suggests that the CNS modulates the reflex gain as part of the adaptive feedforward command in which the endpoint impedance is selectively tuned to overcome environmental instability.
On the Size Complexity of Rotating and Sweeping Automata
Authors: Christos Kapoutsis, Richard Královič, Tobias Mömke
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change direction only on the endmarkers and a rdfa is a sdfa whose head is reset on the left end of the input every time the right endmarker is read. We introduce a list of language operators and study the corresponding closure properties of the size complexity classes defined by these automata. Our conclusions reveal the logical structure of certain proofs of known separations in the hierarchy of these classes and allow us to systematically construct alternative problems to witness these separations.
A Touch of the Future: Contact-Expressive Devices
Authors: Kevin McGee
Venue: IEEE MultiMedia (2004)

In terms of a contact-expressive device, two issues arise: What are the technical requirements for such devices? What do we need to know about the nature of contact expressions?The author takes a brief look at these issues in terms of their current status and the work that still needs to occur. A focus on the technical development of sensor-motor systems, tactile interfaces, and technologies that can embody and understand affect.
From the front linesGround control to Architect Tom&hellip;
Authors: Alex E. Bell
Venue: Communications of the ACM (2009)

Using David Bowie's classic song "Space Oddity" as a backdrop, the unscrupulous tactics of architecture astronauts are exposed.
The M/G/1 processor-sharing queue with disasters
Authors: Quan-Lin Li, Chuang Lin
Venue: Computers Mathematics with Applications (2006)

n this paper, the M/G/1 processor-sharing queue with disasters is given a detailed analysis by means of extending the supplementary variable method. The transient and steady-state distributions of the queue length are expressed as a simple and computable form, the Laplace-Stieltjes transform of the sojourn time is derived, and the Laplace transform of the busy period and its mean are obtained. Also, the approach developed in this paper is shown to be able to study more complicated M/G/1 processor-sharing models.
Pushing Frequency Constraint to Utility Mining Model
Authors: Jing Wang, Ying Liu, Lin Zhou, Yong Shi, Xingquan Zhu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Traditional association rules mining (ARM) only concerns the frequency of itemsets, which may not bring large amount of profit. Utility mining only focuses on itemsets with high utilities, but the number of rich-enough customers is limited. To overcome the weakness of the two models, we propose a novel model, called general utility mining, which takes both frequency and utility into consideration simultaneously. By adjusting the weight of the frequency factor or the utility factor, this model can meet the different preferences of different applications. It is flexible and practicable in a broad range of applications. We evaluate our proposed model on a real-world database. Experimental results demonstrate that the mining results are valuable in business decision making.
Some results on the ordering of the Laplacian spectral radii of unicyclic graphs
Authors: Ying Liu, Jia-Yu Shao, Xi-Ying Yuan
Venue: Discrete Applied Mathematics (2008)

A unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo Shu-Guang [S.G. Guo, The largest Laplacian spectral radius of unicyclic graph, Appl. Math. J. Chinese Univ. Ser. A. 16 (2) (2001) 131-135] determined the first four largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices. In this paper, we extend this ordering by determining the fifth to the ninth largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices.