ppxscal/embedding_network huggingface dataset:
Closed-loop DMM calibration
Authors: Vladislav Slavov, Tasho Tashev
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

In this paper we describe the structure of the closed-loop DMM calibration in order to represent the creation of automated DMM calibration system. The problem shown here exists and concerns an accredited laboratory. The purpose is the making faster and easier the calibration process without loosing accuracy.
High Performance Implementation of Binomial Option Pricing
Authors: Mohammad Zubair, Ravi Mukkamala
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

An option contract is a financial instrument that gives right to its holder to buy or sell a financial asset at a specified price, referred to as strike price, on or before the expiry date. Determining the value of an option contract with high accuracy is a computationally intensive task. Earlier implementations of binomial model on a parallel computer have a big gap between the realized performance and the peak performance of the parallel computer. This is mainly due to the implementation not considering the memory hierarchy available in today's computers. We propose two algorithms based on a hierarchical model of memory that maximize locality for data access. We implement these algorithms on a single processor and a shared memory multiprocessor. The proposed algorithms outperform the earlier reported algorithms by a factor of 20 on uniprocessor; and the speedup varies from 5 to 7.4 on a Sun SMP.
Affective Human-Robotic Interaction
Authors: Christian Jones, Andrew Deeming
Venue: Affect and Emotion in Human-Computer Interaction: From Theory to Applications (2008)

Entertainment robots are becoming commonplace in the home. Users are less fearful of interacting with robotic systems however these interactions are often limited to performing pre-recording sequences of actions. The next generation of consumer-level entertainment robots should offer more natural interfacing and more engaging interaction. This paper reports on the development and evaluation of a consumer-level robotic dog with acoustic emotion recognition capabilities. The dog can recognise the emotional state of it's owner from affective cues in the owner's speech and respond with appropriate actions. The evaluation study shows that users can recognise the new robotic dog to be emotionally intelligent and report that this makes the dog appear more `alive'.
Behavioural Skeletons Meeting Services
Authors: M. Danelutto, G. Zoppi
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Behavioural skeletons have been introduced as a suitable way to model autonomic management of parallel, distributed (grid) applications. A behavioural skeleton is basically a skeleton with an associated autonomic manager taking care of non-functional issues related to skeleton implementation. Here we discuss an implementation of a task farm behavioural skeleton exploiting SCA, the Service Component Architecture recently introduced by IBM. This implementation is meant to provide plain service/SCA users some efficient skeleton modelling common parallel application pattern and also to investigate the advantages and the problems relative to skeletons in the service world. Experimental results are eventually discussed.
Applying Query Expansion Techniques to Ad Hoc Monolingual Tasks with the IR-n System
Authors: Elisa Noguera, Fernando Llopis
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The paper describes our participation in the Monolingual tasks at CLEF 2007. We submitted results for the following languages: Hungarian, Bulgarian and Czech. We focused on studying different query expansion techniques: Probabilistic Relevance Feedback (PRF) and Mutual Information Relevance Feedback (MI-RF) to improve retrieval performance. After an analysis of our experiments and of the official results at CLEF 2007, we achieved considerably improved scores by using query expansion techniques for different languages (Hungarian, Bulgarian and Czech).
Regression diagnostics for complex survey data: identification of influential observations
Authors: Richard Valliant
Venue:  (2007)

Discussion of diagnostics for linear regression models have become indispensable chapters or sections in most of the statistical textbooks. However, survey literature has not given much attention to this problem. Examples from real surveys show that sometimes the inclusion and exclusion of a small number of the sampled units can greatly change the regression parameter estimates, which indicates that techniques of identifying the influential units are necessary. The goal of this research is to extend and adapt the conventional ordinary least squares influence diagnostics to complex survey data, and determine how they should be justified. We assume that an analyst is looking for a linear regression model that fits reasonably well for the bulk of the finite population and chooses to use the survey weighted regression estimator. Diagnostic statistics such as DFBETAS, DFFITS, and modified Cook's Distance are constructed to evaluate the effect on the regression coefficients of deleting a single observation. As components of the diagnostic statistics, the estimated variances of the coefficients are obtained from design-consistent estimators which account for complex design features, e.g. clustering and stratification. For survey data, sample weights, which are computed with the primary goal of estimating finite population statistics, are sources of influence besides the response variable and the predictor variables, and therefore need to be incorporated into influence measurement. The forward search method is also adapted to identify influential observations as a group when there is possible masked effect among the outlying observations. Two case studies and simulations are done in this dissertation to test the performance of the adapted diagnostic statistics. We reach the conclusion that removing the identified influential observations from the model fitting can obtain less biased estimated coefficients. The standard errors of the coefficients may be underestimated since the variation in the number of observations used in the regressions was not accounted for.
Physiologically correct animation of the heart
Authors: Kyoungju Park_lect
Venue: Computer Animation and Virtual Worlds (2008)

Physiologically correct animation of the heart should incorporate non-homogeneous and nonlinear motions of the heart. Therefore, we introduce a methodology that estimates deformations from volume images and utilizes them for animation. Since volume images are acquired at regular slicing intervals, they miss information between slices and recover deformation on the slices. Therefore, the estimated finite element models (FEMs) result in coarse meshes with chunk elements the sizes of which depend on the slice intervals. Thus, we introduce a method of generating a detailed model using implicit surfaces and transferring a deformation from a FEM to implicit surfaces. An implicit surface heart model is reconstructed using contour data points and then cross-parameterized to the heart FEM, the time-varying deformation of which has been estimated by tracking the insights of the heart wall. The implicit surface heart models are composed of four heart walls that are blended into one model. A correspondence map between the source and the target meshes is made using the template fitting method. Deformation coupling transfers the deformation of a coarse heart FEM model to a detailed implicit model by factorizing linear equations. We demonstrate the system and show the resulting deformation of an implicit heart model. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Estimating Human Skeleton Parameters and Configuration in Real-Time from Markered Optical Motion Capture
Authors: Jonathan Cameron, Joan Lasenby
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper is concerned with real-time approaches to using marker-based optical motion capture to identify, parametrize, and estimate the frame by frame configuration of the human skeleton. An overview of the stages of a system is provided with the main emphasis devoted to two new methods for refining the rotation estimates used within the transformational algorithm class of joint parameter estimation methods. Virtual Marker Insertion uses additional markers inserted at the current estimates of joint location to partially enforce the concurrency of available joint location estimates. This simple algorithm is shown to outperform the methods presented in the literature. A conjugate gradient optimization on a minimal parameterization of the standard transformational algorithm cost function gives superior results, but at considerable computational cost, limiting its probable application to those frames which are actually rendered in a feedback system.
Removal of Artifacts in Electroencephalogram Using Adaptive Infomax Algorithm of Blind Source Separation
Authors: Wanyou Guo, Liyu Huang, Li Gao, Tianqiao Zhu, Yuangui Huang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Infomax algorithm is one of the main strategies in blind source separation. The principle and improvement of the algorithm are introduced firstly in this paper. Nineteen-channel Electroencephalograms (EEGs) which include electromyogram, eye-movement and some other artifacts were decomposed by using this algorithm. Afterwards, three kinds of nonlinear parameters were calculated for all the independent components, and artifact components can be identified automatically by threshold settings. Finally, putting all the artifact components into zero, and projecting the other components to the scalp electrodes, then the purer Electroencephalograms can be gained. The study shows that the various artifacts can be separated from the EEGs successfully with the use of adaptive Infomax algorithm and removal of artifacts can be realized by signal reconstruction. Adaptive Infomax algorithm is a potential tool in removal of artifacts in physiological signal.
Plenary lecture III: space extension based extended fluctuationlessness theorem
Authors: Metin Demiralp
Venue: Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics (2008)

Fluctuationlessness Theorem is a recently created very efficient tool for matrix representations. It dictates us that the matrix representation of an algebraic operator which multiplies its argument by a scalar univariate function is identical to the the image of the independent variable's matrix representation over the same space via same basis set, under that univariate function. This helps us to create very rapidly converging univariate numerical integration schemes which can be used in many diversive areas of science and engineering. The multivariate counterpart of this theorem has also been conjectured and proven quite recently. In these theorems, the matrix representations are defined on Hilbert spaces which are defined through certainappropriate inner products. On the other hand, the space extension methods aim at the building of simple structures which can be handled by well-known techniques to get solutions many applied mathematical problems. There the number of unknowns are increased to put the equation to be solved to an amenable form. Quite recently, this method is applied to the solution of ordinary differential equations and a universal form which leads us to use two-term recursions is obtained. This was for linear case. By using same approach in an indirect way via partial differential operators we could be able to deal with a quite large class nonlinear ODEs. This talk is about the extension of two fluctuationlessness theorems for higher accuracy with the aid of space extension.
A Lower Bound on the Capacity of Wireless Ad Hoc Networks with Cooperating Nodes
Authors: Anthony S. Acampora, Louisa Pui Ip
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

In this paper, we consider the effects on network capacity when the nodes of an ad hoc network are allowed to cooperate. These results are then compared to the theoretical upper bound on the capacity of an ad hoc network without cooperation. For our cooperative model, two or more nodes are grouped together to cooperatively transmit information from the source node to the destination node. Here the lower bound is presented without frequency reuse and it is found that node cooperation can only help improve network capacity as the number of nodes in cooperation increases. However, the results of our cooperative network model show that without frequency reuse, node cooperation could not out perform a peer-to-peer network with frequency reuse. Furthermore, the improvement of network capacity might not be worthwhile beyond two nodes cooperating together. The three-node cooperation yields minimum gain, if not negligible, compared to the two-node cooperation.
Chan Location Algorithm Application in 3-Dimension Space Location
Authors: Zhang Jian-wu, Yu Cheng-lei, Tang Bin, Ji Ying-ying
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

Wireless location algorithm based on TOA/TDOA has been researched and compared, and precise ranging technology based on TOA has been analyzed in this paper. In view of the existing location algorithm is always in 2-dimension form, Chan algorithm has been concluded in 3-dimension form and a 3-dimension location method based on TOA is proposed. The method transforms the nonlinear location equation into linear form by using initialization estimation coming from two-step weighed least square, then calculates the location estimation. The method is simple and precise. The simulation about it is given to show its theoretic value.
Boogie Meets Regions: A Verification Experience Report
Authors: Anindya Banerjee, Mike Barnett, David A. Naumann
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

We use region logic specifications to verify several programs exhbiting the classic hard problem for object-oriented systems: the framing of heap updates. We use BoogiePL and its associated SMT solver, Z3, to prove both implementations and client code.
Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses
Authors: Nobuhiro Inuzuka, Yuichi Tomida, Taisuke Izumi, Yoshiaki Katayama, Koichi Wada
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

Systems of autonomous mobile robots have been attracted as distributed systems. Minimal setting for robots to solve some class of problems has been studied with theoretical concerns. This paper contributes discussion on relationship between inaccuracy of compasses which give axes of coordinate systems of robots and the possibility of gathering robots. The gathering problem is to make all robots meet at a single point which is not predefined. The problem has been shown to be solvable for two robots with dynamically variable compasses within the difference of ¿/4 between two robots. This paper improves the limit of difference to ¿/3. This is shown with the fully asynchronous robot model CORDA. Configurations and executions of robot systems for CORDA with dynamic compasses are formalised. In order to deal with behaviors of robots a concept of relative configurations is also introduced.
Validation at a Small Building with the Mutual Complement Network by Wireless and Wired
Authors: Kunihiro Yamada, Kakeru Kimura, Takashi Furumura, Masanori Kojima, Kouji Yoshida, Tadanori Mizuno
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

The "mutual complement network by wireless and wired systems" has been studied for possible application to home network. The evaluation of the mutual complement network in a small-scale building has revealed that the home application is reasonably possible. In this network, the communication performance values of both the wireless and wired systems distribute independently from the other over a wide area in a small-scale building compared with those in a conventional home house. The method of power supply, electrical apparatus used and the building structure are responsible for the results.
Information organization and retrieval using a topic maps-based ontology: Results of a task-based evaluation
Authors: Myongho Yi
Venue: Journal of the American Society for Information Science and Technology (2008)

As information becomes richer and more complex, alternative information-organization methods are needed to more effectively and efficiently retrieve information from various systems, including the Web. The objective of this study is to explore how a Topic Maps-based ontology approach affects users' searching performance. Forty participants participated in a task-based evaluation where two dependent variables, recall and search time, were measured. The results of this study indicate that a Topic Maps-based ontology information retrieval (TOIR) system has a significant and positive effect on both recall and search time, compared to a thesaurus-based information retrieval (TIR) system. These results suggest that the inclusion of a Topic Maps-based ontology is a beneficial approach to take when designing information retrieval systems. &copy; 2008 Wiley Periodicals, Inc.
Hidden type variables and conditional extension for more expressive generic programs
Authors: Assaf J. Kfoury
Venue:  (2008)

Generic object-oriented programming languages combine parametric polymorphism and nominal subtype polymorphism, thereby providing better data abstraction, greater code reuse, and fewer run-time errors. However, most generic object-oriented languages provide a straightforward combination of the two kinds of polymorphism, which prevents the expression of advanced type relationships. Furthermore, most generic object-oriented languages have a type-erasure semantics: instantiations of type parameters are not available at run time, and thus may not be used by type-dependent operations. This dissertation shows that two features, which allow the expression of many advanced type relationships, can be added to a generic object-oriented programming language without type erasure; (1) type variables that are not parameters of the class that declares them, and (2) extension that is dependent on the satisfiability of one or more constraints. We refer to the first feature as hidden type variables and the second feature as conditional extension. Hidden type variables allow: covariance and contravariance without variance annotations or special type arguments such as wildcards; a single type to extend, and inherit methods from, infinitely many instantiations of another type: a limited capacity to augment the set of superclasses after that class is defined; and the omission of redundant type arguments. Conditional extension allows the properties of a collection type to be dependent on the properties of its element type. This dissertation describes the semantics and implementation of hidden type variables and conditional extension. A sound type system is presented. In addition, a sound and terminating type checking algorithm is presented. Although designed for the Fortress programming language, hidden type variables and conditional extension can be incorporated into other generic object-oriented languages. Many of the same problems would arise, and solutions analogous to those we present would apply.
Password Policy Purgatory
Authors: Stephen Farrell
Venue: IEEE Internet Computing (2008)

IT system users, (all of us), and administrators, (increasingly large numbers of us), must all manage some passwords. In this article, the author reviews some issues related to password policies and concludes that managing passwords, in any sensible manner, is becoming more and more of a nuisance for users, a factor that should be to the forefront when administrators are creating password policies.
Explaining eDemocracy development: A quantitative empirical study
Authors: Paul van der Graft, Jörgen Svensson
Venue: Information Polity (2006)

The term eDemocracy refers to the usage of information and communication technology in the democratic process. This usage can vary in form and extent. This paper distinguishes three types of explanations for this variation: explanations based on the suggestion of objective rationalisation, explanations based on political evaluation and discretion and explanations based on the assumption that technology itself is a driving force of institutional change. Taking the case of eDemocracy development in Dutch municipalities, these three types of explanation are subjected to an empirical test. A quantitative analysis leads to the conclusion that the perspective of technology as driving force behind eDemocracy finds most support, and that the rationalisation perspective has some merits as well. There is no evidence, however, that differential political traditions play any significant role in the development of local eDemocracy in the Netherlands.
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
Authors: Ioannis Caragiannis, Gianpiero Monaco
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

In the maximum cover problem, we are given a collection of sets over a ground set of elements and a positive integer w, and we are asked to compute a collection of at most w sets whose union contains the maximum number of elements from the ground set. This is a fundamental combinatorial optimization problem with applications to resource allocation. We study the simplest APX-hard variant of the problem where all sets are of size at most 3 and we present a 6/5-approximation algorithm, improving the previously best known approximation guarantee. Our algorithm is based on the idea of first computing a large packing of disjoint sets of size 3 and then augmenting it by performing simple local improvements.
Inter-block Scoreboard Scheduling in a JIT Compiler for VLIW Processors
Authors: Benoît Dupont De Dinechin
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

We present a postpass instruction scheduling technique suitable for Just-In-Time (JIT) compilers targeted to VLIW processors. Its key features are: reduced compilation time and memory requirements; satisfaction of scheduling constraints along all program paths; and the ability to preserve existing prepass schedules, including software pipelines. This is achieved by combining two ideas: instruction scheduling similar to the dynamic scheduler of an out-of-order superscalar processor; the satisfaction of inter-block scheduling constraints by propagating them across the control-flow graph until fixed-point. We implemented this technique in a Common Language Infrastructure JIT compiler for the ST200 VLIW processors and the ARM processors.
The Growing Self-Organizing Surface Map: Improvements
Authors: Vilson L. DalleMole, Aluizio F. R. Araújo
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

The Growing Self Organizing Surface Map (GSOSM) is a novel map model that learns a 2D surface immersed in a 3D space. The GSOSM model introduces a novel connection learning rule called CCHL. In this paper we present an overview of GSOSM model and its connection learning rule CCHL. The GSOSM dynamic is analyzed and changes are proposed to improve the algorithm performance and time run. The results of the proposed improvements are depicted and discussed.