ppxscal/embedding_network huggingface dataset:
Native binary dynamic optimization using performance counter sampling
Authors: Wei-Chung Hsu
Venue:  (2005)

Native binary dynamic optimization systems improve native program performance by applying optimizations while a program executes. By applying optimizations at run-time, a dynamic optimizer can exploit architectural features, optimize the use of dynamic libraries, and simplify code based on run-time information to improve the performance of statically compiled programs. Building an effective dynamic optimization system requires a way to find and optimize significant bottlenecks while maintaining a low overhead. Previous dynamic optimization work focused on profiling to find frequently executed code regions. However, the micro-architectural information necessary to identify cache misses, branch misprediction, and other dominant performance bottlenecks are difficult to identify without additional information. By sampling performance-monitoring hardware, a dynamic optimizer can gather critical information about cache misses and other performance critical events with a low overhead. This dissertation presents a real-world native dynamic optimization framework and the results of sampling performance-monitoring hardware to drive a native dynamic binary optimizer. The first part of this thesis focuses on run-time techniques for collecting information necessary for dynamic optimization by sampling performance-monitoring hardware. SPEC CPU 2000 benchmarks are studied to locate performance bottlenecks and estimate the effectiveness of sampling at identifying these bottlenecks. Finally, optimized static binaries are used to gauge the effectiveness of sampled information. The second part of this thesis focuses on applying sampled information at run-time. A working run-time optimizer executes in a parallel thread off the critical path of the main program. Optimized traces of code are dynamically generated to replace frequently executed code regions, and execution is redirected from the original program. The results of this approach are shown to be able to noticeably improve program performance for several benchmarks while incurring less than 2% overhead. The final part of this thesis focuses on adapting dynamic optimizations to programs with changing behavior over time. These behavior changes occur at regular intervals for many benchmarks, and can introduce new behaviors that can be optimized over time. The results of this work indicate that high level program behavior may mask optimizable low level behavior.
Improvement of Pairwise Alignment by an Information Measure
Authors: Keiko Sato
Venue: Open Systems Information Dynamics (2005)

The alignment of amino acid sequences is an important element in the study of life on the level of genome. There exist several methods to align the sequences by computer. In these methods there are several difficulties to judge whether the alignment result is proper. One of such problems is that many results give the same distance, so that often one cannot determine which result should be used. In this paper it is shown that the number of alignment results can be reduced by applying an information measure based on Shannon's mutual entropy.
Applying the proximity compatibility and the control-display compatibility principles to engineering design interfaces: Research Articles
Authors: Ling Rothrock, Kimberly Barron, Timothy W. Simpson, Mary Frecker, Chris Ligetti, Russell R. Barton
Venue: Human Factors in Ergonomics Manufacturing (2006)

The authors determine the utility of applying two display design principles toward the development of interfaces for engineering design. The first principle, called the Proximity Compatibility Principle, specifies that displays relevant to a common task or mental operation should be rendered close together in perceptual space. The second principle, called the Control-Display Compatibility Principle, stipulates that the spatial arrangement and manipulation of controls should be easily distinguishable. To examine the utility of both principles, the authors conducted an experiment comparing the ability of subjects to find effective designs using a separable versus a configural interface in a multi-objective engineering design task. Results suggest that the proximity compatibility principle is an effective indicator of task performance. Moreover, the control-display compatibility principle can be used as an indicator of performance efficiency. &copy; 2006 Wiley Periodicals, Inc. Hum Factors Man 16: 61&ndash;81, 2006.
Leakage Current Variability in Nanometer Technologies, invited
Authors: Mohab Anis, Mohamed H. Aburahma
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

The dramatic increase in leakage current coupled with the large increase in variability in highly scaled CMOS technologies, pose a major challenge for future IC design. Leakage variability can not be neglected anymore, due to the increase of leakage power percentage in modern ICs. In this paper, the main sources of variations and how they impact leakage current are discussed. Design guidelines to reduce variability based on several leakage reduction techniques are also presented. It is shown that reverse body bias technique increases leakage variability due to its deteriorating effect on Drain-Induced Barrier Lowering (DIBL). This paper highlights the need for further efforts in the area of statistical leakage estimation, as well as variation tolerant circuit techniques.
Simulation: from art to science for society
Authors: John McLeod
Venue: ACM SIGSIM Simulation Digest (1974)

Simulation can be a more effective tool for the study of problems of our times if the practitioners will adopt procedures which will make simulation more a science than an art. A big step in that direction would be the development and use of a standard format that would assure adequate and uniform documentation. Such a format is proposed, and criticism is solicited.
Tutorial &laquo; informatique mobile et pervasive &raquo;
Authors: Michel Adiba, Patricia Serrano Alvarado, Laurence Nigay, Michel Riveill
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

L'Informatique Mobile d&eacute;finit un vaste domaine d'&eacute;tudes pluridisciplinaires. Elle s'inscrit dans le mouvement de l'informatique pervasive, ubiquitaire et &eacute;vanescente. La multiplication des ordinateurs de poche et des assistants personnels, la g&eacute;n&eacute;ralisation de l'utilisation des cartes &agrave; puces et la multiplication des syst&egrave;mes embarqu&eacute;s dans des objets d'usage courant (automobile, t&eacute;l&eacute;vision, etc.) sont des t&eacute;moins de cet essor. L'explosion de la t&eacute;l&eacute;phonie mobile constitue un autre exemple significatif de la formidable extension de ce domaine.
The society for computer simulation
Authors: Charles A. Pratt
Venue: ACM SIGSIM Simulation Digest (1984)

On November 7, 1952, 39 representatives of 13 organizations met at the Colonial House in Oxnard, California, to discuss the formation of an association for simulation. The meeting was arranged, with the encouragement of his wife, Suzette, by John McLeod, who was then employed at the United States Naval Air Missile Test Center at Point Mugu, California. The group decided to form an organization, which they called the Simulation Council. The stated objective, as determined after some discussion, was "to increase the effectiveness and broaden the application of simulation." 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
Very High Radix Scalable Montgomery Multipliers
Authors: Kyle Kelley, David Harris
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper describes a very high radix scalable Montgomery multiplier. It extends the radix-2 Tenca-Koç scalable architecture using w × v-bit integer multipliers in place of AND gates. The new design can perform 1024-bit modular exponentiation in 6.6 ms using 2847 4-input lookup tables and 32 16 x 16 multipliers, making it the fastest scalable design yet reported.
Deterministic Low-Latency Data Transfer across Non-Integral Ratio Clock Domains
Authors: Suresh Balasubramanian, Narayanan Natarajan, Olivier Franza, Chris Gianos
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

System on a chip (SOC) implementations typically require their functional blocks to run at different clock frequencies in order to better optimize the system performance for a wide variety of applications while staying within the power envelope. The functional blocks are required to exchange data between themselves and with off-chip memory through a shared system interface module. Data transfers across this interface need to occur at low latency and high bandwidth to achieve the targeted chip performance. Also data transfers need to be deterministic to ease post-silicon debug and satisfy lock-step customers. This precludes the use of synchronizers. Fractional Clock Data Transfer (FCDT) is a solution that ensures full determinism while achieving very low latencies. This paper describes the FCDT scheme in general and proposes a sample implementation.
Wide Limited Switch Dynamic Logic Circuit Implementations
Authors: Thara Rejimon, Sanjukta Bhanja
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), is a growing concern in logic circuits. Accurate understanding and estimation of Single-Event-Upset sensitivities of individual nodes is necessary to achieve better soft error hardening techniques at logic level design abstraction. We propose a probabilistic framework to study the effect of inputs, circuit structure and delay on Single-Event-Upset sensitivity of nodes in logic circuits as a single joint probability distribution function (pdf). To model the effect of timing, we consider signals at their possible arrival times as the random variables of interest. The underlying joint probability distribution function, consists of two components: ideal random variables without the effect of SEU and the random variables affected by the SEU. We use a Bayesian Network to represent the joint pdf which is a minimal compact directional graph for efficient probabilistic modeling of uncertainty. The attractive feature of this model is that not only does it use the conditional independence to arrive at a sparse structure, but also utilizes the same for smart probabilistic inference. We show that results with exact (exponential complexity) and approximate non-simulative stimulus-free inference (linear in number of nodes and samples) on benchmark circuits yield accurate estimates in reasonably small computation time.
Ab initio study of charged states of H in amorphous SiO2
Authors: Julien Godet, Alfredo Pasquarello
Venue: Microelectronic Engineering (2005)

We carried out an ab initio investigation of the charged states of hydrogen in amorphous SiO2 using a previously generated model structure. We found a large variety of equilibrium configurations as a result of the disordered atomic structure in our model system. The formation energies of H0, H+ and H- remain nevertheless close to the energetics found for α-quartz, with the charged species always more stable than the neutral one irrespective of the electron Fermi level.
Query processing on streamed xml data
Authors: Sujoe Bose
Venue:  (2005)

In an era of unprecedented access and the resulting reliance on significant realtime information, a robust and powerful framework is required to harvest useful knowledge from the overwhelming overload of information. As data from disparate sources are frequently interrelated, it is often desirable to assimilate such correlations to deduce causal implications. The main focus of this thesis is in defining a framework to support continuous query processing of realtime data with powerful query constructs that correlate information across data streams. Since XML is adopted as the defacto standard for information exchange and is complemented with a rich set of supporting specifications and standards, we have chosen XML as the underlying data model for our framework with XQuery as the query language. We also address the challenge of executing powerful continuous queries on streaming data in hand-held mobile devices, which are inherently associated with low processing power, memory capacity, bandwidth, and a high degree of intermittent connectivity. One of the distinct contributions of this thesis is the provision of a fragmented model of XML data and the seamless processing of fragments instead of processing complete XML documents. By incorporating pro-active techniques to discard fragments that are neither part of the query result nor contribute to the query result, we achieve memory efficiency. We developed an algebra for stream processing of XML fragments, provided denotational semantics of the processing primitives, implemented it, and evaluated the memory efficiency gained using the XMark benchmark. In addition, we extended our framework to handle continuous querying of time-varying streamed XML data updates. The reconstruction of temporal data from continuous updates at a current time is never materialized and historical queries operate directly on the fragmented streams. Finally, we present a novel hash-count technique to help in streamed query processing by delivering query results faster and flushing buffers sooner for blocking queries. This thesis will have a broader impact on a wide range of applications that rely on stream processing, especially in electronic commerce and mobile applications, since it will improve the way services are provided to and processed by clients. We expect our constructed prototype systems to drastically improve performance when compared with other stream processing systems.
Assessing the Crash-Failure Assumption of Group Communication Protocols
Authors: Sergio Mena, Claudio Basile, Zbigniew Kalbarczyk, Andre Schiper, Ravi K. Iyer
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Designing and correctly implementing Group Communication Systems (GCSs) is notoriously difficult. Assuming that processes fail only by crashing provides a powerful means to simplify the theoretical development of these systems. When making this assumption, however, one should not forget that clean crash failures provide only a coarse approximation of the effects that errors can have in distributed systems. Ignoring such a discrepancy can lead to complex GCS-based applications that pay a large price in terms of performance overhead yet fail to deliver the promised level of dependability. This paper provides a thorough study of error effects in real systems by demonstrating a error-injection-drivendesign methodology, where error injection is integrated in the core steps of the design process of a robust fault-tolerant system. The methodology is demonstrated for the Fortika toolkit, a Java-based GCS. Error injection enables us to uncover subtle reliability bottlenecks both in the design of Fortika and in the implementation of Java. Based on the obtained insights, we enhance Fortika's design to reduce the identified bottlenecks. Finally, a comparison of the results obtained for Fortika with the results obtained for the OCAML-based Ensemble system in a previous work, allows us to investigate the reliability implications that the choice of the development platform (Java versus OCAML) can have.
Outsourcing and climbing a value chain
Authors: Shane Greenstein
Venue: IEEE Micro (2005)

A value chain is a core concept of manufacturing economics. Yet, business reporters often misuse the concept when discussing global outsourcing in electronic equipment manufacturing. This confusion is, fortunately, correctable with one big insight: There are two distinct strategies for improving a firm's value chain. Once these strategies are clarified, it exposes the problems with today's policy debate about outsourcing.
An Extended Petri net for Modeling Workflow with Critical Sections
Authors: Yehia Thabet Kotb, Andre Stephan Baumgart
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This work presents an extended workflow petri net which synchronizes activity flow in the critical sections of the process. A critical section is a non empty set of tasks that cannot serve more than one activity at a time. The structure of the proposed net is introduced and a theorem is proposed and proved for the properties of separability and serializability. A fully detailed model for the operation theater in a hospital is presented using the proposed theoretical structure to control concurrency between activities in the critical sections.
Integrating User-Level Threads with Processes in Scsh
Authors: Martin Gasbichler, Michael Sperber
Venue: Higher-Order and Symbolic Computation (2005)

Scsh, the Scheme shell, enables concurrent system programming with portable user-level threads. In scsh, threads behave like processes in many ways: each thread receives its own set of process resources; like Unix processes, new threads can inherit resources from the creating thread. The combination of scsh's interface to the POSIX API with user-level threads creates a number of design and implementation challenges: Scsh's abstractions for managing process resources raise interesting modularity issues, particularly in connection with first-class continuations. Scsh also provides an interface to the fork system call; its implementation must avoid common pitfalls that arise with a user-level thread system. This paper describes the design and implementation of the relevant abstractions and discusses the implications for programming-language and system design.
Eigenspace Method for Text Retrieval in Historical Document Images
Authors: Kengo Terasawa, Takeshi Nagasaki, Toshio Kawashima
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A new method for text retrieval that does not need segmentation is described. Segmenting the images in historical documents into individual characters is difficult. Therefore, the conventional OCR method, which uses segmentation, does not work well. Our method instead divides the text image into a sequence of small slits. The image region that corresponds to the query image region is retrieved by solving the matching problem of these sequences. Applying the eigenspace method to the slit images enables us to solve the matching problem efficiently. Moreover, using dynamic time warping (DTW) further improves the results. Our method has higher accuracy than the simple template matching method, and it has far higher efficiency in computational cost.
Information processing, memories, and synchronization in chaotic neural network with the time delay
Authors: Vladimir E. Bondarenko
Venue: Complexity (2005)

Information processing and two types of memory in an analog neural network model with time delay that produces chaos similar to the human and animal EEGs are considered. There are two levels of information processing in this neural network: the level of individual neurons and the level of the neural network. Similar to the state of brain, the state of chaotic neural network is defined. It is characterized by two types of memories (memory I and memory II) and correlation structure between the neurons. In normal (unperturbed) state, the neural network generates chaotic patterns of averaged neuronal activities (memory I) and patterns of oscillation amplitudes (memory II). In the presence of external stimulation, the activity patterns change, showing changes in both types of memory. As in experiments on stimulation of the brain, the neural network model shows synchronization of neuronal activities due to stimulus measured by Pearson's correlation coefficient. An increase in neural network asymmetry (increase of the neural network excitability) leads to the phenomenon similar to the epilepsy. Modeling of brain injury, Parkinson's disease, and dementia is performed by removing and weakening interneuron connections. In all cases, the chaotic neural network shows a decrease of the degree of chaos and changes in both types of memory similar to those observed in experiments with healthy human subjects and patients with Parkinson's disease and dementia. &copy; 2005 Wiley Periodicals, Inc. Complexity 11:39&ndash;52, 2005
Cell Processor Low-Power Design Methodology
Authors: Daniel Stasiak, Rajat Chaudhry, Dennis Cox, Stephen Posluszny, Jim Warnock, Steve Weitzel, Dieter Wendel, Michael Wang
Venue: IEEE Micro (2005)

Power consumption is one of the major challenges in VLSI Design. Power constrained designs must attack power reduction with many techniques and need tools to accurately predict the power consumption to provide designers feedback on the efficiency of the power management logic. This paper presents the reduction techniques used, the methodology behind cycle accurate power estimation, and hardware measurements vs. power estimates correlation on the first generation CELL Processor.
A Lightweight Approach to Semantic Web Service Synthesis
Authors: Jianguo Lu, Yijun Yu, John Mylopoulos
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

Web service technologies are becoming a new paradigm for distributed computing. With increasing number of web services available on the internet, there is an urgent need for information brokers that can autonomously integrate web services on behalf of a user. To this end, we propose web service specification, which defines what the service is but not how the service is implemented, and service synthesizer, which can dynamically synthesize the implementation of the specification from existing web services over the web.
Measuring the Information Content of Fracture Lines
Authors: Helena C. Leitão, Jorge Stolfi
Venue: International Journal of Computer Vision (2005)

Reassembling unknown broken objects from a large collection of fragments is a common problem in archaeology and other fields. Computer tools have recently been developed, by the authors and by others, which try to help by identifying pairs of fragments with matching outline shapes. Those tools have been successfully tested on small collections of fragments; here we address the question of whether they can be expected to work also for practical instances of the problem (103 to 105 fragments). To that end, we describe here a method to measure the average amount of information contained in the shape of a fracture line of given length. This parameter tells us how many false matches we can expect to find for it among a given set of fragments. In particular, the numbers we obtained for ceramic fragments indicate that fragment outline comparison should give useful results even for large instances of the problem.
Multimedia and Reality
Authors: Forouzan Golshani
Venue: IEEE MultiMedia (2006)

The author considers possibilities for combining natural processes and multimedia technologies. An example includes engineering sensors and actuators together toward forming an intelligent habitat.