ppxscal/embedding_network huggingface dataset:
Autocalibrated Gravity Compensation for 3DoF Impedance Haptic Devices
Authors: Alessandro Formaglio, Marco Fei, Sara Mulatto, Maurizio Pascale, Domenico Prattichizzo
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

The apparent mass of haptic device end-effector depends on its position inside the workspace. This paper presents a recursive algorithm to detect effective direction of gravity force, and to automatically estimate the apparent mass of the end-effector when placed at the vertices of a cubic grid contained into the device workspace. Then an on-line technique is proposed to actively compensate gravity, exploiting trilinear interpolation to compute an estimate of end-effector apparent mass in any position of the workspace. Experiments have been performed with three different haptic devices, and results shown that the apparent mass of the end-effector is compensated almost homogeneously with respect to its position in the workspace.
A New Credit Card Payment Scheme Using Mobile Phones Based on Visual Cryptography
Authors: Chao-Wen Chan, Chih-Hao Lin
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

With the increasing usage of credit cards, secure requirements for handling credit card payment have become more critical. Today, it is being deployed for a wide application services in mobile commerce over public networks. Based on the security of Naor-Shamir's visual cryptography, Diffie-Hellman key agreement scheme and symmetric cryptosystems, we propose a new credit card payment scheme using mobile phones based on visual cryptography. Compared with traditional credit card payment methods', the proposed scheme can provide more secure communication for many electronic commerce transactions.
A Region-Based Hashing Approach for Symbol Spotting in Technical Documents
Authors: Marçal Rusiñol, Josep Lladós
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

In this paper a geometric hash function able to cluster similar shapes and its use for symbol spotting in technical documents is presented. A very compact representation of features describing each primitive composing a symbol are used as key indexes of a hash table. When querying a symbol in this indexing table a voting scheme is used to validate the hypothesis of where this symbol is likely to be found. This hashing technique aims to perform a fast spotting process to find candidate locations needing neither a previous segmentation step nor a priori knowledge or learning step involving multiple instances of the object to recognize.
Automatic Power Model Generation for Sensor Network Simulator
Authors: Jaebok Park, Hyunwoo Joe, Hyungshin Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Energy consumption estimation in sensor network is a critical process for network lifetime estimation before actual deployment. Energy consumption can be estimated by simulating the sensor network with a power model. Power model is the key component for the accurate estimation. However, the power model is not publicly accessible and it is not easy to generate accurate fine-grain power model. In this paper we proposed a simplified but yet accurate power model for AVR-based sensor nodes. Also, we developed an automated power model generation tool. The tool generates an instruction-level power model that can be connected to sensor network simulators. We model the current consumption of ATmega128 instruction set which is the most widely used processor in sensor node. Loading, execution, and control of the measurement framework are managed by the tool. Using the tool, we can generate power models of various sensor nodes using ATmega128 as their processor. Experimental result shows that our tool successfully generated accurate power models of various sensor nodes including Mica2.
Redesign of Organizations as a Basis for Organizational Change
Authors: Mark Hoogendoorn, Catholijn M. Jonker, Jan Treur
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

Artificial Intelligence has contributed (formal) design models and software support tools to application areas such as architecture, engineering and software design This paper explores the effectiveness of applying design models to the area of organization (re)design. To that purpose a component-based model for (re)design of organizations is presented as a specialization of an existing generic design model. Using recently developed formalizations within Organization Theory organization models are described as design object descriptions, and organization goals as design requirements. A design process specification is presented that models the redesign process for an organization that adapts to changes in the environment. The formally specified and implemented approach to organization redesign thus obtained has been tested for a well-known historical case study from the Organization Theory literature.
Dynamic Fully-Compressed Suffix Trees
Authors: Luís M. Russo, Gonzalo Navarro, Arlindo L. Oliveira
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

Suffix trees are by far the most important data structure in stringology, with myriads of applications in fields like bioinformatics, data compression and information retrieval. Classical representations of suffix trees require O(n logn) bits of space, for a string of size n. This is considerably more than the n log2 ¿ bits needed for the string itself, where ¿ is the alphabet size. The size of suffix trees has been a barrier to their wider adoption in practice. A recent so-called fully-compressed suffix tree (FCST) requires asymptotically only the space of the text entropy. FCSTs, however, have the disadvantage of being static, not supporting updates to the text. In this paper we show how to support dynamic FCSTs within the same optimal space of the static version and executing all the operations in polylogarithmic time. In particular, we are able to build the suffix tree within optimal space.
DCU and UTA at ImageCLEFPhoto 2007
Authors: Anni Järvelin, Peter Wilkins, Tomasz Adamek, Eija Airio, Gareth J. Jones, Alan F. Smeaton, Eero Sormunen
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)

Dublin City University (DCU) and University of Tampere (UTA) participated in ImageCLEF 2007 photographic retrieval task with several monolingual and bilingual runs. The approach was language independent with text retrieval utilizing fuzzy s-gram query translation and combined with visual retrieval. Data fusion was achieved through unsupervised query-time weight generation approaches. The baseline was a combination of dictionary-based query translation and visual retrieval, which achieved the best result. The best mixed modality runs using fuzzy s-gram translation reached on average around 83% of the baselines' performance. This approach was much closer at the early precision levels of P@10 and P@20. This suggests that our language independent approach could be a cheap alternative for cross-lingual image retrieval. Both sets of results further emphasize the merit in our query-time weight generation schemes for data fusion, with the fused runs exhibiting marked performance increases over single modalities without the use of prior training data.
A Local-Search 2-Approximation for 2-Correlation-Clustering
Authors: Tom Coleman, James Saunderson, Anthony Wirth
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

CorrelationClustering is now an established problem in the algorithms and constrained clustering communities. With the requirement that at most two clusters be formed, the minimisation problem is related to the study of signed graphs in the social psychology community, and has applications in statistical mechanics and biological networks.Although a PTAS exists for this problem, its running time is impractical. We therefore introduce a number of new algorithms for 2CC, including two that incorporate some notion of local search. In particular, we show that the algorithm we call PASTA-toss is a 2-approximation on complete graphs.Experiments confirm the strong performance of the local search approaches, even on non-complete graphs, with running time significantly lower than rival approaches.
A Run-Time Environment Supporting Real-Time Execution of Embedded Control Applications
Authors: Krzysztof Sierszecki, Christo Angelov, Xu Ke
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Designing safe and predictable software for embedded applications is a considerable challenge, which has been addressed by the COMDES-II framework. This is a component-based software framework employing a timed multitasking model of computation supported by a run-time environment. This paper presents a real-time kernel implementing the run-time environment – the HARTEXμ kernel that has been specifically developed for COMDES-II systems. The design and implementation of the kernel take into account the limitations of embedded systems, e.g. a small memory footprint and reduced kernel overhead. It also features Boolean vector processing that eliminates the need for linked-list queues, resulting in constant execution time of kernel functions independent of the number of tasks involved.
The Adaptive PSAM Design in Cross-Layer
Authors: Jun Sun, Dong-Feng Yuan, P. Takis Mathiopoulos
Venue: Wireless Personal Communications: An International Journal (2008)

The purpose is to design the pilot symbols efficiently and adaptively in communication systems to guarantee the minimum channel estimation error and the required quality of service (QoS). The various adaptive schemes about pilot symbols assisted modulation (PSAM) are obtained in terms of the pilot-insertion frequency and the power arrangement. The pilot-insertion frequency is redefined according to the sampling theory and the characteristics of fading channels, such as the level crossing rate (LCR) and the average fading duration (AFD). The power arrangement is optimized by maximizing the average spectral efficiency (ASE) in cross-layer design system. Besides, the ASE function in such a system is modified taking the imperfect channel state information caused by channel estimation into considered. The closed-form expression of modified ASE is present in this paper. From both the theoretical analysis and simulation points of view, a suitable scheme about PSAM design is obtained for cross-layer design.
Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
Authors: Martin Fränzle, Holger Hermanns, Tino Teige
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

The analysis of hybrid systems exhibiting probabilistic behaviour is notoriously difficult. To enable mechanised analysis of such systems, we extend the reasoning power of arithmetic satisfiability-modulo-theory solving (SMT) by a comprehensive treatment of randomized (a.k.a. stochastic) quantification over discrete variables within the mixed Boolean-arithmetic constraint system. This provides the technological basis for a fully symbolic analysis of probabilistic hybrid automata. Generalizing SMT-based bounded model-checking of hybrid automata [2,11], stochastic SMT permits the direct and fully symbolic analysis of probabilistic bounded reachability problems of probabilistic hybrid automata without resorting to approximation by intermediate finite-state abstractions.
SisGen: A CORBA---Based Data Management Program for DNA Sequencing Projects
Authors: Georgios J. Pappas,  Jr., Robson P. Miranda, Natália F. Martins, Roberto C. Togawa, Marcos M. Costa
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

Biological data deluge has challenged researchers over the last decade. Expressed sequence tag (EST) analyzes provide a rapid and economical means to identify candidate genes, gene expression profiles in different cell conditions, as well as functional annotation of putative gene products. Although EST analysis tools are publicly available there is still a lack of comprehensive data analysis and management programs. This work presents SisGen, an integrated software system capable of efficiently managing multi---user genomic projects. SisGen is a Java client---server application that uses CORBA as a middleware in a multi---layer architecture. The software integrates data management an annotation pipeline in a rich graphical visualization environment. The architectural design is presented and highlights the advantages in terms of portability, interconnectivity, modularity and user interface that can be achieved with this concept.
MPEG-4 Scene Description Optimization for Interactive Terrestrial DMB Content
Authors: Kyung-Ae Cha, Kyungdeok Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

The Digital Multimedia Broadcasting (DMB) system was developed to provide high-quality multimedia contents in the mobile environment. The system adopts the MPEG-4 standard for its main video, audio and other media formats. It also adopts MPEG-4 scene description for its interactive multimedia contents. Its animated and interactive contents are based on BIFS (Binary Format for Scenes), which refers to the spatio-temporal specifications and behavior of the individual objects. The more interactive contents are, the more high-bitrate the scene description should be. However, the bandwidth for allocating meta-data such as those in scene descriptions is restrictive in the mobile environment. On one hand, the DMB terminal starts demultiplexing contents and decoding individual media with its own decoder. After decoding each medium, the rendering module presents each media stream according to the scene description. Thus, the BIFS stream corresponding to the scene description should be decoded and parsed before the audio or visual object is presented. For these reasons, the transmission delay of the BIFS stream causes the delay in the entire audio-visual scene presentation, although the audio or video streams are en-coded in very low bitrate. This paper presents the effective optimization technique for adapting the BIFS stream into an expected MPEG-2 TS bitrate with-out bandwidth waste and for avoiding delay in the transmission of the initial scene description for interactive DMB contents.
An ontological knowledge framework for adaptive medical workflow
Authors: Jiangbo Dang, Amir Hedayati, Ken Hampel, Candemir Toklu
Venue: Journal of Biomedical Informatics (2008)

As emerging technologies, semantic Web and SOA (Service-Oriented Architecture) allow BPMS (Business Process Management System) to automate business processes that can be described as services, which in turn can be used to wrap existing enterprise applications. BPMS provides tools and methodologies to compose Web services that can be executed as business processes and monitored by BPM (Business Process Management) consoles. Ontologies are a formal declarative knowledge representation model. It provides a foundation upon which machine understandable knowledge can be obtained, and as a result, it makes machine intelligence possible. Healthcare systems can adopt these technologies to make them ubiquitous, adaptive, and intelligent, and then serve patients better. This paper presents an ontological knowledge framework that covers healthcare domains that a hospital encompasses-from the medical or administrative tasks, to hospital assets, medical insurances, patient records, drugs, and regulations. Therefore, our ontology makes our vision of personalized healthcare possible by capturing all necessary knowledge for a complex personalized healthcare scenario involving patient care, insurance policies, and drug prescriptions, and compliances. For example, our ontology facilitates a workflow management system to allow users, from physicians to administrative assistants, to manage, even create context-aware new medical workflows and execute them on-the-fly.
A Design Flow for the Precise Identification of the Worst-Case Voltage Drop in Power Grid Analyses
Authors: D. P. Karampatzakis, M. K. Tsiampas, N. E. Evmorfopoulos, G. I. Stamoulis
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

Modern IC designs contain hundreds of millions of transistors and new approaches of multicore chips take place in commercial products. Identifying worst-case voltage drop conditions in every hierarchical module supplied by the power grid is a crucial reliability problem in modern IC design. In this paper we focused our efforts on a complete design flow using innovative results of our recent research work. This approach demonstrates a new implementation of construction of the current space which is performed via plain simulation and statistical extrapolation using results from extreme value theory. Experimental results verify the potential of the estimation engine using industrial EDA tools and perform power grid verification using a custom hierarchical design.
Aggregating inconsistent information: Ranking and clustering
Authors: Nir Ailon, Moses Charikar, Alantha Newman
Venue: Journal of the ACM (JACM) (2008)

We address optimization problems in which we are given contradictory pieces of input information and the goal is to find a globally consistent solution that minimizes the extent of disagreement with the respective inputs. Specifically, the problems we address are rank aggregation, the feedback arc set problem on tournaments, and correlation and consensus clustering. We show that for all these problems (and various weighted versions of them), we can obtain improved approximation factors using essentially the same remarkably simple algorithm. Additionally, we almost settle a long-standing conjecture of Bang-Jensen and Thomassen and show that unless NP&sube;BPP, there is no polynomial time algorithm for the problem of minimum feedback arc set in tournaments.
Evaluating the Hands-Free Mouse Control System: An Initial Case Study
Authors: Torsten Felzer, Rainer Nordmann
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

An initial user study evaluating the HAnds-free Mouse COntrol System (HaMCoS) will be presented. The system allows its user to fully operate a Windows® PC without using the hands. It requires a special piezo-based input sensor in order to pick up the muscular activity of a single dedicated muscle of the user. The idea is to detect intentional contractions of the monitored muscle, and to use this information for emulating a two-button mouse device. In addition, the software framework renders any keyboard input unnecessary, so HaMCoS represents a comprehensive input method for persons who are unable to reliably employ the hands (e.g., tetraplegics). The paper will take a closer look at the specifics of the system followed by a discussion of the experiences gained by potential end users in a first case study.
Fast Stochastic Context-Free Parsing: A Stochastic Version of the Valiant Algorithm
Authors: José-Miguel Benedí, Joan-Andreu Sánchez
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

In this work, we present a fast stochastic context-free parsing algorithm that is based on a stochastic version of the Valiant algorithm. First, the problem of computing the string probability is reduced to a transitive closure problem. Then, the closure problem is reduced to a matrix multiplication problem of matrices of a special type. Afterwards, some fast algorithm can be used to solve the matrix multiplication problem. Preliminary experiments show that, in practice, an important time savings can be obtained.
A Secure Handover Protocol Design in Wireless Networks with Formal Verification
Authors: Sun-Hee Lim, Ki-Seok Bang, Okyeon Yi, Jongin Lim
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

This paper analyses security mechanisms in wireless networks, and designs for secure and efficient protocol for a handover reusing the key materials generated before the handover phase. In order to be sure that our handover protocol does not have any security flaws, we formally validated it using automatic protocol analyzer AVIPSA.
Attempto Controlled English for Knowledge Representation
Authors: Norbert E. Fuchs, Kaarel Kaljurand, Tobias Kuhn
Venue: Reasoning Web: 4th International Summer School 2008, Venice, Italy, September 7-11, 2008, Tutorial Lectures (2008)

Attempto Controlled English (ACE) is a controlled natural language, i.e. a precisely defined subset of English that can automatically and unambiguously be translated into first-order logic. ACE may seem to be completely natural, but is actually a formal language, concretely it is a first-order logic language with an English syntax. Thus ACE is human and machine understandable. ACE was originally intended to specify software, but has since been used as a general knowledge representation language in several application domains, most recently for the semantic web. ACE is supported by a number of tools, predominantly by the Attempto Parsing Engine (APE) that translates ACE texts into Discourse Representation Structures (DRS), a variant of first-order logic. Other tools include the Attempto Reasoner RACE, the AceRules system, the ACE View plug-in for the Protégé ontology editor, AceWiki, and the OWL verbaliser.
Witness Sets
Authors: Gérard Cohen, Hugues Randriam, Gilles Zémor
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

Given a set C of binary n-tuples and c ¿ C, how many bits of c suffice to distinguish it from the other elements in C ? We shed new light on this old combinatorial problem and improve on previously known bounds.
A generalization of additive generator of triangular norms
Authors: Yao Ouyang, Jinxuan Fang, Zhenjiang Zhao
Venue: International Journal of Approximate Reasoning (2008)

This short note is devoted to the generalization of the concept of additive generators of triangular norms. The cases of pseudo-t-norms and t-subnorms are also discussed. Several illustrative examples are given.
The Impact of Visual and Auditory Cues in Age Estimation
Authors: Kajsa Amilon, Joost Weijer, Susanne Schötz
Venue: Speaker Classification II: Selected Projects (2007)

Several factors determine the ease and accuracy with which we can estimate a speaker's age. The question addressed in our study is to what extent visual and auditory cues compete with each other. We investigated this question in a series of five related experiments. In the first four experiments, subjects estimated the age of 14 female speakers, either from still pictures, an audio recording, a video recording without sound, or a video recording with sound. The results from the first four experiments were used in the fifth experiment, to combine the speakers with new voices, so that there was a discrepancy in how old the speaker looked and how old she sounded. The estimated ages of these dubbed videos were not significantly different from those of the original videos, suggesting that voice has little impact on the estimation of age when visual cues are available.