OpenRaiser/Intern-Atlas huggingface dataset:
Périphériques haptiques et simulation d'objets, de robots et de mannequins dans un environnement de CAO-Robotique : eM-Virtual Desktop
Venue: arXiv cs.RO 2007
Year: 2007

This paper presents the development of a new software in order to manage objects, robots and mannequins in using the possibilities given by the haptic feedback of the Phantom desktop devices. The haptic device provides 6 positional degree of freedom sensing but three degrees force feedback. This software called eM-Virtual Desktop is integrated in the Tecnomatix's solution called eM-Workplace. The eM-Workplace provides powerful solutions for planning and designing of complex assembly facilities, lines and workplaces. In the digital mockup context, the haptic interfaces can be used to reduce the development cycle of products. Three different loops are used to manage the graphic, the collision detection and the haptic feedback according to theirs own frequencies. The developed software is currently tested in industrial context by a European automotive constructor.
Logic Column 18: Alternative Logics: A Book Review
Venue: arXiv cs.LO 2007
Year: 2007

This article discusses two books on the topic of alternative logics in science: "Deviant Logic", by Susan Haack, and "Alternative Logics: Do Sciences Need Them?", edited by Paul Weingartner.
Machine and Component Residual Life Estimation through the Application of Neural Networks
Venue: arXiv cs.CE 2007
Year: 2007

This paper concerns the use of neural networks for predicting the residual life of machines and components. In addition, the advantage of using condition-monitoring data to enhance the predictive capability of these neural networks was also investigated. A number of neural network variations were trained and tested with the data of two different reliability-related datasets. The first dataset represents the renewal case where the failed unit is repaired and restored to a good-as-new condition. Data was collected in the laboratory by subjecting a series of similar test pieces to fatigue loading with a hydraulic actuator. The average prediction error of the various neural networks being compared varied from 431 to 841 seconds on this dataset, where test pieces had a characteristic life of 8,971 seconds. The second dataset was collected from a group of pumps used to circulate a water and magnetite solution within a plant. The data therefore originated from a repaired system affected by reliability degradation. When optimized, the multi-layer perceptron neural networks trained with the Levenberg-Marquardt algorithm and the general regression neural network produced a sum-of-squares error within 11.1% of each other. The potential for using neural networks for residual life prediction and the advantage of incorporating condition-based data into the model were proven for both examples.
Subjective Evaluation of Forms in an Immersive Environment
Venue: arXiv cs.HC 2007
Year: 2007

User's perception of product, by essence subjective, is a major topic in marketing and industrial design. Many methods, based on users' tests, are used so as to characterise this perception. We are interested in three main methods: multidimensional scaling, semantic differential method, and preference mapping. These methods are used to built a perceptual space, in order to position the new product, to specify requirements by the study of user's preferences, to evaluate some product attributes, related in particular to style (aesthetic). These early stages of the design are primordial for a good orientation of the project. In parallel, virtual reality tools and interfaces are more and more efficient for suggesting to the user complex feelings, and creating in this way various levels of perceptions. In this article, we present on an example the use of multidimensional scaling, semantic differential method and preference mapping for the subjective assessment of virtual products. These products, which geometrical form is variable, are defined with a CAD model and are proposed to the user with a spacemouse and stereoscopic glasses. Advantages and limitations of such evaluation is next discussed..
Kinematics analysis of the parallel module of the VERNE machine
Venue: arXiv cs.RO 2007
Year: 2007

The paper derives the inverse and forward kinematic equations of a spatial three-degree-of-freedom parallel mechanism, which is the parallel module of a hybrid serial-parallel 5-axis machine tool. This parallel mechanism consists of a moving platform that is connected to a fixed base by three non-identical legs. Each leg is made up of one prismatic and two pair spherical joint, which are connected in a way that the combined effects of the three legs lead to an over-constrained mechanism with complex motion. This motion is defined as a simultaneous combination of rotation and translation.
An Algorithm for Computing Cusp Points in the Joint Space of 3-RPR Parallel Manipulators
Venue: arXiv cs.RO 2007
Year: 2007

This paper presents an algorithm for detecting and computing the cusp points in the joint space of 3-RPR planar parallel manipulators. In manipulator kinematics, cusp points are special points, which appear on the singular curves of the manipulators. The nonsingular change of assembly mode of 3-RPR parallel manipulators was shown to be associated with the existence of cusp points. At each of these points, three direct kinematic solutions coincide. In the literature, a condition for the existence of three coincident direct kinematic solutions was established, but has never been exploited, because the algebra involved was too complicated to be solved. The algorithm presented in this paper solves this equation and detects all the cusp points in the joint space of these manipulators.
HMM Speaker Identification Using Linear and Non-linear Merging Techniques
Venue: arXiv cs.LG 2007
Year: 2007

Speaker identification is a powerful, non-invasive and in-expensive biometric technique. The recognition accuracy, however, deteriorates when noise levels affect a specific band of frequency. In this paper, we present a sub-band based speaker identification that intends to improve the live testing performance. Each frequency sub-band is processed and classified independently. We also compare the linear and non-linear merging techniques for the sub-bands recognizer. Support vector machines and Gaussian Mixture models are the non-linear merging techniques that are investigated. Results showed that the sub-band based method used with linear merging techniques enormously improved the performance of the speaker identification over the performance of wide-band recognizers when tested live. A live testing improvement of 9.78% was achieved
Principal Component Analysis and Automatic Relevance Determination in Damage Identification
Venue: arXiv cs.CE 2007
Year: 2007

This paper compares two neural network input selection schemes, the Principal Component Analysis (PCA) and the Automatic Relevance Determination (ARD) based on Mac-Kay's evidence framework. The PCA takes all the input data and projects it onto a lower dimension space, thereby reduc-ing the dimension of the input space. This input reduction method often results with parameters that have significant influence on the dynamics of the data being diluted by those that do not influence the dynamics of the data. The ARD selects the most relevant input parameters and discards those that do not contribute significantly to the dynamics of the data being modelled. The ARD sometimes results with important input parameters being discarded thereby compromising the dynamics of the data. The PCA and ARD methods are implemented together with a Multi-Layer-Perceptron (MLP) network for fault identification in structures and the performance of the two methods is as-sessed. It is observed that ARD and PCA give similar accu-racy levels when used as input-selection schemes. There-fore, the choice of input-selection scheme is dependent on the nature of the data being processed.
Option Pricing Using Bayesian Neural Networks
Venue: arXiv cs.CE 2007
Year: 2007

Options have provided a field of much study because of the complexity involved in pricing them. The Black-Scholes equations were developed to price options but they are only valid for European styled options. There is added complexity when trying to price American styled options and this is why the use of neural networks has been proposed. Neural Networks are able to predict outcomes based on past data. The inputs to the networks here are stock volatility, strike price and time to maturity with the output of the network being the call option price. There are two techniques for Bayesian neural networks used. One is Automatic Relevance Determination (for Gaussian Approximation) and one is a Hybrid Monte Carlo method, both used with Multi-Layer Perceptrons.
A Game-Theoretic Approach to Energy-Efficient Modulation in CDMA Networks with Delay QoS Constraints
Venue: arXiv cs.IT 2007
Year: 2007

A game-theoretic framework is used to study the effect of constellation size on the energy efficiency of wireless networks for M-QAM modulation. A non-cooperative game is proposed in which each user seeks to choose its transmit power (and possibly transmit symbol rate) as well as the constellation size in order to maximize its own utility while satisfying its delay quality-of-service (QoS) constraint. The utility function used here measures the number of reliable bits transmitted per joule of energy consumed, and is particularly suitable for energy-constrained networks. The best-response strategies and Nash equilibrium solution for the proposed game are derived. It is shown that in order to maximize its utility (in bits per joule), a user must choose the lowest constellation size that can accommodate the user's delay constraint. This strategy is different from one that would maximize spectral efficiency. Using this framework, the tradeoffs among energy efficiency, delay, throughput and constellation size are also studied and quantified. In addition, the effect of trellis-coded modulation on energy efficiency is discussed.
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
Venue: arXiv cs.IT 2007
Year: 2007

An information-theoretic approach is proposed to watermark embedding and detection under limited detector resources. First, we consider the attack-free scenario under which asymptotically optimal decision regions in the Neyman-Pearson sense are proposed, along with the optimal embedding rule. Later, we explore the case of zero-mean i.i.d. Gaussian covertext distribution with unknown variance under the attack-free scenario. For this case, we propose a lower bound on the exponential decay rate of the false-negative probability and prove that the optimal embedding and detecting strategy is superior to the customary linear, additive embedding strategy in the exponential sense. Finally, these results are extended to the case of memoryless attacks and general worst case attacks. Optimal decision regions and embedding rules are offered, and the worst attack channel is identified.
On the Hopcroft's minimization algorithm
Venue: arXiv cs.DS 2007
Year: 2007

We show that the absolute worst case time complexity for Hopcroft's minimization algorithm applied to unary languages is reached only for de Bruijn words. A previous paper by Berstel and Carton gave the example of de Bruijn words as a language that requires O(n log n) steps by carefully choosing the splitting sets and processing these sets in a FIFO mode. We refine the previous result by showing that the Berstel/Carton example is actually the absolute worst case time complexity in the case of unary languages. We also show that a LIFO implementation will not achieve the same worst time complexity for the case of unary languages. Lastly, we show that the same result is valid also for the cover automata and a modification of the Hopcroft's algorithm, modification used in minimization of cover automata.
CDMA Technology for Intelligent Transportation Systems
Venue: arXiv cs.NI 2007
Year: 2007

Scientists and Technologists involved in the development of radar and remote sensing systems all over the world are now trying to involve themselves in saving of manpower in the form of developing a new application of their ideas in Intelligent Transport system(ITS). The world statistics shows that by incorporating such wireless radar system in the car would decrease the world road accident by 8-10% yearly. The wireless technology has to be chosen properly which is capable of tackling the severe interferences present in the open road. A combined digital technology like Spread spectrum along with diversity reception will help a lot in this regard. Accordingly, the choice is for FHSS based space diversity system which will utilize carrier frequency around 5.8 GHz ISM band with available bandwidth of 80 MHz and no license. For efficient design, the radio channel is characterized on which the design is based. Out of two available modes e.g. Communication and Radar modes, the radar mode is providing the conditional measurement of the range of the nearest car after authentication of the received code, thus ensuring the reliability and accuracy of measurement. To make the system operational in simultaneous mode, we have started the Software Defined Radio approach for best speed and flexibility.
Elementary transformation analysis for Array-OL
Venue: arXiv cs.PL 2007
Year: 2007

Array-OL is a high-level specification language dedicated to the definition of intensive signal processing applications. Several tools exist for implementing an Array-OL specification as a data parallel program. While Array-OL can be used directly, it is often convenient to be able to deduce part of the specification from a sequential version of the application. This paper proposes such an analysis and examines its feasibility and its limits.
On tractability and congruence distributivity
Venue: arXiv cs.CC 2007
Year: 2007

Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An important class of algebras are those that generate congruence distributive varieties and included among this class are lattices, and more generally, those algebras that have near-unanimity term operations. An algebra will generate a congruence distributive variety if and only if it has a sequence of ternary term operations, called Jonsson terms, that satisfy certain equations. We prove that constraint languages consisting of relations that are invariant under a short sequence of Jonsson terms are tractable by showing that such languages have bounded relational width.
Unequal dimensional small balls and quantization on Grassmann Manifolds
Venue: arXiv cs.IT 2007
Year: 2007

The Grassmann manifold G_{n,p}(L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space L^{n}, where L is either R or C. This paper considers an unequal dimensional quantization in which a source in G_{n,p}(L) is quantized through a code in G_{n,q}(L), where p and q are not necessarily the same. It is different from most works in literature where p\equiv q. The analysis for unequal dimensional quantization is based on the volume of a metric ball in G_{n,p}(L) whose center is in G_{n,q}(L). Our chief result is a closed-form formula for the volume of a metric ball when the radius is sufficiently small. This volume formula holds for Grassmann manifolds with arbitrary n, p, q and L, while previous results pertained only to some special cases. Based on this volume formula, several bounds are derived for the rate distortion tradeoff assuming the quantization rate is sufficiently high. The lower and upper bounds on the distortion rate function are asymptotically identical, and so precisely quantify the asymptotic rate distortion tradeoff. We also show that random codes are asymptotically optimal in the sense that they achieve the minimum achievable distortion with probability one as n and the code rate approach infinity linearly. Finally, we discuss some applications of the derived results to communication theory. A geometric interpretation in the Grassmann manifold is developed for capacity calculation of additive white Gaussian noise channel. Further, the derived distortion rate function is beneficial to characterizing the effect of beamforming matrix selection in multi-antenna communications.
Using Genetic Algorithms to Optimise Rough Set Partition Sizes for HIV Data Analysis
Venue: arXiv cs.NE 2007
Year: 2007

In this paper, we present a method to optimise rough set partition sizes, to which rule extraction is performed on HIV data. The genetic algorithm optimisation technique is used to determine the partition sizes of a rough set in order to maximise the rough sets prediction accuracy. The proposed method is tested on a set of demographic properties of individuals obtained from the South African antenatal survey. Six demographic variables were used in the analysis, these variables are; race, age of mother, education, gravidity, parity, and age of father, with the outcome or decision being either HIV positive or negative. Rough set theory is chosen based on the fact that it is easy to interpret the extracted rules. The prediction accuracy of equal width bin partitioning is 57.7% while the accuracy achieved after optimising the partitions is 72.8%. Several other methods have been used to analyse the HIV data and their results are stated and compared to that of rough set theory (RST).
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
Venue: arXiv cs.CG 2007
Year: 2007

Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Frèchet distance. In this paper, for the first time, we consider the Voronoi diagram of polygonal chains in $d$-dimension ($d=2,3$) under the discrete Frèchet distance. Given $n$ polygonal chains ${\cal C}$ in $d$-dimension ($d=2,3$), each with at most $k$ vertices, we prove fundamental properties of such a Voronoi diagram {\em VD}$_F({\cal C})$ by presenting the first known upper and lower bounds for {\em VD}$_F({\cal C})$.
A stochastic non-cooperative game for energy efficiency in wireless data networks
Venue: arXiv cs.IT 2007
Year: 2007

In this paper the issue of energy efficiency in CDMA wireless data networks is addressed through a game theoretic approach. Building on a recent paper by the first two authors, wherein a non-cooperative game for spreading-code optimization, power control, and receiver design has been proposed to maximize the ratio of data throughput to transmit power for each active user, a stochastic algorithm is here described to perform adaptive implementation of the said non-cooperative game. The proposed solution is based on a combination of RLS-type and LMS-type adaptations, and makes use of readily available measurements. Simulation results show that its performance approaches with satisfactory accuracy that of the non-adaptive game, which requires a much larger amount of prior information.
Recovering Multiplexing Loss Through Successive Relaying Using Repetition Coding
Venue: arXiv cs.IT 2007
Year: 2007

In this paper, a transmission protocol is studied for a two relay wireless network in which simple repetition coding is applied at the relays. Information-theoretic achievable rates for this transmission scheme are given, and a space-time V-BLAST signalling and detection method that can approach them is developed. It is shown through the diversity multiplexing tradeoff analysis that this transmission scheme can recover the multiplexing loss of the half-duplex relay network, while retaining some diversity gain. This scheme is also compared with conventional transmission protocols that exploit only the diversity of the network at the cost of a multiplexing loss. It is shown that the new transmission protocol offers significant performance advantages over conventional protocols, especially when the interference between the two relays is sufficiently strong.
Open Access Publishing in Particle Physics: A Brief Introduction for the non-Expert
Venue: arXiv cs.DL 2007
Year: 2007

Open Access to particle physics literature does not sound particularly new or exciting, since particle physicists have been reading preprints for decades, and arXiv.org for 15 years. However new movements in Europe are attempting to make the peer-reviewed literature of the field fully Open Access. This is not a new movement, nor is it restricted to this field. However, given the field's history of preprints and eprints, it is well suited to a change to a fully Open Access publishing model. Data shows that 90% of HEP published literature is freely available online, meaning that HEP libraries have little need for expensive journal subscriptions. As libraries begin to cancel journal subscriptions, the peer review process will lose its primary source of funding. Open Access publishing models can potentially address this issue. European physicists and funding agencies are proposing a consortium, SCOAP3, that might solve many of the objections to traditional Open Access publishing models in Particle Physics. These proposed changes should be viewed as a starting point for a serious look at the field's publication model, and are at least worthy of attention, if not adoption.
MI image registration using prior knowledge
Venue: arXiv cs.CV 2007
Year: 2007

Subtraction of aligned images is a means to assess changes in a wide variety of clinical applications. In this paper we explore the information theoretical origin of Mutual Information (MI), which is based on Shannon's entropy.However, the interpretation of standard MI registration as a communication channel suggests that MI is too restrictive a criterion. In this paper the concept of Mutual Information (MI) is extended to (Normalized) Focussed Mutual Information (FMI) to incorporate prior knowledge to overcome some shortcomings of MI. We use this to develop new methodologies to successfully address specific registration problems, the follow-up of dental restorations, cephalometry, and the monitoring of implants.
Subjective Information Measure and Rate Fidelity Theory
Venue: arXiv cs.IT 2007
Year: 2007

Using fish-covering model, this paper intuitively explains how to extend Hartley's information formula to the generalized information formula step by step for measuring subjective information: metrical information (such as conveyed by thermometers), sensory information (such as conveyed by color vision), and semantic information (such as conveyed by weather forecasts). The pivotal step is to differentiate condition probability and logical condition probability of a message. The paper illustrates the rationality of the formula, discusses the coherence of the generalized information formula and Popper's knowledge evolution theory. For optimizing data compression, the paper discusses rate-of-limiting-errors and its similarity to complexity-distortion based on Kolmogorov's complexity theory, and improves the rate-distortion theory into the rate-fidelity theory by replacing Shannon's distortion with subjective mutual information. It is proved that both the rate-distortion function and the rate-fidelity function are equivalent to a rate-of-limiting-errors function with a group of fuzzy sets as limiting condition, and can be expressed by a formula of generalized mutual information for lossy coding, or by a formula of generalized entropy for lossless coding. By analyzing the rate-fidelity function related to visual discrimination and digitized bits of pixels of images, the paper concludes that subjective information is less than or equal to objective (Shannon's) information; there is an optimal matching point at which two kinds of information are equal; the matching information increases with visual discrimination (defined by confusing probability) rising; for given visual discrimination, too high resolution of images or too much objective information is wasteful.