ppxscal/embedding_network huggingface dataset:
The human aspects of computing: a note on this collection
Authors: Henry Ledgard
Venue: Communications of the ACM (1986)

What makes computer users happy? Can systems help humans to use them? Does programming sharpen other thinking skills? Is computer anxiety important? Will programmers use Ada packages? How do students learn programming concepts? Are spelling correctors at their limits? When does the work load on a terminal get too heavy? Are instruction sets too large? These nine questions define some important issues for those of us who study human factors&mdash;the ways hardware and software affect, and are affected by, their users. Although the major accomplishments in the field will always rest on careful inspiration, to some degree these questions can be resolved empirically. Generally, empirical work falls into three broad categories: With experiments the goal is to determine whether some design or principle A is better than some design or principle B. Ideally, experimenters should make some tentative hypothesis first, or at least, decide what needs to be known. In data collection the objective is to observe users, give questionnaires, examine listings, count errors, or otherwise record data. By examining such data, we are able to draw conclusions and discover trouble spots. General observation is a method that involves complete systems or prototypes. These systems are observed, measured in broad ways, compared, or iteratively redesigned to complement the behavior of typical users. The goal is to understand the needs of users and to optimize system behavior. Although not at all by choice, only the first two of these categories are represented in this collection. As with most papers that are accepted and appear in print, the reviewers or editors have some special reason for liking a paper in the first place. This reason may not appear in the reviews of the paper, but it does capture some underlying point or principle deemed to be important. Each of the articles in this special section is a short description of a study addressing one of the nine questions. The results of these studies do not always reinforce conventional wisdom. Some of the conclusions are provocative. I invite you to read the articles and to see whether you agree with their conclusions.
Automated Evaluation of OCR Zoning
Authors: Junichi Kanai, Stephen V. Rice, Thomas A. Nartker, George Nagy
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Many current optical character recognition (OCR) systems attempt to decompose printed pages into a set of zones, each containing a single column of text, before converting the characters into coded form. We present a methodology for automatically assessing the accuracy of such decompositions, and demonstrate its use in evaluating six OCR systems.
Technology trends in military simulation
Authors: Ivar Oswalt
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Technologies being developed to address military simulation requirements vary from advanced software and computer-aided system engineering tools to hardware improvements and new interface designs. This paper presents the technologies critical to military simulation, summarizes their status, proposes a concept of what technologies are likely to be applied in future military simulations, and concludes with a review of two current simulation architectures-SIMOBJECT and J-MASS (Joint Modeling And Simulation System).
Early experience with message-passing on the SHRIMP multicomputer
Authors: Edward W. Felten, Richard D. Alpert, Angelos Bilas, Matthias A. Blumrich, Douglas W. Clark, Stefanos N. Damianakis, Cezary Dubnicki, Liviu Iftode, Kai Li
Venue: ACM SIGARCH Computer Architecture News (1996)

The SHRIMP multicomputer provides virtual memory-mapped communication (VMMC), which supports protected, user-level message passing, allows user programs to perform their own buffer management, and separates data transfers from control transfers so that a data transfer can be done without the intervention of the receiving node CPU. An important question is whether such a mechanism can indeed deliver all of the available hardware performance to applications which use conventional message-passing libraries.This paper reports our early experience with message-passing on a small, working SHRIMP multicomputer. We have implemented several user-level communication libraries on top of the VMMC mechanism, including the NX message-passing interface, Sun RPC, stream sockets, and specialized RPC. The first three are fully compatible with existing systems. Our experience shows that the VMMC mechanism supports these message-passing interfaces well. When zero-copy protocols are allowed by the semantics of the interface, VMMC can effectively deliver to applications almost all of the raw hardware's communication performance.
Informedia Digital Video Library
Authors: M. Christel, T. Kanade, M. Mauldin, R. Reddy, M. Sirbu, S. Stevens, H. Wactlar
Venue: Communications of the ACM (1995)

The Informedia Digital Video Library Project is developing new technologies for creating full-content search and retrieval digital video libraries. Working in collaboration with WQED Pittsburgh, the project is creating a testbed that will enable K-12 students to access, explore, and retrieve science and mathematics materials from the digital video library. The library will initially contain 1,000 hours of video from the archives of project partners: WQED, Fairfax Co. VA Schools' Electronic BBC-produced video courses. (Industrial partners include Digital Equipment Corp., Bell Atlantic, Intel Corp., and Microsoft, Inc.) This library will be installed at Winchester Thurston School, an independent K-12 school in Pittsburgh.
Characterizing plans as a set of constraints&mdash;the <I-N-OVA> model&mdash;a framework for comparative analysis
Authors: Austin Tate
Venue: ACM SIGART Bulletin (1995)

This paper presents an approach to representing and manipulating plans based on a model of plans as a set of constraints. The lt;I-N-OVA gt; model 1 is used to characterise the plan representation used within O-Plan and to relate this work to emerging formal analyses of plans and planning. This synergy of practical and formal approaches can stretch the formal methods to cover realistic plan representations as needed for real problem solving, and can improve the analysis that is possible for production planning systems. lt;I-N-OVA gt; is intended to act as a bridge to improve dialogue between a number of communities working on formal planning theories, practical planning systems and systems engineering process management methodologies. It is intended to support new work on automatic manipulation of plans, human communication about plans, principled and reliable acquisition of plan information, and formal reasoning about plans.
Recognizing Human Facial Expressions From Long Image Sequences Using Optical Flow
Authors: Yaser Yacoob, Larry S. Davis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1996)

An approach to the analysis and representation of facial dynamics for recognition of facial expressions from image sequences is presented. The algorithms utilize optical flow computation to identify the direction of rigid and nonrigid motions that are caused by human facial expressions. A mid-level symbolic representation motivated by psychological considerations is developed. Recognition of six facial expressions, as well as eye blinking, is demonstrated on a large set of image sequences.
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
Authors: Jang-Ping Sheu, Chao-Tsung Wu, Tzung-Shi Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Based on the Mendia and Sarkar's algorithm [8], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an $n$-dimensional star graph, our algorithm takes $O(n\log_2 n)$ time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting $m$ packets in a pipeline fashion takes $O(m\log_2 n + n\log_2 n)$ time due to the nonredundant property of our broadcasting algorithm.Index Terms¿Broadcasting, interconnection networks, star graphs.
A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization
Authors: R. Baker Kearfott
Venue: ACM Transactions on Mathematical Software (TOMS) (1995)

An environment for general research into and prototyping of algorithms for reliable constrained and unconstrained global nonlinear optimization and reliable enclosure of all roots of nonlinear systems of equations, with or without inequality constraints, is being developed. This environment should be portable, easy to learn, use, and maintain, and sufficiently fast for some production work. The motivation, design principles, uses, and capabilities for this environment are outlined. The environment includes an interval data type, a symbolic form of automatic differentiation to obtain an internal representation for functions, a special technique to allow conditional branches with operator overloading and interval computations, and generic routines to give interval and noninterval function and derivative information. Some of these generic routines use a special version of the backward mode of automatic differentiation. The package also includes dynamic data structures for exhaustive search algorithms.
On the Iterative Solution of Hermite CollocationEquations
Authors: Yu-Ling Lai, Apostolos Hadjidimos, Elias N. Houstis, John R. Rice
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

Collocation methods based on bicubic Hermite piecewise polynomials have been proven to be effective techniques for solving general second order linear elliptic partial differential equations (PDEs) with mixed boundary conditions [ACM Trans. Math. Software, 11 (1985), pp.~379--412]. The corresponding system of discrete collocation equations is generally nonsymmetric and nondiagonally dominant. Methods for their iterative solution are not known and are currently solved using Gauss elimination with scaling and partial pivoting. Point iterative methods like those in ITPACK [Tech. Report CNA-216, Center for Numerical Analysis, Univ. of Texas at Austin, April 1988] do not converge even for the collocation equations obtained from the discretization of model PDE problems. The development of efficient iterative solvers for these collocation equations is necessary for the case of three-dimensional PDE problems and their parallel solution, since direct solvers tend to be space bound and their parallelization is difficult. In this paper block iterative methods are developed and analyzed for the collocation equations corresponding to elliptic PDEs defined on a rectangle and subject to uncoupled mixed boundary conditions. For these types of PDE problems certain boundary degrees of freedom of the collocation approximation can be predetermined symbolically [Houstis, Mitchell, and Rice]. The remaining equations are called "interior" collocation equations. The system of all discrete equations is referred to as "general" collocation equations. Papatheodorou [Math. Comp., 41 (1983), pp.~511--525] was first to determine the exact parameters of accelerated overrelaxation (AOR)-type iterative methods for the case of "interior" collocation equations associated with a model problem. This paper generalizes the results of Papatheodorou for the "interior" collocation equations and presents new results for a particular class of "general" collocation equations. Specifically, in the case of a model elliptic PDE problem with uncoupled mixed boundary conditions, analytic expressions are derived for the eigenvalues of the block Jacobi iteration matrix based on a new partitioning of the interior collocation matrix, and the optimal overrelaxation factors are determined for the block successive overrelaxation (SOR) iterative method. A number of numerical results are presented to verify the theoretical analysis of the block SOR method and to compare its convergence behavior with those of the block Jacobi, Gauss--Seidel and the optimal AOR of Papatheodorou. Furthermore, the authors compare the time and memory complexity of the block SOR, LINPACK Band GE, and generalized minimal residual (GMRES) mathematical software for solving the Hermite collocation equations obtained from the discretization of several PDE problems. The numerical results indicate that the block SOR is an efficient method for solving these equations.
Introduction to SLAM II and SLAMSYSTEM
Authors: Jean J. O'Reilly
Venue: Proceedings of the 27th conference on Winter simulation (1995)

SLAM II is a general-purpose language which has been used since 1979 to model a wide variety of systems in fields including (but not limited to) manufacturing, transportation, communication, computer systems, military operations, health care and banking. Experience with these applications, plus development in simulation research, have led to the expansion of the language throughout its lifetime. The ease of using the SLAM II language was greatly increased by the introduction of SLAMSYSTEM in 1988; SLAMSYSTEM Version 4.5 is the most recent release, arriving in 1994. SLAMSYSTEM is an integrated simulation system based on the Microsoft Windows interface (under MS-DOS) or the OS/2 Presentation Manager. This tutorial demonstrates the process of building, analyzing, and presenting SLAM II simulation models using SLAMSYSTEM. A major revision of the product is under development as of this writing and is described in the tutorial.
External Descriptions and Staircase Forms in Implicit Systems
Authors: Vassilis Syrmos, Petr Zagalak, Vladimir Kucera
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

This paper studies the relationship between staircase forms and normal external descriptions in implicit systems. The authors show how to compute the proper and nonproper controllability indices of an implicit system using the reachability Hessenberg form and the corresponding normal external description. The normal external description of the system is computed using embedding techniques. Finally, the differences and similarities between the normal external descriptions computed are shown using the reachability and controllability Hessenberg forms of an implicit system.
Self-Assessment Procedure XIV: a self-assessment procedure dealing with the legal issues of computing
Authors: Jane P. Devlin, William A. Lowell, Anne E. Alger
Venue: Communications of the ACM (1985)

A self-assessment procedure dealing with the legal issues of computing
Automatic data layout for high performance Fortran
Authors: Ken Kennedy, Ulrich Kremer
Venue: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) (1995)

High Performance Fortran (HPF) is rapidly gaining acceptance as a language for parallel programming. The goal of HPF is to provide a simple yet efficient machine independent parallel programming model. Besides the algorithm selection, the data layout choice is the key intellectual step in writing an efficient HPF program. The developers of HPF did not believe that data layouts can be determined automatically in all cases, Therefore HPF requires the user to specify the data layout. It is the task of the HPF compiler to generate efficient code for the user supplied data layout. The choice of a good data layout depends on the HPF compiler used, the target architecture, the problem size, and the number of available processors. Allowing remapping of arrays at specific points in the program makes the selection of an efficient data layout even harder. Although finding an efficient data layout fully automatically may not be possible in all cases. HPF users will need support during the data layout selection process. In particular, this support is necessary if the user is not familiar with the characteristics of the target HPF compiler and target architecture, or even with HPF itself. Therefore, tools for automatic data layout and performance estimation will be crucial if the HPF is to find general acceptance in the scientific community. This paper discusses a framework for automatic data layout for use in a data layout assistant tool for a data-parallel language such as HPF. The envisioned tool can be used to generate a first data layout for a sequential Fortran program without data layout statements, or to extend a partially specified data layout in a HPF program to a totally specified data layout. Since the data layout assistant is not embedded in a compiler and will run only a few times during the tuning process of an application program, the framework can use techniques that may be too computationally expensive to be included in a compiler. A prototype data layout assistant tool based on our framework has been implemented as part of the D system currently under development at Rice University. The paper reports preliminary experimental results. The results indicate that the framework is efficient and generates data layouts of high quality.
Real-Time Bidirectional Search: Coordinated Problem Solving in Uncertain Situations
Authors: Toru Ishida
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1996)

This paper investigates real-time bidirectional search (RTBS) algorithms, where two problem solvers, starting from the initial and goal states, physically move toward each other. To evaluate the RTBS performance, two kinds of algorithms are proposed and are compared to real-time unidirectional search. One is called centralized RTBS where a supervisor always selects the best action from all possible moves of the two problem solvers. The other is called decoupled RTBS where no supervisor exists and the two problem solvers independently select their next moves.Experiments on mazes and n-puzzles show that 1) in clear situations decoupled RTBS performs better, while in uncertain situations, centralized RTBS becomes more efficient, and that 2) RTBS is more efficient than real-time unidirectional search for 15- and 24-puzzles but not for randomly generated mazes. It will be shown that the selection of the problem solving organization is the selection of the problem space, which determines the baseline of the organizational efficiency; once a difficult problem space is selected, the local coordination among problem solvers hardly overcome the deficit.
Pattern matching and pattern discovery in scientific, program, and document databases
Authors: Jason T. L. Wang, Kaizhong Zhang, Dennis Shasha
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

Over the past several years we have created or borrowed algorithms for combinatorial pattern matching and pattern discovery on sequences [2] and trees.In matching problems, given a pattern, a set of data objects and a distance metric, we find the distance between the pattern and one or more data objects. In discovery problems by contrast, given a set of objects, a metric, and a distance, we seek a pattern that matches many of those objects within the given distance. (So, discovery is a lot like data mining.) Our toolkit performs both matching and discovery with current targeted applications in molecular biology and document comparison.
Fast Transform Based Preconditioners for ToeplitzEquations
Authors: E. Boman, I. Koltracht
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

We present a new preconditioner for $n\times n$ symmetric, positive definite Toeplitz systems. This preconditioner is an element of the $n$--dimensional vector space of matrices that are diagonalized by the discrete sine transform. Conditions are given for which the preconditioner is positive definite and for which the preconditioned system has asymptotically clustered eigenvalues. The diagonal form of the preconditioner can be calculated in $O(n\log(n))$ operations if $n=2^k-1.$ Thus only $n$ additional parameters need be stored. Moreover, complex arithmetic is not needed. To use the preconditioner effectively, we develop a new technique for computing a fast convolution using the discrete sine transform (also requiring only real arithmetic). The results of numerical experimentation with this preconditioner are presented. Our preconditioner is comparable, and in some cases superior, to the standard circulant preconditioner of Tony Chan. Possible generalizations for other fast transforms are also indicated.
Fork diagrams for teaching selection in CS I
Authors: Amruth N. Kumar
Venue: ACM SIGCSE Bulletin (1996)

We propose a fork diagram as a visual representation of the algorithm for binary selection. Among other things, fork diagrams can be used to teach students how to write correctly nested if-else statements, analyze nested selection code, appreciate the problem of dangling else, and understand short circuit evaluation of conditions with boolean operators (and and or). We have used C code to illustrate concepts, although fork diagrams can be used for any high level language.
The Uniformly 3-Homogeneous Subsets of PGL(2, q)
Authors: Jürgen Bierbrauer
Venue: Journal of Algebraic Combinatorics: An International Journal (1995)

We use the character-table of PGL(2, q) to determine the subsets of that group acting uniformly 3-homogeneously on the projective line.
JLINK&mdash;Janus fast movers
Authors: William J. Caldwell, Ralph Wood, Maria C. Pate
Venue: Proceedings of the 27th conference on Winter simulation (1995)

This paper summarizes a two year project, called JLINK, which enables the Janus, Army constructive interactive simulation to be connected to manned land and air combat vehicle simulators, using distributed interactive simulation (DIS) protocol data units (PDU). The JLINK project was one of the first to demonstrate that a constructive simulation can be connected to and realistically interact with DIS compliant virtual combat vehicle and aircraft simulators. This paper discusses how this was accomplished, highlights the major considerations involved, and describes the interface model that was developed to connect Janus to the DIS world. The paper concludes with a discussion of the Janus Fast Movers Project which connected Janus to an Air Force F-16C manned virtual aircraft simulator.
Contrasting grey system theory to probability and fuzzy
Authors: David K. W. Ng, Julong Deng
Venue: ACM SIGICE Bulletin (1995)

By contrasting grey system theory with probability theory, statistics, and fuzzy systems, we know the features that make the grey system different are: bull; reality law bull; grey hazy set (foundation) bull; small sample (data) bull; nonrequirement for distribution bull; Disregard of a priori-experience
Edge and Line Feature Extraction Based on Covariance Models
Authors: Ferdinand van der Heijden
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Image segmentation based on contour extraction usually involves three stages of image operations: feature extraction, edge detection and edge linking. This paper is devoted to the first stage: a method to design feature extractors used to detect edges from noisy and/or blurred images. The method relies on a model that describes the existence of image discontinuities (e.g. edges) in terms of covariance functions. The feature extractor transforms the input image into a ¿log-likelihood ratio¿ image. Such an image is a good starting point of the edge detection stage since it represents a balanced trade-off between signal-to-noise ratio and the ability to resolve detailed structures. For 1-D signals, the performance of the edge detector based on this feature extractor is quantitatively assessed by the so called ¿average risk measure.¿ The results are compared with the performances of 1-D edge detectors known from literature. Generalizations to 2-D operators are given. Applications on real world images are presented showing the capability of the covariance model to build edge and line feature extractors. Finally it is shown that the covariance model can be coupled to a MRF-model of edge configurations so as to arrive at a maximum a posteriori estimate of the edges or lines in the image.