ppxscal/embedding_network huggingface dataset:
Parallel algorithms for algebraic problems
Authors: Joachim von zur Gathen
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

In Borodin-von zur Gathen-Hopcroft[82] the following program is laid out: obtain a &ldquo;theory package for parallel algebraic computations&rdquo;, i.e. fast parallel computations for the widely used problems of symbolic manipulation in an algebraic context. In that paper, two basic problems were considered: solving systems of linear equations and computing the gcd of two polynomials, both over arbitrary ground fields. The present paper continues this program, and fast parallel solutions to the following algebraic problems are given: computing all entries of the Extended Euclidean Scheme of two polynomials over an arbitrary field, gcd and lcm of many polynomials, factoring polynomials over finite fields, and the squarefree decomposition of polynomials over fields of characteristic zero and over finite fields.
A pipelined pseudoparallel system architecture for motion analysis
Authors: Dharma P. Agrawal
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Parallel processing has mostly been applied to well-defined and a priori partitioned problems, and not much has been done to introduce parallelism into serial algorithms. This paper introduces a new concept of pseudoparallelism in which the serial algorithm is partitioned into several noninteractive independent subtasks so that parallelism can be used within each subtask level. This novel approach is illustrated by taking motion analysis as an example. Complete details of such a pseudoparallel architecture with a distributed operating system (no master control) have been worked out. Problems encountered in the course of designing such a system are outlined, and necessary justifications provided. A detailed scheme indicating various memory modules, processing elements, and their data-path requirements is included, and ways to provide continuous flow of partitioned information in the form of a synchronized pipeline are described. Finally, the performance of the proposed scheme is evaluated. The basic strategy appears to be useful in designing such parallel systems for other unexplored complex problems.
STAR: Simulation of Tactical Alternative Responses
Authors: Samuel H. Parry
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper describes the development and initial results of a mid-resolution combined arms model to determine both hardware and training measures of effectiveness. One of the primary goals of the model is to achieve an acceptable level of resolution while assuring that the model inputs and interactions are understood by the military decision maker. The structure of the model is truly hierarchical in that it is not confined to any specific unit size configuration. The parent-child set structure of SIMSCRIPT, coupled with the flexible parametric terrain model, provides the required capabilities to realize a hierarchical representation. The level of resolution is prescribed by the combat function being represented and not by inherent model structure limitations. For example, if the study is to evaluate the contribution of mobility/agility to survivability, resolution to the element level is obviously required, possibly in a battalion-level context. On the other hand, if the study is to evaluate the impact of digital communications between higher headquarters, it may suffice to play a company or battalion as the basic element on a much larger battlefield. The results of battalion-level engagements in the larger context could be evaluated by use of the lower hierarchical module.
Models of memory scheduling
Authors: A. K. Agrawala, R. M. Bryant
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

Queueing theoretic models of single and multi-processor computer systems have received wide attention in the computer science literature. Few of these models consider the effect of finite memory size of a machine and its impact on the memory scheduling problem. In an effort to formulate an analytical model for memory scheduling we propose four simple models and examine their characteristics using simulation. In this paper, we discuss some interesting results of these simulations.
Logics for probabilistic programming (Extended Abstract)
Authors: John H. Reif
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

This paper introduces a logic for probabilistic programming+ PROB-DL (for probabilistic dynamic logic; see Section 2 for a formal definition). This logic has &ldquo;dynamic&rdquo; modal operators in which programs appear, as in Pratt's [1976] dynamic logic DL. However the programs of PROB-DL contain constructs for probabilistic branching and looping whereas DL is restricted to nondeterministic programs. The formula {a}&sgr;p of PROB-DL denotes &ldquo;with measure &ge;&sgr;, formula p holds after executing program a.&rdquo; In Section 3, we show that PROB-DL has a complete and consistent axiomatization, (using techniques derived from Parikh's [1978] completeness proof for the propositional dynamic logic). Section 4 presents a probabilistic quantified boolean logic (PROB-QBF) which also has applications to probabilistic programming.
Constraining-unification and the programming language unicorn
Authors: Robert G. Bandes
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

Up to this point direct implementations of axiomatic or equational specifications have been limited because the implementation mechanisms used are incapable of capturing the full semantics of the specifications. The programming language Unicorn was designed and implemented with the intention of exploring the full potential of programming with equations. Unicorn introduces a new language mechanism, called constraining-unification. When coupled with semantic unification, constraining-unification closely models the semantics of equational specifications thereby allowing for the implementation of a wider class of specifications. Unlike the language mechanisms of rewrite-rule and logic programming, constraining-unification is free of order dependencies. The same results are produced regardless of the order in which the axioms are stated. The use of viewpoints contributes to the flexibility of the Unicorn language. Preconditions for partial operations can be specified without added machinery.
Organizing computer systems for learnability and useability
Authors: Paul Constantine Anagnostopoulos
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

Methods for organizing computer systems are described. The goal of these methods is to produce systems which are easier to learn and use, both for the novice and the advanced user. A system utilizing these methods is being developed at Brown; This system is discussed in some detail.
Sacrificing the calf of flexibility on the altar of reliability
Authors: Peter J. Denning
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

A pattern of conflict between flexibility and reliability in system designs is examined.
An Efficient Fully Parallel Thinning Algorithm
Authors: N. H. Han, C. W. La, P. K. Rhee
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper addresses an efficient parallel thinning algorithm based on weight-values. The weight-value of a black pixel is calculated by observing neighboring pixels, and it gives us an efficient way to decide whether the pixel is deleted or not. Owing to weight-values, the proposed algorithm uses only 33 templates. Furthermore, it examines only the elimination conditions corresponding the weight-value of boundary pixels, and all elimination conditions will not be searched as most other parallel iterative thinning algorithms. Thus, the execution time can be reduced much comparing to that of previous approaches. The weight-value also allows us to deal with typical troublesome patterns efficiently. Without smoothing before thinning, the algorithm produces robust thinned images even in the presence of two pixel-width noises. We obtain encouraging results from extensive experiments.
A computer architecture and its programming language
Authors: Mario R. Schaffner
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

Computer architectures and programming languages are traditionally developed indepen&dbarbelow;ently. Through suitable computer architecture, for instance, one can attempt to speed up the processing of a stream of data and instructions, leaving to the software the burden of preparing these streams. Through a suitable programming language, one aims at efficiently describing many classes of problems, in a phrase-structure form that is machine indepen&dbarbelow;ent. This approach has led to the ever-increa&sbarbelow;ing application of computers, but it has also brought about a growing complexity in the sof&tbarbelow;ware systems. As a consequence of the latter, there is a new trend toward extending hardware implementation to replace the software ones, especially in view of the new technology of large scale integration.
A structural approach to simulation in support of computer system design
Authors: Melvin M. Cutler
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

This paper describes the various features of a new approach to supporting computer system design by simulating the computer system as it progresses through levels of increasingly detailed design These features include model specifications, use of structured programming, choice of simulation system or language, organization of simulation effort and personnel, the &ldquo;chief modeler&rdquo; concept, the model development process, modeler/designer information flow and interfaces, and the modeling of workload. An analysis is made of relative life cycle cost between the structured approach to simulation and the traditional approach of supporting a computer design effort.
Recommendations on computer science curriculum for undergraduate degree programs
Authors: Richard Austing, Bruce Barnes, Gerald Engel, Gordon Stokes
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

This panel will discuss two recently completed reports of ACM's Curriculum Committee on Computer Science (C3S) and two reports currently in progress. One of the completed reports presents recommendations for topics appropriate for the freshman and sophomore years of an undergraduate degree program in computer science; the other one contains a post &ldquo;Curriculum '68&rdquo; bibliography of literature on computer science education. The reports still in progress address service courses and identify topics appropriate at the intermediate level of a computer science undergraduate degree program. These reports are part of a projected series of reports intended to update &ldquo;Curriculum '68&rdquo;.
Rainbow: An integrated CAD system
Authors: Heinz U. Lemke, C. J. Cheney, M. Etherton, N. E. Wiseman
Venue: Proceedings of the 8th Design Automation Workshop (1971)

This paper discusses an experimental integrated design system being developed at Cambridge University, aimed at exposing some principles of good practice in the construction of large ensembles of CAD programs. The paper discusses three aspects of this work: (1) the laying down of the philosophical foundation for the design of the Cad system, (2) system techniques used to implemtnt these fundamental considerations, (3) the pursuit of a number of applications to evaluate the CAD system.
Computer-based audiovisual production
Authors: Jan Bleil
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

The following paper reports on a project sponsored by the Stanford Center for Information Processing (SCIP) User Services group to explore the feasibility of using audio-digital recordings as audiovisual instructional products to teach interactive computing languages to users of SCIP's facilities. Because audio-digital recording is heavily linked to computer systems, it made sense to try to utilize computer programs to help alleviate some of the difficulties of creating high-quality audio-digital instructional products. The result was an audiovisual authorship system named CAP (for Computer-based Audiovisual Production). Although the CAP software is oriented specifically toward the production of audio-digital cassettes, it can presently be used equally well to produce either audio-only tutorials or audiovisual products such as no-camera videotapes (i.e., videotapes created solely on a computer terminal, without the aid of a video camera, and played back using a videotape-recorder and a television set). However, in situations in which computer terminals are already available for other purposes, audio-digital cassette playback is considerably cheaper than most alternative audiovisual playback media. So although it is feasible %o use the CAP system to produce other media, the following discussion assumes that audio-digital cassettes are the end product of an author's efforts. The CAP system described below was developed explicitly to facilitate development of audio-digital instructional products for use with relatively high-speed (120-480 cps) CRT display terminals.
A user interface management system
Authors: David J. Kasik
Venue: ACM SIGGRAPH Computer Graphics (1982)

The design and construction of the user interface to interactive systems is receiving increased attention. This paper describes a user interface management system that allows a designer/developer to focus on the logical functionality of an application without the usual bookkeeping associated with a conventional programming language. The user interface management system contains two components: a special purpose, application independent dialogue specification language and a run-time interpreter that provides a number of interaction extensions not possible with procedure libraries.
Versatile mask generation techniques for custom microelectronic devices
Authors: Robert P. Larsen
Venue: Proceedings of the 15th Design Automation Conference (1978)

A paramount attribute for any computer-aided design methodology, involving custom microelectronic devices, is a rapid and cost effective mask generation technique. The microelectronic device can be characterized as a discrete topological schematic which has been geometrically scaled to imply a grid structure. This topological schematic is constructed from a set of symbols which explicitly define the electrical and logical functions of the device while implying the geometrical relationships related to the process technology. Each layout symbol can be mapped into specific geometrical shapes (layer by layer) which can be defined by sizing data and subsequently subjected to appropriate modification, depending on contextual relationships with the adjacent orthogonal and diagonal layout symbols. These symbol-to-geometrical mappings can be easily comprehended by device designers and the requisite algorithms are amenable to computer implementation. These mask generation techniques provide a cost-effective means of generating mask sets for custom microelectronic devices while also providing device design portability and is ideally suited for process experimentation.
The simulation of petroleum tank wagon loading rack operation
Authors: Jerry Babbin, Frank Pfaff
Venue: Proceedings of the second conference on Applications of simulations (1968)

Simulation and Evaluation of Rack Facilities (SERF) is a GPSS/360 language program which simulates the flow of trucks through the loading facilities of a marketing bulk plant. The general bulk plant represented in SERF is a distribution point for a wide variety of petroleum fuels including gasolines, light oils, and heavy oils. The bulk plant is characterized by a set of loading racks at which various fuels are dispensed from a number of storage tanks to a fleet of compartmentalized tank wagons. The bulk plant serves both a company-owned transport fleet and trucks owned and operated by various independent jobbers or resellers. The loading operation is monitored and supervised from a control tower with the dispatching and accounting functions being carried out in close coordination.
A Vision System for Flexible Objects Analysis
Authors: G. L. Foresti, S. Gentili, R. Giannitrapani, W. Vanzella, R. Scarpella
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper we present the developing of the Vision Module for the European project denominated Venflex. In particular, the main goal of this system is to determinate the pose of flexible objects. Since the project is in its starting phase, the paper deals mainly with the system set-up and with some preliminary results of the neural networks employed for the segmentation of the images.
Emerald: A bus style designer
Authors: Chia-Jeng Tseng, Daniel P. Siewiorek
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes the development of a design generator. The design generator takes a behavioral description as its input and generates functional level structures as its output. Designs for two behavioral descriptions are compared with commercial designs. On the average, the total number of gates required for the allocated data paths is 15 percent more than the commercial designs. Mechanisms for exploring alternative designs are provided. The design space for one of the examples is extensively investigated. Limitations of automated design are also discussed.
Application and analysis of the virtual machine approach to information system security and isolation
Authors: Stuart E. Madnick, John J. Donovan
Venue: Proceedings of the workshop on virtual computer systems (1973)

Security is an important factor if the programs of independent and possibly malicious users are to coexist on the same computer system. In this paper we show that a combined virtual machine monitor/operating system (VMM/OS) approach to information system isolation provides substantially better software security than a conventional multiprogramming operating system approach. This added protection is derived from redundant security using independent mechanisms that are inherent in the design of most VMM/OS systems.
An on-line interactive audiographic learning system
Authors: T. C. Ting, A. P. Jensen
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

An on-line interactive audiographic learning system is described. The system is able to deliver synchronized narrative and line-graphic learning information to learners at remote locations via regular telephone lines. A quasi-conversational mode of instruction allows learners to control the interaction by using Touch-Tone telephone signals. Individualized instruction is achieved by providing the learner with the possibility of selecting, stopping, reviewing, and skipping instructional materials at his own desire and pace. Instructional information in both audio and graphic forms are stored electronically on regular stereo audio tapes in modular forms. Multiple tape units are used to store the learning data base. A PDP-8/I computer is used to control the process. Instructional modules are redundantly stored to permit access by multiple learners at different learning stations. Learning activities of each user are recorded. The hardware and software of the system is described. The procedures of course generation, editing, processing, and up-dating are described.
Architectural features of CASSM: A Context Addressed Segment Sequential Memory
Authors: G. J. Lipovski
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

A Context Addressed Segment Sequential Memory (CASSM) was built to evaluate several techniques for nonnumeric processing. Herein, it is described from the architectural point-of-view. The basic architecture is introduced, information, data and storage structures are discussed, and the principles of disc searching used by CASSM are discussed.
A tutorial on natural-language processing
Authors: Gary G. Hendrix, Jaime G. Carbonell
Venue: Proceedings of the ACM '81 conference (1981)

This tutorial focuses on the problems of enabling computers to communicate with humans in natural languages, such as English and French, as distinguished from formal languages, such as BASIC and FORTRAN. Understanding the computational mechanisms that underlie the use of natural language is the central objective of computational linguistics1 a science at the juncture of artificial intelligence, linguistics, psychology and philosophy. The three primary goals of this field are: 1. The investigation of human language understanding and generation - using the computer to express, test, and further develop theories of human cognition. This approach is part of the &ldquo;cognitive modelling&rdquo; aspect of artificial intelligence. 2. The refinement and development of linguistic theories stressing generality, coverage and &ldquo;linguistic soundness&rdquo; of syntactic analyzers. This approach includes mathematically oriented analysis of formal languages. 3. The construction of practical, useful natural language interfaces and processing systems - often with concrete applications in mind. This approach includes the less-than-successful early machine translation efforts as well as the much more promising, and recently proven, natural language database query systems.
On interaction with data bases
Authors: N. Minsky
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

The main thesis of this paper is that interaction with data bases is fundamentally different from file manipulation: In the former case the data base should be &ldquo;the master,&rdquo; while the file is a passive collection of data. The main corollaries of this observaction are: a) The conventional update and retrieval operations, traditionally used for files, are not satisfactory as the primitives of users data-base interaction. b) The privacy and integrity of the data base cannot be secured by &ldquo;access control&rdquo; alone; there must be a way for the data base to control the user's program itself.
WSCLOCK&mdash;a simple and effective algorithm for virtual memory management
Authors: Richard W. Carr, John L. Hennessy
Venue: ACM SIGOPS Operating Systems Review (1981)

A new virtual memory management algorithm WSCLOCK has been synthesized from the local working set (WS) algorithm, the global CLOCK algorithm, and a new load control mechanism for auxiliary memory access. The new algorithm combines the most useful feature of WS&mdash;a natural and effective load control that prevents thrashing&mdash;with the simplicity and efficiency of CLOCK. Studies are presented to show that the performance of WS and WSCLOCK are equivalent, even if the savings in overhead are ignored.
A modest information system implemented on APL
Authors: Charles D. Wende
Venue: Proceedings of the sixth international conference on APL (1974)

An information system implemented on APL/360 utilizing the ANCOR file system is described. This system allows the interactive modification, search, and dump of data bases (character only) of up to 65532 bytes. In addition, this system utilizes standard 1/0 facilities in batch mode. The design of this system and its limitations are discussed, and some applications are presented.