ppxscal/embedding_network huggingface dataset:
Evaluating performance appraisal systems for IS personnel
Authors: R. A. Zawacki, J. D. Couger
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

A survey of Performance Appraisal systems in IS organizations of Fortune 1000 firms revealed that improvements in attitudes and performance can be made by moving from traditional to collaborative appraisal systems such as MB0 (management by objective) or BARS (behaviorally anchored rating scales). Over 65 percent of the surveyed organizations using the above two performance appraisal systems believe performance is improved by the system. Only 43 percent of organizations using traditional systems believe performance is improved. Six systems are identified and compared: graphic rating, forced distribution, peer rating, subordinate rating, B.A.R.S. and M.B.O. Characteristics of P/A systems are analyzed and recommendations are discussed.
A logical theory of concurrent objects
Authors: José Meseguer
Venue: Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications (1990)

A new theory of concurrent objects is presented. The theory has the important advantage of being based directly on a logic called rewriting logic in which concurrent object-oriented computation exactly corresponds to logical deduction. This deduction is performed by concurrent rewriting modulo structural axioms of associativity, commutativity and identity that capture abstractly the essential aspects of communication in a distributed object-oriented configuration made up of concurrent objects and messages. Thanks to this axiomatization, it becomes possible to study the behavior of concurrent objects by formal methods in a logic intrinsic to their computation. The relationship with Actors and with other models of concurrent computation is also discussed. A direct fruit of this theory is a new language, called Maude, to program concurrent object-oriented modules in an entirely declarative way using rewriting logic; modules written in this language are used to illustrate the main ideas with examples. Maude contains OBJ3 as a functional sublanguage and provides a simple and semantically rigorous integration of functional programming and concurrent object-oriented programming.
Enhancing program readability and comprehensibility with tools for program visualization
Authors: R. Baecker
Venue: Proceedings of the 10th international conference on Software engineering (1988)

In order to make computer programs more comprehensible, the presentation of program source text, program documentation, and program execution needs to be enhanced over its conventional treatment. The paper describes a number of new techniques and tools developed to achieve these ends. One of these is a novel design for the effective presentation of source text in the C programming language using high quality digital typography, and a processor which implements the design. Some experimental evidence is summarized to demonstrate that the resulting source text presentation is significantly more readable and comprehensible than the presentation conventionally used today. Brief descriptions are also given of two other techniques, the development of a novel system of structured program documentation incorporating both text and graphics, and the portrayal of program execution with coloured computer animation.
Compacting MIMOLA microcode
Authors: J. Bhasker, T. Samad
Venue: ACM SIGMICRO Newsletter (1988)

We address the problem of reducing the word length of microprograms. Two techniques are described: overlaying of fields and encoding of the microprogram. Formal analysis are presented of different encoding methods, assuming a VLSI implementation. A maximal encoding strategy appears to be the most area-efficient. Field overlaying is formulated as a clique-partitioning problem, and an efficient and practical clique-partitioning algorithm is presented. Based on these results, a microward compaction strategy that consists of field overlaying followed by maximal encoding has been implemented for the MIMOLA synthesis system (a design tool that generates excessively long microinstructions). Some considerations that are relevant to MIMOLA, and probably general to other similar tools, are discussed.
Texture Segmentation Using Voronoi Polygons
Authors: M. Tüceryan, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Textures are defined in terms of primitives called tokens. A texture segmentation algorithm based on the Voronoi tessellation is discussed. The algorithm first builds the Voronoi tessellation of the tokens that make up the textured image. It then computes a feature vector for each Voronoi polygon. These feature vectors are used in a probabilistic relaxation labeling on the tokens, to identify the interior and the border regions of the textures. Some experimental results are shown.
Simulation with PCmodel
Authors: Y. G. Chung, D. A. White
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper reviews a PC-based graphic simulation system known as PCModel. PCModel takes a unique modeling approach by providing the user with a very simple yet powerful set of instructions for graphic modeling plus a highly interactive run-time control commands for effective What-if gaming. The flexibility and user-interactiveness of this system provides an accurate and economical tool for analyzing manufacturing systems.
Preparing for the future
Authors: M. Plazzi, W. Carlson, R. Lucas, M. Schweppe, M. Yanilmaz
Venue: ACM SIGGRAPH 89 Panel Proceedings (1989)

Welcome to Preparing for the Future, a panel on educational issues in computer graphics. The field of computer graphics education, as no other, combines the disciplines of science and art, and in this sense presents computer graphics instructors in both art and science with some unique problems not faced by their counterparts in other fields.As computer graphics courses become a standard addition in art and science curricula, the way in which we prepare students for this evolutionary field is changing.This panel explores the methods of establishing computer graphics curriculum and maintaining these programs. Panel members will share curricula developments and goals, its integration with existing courses, plan growth, raising monetary resources, hardware and software selection, and various educational issues.This session's panelists come from varied backgrounds -- private and public institutions with limited and unlimited resources to share their experiences with you.The first panelist will be Wayne Carlson, an assistant professor in the department of computer and information science at the Ohio State University.
Incorporating hierarchy in a relational model of data
Authors: H. V. Jagadish
Venue: Proceedings of the 1989 ACM SIGMOD international conference on Management of data (1989)

We extend the relational model of data to allow classes as attribute values, thereby permitting the representation of hierarchies of objects. Inheritance, including multiple inheritance with exceptions, is clearly supported. Facts regarding classes of objects can be stored and manipulated in the same way as facts regarding object instances. Our model is upwards compatible with the standard relational model.
Analysis of vector access performance on skewed interleaved memory
Authors: C.-L. Chen, C.-K. Liao
Venue: ACM SIGARCH Computer Architecture News (1989)

Memory interleaving and memory skewing are two hardware approaches to reduce memory access conflict for many advanced computer architectures, while pipelined vector computer covers many commercially available supercomputers. The goal of this paper is to study the vector accessing behavior on skewed interleaved memory under pipelined processing environment. We establish a criterion, called average time delay, to indicate the performance of a vector access; and a criterion, called aggregate average time delay to indicate the performance of a given memory system. Under these criteria, we analyze some memory design problems. These problems centralize how to design a memory system which is cost-effective and has less conflicts for vector accesses. We also propose a software approach to reduce memory access conflict, called dimension extension strategy. This strategy performs very well under our analysis.
Knowledge-based search tactics for an intelligent intermediary system
Authors: Philip J. Smith, Steven J. Shute, Beb Galdes, Mark H. Chignell
Venue: ACM Transactions on Information Systems (TOIS) (1989)

Research on the nature of knowledge-based systems for bibliographic information retrieval is summarized. Knowledge-based search tactics are then considered in terms of their role in the functioning of a semantically based search system for bibliographic information retrieval, EP-X. This system uses such tactics to actively assist users in defining or refining their topics of interest. It does so by applying these tactics to a knowledge base describing topics in a particular domain and to a database describing the contents of individual documents in terms of these topics. This paper, then, focuses on the two central concepts behind EP-X: semantically based search and knowledge-based search tactics.
Network shared variable processor
Authors: R. L. Potyok
Venue: ACM SIGAPL APL Quote Quad (1987)

The Network Shared Variable (NSV) and Network Shared Variable Processor (NSVP) provide a user signed on to a local SHARP APL system with the ability to communicate with a remote SHARP APL system over a communications interface by sharing a variable with a task on that remote system. More specifically, NSVP extends the shared variable protocol to allow communications between tasks on different computer systems. Together, they represent dynamic innovations in APL technology that provide greater computing flexibility and power to the end user and the data centre. NSVP encourages users to maximize the potentials of distributed applications as it helps organizations optimize their data centre resources. NSVP also reinforces the image of APL at the forefront of system software technology. The NSV, while transparent to the user after coupling, enables users to access data from other systems using just one set of commands, while it minimizes the human and hardware resources required to maintain the data centre. In several ongoing tests of the NSV prototype, the product has proven its value to a variety of organizations around the world with substantially different needs.
Generating interesting scenarios from system descriptions
Authors: Kaizhi Yue
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

A formal system specification is often written declaratively, in terms of the properties of the system components. This makes the system description modular and concise. However, this does not make the procedural aspects of the system easily understandable. Here arises the need for automatically generating interesting behavior patterns, specifically, scenarios. This paper is a preliminary report of our research in generating interesting scenarios. We define several types of scenarios of interest and discuss the algorithms for generating them. At the center of the algorithms is a data structure, called &ldquo;influence graphs,&rdquo; that reflects how the objects in a system affect one another.
Pattern Spectrum and Multiscale Shape Representation
Authors: P. Maragos
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The results of a study on multiscale shape description, smoothing and representation are reported. Multiscale nonlinear smoothing filters are first developed, using morphological opening and closings. G. Matheron (1975) used openings and closings to obtain probabilistic size distributions of Euclidean-space sets (continuous binary images). These distributions are used to develop a concept of pattern spectrum (a shape-size descriptor). A pattern spectrum is introduced for continuous graytone images and arbitrary multilevel signals, as well as for discrete images, by developing a discrete-size family of patterns. Large jumps in the pattern spectrum at a certain scale indicate the existence of major (protruding or intruding) substructures of the signal at the scale. An entropy-like shape-size complexity measure is also developed based on the pattern spectrum. For shape representation, a reduced morphological skeleton transform is introduced for discrete binary and graytone images. This transform is a sequence of skeleton components (sparse images) which represent the original shape at various scales. It is shown that the partially reconstructed images from the inverse transform on subsequences of skeleton components are the openings of the image at a scale determined by the number of eliminated components; in addition, two-way correspondences are established among the degree of shape smoothing via multiscale openings or closings, the pattern spectrum zero values, and the elimination or nonexistence of skeleton components at certain scales.
Polynomial Testing of Packet Switching Networks
Authors: J.-C. Liu, K. G. Shin
Venue: IEEE Transactions on Computers (1989)

A functional testing method called polynomial testing is proposed to test packet-switching networks (PSNs) used in multiprocessor systems. Focus is on applying the method to packet-switching multistage interconnection networks (PMINs). A multiple stuck-at (MSA) fault model is developed and faults are diagnosed at two different levels: network level and switch level. The former uses each processor as a tester and can test part of the network concurrently with the normal operations on the remaining part of the network; the latter uses switches in the network as testers and is inherently an autonomous testing method. To facilitate the network-level testing, the routing dynamic in a PMIN is eliminated by synchronizing switch operations. The network is then decomposed into routes, each of which is tested after transforming it into a polynomial calculator. For switch-level testing, a built-in tester (BIT) is embedded into each switch's structure to provide self-testing capabilities. Network-level testing is distributed and suitable for concurrent testing, whereas switch-level testing is done offline, and needs only a small testing time.
Reference model for DBMS user facility
Authors: John Gersting, Kate Kinsley, Nancy McDonald, John North, Mark Sastry
Venue: ACM SIGMOD Record (1988)

This report is a contribution to X3/SPARC Database system Study Group (DBSSG). The technical work represents the careful distillation of the contribution of the authors and others who have participated in the meetings and studies of the User Facility Task Group (UFTG) which is a sub-group of the DBSSG.
Complexity of irreducibility testing for a system of linear ordinary differential equations
Authors: D. Y. Grigoriev
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

Let a system of linear ordinary differential equations of the first order Y&prime; = AY be given, where A is n &times; n matrix over a field F(X), assume that the degree degX(A) < d and the size of any coefficient occurring in A is at most M. The system Y&prime; = AY is called reducible if it is equivalent (over the field F(X)) to a system Y&prime1 = A1Y1 with a matrix A1 of the form A1 = (A1,1 0) (A2,1 A2,2) An algorithm is described for testing irreducibility of the system with the running time exp(M(d2n)d2n).
Compiling C for vectorization, parallelization, and inline expansion
Authors: R. Allen, S. Johnson
Venue: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation (1988)

Practical implementations of real languages are often an excellent way of testing the applicability of theoretical principles. Many stresses and strains arise from fitting practicalities, such as performance and standard compatibility, to theoretical models and methods. These stresses and strains are valuable sources of new research and insight, as well as an oft-needed check on the egos of theoreticians. Two fertile areas that are often explored by implementations are Places where tractable models fail to match practice. This can lead to new models, and may also affect practice (e.g., the average programming language has become more context free over the last several decades). Places where existing algorithms fail to deal with practical problems effectively, frequently because the problems are large in some dimension that has not been much explored. The present paper discusses the application of a much studied body of algorithms and techniques [Alle 83, KKLW 80, Bane 76, Wolf 78, Wolf 82, Kenn 80, Lamp 74, Huso 82] for vectorizing and optimizing Fortran to the problem of vectorizing and optimizing C. In the course of this work some algorithms were discarded, others invented, and many were tuned and modified. The experience gave us insight into the strengths and weaknesses of the current theory, as well as into the strong and weak points of C on vector/parallel machines. This paper attempts to communicate some of those insights.
Integrating software engineering into an intermediate programming class
Authors: Laurie Honour Werth
Venue: ACM SIGCSE Bulletin (1988)

The emphasis on software engineering topics in the newest report on the second computer science class will have considerable impact on computer science education. Teaching issues arising from the incorporation of software engineering topics are discussed. Ideas for projects and group activities, together with approaches to encourage students to include ease of maintenance and user-friendly interfaces are provided.
Controlling the Adaptive Suspension Vehicle
Authors: T. E. Bihari, T. M. Walliser, M. R. Patterson
Venue: Computer (1989)

A description is given of the adaptive suspension vehicle (ASV), which is an experimental, six-legged walking vehicle, and its operation. The ASV software, which consists of more than 150000 lines of source code, is discussed. The application software is written in Pascal, and the operating system is written in PL/M and assembly language. The ASV software performs the following main duties: sensing, vehicle state determination, terrain modeling, motion planning, and stereo control.
Correction to 'Representational and Denotational Semantics of Digital Systems'
Authors: R. Boute
Venue: IEEE Transactions on Computers (1990)

Three errors are corrected which appeared in a paper by the author. The corrections relate to variable bindings in quantification and lambda abstraction, the notation for subranges of the integers, and the definition of monotonicity.
A radar simulation program for a 1024-processor hypercube
Authors: J. L. Gustafson, R. E. Benner, M. P. Sears, T. D. Sullivan
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

We have developed a fast parallel version of an existing synthetic aperture radar (SAR) simulation program, SRIM. On a 1024-processor NCUBE hypercube it runs an order of magnitude faster than on a CRAY X-MP or CRAY Y-MP processor. This speed advantage is coupled with an order of magnitude advantage in machine acquisition cost. SRIM is a somewhat large (30,000 lines of Fortran 77) program designed for uniprocessors; its restructuring for a hypercube provides new lessons in the task of altering older serial programs to run well on modern parallel architectures. We describe the techniques used for parallelization, and the performance obtained. Several novel parallel approaches to problems of task distribution, data distribution, and direct output were required. These techniques increase performance and appear to have general applicability for massive parallelism. We describe the hierarchy necessary to dynamically manage (i.e., load balance) a large ensemble. The ensemble is used in a heterogeneous manner, with different programs on different parts of the hypercube. The heterogeneous approach takes advantage of the independent instruction streams possible on MIMD machines.
Realities associated with parallel processing
Authors: D. E. Platt, A. R. Rossi, J. W. Wells, J. Becker
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

At the T. J. Watson Research Center, there is a very active Condensed Matter Physics Group engaged in the study of semiconductors such as silicon (Si) and gallium-arsenide (Ga-As)1. One of the most important computer codes developed at Watson is a Density Functional Program which is used to study the electronic structure of semiconductors. This program also consumes the most CPU time of all other production applications at Watson. Thus, it was decided to undertake the parallelization of this code not only with the hope of reducing elapsed time, improving turnaround on the IBM 30902, and conserving other system resources such as memory and disk space, but also in an attempt to test the IBM Parallel FORTRAN Compiler3 on a production program while developing an understanding of the impact of parallel jobs from a system standpoint. A speedup of 4.4 using 6 processors was achieved for this important scientific production code.
An extension of the database language SQL to capture more relational concepts
Authors: Gottfried Vossen, Jim Yacabucci
Venue: ACM SIGMOD Record (1988)

An extension of the database language SQL is described which introduces several new concepts into the language that are standard in the relational model, but surprisingly not present in available SQL-based systems such as SQL/DS and DB2.
A rule-based system for interactive proposal evaluation
Authors: David Helman, Joseph S. Burke
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

This paper is based upon two recent research programs - those of Stefik (1986; Stefik et al, 1987) and Malone et al (1987). Both concern interactive knowledge media, i.e., programs which support communications, networking, and the exchange of knowledge or information. We briefly describe these research programs, and relate them to our own program SIPE1 (System for Interactive Proposal Evaluation). The theoretical framework for SIPE1 is derived from research in cognitive science (Lakoff and Johnson, 1981) and the philosophy of knowledge (Helman, 1987). We present this research and then describe SIPE1 in detail. In the concluding section of the paper, we consider how the representation structures for SIPE1 can be elaborated so as to represent cases, examples, or paradigms.
High performance hypercube communications
Authors: G. Buzzard, T. Mudge
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

In this paper we present a high performance message transport scheme that is based upon packet routing. The advantages of our scheme are derived from two observations. The first is that given sufficient support from communications hardware, decreasing the message latency time can be much more important to total program execution time than increasing the bandwidth. The second observation is that, from the standpoint of message latency, existing routing strategies tend not to make productive use of much of their available link capacity. The scheme that we propose addresses these issues and leads to substantial performance improvements across a broad range of message loads.
Knowledge and natural language processing
Authors: Jim Barnett, Kevin Knight, Inderjeet Mani, Elaine Rich
Venue: Communications of the ACM (1990)

KBNL is a knowledge-based natural language processing system that is novel in several ways, including the clean separation it enforces between linguistic knowledge and world knowledge, and its use of knowledge to aid in lexical acquisition. Applications of KBNL include intelligent interfaces, text retrieval, and machine translation.