ppxscal/embedding_network huggingface dataset:
Automatic dialect identification of extemporaneous conversational, Latin American Spanish speech
Authors: M. A. Zissman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

A dialect identification technique is described that takes as input extemporaneous, conversational speech spoken in Latin American Spanish and produces as output a hypothesis of the dialect. The system has been trained to recognize Cuban and Peruvian dialects of Spanish, but could be extended easily to other dialects (and languages) as well. Building on our experience in automatic language identification, the dialect-ID system uses an English phone recognizer trained on the TIMIT corpus to tokenize training speech spoken in each Spanish dialect. Phonotactic language models generated from this tokenized training speech are used during testing to compute dialect likelihoods for each unknown message. This system has an error rate of 16% on the Cuban/Peruvian two-alternative forced-choice test. We introduce the new "Miami" Latin American Spanish speech corpus that is capable of supporting our research efforts into the future.
Efficient extraction of evoked potentials by combination of Wiener filtering and subspace methods
Authors: A. Cichocki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

A novel approach is proposed in order to reduce the number of sweeps (trials) required for the efficient extraction of the brain evoked potentials (EP). This approach is developed by combining both the Wiener filtering and the subspace methods. First, the signal subspace is estimated by applying the singular-value decomposition (SVD) to an enhanced version of the raw data obtained by Wiener filtering. Next, estimation of the EP data is achieved by orthonormal projection of the raw data onto the estimated signal subspace. Simulation results show that combination of both methods provides much better capability than each of them separately.
Problems and Techniques
Authors: Ilspe Ipsen
Venue: SIAM Review (2007)

The Super Bowl is the annual championship game of professional American football, the National Football League (NFL). A coin toss determines which team kicks off and which one receives. This coin toss is big business in Las Vegas, spawning bets worth millions of dollars. In the past 12 years, 9 tosses came up tails and only 3 came up heads. Why so many tails and so few heads? Persi Diaconis, Susan Holmes, and Richard Montgomery may have found an explanation in their paper Dynamical Bias in the Coin Toss, based on a fascinating mixture of mechanics, probability distributions, and high speed cameras. If you want to be a millionaire, SIAM Review is here to help! In the second paper, A Hybrid Approach for Efficient Robust Design of Dynamic Systems, Martin Mo&uml;nnigmann and his five coauthors are concerned with optimizing models for chemical processes such as fermentation (think of yeast producing alcohol in the brewing of beer). If such a process operates on a continuous basis, one needs to find optimal equilibrium solutions for the underlying model. Say, for example, that one would like to determine the yeast concentration that maximizes the amount of alcohol in the beer. If bacteria can affect the yeast concentration, one also needs to be assured that the fermentation process remains stable, even when yeast concentrations fluctuate slightly. With the help of bifurcation theory, interval arithmetic, and nonlinear solvers, the authors derive a strategy for computing such solutions. Prost! (That&rsquo;s German for &ldquo;cheers.&rdquo;) A Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization by Jean-Baptiste Hiriart-Urruty is one of the more unusual papers in the Problems and Techniques section. The fourteen very different problems include a question posed by Newton in 1686 (what is the shape of a body that offers minimal resistance in a fluid?); issues in matrix theory (which real symmetric matrices can be simultaneously diagonalized with a single congruence transformation?); and solutions to eikonal equations (which smooth functions $f$ over which domains satisfy $\|\nabla f(x)\| = 1$?). Each problem comes with a precise description, a short history, and a digestible set of references.
Insuring Big Losses Due to Security Breaches through Insurance: A Business Model
Authors: Arunabha Mukhopadhyay, Samir Chatterjee, Rahul Roy, Debashis Saha, Ambuj Mahanti, Samir K. Sadhukhan
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Security breaches deter e-commerce activities. Organizations spend millions of dollars on security appliances to make online transactions more secure. Nonetheless, a new virus or a clever hacker can easily compromise these deterrents and cause losses of millions of dollars annually. To reduce the impact of such losses, e-risk insurance is a viable complement to the security devices. Currently, e-risk insurance is in its developmental stage and small claim coverage is only available. In this paper, we provide a framework, for insurance companies to duly accept large e-risk. Splitting a large risk across layers reduces the overall variance of the loss. Also in case of a contingency the loss indemnification is shared. The inputs to the proposed model are the risk transfer proportion, overloading for premium, expected return on capital and undistributed risk at each layer. The model outputs the optimal number of layers in which the risk needs to be spilt by the insurance company and the interlayer relationships.
Multi-Party Key Agreement in Password-Based Setting
Authors: Ratna Dutta
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

In this work, we study the problem of designing efficient password-based encrypted key agreement protocol in multi-party scenario. Recently, Dutta-Barua proposed a constant round group key agreement DB, which is a simple variant of Burmester-Desmedt protocol BD. In this paper, we present a simple and elegant contributory group key agreement in passwordbased setting, derived from the protocol DB. We have made several modifications in the protocol DB and then enhance it to password-based setting. The security of the proposed scheme against dictionary attacks is in the ideal cipher model under Decision Diffie- Hellman (DDH) assumption. We analyze our protocol in the security framework formalized by Bellare et al. Our proposed scheme achieves efficiency over the work of Bresson et al. in terms of both computation and communication power.
A light-weight static approach to analyzing UML behavioral properties
Authors: Lijun Yu, Robert B. France, Indrakshi Ray, Kevin Lano
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Identifying and resolving design problems in the early design phase can help ensure software quality and save costs. There are currently few tools for analyzing designs expressed using the Unified Modeling Language (UML). Tools such as OCLE and USE support analysis of static structural properties. These tools provide mechanisms for checking instance models against invariant properties expressed using the Object Constraint Language (OCL). In this paper we propose an approach to analyzing behavioral properties of UML models that can utilize static analysis tools. The approach includes a technique for generating a class model of behavior from operation specifications expressed in a restricted form of OCL Behavioral properties are expressed as invariants defined in the class model of behavior. Static analysis tools such as USE and OCLE can be used to check object models describing series of snapshots. Most of the analysis can be automated. We illustrate our approach by analyzing static separation of duty and dynamic separation of duty properties of a hierarchical role-based access control model (HRBAC).
Validation of the sub-circuit modelling approach for substrate resistance in 0.13 μm RF MOSFETs
Authors: Alberto Carbajo, Kevin G. McCarthy
Venue: Analog Integrated Circuits and Signal Processing (2007)

Great progress has been made on modelling the behaviour of deep-submicron MOS devices, especially concentrating on the performance and operation of the intrinsic device structures. To properly represent the RF performance of these devices, the extrinsic structure must also be considered and a variety of sub-circuit configurations, especially for the substrate, have been proposed. As the frequency of operation rises, it may be expected that more elaborate multi-element substrate sub-circuits will become necessary. Here, we consider the RF operation of advanced 0.13 μm NMOS transistors up to 10 GHz and demonstrate that a simple sub-circuit, using only a single resistor, allows accurate simulation of the two-port parameters, including y 22. We thus demonstrate that the single-resistor substrate sub-circuit approach remains a simple, yet valid, modelling option for MOS simulation up to 10 GHz.
Robust Recurrent Neural Network Control of Biped Robot
Authors: Yilei Wu, Qing Song, Xulei Yang
Venue: Journal of Intelligent and Robotic Systems (2007)

In this paper, a recurrent neural network (RNN) control scheme is proposed for a biped robot trajectory tracking system. An adaptive online training algorithm is optimized to improve the transient response of the network via so-called conic sector theorem. Furthermore, L 2-stability of weight estimation error of RNN is guaranteed such that the robustness of the controller is ensured in the presence of uncertainties. In consideration of practical applications, the algorithm is developed in the discrete-time domain. Simulations for a seven-link robot model are presented to justify the advantage of the proposed approach. We give comparisons between the standard PD control and the proposed RNN compensation method.
Segmentation and classification of hand-drawn pictogram in cluttered scenes-an integrated approach
Authors: S. Muller
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A new approach to identification of handwritten symbols in arbitrary complex environments is presented. 20 different pictograms drawn in different backgrounds can be identified with a recognition accuracy of 90%. In order to perform this challenging task, we use pattern spotting techniques based on pseudo 2-D hidden Markov models (P2DHMMs). Practical applications of our approach can be found in many typical multimedia document processing tasks, such as localization and recognition of non-rigid objects in image databases, detection of objects in complex scenes, finding trademarks in presence of clutter within videos, processing distorted document images in digital libraries, or content-based image retrieval based on handwritten query symbols.
Uniformly most powerful cyclic permutation invariant detection for discrete-time signals
Authors: F. Nicolls
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The uniformly most powerful invariant (UMPI) test is derived for detecting a target with unknown location in a noise sequence. This test has the property that for each possible target location it has the greatest power of all tests which are invariant to cyclic permutations of the observations. The test is compared to the generalised likelihood ratio test (GLRT), which is commonly used as a solution to this detection problem. Monte-Carlo simulations show that the powers of the two tests are comparable, thereby justifying near-optimality of the GLRT.
Staircasing in semidiscrete stabilised inverse linear diffusion algorithms
Authors: M. Breuí, M. Welk
Venue: Journal of Computational and Applied Mathematics (2007)

We consider a semidiscrete model problem for the approximation of stabilised inverse linear diffusion processes. The work is motivated by an important observation on fully discrete schemes concerning the so-called staircasing phenomenon: when sharpening monotone data profiles, fully discrete methods generally introduce stepfunction-type solutions reminiscent of staircases. In this work, we show by an analysis of dynamical systems in corresponding semidiscrete formulations that already the semidiscrete numerical model contains the relevant information on the occurrence of staircasing. Numerical experiments confirm and complement the theoretical results.
Simultaneous registration of multiple point sets using orthonormal matrices
Authors: J. A. Williams
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We present a novel solution to the problem of simultaneously registering multiple corresponding point sets with rigid transformations. The proposed technique involves the pre-computation of a constant matrix which completely encodes the registration problem, followed by an iterative procedure to estimate the optimal rotations. From the estimated rotations, the optimal translations are then computed directly. Experimental results on both synthetic and real data demonstrate the algorithm's performance in terms of accuracy and efficiency.
Model validation for mapping specification behaviors to processing elements
Authors: S. Abdi, D. Gajski
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

Increase in system level modeling has given rise to a need for efficient functional validation of models above cycle accurate level. This paper presents a technique for checking functional equivalence of system level models, before and after the distribution of behaviors in the specification over components in the platform architecture. We derive a control flow graph from models written in system level design languages (SLDLs) and reduce it to a normal form representation using well defined rules. Two models having identical normal form are shown to be functionally equivalent. An equivalence checker based on the above concept is used to automatically check if the architecture level model is functionally equivalent to the specification model. As a result, the models generated for various mapping decisions do not have to be reverified using costly simulations.
Constraint qualification in a general class of Lipschitzian mathematical programming problems
Authors: Tong Zishuang, X. J. Zheng
Venue: Journal of Global Optimization (2007)

The Kuhn---Tucker type necessary optimality conditions are given for the problem of minimizing the sum of a differentiable function and a locally Lipschitzian function subject to a set of differentiable nonlinear inequalities on a convex subset C of $$\mathbb{R}^{n}$$ , under the condition of a generalized Kuhn---Tucker constraint qualification or a generalized Arrow---Hurwicz---Uzawa constraint qualification. The case when the set C is open is shown to be a special one of our results, which helps us to improve some of the existing results in the literature. To finish we consider several test problems.
Error Recovery Problems
Authors: A. Lesiak, P. Gawkowski, J. Sosnowski
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

The paper deals with the problem of handling detected faults in computer systems. We present software procedures targeted at fault detection, fault masking and error recovery. They are discussed in the context of standard PC Windows and Linux environments. Various aspects of checkpointing and recovery policies are studied. The presented considerations are illustrated with some experimental results obtained in our fault injection testbench.
A Non-Photorealistic Rendering Images By A Handheld Device
Authors: Lin Hsin Hsin
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

From phantom haptic devices, 3D mouse to multimodal interfaces, while the academics contend about the similarities and differences in theoretical approaches and understanding of the next generation of interfaces in the pursuit of formulating research directions; researchers are actively pursuing the emergence of the next generation of human-computer interaction predictions, discussing emerging new interaction styles and interface designs; few or almost none has discussed the exquisite offerings, the use and merits of using simply the age old two-button mechanical mouse in the artistic interactive taxonomy. This paper presents an exclusive range of results created by the autonomous, ubiquitous and pervasive handheld interaction of the mechanical mouse. It discusses the tangible interfaces -- lightweight, tacit, passive, perceptual and non-command line interaction interface. The core of this framework is founded of an event-based dab-and-scribe, press-and-release dexterity in a discrete or continuous process as an user interface widget. It eliminates the necessity of extra input layers, offers instant visualization and demonstrates the embodied interfaces of this handheld device technology. This approach and practice establishes that such handheld device is an indispensable tool that offers endto- end solution from instant conceptualization to visualization thus bridging the gap between desire, creative thinking and realization that reigns. The author, creator of an extensive repertoire of NPR images, compares the sensitivity of this wired two-button mechanical roller ball mouse versus a high precision laser mouse while she profiles the futility of the wireless self-powered optical mouse as well as the pen tablet.
Design and performance evaluation of web caching algorithms
Authors: Wei K. Tsai
Venue:  (2006)

In this dissertation we address the problem of evaluating performance of web caching replacement algorithms. By developing a model that is able to generate adjustable, representative and realistic workloads of proxies, we provide a fair evaluation environment and investigate how certain algorithms perform with different user access patterns. The second aspect of our approach is that we present a new caching algorithm called "Bucket" to optimize the use of disk throughput which is always the bottleneck in today's user-server communication. The "Bucket" algorithm considers both the reference frequency and the fetching cost when making a replacement decision. We apply the Lagrange multiplier theory to obtain the optimal solutions for hit rate, byte hit rate, latency and disk throughput. We then utilize the trace-driven simulation to prove the performance gain. Furthermore, we develop an analytic cache model to estimate the system bus throughput that is efficient to analyze variant design options without real implementation.
A Report of Campus-Wide IT Authentication Platform System Development in Osaka University
Authors: Toyokazu Akiyama, Yuuichi Teranishi, Shingo Okamura, Eisaku Sakane, Go Hasegawa, Ken-ichi Baba, Hirotaka Nakano, Shinji Shimojo
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Cybermedia Center, Osaka University (CMC) is now developing Campus-wide IT Authentication Platform System (CITAPS). In this paper, we will report the current status of CITAPS development. Before installing CITAPS, Unified Account System (UAS) served as an authentication platform system. First of all, we will describe the issues in UAS, and then we will show how to solve these issues in CITAPS and the future works.
Determination of data matrix dimensions for subspace-based parameter estimation algorithms
Authors: Yinong Ding
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper provides an analytical solution to the problem of determining the data matrix dimensions when a subspace-based algorithm is used to estimate parameters from a noisy signal. A unified expression of mean squared errors (MSEs) of signal parameter estimates is given first in terms of singular values and singular vectors. This expression is then generalized so that the MSEs are a function of physical parameters such as the data length, the signal frequency spacing, and the number of rows of the data matrix formed for the use of a subspace-based algorithm. When all the physical parameters except the data matrix dimensions are fixed, the mean squared errors of the signal parameter estimate are a function of the data matrix dimension. The optimal matrix dimensions, which correspond to the minima of the error function, can then be determined. Examples using synthetic data are included to demonstrate the significance of the results.
A Fast and Accurate Tensor-based Optical Flow Algorithm Implemented in FPGA
Authors: Zhaoyi Wei, Dah-Jye Lee, Brent Nelson, Michael Martineau
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Many computer vision applications require realtime processing of image data. This requirement is especially critical for autonomous vehicles performing obstacle avoidance, path planning, and target tracking tasks. A quickly calculated and relatively rough motion estimate is more useful for autonomous navigation than a more accurate, but slowly calculated estimate. Recent technology advancements in small unmanned air and ground vehicles make many low-cost surveillance and military applications possible. Most of these applications demand a low power, compact, light weight, and high speed computation platform for processing image data in real time. In most cases, the traditional general purpose processor and sequentially executed software approach does not meet these requirements. In this paper, a tensorbased optical flow algorithm is modified and implemented using field programmable gate array (FPGA) for small unmanned vehicle obstacle avoidance and navigation.
Fault Detection Using Differential Flatness in Flight Guidance Systems
Authors: Wen Chi Lu, Rabbah Fellouah, Geanina Andrei, N. Zhang, F. Mora-Camino, A. Doncescu
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

In this paper, flight guidance dynamics are shown to be implicit differentially flat with respect to the inertial position of an aircraft. This prove the existence of a set of relations between these flat outputs and the state variables representative of flight guidance dynamics and between these flat outputs and the basic inputs to flight guidance dynamics. A neural network is introduced to obtain, from the actual trajectory, nominal flight parameters which can be compared with actual values to detect abnormal behaviour.
Minimax robust time-frequency filters for nonstationary signal estimation
Authors: G. Matz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We introduce minimax robust time-varying Wiener filters and show a result that facilitates their calculation. Reformulation in the time-frequency domain yields simple closed-form expressions of minimax robust time-frequency Wiener filters based on three different uncertainty models. For one of these filters, an efficient implementation using the multi-window Gabor transform is proposed.
On optimal and universal nonlinearities for blind signal separation
Authors: H. Mathis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The search for universally applicable nonlinearities in blind signal separation has produced nonlinearities that are optimal for a given distribution, as well as nonlinearities that are most robust against model mismatch. This paper shows yet another justification for the score function, which is in some sense a very robust nonlinearity. It also shows that among the class of parameterizable nonlinearities, the threshold nonlinearity with the threshold as a parameter is able to separate any non-Gaussian distribution, a fact that is also proven in this paper.