ppxscal/embedding_network huggingface dataset:
Detecting Affect from Non-stylised Body Motions
Authors: Daniel Bernhardt, Peter Robinson
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

In this paper we present a novel framework for analysing non-stylised motion in order to detect implicitly communicated affect. Our approach makes use of a segmentation technique which can divide complex motions into a set of automatically derived motion primitives. The parsed motion is then analysed in terms of dynamic features which are shown to encode affective information. In order to adapt our algorithm to personal movement idiosyncrasies we developed a new approach for deriving unbiased motion features. We have evaluated our approach using a comprehensive database of affectively performed motions. The results show that removing personal movement bias can have a significant benefit for automated affect recognition from body motion. The resulting recognition rate is similar to that of humans who took part in a comparable psychological experiment.
Manifold Construction by Local Neighborhood Preservation
Authors: Cheng-Yuan Liou, Wei-Chen Cheng
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

This work presents a neighborhood preservation method to construct the latent manifold. This manifold preserves the relative Euclidean distances among neighboring data points. Its computation cost is close to the linear algorithm and its performance in preserving the local relationships is promising when we compared it with the methods, LLE and Isomap.
Collective-Based Multiagent Coordination: A Case Study
Authors: Matteo Vasirani, Sascha Ossowski
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

In this paper we evaluate Probability Collectives (PC) as a framework for the coordination of collectives of agents. PC allows for efficient multiagent coordination without the need of explicit acquaintance models. We selected Distributed Constraint Satisfaction as case study to evaluate the PC approach for the well-known 8-Queens problem. Two different architectural structures have been implemented, one centralized and one decentralized. We have also compared between the decentralized version of PC and ADOPT, the state of the art in distributed constraint satisfaction algorithms.
Creating Rapport with Virtual Agents
Authors: Jonathan Gratch, Ning Wang, Jillian Gerten, Edward Fast, Robin Duffy
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

Recent research has established the potential for virtual characters to establish rapport with humans through simple contingent nonverbal behaviors. We hypothesized that the contingency, not just the frequency of positive feedback is crucial when it comes to creating rapport. The primary goal in this study was evaluative: can an agent generate behavior that engenders feelings of rapport in human speakers and how does this compare to human generated feedback? A secondary goal was to answer the question: Is contingency (as opposed to frequency) of agent feedback crucial when it comes to creating feelings of rapport? Results suggest that contingency matters when it comes to creating rapport and that agent generated behavior was as good as human listeners in creating rapport. A "virtual human listener" condition performed worse than other conditions.
From the Editor: Clueless--and Oblivious
Authors: Warren Harrison
Venue: IEEE Software (2004)

Software organizations look at their own achievements in different ways depending on how much they actually know. In other words, people (and organizations) that aren't too good at what they do often don't realize it by virtue of the fact that they aren't too good at what they do. Warren Harrison ties the findings from psychology research to the software development world. 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
Online estimation of electric arc furnace tap temperature by using fuzzy neural networks
Authors: José Manuel Mesa Fernández, Valeriano Álvarez Cabal, Vicente Rodríguez Montequin, Joaquín Villanueva Balsera
Venue: Engineering Applications of Artificial Intelligence (2008)

Industrial factories require continuous analysis and reengineering over its production processes but always keeping a severe control of material costs and operation emissions. In the past electric steel mills have been subject of some operation models developed in order to improve the control of the arc furnace by means of mathematical techniques and, later on, with finite elements technique (FEM). However, these models have not reached the expected results and applicability. In this case, a model has been developed that allows improving the control through a better prediction of the final temperature and, as consequence, to reduce the consumption of energy in the electric arc furnace. Required information for this new model will be obtained gathering knowledge collected up from data obtained of a certain electric furnace and also considering the plant operators and technicians experience. The model has been constructed by using neural networks as classifier, and with a final fuzzy inference function to return a predicted temperature value.
Getting Formal Verification into Design Flow
Authors: Arvind, Nirav Dave, Michael Katelman
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

The ultimate goal of formal methods is to provide assurances about the quality, performance, security, etc. of systems. While formal tools have advanced greatly over the past two decades, widespread proliferation has not yet occurred, and the full impact of formal methods is still to be realized. This paper presents some ideas on how to catalyze the growth of formal techniques in day-to-day engineering practice. We draw on our experience as hardware engineers that want to use, and have tried to use, formal methods in our own designs. The points we make have probably been made before. However we illustrate each one with concrete designs. Our examples support three major themes: (1) correctness depends highly on the application and even a collection of formal methods cannot handle the whole problem; (2) high-level design languages can facilitate the interaction between design and formal methods; and (3) formal method tools should be presented as integrated debugging aids as opposed to one requiring mastering a foreign language or esoteric concepts.
A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
Authors: Honggang Hu, Guang Gong
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

In this paper, we study the randomness properties of sequences generated by a function via the additive order. We derive some conditions under which such sequences have the maximum period. The autocorrelation is also studied. For the case of large p, nontrivial upper bounds are given; for the binary case, experimental results show that the autocorrelation of two types of sequences is small compared with the period of sequences.
Routing to reduce the cost of wavelength conversion
Authors: Thomas Erlebach, Stamatis Stefanakos
Venue: Discrete Applied Mathematics (2008)

We consider all-optical networks that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their capacity usage. We investigate the effect of allowing reroutings on the number of necessary wavelength converters. We disprove a claim of Wilfong and Winkler [G. Wilfong, P. Winkler, Ring routing and wavelength translation, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '98, 1998, pp. 333-341] according to which reroutings do not have any effect on the number of necessary wavelength converters on bidirected networks. We show that there exist (bidirected) networks on n nodes that require @Q(n) converters without reroutings, but only O(1) converters if reroutings are allowed. We also address the cases of undirected networks and networks with shortest-path routings. In each case, we resolve the complexity of computing optimal placements of converters.
To Have or to Be? Possessing Data Versus Being in a State --- Two Different Intuitive Concepts Used in Informatics
Authors: Michael Weigend
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

In computer programming it is sometimes helpful to start with the definition of a state transition diagram (finite state automaton), which describes on a rather abstract level but in an intuitive way how the system is supposed to react to events in certain situations. The reaction is dependent on the internal state of the running program. The concept of being in a state differs fundamentally from the concept of data storage or data possession usually associated to variables or object attributes. Thus there are certain cognitive difficulties to overcome, when creating a program on the basis of a state transition diagram. 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
Modelling personnel within a defence logistics maintenance process
Authors: Guy Edward Gallasch, Benjamin Francis, Christopher Moon, Jonathan Billington
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In a military deployment, the operational availability of deployed equipment will be affected by many factors including equipment usage rates, sparing policy, and importantly the composition and distribution of maintenance personnel. In this paper, we present a Coloured Petri Net model that captures the potentially complex defence logistics maintenance process that links these factors together. We simulate this model with the CPN Tools simulator and identify a number of simulation performance concerns related to the incorporation of personnel in the model. A number of alternative models of personnel are evaluated in an attempt to attain a level of simulation performance from CPN Tools that is acceptable for business reviews and headquarter operations planning. Finally, we present some directions for future investigation to improve simulation performance further.
Cryptography Based on Quadratic Forms: Complexity Considerations
Authors: Rupert J. Hartung
Venue: Research in Cryptology: Second Western European Workshop, WEWoRC 2007, Bochum, Germany, July 4-6, 2007, Revised Selected Papers (2008)

We study the computational problem Trafo of finding an integral equivalence transform between two given quadratic forms. This is motivated by a recent identification scheme based on this problem [10]. We prove that for indefinite forms over ¿, its hardness is concentrated in dimensions 3 and 4. Moreover, over the field of rational numbers the complexity of Trafo is closely related to that of factoring. However, for definite forms over ¿, as well as for forms over finite fields, the transformation problem is solvable in polynomial time. 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
From Silicon to Science: The Long Road to Production Reconfigurable Supercomputing
Authors: Keith Underwood
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

Over the last several years, multiple vendors have introduced systems that integrate FPGAs, as well as other types of accelerators, into machines intended for general purpose supercomputing. However, these machines have not broadly penetrated production scientific computing at any of the world's top supercomputing centers. With the excitement around accelerators and the numerous examples of their potential, why haven't they achieved widespread adoption in production supercomputing? This talk will discuss several barriers to adoption based on input from people who buy supercomputers and from people who use them. The short answer is that FPGA enhanced supercomputers look very little like traditional supercomputers and the performance advantage for scientific applications is often not as compelling as advertised. This talk will attempt to map barriers to adoption to specific research challenges that must be addressed to see widespread usage of FPGAs for scientific computing. These challenges include everything from the lowest level of circuit design to the programming of applications, and point to a lot of work between the current state of the art and widespread adoption of reconfigurable computing.
More Accurate Student Modeling through Contextual Estimation of Slip and Guess Probabilities in Bayesian Knowledge Tracing
Authors: Ryan S. Baker, Albert T. Corbett, Vincent Aleven
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Modeling students' knowledge is a fundamental part of intelligent tutoring systems. One of the most popular methods for estimating students' knowledge is Corbett and Anderson's [6] Bayesian Knowledge Tracing model. The model uses four parameters per skill, fit using student performance data, to relate performance to learning. Beck [1] showed that existing methods for determining these parameters are prone to the Identifiability Problem: the same performance data can be fit equally well by different parameters, with different implications on system behavior. Beck offered a solution based on Dirichlet Priors [1], but, we show this solution is vulnerable to a different problem, Model Degeneracy, where parameter values violate the model's conceptual meaning (such as a student being more likely to get a correct answer if he/she does not know a skill than if he/she does).We offer a new method for instantiating Bayesian Knowledge Tracing, using machine learning to make contextual estimations of the probability that a student has guessed or slipped. This method is no more prone to problems with Identifiability than Beck's solution, has less Model Degeneracy than competing approaches, and fits student performance data better than prior methods. Thus, it allows for more accurate and reliable student modeling in ITSs that use knowledge tracing.
Guest Editors' Introduction: Ad Hoc Networks
Authors: Jie Wu, Ivan Stojmenovic
Venue: Computer (2004)

Recent developments offer potential solutions to problems encountered in ad hoc networks including topology control, data communication, and service access.
Computing entries of the inverse of a sparse matrix using the FIND algorithm
Authors: S. Li, S. Ahmed, G. Klimeck, E. Darve
Venue: Journal of Computational Physics (2008)

An accurate and efficient algorithm, called fast inverse using nested dissection (FIND), for computing non-equilibrium Green's functions (NEGF) for nanoscale transistors has been developed and applied in the simulation of a novel dual-gate metal-oxide-semiconductor field-effect transistor (MOSFET) device structure. The method is based on the algorithm of nested dissection. A graph of the matrix is constructed and decomposed using a tree structure. An upward and downward traversal of the tree yields significant performance improvements for both the speed and memory requirements, compared to the current state-of-the-art recursive methods for NEGF. This algorithm is quite general and can be applied to any problem where certain entries of the inverse of a sparse matrix (e.g., its diagonal entries, the first row or column, etc.) need to be computed. As such it is applicable to the calculation of the Green's function of partial differential equations. FIND is applicable even when complex boundary conditions are used, for example non reflecting boundary conditions.
Performance Monitoring of Closed-Loop Controlled Systems Using dFasArt
Authors: Jose Manuel Cano-Izquierdo, Julio Ibarrola, Miguel Almonacid
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

This paper analyzes the behaviour of closed-loop controlled systems. Starting from the measured data, the aim is to establish a classification of the system operation states. Digital Signal Processing is used to represent temporal signal with spatial patterns. A neuro-fuzzy scheme (dFasArt) is proposed to classify these patterns, in an on-line way, characterizing the state of controller performance. A real scale plant has been used to carry out several experiments with good results.
Developing Ontologies for Collaborative Engineering in Mechatronics
Authors: Violeta Damjanović, Wernher Behrendt, Manuela Plößnig, Merlin Holzapfel
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Creating a coherent set of ontologies to support a collaborative design process amongst different firms which develop mechatronic products is a challenge due to the semantic heterogeneity of the underlying domain models and the amount of domain knowledge that needs to be covered. We tackle the problem of semantic heterogeneity by employing the DOLCE foundational ontology and by aligning our models to it. We approach the problem of scale, i.e. the amount of knowledge modeled by keeping the models at a descriptive level which is still granular enough to connect them with domain and task specific engineering tools. In order to manage the complexity of the modeling task we separate the models into the foundational layer, the mechatronic layer consisting of three domain ontologies, one process model and one cross-domain model, and the collaborative application layer. For the development process, we employ a methodology for dynamic ontology creation, which moves from taxonomical structures to formal models.
Search Techniques for Rational Polynomial Orders
Authors: Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl, Salvador Lucas, Peter Schneider-Kamp
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interpretations with polynomials over the naturals. But recently, it was shown that interpretations with polynomials over the rationals can be significantly more powerful. However, searching for such interpretations is considerably more difficult than for natural polynomials. Moreover, while there exist highly efficient SAT-based techniques for finding natural polynomials, no such techniques had been developed for rational polynomials yet. In this paper, we tackle the two main problems when applying rational polynomial interpretations in practice: (1) We develop new criteria to decide when to use rational instead of natural polynomial interpretations. (2) Afterwards, we present SAT-based methods for finding rational polynomial interpretations and evaluate them empirically.
Designing Engaging Interaction with Contextual Patterns for an Educational Game
Authors: Chien-Sing Lee
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This paper aims to address two problems. The first problem is how to develop engaging (deep and meaningful) pedagogical patterns and still ensure there is sufficient incremental cognitive complexity. The second problem deals with how to connect pedagogical patterns to HCI and software engineering to form a systemic interaction design framework. An educational game is used as an example. Significance of the study lies in the development of a means to create interaction designs around design-for-engagement requirements and the flexible scaling and synergy of different frames of reference (pedagogy-application domain-HCI- software engineering) through instantiations from the synergised patterns; reducing error and cost and encouraging new experimentations with transfer of engaging learning.
Adjoint EKF learning in recurrent neural networks for nonlinear active noise control
Authors: Riyanto T. Bambang
Venue: Applied Soft Computing (2008)

In this paper, active noise control using recurrent neural networks is addressed. A new learning algorithm for recurrent neural networks based on Adjoint Extended Kalman Filter is developed for active noise control. The overall control structure for active noise control is constructed using two recurrent neural networks: the first neural network is used to model secondary path of active noise control while the second one is employed to generate control signal. Real-time experiment of the proposed algorithm using digital signal processor is carried-out to show the effectiveness of the method.
Revisiting the Efficiency of Malicious Two-Party Computation
Authors: David P. Woodruff
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this problem, such as zero-knowledge compilation, more efficient. The authors provide several schemes which are the most efficient to date. We propose a modification to their main scheme using expanders. Our modification asymptotically improves at least one measure of efficiency of all known schemes. We also point out an error, and improve the analysis of one of their schemes.
Feature Extraction Using Low-Rank Approximations of the Kernel Matrix
Authors: A. R. Teixeira, A. M. Tomé, E. W. Lang
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

In this work we use kernel subspace techniques to perform feature extraction. The projections of the data onto the coordinates of the high-dimensional space created by the kernel function are called features. The basis vectors to project the data depend on the eigendecomposition of the kernel matrix which might become very high-dimensional in case of a large training set. Nevertheless only the largest eigenvalues and corresponding eigenvectors are used to extract relevant features. In this work, we present low-rank approximations to the kernel matrix based on the Nyström method. Numerical simulations will then be used to demonstrate the Nyström extension method applied to feature extraction and classification. The performance of the presented methods is demonstrated using the USPS data set.