ppxscal/embedding_network huggingface dataset:
The use of multiple-subscripted arrays in benchmark programs
Authors: Jozo J. Dujmovic
Venue: ACM SIGMETRICS Performance Evaluation Review (1992)

In this paper we study the effects of using multiple-subscripted arrays in benchmark programs. We identify and exemplify typical problems caused by multiple-subscripted arrays and show why their usage in benchmarking should be strictly controlled and frequently restricted. Multiple-subscripted arrays can be considered harmful in the case of general purpose processor-bound benchmarks. On the other hand, the multiple-subscripted arrays are shown to be suitable for measuring the optimizing features of compilers, especially for RISC machines.
Pointer swizzling at page fault time: efficiently supporting huge address spaces on standard hardware
Authors: Paul R. Wilson
Venue: ACM SIGARCH Computer Architecture News (1991)

We describe a scheme for supporting huge address spaces without the need for long addresses implemented in hardware. Pointers are translated ("swizzled") from a long format to a shorter format (directly supported by normal hardware) at page fault time. No extra hardware is required beyond that normally used by virtual memory systems, and no continual software cost is incurred by presence checks or indirection of pointers.This scheme could be used to fault pages into a normal memory from a persistent store, or simply to avoid extra hardware requirements when supporting large address spaces. It exploits temporal and spatial locality in much the same way as a normal virtual memory, so its performance should be quite good.
The automated production control documentation system: a case study in cleanroom software engineering
Authors: Carmen J. Trammell, Leon H. Binder, Cathrine E. Snyder
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1992)

A prototype software system was developed for the U.S. Naval Underwater Systems Center(NUSC) as a demonstration of the Cleanroom Software Engineering methodology. The Cleanroom method is a team approach to the incremental development of software under statistical quality control. Cleanroom's formal methods of Box Structure specification and design, functional verification, and statistical testing were used by a four-person team to develop the Automated Production Control Documentation(APCODOC) system, a relational database application. As is typical in Cleanroom developments, correctness of design and code were ensured through team reviews. Eighteen errors were found during functional verification of the design, and nineteen errors were found during walkthrough of the 1820 lines of FOXBASE code. The software was not executed by developers prior to independent testing (i.e., there was no debugging). There were no errors in compilation, no failures during statistical certification testing, and the software was certified at the target levels of reliability and confidence. Team members attribute the ultimate error-free compilation and failure-free execution of the software to the rigor of the methodology and the intellectual control afforded by the team approach.
Out-of-Roundness Problem Revisited
Authors: Van-Ban Le, D. T. Lee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The properties and computation of the minimum radial separation (MRS) standard for out-of-roundness are discussed. Another standard out-of-roundness measurement called the minimum area difference (MAD) center is introduced. Although the two centers have different characteristics, the approach to finding both centers shares many commonalities. An O(n log n+k) time algorithm which is used to compute the MRS center is presented. It also computes the MAD center of a simple polygon G, where n is the number of vertices of G, and k is the number of intersection points of the medial axis and the farthest-neighbor Voronoi diagram of G. The relationship between MRS and MAD is discussed.
A noise model on learning sets of strings
Authors: Yasubumi Sakakibara, Rani Siromoney
Venue: Proceedings of the fifth annual workshop on Computational learning theory (1992)

In this paper, we introduce a new noise model on learning sets of strings in the framework of PAC learning and consider the effect of the noise on learning. The instance domain is the set &Sgr;n of strings over a finite alphabet &Sgr;, and the examples are corrupted by purely random errors affecting only the instances (and not the labels). We consider three types of errors on instances, called EDIT operation errors. EDIT operations consist of &ldquo;insertion&rdquo;, &ldquo;deletion&rdquo;, and &ldquo;change&rdquo; of a symbol in a string. We call such a noise where the examples are corrupted by random errors of EDIT operations on instances the EDIT noise. First we show general upper bounds on the EDIT noise rate that a learning algorithm of taking the strategy of minimizing disagreements can tolerate and a learning algorithm can tolerate. Next we present an efficient algorithm that can learn a class of decision lists over the attributes &ldquo;a string w contains a pattern p?&rdquo; from noisy examples under some restriction on the EDIT noise rate.
Beyond class A: a proposal for automatic evaluation of discourse
Authors: Lynette Hirschman, Deborah A. Dahl, Donald P. McKay, Lewis M. Norton, Marcia C. Linebarger
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

The DARPA Spoken Language community has just completed the first trial evaluation of spontaneous query/response pairs in the Air Travel (ATIS) domain.<sup>1</sup> Our goal has been to find a methodology for evaluating correct responses to user queries. To this end, we agreed, for the first trial evaluation, to constrain the problem in several ways:Database Application: Constrain the application to a database query application, to ease the burden of a) constructing the back-end, and b) determining correct responses;
Knowledge-based systems for idea processing support
Authors: Lawrence F. Young
Venue: ACM SIGMIS Database (1991)

Knowledge-based systems methods have been seen as means of enhancing the nature of support provided by Decision Support Systems. This paper examines how they can be similarly used to provide user guidance and to represent forms of knowledge that are relevant to the newer type of qualitative support systems called Idea Processing. Basic concepts of Idea Processing and Knowledge-based systems are summarized. The paper identifies several modes of knowledge representation appropriate for particular functions of Idea Processing.
A strategy for synchronising simplex message streams
Authors: J. M. McCaig
Venue: ACM SIGCOMM Computer Communication Review (1991)

In information networks which, for example, employ satellites or LANs with broadcast or multi-cast capability, data flow is often simplex. Various quality of service improvements are possible by using redundant network capacity, which is intended for "fail-over", to carry duplicate message streams instead. This paper examines a strategy for synchronising message streams delivered via diverse but unreliable routes, and illustrates it with a Pascal procedure called Y.
Mathematical model of the probe volume in an optical particle sizing device
Authors: Shadrokh Samavi, James D. Gassaway
Venue: ACM SIGSIM Simulation Digest (1992)

This paper presents a new approach in numerical simulation and mathematical modeling of the sample volume in an optical particle-sizing instrument (MSU-PSI) [1]. This in done for when the device is operating in Small Angle Near Forward Scattering (SANFS) mode. The instrument is designed to perform on-line measurement of the particle-size distributions by means of non-intrusive methods. This is achieved by measuring the size of individual particles in a sample volume. The sample volume in the SANFS mode is formed by focusing a single laser beam. The size of a particle is determined by the amount of light that it scatters, when inside the sample volume. This scattered light is captured and processed electronically and eventually is converted to a histogram which, when interpreted, will be a representation of the particle-size distribution.
A Novel Algorithm for Discrete-Event Simulation: Asynchronous Distributed Discrete-Event Simulation Algorithm for Cyclic Circuits Using a Dataflow Network
Authors: Erik DeBenedictis, Sumit Ghosh, Meng-Lin Yu
Venue: Computer (1991)

Distributed simulation of circuits in which the process interactions form a cyclic graph is addressed. The method described uses a dataflow network synthesized on the basis of the connectivity of the circuit components. The algorithm, called Yaddes (which stands for yet another asynchronous distributed discrete-event simulation algorithm), computes for each component a quantity time of next event, which permits the corresponding model to execute asynchronously as far ahead in simulation time as possible. The network ensures that a simulation process executing in a distributed processing environment will not deadlock. The algorithm, which also offers acceptable performance and provable correctness, is compared with the two other principal algorithms proposed to avoid deadlocks: the deadlock recovery algorithm and the exception-mode algorithm. Performance results for Yaddes are presented.
Performance improvement for vector pipeline multiprocessor systems using a disordered execution model(abstract)
Authors: M. Tahar Kechadi, J-L. Dekeyser, Ph. Marquet, Ph. Preux
Venue: Proceedings of the 19th annual international symposium on Computer architecture (1992)

Memory contention may cause dramatic loss of performance in vector pipeline multiprocessor systems. To enhance memory performance, the disordered execution model aims at scheduling vector element accesses in order to avoid memory conflicts. This scheduling relies on memory bank activities at access issue time. A disordered pipeline execution is associated with disordered memory access in order to maintain the chaining of all processor functional units. An analytical model and simulations demonstrate the interest of this model.
A TCP/IP network facsimile system built from publicly available software
Authors: Chane Fullmer, Brent Auernheimer, William L. Morris,  III
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

A network desktop facsimile system was developed from inexpensive hardware and publicly available software. This system allows users on a TCP/IP network to develop documents and have them FAXed without printing out the document and using a manual FAX machine. The desktop facsimile system also receives FAXes. Schemes for electronic routing of incoming FAXes are outlined. The system is written in C and uses TCP/IP network protocols. Existing standards, system development and integration of publicly available software are discussed.
SIQUEUE-PET: an environment for queueing network modelling
Authors: Hartmut Deike-Glindemann
Venue: ACM SIGMETRICS Performance Evaluation Review (1992)

Developing models for performance evaluation of computer systems, logistic systems etc. often is a complex task. The effort can be considerably reduced if appropriate software tools are available. In many cases queueing network models are suitable for solving the problem to a sufficient degree of accuracy. SIQUEUE-PET provides an environment for construction, evaluation and result representation of such models. The user is assisted through a graphical interface for model construction as well as for result representation. The availability of a support for object management provides further alleviation in the modelling activities. This contribution gives a brief overview of the main features of SIQUEUE-PET. From the viewpoint of modelling style, the availability of aggregation techniques and the capability of processing hierarchically structured models is to be emphasized. An example is included for illustrative purposes.
NASFLOW, a simulation tool for silicon technology development
Authors: D. David Forsythe, Atul P. Agarwal, Chune-Sin Yeh, Sheldon Aronowitz, Bhaskar Gadepally
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

A simulation system is described for linking two-dimensional simulators for process and device to a parameter extraction program, for the purpose of generating artificial parameters for the circuit analysis program, NASPICE. A key feature of the system is that it operates under the control of a shell program which offers a simple and easy to use interface to the user. Results of an initial development using the program sequence SUPRA = > PISCES = > CADPET = > NASPICE are described. Good correlation was obtained between system generated drain characteristics and silicon for both N and P-channel MOS transistors, and similarly for CMOS DC transfer characteristics.
Dynascope: a tool for program directing
Authors: Rok Sosič
Venue: ACM SIGPLAN Notices (1992)

This paper introduces program directing, a new way of program interaction. Directing enables one program, the director, to monitor and to control another program, the executor. One important application of program directing is human interaction with complex computer simulations. The Dynascope programming environment is designed specifically to support directing in traditional, compiled languages. It provides a framework and building blocks for easy construction of sophisticated directors. Directors are regular programs that perform the directing of executors through Dynascope primitives. Dynascope is built around the concept of the execution stream which provides a complete description of the executor's computational behavior. The source code of executors requires no changes in order to be subjected to directing. This paper gives an overview of the Dynascope system. Sample applications are presented: debugging register allocation, animation of procedure calls, and a complex artificial life simulation. The performance of Dynascope is illustrated by real time measurements.
A new, fast method for 2D polygon clipping: analysis and software implementation
Authors: Patrick-Gilles Maillot
Venue: ACM Transactions on Graphics (TOG) (1992)

This paper presents a new 2D polygon clipping method, based on an extension to the Sutherland-Cohen 2D line clipping method. After discussing three basic polygon clipping algorithms, a different approach is proposed, explaining the principles of a new algorithm and presenting it step by step. An example implementation of the algorithm is given along with some results. A comparison between the proposed method, the Liang and Barsky algorithm, and the Sutherland-Hodgman algorithm is also given, showing performances up to eight times the speed of the Sutherland-Hodgman algorithm, and up to three times the Liang and Barsky algorithm. The algorithm proposed here can use floating point or integer operations; this can be useful for fast or simple implementations.
Type matching, type-graphs, and the Schanuel conjecture
Authors: Jacob Katzenelson, Shlomit S. Pinter, Eugen Schenfeld
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1992)

This work considers type systems that are defined by type-graphs (tgraphs), which are rooted directed graphs with order among the edges leaving each node. Tgraphs are uniquely mapped into polynomials which, in turn, are each evaluated at a special point to yield an irrational number named the tgraph's magic number. This special point is chosen using the Schanuel conjecture. It is shown that each tgraph can be uniquely represented by this magic number; namely, types are equal if and only if the corresponding magic numbers are equal. Since irrational numbers require infinite precision, the algorithm for generating magic numbers is carried out using a double-precision floating-point approximation. This approximation is viewed as a hashing scheme, mapping the infinite domain of the irrational numbers into finite computer words. The proposed hashing scheme was investigated experimentally, with the conclusion that it is a good and practical hashing method. In tests involving over a million randomly chosen tgraphs, we have not encountered a single collision. We conclude that this method for representation and management of types is practical, and offers novel possibilities for enforcing strict type matching at link time among separately compiled modules.
A comparison of speech and typed input
Authors: Alexander G. Hauptmann, Alexander I. Rudnicky
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Meaningful evaluation of spoken language interfaces must be based on detailed comparisons with an alternate, well-understood input modality, such as the keyboard. This paper presents an empirical study in which users were asked to enter digit strings into the computer by voice and by keyboard. Two different ways of verifying and correcting the spoken input were also examined using either voice or keyboard. Timing analyses were performed to determine which aspects of the interface were critical to speedy completion of the task. The results show that speech is preferable for strings that require more than a few keystrokes. The results emphasize the need for fast and accurate speech recognition, but also demonstrate how error correction and input validation are crucial components of a speech interface.
Marks on Paper: Part 2. A Historical Survey of Computer Output Printing
Authors: Irving L. Wieselman, Erwin Tomash
Venue: IEEE Annals of the History of Computing (1991)

The evolution in history of computing printing technology in the United States is covered from the end of World War II to recent times (1946-1987). The wide variety of printer products introduced over the forty-year period is surveyed and their differentiating characteristics described. The relationship of computer technology to printer technology is discussed, as is the relationship of the computer industry to the printer industry.
Automatic phonetic baseform determination
Authors: L. R. Bahl, S. Das, P. V. deSouza, M. Epstein, R. L. Mercer, B. Merialdo, D. Nahamoo, M. A. Picheny, J. Powell
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Phonetic baseforms are the basic recognition units in most large vocabulary speech recognition systems. These base-forms are usually determined by hand once a vocabulary is chosen and not modified thereafter. However, many applications of speech recognition, such as dictation transcription, are hampered by a fixed vocabulary and require the user be able to add new words to the vocabulary. At least one phonetic baseform must be assigned to each new word to properly integrate the word into the recognition system. Dictionary lookup is often unsuccessful in determining a phonetic baseform because new words are often names or task-specific jargon; also, talkers tend to have idiosyncratic pronunciations for a substantial fraction of words. This paper describes a series of experiments in which the phonetic baseform is deduced automatically for new words by utilizing actual utterances of the new word in conjunction with a set of automatically derived spelling-to-sound rules. We evaluated recognition performance on new words spoken by two different talkers when the phonetic baseforms were extracted via the above approach. The error rates on these new words were found to be comparable to or better than when the phonetic baseforms were derived by hand, thus validating the basic approach.
A Single-Chip Multiprocessor for Multimedia: the MVP
Authors: Karl Guttag, Robert J. Gove, Jerry R. Van Aken
Venue: IEEE Computer Graphics and Applications (1992)

The multimedia video processor (MVP) architecture, which incorporates a variety of parallel processing techniques to deliver very high performance to a wide range of imaging and graphics applications, is described. The MVP combines, on a single semiconductor chip, multiple fully programmable processors with multiple data streams connected to shared RAMs through a crossbar network. Each of the independent processors can execute many operations in parallel every cycle. The architecture is scalable and supports different numbers of processors to meet the cost and performance requirements of different markets. MVP's target environment and the development of MVP are outlined.
Measurements of the paging behavior of UNIX
Authors: Arvin Park, Jeffrey C. Becker
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

This paper analyzes measurements of paging activity from several different versions of UNIX. We set out to characterize paging activity by first taking measurements of it, and then writing programs to analyze it. In doing so, we were interested in answering several questions:1. What is the magnitude of paging traffic and how much of I/O system activity is paging related?2. What are the characteristics of paging activity, and how can paging system implementations be tuned to match them?3. How does paging activity vary across different machines, operating systems, and job mixes?4. How well does paging activity correlate with system load average and number of users?
Academic experiences in software project management
Authors: T. C. Nute, J. R. Rienwalt, D. J. Rodjak, William H. Golaz, J. R. Comer
Venue: ACM SIGCSE Bulletin (1990)

This paper discusses the implementation project undertaken in 1988--1989 as part of Texas Christian University's graduate program in Software Design and Development. The report summarizes the intent, schedule, man-loading, design methodologies, and development tools used during the course of the project. Included is a discussion of the project's failures and successes. The paper concludes with a discussion of the lessons that may be learned from such projects in planning future efforts of this kind.
Early Experience with the Visual Programmer's WorkBench
Authors: Robert V. Rubin, James Walker,  II, Eric J. Golin
Venue: IEEE Transactions on Software Engineering (1990)

The Visual Programmer's WorkBench (VPW) addresses the rapid synthesis and customization of environments for the specification, analysis, and execution of visual programs. The goal of VPW is to enable the easy creation of environments for visual languages. The design of VPW and experience using it to generate a distributed programming environment for a concurrent visual language are described. A visual programming environment for the PetriFSA language generated with VPW is outlined. An overview is provided of the language definition model and its relation to the logical architecture of VPW. Details are given of the language specifications used in VPW, and its application in defining the PetriFSA language. A language-based environment for a specific visual language is generated in VPW from a specification of the syntactic structure, the abstract structure, the static semantics, and the dynamic semantics of the language. VPW is built around a model of distributed processing based on a shared distributed memory. This framework is used in defining the architecture of the environment and for the execution model of visual languages.
Incremental generation of lexical scanners
Authors: J. Heering, P. Klint, J. Rekers
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1992)

It is common practice to specify textual patterns by means of a set of regular expressions and to transform this set into a finite automaton to be used for the scanning of input strings. In many applications, the cost of this preprocessing phase can be amortized over many uses of the constructed automaton. In this paper new techniques for lazy and incremental scanner generation are presented. The lazy technique postpones the construction of parts of the automaton until they are really needed during the scanning of input. The incremental technique allows modifications to the original set of regular expressions to be made and reuses major parts of the previous automaton. This is interesting in applications such as environments for the interactive development of language definitions in which modifications to the definition of lexical syntax and the uses of the generated scanners alternate frequently.