ppxscal/embedding_network huggingface dataset:
Efficient evaluation of the area under the normal curve
Authors: G. Foster, J. Kraemer, W. Foote
Venue: ACM SIGAPL APL Quote Quad (1987)

The task of evaluating the cumulative distribution of a normally distributed random variable is considered. A brief introduction into this problem is given and several possible approximations are presented as APL functions. Many of these functions have been written in two versions. The first version is written in the original APL style. the companion function using an APL2 coding style is also included in the paper for purposes of comparison. Both versions have been tested using simple data vectors of varying lengths and run under APL on an IBM 3090 with and without a Vector Facility. The results are compared among the algorithms, between the coding styles, and with and without hardware support for vector processing.
Undergraduate theory of computation: an approach using simulation tools
Authors: Y. S. Chua, C. N. Winton
Venue: ACM SIGCSE Bulletin (1988)

Theory of computation courses have traditionally been taught at the advanced-undergraduate/graduate level, primarily due to the level of mathematical rigor associated with the topics involved. The topics covered include automata theory, formal languages, computability, uncomputability, and computational complexity. If the essentials of these topics are introduced earlier in the undergraduate computer science curriculum, students gain deeper insights and better comprehend the underlying computational issues associated with the material covered in subsequent computer science courses. Such a course is required of all computer science majors at the University of North Florida. Experience has demonstrated that a minimum background for the course includes Freshman-Sophomore mathematics (presently calculus) and a typical introduction to computer science. Thus the course is best positioned within the curriculum at the Junior level. Recognizing that Junior level students are rarely mathematically sophisticated, the treatment is not as rigorous as that of a more advanced course on the theory of computation. To reinforce the &ldquo;theory&rdquo; covered in class, an integral portion of the course is devoted to &ldquo;hands-on&rdquo; exercises using simulation tools designed for construction of a variety of automata. The exercises generally require the construction of automata of various forms, with observation of their step by step operation. Further exercises illustrate the connections between various automata and areas such as hardware design and compiler construction. The paper describes the course and the nature of the simulation tools used in the &ldquo;hands-on&rdquo; component of the course.
Problems and approaches for a Teraflop processor
Authors: A. H. Frey, G. C. Fox
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

This paper discusses problems associated with designing a processor capable of sustaining a teraflop (1012 floating point operations per second) of processing power. Several researcher have speculated on achieving this performance. The technical problems of a practical design are shown to be formidable. However, none of these problems requires a technology breakthrough for their solution. The predictable advances of the next generation of technology together with a major engineering effort is all that will be required to build such a parallel machine with usable teraflop processing power.
Goal-directed, dynamic animation of human walking
Authors: A. Bruderlin, T. W. Calvert
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

This paper presents a hybrid approach to the animation of human locomotion which combines goal-directed and dynamic motion control. Knowledge about a locomotion cycle is incorporated into a hierarchical control process. The desired locomotion is conveniently specified at the top level as a task (e.g. walk at speed v), which is then decomposed by application of the concepts of step symmetry and state-phase-timings. As a result of this decomposition, the forces and torques that drive the dynamic model of the legs are determined by numerical approximation techniques. Rather than relying on a general dynamic model, the equations of motion of the legs are tailored to locomotion and analytically constrained to allow for only a specific range of movements. The dynamics of the legs produce a generic, natural locomotion pattern which is visually upgraded by some kinematic "cosmetics" derived from such principles as virtual leg and determinants of gait. A system has been implemented based on these principles and has shown that when a few parameters, such as velocity, step length and step frequency are specified, a wide variety of human walks can be generated in almost real-time.
Polymorphic-Torus Architecture for Computer Vision
Authors: H. Li, M. Maresca
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A massively parallel fine-grained SIMD (single-instruction multi-data-stream) computer for machine vision computations is described. The architecture features a polymorphic-torus network which inserts an individually controllable switch into every node of the two-dimensional torus such that the network is dynamically reconfigurable to match the algorithm. Reconfiguration is accomplished by circuit switching and is achieved at fine-grained level. Using both the processor coordinate in the torus and the data for reconfiguration, the polymorphic-torus achieves solution time that is superior or equivalent to that of popular vision architectures such as mesh, tree, pyramid and hypercube for many vision algorithms discussed. Implementation of the architecture is given to illustrate its VLSI efficiency.
Conception, evolution, and application of functional programming languages
Authors: Paul Hudak
Venue: ACM Computing Surveys (CSUR) (1989)

The foundations of functional programming languages are examined from both historical and technical perspectives. Their evolution is traced through several critical periods: early work on lambda calculus and combinatory calculus, Lisp, Iswim, FP, ML, and modern functional languages such as Miranda1 and Haskell. The fundamental premises on which the functional programming methodology stands are critically analyzed with respect to philosophical, theoretical, and pragmatic concerns. Particular attention is paid to the main features that characterize modern functional languages: higher-order functions, lazy evaluation, equations and pattern matching, strong static typing and type inference, and data abstraction. In addition, current research areas&mdash;such as parallelism, nondeterminism, input/output, and state-oriented computations&mdash;are examined with the goal of predicting the future development and application of functional languages.
YSM: a full-screen manager for Dyalog APL
Authors: S. D. Curtin, J. Scholes
Venue: Conference proceedings on APL as a tool of thought (1989)

Dyalog APL Version 5.2 introduces an elegant approach to Full-Screen Management. Using a new system variable #9633;SM --- Screen Map and function #9633;SR --- Screen Read, the screen may be controlled in a way which is natural for APL. This paper describes the screen manager, with a variety of examples
Video as an enabling technology for computer-supported cooperative work
Authors: M. Horton, M. Elwart-Keys, R. Kass
Venue: ACM SIGCHI Bulletin (1989)

Research at the Center for Machine Intelligence (CMI) focuses on computer-based methods for supporting cooperative work between members of large organizations. To this end, we are exploring how video technology can be used as a multi-purpose tool, not only to study the collaborative work that occurs in our electronic meeting room, the Capture Lab, but also to support the activities of the room's users. We first briefly describe the Capture Lab and the facilities available for recording activities that occur in the room. We then discuss how these facilities can be used to create an "audit trail" for crucial decisions made in meetings. The next section describes ways to use videotape in conjunction with a tool for coding interpersonal behavior to provide a group with feedback about its interaction. Finally, we illustrate how video is a critical tool in assessing the effectiveness and impact of new technologies, such as the Capture Lab, for group work.
A butterfly subdivision scheme for surface interpolation with tension control
Authors: Nira Dyn, David Levine, John A. Gregory
Venue: ACM Transactions on Graphics (TOG) (1990)

A new interpolatory subdivision scheme for surface design is presented. The new scheme is designed for a general triangulation of control points and has a tension parameter that provides design flexibility. The resulting limit surface is C1 for a specified range of the tension parameter, with a few exceptions. Application of the butterfly scheme and the role of the tension parameter are demonstrated by several examples.
Types for databases: the Galileo experience
Authors: Antonio Albano, Giorgio Ghelli, Renzo Orsini
Venue: Proceedings of the second international workshop on Database programming languages (1989)

Object-oriented databases are receiving wide attention these days to overcome the limitations of commercial DBMS. The object-oriented approach to the design of database languages is a very promising one to improve the application development process. These improvements come from the natural modeling capability, data abstraction, and inheritance mechanism provided by the object paradigm. The language Galileo [Albano 85] is a step towards this direction, and in this paper the critical aspects of its type system are discussed, using a recently proposed framework for comparing type systems for database programming languages.
On domain independent disjunctive databases
Authors: E. A. Sonenberg, R. W. Topor
Venue: Lecture notes in computer science on ICDT '88 (1988)

We extend the concept of domain independence from queries and databases to disjunctive databases. Informally, a domain independent disjunctive database is one for which the set of correct answers to any domain independent query is independent of the domains of variables in the database statements. We prove that every allowed stratified disjunctive database is domain independent and that every domain independent disjunctive database has an equivalent allowed disjunctive database. We also discuss a generalization and properties of two alternative definitions.
The Principles of Large-Scale Computing Machines
Authors: John von Neumann
Venue: IEEE Annals of the History of Computing (1988)

The following paper was one of many seminal works on computing prepared by John von Neumann.
Musical syntactic and semantic structures in APL2
Authors: Erik S. Friis, Stanley Jordan
Venue: ACM SIGAPL APL Quote Quad (1990)

APL2 provides an excellent platform for implementing both syntactic and semantic representations of music, and for effecting transformations between the two. We use general arrays to represent syntactic information in the form of Musical Instrument Digital Interface (MIDI) data streams and illustrate a semantic structure by defining a diatonic scale. Chords are created within that scale using the &ldquo;each&rdquo; operator to facilitate this development. Finally, we make a few observations regarding relationships and transformations between these representations.
An O(n0.4)-approximation algorithm for 3-coloring
Authors: A. Blum
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

This paper presents a polynomial-time algorithm to color any 3-colorable n-node graph with O(n2/5 log8/5 n) colors, improving the best previously known bound of O(&radic;n/&radic;logn) colors. By reducing the number of colors needed to color a 3-colorable graph, the algorithm also improves the bound for k-coloring for fixed k &ge; 3 from the previous O((n/log n)1-1/(k-1)) colors to O(n1-1/(k-4/3) log8/5 n) colors. An extension of the algorithm further improves the bounds. Precise values appear in a table at the end of this paper.
A simple solution to Lamport's concurrent programming problem with linear wait
Authors: B. K. Szymanski
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

A new simple solution to the Lamport's concurrent programming problem is presented. The algorithm uses five distinct values of shared memory per process. The shared values can be stored either in a single variable or in three one-bit Boolean variables assigned to each process. The algorithm exhibits strong fairness property by enforcing the linear wait. It can be made immune to two types of errors typical to VLSI chip based multiprocessor systems: process failures and restarts, and read errors occurring during writes. The algorithm requires a small number of writes to shared memory. At most 4xp- &lceil;p/n&rceil; writes are needed for p entries to critical section by n competing processes. The algorithm's scheme is similar to that of Morris's solution to the mutual exclusion based on three weak semaphores.
Graphics and managerial decision making: research-based guidelines
Authors: S. L. Jarvenpaa, G. W. Dickson
Venue: Communications of the ACM (1988)

Graphical charts are generally thought to be a superior reporting technique compared to more traditional tabular representations in organizational decision making. The experimental literature, however, demonstrates only partial support for this hypothesis. To identify the characteristics of the situations that have been shown to benefit from the use of graphics, existing studies are reviewed in terms of the type of task used, the format employed, and the user experience. The examination of the literature reveals a set of empirically based&mdash;though preliminary&mdash;guidelines as to when and how to use business graphics.
Design of Testable VLSI Circuits with Minimum Area Overhead
Authors: P. R. Chalasani, S. Bhawmik, A. Acharya, P. Palchaudhuri
Venue: IEEE Transactions on Computers (1989)

One of the techniques used to tackle the increasing complexity of testing VLSI circuits is to incorporate built-in self-test (BIST) structures. However, incorporation of such BIST structures calls for increased area overhead due to additional logic gates and interconnections. It is very important to keep this area overhead to a minimum. The authors present a simple graph model of the area overhead minimization problem, for circuits into which BIST modifications are to be incorporated. Although the graph model does not account for a mixed type of BIST structure usage, it can be extended to include them at the cost of increased complexity.
Performance, preference, and visual scan patterns on a menu-based system: implications for interface design
Authors: J. J. Hendrickson
Venue: ACM SIGCHI Bulletin (1989)

This study was conducted to provide evidence for the nature of visual search processes with menus, and to derive design principles for menu-based natural language (MBNL) interfaces to databases. The effects of window size, window activity, and query length were investigated. It was found that longer queries were performed faster with single active windows, but multiple active windows were rated as more 'natural'. Query times increased with query length, as did eye fixation frequencies, fixation durations, and dwell times. Errors were most likely to occur on the longest query. Fixation durations also varied with window size. However, visual behavior depended on the area being viewed and on the interaction between window activity and query length. In contrast with previous studies, it was also found that menus were not scanned randomly. However, scanpaths were less deterministic with multiple active windows and became even more unconstrained as query length increased. User interface design recommendations were derived from the findings.
Diversity in database reference behavior
Authors: J. P. Kearns, S. DeFazio
Venue: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (1989)

Over the past fifteen years, empirical studies of the reference behavior of a number of database systems have produced seemingly contradictory results. The presence or absence of locality of reference and sequentiality have both been reported (or denied) in various papers. As such, the performance analyst or database implementor is left with little concrete guidance in the form of expected reference behavior of a database system under a realistic workload. We present empirical evidence that all of the previous results about database reference behavior are correct (or incorrect). That is, if the database reference sequence is viewed on a per-transaction instance or per-database basis, almost any reference behavior is discernible. Previous results which report the absolute absence or presence of a certain form of reference behavior were almost certainly derived from reference traces which were dominated by transactions or databases which exhibited a certain behavior. Our sample consists of roughly twenty-five million block references, from 350,000 transaction executions, directed at 175 operational on-line databases at two major corporations. As such, the sample is an order of magnitude more comprehensive than any other reported in the literature. We also present evidence that reference behavior is predictable and exploitable when viewed on a per-transaction basis or per-database basis. The implications of this predictability for effective buffer management are discussed.
Retrieval systems for the information seeker: can the role of the intermediary be automated?
Authors: C. L. Borgman, N. J. Belkin, W. B. Croft, M. E. Lesk, T. K. Landauer
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

The introduction of automated information retrieval (IR) systems was met with great enthusiasm and predictions that manual literature searching soon would be replaced. Three decades later, IR systems have not progressed to the stage where any but the dedicated few can operate them without a highly skilled human intermediary acting as interface between user and system. In the interim, we have learned that the retrieval process is extremely complex both in terms of understanding people and their communication and in terms of understanding scientific information and technical vocabulary. Experiments with new techniques suggest to many the possibility of eliminating the human intermediary, either in large part or altogether; others would argue that the retrieval problems are too complex to be resolved for more than highly restricted domains. The possibility of eliminating the human intermediary is of current research interest to the several disciplines that are represented on this panel. The discussion will revolve around one central question: Is our inability to get end-users to search primarily a problem of understanding people and their communication, or is it primarily a problem of understanding scientific information and technical vocabulary? Among the constituent issues the panel will address are these: Which are the most fundamental problems in constructing retrieval interfaces for the information seeker? How successful have been the attempts to build end-user oriented interfaces? Is a single, elegant solution to the problems of language handling, query negotiation, user modeling, and information retrieval possible? What techniques hold the most promise for automating the functions of the intermediary? What approaches are likely to be fruitless? Under what conditions is it possible and appropriate to automate some or all of the intermediary's skills and function?
Sizing assignments: a contribution from software engineering to computer science education
Authors: David F. Haas, Leslie J. Waguespack,  Jr.
Venue: Proceedings of the twentieth SIGCSE technical symposium on Computer science education (1989)

A method of predicting the sizes of programs from a measure of problem size is shown, and research testing the effectiveness of the method is reported. A regression model for predicting average program size as measured by mean_LOC is shown to perform well for a sample of Pascal assignments of moderate size written by students in programming classes.
Reasoning About Time in Higher-Level Language Software
Authors: A. C. Shaw
Venue: IEEE Transactions on Software Engineering (1989)

A methodology for specifying and providing assertions about time in higher-level-language programs is described. The approach develops three ideas: the distinction between, and treatment of, both real-time and computer times; the use of upper and lower bounds on the execution times of program elements; and a simple extension of Hoare logic to include the effects of the passage of real-time. Schemas and examples of timing bounds and assertions are presented for a variety of statement types and programs, such as conventional sequential programs including loops, time-related statements such as delay, concurrent programs with synchronization, and software in the presence of interrupts. Examples of assertions that are proved include deadlines, timing invariants for periodic processes, and the specification of time-based events such as those needed for the recognition of single and double clicks from a mouse button.
Conceptual representation for knowledge bases and << intelligent >> information retrieval systems
Authors: G. P. Zarri
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

This paper describes the &ldquo;conceptual&rdquo; Knowledge Representation Language (KRL) proper to an environment for the construction and use of large Knowledge Bases and/or &ldquo;Intelligent&rdquo; Information Retrieval Systems. In the KRL, we separate the treatment of the episodic memory (extensional, assertional data = &ldquo;Snoopy is Charlie Brown's beagle&rdquo;) from the treatment of the semantic memory (intensional, terminological data = A beagle is a sort of hound / a hound is a dog &hellip;). A compromise between an &ldquo;object-oriented approach&rdquo; and a &ldquo;logic-oriented approach&rdquo; is proposed for implementation purposes.
Remark on algorithm 587
Authors: V. Dadurkevicius
Venue: ACM Transactions on Mathematical Software (TOMS) (1989)

The subroutine WNNLS of Algorithm 587 has exposed some shortcomings, especially in solving rank-deficient problems. They may lead to fatal errors and (or) false results. Five improvements are proposed. The effect of the changes is tested on four rank-deficient test problems. It is emphasized that the WNNLS still remains vulnerable to bad scaling of the problem.
Dynamic bandwidth allocation in a network
Authors: K. Maly, C. Overstreet, X. Qiu, D. Tang
Venue: Symposium proceedings on Communications architectures and protocols (1988)

Recently protocols have been introduced which enable us to integrate periodic traffic (voice or video) and aperiodic traffic (data) and to extend the size of local area networks without any loss in speed and capacity. One of these, the DRAMA protocol, is based on broadband technology and allows for dynamic allocation of bandwidth to clusters of nodes in the total network. In this paper we propose a distributed algorithm to allocate bandwidth in a fair manner, where we have defined fair to mean that every node in the network, regardless of its location, should have the same expected access delay to the net. We show by means of simulation that the algorithm is stable and within a few percentage points of the optimal solution. Stability is measured in terms of the time it takes the system to return to near optimal distribution of the bandwidth after strong disturbances. The algorithm is shown to handle total reallocation of the resources within O(100ms).