ppxscal/embedding_network huggingface dataset:
A Fast 1-D Serial-Parallel Systolic Multiplier
Authors: I.-C. Wu
Venue: IEEE Transactions on Computers (1987)

Based on the modified Booth's algorithm, a fast 1-D serial- parallel systolic multiplier is designed for multiplying two's complement numbers. The circuit with countercurrent data flow pattern accepts the multiplicand serially, the multiplier in parallel, and outputs the product serially. It requires a complementer and N/2 cells, each of which contains a ripple-carry adder and some gates, where N is restricted to even. The number of clocks required to multiply an n-bit (n = N) multiplier and an m-bit multiplicand is equal to n + m - 1, and independent of the circuit size N.
The rational, the pragmatic and the inquiry process: The social study of information- communication systems
Authors: Murray Turoff
Venue: ACM SIGCAS Computers and Society (1986)

When dealing with human communications and the use of technology to support this process, it is impossible to divorce the human elements from the technological ones. There is no fine boundary of measurable variables that can be established to draw the line along which we can look at clear cut cause and effect relationships in either direction across that boundary. Any attempt to make either the social system or the technological system the independent or dependent variable is only a short term artifice that might very well give the wrong indicators of what is happening. Once this premise is accepted, one is led to the necessity of viewing the introduction of any new communication technology as a series of incremental and evolutionary experiments on a total system. Whether consciously or unconsciously done, the people involved, the social relationships, and the technology are all design elements for the experiment. One cannot apply reductionist methods to the social studies of this area."Society is like a lawn, where every roughness is smoothed, every bramble eradicated, and where the eye is delighted by the smiling verdure of a velvet surface. He, however, who would study nature in its wildness and variety, must plunge into the forest, must explore the glen, must stem the torrent, and dare the precipice."--Washington irving
Computer technology and jobs: an impact assessment model
Authors: Ron Weber
Venue: Communications of the ACM (1988)

A model is proposed that associates the impact of computer technology on a job, with the set of underlying characteristics that describe the activities performed on the job. An empirical test of the model has been undertaken. One thousand and thirty-five experts assessed the impact of computer technology that they believed would occur on 306 jobs over a three-year period. Job characteristics data was obtained from prior analyses of the jobs, using the Position Analysis Questionnaire (PAQ). Six job dimensions derived from analysis PAQ data were significant predictors of the technological impact ratings provided by the experts: engaging in physical activities; being aware of the work environment; performing clerical-related functions; working in an unpleasant or hazardous environment; performing service-related activities; and performing supervising, directing, and estimating functions.
An inexpert system for system development
Authors: E.D. Ought
Venue: ACM SIGCPR Computer Personnel (1987)

This paper explores the concept of inexpert systems which accumulate ignorance and misunderstanding. Capitalizing on the work of N. Worthy and N. Nowen (1985), the idea of an intelligence-avoiding system is applied to a number of common hard problems, formost among which is the development of accounting systems by trained COBOL programmers.
Optimal precision in the presence of uncertainty
Authors: J Y Halpern, N Megiddo, A A Munshi
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

We consider the problem of achieving coordinated actions in a real-time distributed system. In particular, we consider how tightly processors can be guaranteed to perform a particular action, in a system where message transmission is guaranteed, but there is some uncertainty in message transmission time. We present an algorithm to achieve optimal precision in arbitrary networks.
Document architecture and text formatting
Authors: Arno J. H. Peels, Norbert J. M. Janssen, Wop Nawijn
Venue: ACM Transactions on Information Systems (TOIS) (1985)

The formalization of the architecture of documents and text formatting are the central issues of this paper. Besides a fundamental and theoretical approach toward these topics, an overview is presented of the COBATEF system. The COBATEF system is a context-based text formatting system, for which a software, as well as a hardware, implementation is available. A unique feature of the system is its automatic text-element recognition mechanism, which is context based and consequently takes advantage of the implicit structure of text. A predefined layout for each type of text element then opens the way for a fully automatic text-processing system in which user control information can be reduced to an absolute minimum.
Mathematical laboratories: a new power for the physical and social sciences
Authors: Glen J Culler
Venue: Proceedings of the ACM Conference on The history of personal workstations (1986)

The concept of a mathematical laboratory has been developing throughout the lifetime of computers. The capabilities made available in systems supporting these laboratories range from symbolic integration, differentiation, polynomial and power series manipulation; through mathematical simulation; to direct control experimental systems. About 1961 two trends, one toward what has become known as on-line computation, the other toward time sharing gained enough recognition to develop national support and subsequently have come to represent what is now known as modern computation. An on-line system provides interactive facilities by which a user can exert deterministic influence over the computation sequence; a time-sharing system provides a means by which partial computations on several different problems may be interleaved in time and share facilities according to predetermined sharing algorithms. For reasons of economy it is hard to put a single user in direct personal control (on-line, that is) of a large scale computer. It is equally or more difficult to get adequate computation power for significant scientific applications out of any small scale economical computer. Consequently, on-line computing has come to depend upon time-sharing as its justifiable mode of implementation. On the other hand, valuable on-line applications have formed one of the major reasons for pushing forward the development of time-sharing systems. At present, both efforts have reached such a stage of fruition that one finds many systems incorporating selective aspects of the early experimental systems of both types. In this chapter, we will bring out some of the key features of highly interactive direct control systems that have implications for continuing design effort aimed at furthering the development of experimental mathematical laboratories. We then present a brief description of the foundations of an existing facility at the University of California at Santa Barbara and illustrate its use in a typical application. Finally, we discuss some extension of the system which will provide deeper power for future experimental applications.
Computerized performance monitoring systems: use and abuse
Authors: R. H. Irving, C. A. Higgins, F. R. Safayeni
Venue: Communications of the ACM (1986)

An exploratory study of computerized performance monitoring and control systems reveals both positive and negative effects. Responses of 50 clerical workers from 2 organizations with computerized monitoring were compared to 94 individuals from 3 organizations in similar jobs without computerized monitoring. The results indicate that computerized monitoring is associated with perceived increases in office productivity, more accurate and complete assessment of workers' performance, and higher levels of organizational control. Respondents indicate that managers overemphasize the importance of quantity and underemphasize the importance of quality in evaluating employee performance. Workers perceive increased stress, lower levels of satisfaction, and a decrease in the quality of their relationships with peers and management as a consequence of computerized monitoring. The relevance of existing models of performance monitoring is examined in light of these findings.
Fast algorithms for n-dimensional restrictions of hard problems
Authors: F Meyer auf der Heide
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

Let M be a parallel RAM with p processors and arithmetic operations addition and subtraction recognizing L &sub; Nn in t steps. Then L can be recognized by a (sequential!) linear search algorithm (LSA) in &Ogr;(n4(log(n) + t + log(p))) steps. Thus many n-dimensional restrictions of NP-complete problems (binary programming, traveling salesman problem, etc.) and even that of the uniquely optimum traveling salesman problem, which is &Dgr;P2-complete, can be solved in polynomial time by an LSA. This result generalizes the construction of a polynomial LSA for the n-dimensional restriction of the knapsack problem previously shown by the author, and destroys the hope of proving nonpolynomial lower bounds for any problem which can be recognized by a PRAM as above with 2poly(n) processors in poly(n) time.
An incremental algorithm for software analysis
Authors: Martin Carroll, Barbara G Ryder
Venue: ACM SIGPLAN Notices (1987)

In programming environments aimed at &ldquo;industrial strength&rdquo; software development, there is a need for software tools which facilitate both design and maintenance. These tools should encourage experimentation with different system configurations which enable designers to a priori estimate the associated system complexity and judge the ease of accommodating enhancements. Maintainers should be able to check straightforwardly the ramifications of system changes due to enhancements or &ldquo;bug fixes&rdquo;. With interprocedural data flow information about the definition and use of global variables and parameters in a software system, tools can be built to perform these tasks. For large, complex systems, efficient methods for interprocedural analysis are necessarily incremental, as a software system is a dynamically evolving entity. Incremental algorithms update current information about a system in response to a change rather than re-calculating the information by re-analyzing the entire system. This paper reports our development of a general purpose incremental data flow analysis algorithm, which is applicable to both intraprocedural and interprocedural domains. It is based on interval analysis, a technique whose observed performance is linear for most programs; under reasonable assumptions about program flow graphs this linearity can be verified [20].
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
Authors: J S Vitter, R A Simons
Venue: IEEE Transactions on Computers (1986)

Previous theoretical work in computational complexity has suggested that any problem which is log-space complete for P is not likely in NC, and thus not parallelizable. In practice, this is not the case. To resolve this paradox, we introduce new complexity classes PC and PC* that capture the practical notion of parallelizability we discuss in this paper. We show that foqur complete problems for P (nonsparse versions of unification, path system accessibility, monotone circuit value, and ordered depth-first search) are parallelizable. That is, their running times are O(E + V) on a sequential RAM and O(E/P + V log P) on an EXCLUSIVE-READ EXCLUSIVE-WRITE Parallel RAM with P processors where V and E are the numbers of vertices and edges in the inputed instance of the problem. These problems are in PC and PC*, since an appropriate choice of P can speed up their sequential running times by a factor of µ(P). Several interesting open questions are raised regarding these new parallel complexity classes PC and PC*. Unification is particularly important because it is a basic operation in theorem proving, in type inference algorithms, and in logic programming languages such as Prolog. A fast parallel implementation of Prolog is needed for software development in the Fifth Generation project.
An extension of conflict-free multivalued dependency sets
Authors: Hirofumi Katsuno
Venue: ACM Transactions on Database Systems (TODS) (1984)

Several researchers (Beeri, Bernstein, Chiu, Fagin, Goodman, Maier, Mendelzon, Ullman, and Yannakakis) have introduced a special class of database schemes, called acyclic or tree schemes. Beeri et al. have shown that an acyclic join dependency, naturally defined by an acyclic database scheme, has several desirable properties, and that an acyclic join dependency is equivalent to a conflict-free set of multivalued dependencies. However, since their results are confined to multivalued and join dependencies, it is not clear whether we can handle functional dependencies independently of other dependencies. In the present paper we define an extension of a conflict-free set, called an extended conflict-free set, including multivalued dependencies and functional dependencies, and show the following two properties of an extended conflict-free set: There are three equivalent definitions of an extended conflict-free set. One of them is defined as a set including an acyclic joint dependency and a set of functional dependencies such that the left and right sides of each functional dependency are included in one of the attribute sets that construct the acyclic join dependency. For a relation scheme with an extended conflict-free set, there is a decomposition into third normal form with a lossless join and preservation of dependencies.
Divide-and-conquer in computational group theory
Authors: Greg Butler
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

The paradigm of divide-and-conquer appears in five guises in computational group theory: Subgroup Restriction, Subgroup Lifting, Extension, Normal Lifting, and Homomorphic Lifting. The building blocks for these strategies are algorithms for subgroup construction, coset enumeration, and homomorphisms.
Highly available systems for database applications
Authors: Won Kim
Venue: ACM Computing Surveys (CSUR) (1984)

As users entrust more and more of their applications to computer systems, the need for systems that are continuously operational (24 hours per day) has become even greater. This paper presents a survey and analysis of representative architectures and techniques that have been developed for constructing highly available systems for database applications. It then proposes a design of a distributed software subsystem that can serve as a unified framework for constructing database application systems that meet various requirements for high availability.
National computerization and road map to information technology research and development
Authors: L. S. Say, I. F. Chang
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

In 1981, Singapore has launched a national computerization program. Several educational, training, civil service computerization and computer industry promotion programs have been carried out. In 1985, encouraged by the positive results achieved, a new mission was added to create a R D culture and capability for transferring information technology to Singapore for productivity gain and for supporting a successful information and software industry in Singapore for economic growth. Two R D organizations, Institute of Systems Science (ISS) and Information Technology Institute (ITI) were hence established. This paper gives a historical perspective of Singapore's national computerization program. Some of the Information Technology (IT) R D projects currently underway are described. Requirements, difficulties, progress and potential impact of these ambitious R D plans are also discussed.
A Stub Generator for Multilanguage RPC in Heterogeneous Environments
Authors: Phillip B. Gibbons
Venue: IEEE Transactions on Software Engineering (1987)

A stub generator for marshalling the arguments and results of remote procedure calls in heterogeneous environments is presented. The stub generator is itself language and machine independent, and derives all its knowledge of source languages and machine types from a set of language and machine specifications. These specifications can be paired in any combination to accommodate interlanguage calls between differing machines.
Creating a campus on-line news system
Authors: Pm Weizenbaum
Venue: Proceedings of the 4th annual international conference on Systems documentation (1986)

Information Systems, MIT's campus-wide computing service organization, recently reorganized and strengthened its resources. Out of this recent effort came the decision to explore several ways of reporting on the expanded range of systems and services we offer. One service that central computing facilities must provide is timely notice of changes to the supported systems. This paper presents the design and implementation of Information Systems' &ldquo;On-Line News System&rdquo;, which keeps users updated about changes in the wide variety of services offered by Information Systems.
Complete inverted files for efficient text retrieval and analysis
Authors: A. Blumer, J. Blumer, D. Haussler, R. McConnell, A. Ehrenfeucht
Venue: Journal of the ACM (JACM) (1987)

Given a finite set of texts S = {w1, &hellip; , wk} over some fixed finite alphabet &Sgr;, a complete inverted file for S is an abstract data type that provides the functions find(w), which returns the longest prefix of w that occurs (as a subword of a word) in S; freq(w), which returns the number of times w occurs in S; and locations(w), which returns the set of positions where w occurs in S. A data structure that implements a complete inverted file for S that occupies linear space and can be built in linear time, using the uniform-cost RAM model, is given. Using this data structure, the time for each of the above query functions is optimal. To accomplish this, techniques from the theory of finite automata and the work on suffix trees are used to build a deterministic finite automaton that recognizes the set of all subwords of the set S. This automaton is then annotated with additional information and compacted to facilitate the desired query functions. The result is a data structure that is smaller and more flexible than the suffix tree.
Robust Storage Structures for Crash Recovery
Authors: John J. Tayloy, Carl-Johan H. Seger
Venue: IEEE Transactions on Computers (1986)

A robust storage structure is intended to provide the ability to detect and possibly correct damage to the structure. One possible source of damage is the partial completion of an update operation, due to a "crash" of the program or system performing the update. Since adding redundancy to a structure increases the number of fields which must be changed, it is not clear whether adding redundancy will help or hinder crash recovery. This paper examines some of the general principles of using robust storage structures for crash recovery. It also describes a particular class of linked list structures which can be made arbitrarily robust, and which are all suitable for crash recovery.
Experimental mathematics: the role of computation in nonlinear science
Authors: David Campbell, Doyne Farmer, Jim Crutchfield, Erica Jen
Venue: Communications of the ACM (1985)

Computers have expanded the range of nonlinear phenomena that can be explored mathematically. An &ldquo;experimental mathematics facility,&rdquo; containing both special-purpose dedicated machines and general-purpose mainframes, may someday provide the ideal context for complex nonlinear problems.
Logic verification algorithms and their parallel implementation
Authors: H.-K. T. Ma, S. Devadas, A. Sangiovanni-Vincentelli, R. Wei
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

LOVER incorporates a novel approach to combinational logic verification and obtains good results when compared to existing techniques. In this paper we describe a new verification algorithm, LOVER-PODEM, whose enumeration phase is based on PODEM. A variant of LOVER-PODEM, called PLOVER, is presented. We have developed, for the first time, parallel logic verification schemes. Issues in efficiently parallelizing both general and specific LOVER-based approaches to logic verification over a large number of processors are addressed. We discuss parallelism inherent in the LOVER framework regardless of what enumeration and simulation algorithms are used. Since the enumeration phase is the efficiency bottleneck in parallelizing LOVER-based approaches, we have developed parallel versions of PODEM-based enumeration algorithms. Experimental results are presented to show that high processor utilization can be achieved when these parallelisms are exploited. Speed-up factors of over 7.8 have been achieved with 8 processor configurations.
Discrete Time Stochastic Petri Nets
Authors: Michael K. Molloy
Venue: IEEE Transactions on Software Engineering (1985)

Basic graph models of processes, such as Petri nets, have usually omitted the concept of time as a parameter. Time has been added to the Petri net model in two ways. The timed Petri net (TPN) uses a fixed number of discrete time intervals. The stochastic Petri net (SPN) uses an exponentially distributed random variable. In this paper, a discrete time stochastic Petri model is described. These discrete time SPN's fill the gap between TPN and normal SPN. However, the use of discrete time complicates the SPN model in that more than one transition may fire at a time step. Finally, an example of a live and bounded Petri net which has nonempty, disjoint, recurrent subsets of markings is given.
Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks
Authors: James McKenna
Venue: Journal of the ACM (JACM) (1987)

Striking progress has been made recently in obtaining expressions for the sojourn time distribution function (STDF) of a job at a c-server, first-come, first-serve (FCFS) center in a closed, product-form queuing network. These results have more recently been extended, and expressions have been obtained for the joint distribution function (DF) of the sojourn times of a job at a sequence of single-server, FCFS centers lying on an &ldquo;overtake-free&rdquo; path. However, these formulas present considerable computational problems in the case of large, closed queuing networks. In this paper, asymptotic techniques developed by Mitra and McKenna for the calculation of the partition function of large, product-form closed queuing networks are applied to the sojourn time problem. Asymptotic expansions are obtained for the STDF of a job at c-server, FCFS center in closed, product-form queuing networks. Similar expansions are obtained for the joint DF of the sojourn times of a job at a sequence of single server, FCFS centers lying on an &ldquo;overtake-free&rdquo; path. In addition, integral expressions are obtained for the STDF of a job at a single server, FCPS center in a closed, product-form queuing network in which all the centers are load independent. These integral expressions also yield useful asymptotic expansions. Finally, integral expressions are also obtained for the joint DF of the sojourn times of a job at the centers of an &ldquo;overtake-free&rdquo; path in such a network.