ppxscal/embedding_network huggingface dataset:
Static Test Compaction for Scan-Based Designs to Reduce Test Application Time
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Journal of Electronic Testing: Theory and Applications (2000)

We propose a static compaction procedure to reduce the test application time for full and partial scan synchronous sequential circuits. The procedure accepts as input a set of test subsequences. A test subsequence consists of a sequence of primary input vectors, and a vector to be scanned-in before the input sequence is applied. The procedure uses two operations to reduce the test application time. The first operation combines test subsequences. The second operation reduces the lengths of the combined subsequences (the length of a test subsequence is the length of the input sequence included in it). The reductions in test application time of the proposed procedure are demonstrated through experimental results.
A precise type analysis of logic programs
Authors: Lunjin Lu
Venue: Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming (2000)

This paper presents a new type analysis for logic programs. The type information in a set of substitutions is described by a disjunction of variable typings each of which maps a variable to a non-deterministic regular type. The use of non-deterministic regular types, set union and intersection operators, and disjunctions of variable typings makes the new type analysis more precise than those found in the literature. Experimental results on the performance of the new analysis are given together with comparable results from an existing type analysis. The fundamental problem of checking the emptiness of non-deterministic regular types is more complex in the new analysis. The experimental results, however, show that careful use of tabling reduces the effect to an average of 15% of execution time on a set of benchmarks.
The failure of TCP in high-performance computational grids
Authors: W. Feng, P. Tinnakornsrisuphap
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Distributed computational grids depend on TCP to ensure reliable end-to-end communication between nodes across the wide-area network (WAN). Unfortunately, TCP performance can be abysmal even when buffers on the end hosts are manually optimized. Recent studies blame the self-similar nature of aggregate network traffic for TCP's poor performance because such traffic is not readily amenable to statistical multiplexing in the Internet, and hence computational grids. In this paper, we identify a source of self-similarity previously ignored, a source that is readily controllable-TCP. Via an experimental study, we examine the effects of the TCP stack on network traffic using different implementations of TCP. We show that even when aggregate application traffic ought to smooth out as more applications' traffic are multiplexed, TCP induces burstiness into the aggregate traffic load, thus adversely impacting network performance. Furthermore, our results indicate that TCP performance will worsen as WAN speeds continue to increase.
Pretty good assurance
Authors: Jeffrey R. Williams, Marv Schaefer, Douglas J. Landoll
Venue: Proceedings of the 1995 workshop on New security paradigms (1995)

This paper describes the need for pretty good assurance; clearly stated claims about the security properties of systems, accompanied by evidence that explains in clear terms why we should believe that these claims are substantiated. Several different types of threats are identified and their relationships to assurance are explored. The developer's role consuming assurance. Finally, some thoughts on the future are presented.
A model for type checking: with an application to ALGOL 60
Authors: Henry F. Ledgard
Venue: Communications of the ACM (1972)

Most current programming languages treat computation over different classes of objects (e.g. numbers, strings, labels and functions). For correct compilation and execution, the following question then arises: is a program properly constructed so that its operations and operands are compatible? The activity of answering this question is usually called type checking. This paper attempts to isolate the notion of type checking and presents a partial solution to the type checking problem based on the notions of abstraction and application of functions. In particular, a program is mapped into an expression within a decideable subset of the &lgr;-calculus, which characterizes the type relations within the program and eliminates all other information. The determination of the type-wise correctness or incorrectness of the program is resolved by reducing its corresponding &lgr;-calculus expression to one of two normal forms, the constant &ldquo;correct&rdquo; for a type-wise correct program or the constant &ldquo;error.&rdquo; An application to type checking in Algol 60 is made, and the attendant problems faced for any notion of type checking are discussed.
Atomic scale modeling of polymerization catalysts
Authors: Tom K. Woo, Serguei Patchkovskii, Tom Ziegler
Venue: Computing in Science and Engineering (2000)

Developing new forms of plastic and improving the efficiency of the catalysts that produce them requires detailed insight into the reaction steps in the polymerization process. This calls for thorough analysis and hefty computational resources. The authors discuss their strategies for accurate modeling and Cobalt--a Beowulf supercomputer they built and optimized for quantum chemistry applications.
Design and implementation of JPEG encoder IP core
Authors: Chung-Jr Lian, Liang-Gee Chen, Hao-Chieh Chang
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A complete, low cost baseline JPEG encoder soft IP and its chip implementation are presented in this paper. It features user-defined, run-time re-configurable quantization tables, highly modularized and fully pipelined architecture. A prototype, synthesized with COMPASS cell library, has been implemented in TSMC 0.6-um single-poly, triple-metal process. It can run up to 40 MHz at 3.3V. This IP can be easily integrated into various application systems, such as scanner, PC camera and color FAX, etc.
Predicative programming Part II
Authors: Eric C. R. Hehner
Venue: Communications of the ACM (1984)

Part I of this two-part paper presented a new semantics of programs. Each program is considered to be a predicate, in a restricted notation, that specifies the observable behavior of a computer executing the program. We considered a variety of notations, including assignment, composition (semicolon), deterministic choice (if), nondeterministic choice, definition (nonrecursive and recursive), and variable declaration. We did not consider any input or output notations, or concurrency; that is the subject of Part II. We assume the reader is familiar with Part I, so that we can build on ideas presented there.
Overcoming the challenges to feedback-directed optimization (Keynote Talk)
Authors: Michael D. Smith
Venue: ACM SIGPLAN Notices (2000)

Feedback-directed optimization (FDO) is a general term used to describe any technique that alters a program's execution based on tendencies observed in its present or past runs. This paper reviews the current state of affairs in FDO and discusses the challenges inhibiting further acceptance of these techniques. It also argues that current trends in hardware and software technology have resulted in an execution environment where immutable executables and traditional static optimizations are no longer sufficient. It explains how we can improve the effectiveness of our optimizers by increasing our understanding of program behavior, and it provides examples of temporal behavior that we can (or could in the future) exploit during optimization.
A fast division technique for constant divisors
Authors: Ehud Artzy, James A. Hinds, Harry J. Saal
Venue: Communications of the ACM (1976)

A fast algorithm for division by constant divisors is presented. The method has proved very useful implemented as microcode on a binary machine, and can be adapted directly into hardware. The mathematical foundations of the algorithm are presented as well as some performance measures.
An Optical Bus-Based Distributed Dynamic Barrier Mechanism
Authors: William E. Cohen, David W. Hyde, Rhonda K. Gaede
Venue: IEEE Transactions on Computers (2000)

Barrier synchronization is a useful parallel programming construct for ensuring that all processors are at a particular location in the code before any processor is allowed to continue. Barrier synchronization is integral to programming models such as the Bulk Synchronous Parallel model. Specialized hardware is often used to improve the performance of a barrier synchronization operation. With continued improvement in processor performance, more efficient synchronization mechanisms are required to counter the rising relative cost of synchronization operations. A high-speed, distributed barrier synchronization mechanism has been developed for broadcast-based optical interconnection networks. This mechanism avoids multiple conversions between optical and electrical signals by having each processor locally decide whether the barrier in which it is participating has been satisfied. It also allows arbitrary sized partitions to be built dynamically during the execution of a program. Simulations of the current hardware design estimate that the barrier synchronization requires less than 300ns for a 128-processor system.
Teaching internet algorithmics
Authors: Michael T. Goodrich, Roberto Tamassia
Venue: Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education (2001)

We describe an Internet-based approach for teaching important concepts in a Junior-Senior level course on the design and analysis of data structures and algorithms (traditionally called CS7 or DS amp;A). The main idea of this educational paradigm is twofold. First, it provides fresh motivation for fundamental algorithms and data structures that are finding new applications in the context of the Internet. Second, it provides a source for introducing new algorithms and data structures that are derived from specific Internet applications. In this paper, we suggest some key pedagogical and curriculum updates that can be made to the classic CS7/DS amp;A course to turn it into a course on Internet Algorithmics. We believe that such a course will stimulate new interest and excitement in material that is perceived by some students to be stale, boring, and purely theoretical. We argue that the foundational topics from CS7/DS amp;A should remain even when it is taught in an Internet-centric manner. This, of course, should come as no surprise to the seasoned computer scientist, who understands the value of algorithmic thinking.
Using squeak for teaching user interface software
Authors: Mark Guzdial
Venue: ACM SIGCSE Bulletin (2001)

Squeak is a new programming language that is particularly appropriate for learning computer science. It offers an excellent infrastructure for interesting projects (e.g., multimedia, Web browsing and serving), and all source code is included (and written in Squeak) from the virtual machine, windowing, on up. Squeak is being used in a course on Objects and Design (focusing on the development of user interfaces), both to enhance the infrastructure for a course on, and to change how user interfaces are taught. Rather than teach a toolkit, the focus is now on teaching students how to build toolkits. This paper presents a pilot study suggesting benefits of our new approach.
High-level synthesis under multi-cycle interconnect delay
Authors: Jinhwan Jeon, Daehong Kim, Dongwan Shin, Kiyoung Choi
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

As process technology goes into deep submicron range, interconnect delay becomes dominant among overall system delay, occupying most of the system clock cycle time. Interconnect delay is now a crucial factor that needs to be considered even during high-level synthesis. In this paper, we propose a concurrent scheduling and binding algorithm that takes interconnect delay into account. We first define our distributed target architecture, which minimizes the effect of interconnect delay on clock cycle time. We no longer assume that interconnect delay between functional units is a part of one clock cycle. Interconnect delay can span over multiple clock cycles. We incorporate the concept of multi-cycle interconnect delay into scheduling and binding process, to reduce the critical path length and therefore the system latency. We show that by introducing interconnect delay, we can obtain latency improvement of up to 54 % and of 37% on the average.
Low-Power Area-Efficient Pipelined A/D Converter Design Using a Single-Ended Amplifier
Authors: Daisuke Miyazaki, Shoji Kawahito
Venue: Analog Integrated Circuits and Signal Processing (2000)

This paper presents a new scheme of a low-power area-efficient pipelined A/D converter using a single-ended amplifier. The proposed multiply-by-two single-ended amplifier using switched capacitor circuits has smaller DC bias current compared to the conventional fully-differential scheme, and has a small capacitor mismatch sensitivity, allowing us to use a smaller capacitance. The simple high-gain dynamic-biased regulated cascode amplifier also has an excellent switching response. These properties lead to the low-power area-efficient design of high-speed A/D converters. The estimated power dissipation of the 10-b pipelined A/D converter is less than 12 mW at 20 MSample/s.
Pupillary responses to emotionally provocative stimuli
Authors: Timo Partala, Maria Jokiniemi, Veikko Surakka
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

This paper investigated in two experiments pupillary responses to emotionally provocative sound stimuli. In experiment one, 30 subjects' pupillary responses were measured while listening to 10 negatively and 10 positively arousing sounds, and 10 emotionally neutral sounds. In addition, the subjects rated their subjective experiences to these stimuli. The results showed that the pupil size was significantly larger after highly arousing positive and negative stimuli than after neutral stimuli with medium arousal. In experiment two, the contents of the stimuli were more controlled than in experiment one. 22 subjects' pupillary responses were measured while listening to four negatively and four positively arousing sounds, and four emotionally neutral sounds. The results showed that the pupil size was significantly larger during negative highly arousing stimuli than during moderately arousing positive stimuli. The pupil size was also significantly larger after highly arousing negative stimuli than after moderately arousing neutral and positive stimuli. The results of the two experiments suggest that pupil size discriminates during and after different kinds of emotional stimuli. Thus, the measurement of pupil size variation my be a potentially useful computer input signal, for example, for affective computing.
Architectural support for fast symmetric-key cryptography
Authors: Jerome Burke, John McDonald, Todd Austin
Venue: ACM SIGPLAN Notices (2000)

The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides the mechanisms necessary to implement accountability, accuracy, and confidentiality in communication. As demands for secure communication bandwidth grow, efficient cryptographic processing will become increasingly vital to good system performance.In this paper, we explore techinques to improve the performance of symmetric key cipher algorithms. Eight popular strong encryption algorithms are examined in detail. Analysis reveals the algorithms are computaionally complex and contain little parallelism. Overall throughput on high-end microprocessor is quite poor, a 600 Mhz processor is incapable of saturation a T3 communication line with 3DES (triple DES) encrypted data.We introduce new instructions taht improve the efficiency of the analyzed algorithms. Our approach adds instruction set support for fast substitutions, general permutations, rotates, and modular arithmetic. Performance analysis of the optimized ciphers shows an overall speedup of 59% over a baseline machine with rotate instructions and 74% speedup over a baseline without rotates. Even higher speedups are demonstrated with optimized subtitutions (SBOXes) and additional functional unit resources. our analyses of the original and optimized algorithms suggest future directions for the design of high-performance programmable cryptographic processors.
Advanced cryptographic techniques for computer
Authors: Dennie Van Tassel
Venue: Communications of the ACM (1969)

Cryptographic techniques which can be used to maintain the confidentiality of information processed by computers are dealt with. Special emphasis is paid to the unique characteristics of computer files that make many cryptographic methods of little use. Relative security, costs, and preferred methods are included in this paper.
Using motives and artificial emotions for long-term activity of an autonomous robot
Authors: François Michaud, Jonathan Audet
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

To operate over a long period of time in the real world, autonomous mobile robots must have the capability of recharging themselves whenever necessary. In addition to be able to find and dock into a charging station, robots must be able to decide when and for how long to recharge. This decision is influenced by the energetic capacity of their batteries and the contingencies of their environments. To deal with this temporality issue and using research evidences from the field of psychology, this study investigates the use of motives and artificial emotions to regulate the recharging need of autonomous robots.
The impact project (panel session): determining the impact of software engineering research upon practice
Authors: Leon J. Osterweil, Lori A. Clarke, Michael Evangelist, Jeffrey Kramer, Dieter Rombach, Alexander L. Wolf
Venue: Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications (2000)

The purpose of this panel is to introduce the Impact Project to the community, and to engage the community in a broad ranging discussion of the project's goals, approaches, and methods. Some of the project's early findings and directions will be presented.
The evolution of storage structures
Authors: Charles W. Bachman
Venue: Communications of the ACM (1972)

Data base management systems have grown rapidly in their power and complexity over the 15-year history of data processing on commercially available computers. The original concepts have split, and new terms have been adopted to name and refer to these concepts. The Data Structure Diagram graphic technique is used to illustrate the splitting of the concepts and the structural relations which exist between these concepts at each point in the evolution.
Marriage&mdash;with problems
Authors: James P. Shuchter
Venue: Communications of the ACM (1960)

In Newark, New Jersey, Federal Pacific Electric Company operates a complex of modern plants producing specialized electrical equipment for construction and industry. From its assembly lines pours an assortment of packaged products for the distribution and control of electric power&mdash;circuit breakers, load centers, switches, motor control, instruments&mdash;more than 2000 catalog items, ranging in price from one to several hundreds of dollars. Federal Pacific also operates an international network of other plants producing engineered electrical equipment approaching in bulk the size of a house, but these are not warehouse items and, as such, are not relevant to today's discussion. 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
Arguments for a moratorium on the construction of a community information utility
Authors: Laurence I. Press
Venue: Communications of the ACM (1974)

In this article the author urges a prudent and decentralized approach to the question of the design and desirability of computerized community information utilities. Before accepting the inevitability and desirability of this or any technology, we should: (1) be sure of the feasibility (internally and externally) of what is proposed; (2) project and perhaps wait for changes in complementary techniques; (3) evaluate current and projected supplementary techniques; (4) establish the existence of demand for what is proposed; (5) take steps to involve a representative group of ultimate users in systems design, and (6) carefully think through possible side effects on man and his world view. Current proposals for community information utilities are examined in this framework, and the conclusion is drawn that society is not yet in a position to justify either the construction of an information utility in a prototype community or the acceptance of a policy in favor of its widespread implementation.
Nearly optimal perfectly-periodic schedules
Authors: Amotz Bar-Noy, Aviv Nisgav, Boaz Patt-Shamir
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

We consider the problem of scheduling a set of jobs on a single shared resource using time-multiplexing. A perfectly-periodic schedule is one where resource time is divided into equal size &ldquo;time-slots&rdquo; quanta, and each job gets a time slot precisely every fixed interval of time (the period of the job). Periodic schedules are advantageous in distributed settings with synchronized clocks, since they require very little communication to establish, and thereafter no additional communication overhead is needed. In this work we study the case where each job i has a given demand probability wi, and the goal is to design a perfectly-periodic schedule that minimizes the average time a random client waits until its job is executed. The problem is known to be NP-hard. The best known polynomial algorithm to date guarantees average waiting time of at most 3/2 opt + O(log M), where opt is the optimal waiting time. In this paper, we develop a tree-based methodology for periodic scheduling, and using new general results, we derive algorithms with better bounds. A key quantity in our methodology is a1 def = &radic; max {wi}/ &Sgr; &radic; wi. We compare the cost of a solution provided by our algorithms to the cost of a solution to a relaxed (non-integral) version of the problem. Our asymptotic tree-based algorithm guarantees cost of at most 1 + a O(1) 1 times the cost of the relaxed problem; on the other hand, we prove that the cost of any integral solution is bounded from below by the cost of the relaxed solution times 1 + a&OHgr;(1)1. We also provide three other tree-based algorithms with cost bounded by the cost of the relaxed solution times 3/2, 4/3+O(a1), and 9/8+O(a1). Each one of our four algorithms is the best known for some range of values of a1.
Interpolation search&mdash;a log logN search
Authors: Yehoshua Perl, Alon Itai, Haim Avni
Venue: Communications of the ACM (1978)

Interpolation search is a method of retrieving a desired record by key in an ordered file by using the value of the key and the statistical distribution of the keys. It is shown that on the average log logN file accesses are required to retrieve a key, assuming that the N keys are uniformly distributed. The number of extra accesses is also estimated and shown to be very low. The same holds if the cumulative distribution function of the keys is known. Computational experiments confirm these results.