ppxscal/embedding_network huggingface dataset:
Parameterized dataflow modeling of DSP systems
Authors: B. Bhattacharya
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Dataflow has proven to be an attractive computation model for programming DSP applications. A restricted version of dataflow, termed synchronous dataflow (SDF), that offers strong compile-time predictability properties, but has limited expressive power, has been studied extensively in the DSP context. Many extensions to synchronous dataflow have been proposed to increase its expressivity, while maintaining its compile-time predictability properties as much as possible. We propose a parameterized data-flow framework that can be applied as a meta-modeling technique to significantly improve the expressive power of an arbitrary data-flow model that possesses a well-defined concept of a graph iteration. Indeed, the parameterized dataflow framework is compatible with many of the existing dataflow models for DSP including SDF, CSDF, and SSDF. We develop a precise, formal semantics for parameterized synchronous dataflow that allows data-dependent dynamic DSP systems to be modeled in a natural and intuitive fashion. Desirable properties of a modeling environment like dynamic re-configurability and design re-use emerge as inherent characteristics of the parameterized framework. An example of a speech compression application is used to illustrate the efficacy of the parameterized modeling techniques in real-life data-dependent DSP systems.
Simulation of large crowds in emergency situations including gaseous phenomena
Authors: N. Courty, S. R. Musse
Venue: Proceedings of the Computer Graphics International 2005 (2005)

Crowd animation and simulation have been widely studied over the last decade for many purposes: populating collaborative virtual environments, entertainment and special effects industry and finally simulating behaviors and motion of people in emergency situations for safety systems. This last topic is addressed in this paper. We propose an original enhancement of a well known physics-based animation model which allows to consider influence of gaseous phenomena such as smoke or toxic gases in the behavior of the crowd. In order to get real time performances we also propose an implementation of this framework on modern graphics hardware, which allows to simulate crowds of thousands individuals at interactive framerate.
Incremental mining for temporal association rules for crime pattern discoveries
Authors: Vincent Ng, Stephen Chan, Derek Lau, Cheung Man Ying
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

In recent years, the concept of temporal association rule (TAR) has been introduced in order to solve the problem on handling time series by including time expressions into association rules. In real life situations, temporal databases are often appended or updated. Rescanning the complete database every time is impractical while existing incremental mining techniques cannot deal with temporal association rules. In this paper, we propose an incremental algorithm for maintaining temporal association rules with numerical attributes by using the negative border method. The new algorithm has been implemented to support the discoveries of crime patterns in a district of Hong Kong. We have also experimented with another real life database of courier records of a shipping company. The preliminary results show a significant improvement over rerunning TAR algorithm.
Semantic Resource Description for Grid
Authors: S. Kailash, P. Prasanna, V. Prabha, V. Neela Narayanan
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Matching resources is a fundamental problem within large scale distributed environments such as Grid for which the critical process is resource discovery and description. An effective way of solving this problem is providing meta-data about the resources. Ontologies can be used to capture metadata information. Ontologies determine the terms of Grid entities, resources, capabilities and the relationships between them with meaning by the addition of ontological annotations. In this paper we present the initial design of resource description ontology. This ontology can be used for solving resource matching for Grid using semantic web technologies.
Operating-system support for distributed multimedia
Authors: Sape J. Mullender, Ian M. Leslie, Derek McAuley
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

Multimedia applications place new demands upon processors, networks and operating systems. While some network designers, through ATM for example, have considered revolutionary approaches to supporting multimedia, the same cannot be said for operating systems designers. Most work is evolutionary in nature, attempting to identify additional features that can be added to existing systems to support multimedia. Here we describe the Pegasus project's attempt to build an integrated hardware and operating system environment from the ground up specifically targeted towards multimedia.
Channel decoding using adaptive interframe and intraframe bit prediction in GSM system
Authors: C. Veaux
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The goal of source controlled channel decoding is to improve the performance of the channel decoder by using the residual redundancy of the speech encoded data. The original approach exploits only the interframe correlation between bits and few simple schemes have been devised in order to use the intraframe correlation. In this contribution, we present an efficient method to exploit the intraframe correlation during the channel decoding process. We predict the soft value of the bit being decoded from the bits already decoded along the trellis path. Our estimator of bit correlation is adaptively estimated from the soft bits values at the decoder output. Finally, the combination of interframe and intraframe prediction is applied to the full-rate and enhanced full-rate speech codecs in the GSM system.
Delineating the citation impact of scientific discoveries
Authors: Chaomei Chen, Jian Zhang, Weizhong Zhu, Michael Vogeley
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Identifying the significance of specific concepts in the diffusion of scientific knowledge is a challenging issue concerning many theoretical and practical areas. We introduce an innovative visual analytic approach to integrate microscopic and macroscopic perspectives of a rapidly growing scientific knowledge domain. Specifically, our approach focuses on statistically unexpected phrases extracted from unstructured text of titles and abstracts at the microscopic level in association with the magnitude and timeliness of their citation impact at the macroscopic level. The H-index, originally defined to measure individual scientists. productivity in terms of their citation profiles, is extended in two ways: 1) to papers and terms as a means of dividing these items into two groups so as to replace the less optimal threshold-based divisions, and 2) to take into account the timeliness of the impact of knowledge diffusion in terms of the timing of citations and publications so that attention is particularly drawn towards potentially significant and timely papers. The selected terms are connected to higher-level performance indicators, such as measures derived from the H-index, in the form of decision trees. A top-down traversal of such decision trees provides an intuitive walkthrough of concepts and phrases that may underline potentially significant but currently still latent scientific discoveries. Timeliness measures can also help to identify institutions that are at the forefront of a research field. We illustrate how widely accessible tools such as Google Earth can be utilized to disseminate such insights. The practical significance for digital libraries and fostering scientific discoveries is demonstrated through the astronomical literature related to the Sloan Digital Sky Survey (SDSS).
Effective mechanisms for detecting and thwarting Distributed
Authors: Vassil Kriakov, Alex Delis, George Kollios
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

The emergence of applications producing continuous high-frequency data streams has brought forth a large body of research in the area of distributed stream processing. In presence of high volumes of data, efforts have primarily concentrated on providing approximate aggregate or top-k type results. Scalable solutions for providing answers to window join queries in distributed stream processing systems have received limited attention to date. We provide a solution for the window join in a distributed stream processing system which features reduced inter-node communications achieved through automatic throughput handling based on resource availability. Our approach is based on incrementally updated discrete Fourier transforms (DFTs). Furthermore, we provide formulae for computingDFT compression factors in order to achieve information reduction. We perform WAN-based prototype experiments to ascertain the viability and establish the effectiveness of our method. Our experimental results reveal that our method scales in terms of throughput and error rates, achieving sub-linear message complexity in domains that exhibit a geographic skew in the joining attributes.
Second moment analysis of the filtered-X LMS algorithm
Authors: O. J. Tobias
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper presents a new analytical model for the second moment behavior of the filtered-X LMS algorithm. The new model is not based on the independence theory, and is derived for Gaussian inputs and slow adaptation. Monte Carlo simulations show excellent agreement with the behavior predicted by the theoretical model.
User-definable rule priorities for CHR
Authors: Leslie De Koninck, Tom Schrijvers, Bart Demoen
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

This paper introduces CHRrp: Constraint Handling Rules with user-definable rule priorities. CHRrp offers flexible execution control which is lacking in CHR. A formal operational semantics for the extended language is given and is shown to be an instance of the theoretical operational semantics of CHR. It is discussed how the CHR rp semantics influences confluence results. A translation scheme for CHRrp programs with static rule priorities into (regular) CHR is presented. The translation is proven correct and bench-mark results are given. CHRrp is related to priority systems in other constraint programming and rule based languages.
The Effect of the RTS/CTS Handshake on TCP
Authors: Stylianos Papanastasiou, Mohamed Ould-Khaoua, Vassilis Charissis
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Previous research enquiries into TCP performance in MANETs have largely assumed that the 802.11 RTS/CTS mechanism remains in full effect throughout the connection time. In this work we evaluate the effects on TCP goodput of utilising other modes of operation for the 802.11 handshake whilst remaining compliant with the original specification. To identify the source of the goodput discrepancies amongst the different modes of operation we introduce two new metrics to characterise spatial connection along a TCP connection and then use them to account for TCP goodput in string and mesh topologies when using different RTS/CTS strategies.
A fast search method of algebraic codebook by reordering search sequence
Authors: M. Gerken
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper proposes a fast search method of algebraic codebook in CELP coders. In the proposed method, the sequence of codebook search is reordered according to the criterion of mean squared weighted error between target vector and filtered adaptive codebook vector, and the algebraic codebook is searched until a predetermined threshold is satisfied. This method reduces the computations considerably compared with G.729 at the expense of a slight degradation of speech quality. Moreover, it gives better speech quality with smaller average search space than G.729A. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Normalization-Cooperated Gradient Feature Extraction for Handwritten Character Recognition
Authors: Cheng-Lin Liu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

The gradient direction histogram feature has shown superior performance in character recognition. To alleviate the effect of stroke direction distortion caused by shape normalization and provide higher recognition accuracies, we propose a new feature extraction approach, called normalization-cooperated gradient feature (NCGF) extraction, which maps the gradient direction elements of original image to direction planes without generating the normalized image and can be combined with various normalization methods. Experiments on handwritten Japanese and Chinese character databases show that, compared to normalization-based gradient feature, the NCGF reduces the recognition error rate by factors ranging from 8.63 percent to 14.97 percent with high confidence of significance when combined with pseudo-two-dimensional normalization.
VISIT/GS: Higher Level Grid Services for Scientific Collaborative Online Visualization and Steering in UNICORE Grids
Authors: Morris Riedel, Wolfgang Frings, Sonja Dominiczak, Thomas Eickermann, Daniel Mallmann, Paul Gibbon, Thomas Dussel
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Many production Grid infrastructures such as DEISA, EGEE, or TeraGrid have begun to offer services to endusers that include access to computational resources. The major goal of these infrastructures is to facilitate the routine interaction of scientists and their workflows with advanced tools and seamless access to computational resources via Grid middleware systems such as UNICORE, gLite or Globus Toolkits. While UNICORE 5 is used in production Grids since several years, recently an early prototype of the new Web services-based UNICORE 6 became available that will be continously improved in the next months for its use in production. In absence of a widely accepted framework for visualization and steering, the new UNICORE 6 Grid middleware provides not such a higherlevel service by default. This motivates this contribution to support e-Scientists in upcoming WS-based UNICORE Grids with visualization and steering techniques. In this paper we present the augmentation of the early standards-based UNICORE 6 prototype with a higher-level service for collaborative online visualization and steering. It describes the seamless integration of this service within UNICORE Grids by retaining the convenient single sign-on feature.
Partially Dynamic Concurrent Update of Distributed Shortest Paths
Authors: Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work under the assumption that before dealing with an edge operation, the algorithm for the previous operation has to be terminated, that is, they are not able to update shortest paths concurrently, or (ii) concurrently update shortest paths, but their convergence can be very slow (possibly infinite). In this paper we propose a partially dynamic algorithm that overcomes these limitations. In particular, it is able to concurrently update shortest paths and its convergence is quite fast.
Granularly-pipelined CORDIC processors for sine and cosine generators
Authors: Shaoyun Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

The CORDIC algorithm is a powerful tool for computing trigonometric functions (sine and cosine) and some transcendental functions (hyperbolic sine and cosine) at a circuit complexity suited for physical implementation by using VLSI technologies. In this paper, we propose a family of architectures for high-throughput applications based on computation pipelining. The granularity of pipelining can be varied to increase the throughput at a cost of increased circuit complexity. The wide variety of solutions allows optimizing the trade-off between performance and circuit complexity, by taking into account the specific requirements and constraints of the application. The evaluations and the designer guidelines an also given.
A robust FLS algorithm for LCMV adaptive broadband beamformer
Authors: L. S. Resende
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

A robust approach to implement the multidimensional fast least squares (FLS) algorithm for linearly-constrained adaptive spatial/temporal filtering is presented in this work. It can be directly applied in adaptive beamforming for broadband signals. Simulation results illustrate the performance of the proposed approach which is compared with the classical LMS based Frost algorithm.
Detecting anomalies in network traffic using maximum entropy estimation
Authors: Yu Gu, Andrew McCallum, Don Towsley
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

We develop a behavior-based anomaly detection method that detects network anomalies by comparing the current network traffic against a baseline distribution. The Maximum Entropy technique provides a flexible and fast approach to estimate the baseline distribution, which also gives the network administrator a multi-dimensional view of the network traffic. By computing a measure related to the relative entropy of the network traffic under observation with respect to the baseline distribution, we are able to distinguish anomalies that change the traffic either abruptly or slowly. In addition, our method provides information revealing the type of the anomaly detected. It requires a constant memory and a computation time proportional to the traffic rate.
A chosen ciphertext attack against several e-mail encryption protocols
Authors: Jonathan Katz, Bruce Schneier
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

Several security protocols (PGP, PEM, MOSS, S/MIME, PKCS#7, CMS, etc.) have been developed to provide confidentiality and authentication of electronic mail. These protocols are widely used and trusted for private communication over the Internet. We point out a potentially serous security hole in these protocols: any encrypted e-mail can be decrypted using a one-message, adaptive chosen-ciphertext attack which exploits the structure of the block cipher chaining models used. Although such attacks seem to be of primarily theoretical interest, we argue that they are feasible in the networked systems in which these e-mail protocols are used. We suggest several solutions to protect against this class of attack.
Some integral inequalities for functions with (n-1)st derivatives of bounded variation
Authors: Aimin Xu, Dezao Cui
Venue: Computers Mathematics with Applications (2007)

In this paper, we generalize Cerone's results, and a unified treatment of error estimates for a general inequality satisfying f^(^n^-^1^) being of bounded variation is presented. We derive the estimates for the remainder terms of the mid-point, trapezoid, and Simpson formulas. All constants of the errors are sharp. Applications in numerical integration are also given.
Magellan: Charting Large-Scale Peer-to-Peer Live Streaming Topologies
Authors: Chuan Wu, Baochun Li, Shuqiao Zhao
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Live peer-to-peer (P2P) streaming applications have been successfully deployed in the Internet. With relatively simple peer selection protocol design, modern live P2P streaming applications are able to provide millions of concurrent users adequately satisfying viewing experiences. That said, few existing research has provided sufficient insights on the time-varying internal characteristics of P2P topologies in live streaming. With 120 GB worth of traces in late 2006 from a commercial P2P live streaming system of UUSee Inc. in Beijing, this paper represents the first attempt in the research community to explore topological properties in practical P2P streaming, and how they behave over time. Starting from classical graph metrics, such as degree, clustering coefficient, and reciprocity, we explore and extend them in specific perspectives of streaming applications. We also compare our findings with existing insights from topological studies of P2P file sharing applications, which shed new and unique insights specific to streaming. Our characterization reveals the scalability of the commercial P2P streaming application even in case of large flash crowds, the clustering phenomenon of peers in each ISP, as well as the reciprocal behavior among peers, all of which play important roles in achieving its current success.
A phoneme-similarity based ASR front-end
Authors: T. H. Applebaum
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A training procedure for phoneme similarity reference models is described and two word recognition methods based on phoneme similarities for the English language are evaluated under clean, noisy and channel-distorted speech conditions. Optimization of recognition performance is examined in terms of multi-style training, cepstral normalizations, gender dependent models and length of time over which the phoneme similarities are computed. Phoneme similarities provide a compact speech representation which is relatively insensitive to the variations between speakers.
Multiple Event Transient Induced by Nuclear Reactions in CMOS Logic Cells
Authors: C. Rusu, A. Bougerol, L. Anghel, C. Weulerse, N. Buard, S. Benhammadi, N. Renaud, G. Hubert, F. Wrobel, T. Carriere, R. Gaillard
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

This paper presents a methodology for analyzing the behavior of nanometer technologies regarding "Multiple Event Transients" (MET) caused by nuclear reaction induced by atmospheric neutrons. For the first time, currents collected by several sensitive areas of an ASIC cell resulting from a nuclear reaction are addressed by simulation. Libraries of several thousand types of currents are obtained for neutron energy range between 1 and 200 MeV. Group of currents are simultaneously injected at SPICE level and their effects are monitored on the cell output. Following an amplitude criterion, output transient duration and associated occurrence probability are recorded. A 130nm NAND gate from ATMEL Corporation is first used to illustrate the methodology and a comparison between Single Event Transients and Multiple Event Transients effects is presented. Finally, results regarding five different combinational cells in the ATMEL 130nm library are presented and discussed.