ppxscal/embedding_network huggingface dataset:
Towards keyboard independent touch typing in VR
Authors: Falko Kuester, Michelle Chen, Mark E. Phair, Carsten Mehring
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

A new hand- or finger-mounted data input device, called KITTY, is presented. KITTY is designed for keyboard independent touch typing and supports traditional touch-typing skills as a method for alphanumeric data input. This glove-type device provides an ultra-portable solution for ``quiet'' data input into portable computer systems and full freedom of movement in mobile VR and AR environments. The KITTY design follows the concept of the column and row layout found on traditional keyboards, allowing users to draw from existing touch typing skills, easing the required training time.
Performance comparison of MPI and OpenMP on shared memory multiprocessors: Research Articles
Authors: Géraud Krawezik, Franck Cappello
Venue: Concurrency and Computation: Practice Experience (2006)

When using a shared memory multiprocessor, the programmer faces the issue of selecting the portable programming model which will provide the best performance. Even if they restricts their choice to the standard programming environments (MPI and OpenMP), they have to select a programming approach among MPI and the variety of OpenMP programming styles.To help the programmer in their decision, we compare MPI with three OpenMP programming styles (loop level, loop level with large parallel sections, SPMD) using a subset of the NAS benchmark (CG, MG, FT, LU), two dataset sizes (A and B), and two shared memory multiprocessors (IBM SP3 NightHawk II, SGI Origin 3800). We have developed the first SPMD OpenMP version of the NAS benchmark and gathered other OpenMP versions from independent sources (PBN, SDSC and RWCP). Experimental results demonstrate that OpenMP provides competitive performance compared with MPI for a large set of experimental conditions. Not surprisingly, the two best OpenMP versions are those requiring the strongest programming effort. MPI still provides the best performance under some conditions. We present breakdowns of the execution times and measurements of hardware performance counters to explain the performance differences. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Shape Model-Based 3D Ear Detection from Side Face Range Images
Authors: Hui Chen, Bir Bhanu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Ear detection is an important part of an ear recognition system. In this paper we propose a shape model-based technique for locating human ears in side face range images. The ear shape model is represented by a set of discrete 3D vertices corresponding to ear helix and anti-helix parts. Given side face range images, step edges are extracted considering the fact that there are strong step edges around the ear helix part. Then the edge segments are dilated, thinned and grouped into different clusters which are potential regions containing ears. For each cluster, we register the ear shape model with the edges. The region with the minimum mean registration error is declared as the detected ear region; the ear helix and anti-helix parts are meanwhile identified. Experiments are performed with a large number of real face range images to demonstrate the effectiveness of our approach. The contributions of this paper are: (a) a ear shape model for locating 3D ears in side face range images, (b) an effective approach to detect human ears from side face range images, (c) experimental results on a large number of ear images.
An Implantable CMOS Front-End System for Nerve-Signal Sensors
Authors: Jannik Hammel Nielsen, Erik Bruun
Venue: Analog Integrated Circuits and Signal Processing (2006)

An analog front-end dedicated to processing of cuff-recorded human nerve signals is presented in this paper. The system is comprised of a low-noise preamplifier and an A/D converter (ADC) for quantizing the recorded nerve signal. The instrumentation amplifier utilizes CMOS transistors biased in the weak/moderate inversion region at a relatively high current for low thermal noise performance and achieves low flicker noise performance through chopper stabilization. The resulting measured equivalent input referred thermal noise is 6.6 nV/¿Hz at a chopping frequency of 20 kHz. A two-stage design is implemented which achieves a measured amplification of 72.5 dB over a signal bandwidth of 4 kHz. For the ADC, a third order ¿¿-modulator employing a continuous-time (CT) loopfilter was implemented. Each of the integrators in the loop-filter are implemented as Gm¿C elements. For a sampling frequency of 1.4 MHz, the measured SNDR for the ADC is 62 dB, whereas the dynamic range (DR) is 67 dB over a 4 kHz bandwidth, equivalent to a resolution of 10 bits. The system draws a current of 196 ¿A from a 1.8 V supply thus consuming approximately 350 ¿W excluding buffers and bias circuitry.
A visual language and environment for composing web services
Authors: Na Liu, John Grundy, John Hosking
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Implementing complex web service-based systems requires tools to effectively describe and co-ordinate the composition of web service components. We have developed a new domain-specific visual language called ViTABaL-WS and built a prototype design tool to support modelling complex interactions between web service components. ViTABaL-WS uses a "Tool Abstraction" metaphor for describing relationships between service definitions, and multiple-views of data-flow, control-flow and event propagation in a modelled process. The tool supports the generation of Business Process Execution Language (BPEL) definitions from a model, directly deploys a generated model to a workflow engine, and supports dynamic visualisation of a running BPEL process.
SVR-Parameters Selection for Image Watermarking
Authors: Chun-hua Li, Zheng-ding Lu, Ke Zhou
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

An image digital watermarking technique using support vector regression (SVR) is proposed and researched in this paper. Firstly, the method of embedding and extracting watermarking from digital image is given. Then, the influence of SVR-learning parameters on the watermarking performance is analyzed, and the ideal value range of SVR-learning parameters for different images is given respectively. Finally, the results are validated with other images. Experimental results show that this technique can obtain good watermarking performance as well as good learning performance when RBF kernel is adopted with its width .. from 8 to 10, balanceable parameter C from 0.8 to 1, insensitive parameter ε from 0.008 to 0.01 respectively.
Software Development SRE Needs
Authors: Mario R. Garzia
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Today's software development environment requires tools and techniques for accurate, efficient evaluation of product reliability. To be successful, SRE must address the common, yet complex issues facing companies when assessing their product's reliability, such as the large number of customer usage scenarios, limited reliability evaluation times, and comparisons with competing products.
Systems Specification by Basic Protocols
Authors: A. Ad. Letichevsky, Yu. V. Kapitonova, V. A. Volkov, A. A. Letichevsky, S. N. Baranov, V. P. Kotlyarov, T. Weigert
Venue: Cybernetics and Systems Analysis (2005)

Theoretical foundations of requirements formalization and verification based on basic protocols are presented. This approach uses the concept of an attributed transition system. Facets of an implementation of the system VRS are described together with some statistical results of using this tool in large-scale industrial projects.
Efficient SOAP Binding for Mobile Web Services
Authors: Kwong Yuen Lai, Thi Khoi Anh Phan, Zahir Tari
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Existing web services rely on HTTP and TCP as the underlying transport protocols for SOAP messaging. While these protocols provide a number of benefits, including being able to pass through firewalls and are universally supported across different platforms, they were designed for wired networks with high bandwidth, low latency and low error rate transmissions. Due to the variability of wireless channels however, these assumptions do not hold in wireless environments. In this paper, we investigate the performance of HTTP and TCP as transport protocols for SOAP in wireless environments. Through extensive testing, we show that SOAP-over-HTTP and SOAP-over-TCP are inefficient and lead to high latency and transmission overhead for wireless applications. To overcome these limitations, we study the use of UDP as a binding protocol for SOAP. The results obtained are promising and show that SOAP-over- UDP provides throughput that is ten times higher compared to SOAP-over-HTTP in a wireless setting. Furthermore, using UDP to transport SOAP messages reduces transmission overhead by more than 50% compared to SOAP-over- HTTP. Finally, to illustrate where UDP binding can be useful, example applications are also described in this paper.
An effective approach for dynamic analysis of rovers
Authors: A. Meghdari, R. Karimi, H. N. Pishkenari, A. L. Gaskarimahalle, S. H. Mahboobi
Venue: Robotica (2005)

In this paper a novel approach to dynamic formulation of rovers has been presented. The complexity of these multi-body systems especially on rough terrain, challenged us to use the Kane's method which has been preferred to others in these cases. As an example, symbolic equations of a six-wheeled rover, named CEDRA Rescue Robot which uses a shrimp like mechanism, have been derived and a simulation of forward and inverse dynamics has been presented. Due to the clear form of equations, each term defines a physical meaning which represents the effect of each parameter, resulting in a frame-work for performance comparison of rovers. Although the method has been described for a 2-D non-slipping case, it is also very useful for dimensional and dynamical optimization, high speed motion analysis, and checking various control algorithms. Furthermore, it can be extended to 3-D cases and other complicated mechanisms and rovers while conserving its inherent benefits and adding to the ease of handling nonholonomic constraints.
Towards a new synthesis of ontology technology and knowledge management
Authors: Peter Mika, Hans Akkermans
Venue: The Knowledge Engineering Review (2004)

This paper provides a synthesis of ontology research and one of its most significant application areas, the business discipline of Knowledge Management (KM). Despite the fact such a synergy is in great demand between consumers and suppliers of ontology technology, there is a lack of understanding on one side and a lack of realism on the other. Due to the lack of communication and understanding between ontology research and applied KM there is the danger that mainstream KM will remain neutral to ontologies, while research develops as a largely unguided exploration.
Approximation algorithms for metric embedding problems
Authors: Kedar Dhamdhere
Venue:  (2005)

We initiate the study of metric embedding problems from an approximation point of view. Metric embedding is a map from a guest metric to a host metric. The quality of the embedding is defined in terms of distortion, the ratio by which pairwise distances get skewed in the host metric. While metric embeddings in general have received quite a lot of attention in theory community, most of the results about distortion prove uniform bounds that work for various families of host and guest metric. In this dissertation, we address the question: how to find the best embedding of the particular input metric into a host metric. We consider the real line as the host metric in our study. We consider the following measures of quality of an embedding: distortion, average distortion and additive distortion. The distortion is the maximum ratio by which a pairwise distance gets stretched in a non-contracting embedding. We give O( n )-approximation for the distortion of embedding an unweighted graph metric to a line metric. The average distortion is the ratio of average distance in the embedded metric to that in the input metric. We give a 17-approximation for the average distortion when embedding an arbitrary finite metric to a line metric. The additive distortion is the total absolute difference between input and output distances. We provide an O( logn )-approximation for this objective function. We also show NP-hardness of these problems. We also consider the problem of linear ordering of a metric, i.e. assigning numbers from 1 through n to the points in the metric, so as to minimize the &lsquo;stretch&rsquo;. The stretch is the maximum pairwise distance in the ordering divided by the distance in the input metric. For this problem, we give O(log3 n) approximation. Finally, we consider the problem of constructing a probabilistic embedding of a graph into its spanning trees. We give a simple O(log 2 n)-approximation algorithm that improves on the algorithm of Elkin et al. [2005].
On the Systematic Analysis of Natural Language Requirements with CIRCE
Authors: Vincenzo Ambriola, Vincenzo Gervasi
Venue: Automated Software Engineering (2006)

This paper presents Circe, an environment for the analysis of natural language requirements. Circe is first presented in terms of its architecture, based on a transformational paradigm. Details are then given for the various transformation steps, including (i) a novel technique for parsing natural language requirements, and (ii) an expert system based on modular agents, embodying intensional knowledge about software systems in general. The result of all the transformations is a set of models for the requirements document, for the system described by the requirements, and for the requirements writing process. These models can be inspected, measured, and validated against a given set of criteria.Some of the features of the environment are shown by means of an example. Various stages of requirements analysis are covered, from initial sketches to pseudo-code and UML models.
Smooth Scene Transition for Virtual Tour on the World Wide Web
Authors: Eun-Young (Elaine) Kang, Ilmi Yoon
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper presents a robust image registration technique for creating smooth scene transitions for a web-based virtual tour system, Easy and Effective Virtual Tour (EEVT). EEVT has advantages over traditional geometry-based 3D rendering approach in that it does not require labor intensive 3D modeling process or high bandwidth for realistic virtual tour yet provides a virtual tour with free navigation and immersive experience through the WWW. EEVT constructs virtual tour from a set of images. It uses several snap shots of conventional photos without special tools, builds a simple 3D space within each photo using the spidery mesh technique, and expands the virtual spaces by connecting each space together. The connection between images is achieved by image registration, which finds correspondences automatically and estimates transformations. The image registration process is crucial for virtual tour applications in order to compose smooth transitional scenes between two views so that virtual tourists perceive continuous scenes during navigation. Our registration method uses a parametric approach and it includes the following key features for robust and accurate computation: 1) coarse-to-fine hierarchical estimation 2) fast computation based on image feature-correspondences 3) FFT-based global matching 4) automatic outlier removal by RANSAC. The expanded virtual space creates a sense of navigational freedom for virtual tourists with less distorted viewing.
Global Lower Bounds for the VLSI Macrocell Floorplanning Problem Using Semidefinite Optimization
Authors: P. L. Takouda, M. F. Anjos, A Vannelli
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

We investigate the application of Semidefinite Programming (SDP) techniques to the VLSI macrocell floorplanning problem. We propose a new mixed-integer SDP formulation of the problem which leads to new SDP relaxations. This approach has been implemented and we report global lower bounds for some MCNC benchmark macrocell problems.
DSIM: A Distance-Based Indexing Method for Genomic Sequences
Authors: Xia Cao, Beng Chin Ooi, Hwee Hwa Pang, Kian-Lee Tan, Anthony K. H. Tung
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

In this paper, we propose a Distance-based Sequence Indexing Method (DSIM) for indexing and searching genome databases. Borrowing the idea of video compression, we compress the genomic sequence database around a set of automatically selected reference words, formed from high-frequency data substrings and substrings in past queries. The compression captures the distance of each non-reference word in the database to some reference word. At runtime, a query is processed by comparing its substrings with the compressed data strings, through their distances to the reference words. We also propose an efficient scheme to incrementally update the reference words and the compressed data sequences as more data sequences are added and new queries come along. Extensive experiments on a human genome database with 2.62GB of DNA sequence letters show that the new algorithm achieves significantly faster response time than BLAST, while maintaining comparable accuracy.
Guests editor's introduction
Authors: S. Bartolini, P. Foglia, C. A. Prete
Venue: Proceedings of the 2004 workshop on MEmory performance: DEaling with Applications , systems and architecture (2004)

In this issue of ACM SigArch Newsletter, we present eight papers from the MEDEA Workshop, held in conjunction with the International Conference on Parallel Architectures and Compilation Techniques (PACT-2004) [1], [2].
A Multi-Model Approach for Supporting the Personalization of Ubiquitous Learning Applications
Authors: Rosa G. J. Paredes, Hiroaki Ogata, Yoneo Yano, Gerardo Ayala San Martin
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

An additional platform for supporting learning in the same physical space in which it takes place, is now available owing to the continuous advancement of wireless and mobile technologies. However, new challenges arise for the development of ubiquitous computing learning applications capable to provide appropriate content and services according to the individual needs of each learner. In this paper, we describe the implementation of a centralized system with a multi-model based approach to support the personalization of such applications. These models contain information about the application, the user's characteristics, the usage behavior and the situational environment.
A longitudinal study of information system threat categories: the enduring problem of human error
Authors: Ghi Paul Im, Richard L. Baskerville
Venue: ACM SIGMIS Database (2005)

Taxonomies of information security threats usually distinguish between accidental and intentional sources of system risk. Security reports have paid a great deal of attention in recent years to the growing problem of hacking and intentional abuse. The prevalence of these reports suggests that hacking has become a more severe problem in relation to other security threats, such as human error. In this paper, we report on research that addresses this question: "How have changes over time in the frequency of hacking and other intentional forms of security threats affected the validity of information systems risk management taxonomies?" We replicate a simple study of the proportions of categories of security threats that was originally completed in 1993. Comparing the results from the replicated study with the results from the original study, we find that the proportions of threat categories have, in contradiction with the popular perception, remained relatively stable over the past decade. These results indicate that human error remains a significant and poorly recognized issue for information systems security. We propose and validate an elaborated taxonomy of information security threats that provides additional insight into human error as a significant source of security risk.
Selection of Classifiers for the Construction of Multiple Classifier Systems
Authors: Hee-Joong Kang, David Doermann
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Most studies on combining multiple classifiers have focused on combination methods, but a few studies have investigated on how to select component classifiers from a classifier pool. Multiple classifier systems performance varies with the component classifiers as well as the combination method. In this paper, methods based on information theory are proposed for selecting component classi- fiers, provided that the number of component classifiers is fixed in advance. These methods are applied to the classifier pool and examine the possible classifier sets. The system is compared to other multiple classifier systems on the recognition of unconstrained handwritten numerals.
Trucking right
Authors: Joe Rigo
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1981)

Computers really may help people write better. They provide motivation, and they make the whole job easier. 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
Bearings-only target localization using total least squares
Authors: Kutluyil Doǧançay
Venue: Signal Processing (2005)

A total least-squares (TLS) algorithm is developed for two-dimensional location estimation of a stationary target by using only passive bearing measurements of the target. This problem has been studied extensively for several decades and has applications in electronic warfare, surveillance, passive sonar, interference location and suppression, and so forth. The nonlinear nature of the estimation problem poses a number of challenges related to complexity, convergence and estimation bias. After a critical review of the least-squares (LS) algorithms, a TLS estimation algorithm is developed based on the method of orthogonal vectors with the advantage of simplicity and reduced bias in the presence of bearing noise and observer position errors. A constrained TLS (CTLS) algorithm is also developed to improve the estimation accuracy, especially in the case of large measurement errors. Numerical examples are provided to compare the performance of the TLS and CTLS algorithms with the LS target localization algorithms, viz. the maximum likelihood estimator, Stansfield estimator and the method of orthogonal vectors.