ppxscal/embedding_network huggingface dataset:
Simulating haptic feedback using vision: A survey of research and applications of pseudo-haptic feedback
Authors: Anatole Lécuyer
Venue: Presence: Teleoperators and Virtual Environments (2009)

This paper presents a survey of the main results obtained in the field of “pseudo-haptic feedback”: a technique meant to simulate haptic sensations in virtual environments using visual feedback and properties of human visuo-haptic perception. Pseudo-haptic feedback uses vision to distort haptic perception and verges on haptic illusions. Pseudo-haptic feedback has been used to simulate various haptic properties such as the stiffness of a virtual spring, the texture of an image, or the mass of a virtual object. This paper describes the several experiments in which these haptic properties were simulated. It assesses the definition and the properties of pseudo-haptic feedback. It also describes several virtual reality applications in which pseudo-haptic feedback has been successfully implemented, such as a virtual environment for vocational training of milling machine operations, or a medical simulator for training in regional anesthesia procedures.
Computational forces in the SAGE benchmark
Authors: Robert W. Numrich
Venue: Journal of Parallel and Distributed Computing (2009)

Dimensional analysis applied to a complicated timing formula for the SAGE benchmark yields new insight into the limits to scalability. A single surface, defined by two curvilinear coordinates, describes the parallel efficiency of the benchmark. Each machine, as a function of the number of processors, follows its own path on the surface determined by dimensionless ratios of hardware forces to software forces. Two machines with the same ratios follow the same path and are self-similar, even though the numerical value of each individual force may be different. For this benchmark, latency effects are unimportant relative to bandwidth effects because of the slab decomposition used to distribute the problem across processors. To a good first-order approximation, a single force ratio describes the efficiency as a function of the number of processors. A simpler model, with a single dimensionless exponent, describes the first-order behavior of the computational power as a function of the number of processors.
New dynamic construction techniques for M-tree
Authors: Tomáš Skopal, Jakub Lokoč
Venue: Journal of Discrete Algorithms (2009)

Since its introduction in 1997, the M-tree became a respected metric access method (MAM), while remaining, together with its descendants, still the only database-friendly MAM, that is, a dynamic structure persistent in paged index. Although there have been many other MAMs developed over the last decade, most of them require either static or expensive indexing. By contrast, the dynamic M-tree construction allows us to index very large databases in subquadratic time, and simultaneously the index can be maintained up-to-date (i.e., supports arbitrary insertions/deletions). In this article we propose two new techniques improving dynamic insertions in M-tree-the forced reinsertion strategies and so-called hybrid-way leaf selection. Both of the techniques preserve logarithmic asymptotic complexity of a single insertion, while they aim to produce more compact M-tree hierarchies (which leads to faster query processing). In particular, the former technique reuses the well-known principle of forced reinsertions, where the new insertion algorithm tries to re-insert the content of an M-tree leaf that is about to split in order to avoid that split. The latter technique constitutes an efficiency-scalable selection of suitable leaf node wherein a new object has to be inserted. In the experiments we show that the proposed techniques bring a clear improvement (speeding up both indexing and query processing) and also provide a tuning tool for indexing vs. querying efficiency trade-off. Moreover, a combination of the new techniques exhibits a synergic effect resulting in the best strategy for dynamic M-tree construction proposed so far.
New Approach of FEM for Eigenvalue Problems with Non-local Transition Conditions
Authors: A. B. Andreev, M. R. Racheva
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

This paper is considered with the finite element method (FEM) for second order eigenvalue problems on a bounded multi-compo- nent domain in the plane. Non-local transition conditions on the interfaces between any two adjacent subdomains are imposed. A new finite element approach is proposed based on much more comprehensible theoretical proofs obtained under lower regularity requirements. The utility of this strategy when superconvergent postprocessing procedure is used as well as the numerical implementation are discussed. Finally, some numerical results are given.
A multiple feature/resolution scheme to Arabic (Indian) numerals recognition using hidden Markov models
Authors: Sameh M. Awaidah, Sabri A. Mahmoud
Venue: Signal Processing (2009)

This paper describes a technique for the recognition of optical off-line handwritten Arabic (Indian) numerals using hidden Markov models (HMM). Features that measure the image characteristics at local, intermediate, and large scales were applied. Gradient, structural, and concavity features at the sub-regions level are extracted and used as the features for the Arabic (Indian) numeral. Several experiments were conducted for estimating the suitable number of image divisions, and the best combination of features using the HMM classifier. A number of experiments were conducted to estimate the best number of states and codebook sizes in terms of the highest recognition rate possible. In this work, we did not follow the general trend of using the sliding window technique with HMM. Instead, a multi-resolution feature extraction approach was implemented on the whole digit. A database of 44 writers, with 48 samples per digit resulting in a database of 21120 samples was used. The achieved average recognition rate is 99%. The classification errors were analysed and attributed to bad data, different writing styles of some digits, errors between digit pairs, and genuine errors. The presented technique, which is writer independent, proved to be effective in the automatic recognition of Arabic (Indian) numerals.
Design and simulation of micromachined gyroscope
Authors: N. AbuAlarraj, H. Hassan, H. Ibrahim
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

In this paper a MEMS vibrating rate gyroscope design based on previous work [1] was analyzed to get its mechanical characteristics. In this design, bended beams were used for the inner and outer structures. Electrostatic force is applied on the comb drive electrodes of the gyroscope to create motion in the drive mode direction. The excitation of the gyroscope's drive mode and the deflection of the inner mass due to Coriolis force is simulated using ANSYS FEA software. The simulation results show resonance frequencies of 3769 Hz for the drive mode and 3661 Hz for the sense mode, maximum displacement of 5.07 µm in drive mode and 6.89nm in sense mode, the mechanical sensitivity is 0.00689 µm/ (o/s), and the frequency mismatch of 2.86%.
Using aspect-orientation in industrial projects: appreciated or damned?
Authors: Uwe D.C. Hohenstein, Michael C. Jäger
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Aspect-orientation (AO) is a recent technology for handling crosscutting concerns in a structured and modular manner. In spite of being considered useful, researchers often complain that industry is not widely adopting AO concepts and technologies in commercial projects. This paper reports on real usage of aspect-orientation in an industrial project, which means that AO, in particular the AspectJ language, is part of a real software product. AO is basically used to overcome several critical problems. Those problems are well motivated and discussed in detail. Some of them are hard to solve with conventional programming techniques whereas the application of an appropriate AO-based solution is very straightforward. Since some of the reported problems are not really of crosscutting nature, the solutions might be questionable. This leads to a discussion about the "political correctness" of this approach. Furthermore, the paper also explains why and how the project management could be convinced to use AspectJ.
Metadata standards for semantic interoperability in electronic government
Authors: Jim Davies, Steve Harris, Charles Crichton, Aadya Shukla, Jeremy Gibbons
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Effective data sharing, across government agencies and other organisations, relies upon agreed meanings and representations. A key, technological challenge in electronic governance is to ensure that the meaning of data items is accurately recorded, and accessible in an economical---effectively, automatic---fashion. In response, a variety of data and metadata standards have been put forward: from government departments, from industry groups, and from organisations such as the ISO and W3C. This paper shows how the leading standard for metadata registration---ISO 11179---can be deployed without the need for a single, monolithic conceptualisation of the domain, and hence without the need for universal agreement upon a particular model of electronic governance. The advantages of this approach are discussed with regard to the UK eGovernment Interoperability Framework (eGIF) and the UK Integrated Public Sector Vocabulary (IPSV).
Office automation in the executive suite: successes and strategies
Authors: James Carlisle
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Real automation in the office will enhance, rather than replace, today's administrative and communication systems. The critical involvement of top-level executives as users of these new systems requires a "human approach" to design and implementation that challenges traditional assumptions of DP, MIS, WP and Telecommunications.
Generalized fuzzy h-bi-ideals and h-quasi-ideals of hemirings
Authors: Xueling Ma, Jianming Zhan
Venue: Information Sciences: an International Journal (2009)

A new kind of generalized fuzzy h-ideals of a hemiring, namely, the (set membership, variant,set membership, variantlogical orq)-fuzzy h-bi-ideal (resp., h-quasi-ideal) is studied and the relationships between these generalized fuzzy h-ideals are described. Some characterization theorems of prime and semiprime (set membership, variant,set membership, variantlogical orq)-fuzzy h-bi-ideals (resp., h-quasi-ideals) of a hemiring are also given. In particular, we show that the h-hemiregular hemirings and h-intra-hemiregular hemirings can be described by using some of their generalized fuzzy h-ideals. Finally, the implication-based fuzzy h-bi-ideals (resp., h-quasi-ideals) of a hemiring are considered.
Video / Text Linkage System Assisted by a Concept Dictionary and Image Recognitio
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

n Mitsukazu Washisaka, Toshihiro Takada, Shigemi Aoyagi, and Rikio Onai This paper describes a system for two-way linkage between video and its transcribed text that supports observational data analysis. One distinct feature of our system is that a specific area in the video image is linked to the text. The luminance (Y) signal of the video image is used to assist in linkage establishment from video to text. Another feature is that it is possible to extract concepts of the search term and to compare these with the text data on a conceptual level. 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
Music therapist robot for individuals with cognitive impairments
Authors: Adriana Tapus, Cristian Tapus, Maja J. Matarić
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Currently the 2 percent growth rate for the world's older population exceeds the 1.2 percent rate for the world's population as a whole. This difference is expected to increase rather than diminish so that by 2050, the number of individuals over the age 85 is projected to be three times what it is today. Most of these individuals will need physical, emotional, and cognitive assistance. In this paper, we present a new system based on the socially assistive robotics (SAR) technology that will play the role of a music therapist and will try to provide a customized help protocol through motivation, encouragements, and companionship to users suffering from cognitive changes related to aging and/or Alzheimer's disease.
Research on Eye-gaze Tracking Network Generated by Augmented Reality Application
Authors: Ming Chen, Yimin Chen, Zhengwei Yao, Wei Chen, Yijun Lu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Eye gaze control is playing an important role in AR system. However, the physiology mechanism of eye gaze control can’t be totally understood for the limitation of biomedicine presently. The research on evolving networks has been widely studied recently and the degree distributions of these networks are of a power-law form. To enhance the calibration accuracy and improve the judgment effects of gazing objects, in this paper, the property of eye gaze tracking network is studied according to those methods used in complex network. The eye gaze tracking network model inserted position information and achievement probability was established and the degree distribution was discussed. Simulation results show that the degree distribution of eye gaze tracking network is scale-free.
Compiler Controlled Speculation for Power Aware ILP Extraction in Dataflow Architectures
Authors: Muhammad Umar Farooq, Lizy John, Margarida F. Jacome
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Traditional predicated execution uses two techniques: top predication --- in which only the head of the dependence chain is predicated, and bottom predication --- in which only the tail of the dependence chain is predicated. Top predication prevents speculative execution, thus delivering minimum performance at minimum energy cost, while bottom predication allows full speculation of the dependence chain, resulting in maximum performance at maximum energy cost. In this paper, we propose a novel power-aware ILP extraction technique, denoted the `elastic-block', that combines these two extremes, exposing superior energy vs. performance trade-offs. Each instruction in the elastic-block is explicitly guarded by two predicates: the speculative, and the final. Instruction's final predicate is generated using traditional if-conversion technique, while the speculative predicate has its default value statically assigned by the compiler, enabling it to make power-performance trade-offs in the code. Several energy saving code optimizations are proposed for the elastic-block structure.
How reward, computer self-efficacy, and perceived power security affect knowledge management systems success: An empirical investigation in high-tech companies
Authors: Jung-Yu Lai
Venue: Journal of the American Society for Information Science and Technology (2009)

In a highly competitive environment, high-tech firms utilize capital-intensive facilities, technology-intensive products, and computer applications for gaining competitive advantages. It makes employees acquire more knowledge to perform more complex tasks. This has resulted in an increasing demand for organizations to implement knowledge management systems (KMS) for employees to steer organizational learning in the new era of knowledge-based economy. However, prior empirical examinations on factors influencing KMS success are not sufficient, particularly in the high-tech context. This study formulates and empirically tests a theoretical model to explain these factors and how they affect KMS success. Results from a sample of 141 employees selected from four high-tech semiconductor manufacturing firms provide us a more comprehensive understanding about how benefits, self-produced, and costs factors (i.e., reward, computer self-efficacy, and perceived power security) affect KMS success. It can be seen that reward and perceived power security have both direct and indirect effects on user satisfaction and intention to use KMS through perceived usefulness and ease of use. Moreover, computer self-efficacy influences user satisfaction and intention to use KMS through perceived usefulness and ease of use. Besides providing directions for development and testing of knowledge management theories, these findings will be valuable to practitioners. &copy; 2009 Wiley Periodicals, Inc.
Research on Modeling Method of Virtual Enterprise in Uncertain Environments
Authors: Jihai Zhang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Virtual Enterprise is a kind of temporary organization which is made up of many enterprises. The internal and external environments of virtual enterprises are changing incessantly. Nowadays, it is short of the normalized methods of describing this kind of organizations in uncertain environments. Role theory is used to design role view which associates with task view, workflow view, organization view, agent view and interaction view. Finally, gains the modeling method of virtual enterprise based on extended agent UML.
Rescue and preservation of climate data by extraction and digitization from autographic weather charts using image processing tools
Authors: Anita S. Diwakar, Anil A. Kulkarni, Poornima Talwai
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Data Rescue is the ongoing process of preserving all data at risk of being lost due to deterioration of the medium and digitizing current and past data into computer compatible form for easy access. IMD has conscientiously taken observations of the weather, recorded them either manually or automatically, transcribed them onto preset paper forms called autographic charts. Most of the charts are now at risk of being lost due to rapid deterioration of the medium. This paper presents algorithms for automatic extraction and storage of the atmospheric data using image processing tools. The key factors that influence the methods are speed, accuracy and space. We have tested the algorithms on scanned images of the autographic charts available at IMD and present the results in this paper.
A greedy approach with criteria factors for QoS based web service discovery
Authors: Kiran Kumar Reddy D, Karthiek Maralla, Raj Kumar G, M Thirumaran
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

Normally, the web service discovery mechanisms in web-sites have a trade-off between being Quality-driven or transaction cost-driven As goals of our paper, we decide upon several factors including the above-mentioned Quality and Transaction cost factors along with the parameters under each factor and use a priority-based greedy approach to involve minimum number of factors to achieve maximum efficiency in the web service discovery. We also present a model with QoS parameters which in a great way help in rating the web services with the end user's perspective on the basis of three levels of views, namely the business level view, Service level view and System level view. In this paper, we've broadly discussed around twenty eight parameters categorically falling under all the above-mentioned factors. To reduce the complexity of involving all the parameters we follow the mechanism of Greedy approach to evaluate the parameters and estimate the criteria rank for each and every parameter. The core principle of the Greedy approach, in general, is to involve minimum number of input data to achieve the maximum efficiency in the final optimized result.
A new framework for feature descriptor based on SIFT
Authors: Canlin Li, Lizhuang Ma
Venue: Pattern Recognition Letters (2009)

The description of interest points is a critical aspect of point correspondence which is vital in some computer vision and pattern recognition tasks. SIFT descriptor has been proven to perform better on the distinctiveness and robustness than other local descriptors. But SIFT descriptor does not involve color and global information of feature point which provides powerfully distinguishable signals in feature description and matching tasks, so many mismatches may occur. This paper improves SIFT descriptor, and presents a new framework for feature descriptor based on SIFT by integrating color and global information with it. The proposed framework consists of the improved SIFT, color invariance components and global component. We use a log-polar histogram to build three color invariance components and the global component of the proposed framework, respectively. In addition, the elliptical neighboring region for every interest point is used so as to make the framework fully invariant to common affine transformations. Experimental comparison with three related feature descriptors is carried out in two groups of experiments, validating the proposed framework.
Integrating pedagogical code reviews into a CS 1 course: an empirical study
Authors: Christopher Hundhausen, Anukrati Agrawal, Dana Fairbrother, Michael Trevisan
Venue: ACM SIGCSE Bulletin (2009)

Formal code inspections are employed by teams of professional software engineers to identify software defects and improve the quality of software. After reviewing a piece of code individually, members of an inspection team come together to log the issues they have found, and to find new ones. Within the scope of a multi-institutional research project to adapt, refine, and evaluate studio-based learning methods in computing education, we are developing an adaptation of the formal code inspection called the pedagogical code review for use in lower-division computer science courses. In a pedagogical code review, a group of three to four students, led by a trained moderator, (a) walk through segments of each other's programming assignments, (b) check the code against a list of best coding practices, and (c) discuss and log issues that arise. We implemented pedagogical code inspections in three lab sessions of a CS 1 course. Through an analysis of inspection logs and exit surveys, we compiled evidence that the reviews improved the quality of students' code, stimulated increasingly sophisticated discussions of programming issues and practices, and promoted a sense of community.
Reinterpreting no free lunch
Authors: Jon E. Rowe, M. D. Vose, Alden H. Wright
Venue: Evolutionary Computation (2009)

Since its inception, the “No Free Lunch” theorem (NFL) has concerned the application of symmetry results rather than the symmetries themselves. In our view, the conflation of result and application obscures the simplicity, generality, and power of the symmetries involved. This paper separates result from application, focusing on and clarifying the nature of underlying symmetries. The result is a general set-theoretic version of NFL which speaks to symmetries when arbitrary domains and co-domains are involved. Although our framework is deterministic, we note situations where our deterministic set-theoretic results speak nevertheless to stochastic algorithms.