ppxscal/embedding_network huggingface dataset:
Educating the CBIS user: a case analysis
Authors: R Ryan Nelson, Paul H Cheney
Venue: ACM SIGMIS Database (1986)

Deficiencies in computer-related education for end users have contributed to the lack of successful integration of computer-based information systems (CBIS) into organizations. Data gathered from 20 companies whose CBIS exert a high strategic impact on existing operating systems were studied to determine how these companies accomplished "education integration." About 80% of the companies reported training budgets between zero and two percent of the CBIS budget, with a majority of the participants reported training staffs consisting of two or less full time trainers. Of the seven educational techniques used by the companies, the Resident Expert technique rated superior in terms of quantity and quality. A description of the activities in four companies with unique approaches to the education of their user community provides additional insights into the role of organizations in promoting the integration and use of CBIS among end users.
Controlling dynamic objects in large Ada systems
Authors: Steven M. Rosen
Venue: ACM SIGAda Ada Letters (1987)

This paper describes a generalized technique for controlling the growth of dynamically allocated objects within an Ada system due to the careless, yet innocent misuse of access types, allocators and instantiations of the generic procedure UNCHECKED_DEALLOCATION. The technique outlined here involves reliance on Ada's strong typing model and in particular, the judicious use of limited private data types in conjunction with generic packages and data abstraction facilities.
AMS: a knowledge-based approach to task representation, organization and coordination
Authors: Michel Tueni, Jianzhong Li, Pascal Fares
Venue: Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems (1988)

Applying Artificial Intelligence (AI) to the study of Office Information Systems (OIS) remains a challenging area. In this paper, we will present a Knowledge Based approach to modelling office activities. We will focus both on the declarative representation of the office concepts and their relationships, and on the organization of office knowledge in abstract packets, at different levels of generalization. This organization will allow abstract knowledge to be reusable in different situations, and to process and construct concrete structures at different levels. The control structure that should model the behavior of office workers is also discussed.
Many hard examples for resolution
Authors: Vašek Chvátal, Endre Szemerédi
Venue: Journal of the ACM (JACM) (1988)

For every choice of positive integers c and k such that k &ge; 3 and c2-k &ge; 0.7, there is a positive number &egr; such that, with probability tending to 1 as n tends to &infin;, a randomly chosen family of cn clauses of size k over n variables is unsatisfiable, but every resolution proof of its unsatisfiability must generate at least (1 + &egr;)n clauses.
History and basic features of the critical-pair/completion procedure
Authors: Bruno Buchberger
Venue: Journal of Symbolic Computation (1987)

A synopsis of the critical-pair/completion approach for solving algorithmic problems in theorem proving, finitely generated algebras and rewrite systems is given. The emphasis is on tracing the main intuition behind the approach, which consists in considering ''critical pairs''. These are the ''first possible'' situations where ''superpositions'' may occur. Extensive references to the original literature are provided. Some directions for future research are outlined. The presentation is biased towards the development of the approach in algorithmic polynomial ideal theory.
Converting from a DEC system-10 to VAX
Authors: John Thornton
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

May 15th 1986, we unplugged our DECsystem-10 after 17 years of service, and replaced it with new VAXes. We had to not only learn a new system, but prepare our users for the changeover, and help them learn the VAX. We looked for ways to make sure DEC-10 users would know their computer was leaving. We surveyed users looking for potential user conversion problems. We helped users get ready for and eventually get used to the VAXes. This article will discuss the preparation we (and our users) made for the upcoming changeover, a description of our conversion efforts, and a discussion of some problems we ran into.
Efficient instruction scheduling for a pipelined architecture
Authors: Philip B. Gibbons, Steven S. Muchnick
Venue: ACM SIGPLAN Notices (1986)

As part of an effort to develop an optimizing compiler for a pipelined architecture, a code reorganization algorithm has been developed that significantly reduces the number of runtime pipeline interlocks. In a pass after code generation, the algorithm uses a dag representation to heuristically schedule the instructions in each basic block.Previous algorithms for reducing pipeline interlocks have had worst-case runtimes of at least O (n4). By using a dag representation which prevents scheduling deadlocks and a selection method that requires no lookahead, the resulting algorithm reorganizes instructions almost as effectively in practice, while having an O (n2) worst-case runtime.
From decision support to expert systems
Authors: I Al-Ani, Roger E Cooley, Elias M Awad
Venue: Proceedings of the conference on The 1987 ACM SIGBDP-SIGCPR Conference (1987)

This paper discusses an approach to developing an expert system as a combination of a decision support system and several simulations of expert users of that support system. Particular attention is given to the problems of coordinating the simulated experts.
Computer understanding and generalization of symbolic mathematical calculations: a case study in physics problem solving
Authors: Jude W. Shavlik, Gerald F. DeJong
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

An artificial intelligence system that learns by observing its users perform symbolic mathematical problem solving is presented. This fully-implemented system is being evaluated as a problem solver in the domain of classical physics. Using its mathematical and physical knowledge, the system determines why a human-provided solution to a specific problem suffices to solve the problem, and then extends the solution technique to more general situations, thereby improving its own problem-solving performance. This research illustrates a need for symbolic mathematics systems to produce explanations of their problem-solving steps, as these explanations guide learning. Although physics problem solving is currently being investigated, the results obtained are relevant to other mathematically-based domains. This work also has implications for intelligent computer-aided instruction in domains of this type.
Artificial intelligence in medicine: a personal retrospective on its emergence and early function
Authors: C. A. Kulikowski
Venue: Proceedings of ACM conference on History of medical informatics (1987)

Methods of artificial intelligence were gradually introduced into clinical decision-making research from 1970 to 1974. Evolving from pattern recognition and general A.I. problem-solving ideas, such methods helped researchers crystallize the notions of knowledge-based systems by the mid-1970s. In 1978 the early systems gave way to either second-generation frameworks for general consultative reasoning or to new, more sophisticated knowledge representations. This paper traces some of the major events in the early evolution of AIM systems, with emphasis on the developments at the Rutgers Resource, in which the author participated.
System and Application Software for the Armstrong Multiprocessor
Authors: James T. Rayfield, Harvey F. Silverman
Venue: Computer (1988)

The authors identify problems with present parallel processing systems, and present Armstrong, a hardware-software system that is designed to address some of the problems discussed. They briefly describe the Armstrong hardware and discuss, in depth, the operating system software, and performance of the system on a real application, namely, and computation of the 2-D discrete Fourier transform of an image.
On a fast integer square root algorithm
Authors: TImothy J. Rolfe
Venue: ACM SIGNUM Newsletter (1987)

The long-hand square root algorithm, when implemented in binary arithmetic, produces immediately the analytic result (as opposed to the successive approximations generated by the Newton-Raphson method). It also uses only addition, subtraction, and bits shifts; it is related to the binary integer division algorithm, but is in fact a simpler procedure.
A course on information engineering
Authors: Osvaldo Laurido-Santos
Venue: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education (1986)

An overview of information engineering: objectives, principles, methodologies, and techniques; precedes an outline with some suggestions for a course on information engineering. The course will be offered in Puerto Rico for the first time on the Spring semester. The author plans to present on a future date a critique on the course and his experiences.
Adapting UNIX for a multiprocessor environment
Authors: M. D Janssens, J. K Annot, A. J Van De Goor
Venue: Communications of the ACM (1986)

Existing Unix data protection and synchronization mechanisms present difficulties when adapting Unix to a multiprocessor environment, but solutions do exist.
Query optimization on local area networks
Authors: Alan R. Hevner, O. Q. Wu, S. B. Yao
Venue: ACM Transactions on Information Systems (TOIS) (1985)

Local area networks are becoming widely used as the database communication framework for sophisticated information systems. Databases can be distributed among stations on a network to achieve the advantages of performance, reliability, availability, and modularity. Efficient distributed query optimization algorithms are presented here for two types of local area networks: address ring networks and broadcast networks. Optimal algorithms are designed for simple queries. Optimization principles from these algorithms guide the development of effective heuristic algorithms for general queries on both types of networks. Several examples illustrate distributed query processing on local area networks.
Adult learners: away with computerphobia
Authors: George R. Kneller
Venue: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education (1986)

&ldquo;Computerphobia&rdquo; among adult learners is analogous to communication apprehension among adult speakers; consequently, techniques used by teachers of public speaking to ease stagefright can be adapted to the problem of overcoming fear of computers in novice adult learners. Six specific solutions are suggested and explained.
Effectiveness of a machine-level, global optimizer
Authors: Mark S. Johnson, Terrence C. Miller
Venue: ACM SIGPLAN Notices (1986)

We present an overview of the design of a machine-code-level, global (intraprocedural) optimizer that supports several front-ends producing code for the Hewlett-Packard Precision Architecture family of machines. The basic optimization strategy is described, including information about the division of responsibilities between various components of the compiler. Optimization algorithms are described, including a discussion of the dataflow information they require. Measurements showing the collective and individual effects of various optimizer components are presented.The performance data presented here was collected using a preliminary version of the optimizer. Development is continuing and further improvements are expected.
System Structure Analysis: Clustering with Data Bindings
Authors: David H. Hutchens, Victor R. Basili
Venue: IEEE Transactions on Software Engineering (1985)

This paper examines the use of cluster analysis as a tool for system modularization. Several clustering techniques are discussed and used on two medium-size systems and a group of small projects. The small projects are presented because they provide examples (that will fit into a paper) of certain types of phenomena. Data bindings between the routines of the system provide the basis for the bindings. It appears that the clustering of data bindings provides a meaningful view of system modularization.
Object structure in the Emerald system
Authors: Andrew Black, Norman Hutchinson, Eric Jul, Henry Levy
Venue: ACM SIGPLAN Notices (1986)

Emerald is an object-based language for the construction of distributed applications. The principal features of Emerald include a uniform object model appropriate for programming both private local objects and shared remote objects, and a type system that permits multiple user-defined and compiler-defined implementations. Emerald objects are fully mobile and can move from node to node within the network, even during an invocation. This paper discusses the structure, programming, and implementation of Emerald objects, and Emerald's use of abstract types.
User technology&mdash;from pointing to pondering
Authors: Stuart Card, Thomas Moran
Venue: Proceedings of the ACM Conference on The history of personal workstations (1986)

From its beginning, the technology of personal workstations has been driven by visions of a future in which people would work in intimate partnership with computer systems on significant intellectual tasks. These visions have been expressed in various forms: Memex (Bush, 1945), Man-Machine Symbiosis (Licklider, 1960), NLS (Engelbart, 1963), Dynabook (Kay, 1977), and others.The tight coupling between human and computer required by these visions necessitated advances in the ways humans and computers interact. These advances have slowly begun to accumulate into what might be called a user technology. This user technology includes hardware and software techniques for building effective user interfaces: bitmapped displays, menus, pointing devices, &ldquo;modeless&rdquo; command languages, animation, and interface metaphors. But it must include a technical understanding of the user himself and of the nature of human-computer interaction. This latter part, the scientific base of user technology, is necessary in order to understand why interaction techniques are (or are not) successful, to help us invent new techniques, and to pave the way for machines that aid humans in performing significant intellectual tasks. In this paper, we trace some of the history of our understanding of users and their interaction with workstation&mdash;the personal part of personal workstations. In keeping with the spirit of other papers at this conference, we have centered this review around our own experiences, perspectives, and work and have not attempted a complete history of the field. In concentrating on our own work, we do not wish to mimimize the importance of others' work; we simply want to tell our own story. Our focus is on what we have learned about users in our years of studying them and how we see our findings relating to the original visions of the personal workstation.
A comparison of the ISO working draft standard for SQL and a commercial implementation of SQL
Authors: Louis Ferrante
Venue: ACM SIGSMALL/PC Notes (1987)

Our is one of many organizations which have adopted the SQL language for use with their database systems. Since portability is a major requirement in our work, we must know how the emerging ISO working draft standard for SQL and the implementation of SQL in INGRES 4.0, the DBMS we have selected, differ. In particular, we must learn which features in INGRES are not part of the standard, and which features of the ISO standard have not been implemented in INGRES.This report is a comparison between the ISO working draft standard for the SQL2 database language (ISO TC97/SC21 N1479) and INGRES (release 4.0) SQL. The comparison is not a complete and detailed list of the differences between INGRES SQL and the working draft standard. Rather it attempts to highlight the major differences between the two.
A Theory of Communicating Sequential Processes
Authors: S. D. Brookes, C. A. R. Hoare, A. W. Roscoe
Venue: Journal of the ACM (JACM) (1984)

A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.
Composable Ada software components and the re-export paradigm
Authors: Bryce Bardin, Christopher Thompson
Venue: ACM SIGAda Ada Letters (1988)

One of the goals of the software engineering community has been the establishment of a reusable software components industry. With increasingly wide acceptance of the Ada language, many of us feel that this goal may be within reach. The Ada language provides a powerful abstraction facility with constructs such as packages, user-defined types, and generic units with which to construct such components.However, the successful development of reusable software components written in Ada depends also upon the language's abstraction composition qualities. That is, it depends on how easily smaller abstractions (or components) may be combined to create larger and more powerful abstractions.This paper discusses in detail the most important methods by which abstractions may be composed in Ada and their limitations. A companion paper, titled "Using the Re-Export Paradigm to Build Composable Ada Software Components", will be published in a succeeding issue of Ada LETTERS. It demonstrates the techniques described here and concludes with suggestions for improvements that would enhance the composability of Ada software.
Modelling the arithmetic of statistical distributions
Authors: Leo H. Groner, Janice H. Cook
Venue: ACM SIGAPL APL Quote Quad (1986)

Examples of extended arithmetics include range, polynomial, dimensional, extended precision and fault tolerant arithmetic, and arithmetic on distributions of random variables. APL2's defined operators and general arrays enable the programmer to easily define such extensions. In this paper we will discuss some extended arithmetics and a prototype of arithmetic on statistical distributions that we have implemented in APL2 [1]. In this prototype, distributions take the place of numbers and the ordinary arithmetic scalar functions are replaced by derived functions that take distributions as arguments and return distributions as results. For ordinary addition, the natural derived function is convolution. Design issues and application examples are discussed.
Applying the human relations perspective to the study of new media
Authors: Ronald E Rice
Venue: ACM SIGCAS Computers and Society (1986)

The Human Relations perspective is one of six perspectives, suggested by Kling and colleagues, that analysts take when studying the impacts of computers. This short note looks at the assumptions of this perspective by focussing on a particular component of the human relations approach. This component is the participation or involvement of users in the implementation and management of communication systems in organizations. It very briefly notes prior literature on this component, with particular reference to sociotechnical systems research. This note considers the implications of using the human relations perspective and the focus on participation in light of results from a lengthy study of the management of word processign in 200 organizations. It concludes by considering the joint advantages of the other perspectives in analyses of participation.
Program abstraction and instantiation
Authors: Nachum Dershowitz
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1985)

Our goal is to develop formal methods for abstracting a given set of programs into a program schema and for instantiating a given schema to satisfy concrete specifications. Abstraction and instantiation are two important phases in software development which allow programmers to apply knowledge learned in the solutions of past problems when faced with new situations. For example, from two programs using a linear (or binary) search technique, an abstract schema can be derived that embodies the shared idea and that can be instantiated to solve similar new problems. Along similar lines, the development and application of program transformations are considered. We suggest the formulation of analogies as a basic tool in program abstraction. An analogy is first sought between the specifications of the given programs; this yields an abstract specification that may be instantiated to any of the given concrete specifications. The analogy is then used as a basis for transforming the existing programs into an abstract schema that represents the embedded technique, with the invariant assertions and correctness proofs of the given programs helping to verify and complete the analogy. A given concrete specification of a new problem may then be compared with the abstract specification of the schema to suggest an instantiation of the schema that yields a correct program.
A simple model of ocean waves
Authors: Alain Fournier, William T. Reeves
Venue: ACM SIGGRAPH Computer Graphics (1986)

We present a simple model for the surface of the ocean, suitable for the modeling and rendering of most common waves where the disturbing force is from the wind and the restoring force from gravity.It is based on the Gerstner, or Rankine, model where particles of water describe circular or elliptical stationary orbits. The model can easily produce realistic waves shapes which are varied according to the parameters of the orbits. The surface of the ocean floor affects the refraction and the breaking of waves on the shore. The model can also determine the position, direction, and speed of breakers.The ocean surface is modeled as a parametric surface, permitting the use of traditional rendering methods, including ray-tracing and adaptive subdivision. Animation is easy, since time is built into the model. The foam generated by the breakers is modeled by particle systems whose direction, speed and life expectancy is given by the surface model.To give designers control over the shape of the ocean, the model of the overall surface includes multiple trains of waves, each with its own set of parameters and optional stochastic elements. The overall "randomness" and "short-crestedness" of the ocean is achieved by a combination of small variations within a train and large variations between trains.Rendered examples of oceans waves generated by the model are given and a 10 second animation is described.
Concurrent dynamic logic
Authors: D Peleg
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

In this paper we investigate extensions of dynamic logic tailored towards handling concurrent programs, with or without communication. The basic version of concurrent dynamic logic, CDL, is a natural extension of regular DL, and is shown to possess most desirable properties of DL. We further explore its relationships with the &mgr;-calculus, DL with recursive procedures and PTIME, strengthening natural connections between concurrency, recursion and alternation. Communication is introduced into the program schemes of CDL by means of channels and shared variables. The effects of these mechanisms on issues of expressiveness and decidability are investigated. In general, we find that both respects are dominated by the extent to which the capabilities of synchronization and (unbounded) counting are enabled in the system. Connections with actual concurrent languages such as CSP are discussed on the first-order level.