ppxscal/embedding_network huggingface dataset:
Estimation and bounding of energy consumption in burst-mode control circuits
Authors: Peter A. Beerel, Kenneth Y. Yun, Steven M. Nowick, Pei-Chuan Yeh
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

This paper describes two techniques to quantify energy consumption of burst-mode asynchronous (clock-less) control circuits. The circuit specifications considered are extended burst-mode specifications, and the implementations are multi-level logic implementations whose outputs are guaranteed to be free of any voltage glitches (hazards). Both techniques use stochastic analysis to combine a small number of simulations in order to quantify average energy per external signal transition. The first technique uses N-valued simulation to derive mathematically tight upper and lower bounds of energy consumption. Using this technique we bound the effect of hazards under all possible operating conditions and environments for a given circuit. Additionally, to drive synthesis tools for low-power, we propose a second technique that uses fixed-delay simulation to derive a realistic estimate of energy consumption within our derived upper and lower bounds. We demonstrate the feasibility of both these techniques on a variety of burst-mode control circuits used in an industrial-quality chip. Our preliminary results indicate that less than 5% of the power of typical multi-level burst-mode circuits can be attributed to hazards.
Expressing rhetorical relations in instructional text: a case study of the purpose relation
Authors: Keith Vander Linden, James H. Martin
Venue: Computational Linguistics (1995)

Natural language provides an extensive set of lexical and grammatical forms for expressing concepts, a set from which writers choose the particular form that they feel will produce the most effective expression given the communicative context. An important task of the text generation researcher is to specify both the range of these forms and the contexts in which they are used. This paper addresses this issue in the context of the expression of procedural relations between actions in instructional text. It employs the following four-step approach to achieve this goal: (1) collect a corpus of the relevant text type; (2) perform a detailed linguistic study of a portion of this corpus, called the training set, and reserve the remainder as a testing set; (3) implement the results of this study in a text generation system; and (4) compare the output of the system with the text found in the entire corpus. This has resulted in the construction of IMAGENE, an instructional text generation system that embodies a model of the forms of expression consistently used by instructional text writers over a broad range of instruction types. The details of IMAGENE's treatment of purpose expressions are given as representative of the coverage and form of the full system.
Image shading taking into account relativistic effects
Authors: Meng-Chou Chang, Feipei Lai, Wei-Chao Chen
Venue: ACM Transactions on Graphics (TOG) (1996)

This article is concerned with creating more realistic images of 3D scenes which are moving relative to the viewer at such high speeds that the propagation delay of light signals and other relativistic effects can not be neglected. Creating images of 3D scenes in relativistic motion might have important applications to science-fiction films, computer games, and virtual environments. We shall discuss the following problems: (1) how to determine the visual appearance of a rapidly moving object, (2) how to determine the apparent radiance of a scene point on a moving object, (3) how to determine the incident irradiance at a scene point coming from a moving light source, (4) how to determine the color of a rapidly moving object, and (5) how to generate shadows when there are relative motions between the viewer, the scenes, and the light sources. Detailed examples are also given to show the result of shading with the relativistic effects taken into account.
Relief from the audio interface blues: expanding the spectrum of menu, list, and form styles
Authors: Paul Resnick, Robert A. Virzi
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1995)

Menus, lists, and forms are the workhorse dialogue structures in telephone-based interactive voice response applications. Despite diversity in applications, there is a surprising homogeneity in the menu, list, and form styles commonly employed. There are, however, many alternatives, and no single style fits every prospective application and user population. A design space for each dialogue structure organizes the alternatives and provides a framework for analyzing their benefits and drawbacks. In addition to phone-based interactions, the design spaces apply to any limited-bandwidth, temporally constrained display devices, including small-screen devices such as personal digital assistants (PDAs) and screen phones.
Output from generic packages
Authors: Paul Slater
Venue: ACM SIGAda Ada Letters (1995)

Ada83 suffers from being a non-polymorphic statically bound language in that, the types of data need to be known before run-time. The generic mechanism helps to overcome this limitation in that a non-type specific package can be written and instantiated for several actual data types, depending on the generic formal parameter chosen. One problem that is not solved by the generic mechanism is that of input and output of data values. Since actual data types are represented in different ways, there is no single routine which can be called upon to get or put items of a generic formal type. This paper outlines a possible solution to this problem.
Scheduling for cache affinity in parallelized communication protocols
Authors: James D. Salehi, James F. Kurose, Don Towsley
Venue: Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems (1995)

We explore processor-cache affinity scheduling of parallel network protocol processing in a setting in which protocol processing executes on a shared-memory multiprocessor concurrently with a general workload of non-protocol activity. We find that affinity scheduling can significantly reduce the communication delay associated with protocol processing, enabling the host to support a greater number of concurrent streams and to provide a higher maximum throughput to individual streams. In addition, we compare implementations of two parallelization approaches (Locking and Independent Protocol Stacks) with very different caching behaviors.
An inverted taxonomy of sorting algorithms
Authors: Susan M. Merritt
Venue: Communications of the ACM (1985)

An alternative taxonomy (to that of Knuth and others) of sorting algorithms is proposed. It emerges naturally out of a top-down approach to the derivation of sorting algorithms. Work done in automatic program synthesis has produced interesting results about sorting algorithms that suggest this approach. In particular, all sorts are divided into two categories: hardsplit/easyjoin and easysplit/hardjoin. Quicksort and merge sort, respectively, are the canonical examples in these categories. Insertion sort and selection sort are seen to be instances of merge sort and quicksort, respectively, and sinking sort and bubble sort are in-place versions of insertion sort and selection sort. Such an organization introduces new insights into the connections and symmetries among sorting algorithms, and is based on a higher level, more abstract, and conceptually simple basis. It is proposed as an alternative way of understanding, describing, and teaching sorting algorithms.
CONS should not CONS its arguments, part II: Cheney on the M.T.A.
Authors: Henry G. Baker
Venue: ACM SIGPLAN Notices (1995)

Previous Schemes for implementing full tail-recursion when compiling into C have required some form of "trampoline" to pop the stack. We propose solving the tail-recursion problem in the same manner as Standard ML of New Jersey, by allocating all frames in the (garbage-collected) heap. The Scheme program is translated into continuation-passing style, so the target C functions never return. The C stack pointer then becomes the allocation pointer for a Cheney-style copying garbage collection scheme. Our Scheme can use C function calls, C arguments, C variable-arity functions, and separate compilation without requiring complex block-compilation of entire programs. Our C version of the "Boyer" benchmark is available at ftp://ftp.netcom.com/pub/hb/hbaker/cboyer13.c.
Distributed data access in AC
Authors: William W. Carlson, Jesse M. Draper
Venue: ACM SIGPLAN Notices (1995)

We have modified the C language to support a programming model based on a shared address space with physically distributed memory. With this model users can write programs in which the nodes of a massively parallel processor can access remote memory without message passing. AC provides support for distributed arrays as well as pointers to distributed data. Simple array references and pointer dereferencing are sufficient to generate low-overhead remote reads and writes. We have implemented these ideas in a compiler based on the GNU C compiler and targeted at Cray Research's T3D. Initial performance measurements show that AC generates code for remote accesses which is considerably faster than that of the native compiler for structures up to about 16 words in size and virtually equivalent for larger transfers.
Relating the performance of partial-order planning algorithms to domain features
Authors: Craig A. Knoblock, Qiang Yang
Venue: ACM SIGART Bulletin (1995)

The AI planning field has a long history of introducing yet another search algorithm that is believed to be the best in all domains. Some recent examples are NONLIN, TWEAK and SNLP. In this paper we show, by directly comparing the above three planners, that the quest for an overall winner is doomed to fail. We first argue that these three planners differ in a variety of ways, including methods for termination check, causal-link protection, and subgoal selection. These differences entail different search behaviors in terms of factors such as the branching factor, the search depth and the time spent by the algorithm on each search node. Furthermore, the search behavior is closely related to the characteristics of the problem domain in which a planner is operating. In this paper we identify one such domain feature, expressed as the ratio of the number of negative threats to the number of positive threats. We present an artificial domain where we can control this ratio and show that in fact the planners show radically different performance as the ratio is varied in this domain. The implication of this result for someone implementing a planning system is that the most appropriate algorithm will depend on the types of problems to be solved by the planner.
After Action Review System (AARS) design and functional capabilities
Authors: Joseph W. Gibson
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Logicon RDA has developed the Corps Battle Simulation After Action Review System (CBS AARS) to support the Battle Command Training Program (BCTP) requirement for training based on CBS-supported command post exercises (CPX). The CBS AARS is fielded and in use worldwide, and consists of the following subsystems: data collection, archive data storage, system and network management, analyst workstation, and presentation system. The analyst workstation is used to generate After Action Review (AAR) products. The presentation system includes advanced audio and video capabilities. It hosts the actual AAR presentation and provides advanced multimedia conferencing and display capabilities. The system also supports preparation of the Final Exercise Report (FER) and Professional Sustainment Packages (PSP). This paper describes the capabilities of the current system and the methodological issues related to its design and development. Emphasis is placed on identifying significant factors in the success of this development effort, and on clarifying problems overcome and lessons learned in the development process.
Supporting dynamic data structures on distributed-memory machines
Authors: Anne Rogers, Martin C. Carlisle, John H. Reppy, Laurie J. Hendren
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1995)

Compiling for distributed-memory machines has been a very active research area in recent years. Much of this work has concentrated on programs that use arrays as their primary data structures. To date, little work has been done to address the problem of supporting programs that use pointer-based dynamic data structures. The techniques developed for supporting SPMD execution of array-based programs rely on the fact that arrays are statically defined and directly addressable. Recursive data structures do not have these properties, so new techniques must be developed. In this article, we describe an execution model for supporting programs that use pointer-based dynamic data structures. This model uses a simple mechanism for migrating a thread of control based on the layout of heap-allocated data and introduces parallelism using a technique based on futures and lazy task creation. We intend to exploit this execution model using compiler analyses and automatic parallelization techniques. We have implemented a prototype system, which we call Olden, that runs on the Intel iPSC/860 and the Thinking Machines CM-5. We discuss our implementation and report on experiments with five benchmarks.
Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction
Authors: Kemal Oflazer
Venue: Computational Linguistics (1996)

This paper presents the notion of error-tolerant recognition with finite-state recognizers along with results from some applications. Error-tolerant recognition enables the recognition of strings that deviate mildly from any string in the regular set recognized by the underlying finite-state recognizer. Such recognition has applications to error-tolerant morphological processing, spelling correction, and approximate string matching in information retrieval. After a description of the concepts and algorithms involved, we give examples from two applications: in the context of morphological analysis, error-tolerant recognition allows misspelled input word forms to be corrected and morphologically analyzed concurrently. We present an application of this to error-tolerant analysis of the agglutinative morphology of Turkish words. The algorithm can be applied to morphological analysis of any language whose morphology has been fully captured by a single (and possibly very large) finite-state transducer, regardless of the word formation processes and morphographemic phenomena involved. In the context of spelling correction, error-tolerant recognition can be used to enumerate candidate correct forms from a given misspelled string within a certain edit distance. Error-tolerant recognition can be applied to spelling correction for any language, if (a) it has a word list comprising all inflected forms, or (b) its morphology has been fully described by a finite-state transducer. We present experimental results for spelling correction for a number of languages. These results indicate that such recognition works very efficiently for candidate generation in spelling correction for many European languages (English, Dutch, French, German, and Italian, among others) with very large word lists of root and inflected forms (some containing well over 200,000 forms), generating all candidate solutions within 10 to 45 milliseconds (with an edit distance of 1) on a SPARCStation 10/41. For spelling correction in Turkish, error-tolerant recognition operating with a (circular) recognizer of Turkish words (with about 29,000 states and 119,000 transitions) can generate all candidate words in less than 20 milliseconds, with an edit distance of 1.
The (un)revised OSI reference model
Authors: John Day
Venue: ACM SIGCOMM Computer Communication Review (1995)

In 1988, SC21, the ISO committee responsible for the Open Systems Interconnection (OSI) Reference Model, determined that it was time to undertake revising ISO 7498-1, The Basic OSI Reference Model. Since the model had been published in 1984, this was in accordance with ISO practice of reviewing and revising standards every five years, and there was good reason for considering the task. Over the intervening five years, the groups developing the OSI protocols had raised many questions about the architecture and these had been answered and documented in the Approved Commentaries [1994]. Many of these commentaries contained information that could be usefully incorporated into the Reference Model itself. In addition, the addendum describing connectionless mode, i.e. datagrams, had been completed several years before and needed to be incorporated. There was also considerable demand for interworking connection-mode and connectionless mode communication, something not supported by the Reference Model or any architecture. Also, when the original version of the Reference Model was frozen about 1983 some aspects of OSI such as the upper layers were not well understood and were only described in the most cursory manner. And while connection-mode and connectionless mode had been brought within OSI, there was no indication as to how broadcast and multicast were to be handled. Thus, the revision might be able to provide a more comprehensive description of these areas.This paper describes how the revision was carried out, describes the changes and additions that were made, considers the effect and contribution this revision has made to our understanding, and describes the outstanding issues that were not addressed by this revision.
Arithmetic Additive Generators of Pseudo-Exhaustive Test Patterns
Authors: Sanjay Gupta, Janusz Rajski, Jerry Tyszer
Venue: IEEE Transactions on Computers (1996)

Existing built-in self-test (BIST) strategies require the use of specialized test pattern generation hardware which introduces significant area overhead and performance degradation. In this paper, we propose an entirely new approach to generate test patterns. The method is based on adders widely available in data-path architectures used in digital signal processing circuits and general purpose processors. The resultant test patterns, generated by continuously accumulating a constant value, provide a complete state coverage on subspaces of contiguous bits. This new test generation scheme, along with the recently introduced accumulator-based compaction scheme [19] facilitates a BIST strategy for high performance datapath architectures that uses the functionality of existing hardware, is entirely integrated with the circuit under test, and results in at-speed testing with no performance degradation and no area overhead.
CCL: A Portable and Tunable Collective Communication Library for Scalable Parallel Computers
Authors: Vasanth Bala, Jehoshua Bruck, Robert Cypher, Pablo Elustando, Alex Ho, Ching-Tien Ho, Shlomo Kipnis, Marc Snir
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

A collective communication library for parallel computers includes frequently used operations such as broadcast, reduce, scatter, gather, concatenate, synchronize, and shift. Such a library provides users with a convenient programming interface, efficient communication operations, and the advantage of portability. A library of this nature, the Collective Communication Library (CCL), intended for the line of scalable parallel computer products by IBM, has been designed. CCL is part of the parallel application programming interface of the recently announced IBM 9076 Scalable POWERparallel System 1 (SP1). In this paper, we examine several issues related to the functionality, correctness, and performance of a portable collective communication library while focusing on three novel aspects in the design and implementation of CCL: 1) the introduction of process groups, 2) the definition of semantics that ensures correctness, and 3) the design of new and tunable algorithms based on a realistic point-to-point communication model.Index Terms¿Collective communication algorithms, collective communication semantics, message-passing parallel systems, portable library, process group, tunable algorithms.
On Evaluating and Optimizing Weights for Weighted Random Pattern Testing
Authors: Amitava Majumdar
Venue: IEEE Transactions on Computers (1996)

Two problems in weighted random pattern testing are considered: 1) evaluating a set of input weights in terms of the amount of time required to generate a set of test patterns and 2) determining the optimal weights for a given test set. An exact expression for expected test length is derived as a function of input weights. Upper and lower bounds for expected test length are presented. Percentage error of approximation is expressed in terms of the bounds. Based on these results, algorithms are given for approximating expected test length. These algorithms allow the user to tradeoff accuracy and computational complexity. Experiments with some test sets are presented to illustrate the accuracy of the approximation technique. Expected test length is shown to be a convex function of input weights. A simple hill-climbing algorithm is defined to find optimal weights for a given set of test patterns. When hardware constraints, limiting the number of weights to be realized for each input bit, are also specified, a simple modification of the algorithm suffices in yielding optimal weights in the constrained space. Experiments with several circuits yield of the order of 96% to 99% reduction in expected test length over that achieved by current techniques.
Static analysis techniques for predicting the behavior of active database rules
Authors: Alexander Aiken, Joseph M. Hellerstein, Jennifer Widom
Venue: ACM Transactions on Database Systems (TODS) (1995)

This article gives methods for statically analyzing sets of active database rules to determine if the rules are (1) guaranteed to terminate, (2) guaranteed to produce a unique final database state, and (3) guaranteed to produce a unique stream of observable actions. If the analysis determines that one of these properties is not guaranteed, it isolates the rules responsible for the problem and determines criteria that, if satisfied, guarantee the property. The analysis methods are presented in the context of the Starburst Rule System.
Building future medical education environments over ATM networks
Authors: James A. Schnepf, David H. C. Du, E. Russell Ritenour, Aaron J. Fahrmann
Venue: Communications of the ACM (1995)

The educational requirements of our society are changing. It is no longer sufficient to obtain an education at a single point in time and be done; rather, education must be a lifelong process to allow people, particularly those in technical diciplines, to keep up with their constantly changing fields. This is especially true with medical education, as exemplified by the continued training of radiology residents. It has been difficult to provide this training to physicians and other health care practitioners who are spread over a wide geographical area and who cannot travel away from their communities for lenghty training sessions. To meet the needs of this expanding base of students, it is necessary to go beyond the traditional campus setting and bring education to the students.
Astrophysical N-body simulations on GRAPE-4 special-purpose computer
Authors: Junichiro Makino, Makoto Taiji
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

We report on resent astrophysical N-body simulations performed on the GRAPE-4 (GRAvity PipE 4) system, a special-purpose computer for astrophysical N-body simulations. We first review the astrophysical motivation, the algorithm, the structure of the GRAPE system, and the actual performance. The GRAPE-4 system consists of 1692 pipeline processors. The peak speed of one pipeline processor is 523 Mflops and that of the total system is 884 Gflops. The performance obtained is 529 Gflops for the simulation of two massive black holes in the core of a galaxy with 700,000 stars.