ppxscal/embedding_network huggingface dataset:
Avatar culture: cross-cultural evaluations of avatar facial expressions
Authors: Tomoko Koda, Toru Ishida, Matthias Rehm, Elisabeth Andr&#x00e9;
Venue: AI Society (2009)

Avatars are increasingly used to express our emotions in our online communications. Such avatars are used based on the assumption that avatar expressions are interpreted universally among all cultures. This paper investigated cross-cultural evaluations of avatar expressions designed by Japanese and Western designers. The goals of the study were: (1) to investigate cultural differences in avatar expression evaluation and apply findings from psychological studies of human facial expression recognition, (2) to identify expressions and design features that cause cultural differences in avatar facial expression interpretation. The results of our study confirmed that (1) there are cultural differences in interpreting avatars&#x2019; facial expressions, and the psychological theory that suggests physical proximity affects facial expression recognition accuracy is also applicable to avatar facial expressions, (2) positive expressions have wider cultural variance in interpretation than negative ones, (3) use of gestures and gesture marks may sometimes cause counter-effects in recognizing avatar facial expressions.
Robust Measures of Complexity in TCBR
Authors: M. A. Raghunandan, Sutanu Chakraborti, Deepak Khemani
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

In TCBR, complexity refers to the extent to which similar problems have similar solutions. Casebase complexity measures proposed are based on the premise that a casebase is simple if similar problems have similar solutions. We observe, however, that such measures are vulnerable to choice of solution side representations, and hence may not be meaningful unless similarities between solution components of cases are shown to corroborate with human judgements. In this paper, we redefine the goal of complexity measurements and explore issues in estimating solution side similarities. A second limitation of earlier approaches is that they critically rely on the choice of one or more parameters. We present two parameter-free complexity measures, and propose a visualization scheme for casebase maintenance. Evaluation over diverse textual casebases show their superiority over earlier measures.
Validated caloric expenditure estimation using a single body-worn sensor
Authors: Jonathan Lester, Carl Hartung, Laura Pina, Ryan Libby, Gaetano Borriello, Glen Duncan
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

In 2007, approximately 30% of US adults were obese, with related health care costs exceeding 100 billion dollars. Clearly, the obesity epidemic represents a growing societal concern. One challenge in weight control is the difficulty of tracking food calories consumed and calories expended by activity. This paper presents a system for automatic monitoring of calories expended using a single body-worn accelerometer. Our system uses activity inference combined with signal analysis to estimate calories expended in real-time using regression formulas developed by the American College of Sports Medicine. To validate our system, we have collected data from 51 subjects in a laboratory setting using a treadmill and a more natural field test. Actual caloric expenditure was determined using the medical "gold standard" measurement, of oxygen consumption. We are able to achieve 89% accuracy with lab data and 79% with field data -- both high enough to be useful in practice.
The Ultrasonic Measurement for Object Vibration
Authors: Li-Ping Zhang, Qiu Yu
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

This paper provides a kind of ultrasonic measurement for object vibration. Through the use of LabVIEW and ultrasonic sensors, the whole system would be simple and cost would be much lower. And then some key problems have been solved, such as the nearby wavelet produced by the ultrasonic sensor, the background noise and also the dead zone for measurement. So the measurement would be more accuracy. As a result test, it recorded a curve produced by a kind of damp vibration which shows that the system can meet the demand for application.
Automatic Hybrid MPI+OpenMP Code Generation with llc
Authors: Ruymán Reyes, Antonio J. Dorta, Francisco Almeida, Francisco Sande
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

The evolution of the architecture of massively parallel computers is progressing toward systems with a hierarchical hardware design where each node is a shared memory system with several multi-core CPUs. There is consensus in the HPC community about the need to increment the efficiency of the programming paradigms used to exploit massive parallelism, if we are to make a full use of the advantages offered by these new architectures. llc is a language where parallelism is expressed using OpenMP compiler directives. In this paper we focus our attention on the automatic generation of hybrid MPI+OpenMP code from the llc annotated source code.
Active, Foveated, Uncalibrated Stereovision
Authors: James P. Monaco, Alan C. Bovik, Lawrence K. Cormack
Venue: International Journal of Computer Vision (2009)

Biological vision systems have inspired and will continue to inspire the development of computer vision systems. One biological tendency that has never been exploited is the symbiotic relationship between foveation and uncalibrated active, binocular vision systems. The primary goal of any binocular vision system is the correspondence of the two retinal images. For calibrated binocular rigs the search for corresponding points can be restricted to epipolar lines. In an uncalibrated system the precise geometry is unknown. However, the set of possible geometries can be restricted to some reasonable range; and consequently, the search for matching points can be confined to regions delineated by the union of all possible epipolar lines over all possible geometries. We call these regions epipolar spaces. The accuracy and complexity of any correspondence algorithm is directly proportional to the size of these epipolar spaces. Consequently, the introduction of a spatially variant foveation strategy that reduces the average area per epipolar space is highly desirable. This paper provides a set of sampling theorems that offer a path for designing foveation strategies that are optimal with respect to average epipolar area.
The Closest Pair Problem under the Hamming Metric
Authors: Kerui Min, Ming-Yang Kao, Hong Zhu
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

Finding the closest pair among a given set of points under Hamming Metric is a fundamental problem with many applications. Let n be the number of points and D the dimensionality of all points. We show that for 0 < D ≤ n 0.294, the problem, with the binary alphabet set, can be solved within time complexity $O\left(n^{2+o(1)}\right)$, whereas for n 0.294 < D ≤ n, it can be solved within time complexity $O\left(n^{1.843} D^{0.533}\right)$. We also provide an alternative approach not involving algebraic matrix multiplication, which has the time complexity $O\left(n^2D/\log^2 D\right)$ with small constant, and is effective for practical use. Moreover, for arbitrary large alphabet set, an algorithm with the time complexity $O\left(n^2\sqrt{D}\right)$ is obtained for 0 < D ≤ n 0.294, whereas the time complexity is $O\left(n^{1.921} D^{0.767}\right)$ for n 0.294 < D ≤ n. In addition, the algorithms propose in this paper provides a solution to the open problem stated by Kao et al.
Research on the Servo Lag Error and Compensation in Cam Non-circular Grinding Process
Authors: Jing Li, Yongyi He, Nanyan Shen, Minglun Fang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

This paper studies the cause of servo lag error in cam noncircular grinding process and conducts the quantitative calculation of these servo lag errors. Due to the characteristics of cam noncircular grinding, the influence of servo lag errors on the cam contour error can only be reduced rather than eliminated by adjusting the numerical control system parameters. RBF neural network is adopted to predict the processing errors for cam non-circular grinding and the predicted values of super finish grinding are utilized to compensate for machining errors. The test results show that the prediction model based on RBF network is of great benefit to improve the precision of cam non-circular grinding.
Fitting Product of HMM to Human Motions
Authors: M. Ángeles Mendoza, Nicolás Pérez De La Blanca, Manuel J. Marín-Jiménez
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

The Product of Hidden Markov Models (PoHMM) is a mixed graphical model defining a probability distribution on a sequence space from the normalized product of several simple Hidden Markov Models (HMMs). Here, we use this model to approach the human action recognition task incorporating mixture-Gaussian output distributions. PoHMM allow us to consider context at different range and to model different dynamics corresponding to different body parts in an efficient way. For estimating the normalization constant Z we introduce the annealed importance sampling (AIS) method in the context of PoHMM in order to obtain no-relative estimates of Z. We compare our approach with one based on fitting a logistic regression model to each two PoHMMs.
A Study on Bilingual Speech Recognition Involving a Minority Language
Authors: Míriam Luján-Mares, Carlos-D. Martínez-Hinarejos, Vicente Alabau
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

Multilingual Automatic Speech Recognition (ASR) systems are of great interest in multilingual environments. We have studied the case of the Comunitat Valenciana because the two official languages are Spanish and Valencian. These two languages share most of their phonemes and their syntax and vocabulary are also quite similar since they have influenced each other for many years. In this work, we present the design of the language and the acoustic models for this bilingual situation. Acoustic models can be separate for each language or shared by both of them, and they can be obtained directly from a training corpus or by adapting a previous set of acoustic models. Language models can be separate for each language (monolingual recognition) or mixed for both languages (bilingual recognition). We performed experiments with a small corpus to determine which option was better for this case.
Robust estimation of Google counts for social network extraction
Authors: Yutaka Matsuo, Hironori Tomobe, Takuichi Nishimura
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Various studies within NLP and Semantic Web use the so-called Google count, which is the hit count on a query returned by a search engine (not only Google). However, sometimes the Google count is unreliable, especially when the count is large, or when advanced operators such as OR and NOT are used. In this paper, we propose a novel algorithm that estimates the Google count robustly. It (i) uses the co-occurrence of terms as evidence to estimate the occurrence of a given word, and (ii) integrates multiple evidence for robust estimation. We evaluated our algorithm for more than 2000 queries on three datasets using Google, Yahoo! and MSN search engine. Our algorithm also provides estimate counts for any classifier that judges a web page as positive or negative. Consequently, we can estimate the number of documents with included references of a particular person (among namesakes) on the entire web.
Mobility, Emotion, and Universality in Future Collaboration
Authors: Mark Chignell, Naotsune Hosono, Deborah Fels, Danielle Lottridge, John Waterworth
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

The Graphical user interface has traditionally supported personal productivity, efficiency, and usability. With computer supported cooperative work, the focus has been on typical people, doing typical work in a highly rational model of interaction. Recent trends towards mobility, and emotional and universal design are extending the user interface paradigm beyond the routine. As computing moves into the hand and away from the desktop, there is a greater need for dealing with emotions and distractions. Busy and distracted people represent a new kind of disability, but one that will be increasingly prevalent. In this panel we examine the current state of the art, and prospects for future collaboration in non-normative computing requirements. This panel draws together researchers who are studying the problems of mobility, emotion and universality. The goal of the panel is to discuss how progress in these areas will change the nature of future collaboration.
Recognition of Users' Activities Using Constraint Satisfaction
Authors: Swapna Reddy, Ya'Akov Gal, Stuart M. Shieber
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Ideally designed software allow users to explore and pursue interleaving plans, making it challenging to automatically recognize user interactions. The recognition algorithms presented use constraint satisfaction techniques to compare user interaction histories to a set of ideal solutions. We evaluate these algorithms on data obtained from user interactions with a commercially available pedagogical software, and find that these algorithms identified users' activities with 93% accuracy.
AURA: enabling subject matter experts to construct declarative knowledge bases from science textbooks
Authors: Ken Barker, Vinay K. Chaudhri, Shaw-Yi Chaw, Peter E. Clark, Daniel Hansch, Bonnie E. John, Sunil Mishra, John Pacheco, Bruce Porter, Aaron Spaulding, Moritz Weiten
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

The long-term goal of Project Halo is to build an application called Digital Aristotle that can answer questions on a variety of science topics and provide user and domain appropriate explanations. As a near-term goal, we are focusing on enabling Subject Matter Experts (SMEs) to construct declarative knowledge bases (KBs) from 50 pages of a science textbook in the domains of Physics (Giancoli 2004), Chemistry (Brown et al. 2003) and Biology (Campbell et al. 2001) in a way that the system can answer questions similar to those on an Advanced Placement (AP) exam. We will demonstrate the current state of a system called AURA that we have been developing as a contributing technology toward the goal of Digital Aristotle. The innovative features of AURA are that it supports knowledge formulation for a mixture of textual and nontextual knowledge, and question formulation using an interactive dialog based on simplified English. The nontextual knowledge may contain tables, chemical reactions, and mathematical equations. In an extensive usability testing of AURA, we have established the basic viability of the approach.
Cross-modal emotional attention: Emotional voices modulate early stages of visual processing
Authors: Tobias Brosch, Didier Grandjean, David Sander, Klaus R. Scherer
Venue: Journal of Cognitive Neuroscience (2009)

Emotional attention, the boosting of the processing of emotionally relevant stimuli, has, up to now, mainly been investigated within a sensory modality, for instance, by using emotional pictures to modulate visual attention. In real-life environments, however, humans typically encounter simultaneous input to several different senses, such as vision and audition. As multiple signals entering different channels might originate from a common, emotionally relevant source, the prioritization of emotional stimuli should be able to operate across modalities. In this study, we explored cross-modal emotional attention. Spatially localized utterances with emotional and neutral prosody served as cues for a visually presented target in a cross-modal dot-probe task. Participants were faster to respond to targets that appeared at the spatial location of emotional compared to neutral prosody. Event-related brain potentials revealed emotional modulation of early visual target processing at the level of the P1 component, with neural sources in the striate visual cortex being more active for targets that appeared at the spatial location of emotional compared to neutral prosody. These effects were not found using synthesized control sounds matched for mean fundamental frequency and amplitude envelope. These results show that emotional attention can operate across sensory modalities by boosting early sensory stages of processing, thus facilitating the multimodal assessment of emotionally relevant stimuli in the environment.
Random indexing using statistical weight functions
Authors: James Gorman, James R. Curran
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

Random Indexing is a vector space technique that provides an efficient and scalable approximation to distributional similarity problems. We present experiments showing Random Indexing to be poor at handling large volumes of data and evaluate the use of weighting functions for improving the performance of Random Indexing. We find that Random Index is robust for small data sets, but performance degrades because of the influence high frequency attributes in large data sets. The use of appropriate weight functions improves this significantly.
Automatic Tumor Diagnosis for Breast Ultrasound Using 3D Sub-volume Registration
Authors: Chii-Jen Chen, Ruey-Feng Chang, Dar-Ren Chen
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Breast cancer is one of the most common cancers among women. Early detection and treatment of breast cancer can effectively prohibit its progress and decrease mortality rate. Recently, ultrasound imaging plays an important role in the field of breast cancer diagnosis because of its convenience and non-invasive. With the help of computer-aided diagnosis (CAD) system, the characteristics of tumor can be detected and provided to physicians as a critical reference. Because the shape of a tumor may be altered due to the stress caused by the ultrasound probe, the proposed sub-volume registration method can be utilized to analyze the variation of tumor between pre- and post-compression. Then, we can determine whether the tumor is benign or not with several statistical materials. The experimental results will show that this proposed model can efficaciously detect the tumors and support the clinical diagnoses.
Bayesian unsupervised topic segmentation
Authors: Jacob Eisenstein, Regina Barzilay
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

This paper describes a novel Bayesian approach to unsupervised topic segmentation. Unsupervised systems for this task are driven by lexical cohesion: the tendency of well-formed segments to induce a compact and consistent lexical distribution. We show that lexical cohesion can be placed in a Bayesian context by modeling the words in each topic segment as draws from a multinomial language model associated with the segment; maximizing the observation likelihood in such a model yields a lexically-cohesive segmentation. This contrasts with previous approaches, which relied on hand-crafted cohesion metrics. The Bayesian framework provides a principled way to incorporate additional features such as cue phrases, a powerful indicator of discourse structure that has not been previously used in unsupervised segmentation systems. Our model yields consistent improvements over an array of state-of-the-art systems on both text and speech datasets. We also show that both an entropy-based analysis and a well-known previous technique can be derived as special cases of the Bayesian framework.
Incomplete crossed hypercubes
Authors: Yan-Qing Zhang, Yi Pan
Venue: The Journal of Supercomputing (2009)

In this paper, a new interconnection network called the incomplete crossed hypercube is proposed for connecting processors of parallel computing systems. The incomplete crossed hypercube architecture denoted by CI n¿m n is made by combining two complete crossed hypercubes CQ n and CQ n¿m for 1¿m¿n. Several topological properties of CI n¿m n are analyzed. In particular, accurate mean internode distance formulas of both CQ n and CI n¿m n are given. Compared with the incomplete enhanced hypercube EI n¿m n , CI n¿m n has shorter mean internode distance for large n. An optimal routing algorithm for CI n¿m n is also described which guarantees the generation of a shortest path from a node to another in CI n¿m n .
The Research for Embedded Active Database Based on ECA Rule and Implementation in SQLite Database
Authors: Kaiyin Huang, Pengfei Chen, Yi Chen, Weiguo Song, Xiaoyun Chen
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

As a new direction for database technology, active database is applied to a variety of management information system (MIS) because of its features of activity, speediness and intelligence. This paper proposes an active event detection algorithm of time event based on the analysis of active database theory. Furthermore, we design the storage structure of ECA rule library and the architecture of ECA mediator for the embedded database SQLite, and apply it in the fixed assets management system. Finally, aiming to the weakness of security of SQLite database, we design and implement the audit trigger. This scheme satisfies the active needs of system.
Architecture Meets Agility
Authors: Hakan Erdogmus
Venue: IEEE Software (2009)

The concept of architecture has a major role to play in expanding the traditional scope of agile software development.
Topology Inference in Wireless Mesh Networks
Authors: Kai Xing, Xiuzhen Cheng, Dechang Chen, David Hung-Chang Du
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

In this paper, we tackle the problem of topology inference in wireless mesh networks and present a novel approach to reconstructing the logical network topology. Our approach is based on the social fingerprint, a short bit pattern computed for each node to characterize the link status of the local neighborhood of the node. To conserve the communication resource, social fingerprints are piggybacked to the gateway with a small probability. Based on the information embedded in the social fingerprints, the gateway first estimates the set of parameters defining a Hidden Markov Model (HMM) that models the logical network topology, then infers the evolutions of the local and global network topologies. We have conducted extensive simulation to verify the performance of our approach in terms of "completeness" and "accuracy". The results indicate that our approach is very effective in topology inference.
Polysemy in verbs: systematic relations between senses and their effect on annotation
Authors: Anna Rumshisky, Olga Batiukova
Venue: Proceedings of the Workshop on Human Judgements in Computational Linguistics (2008)

Sense inventories for polysemous predicates are often comprised by a number of related senses. In this paper, we examine different types of relations within sense inventories and give a qualitative analysis of the effects they have on decisions made by the annotators and annotator error. We also discuss some common traps and pitfalls in design of sense inventories. We use the data set developed specifically for the task of annotating sense distinctions dependent predominantly on semantics of the arguments and only to a lesser extent on syntactic frame.