ppxscal/embedding_network huggingface dataset:
Large vocabulary speech recognition in French
Authors: M. Adda-Decker
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We present some design considerations concerning our large vocabulary continuous speech recognition system in French. The impact of the epoch of the text training material on lexical coverage, language model perplexity and recognition performance on newspaper texts is demonstrated. The effectiveness of larger vocabulary sizes and larger text training corpora for language modeling is investigated. French is a highly inflected language producing large lexical variety and a high homophone rate. About 30% of recognition errors are shown to be due to substitutions between inflected forms of a given root form. When word error rates are analysed as a function of word frequency, a significant increase in the error rate can be measured for frequency ranks above 5000.
Structure of n-uninorms
Authors: Prabhakar Akella
Venue: Fuzzy Sets and Systems (2007)

In this paper we study binary operators on [0,1] which are associative, monotone non-decreasing in both variables and commutative (AMC) with neutral element. In this work, we generalize the concept of neutral element and this generalization gives rise to a new class of AMC binary operators on [0,1] called n-uninorms. n-Uninorms are denoted as U^n, where n comes from the generalization of the neutral element. We study the structure of n-uninorms. The structure resembles an ordinal sum structure made up of n uninorms. We characterize some special cases of them based on some continuity considerations and show that t-norms, t-conorms, uninorms and nullnorms (t-operators) are special cases of n-uninorms. We also show that given n there are n+1 classes of operators in U^n and each of them has many subclasses. We also study the Frank equation involving n-uninorms and show that we need to consider only n-uninorms for the study. Finally, we show that the total number of subclasses of operators in U^n follows the famous series called Catalan Numbers.
A neural network for data association
Authors: M. Winter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper presents a new neural solution for solving the data association problem. This problem, also known as the multidimensional assignment problem, arises in data fusion systems like radar and sonar targets tracking, robotic vision... Since it leads to an NP-complete combinatorial optimization, the optimal solution can not be reached in an acceptable calculation time, and the use of approximation methods like the Lagrangian relaxation is necessary. In this paper, we propose an alternative approach based on a Hopfield neural model. We show that it converges to an interesting solution that respects the constraints of the association problem. Some simulation results are presented to illustrate the behaviour of the proposed neural solution for an artificial association problem.
Audio vs. Chat: The Effects of Group Size on Media Choice
Authors: Andreas Lober, Gerhard Schwabe, Sibylle Grimm
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The increasing usage of audio and chat communication in private and commercial cooperative settings requires new insight into choosing the appropriate media for collaborative tasks. The paper presents the results of two series of experiments comparing audio and chat communication with varying group sizes. The experimental data indicates that chat scales up better to an increase in group size than audio. We propose that the media richness theory appropriately predicts the productivity of small groups, while the media characteristics proposed by the theory of media synchronicity as well as media speed can be used to predict larger group productivity.
Exploiting interleaving semantics in symbolic state-space generation
Authors: Gianfranco Ciardo, Gerald Lüttgen, Andrew S. Miner
Venue: Formal Methods in System Design (2007)

Symbolic techniques based on Binary Decision Diagrams (BDDs) are widely employed for reasoning about temporal properties of hardware circuits and synchronous controllers. However, they often perform poorly when dealing with the huge state spaces underlying systems based on interleaving semantics, such as communications protocols and distributed software, which are composed of independently acting subsystems that communicate via shared events.This article shows that the efficiency of state-space exploration techniques using decision diagrams can be drastically improved by exploiting the interleaving semantics underlying many event-based and component-based system models. A new algorithm for symbolically generating state spaces is presented that (i) encodes a model's state vectors with Multi---valued Decision Diagrams (MDDs) rather than flattening them into BDDs and (ii) partitions the model's Kronecker---consistent next---state function by event and subsystem, thus enabling multiple lightweight next---state transformations rather than a single heavyweight one. Together, this paves the way for a novel iteration order, called saturation, which replaces the breadth---first search order of traditional algorithms. The resulting saturation algorithm is implemented in the tool SMART, and experimental studies show that it is often several orders of magnitude better in terms of time efficiency, final memory consumption, and peak memory consumption than existing symbolic algorithms.
Experimental comparison of signal subspace based noise reduction methods
Authors: P. S. K. Hansen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The signal subspace approach for non-parametric speech enhancement is considered. Several algorithms have been proposed in the literature but only partly analyzed. Here, the different algorithms are compared, and the emphasis is put onto the limiting factors and practical behavior of the estimators. Experimental results show that the signal subspace approach may lead to a significant enhancement of the signal to noise ratio of the output signal.
Analysis and resynthesis of musical instrument sounds using energy separation
Authors: R. B. Sussman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Energy separation algorithms using Teager's energy operator have been used to analyze modulations in speech resonances, and energy separation in bird song. Here we apply energy separation and the energy operator to the analysis and resynthesis of musical instrument sounds. We show how the energy operator can be used to (a) examine vibrato and tremolo (b) precisely determine frequencies of harmonics (c) determine synthesis parameters for an excitation/filter model.
SPICE: Evolving IMS to Next Generation Service Platforms
Authors: Sasu Tarkoma, Christian Prehofer, Anna V. Zhdanova, Klaus Moessner, Erno Kovacs
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Today's wireless and mobile services are typically monolithic and often centralized in nature, which limits heterogeneous service access and shared service usage. New sources of revenue for providers are expected to include tailored, personalized, and dynamically composed services that are fast to market, cost efficient, and provide compelling user experience. To meet these market needs, the SPICE service platform extends the IP Multimedia Subsystem (IMS) by supporting added-value services that are composed of more basic services. The platform is presented through the architecture and through scenarios showing the interactions between the platform and its service components. We describe the IMS role and functions in SPICE, and the use of ontology and Semantic Web technologies for integrated knowledge management in such mobile service platforms.
Holistic Sensing and Active Displays for Intelligent Driver Support Systems
Authors: Mohan M. Trivedi, Shinko Y. Cheng
Venue: Computer (2007)

A multidisciplinary research effort at UCSD focuses on the design, development, and evaluation of novel computational frameworks for vehicle-based safety systems. The dynamic active display presents visual alerts to the driver based on the surrounding environment, vehicle dynamics, and driver's state as well as a driver-intent analysis and situational awareness system.
An embedded adaptive multi-rate wideband speech coder
Authors: A. McCree
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents a multi-rate wideband speech coder with bit rates from 8 to 32 kb/s. The coder uses a splitband approach, where the input signal, sampled at 16 kHz, is split into two equal frequency bands from 0-4 kHz and 4-8 kHz, each of which is decimated to an 8 kHz sampling rate. The lower band is coded using the adaptive multi-rate (AMR) family of high-quality narrowband speech coders, while the higher band is represented by a simple but effective parametric model. A complete solution including this wideband speech coder, channel coding for various GSM channels, and dynamic rate adaptation, easily passed all Selection Rules and ranked second overall in the 3GPP AMR Wideband Selection Testing. Besides the high performance, additional advantages of the embedded split-band approach include ease of implementation, reduced complexity, and simplified interoperation with narrowband speech coders.
The evolved radio and its implications for modelling the evolution of novel sensors
Authors: J. Bird, P. Layzell
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Sensor evolution research typically uses evolutionary algorithms (EAs) to generate sensors that near-optimally satisfy large numbers of constraints. This is qualitatively different from the phylogenetic process found in nature that has resulted, for example, in the mammalian auditory ossicles evolving from the jaw bones of amphibians and reptiles, that in turn had previously acted as gill arches in fish. This paper describes an evolvable hardware experiment that resulted in a network of transistors sensing and utilising the radio waves emanating from nearby PCs. We argue that this evolved 'radio' is only the second device ever whose sensors were constructed in a way that in key aspects is analogous to that found in nature. We highlight the advantages and disadvantages of this approach and show why it is practically impossible to implement a similar process in simulation.
Benefits of Synchronized-Measurement Technology for Power-Grid Applications
Authors: Damir Novosel, Khoi Vu, Virgilio Centeno, Srdjan Skok, Miroslav Begovic
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Power grid's traditional security assessment approach - based on SCADA data and off-line studies conducted long in advance of real time operations - are becoming increasingly problematic for real time operations because they cannot fully anticipate all the conditions faced by operators. New technologies that rely on accurate, high-resolution, real-time monitoring of actual (not hypothesized) system conditions using synchronized measurement technologies are needed to support the real-time operations. The purpose of these tools and systems is to monitor, assess, enable, and ultimately, automatically take the necessary control action to prevent or mitigate problems in real time. The proposed applications of synchronized measurements for power grids will provide the realtime operating staff with previously unavailable yet greatly needed tools to avoid grid instabilities, and to monitor generator's response to abnormal excursions in system frequency. The objective of this paper is to point out benefits of using synchronized measurements for selected realtime applications, to summarize ongoing projects and experience worldwide, and emphasize the need for a practical roadmap toward greater deployment of the technology.
Restructuring Variability in Software Product Lines using Concept Analysis of Product Configurations
Authors: Felix Loesch, Erhard Ploedereder
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

The management of variability plays an important role in successful software product line engineering. As the set of products that is derived from the product line and their requirements are constantly changing, the variability in the product line needs to evolve as well. A typical problem in in such an evolution scenario is that the number of variable features and variants will explode, and thus become unmanageable. One of the reasons for this explosion is that obsolete variable features are not removed. In order to address this problem, we present a new method for restructuring and simplifying the provided variability in a software product line. Our method is based on concept analysis. It analyzes the realized variability in a software product line, and constructs a lattice that provides a classification of the usage of variable features in real products derived from the product line. We show how this classification can be used to derive restructuring strategies for variability that solve the problem of variability explosion. The effectiveness of our method is demonstrated by presenting a case study of restructuring the variability in a large industrial software product line.
Development of new functions and scripting capabilities in JavaA-DSP for easy creation and seamless integration of animated DSP simulations in Web courses
Authors: A. Spanias
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Arizona State University (ASU) has developed an on-line DSP laboratory that is based on an object-oriented Java tool called Java Digital Signal Processing (J-DSP). J-DSP is currently being used in a senior-level DSP course at ASU. J-DSP has a rich suite of signal processing functions that facilitate interactive on-line simulations of modern statistical signal and spectral analysis algorithms, filter design tools, QMF banks, and speech analysis. We present a series of significant functionality extensions of J-DSP enabling on-line laboratories in the systems-related areas of communications, image processing, and control. The extensions in communications are presented in some detail. In addition to these important functionality extensions, we present enhancements in the infrastructure of J-DSP that provide embedded scripting capabilities. Scripts enable easy creation and seamless integration of interactive animations in DSP Web content. The latter is very important for instructors creating their own DSP-related Web courses as it provides for user-friendly development of interactive visualization modules through the J-DSP applets.
A traffic control algorithm in diverse home networks through priority reassignment
Authors: Seung-ok Lim, Kwang-mo Jung, Kyeung-hak Seo
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

In recent years, many families have personal computers (PCs) and use the Internet service with high-speed modems. So providing high quality network services and connecting home devices together in a network are main issues in home networking. As the need of functional factors is increased in the home network, it is obvious that the home network data traffic have increased as well. For that reason, a key technology of home network services is how to manage the traffic and provide efficient data services between a wide area network (WAN) and home networks, and also within diverse home networks. There are mainly three data traffic types in the home network: control data traffic, Internet/non-real-time data, and multimedia data (include non-real-time and real-time multimedia data). To manage these kinds of traffic, we design a priority-based traffic control scheme and propose an efficient and adaptive traffic control algorithm through priority reassignment.
JouleQuest: An Accurate Power Model for the StarCore DSP Platform
Authors: Ashish Mathur, Sourav Roy, Rajat Bhatia, Arup Chakraborty, Vijay Bhargava, Jatin Bhartia
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper describes the design, validation and integration of JouleQuest: a comprehensive power estimation framework for the StarCore DSP platform. The goal of this work is to provide a power model coupled to a fast platform simulator, that can accurately predict the power variability on the platform. The power consumption model for the DSP core is an instruction level model while the power models for the peripheral components are based on functional operations executed by the blocks. The DSP core instruction level power model is a generic model applicable to any VLIW DSP core and improves on existing VLIW models by reducing the model complexity to O(n) where n is the number of processor instructions. The peripheral power models are based on a novel technique of characterizing the power of operations and operation sequences executed on the peripheral block. This allows accurate power modeling for complex peripheral blocks like cache controllers, arbiters etc. having significant parallel operation execution. The platform power has been verified to give an average error of approximately 5% across a large suite of DSP and control benchmarks having high power variability. The paper concludes with a case study demonstrating the usage of the power simulator for energy optimization of ITU-T G.729 speech-codec software.
The Indicator Browser: A Web-Based Interface for Visualizing UrbanSim Simulation Results
Authors: Yael Schwartzman, Alan Borning
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

UrbanSim is a large scale land use and transportation simulator that models the possible long-term effects of different policies on urban regions. The output is presented using indicators, which are variables that convey information on significant aspects of the simulation results. To support their use, we designed and implemented the Indicator Browser, a webbased interface for visualizing and browsing indicator results in the form of tables, charts, or maps. This interface was designed and evaluated via design techniques including Value Sensitive Design, paper prototyping, and frequent user testing. The Indicator Browser was implemented on top of an evolving system, developed using agile test-first software development strategies. This paper presents the Indicator Browser as an illustrative e-government infrastructure case study. We describe its interface and system design, implementation process, and evaluation by a set of potential users, and discuss our plans for deployment.
Constructing pairwise disjoint paths with few links
Authors: Himanshu Gupta, Rephael Wenger
Venue: ACM Transactions on Algorithms (TALG) (2007)

Let P be a simple polygon and let &lcub;(u1, u&prime;1), (u2, u&prime;2),&hellip;,(um, u&prime;m)&rcub; be a set of m pairs of distinct vertices of P, where for every distinct i, j &le; m, there exist pairwise disjoint (nonintersecting) paths connecting ui to u&prime;i and uj to u&prime;j. We wish to construct m pairwise disjoint paths in the interior of P connecting ui to u&prime;i for i &equals; 1, &hellip;,m, with a minimal total number of line segments. We give an approximation algorithm that constructs such a set of paths using O(M) line segments in O(n log m &plus; M log m) time, where M is the number of line segments in the optimal solution and n is the size of the polygon.
Text to diagram to symbol: representational transformations in problem-solving
Authors: W. M. McCracken
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Central to engineering problem solving is what we call representational transformation. Such transformations are built upon community-sanctioned practices often referred to as "back of the envelope" calculations. First a problem statement (text) is translated into a sketch (diagram) which visually articulates the essential problem parts. Mechanical models and free-body diagrams are instances of this first transformation. The qualitative model is then transformed into a set of mathematical formulae (symbols), which drive the problem solution. Thus, the problem is solved using three types of representational systems: textual, diagrammatic and symbolic. At each step the engineer translates information from one representational system to another, enacting an abstract cultural algorithm. The knowledge necessary to undertake these transformations is described in this paper in the context of multi-literacies. We propose that a large part of learning engineering problem solving is in fact learning the relationships between the multiple languages of problem solving.
Hybrid distributed iterative capacity allocation over Bluetooth network
Authors: J. S. Baras, H. Schioler, O. B. Madsen
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

With the current development of mobile devices, short range wireless communications have become more and more popular, and many researches on short range wireless communications, such as Bluetooth, have gained special interests, in industry as well as in academy. This paper analyzes capacity allocation issues in Bluetooth network as a convex optimization problem. We formulate the problem of maximizing the total network flows and minimizing the costs of flows. The hybrid distributed capacity allocation scheme is proposed as an approximated solution of the formulated problem that satisfies quality of service requirements and constraints in Bluetooth network, such as limited capacity, decentralized, frequent changes of topology and of capacities assigned to nodes in the network. The simulation shows that the performance of Bluetooth could be improved by applying the hybrid distributed iterative capacity allocation scheme.
Gaussian Mean-Shift Is an EM Algorithm
Authors: Miguel A. Carreira-Perpinan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

The mean-shift algorithm, based on ideas proposed by Fukunaga and Hostetler [16], is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density estimate. Mean-shift can be used as a nonparametric clustering method and has attracted recent attention in computer vision applications such as image segmentation or tracking. We show that, when the kernel is Gaussian, mean-shift is an expectation-maximization (EM) algorithm and, when the kernel is non-Gaussian, mean-shift is a generalized EM algorithm. This implies that mean-shift converges from almost any starting point and that, in general, its convergence is of linear order. For Gaussian mean-shift, we show: 1) the rate of linear convergence approaches 0 (superlinear convergence) for very narrow or very wide kernels, but is often close to 1 (thus, extremely slow) for intermediate widths and exactly 1 (sublinear convergence) for widths at which modes merge, 2) the iterates approach the mode along the local principal component of the data points from the inside of the convex hull of the data points, and 3) the convergence domains are nonconvex and can be disconnected and show fractal behavior. We suggest ways of accelerating mean-shift based on the EM interpretation.