ppxscal/embedding_network huggingface dataset:
Design of a multi-media vehicle for social browsing
Authors: Robert W. Root
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

In this paper we present a new approach to the use of computer-mediated communications technology to support distributed cooperative work. In contrast to most of the existing approaches to CSCW, we focus explicitly on tools to enable unplanned, informal social interaction. We describe a &ldquo;social interface&rdquo; which provides direct, low-cost access to other people through the use of multi-media communications channels. The design of the system centers around three basic concepts derived from the research literature and our own observations of the workplace: social browsing, a virtual workplace, and interaction protocols. We use these design properties to describe a new system concept, and examine the implications for CSCW of having automated social interaction available through the desktop workstation.
Computing the Width of a Set
Authors: M. E. Houle, G. T. Toussaint
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

For a set of points P in three-dimensional space, the width of P, W (P), is defined as the minimum distance between parallel planes of support of P. It is shown that W(P) can be computed in O(n log n+I) time and O(n) space, where I is the number of antipodal pairs of edges of the convex hull of P, and n is the number of vertices; in the worst case, I=O(n/sup 2/). For a convex polyhedra the time complexity becomes O(n+I). If P is a set of points in the plane, the complexity can be reduced to O(nlog n). For simple polygons, linear time suffices.
A colored petri net model for connection management services in MMS
Authors: F.-Y. Wang, K. Gildea, A. Rubenstein
Venue: ACM SIGCOMM Computer Communication Review (1989)

This paper presents a Petri net (PN) model for Connection Management Services (CMS) of the Manufacturing Message Specification (MMS) which describes all possible sequences of service primitives that can occur during establishment, maintenance and termination of the connection and their relation at each service state. The PN model enables a complete and unambiguous specification to be derived for CMS. P-invariants and T-invariants analysis carried out on the connection PN provides useful information on the CMS behavior and specification for its implementation. It is claimed that PNs may offer a hierarchical mathematical description for the entire MMS protocol, a uniform representation for various level of abstraction of MMS protocol and an analytical model for protocol performance evaluation and analysis.
Recovery of Parametric Models from Range Images: The Case for Superquadrics with Global Deformations
Authors: F. Solina, R. Bajcsy
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A method for recovery of compact volumetric models for shape representation of single-part objects in computer vision is introduced. The models are superquadrics with parametric deformations (bending, tapering, and cavity deformation). The input for the model recovery is three-dimensional range points. Model recovery is formulated as a least-squares minimization of a cost function for all range points belonging to a single part. During an iterative gradient descent minimization process, all model parameters are adjusted simultaneously, recovery position, orientation, size, and shape of the model, such that most of the given range points lie close to the model's surface. A specific solution among several acceptable solutions, where are all minima in the parameter space, can be reached by constraining the search to a part of the parameter space. The many shallow local minima in the parameter space are avoided as a solution by using a stochastic technique during minimization. Results using real range data show that the recovered models are stable and that the recovery procedure is fast.
Using video to prototype user interfaces
Authors: L. Vertelney
Venue: ACM SIGCHI Bulletin (1989)

The Human Interface Group at Apple Computer uses video as a design tool to prototype and visualize ideas about how computers will be used in the future. This paper is for people who need to build visualizations of user interfaces that don't yet exist. It describes how to create effective interface simulations using animation and video techniques. The advantages and disadvantages of video as a user interface design and prototyping medium are also explored.
Representing and reusing explanations of legal precedents
Authors: L. K. Branting
Venue: Proceedings of the 2nd international conference on Artificial intelligence and law (1989)

Precedent-based legal reasoning depends on accurate assessment of relevant similarities between new cases and existing precedents. Determining the relevant similarities between a new case and a precedent with respect to a legal category requires knowing the explanation of the precedent's membership in the category. GREBE is a system that uses both general legal rules and specific explanations of precedents to evaluate legal predicates in new cases. GREBE assesses the similarity of a new case to a precedent of a legal category by attempting to find a pattern of relations in the new case that corresponds to the facts of the precedent responsible for its category membership. Missing relations in the new case are inferred by reusing other explanations from past cases.
Experience with Charlotte: Simplicity and Function in a Distributed Operating System
Authors: Raphael Finkel, Michael L. Scott, Yeshayahu Artsy, Hung-Yang Chang
Venue: IEEE Transactions on Software Engineering (1989)

A retrospective view is presented of the Charlotte distributed operating system, a testbed for developing techniques and tools to solve computation-intensive problems with large-grain parallelism. The final version of Charlotte runs on the Crystal multicomputer, a collection of VAX-11/750 computers connected by a local area network. The kernel/process interface is unique in its support for symmetric, bi-directional communication paths (called links), and synchronous nonblocking communications. Several lessons were learned in implementing Charlotte. Links have proven to be a useful abstraction, but the primitives do not seem to be at quite the right level of abstraction. The implementation uses finite-state machines and a multitask kernel, both of which work well. It also maintains absolute distributed information which is more expensive that using hints. The development of high-level tools, particularly the Lynx distributed programming language, has simplified the use of kernal primitives and helps to manage concurrency at the process level.
A philosophy for scientific computing tools
Authors: W. M. Coughran, E. Grosse
Venue: ACM SIGNUM Newsletter (1989)

We argue that subroutine libraries are not enough but need to be supplemented by common file formats and directly executable commands. A concrete example, tensor spline primitives, illustrates this style of programming.
Experiences in applying the layered virtual machine/object-oriented development methodology to an Ada design effort
Authors: C. Meyer, M. Wallis, M. Meier
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

When adopting a new design methodology for an Ada project, management must be aware of the various implications. Providing thorough training, establishing usage standards, integrating the methodology with an overall management plan, and assuring additional design guidance - if needed to supplement the design methodology - must be given due consideration early on in the project. Failure to do so will have a negative impact on the project.
Electronics Technology and Computer Science, 1940-1975: A Coevolution
Authors: Paul Ceruzzi
Venue: IEEE Annals of the History of Computing (1988)

This paper explores the relation ship between two disciplines: electrical engineering and computer science, over the past 40 years. The author argues that it was the technology of electronics - the exploitation of the properties of free electrons - that finally permitted Babbage's concepts of automatic computing machines to be practically realized. Electrical Engineering (EE) activities thus "took over" and dominated the work of those involved with computing. Once that had been done (around the mid-1950s), the reverse takeover happened: the science of computing then "took over" the discipline of EE, in the sense that its theory of digital switches and separation of hardware and software offered EE a guide to designing and building ever more complex circuits.
Network expert diagnostic system for real-time control
Authors: Terry L. Janssen
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

Data communications networks are controlled by network management systems that are responsible for performance and fault management. This paper presents an expert system capable of performing fault and performance management through different levels of autonomous control. A blackboard architecture design provides for processing of multiple lines of machine reasoning and planning: the set of all unresolved events is used to generate hypotheses of network state through event correlation and ancillary network information; supporting network data provides evidence that supports or refutes the hypotheses; conclusions are drawn from the hypotheses; plans of corrective action are built, executed, and monitored to attempt improvement to a &ldquo;normal&rdquo; network state.
Algorithm 676: ODRPACK: software for weighted orthogonal distance regression
Authors: Paul T. Boggs, Janet R. Donaldson, Richaard h. Byrd, Robert B. Schnabel
Venue: ACM Transactions on Mathematical Software (TOMS) (1989)

In this paper, we describe ODRPACK, a software package for the weighted orthogonal distance regression problem. This software is an implementation of the algorithm described in [2] for finding the parameters that minimize the sum of the squared weighted orthogonal distances from a set of observations to a curve or surface determined by the parameters. It can also be used to solve the ordinary nonlinear least squares problem. The weighted orthogonal distance regression procedure application to curve and surface fitting and to measurement error models in statistics. The algorithm implemented is an efficient and stable trust region (Levenberg-Marquardt) procedure that exploits the structure of the problem so that the computational cost per iteration is equal to that for the same type of algorithm applied to the ordinary nonlinear least squares problem. The package allows a general weighting scheme, provides for finite difference derivatives, and contains extensive error checking and report generating facilities.
Combinatory differential fields
Authors: E. Engeler
Venue: Theoretical Computer Science (1990)

Combinatory differential fields arise if differential fields are augmented by operations which allow functions that are programmable in the usual recursive sense to be denoted. The present paper defines this concept. It is shown that every differential field whose field of constants is ordered can be extended to a combinatory field. We generalize the basic notions of the Liouville-Ritt-Risch theory of closed-form solvability to combinatory field extensions and present some explorative examples of problems and solutions. &mdash;Author's Abstract
Unified management of registers and cache using liveness and cache bypass
Authors: C.-H. Chi, H. Dietz
Venue: ACM SIGPLAN Notices (1989)

In current computer memory system hierarchy, registers and cache are both used to bridge the reference delay gap between the fast processor(s) and the slow main memory. While registers are managed by the compiler using program flow analysis, cache is mainly controlled by hardware without any program understanding. Due to the lack of coordination in managing these two memory structures, significant loss of system performance results because: Cache space is wasted to hold inaccessible copies of values in registers. Inaccessible copies of values replace those accessible ones from cache. Despite the fact that register allocation has long recognized the benefits of live range analysis, current cache management has completely ignored live range information. In this paper, we propose an unified management of registers and cache using liveness and cache bypass. By using a single model to manage these two memory structures, most redundant copies of values in cache can be eliminated. Consequently, bus traffic and memory traffic in data cache are greatly reduced and cache effectiveness is improved.
A strong restriction of the inductive completion procedure
Authors: Laurent Fribourg
Venue: Journal of Symbolic Computation (1989)

The procedure of Knuth & Bendix (In: Computational Problems in Abstract Algebras,Pergamon Press, 1970, pp. 263-297) completes a system of equations into a confluent one. It proceeds by adding critical pairs when equations superpose themselves in an ambiguous way. Huet & Hullot (Proc. 21st Symp. Foundations in Computer Science, 1980, pp 96-107) have shown that, for theories with constructors satisfying a so-called principle of definition, the Knuth-Bendix procedure can be used to prove that conjectures are inductive theorems of a given theory (proofs by inductive completion). In this paper, we show that this is the case even when the procedure is restricted in a linear selecting manner: first, critical pairs are generated in a linear manner by superposition of one equation of the initial theory into one equation issued from critical pairs (no superposition between two equations both issued from critical pairs); second, for each critical pair, the occurrence of superposition with theory equations is uniquely determined by a selection function. p Unlike the Knuth-Bendix procedure, our procedure, when terminating with success, does not produce a confluent system in general. However, the generated system is guaranteed to have the ground-confluence property (confluence for terms without variables). This result suffices to guarantee the conjecture validity. Our restricted completion procedure terminates in many cases where the inductive completion procedure loops, generating infinitely many critical pairs. The procedure applies to theories without constructors (Jouannaud & Kounalis, Proc. Symp. on Logic in Computer Science, Cambridge, MA, 1986, pp. 358-366) and extends to conditional theories and conditional conjectures. It can also incorporate various techniques used in classical induction. The procedure then combines the efficiency of classical induction method with the simplicity of inductive completion.
The implementation of an algorithm to find the convex hull of a set of three-dimensional points
Authors: A. M. Day
Venue: ACM Transactions on Graphics (TOG) (1990)

A detailed description of the implementation of a three-dimensional convex hull algorithm is given. The problems experienced in the production and testing of a correct and robust implementation of a geometric algorithm are discussed. Attention is paid to those issues that are often brushed over in the theoretical descriptions but cause errors in a real computation. These include degeneracies such as coplanar points, floating-point errors, and other special, but not necessarily degenerate, cases.
Circling: a method of mouse-based selection without button presses
Authors: J. C. Jackson, R. J. Roske-Hofstrand
Venue: ACM SIGCHI Bulletin (1989)

A method for selecting graphical objects with a mouse by circling them is described. Circling motions are detected automatically; no button presses are required. Trials conducted on a Sun 3 workstation indicate that, for the object size and layout chosen, even users experienced with mouse selection via button presses and unfamiliar with circling are able to select pairs of objects in approximately the same amount of time with either method. The number of target misses between circling and clicking also compare well for both single and paired object cases. Furthermore, many users showed a measurable preference for the circling method when given a choice.
Viruses and worms - What can they do?
Authors: S. Kurzban
Venue: ACM SIGSAC Review (1989)

"Computer viruses" have received a lot of attention lately. In fact, the best-known "viruses" have not been viruses at all, but "worms," programs that spread through networks instead of modifying programs. Both viruses and worms reproduce themselves and defensive measures have focused on stopping or slowing their spread. But that is only one tack you can take. Preventing or limiting the effect of the harm that their components can cause is another. Still other measures are specific to known viruses. Ultimately, though, there is no defense better than a comprehensive security strategy that embraces user education, crisis-response teams, and technologically sound security measures including, but not limited to, those that relate specifically to the threats posed by viruses and worms.
Selection criteria for analysis and design CASE tools
Authors: G. Baram, G. Steinberg
Venue: ACM SIGSOFT Software Engineering Notes (1989)

Computer Aided Software Engineering (CASE) has been receiving increasing attention because of its potential for substantial productivity improvement of software development. Selecting CASE tools best suited to organizations needs can be a challenge because of wide variations among CASE features, completeness, terminology, and usage characteristics. This paper presents specific performance criteria of CASE tools and ranks them as required versus "nice to have." It is based on an in depth investigation of several packages.
Block-matrix operations using orthogonal trees
Authors: A. C. Elster, A. P. Reeves
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Hypercube algorithms are presented for distributed block-matrix operations. These algorithms are based entirely on an interconnection scheme which involves two orthogonal sets of binary trees. This switching topology makes use of all hypercube interconnection links in a synchronized manner. An efficient novel matrix-vector multiplication algorithm based on this technique is described. Also, matrix transpose operations moving just pointers rather than actual data, have been implemented for some applications by taking advantage of the above tree structures. For the cases where actual physical vector and matrix transposes are needed, possible techniques, including extensions of the above scheme, are discussed. The algorithms support submatrix partitionings of the data, instead of being limited to row and/or column partitionings. This allows efficient use of nodal vector processors as well as shorter interprocessor communication packets. It also produces a favorable data distribution for applications which involve near neighbor operations such as image processing. The algorithms are based on an interprocessor communication paradigm which involves variable length, tagged block data transfers. They have been implemented on an Intel iPSC hypercube system with the support of the Hypercube Library developed at the Christian Michelsen Institute.
Hypermedia topologies and user navigation
Authors: H. Van Dyke Parunak
Venue: Proceedings of the second annual ACM conference on Hypertext (1989)

One of the major problems confronting users of large hypermedia systems is that of navigation: knowing where one is, where one wants to go, and how to get there from here. This paper contributes to this problem in three steps. First, it articulates a number of navigational strategies that people use in physical (geographical) navigation. Second, it correlates these with various graph topologies, showing how and why appropriately restricting the connectivity of a hyperbase can improve the ability of users to navigate. Third, it analyzes some common hypermedia navigational mechanisms in terms of navigational strategies and graph topology.
The point of view notion for multiple inheritance
Authors: Bernard Carré, Jean-Marc Geib
Venue: ACM SIGPLAN Notices (1990)

We examine several problems related to the preservation of the Independence Principle inheritance. This principle states that all the characteristics of independent superclasses must be inherited by subclasses, even if there are name conflicts. In this context, a conventional approach is to use explicit class selection. We show that this mechanism suffers from serious limitations, and leads to inhibition of refinement and genericity. Our experimental object-oriented language ROME introduces the &ldquo;Point of View&rdquo; notion (using an &ldquo;as-expressions&rdquo; mechanism) which solves these problems.
An improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme
Authors: C.-C. Yang, G. Li, B. A.-B. Ng
Venue: IEEE Transactions on Software Engineering (1988)

An algorithm for synthesizing a better relational database scheme in elementary key normal form (EKNF) is developed. This algorithm eliminates not only extraneous attributes and other redundancies, but also superfluities from a given set of functional dependences (FDs), based primarily on subset closures, Hamiltonian cycles of FDs, and equivalent subsets of attributes. Following this algorithm, a better LR-minimum FD covering is obtained. A more practical and efficient method for designing a relational database scheme in EKNF is then provided. The time complexity of the algorithm is polynomial.
Diffusion in computing networks: the case of BITNET
Authors: Vijay Gurbaxani
Venue: Communications of the ACM (1990)

Using BITNET as a model, the author examines the adoption pattern of computing networks from the perspectives of innovation diffusion theory and economics.
An approach to intelligent assistance for the specification of ASIC design using objects and rules
Authors: K. D. Mueller-Glaser, J. Bortolazzi
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The demand for true &ldquo;system integration&rdquo; leads to an increasing number of Application Specific Integrated Circuit (ASIC) designs having non-standard electrical and timing input/output characteristics and operating environments. This mandates a computer assistance during the specification phase as well as the management of intermediate and final design results. Furthermore, early and simulation independent consistency checking is necessary to prevent expensive redesigns. This paper presents a new knowledge based approach to the acquisition, checking and processing of electrical, timing, environmental and test oriented specification data using object-oriented data representation and rule-based consistency checking. This approach is part of the DEBYS (DEsign BY Specification) project under development at the University of Erlangen-Nuernberg. This system is currently working for digital ASIC and will be enhanced for system design.
Trading space for time in undirected s-t connectivity
Authors: A. Z. Broder, A. R. Karlin, P. Raghavan, E. Upfal
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

Aleliunas et al. [1] posed the following question: &ldquo;The reachability problem for undirected graphs can be solved in logspace and O(mn) time [m is the number of edges and n is the number of vertices] by a probabilistic algorithm that simulates a random walk, or in linear time and space by a conventional deterministic graph traversal algorithm. Is there a spectrum of time-space trade-offs between these extremes?&rdquo; We answer this question in the affirmative for linear-sized graphs by presenting an algorithm which is faster than the random walk by a factor essentially proportional to the size of its workspace. For denser graphs, the algorithm is faster than the random walk but the speed-up factor is smaller.