Word confidence measure based on frame likelihood score

The automatic recognition of natural or close to natural speech is linked to the problem of detection of “new” or “unknown” words. These are the words or the nonverbal acoustical events that do not belong to the speech recognition system’s vocabulary. In this paper we consider a new method for the estimation of confidence score for words at the output of the recognition system based on a likelihood score of the signal frame. The method and confidence measure could be used, for example, for out-of-vocabulary (OOV) word detection and rejection. The text was submitted by the authors in English. Minh T. Nguyen received the MS degree in computer sciences from Moscow State University in 2004. In 2004 he began postgraduate studies at the Computing Centre, Russian Academy of Sciences. He is working on development and evaluation of confidence measures for speech recognition. Vladimir J. Chuchupal received the MS degree in mathematics from Moscow State Pedagogical Institute in 1976. He received his Candidate of Sciences degree from the Computing Centre, USSR Academy of Sciences, in 1984 completing his dissertation work in noisy speech enhancement methods. Since 1984 he has been with the Speech Recognition subdivision of the Computing Centre, Russian Academy of Sciences, where he works on speech recognition problems. Currently he is the head of the subdivision.     

Equilibrium analysis through separation of user and network behavior

Internet complexity makes reasoning about traffic equilibrium difficult, partly because users react to congestion. This difficulty calls for an analytic technique that is simple, yet have enough details to capture user behavior and flexibly address a broad range of issues.This paper presents such a technique. It treats traffic equilibrium as a balance between an inflow controlled by users, and an outflow controlled by the network (link capacity, congestion avoidance, etc.). This decomposition is demonstrated with a surfing session model, and validated with a traffic trace and NS2 simulations.The technique’s accessibility and breadth are illustrated through an analysis of several issues concerning the location, stability, robustness and dynamics of traffic equilibrium.     

Adaptive robust fuzzy control for path tracking of a wheeled mobile robot

This paper proposes an adaptive robust fuzzy control scheme for path tracking of a wheeled mobile robot with uncertainties. The robot dynamics including the actuator dynamics is considered in this work. The presented controller is composed of a fuzzy basis function network (FBFN) to approximate an unknown nonlinear function of the robot complete dynamics, an adaptive robust input to overcome the uncertainties, and a stabilizing control input. The stability and the convergence of the tracking errors are guaranteed using the Lyapunov stability theory. When the controller is designed, the different parameters for two actuator models in the dynamic equation are taken into account. The proposed control scheme does not require the accurate parameter values for the actuator parameters as well as the robot parameters. The validity and robustness of the proposed control scheme are demonstrated through computer simulations. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Efficient Multimedia Distribution in Source Constraint Networks

In recent years, the number of peer-to-peer (P2P) applications has increased significantly. One important problem in many P2P applications is how to efficiently disseminate data from a single source to multiple receivers on the Internet. A successful model used for analyzing this problem is a graph consisting of nodes and edges, with a capacity assigned to each edge. In some situations however, it is inconvenient to use this model. To that end, we propose to study the problem of efficient data dissemination in a source constraint network. A source constraint network is modeled as a graph in which, the capacity is associated with a node, rather than an edge. The contributions of this paper include (a) a quantitative data dissemination in any source constraint network, (b) a set of topologies suitable for data dissemination in P2P networks, and (c) an architecture and implementation of a P2P system based on the proposed optimal topologies. We will present the experimental results of our P2P system deployed on PlanetLab nodes demonstrating that our approach achieves near optimal throughput while providing scalability, low delay and bandwidth fairness among peers.     

Gene expression changes in a transgenic mouse model overexpressing human wildtype and mutant torsinA

Primary torsion dystonia is an autosomal-dominantly inherited, neurodevelopmental movement disorder caused by a GAG deletion (ΔGAG) in the DYT1 gene, encoding torsinA. This mutation is responsible for approximately 70% of cases of early-onset primary torsion dystonia. The function of wildtype torsinA is still unknown, and it is unsolved how the deletion in the DYT1 gene contributes to the development of the disease. To better understand the molecular processes involved in torsinA pathology, we used genome-wide oligonucleotide microarrays to characterize gene expression patterns in the striatum of mouse models overexpressing the human wildtype and mutant torsinA. By this approach we were able to detect gene expression changes that seem to be specific for torsinA pathology. We found an impact of torsinA, independent from genotype, on vesicle trafficking, exocytosis, and neurotransmitter release in our mouse model. In addition, we were able to identify several new pathways and processes involved in the development of the nervous system that are affected by wildtype and mutant torsinA. Furthermore, we have striking evidence from our gene expression data that glutamate receptor mediated synaptic plasticity in the striatum is the affected underlying cellular process for impaired motor learning in human ΔGAG torsinA transgenic mice.     

Heroin related overdose problems

During the first ten months of 1992 the Oslo Ambulance Department registered 716 incidences of assumed drug-related intoxications. 80% happened in down town Oslo. 19 cases of asystoly were recorded, 13 of the patients recovered after treatment, without sequelae. Five of these patients left the location after emergency help and they refused hospitalization. 432 of the patients were unconscious when the ambulance personal arrived, 472 were treated with naloxone both by the intramuscular and the intravenous route. Most of the persons refused further observation. A team of specially trained out reach workers offers help after acute medical treatment by means of "streetwork". The intervention is directed at addicts who have experienced an overdose.     

Performance evaluation of priority CSMA-CA mechanism on ISA100.11a wireless network

The International Society of Automation recently released ISA100.11a as an open standard for reliable wireless networks for industrial automation. ISA100.11a uses the TDMA scheme in the medium access layer to provide deterministic services. However, ISA100.11a adopts the CSMA-CA mechanism with priorities for retransmission from failure on dedicated links, sporadic data, and network configuration.This paper evaluates ISA100.11a CSMA-CA by simulation, considering the effects of backoff procedures and priority settings to probability of collision and successful use of slots. It's demonstrated that a high number of priority classes enable better network utilization resulting in less number of packets exceeding their lifetime.     

Pre‐convolved Radiance Caching

The incident indirect light over a range of image pixels is often coherent. Two common approaches to exploit this inter‐pixel coherence to improve rendering performance are Irradiance Caching and Radiance Caching. Both compute incident indirect light only for a small subset of pixels (the cache), and later interpolate between pixels. Irradiance Caching uses scalar values that can be interpolated efficiently, but cannot account for shading variations caused by normal and reflectance variation between cache items. Radiance Caching maintains directional information, e.g., to allow highlights between cache items, but at the cost of storing and evaluating a Spherical Harmonics (SH) function per pixel. The arithmetic and bandwidth cost for this evaluation is linear in the number of coefficients and can be substantial. In this paper, we propose a method to replace it by an efficient per‐cache item pre‐filtering based on MIP maps — such as previously done for environment maps — leading to a single constant‐time lookup per pixel. Additionally, per‐cache item geometry statistics stored in distance‐MIP maps are used to improve the quality of each pixel's lookup. Our approximate interactive global illumination approach is an order of magnitude faster than Radiance Caching with Phong BRDFs and can be combined with Monte Carlo‐raytracing, Point‐based Global Illumination or Instant Radiosity.     

A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem

The two-echelon location-routing problem (LRP-2E) is raised by the design of transportation networks with two types of trips: first-level trips serving from one main depot a set of satellite depots, to be located, and second-level trips supplying customers from these satellites. In the proposed multi-start iterated local search (MS-ILS), three greedy randomized heuristics are used cyclically to get initial solutions. Each ILS run alternates between two search spaces: LRP-2E solutions, and travelling salesman (TSP) tours covering the main depot and the customers. The number of iterations allotted to a run is reduced whenever a known solution (stored in a tabu list) is revisited. MS-ILS can be reinforced by a path-relinking procedure (PR), used internally for intensification, as post-optimization, or both. On two sets with 24 and 30 LRP-2E instances, MS-ILS outperforms on average two GRASP algorithms and adding PR brings a further improvement. Our metaheuristic also surpasses a tabu search on 30 instances for a more general problem with several main depots. It is still effective on a particular case, the capacitated location-routing problem (CLRP): In a comparison with four published metaheuristics, only one (LRGTS, Prins et al., 2007) does better.     

Comportement électrocatalytique vis à vis de la réduction d'oxygène des oxydes mixtes AxByMn3−(x+y)O4

Résumé Les résultats expérimentaux présentés dans cette étude et ceux publiés précédemment montrent que l'électroréduction de l'oxygène se fait dans les sites actifs formés par des ions Mn⁴⁺, et que ceux de Mn³⁺ assurent le transport des électrons au sein du solide.

---

From the results obtained in this study and those presented in previous publications, it can be deduced that the electroreduction of oxygen occurs via electron transfers at active sites created by Mn⁴⁺ ions and that Mn³⁺ ions contribute to the transport of the electrons through the bulk of the electrocatalysts.

---

---

Certains de ces résultats ont fait l'object d'une communication enPoster à la réunion I.S.E. à Varna, Septembre 1977.

---

A=Zn, Cr, Al;B = Ni, Cu; et 0 x,y 1.