ppxscal/embedding_network huggingface dataset:
Fuzzy trellis vector quantization of images
Authors: T. Haddad
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper introduces a new codebook search algorithm for trellis vector quantization systems (TVQ). The development of the new algorithm is based on the symbol-MAP channel decoding algorithm, which is modified for data compression to deliver soft distortion-related reliability information. Following a rate-distortion theoretic approach, the soft information is used to derive a codebook search algorithm that is capable of solving the problems associated with the LBG algorithm. The derived algorithm is fuzzy in the sense that it follows a soft association rule, however, it is deterministic in the descent towards the global minimum distortion point. Although the derivation is general, the algorithm is tested using gray-scale images, which provide a nonconvex square-error distortion surface. As shown in the simulation section, the new algorithm provides lower energy codebooks (/spl sim/0.8 dB gain), while being significantly less sensitive to initial codebooks using short training image sequences.
A user-mode port of the linux kernel
Authors: Jeff Dike
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

The Linux kernel has been ported so that it runs on itself, in a set of Linux processes. The result is a user space virtual machine using simulated hardware constructed from services provided by the host kernel. A Linux virtual machine is capable of running nearly all of the applications and services available on the host architecture. This paper describes the capabilities of a user-mode virtual machine, the design and implementation of the port, some of the applications that it lends itself to, and some of the work that remains to be done.
On the Memory Access Patterns of Supercomputer Applications: Benchmark Selection and Its Implications
Authors: Richard C. Murphy, Peter M. Kogge
Venue: IEEE Transactions on Computers (2007)

This paper compares the System Performance Evaluation Cooperative (SPEC) Integer and Floating-Point suites to a set of real-world applications for high-performance computing at Sandia National Laboratories. These applications focus on the high-end scientific and engineering domains; however, the techniques presented in this paper are applicable to any application domain. The applications are compared in terms of three memory properties: 1) temporal locality (or reuse over time), 2) spatial locality (or the use of data "near” data that has already been accessed), and 3) data intensiveness (or the number of unique bytes the application accesses). The results show that real-world applications exhibit significantly less spatial locality, often exhibit less temporal locality, and have much larger data sets than the SPEC benchmark suite. They further quantitatively demonstrate the memory properties of real supercomputing applications.
Dependability Assessment of Grid Middleware
Authors: Nik Looker, Jie Xu
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Dependability is a key factor in any software system due to the potential costs in both time and money a failure may cause. Given the complexity of Grid applications that rely on dependable Grid middleware, tools for the assessment of Grid middleware are highly desirable. Our past research, based around our Fault Injection Technology (FIT) framework and its implementation, WS-FIT, has demonstrated that Network Level Fault Injection can be a valuable tool in assessing the dependability of traditional Web Services. Here we apply our FIT framework to Globus Grid middleware using Grid-FIT, our new implementation of the FIT framework, to obtain middleware dependability assessment data. We conclude by demonstrating that Grid-FIT can be applied to Globus Grid systems to assess dependability as part of a fault removal mechanism and thus allow middleware dependability to be increased.
Modeling of Leakages in Nano-Scale DG MOSFET to Implement Low Power SRAM: A Device/Circuit Co-Design
Authors: Deblina Sarkar, Samiran Ganguly, Deepanjan Datta, A. A. P. Sarab, Sudeb Dasgupta
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Double-Gate (DG) MOSFET has emerged as one of the most promising devices for logic and memory circuit design in sub 10nm regime. In this paper, we investigate the gate-to-channel leakage, EDT, BTBT and sub-threshold leakage for DG MOSFET. Simulations are performed using 2D Poisson-Schrödinger simulator with tight-binding Green's function approach. Then we analyze the effect of parameter variation to optimize low leakage SRAM cell using DG devices. The DG device/circuit co-design successfully demonstrates the benefit of using metal gate intrinsic body DG devices which significantly reduces BTBT and EDT in SRAM architecture.
Analog and digital filter design using Matlab
Authors: T. Baez-Lopez
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. The goal of this work is to show a software package, based in Matlab, that simplifies the process of designing analog filters. This package is menu oriented using the Matlab capabilities for doing so. The package is able to design lowpass, highpass, bandpass, and bandreject filters. The approximation magnitude responses can be Butterworth (maximally flat magnitude), Chebyshev (equal-ripple), Inverse Chebyshev, and Elliptic ones. In the case of phase response we have the Thomson one (maximally flat delay) also known as Bessel response. The output for the approximation stage is a set of data that includes the transfer function poles and zeros, quadratic factors for both numerator and denominator polynomials, and the numerator and denominator polynomials. The network realizations can be either passive or active realizations. For the passive realizations we have the low sensitivity ladder realization. This realization is available for any approximation type. In the case of the active realizations we have implemented the cascade of biquad stages but we are working in the active ladder realization. For the biquad stages available we have the Sallen-Key realization, multiple feedback, state-variable KHN, state variable Tow-Thomas, and the GIC based biquad.
Theory of wavelet transform over finite fields
Authors: F. Fekri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We develop the theory of the wavelet transform over Galois fields. To avoid the limitations inherent in the number theoretic Fourier transform over finite fields, our wavelet transform relies on a basis decomposition in the time domain rather than in the frequency domain. First, we characterize the infinite dimensional vector spaces for which an orthonormal basis expansion of any sequence in the space can be obtained using a symmetric bilinear form. Then, by employing a symmetric, non-degenerate, canonical bilinear form we derive the necessary and sufficient condition that basis functions over finite fields must satisfy in order to construct an orthogonal wavelet transform. Finally, we give a design methodology to generate the mother wavelet and scaling function over Galois fields by relating the wavelet transform to a two channel paraunitary filter bank.
Controlling individual agents in high-density crowd simulation
Authors: N. Pelechano, J. M. Allbeck, N. I. Badler
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Simulating the motion of realistic, large, dense crowds of autonomous agents is still a challenge for the computer graphics community. Typical approaches either resemble particle simulations (where agents lack orientation controls) or are conservative in the range of human motion possible (agents lack psychological state and aren't allowed to 'push' each other). Our HiDAC system (for High-Density Autonomous Crowds) focuses on the problem of simulating the local motion and global wayfinding behaviors of crowds moving in a natural manner within dynamically changing virtual environments. By applying a combination of psychological and geometrical rules with a social and physical forces model, HiDAC exhibits a wide variety of emergent behaviors from agent line formation to pushing behavior and its consequences; relative to the current situation, personalities of the individuals and perceived social density.
Organizing effective laboratory work in teams
Authors: A. H. Sayles, J. H. Wise
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Although the engineering design group notion sounds simple, it can be a complex process for undergraduate engineering students as well as for professors. Some of the concerns are: the basis for placing students in a particular group, evaluation of both group and individual efforts, interpretation and implementation of ABET (Accreditation Board for Engineering and Technology) criteria, and the effectiveness of the learning experience within the design team process. At the US Military Academy, electrical engineering students start the program with a group design experience in the introductory digital logic course taught to sophomores. They complete the program with a similar group design effort in the senior design project course. This paper is an opportunity to discuss these two experiences and measure the growth of the students' ability to interact with peers in an engineering design environment.
Engineering design over fast modem links
Authors: P. H. Zang
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The ability to develop concepts of engineering design to students off campus by video and fast modem link is described. Using affordable X-Terminal emulation software running on 14.4 Kbaud modems, student centered (home or office) learning has been offered at GMI for the last three years in the Mechanical Engineering Graduate program. Students using the video based instruction, in combination with the modem links, are able to develop and analyze complex exercises and projects. The methodology described in this paper could be used for undergraduate, graduate, or continuing education programs. 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
Activity models for use in low power, high-level synthesis
Authors: R. Henning
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Characteristics of the data being processed can be used to reduce the power consumption in the data path of a VLSI circuit by exploiting their relationship with transition activity during high-level synthesis. Important relationships between fixed-point, two's complement data characteristics and 0/spl rarr/1 transition activity in static CMOS circuits are presented in this paper. Models for computing transition activity in terms of a new set of transition parameters are developed. Propagation of data characteristics through multiplication and addition functional units is discussed. The use of the relationships and models to analyze and significantly reduce 0/spl rarr/1 transition activity with little computational effort is illustrated with examples.
An efficient motion estimation technique based on a rate-distortion criterion
Authors: W. C. Chung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We present an efficient motion estimation algorithm where motion vectors are selected based on a rate-distortion criterion. The algorithm minimizes the rate subject to a constraint on overall distortion by optimizing jointly the motion vector coder and the residual coder. As the joint optimization is generally very demanding, we propose methods where the rate-distortion performance of the residual coder is approximated by parametric functions. This results in a substantial reduction in computational complexity while sacrificing only a small loss in performance. Experimental results indicate that the proposed algorithm can improve the performance of H.261- and H.263-based video coders significantly while still generating H.261/H.263 decodable bit streams, respectively.
Fast high quality interpolation of missing data in image sequences using a controlled pasting scheme
Authors: P. M. B. van Roosmalen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

An important topic in image restoration is interpolation of missing data in image sequences. Missing data is a result of dirt on film and of ageing processes where the film contents are replaced by data that bears little relationship with the original scene. We present a method for interpolating missing data with the aim of achieving higher fidelity and more consistency in the interpolated results than can be achieved by existing methods. This is done by combining autoregressive models and Markov-random field techniques. Experimental results confirm the superior performance of the proposed method over existing methods.
Structure and parameter learning via entropy minimization, with applications to mixture and hidden Markov models
Authors: M. Brand
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We develop a computationally efficient framework for finding compact and highly accurate hidden-variable models via entropy minimization. The main results are: (1) an entropic prior that favors small, unambiguous, maximally structured models. (2) A prior balancing manipulation of Bayes' rule that allows one to gradually introduce or remove constraints in the course of iterative reestimation. (1) and (2) combined give the information-theoretic free energy of the model and the means to manipulate it. (3) Maximum a posteriori (MAP) estimators such that entropy optimization and deterministic annealing can be performed wholly within expectation maximization (EM). (4) Trimming tests that identify excess parameters whose removal will increase the posterior, thereby simplifying the model and preventing over-fitting. The end result is a fast and exact hill-climbing algorithm that mixes continuous and combinatoric optimization and evades sub-optimal equilibria. Examples are given using speech and language problems.
Battery-Sensing Intrusion Protection for Wireless Handheld Computers Using a Dynamic Threshold Calculation Algorithm for Attack Detection
Authors: Timothy K. Buennemeyer, Faiz Munshi, Randy C. Marchany, Joseph G. Tront
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper proposes a pioneering Battery-Sensing Intrusion Protection System (B-SIPS) for mobile computers, which alerts on power changes detected on small wireless devices, using an innovative Dynamic Threshold Calculation algorithm. B-SIPS enabled hosts are employed as sensors in a wireless network and form the basis of the intrusion detection system (IDS). This detection capability is scalable and complementary with existing commercial and open system network IDSs. B-SIPS implementation correlates device power consumption with IEEE 802.11 Wi-Fi and 802.15.1 Bluetooth communication activity. Irregular and attack activity is detected and reported to the intrusion detection engine for correlation with existing signatures in a database and for forensic investigation by a security manager.
Evolvable hardware
Authors: Lukas Sekanina
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

In this tutorial, fundamental concepts of evolutionary circuit design and evolvable hardware will be introduced. In particular, we will deal with evolutionary algorithms and reconfigurable devices utilized for hardware evolution as well as with their interactions in typical applications of evolvable hardware. Traditionally, evolvable hardware is interpreted from the perspective of electrical engineering and computer engineering. However, existing results in the field of evolvable hardware have impacts on theoretical computer science. Hence the goal of this tutorial is also to present a non-traditional view on evolvable hardware reflecting these theoretical issues.
Improving International e-Customs--The European ITAIDE Initiative
Authors: Eveline van Stijn, Niels Bjorn-Andersen, Liana Razmerita, Helle Zinner Henriksen
Venue: Proceedings of the First International Conference on the Digital Society (2007)

The objective of this paper is to present the strategy employed in the European Union to reform the customs processes by means of information technology, spanning borders within and outside the EU. The European ITAIDE project (IT for Adoption and Intelligent Design for E-government) aims to develop and implement solutions that support improved interactions between government agencies and businesses, providing Single Window Access and creating possibilities for gaining Authorized Economic Operator status. As an example of this, we report on the e-export solution implemented by the Danish tax and customs administration, which supports the submission of export statements in electronic format through Single Window Access. Based on this case, we argue that in order to realize massive diffusion of e-customs solutions, it is crucial to address challenges regarding for instance interoperability and IT-readiness. The integral approach of the ITAIDE project offers a great opportunity to do so.
A comparative study between parametric blur estimation methods
Authors: S. Chardon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

In pattern recognition problems, the effectiveness of the analysis depends heavily on the quality of the image to be processed. This image may be blurred and/or noisy and the goal of digital image restoration is to find an estimate of the original image. A fundamental issue in this process is the blur estimation. When the blur is not readily available, it has to be estimated from the observed image. Two main approaches can be found in the literature. The first one identify the blur parameters before any restoration whereas the second one realizes these two steps jointly. We present a comparative study of several parametric blur estimation methods, based on a parametric ARMA modeling of the image, belonging to the first approach. Our purpose is to evaluate the accuracy of the various methods, on which the restoration procedure relies, and their robustness to modeling assumptions, noise, and size of support.
Piranha audit: a kernel enhancements and utilities to improve audit/logging
Authors: Vincenzo Cutello, Emilio Mastriani, Francesco Pappalardo
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

This paper presents a mechanism to enrich logging as required in TCSEC [1] document to detect and stop possible intrusions based on typical attacks and to protect the sensible audit data from deletion/modification even in root compromise situation. After installing Piranha Audit, administrators will have a solid infrastructure for improving security and resistance to penetration, with only modest performance penalties. We present experimental results of the advantages of this solution and the performance impact of the mechanism.
Adaptive deformations with fast tight bounds
Authors: Miguel A. Otaduy, Daniel Germann, Stephane Redon, Markus Gross
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Simulation of deformations and collision detection are two highly intertwined problems that are often treated separately. This is especially true in existing elegant adaptive simulation techniques, where standard collision detection algorithms cannot leverage the adaptively selected degrees of freedom. We propose a seamless integration of multigrid algorithms and collision detection that identifies boundary conditions while inherently exploiting adaptivity. We realize this integration through multiscale bounding hierarchies, a novel unified hierarchical representation, together with an adaptive multigrid algorithm for irregular meshes and an adaptivity-aware hierarchical collision detection algorithm. Our solution produces detailed deformations with adapted computational cost, but it also enables robust interactive simulation of self-colliding deformable objects with high-resolution surfaces.
Multi-objective evolutionary guidance for swarms
Authors: E. J. Hughes
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A novel approach for generating optimal flight paths for a swarm of missiles using an on-line, noise-aware, multi-objective evolutionary algorithm is introduced. The trajectory shape is controlled by flying via intermediate points which are adjusted dynamically by the evolutionary algorithm, then towards the point of impact with the target.
Are the Logical Foundations of Verifying Compiler Prototypes Matching user Expectations?
Authors: Patrice Chalin
Venue: Formal Aspects of Computing (2007)

The verifying compiler (VC) project proposals suggest that mainstream software developers are its targeted end-users. Like other software engineering efforts, the VC project success depends on appropriate end-user consultation. Industrial use of program assertions for the purpose of run-time assertion checking (RAC) is becoming commonplace. A likely next step on the path to VC adoption is the use of assertions in extended static checking (ESC), a fully automated form of static program verification (SPV). Unfortunately, all current VC prototypes supporting SPV, adopt a semantics which is unsound relative to the standard run-time interpretation of assertions. In this article, we report on the results of a survey in which we asked industrial developers what logical semantics they want program assertions to have, and whether consistency across RAC and SPV tools is important. Survey results indicate that developers are in favor of a semantics for assertions that is compatible with their current use in RAC.
Optimal design of real and complex minimum phase digital FIR filters
Authors: N. Damera-Venkata
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We present a generalized optimal minimum phase digital FIR filter design algorithm that supports (1) arbitrary magnitude response specifications, (2) high coefficient accuracy, and (3) real and complex filters. The algorithm uses the discrete Hilbert transform relationship between the magnitude spectrum of a causal real sequence and its minimum phase delay phase spectrum given by Cizek (1970). We extend the transform pair to the complex case and show that the algorithm gives arbitrary coefficient accuracy. We present design examples that exceed the coefficient accuracy of the optimal real minimum phase filters reported by Chen and Parks (1986) and reduce the length of the optimal complex linear phase filters designed by Karam and McClellan (1995).