ppxscal/embedding_network huggingface dataset:
Toward a multi-culture adaptive virtual tour guide agent with a modular approach
Authors: Hung-Hsuan Huang, Aleksandra Cerekovic, Igor S. Pandzic, Yukiko Nakano, Toyoaki Nishida
Venue: AI Society (2009)

Embodied conversational agents (ECAs) are computer-generated, human-like characters that interact with human users in face-to-face conversations. ECA is a powerful tool for representing cultural differences and is suitable for interactive training or edutainment systems. This article presents preliminary results from the development of a culture-adaptive virtual tour guide agent for serving Japanese, Croatian, and general Western users by displaying appropriate verbal and non-verbal behaviors. It is being implemented in Generic ECA Framework, a modular framework for developing ECAs. Dividing the ECA functions into reusable and loosely coupled modules minimizes the effort required to implement additional behavior and facilitates incremental scale up of the system.
A Graph Based Data Model for Graphics Interpretation
Authors: Endre Katona
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as higher level processing. To improve algorithmic efficiency, spatial indexing can be applied. Implementation aspects are discussed as well. An earlier version of the DG model has been applied for interpretation of Hungarian cadastral maps. Although this paper gives examples of map interpretation, our concept can be extended to other fields of graphics recognition.
Recognition of Simple 3D Geometrical Objects under Partial Occlusion
Authors: Alexandra Barchunova, Gerald Sommer
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

In this paper we present a novel procedure for contour-based recognition of partially occluded three-dimensional objects. In our approach we use images of real and rendered objects whose contours have been deformed by a restricted change of the viewpoint. The preparatory part consists of contour extraction, preprocessing, local structure analysis and feature extraction. The main part deals with an extended construction and functionality of the classifier ensemble Adaptive Occlusion Classifier (AOC). It relies on a hierarchical fragmenting algorithm to perform a local structure analysis which is essential when dealing with occlusions. In the experimental part of this paper we present classification results for five classes of simple geometrical figures: prism, cylinder, half cylinder, a cube, and a bridge. We compare classification results for three classical feature extractors: Fourier descriptors, pseudo Zernike and Zernike moments. 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
Introducing Motivations in Design Pattern Representation
Authors: Luca Sabatucci, Massimo Cossentino, Angelo Susi
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

Design pattern formalization is aimed at encouraging the use of design patterns during the design phase. Many approaches focuses on providing solutions with a graphical notation and complementary text, typically composed by a static and a dynamic definitions. The weak point is the lack of flexibility when customizing the generic solution to the specific context of use. This paper proposes a criterion to motivate design pattern selection and reuse. Designer is supported with a technique for balancing pattern and context forces for selecting among alternative implementations. The provided representation summarizes and organizes relevant information in the classical informal pattern documentation.
A Generalization of Semenov's Theorem to Automata over Real Numbers
Authors: Bernard Boigelot, Julien Brusten, Jérôme Leroux
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are used, in particular, as symbolic data structures for representing sets definable in the first-order theory ¿¿, ¿, + , ≤ ¿, i.e., the mixed additive arithmetic of integer and real variables. They also lead to a simple decision procedure for this arithmetic.In previous work, it has been established that the sets definable in ¿¿, ¿, + , ≤ ¿ can be handled by a restricted form of infinite-word automata, weak deterministic ones, regardless of the chosen numeration base. In this paper, we address the reciprocal property, proving that the sets of vectors that are simultaneously recognizable in all bases, by either weak deterministic or Muller automata, are those definable in ¿¿, ¿, + , ≤ ¿. This result can be seen as a generalization to the mixed integer and real domain of Semenov's theorem, which characterizes the sets of integer vectors recognizable by finite automata in multiple bases. It also extends to multidimensional vectors a similar property recently established for sets of numbers.As an additional contribution, the techniques used for obtaining our main result lead to valuable insight into the internal structure of automata recognizing sets of vectors definable in ¿¿, ¿, + , ≤ ¿. This structure might be exploited in order to improve the efficiency of representation systems and decision procedures for this arithmetic.
Creating Transformations for Matrix Obfuscation
Authors: Stephen Drape, Irina Voiculescu
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

There are many programming situations where it would be convenient to conceal the meaning of code, or the meaning of certain variables. This can be achieved through program transformations which are grouped under the term obfuscation. Obfuscation is one of a number of techniques that can be employed to protect sensitive areas of code. This paper presents obfuscation methods for the purpose of concealing the meaning of matrices by changing the pattern of the elements.We give two separate methods: one which, through splitting a matrix, changes its size and shape, and one which, through a change of basis in a ring of polynomials, changes the values of the matrix and any patterns formed by these. Furthermore, the paper illustrates how matrices can be used in order to obfuscate a scalar value. This is an improvement on previous methods for matrix obfuscation because we will provide a range of techniques which can be used in concert.This paper considers obfuscations as data refinements. Thus we consider obfuscations at a more abstract level without worrying about implementation issues. For our obfuscations, we can construct proofs of correctness easily. We show how the refinement approach enables us to generalise and combine existing obfuscations. We then evaluate our methods by considering how our obfuscations perform under certain relevant program analysis-based attacks.
WSC-2009: A Quality of Service-Oriented Web Services Challenge
Authors: Srividya Kona, Ajay Bansal, M. Brian Blake, Steffen Bleul, Thomas Weise
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

With the growing acceptance of service-oriented computing, an emerging area of research is the investigation of technologies that will enable the discovery and composition of web services. The Web Services Challenge (WSC) is a forum where academic and industry researchers can share experiences of developing tools that automate the integration of web services. In the fifth year (i.e. WSC-09) of the Web Services Challenge, software platforms will address several new composition challenges. Requests and results will be transmitted within SOAP messages. Semantics will be represented as ontologies written in OWL, services will be represented in WSDL, and service orchestrations will be represented in WSBPEL. In addition, non-functional properties (Quality of Service) of a service will be represented using WSLA format.
Facial Expression Recognition Techniques Using Constructive Feedforward Neural Networks and K-Means Algorithm
Authors: Liying Ma
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

In this paper two facial expression recognition (FER) techniques are proposed. Lower-frequency 2-D DCT coefficients of binarized edge images are utilized in both methods as features for recognition. The first approach uses a constructive one-hidden-layer (OHL) feedforward neural network (OHL-NN) and the second approach is based on the K-means algorithm as classifiers. The 2-D DCT is used to compress the binarized edge images to capture the important features for recognition. Facial expression "neutral" is regarded as a subject of recognition in addition to two other expressions, "smile" and "surprise". The two proposed recognition techniques are applied to two databases which contain 2-D front face images of 60 men (database (a)) and 60 women (database (b)), respectively. Experimental results reveal that the proposed two techniques yield performances that are comparable to or better than that of two other recognition methods using vector matching and fixed-size BP-based NNs, respectively. The first proposed method yields testing recognition rates as high as 100% and 95%, and the second one achieves as high as 100% and 98.33%, for databases (a) and (b), respectively. 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
Use of Compliant Actuators in Robotic Applications
Authors: Dirk Lefeber
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

In industrial robotics - accurate - positioning of manipulators or end effectors is by far the most common application. The system is designed to meet the high mechanical stiffness and high feedback gains required, which improves the accuracy, the stability and the bandwidth of the position control. A typical DC-drive with gearbox and conventional feedback control often suits this purpose. New robotic technologies emerge, however, in which accurate positioning or trajectory tracking is not the primary design goal or unable to compensate for the many drawbacks- from this different point of view - that comes along with conventional electrical actuators, like high reflective inertia, high stiffness, low force-to-weight ratio. These new robotic applications can strongly benefit from compliant actuator technology.
An efficient combination of digital predistortion and OFDM clipping for power amplifiers
Authors: Pere L. Gilabert, Michael E. Gadringer, Gabriel Montoro, Markus L. Mayer, Daniel D. Silveira, Eduard Bertran, Gottfried Magerl
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2009)

This article presents a strategy for enhancing efficiency in power amplifiers (PAs) by combining digital predistortion (DPD) linearization and clipping strategies for orthogonal frequency division multiplexing signals in a WiMAX scenario. On the one hand, by reducing the peak-to-average power ratio of multicarrier signals using the well-known clipping technique, it is possible to perform a more efficient PA amplification. On the other hand, nonlinear and linear distortion introduced by the PA operating close to saturation is compensated by the baseband adaptive DPD linearizer. The DPD has to counteract not only the PA nonlinear behavior, but also its dynamics. A test-bench implementing a WiMAX transmitter was deployed to evaluate the possibilities for enhancing power efficiency while fulfilling the demanded linearity requirements. Experimental results showing the power efficiency and linearity enhancement achieved by the proposed strategy are provided. &copy; 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.
Developing an Arabic treebank: methods, guidelines, procedures, and tools
Authors: Mohamed Maamouri, Ann Bies
Venue: Proceedings of the Workshop on Computational Approaches to Arabic Script-based Languages (2004)

In this paper we address the following questions from our experience of the last two and a half years in developing a large-scale corpus of Arabic text annotated for morphological information, part-of-speech, English gloss, and syntactic structure: (a) How did we 'leapfrog' through the stumbling blocks of both methodology and training in setting up the Penn Arabic Treebank (ATB) annotation? (b) How did we reconcile the Penn Treebank annotation principles and practices with the Modern Standard Arabic (MSA) traditional and more recent grammatical concepts? (c) What are the current issues and nagging problems? (d) What has been achieved and what are our future expectations?
The Earning Management of the Chemical Industry in the Antidumping Investigation---Empirical Data from China Listed Company
Authors: Xu Xuexia
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

With the integration of global economy, import anti-dumping cases soared, particularly gathered in the chemical industry. In anti-dumping investigations of western enterprises, lower adjustment of earnings in the report period is very common to pursue political protection. In order to verify whether there was downward earnings management in anti-dumping investigations in China's chemical enterprises, this paper selected 14 listed companies as the samples, which legally registered for the status claimed as the anti-dumping suits before the end of 2006. By using the Deangelo Model, the yearly Manipulation of the accrued profits were measured (the period was of the three years before and after the suits of the sampled companies were registered), and then to do T-value testing and analyzing. The results show that there is no downward earnings management in the anti-dumping investigation periods in the listed companies of the chemical industry.
On Containment of Conjunctive Queries with Negation
Authors: Victor Felea
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the necessary conditions use maximal cliques from the graphs associated to the first query. These necessary conditions improve the algorithms for the containment problem. For a class of queries a necessary and sufficient condition for containment problem is specified. Some aspects of time complexity for the conditions are discussed.
BlackBerry For Dummies, 3rd edition
Authors: Robert Kao, Dante Sarigumba
Venue: For Dummies (2009)

The BlackBerry is such a valuable tool, even the President is using one! Whether youve just bought your first BlackBerry or you want to get up to speed on the new models, BlackBerry For Dummies, 3rd Edition shows you how to use every fantastic feature. Packed with information to help you make the most of this amazing device, BlackBerry For Dummies explains how to send and receive e-mail and instant messages, surf the Web, take photos, make phone calls, play music, and organize your life, right from the palm of your hand. Find out how to: Get up to speed on the latest features of your BlackBerry, including Storm, Curve, Bold, Pearl Flip, and Javelin models Navigate the display screen and use the trackball, your BlackBerrys keyboard, and shortcuts Manage your appointments, keep your calendar, and handle your to-do list Use e-mail, SMS text messaging, and instant messaging, and even receive faxes Take photos, record video, and sync your BlackBerry with iTunes Back up your BlackBerry, arrange automated backups, maintain your battery, and protect your information with secure passwords Use your BlackBerry GPS Learn about the BlackBerry browser and bookmark and organize your favorite Web sites Add cool lifestyle applications and enjoy games on your BlackBerry The more you know about your BlackBerry, the more youll decide its indispensable. BlackBerry For Dummies, 3rd Edition tells you everything you need to know, the fun and easy way!
Improving peer connectivity in wide-area overlays of virtual workstations
Authors: Arijit Ganguly, P. Oscar Boykin, David I. Wolinsky, Renato J. Figueiredo
Venue: Cluster Computing (2009)

Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized hole-punching to establish bi-directional communication links among nodes behind network address translators, and dynamic configuration of virtual IP addresses. Our experiences with deployments of virtual networks in support of wide-area overlays of virtual workstations (WOWs) reveal that connectivity constraints imposed by symmetric NATs and by Internet route outages often hinder P2P overlay structure maintenance and routability, subsequently limiting the ability of WOWs to deliver high-throughput computing through aggregation of resources in different domains.In this paper, we describe and evaluate two novel approaches which are generally applicable and fully decentralized, and show that they improve routability of structured P2P networks in such connectivity constrained environments: (1) a fault-tolerant routing algorithm based on simulated annealing from optimization theory, and (2) tunneling of connections between adjacent nodes (in the P2P identifier space) over common neighbors when direct communication is not possible. Simulation-based analyses show that (1) when pairs of nodes only have 70% chance of being able to communicate directly, the described approaches improve all-to-all routability of the network from 90% to 99%, and (2) even when only 70% of the nodes are behind NATs that include symmetric NATs, these techniques improve the all-to-all connectivity of the network from less than 95% to more than 99%. We have implemented these techniques in the IP-over-P2P (IPOP) virtual network and have conducted experiments with a 180-node WOW Condor pool, demonstrating that, at 81% probability of establishing a pair-wise connection, annealing and tunneling combined allow all nodes to be connected to the pool, compared to only 160 nodes in the absence of these techniques.
Potential and Challenges of Body Area Networks for Affective Human Computer Interaction
Authors: Julien Penders, Bernard Grundlehner, Ruud Vullers, Bert Gyselinckx
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

The Human++ program aims at achieving highly miniaturized, wireless, intelligent and autonomous body sensor nodes to assist our health, comfort and lifestyle. In this paper the concept of body area network is applied to wireless monitoring of emotions, thus opening a new, affective, dimension in human computer interaction. A prototype body area network targeting the monitoring of physiological responses from the autonomous system is introduced, and tested for the classification of discrete emotions. Using data fusion and regression analysis, we show that the wireless physiological data can be mapped in real-time to an estimation of an individual's arousal level. Results in a controlled environment are presented, and specific challenges that need to be overcome for a widespread use of the technology are discussed. Finally, we show how advances in micro-power generation devices may lead to fully autonomous systems in the future.
Short Term Load Forecasting (STLF) Using Artificial Neural Network Based Multiple Lags of Time Series
Authors: Mohd Hafez Harun, Muhammad Murtadha Othman, Ismail Musirin
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This paper presents the artificial neural network (ANN) that used to perform the short-term load forecasting (STLF). The input data of ANN is comprises of multiple lags of hourly peak load. Hence, imperative information regarding to the movement patterns of a time series can be obtained based on the multiple time lags of chronological hourly peak load. This may assist towards the improvement of ANN in forecasting the hourly peak loads. The Levenberg-Marquardt optimization technique is used as a back propagation algorithm for the ANN. The Malaysian hourly peak loads are used as a case study in the estimation of STLF using ANN. The results have shown that the proposed technique is robust in forecasting the future hourly peak loads with less error.
Sonar-based measurement of user presence and attention
Authors: Stephen P. Tarzia, Robert P. Dick, Peter A. Dinda, Gokhan Memik
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

We describe a technique to detect the presence of computer users. This technique relies on sonar using hardware that already exists on commodity laptop computers and other electronic devices. It leverages the fact that human bodies have a different effect on sound waves than air and other objects. We conducted a user study in which 20 volunteers used a computer equipped with our ultrasonic sonar software. Our results show that it is possible to detect the presence or absence of users with near perfect accuracy after only ten seconds of measurement. We find that this technique can differentiate varied user positions and actions, opening the possibility of future use in estimating attention level.
Aligning Bayesian Network Classifiers with Medical Contexts
Authors: Linda C. Gaag, Silja Renooij, Ad Feelders, Arend Groote, Marinus J. Eijkemans, Frank J. Broekmans, Bart C. Fauser
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

While for many problems in medicine classification models are being developed, Bayesian network classifiers do not seem to have become as widely accepted within the medical community as logistic regression models. We compare first-order logistic regression and naive Bayesian classification in the domain of reproductive medicine and demonstrate that the two techniques can result in models of comparable performance. For Bayesian network classifiers to become more widely accepted within the medical community, we feel that they should be better aligned with their context of application. We describe how to incorporate well-known concepts of clinical relevance in the process of constructing and evaluating Bayesian network classifiers to achieve such an alignment.