ppxscal/embedding_network huggingface dataset:
Statistical Database Query Languages
Authors: Gultekin Ozsoyoglu, Zehra M. Ozsoyoglu
Venue: IEEE Transactions on Software Engineering (1985)

Databases that are mainly used for statistical analysis are called statistical databases (SDB). A statistical database management system (SDBMS) may be defined as a database management system that provides capabilities 1) to model, store, and manipulate data in a manner suitable for the needs of SDB users, and 2) to apply statistical data analysis techniques that range from simple summary statistics to advanced procedures. This paper surveys the existing and proposed SDB data definition and data manipulation (i.e., query) languages.
The applicability of Ada (R) to MIL-STD-1750A
Authors: C. Roast
Venue: ACM SIGAda Ada Letters (1988)

Contrary to recently publicized concern in some DoD sectors, Texas Instruments believes that Ada is a suitable higher order language for the generation of real-time avionics application software on MIL-STD-1750A compatible computers. The perceived problems with using Ada generated programs on the 1750A are not unique to Ada, but also apply to JOVIAL and other high-order languages as well. These perceived problems have been based primarily on subjective, worst-case application scenarios, with no real basis in quantitative, empirical data. Recent analysis internal to Texas Instruments and within the SAE/AE9-E industry/government forum on Computer Architecture Standards have not identified any major shortcomings of the 1750A instruction-set architecture which will present a unique problem for Ada applications. The 1750A architecture has proven to be adequate for many HOL (especially JOVIAL) applications thusfar. The same techniques which have proven successful for applying JOVIAL/1750A to real-time avionics applications will also apply to Ada. These techniques involve an appropriate implementation of the compiler's run-time support model and the observance and enforcement of certain "programming-style" or "coding" methodologies by the application software designer. Furthermore, there is no real evidence to suggest that the techniques which have made JOVIAL usable for past/present real-time avionic applications of 1750A will not continue to apply to foreseeable applications of Ada and 1750A as well.
Toward automating the software-development cycle
Authors: Karen A. Frenkel
Venue: Communications of the ACM (1985)

Knowledge-intensive rather than labor-intensive processes are being advanced to spur programming productivity.
An extended systems modeling language (ESML)
Authors: William Bruyn, Randall Jense, Dinesh Keskar, Paul Ward
Venue: ACM SIGSOFT Software Engineering Notes (1988)

ESML (Extended Systems Modeling Language) is a new system modeling language based on the Ward-Mellor and Boeing structured methods techniques, both of which have proposed certain extensions of the DeMarco data flow diagram notation to capture control and timing information. The combined notation has a broad range of mechanisms for describing both combinatorial and sequential control logic.
Determination of technical support requirements of an office automation system
Authors: Edward J. Williams
Venue: ACM SIGSIM Simulation Digest (1988)

The Body amp; Chassis Engineering Department of Ford Motor Company recently formulated plans for greatly increasing (from 155 to 476) the number of Fortune engineering-workstation computers. This increase represents a vital step in the implementation of an office automation system. Systems-analysis personnel of the Department used discrete simulation as a tool to quantify the impact of this increase on the workload of technical support personnel. In turn, Department management used the results of these simulations to formulate a hiring plan consistent with the planned rate of terminal acquisition.
Performance of ARQ Schemes on Token Ring Networks
Authors: Wu-Yeh Cheng Jane W. Liu
Venue: IEEE Transactions on Computers (1988)

Token ring networks differ in the manner in which acknowledgements are handled. In Newhall rings, acknowledgements of data packets are either sent as independent packets or piggybacked on returned data packets. In acknowledgement rings, there is an acknowledgement field in each data packet. The authors present an empirical formula that predicts the average network access delay in networks where the sender is allowed to transmit only one packet each time it seizes the token and discuss its validity. The performance of the stop-and-wait ARQ (automatic-repeat-request) scheme in token ring networks is treated. The average access delay, optimum window size, and maximum achievable throughput as functions of network and protocol parameters in Newhall rings when the continuous ARW scheme is used are studied. Tradeoffs between average access delay and average buffer occupancy time are examined.
Analysis of retrieval performance for records and objects using optical disk technology
Authors: Stavros Christodoulakis
Venue: ACM Transactions on Database Systems (TODS) (1987)

In this paper we examine the problem of object and record retrieval from optical disks. General objects (such as images, documents, etc.) may be long and their length may have high variance. We assume that all the components of an object are stored consecutively in storage to speed-up retrieval performance. We first present an optical disk model and an optimal schedule for retrieval of records and objects which qualify in a single query on a file stored on an optical disk device. We then provide exact and approximate analytic results for evaluating the retrieval performance for objects from an optical disk. The analysis provides some basic analytic tools for studying the performance of various file and database organizations for optical disks. The results involve probability distribution of block accesses, probability distributions of span accesses, and probability distribution of seek times. Record retrieval is an important special case. This analysis differs from similar ones in database environments in the following respects: (1) the large size and large variance of the size of objects; (2) crossing of track boundaries by objects; (3) the capability for span access that optical disks provide (e.g., when the optical assembly is located in a given position, information can be read from a number of consecutive tracks (span) with a small additional cost).
Algorithms for routing and testing routability of planar VLSI layouts
Authors: C E Leiserson, F M Maley
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

This paper studies the problem of routing wires in a grid among features on one layer of a VLSI chip, when a sketch of the layer is given. A sketch specifies the positions of features and the topology of the interconnecting wires. We give polynomial-time algorithms that (1) determine the routability of a sketch, and (2) produce a routing of a sketch that optimizes both individual and total wire length. These algorithms subsume most of the polynomial-time algorithms in the literature for planar routing and routability testing in the rectilinear grid model. We also provide an explicit construction of a database, called the rubber-band equivalent, to support computation involving the layout topology.
A framework for incremental progress in the application of AI to software engineering
Authors: Guillermo Arango, Ira Baxter, Peter Freeman
Venue: ACM SIGSOFT Software Engineering Notes (1988)

The study of the potential contributions of artificial intelligence (AI) to software engineering (SE) needs a conceptual framework within which to analyze the scope and feasibility of such contributions.We propose a framework designed to uncover opportunities for incremental progress in SE through the adoption of AI solutions. We emphasize incremental for we believe progress must be assessed in terms of discrete, well-defined steps. The incremental approach involves two fundamental steps:1. partition the universe into restricted domains of study, and2. examine each of those domains to determine what progress is possible.The framework can be used as a guideline for refining research domains, as a context for comparing applications, or as a mechanism to provide structure for future discussions of applications of AI to SE.
Performance Analysis of a Database Filter Search Hardware
Authors: S Pramanik
Venue: IEEE Transactions on Computers (1986)

Several hardware algorithms to search for a large number of keys in a database are presented. These algorithms allow some false matches but guarantee hits for the desired search keys. This imperfectness allows us to design a variety of simple hardware searchers by using only RAM's and shift registers. Analytic models are developed to compare the performances of these hardware devices. Applications of these devices for database systems are also discussed.
Relationship between IDL and structure editor generation technology
Authors: P. H. Feiler
Venue: ACM SIGPLAN Notices (1987)

This paper discusses observed commonalities and differences between IDL and structure editor generation technologies. IDL (Interface Description Language) is technology for generation of tool intercommunication support with roots in compiler generation. Structure editor generation technology has its roots in syntax-directed editors. It produces environments for interactive viewing and manipulation of formally specified structures. Both technologies use a formal notation for structural and constraint descriptions. From these descriptions both generation tools automatically produce software for reading, writing, and manipulating instances of the described structures, as well as for checking specified constraints on information contained in the structures. The IDL technology emphasizes generation of batch---oriented applications while the structure editor generation technology is tailored to supporting interactive applications. Structure editor generation technology has been applied to itself, i.e., to building an interactive structure editor generation environment.
A microprocessor development environment based on the Amsterdam compiler kit, EMACS and UNIX
Authors: David F. Gray
Venue: ACM SIGCSE Bulletin (1987)

This note describes a microprocessor development environment (MDE) that meets both the public educational sectors technical requirements and the constraints of low-cost, flexibility and maintainability.The individual parts of the system described are available in the public domain, via the academic community or available commercially at low cost. Each item is either obtainable in either source code form or is provided with an accompanying configuration system to allow tailoring to specific requirements.
Efficient and correct execution of parallel programs that share memory
Authors: Dennis Shasha, Marc Snir
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1988)

In this paper we consider an optimization problem that arises in the execution of parallel programs on shared-memory multiple-instruction-stream, multiple-data-stream (MIMD) computers. A program on such machines consists of many sequential program segments, each executed by a single processor. These segments interact as they access shared variables. Access to memory is asynchronous, and memory accesses are not necessarily executed in the order they were issued. An execution is correct if it is sequentially consistent: It should seem as if all the instructions were executed sequentially, in an order obtained by interleaving the instruction streams of the processors. Sequential consistency can be enforced by delaying each access to shared memory until the previous access of the same processor has terminated. For performance reasons, however, we want to allow several accesses by the same processor to proceed concurrently. Our analysis finds a minimal set of delays that enforces sequential consistency. The analysis extends to interprocessor synchronization constraints and to code where blocks of operations have to execute atomically. We use a conflict graph similar to that used to schedule transactions in distributed databases. Our graph incorporates the order on operations given by the program text, enabling us to do without locks even when database conflict graphs would suggest that locks are necessary. Our work has implications for the design of multiprocessors; it offers new compiler optimization techniques for parallel languages that support shared variables.
An industrial advisory council for a computer science department: a case study
Authors: David Ballew
Venue: ACM SIGCSE Bulletin (1987)

This paper defines the need for an Industrial Advisory Council for a Computer Science Department and describes how such a Council can benefit the Department in its construction and updating of curriculum, in faculty and student development, in its relationship with the college or university administration and in its work with industry recruiters and management. The paper gives the details of a working Industrial Advisory Council and explains how the Council has actually helped with the items listed above.The Council described functioned for three years while the author was Head of the Department at the South Dakota School of Mines and Technology. The author now has a new position at Western Illinois University and the paper describes the formation of a new Council at that University.
Teaching technical reviews in a one-semester software engineering course
Authors: James S. Collofello
Venue: Proceedings of the eighteenth SIGCSE technical symposium on Computer science education (1987)

Software technical reviews are essential to the development and maintenance of high quality software. These review processes are complex group activities for which there exist an abundance of basic concepts evolved over years of practical experience. In a typical one-semester software engineering course very little of this information is adequately conveyed to students. Texts supporting this course are also very weak in this area. This paper provides a practical approach for teaching about software technical reviews in a one-semester software engineering course. The contents for two to three lectures on this topic are described as well as suggested exercises and an approach for integrating technical reviews with the usual team project. An extensive annotated bibliography is also provided to assist instructors and students.
Correction to &ldquo;An equivalence between relational database dependencies and a fragment of propositional logic&rdquo;
Authors: Y. Sagiv, C. Delobel, D. S. Parker,  Jr., Ronald Fagin
Venue: Journal of the ACM (JACM) (1987)

According to the definition of satisfaction of Boolean dependencies, Theorem 15 is not true for Boolean dependencies with negation. (A positive Boolean dependency is built using the Boolean connectives &cuwed;, &cuvee;, and &nrarr;; a general Boolean dependency (with negation) may use also the Boolean connective &not;.) Actually, the definition of satisfaction is not meaningful for Boolean dependencies with negation, since many are never satisfied. We show how the definition of satisfaction should be changed in order to make Boolean dependencies with negation meaningful and correct the error. We associate with each relation r a set &agr;(r) of truth assignments, as follows. For each pair of distinct tuples of r, the set &agr;(r) contains the truth assignment that maps an attribute A to true if the two tuples are equal on A, and to false if the two tuples have different values for A. A Boolean dependency &sgr; is satisfied by a relation r if &sgr; (i.e., the corresponding Boolean formula) satisfies every truth assignment of &agr;(r). The original definition given in the paper is equivalent to having &agr;(r) also include the truth assignment that is generated by pairs in which both tuples are really the same tuple of r, that is, to having &agr;(r) also always include the truth assignment &tgr; mapping all attributes to true. Under that definition, however, many Boolean dependencies with negation are never satisfied and, hence, are meaningless. More precisely, according to the original definition, a Boolean dependency is satisfied by
Multiple-Valued CCD Circuits
Authors: Jon T. Butler, Hans G. Kerkhoff
Venue: Computer (1988)

The benefits and current state of the art of charge-coupled-device logic are examined. The fundamentals of CCD logic operations and basic CCD configurations are presented. Programmable logic arrays are considered. The logic design of CCD multivalued logic and its applications are discussed.
Systems analysis and design: an orphan course about to find a home
Authors: Bernard John Poole
Venue: ACM SIGCSE Bulletin (1988)

A course in Systems Analysis and Design (SA amp;D) as a component of the curriculum in Computer Science (CS) has not traditionally been given high priority at the undergraduate level. As a result students have been poorly prepared for the reality of a working world where large software projects frequently founder, and sometimes fail, for lack of project management and experience. There is a need for "real" software project experience within the framework of a college curriculum. This is not an unrealistic expectation, even though it presents a particularly demanding pedagogical challenge. The solution may be in a marriage between SA amp;D and Software Engineering (SE). At the University of Pittsburgh at Johnstown we are introducing such a component this coming academic year (87--88). We hope that this will go some way toward giving our students a taste for the inherent complexity of large software systems. We also present a recent experience with "real" project development from which we have gained insights for future course design.
Dynamic functional dependencies and database aging
Authors: Victor Vianu
Venue: Journal of the ACM (JACM) (1987)

A simple extension of the relational model is introduced to study the effects of dynamic constraints on database evolution. Both static and dynamic constraints are used in conjunction with the model. The static constraints considered here are functional dependencies (FDs). The dynamic constraints involve global updates and are restricted to certain analogs of FDs, called &ldquo;dynamic&rdquo; FDs. The results concern the effect of the dynamic constraints on the static constraints satisfied by the database in the course of time. The effect of the past history of the database on the static constraints is investigated using the notions of age and age closure. The connection between the static constraints and the potential future evolution of the database is briefly discussed using the notions of survivability and survivability closure.
Noncorrecting syntax error recovery
Authors: Helmut Richter
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1985)

A parser must be able to continue parsing after encountering a syntactic error to check the remainder of the input. To achieve this, it is not necessary to perform corrections on either the input text or the stack contents. A formal framework is provided in which noncorrecting syntax error recovery concepts are defined and investigated. The simplicity of these concepts allows the statement of provable properties, such as the absence of spurious error messages or the avoidance of skipping input text. These properties are due to the fact that no assumptions about the nature of the errors need be made to continue parsing.
A New Measure for Hybrid Fault Diagnosability
Authors: Che-Liang Yang, Gerald M. Masson
Venue: IEEE Transactions on Computers (1987)

Using the PMC model of a multiprocessor system, a new, general quality of hybrid fitult (combinations of hard anid soft failing units) diagnosability is characterized which encompasses previously known results as well as provides a major extension. This new diagnosability, called t/ts/t-diagnosability, serves as a measure of the extent to which collections of test results, called syndromes, contain information relative to faulty unit identification for various testing assignments. By analyzing a system's test assignment over tahges of the parameter values t, ts, and t, the spectrum of diagnosis quality achievable in that system can be established. Fundamental interrelationships among these parameters are developed. Optimal designs of t/ts/t-diagnosable systems are presented. The main result of this correspondence can be viewed as a master fault diagnosability characterization which from the perspective of usefulness of the syndrome space for correct diagnosis both unifies and expands the domain of hybrid fault diagnosabilities.
Anatomy of an introductory computer science course
Authors: Peter B. Henderson
Venue: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education (1986)

An introductory computer science course is frequently the most difficult course in the curriculum to teach. Computer science educators must stay abreast of rapidly changing trends, text books, technology and teaching techniques. This paper provides an overview and perspective of introductory computer science courses, surveys some trends, and presents new alternative approaches regarding organization, foundations and material. It is based on the premise that the introductory course should create strong foundations upon which students can build, and that the curriculum should teach students to build software systems which people use and maintain, not just toy computer programs. The paper presents personal views and insights, motivates underlying concepts, and provides many useful suggestions which have been successfully employed in such introductory courses.
Memory requirements for balanced computer architectures
Authors: H. T. Kung
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

One particular result is that to balance an array of p linearly connected PEs for performing matrix computations such as matrix multiplication and matrix triangularization, the size of each PE's local memory must grow linearly with p. Thus, the larger the array is, the larger each PE's local memory must be.
Information technology and dataveillance
Authors: Roger Clarke
Venue: Communications of the ACM (1988)

Data surveillance is now supplanting conventional surveillance techniques. With this trend come new monitoring methods such as personal dataveillance and mass dataveillance that require more effective safeguards and a formal policy framework.
A simple three-dimensional real-time cellular array
Authors: P Gács, J Reif
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

We build a three-dimensional array of unreliable cellular automata that can simulate a universal Turing machine (more generally, a one-dimensional universal iterative array) reliably. This is the first reliable real-time simulation. The encoding is simple repetition, and no decoding is needed. The construction is based on Toom's work.
A society model for office information systems
Authors: Cheng-Seen Ho, Yang-Chang Hong, Te-Son Kuo
Venue: ACM Transactions on Information Systems (TOIS) (1986)

A society model, which characterizes the behavior and procedure of offices, is proposed. It is our belief that an office system capable of dealing with all real office problems only through the modeling of the internal behavior of an office can be developed. In this society model, office entities are viewed as agents. An agent is modeled as a microsociety of interacting knowledge sources. Within the microsociety, there exists a microknowledge exchange system, which provides a set of microknowledge exchange protocols as a coordination system among those knowledge sources during their cooperative reasoning process. An office is then modeled as a society of various interacting agents using their knowledge to complete the office goals cooperatively. It is this unified view that allows offices to be modeled in a flexible and general way.