ppxscal/embedding_network huggingface dataset:
Probabilistic inference with large discrete domains
Authors: Rita Sharma
Venue:  (2006)

The straightforward representation of many real world problems is in terms of discrete random variables with large or infinite domains. For example, in a domain where we are trying to identify a person, we may have variables that have as domains, a set of all names, a set of all postal codes, and a set of all credit card numbers. The task usually reduces to performing probabilistic inference, i.e., compute the probability of some values of some random variables given the values of some other variables. Bayesian networks are a compact way to represent joint probability distributions. This thesis is concerned with probabilistic inference in Bayesian networks that have discrete random variables with large or infinite domains. Carrying out inference in Bayesian networks that have variables with large domains is a difficult problem. For efficient inference, we consider cases where there is some structure that can be exploited to make inference efficient. In this thesis we consider two kinds of structures that can be exploited for efficient inference. These structures allow us to partition the large number of values in equivalence classes. Rather than reasoning about every value of a variable individually, we can reason about a set of values in a single step. We first consider the case where there are intensional definitions of the conditional probability distributions. To represent these conditional probabilities, we introduce a CPD language that allows us to define the conditional probabilities procedurally, in terms of predicates and functions. We present an inference algorithm, Large Domain VE , for the CPD language that uses this representation to partitions the domains of the variables dynamically. The partitions depend on what is observed and what is queried. We apply Large Domain VE to the person identification problem that has variables with large domains. The second case we consider where there is a priori internal structure on the values of the variables. In particular, we consider the case where the values of the variables are represented as tree hierarchies. We call such variables hierarchically structured variables. We present a language for representing the conditional probabilities of Bayesian networks with hierarchically structured variables. To perform inference in Bayesian networks with hierarchically structured variables we construct an abstract Bayesian network dynamically, given some evidence and a query, by collapsing the hierarchies to include only those values necessary to answer the query. We can answer the query from the abstract Bayesian network using any standard inference algorithm. Finally, we show how both intensional definitions of the conditional probability distributions and hierarchically structured values can be put together to produce a general framework that can be applied to a more general class of problems.
Automatic Power Modeling of Infrastructure IP for System-on-Chip Power Analysis
Authors: Nikhil Bansal, Kanishka Lahiri, Anand Raghunathan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Modern System-on-Chips (SoCs) are often designed under stringent time-to-market constraints. Hence, they are realized by re-using a number of pre-designed components (or IP blocks) that implement standard, yet critical functions. An important category of IP blocks are the so-called Infrastructure IP (IIP) blocks, which include interfaces to off-chip memory, I/O devices, and peripherals, as well as hardware to provide DMA transfers, interrupts, timing, etc. IIP components are often responsible for a substantial portion of a SoC's power consumption, making it important to model and consider their effect in power-aware SoC design. However, system-level power analysis and optimization has, for the most part, focused on the processor, memory hierarchy, interconnect, and application-specific hardware. Relatively little work has addressed modeling the power consumed by these Infrastructure IP (IIP) components, or their impact on system-level tradeoffs. This paper describes a systematic methodology to automatically generate power models for IIP components for use in system-level power analysis and optimization tools. Our methodology starts with (i) a high-level functional model of an IIP component designed for fast simulation, and (ii) a corresponding implementation model (RTL or gate-level description), from which accurate power estimates can be obtained. It automatically generates an enhanced version of the high-level functional model, which includes an accurate, yet efficient power model. This paper describes the key steps of the methodology, and presents techniques based on statistical analysis and symbolic regression to automate the most labor-intensive steps. The proposed methodology has been applied to several commercial IIP designs, including ones from the Synopsys Design- Ware library. The resulting power models produce estimates that are within 7% of gate-level power analysis, while being several hundred times faster, making them highly suitable for system-level power analysis. Moreover, the use of an automatic methodology drastically reduces the effort spent in power model development, from over a week to under an hour in some cases. The automatically generated models have been integrated into an in-house system-level power estimation framework. We demonstrate their utility in exploring system-level design tradeoffs using an example SoC design.
REO: a generic RAID engine and optimizer
Authors: Deepak Kenchammana-Hosekote, Dingshan He, James Lee Hafner
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Present day applications that require reliable data storage use one of five commonly available RAID levels to protect against data loss due to media or disk failures. With a marked rise in the quantity of stored data and no commensurate improvement in disk reliability, a greater variety is becoming necessary to contain costs. Adding new RAID codes to an implementation becomes cost prohibitive since they require significant development, testing and tuning efforts. We suggest a novel solution to this problem: a generic RAID Engine and Optimizer (REO). It is generic in that it works for any XOR-based erasure (RAID) code and under any combination of sector or disk failures. REO can systematically deduce a least cost reconstruction strategy for a read to lost pages or for an update strategy for a flush of dirty pages. Using trace driven simulations we show that REO can automatically tune I/O performance to be competitive with existing RAID implementations.
Heimdal: an independent implementation of Kerberos 5
Authors: Johan Danielsson, Assar Westerlund
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Heimdal is an independently developed and free implementation of the Kerberos 5 protocol, unencumbered by US export restrictions. It is compatible with other implementations and is close to the MIT Kerberos 5 API. It includes versions of common applications such as telnet, ftp, rsh, su, and login. Furthermore, it has some new features not available in other implementations, such as authenticated and encrypted X connections, incremental database propagation, and support for IPv6 and Triple DES. There is also support for operation in firewalled environments.
Observing the swarm behaviour during its evolutionary design
Authors: Laura Diosan, Mihai Oltean
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Evolutionary Algorithms (EAs) can be used for designing Particle Swarm Optimization (PSO) algorithms that work, in some cases, considerably better than the human-designed ones. By analyzing the evolutionary process of design PSO algorithm we can identify different swarm phenomena (such as patterns or rules) that can give us deep insights about the swarm's behaviours. The observed rules can help us to design better PSO algorithms for optimization. In this paper we investigate and analyze swarm phenomena by looking to process of evolving PSO algorithms. Several interesting facts are inferred from the strategy evolution process (the particle quality could influence the update order, some particles are updated more frequently than others are, the initial swarm size is not always optimal).
Capturing the Dynamics of Mechanical Knobs
Authors: Colin Swindells, Karon E. MacLean
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

We present a novel experimental apparatus for the capture and replay of physical controls (mechanical knobs), as well as a set of acquired models and a design discussion related to the characterization approach taken here. Our work extends existing research by addressing problems surrounding identification of physical controls, including sensor gripping techniques for arbitrary target devices; and improved hardware and algorithm combinations for finer capture resolutions. Models were acquired from 5 real knobs, based on 2nd order model fits to torque and kinematic results of swept-sine excitations.
Implementing causal logging using OrbixWeb interception
Authors: Chanathip Namprempre, Jeremy Sussman, Keith Marzullo
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Some form of replicated data management is a basic service of nearly all distributed systems. Replicated data management maintains the consistency of replicated data. In wide-area distributed systems, causal consistency is often used, because it is strong enough to allow one to easily solve many problems while still keeping the cost low even with the large variance in latency that one finds in a wide-area network. Causal logging is a useful technique for implementing causal consistency because it greatly reduces the latency in reading causally consistent data by piggybacking updates on existing network traffic. We have implemented a CORBA service, called COPE, that is implemented by using causal logging. COPE also shares features with some CORBA security services and is naturally implemented using the OrbixWeb interception facilities. In implementing COPE in OrbixWeb, we encountered several problems. We discuss COPE, its implementation in OrbixWeb, and the problems we encountered in this paper. We hope that this discussion will be of interest to both those who are implementing and who are planning on using CORBA interception facilities.
Constructing services with interposable virtual hardware
Authors: Andrew Whitaker, Richard S. Cox, Marianne Shaw, Steven D. Grible
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Virtual machine monitors (VMMs) have enjoyed a resurgence in popularity, since VMMs can help to solve difficult systems problems like migration, fault tolerance, code sandboxing, intrusion detection, and debugging. Recently, several researchers have proposed novel applications of virtual machine technology, such as Internet Suspend/Resume [25, 31] and transparent OS-level rollback and replay [13]. Unfortunately, current VMMs do not export enough functionality to budding developers of such applications, forcing them either to reverse engineer pieces of a black-box VMM, or to reimplement significant portions of a VMM. In this paper, we present the design, implementation, and evaluation of µDenali, an extensible and programmable virtual machine monitor that has the ability to run modern operating systems. µDenali allows programmers to extend the virtual architecture exposed by the VMM to a virtual machine, in effect giving systems programmers the ability to dynamically assemble a virtual machine out of either default or custom-built virtual hardware elements. µDenali allows programmers to interpose on and modify events at the level of the virtual architecture, enabling them to easily perform tasks such as manipulating disk and network events, or capturing and migrating virtual machine state. In addition to describing and evaluating our extensible virtual machine monitor, we present an application-level API that simplifies writing extensions, and we discuss applications of virtual machines that we have built using this API.
Automatic Parallelization Techniques for the EM-4
Authors: Lubomir Bic, Mayez Al-Mouhamed
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

This paper presents a Data-Distributed Execution (DDE) approach that exploits iteration-level parallelism in loops operating over arrays.
Towards a Self Organizing Protocol for a Multi Agents System (MASSOP)
Authors: H. Mellah, S. Hassas, I. Halilali, Z. Mesneb, H. Drias
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The interaction between agents is more than one simple messages exchange [1]: one of the interaction aspects shows a conversation based on a shared and officially agreed messages exchange. The conversations between agents in the Multi Agents Systems (MAS) are often structured according to typical diagrams called interaction protocols. The interaction protocols aspects differ according to the type of the agents.
On the characteristics and effects of loudness during utterance production in continuous speech recognition
Authors: D. Tapias
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We have checked out that, in speech recognition based telephone applications, the loudness with which the speech signal is produced is a source of degradation of the word accuracy if it is lower or higher than normal. For this reason, we have carried out a research work which has reached three goals: (a) get a better understanding of the speech production loudness (SPL) phenomenon, (b) find out the parameters of the speech recognizer that are the most affected by loudness variations, and (c) compute the effects of SPL and whispery speech in large vocabulary continuous speech recognition (LVCSR). In this paper we report the results of this study for three different loudnesses (low, normal and high) and whispery speech. We also report the word accuracy degradation of a continuous speech recognition system when the speech production loudness is different than normal as well as the degradation for whispery speech. The study has been done using the TRESVOL Spanish database, that was designed to study, evaluate and compensate the effect of loudness and whispery speech in LVCSR systems.
Evaluating costs and benefits of distributed learning
Authors: J. O. Campbell
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Distributed learning may decrease cost per learner in relation to small campus-based engineering education courses. This paper presents design and evaluation strategies for distributed learning, together with an evaluation of the results for existing programs. It further describes means to evaluate the costs and benefits for both the provider and the customer. 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
Automatic expressive deformations for implying and stylizing motion
Authors: Paul Noble, Wen Tang
Venue: The Visual Computer: International Journal of Computer Graphics (2007)

Three-dimensional computer animation often struggles to compete with the flexibility and expressiveness commonly found in traditional animation, particularly when rendered non-photorealistically. We present an animation tool that takes skeleton-driven 3D computer animations and generates expressive deformations to the character geometry. The technique is based upon the cartooning and animation concepts of &#x201c;lines of action&#x201d; and &#x201c;lines of motion&#x201d; and automatically infuses computer animations with some of the expressiveness displayed by traditional animation. Motion and pose-based expressive deformations are generated from the motion data and the character geometry is warped along each limb&#x2019;s individual line of motion. The effect of this subtle, yet significant, warping is twofold: geometric inter-frame consistency is increased which helps create visually smoother animated sequences, and the warped geometry provides a novel solution to the problem of implied motion in non-photorealistic imagery. Object-space and image-space versions of the algorithm have been implemented and are presented.
An acoustic echo cancellation structure for synthetic surround sound
Authors: T. Yensen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper proposes an acoustic echo cancellation structure for hands-free synthetic surround sound applications, such as multiple participant conferencing, and virtual reality applications. Voice over Internet protocol (VoIP) and other virtual reality applications can benefit from the addition of 3D spatial audio generated by more than two loudspeakers. When full-duplex audio is present in a system, however, acoustic echo cancellation is required to eliminate the feedback echo path. The acoustic echo cancellation structure proposed by this paper is based on the acoustic echo canceller per spatial region allocation scheme previously introduced by the authors for two channel synthetic stereo. This paper shows that the spatial region allocation scheme is extensible to any number of channels which makes it extremely versatile and flexible, especially for surround sound audio. Microsoft Direct X 7, a commonly used application programmer interface (API), was used in our simulations to generate the 3D spatial audio on a PC.
AMD's 3DNow!/sup TM/ vectorization for signal processing applications
Authors: Dongho Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

AMD's 3DNow!/sup TM/ technology provides substantial speedup for digital signal processing applications. A set of DSP routines is vectorized with the 3DNow!/sup TM/ technology. The simplicity of the vector unit makes it easier to convert the conventional DSP programs into vector operations, and thus reduces the learning curve. The performance gain from typical DSP routines such as FIR, IIR and FFT indicates that the speedup can reach up to 1.5 compared to the conventional host-based signal processing units. 3D games and multimedia applications benefit from the technology. The vectorization can be integrated into compilers for the ease of use in increasing the performance of the signal processing applications.
FLUX-CIM: flexible unsupervised extraction of citation metadata
Authors: Eli Cortez, Altigran S. da Silva, Marcos André Gonçalves, Filipe Mesquita, Edleno S. de Moura
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

In this paper we propose a knowledge-base approach to help extracting the correct components of citations in any given format. Differently from related approaches that rely on manually built knowledge-bases (KBs) for recognizing the components of a citation, in our case, such a KB is automatically constructed from an existing set of sample metadata records from a given area (e.g., computer science or health sciences). Our approach does not rely on patterns encoding specific delimitators of a particular citation style. It is also unsupervised, in the sense that it does not rely on a learning method that requires a training phase. These features assign to our technique a high degree of automation and flexibility. To demonstrate the effectiveness and applicability of our proposed approach we have run experiments in which we applied it to extract information from citations in papers of two different domains. Results of these experiments indicate precision and recall levels above 94% and perfect extraction for the large majority of citations tested.
Detection of low-metal content objects by evidential fusion of mine detection sensors
Authors: Nada Milisavljević, Isabelle Bloch
Venue: Integrated Computer-Aided Engineering (2003)

The metal detector is the most widely used sensor in humanitarian demining. However, it does not provide enough information for the detection of objects with a low metal content. In this paper, we propose to combine it with other sensors, as investigated within HUDEM, a technology exploration project on humanitarian demining. Based on the specificities of such objects, we propose a method for modelling and fusion of measures extracted from the sensors in the framework of the Dempster-Shafer theory. We show how these objects can be distinguished from non-metallic and highly metallic ones. We also discuss how the proposed method deals with situations where the sensors do not detect the same object.
Speech/music discrimination for multimedia applications
Authors: K. El-Maleh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Automatic discrimination of speech and music is an important tool in many multimedia applications. Previous work has focused on using long-term features such as differential parameters, variances and time-averages of spectral parameters. These classifiers use features estimated over windows of 0.5-5 seconds, and are relatively complex. We present our results of combining the line spectral frequencies (LSFs) and zero crossing-based features for frame-level narrowband speech/music discrimination. Our classification results for different types of music and speech show the good discriminating power of these features. Our classification algorithms operate using only a frame delay of 20 ms, making them suitable for real-time multimedia applications.
Robustness of circuits under delay-induced faults: test of AES with the PAFI tool
Authors: Olivier Faurax, Assia Tria, Laurent Freund, Frederic Bancel
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Security of cryptographic circuits is a major concern. Fault attacks are a mean to obtain critical information with the use of physical disturbance and cryptanalysis. We propose a methodology and a tool to analyse the robustness of circuit under faults induced by a delay. We tested a circuit implementing AES and showed that delay faults can permit to perform known fault attacks.
Automatic Verification and Performance Analysis of Time-Constrained SysML Activity Diagrams
Authors: Yosr Jarraya, Andrei Soeanu, Mourad Debbabi, Fawzi Hassaine
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

We present in this paper a new approach for the automatic verification and performance analysis of SysML activity diagrams. Since timeliness is important in the design and analysis of real-time systems, we annotate activity diagrams with time constraints. In order to apply the model checking technique, we use discrete-time Markov chains (DTMC) as a semantic interpretation of such SysML models wherein communication is restricted to synchronization. Thus, we describe a mapping procedure of SysML activity diagrams to their corresponding DTMC and use PRISM model checker for the assessment and evaluation of performance characteristics. Finally, we apply our methodology on a real-life case study meant to assess a systems engineering behavioral model of a photo-camera device.