ppxscal/embedding_network huggingface dataset:
Adding Probabilistic Dependencies to the Search of Protein Side Chain Configurations Using EDAs
Authors: Roberto Santana, Pedro Larrañaga, Jose A. Lozano
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

The problem of finding an optimal positioning for the side chain residues of a protein is called the side chain placement or side chain prediction problem. It can be posed as an optimization problem in the discrete domain. In this paper we use an estimation of distribution algorithm to address this optimization problem. Using a set of 50 difficult protein instances, it is shown that the addition of dependencies between the variables in the probabilistic model can improve the quality of the solutions achieved for most of the instances considered. However, we also show that only when information about the known interactions between the residues is considered in the creation of the probabilistic model, the addition of the dependencies contributes to improve the quality of the solutions obtained.
Thinking PubMed: an Innovative System for Mental Health Domain
Authors: Maja Hadzic, Russel D'Souza, Fedja Hadzic, Tharam Dillon
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Information regarding mental illness is dispersed over various resources but even within a specific resource, such as PubMed, it is difficult to link this information, to share it and find specific information when needed. Specific and targeted searches are very difficult with current search engines as they look for the specific string of letters within the text rather than its meaning. In this paper we present Thinking PubMed as a system that results from synergy of ontology and data mining technologies and performs intelligent information searches using the domain ontology. Furthermore, the Thinking PubMed analyzes and links the retrieved information, and extracts hidden patterns and knowledge using data mining algorithms. This is a new generation of information-seeking tool where the ontology and data-mining work in concert to increase the value of the available information.
Semantic Matching for the Medical Domain
Authors: Jetendr Shamdasani, Peter Bloodsworth, Richard Mcclatchey
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

This paper proposes some modifications to the SMatch algorithm that enables the semantic matching of medical terminologies using the Unified Medical Language System (UMLS) as a source of background knowledge. Semantic Matching is the process of discovering set theoretic relationships between differing data elements. Initial results from the domain of anatomy are presented that illustrate how semantic relationships can provide greater information during the ontology alignment process than equivalence relationships alone. The paper concludes by demonstrating how this is beneficial in the medical domain.
A Distributed Multiuser Virtual Space System
Authors: Mamoru Endo, Takami Yasuda, Shigeki Yokoi
Venue: IEEE Computer Graphics and Applications (2003)

The authors derived a method for transferring motion information of virtual humans in distributed multiuser virtual space. In this article, they describe a technique for constructing an independent action database on the network as well as a technique for the effective management of transferred information between system and clients.
Contrast Set Mining for Distinguishing Between Similar Diseases
Authors: Petra Kralj, Nada Lavrač, Dragan Gamberger, Antonija Krstačić
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

The task addressed and the method proposed in this paper aim at improved understanding of differences between similar diseases. In particular we address the problem of distinguishing between thrombolic brain stroke and embolic brain stroke as an application of our approach of contrast set mining through subgroup discovery. We describe methodological lessons learned in the analysis of brain ischaemia data and a practical implementation of the approach within an open source data mining toolbox.
Experiment and evaluation of the RAMPE interactive auditive information system for the mobility of blind people in public transport
Authors: Olivier Venard, Geneviève Baudoin, Gérard Uzan
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

This paper will present the design and experimentation of the RAMPE system intended for the assistance and information of visually disabled/impaired people so that they can increase their mobility and autonomy in public transports. The system is intended to equip bus or tramway stops or to be installed in connection link. It is based either on a remote control (RC) or on a smart hand-held WiFi enabled device like a Personal Digital Assistant (PDA) able to communicate by a WiFi connection with fixed equipment in stations to retrieve travelers information. This system has been evaluated by Visually Disabled People (VDP) in real public transport environment in the city of Lyon in France. Ergonomics data has been collected during the experiment and analyzed, showing the usability of such devices by VDP and hence also by Visually Impaired Peoples (VIP).
Real-Time Distribution Middleware from the Ada Perspective
Authors: Héctor Pérez, J. Javier Gutiérrez, Daniel Sangorrín, Michael González Harbour
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

Standards for distribution middleware sometimes impose restrictions and often allow the implementations to decide on aspects that are fundamental to the correct and efficient behaviour of the applications using them, especially when these applications have real-time requirements. This work presents a study of two standard approaches for distribution middleware that can be used from Ada applications: RT-CORBA, and the Distributed Systems Annex (DSA) of Ada. The study focuses on the problems associated with the real-time behaviour of some implementations of these approaches, and on possible solutions that can be derived from our experience with Ada implementations. Moreover, the paper considers the problem of integration of the distribution middleware with a new generation of scheduling mechanisms based on contracts.
Creative Industrial Design and Computer-Based Image Retrieval: The Role of Aesthetics and Affect
Authors: S. J. Westerman, S. Kaur, C. Dukes, J. Blomfield
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

A study is reported that examined the effectiveness of computerbased image retrieval as a support tool for creative industrial design. Participants were given a design brief for a concept car, and asked to retrieve images from the web that would provide inspiration for this design task. They then rated various aesthetic, affective, and inspirational aspects of the images, and a second sample of participants rated the search terms that they had used. Emotional inspiration was important to designers, arising in part from a broad semantic theme and in part from the inspirational values of the more 'fundamental' image properties of colour and layout. The pattern of results suggested that some designers adopted a more risky (less efficient) search strategy in order to access emotional image content. Aesthetic and affective aspects of the retrieved images predicted inspirational value.
Monocular Vision Based Obstacle Detection for Robot Navigation in Unstructured Environment
Authors: Yehu Shen, Xin Du, Jilin Liu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper proposes an algorithm to detect the obstacles in outdoor unstructured environment with monocular vision. It makes use of motion cues in the video streams. Firstly, optical flow at feature points is calculated. Then rotation of the camera and FOE(focal of expansion) are evaluated separately. A non-linear optimization method is adopted to refine the rotation and FOE. Finally, we get inverse TTC(time to contact) with rotation and FOE and detect the obstacles in the scene. The algorithm doesn't need any assumption that the ground is flat or partially flat as the conventional methods. So it is suitable for outdoor unstructured environment. Qualitative and quantitative experiment results show that our algorithm works well on different kinds of terrains.
Active Learning of Group-Structured Environments
Authors: Gábor Bartók, Csaba Szepesvári, Sandra Zilles
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

The question investigated in this paper is to what extent an input representation influences the success of learning, in particular from the point of view of analyzing agents that can interact with their environment. We investigate learning environments that have a group structure. We introduce a learning model in different variants and study under which circumstances group structures can be learned efficiently from experimenting with group generators (actions). Negative results are presented, even without efficiency constraints, for rather general classes of groups showing that even with group structure, learning an environment from partial information is far from trivial. However, positive results for special subclasses of Abelian groups turn out to be a good starting point for the design of efficient learning algorithms based on structured representations.
Recursive Stochastic Games with Positive Rewards
Authors: Kousha Etessami, Dominik Wojtczak, Mihalis Yannakakis
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We study the complexity of a class of Markov decision processes and, more generally, stochastic games, called 1-exit Recursive Markov Decision Processes (1-RMDPs) and Simple Stochastic Games (1-RSSGs) with strictly positive rewards. These are a class of finitely presented countable-state zero-sum stochastic games, with total expected reward objective. They subsume standard finite-state MDPs and Condon's simple stochastic games and correspond to optimization and game versions of several classic stochastic models, with rewards. Such stochastic models arise naturally as models of probabilistic procedural programs with recursion, and the problems we address are motivated by the goal of analyzing the optimal/pessimal expected running time in such a setting.We give polynomial time algorithms for 1-exit Recursive Markov decision processes (1-RMDPs) with positive rewards. Specifically, we show that the exact optimal value of both maximizing and minimizing 1-RMDPs with positive rewards can be computed in polynomial time (this value may be ¿). For two-player 1-RSSGs with positive rewards, we prove a "stackless and memoryless" determinacy result, and show that deciding whether the game value is at least a given value r is in NP ¿ coNP. We also prove that a simultaneous strategy improvement algorithm converges to the value and optimal strategies for these stochastic games. We observe that 1-RSSG positive reward games are "harder" than finite-state SSGs in several senses.
An Agent-Based, Model-Driven Approach for Enabling Interoperability in the Area of Multi-brand Vehicle Configuration
Authors: Ingo Zinnikus, Christian Hahn, Michael Klein, Klaus Fischer
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

With the change of EU regulations in the automotive market in 2002, multi-brand car dealers became possible. Despite the high economical expectations connected with them, the existing IT infrastructure does not provide satisfying support for these changes as it had been developed independently by each brand for many years. In this paper, we describe a solution which supports rapid prototyping by combining a model-driven framework for cross-organisational service-oriented architectures (SOA) with an agent-based approach for flexible process execution. We discuss advantages of agent-based SOAs and summarize the lessons learned.
Further Results on Insertion-Deletion Systems with One-Sided Contexts
Authors: Alexander Krassovitskiy, Yurii Rogozhin, Serghey Verlan
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

In this article we continue the investigation of insertion-deletion systems having a context only on one side of insertion or deletion rules. We show a counterpart of the results obtained in (Matveevici et al., 2007) by considering corresponding systems and exchanging deletion and insertion parameters. We prove three computational completeness results and one non-completeness result for these systems. We also solve the remaining open problem concerning the generative power of insertion-deletion systems having both contexts by proving the computational completeness of systems having a context-free insertion of two symbols and a contextual deletion of one symbol.
Linear-Ordered Graph Grammars: Applications to Distributed Systems Design
Authors: Leila Ribeiro, Fernando Luís Dotti
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Linear-ordered graph grammars (LOGGs) are a special kind of graph grammars that were inspired by the general definitions of graph grammars and by tile systems. In this paper we show that this kind of grammar is particularly suited for the specification of distributed systems. Moreover, we discuss a simple extension of LOGGs inspired by the representation using tiles, leading to a notion of open graphs that can be very useful in a wider range of applications.
Robust Multi-property Combiners for Hash Functions Revisited
Authors: Marc Fischlin, Anja Lehmann, Krzysztof Pietrzak
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

A robust multi-property combiner for a set of security properties merges two hash functions such that the resulting function satisfies each of the properties which at least one of the two starting functions has. Fischlin and Lehmann (TCC 2008) recently constructed a combiner which simultaneously preserves collision-resistance, target collision-resistance, message authentication, pseudorandomness and indifferentiability from a random oracle (IRO). Their combiner produces outputs of 5n bits, where n denotes the output length of the underlying hash functions.In this paper we propose improved combiners with shorter outputs. By sacrificing the indifferentiability from random oracles we obtain a combiner which preserves all of the other aforementioned properties but with output length 2n only. This matches a lower bound for black-box combiners for collision-resistance as the only property, showing that the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the IRO property, slightly increasing the output length to 2n + ¿(logn). Finally, we show that a twist on our combiners also makes them robust for one-wayness (but at the price of a fixed input length).
Deriving context from users' evaluations to inform software development
Authors: Stevie Barrett, Charlie Inskip
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

The EASAIER project (EASAIER) aims to provide enriched internet-enabled access to a broad range of digital sound and video archives, and as a result, the user base will consist of a very wide and deep constituency with varying and specialized user needs. Ten classical music students at the Royal Academy of Music and Drama, having been given a short introduction to software evaluation, assessed an alpha release of the EASAIER software and their outputs revealed the importance of user context in the process of software development. This short paper details the evaluation model and highlights the key findings revealed when expert musicians but non-expert computer users applied this model to the EASAIER software.
TAIG: textually accessible information graphics
Authors: Seniz Demir
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Information graphics (such as bar charts and line graphs) are an important component of many documents. Unfortunately, these representations present serious access challenges for individuals with sight impairments. This paper describes our ongoing research on the TAIG system which is a part of a larger system whose long term goal is to enable visually impaired users to gain access to the content of information graphics and therefore benefit from these valuable resources. TAIG first provides the user with a brief textual summary of the graphic with the inferred overall message as the core content, and then will respond to follow-up questions which may request further detail about the graphic.
Social Information Access for the Rest of Us: An Exploration of Social YouTube
Authors: Maurice Coyle, Jill Freyne, Peter Brusilovsky, Barry Smyth
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

The motivation behind many Information Retrieval systems is to identify and present relevant information to people given their current goals and needs. Learning about user preferences and access patterns recent technologies make it possible to model user information needs and adapt services to meet these needs. In previous work we have presented ASSIST, a general-purpose platform which incorporates various types of social support into existing information access systems and reported on our deployment experience in a highly goal driven environment (ACM Digital Library). In this work we present our experiences in applying ASSIST to a domain where goals are less focused and where casual exploration is more dominant; YouTube. We present a general study of YouTube access patterns and detail how the ASSIST architecture affected the access patterns of users in this domain.
GPU Accelerated Computation and Visualization of Hexagonal Cellular Automata
Authors: Stéphane Gobron, Hervé Bonafos, Daniel Mestre
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

We propose a graphics processor unit (GPU)-accelerated method for real-time computing and rendering cellular automata (CA) that is applied to hexagonal grids.Based on our previous work [9] ---which introduced first and second dimensional cases--- this paper presents a model for hexagonal grid algorithms. Proposed method is novel and it encodes and transmits large CA key-codes to the graphics card and consequently, this technique allows to visualize the CA information flow in real-time to easily identify emerging behaviors even for large data sets. To show the efficiency of our model we first present a set of characteristic hexagonal behaviors, and then describe computational statistics for central processing unit (CPU) and GPU on a set of different hardware and operating system (OS) configurations. We show that our model is flexible and very efficient as it permits to compute CA close to a thousand times faster than classical CPU methods. Additionally, free access is provided to our downloadable software for hexagonal grid CA simulations.
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
Authors: Paolo Tranquilli
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hyperclique in Ehrhard's hypercoherent spaces. This criterion is strictly weaker than the one given by Hughes and van Glabbeek characterizing proof nets (i.e. desequentialized sequent calculus proofs). We thus also give the first proof of semantical soundness of hypercoherent spaces with respect to proof nets entirely based on graph theoretical trips, in the style of Girard's proof of semantical soundness of coherent spaces for proof nets of the multiplicative fragment of linear logic. 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
VQ-Based Image Watermarking Using Anti-Gray Coding
Authors: Chin-Chen Chang, Hsien-Wen Tseng
Venue: Informatica (2004)

In this paper, a new digital watermarking method based on vector quantization (VQ) is proposed. In contrast with conventional VQ-based watermarking schemes, the mean of sub-blocks is used to train the VQ codebook. In addition, the Anti-Gray Coding (AGC) technique is employed to enhance the robustness of the proposed watermarking scheme. In this scheme, the secret keys are used to hide the associated information between the original image and the watermark. Then the set of secret keys will be registered to a trusted third party for future verification. Thus, the original image remains unchanged after the watermark is melted into the set of secret keys. Experimental results show that the watermark can survive various possible attacks. Besides that, the size of the secret keys can be reduced.
The KeY system 1.0 (Deduction Component)
Authors: Bernhard Beckert, Martin Giese, Reiner Hähnle, Vladimir Klebanov, Philipp Rümmer, Steffen Schlager, Peter H. Schmitt
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

The KeY system is a development of the ongoing KeY project, whose aim is to integrate formal specification and deductive verification into the industrial software engineering processes. The deductive component of the KeY system is a novel interactive /automated prover for first-order Dynamic Logic for Java. The KeY prover features a user-friendly graphical interface, a backtracking-free free-variable sequent calculus, a simple and powerful theory formalization language called "taclets," solution procedures for linear and non-linear integer arithmetic, external theorem prover integration, and facilities for proof reuse, among other aspects. The system is publicly available.
Deterministic Pushdown Automata and Unary Languages
Authors: Giovanni Pighizzini
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

The simulation of deterministic pushdown automata defined over a one letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be simulated by a deterministic finite automaton with a number of states which is exponential in s. We prove that this simulation is tight. Furthermore, its cost cannot be reduced even if it is performed by a two-way nondeterministic automaton. We also prove that there are unary languages for which deterministic pushdown automata cannot be exponentially more succinct than finite automata. In order to state this result, we investigate the conversion of deterministic pushdown automata into context-free grammars. We prove that in the unary case the number of variables in the resulting grammar is strictly lower than the number of variables needed in the case of nonunary alphabets.
Distortion lower bounds for line embeddings
Authors: Claire Mathieu, Charalampos Papamanthou
Venue: Information Processing Letters (2008)

In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certain structure. Using linear programming to formulate a simpler version of the problem gives an interesting intuition and direction concerning the computation of general lower bounds for distortion into the line. We also show that our lower bounds on special cases of metrics are a lot better than previous lower bounds.