ppxscal/embedding_network huggingface dataset:
The CEO mission IV rescue robot for world RoboCup and USAR field
Authors: Supanunt Tunwannarux, Amon Tunwannarux
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

The paper describes the CEO Mission IV rescue robot design and implementation. Its features are designed especially for World RoboCup Championship Rescue Robot League 2007 and USAR field. It is also designed for real practical usages as the universal robotic platform. CEO Mission IV is one of the CEO Mission rescue robot series from University of the Thai Chamber of Commerce (UTCC), which is engaged in USAR research area since 2004. Not only intended for surveillance in rescue job, but CEO Mission IV is also designed with the modular concept and the concepts for reproduction and ease to maintenance. CEO Mission IV rescue robot is composed of the 6-Joint mechanical arm installed on the robotic platform, which is a track wheel type with double front flippers for climbing up the stairs and rough terrain. Three cameras, laser pointer and sensors like IR temperature sensor, CO2 sensor, and voice sensor are installed on the tip of the 6-Joint mechanical arm for searching the vital signs of victims in the debris. The forth camera is at the back of the robot for driving control. The robot wheels encoders, yawn/pitch/roll angle sensors, and laser range finder are installed at robot for plotting the 2D obstacle map and robot traveling map. Robot localization and map plotting is implemented by using SLAM and Kalman filter. All sensors and controlling data including audio and video data are communicated with a teleoperator control station via IEEE 802.11a/g WiFi for getting real-time response. The communication frequency can be selected as 2.4 GHz or 5 GHz at the teleoperator suitcase instantly in order to avoid signal disturbance. At teleoperator station, the robot locomotion and the mechanical arm are controlled by joystick via the user-friendly GUI control and monitoring program which is developed based on the clicking and dragging method to easily control the movement of the arm. Moreover, a portable teleoperator suitcase is built for operator convenience and portability. All hardware and software systems are explained. The concept and design of this robot can be adapted to suit many other applications. Testing results are very satisfied. CEO Mission IV is one of the most effective rescue robot systems and won the Third Place from World RoboCup Championship 2007.
Force modeling for tooth preparation in a dental training system
Authors: Guanyang Liu, Yuru Zhang, William T. Townsend
Venue: Virtual Reality (2008)

Feedback force is very important for novices to simulate tooth preparation by using the haptic interaction system (dental training system) in a virtual environment. In the process of haptic simulation, the fidelity of generated forces by a haptic device decides whether the simulation is successful. A force model computes feedback force, and we present an analytical force model to compute the force between a tooth and a dental pin during tooth preparation. The force between a tooth and a dental pin is modeled in two parts: (1) force to resist human&#x2019;s operation and (2) friction to resist the rotation of the dental engine. The force to resist the human&#x2019;s operation is divided into three parts in the coordinates that are constructed on the bottom center of the dental pin. In addition, we also consider the effects of dental-pin type, tooth stiffness, and contact geometry in the force model. To determine the parameters of the force model, we construct a measuring system by using machine vision and a force/torque sensor to track the human&#x2019;s operations and measure the forces between the dental pins and teeth. Based on the measuring results, we construct the relation between the force and the human&#x2019;s operation. The force model is implemented in the prototype of a dental training system that uses the Phantom as the haptic interface. Dentists performing virtual operations have confirmed the fidelity of feedback force.
Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
Authors: Sergey Avgustinovich, Ivan Mogilnykh
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

The problem of the existence of perfect 2-colorings in Johnson graphs J(6,3) and J(7,3) is solved in this paper. Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte [3]. This problem of existence of such structures is closely related to Delsarte hypothesis about the nonexistence of nontrivial perfect codes in Johnson graphs, the problem of existence of block schemes, the problem of existence of completely regular codes in Johnson graphs and other well-known mathematical problems. Some auxiliary theorems, which can be applied for treatment of perfect colorings in two colors in other graphs, are given in this paper.
Exploring the Role of Time and Errors in Real-Life Usability for Older People and ICT
Authors: Sergio Sayago, Josep Blat
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

We explore herein the role of time and errors as usability measures in real-life usability for older people and ICT, drawing on observation and conversational data collected over a 3-year ethnographic study of the usability and accessibility of ICT for older people. The results show that time has little or no practical value in real-life usability, except for expected complains about slower PCs and Internet connections, unlike making the least number of errors. This finding is independent of educational levels and previous experience with ICT, and grounded in three factors: (i) desire of independency, (ii) extra efforts to overcome mistakes; (iii) using computers as a hobby.
A Mathematical Type for Physical Variables
Authors: Joseph B. Collins
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

In identifying the requirements of a markup language for describing the mathematical semantics of physics-based models, we pose the question: "Is there a mathematical type for physical variables?" While this question has no a priori answer, since physics is fundamentally empirical, it appears that a large body of physics may be described with a single mathematical type. Briefly stated, that type is formed as the mathematical product of a physical unit, such as meter or second, and an element of a Clifford algebra. We discuss some of the properties of this mathematical type and its use in documentation of physics-based models.
On Possibilistic/Fuzzy Optimization
Authors: Masahiro Inuiguchi
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

We focus on possibilistic/fuzzy optimality in the framework of mathematical programming problem with a possibilistic objective function. We observe the interaction between possibilistic objective function values. Two optimality concepts, possible and necessary optimalities are reviewed. The necessary soft optimality is investigated.
ProbDiVinE-MC: Multi-core LTL Model Checker for Probabilistic Systems
Authors: Jirí Barnat, Lubós Brim, Ivana Cerná, Milan Ceka, Jana Tumová
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

We present a new version of ProbDiVinE - a parallel tool for verification of probabilistic systems against properties formulated in linear temporal logic. Unlike the previous release, the new version of the tool allows for both quantitative and qualitative model-checking. It is also strictly multi-threaded, therefore, protects users from unwanted burden of parallel computing in a distributed-memory environment.
Handwritten Signature and Speech: Preliminary Experiments on Multiple Source and Classifiers for Personal Identity Verification
Authors: Donato Impedovo, Giuseppe Pirlo, Mario Refice
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

This paper presents a personal verification system based on two different biometric traits: handwritten signature and speech. The signature verification system uses contour-based features and a Dynamic Time Warping technique for matching. The speaker verification system uses cepstral based coefficients and is based on a Hidden Markov Model statistical classifier. In the decision combination stage, the decisions provided by the two systems are combined according to a simple abstract---level combination approach. The experimental results related to a real-scenario demonstrate the effectiveness of the proposed approach and highlight some profitable directions for further developments.
The Influence of Mutation on Protein-Ligand Docking Optimization: A Locality Analysis
Authors: Jorge Tavares, Alexandru-Adrian Tantar, Nouredine Melab, El-Ghazali Talbi
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Evolutionary approaches to protein-ligand docking typically use a real-value encoding and mutation operators based on Gaussian and Cauchy distributions. The choice of mutation is important for an efficient algorithm for this problem. We investigate the effect of mutation operators by locality analysis. High locality means that small variations in the genotype imply small variations in the phenotype. Results show that Gaussian-based operators have stronger locality than Cauchy-based ones, especially if an annealing scheme is used to control the variance.
Fast Exact Area Image Upsampling with Natural Biquadratic Histosplines
Authors: Nicolas Robidoux, Adam Turcotte, Minglun Gong, Annie Tousignant
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Interpreting pixel values as averages over abutting squares mimics the image capture process. Average Matching (AM) exact area resampling involves the construction of a surface with averages given by the pixel values; the surface is then averaged over new pixel areas. AM resampling approximately preserves local averages (error bounds are given). Also, original images are recovered by box filtering when the magnification factor is an integer in both directions. Natural biquadratic histosplines, which satisfy a minimal norm property like bicubic splines, are used to construct the AM surface. Recurrence relations associated with tridiagonal systems allow the computation of tensor B-Spline coefficients at modest cost and their storage in reduced precision with little accuracy loss. Pixel values are then obtained by multiplication by narrow band matrices computed from B-Spline antiderivatives. Tests involving the re-enlargement of images downsampled with box filtering suggest that natural biquadratic histopolation is the best linear upsampling reconstructor.
Data Space Randomization
Authors: Sandeep Bhatkar, R. Sekar
Venue: Proceedings of the 5th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2008)

Over the past several years, US-CERT advisories, as well as most critical updates from software vendors, have been due to memory corruption vulnerabilities such as buffer overflows, heap overflows, etc. Several techniques have been developed to defend against the exploitation of these vulnerabilities, with the most promising defenses being based on randomization. Two randomization techniques have been explored so far: address space randomization (ASR) that randomizes the location of objects in virtual memory, and instruction set randomization (ISR) that randomizes the representation of code. We explore a third form of randomization called data space randomization (DSR) that randomizes the representation of data stored in program memory. Unlike ISR, DSR is effective against non-control data attacks as well as code injection attacks. Unlike ASR, it can protect against corruption of non-pointer data as well as pointer-valued data. Moreover, DSR provides a much higher range of randomization (typically 232 for 32-bit data) as compared to ASR. Other interesting aspects of DSR include (a) it does not share a weakness common to randomization-based defenses, namely, susceptibility to information leakage attacks, and (b) it is capable of detecting some exploits that are missed by full bounds-checking techniques, e.g., some of the overflows from one field of a structure to the next field. Our implementation results show that with appropriate design choices, DSR can achieve a performance overhead in the range of 5% to 30% for a range of programs.
Applying Text Mining to Assist People Who Inquire HIV/AIDS Information from Internet
Authors: Yungchang Ku, Chaochang Chiu, Bo-Hong Liou, Jyun-Hong Liou, Jheng-Ying Wu
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Inquire health information from Internet or virtual community is one of hot activities on the web. But no one can guarantee the treatments or remedy work or not for the health questioners. The present research proposes an Internet health information governance mechanism (IHIGM) for support the diseases control and health authority to do their efforts in Internet health information. In the experiment, the research takes "People Inquire HIV/AIDS Information from Internet" as example and explains the procedure of IHIGM. In the experiment result, the accuracy ratio of IHIGM can at least classify 85% positive HIV/AIDS Internet health information inquiry for intervention.
Transactional events for ML
Authors: Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
Venue: ACM SIGPLAN Notices (2008)

Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows multiple messages to be passed as part of one all-or-nothing synchronization. Donnelly and Fluet (2006) designed and implemented TE as a Haskell library and demonstrated that it enables elegant solutions to programming patterns that are awkward or impossible in CML. However, both the definition and the implementation of TE relied fundamentally on the code in a synchronization not using mutable memory, an unreasonable assumption for mostly functional languages like ML where functional interfaces may have impure implementations. We present a definition and implementation of TE that supports ML-style references and nested synchronizations, both of which were previously unnecessary due to Haskell's more restrictive type system. As in prior work, we have a high-level semantics that makes nondeterministic choices such that synchronizations succeed whenever possible and a low-level semantics that uses search to implement the high-level semantics soundly and completely. The key design trade-off in the semantics is to allow updates to mutable memory without requiring the implementation to consider all possible thread interleavings. Our solution uses first-class heaps and allows interleavings only when a message is sent or received. We have used Coq to prove the high- and low-level semantics equivalent. We have implemented our approach by modifying the Objective Caml run-time system. By modifying the run-time system, rather than relying solely on a library, we can eliminate the potential for nonterminating computations within unsuccessful synchronizations to run forever.
An explicit finite difference scheme with spectral boundary conditions for particulate flows
Authors: A. Perrin, H. H. Hu
Venue: Journal of Computational Physics (2008)

We present an explicit finite difference scheme for solving two-dimensional particulate flow problems with a special treatment of the boundary conditions on the particle surface based on spectral solutions to the Stokes equations. This scheme allows for accurate solution of particulate flows up to a particle Reynolds number of one hundred on coarse grids (10-20 grid spacings per particle diameter). The coarse grid provides additional computational benefit by allowing for larger time steps required by the stability constraint. The method is validated and demonstrated through a number of examples, which include flow over a stationary cylinder, a cylinder moving with constant velocity, sedimentation of a free particle, the drafting, kissing, and tumbling of two particles, and 248 particles falling in a closed box.
Generalized collocation method for two-dimensional reaction-diffusion problems with homogeneous Neumann boundary conditions
Authors: R. Revelli, L. Ridolfi
Venue: Computers Mathematics with Applications (2008)

Nonlinear reaction-diffusion problems are ubiquitous in science, ranging from physics to engineering, from economy to biology. In particular, in this paper two-dimensional problems with generic Dirichlet boundary conditions or homogeneous Neumann boundary conditions are focused on. To simulate this class of mathematical problems, a quite simple generalized collocation method is proposed and developed. Moreover, a test case and an application to the Schnakenberg model are described, in order to show the efficiency of the simulation method and the goodness of the numerical results.
Application of Formal Word-Level Analysis to Constrained Random Simulation
Authors: Hyondeuk Kim, Hoonsang Jin, Kavita Ravi, Petr Spacek, John Pierce, Bob Kurshan, Fabio Somenzi
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

Constrained random simulation is supported by constraint solvers integrated within simulators. These constraint solvers need to be fast and memory efficient to maintain simulation performance. Binary Decision Diagrams (BDDs) have been successfully applied to represent constraints in this context. However, BDDs are vulnerable to size explosions depending on the constraints they are representing and the number of Boolean variables appearing in them. In this paper, we present a word-level analysis tool DomRed to reduce the number of Boolean variables required to represent constraints by reducing the domain of constraint variables. DomRed employs static analysis techniques to obtain these reductions. We present experimental results to illustrate the impact of this tool.
Performance Analysis of Handwritten Numerals Recognition Based on Multiwavelet Neural Network
Authors: Tong-cheng Huang, You-dong Ding, Li-ping Yin
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

This paper validates a recognition system via multiwavelet neural network as feature extractor and classifier. It investigates the relevance of each sub-band image in the recognition process. An experiment to verify the efficiency of the multiwavelet was performed omitting the feature extraction step. Results show that information about the relevant image features are evenly distributed in all sub-band images of multiwavelet coefficients and that multiwavelet neural network are promising feature extractors and classifiers. Numerals from the NIST database were used for evaluation of the system tested.
Design and Implementation of Parallel Counterpropagation Networks Using MPI
Authors: Athanasios Margaris, Stavros Souravlas, Efthimios Kotsialos, Manos Roumeliotis
Venue: Informatica (2007)

The objective of this research is to construct parallel models that simulate the behavior of artificial neural networks. The type of network that is simulated in this project is the counterpropagation network and the parallel platform used to simulate that network is the message passing interface (MPI). In the next sections the counterpropagation algorithm is presented in its serial as well as its parallel version. For the latter case, simulation results are given for the session parallelization as well as the training set parallelization approach. Regarding possible parallelization of the network structure, there are two different approaches that are presented; one that is based to the concept of the intercommunicator and one that uses remote access operations for the update of the weight tables and the estimation of the mean error for each training stage.
A Machine Learning Approach to Portuguese Pronoun Resolution
Authors: Ramon Ré Cuevas, Ivandré Paraboni
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

Anaphora resolution is an essential component of most NLP applications, from text understanding to Machine Translation. In this work we discuss a supervised machine learning approach to the problem, focusing on instances of anaphora ubiquitously found in a corpus of Brazilian Portuguese texts, namely, third-person pronominal references. Although still limited to a subset of the more general co-reference resolution problem, our present results are comparable to existing work in the field in both English and Portuguese languages, representing the highest accuracy rates that we are aware of in (Brazilian) Portuguese pronoun resolution.
Towards Probabilistic Shape Vision in RoboCup: A Practical Approach
Authors: Sven Olufs, Florian Adolf, Ronny Hartanto, Paul Plöger
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

This paper presents a robust object tracking method using a sparse shape-based object model. Our approach consists of three ingredients namely shapes, a motion model and a sparse (non-binary) subsampling of colours in background and foreground parts based on the shape assumption. The tracking itself is inspired by the idea of having a short-term and a long-term memory. A lost object is "missed" by the long-term memory when it is no longer recognized by the short-term memory. Moreover, the long-term memory allows to re-detect vanished objects and using their new position as a new initial position for object tracking. The short-term memory is implemented with a new Monte Carlo variant which provides a heuristic to cope with the loss-of-diversity problem. It enables simultaneous tracking of multiple (visually) identical objects. The long-term memory is implemented with a Bayesian Multiple Hypothesis filter. We demonstrate the robustness of our approach with respect to object occlusions and non-Gaussian/non-linear movements of the tracked object. We also show that tracking can be significantly improved by using compensating ego-motion. Our approach is very scalable since one can tune the parameters for a trade-off between precision and computational time.
Classification of multivariate time series using locality preserving projections
Authors: Xiaoqing Weng, Junyi Shen
Venue: Knowledge-Based Systems (2008)

Multivariate time series (MTS) are used in very broad areas such as multimedia, medicine, finance and speech recognition. A new approach for MTS classification using locality preserving projections (LPP) is proposed. By using LPP, the MTS samples can be projected into a lower-dimensional space in which the MTS samples related to the same class are close to each other, the MTS samples in testing set can be identified by one-nearest-neighbor classifier in the lower-dimensional space. Experimental results performed on five real-world datasets demonstrate the effectiveness of our proposed approach for MTS classification.