ppxscal/embedding_network huggingface dataset:
Discriminative keyword spotting
Authors: Joseph Keshet, David Grangier, Samy Bengio
Venue: Speech Communication (2009)

This paper proposes a new approach for keyword spotting, which is based on large margin and kernel methods rather than on HMMs. Unlike previous approaches, the proposed method employs a discriminative learning procedure, in which the learning phase aims at achieving a high area under the ROC curve, as this quantity is the most common measure to evaluate keyword spotters. The keyword spotter we devise is based on mapping the input acoustic representation of the speech utterance along with the target keyword into a vector-space. Building on techniques used for large margin and kernel methods for predicting whole sequences, our keyword spotter distills to a classifier in this vector-space, which separates speech utterances in which the keyword is uttered from speech utterances in which the keyword is not uttered. We describe a simple iterative algorithm for training the keyword spotter and discuss its formal properties, showing theoretically that it attains high area under the ROC curve. Experiments on read speech with the TIMIT corpus show that the resulted discriminative system outperforms the conventional context-independent HMM-based system. Further experiments using the TIMIT trained model, but tested on both read (HTIMIT, WSJ) and spontaneous speech (OGI Stories), show that without further training or adaptation to the new corpus our discriminative system outperforms the conventional context-independent HMM-based system.
Scheduling with limited information in wireless systems
Authors: Prasanna Chaporkar, Alexandre Proutiere, Himanshu Asnani, Abhay Karandikar
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Opportunistic scheduling is a key mechanism for improving the performance of wireless systems. However, this mechanism requires that transmitters are aware of channel conditions (or CSI, Channel State Information) to the various possible receivers. CSI is not automatically available at the transmitters, rather it has to be acquired. Acquiring CSI consumes resources, and only the remaining resources can be used for actual data transmissions. We explore the resulting trade-off between acquiring CSI and exploiting channel diversity to the various receivers. Specifically, we consider a system consisting of a transmitter and a fixed number of receivers/users. An infinite buffer is associated to each receiver, and packets arrive in this buffer according to some stochastic process with fixed intensity. We study the impact of limited channel information on the stability of the system. We characterize its stability region, and show that an adaptive queue length-based policy can achieve stability whenever doing so is possible. We formulate a Markov Decision Process problem to characterize this queue length-based policy. In certain specific and yet relevant cases, we explicitly compute the optimal policy. In general case, we provide a scheduling policy that achieves a fixed fraction of the system's stability region. Scheduling with limited information is a problem that naturally arises in cognitive radio systems, and our results can be used in these systems.
Unsupervised Cross-Domain Learning by Interaction Information Co-clustering
Authors: Shin Ando, Einoshin Suzuki
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In real-world data mining applications, one often has access to multiple datasets that are relevant to the task at hand. However, learning from such datasets can be difficult as they are often drawn from different domains, i.e., not identically distributed or differ in class or feature sets. In this paper, we consider the problem of learning the class structures %, unique and shared, of related domains in an unsupervised manner. Its setting generalizes that of information filtering and novelty detection applications which addresses both known and unknown classes. We propose a co-clustering framework for estimating and adapting the class structures of two related domains, {enabling the analyses of shared and unique classes.} We define an objective function using interaction information to take account of the divergence between the corresponding clusters of respective domains. We present an iterative algorithm which alternates object and feature clustering and converges to a local minimum of the objective function. We present empirical results using text benchmarks, comparing the proposed algorithm and combinations of conventional approaches in problems of partitioning documents and detecting unknown topics.
Multiresolution splatting for indirect illumination
Authors: Greg Nichols, Chris Wyman
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

Global illumination provides a visual richness not achievable with the direct illumination models used by most interactive applications. To generate global effects, numerous approximations attempt to reduce global illumination costs to levels feasible in interactive contexts. One such approximation, reflective shadow maps, samples a shadow map to identify secondary light sources whose contributions are splatted into eye-space. This splatting introduces significant overdraw that is usually reduced by artificially shrinking each splat's radius of influence. This paper introduces a new, multi-resolution approach for interactively splatting indirect illumination. Instead of reducing GPU fill rate by reducing splat size, we reduce fill rate by rendering splats into a multi-resolution buffer. This takes advantage of the low-frequency nature of diffuse and glossy indirect lighting, allowing rendering of indirect contributions at low resolution where lighting changes slowly and at high resolution near discontinuities. Because this multi-resolution rendering occurs on a per-splat basis, we can significantly reduce fill rate without arbitrarily clipping splat contributions below a given threshold---those regions simply are rendered at a coarse resolution.
Enterprise Rails
Authors: Dan Chak
Venue:  (2008)

What does it take to develop an enterprise application with Rails? Enterprise Rails introduces several time-tested software engineering principles to prepare you for the challenge of building a high-performance, scalable website with global reach. You'll learn how to design a solid architecture that ties the many parts of an enterprise website together, including the database, your servers and clients, and other services as well. Many Rails developers think that planning for scale is unnecessary. But there's nothing worse than an application that fails because it can't handle sudden success. Throughout this book, you'll work on an example enterprise project to learn first-hand what's involved in architecting serious web applications. With this book, you will: Tour an ideal enterprise systems layout: how Rails fits in, and which elements don't rely on Rails Learn to structure a Rails 2.0 application for complex websites Discover how plugins can support reusable code and improve application clarity Build a solid data model--a fortress--that protects your data from corruption Base an ActiveRecord model on a database view, and build support for multiple table inheritance Explore service-oriented architecture and web services with XML-RPC and REST See how caching can be a dependable way to improve performance Building for scale requires more work up front, but you'll have a flexible website that can be extended easily when your needs change. Enterprise Rails teaches you how to architect scalable Rails applications from the ground up.
A Novel Blind Recognition Algorithm for Modulated M-QAM Signals
Authors: Xu Zhinan, Bai Wenle
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we develop an algorithm using Hilbert transform for the blind recognition of QAM signals. Without requiring any prior knowledge of signal parameters, the proposed method employs incoming signal and its Hilbert transform to calculate the instantaneous amplitude of the analytic signal, and then uses subtractive clustering algorithm to find the clustering centers of the instantaneous amplitude. The modulation order (M) of QAM signal is determined according to the number of clustering centers obtained. Computer simulation shows that the proposed method has strong capability for recognition of higher order modulation signals in the presence of additive white Gaussian noise (AWGN).
A SCORE macromodel for PLL designs to analyze supply noise interaction issues at behavioral level
Authors: Chin-Cheng Kuo, Pei-Syun Lin, Chien-Nan Jimmy Liu
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Using behavioral models to perform fast simulation is currently a popular solution to verify SOC designs. Previous analog behavior modeling approaches often treat the noisy VDD waveform as a given input and focus on reflecting such stimuli on circuit performance. However, because the interaction of noise aggressors and victims is not considered, some errors may exist in the simulation. In this paper, a simple SCORE macromodel is proposed for PLL designs. It can be integrated with a supply-noise-aware PLL behavioral model to analyze supply noise effects at high level. In addition to numerical results, the time-varying supply noise waveform and real-time PLL responses can be obtained simultaneously. As demonstrated in the experimental results, the proposed approach can provide more realistic simulation results with noise interaction effects but still keep fast simulation time.
A federated architecture for database systems
Authors: Dennis McLeod, Dennis Heimbigner
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The contemporary approach to database system architecture requires the complete integration of data into a single, centralized database; while multiple logical databases can be supported by current database management software, techniques for relating these databases are strictly ad hoc. This problem is aggravated by the trend toward networks of small to medium size computer systems, as opposed to large, stand-alone main-frames. Moreover, while current research on distributed databases aims to provide techniques that support the physical distribution of data items in a computer network environment, current approaches require a distributed database to be logically centralized.
A general unified framework for pairwise comparison matrices in multicriterial methods
Authors: B. Cavallo, L. D'Apuzzo
Venue: International Journal of Intelligent Systems (2009)

In a multicriteria decision making context, a pairwise comparison matrix A = (aij) is a helpful tool to determine the weighted ranking on a set X of alternatives or criteria. The entry aij of the matrix can assume different meanings: aij can be a preference ratio (multiplicative case) or a preference difference (additive case) or aij belongs to [0, 1] and measures the distance from the indifference that is expressed by 0.5 (fuzzy case). For the multiplicative case, a consistency index for the matrix A has been provided by T.L. Saaty in terms of maximum eigenvalue. We consider pairwise comparison matrices over an abelian linearly ordered group and, in this way, we provide a general framework including the mentioned cases. By introducing a more general notion of metric, we provide a consistency index that has a natural meaning and it is easy to compute in the additive and multiplicative cases; in the other cases, it can be computed easily starting from a suitable additive or multiplicative matrix. &copy; 2009 Wiley Periodicals, Inc.
Flipping and cyclic shifting of binary aggregation functions
Authors: B. De Baets, H. De Meyer, J. Kalická, R. Mesiar
Venue: Fuzzy Sets and Systems (2009)

We introduce two types of transformations of random variables, called flipping and cyclic shifting. As these transformations preserve monotonicity at the level of univariate cumulative distribution functions, they can be used to develop corresponding coordinate-wise transformations of binary aggregation functions. We lay bare the admissibility of these transformations, i.e. the necessary and sufficient conditions under which they result in a binary aggregation function. We investigate which additional properties, such as the 1-Lipschitz property and 2-increasingness, entail these admissibility conditions. Moreover, we point out which of these properties are preserved under flipping and/or cyclic shifting. Interestingly, quasi-copulas remain quasi-copulas under flipping, while copulas remain copulas under flipping as well as under cyclic shifting.
Proportional and Deterministic Differentiation Methods of Multi-Class QoS in IEEE 802.11e Wireless LAN
Authors: Yosuke Tanigawa, Jong-Ok Kim, Hideki Tode, Koso Murakami
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Recently, wireless LAN is achieving remarkable growth and maturity. On the other hand, by the advance of the Internet, the demand for multimedia communication services which include video and voice will be expected to grow. Therefore, in the future, the mechanism of QoS guarantee must be realized even in wireless LAN environment. So far, IEEE 802.11e EDCF has been proposed, which is a contention based channel access method to achieve the QoS guarantee in wireless LAN. However, this cannot realize the desired throughput ratio or deterministic target throughput in principle. In this paper, we expand the EDCF to solve such QoS issues and enable more flexible QoS control. Moreover, we show the effectiveness of our proposal by computer simulation.
The hybrid scheduling framework for virtual machine systems
Authors: Chuliang Weng, Zhigang Wang, Minglu Li, Xinda Lu
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

The virtualization technology makes it feasible that multiple guest operating systems run on a single physical machine. It is the virtual machine monitor that dynamically maps the virtual CPU of virtual machines to physical CPUs according to the scheduling strategy. The scheduling strategy in Xen schedules virtual CPUs of a virtual machines asynchronously while guarantees the proportion of the CPU time corresponding to its weight, maximizing the throughput of the system. However, this scheduling strategy may deteriorate the performance when the virtual machine is used to execute the concurrent applications such as parallel programs or multithreaded programs. In this paper, we analyze the CPU scheduling problem in the virtual machine monitor theoretically, and the result is that the asynchronous CPU scheduling strategy will waste considerable physical CPU time when the system workload is the concurrent application. Then, we present a hybrid scheduling framework for the CPU scheduling in the virtual machine monitor. There are two types of virtual machines in the system: the high-throughput type and the concurrent type. The virtual machine can be set as the concurrent type when the majority of its workload is concurrent applications in order to reduce the cost of synchronization. Otherwise, it is set as the high-throughput type as the default. Moreover, we implement the hybrid scheduling framework based on Xen, and we will give a description of our implementation in details. At last, we test the performance of the presented scheduling framework and strategy based on the multi-core platform, and the experiment result indicates that the scheduling framework and strategy is feasible to improve the performance of the virtual machine system.
Optimization on Chinese Power Source Structure Based on the Objective Programming
Authors: Yingling Shi, Nansheng Pang, Yawei Ding, Yuanyuan Liu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

China's thermal-power-led power structure has caused serious environmental pollution problems. The Energy Development Eleventh Five-year Plan of China proposes that China should reduce the emissions of the main pollutants and optimize the power structure. In this paper, we build the programming model to optimize the electric power structure and constraint the electricity production from the perspective of the economic and the environment. Then sensitivity analysis is undertaken on the basis of the optimized results. Through changing the order of priority of economic and environmental as well as emission performance of SO2 and CO2, the clean energy power generation may reach 27.68 % at the end of Eleventh Five-Year Plan , the SO2 and CO2 emissions go to 7.5 million tons and 2.32 billion tons. The research shows that the emission performance of CO2 should at most be 834.75g/kWh; the total emission constraint can be satisfied.
Dilute nitride n-i-p-i solar cells
Authors: B. Royall, N. Balkan
Venue: Microelectronics Journal (2009)

We propose a novel GaInNAs n-i-p-i doping superlattice to over come the problems of short minority carrier life times and low-diffusion lengths which lower the efficiency in conventional GaInNAs solar cells. A prototype structure is studied using the commercial simulation package DESSIS and the calculations of photo-generation, current density were carried out when the device is illuminated by an optical beam of a single wavelength below the band gap cut off. The I-V characteristics were simulated when both the samples were illuminated and in darkness.
Computational applications of nonextensive statistical mechanics
Authors: Constantino Tsallis
Venue: Journal of Computational and Applied Mathematics (2009)

Computational applications of the nonextensive entropy S"q and nonextensive statistical mechanics, a current generalization of the Boltzmann-Gibbs (BG) theory, are briefly reviewed. The corresponding bibliography is provided as well.
Get Your Word 2003 Into Use...Quickly!
Authors: Norma Sollers
Venue:  (2007)

Word processors: those powerful software gems like Microsoft Word that make document creation and maintenance so easy - provided, of course, one can figure out how to use them in the first place. Based on Microsoft Word 2003, this book is designed as a tutorial to help the rank beginner quickly understand and begin using a word processor comfortably. Once the tutorial is completed, the typical reader will be able to type and save a document correctly, create proper document back-ups, carry out basic document formatting, make a template and create a list within a document. Because the book is written in simple English, it's also suitable for those for whom English is a second language.
Tracking Multiple Circular Objects in Video Using Helmholtz Principle
Authors: Snehasis Mukherjee, Dipti Prasad Mukherjee
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

A novel algorithm is introduced to track multiple circular objects present in a video using Helmholtz perception principle. First, segmentation of circular objects in the video frame is performed using the perception principle and then same perception principle is applied to track the circular objects. For each circular object present in video, we have taken an assessment of the meaningfulness of the shift of its center of gravity and meaningfulness of the deviation of the direction of movement of the object due to inter-frame displacement. We have shown that a logical threshold in the meaningfulness value tracks circular objects in a video effectively and efficiently.
On the wavelet OFDM performance in time variant channels: choosing the number of DWT iterations
Authors: Marius Oltean
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

The influence of the number of Discrete Wavelet Transform (DWT) iterations on a wavelet OFDM (WOFDM) system performance is studied in this paper. The WOFDM transmission is tested on a flat, time variant radio channel. Basically, the number of DWT iterations coincides with the number of transmission scales used. Our simulations show that by increasing the value of this parameter, the BER performance degrades. This result is explained by the fact that a small number of iterations keeps the duration of the transmitted symbols significantly shorter than the coherence time of the channel.
Comparative Evaluation of Anomaly Detection Techniques for Sequence Data
Authors: Varun Chandola, Varun Mithal, Vipin Kumar
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We present a comparative evaluation of a large number of anomaly detection techniques on a variety of publicly available as well as artificially generated data sets. Many of these are existing techniques while some are slight variants and/or adaptations of traditional anomaly detection techniques to sequence data.
The split-step backward Euler method for linear stochastic delay differential equations
Authors: Haomin Zhang, Siqing Gan, Lin Hu
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, the numerical approximation of solutions of linear stochastic delay differential equations (SDDEs) in the Ito sense is considered. We construct split-step backward Euler (SSBE) method for solving linear SDDEs and develop the fundamental numerical analysis concerning its strong convergence and mean-square stability. It is proved that the SSBE method is convergent with strong order @c=12 in the mean-square sense. The conditions under which the SSBE method is mean-square stable (MS-stable) and general mean-square stable (GMS-stable) are obtained. Some illustrative numerical examples are presented to demonstrate the order of strong convergence and the mean-square stability of the SSBE method.
VLD Design for AVS Video Decoder
Authors: Wei Liu, Yong-en Chen
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper, architecture with combination of software and hardware for AVS Variable Length Code decoding is designed. Logical and feasible division between software and hardware for the system is presented. Under control of embedded CPU, the design can decode Fixed Length Code, unsigned or signed k-th Exp-Golomb Code and context-based adaptive2D-VLC (CA-2D-VLC) Code. Furthermore, decoding flow of software is given in detail, which can output parsing results and command information in required format. A single module named "VLD" is designed in hardware to meet the requirement of being frequent transferred in CA-2D-VLC decoding. Finally, parsing results of the whole syntax elements from AVS bitstream are output on this platform correctly, which has been proved to support real-time decoding for AVS HDTV video. Though designed for AVS video standard originally, it can be adapted to other coding standards easily.
Computation of the reflection coefficient for multilayer radio absorbing materials in λ/4
Authors: Dumitru Cazacu, Constantin Stanescu, Ilie Popa
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

This paper deals with the computation of the reflection coefficient for multilayer radio absorbing materials in λ / 4. They are composed of one or more dielectric layers among which conductive films are placed. Materials with one to four dielectric layers, with different dielectric materials, were considered and the reflection coefficients were computed and compared.