ppxscal/embedding_network huggingface dataset:
Research of INS Simulation Technique Based on UnderWater Vehicle Motion Model
Authors: Jian-hua Cheng, Yu-shen Li, Jun-yu Shi
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Considering the dynamic error of Platform inertial navigation system （ INS ） caused by vehicle mobile movement, output information of underwater vehicle and input information of INS are deeply analyzed. This paper gives the transform relationship among geographical reference frame, fixed and reference frame which are used to describe movement of underwater vehicle. Then, logical join between vehicle movement output information and INS’s input calculation information are established so that INS can get the navigation system close to actual underwater vehicle motion, thus vehicle movement was reflected actual. Computer simulation shows that the join between vehicle and INS is correct. This is a good method for the movement adaptability examination of INS.
Image Processing and Modeling for Active Needle Steering in Liver Surgery
Authors: Bing Nan Li, Phu Binh Nguyen, S. H. Ong, Jing Qin, Liang Jing Yang, C. K. Chui
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Image-guided intervention and needle steering for radiofrequency ablation (RFA) of the liver is reviewed in this paper. In particular, the concept of active needle is proposed for RFA treatment. Methods and techniques of image processing and modeling are presented for a stereo liver model. The liver model and constituent components extracted from computerized tomography (CT) images can be used to plan the navigation paths of the RFA needle. The system also provides an option for active needles, which are more amenable to those refractory cases of RFA treatment.
The problem of rapid variable creation
Authors: Robert F. Hadley
Venue: Neural Computation (2009)

Both Marcus (2001) and Jackendoff (2002) have emphasized the importance of finding credible explanations for the occurrence of variables within cognitive representations. Marcus, in particular, has argued that a prevailing form of connectionist modeling, eliminative connectionism, cannot adequately explain crucial forms of human generalization. Eliminative connectionism eschews the use of explicitly represented variables, and the latter, Marcus contends, play an essential role in the forms of generalization that he considers. Recently, van der Velde and de Kamps (2006) proposed a neural blackboard architecture, which they assert to have satisfied the variable representation needs that Marcus and Jackendoff identified. However, this letter argues that closely related variants of Marcus's generalization examples possess variable requirements that are incompatible with the van der Velde and de Kamps approach. Moreover, it is argued here that these newly proposed variants present a severe challenge not only for eliminative connectionism but for all network training methods that require iterative tuning of synaptic strengths. The letter focuses on generalization cases that necessitate either virtually instantaneous creation of variables or very rapid deployment of preexisting variables within highly novel contexts.
Embedding computer science concepts in K-12 science curricula
Authors: Chi-Cheng Lin, Mingrui Zhang, Barbara Beck, Gayle Olsen
Venue: ACM SIGCSE Bulletin (2009)

To engage a broader audience in computer science, we have developed a set of curriculum units embedded with computer science concepts for K-12 science education. We chose bioinformatics as a vehicle to deliver these units. Our curriculum development cycle began with the identification of a set of computer science concepts which are potentially relevant to life sciences. Problems in life sciences as well as bioinformatics tools to be used for solving these problems were carefully examined for the delivery of identified computer concepts. They were later presented to groups of regional K-12 science teachers in our summer workshop on bioinformatics. With their help, we adapted and polished these curriculum units to meet Minnesota state standards for K-12 science education. This paper describes our approach in developing the curriculum units.
K-hyperline clustering learning for sparse component analysis
Authors: Zhaoshui He, Andrzej Cichocki, Yuanqing Li, Shengli Xie, Saeid Sanei
Venue: Signal Processing (2009)

A two-stage clustering-then-@?"1-optimization approach has been often used for sparse component analysis (SCA). The first challenging task of this approach is to estimate the basis matrix by cluster analysis. In this paper, a robust K-hyperline clustering (K-HLC) algorithm is developed for this task. The novelty of our method is that it is not only able to implement hyperline clustering, but also is capable of detecting the number of hidden hyperlines (or sparse components). K-HLC seamlessly integrates ''the hyperline clustering'' and ''hyperline number detection'' in the same algorithm. In addition, three strategies are proposed to tackle this problem: (1) reject the outliers by overestimating the number of hyperlines; (2) escape from local minima by using a multilayer initialization and (3) suppress the noise by a multilayer K-HLC. By taking these strategies into account, the robust K-HLC procedure can be briefly described as follows: first, we overestimate the number of hyperlines; then, a confidence index is given to evaluate the significance of each hyperline. Subsequently, we determine the number of hyperlines by checking the gap in the sorted confidence indices. Moreover, we select those hyperlines corresponding to large confidence indices with high rank priority and remove spurious ones with small confidence indices. The high performance of our clustering scheme is illustrated by extensive numerical experiments including some challenging benchmarks, e.g., very ill-conditioned basis matrix (Hilbert matrix), or the observations with strong outliers.
Onomato planets: physical computing of Japanese onomatopoeia
Authors: Aya Miyazaki, Kiyoshi Tomimatsu
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

We proposed a design idea of an interactive educational toy for children based on Japanese onomatopoeia. Onomatopoeia "is a word or a grouping of words that imitates the sound it is describing, such as animal noises like "oink" or "meow", or suggesting its source object". Thus, onomatopoeia words have interesting sound and rhythm. There are a large number of Japanese onomatopoeia words and in the Japanese language in particular, they are also used to describe phenomena apart from the purely auditive. With "Onomato Planets" we can create various Japanese onomatopoeia words and the corresponding sounds, through touch. The rules, by which these are created, are defined by the actual meaning of these words. Japanese onomatopoeia words contain many elements that are based on cultural background and experiences (called "Nonverbal elements"). For instance, sound intensity and gesture (movement, force) of the phenomenon being described are nonverbal elements of Japanese onomatopoeia. Through the interface we identify the strength and type of the impact and the gesture of the hand on a multi touch display, and then map this information to Japanese Onomatopoeia words characters and sound. Finally, we aim to provide an exciting experience of sounds and characters to the children who play "Onomato Planets". There is no previous work that introduces mappings between characters or words, to vocal and motion parameters. Therefore this project expands the expression of vocal to motion interactive art by relating gestures, sounds and characters (words).
Independent Sets of Maximum Weight in Apple-Free Graphs
Authors: Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We present the first polynomial-time algorithm to solve the Maximum Weight Independent Set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs, chordal graphs and cographs. Our solution is based on a combination of two algorithmic techniques (modular decomposition and decomposition by clique separators) and a deep combinatorial analysis of the structure of apple-free graphs. Our algorithm is robust in the sense that it does not require the input graph G to be apple-free; the algorithm either finds an independent set of maximum weight in G or reports that G is not apple-free.
The Isolation Game: A Game of Distances
Authors: Yingchao Zhao, Wei Chen, Shang-Hua Teng
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We introduce a new multi-player geometric game, which we will refer to as the isolation game, and study its Nash equilibria and best or better response dynamics. The isolation game is inspired by the Voronoi game, competitive facility location, and geometric sampling. In the Voronoi game studied by Dürr and Thang, each player's objective is to maximize the area of her Voronoi region. In contrast, in the isolation game, each player's objective is to position herself as far away from other players as possible in a bounded space. Even though this game has a simple definition, we show that its game-theoretic behaviors are quite rich and complex. We consider various measures of farness from one player to a group of players and analyze their impacts to the existence of Nash equilibria and to the convergence of the best or better response dynamics: We prove that it is NP-hard to decide whether a Nash equilibrium exists, using either a very simple farness measure in an asymmetric space or a slightly more sophisticated farness measure in a symmetric space. Complementing to these hardness results, we establish existence theorems for several special families of farness measures in symmetric spaces: We prove that for isolation games where each player wants to maximize her distance to her m th nearest neighbor, for any m, equilibria always exist. Moreover, there is always a better response sequence starting from any configuration that leads to a Nash equilibrium. We show that when m = 1 the game is a potential game -- no better response sequence has a cycle, but when m > 1 the games are not potential. More generally, we study farness functions that give different weights to a player's distances to others based on the distance rankings, and obtain both existence and hardness results when the weights are monotonically increasing or decreasing. Finally, we present results on the hardness of computing best responses when the space has a compact representation as a hypercube.
Non-associative Gröbner bases, finitely-presented Lie rings and the Engel condition, II
Authors: Serena Cicalò, Willem A. de Graaf
Venue: Journal of Symbolic Computation (2009)

We give an algorithm for constructing a basis and a multiplication table of a finite-dimensional finitely-presented Lie ring. Secondly, we give relations that are equivalent to the n-Engel condition, and only have to be checked for the elements of a basis of a Lie ring. We apply this to construct the freest t-generator Lie rings that satisfy the n-Engel condition, for (t,n)=(2,3),(3,3),(4,3),(2,4).
Unified Formulation for High-Order Streamline Tracing on Two-Dimensional Unstructured Grids
Authors: Ruben Juanes, Sébastien F. Matringe
Venue: Journal of Scientific Computing (2009)

Accurate streamline tracing and travel time computation are essential ingredients of streamline methods for groundwater transport and petroleum reservoir simulation. In this paper we present a unified formulation for the development of high-order accurate streamline tracing algorithms on unstructured triangular and quadrilateral grids. The main result of this paper is the identification of velocity spaces that are suitable for streamline tracing. The essential requirement is that the divergence-free part of the velocity must induce a stream function. We recognize several classes of velocity spaces satisfying this requirement from the theory of mixed finite element methods and, for each class, we obtain the precise functional form of the stream function. Not surprisingly, the most widely used tracing algorithm (Pollock's method) emanates in fact from the lowest-order admissible velocity approximation. Therefore, we provide a sound theoretical justification for the low-order algorithms currently in use, and we show how to achieve higher-order accuracy both in the streamline tracing and the travel time computation.
Tests for zero-inflation and overdispersion: A new approach based on the stochastic convex order
Authors: A. Baíllo, J. R. Berrendero, J. Cárcamo
Venue: Computational Statistics Data Analysis (2009)

A new methodology to detect zero-inflation and overdispersion is proposed, based on a comparison of the expected sample extremes among convexly ordered distributions. The method is very flexible and includes tests for the proportion of structural zeros in zero-inflated models, tests to distinguish between two ordered parametric families and a new general test to detect overdispersion. The performance of the proposed tests is evaluated via some simulation studies. For the well-known fetal lamb data, the conclusion is that the zero-inflated Poisson model should be rejected against other more disperse models, but the negative binomial model cannot be rejected.
Plenary lecture IV: signal processing education challenge: a speaker verification R&D undergraduate team
Authors: Roxana Saint-Nom
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

In order to develop the area of signal processing technology in Argentina, R+D projects have to be carried out at universities. In that way, they can train new SP doctors to start the job. But for that purpose doctorate candidates are a must, as well as proper funding for the graduate school. How do you start the movement, when there is not such a graduate school, no candidates and the companies don't do research? How do you get the funding if you don't have the project or the people to do it? This is the challenge I faced, as head of the Electrical Engineering Department in a small University in Argentina. My talk will address the problem, and the way I could overcome it. It will describe an undergraduate team dealing with Speaker Verification (SV) research. It will explain how it is possible to insert such a subject in the EE curricula, how to encourage senior student to do R+D, how to contribute with teams in other countries, how to help build a new platform for SV and how to design a strategy to get funding and political support.
Control variate technique: a constructive approach
Authors: Tarik Borogovac, Pirooz Vakili
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The technique of control variates requires that the user identify a set of variates that are correlated with the estimation variable and whose means are known to the user. We relax the known mean requirement and instead assume the means are to be estimated. We argue that this strategy can be beneficial in parametric studies, analyze the properties of controlled estimators, and propose a class of generic and effective controls in a parametric estimation setting. We discuss the effectiveness of the estimators via analysis and simulation experiments.
Symmetrical 2DLDA Using Different Measures in Face Recognition
Authors: Jicheng Meng, Li Feng
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Facial symmetry can be regarded as a not absolute but useful and natural feature. In this paper, this symmetrical feature is applied to two-dimensional linear discriminant analysis (2DLDA) for face image feature extraction, furthermore, the distance measure (DM) and Frobenius-norm measure(FM) are also developed to classify faces. Symmetrical 2DLDA (S2DLDA) used pure statistical mathematical technique (just like 2DLDA), as well as the characters of face image (just like SLDA), to improve the recognition performance. The typical similarity measure used in 2DLDA is applied to S2DLDA, which is the sum of the Euclidean distance between two feature vectors in feature matrix, called DM. The similarity measure based on Frobenius-norm is also developed to classify face images for S2DLDA. To test their performance, experiments are performed on YALE and ORL face databases. The experimental results show that when DM is used, S2DLDA has the potential to outperform 2DLDA.
Combining Multiple Knowledge Representation Technologies into Agent Programming Languages
Authors: Mehdi M. Dastani, Koen V. Hindriks, Peter Novák, Nick A. Tinnemeier
Venue: Declarative Agent Languages and Technologies VI: 6th International Workshop, DALT 2008, Estoril, Portugal, May 12, 2008, Revised Selected and Invited Papers (2008)

In most agent programming languages in practice a programmer is committed to the use of a single knowledge representation technology. In this paper we argue this is not necessarily so. It is shown that rational agent programming languages allow for the combination of various such technologies. Specific issues that have to be addressed to realize such integration for rational agents that derive their choice of action from their beliefs and goals are discussed. Two techniques to deal with these issues which enable the integration of multiple knowledge representation techniques are presented: a meaning-preserving translation approach that maps one representation to another, and an approach based on so-called bridge rules which add additional inference power to a system combining multiple knowledge representation technologies.
Multiscale Representations for Fast Pattern Matching in Stream Time Series
Authors: Xiang Lian, Lei Chen, Jeffrey Xu Yu, Jinsong Han, Jian Ma
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Similarity-based time series retrieval has been a subject of long term study due to its wide usage in many applications, such as financial data analysis and weather data forecasting. Its original task was to find those time series similar to a pattern time series data, where both the pattern and data time series are static. Recently, with an increasing demand on stream data management, similarity-based stream time series retrieval has raised new research issues due to its unique requirements during the stream processing, such as one-pass search and fast response. In this paper, we address the problem of matching both static and dynamic patterns over stream time series data. We will develop a novel multi-scale representation, called multi-scale segment mean (MSM), for stream time series data, which can be incrementally computed and thus perfectly adapted to the stream characteristics. Most importantly, we propose a novel multi-step filtering mechanism, SS, over the multi-scale representation. Analysis indicates that the mechanism can greatly prune the search space and thus offer fast response. Furthermore, batching processing optimization, the dynamic case where patterns are also from stream time series, and pattern matching over future stream time series are also discussed. Extensive experiments show the proposed scheme can efficiently filter out false candidates and detect patterns.
PID Gain Tuning Using Genetic Algorithms and Fuzzy Logic for Robot Manipulator Control
Authors: N. Nahapetian, M. R. Jahed Motlagh, M. Analoui
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper addresses an application that involves the control of robot manipulator joint. It presents a PID tuning method that uses a Genetic Algorithm (GA) as a main gain estimator and a fuzzy logic as a ranking basement for GA. The suggested approach is then used to tune the PID gains for different response specifications. Experimental results demonstrate that better performance can be achieved with this fuzzy based GA-PID tuning relative to 1) Ziegler-Nichols tuning and 2) trial and error tuning. This paper tries to explore the potential of using soft computing methodologies in control of plant (robot manipulator) with internal behavior of structure-unknown non-linear time variant dynamic systems. Industrial robot manipulator was used for the case study in this work. The manipulator is simulated with professional simulation software (consist of Solid work, Visual Nastran 4D and Matlab/Simulink).
Design and Development of a 5-DOF Air-Bearing Spacecraft Simulator
Authors: Xu Jian, Bao Gang, Yang QinJun, Li Jun
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

The Five Degrees of Freedom Air-bearing Spacecraft Simulator (5DOFASS) is designed at Harbin Institute of Technology for the purpose of simulating spacecraft autonomous formation flying and orbital maneuver. The 5DOFASS contains an attitude platform supported on a hemispherical air-bearing and a translation platform floated on three linear air-bearing feet, which provides a very low friction and 0-g environment in an Earth-bound laboratory. In this paper, the design and development of the 5DOFASS is described in detail, including working principle, structure, and control system. Some ongoing research problems and future plans are reported at the end of the article.
User Interface of a Document-Processing Reader for the Blind
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

After describing the problems that blind users face in accessing conventional printed documents, we give an overview of a document-processing reader for OS/2. The discussion concerns mainly the user interface of the system, since GUIs present serious problems for blind users. Instead of icons and a mouse, the system interface is built around voice menus and a numeric keypad. A structured file is also created to allow users to read a text quickly after the scanning and character recognition are complete. 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
ExtendSim 7
Authors: David Krahl
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

ExtendSim 7 is a proven simulation environment capable of modeling a wide range of systems. ExtendSim 7 is used to model continuous, discrete event, discrete rate, and agent based systems. ExtendSim's design facilitates every phase of the simulation project, from creating, validating, and verifying the model, to the construction of a user interface that allows others to analyze the system. Simulation tool developers can use ExtendSim's built-in, compiled language, ModL, to create reusable modeling components. All of this is done within a single, self-contained software program that does not require external interfaces, compilers, or code generators. This paper will introduce Extend-Sim 7, demonstrate its advanced technology and features, and explain sample simulation applications.