ppxscal/embedding_network huggingface dataset:
A method to test FES-based control strategies for neuroprostheses
Authors: Marian Poboroniuc, Ciprian Stefan
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

This paper aims at presenting some research issues carried out by the SINPHA-11-068/2007 project which focus on the functional movement restoration of paralyzed limbs by the use of Functional Electrical Stimulation (FES). The main goal is to restore standing in paraplegia by means of the FES techniques and to test different control strategies that have to be embedded within a neuroprosthesis. Prior to use a neuroprosthesis on disabled people within a clinical environment, we propose that any new control strategy to be tested in simulation and on a mechatronic device that emulate the human body movements while an electrical stimulus is supposed to be applied over the controlled groups of muscles. Our tests have shown that a mechatronic device that mimic the human body movements while standing-up, standing and sitting-down in paraplegia may offer a better understanding on how to tune controller parameters for different control strategies that aim to support standing exercises in paraplegia.
Resource generation from structured documents for low-density languages
Authors: Amy Weinberg, David S. Doermann
Venue:  (2007)

The availability and use of electronic resources for both manual and automated language related processing has increased tremendously in recent years. Nevertheless, many resources still exist only in printed form, restricting their availability and use. This especially holds true in low density languages or languages with limited electronic resources. For these documents, automated conversion into electronic resources is highly desirable. This thesis focuses on the semi-automated conversion of printed structured documents (dictionaries in particular) to usable electronic representations. In the first part we present an entry tagging system that recognizes, parses, and tags the entries of a printed dictionary to reproduce the representation. The system uses the consistent layout and structure of the dictionaries, and the features that impose this structure, to capture and recover lexicographic information. We accomplish this by adapting two methods: rule-based and HMM-based. The system is designed to produce results quickly with minimal human assistance and reasonable accuracy. The use of an adaptive transformation-based learning as a post-processor at two points in the system yields significant improvements, even with an extremely small amount of user provided training data. The second part of this thesis presents Morphology Induction from Noisy Data (MIND), a natural language morphology discovery framework that operates on information from limited, noisy data obtained from the conversion process. To use the resulting resources effectively, however, users must be able to search for them using the root form of morphologically deformed variant found in the text. Stemming and data driven methods are not suitable when data are sparse. The approach is based on the novel application of string searching algorithms. The evaluations show that MIND can segment words into roots and affixes from the noisy, limited data contained in a dictionary, and it can extract prefixes, suffixes, circumfixes, and infixes. MIND can also identify morphophonemic changes, i.e., phonemic variations between allomorphs of a morpheme, specifically point-of-affixation stem changes. This, in turn, allows non-native speakers to perform multilingual tasks for applications where response must be rapid, and they have limited knowledge. In addition, this analysis can feed other natural language processing tools requiring lexicons.
Introduction to Part II Introducing Object-Oriented Programming
Authors: Michael E. Caspersen
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

The practice of teaching programming at universities, colleges and high schools went through a major change roughly in the mid 1990s: The teaching of objectorientation in introductory courses slowly became mainstream. Fairly soon, the Object First or Objects Early school of thought was formulated, stating that teaching object orientation by discussing objects from the very start is a good thing.
Dynamic Conditions of Reflection-Type Tactile Sensor
Authors: Satoshi Saga, Satoshi Tadokoro, Susumu Tachi
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Considering tactile sensors there are two ways to acquire object information. These are spatial sensing with two dimensional devices and fast sensing with simple devices. Because the reflection-type tactile sensor uses a reflection image, both methods can be employed. Though there exist some dynamic characteristics in these two ways.In this study, we first validate the hysteresis of the reflection-type tactile sensor. The results show the sensor can evaluate displacement less than 2 mm. Then we propose a novel interface called "fibratus tactile sensor." Secondly we construct a fast sensing device using reflection image and a combination of light emitting diodes (LEDs) and photodiodes (PDs), and validate the sensor's reactivity. It can distinguish 300 ms interval between two signals. Moreover the correlation between the standard deviations of the acquired outputs from the sensor and the centerline average roughness is 0.90.
Long-term time series prediction with the NARX network: An empirical evaluation
Authors: José Maria P. Menezes,  Jr., Guilherme A. Barreto
Venue: Neurocomputing (2008)

The NARX network is a dynamical neural architecture commonly used for input-output modeling of nonlinear dynamical systems. When applied to time series prediction, the NARX network is designed as a feedforward time delay neural network (TDNN), i.e., without the feedback loop of delayed outputs, reducing substantially its predictive performance. In this paper, we show that the original architecture of the NARX network can be easily and efficiently applied to long-term (multi-step-ahead) prediction of univariate time series. We evaluate the proposed approach using two real-world data sets, namely the well-known chaotic laser time series and a variable bit rate (VBR) video traffic time series. All the results show that the proposed approach consistently outperforms standard neural network based predictors, such as the TDNN and Elman architectures.
A New Computing Method for Greeks Using Stochastic Sensitivity Analysis
Authors: Masato Koda
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In a risk management of derivative securities, Greeks, i.e. sensitivity coefficients, are important measures of market risk to evaluate the impact of misspecification of some stochastic model on the expected payoff function. We investigate a new computing method for Greeks based on Malliavin calculus without resort to a direct differentiation of the complex payoff functions. As a result, a new relation between Γ and Δ is obtained for the Asian option.
Side Channel Cryptanalysis of a Higher Order Masking Scheme
Authors: Jean-Sébastien Coron, Emmanuel Prouff, Matthieu Rivain
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

In the recent years, DPA attacks have been widely investigated. In particular, 2-nd order DPA have been improved and successfully applied to break many masked implementations. In this context a higher order masking scheme has been proposed by Schramm and Paar at CT-RSA 2006. The authors claimed that the scheme is resistant against d-th order DPA for any arbitrary chosen order d. In this paper, we prove that this assertion is false and we exhibit several 3-rd order DPA attacks that can defeat Schramm and Paar's countermeasure for any value of d.
Dictionary based color image retrieval
Authors: A. Macedonas, D. Besiris, G. Economou, S. Fotopoulos
Venue: Journal of Visual Communication and Image Representation (2008)

In this work the normalized dictionary distance (NDD) is presented and investigated. NDD is a similarity metric based on the dictionary of a sequence acquired from a data compressor. A dictionary gives significant information about the structure of the sequence it has been extracted from. We examine the performance of this new distance measure for color image retrieval tasks, by focusing on three parameters: the transformation of the 2D image to a 1D string, the color to character correspondence, and the image size. We demonstrate that NDD can outperform standard (dis)similarity measures based on color histograms or color distributions.
A realtime mixed reality system for seamless interaction between real and virtual objects
Authors: Achilleas Anagnostopoulos, Aristodemos Pnevmatikakis
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

A mixed reality system where users interact with real and virtual 3D objects in a 3D world controlled by a physics engine is presented. To build the system we propose a hand detection and tracking system that maintains information about the way multiple users move their palms and fingers in 3D space using the feed from two fixed uncalibrated cameras. The complete 3D system can process and renders more than 30 frames per second.
A fuzzy similarity inference method for fuzzy reasoning
Authors: De-Gang Wang, Yan-Ping Meng, Hong-Xing Li
Venue: Computers Mathematics with Applications (2008)

In this paper, Fuzzy Similarity Inference (FSI) is investigated. First, the axiomatic definition of the fuzzy similarity measure is introduced. It is a generalization of the similarity measure. Some formulas are given to compute the fuzzy similarity of two fuzzy sets. Second, a novel fuzzy reasoning, called fuzzy similarity inference, is proposed. Computational formulas for both fuzzy modus ponens (FMP) and fuzzy modus tollens (FMT) are obtained. Based on the theory of partial valuations, FSI method is put under the framework of logic semantically. Furthermore, the generalized problem of FSI is investigated. Computational formulas for @a-FSI FMP and @a-FSI FMT are obtained. At last, reversibility properties of FSI are proved.
A Category of Explicit Fusions
Authors: Filippo Bonchi, Maria Grazia Buscemi, Vincenzo Ciancia, Fabio Gadducci
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotational and logical methods often proved inadequate to reason about these formalisms. A domain which has been successfully employed for languages with asymmetric communication, like the ¿-calculus, are presheaf categories based on (injective) relabelings, such as ${Set}^\mathbb{I}$. Calculi with symmetric binding, in the spirit of the fusion calculus, give rise to new research problems. In this work we examine the calculus of explicit fusions, and propose to model its syntax and semantics using the presheaf category ${Set}^\mathbb{E}$, where $\mathbb{E}$ is the category of equivalence relations and equivalence preserving morphisms.
It Is Time to Mechanize Programming Language Metatheory
Authors: Benjamin C. Pierce, Peter Sewell, Stephanie Weirich, Steve Zdancewic
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and programming language researchers alike? One crucial step towards achieving these goals is mechanized reasoning about language metatheory. The time has come to bring together the theorem proving and programming language communities to address this problem. We have proposed the POPLMark challenge as a concrete set of benchmarks intended both for measuring progress in this area and for stimulating discussion and collaboration. Our goal is to push the boundaries of existing technology to the point where we can achieve mechanized metatheory for the masses.
Level Set Methods for Computing Reachable Sets of Hybrid Systems with Differential Algebraic Equation Dynamics
Authors: Ian M. Mitchell, Yoshihiko Susuki
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

In previous work we demonstrated that reachability algorithms using level set methods and based on the Hamilton-Jacobi PDE can be adapted to systems whose dynamics are described by differential algebraic equations. Here we extend those results to hybrid systems. The only significant addition required is a mechanism for handling the state reset that occurs during discrete jumps between modes. We demonstrate the technique on a nonlinear power system voltage safety problem.
MathPaper: Mathematical Sketching with Fluid Support for Interactive Computation
Authors: Robert Zeleznik, Timothy Miller, Chuanjun Li, Joseph J. Laviola,  Jr.
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

We present MathPaper, a system for fluid pen-based entry and editing of mathematics with support for interactive computation. MathPaper provides a paper-like environment in which multiple mathematical expressions and even algorithms can be entered anywhere on the page. Mathematical expressions can also be modified using simple deletion and dragging gestures with real-time recognition and computation feedback. In addition, we support extended notations and gestures for controlling computational assistance, simplifying input, and entering algorithms, making MathPaper a user-friendly system for mathematical sketching and computation.
BMI Based RHC Method for Wheelchair
Authors: Tohru Kawabe
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

In this paper, a new BMI (Brain Machine Interface) based RHC (Receding Horizon Control) method is proposed. The method is designed intending to apply to control of the wheelchair, since the wheelchair is considered as one of a most significant man-machine system for handicapped persons in the contemporary society. The wheelchair system by using the proposed method is constructed with the RHC controller, the adaptive DA converter and the BMI based on the EEG (Electroencephalogram). A numerical example is also included to demonstrate the effectiveness of the proposed method.
Cyber-Physical Medical and Medication Systems
Authors: Albert M. K. Cheng
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Medical and medication devices are real-time systems with safety and timing requirements. They range from hard-real-time, embedded, and reactive systems such as pacemakers to soft-real-time, stand-alone medication dispensers. Many of these devices are already connected to computer networks, especially in hospital intensive-care units, so that patients' conditions detected by sensors can be monitored in real-time at remote computer stations nearby or at other sites. However, remote adjustment of medical devices' output and actuation is typically not allowed due to safety concerns. This article discusses a number of issues such as verification that must be resolved in order to allow cyber-physical operation of medical devices. In particular, we propose using formal methods, self-stabilization, and (m,k)-firm scheduling to allow the safe cyber-physical operation of a medical ventilator, a life-critical reactive device to move breathable air into and out of the lungs of a patient with respiratory difficulties, with the ultimate goal of speeding-up the recovery of the patient.
Efficient Pairing-Based Threshold Proxy Signature Scheme with Known Signers
Authors: Haifeng Qian, Zhenfu Cao, Qingshui Xue
Venue: Informatica (2005)

Since threshold proxy signature has been proposed, all threshold proxy signature schemes are based on the discrete logarithm problems in the modular multiplicative group which has an element g with a large prime order. Nowadays this kind of threshold proxy signature schemes become more and more complex and time-consuming for security and specific requirement. In this paper, we propose a (bilinear) pairing-based threshold proxy signature scheme with known signers, analyze its security and check the following properties the proposed scheme has: non-repudiation, unforgeability, identifiability, distinguishability, verifiability, prevention of misuse of proxy signing right, etc. Moreover, we point out that the proposed scheme is of great efficiency by comparing it with Sun's and Hsu et al.'s scheme.
UAIC Romanian QA System for QA@CLEF
Authors: Adrian Iftene, Diana Trandabăţ, Ionuţ Pistol, Alex Moruz, Alexandra Balahur, Diana Cotelea, Iustin Dornescu, Iuliana Drăghici, Dan Cristea
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)

This paper briefly describes UAIC's participation in this year's CLEF question answering competition, focusing on the main challenges and changes compared to our last year participation. An analysis of the errors introduced by each module is also discussed.
Automatic Feature Extraction from 3D Range Images of Skulls
Authors: Lucia Ballerini, Marcello Calisti, Oscar Cordón, Sergio Damas, Jose Santamaría
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

The extraction of a representative set of features has always been a challenging research topic in image analysis. This interest is even more important when dealing with 3D images. The huge size of these datasets together with the complexity of the tasks where they are needed demand new approaches to the feature extraction problem. The need of an automatic procedure is specially important in many forensic applications, including the reconstruction of 3D models. In this work we propose a new method to automatically extract a set of relevant features from points clouds acquired by a 3D range scanner. We present our results over five views of five skulls, one of them corresponding to a pathological case.
Web-Based Measure of Semantic Relatedness
Authors: Jorge Gracia, Eduardo Mena
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

Semantic relatedness measures quantify the degree in which some words or concepts are related, considering not only similarity but any possible semantic relationship among them. Relatedness computation is of great interest in different areas, such as Natural Language Processing, Information Retrieval, or the Semantic Web. Different methods have been proposed in the past; however, current relatedness measures lack some desirable properties for a new generation of Semantic Web applications: maximum coverage, domain independence, and universality.In this paper, we explore the use of a semantic relatedness measure between words, that uses the Web as knowledge source. This measure exploits the information about frequencies of use provided by existing search engines. Furthermore, taking this measure as basis, we define a new semantic relatedness measure among ontology terms. The proposed measure fulfils the above mentioned desirable properties to be used on the Semantic Web. We have tested extensively this semantic measure to show that it correlates well with human judgment, and helps solving some particular tasks, as word sense disambiguation or ontology matching.
Cognitive Robotics: Command, Interrogation and Teaching in Robot Coaching
Authors: Alfredo Weitzenfeld, Peter Ford Dominey
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

The objective of the current research is to develop a generalized approach for human-robot interaction via spoken language that exploits recent developments in cognitive science, particularly notions of grammatical constructions as form-meaning mappings in language, and notions of shared intentions as distributed plans for interaction and collaboration. We demonstrate this approach distinguishing among three levels of human-robot interaction. The first level is that of commanding or directing the behavior of the robot. The second level is that of interrogating or requesting an explanation from the robot. The third and most advanced level is that of teaching the robot a new form of behavior. Within this context, we exploit social interaction by structuring communication around shared intentions that guide the interactions between human and robot. We explore these aspects of communication on distinct robotic platforms, the Event Perceiver and the Sony AIBO robot in the context of four-legged RoboCup soccer league. We provide a discussion on the state of advancement of this work.
Performance Evaluation for Voice Conversion Systems
Authors: Todor Ganchev, Alexandros Lazaridis, Iosif Mporas, Nikos Fakotakis
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

In the present work, we introduce a new performance evaluation measure for assessing the capacity of voice conversion systems to modify the speech of one speaker (source) so that it sounds as if it was uttered by another speaker (target). This measure relies on a GMM-UBM-based likelihood estimator that estimates the degree of proximity between an utterance of the converted voice and the predefined models of the source and target voices. The proposed approach allows the formulation of an objective criterion, which is applicable for both evaluation of the virtue of a single system and for direct comparison (benchmarking) among different voice conversion systems. To illustrate the functionality and the practical usefulness of the proposed measure, we contrast it with four well-known objective evaluation criteria.
Revisions as an Essential Tool to Maintain Mathematical Repositories
Authors: Adam Grabowski, Christoph Schwarzweller
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

One major goal of Mathematical Knowledge Management is building extensive repositories, in which the mathematical knowledge has been verified. It appears, however, that maintaining such a repository is as hard as building it --- especially for an open collection with a large number of contributors. In this paper we argue that even careful reviewing of contributions cannot cope with the task of keeping a mathematical repository efficient and clearly arranged in the long term. We discuss reasons for revisions of mathematical repositories accomplished by the "core implementors" and illustrate our experiences with revisions of MML, the Mizar Mathematical Library.
Design of neuro-fuzzy controller for idle speed control
Authors: Ahmad Reza Mohtadi, Hamed Torabi, Mohammad Osmani
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

The presented control scheme utilizes Adaptive Neuro Fuzzy Inference System (ANFIS) controller to track rotational speed of a reference engine and disturbance rejection during engine idling. To evaluate the performance of the controller a model of the system is developed and simulation results are presented. It is shown that the ANFIS controller is suitable for control systems with large time delays.