ppxscal/embedding_network huggingface dataset:
The next generation of internetworking
Authors: Gurudatta M. Parulkar
Venue: ACM SIGCOMM Computer Communication Review (1989)

This paper describes a research effort concerned with the design of the next generation of internet architecture, which has been necessitated by two emerging trends. First, there will be at least a few orders of magnitude increase in data rates of communication networks in the next few years. For example, researchers are already prototyping networks with data rates of up to a few hundred Mbps, and are planning networks with data rates up to a few Gbps. Second, researchers from all disciplines of science, engineering, and humanities plan to use the communication infrastructure to access widely distributed resources in order to solve bigger and more complex problems. These trends provide new challenges and opportunities to researchers in the communication field. One such challenge is the design of what we call the very high speed internet (VHSI) abstraction which can help efficiently support guaranteed levels of performance for a variety of applications, and can cope with the ever increasing diversity of underlying networks with rapidly growing user population and needs. Our strategy towards achieving this ambitious goal comprises the following: bull; Design, specification, and prototype implementation of a novel multipoint congram-oriented service that can work well with connection-oriented and datagram high speed networks, can provide variable grade service on a need basis to its applications, and can provide adequate reconfigurability to deal with survivability requirements due to network failures. bull; Design and implementation of gateway architectures that can support data rates of a few hundred Mbps, can interface with diverse networks, and can implement the congram-oriented service without becoming a performance bottleneck. bull; Development of analytical and simulation models to evaluate important tradeoffs associated with the design of a congram-oriented protocol, the resource management on diverse networks, and the design of new gateway architectures.
Optimization of large join queries: combining heuristics and combinatorial techniques
Authors: A. Swami
Venue: ACM SIGMOD Record (1989)

We investigate the use of heuristics in optimizing queries with a large number of joins. Examples of such heuristics are the augmentation and local improvement heuristics described in this paper and a heuristic proposed by Krishnamurthy et al. We also study the combination of these heuristics with two general combinatorial optimization techniques, iterative improvement and simulated annealing, that were studied in a previous paper. Several interesting combinations are experimentally compared. For completeness, we also include simple iterative improvement and simulated annealing in our experimental comparisons. We find that two combinations of the augmentation heuristic and iterative improvement perform the best under most conditions. The results are validated using two different cost models and several different synthetic benchmarks.
Simulated real-time intersection signal control
Authors: E. C.-P. Chang
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper describes an experiment applying Artificial Intelligence and Expert Systems design to simulate signalized intersection control. The system applies traffic engineer's heuristic control strategies on the IBM PC/XT/AT based microcomputers. This study examines the feasible approaches in automating the intersection signal control for efficient operation. Essentially, a one-intersection simulated signal control environment has been constructed through two interconnected IBM PC/XT/AT, or compatible microcomputers, which automatically examine the proper actions needed to handle the variable, synthetic input traffic demands. This advanced microcomputer-aided design can also be expanded in the future for other real- time systems to monitor and control current and predicted traffic conditions.
Tradeoffs between communication and space
Authors: T. Lam, P. Tiwari, M. Tompa
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

This paper initiates the study of communication complexity when the processors have limited work space. The following tradeoffs between number C of communications steps and space S are proved: For multiplying two n &times; n matrices in the arithmetic model with two-way communication, CS = &THgr;(n2). For convolution of two degree n polynomials in the arithmetic model with two-way communication, CS = &THgr;(n2). For multiplying an n &times; n matrix by an n-vector in the Boolean model with one-way communication, CS = &THgr;(n2). In contrast, the discrete Fourier transform and sorting can be accomplished in &Ogr;(n) communication steps and &Ogr;(log n) space simultaneously, and the search problems of Karchmer and Wigderson associated with any language in NCk can be solved in &Ogr;(logk n) communication steps and &Ogr;(logk n) space simultaneously.
Utilizing Multidimensional Loop Parallelism on Large Scale Parallel Processor Systems
Authors: C. D. Polychronopoulos, David J. Kuck, David A. Padua
Venue: IEEE Transactions on Computers (1989)

Program parallelism and processor allocation issues for parallel processor systems are discussed. Optimal processor assignment algorithms are presented for simple and complex nested parallel loops. These processor assignment schemes can be used by the compiler to perform static processor allocation to multiply nested parallel loops. Speedup measurements for EISPACK and IEEE DSP subroutines that result from the optimal assignment of processors to parallel loops are also presented. These measurements indicate that optimal processor assignments result in almost linear speedups on parallel processor machines with a few tens of processes and significantly high speedups for machines with hundreds or thousands of processors.
Process oriented programming
Authors: B. Magnusson
Venue: ACM SIGPLAN Notices (1989)

This paper argues that co-routines are related to concurrent processes. By adding interrupt mechanisms languages containing co-routine mechanisms can be used for concurrency. It is also the intention to bring some of the terminology used in Simula constructs to the attention of others dealing with concurrency in object oriented languages. The use of processes to avoid global states in user interfaces are shortly commented upon.
Practical programmer: software teams
Authors: Marc Rettig
Venue: Communications of the ACM (1990)

I have often heard the phrase, &ldquo;We see what we know.&rdquo; As technicians, we concentrate on technical ways to manage complexity: abstraction, design techniques, high-level languages, and so on. That is what we know best. But when the tale is told of a project that failed, the blame is often laid not on technical difficulties, but on management and interpersonal problems.In the last six months, I have seen firsthand how attention to the social organization of a software team can make a big difference in the success of a development project. I work in a &ldquo;Research and Development&rdquo; group. &ldquo;Research&rdquo; means that some aspects of the project are experimental&mdash;we do not know for sure what is going to work. &ldquo;Development&rdquo; means we are expected to produce high-quality software for real users. So while we want to encourage creative thought, we must pay heed to the lessons of commercial software developers in quality assurance, testing, documentation, and project control.Our all-wise project leader decided we also needed to pay heed to the lessons of sociology. In particular, we began to apply the ideas found in Larry Constantine's work on the organization of software teams. Our efforts have resulted in a team that is productive, flexible, and comfortable. I thought these qualities are unusual enough to merit a column on the subject.
Center for coordination science, MIT
Authors: T. W. Malone
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind (1989)

The costs and capabilities of information technology are improving by orders of magnitude every decade, but we are only beginning to understand the opportunities these changes provide for new ways of organizing human activity and new kinds of technology to help people work together. The new MIT Center for Coordination Science conducts multidisciplinary research to help understand these possibilities better. Research in the center draws upon many parts of MIT and ongoing projects in a variety of fields, including: computer science, organization theory, psychology, information systems, management science, and economics.We believe that a powerful source of intellectual leverage on questions about how groups of people can use computers will result from a better understanding of the nature of coordination. Therefore, work in the center focuses on how coordination can occur, both with and without technology. The center includes projects in the following areas:Coordination technology - designing and studying innovative computer systems that help people work together in small or large groups (e.g., &ldquo;groupware&rdquo;, &ldquo;computer-supported cooperative work&rdquo;, and &ldquo;electronic markets&rdquo;). Organizational structures and information technology - observing, analyzing, and predicting how information technology affects organizational structures and processes and how organizations can use information technology more effectively.Coordination theory - developing and testing theories about how the activities of separate actors can be coordinated. These theories are expected to draw upon and illuminate coordination among people and also coordination in distributed or parallel processing computer systems.In addition to research projects in these areas, the Center also sponsors seminars, workshops, working papers, and conferences.
Toward a computational theory of arguing with precedents
Authors: K. D. Ashley
Venue: Proceedings of the 2nd international conference on Artificial intelligence and law (1989)

This paper presents a partial theory of arguing with precedents in law and illustrates how that theory supports multiple interpretations of a precedent. The theory provides succinct computational definitions of (1) the most persuasive precedents to cite in the principal argument roles and (2) the most salient aspects of the precedents to emphasize when citing them in those roles. An extended example, drawn from the output of the HYPO program, illustrates the range of different descriptions of the same precedent that are supported by the theory. Each description focuses on different salient aspects of the case depending on the argument context.
Repositioning the information systems management function: Implications for information systems personnel
Authors: N. S. Levinson
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

One of the most major changes in the information systems management arena today is the repositioning of the information systems management function in large organizations. A study of sixty-seven large organizations indicates a repositioning involving a number of dimensions. With these changes, a whole new set of roles and skills for information systems managers are evolving. There is a critical need to examine the challenges stemming from these new roles and skills and provide a framework for the effective management of information systems personnel as we approach the nineties.
A smalltalk implementation of an intelligent operator's associate
Authors: Kenneth S. Rubin, Patricia M. Jones, Christine M. Mitchell, Theodore C. Goldstein
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1988)

This paper describes the use of Smalltalk in the design and implementation of OFMspert. OFMspert is an architecture for an intelligent operator's associate. In order to verify the architecture, an OFMspert was implemented to act as an assistant to an operator of a NASA satellite ground control system. OFMspert is a large system that utilizes a Smalltalk implementation of a knowledge-based problem solving method known as the blackboard architecture. The entire system was designed and implemented in Smalltalk/V&trade; and later ported to the Smalltalk-80&trade; system. The object-oriented paradigm in general, and Smalltalk&Dagger; in particular, greatly facilitated the rapid design and implementation of this system. This paper summarizes the OFMspert architecture, emphasizing its implementation in an object-oriented paradigm.
Collection from the left
Authors: M. R. Vaughan-Lee
Venue: Journal of Symbolic Computation (1990)

The heart of the nilpotent quotient algorithm for computing in finite p-groups is a collection algorithm for collecting semigroup words on the generators of the group into normal form. In applications of the nilpotent quotient algorithm almost all the computing time is spent doing collections, and so very sophisticated collection algorithms have been developed. A number of researchers recently have started investigating a variant of the algorithm known as collection from the left. A version of collection from the left is described in this article. It is designed as an alternative to the Havas-Nicholson algorthm for collection from the right which is incorporated in the Canberra version of the nilpotent quotient algorithm. Indications are that for many applications it runs faster than the Havas-Nicholson algorithm.
A Buffer-Based Method for Storage Allocation in an Object-Oriented System
Authors: Carsten Vogt
Venue: IEEE Transactions on Computers (1990)

As some object-oriented computing systems support the object type buffer by hardware, it is reasonable to base their free storage management on a set of buffers, each containing free storage blocks of a specific length. Then memory space can normally be allocated and deallocated by simple buffer read and write operations. More complex routines have to be executed only when a buffer full or buffer empty exception is raised. Their task is to clear a buffer position or to insert a storage descriptor into the buffer, respectively. An algorithm that handles such exceptions by splitting and recombination of free blocks and relocation of objects is described. The algorithm is tuned by a set of parameters that specify the amount of descriptors the buffers may hold immediately after exception handling. As a consequence, each buffer receives a moderate number of descriptors, so that the probability of further exceptions is reduced. Moreover, the parameters control the tradeoff between relocation costs and resulting storage fragmentation. The performance of the algorithm is evaluated by an analytical and a simulation model, and methods to find optimal parameter values are described.
Further results on the security of partitioned dynamic statistical databases
Authors: Mary McLeish
Venue: ACM Transactions on Database Systems (TODS) (1989)

Partitioning is a highly secure approach to protecting statistical databases. When updates are introduced, security depends on putting restrictions on the sizes of partition sets which may be queried. To overcome this problem, attempts have been made to add &ldquo;dummy&rdquo; records. Recent work has shown that this leads to high information loss. This paper reconsiders the restrictions on the size of partitioning sets required to achieve a high level of security. Updates of two records at a time were studied earlier, and security was found to hold if the sizes of the partition sets were kept even. In this paper an extended model is presented, allowing very general updates to be performed. The security problem is thoroughly studied, giving if and only if conditions. The earlier result is shown to be part of a corollary to the main theorem of this paper. Alternatives to adding dummy records are presented and the practical implications of the theory for the database manager are discussed.
The Delay Due to Dynamic Two-Phase Locking
Authors: Carl S. Hartzman
Venue: IEEE Transactions on Software Engineering (1989)

An analytic formula for the delay due to two-phase locking is developed in terms of mean values for the input parameters using an open queuing network model in equilibrium. The results of simulations, using various realistic probability distributions governing the number of locks that transactions request, are presented to validate the formula. Reasonably good accuracy is achieved for gamma distributions over a wide range of parameter settings. The simulations also provided evidence that the rate of deadlock, often disregarded in the literature, can be high in certain heavily utilized databases.
An experimental analysis of the performance of fourth generation tools on PCs
Authors: Victor M. Matos, Paul J. Jalics
Venue: Communications of the ACM (1989)

The performance of several Fourth Generation Language (4GL) tools is analyzed empirically and compared with equivalent programs written in the third generation COBOL programming language. A set of performance benchmarks consisting of thirteen separate functions is presented which encompasses the areas of simulating the operators of the relational algebra, accessing records in the database, and updating the database. This serves as a baseline for comparing the various 4GL systems.
What to look for in a workstation
Authors: C. Janton, K. W. Watkins
Venue: Proceedings of the 17th annual ACM SIGUCCS conference on User Services (1989)

An overwhelming amount of information about new technology is flooding the computing community on many fronts. The rate of change in available products and features makes decisions about acquiring computing technology a large and complex task, whether the equipment in question is a supercomputer or a workstation. This discussion is addressed to those shopping for workstations, who often face the particular challenge of combining in one person the roles of user, buyer, and support technician for the machine. To help in these decisions, you can read trade journals, advertisements, and vendor literature; attend shows and conferences; and observe a variety of technologies in action, in colleagues' offices and product demonstrations. However, the messages these sources present are wide-ranging, possibly confusing, and often inconsistent. The series of questions that follows can help you develop a coherent description of your needs and make useful comparisons among the options for fulfilling them. Few if any users discover a workstation ideal for their purposes in all respects. Generally you must compromise on one factor to get something you need more in another. Weigh the relative importance of the factors in your decision, thinking about long-term satisfaction as well as immediate concerns. You must live with your decision for some time after you make it. Look for answers to these questions from the consultants available at your institution, users' groups, the vendors of the machines under consideration and their competitors, and anyone else with a stake in your computing environment above all, your colleagues. It is often best to use the same kind of workstation as your colleagues and collaborators, to avoid problems with incompatible programs and data formats. Thus, if your colleagues strongly favor a particular computer, and you do not foresee wanting to perform tasks which that machine cannot handle, your decision process may be quite simple.
Knowledge-based monitoring and control: an approach to understanding behavior of TCP/IP network protocols
Authors: B. L. Hitson
Venue: Symposium proceedings on Communications architectures and protocols (1988)

Complex, dynamic, and evolving network environments present difficult challenges for monitoring and control. We have encoded some of the expertise of human networking experts into a knowledge-based system that uses production rules and opportunistic scheduling, and have been using this system to better understand the behavior of the TCP/IP protocols and the applications that use them. Novel aspects of this research include understanding how to encode knowledge from this domain, and how to reason efficiently on real networking problems. The prototype system&mdash;KNOBS/TCP&mdash;can correctly identify many common problems that network experts would normally be required to find (e.g., improper or inefficient retransmission and ACK strategies, silly-window-syndrome, a subset of reset and connection closing anomalies, and basic problems with auxiliary protocols such as address resolution, and routing). Preliminary measurements indicate that the resulting system is reasonably fast and will scale well. In some important test cases, speedup of two orders of magnitude over analogous manual and partially automated techniques has been observed.
A case study of CSCW in a dispersed organization
Authors: R. P. Carasik, C. E. Grantham
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

Pacific Bell conducted a trial of The Coordinator, a tool for computer-supported cooperative work. The trial group had diverse job functions and was dispersed across a variety of geographical locations and computing environments. The trial attempted to both measure the effectiveness of The Coordinator as a communications tool and to evaluate the speech act communications paradigm on which it is based. Only the first of these two goals was realized. Changes in subjects' cognition were assessed using a series of semantic differential scales. One negative cognitive shift was supported by the data. However, the anecdotal evidence was far more negative, suggesting that the experimental methodology be enhanced to include measurement of affective dimensions of group dynamics. Implementation and support for cooperative work systems were found to be more difficult than anticipated. The test group was not convinced that The Coordinator offered functionality that was worth the effort involved in learning to use the product. An improved interface, more flexible terminology, and better implementation support is needed for successful installation of The Coordinator, or similar products.
Skilled financial planning: the cost of translating ideas into action
Authors: F. J. Lerch, M. M. Mantei, J. R. Olson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Wings for the mind (1989)

We use GOMS models to predict error rates and mental times for translating financial concepts into equations in two widely used interface representations. The first of these, common to spreadsheet packages, is characterized by non-mnemonic naming and absolute referencing of variables. The second, common to non-procedural command-driven software, is characterized by mnemonic naming conventions and relative referencing of variables. These predictions were tested in an experiment using experienced financial analysts. Although the interface that allows mnemonic and relative names (called keyword) takes longer overall, it produces seventy-five percent fewer simple errors and requires less mental effort. Given the overall serious cost of errors in financial models, we conclude that interfaces having the keyword representation are far superior.