ppxscal/embedding_network huggingface dataset:
A model-based gaze tracking system
Authors: R. Stiefelhagen, Jie Yang, A. Waibel
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

In this paper we present a non-intrusive model-based gaze tracking system. The system estimates the 3D pose of a user's head by tracking as few as six facial feature points. The system locates a human face using a statistical color model without any mark on the face and then traces the facial features, such as eyes, nostrils and lip corners. A full perspective model is employed to map these feature points onto the 3D pose. Several techniques have been developed to track the features points and recover from failure. We currently achieve a frame rate of 15+ frames per second using an HP 9000 workstation with a frame grabber and a Canon VC-C1 camera. The application of the system has been demonstrated by a gaze-driven panorama image viewer. The potential applications of the system include multimodal interfaces, virtual reality and video-teleconferencing.
Final Report on Speech Recognition Research
Authors: Jutta S. Denton, C. R Taylor
Venue:  (1992)

This report documents speech recognition research conducted at Carnegie Mellon''s School of Computer Science between December 1984 and April 1990. Our research in Speech Recognition produced two successful recognizers: the knowledge-based Angel system, and Sphinx, a hidden Markov modeling system. The latter system''s 96% work accuracy enabled pioneering work on voice-driven interfaces for problem-solving applications, parsing techniques for spontaneous speech, and methods of exploiting dialog knowledge to enhance speech understanding. We also developed an extensive software support environment for integrating system components, hardware accelerator designs, and robustness techniques to handle acoustic variations and environmental noise.
Application of Embedded Testing Methods to Service Validation
Authors: Luiz Paula Lima,  Jr., Ana R. Cavalli
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

Conformance testing is a crucial phase in the life-cycle of communicating systems. However, classical testing methods are not appropriate for use in all tasks concerning the test of telecommunications services (especially regression and integration tests). This is so because Intelligent Networks, into which these services are installed, are modular architectures (composed of building blocks) evolving basically by the addition of new services/features that may share the same resources (reusability). This paper investigates how embedded conformance testing methods can be applied in the context of service validation, taking into account the different testing phases in the service life-cycle. In order to illustrate their application, the validation of telephone services (Basic Call Service, Originating Call Screening and Call Forward Unconditional) on an Intelligent Network framework is presented. It is also shown how some cases of feature interaction can be detected.
Design of Highly Parallel Linear Digital Circuits Based on Symbol-Level Redundancy
Authors: Masami Nakajima, Michitaka Kameyama
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

In the non-linear digital system, it is difficult to design systematically highly parallel digital circuits whose output digit depends on a small number of input digits. On the other hand, the concept of linearity in digital systems is very attractive because analytical methods can be utilized to design highly parallel circuits. One of the most important problems in the design is to transform an original specification to a linear one. The design method of highly parallel circuits based on a necessary condition has been discussed. However, we cannot always find the solution even if the necessary condition is satisfied. To solve the problem, a sufficient condition for linearity is derived. If the sufficient condition is satisfied, we can design the linear circuit from the specification by the use of multiplicated redundant symbols.
Coding regulations for safety critical software development
Authors: F. Mazzanti
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

This paper presents some limits and irregularities in current standards for safety critical software development, and suggests ways to improve the state of the art. The need for well organized, rigorous and verifiable coding regulations to promote the development of software with predictable quality and safety characteristics is explained. We show specific examples of weaknesses in standards and make proposals for improvement.
Wavelet transform in similarity paradigm II
Authors: Zbigniew R. Struzik, Arno P.J.M. Siebes
Venue:  (1998)

For the majority of data mining applications, there are no models of data which would facilitate the tasks of comparing records of time series, thus leaving one with `noise'' as the only description. We propose a generic approach to comparing noise time series using the largest deviations from consistent statistical behaviour. For this purpose we use a powerful framework based on wavelet decomposition, which allows filtering polynomial bias, while capturing the essential singular behaviour. In particular we are able to reveal scale-wise ranking of singular events including their scale-free characteristic: the H\"older exponent. We use such characteristics to design a compact representation of the time series suitable for direct comparison, e.g. evaluation of the correlation product. We demonstrate that the distance between such representations closely corresponds to the subjective feeling of similarity between the time series. In order to test the validity of subjective criteria, we test the records of currency exchanges, finding convincing levels of (local) correlation.
Analysis of Stability in Hand-Written Dynamic Signatures
Authors: G. Dimauro, S. Impedovo, R. Modugno, G. Pirlo, L. Sarcinella
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper presents a new technique to evaluate the local stability in handwritten dynamic signatures and use the results to improve the process of automated signature verification. The experimental results points out the usefulness of integrating stability information into thesignature verification process.
Design and Implementation of a Self-Checking Scheme for Railway Trackside Systems
Authors: Luca Schiano, Cecilia Metra, Diego Marino
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

We propose the self-checking design of the Transmission and Reception Blocks of a Trackside Control System used for railway applications. Our scheme has been conceived for Field-Programmable Gate Arrays. A prototype has been implemented, whose correct operation has been verified by means of post-layout simulations and experimental measurements. Our scheme negligibly impacts system's performance and features self-checking ability with respect to a wide set of possible internal faults, representative of the most likely faults for FPGA-implemented systems.
Mission Time Analysis of Large Dependable Systems
Authors: Sandor Racz, Miklos Telek
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

The mission time analysis of large dependable systems that can be described by Markov Reward Models (MRM) with phase type distributed impulse and constant rate rewards is considered in the paper. A single Laplace transform domain description of the distribution of completion time is provided through a new analysis approach. Based on this description an effective numerical method is introduced which allows the evaluation of models with large state space (106states).The applied analysis approach makes the use of an expanded Markov chain, but the state space expansion is much less than for common `phase type expansion', because the expanded state space is composed by the union (instead of product) of the original state space and the state space of the phase type structure of non-zero impulse rewards. (Roughly speaking, the applied state space expansion is additive in contrast with the multiplicative state space expansion used for phase type modeling.)The proposed method, which is a counterpart of the analysis method of accumulated reward of MRMs with rate and impulse rewards, provides the moments of reward measures approximately on the same computational cost and memory requirement as the transient analysis of the expanded Continuous Time Markov Chain. Numerical example demonstrates the abilities of the proposed method.
Incremental Algorithms for Managing Temporal Constraints
Authors: Alfonso Gerevini, Anna Perini, Francesco Ricci
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper addresses the problem of efficiently updating a network of temporal constraints when constraints are removed from or added to an existing network. Such processing tasks are important in many AI applications requiring a temporal reasoning module. First we analyze the relationship between shortest-paths algorithms for directed graphs and arc-consistency techniques. Then we focus on a subclass of STP for which we propose new fast incremental algorithms for consistency checking and for maintaining the feasible times of the temporal variables.
Global Path Planning for Autonomous Qualitative Navigation
Authors: N. A. Vlassis, N. M. Sgouros, G. Efthivoulidis, G. Papakonstantinou, P. Tsanakas
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We describe a novel global path planning method for autonomous qualitative navigation in indoor environments. Global path planning operates on top of a qualitative map of the environment that describes variations in sensor behavior between adjacent regions in space. The method takes into consideration the global topology of the environment and applies a set of criteria that can minimize the errors in the navigational accuracy of a robotic wheelchair Our approach uses a modified version of the Dijkstra's shortest path algorithm that takes into consideration the curvature of the trajectory and the off-wall distance of the map points. The algorithm computes in real-time a set of optimal paths for reaching the destination. We have tested our global path planning method in simulation in representative indoor environments with above average complexity. Based on these experiments we have determined empirically a set of values for the parameters of the algorithm that almost always lead to the selection of optimal paths in these environments.Paradigms: Empirical ModelsFocal topics: Robotics, Qualitative Reasoning, Planning
Fourier Decision Diagrams on Finite Non-Abelian Groups with Preprocessing
Authors: Radomir S. Stankovic
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

The present paper introduces a method for optimization of Fourier decision diagrams representations of discrete functions based on the preprocessing of the represented functions. Fourier decision diagrams are defined for matrix-valued function on non-Abelian groups. Their application to number-valued functions is provided though a simple preprocessing of the represented functions.
Null Space Algorithms for Solving Augmented Systems arising in the Mixed Finite Element Approximation of Saddle Point Problems
Authors: Mario Arioli, Gianmarco Manzini
Venue:  (2000)

We use a Null Space algorithm approach to solve augmented systems produced by the mixed finite element approximation of saddle point problems. We compare the use of an orthogonal factorization technique for sparse matrices with the use of a sparse Gaussian elimination for the computation of the Null Space. Finally, we present the results of the numerical tests which we performed on selected problems.
Automated Diagnosis of Non-Native English Speaker's Natural Language
Authors: Richard Fox, Mari Bowden
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Typical grammar checking software use some form of natural language parsing to determine if errors exist in the text. If a sentence is found ungrammatical, the grammar checker usually seeks a single grammatical error as an explanation. For non-native speakers of English, it is possible that a given sentence contain multiple errors and grammar checkers may not adequately explain these mistakes. This paper presents GRADES, a diagnostic program that detects and explains grammatical mistakes made by non-native English speakers. GRADES performs its diagnostic task, not through parsing, but through the application of classification and pattern matching rules. This makes the diagnostic process more efficient than other grammar checkers. GRADES is envisioned as a tool to help non-native English speakers learn to correct their English mistakes, but is also a demonstration that grammar checking need not rely on parsing techniques.
An Active Multibaseline Stereo System with Real-Time Image Acquisition
Authors: Sing B Kang, Jon Webb, C. L Zitnick, Takeo Kanade
Venue:  (1994)

We describe our four-camera multibaseline stereo system in a convergent configuration and our implementation of a parallel depth recovery scheme for this system. Our system is capable of image capture at video rate. This is critical in applications that require three-dimensional tracking. We obtain dense stereo depth data by projecting a light pattern of frequency modulated sinusoidally varying intensity onto the scene, thus increaing the local discriminability at each pixel and facilitating matches. In addition, we make most of the camera view areas by converging them at a volume of interest. Results indicate that we are able to extract stereo depth data that are, on the average, less than 1 mm in error at distances between 1.5 to 3.5 m away from the cameras.
A General Interleaver for Equal and Unequal Error Protections of Turbo Codes with Short Frames
Authors: M. M. Salah, R. A. Raines, M. A. Temple, T. G. Bailey
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Key to the efficient operation of turbo codes is the interleaver design. With proper design, the pairing of low-weight sequences to the input of the encoders can be avoided. Circular shift interleavers can be used to ensure that the minimum distance due to weight-2 input sequences grows roughly as \math , where N is the block length. In this paper, we generalized the mapping function of the circular shift interleaver to be suitable for both equal and unequal error protections. In addition, we present the results of a unique examination of the behavior of the general circular shift interleaver for equal and unequal error protections using turbo code with short frames.
The tame kernel of imaginary quadratic fields with class number 2 or 3
Authors: Hong You, Sheng Chen
Venue: Mathematics of Computation (2003)

This paper presents improved bounds for the norms of exceptional finite places of the group K2OF, where F is an imaginary quadratic field of class number 2 or 3. As an application we show that K2Z[√-10] = 1.
Beam and plain strain finite elements for inflatable fabric membranes in two dimensions
Authors: J.-C. Thomas, Y. Ravaut, C. Wielgosz, R. Bouzidi
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper is devoted to the development of two finite elements for the study of inflatable structures made of double-layered fabric sheets submitted to high pressures. Large displacements and following forces are taken into account. The first is an inflated beam element issued from the equilibrium finite element theory, because the analytical solution shows that the compliance of these double-layered structures is the sum of yarn and beam compliances. The second element is a plain strain finite element built from a direct minimization of the total potential energy of the membrane elements. The numerical solution is obtained by solving directly the optimisation problem of the discretized structure. It is shown that these two elements are able to give accurate solutions for fabric panels submitted to high pressure and bending loads. Comparisons with experimental results show the efficiency of these two elements.
Decision Making and Uncertainty Management in a 3D Reconstruction System
Authors: Maurício Marengoni, Allen Hanson, Shlomo Zilberstein, Edward Riseman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

This paper presents a control structure for a general-purpose image understanding system. It addresses the high level of uncertainty in local hypotheses and the computational complexity of image interpretation. The control of vision algorithms is done by an independent subsystem that uses Bayesian networks and utility theory to compute marginal value of information and selects the algorithm with the highest value of information. It is shown that the knowledge base can be acquired using learning techniques and the value-driven approach to the selection of vision algorithms leads to performance gains.
The influence of evolutionary selection schemes on the iterated prisoner''s dilemma
Authors: David D.B. Bragt, Cees H.M. Kemenade, J. A. L Poutre
Venue:  (2000)

Many economic and social systems are essentially large multi-agent systems. By means of computational modeling, the complicated behavior of such systems can be investigated. Modeling a multi-agent system as an evolutionary agent system, several important choices have to be made for evolutionary operators. Especially, it is to be expected that evolutionary dynamics substantially depend on the selection scheme. We therefore investigate the influence of evolutionary selection mechanisms on a fundamental problem: the iterated prisoner''s dilemma (IPD), an elegant model for the emergence of cooperation in a multi-agent system. We observe various types of behavior, cooperation level, and stability, depending on the selection mechanism and the selection intensity. Hence, our results are important for (1) The proper choice and application of election schemes when modeling real economic situations and (2) assessing the validity of the conclusions drawn from computer experiments with these models. We also conclude that the role of selection in the evolution of multi-agent systems should be investigated further, for instance using more detailed and complex agent interaction models.
dRBAC: Distributed Role-based Access Control for Dynamic Coalition Environments
Authors: Eric Freudenthal, Tracy Pesin, Lawrence Port, Edward Keenan, Vijay Karamcheti
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Distributed Role-Based Access Control (dRBAC) is a scalable, decentralized trust-management and access-control mechanism for systems that span multiple administrativedomains. dRBAC utilizes PKI identities to define trust domains, roles to define controlled activities, and role delegation across domains to represent permissions to these activities. The mapping of controlled actions to roles enables their namespaces to serve as policy roots.dRBAC distinguishes itself from previous approaches by providing three features: (1) third-party delegation of roles from outside a domain's namespace, relying upon an explicitdelegation of assignment; (2) modulation of transferred permissions using scalar valued attributes associated with roles; and (3) continuous monitoring of trust relationships over long-lived interactions. This paper describes the dRBAC model and its scalable implementation using a graph approach to credential discovery and validation.
An Architecture for Reference Linking
Authors: Donna Bergmark, William Arms, Carl Lagoze
Venue:  (2000)

The Digital Library Research Group at Cornell has Reference Linking as one of its projects. Typical projects within in the group take an object-oriented approach to handling digital information. To support reference linking, therefore, we designed a scheme whereby reference linking information is extracted from archives by {\em surrogate} objects and then presented to client applications or users by means of a well-defined API. This paper describes that architecture, the API, and how the API might be supported in the Dienst protocol.
BLITPAK: An Implementation of Block-Iterative Methods for Sparse Systems of Linear Algebraic Equations
Authors: James O''Neil
Venue:  (1987)

BLITPAK (BLock ITerative PAcKage) is a set of FORTRAN and C subroutines designed to solve sparse systems of linear algebraic equations using block-iterative methods. This paper explains the motivation and use of these methods and introduces a parameterized linear time block partitioning algorithm which may be used with the package. Numerous options are available, including several block methods, sparse and full storage of diagonal block factors, generated initial estimates and generated block structure. General test results as well as an analysis of the block partitioning algorithm are presented. The appendices include a user''s guide and sample input and output files.
Digital Television: MPEG-1, MPEG-2 and Principles of the DVB System, 2 edition
Authors: Herve Benoit
Venue:  (2002)

:Written as an authoritative introduction, this text describes the technology of digital television broadcasting. It gives a thorough technical description of the underlying principles of the DVB standard following the logical progression of signal processing steps, as well as COFDM modulation, source and channel coding, MPEG compression and multiplexing methods, conditional access and set-top box technology. If you are looking for a concise technical `briefing that will quickly get you up to speed with the subject without getting lost in the detail  this is the book you need. After an overview of analogue TV systems and video digitization formats, the author then examines the various steps of signal processing - taken in order from transmission to reception - to facilitate an understanding of the architecture and function of the main blocks of the Integrated Receiver/Decoder (IRD) or "set-top" box. Herve Benoit focuses attention on the very complex problems that need to be solved in order to define reliable standards for broadcasting digital pictures to the consumer and gives solutions chosen for the current DVB system.* Enhance your knowledge of digital television with this authoritative technical introduction* Learn the underlying principles of DVB standard, COFDM modulation, compression, multiplexing, conditional access and set-top box technology*A concise technical 'briefing' that brings you up to speed with the subject. 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
An Overview of the Applications of a Pulsed Laser System for SEU Testing
Authors: V. Pouget, P. Fouillat, D. Lewis, H. Lapuyade, L. Sarger, F. M. Roche, S. Duzellier, R. Ecoffet
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This paper presents several recent results concerning single-event upset testing with a pulsed laser. It includes sensitivity mapping of a test SRAM cell, slave-induced upset in a flip-flop, MBU mapping of a 16 Mbit DRAM, and on-line testing of a sequencer-counter.