ppxscal/embedding_network huggingface dataset:
Managing campus-wide information systems: issues and problems
Authors: T. J. Foley
Venue: Proceedings of the 17th annual ACM SIGUCCS conference on User Services (1989)

The spread of computer networks and microcomputers has lead to the rapid expansion of communication via computer conferencing, electronic mail, computer bulletin boards, and other forms of electronic communications such as on-line surveys. Many campuses have implemented or are in the process of implementing campus-wide information systems which make access to information services as easy as using the campus phone system. Lehigh has implemented an information system that has received wide acceptance by the campus community, as over 6000 individuals or 85% of the campus voluntarily opened accounts on the system. The following issues and problems related to the system's management are discussed: Information Management, Censorship, Special Requests, Security, Encouraging Innovative Uses, and Training.
Simulation modeling for emergency medical service systems
Authors: W. H. Iskander
Venue: Proceedings of the 21st conference on Winter simulation (1989)

A simulation model was developed with the purpose of providing EMS planners and managers with a tool to help them in the planning of their operations and in their decision making role in general.The model was successfully tested on one of the seven EMS regions in the state of West Virginia. Policy changes were tested by running the model under different conditions, and measuring their impact on the performance of the EMS system. Policies investigated include the elimination and addition of squads, reallocation of vehicles, and changing the level of personnel training and preparedness.
A finite machine description of a lexical analysis using table look-up
Authors: D. Soda, G. W. Zobrist
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

A lexical analysis is described using a finite state machine to express the top level of the algorithm. The lexical analyzer exploits table lookup to facilitate the determination of tokens. The table lookup procedure alleviates the process of developing a conplicated set of construction rules.
Sparse matrix test problems
Authors: I. S. Duff, Roger G. Grimes, John G. Lewis
Venue: ACM Transactions on Mathematical Software (TOMS) (1989)

We describe the Harwell-Boeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. Our test set comprises problems in linear systems, least squares, and eigenvalue calculations from a wide variety of scientific and engineering disciplines. The problems range from small matrices, used as counter-examples to hypotheses in sparse matrix research, to large test cases arising in large-scale computation. We offer the collection to other researchers as a standard benchmark for comparative studies of algorithms. The procedures for obtaining and using the test collection are discussed. We also describe the guidelines for contributing further test problems to the collection.
Piriform (Olfactory) cortex model on the hypercube
Authors: J. M. Bower, M. E. Nelson, M. A. Wilson, G. C. Fox, W. Furmanski
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

We present a concurrent hypercube implementation of a neurophysiological model for the piriform (olfactory) cortex. The project was undertaken as the first step towards constructing a general neural network simulator on the hypercube, suitable both for applied and biological nets. The method presented here is expected to be useful for a class of complex and computationally expensive network models with long range connectivity and non-homogeneous activity patterns. The hypercube communication for the fully interconnected case is efficiently realized by the fold algorithm, constructed previously for problems in concurrent matrix algebra whereas the patchy activity is successfully load balanced by the scattered decomposition. We discuss also briefly other communication strategies, relevant for sparse and variable connectivities. Sample numerical results presented here were derived on the NCUBE hypercube at Caltech.
Compartmented Mode Workstation: Prototype Highlights
Authors: Jeffrey L. Berger, Jeffrey Picciotto, John P. L. Woodward, Paul T. Cummings
Venue: IEEE Transactions on Software Engineering (1990)

The primary goal of the MITRE compartmented mode workstation (CMW) project was to articulate the security requirements that workstations must meet to process highly classified intelligence data. As a basis for the validity of the requirements developed, aprototype was implemented which demonstrated that workstations could meet the requirements in an operationally useful manner while still remaining binary compatible with off-the-shelf software. The security requirements not only addressed traditional security concerns but also introduced concepts in areas such as labeling and the use of a trusted window management system. The CMW labeling paradigm is based on associating two types of security labels with objects: sensitivity levels and information labels. Sensitivity levels describe the levels at which objects must be protected. Information labels are used to prevent data overclassification and also provide a mechanism for associating with data those markings that are required for accurate data labeling, but which play no role in access control decisions. The use of a trusted window manager allows users to easily operate at multiple sensitivity levels and provides a convenient mechanism for communicating security information to users in a relatively unobtrusive manner.
A Bayesian Estimation Method for the Failure Rate of a Possibly Correct Program
Authors: G. Becker, L. Camarinopoulos
Venue: IEEE Transactions on Software Engineering (1990)

An extension of software reliability modeling is introduced to account for the possibility of programs which, after some debugging, contain no more errors. This is achieved by a repetitive application of the Bayes law, each time taking the posterior of the last step as a prior for the next one. A class of conjugate priors considerably facilitates this modeling. The resulting model includes an estimator for the probability that a program still contains errors, which is an upper bound for the failure probability.
GENAC: an automatic cell synthesis tool
Authors: C.-L. Ong, J.-T. Li, C.-Y. Lo
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

We present a solution to the layout problem of cell synthesis, which achieves multiple optimization objectives. In particular, we propose a new hierarchical method for fast and optimal placement of the transistors in a cell. The method minimizes the number of diffusion breaks, and allows a further pursuit of a secondary optimization objective, such as routing channel density. For cells with non-uniform transistor widths, the transistors are folded in such a way as to optimize a cost function which is a good approximation to the area of the final(compacted) layout of the cell. We also analyze the characteristic nature of routing in cell generation problem, and design an algorithm for doing routing over the transistors; such routing reduces the routing channel density in the central region of the cell. The routing in the central region is completed by a new channel router at, or near, the channel density. The algorithms are implemented in a system call GENAC. The input to GENAC is a transistor net list, describing the connectivity as well as the size and type of each transistor. The output is a synthesized layout of the cell in symbolic language.
An industry/academic partnership experiment: a course in artificial intelligence
Authors: Joyce Currie Little, Laurence J. Cooper, Barry C. Davis, John Alexander, Peter Joyce
Venue: ACM SIGCSE Bulletin (1988)

This paper describes an experimental undergraduate course in applications of artificial intelligence, sponsored by an Industry/Academic Partnership with Towson State University. The course was developed as one of several activities promoting interaction between faculty, students, and industry in the local metropolitan area. Towson State University is located in the metropolitan Baltimore, Maryland area, in close proximity to many companies involved in technological projects related to defense, automation, and aerospace endeavors. Three companies provided projects, leadership, and support to the course. The three projects were expert systems in the area of electronic diagnostics. This paper describes the course; the diagnostic systems projects done by the student teams; and the activities of students, faculty, and industry liaisons. An evaluation of the course included meetings with industry liaisons and faculty and a follow-up survey of the students. Consideration of prerequisites for improvement of the course led to discussions of overall curriculum revision. Suggestions for ways to improve the course are given. Departments interested in offering similar artificial intelligence project courses with industry participation may benefit from these experiences and recommendations.
A self-controlling interpreter for the relational production language
Authors: L. M.L. Delcambre, J. N. Etheredge
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

The Relational Production Language (RPL) solves the paradigm mismatch between expert systems and database systems by relying on the relational data model as the underlying formalism for an expert system. The result is a formally-defined production system language with immediate access to conventional databases. Working memory is modeled as a relational database and rules consist of a relational query on the left hand side (LHS) and database updates on the right hand side (RHS). This paper reports on the design of the RPL 1 0 prototype. The prototype directly executes RPL programs and capitalizes on the inherent advantages of the relational approach, particularly for intra-rule and inter-rule parallelism. By using a self-describing approach for representing the interpreter data structures, the interpreter is a self-controlling system that allows conflict resolution, error handling and a wide spectrum of software metrics to be explicitly specified using RPL meta-rules.
Improvement of complex arithmetic by use of double elements
Authors: C. B. Dunham
Venue: ACM SIGNUM Newsletter (1989)

It is shown that use of double precision in complex multiplication and division can significantly reduce rounding errors in these operations. Use of double precision accumulation of inner products in complex multiplication gives very close to the best possible error bound. Use of the same in complex division reduces error bounds, but a double precision divide is necessary to get close to the best possible bound.
Object-oriented programming of X Window System graphical user interfaces
Authors: William A. Rutiser
Venue: ACM SIGAPL APL Quote Quad (1990)

An object-oriented programming style facilitates programming graphical user interfaces with APL and an external processor interface to the X Window System interface library of C functions. Objects are represented by global nested variables. Methods are represented by APL functions whose names are stored in the objects.
Recognition of Handwritten Chinese Characters by Modified Hough Transform Techniques
Authors: F.-H. Cheng, W.-H. Hsu, M.-Y. Chen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Chinese characters are mapped from the spatial domain into the parametric one for stroke extraction, and the dynamic programming matching (DP matching) algorithm is applied to recognize Chinese characters. This method overcomes not only the problem of noise sensitivity in the local feature approach, but also the problem of being time consuming in the global feature approach. Results are presented for two experiments conducted for a database called ETL8, which contains 881 Chinese characters and 160 variations for each one, to prove the usefulness of the MHT and DP matching methods. An actual recognition rate of 94.5% was obtained for 351 Chinese characters in the ETL8.
Parallel discrete event simulation
Authors: R. M. Fujimoto
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This tutorial surveys the state of the art in executing discrete event simulation programs on a parallel computer. Specifically, we will focus attention on asynchronous simulation programs where few events occur at any single point in simulated time, necessitating the concurrent execution of events occurring at different points in time.We first describe the parallel discrete event simulation problem, and examine why it so difficult. We review several simulation strategies that have been proposed, and discuss the underlying ideas on which they are based. We critique existing approaches in order to clarify their respective strengths and weaknesses.
Approaches to specification-based testing
Authors: D. Richardson, O. O'Malley, C. Tittle
Venue: ACM SIGSOFT Software Engineering Notes (1989)

Current software testing practices focus, almost exclusively, on the implementation, despite widely acknowledged benefits of testing based on software specifications. We propose approaches to specification-based testing by extending a wide variety of implementation-based testing techniques to be applicable to formal specification languages. We demonstrate these approaches for the Anna and Larch specification languages.
A transaction-based approach to relational database specification
Authors: Serge Abiteboul, Victor Vianu
Venue: Journal of the ACM (JACM) (1989)

An operational approach to database specification is proposed and investigated. Valid database states are described as the states resulting from the application of admissible transactions, specified by a transactional schema. The approach is similar in spirit to the modeling of behavior by methods and encapsulation in object-oriented systems. The transactions considered are line programs consisting of insertions, deletions, and modifications, using simple selection conditions. The results concern basic properties of transactional schemas, as well as the connection with traditional constraint schemas. In particular, the expressive power of transactional schemas is characterized. Although it is shown that transaction-based specification and constraint-based specification are incomparable, constraints of practical interest that have corresponding transactional schemas are identified. The preservation of constraints by transactions is also studied.
Hidden surface removal for rectangles
Authors: M. Bern
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

A simple but important special case of the hidden surface removal problem is one in which the scene consists of n rectangles with sides parallel to the x and y-axes, with viewpoint at z = &infin; (that is, an orthographic projection). This special case has application to overlapping windows. An algorithm with running time &Ogr;(n log n log log n + k log n) is given for static scenes, where k is the number of line segments in the output. Algorithms are given for a dynamic setting (that is, rectangles may be inserted and deleted) that take time &Ogr;(log2 n log log n + k log2 n) per insert or delete, where k is now the number of visible line segments that change (appear or disappear). Algorithms for point location in the visible scene are also given.
American Scientists and Calculating Machines - From Novelty to Commonplace
Authors: Peggy A. Kidwell
Venue: IEEE Annals of the History of Computing (1990)

Over the period 1865-1920, individual fascination with new commercial computing devices transformed the reduction of scientific data in the United States. At Columbia University, arithmometers and Brunsviga calculating machines, purchased as novelties, were put to use by astronomers. At the New York Meteorological Observatory, comptometers offered a new way to average large numbers of records. By 1914, calculating machines like the Millionaire were an accepted tool at institutions like the National Bureau of Standards. Surviving artifacts and manuscripts from each of these.
Horizontal partitioning of PLA-based finite state machines
Authors: P. G. Paulin
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

We present a new form of partitioning of PLA-based FSMs that combines the advantages of traditional vertical PLA partitioning (i.e. via inputs and/or outputs) and counter embedding which consists of replacing the FSM state memories by a counter. Like the former, horizontal partitioning allows the reduction of the number of input and/or output columns in the PLAs resulting from the partition. Furthermore, the technique also reduces the total number of product terms, as in counter embedding techniques. This reduction is due to a decomposition of state transitions into two classes that are realized by two sets of logic. In this case however, a second PLA-based FSM is used in place of the counter. This results in area reductions of 30% to 60% (with respect to regular two-level logic minimization) for the benchmark examples presented.
Authenticating Edges Produced by Zero-Crossing Algorithms
Authors: J. J. Clark
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

It is shown that zero-crossing edge detection algorithms can produce edges that do not correspond to significant image intensity changes. Such edges are called phantom or spurious. A method for classifying zero crossings as corresponding to authentic or phantom edges is presented. The contrast of an authentic edge is shown to increase and the contrast of phantom edges to decrease with a decrease in the filter scale. Thus, a phantom edge is truly a phantom in that the closer one examines it, the weaker it becomes. The results of applying the classification schemes described to synthetic and authentic signals in one and two dimensions are given. The significance of the phantom edges is examined with respect to their frequency and strength relative to the authentic edges, and it is seen that authentic edges are denser and stronger, on the average, than phantom edges.
Efficient implementation of graph algorithms using contraction
Authors: Harold N. Gabow, Zvi Galil, Thomas H. Spencer
Venue: Journal of the ACM (JACM) (1989)

The (component) merging problem is a new graph problem. Versions of this problem appear as bottlenecks in various graph algorithms. A new data structure solves this problem efficiently, and two special cases of the problem have even more efficient solutions based on other data structures. The performance of the data structures is sped up by introducing a new algorithmic tool called packets. The algorithms that use these solutions to the component merging problem also exploit new properties of two existing data structures. Specifically, &Bgr;-trees can be used simultaneously as a priority queue and a concatenable queue. Similarly, F-heaps support some kinds of split operations with no loss of efficiency. An immediate application of the solution to the simplest version of the merging problem is an &Ogr;(t(m, n)) algorithm for finding minimum spanning trees in undirected graphs without using F-heaps, where t(m, n) = mlog2log2logdn, the graph has n vertices and m edges, and d = max(m/n, 2). Packets also improve the F-heap minimum spanning tree algorithm, giving the fastest algorithm currently known for this problem. The efficient solutions to the merging problem and the new observation about F-heaps lead to an &Ogr;(n(t(m, n) + nlogn)) algorithm for finding a maximum weighted matching in general graphs. This settles an open problem posed by Tarjan [ 15, p. 123], where the weaker bound of O(nm log (n2/m)) was conjectured.
The retrieval power of NFQL
Authors: Y. K. Ng, D. W. Embley
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

Forms are common and well understood in our modern society, especially in the office. They organize and structure communication according to well established and long standing convention. The Natural Forms Query Language (NFQL) takes advantage of these features to provide a &ldquo;natural&rdquo; communication language between computers and humans. Various facets of NFQL have been discussed elsewhere. In this paper we explore the retrieval power of NFQL. We explain why basic NFQL forms (which are essentially ordinary business forms) do not by themselves have enough retrieval power to be relationally complete. We then explain how to augment the notation to increase the retrieval power, and we provide an inductive proof to show that NFQL, as augmented, is relationally complete. Because additional notation may negatively effect usability, we discuss the pragmatics of adding new features. We explain how these features can be improved notationally, and argue that, with the improvements, we maintain the objective of being able to interpret standard forms, while increasing their retrieval power.
Synthesizing Robust Data Structures-An Introduction
Authors: Krishna Kant, A. Ravichandran
Venue: IEEE Transactions on Computers (1990)

A formal approach is presented for the analysis and synthesis of robust data structures. The entire data structure is viewed as a collection of data elements related via some attributes. The relationships are specified by a set of axioms in first-order logic. Faults in attributes invalidate some of the axioms. The invalidated axioms are used to detect and correct the faulty attributes. The authors show how detection and correction can be localized to small portions of the data structure, thereby allowing concurrent repair in several disjoint portions. This property makes local correction attractive for B-trees and other structures used in databases. They then show how the ideas developed for attaining structural integrity can be applied to achieve data integrity as well.
Representational and Denotational Semantics of Digital Systems
Authors: Raymond T. Boute
Venue: IEEE Transactions on Computers (1989)

The input/output transformation effected by digital systems can be considered as concrete realizations of abstract mathematical functions. The mappings between abstract functions and concrete realizations, if kept explicit throughout the formulation, constitute the necessary 'handles' (embodied by function definitions) for transformational reasoning about digital systems. Deductive reasoning can be factored out and reduced considerably. This is demonstrated by a functional recast of the major parts of digital systems theory. Since the emphasis of this study is on the method (transformational reasoning) rather than on new system concepts, examples are chosen from familiar areas. However, some new results are obtained.
FWEB: a literate programming system for Fortran8x
Authors: A. Avenarius, S. Oppermann
Venue: ACM SIGPLAN Notices (1990)

The new FWEB system applies the concept of literate programming to the FORTRAN8X language. Its design and implementation provided an opportunity to field-test WEB's applicability and provoked some reflections on its underlying concepts.