ppxscal/embedding_network huggingface dataset:
Some Early Computers for Aviators
Authors: Paul McConnell
Venue: IEEE Annals of the History of Computing (1991)

During the years between the World Wars aviation became established as a credible form of transport. Airmail delivery and passenger service gained acceptance with the civilian population, while aircraft for observation, transport, and combat roles were adopted by military and naval forces. A pre-requisite to routine air travel was the development of reliable methods of aerial navigation. In addition to new navigational techniques and instruments, numerous computational aids were developed to simplify the aerial navigator's work. Highly specialized computational aids were also developed to assist military aviators in performing aerial gunnery and bombardment. The following article describes a few of these devices, with special attention given to the mechanical analog computers used in military aircraft during World War II.
SPLASH: Stanford parallel applications for shared-memory
Authors: Jaswinder Pal Singh, Wolf-Dietrich Weber, Anoop Gupta
Venue: ACM SIGARCH Computer Architecture News (1992)

We present the Stanford Parallel Applications for Shared-Memory (SPLASH), a set of parallel applications for use in the design and evaluation of shared-memory multiprocessing systems. Our goal is to provide a suite of realistic applications that will serve as a well-documented and consistent basis for evaluation studies. We describe the applications currently in the suite in detail, discuss some of their important characteristics, and explore their behavior by running them on a real multiprocessor as well as on a simulator of an idealized parallel architecture. We expect the current set of applications to act as a nucleus for a suite that will grow with time.
Inheritance in word grammar
Authors: Norman M. Fraser, Richard A. Hudson
Venue: Computational Linguistics (1992)

This paper describes the central role played by default inheritance in Word Grammar, a theory of language knowledge and processing. A single formalism is used to represent knowledge at the levels of morphology, syntax, and semantics. A single rule of inference is used to inherit knowledge at all of these levels. This rule is distinctive in that it requires defaults to be explicitly overridden in the case of exceptions. The explicit overriding rule is used in syntax to achieve what other theories achieve by means of transformations, metarules, or lexical rules.
Software engineering and the game of monopoly
Authors: Raymond J. Toal, Philip M. Dorin
Venue: ACM SIGCSE Bulletin (1990)

We claim that a good basis for a course in Software Engineering is to have a group of students make a computer program for the game of Monopoly. We discuss our experiences in organizing and running such a course, and on the computer program that resulted from the most recent version of the course.
Some Combinatorial Aspects of Parallel Algorithm Design for Matrix Multiplication
Authors: Jong-Chuang Tsay, Sy Yuan
Venue: IEEE Transactions on Computers (1992)

Some combinatorial characteristics of matrix multiplication on regular two-dimensional arrays are studied. From the studies, the authors are able to design many efficient varieties of the cylindrical array and the two-layered mesh array for matrix multiplication. To design a cylindrical array for matrix multiplication, a systematic design procedure is proposed. In this design procedure, Latin square (a special type of matrix) plays an important role. To design a two-layered mesh array, it is found that there is a transformation procedure to transform a cylindrical array to a two-layered mesh array.
An overview of real-time issues and Ada
Authors: Pen-Nan Lee, William Nehman
Venue: ACM SIGAda Ada Letters (1991)

The Ada programming language (ANSI/MIL-STD-1815A) is the result of a design competition by the United States Department of Defense in response to the realization that billions of dollars was being spent annually on military' software, with the largest portion being spent for the maintenance of real-time and embedded systems. This paper provides an overview of several issues concerning real-time programming in general, and how they are addressed in Ada. These issues are: Scheduling, Interaction with Hardware, Concurrency, Dealing with Time, Priority Inversion, and Asynchronous Transfer of Control.
Combining objects and relations
Authors: Gottfried Razek
Venue: ACM SIGPLAN Notices (1992)

Whereas the object oriented paradigm is best suited for the modelling of self contained objects it is not suited for the modelling of relations between objects. For the logic oriented paradigm on the other hand the converse is true. This paper shows that objects and their relations can be modelled in an integrated way by combining both paradigms.
A lower bound for the dictionary problem under a hashing model
Authors: Rajamani Sundar
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A fundamental open question in data structures concerns the existence of a dictionary data structure that processes the operations in constant amortized time and uses space polynomial in the dictionary size. The complexity of the dictionary problem is studied under a multilevel hashing model that is based on A.C. Yao's (1981) cell probe model, and it is proved that dictionary operations require log-algorithmic amortized time jn this model. The model encompasses many known solutions to the dictionary problem, and the result is the first nontrivial lower bound for the problem in a reasonably general model that takes into account the limited wordsize of memory locations and realistically measures the cost of update operations. This lower bound separates the deterministic and randomized complexities of the problem under this model.
On-line maintenance of the four-components of a graph (extended abstract)
Authors: Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

Given a graph G with n vertices and m edges, a k-connectivity query for vertices v' and v" of G asks whether there exist k disjoint paths between v' and v". The authors consider the problem of performing k-connectivity queries for k
Suitability of datamodels as canonical models for federated databases
Authors: F. Saltor, M. Castellanos, M. García-Solaco
Venue: ACM SIGMOD Record (1991)

We develop a framework of characteristics, essential and recommended, that a data model should have to be suitable as canonical model for federated databases. This framework is based on the two factors of the representation ability of a model: expressiveness and semantic relativism. Several data models are analyzed with repect to the characteristics of the framework, to evaluate their adequacy as canonical models.
Real-time synchronization control in multimedia distributed systems
Authors: Li Li, A. Karmouch, N. D. Georganas
Venue: ACM SIGCOMM Computer Communication Review (1992)

Two basic synchronization problems are involved in the distributed multimedia systems. One of them is the simultaneous real-time data delivery. Simultaneous Real Time Data Delivery (SRTDD) refers to delivering multimedia data in different data streams belonging to the same time interval simultaneously. In this paper, an entire SRTDD control scheme for multimedia transmission is established. We propose a layered architecture which can be mapped to the OSI model to support the SRTDD control. The segment delivery protocols for real-time multimedia data streams are addressed. A practical segmentation method is also developed for real-time voice and video.
Orderable dimensions of visual texture for data display: orientation, size and contrast
Authors: Colin Ware, William Knight
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Vision research relating to the human perception of texture is briefly reviewed with a view to arriving at the principal dimensions of visual texture useful for data display. The conclusion is that orientation, size (1/spatial frequency), and contrast (amplitude) are the primary orderable dimensions of texture. Data displayed using these texture parameters will be subject to similar distortions to those found when color is used. Textures synthesized using Gabor function primitives can be modulated along the three primary dimensions. Some preliminary results from a study using Gabor functions to modulate luminance are presented which suggest that: perceived texture size difference are approximately logarithmic, a 5% change in texton size is detectable 50% of the time, and large perceived size differences do not predict small (just noticeable) size differences.
Report on the interact '90 workshop on education in HCI: transcending disciplinary and national boundaries
Authors: Marilyn M. Mantei, Thomas Hewett
Venue: ACM SIGCHI Bulletin (1991)

This report describes the discussions and outcomes of a workshop on education held on August 27, 1990, at the INTERACT' 90 Conference in Cambridge, England. The workshop and its outcomes are significant because of the nature of the attendees. Participants had developed or were developing a curriculum in HCI for each of their countries. Thus, the workshop brought together experts on HCI curriculum to explore the differences that each of their cultures and university systems would place upon the interpretation and presentation of HCI.
The concurrent language, Shared Prolog
Authors: Antonio Brogi, Paolo Ciancarini
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1991)

Shared Prolog is a new concurrent logic language. A Shared Prolog system is composed of a set of parallel agents that are Prolog programs extended by a guard mechanism. The programmer controls the granularity of parallelism, coordinating communication and synchronization of the agents via a centralized data structure. The communication mechanism is inherited from the blackboard model of problem solving. Intuitively, the granularity of the logic processes to be elaborated in parallel is large, while the resources shared on the blackboard can be very fined grained. An operational semantics for Shared Prolog is given in terms of a distributed model. Through an abstract notion of computation, the kinds of parallelism supported by the language, as well as properties of infinite computations, such as local deadlocks, are studied. The expressiveness of the language is shown with respect to the specification of two classes of applications: metaprogramming and blackboard systems.
An efficient and fault-tolerant solution for distributed mutual exclusion
Authors: Divyakant Agrawal, Amr El Abbadi
Venue: ACM Transactions on Computer Systems (TOCS) (1991)

In this paper, we present an efficient and fault-tolerant algorithm for generating quorums to solve the distributed mutual exclusion problem. The algorithm uses a logical tree organization of the network to generate tree quorums, which are logarithmic in the size of the network in the best case. Our approach is resilient to both site and communication failures, even when such failures lead to network partitioning. Furthermore, the algorithm exhibits a property of graceful degradation, i.e., it requires more messages only as the number of failures increase in the network. We describe how tree quorums can be used for various distributed applications for providing mutually exclusive access to a distributed resource, managing replicated objects, and atomically commiting a distributed transaction.
The standards factor
Authors: Pat Billingsley
Venue: ACM SIGCHI Bulletin (1990)

This year at CHI'90, Karen Rafnel of Texas Instruments and I hosted a Special Interest Group (SIG) meeting entitled "User Interface Standards for Windowing Systems". The session was very well attended, with at least 200 people present, and there was a high level of interaction among the participants. I interpret this degree of involvement to indicate considerable interest in this topic among SIGCHI members overall, or at least a lot of curiosity about what's going on.
Optimizing loops in database programming languages
Authors: Daniel F. Lieuwen, David J. DeWitt
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

Database programming languages like O2, E, and O++ include the ability to iterate through a set. Nested iterators can be used to express joins. We describe compile-time optimizations of such programming constructs that are similar to relational transformations like join reordering. Ensuring that the program's semantics are preserved during transformation requires paying careful attention to the flow of values through the program. This paper presents conditions under which such transformations can be applied and analyzes the I/O performance of several different classes of program fragments before and after applying transformations. The analysis shows that the transformations can significantly reduce the number of I/Os performed, even when both the initial and transformed programs use the same join method.
The Use of Background Knowledge in Decision Tree Induction
Authors: Marlon Núñez
Venue: Machine Learning (1991)

At present, algorithms of the ID3 family are not based on background knowledge. For that reason, most of the time they are neither logical nor understandable to experts. These algorithms cannot perform different types of generalization as others can do (Michalski, 1983&semi; Kodratoff, 1983), nor can they can reduce the cost of classifications. The algorithm presented in this paper tries to generate more logical and understandable decision trees than those generated by ID3-like algorithms&semi; it executes various types of generalization and at the same time reduces the classification cost by means of background knowledge. The background knowledge contains the ISA hierarchy and the measurement cost associated with each attribute. The user can define the degrees of economy and generalization. These data will influence directly the quantity of search that the algorithm must undertake. This algorithm, which is an attribute version of the EG2 method (N&uacute;&ntilde;ez, 1988a, 1988b), has been implemented and the results appear in this paper comparing them with other methods.
A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks
Authors: John K. Antonio, Garng M. Huang, Wei K. Tsai
Venue: IEEE Transactions on Computers (1992)

A distributed algorithm is presented that can be used to solve the single-destination shortest path (SDSP) problem or the all-pairs shortest path (APSP) problem for a class of clustered data networks. The network graph is assumed to be characterized with a balanced hierarchically clustered (BHC) topology. The BHC topology is introduced in this paper and is shown to be a realistic characterization for a large class of interconnected data networks. For certain types of BHC topologies, the SDSP problem can be solved with computation and communication time complexities of O(log n), assuming one processor is available at each of the n number of nodes. Assuming p processors are available at each node, computation and communication time complexities of O((n/p) log n) and O(n log n) are achievable, respectively, for solving the APSP problem. It is also shown that the algorithm converges in an asynchronous environment.
Experiments with a component theory of probabilistic information retrieval based on single terms as document components
Authors: K. L. Kwok
Venue: ACM Transactions on Information Systems (TOIS) (1990)

A component theory of information retrieval using single content terms as component for queries and documents was reviewed and experimented with. The theory has the advantages of being able to (1) bootstrap itself, that is, define initial term weights naturally based on the fact that items are self relevent; (2) make use of within-item term frequencies; (3) account for query-focused and document-focused indexing and retrieval strategies cooperatively; and (4) allow for component-specific feedback if such information is available. Retrieval results with four collections support the effectiveness of all the first three aspects, except for predictive retrieval. At the initial indexing stage, the retrieval theory performed much more consistantly across collections than croft's model and provided results comparable to Salton's tf*idf approach. An inverse collection term frequency (ICTF) formula was also tested that performed much better than the inverse document frequency (IDF). With full feedback retrospective retrieval, the component theory performed substantially better than Croft's, because of the highly specific nature of document-focused feedback. Repetitive retireval results with partial relevance feedback mirrored those for the retrospective. However, for the important case of predictive retrieval using residual ranking, results were not unequivocal.
Project START
Authors: Vadim E. Kotov
Venue: Communications of the ACM (1991)

When the Japanese Fifth Generation Computer project was launched in the early 1980s, data-processing professionals along with the world press were quick to appreciate the strategic goals and background ideas of the project which has since been referred to as &ldquo;Japan's challenge.&rdquo; Soon, next generation computing projects and programs, like MCC in the U.S., ESPRIT in Europe and ALVEY in Great Britain emerged as a response to this challenge.
Implementing Sequential Machines as Self-Timed Circuits
Authors: Ilana David, Ran Ginosar, Michael Yoeli
Venue: IEEE Transactions on Computers (1992)

A self-timed finite state machine (FSM) is described. It is based on a formally proven, efficient implementation of self-timed combinational logic and a self-timed master-slave register. Temporal behavioral constraints are formalized, and the system is shown to abide by them. The synthesis method is algorithmic and serves as an automatic compiler of self-timed FSMs. The specification of the FSM is given by a state table, similar to that of synchronous machines. The circuit operates according to a sequence of events that replaces the role of the central clock in the synchronous FSM. The inputs and outputs of the circuit are double-rail (or ternary) and the circuit produces a completion signal. The method is compared with other approaches.
Testability of Software Components
Authors: Roy S. Freedman
Venue: IEEE Transactions on Software Engineering (1991)

The concept of domain testability of software is defined by applying the concepts of observability and controllability to software. It is shown that a domain-testable program does not exhibit any input-output inconsistencies and supports small test sets in which test outputs are easily understood. Metrics that can be used to assess the level of effort required in order to modify a program so that it is domain-testable are discussed. Assessing testability from program specifications and an experiment which shows that it takes less time to build and test a program developed from a domain-testable specification than a similar program developed from a nondomain-testable specification are also discussed.
Mixed signals about social responsibility
Authors: Ronni Rosenberg
Venue: Communications of the ACM (1991)

What is the appropriate role of computer professionals in determining how their work is used? Should they consider the societal implications of their work?
Organized C: A unified method of handling data in CAD algorithms and databases
Authors: Jiri Soukup
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper describes a data management package called Organized C. The main feature of this package are simple and compact declarations which translates organizations into the definition of classes, pointers, and access functions. This method adds a new dimension to the inheritance mechanism, works with both C and C++, and is specifically useful for CAD software which often deals with large and complex data. It also leads to a unified coding style for algorithms and memory resident databases. Practical experience indicates that Organized C dramatically improves software quality and productivity in both C and C++: coding and debugging three times faster is common, while the run-time performance and memory remain as good as that of hand coded C. Resulting programs are strongly typed, protected against dangling pointers and, because of their clear organization, are much easier to maintain.
Logic of knowledge and belief in the design of an integrity kernel for an office information system (abstract)
Authors: J. F. Peters, S. Ramanna, E. A. Unger
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

An integrity specification language (ISL) based upon a form of interval temporal logic is defined and the framework for a logic of knowledge and beliefs about data integrity is developed. The intended purpose of ISL is for the design of integrity kernels in an office information system in which the dynamic evaluation of data integrity based upon partial knowledge and informed judgement relative to update request by clients, is required. ISL itself is described in an earlier paper and summarized in this paper. Beliefs in ISL are specified with a form of interval temporal logic and provide an extension of the Moser technique for formulating beliefs. The Clark and Wilson model designed to prevent fraudulent and erroneous data modification is subsumed. An integrity Characteristic Tuple (ICT) incorporates the notions of correctness, completeness, quality, timeliness and confidence is associated with each Constrained Data Item (CDI). An integrity system which includes extensions of the concept and function of the server architecture as defined in the Multimedia Office Server (MULTOS) project, is given. An integrity kernel is defined which incorporates an algorithm for the detection of faults in presumptions about data integrity based upon knowledge and beliefs. A simplified integrity kernel is specified formally and a corresponding sample server-client session is provided.
Software engineering and undergraduate computing curricula
Authors: Stuart H. Zweben
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

Most graduates of baccalaureate computing programs (at least in the United States) take jobs in the computing profession immediately upon graduation. These jobs generally involve software development or maintenance activities, and therefore demand certain software engineering skills and knowledge. It appears, however, that typical undergraduate computing programs are at present inadequately preparing their students in the area of software engineering. This was in evidence at the 1991 International Conference on Software Engineering, in comments made at plenary sessions and in a special workshop on directions in software engineering education. It is also evidenced by recent attempts to encourage development of software engineering programs at the undergraduate level, separate from those in computer science or computer engineering. The purpose of this panel is to explore the following question: &ldquo;What software engineering knowledge and skills should be required in a typical baccalaureate computing program, assuming the program is preparing its graduates for immediate entry into the computing profession?&rdquo; In addressing this question, the panel will consider the recent report of the ACM/IEEE-CS Joint Curriculum Task Force, proposed software engineering curricula for undergraduates, and accreditation criteria.