ppxscal/embedding_network huggingface dataset:
Standardization of the selectable mode vocoder
Authors: S. C. Greer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The migration from the first generation of cellular telephony to the second has included a transition from an analog speech channel to a digital channel that employs digital speech codecs. As the deployment of these second-generation systems matures, system capacity concerns have increased the pressure for a more efficient encoding of speech. In addition, market pressures have contributed to the contradictory requirement of improved voice quality provided by these wireless systems. This paper presents the motivation for, and the execution of, a program of standardizing a new variable-rate speech codec for the cdmaOne/cdma2000 wireless system. Several codecs have previously been standardized. This new codec, known as the selectable mode vocoder or SMV, offers a significant improvement in voice quality over that of existing codec standards as well as the flexibility of allowing the system operator to make tradeoffs between voice quality and system capacity.
A multi-scale and multi-orientation recognition technique applied to document interpretation application to french telephone network maps
Authors: S. Adam
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We consider the general problem of technical document interpretation, applied to the documents of the French telephonic operator, France Telecom. More precisely, we focus the content of this paper on the computation and the use of a new set of features allowing the classification of multi-oriented and multi-scaled patterns, as well as the rotation and scale parameters estimation. This set of invariants is based on the Fourier-Mellin transform (FMT). This transformation has two interesting properties in the context of our study. The first relies on the classification rate which is obtained with this method. Secondly, it provides a robust estimator of orientation and scale of the processed patterns through the use of the shift theorem of the Fourier transform. A comparison with parameter estimation issued from the Zernike moments is also given.
Shaping Event-Based Haptic Transients Via an Improved Understanding of Real Contact Dynamics
Authors: Jonathan P. Fiene, Katherine J. Kuchenbecker
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Haptic interactions with stiff virtual surfaces feel more realistic when a short-duration transient is added to the spring force at contact. But how should this event-based transient be shaped? To answer this question, we present a targeted user study on virtual surface realism that demonstrates the importance of scaling transients correctly and hints at the complexity of this dynamic relationship. We then present a detailed examination of the dynamics of tapping on a rigid surface with a hand-held probe; theoretical modeling is combined with empirical data to determine the influence of impact velocity, impact acceleration, and user grip force on the resulting transient surface force. The derived mathematical relationships provide a formula for generating open-loop, event-based force transients upon impact with a virtual surface. By incorporating an understanding of the dynamics of real interactions into the re-creation of virtual contact, these findings promise to improve the performance and realism of a wide range of haptic simulations.
A Drifting-proof Framework for Tracking and Online Appearance Learning
Authors: Tony X. Han, Ming Liu, Thomas S. Huang
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

In order to avoid the notorious drifting problem for tracking system, a new integrated appearance learning framework is proposed in this paper. Previous tracking frameworks with appearance learning ability [3, 11] either require supervised offline training or will fail inevitably if the tracker locks on the background. While in our framework, no offline training is required. Given the location of the object in the first frame of the video sequence, we model the foreground (the image patch containing the object)/background difference as the transition cost in our tracking objective function. An tracker based on Dynamic Programming (DP) and template prediction [14] is carried out on the pixels with high foreground-likelihood. The typical views (i.e. appearance model) proposed by the tracker are used to initialize the states of a Hidden Markov Model (HMM). With the learned HMM, the tracking results and the appearance model can be further refined until the video sequence and all of these estimated parameters/hidden variables can be well explained by the HMM. Through this iterative procedure, typical views of the object, transition probabilities between the typical views, and location of the object are simultaneously estimated with strong confidence. The experiments show that the proposed framework achieves fairly satisfied results for several challenging video sequences and therefore has many potential applications for video analysis.
Productivity prediction of MPI programs based on models
Authors: A. I. Avetisyan, S. S. Gaisaryan, V. P. Ivannikov, V. A. Padaryan
Venue: Automation and Remote Control (2007)

A model of parallel program that can be effectively interpreted on the development computer guaranteeing the possibility of a sufficiently precise prediction of real run time for a simulated parallel program at the prescribed computer system is studied. The model is worked out for parallel programs with explicit message passing written in the Java language with MPI library access and is included into the composition of ParJava environment. The model is obtained by transforming the program control tree that can be constructed for Java programs by modifying the abstract syntax tree. To model communication functions, the model LogGP is used which allows taking into consideration the specific character of the communication network of the distributed computer system.
Multi Labelled Transition Systems: A Semantic Framework for Nominal Calculi
Authors: Rocco De Nicola, Michele Loreti
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper, Multiple Labelled Transition Systems (MLTS) are introduced as generalizations of LTS that permit dealing also with systems features that are becoming more and more important when considering languages and models for network aware programming. MLTS permit describing not only the actions systems can perform but also system's resources usage and their handling (creation, revelation ...) of names. To show adeguacy of our proposal we show how MLTS can be used to describe the operational semantics of one of the most studied calculus for mobility: the asynchronous @p-calculus.
Building an "impossible" verifier on a java card
Authors: Damien Deville, Gilles Grimaud
Venue: Proceedings of the 2nd conference on Industrial Experiences with Systems Software - Volume 2 (2002)

Java is a popular development platform for mobile code systems. It ensures application portability and mobility for a variety of systems, while providing strong security features. The intermediate code (byte code) allows the virtual machine to verify statically (during the loading phase) that the program is well-behaved. This is done by a software security module called the byte code verifier. Smart Cards that provide a Java Virtual Machine, called Java Card, are not supplied with such a verifier because of its complexity. Alternatives are being studied to provide the same functionality outside the card. In the present paper, we propose to integrate the whole verifier inside the smart card. This ensures that the smart card becomes entirely autonomous, which allows full realization of smart cards potential as pervasive computing devices. Our verifier uses a specialized encoding and a software cache with a variety of cache polices to adapt to the hardware constraints of smart card. Our experimental results confirm the feasibility of such a security system being implemented in a smart card.
Further Developments of a Dynamic Distributed Video Proxy-Cache System
Authors: Claudiu Cobarzan, Laszlo Boszormenyi
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

We investigate the dynamics of a distributed video proxy-cache system that is able to adapt the number of running nodes depending on conditions like client request patterns, network load etc. Since we've already examined the split operation used to expand the system by adding new nodes, we explore in detail two operations (hibernate and shut down) used to reduce the number of active nodes. Also, several scenarios for object (video data) movement and replication between participants are taken into consideration. Further more, we study the system's efficiency by measuring the byte hit rate under different test scenarios.
Network randomization protocol: a proactive pseudo-random generator
Authors: Chee-Seng Chow, Amir Herzberg
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

A major security threat to any security solutions based on a centralized server is the possibility of an adversary gaining access to and taking control of the server. The adversary may then learn secrets, corrupt data, or send erroneous messages. In practice, such an adversary may be more prevalent than one would like to admit. It may be a malicious hacker, a virus in an application program, or an unscrupulous system administrator. Proactive security is a novel approach to the server security problem. It uses the distribution of data and control to multiple servers and periodic refreshes between servers. By distributing data and control, one or more servers may be compromised without compromising the system. Periodic refreshes between servers allow a compromised server to "recover" after the attacker leaves, thereby contributing to the system security. A fraction (in some cases all) of the servers must be compromised simultaneously in order to compromise the system. This paper describes the Network Randomization Protocol (NRP) -- a proactive protocol for generating cryptographically secure pseudo-random numbers. The protocol is designed for operation in the Internet and includes defenses against clogging attacks. Issues related to the design and implementation of the protocol are discussed. As virtually no cryptographic task is possible without a source of randomness or pseudorandomness, NRP is an important basic building block for many cryptographic functions. Furthermore, it serves to illustrate the main ideas and intuitions of proactive security.
Edge characterization using a model-based neural network
Authors: Hau-San Wong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In this paper, we investigate the feasibility of characterizing significant image edges using a model-based neural network with modular architecture. Instead of employing traditional mathematical models for characterization, we ask human users to select what they regard as significant features on an image, and then incorporate these selected edges directly as training examples for the network. Unlike conventional edge detection schemes where decision thresholds have to be specified, the current NN-based edge characterization scheme implicitly represents these decision parameters in the form of network weights which are updated during the training process. Experiments have confirmed that the resulting network is capable of generalizing this previously acquired knowledge to identify important edges in images not included in the training set. Most importantly, the current approach is very robust against noise contaminations, such that no re-training of the network is required when it is applied to noisy images.
Automated Mass Maintenance of Software Assets
Authors: Niels Veerman
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

This is research summary of a PhD project in the area of massive software maintenance automation. We explain the context, approach, and contributions.
XML support for Tcl
Authors: Steve Ball
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

XML is emerging as a significant technology for use on both the World Wide Web and in many other application areas, such as network protocols. Documents written in XML have a rich, hierarchical structure, the document tree. An application which is to process XML documents must be able to access and manipulate the document tree in order to be able to examine and change the structure. The DOM is a language-independent specification of how an application accesses and manipulates the document structure. TclDOM is a Tcl language binding for the DOM. The TclDOM specification provides a standard API for Tcl applications to process a XML or HTML document. TclXML is a Tcl package which provides a sample implementation of TclDOM. It provides XML parsers along with the tools needed to create a hierarchical representation of documents which can be conveniently processed by a Tcl script. There are also facilities to check the validity of a document, along with commands to produce document output. TclXML provides a framework for parser and validator modules which allows some or all of the various components to be implemented in an extension language.
Participant: A New Concept for Optimally Assisting the Elder People
Authors: Hong Sun, Vincenzo De Florio, Ning Gui, Chris Blondia
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Elder people are becoming a predominant aspect of our societies. As such, solutions both efficacious and cost-effective need to be sought. The approach pursued so far to solve this problem used to increase the number of people working in the health sector, e.g. doctors, nurses, etc. This increases the costs, which is becoming a big burden for countries. In this paper we propose a new concept in the health management of elder people, which we name as "participant". We propose the "participant" concept to encourage elder people to participate in those group activities that they are able to. Their roles in these activities are not passively requesting help, but actively participating to some healthcare processes. Characteristics of the participant approach are that medical resources are efficiently spared with this model, and the social network of the elder people is kept. A "virtual community" for mutual assistance is set up in this paper, and the simulations demonstrate that the "participant" model could fully utilize the community resources. Furthermore, the psychological health of the elder people will be improved.
A polynomial-transform based computation of the 2-D DCT with minimum multiplicative complexity
Authors: J. Prado
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper provides a full description of a 2-D discrete cosine transform (DCT) which has the property of requiring only N 1-D DCT of size N for performing the 2-D algorithm. No multiplication is involved elsewhere in the algorithm, thus the multiplicative complexity is halved when compared to classical row/column algorithms. Compared to some other proposed algorithms, our approach has the characteristic of being formally very concise. Once the main result has been obtained, a remaining difficulty is the search for an in-place algorithm. This problem is also solved.
Handling Pattern-Dependent Delay Faults in Diagnosis
Authors: Jyun-Wei Chen, Ying-Yen Chen, Jing-Jia Liou
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Traditionally, diagnosis methods use static models for delay defects, while there exists a class of faults including cross-coupling capacitance and resistive shorts exhibiting different effects on path delays with different input patterns. Blindly treating such faults will lead to skewed results for locating defects. In this paper, we discuss the method to handle these faults without explicitly modeling each type of faults. In the process, we differentiate failed delay paths into two categories: static and pattern-dependent. We further explore these information to list possible candidates (including coupling defects) causing timing failures for further analysis. The experimental results show that average rankings of suspects are 2.1 and 4.6 for failing segments and coupling pairs, respectively.
Power model validation through thermal measurements
Authors: Francisco Javier Mesa-Martinez, Joseph Nayfach-Battilana, Jose Renau
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

Simulation environments are an indispensable tool in the design, prototyping, performance evaluation, and analysis of computer systems. Simulator must beable to faithfully reflect the behavior of the system being analyzed. To ensure the accuracy of the simulator, it must be verified and determined to closely match empirical data. Modern processors provide enough performance counters to validate the majority of the performance models; nevertheless, the information provided is not enough to validate power and thermal models. In order to address some of the difficulties associated with the validation of power andthermal models, this paper proposes an infrared measurement setup to capture run-time power consumption and thermal characteristics of modern chips. We use infrared cameras with high spatial resolution (10x10μm) and high frame rate (125fps) to capture thermal maps. To generate a detailed power breakdown (leakage and dynamic) for each processor floorplan unit, we employ genetic algorithms. The genetic algorithm finds a power equation for each floorplan block that produces the measured temperature for a given thermal package. The difference between the predicted power and the externally measured power consumption for an AMD Athlon analyzed in this paper has less than 1% discrepancy. As an example of applicability, we compare the obtained measurements with CACTI power models, and propose extensions to existing thermal models to increase accuracy.
The "how-to" institutionalize systemic change: a look at Gateway at Florida International University
Authors: M. Heimer, E. Pittenger
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

By establishing a team whose members reach an affinity alignment that can be expressed as a written vision or mission statement it is possible, with the proper nurturing and strategy formulation, to bring about systemic change within the culture of engineering educators and their institutions. The heart of an institutional effort is the committed participants' team, which meets weekly to set goals and milestones, brainstorm ideas, and encourage one another. The heart of the team is diversity in its membership-of academic specialization and personal background. The process of institutionalization, while not a "12-Step Program," is a 7-step one. The 7 steps are: awareness; understanding; acceptance; adoption; implementation; institutionalization; and exportation. The work of the team is to formulate strategies for the present and to constantly anticipate and propose new ones for the future. The paper discusses specific activities and procedures in place at Florida International University's (FIU) Gateway Program and those which we anticipate will be operational over the next two years of our research in changing the way we educate engineers.
Artificial neural networks for feature extraction and classification of vascular tissue fluorescence spectrums
Authors: G. A. Rovithakis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The use of neural network structures for feature extraction and classification is addressed here. More precisely, a nonlinear filter based on higher order neural networks (HONN) whose weights are updated by stable learning laws is used to extract the characteristic features of fluorescence spectra corresponding to human tissue samples of different states. The features are then classified with a multi-layer perceptron (MLP). The high rates of success together with the small time needed to analyze the signals, proves our method very attractive for real time applications.
Learning to verify branching time properties
Authors: Abhay Vardhan, Mahesh Viswanathan
Venue: Formal Methods in System Design (2007)

We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessary for checking a CTL formula instead of computing them iteratively as is done in traditional model checking. This allows us to analyze infinite or large state-space systems where the traditional iterations may not converge or may take too long to converge. We allow fairness constraints to be specified for verification of various liveness properties. The main challenge in developing a learning based model checking algorithm for CTL is that CTL properties express nested fixpoints. We overcome this challenge by developing a new characterization of CTL properties in terms of functions that have unique fixpoints. We instantiate our technique to systems in which states are encoded as strings and use a regular inference algorithm to learn the CTL fixpoints. We prove that if the fixpoints have a regular representation, our procedure will always terminate with the correct answer. We have extended our Lever tool to use the technique presented in this paper and demonstrate its effectiveness by verifying a number of parametric and integer systems.
Voronoi Diagram with Respect to Criteria on Vision Information
Authors: Tetsuo Asano, Naoki Katoh, Hisao Tamak, Takeshi Tokuyama
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predetermined criterion. In this paper we are interested in various measures associated with criteria on goodness of an input line segment with respect to each point in the plane as the "point of view". These measures basically show how the segment or information displayed on the segment can be seen from the point. Mathematically, the measures are defined in terms of the shape of the triangle determined by the point and the line segment. Given any such measure, we can define a Voronoi diagram for a set of line segments. In this paper we are interested in investigating their common combinatorial and structural properties. We investigate conditions for those measures to define regular Voronoi diagrams and also conditions that local optima on the measures lie only on Voronoi edges, not in the proper interior of Voronoi regions.