ppxscal/embedding_network huggingface dataset:
Identity Verification Via the 3Bid Face Alignment System
Authors: Dirk Colbry, George Stockman
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

The 3DID system has been developed to verify the identity of a person by matching a sensed 3D surface of the face to a face model stored during an enrollment process. Anchor point detection is performed based on shape index; then, a rigid alignment is determined between the observed and model face anchor points. The alignment is refined using a modified ICP algorithm allowing for trimming of 10% noise. Trimmed RMS error for the same person is almost always smaller than 1.3mm; whereas for different persons, it is almost always larger. Performance analysis shows that the 3DID system is fast enough (\ge 2 sec on a 3.2 MHz P4), reliable enough (1% EER with 1.5% reject rate), and user friendly enough (handles 30 degrees of yaw and 10 degrees of roll and pitch) to be practical in several applications. The current system provides several displays of value to human agents either in online or delayed analysis mode. An inexpensive scanner is needed for widespread use.
SNR-dependent compression of enhanced Mel sub-band energies for compensation of noise effects on MFCC features
Authors: Babak Nasersharif, Ahmad Akbari
Venue: Pattern Recognition Letters (2007)

The Mel-frequency cepstral coefficients (MFCC) are most widely used features for speech recognition. But, their performance degrades in presence of additive noise. In this paper, we propose a noise compensation method for Mel sub-bands energies as well as MFCC features. This method includes two steps: Mel sub-band spectral subtraction and compression of Mel sub-band energies. In the compression step, we propose a sub-band SNR-dependent compression function. This function replaces logarithm function in conventional MFCC feature extraction. Experimental results show that the proposed method significantly improves performance of MFCC features in noisy conditions. It decreases word error rate about 70% in SNR value of 0dB for different types of additive noise.
Adaptable Parsing of Real-Time Data Streams
Authors: Ferdinando Campanile, Alessandro Cilardo, Luigi Coppolino, Luigi Romano
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Today's business processes are rarely accomplished inside the companies domains. More often they involve entities geographically distributed which interact in a loosely coupled cooperation. While cooperating, these entities generate transactional data streams, such as sequences of stock-market buy/sell orders, credit-card purchase records, Web server entries, and electronic fund transfer orders. Such streams are often collections of events stored and processed locally, and they thus have typically ad-hoc, heterogeneous formats. On the other hand, elements in such data streams usually share a common semantics and indeed they can be profitably mined in order to obtain combined global events. In this paper, we present an approach to the parsing of heterogeneous data streams based on the definition of format-dependent grammars and automatic production of adhoc parsers. The stream-dependent parsers can be obtained dynamically in a totally automatic way, provided that the appropriate grammar, written in a common format, is fed into the system. We also present a fully working implementation, that has been successfully integrated into a telecommunication environment for real-time processing of billing information flows.
Statistical cluster and extreme limit points of sequences of fuzzy numbers
Authors: Salih Aytar, Serpil Pehlivan
Venue: Information Sciences: an International Journal (2007)

In this paper, we investigate the relations between statistical limit superior (or statistical limit inferior) and statistical cluster points of a statistically bounded sequence of fuzzy numbers and show that the set of statistical cluster points of a sequence of this type might be empty.
Predictive adaptive parallelism
Authors: Isaac D. Scherson
Venue:  (2007)

Parallel processing is used to increase the execution rate of programs. Since processing resources are the bottleneck for processing speed, increasing the processing rate is accomplished by adding more processing resources to the system. However, using extra resources adds extra, overhead, and the more resources that are used, the more overhead that is incurred. Optimal performance for parallel programs is achieved by finding the correct balance between computational speedup and overhead of using parallel resources. The current method of optimizing parallel programs is through extensive profiling and manual tuning of programs. This is not ideal since it is both time consuming in terms of programmer and machine tune, and does not, work for all programs, such as irregular programs and sequential programs executed in dynamic parallel systems. A novel method, called predictive adaptive parallelism, is presented for automatically calculating the optimal number of threads for parallel programs at runtime. The method uses a combination of compile-time and run-time information to gauge the program resource requirements and target machine capabilities. Programs are described in platform-independent load vectors, which describe the cost of executing a section of a program, and cost functions, which describe the number of times each section will be executed. When the programs are loaded onto a machine, the load vectors are translated into time costs. As runtime metrics become known, the cost functions can be solved to give a time profile of executing the program as a function of the number of threads assigned to the program. Minimizing the cost function yields the minimal execution time of the program and thus the optimal number of threads. The method is applied to loop-level parallelism and task-level parallelism, and the techniques are shown to be effective and accurate on a cluster system. In addition, the sensitivity of the method to inaccuracy in measuring the machine capabilities is explored.
Size matters: an empirical study of neural network training for large vocabulary continuous speech recognition
Authors: D. Ellis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We have trained and tested a number of large neural networks for the purpose of emission probability estimation in large vocabulary continuous speech recognition. In particular, the problem under test is the DARPA Broadcast News task. Our goal here was to determine the relationship between training time, word error rate, size of the training set, and size of the neural network. In all cases, the network architecture was quite simple, comprising a single large hidden layer with an input window consisting of feature vectors from 9 frames around the current time, with a single output for each of 54 phonetic categories. Thus far, simultaneous increases to the size of the training set and the neural network improve performance; in other words, more data helps, as does the training of more parameters. We continue to be surprised that such a simple system works as well as it does for complex tasks. Given a limitation in training time, however, there appears to be an optimal ratio of training patterns to parameters of around 25:1 in these circumstances. Additionally, doubling the training data and system size appears to provide diminishing returns of error rate reduction for the largest systems.
Evaluating static analysis defect warnings on production software
Authors: Nathaniel Ayewah, William Pugh, J. David Morgenthaler, John Penix, YuQian Zhou
Venue: Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2007)

Static analysis tools for software defect detection are becoming widely used in practice. However, there is little public information regarding the experimental evaluation of the accuracy and value of the warnings these tools report. In this paper, we discuss the warnings found by FindBugs, a static analysis tool that finds defects in Java programs. We discuss the kinds of warnings generated and the classification of warnings into false positives, trivial bugs and serious bugs. We also provide some insight into why static analysis tools often detect true but trivial bugs, and some information about defect warnings across the development lifetime of software release. We report data on the defect warnings in Sun's Java 6 JRE, in Sun's Glassfish JEE server, and in portions of Google's Java codebase. Finally, we report on some experiences from incorporating static analysis into the software development process at Google.
Overlay Network Considering the Time and Location of Data Generation
Authors: Shinichi Doi, Satoshi Matsuura, Kazutoshi Fujikawa, Hideki Sunahara
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Development of sensor technology enables us to use lots of and detailed information. Then, it is difficult to deal with the vast number of information generated by sensors by client server model. In order to deal with data generated by sensors, we build a new information infrastructure on overlay network. In this paper, we propose an overlay network system considering time and location on which data is generated. For efficient store and search, we create 3-dimensional space by time and location. Our proposed method supports range search and periodic search, using gradual aggregation on time dimension. In addition, to estimate our proposed overlay network, we implement simulator with Java on TCP/IP network.
An exact parallel algorithm to compare very long biological sequences in clusters of workstations
Authors: Azzedine Boukerche, Alba Cristina Melo, Edans Flavius Sandes, Mauricio Ayala-Rincon
Venue: Cluster Computing (2007)

Biological Sequence Comparison is one of the most important operations in Computational Biology since it is used to determine how similar two sequences are. Smith and Waterman proposed an exact algorithm (SW), based on dynamic programming, that is able to obtain the best local alignment between two sequences in quadratic time and space. In order to compare long biological sequences, SW is rarely used since the computation time and the amount of memory required becomes prohibitive. For this reason, heuristic methods like BLAST are widely used. Although faster, these heuristic methods do not guarantee that the best result will be produced. In this paper, we propose an exact parallel variant of the SW algorithm that obtains the best local alignments in quadratic time and reduced space. The results obtained in two clusters (8-machine and 16-machine) for DNA sequences longer than 32 KBP (kilo base-pairs) were very close to linear and, in some cases, superlinear. For very long DNA sequences (1.6 MBP), we were able to reduce execution time from 12.25 hours to 1.54 hours, in our 8-machine cluster. As far as we know, this is the first time 1.6 MBP sequences are compared with an exact SW variant. In this case, 30240 best local alignments were obtained.
The Role of Translocation and Selection in the Emergence of Genetic Clusters and Modules
Authors: David Newth, David G. Green
Venue: Artificial Life (2007)

Biomolecular studies point increasingly to the importance of modularity in the organization of the genome. Processes such as the maintenance of metabolism are controlled by suites of genes that act as distinct, self-contained units, or modules. One effect is to promote stability of inherited characters. Despite the obvious importance of genetic modules, the mechanisms by which they form and persist are not understood. One clue is that functionally related genes tend to cluster together. Here we show that genetic translocation, recombination, and natural selection play a central role in this process. We distill the question of emerging genetic modularity into three simulation experiments that show: (1) a tendency, under natural selection, for essential genes to co-locate on the same chromosome and to settle in fixed loci; (2) that genes associated with a particular function tend to form functional clusters; and (3) that genes within a functional cluster tend to become arranged in transcription order. The results also imply that high proportions of junk DNA are essential to the process.
Detection of syntactic boundaries by partial analysis-by-synthesis of fundamental frequency contours
Authors: K. Hirose
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

A phrase boundary detection experiment was realised using a previously proposed method for the use of prosodic features in automatic speech recognition. The method consists of comparing the observed fundamental frequency contour of an utterance with the contour generated by a model for each recognition hypothesis, using a scheme of partial analysis-by-synthesis. Allowing l-mora discrepancies, the detection rate reached 95%. To cope with the high variability in the errors obtained by the partial analysis-by-synthesis even for correct hypotheses, further experiments were carried out in two ways: smoothing the observed contour with a low-pass filter to reduce the effects of microprosody, and adapting the initial conditions of the model-generated contours to the speaker. Experiments were also conducted applying the method at non-phrasal boundaries with the objective of obtaining clues that permit the differentiation between phrase boundaries and non-phrasal boundaries.
An optimising compiler for generated tiny virtual machines
Authors: D. Palmer, P. Sikka, P. Valencia, P. Corke
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

VMSCRIPT is a scripting language designed to allow small programs to be compiled for a range of generated tiny virtual machines, suitable for sensor network devices. The VMSCRIPT compiler is an optimising compiler designed to allow quick re-targeting, based on a template, code rewriting model. A compiler backend can be specified at the same time as a virtual machine, with the compiler reading the specification and using it as a code generator.
Whole-program linear-constant analysis with applications to link-time optimization
Authors: Ludo Van Put, Dominique Chanet, Koen De Bosschere
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

Current link-time optimization techniques can reduce the power consumption and code size of embedded software [2]. Due to a lack of information, the stack frames of procedures are left untouched by link-time program optimizers. In this paper we present a practical whole-program linear-constant analysis [9] that allows to analyze the stack layout of a procedure. The analysis deals with the peculiarities of link-time program representation, namely the lack of high-level information and the huge size of the control flow graph. Even on a complete linux kernel, our analysis is practical in terms of computation time. The collected information consists of restricted affine equations between two registers, but it enables optimizations complementary to existing link-time optimization techniques. On a set of ARM benchmarks, the number of store operations decreases by up to 7% while the execution time, program size and power consumption are all further improved. This paper discusses both the practical issues of applying whole-program linear-constant propagation as well as its use in program optimization and understanding.
Lottery scheduling: flexible proportional-share resource management
Authors: Carl A. Waldspurger, William E. Weihl
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations. Such control is beyond the capabilities of conventional schedulers, and is desirable in systems that service requests of varying importance, such as databases, media-based applications, and networks. Lottery scheduling also supports modular resource management by enabling concurrent modules to insulate their resource allocation policies from one another. A currency abstraction is introduced to flexibly name, share, and protect resource rights. We also show that lottery scheduling can be generalized to manage many diverse resources, such as I/O bandwidth, memory, and access to locks. We have implemented a prototype lottery scheduler for the Mach 3.0 microkernel, and found that it provides flexible and responsive control over the relative execution rates of a wide range of applications. The overhead imposed by our unoptimized prototype is comparable to that of the standard Mach timesharing policy.
Interactive refractions with total internal reflection
Authors: Scott T Davis, Chris Wyman
Venue: Proceedings of Graphics Interface 2007 (2007)

A requirement for rendering realistic images interactively is efficiently simulating material properties. Recent techniques have improved the quality for interactively rendering dielectric materials, but have mostly neglected a phenomenon associated with refraction, namely, total internal reflection. We present an algorithm to approximate total internal reflection on commodity graphics hardware using a ray-depth map intersection technique that is interactive and requires no precomputation. Our results compare favorably with ray traced images and improve upon approaches that avoid total internal reflection.
Enhancing Locality in Two-Dimensional Space through Integrated Computation and Data Mappings
Authors: Mahmut Kandemir, Ozcan Ozturk, Vijay S. R. Degalahal
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

As the number of processors used in chip multiprocessors keeps increasing, NoC (Network-on-Chip) based multiprocessor architectures are becoming increasingly important. While the last couple of years have witnessed numerous proposals regarding how to architect NoC based parallel computing platforms, code and data mapping issues in these architectures have largely been ignored. In particular, there are very few papers so far focusing on providing compiler support for NoC based chip multiprocessor systems. Our goal in this paper is to demonstrate how an optimizing compiler can map data and computation to NoC nodes in a locality-aware manner such that the energy spent in data communications is minimized. The proposed approach formulates this locality problem within a linear algebraic framework and discusses two alternate solution strategies that determine appropriate computation/data mappings in NoC. Our experimental evaluation compares this proposed scheme against two alternate optimization strategies, one that optimizes data mapping alone and the other one that optimizes computation mapping alone. The collected results indicate that our approach improves energy consumption by about 25% with respect to a scheme that does not consider locality of communication during NoC mapping. More importantly, our results reveal that neither optimized data mapping alone nor optimized computation mapping alone is sufficient for achieving the best locality and the compiler needs to consider both in a coordinated fashion. In fact, our results show that the proposed approach improves energy consumption over the pure data mapping and pure computation mapping oriented schemes by around 22% and 20%, respectively, when considering all eight application codes we tested.
iKP: a family of secure electronic payment protocols
Authors: Mihir Bellare, Juan A. Garay, Ralf Hauser, Amir Herzberg, Hugo Krawczyk, Michael Steiner, Gene Tsudik, Michael Waidner
Venue: Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1 (1995)

This paper proposes a family of protocols -- iKP (i=1,2,3) - for secure electronic payments over the Internet. The protocols implement credit card-based transactions between the customer and the merchant while using the existing financial network for clearing and authorization. The protocols can be extended to apply to other payment models, such as debit cards and electronic checks. They are based on public-key cryptography and can be implemented in either software or hardware. Individual protocols differ in key management complexity and degree of security. It is intended that their deployment be gradual and incremental. The iKP protocols are presented herein with the intention to serve as a starting point for eventual standards on secure electronic payment.
Providing Real-Time Service in CDMA Wireless Networks
Authors: Maode Ma, Qichao Zhu
Venue: Wireless Personal Communications: An International Journal (2007)

Medium Access Control (MAC) protocol design plays a very important role in the design of wireless networks. In this paper, we propose a new MAC protocol to provide real-time service for a CDMA wireless network. This protocol has been designed based on the distributed queuing random access protocol for CDMA wireless networks (DQRAP/CDMA). As real-time scheduling schemes have been introduced into the protocol design, the new protocol has an ability to accommodate real-time traffic in the CDMA wireless networks. A series of simulation experiments have been carried out to evaluate the performance of the proposed protocol. The results reveal that the proposed protocol can efficiently provide real-time service to the traffic composed of time constrained messages in the CDMA wireless networks.
Optimal Rate and Power Allocation for Layered Transmission with Superposition Coding
Authors: Farzad Etemadi, Hamid Jafarkhani
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We consider the problem of transmitting an analog source over a quasi-static fading channel. This problem is motivated by the recent demand for multimedia content over wireless channels. The goal is to minimize the expected distortion of the received signal. Over slowly fading channels, the delay sensitivity of multimedia applications limits channel coding to a single fading realization. Due to the non-ergodicity of the channel, Shannon's separation theorem does not hold and a joint source-channel coding approach is more appropriate. When no channel state information is available at the transmitter, a multiple-antenna fading channel with either one receive or one transmit antenna can be modeled as a degraded broadcast channel where each channel realization corresponds to a user.
From Genes to Organisms Via the Cell: A Problem-Solving Environment for Multicellular Development
Authors: Trevor Cickovski, Kedar Aras, Maciej Swat, Roeland M. H. Merks, Tilmann Glimm, H. George E. Hentschel, Mark S. Alber, James A. Glazier, Stuart A. Newman, Jesus A. Izaguirre
Venue: Computing in Science and Engineering (2007)

To gain performance, developers often build scientific applications in procedural languages, such as C or Fortran, which unfortunately reduces flexibility. To address this imbalance, the authors present CompuCell3D, a multitiered, flexible, and scalable problem-solving environment for morphogenesis simulations that's written in C++ using object-oriented design patterns.
IPv6 Field Trial over Regular ADSL Access
Authors: Alain Baudot, Pierre Levis
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

This paper aims at describing the different means used and deployed to run the Orange/Wanadoo IPv6 field trial, and proposes a very first feedback after more than a year of running time. This field trial consists in providing IPv6 connectivity to customers owing to L2TP facilities or IPv6-in- IPv4 tunneling based on Tunnel Broker and Teredo coexistence tools.