ppxscal/embedding_network huggingface dataset:
The effects of sources of applications programs on user satisfaction: an empirical study of micro, mini mainframe computers using an interactive artificial intelligence expert-system
Authors: Avi Rushinek, Sara Rushinek
Venue: Proceedings of the twenty-first annual conference on Computer personnel research (1985)

This study analyzes the influence of sources of applications programs (SAP) on overall computer user satisfaction as determined by multiple regression. The variables, proprietary software packages, vendor customized application programs, and average system, life in months are found to be the most significant variables affecting overall satisfaction whereas, the variables, ready made vendor programs, minicomputer systems, and in house personnel applications have the least significant effect on user satisfaction. An interactive expert system (ES) for SAP is designed, developed and demonstrated in this study.
A Tour Through Cedar
Authors: Warren Teitelman
Venue: IEEE Transactions on Software Engineering (1985)

This paperlintroduces the reader to many of the salient features of the Cedar programming environment, a state-of-the-art progrmming system that combines in a single integrated environment: high quality graphics, a sophisticated editor and document preparation facility, and a variety of tools for the programmer to use in the construction and debugging of his programs. The Cedar programming language [8] is a strongly typed, compiler-oriented language of the Pascal family. What is especially interesting about the Cedar project is that it is one of the few examples where an interactive, experimental programming environment has been built for this kind of language. In the past, such environments have been confined to dynamically typed languages like Lisp and Smalltalk.
OMEGA: A database management system for academic use
Authors: Colleen Deegan, John Atkins, Mike Henry
Venue: ACM SIGCSE Bulletin (1986)

This paper describes an implementation of the relational database management system, OMEGA. OMEGA is designed to be "query language independent" in order to promote the investigation of experimental query languages by graduate students. OMEGA also supports the query language SQL and as such, is used in undergraduate database courses to demonstrate the features of SQL.
Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection
Authors: V Ramachandran
Venue: IEEE Transactions on Computers (1986)

We present algorithms and time complexity results for MOS switch-level simulation with particular reference to race detection. Under the switching model used in classical (Boolean) switching theory, we derive a linear-time race detection algorithm for switch-level circuits that have no feedback within a clock phase, and have unit fan-out. We show that the problem becomes NP-complete if fan-out of two or more is allowed. We Also relate this result to others that have recently been reported, using a different switching model.
Hard examples for resolution
Authors: Alasdair Urquhart
Venue: Journal of the ACM (JACM) (1987)

Exponential lower bounds are proved for the length-of-resolution refutations of sets of disjunctions constructed from expander graphs, using the method of Tseitin. Since these sets of clauses encode biconditionals, they have short (polynomial-length) refutations in a standard axiomatic formulation of propositional calculus.
On the reliability of consensus-based fault-tolerant distributed computing systems
Authors: Özalp Babaoğlu
Venue: ACM Transactions on Computer Systems (TOCS) (1987)

The designer of a fault-tolerant distributed system faces numerous alternatives. Using a stochastic model of processor failure times, we investigate design choices such as replication level, protocol running time, randomized versus deterministic protocols, fault detection, and authentication. We use the probability with which a system produces the correct output as our evaluation criterion. This contrasts with previous fault-tolerance results that guarantee correctness only if the percentage of faulty processors in the system can be bounded. Our results reveal some subtle and counterintuitive interactions between the design parameters and system reliability.
Description and performance analysis of signature file methods for office filing
Authors: Christos Faloutsos, Stavros Christodoulakis
Venue: ACM Transactions on Information Systems (TOIS) (1987)

Signature files have attracted a lot of interest as an access method for text and specifically for messages in the office environment. Messages are stored sequentially in the message file, whereas their hash-coded abstractions (signatures) are stored sequentially in the signature file. To answer a query, the signature file is examined first, and many nonqualifying messages are immediately rejected. In this paper we examine the problem of designing signature extraction methods and studying their performance. We describe two old methods, generalize another one, and propose a new method and its variation. We provide exact and approximate formulas for the dependency between the false drop probability and the signature size for all the methods, and we show that the proposed method (VBC) achieves approximately ten times smaller false drop probability than the old methods, whereas it is well suited for collections of documents with variable document sizes.
A study of scalar compilation techniques for pipelined supercomputers
Authors: Shlomo Weiss, James E. Smith
Venue: ACM SIGPLAN Notices (1987)

This paper studies two compilation techniques for enhancing scalar performance in high-speed scientific processors: software pipelining and loop unrolling. We study the impact of the architecture (size of the register file) and of the hardware (size of instruction buffer) on the efficiency of loop unrolling. We also develop a methodology for classifying software pipelining techniques. For loop unrolling, a straightforward scheduling algorithm is shown to produce near-optimal results when not inhibited by recurrences or memory hazards. Software pipelining requires less hardware but also achieves less speedup. Finally, we show that the performance produced with a modified CRAY-1S scalar architecture and a code scheduler utilizing loop unrolling is comparable to the performance achieved by the CRAY-1S with a vector unit and the CFT vectorizing compiler.
Towards a Formal Basis for the Formal Development Method and the Ina Jo Specification Language
Authors: Daniel M. Berry
Venue: IEEE Transactions on Software Engineering (1987)

In carrying out SDC's Formal Development Method, one writes a specification of a system under design in the Ina Jo specification language and proves that the specification meets the requirements of the system. This paper develops an abstract machine model of what is specified by a level specification in an Ina Jo specification. It describes the state as defined by the front matter, computations as defined by initial states and transforms, and invariants, criteria, and constraints as properties of computations. The paper then describes a number of formal design methods and the kinds of abstractions that they require. For each of these kinds of abstractions, there is a characteristic relationship between refinements that should be proved as one is carrying out the method.
AT2 = O(N log4 N), T = O(log N) fast Fourier transform in a light connected 3-dimensional VLSI
Authors: M. Hasegawa, Y. Shigei
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

We can perform a N-point FFT with time performance T=&Ogr;(log N) and area-time performance AT2=&Ogr;(N log4 N), by using the 3-dimensional VLSI system which is optically interconnected. This performance exceeds the theoretical lower bound of the area-time performance (N2 log2 N) of the conventional VLSI.
A Simple Mechanism for Type Security Across Compilation Units
Authors: Michael L. Scott, Raphael A. Finkel
Venue: IEEE Transactions on Software Engineering (1988)

A simple technique is described that detects structural-type clashes across compilation units with an arbitrarily high degree of confidence. The type of each external object is described in canonical form. A hash function compresses the description into a short code. If the code is embedded in a symbol-table name, then consistency can be checked by an ordinary linker. For distributed programs, run-time checking of message types can be performed with very little overhead.
Software interconnection models
Authors: D. E. Perry
Venue: Proceedings of the 9th international conference on Software Engineering (1987)

We present a formulation of interconnection models and present the unit and syntactic models &mdash; the primary models used for managing the evolution of large software systems. We discuss various tools that use these models and evaluate how well these models support the management of system evolution. We then introduce the semantic interconnection model. The semantic interconnection model incorporates the advantages of the unit and syntactic interconnection models and provides extremely useful extensions to them. By refining the grain of interconnections to level of semantics (that is, to the predicates that define aspects of behavior) we provide tools that are better suited to manage the details of evolution in software systems and that provide a better understanding of the implications of changes. We do this by using the semantic interconnection model to formalize the semantics of program construction, the semantics of changes, and the semantics of version equivalence and compatibility. Thus, with this formalization, we provide tools that are knowledgeable about the process of system construction and evolution and that work in symbiosis with the system builders to construct and evolve large software systems.
Automatic Verification of Sequential Circuits Using Temporal Logic
Authors: M C Browne, E. M. Clarke, D L Dill, B Mishra
Venue: IEEE Transactions on Computers (1986)

Verifying the correctness of sequential circuits has been an important problem for a long time. But lack of any formal and efficient method of verification has prevented the creation of practical design aids for this purpose. Since all the known techniques of simulation and prototype testing are time consuming and not very reliable, there is an acute need for such tools. In this paper we describe an automatic verification system for sequential circuits in which specifications are expressed in a propositional temporal logic. In contrast to most other mechanical verification systems, our system does not require any user assistance and is quite fast experimental results show that state machines with several hundred states can be checked for correctness in a matter of seconds!
What I didn't learn in the classroom
Authors: Beth Satter
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

Some things can't be learned in a classroom. You learn theories in a class, but the applications of the theories are often very different. Usually, students must wait until they have graduated, and landed that first job before they can apply what they have learned. There are, however, opportunities for students to work with professionals while in college to gain experience and ease the transition from college to career. I am a student at the University of Wisconsin-Eau Claire and work with professionals, like you, at Academic Computing Services. In addition to your normal responsibilities, you provide professional, on-the-job training for students. As a part of this training, students learn to adapt the theories learned in the classroom to real-life situations. This paper focuses on my experience and the benefits you, as professionals, have provided me. I would like to explain how you found me, what responsibilities you entrusted to me, what you do to keep me working for you, and how you have prepared me for the future.
Extending worksheet modelling software with expert system technology
Authors: Gerald A. Sullivan, Kenneth J. Fordyce
Venue: ACM SIGAPL APL Quote Quad (1986)

As a result of the rapid changes in the &ldquo;information processing technology&rdquo;, existing programming languages like APL are facing a number of challenges to maintain or increase &ldquo;market share&rdquo;. Such technologies as networks, worksheets, expert or knowledge based systems, host / workstation shared processing, software quality, and end user computing are of concern to the consumer of programming languages. It is the contention of these authors and others that APL already contains many features to meet new needs (for example, tracing the execution of a function or networking users on a single mainframe), or can easily and elegantly be extended to meet new needs (for example, invoking assembler from APL or a host - workstation link). This paper describes a tool called Automated Ledger Book (ALB). ALB uses expert system technology to extend worksheet modeling software function and therefore enhance end user computing. The purpose of this description is to help demonstrate the applicability of APL to such new areas as expert systems, and help the APL community better understand the links between expert systems and decision support systems. ALB is a worksheet model generator with some enhancement based on an equation manipulating expert system and a natural language interface built by the authors in APL/APL2. ALB enables the user to build and run worksheet type models in high school algebraic notation and English without regard to equation order or specification of calculated and input variables. Solving sets of algebraic and conditional equations, ALB adjusts itself to input, responding to unlimited 'what ifs'. When challenged, ALB provides the rationale for its conclusions.
An Evaluation of Two New Inference Control Methods
Authors: Y. H. Chin, Weng-Ling Peng
Venue: IEEE Transactions on Software Engineering (1987)

An evaluation method is developed to measure the cost/ effectiveness of two new inference control methods. The factors of the evaluation function consist of: 1) preparation cost for the control method, 2) query complexity, and 3) security level under various attacks. Each control method combines the merit of some popular concepts; the first method is based on restriction, and the second on perturbation. Simulation results indicate that both methods have higher preparation cost, better security, and faster response time than Cox's method and Beck's method. Finally these two new methods are compared to each other.
Vertical partitioning algorithms for database design
Authors: Shamkant Navathe, Stefano Ceri, Gio Wiederhold, Jinglie Dou
Venue: ACM Transactions on Database Systems (TODS) (1984)

This paper addresses the vertical partitioning of a set of logical records or a relation into fragments. The rationale behind vertical partitioning is to produce fragments, groups of attribute columns, that &ldquo;closely match&rdquo; the requirements of transactions. Vertical partitioning is applied in three contexts: a database stored on devices of a single type, a database stored in different memory levels, and a distributed database. In a two-level memory hierarchy, most transactions should be processed using the fragments in primary memory. In distributed databases, fragment allocation should maximize the amount of local transaction processing. Fragments may be nonoverlapping or overlapping. A two-phase approach for the determination of fragments is proposed; in the first phase, the design is driven by empirical objective functions which do not require specific cost information. The second phase performs cost optimization by incorporating the knowledge of a specific application environment. The algorithms presented in this paper have been implemented, and examples of their actual use are shown.
Incomplete information costs and database design
Authors: Haim Mendelson, Aditya N. Saharia
Venue: ACM Transactions on Database Systems (TODS) (1986)

This paper presents a methodology for trading-off the cost of incomplete information against the data-related costs in the design of database systems. It investigates how the usage patterns of the database, defined by the characteristics of information requests presented to it, affect its conceptual design. The construction of minimum-cost answers to information requests for a variety of query types and cost structures is also studied. The resulting costs of incomplete database information are balanced against the data-related costs in the derivation of the optimal design.
Integrated software usage in the professional work environment: evidence from questionnaires and interviews
Authors: J. Nielsen, R. L. Mack, K. H. Bergendorff, N. L. Grischkowsky
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1986)

In a field study of use of integrated business software by business professionals, we found several characteristics of the real-world situation leading to the under-utilization of integrated software and being of importance for its human factors. Professionals work in a heterogeneous software environment filled with practical problems, they follow &ldquo;satisficing&rdquo; strategies of sub-optimal usage, and they have problems migrating to more advanced uses. Current levels of software integration do not always adequately or easily support the &ldquo;task integration&rdquo; requirements of real tasks such as handling many small things.
A selective repeat ARQ scheme for point-to-multipoint communications and its throughput analysis
Authors: S R Chandran
Venue: ACM SIGCOMM Computer Communication Review (1986)

Selective repeat automatic-repeat-request (ARQ) schemes with finite receiver buffer have been studied and analyzed extensively for point-to-point communications. In this paper, we propose a selective repeat ARQ scheme for point-to-multipoint communications where each receiver has a finite buffer size. A lower bound on the throughput efficiency of the proposed scheme is obtained. Computation of the lower bound and simulation of the scheme reveal that the ARQ scheme performs quite satisfactorily, particularly for channels with large round-trip delay and high data rate like the satellite channel. The proposed scheme outperforms the full-memory go-back-N scheme proposed by Gopal, et al. [13]. The scheme seems ideally suited for the case of a satellite operating in broadcast mode with many receivers.
A microarchitecture description language for retargeting firmware tools
Authors: J. F. Nixon, S. R. Schach, R. I. Winner
Venue: Proceedings of the 19th annual workshop on Microprogramming (1986)

ARCHI is a microarchitecture description language designed to serve as the underlying language for a retargetable firmware development environment. ARCHI provides a hierarchical, procedural description at the register transfer level of the target microarchitecture. This description can then be utilized by a meta-environment to generate an instantiation of the firmware development environment for a specific target microarchitecture. ARCHI has been successfully used to generate debugging simulators for the vertical Perkin-Elmer 3220, and the horizontal VAX-11/780. It is shown that if a microarchitecture description language is powerful enough to retarget a debugging simulator then it can be used to retarget almost every tool in a firmware development meta-environment, and that ARCHI accordingly satisfies its design objectives.
Single-user capabilities in interprocess communication
Authors: Stephen Russell
Venue: ACM SIGOPS Operating Systems Review (1988)

Many distributed operating systems use interprocess communication (IPC) and data transfer schemes which are optimised for a particular architecture: the workstation/server model. In this model, client processes have full control over data transfer. This paper argues that server controlled data transfer is better suited to systems with a hierarchy of servers distributed across a collection of machines. The system proposed integrates a set of IPC primitives, for the exchange of control information, and a capability system for secure data transfer.
Relative knowledge in a distributed database
Authors: T. Imielinski
Venue: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1987)

Let DB be a database and let u1, , um be a collection of users each having at his or her disposal a query sublanguage Lu1 generated by some view predicate Each of these users knows only as much as he can learn from the database using his or her query sublanguage. Such a knowledge is called relative knowledge in the paper and its various properties including the model and proof theory are investigated. The applications of relative knowledge in the database security and integrity are also discussed.
A Generalized Timed Petri Net Model for Performance Analysis
Authors: Mark A. Holliday, Mary K. Vernon
Venue: IEEE Transactions on Software Engineering (1987)

We have developed a Generalized Timed Petri Net (GTPN) model for evaluating the performance of computer systems. Our model is a generalization of the TPN model proposed by Zuberek [1] and extended by Razouk and Phelps [2]. In this paper, we define the GTPN model and present how performance estimates are obtained from the GTPN. We demonstrate the use of our automated GTPN analysis techniques on the dining philosophers example. This example violates restrictions made in the earlier TPN models. Finally, we compare the GTPN to the stochastic Petri net (SPN) models. We show that the GTPN model has capabilities for modeling and analyzing parallel systems lacking in existing SPN models. The GTPN provides an efficient, easily used method of obtaining accurate performance estimates for models of computer systems which include both deterministic and geometric holding times.
Transparent forwarding: First steps
Authors: Paul L. McCullough
Venue: ACM SIGPLAN Notices (1987)

Traditional object-oriented systems tend to be single-user. As we move from personal to interpersonal computing, we must look for ways to extend our programming paradigms. This research extends the Smalltalk-80 system to send messages transparently to objects residing on remote machines. We discuss two models for remote message sends, describe our current implementation, and suggest areas for future research.
Representing data structures in APL with an extended enclosure function
Authors: J Thornburg
Venue: ACM SIGAPL APL Quote Quad (1986)

We propose a natural extension of the "enclose" general array function, and describe its use in representing complicated data structures such as trees with (possibly) shared branches. We give two examples of the use of the extension, one each in symbolic algebra and in graphics.
DAGON: technology binding and local optimization by DAG matching
Authors: K. Keutzer
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

Technology binding is the process of mapping a technology independent description of a circuit into a particular technology. This paper outlines a formalism of this problem and offers a solution to the problem in terms of matching patterns, describing technology specific cells and optimizations, against a technology independent circuit represented as a directed acyclic graph. This solution is implemented in DAGON. DAGON rests on a firm algorithmic foundation, and is able to guarantee locally optimal matches against a set of over three thousand patterns. DAGON is an integral part of a synthesis system that has been found to provide industrial quality solutions to real circuit design problems.