ppxscal/embedding_network huggingface dataset:
On the Derivation of Hydrodynamics from the Boltzmann Equation
Authors: Esposito R., Lebowitz J. L., Marra R.
Venue:  (2000)

We review the main ideas on the derivation of hydrodynamical equations from microscopic models. The Boltzmann equation, which is a good approximation for the evolution of rare gases, provides an useful tool to test these ideas in mathematically controllable situations such as the Euler and incompressible Navier-Stokes limits, which we describe in some detail. We also discuss the heuristics and some few rigorous results available for stochastic particle systems.
Low Power VLSI Architecture of Viterbi Scorer for HMM-based Isolated Word Recognition
Authors: Bok-Gue Park
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The HMM-based algorithms have been successfully applied to speech recognition since HMM provides a robust modeling capability of various speech signals and maintains high recognition accuracy. Viterbi Scoring that searches the best matching word by comparing input utterance with reference speech models is a major task in HMM-based speech recognition. However, due to its operation complexity, viterbi scoring is a significant source of power and computation when it is imple-mented by a dedicated VLSI architecture. This paper proposes a noble low power VLSI architecture of Viterbi scorer using modified Viterbi scoring procedure and pre-computing logic. This method reduced power consum-ption by 20% and 27% for 100 and 400 candidate words recognition, respectively, compared with a conventional architecture at a cost of at most 12% increase in area due to additional control logics. As device shrinks, power consumption becomes more significant than chip area.
Imitation games: Turing, Menard, Van Meegeren
Authors: Brian P. Bloomfield, Theo Vurdubakis
Venue: Ethics and Information Technology (2003)

For many, the very idea of an artificial intelligence has always been ethically troublesome. The putative ability of machines to mimic human intelligence appears to call into question the stability of taken for granted boundaries between subject/object, identity/similarity, free will/determinism, reality/simulation, etc. The artificially intelligent object thus appears to threaten the human subject with displacement and redundancy. This article takes as its starting point Alan Turing's famous `imitation game,' (the so called `Turing Test'), here treated as a parable of the encounter between human original and machine copy &ndash; the born and the made. The cultural resonances of the recent on-line performance of a `Turing Test' for computer generated art are then explored. Art traditionally taken to stand for all that is considered quintessentially human &ndash; and therefore resistant to mechanisation &ndash; represents in this sense a kind of `critical case' in the advance of machine intelligence. The article focuses on the moral status of the body, human agency, and social knowledge in the ongoing (re-)constructions of copy, original, and of the difference between them.
Empirical Error based Optimization of SVM Kernels: Application to Digit Image Recognition
Authors: N. E. Ayat, M. Cheriet, C. Y. Suen
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We address the problem of optimizing kernel parameters in Support Vector Machine modeling, especially when the number of parameters is greater than one as in polynomial kernels and KMOD, our newly introduced kernel. The present work is an extended experimental study of the framework proposed by Chapelle et al. for optimizing SVM kernels using an analytic upper bound of the error. However, our optimization scheme minimizes an empirical error estimate using a Quasi-Newton optimization method. To assess our method, the approach is further used for adapting KMOD, RBF and polynomial kernels on synthetic data and NIST database. The method shows a much faster convergence with satisfactory results in comparison with the simple gradient descent method.
Subphonetic Acoustic Modeling for Speaker-Independent Continuous Speech Recognition
Authors: Mei Hwang
Venue:  (2001)

To model the acoustics of a large vocabulary well while staying within a reasonable memory capacity, most speech recognition systems use phonetic models to share parameters across different words in the vocabulary. This dissertation investigates the merits of modeling at the subphonetic level. We demonstrate that sharing parameters at the subphonetic level provides more accurate acoustic models than sharing at the phonetic level. The concept of subphonetic parameter sharing can be applied to any class of parametric models. Since the first-order hidden Markov model (HMM) has been overwhelmingly successful in speech recognition, this dissertation bases all its studies and experiments on HMMs. The subphonetic unit we investigate is the state of phonetic HMMs. We develop a system in which similar Markov states of phonetic models share the same Markov parameters. The shared parameter (i.e., the output distribution) associated with a cluster of similar states is called a "senone" because of its state dependency. The phonetic models that share senones are shared-distribution models or SDMs. Experiments show that SDMs offer more accurate acoustic models than the generalized-triphone model presented by Lee. Senones are next applied to offer accurate models for triphones not experienced in the system training data. In this dissertation, two approaches for modeling unseen triphones are studied --- purely decision-tree based senones and a hybrid approach using the concept of Markov state quantization. Both approaches indeed offer a significant error reduction over the previously accepted approach of monophone model substitution. However, the purely decision-tree based senone approach is preferred for its simplicity. The concept of Markov state quantization can also be applied to the automatic determination of a senonic baseform. A "senonic baseform" is a word HMM whose output distributions are replaced by the closest senones, resulting in no increase in the the number of parameters in the existing senonic system. Because it is acoustics driven, the senonic baseform is useful for speaker adaptation and learning new words. Finally, we explore relaxation of the mixture-tying constraint in semi-continuous HMMs. We move from a system in which the VQ probability densities are tied across all the Markov states in a system to one in which only similar states share the same densities. To reduce computation in order to make experiments possible, phone-class dependent VQ codebooks are studied. A large suite of experimental results are presented to demonstrate the relative effectiveness of each component of the thesis. After integrating the senonic decision tree with 8 phone-class dependent VQ codebooks into SPHINX-II, we attained a word error rate of 6.7% on the speaker-independent 5,000-word Wall Street Journal continuous-speech recognition task.
The PERCO Platform
Authors: J. Maisonneuve, S. Chabridon, P. Leveillé
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

The PERCO platform is an industry-provided software platform that specifically addresses the requirements of highly available dependable autonomous systems. Its basic tenet is to use UML specifications to build as much of the application as possible, while integrating real-time and fault-tolerant properties at the architectural level. PERCO is designed and built within the Alcatel-Thomson Common Laboratory (LCAT).
Do We Know What Preventive Maintenance Is?
Authors: Ned Chapin
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

After setting the context with a brief review of some history, this paper places preventive maintenance in that context, as brought up to date. It closes by pointing out a link between scheduled maintenance and preventive maintenance.
Usage of VSAT for TCP/IP based LAN interconnection
Authors: J. Gavilan, A. Becerra, I. Berberana
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

An analysis of the possibilities of usage of VSAT networks for the interconnection of TCP/IP based LANs is performed. In the first part of the paper, a general feasibility overview of TCP/IP through satellite is presented, stressing on the inconveniences and technical problems of arrangement. In the second part, a comparative study between low rate (up to 19.2 kbps) VSAT networks and other low capacity data networks (such as X.25) is carried out. The study is based upon measurements performed by Telefonica I+D on the Hughes ISBN VSAT system operated by Telefonica de Espana.
Interprocedural Data Flow Decompilation
Authors: Cristina Cifuentes
Venue:  (1994)

A method for inter-procedural data flow analysis of decompiled code has been developed to regenerate high-level instructions from low-level (machine-type) instructions. The aim of this method is to eliminate from the intermediate representation low-level constructs such as, condition codes and registers, that are not available in high-level languages, and to introduce the high-level concept of expressions to the intermediate representation. This analysis makes use of conventional compiler data flow theory, and applies it to registers and condition codes. The elimination of condition codes is performed by an extension of a reach algorithm (i.e. use-definition chains on flags). The elimination of registers is performed by a forward substitution algorithm that is based on inter-procedural live register analysis of the program''s control flow graph, and definition-use chains on registers. This latter method not only eliminates registers, but also eliminates intermediate instructions, finds expressions, and determines the actual arguments to a subroutine call. This method has been implemented in dcc, a decompiler for the Intel 1''80286 architecture. It has proved to reduce the number of intermediate instructions by 80106 on average. Sample intermediate and output C code is provided.
Optimal Online Scheduling of Parallel Jobs with Dependencies
Authors: Anja Feldmann, Ming Kao, Jiri Sgall, Shang Teng
Venue:  (1992)

We study the following general online scheduling problem. Parallel jobs arrive dynamically according to the dependencies between them. Each job requests a certain number of processors with a specific communication configuration, but its running time is not known until it is completed. We present optimal online algorithms for PRAMs, hypercubes and one-dimensional meshes, and obtain optimal tradeoffs between the competitive ratio and the largest number of processors requested by any job. Our work shows that for efficient online scheduling it is necessary to use virtualization, i.e., to schedule parallel jobs on fewer processors than requested while preserving the work. Assume that the largest number of processors requested by a job is lambda(N), where 0 > lambda > 1 and N is the number of processors of - a machine. With virtualization, our algorithm for PRAMs has a competitive __________ ratio of 2 + /4lamba + 1 - 1 . Our lower bound shows that this ratio _______________ 2lambda is optimal. As lambda goes from 0 to 1, the ratio changes from 2 to 2 + Phi, where Phi ~ 0.168 is the golden ratio. For hypercubes and ~ one-dimensional meshes we present Theta (log N ) -competitive algorithms ______ (log log N) as well as matching lower bounds. Without virtualization, no online scheduling algorithm can achieve a competitive ratio smaller than N for lambda = 1. For lambda > 1, the lower bound is 1 + 1 and our _____ 1 - y algorithm for PRAMs achieves this competitive ratio. We prove that tree constraints are complete for the scheduling problem, i.e., any algorithm that solves the scheduling problem if the dependency graph is a tree can be converted to solve the general problem equally efficiently. This shows that the structure of a dependency graph is not as important for online scheduling as it is for offline scheduling, although even simple dependencies make the problem much harder than scheduling independent jobs.
Bayesian extension to the language model for ad hoc information retrieval
Authors: Hugo Zaragoza, Djoerd Hiemstra, Michael Tipping
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We propose a Bayesian extension to the ad-hoc Language Model. Many smoothed estimators used for the multinomial query model in ad-hoc Language Models (including Laplace and Bayes-smoothing) are approximations to the Bayesian predictive distribution. In this paper we derive the full predictive distribution in a form amenable to implementation by classical IR models, and then compare it to other currently used estimators. In our experiments the proposed model outperforms Bayes-smoothing, and its combination with linear interpolation smoothing outperforms all other estimators.
A Graphical Interface for CHIP
Authors: Lorenzo Alvisi, Fred B. Schneider
Venue:  (1996)

CHIP (Cornell Hypothetical Instructional Processor) [BBDS83] is a computer system designed as an educational tool for teaching undergraduate courses in operating system and machine architecture. This document describes CHIP''s graphical interface and covers in a tutorial how the interface is used to debug and execute CHIP programs.
Maximizing Paper Spread in Examination Timetabling Using a Vehicle Routing Method
Authors: Wee-Kit Ho, Andrew Lim, Wee-Chong Oon
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

One of the desirable attributes of real-life examination timetabling solutions is the maximization of paper spread, which is a measure of the amount of study time that each student has between examinations. In this paper, we make use of the Push-Forward Insertion Heuristic (PFIH), a technique commonly employed in the Vehicle Routing Problem, to find timetable solutions that maximize paper spread. This is done by including PFIH as part of a hybrid exam-timetabling framework known as the Combined Method.
Oscillation of parabolic neutral delay difference equations with several positive and negative coefficients
Authors: S. H. Saker
Venue: Applied Mathematics and Computation (2003)

We obtain some oscillation criteria for the parabolic neutral delay difference equations with several positive and negative coefficients.
A New Trust Region algorithm for Equality Constrained Optimization
Authors: Thomas F. Coleman, Wei Yuan
Venue:  (1995)

We present a new trust region algorithms for solving nonlinear equality constrained optimization problems. At each iterate a change of variables is performed to improve the ability of the algorithm to follow the constraint level sets. The algorithm employs $L_{2}$ penalty functions for obtaining global convergence. Under certain assumptions we prove that this algorithm globally converges to a point satisfying the second order necessary optimality conditions; the local convergence rate is quadratic. Results of preliminary numerical experiments are presented.
A Taxonomy of Parallel Sorting
Authors: Dina Bitton, David J. DeWitt, David K. Hsiao, Jaishankar Menon
Venue:  (1984)

In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and file sorting algorithms. We analyze the evolution of research on parallel sorting, from the earliest sorting networks to the shared memory algorithms and the VLSI sorters. In the context of sorting networks, we describe two fundamental parallel merging schemes the odd-even and the bitonic merge. Sorting algorithms have been derived from these merging algorithms for parallel computers where processors communicate through interconnection networks such as the perfect shuffle, the mesh and a number of other sparse networks. After describing the network sorting algorithms, we show that, with a shared memory model of parallel computation, faster algorithms have been derived from parallel enumeration sorting schemes, where keys are first ranked and then rearranged according to their rank. Parallel sorting algorithms are evaluated according to a number of criteria, related not only to their time complexity, but also to their feasibility from a computer architecture point of view. We show that in addition to their attractive communication schemes, network sorting algorithms have non-adaptive schedules that make them suitable for implementation. In particular, they are easily generalized to block-sorting algorithms, that utilize limited parallelism to solve large sorting problems. We also address the problem of sorting large mass-storage files in parallel, using modified disk devices or intelligent bubble memories. Finally, the newer area of VLSI sorting is mentioned as an active and promising direction of research on parallel sorting.
Frame elements description and syntax: a corpus-based analysis of intransitive motion verbs.
Authors: Antonietta Alonge
Venue:  (1995)

In this work we carried out a study on Italian motion verbs, by performing a frame semantics analysis of them. The choice of this class of verbs depends on both theoretical and ''practical'' reasons. On one hand, such verbs present interesting syntactic/semantic characteristics and they were studied by different authors (cf., e.g., Talmy (1985); Jackendoff (1990); Levin & Rappaport (1992)); on the other, they were already analysed within the EEC research project Acquilex.
PosadaSpace: a Skeletal Fine Art Virtual Environment
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

The 1998 artwork PosadaSpace is a virtual world exhibited in a decorated computer kiosk. Mike Mosher and Tim McFadden built it around the historic cartoot imagery of Jose Guadalupe Posada (and some other Mexican art) to investigate the appeal and narrative power of simple 20 sprites in defnillg and populating an interactive 30 world. 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
Support for Distributed Multimedia Services in the TINA Architecture
Authors: Mikael Jorgensen, Peter Leydekkers, Marcel Mampaey, Henry Yang
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

TINA is a world wide initiative with the objective of defining an architecture for the future telecommunications infrastructure, which should be able to handle muItimedia services. This paper investigates and discusses the concepts currently available in the TINA architecture to model multimedia services. The focus of the paper is targeted towards the support for describing, requiring and setting up the necessary multimedia connections between the parties involved in distributed multimedia services. By means of an example we illustrate how the TINA modeling concepts can be successfully applied to the description of a multimedia conferencing service scenario.
Mp3 Manual de Referencia
Authors: Gustavo Briozzo, Baltazar Birnios
Venue:  (2002)

:This thorough and detailed manual provides all the necessary information needed to create and listen to sound files in the most popular Internet format. It addresses how to create and record music, how to share and obtain MP3 from A network, how to reproduce MP3, and to configure, change, and create skins with WinAmp. Includes CD-ROM.Este manual completo y detallado provee toda la referencia necesaria para escuchar y crear archivos de sonido en el formato mas popular de Internet. Como manejar las herramientas líderes de edicion de sonido para crear y grabar musica. Como compartir y conseguir MP3 en la red. Como reproducir MP3, configurar, cambiar y crear skins con WinAmp."Gustavo Briozzo is an editor at MP Ediciones.
Genes and Bacteria for Automatic Test Cases Optimization in the .NET Environment
Authors: Benoit Baudry, Franck Fleurey, Jean-Marc Jézéquel, Yves Le Traon
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

The level of confidence in a software component isoften linked to the quality of its test cases. This qualitycan in turn be evaluated with mutation analysis: faultycomponents (mutants) are systematically generated tocheck the proportion of mutants detected ("killed") by thetest cases. But while the generation of basic test cases seteasy, improving its quality may require prohibitiveeffort. This paper focuses on the issue of automating thetest optimization. We looked at genetic algorithms tosolve this problem and modeled it as follows: a test casecan be considered as a predator while a mutant programanalogous to a prey. The aim of the selection process isgenerate test cases able to kill as many mutants aspossible. To overcome disappointing experimentationresults on the studied .Net system, we propose a slightvariation on this idea, no longer at the "animal" level(lions killing zebras) but at the bacteriological level. Thebacteriological level indeed better reflects the test caseoptimization issue: it introduces of a memorizationfunction and the suppresses the crossover operator. Wedescribe this model and show how it behaves on the casestudy.
Recurrent sequences and Schur functions
Authors: Qing-Hu Hou, Yan-Ping Mu
Venue: Advances in Applied Mathematics (2003)

We show that some classical determinants in the theory of symmetric functions can be interpreted in terms of recurrent sequences. Conversely we generalize determinantal expressions of Schur functions, by taking several recurrent sequences having same characteristic polynomial, or by prolonging sequences to negative indices. Finally, we give some recurrent sequences associated to plethysm of symmetric functions, for example with characteristic polynomial having roots the same powers of the roots of the original characteristic polynomial.
Documentation for the CHIP Computer System (Version 1.1)
Authors: Ozalp Babaoglu, Mimi Bussan, Rogerio Drummond, Fred B. Schneider
Venue:  (1983)

CHIP (Cornell Hypothetical Instructional Processor) is a computer system that was designed as an educational tool for teaching undergraduate courses in operating systems and machine architecture. This document constitutes the sole reference manual for the CHIP computer system. A simulator for this hypothetical system exists under the UNIX operating system. The CHIP architecture includes dynamic memory mapping suitable for implementing virtual memory, eight interrupt priority levels, memory-mapped input/output and two modes of processor operation. The central processor of CHIP is compatible with the PDP-11 at the user-mode instruction level. Therefore, any non-privileged code written for the PDP-11 can be executed on CHIP. Several new user and kernel-mode instructions have been added to CHIP for increased efficiency. The CHIP simulator also supports input/output devices such as terminals, drums, disks and printers. All interactions with CHIP take place through an operator''s console being simulated on a terminal. Users can examine/alter memory locations, set breakpoints, detect the referencing of specified memory locations, start/stop execution, etc. through a console command language. Program global variables and functions can be referred to by symbolic name with the mapping to absolute addresses being performed automatically by the system. The software support environment for CHIP includes a C compiler, assembler and loader.