ppxscal/embedding_network huggingface dataset:
An organized, devoted, project-wide reuse effort
Authors: Gregory M. Bowen
Venue: ACM SIGAda Ada Letters (1992)

Many projects have struggled with attempting reuse; however, both size and complexity of a large project create additional obstacles that can minimize the potential for software reuse. Therefore, successful software reuse can not be guaranteed solely by the use of Ada, object-oriented development methods, taxonomies, storage and retrieval systems, commercial libraries, software methods, standards, or configuration management systems! It was proposed [Bowen, 1990], that inorder for software reuse to succeed on large projects, these methods and techniques must be combined in a coordinated reuse effort. The software process must address issues related to the management of the development effort, in addition to addressing purely technical issues. This paper will present how th e concept of an organized, devoted, project-wide reuse effort has been practically applied by Computer Sciences Corporation (CSC), over the past year on the Advanced Automation System (AAS), as part of the team led by International Business Machines (IBM) Corporation.
Microcode simulation in the computer architecture course
Authors: Dave Foley
Venue: ACM SIGCSE Bulletin (1992)

There is no doubt that the most difficult topic to teach in a Computer Architecture and Organization course is microprogramming. In this paper the author describes a Pascal programming project in which the students write a simulator for a microprogram. The project has been assigned several times with very satisfying results for both the instructor and the students.
A real-time robot collision avoidance system (abstract)
Authors: Clifford A. Shaffer, Gregory M. Herb
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

A data structure and update algorithms are presented for a real-time collision avoidance system in a multi-robot environment. The data structure is a variant of the octree, which serves as the spatial index. An octree recursively decomposes 3 dimensional space into 8 equal cubic octants until each octant meets some decomposition criteria. Our octree stores cylinders and solid rectangles as primitives (other primitives can easily be added as required). These primitives make up the two seven-degree-of-freedom robot arms and environment modeled by the system. Octree nodes containing more than a pre-determined number n of primitives are decomposed (here, n=5). This rule keeps the octree small, as the entire environment for our application can be modeled using about a hundred primitives. As robot arms and grasped objects move, the octree is updated to reflect their changed positions. During most update cycles, any given primitive does not change which octree nodes it is in. Thus, modification to the octree is rarely required. Incidents in which a robot arm comes too close to another object are reported. Cycle time for receiving current joint angles, updating the octree, and detecting/reporting imminent collisions is about 25 milliseconds on an Intel 80386 processor running at 20 MHz. Our work will provide a real-time safety system for tele-operated robot arms on NASA's manned space station.
Stratification as a design principle in logical query languages
Authors: Shamim A. Naqvi
Venue: Proceedings of the second international workshop on Database programming languages (1989)

The iterative concept of a set imposes a partial order (a priority or stratification as we shall call it later) on the operation of set formation and leads to a partitioning of the universe of sets. This simple notion of priority has led to clean and powerful statements of set theory that are apparently consistent and relatively paradox-free (they do not admit the paradoxes of Russell and Cantor but are susceptible to the Burali-Forti paradox). Recently, the author and his colleagues have been engaged in designing a logic programming language called &lagran;D&lagran; and providing declarative semantics for it. In the course of this work the idea of imposing a priority on operations and deriving a partitioning of the program universe has found surprising utility and has led to simple solutions to problems in ascribing declarative semantics to &lagran;D&lagran; programs. From this collective experience has emerged an understanding that this priority notion is a major principle in the design and semantics of logical query languages. This paper presents four instances of specific design and semantical issues, showing in each case how the priority notion leads to natural constructs in programming languages without assignments, and affords straight-forward solutions to problems in assigning declarative semantics to programs. However, stratification is not without its own problems. We critique stratification by exhibiting what may be termed as stratification anomalies.
Object Delineation in Noisy Images by a Modified Policy-Iteration Method
Authors: Adrie C. M. Dumay, Mariëlle N. A. J. Claessens, Cees Roos, Jan J. Gerbrands, Johan H. C. Reiber
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The contours of isolated objects in noisy images may be detected with a minimal cost contour detection algorithm. An algorithm that is based on the policy-iteration method for locating the closed minimal cost path is introduced. Computational results indicate that it is computationally more efficient than the dynamic programming approach. The method is applied to left ventricular contours in scintigraphic images, although it is applicable to any domain where a closed minimal cost path is to be computed in a matrix of cost coefficients.
A graphical user interface to support a production team
Authors: Stephen M. DiPietro
Venue: ACM SIGCHI Bulletin (1990)

This paper describes the user interface of a software system that supports production of a large geographic database. The user interface of the system facilitates coordination of a production team whose activities are separated in time and space. The user interface provides visibility into the status and organization of the production effort and provides easy access to the tools and data required to perform the work.
Seeing the text
Authors: Stephen A. Bernhardt
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1992)

The physical fact of the text, with its spatial appearance on the page, requires visual apprehension: a text can be seen, must be seen, in a process which is essentially different from the perception of speech. The written mode necessitates the arrangement of script or typeface, a process which gives visual cues to the verbal organization of the text. We might think of texts arranged along a continuum, from texts at one end which convey relatively little information visually, to texts at the opposite end which reveal substantial information through such visible cues as white space, illustrations, variation in typeface, and use of nonalphabetic symbols, such as numbers, asterisks, and punctuation. In terms of this continuum, an essay would fall well toward the nonvisually informative end. Certainly, paragraph indentation, margins, capitalization, and sentence punctuation provide some information to the reader, but such information is extremely limited, with most of the cues as to organization and logical relations buried within the text. At the other extreme of the continuum would be texts which display their structure, providing the reader/viewer with a schematic representation of the divisions and hierarchies which organize the text.
Small Sample Size Effects in Statistical Pattern Recognition: Recommendations for Practitioners
Authors: Sarunas J. Raudys, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The effects of sample size on feature selection and error estimation for several types of classifiers are discussed. The focus is on the two-class problem. Classifier design in the context of small design sample size is explored. The estimation of error rates under small test sample size is given. Sample size effects in feature selection are discussed. Recommendations for the choice of learning and test sample sizes are given. In addition to surveying prior work in this area, an emphasis is placed on giving practical advice to designers and users of statistical pattern recognition systems.
Style and substance in communication: implications for message structuring systems
Authors: Murli Nagasundaram
Venue: ACM SIGOIS Bulletin (1990)

An investigation into the requirements of a scale used for evaluating conference papers results in---quite surprisingly---some important implications for the design of message structuring systems.
t An Integrated Approach to Design of Protocol Specifications Using Protocol Validation and Synthesis
Authors: Yoshiaki Kakuda, Hironori Saito
Venue: IEEE Transactions on Computers (1991)

The authors propose an integrated approach to protocol specification design and a new method of synthesis of protocol specifications with more than one software module for the approach. In this approach, after designers specify protocols without any restrictions, errors included in the protocol specifications are automatically detected by the acyclic-expansion-based protocol validation and efficiently corrected by the component-based protocol synthesis. In the validation, incomplete specification parts consisting of executable state transition sequences to reach errors in each process are obtained. In the synthesis, the incomplete specification parts are completed by applying certain components which are provided as fundamental parts of correct specifications. The proposed approach has been implemented as an integrated system consisting of CAPE (computer-aided protocol engineering) tools for protocol validation and synthesis. The effectiveness of this approach has been confirmed experimentally. The proposed approach is expected to enhance the productivity of protocol specification design.
Computer-aided vs. manual program restructuring
Authors: William G. Griswold, David Notkin
Venue: ACM SIGSOFT Software Engineering Notes (1992)

Restructuring a software system as it evolves promises to reduce associated maintenance costs. To simplify restructuring, we have developed a tool that preserves the meaning of a program as the engineer applies structural transformations. To help evaluate the prototype tool and its underlying approach, we ran an experiment to compare how people using standard editing tools restructure a program against the computer-aided style that our tool supports.We drew three conclusions from the experiment. First, the subjects generally used a mix of copy/paste and cut/paste editing paradigms; our tool gives the engineer the safety of copy/paste and the speed of cut/paste. Second, most of the subjects made mistakes, including simple syntactic errors and semantic errors (such as not updating the call site after modifying a function definition); our tool avoids errors by the engineer using compensation (for instance, it automatically updates call sites when a procedure definition is changed) or by signalling an error. Third, manual restructuring tends to be haphazard, with engineers handling the order of changes, testing, etc. in inconsistent and potentially error-prone ways; by separating restructuring from functional maintenance and by ensuring preservation of meaning during restructuring, our approach can make the maintenance process more orderly.
Efficient construction of LR(k) states and tables
Authors: M. Anicona, G. Dodero, V. Gianuzzi, M. Morgavi
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1991)

A new method for building LR(k) states and parsing tables is presented. The method aims at giving a feasible construction of a collection of LR(k) parsing tables, especially when k > 1. for nontrivial grammars. To this purpose, the algorithm first attempts to build a set of normal states for the given grammar, each one associated to a single parsing action in {accept, reduce, shift}. When such an action cannot be uniquely determined, that is, when up to k input symbols have to be examined (inadequacy), further states, belonging to a new type, called look-ahead states, are computed. The action associated with inadequate states is a new parsing action, look. States are built without actual computation of the FIRSTk and EFFk functions; that is, nonterminals are kept in the context string of items composing each state, and their expansion to terminals is deferred until indispensable to solve inadequacy. The aforementioned method is illustrated; then the canonical collection of states and the canonical tables are compared with those obtained from the proposed method. A sufficient condition is stated, by which the size of parsing tables, obtained by applying this new method, is smaller than that of canonical tables. Experimental results show that such a condition is verified by the grammars of several programming languagues and that significant speed is gained by avoiding the computation of the FIRSTk function.
Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem
Authors: Naofumi Takagi, Shuzo Yajima
Venue: IEEE Transactions on Computers (1992)

Radix-2 and radix-4 modular multiplication hardware algorithms are proposed. Numbers are represented in a redundant representation and modular additions are performed without carry propagation. Serial-parallel modular multipliers based on them have a regular cellular array structure with a bit slice feature suitable for VLSI implementation. They are efficient especially in applications, such as an RSA cryptosystem, where modular multiplications are performed iteratively.
Integration of probabilistic fact and text retrieval
Authors: Norbert Fuhr
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

In this paper, a model for combining text and fact retrieval is described. A query is a set of conditions, where a single condition is either a text or fact condition. Fact conditions can be interpreted as being vague, thus leading to nonbinary weights for fact conditions with respect to database objects. For text conditions, we use descriptions of the occurence of terms in documents instead of precomputed indexing weights, thus treating terms similar to attributes. Probabilistic indexing weights for conditions are computed by introducing the notion of correctness (or acceptability) of a condition w.r.t. an object. These indexing weights are used in retrieval for a probabilistic ranking of objects based on the retrieval for a probabilistic ranking of objects based on the retrieval-with-probabilistic-indexing (RPI) model, for which a new derivation is given here.
Revisiting computer security in the business world
Authors: Maurice V. Wilkes
Venue: Communications of the ACM (1991)

In my first column (Communications, Apr. 1990) I discussed computer security in the business world. I remarked that whereas the military had always attached great importance to security, business managers regarded it as yet another demand on their budgets, and have required convincing about its importance. As a result, the military made most of the advances in research on computer security for a long time. They have evolved what is now a well-developed doctrine.
Versioning a full-text information retrieval system
Authors: Peter G. Anick, Rex A. Flynn
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

In this paper, we present an approach to the incorporation of object versioning into a distributed full-text information retrieval system. We propose an implementation based on &ldquo;partially versioned&rdquo; index sets, arguing that its space overhead and query-time performance make it suitable for full-text IR, with its heavy dependence on inverted indexing. We develop algorithms for computing both historical queries and time range queries and show how these algorithms can be applied to a number of problems in distributed information management, such as data replication, caching, transactional consistency, and hybrid media repositories.
2-D Shape Classification Using Hidden Markov Model
Authors: Yang He, Amlan Kundu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors present a planar shape recognition approach based on the hidden Markov model and autoregressive parameters. This approach segments closed shapes to make classifications at a finer level. The algorithm can tolerate a lot of shape contour perturbation and a moderate amount of occlusion. An orientation scheme is described to make the overall classification insensitive to shape orientation. Excellent recognition results have been reported. A distinct advantage of the approach is that the classifier does not have to be trained again when a new class of shapes is added.
Chess and supercomputers: details about optimizing Cray Blitz
Authors: Robert M. Hyatt, Harry L. Nelson
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

The Cray YMP (or XMP) computer system offers particular advantages for computer chess programs. This paper describes the architectural features that Cray Blitz [5,6] uses to search approximately 200,000 chess positions per second. It also describes the programming and algorithmic changes required to take advantage of each of several architectural features of the Cray family of computer systems.
Microcomputer spreadsheet software application in body development determination
Authors: Peter Kokol, Martin Bigec, Kurt Kancler
Venue: ACM SIGBIO Newsletter (1991)

The historical analysis of great data collections is a common practice in medical research. Performing such tasks manually is not only time consuming and tedious, but also very sensitive to errors. Computers with theirs ability to store and process information can enormously ease this work. But it is very hard for non-computer specialists like doctors, nurses and other medical staff to learn and use conventional programming tools and techniques. Using spreadsheet software, which is a very user friendly and easy to learn tool, is a possible solution. In this paper we first present a mathematical model based on Rohrer's indexes which we have developed to assist us in common pupil's body-development determination. Then we briefly present the spreadsheet software, and the spreadsheet implementation of the above model.
Design issues in a map language
Authors: M. P. Atkinson, C. Lécluse, P. Philbrow, P. Richard
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

This paper discusses various design issues that are being encountered during the design of a language which includes the highly parametric bulk types constructed using the map constructor. These maps are mutable stores holding sets of n element domains mapping to m element ranges. If the range is empty they behave as standard sets or relations. Issues of equality, ordering, variadicity, constancy, and choice of typing mechanism have all been encountered.
A reflexive perspective of CSCW
Authors: Andrew J. G. Cockburn, Harold Thimbleby
Venue: ACM SIGCHI Bulletin (1991)

Personal computing has had a major effect on the way that many people work; whole organisations have been revolutionised by tools such as filing systems and word processors. Whilst personal computing has enhanced the execution of work it has largely failed to support the cooperative environment in which it is done. CSCW (Computer Supported Cooperative Work) aims to remove this artificial division caused by the systemic focus on the single user and to replace it with systems supporting the wider, social, web of cooperation. Unfortunately CSCW in practice has failed in this task. This paper briefly discusses the reasons for this failure, and proposes a "reflexive perspective" of CSCW as an emphasis shift in current CSCW research which, it is argued and demonstrated by example, will result in greater success for future cooperative systems.
Integrated data capture and analysis tools for research and testing on graphical user interfaces
Authors: Monty L. Hammontree, Jeffrey J. Hendrickson, Billy W. Hensley
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Our on-line data capture and analysis tools include an event capture program, event data filtering programs, a multimedia data analyzer, and a retrospective verbal protocal recorder for use with the multimedia data analyzer. Off-line observation logging is also supported. Additional plans for development include the integration of an online time-synchronized observation logger, and time-synchronized eyetracking data recording. The tool set provides an integrated multi-source data collection, processing, and analysis system for: 1) comparing and evaluating software applications and prototypes; 2) evaluating software documentation and instructional materials; and 3) evaluating on-line training. The tools currently run on Macintosh computers and under Microsoft Windows. Plans are to port the tools to run under Presentation manager and Motif.
Behavioral synergy without explicit integration
Authors: Maja J. Mataric
Venue: ACM SIGART Bulletin (1991)

We address the problem of integrating a number of capabilities into a situated system without introducing a hybrid solution consisting of a reactive low-level, and a deliberative high-level. We demonstrate a fully intergrated physical system (a mobile robot) performing navigation, landmark detection, map learning, and planning, without explicit integration. Inspired by biology and the subsumption architecture, our approach proceeds bottom-up and is fully reactive. It maximizes the use of direct information from the world, and minimizes communication within the system. The control is fully distributed over all of the components, and does not use any manipulable data structures or symbolic representations. Instead, the representation of the entire system is homogeneous; it consists of simple reactive rules which encode both the control strategy and the knowledge of the system. The exchange of knowledge within the system is mostly done implicitly, by observing, and relying on, the effects of the other components. Integration is accomplished through the components' interaction with the environment. The homogeneous, behavior-based nature of the representation does not make a distinction between the reactive and deliberating parts of the system, making them all active and interactive.
An Optimizing Compiler for an SPAP Architecture Using AI Tools
Authors: Helnye Azaria, Adrian Dvir
Venue: Computer (1992)

A methodology that allows users to efficiently bridge the gap between high-level language and low-level microcode when implementing intensive mathematical operations and manipulations algorithms is discussed. The use of an optimized special-purpose array processor (SPAP) architecture for numerical computation and a host microprocessor for nonnumerical computation operations is described. The advantages of the optimizing compiler, the target architecture, and the compiler's implementation using AI tools are examined.
An experiment on measuring application performance over the Internet
Authors: Calton Pu, Frederick Korz, Robert C. Lehman
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

The use of wide area networks (WANs) such as the Internet is growing at a tremendous rate.Such networks hold great promise for new types of distributed applications, which will be widely distributed, highly replicated, intensely interactive, and adaptive to many types of network conditions. Developing such applications will require a solid understanding of the performance and availability characteristics of WANs as they evolve. The ability to measure the effect of these conditions will, for example, be important for large-volume applications such as digital libraries, and for near-real-time applications such as collaborative research and teleconferencing.