ppxscal/embedding_network huggingface dataset:
An E-M algorithm for joint model estimation
Authors: P. M. Baggenstoss
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In the unlabeled data problem, data contains signals from various sources whose identities are not known apriori, yet the parameters of the individual sources must be estimated. To do this optimally, it is necessary to optimize the data PDF which may be modeled as a mixture density, jointly over the parameters of all the signal models. This can present a problem of enormous complexity if the number of signal classes is large. This paper describes a algorithm for jointly estimating the parameters of the various signal types, each with different parameterizations and associated sufficient statistics. In doing so, it maximizes the likelihood function of all the parameters jointly, but does so without incurring the full dimensionality of the problem. It allows lower-dimensional sufficient statistics to be utilized for each signal model, yet still achieves joint optimality. It uses an extension of the class-specific decomposition of the Bayes minimum error probability classifier.
A modified Eckart post-beamformer filter for improved detection using broadband features
Authors: S. K. Mehta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

The problem of signal detection using passive sonar signal processing methods to extract features is addressed. We propose a modified Eckart post-beamformer filter to obtain better estimates of the signal and in particular the broadband component of the signal. The physical processes motivating the study are broadband features which are usually ignored in conventional narrowband detection and classification processors. Broadband features can arise from various sources like transients, propulsion mechanisms, cavitation, and hydrodynamic flow and are often present even in the absence of narrowband features. We separate the narrowband and broadband components of the signal and extract the broadband features from the noise normalized signal components which has high energy and a wide frequency extent compared to the center frequency. Preliminary results suggest that broadband based detection and classification performance outperforms methods that use only narrowband features.
Optimal warping prediction for video coding
Authors: A. Nosratinia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Warping, also known as control grid interpolation, estimates intensities in the present frame through an interpolation of motion vectors-typically with bilinear interpolation. This paper presents a method for computing optimal interpolation parameters for warping prediction. Conventional bilinear warping, while mostly effective, has been known to exhibit unreliable performance in certain situations. Since both block-matching (BMA) and bilinear warping are candidate solutions for optimal warping, the performance of optimal warping is lower bounded by both bilinear warping and BMA, therefore vastly reducing the inconsistency problem. Furthermore, this optimality criterion is applicable to any category of motion vector, including that of block-matching. Thus we are able to demonstrate the optimal usage, under linear operations in the motion domain, of BMA motion vectors.
A new technique for characterization of digital-to-analog converters in high-speed systems
Authors: Jafar Savoj, Ali-Azam Abbasfar, Amir Amirkhany, Bruno W. Garlepp, Mark A. Horowitz
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In this paper, a new technique for characterization of digital-to-analog converters (DAC) used in wideband applications is described. Unlike the standard narrowband approach, this technique employs Least Square Estimation to characterize the DAC from dc to any target frequency. Characterization is performed using a random sequence with certain temporal and probabilistic characteristics suitable for intended operating conditions. The technique provides a linear estimation of the system and decomposes nonlinearity into higher-order harmonics and deterministic periodic noise. The technique can also be used to derive the impulse response of the converter, predict its operating bandwidth, and provide far more insight into its sources of distortion.
Inference in symmetric alpha-stable noise using MCMC and the slice sampler
Authors: S. Godsill
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We have previously shown how to perform inference about symmetric stable processes using Monte Carlo EM (MCEM) and Markov chain Monte Carlo (MCMC) techniques. Simulation based methods such as these are an excellent tool for inference with stable law distributions, since they do not require any direct evaluation of the stable density function, which is unavailable analytically in the general case. We review the existing methods for inference with MCMC and propose new methods based on the slice sampler, a very simple sampling algorithm which draws points from a uniform distribution over the area under the required density function. There is some evidence in the literature that the slice sampler has better convergence properties than the independence Metropolis samplers and rejection samplers previously proposed. We investigate this in the context of alpha-stable noise distributions.
Toward a differential geometric model for stereo vision: curves and surfaces
Authors: Steven W. Zucker
Venue:  (2006)

Stereo vision is a fundamental task in computer vision. It addresses the problem of reconstructing the 3D scene from two (or more) 2D images. The central problem in stereo is determining correspondence, or the matching of locations in one image to locations in the other on the basis of local properties such as pixel intensity, or other features. The key to success is resolving matching ambiguities. Although many matching constraints exist in computer vision, many of them are either heuristic or incorrect when applied to scenes with rich, natural structures. A rigorous study of matching constraints is therefore needed, and in this thesis the problem is approached geometrically. In particular, a frame based differential geometric analysis for the stereo reconstruction of curves and surfaces is analyzed and developed into a set of differential geometric constraints for both curve matching and surface dense stereo. The derived differential geometric consistency in effect exploits contextual information geometrically, and examples show it has resulted in much improved feature-based and surface dense stereo algorithms for complex natural scenes.
Pontryagin principle of maximum for the quantum problem of speed
Authors: P. A. Golvinskii
Venue: Automation and Remote Control (2007)

The Pontryagin principle of maximum as originally formulated for the classical dynamic systems, was extended to the quantum systems with a finite number of states of the discrete spectrum. The principle was derived on the basis of equivalence of the matrix representation of the Schrödinger equation to the system of ordinary differential equations. An example of the problem of speed for generation of the given-structure wave package was considered.
A proposed stereo matching algorithm for noisy sets of color images
Authors: Lior Shamir
Venue: Computers Geosciences (2007)

Modeling the world in three dimensions has been attracting a growing interest both in applications and science. In many cases, such 3D models are achieved by triangulating corresponding features recorded by several images of the same field taken from different points of view. This, however, requires the ability to match corresponding image elements detected in different images. In this paper, an algorithm for stereo matching in noisy pairs of outdoor images is described. The proposed algorithm applies a standard window-based correlation, but uses a fuzzy logic-based similarity function that models the HSV color space. This fuzzy logic modeling allows a robust color comparison that can tolerate a certain degree of changes in the illumination conditions and can be used for finding corresponding pixels in noisy sets of images. While the proposed algorithm does not introduce an improvement over existing methods in ideal conditions, experiments suggest that it provides significantly better results when the images in the set are relatively different from each other, and can be effective for matching corresponding features in images taken in different weather conditions, different positions of the sun, different optics or other real-life situations in which pinhole conditions are not available.
Computational aspects of the coarsening at random model and the Shapley value
Authors: Baokun Li, Tonghui Wang
Venue: Information Sciences: an International Journal (2007)

This paper is concerned with computational aspects of coarse data in information technology. A method for calculating the CAR (coarsening at random) model of a finite random set is obtained, and a formula for computing the Shapley value using the distribution of the random set is given. The relationship between the CAR model solution and the Shapley value is also discussed. Several examples are given to illustrate our results.
Nesting System with Quantization and Knowledge Base Applied
Authors: Leszek Koszalka, Grzegorz Chmaj
Venue: Proceedings of the Second International Conference on Systems (2007)

Nesting algorithms deal with placing twodimensional shapes on the given canvas. In this paper a binary way of solving the nesting problem is proposed. Geometric shapes are quantized into binary form, which is used to operate on them. After finishing nesting they are converted back into original geometrical form. Investigations showed, that there is a big influence of quantization accuracy for the nesting effect. However, greater accuracy results with longer time of computation. The proposed knowledge base system is able to strongly reduce the computational time.
A Framework for Architecture-Level Lifetime Reliability Modeling
Authors: Jeonghee Shin, Victor Zyuban, Zhigang Hu, Jude A. Rivers, Pradip Bose
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

This paper tackles the issue of modeling chip lifetime reliability at the architecture level. We propose a new and robust structure-aware lifetime reliability model at the architecture-level, where devices only vulnerable to failure mechanisms and the effective stress condition of these devices are taken into account for the failure rate of microarchitecture structures. In addition, we present this reliability analysis framework based on a new concept, called the FIT of reference circuit or FORC, which allows architects to quantify failure rates without having to delve into low-level circuit- and technology-specific details of the implemented architecture. This is done through a onetime characterization of a reference circuit needed to quantify the reference FITs for each class of modeled failure mechanisms for a given technology and implementation style. With this new reliability modeling framework, architects are empowered to proceed with architecture-level reliability analysis independent of technological and environmental parameters.
Application of ARMA modeling to the improvement of weight estimations in fruit sorting and grading machinery
Authors: J. V. Frances
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Accurate weighting of pieces in different sorts of conveyor belts or articulated chains at fast speed is a key feature in many industrial processes. This paper presents a procedure to improve the performance, whether increasing speed or accuracy, of the load-cell-based weighting subsystem in a fruit sorting and grading machine to achieve an accuracy of /spl plusmn/1 gram at a speed of 20 fruits per seconds. The proposed solution includes a signal preprocessing based on a previous ARMA modeling of the weighting subsystem response plus a power line-noise removal and a simple sample averaging in the plateau. The procedure has been tested off-line using real signals acquired from a prototype machine.
Investigations of the Quality of Hospital Electric Power Supply and the Tolerance of Medical Electric Devices to Voltage Dips
Authors: Eisuke Hanada, Shuuya Itoga, Kyoko Takano, Takato Kudou
Venue: Journal of Medical Systems (2007)

Medical devices driven by electric power have come to be commonly used in hospitals, and rapid changes of voltage or current can easily cause them to fail. A stable and high quality power supply is indispensable in order to maintain safety in the modern clinical setting. Therefore, we investigated the quality of the power supply in a hospital and determined the tolerance of 13 pieces of medical equipment to voltage dips. The results showed little distortion of the voltage wave. However, we found an approximately 7% momentary voltage dip caused by lightening and other problems, such as 2 to 5% periodic drops in voltage and voltage wave distortions caused by incorrect grounding. In a tolerance test, the settings of some medical devices were changed at the time of automatic reboot after a disturbance. For another device, trend information was initialized.
Testing k-wise and almost k-wise independence
Authors: Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In this work, we consider the problems of testing whether adistribution over (0,1n) is k-wise (resp. (ε,k)-wise) independentusing samples drawn from that distribution. For the problem of distinguishing k-wise independent distributions from those that are δ-far from k-wise independence in statistical distance, we upper bound the number ofrequired samples by Õ(nk/δ2) and lower bound it by Ω(nk-1/2/δ) (these bounds hold for constantk, and essentially the same bounds hold for general k). Toachieve these bounds, we use Fourier analysis to relate adistribution's distance from k-wise independence to its biases, a measure of the parity imbalance it induces on a setof variables. The relationships we derive are tighter than previouslyknown, and may be of independent interest. To distinguish (ε,k)-wise independent distributions from thosethat are δ-far from (ε,k)-wise independence in statistical distance, we upper bound thenumber of required samples by O(k log n / δ2ε2) and lower bound it by Ω(√ k log n / 2k(ε+δ)√ log 1/2k(ε+δ)). Although these bounds are anexponential improvement (in terms of n and k) over thecorresponding bounds for testing k-wise independence, we give evidence thatthe time complexity of testing (ε,k)-wise independence isunlikely to be poly(n,1/ε,1/δ) for k=Θ(log n),since this would disprove a plausible conjecture concerning the hardness offinding hidden cliques in random graphs. Under the conjecture, ourresult implies that for, say, k = log n and ε = 1 / n0.99,there is a set of (ε,k)-wise independent distributions, and a set of distributions at distance δ=1/n0.51 from (ε,k)-wiseindependence, which are indistinguishable by polynomial time algorithms.
Resource modalities in game semantics
Authors: Paul-Andre Mellies, Nicolas Tabareau
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is more primitive than game semantics. We advocate the contrary here: that game semantics is conceptually more primitive than linear logic. Starting from this revised point of view, we design a categorical model of resources in game semantics, and construct an arena game model where the usual notion of bracketing is extended to multi-bracketing in order to capture various resource policies: linear, affine and exponential.
On the End-to-End Delay Analysis of the IEEE 802.11 Distributed Coordination Function
Authors: J. S. Vardakas, I. Papapanagiotou, M. D. Logothetis, S. A. Kotsopoulos
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

The IEEE 802.11 protocol is the dominant standard for Wireless Local Area Networks (WLANs) and has generated much interests in investigating and improving its performance. The IEEE 802.11 Medium Access Control (MAC) is mainly based on the Distributed Coordination Function (DCF). DCF uses a Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol in order to resolve contention between wireless stations and to verify successful transmissions. In this paper we present an extensive investigation of the performance of the IEEE 802.11b MAC protocol, in respect of end-to-end delay. The end-to-end delay analysis of the IEEE 802.11b has not been completed, because no adequate queuing delay is provided. Our delay analysis is based on Bianchi's model for the DCF, while a more comprehensive model could be used as well. We use z-transform of backoff duration to get mean value, variance and probability distribution of MAC delay. From the mean value and the variance of the MAC delay we determine the mean queuing delay in each station. Our analysis is validated by simulation results for both the Basic and RTS/CTS access mechanisms of the DCF. The accuracy of the analysis found to be quite satisfactory. We assume data rates of 1, 5.5 and 11 Mbps, in order to highlight the effect of the bit rate on delay performance for both access mechanisms.
Localization of Ear Using Outer Helix Curve of the Ear
Authors: Saeeduddin Ansari, Phalguni Gupta
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper presents an efficient approach for localization of ear from an arbitrary 2-D side face image with varying background. Outer helix curves of ears moving parallel to each other are used as feature for localizing ear in an image. Using Canny edge detector edges are extracted from the whole image. These edges are segmented in convex and concave edges. From these segmented edges expected outer helix edges are determined after eliminating non-ear edges. Final outer helix edge of an ear is constructed using expected outer helix curves. Decision is made on a constructed curve whether it belongs to outer helix of ear or not. This technique is implemented on IITK, India database containing 700 samples. Accuracy of localization is more than 93%.
Checkpointing Using Mobile Agents in Distributed Systems
Authors: Partha Sarathi Mandal, Krishnendu Mukhopadhyaya
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Traditional message passing based checkpointing and rollback recovery algorithms perform well for tightly coupled systems. In wide area distributed systems these algorithms may suffer from large overhead due to message passing delay and network traffic. Mobile agents offer an attractive option for designing checkpointing schemes for wide area distributed systems. Network topology is assumed to be arbitrary. Processes are mobile agent enabled. When a process wants to take a checkpoint, it just creates one mobile agent. Concurrent initiations by multiple processes are allowed. Synchronization and creation of a consistent global state (CGS) for checkpointing is managed by the mobile agent(s). In the worst case, for k concurrent initiations among n processes, checkpointing algorithm requires a total of O(kn) hops by all the mobile agents. A mobile agent carries O(n/k) (on the average) size data.
Interior point least squares estimation: exploiting transient convergence in MMSE decision-feedback equalization
Authors: K. H. Afkhamie
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

In many communication systems training sequences are used to help the receiver identify and/or equalize the channel. The amount of training data required depends on the convergence properties of the adaptive filtering algorithms used for equalization. In this paper we propose the use of a new adaptive filtering method, interior point least squares (IPLS), for adaptive equalization. One of the main features of the algorithm is its fast transient convergence: it thus requires fewer training bits than for example RLS. We apply the IPLS algorithm to update the weight vector for a minimum-mean-square-error decision-feedback equalizer (MMSE-DFE)in a CDMA downlink scenario. Numerical simulations show that when training sequences are short IPLS consistently outperforms RLS in terms of system bit-error-rate. As the training sequence gets longer IPLS matches the performance of the RLS algorithm.
Marrying words and trees
Authors: Rajeev Alur
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this paper, we argue that nested words and automata over nested words offer a better way to capture and process the dual structure. Nested words generalize both words and ordered trees, and allow both word and tree operations. We study various classes of automata over nested words, and show that while they enjoy expressiveness and succinctness benefits over word and tree automata, their analysis complexity and closure properties are analogous to the corresponding word and tree special cases. In particular, we show that finite-state nested word automata can be exponentially more succinct than tree automata, and pushdown nested word automata include the two incomparable classes of context-free word languages and context-free tree languages.
Toward a Commodity Enterprise Middleware
Authors: John O'Hara
Venue: Queue (2007)

Can AMQP enable a new era in messaging middleware? AMQP (Advanced Message Queuing Protocol) was born out of my own experience and frustrations in developing front- and back-office processing systems at investment banks. It seemed to me that we were living in integration Groundhog Day - the same problems of connecting systems together would crop up with depressing regularity. Each time the same discussions about which products to use would happen, and each time the architecture of some system would be curtailed to allow for the fact that the chosen middleware was reassuringly expensive.
Systems administration of scientific computing on NT
Authors: Rémy Evard, Michail Gomberg
Venue: Proceedings of the 1997 Workshop on Large Scale System Administration of Windows NT (1997)

Traditionally, scientific computing has been performed on large and expensive UNIX-based supercomputers. The advent of high quality commodity hardware and software has the potential to decrease the cost of scientific computing and change the way in which it is performed. We describe the Chicago Pile 6 - a network of computers running Windows NT, built in order to prototype scientific computing methods in this type of environment. We discuss the administrative requirements for the system and our approaches to administering it.