ppxscal/embedding_network huggingface dataset:
Networks for parallel processors: measurements and prognostications
Authors: D. C. Grunwald, D. A. Reed
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

Improvements in the performance of communication networks will soon alter the criteria for multicomputers efficient algorithm design. To study the performance of existing and proposed network implementations, we conducted parametric simulation studies of several message routing paradigms, assuming an equivalent hardware implementation. Using the results of these simulations, we have developed qualitative analytic models that provide insight into network behavior.
Draft for ACM self-assessment procedure on human-computer interaction
Authors: T. Carey
Venue: ACM SIGCHI Bulletin (1989)

A skeleton version of this self-assessment was published in the SIGCHI Bulletin, July 1988. That initial pilot version outlined the content, scope and question type planned. The comments received have been incorporated into the current version, which has questions on almost all the desired topics - the notable exception is a question on conceptual models. The purpose of this draft is to allow testing of the questions themselves, and subsequent revision. Note that the question format for an ACM self-assessment is constrained to ensure that individuals can assess the correctness of their answers. In practice this means multiple-choice questions are the favoured format, with some use of short answer questions. This imposes limitations on the self-assessment procedure, and not all topics in human-computer interaction fit well within these limitations. In some cases, I felt strongly that a topic must be included, even if the possible questions did not do it justice - for example, some of the questions asking for corrections to misconceptions.
A knowledge-based manager for software engineering projects
Authors: A. Agarwal, B. N. Jairam, M. L. Emrich, N. Murthy
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

Management aspects of software development have received little research interest. The SOFTMAN system addresses the automation of this feature of the SDLC. It is a knowledge-based system which tracks the health of a software development effort. By comparing user metrics to past environment standards, anomalies in the coding stage are detected and suggestions for solving them are offered. In addition, SOFTMAN can be used to tutor new personnel, perform what-if analysis, and build a corporate memory regarding management decisions.
Experiences with poker
Authors: David Notkin, Lawrence Snyder, David Socha, Mary L. Bailey, Bruce Forstall, Kevin Gates, Ray Greenlaw, Willian G. Griswold, Thomas J. Holman, Richard Korry, Gemini Lasswell, Robert Mitchell, Philip A. Nelson
Venue: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems (1988)

Experience from over five years of building nonshared memory parallel programs using the Poker Parallel Programming Environment has positioned us to evaluate our approach to defining and developing parallel programs. This paper presents the more significant results of our evaluation of Poker. The evaluation is driving our next effort in parallel programming environment; many of the results should be sufficiently general to apply to other related efforts.
CASE Tools and the IS workplace: Some findings form empirical research
Authors: W. J. Orlikowski
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

This paper explores the implications for IS personnel of the introduction and implementation of automated systems development aids, which are referred to as CASE (Computer Aided Software Engineering) Tools in today's IS environment. The discussion presented in this paper draws on an extensive, in-depth analysis of the use of these technologies that was conducted over a period of eight months in a large, multinational software consulting firm. The paper will conclude by making recommendations for practice and future research.
Determination of Camera Location from 2-D to 3-D Line and Point Correspondences
Authors: Y. Liu, T. S. Huang, O. D. Faugeras
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A method for the determination of camera location from two-dimensional (2-D) to three-dimensional (3-D) straight line or point correspondences is presented. With this method, the computations of the rotation matrix and the translation vector of the camera are separable. First, the rotation matrix is found by a linear algorithm using eight or more line correspondences, or by a nonlinear algorithm using three or more line correspondences, where the line correspondences are either given or derived from point correspondences. Then, the translation vector is obtained by solving a set of linear equations based on three or more line correspondences, or two or more point correspondences. Eight 2-D to 3-D line correspondences or six 2-D to 3-D point correspondences are needed for the linear approach; three 2-D to 3-D line or point correspondences for the nonlinear approach. Good results can be obtained in the presence of noise if more than the minimum required number of correspondences are used.
A Conflict-Free Routing Scheme on Multistage Interconnection Networks
Authors: W. Lin, T.-L. Sheu, C. R. Das, T.-Y. Feng, C.-L. Wu
Venue: IEEE Transactions on Computers (1989)

A conflict-free routing scheme is presented for a class of parallel and distributed computing systems. The core of the scheme is a quadtree communication structure. The quadtree structure suggests a general approach to mapping a class of parallel algorithms with intensive communication requirements for selecting data from many different sources and distributing data from a single source. By properly merging messages and efficiently replicating data, the quadtree structure can complete required communications in O(log/sub 4/ M) parallel steps, where M is the network size. It is shown that the size of a quadtree communication structure can be contracted and stretched by adjusting the number of descendent nodes without affecting its conflict-free property. The relationship between the computation/communication ratio of various parallel algorithms and the number of tree levels is presented, and finally, their joint effect on the response time of combining and distributing data messages is examined. This analysis helps determine the optimal adaptation of the quadtree for minimizing the overall algorithm execution time.
The prime factor non-binary discrete Fourier transform and use of Crystal_Router as a general purpose communication routine
Authors: G. Aloisio, N. Veneziani, J. S. Kim, G. C. Fox
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

We have implemented one of the Fast Fourier Transform algorithms, the Prime Factor algorithm (PFA), on the hypercube. On sequential computers, the PFA and other discrete Fourier transforms (DFT) such as the Winograd algorithm (WFA) are known to be very efficient. However, both algorithms require full data shuffling and are thus challenging to any distributed memory parallel computers. We use a concurrent communication algorithm, called the Crystal_Router for communicating shuffled data. We will show that the speed gained in reduced arithmetic compared to binary FFT is sufficient to overcome the extra communication requirement up to a certain number of processors. Beyond this point the standard Cooley-Tukey FFT algorithm has the best performance. We comment briefly on the application of the DFT to signal processing in synthetic aperture radar (SAR).
Matrix multiplication via arithmetic progressions
Authors: Don Coppersmith, Shmuel Winograd
Venue: Journal of Symbolic Computation (1990)

We present a new method for accelerating matrix multiplication asymptotically. Thiswork builds on recent ideas of Volker Strassen, by using a basic trilinear form which is not a matrix product. We make novel use of the Salem-Spencer Theorem, which gives a fairly dense set of integers with no three-term arithmetic progression. Our resulting matrix exponent is 2.376.
CAGD-Based Computer Vision
Authors: C. Hansen, T. C. Henderson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The authors explore the connection between CAGD (computer-aided geometric design) and computer vision. A method for the automatic generation of recognition strategies based on the 3-D geometric properties of shape has been devised and implemented. It uses a novel technique to quantify the following properties of features which compose models used in computer vision: robustness, completeness, consistency, cost, and uniqueness. By utilizing this information, the automatic synthesis of a specialized recognition scheme, called a strategy tree, is accomplished. Strategy trees describe, in a systematic and robust manner, the search process used for recognition and localization of particular objects in the given scene. The consist of selected 3-D features which satisfy system constraints and corroborating evidence subtrees which are used in the formation of hypotheses. Verification techniques, used to substantiate or refute these hypotheses are explored. Experiments utilizing 3-D data are presented.
Fundamentals of Bar Code Information Theory
Authors: Jerome Swartz, Ynjiun P. Wang
Venue: Computer (1990)

To compare encoding and decoding schemes requires one to first look into information and coding theory. This article discusses problems and possible solutions in encoding information.
Reprint from computing reviews
Authors: M. C. Loui
Venue: ACM SIGACT News (1989)

As a service to our readers, SIGACT News has reached an agreement to reprint review that originally appeared in Computing Reviews of books and articles of interest to the theoretical computer science community. Computing Reviews is a monthly journal that publishes critical reviews on a broad range of computing subject, including models of computation, formal languages, computational complexity theory, analysis of algorithms, and logics and semantics of programs. ACM members can receive a subscription of Computing Reviews for $30 per year by writing to ACM headquarters.
ProCEED: an expert system for multivariate process control systems design
Authors: V. K. Chawla, R. K. Ragade, P. B. Deshpande
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

Design and implementation of effective control systems is vital to the competitiveness of the process industry. Process control system design requires knowledge based systems which are capable of efficient numeric computing along with the symbolic reasoning. A brief survey presented in this paper shows that many industrial and academic research groups, are actively developing such knowledge based tools, in the U.S. and other countries. ProCEED, the expert system described in this paper has been developed on Digital's A.I. work-station and using Intellicorp's Knowledge Engineering Environment (KEE). This ideally combines the KEE and LISP based reasoning and Fortran based number crunching. The modular structure and the user interface permit easier integration of additional knowledge about existing systems, as well as incorporation of completely new controllers and processes. A controller design session begins with process modeling. Then the extent of interaction in the multivariable process is determined using a variety of techniques, including relative gain analysis and singular value decomposition, and conflicts among them are resolved. Based on the apparent interaction and controller implementation resources available to the user, multi-loop or completely multivariable forms of one or more control strategies, including proportional-integra-derivative mode control and simplified model predictive control, are chosen. The control systems are designed to achieve the specified performance criteria, utilizing the available numeric software in Fortran. The expert system presents the user with the design results and the simulation of the controlled system, in a graphical form.
Motion Estimation with More than Two Frames
Authors: H. Shariat, K. E. Price
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

The development of a general motion estimation system based on using three or more frames is reported. The relevant portion of the sequence is treated as a whole, thus simplifying the process of estimating the motion parameters, and making possible the computation of the motion parameters in terms of the natural center of motion. A general description of this motion estimation method is presented, with the derivation of motion equations for three cases (three points in three frames, two points in four frames, and one point in five frames). Results are given for real and synthetic images for the case of one point in five (and six) frames. On the average, the program converged quickly to the right answer for noiseless data. For noisy data, the answers were reasonable and their accuracy was directly a function of the amount of noise in the disparity vector.
Inherent Ambiguities in Recovering 3-D Motion and Structure from a Noisy Flow Field
Authors: G. Adiv
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

One of the major areas in research on dynamic scene analysis is recovering 3-D motion and structure from optical flow information. Two problems which may arise due to the presence of noise in the flow field are examined. First, motion parameters of the sensor or a rigidly moving object may be extremely difficult to estimate because there may exist a large set of significantly incorrect solutions which induce flow fields similar to the correct one. The second problem is in the decomposition of the environment into independently moving objects. Two such objects may induce optical flows which are compatible with the same motion parameters, and hence, there is no way to refute the hypothesis that these flows are generated by one rigid object. These ambiguities are inherent in the sense that they are algorithm-independent. Using a mathematical analysis, situations where these problems are likely to arise are characterized. A few examples demonstrate the conclusions. Constraints and parameters which can be recovered even in ambiguous situations are presented.
Effects of Sample Size in Classifier Design
Authors: K. Fukunaga, R. R. Hayes
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The effect of finite sample-size on parameter estimates and their subsequent use in a family of functions are discussed. General and parameter-specific expressions for the expected bias and variance of the functions are derived. These expressions are then applied to the Bhattacharyya distance and the analysis of the linear and quadratic classifiers, providing insight into the relationship between the number of features and the number of training samples. Because of the functional form of the expressions, an empirical approach is presented to enable asymptotic performance to be accurately estimated using a very small number of samples. Results were experimentally verified using artificial data in controlled cases and using real, high-dimensional data.
A network-based development environment for Ada
Authors: D. Ford, P. van der Linden
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

This paper describes the development environment achieved by integrating an Ada toolset with the Network Software Environment (NSE&trade;). The NSE is a CASE product developed at Sun Microsystems, Inc. that supports parallel software development in a distributed computing environment. The paper is organized as follows: The Issues (the problems we are trying to address and solve) NSE Overview (a description of the basics of the NSE) How Ada is integrated into the NSE How to Develop Ada Software Using NSE Comparison to Other Ada Development Environments Future Work References.
Desktop publishing on the mainframe: integrating APL2 and Ventura Publisher
Authors: Timo Laurmaa
Venue: ACM SIGAPL APL Quote Quad (1990)

This paper1 describes a facility that enables APL applications to be provided with high-quality output via integration of the mainframe APL 2 environment and a PC desktop publishing system. The facility is a combination of mainframe and PC applications, in which the mainframe transmits data to be efficiently processed in a PC.
Napier88&mdash;a database programming language?
Authors: Alan Dearle, Richard Connor, Fred Brown, Ron Morrison
Venue: Proceedings of the second international workshop on Database programming languages (1989)

This is a description of the Napier88 type system based on &ldquo;A Framework for Comparing Type Systems for Database Programming Languages&rdquo; by Albano et al.
Agenda: a personal information manager
Authors: S. Jerrold Kaplan
Venue: Communications of the ACM (1990)

The free-form, evolving, personal information that people deal with in the course of their daily activities requires more flexible data structures and data management systems than tabular data structures provide. A tool for managing personal information must conveniently handle freetextual data; allow for structure to evolve gracefully as the database grows; represent unnormalized data; and support data entry through database views. We have designed a new type of database that serves these needs&mdash;&ldquo;item/category&rdquo; database&mdash;and realized this design in a commercial personal computer software product named &ldquo;Agenda.&rdquo;
Queuing analysis of polling models
Authors: Hideaki Takagi
Venue: ACM Computing Surveys (CSUR) (1988)

A polling model is a system of multiple queues accessed by a single server in cyclic order. Polling models provide performance evaluation criteria for a variety of demand-based, multiple-access schemes in computer and communication systems. This paper presents an overview of the state of the art of polling model analysis, as well as an extensive list of references. In particular, single-buffer systems and infinite-buffer systems with exhaustive, gated, and limited service disciplines are treated. There is also some discussion of systems with a noncyclic order of service and systems with priority. Applications to computer networks are illustrated, and future research topics are suggested.
A neural control element in a control systems application
Authors: K. D. Reilly, Jowe W. Oliver
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

In this paper we present an application of the backpropagation algorithm from (artificial) neural network (ANS) theory to a process control problem. Our first goal in the overall study of which this paper is a first step is to utilize the ANS method to &ldquo;study&rdquo; the workings of the control process in order to capture certain fundamental aspects of it within the confines of a single ANS. The &ldquo;disciplined&rdquo; distributed nature of the ANS may be contrasted to the more idiosyncratic distributed control of the software embodying the process control logic. Capturing the logic in this fashion leads to a potential of supplanting a portion of the control system within the original programs and thus render it more manageable. Other aspects of the paper include introductory remarks on ANSs themselves and some summary and prospect remarks on how this present piece of work contributes to future research.
A Relational Notation for State Transition Systems
Authors: Simon S. Lam, A. Udaya Shankar
Venue: IEEE Transactions on Software Engineering (1990)

A relational notation for specifying state transition systems is presented. Several refinement relations between specifications are defined. To illustrate the concepts and methods, three specifications of the alternating-bit protocol are given. The theory is applied to explain auxiliary variables. Other applications of the theory to protocol verification, composition, and conversion are discussed. The approach is compared with previously published approaches.
On compile-time query optimization in deductive databases by means of static filtering
Authors: Michael Kifer, Eliezer L. Lozinskii
Venue: ACM Transactions on Database Systems (TODS) (1990)

We extend the query optimization techniques known as algebric manipulations with relational expressions [48] to work with deductive databases. In particular, we propose a method for moving data-independent selections and projections into recursive axioms, which extends all other known techniques for performing that task [2, 3, 9, 18, 20]. We also show that, in a well-defined sense, our algorithm is optimal among the algorithms that propagate data-independent selections through recursion.
Performance Evaluation of Nonrectangular Multistage Interconnection Networks
Authors: V. S. Cherkassky
Venue: IEEE Transactions on Computers (1988)

The performance is considered of unbuffered packet-switching nonrectangular multistage interconnection networks. Performance analysis is based on a simplified model for resolution of packet contention. An approximate closed-form analytical expression for the probability of packet acceptance is derived. Blocking characteristics of nonrectangular networks are analyzed and it is shown that for large nonrectangular networks, the probability of packet acceptance does not degrade with growth of network size.
An automatic motion planning system for a convex polygonal mobile robot in 2-dimensional polygonal space
Authors: K. Kedem, M. Sharir
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

We present an automatic system for planning the (translational and rotational) collision-free motion of a convex polygonal body B in two-dimensional space bounded by a collection of polygonal obstacles. The system consists of a (combinatorial, non-heuristic) motion planning algorithm, based on sophisticated algorithmic and combinatorial techniques in computational geometry, and is implemented on a Cartesian robot system equipped with a 2-D vision system. Our algorithm runs in the worst-case in time &Ogr;(kn&lgr;6(kn) log kn), where k is the number of sides of B, n is the total number of obstacle edges, and &lgr;6(r) is the (nearly-linear) maximum length of an (r, 6) Davenport Schinzel sequence. Our implemented system provides an &ldquo;intelligent&rdquo; robot that, using its attached vision system, can acquire a geometric description of the robot and its polygonal environment, and then, given a high-level motion command from the user, can plan a collision-free path (if one exists), and then go ahead and execute that motion.
Dynamic Page Migration in Multiprocessors with Distributed Global Memory
Authors: C. Scheurich, M. Dubois
Venue: IEEE Transactions on Computers (1989)

A mechanism called the pivot mechanism is introduced and described. It controls the dynamic migration of data pages between neighboring memory modules during program execution to improve the performance and programmability of multiprocessors with distributed global memory. The programmer or compiler is relieved from the data allocation task; moreover, because data allocation is dynamically modified to minimize communication traffic, algorithms with varying and unpredictable data access patterns can run efficiently. Flexible data migration serves the dual purpose of making algorithms the efficient machine-specific and making possible the efficient execution of algorithms for which a good static allocation is not possible. Simulation results based on a mesh-connected multiprocessor performing a matrix multiplication are presented.