ppxscal/embedding_network huggingface dataset:
Intelligent Assistive Exoskeleton with Vision Based Interface
Authors: Malek Baklouti, Eric Monacelli, Vincent Guitteny, Serge Couvet
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

This paper presents an intelligent assistive robotic system for people suffering from myopathy. In this context, we are developing a 4 DoF assistive exoskeletal orthosis for the upper limb. A special attention is made toward Human Machine Interaction (HMI). We propose the use of visual sensing as interface able to convert user head gesture and mouth expression into a suitable control command. In that way, a non-intrusive cameras control is particularly adapted to disabled people. Moreover, we propose to robustify the command with a visual context analysis component.In this paper, we will first describe the problematic and the designed mechanical system. Next, we will describe the two approaches developed for visual sensing interface: head control and mouth expression control. Finally, we introduce the context detection for scene understanding.
Towards MKDA: A Knowledge Discovery Assistant for Researches in Medicine
Authors: Vincenzo Cannella, Giuseppe Russo, Daniele Peri, Roberto Pirrone, Edoardo Ardizzone
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Nowadays doctors are generating a huge amount of raw data. These data, analyzed with data mining techniques, could be sources of new knowledge. Unluckily such tasks need skilled data analysts, and not so much researchers in Medicine are also data mining experts. In this paper we present a web based system for knowledge discovery assistance in Medicine able to advice a medical researcher in this kind of tasks. The user must define only the experiment specifications in a formal language we have defined. The system GUI helps users in their composition. Then the system plans a Knowledge Discovery Process (KDP) on the basis of rules in a knowledge base. Finally the system executes the KDP and produces a model as result. The system works through the co-operation of different web services specialized in different tasks. The system is still under development.
Modeling Units of Assessment for Sharing Assessment Process Information: Towards an Assessment Process Specification
Authors: Yongwu Miao, Peter Sloep, Rob Koper
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

IMS Question and Test Interoperability (QTI) is an e-learning standard supporting interoperability and reusability of assessment tests/items. However, it has insufficient expressiveness to specify various assessment processes, especially, the new forms of assessment. In order to capture current educational practices in online assessment from the perspectives of assessment process management, we extend QTI and IMS Learning Design (LD) with an additional layer that describes assessment processes in an interoperable, abstract, and efficient way. Our aim is an assessment process specification that can be used to model both classic and new forms of assessment, and to align assessment with learning and teaching activities. In this paper, the development of the assessment process specification and its benefits and requirements are described. A conceptual model, the core of the assessment process specification is presented. The proposed conceptual model has been subject to a first validation, which is also described.
An Aspect-Oriented and Model-Driven Approach for Managing Dynamic Variability
Authors: Brice Morin, Franck Fleurey, Nelly Bencomo, Jean-Marc Jézéquel, Arnor Solberg, Vegard Dehlen, Gordon Blair
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Constructing and executing distributed systems that can adapt to their operating context in order to sustain provided services and the service qualities are complex tasks. Managing adaptation of multiple, interacting services is particularly difficult since these services tend to be distributed across the system, interdependent and sometimes tangled with other services. Furthermore, the exponential growth of the number of potential system configurations derived from the variabilities of each service need to be handled. Current practices of writing low-level reconfiguration scripts as part of the system code to handle run time adaptation are both error prone and time consuming and make adaptive systems difficult to validate and evolve. In this paper, we propose to combine model driven and aspect oriented techniques to better cope with the complexities of adaptive systems construction and execution, and to handle the problem of exponential growth of the number of possible configurations. Combining these techniques allows us to use high level domain abstractions, simplify the representation of variants and limit the problem pertaining to the combinatorial explosion of possible configurations. In our approach we also use models at runtime to generate the adaptation logic by comparing the current configuration of the system to a composed model representing the configuration we want to reach.
Generating Depth-of-Field Effects in Virtual Reality Applications
Authors: Przemyslaw Rokita
Venue: IEEE Computer Graphics and Applications (1996)

Virtual reality is a rapidly expanding area of computer graphics. While initially confined to military and flight simulation, VR technology is now applied to many new applications. To achieve high levels of realism, these applications must meet various performance parameters, especially human perception factors. In this article I propose a solution to the problem of simulating accommodation effects (that is, depth-of-field effects resulting from the eye's accommodation in focusing on an object in a scene). A new technique generates depth-of-field effects, taking into account optical properties of the human eye. Accounting for these effects generates more realistic images, closely approximating the real scenes perceived by human observers. The lack of those effects causes the surreal appearance of generated images. Theproposed algorithm is fast and suitable for generating images for VR and other real time applications.
Content-Based Medical Image Retrieval Using Low-Level Visual Features and Modality Identification
Authors: Juan C. Caicedo, Fabio A. Gonzalez, Eduardo Romero
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper presents the image retrieval results obtained by the BioIngenium Research Group, in the frame of the ImageCLEFmed 2007 edition. The applied approach consists of two main phases: a pre-processing phase, which builds an image category index and a retrieval phase, which ranks similar images. Both phases are based only on visual information. The experiments show a consistent frame with theory in content-based image retrieval: filtering images with a conceptual index outperforms only-ranking-based strategies; combining features is better than using individual features; and low-level features are not enough to model image semantics.
Index Method for Tracking Network-Constrained Moving Objects
Authors: Jun Feng, Jiamin Lu, Yuelong Zhu, Toyohide Watanabe
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In the past composite structures for managing road network-constrained moving objects, the road network is usually broken up into road segments. This scheme will cause high concentrated update operations, and some needless queries while tracking the moving objects. In this paper, we propose a new unit called cross region(CR) to break up the road network, and use CR to build a new structure called CR-tree to be the static part of the composite structure. By indexing the moving objects with our composite structure, experiments show that the update density could be evened, the update frequency and the update cost could be decreased compare with the past ones.
Cross-Layering in Mobile Ad Hoc Network Design
Authors: Marco Conti, Gaia Maselli, Giovanni Turi, Silvia Giordano
Venue: Computer (2004)

Mobile ad hoc network researchers face the challenge of achieving full functionality withgood performance while linking the new technology to the rest of the Internet. A strict layered design is not flexible enough to cope with the dynamics of manet environments, however, and will prevent performance optimizations. The MobileMan cross-layer architecture offers an alternative to the pure layered approach that promotes stricter local interaction among protocols in manet node.
Interface for Accessing Pharmacological Information
Authors: Tor Johan Mikael Karlsson
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Pharmacological therapy is an increasingly complex medical activity. Databases with information on drug-drug interactions, side-effects etc. would complement traditional electronic patient journal systems and provide decision support for pharmacological therapy. To facilitate the use of such databases, drug terminology is essential to allow communication with existing information systems. Well-speciﬁed software interfaces would encourage and simplify usage of drug databases. This paper reports a software interface for accessing drug information.
On the Redundancy of Succinct Data Structures
Authors: Alexander Golynski, Rajeev Raman, S. Srinivasa Rao
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

The redundancy of a succinct data structure is the difference between the space it uses and the appropriate information-theoretic lower bound. We consider the problem of representing binary sequences and strings succinctly using small redundancy. We improve the redundancy required to support the important operations of rank and select efficiently for binary sequences and for strings over small alphabets. We also show optimal density-sensitive upper and lower bounds on the redundancy for systematic encodings of binary sequences.
Modeling and Enforcing Advanced Access Control Policies in Healthcare Systems with Sectet
Authors: Michael Hafner, Mukhtiar Memon, Muhammad Alam
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

This contribution gives an overview of various access control strategies in use in healthcare scenarios and shows how a variety of policies can be modeled based on a single security policy model for usage control, UCON. The core of this contribution consists of the specialization of the Sectet-Framework for Model Driven Security for complex healthcare scenarios based on UCON. The resulting Domain Architecture comprises a Domain Specific Language for the modeling of policies with advanced security requirements, a target architecture for the enforcement of these policies and model-to-code transformations.
The Algebraic Properties of Linguistic Value "Truth" and Its Reasoning
Authors: Zheng Pei
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

From logic and algebra point of view, Computing with words is discussed in this paper. By analyzing the semantically ordering relation of linguistic variable Truth, orderings on linguistic hedges H and atomic evaluating syntagm Tr = {true, false} are obtained, respectively. Let H be finite chain, then Lukasiewicz product algebra of T = H×Tr of Truth is obtained, and term-set T(X) of Truth is embedded into an algebra Γ of type Δ = { ¿ , ¿ , ¿,¿ L }. In some cases, Γ can be applied in linguistic decision directly, also as truth domain of logic statements. Different with other truth domain, here truth values are linguistic terms rather than numerals (or symbolic).
Provably Shorter Regular Expressions from Deterministic Finite Automata
Authors: Hermann Gruber, Markus Holzer
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We study the problem of finding good elimination orderings for the state elimination algorithm, which is one of the most popular algorithms for the conversion of finite automata into equivalent regular expressions. Based on graph separator techniques we are able to describe elimination strategies that remove states in large induced subgraphs that are "simple" like, e.g., independent sets or subgraphs of bounded treewidth, of the underlying automaton, that lead to regular expressions of moderate size. In particular, we show that there is an elimination ordering such that every language over a binary alphabet accepted by an n-state deterministic finite automaton has alphabetic width at most O(1.742 n ), which is, to our knowledge, the algorithm with currently the best known performance guarantee. Finally, we apply our technique to the question on the effect of language operations on regular expression size. In case of the intersection operation we prove an upper bound which matches, up to a small factor, a lower bound recently obtained in [9,10], and thus settles an open problem stated in [7].
Trace-Based Specification of Law and Guidance Policies for Multi-Agent Systems
Authors: Scott J. Harmon, Scott A. Deloach, Robby
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

Policies have traditionally been a way to specify properties of a system. In this paper, we show how policies can be applied to the Organization Model for Adaptive Computational Systems (OMACS). In OMACS, policies may constrain assignments of agents to roles, the structure of the goal model for the organization, or how an agent may play a particular role. In this paper, we focus on policies limiting system traces; this is done to leverage the work already done for specification and verification of properties in concurrent programs. We show how traditional policies can be characterized as law policies; that is, they must always be followed by a system. In the context of multiagent systems, law policies limit the flexibility of the system. Thus, in order to preserve the system flexibility while still being able to guide the system into preferring certain behaviors, we introduce the concept of guidance policies. These guidance policies need not always be followed; when the system cannot continue with the guidance policies, they may be suspended. We show how this can guide how the system achieves the top-level goal while not decreasing flexibility of the system. Guidance policies are formally defined and, since multiple guidance policies can introduce conflicts, a strategy for resolving conflicts is given.
Hunting for headings: sighted labeling vs. automatic classification of headings
Authors: Jeremy T. Brudvik, Jeffrey P. Bigham, Anna C. Cavender, Richard E. Ladner
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Proper use of headings in web pages can make navigation more efficient for blind web users by indicating semantic divisions in the page. Unfortunately, many web pages do not use proper HTML markup (h1-h6 tags) to indicate headings, instead using visual styling to create headings, thus making the distinction between headings and other page text indistinguishable to blind users. In a user study in which sighted participants labeled headings on a set of web pages, participants did not often agree on which elements on the page should be labeled as headings, suggesting why headings are not used properly on the web today. To address this problem, we have created a system called HeadingHunter that predicts whether web page text semantically functions as a heading by examining visual features of the text as rendered in a web browser. Its performance in labeling headings compares favorably with both a manually-classified set of heading examples and the combined results of the sighted labelers in our study. The resulting system illustrates a general methodology of creating simple scripts operating over visual features that can be directly included in existing tools.
Fast, robust, and faithful methods for detecting crest lines on meshes
Authors: Shin Yoshizawa, Alexander Belyaev, Hideo Yokota, Hans-Peter Seidel
Venue: Computer Aided Geometric Design (2008)

The crest lines, salient subsets of the extrema of the principal curvatures over their corresponding curvature lines, are powerful shape descriptors which are widely used for shape matching, interrogation, and visualization purposes. In this paper, we develop fast, accurate, and reliable methods for detecting the crest lines on surfaces approximated by dense triangle meshes. The methods exploit intrinsic geometric properties of the curvature extrema and provide with an inherent level-of-detail control of the detected crest lines. As an immediate application, we use of the crest lines for adaptive mesh simplification purposes.
A Fast and Efficient Algorithm for Topology-Aware Coallocation
Authors: Valentin Kravtsov, Martin Swain, Uri Dubin, Werner Dubitzky, Assaf Schuster
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Modern distributed applications require coallocation of massive amounts of resources. Grid level allocation systems must efficiently decide where these applications can be executed. To this end, the resource requests are described as labeled graphs, which must be matched with equivalent labeled graphs of available resources. The coallocation problem described in the paper has real-world requirements and inputs that differ from those of a classical graph matching problem. We propose a new algorithm to solve the coallocation problem. The algorithm is especially tailored for medium to large grid systems, and is currently being integrated into the QosCosGrid system's allocation module.
Geosensor Data Abstraction for Environmental Monitoring Application
Authors: Young Jin Jung, Silvia Nittel
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

Environmental observation applications are designed for monitoring phenomena using heterogeneous sensor data types and for providing derived and often integrated information. To effectively handle such a large variety of different sensors, both in scale and type and data volume, we propose a geosensor abstraction for large-scale geosensor networks. Our SGSA(Slope Grid for Sensor Data Abstraction) represents collected data in single grid-based layers, and allows for summarizing the measured data in various integrated grid layers. Within each cell, a slope vector is used to represents the trend of the observed sensor data. This slope is used as a simplifying factor for processing queries over several sensor types. To handle dynamic sensor data, the proposed abstraction model also supports rapid data update by using a mapping table. This model can be utilized as a data representation model in various geosensor network applications.
Stoop to Conquer: Posture and Affect Interact to Influence Computer Users' Persistence
Authors: Hyung-Il Ahn, Alea Teeters, Andrew Wang, Cynthia Breazeal, Rosalind Picard
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

RoCo, a novel robotic computer, has the capability to move its monitor in subtly expressive ways that respond to and promote its user's postural movement. Motivated by Riskind's "Stoop to conquer" research where it was found that postures congruous to the type of outcome a person received (e.g. slumping following a failure or sitting up proudly following a success) led to significantly better performance in a subsequent cognitive task than incongruous postures (e.g. sitting up proudly following a failure or slumping following success), we performed two experiments where RoCo was used to manipulate its user's posture. Our results show that people tend to be more persistent on a subsequent task when RoCo's posture is congruous to their affective state than when it is incongruous. Our study is the first to show that a computer's "pose," congruous or incongruous to a user's affective state, can influence factors such as persistence in problem solving tasks.
Multi-level Experience Retrieval for the Personal Lifelog Media System
Authors: Baud Haryo Prananto, Ig-Jae Kim, Hyoung-Gon Kim
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Personal Lifelog Media System stores and retrieves user’s every day experiences in the form of multimedia data format. This system involves huge amount of data and requires a metadata database system to enable user to retrieve the desired media efficiently. This paper proposes a multi-level abstracted metadata DB design to retrieve every day experiences in various ways with a user-friendly web interface. The simulated performance with real lifelog media data shows that suggested multi-level metadata DB structure can retrieve experience media data around four times more efficient compared with usual single-level annotation-based metadata database in the sense of retrieval time.
Relational Data Mining Applied to Virtual Engineering of Product Designs
Authors: Monika Žáková, Filip Železný, Javier A. Garcia-Sedano, Cyril Masia Tissot, Nada Lavrač, Petr Křemen, Javier Molina
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Contemporary product design based on 3D CAD tools aims at improved efficiency using integrated engineering environments with access to databases of existing designs, associated documents and enterprise resource planning. The ultimate goal of this work is to achieve design process improvements by applying state-of-the-art ILP systems for relational data mining of past designs, utilizing commonly agreed design ontologies as background knowledge. This paper demonstrates the utility of relational data mining for virtual engineering of product designs through the detection of frequent design patterns, enabled by the proposed baseline integration of hierarchical background knowledge (a CAD ontology) using sorted refinements.
The Reduced Address Space (RAS) for Application Memory Authentication
Authors: David Champagne, Reouven Elbaz, Ruby B. Lee
Venue: Proceedings of the 11th international conference on Information Security (2008)

Memory authentication is the ability to detect unauthorized modification of memory. Existing solutions for memory authentication are based on tree structures computed over either the Physical Address Space (PAS tree) or the Virtual Address Space (VAS tree). We show that the PAS tree is vulnerable to branch splicing attacks when providing memory authentication to an application running on a potentially compromised operating system. We also explain why the VAS tree generates initialization and memory overheads so large as to make it impractical, especially on 64-bit address spaces. To enable secure and efficient application memory authentication, we present a novel Reduced Address Space (RAS) containing only those pages that are useful to a protected application at any point in time. We introduce the Tree Management Unit (TMU) to manage the RAS tree, a dynamically expanding memory integrity tree computed over the RAS. The TMU is scalable, enabling tree schemes to scale up to cover 64-bit address spaces. It dramatically reduces the overheads of application memory authentication without weakening the security properties or degrading runtime performance. For SPEC 2000 benchmarks, the TMU speeds up tree initialization and reduces memory overheads by three orders of magnitude on average.