ppxscal/embedding_network huggingface dataset:
An Architecture for High Performance Engineering Information Systems
Authors: Nick Roussopoulos, Leo Mark, Timos Sellis, Christos Faloutsos
Venue: IEEE Transactions on Software Engineering (1991)

Commercially available database systems do not meet the information and processing needs of design and manufacturing environments. A new generation of systems-engineering information systems-must be built to meet these needs. The architectural and computational aspects of such systems are addressed, and solutions are proposed. The authors argue that a mainframe-workstation architecture is needed to provide distributed functionality while ensuring high availability and low communication overhead, that explicit control of metaknowledge is needed to support extendibility and evolution, that large rule bases are needed to make the knowledge of the systems active, and that incremental computation models are needed to achieve the required performance of such engineering information systems.
Discontinuity Meshing for Accurate Radiosity
Authors: Dani Lischinski, Filippo Tampieri, Donald P. Greenberg
Venue: IEEE Computer Graphics and Applications (1992)

An algorithm for compactly and accurately capturing the illumination of a diffuse polyhedral environment caused by an area light source is presented. The algorithm constructs a discontinuity mesh that explicitly represents discontinuities in the radiance function as boundaries between mesh elements. A piecewise quadratic interpolant is used to approximate the radiance function, preserving the discontinuities associated with the edges in the mesh.
Solutions to the Minimization Problem of Fault-Tolerant Logic Circuits
Authors: Ahmed E. Barbour
Venue: IEEE Transactions on Computers (1992)

The optimization problem of a general approach for designing fault-tolerant circuits is investigated. The gate minimization problem is solved so that optimal design with respect to the numbers of gates and levels is obtained. The concept and properties of block design are used to formulate, solve for, and construct the optimal form. The gate minimization problem for a fault-tolerant circuit is formulated and a lower bound to the number of minimum gates for any design is established. For certain design parameters, explicit minimum solutions are given. When no minimum solution is found, sets of explicit block designs which produce near-minimum designs are characterized. In both cases, minimum and near-minimum algorithms which generate the blocks required to construct the logic for fault-tolerant circuits in linear times are devised. If a block design does not have any connection with the minimum or near-minimum classes, an approximation algorithm which generates near-minimum blocks in a polynomial time is suggested.
Performance of multiple-bus multiprocssor under non-uniform memory reference model (abstract)
Authors: M. A. Sayeed, M. Atiquzzaman
Venue: ACM SIGARCH Computer Architecture News (1992)

Performance evaluation of multiple-bus multiprocessor systems is usually carried out under the assumption of uniform memory reference model. Hot spots arising in multiprocessor systems due to the use of shared variable, synchronization primitives etc., give rise to non-uniform memory reference patterns. The objective of this paper is to study the performance of multiple bus multiprocessor system in the presence of hot spots. Analytic expressions for the average memory bandwidth and probability of acceptance of prioritized processors have been derived. The results are validated by simulation results.
Reinforcement of Linear Structure using Parametrized Relaxation Labeling
Authors: James S. Duncan, Thomas Birkhölzer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The problem of reinforcing local evidence of linear structure while suppressing unwanted information in noisy images is considered, using a modified form of relaxation labeling. The methodology is based on parametrizing a continuous set of orientation labels via a single vector and using a sigmoidal thresholding function to bias neighborhood influence and ensure convergence to a meaningful stable state. Label strength and label/no-label decisions are incorporated into a single functional. Optimal points of the functional represent the cases where as many pixels (objects) as possible have achieved the desirable linear-structure-reinforced and noise-suppressed labelings. Three different linear structure reinforcement tasks are considered within the general framework: edge reinforcement, edge reinforcement with thinning, and bar (line segment) reinforcement. Results from several image data sets are presented. This approach can directly handle continuous feature information from low-level image analysis operators, and the computational complexity of labeling is reduced.
Animation aerodynamics
Authors: Jakub Wejchert, David Haumann
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

Methods based on aerodynamics are developed to simulate and control the motion of objects in fluid flows. To simplify the physics for animation, the problem is broken down into two parts: a fluid flow regime and an object boundary regime. With this simplification one can approximate the realistic behaviour of objects moving in liquids or air. It also enables a simple way of designing and controlling animation sequences: from a set of flow primitives, an animator can design the spatial arrangement of flows, create flows around obstacles and direct flow timing. The approach is fast, simple, and is easily fitted into simulators that model objects governed by classical mechanics. The methods are applied to an animation that involves hundreds of flexible leaves being blown by wind currents.
APL2 implementation of cross-system shared variables
Authors: James A. Brown, Erik Kane
Venue: ACM SIGAPL APL Quote Quad (1992)

This paper discusses the requirement for intermachine communication and how this requirement is met with APL2's cross-system shared variables. One problem encountered in the design is the mapping of APL2's cooperative peer-to-peer communication model onto a client server data transport mechanism. Another is the ability of APL2's sharing mechanism to address applications on other machines. The goal of the facility is to provide a high level of communication between applications running on different machines while introducing the minimum language extension.
The development of a computer-based decision support system for use in evaluating candidates for the position of programmer-analyst
Authors: Hae-Ching Chang, Raymond McLeod,  Jr.
Venue: ACM SIGCPR Computer Personnel (1991)

Human resource selection is an area where computer-based decision support holds great promise. A key component of the selection process is the face-to-face job interview. This paper describes an effort to develop a computer-based decision support system to assist the interviewer in evaluating job candidates. The described system uses behavioral anchors, descriptions of past behaviors that can provide useful references for evaluating different characteristics of a candidate. The portion of the development project that has been completed thus far includes the elicitation of the anchors from an expert interviewer and the refinement of the anchors so that they provide uniform support for all of the selection criteria. The remaining steps will include an experiment designed to understand the effects of these anchors on novice managers, and the development of a DSS based on the anchors. The purpose of describing the research at this point is to disseminate the knowledge concerning the system design with the hope of stimulating similar research in this important area of human resource management.
Speed up of test generation using high-level primitives
Authors: Ramachandra P. Kunda, Jacob A. Abraham, Bharat Deep Rathi, Prakash Narain
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We propose a general methodology to speed up the test generation process for circuits with high-level primitives. Our search procedure is a variation of depth first search that tries to fully exploit the capabilities of a computer to execute complex arithmetic and logical operations. We present techniques for signal value justification, and fault propagation, which are used by our algorithm. We have implemented a dependency-directed backtracking method to speed up our algorithm. This methodology has been applied to six circuits and the results are found to be very encouraging.
Initial draft guidelines for the development of the next-generation spoken language systems speech research database
Authors: George R. Doddington
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

To best serve the strategic needs of the DARPA SLS research program by creating the next-generation speech database(s).
Semantic file systems
Authors: David K. Gifford, Pierre Jouvelot, Mark A. Sheldon, James W. O'Toole,  Jr.
Venue: ACM SIGOPS Operating Systems Review (1991)

A semantic file system is an information storage system that provides flexible associative access to the system's contents by automatically extracting attributes from files with file type specific transducers. Associative access is provided by a conservative extension to existing tree-structured file system protocols, and by protocols that are designed specifically for content based access. Compatiblity with existing file system protocols is provided by introducing the concept of a virtual directory. Virtual directory names are interpreted as queries, and thus provide flexible associative access to files and directories in a manner compatible with existing software. Rapid attribute-based access to file system contents is implemented by automatic extraction and indexing of key properties of file system objects. The automatic indexing of files and directories is called "semantic" because user programmable transducers use information about the semantics of updated file system objects to extract the properties for indexing. Experimental results from a semantic file system implementation support the thesis that semantic file systems present a more effective storage abstraction than do traditional tree structured file systems for information sharing and command level programming.
The Hermes language in outline form
Authors: Andy Lowry
Venue: ACM SIGPLAN Notices (1992)

Hermes is an experimental language for writing disgributed applications and systems. The language is fully described elsewhere[1]. This report summarizes the major features of The language and provides numerous short code fragments to illustrate the various constructs. Missing from this report is any discussion of user-defined constraints, which are in any case not yet supported in the prototype implementation we have developed. Those wishing to obtain the prototype software may do so via anonymous ftp to software.watson.ibm.com (IP address 129.34.139.5); the files/pub/README.FTP and/pub/hermes/README provide further instructions.
The AT T teaching theater at the University of Maryland at College Park
Authors: Walter Gilbert
Venue: ACM SIGUCCS Newsletter (1991)

The University of Maryland at College Park, with the support of AT amp;T, has designed and constructed a classroom where technology is used to promote teaching and learning. That is, the focus is on teaching and learning, not on the technology; the computers, networking, and audio/visual equipment are simply a means to help accomplish effective learning. The result is called the AT amp;T Teaching Theater: "Using technology to transform lectures and learning."
VLSI Architectures for Multidimensional Transforms
Authors: Chaitali Chakrabarti, Joseph JáJá
Venue: IEEE Transactions on Computers (1991)

The authors propose a family of VLSI architectures with area-time tradeoffs for computing (N*N* . . . *N) d-dimensional linear separable transforms. For fixed-precision arithmetic with b bits, the architectures have an area A=O(N/sup d+2a/) and computation time T=O(dN/sup d/2-a/b), and achieve the AT/sup 2/ bound of AT/sup 2/=O(n/sup 2/b/sup 2/) for constant d, where n=N/sup d/ and O>a>or=d/2.
A Neural Network Expert System for Diagnosing and Treating Hypertension
Authors: Riccardo Poli, Stephano Cagnoni, Riccardo Livi, Giuseppe Coppini, Guido Valli
Venue: Computer (1991)

Hypernet (Hypertension Neural Expert Therapist), a neural network expert system for diagnosing and treating hypertension, is described. After a brief look at artificial neural networks, the authors describe the structure of the three modules that make up Hypernet, starting with the specific problem each network is intended to solve and explaining how the network is expected to operate. The tools developed for implementing the system are a compiler for a simple descriptive language that enables the authors to define, train, and test networks; a graphic editor that translates the network drawn by the user into the proper statements; and a set of programs for interactively generating the examples. The data used as examples, the learning phase, and the results of tests for evaluating the performance of each network are described. and conclusions about overall system results are presented.
Analysis of Detection Capability of Parallel Signature Analyzers
Authors: Yinghua Min, Yashwant K. Malaiya, Boping Jin
Venue: IEEE Transactions on Computers (1991)

A rigorous mathematical analysis is presented to identify error conditions under which aliasing can occur for several common types of serial signature analyzers (SSAs) and parallel signature analyzers (PSAs). The PSAs are faster and require less hardware than the SSAs; however, for PSAs some double errors are a special cause of concern. Such aliasing errors are analyzed and it is shown that PSA pairs can be identified for which these errors are disjoint. Novel reconfigurable PSA designs are presented which use a two-signature scheme to detect all double errors.
Continuous speech recognition from a phonetic transcription
Authors: S. E. Levinson, A. Ljolje, L. G. Miller
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

A long-standing and widely accepted linguistic theory of speech recognition holds that natural spoken messages are understood on the basis of an intermediate representation of the acoustic signal in terms of a small number of phonetic symbols. The traditional linguistic theory is very attractive for several reasons. First, it provides a natural way to partition the process of communication by spoken language into distinct acoustic, phonetic, lexical and syntactic sub-processes. Second, it provides for a reduction in bandwidth at each successive stage of the process. And, finally, it seems to be reflected in the development of written language. It is thus not surprising that this seminal idea formed the basis for several early speech recognition machines [1, 2, 3, 4].
State Constraints and Pathwise Decomposition of Programs
Authors: J. C. Huang
Venue: IEEE Transactions on Software Engineering (1990)

A state constraint is a programming construct designed to restrict a program's domain of definition. It can be used to decompose a program pathwise, i.e. dividing the program into subprograms along the control flow, as opposed to dividing the program across the control flow when the program is decomposed into functions and procedures. As a result, a program consisting of one or more execution paths of another program can be constructed and manipulated. The author describes the idea involved, examines the properties of state constraints, establishes a formal basis for pathwise decomposition and discusses their uses in program simplification, testing and verification.
Small Diameter Symmetric Networks From Linear Groups
Authors: Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton
Venue: IEEE Transactions on Computers (1992)

A report is presented on a collection of constructions of symmetric networks that provide the largest known values for the number of nodes that can be placed in a network of a given degree and diameter. Some of the constructions are in the range of current potential engineering significance. The constructions are Cayley graphs of linear groups obtained by experimental computation.
Type-safe linkage for variables and functions
Authors: Diomidis Spinellis
Venue: ACM SIGPLAN Notices (1991)

In a separate compilation environment type checks across modules are difficult to implement, because the natural place to perform them, the linker, is rarely under the control of the compiler developer. A solution to this problem, presented in the C++ Reference Manual, does not cope with global variables and function return types. It is asserted that lifting those limitations would require modifying the linker or providing an environment for separate compilation. We present a solution that lifts the limitations within the existing scheme.
Socially responsible computing I: a call to action following the L.A. riots
Authors: Ben Shneiderman
Venue: ACM SIGCHI Bulletin (1992)

The smoke and fire of the Los Angeles riots (April 30 - May 2, 1992) were Mayday warnings from a desperate community. To ignore this signal would be tragic and unconscionable, but finding a meaningful response is a challenge for computing professionals. Silicon Valley seems a long way from South Central Los Angeles and the computing industry has been largely distant from the problems of the urban underclass.
Self-Diagnosis of Failures in VLSI Tree Array Processors
Authors: Stephen Y. H. Su, Michal Cutler, Mingshien Wang
Venue: IEEE Transactions on Computers (1991)

The authors present a built-in self-test and diagnosis scheme for detecting and locating the faulty cells in a tree array. Since the signatures of all cells are generated simultaneously (i.e., parallel testing), the time required for the signature generating stage is constant, independent of the array size. Each cell (processing element) generates pseudorandom test patterns and compresses test responses into a signature. By comparing signatures, the signature for the fault-free processor is found and used to locate faulty processors. For arrays with distributed faults, a tree array is partitioned into subtrees on which the diagnosis algorithm is applied in parallel. The time complexity of the diagnosis algorithm is derived.
An introductory course in computer communication and networks
Authors: Thomas Narten, Raj Yavatkar
Venue: ACM SIGCOMM Computer Communication Review (1992)

This paper reports on the curriculum contents and experience obtained in the teaching of a semester-long introductory course in computer communication networks. The course is aimed at first year graduate and senior undergraduate students and covers a broad survey of networking issues. We focus on all seven layers of the OSI reference model and assign four major programming projects to reinforce the ideas covered in lectures. Projects include writing the client side of a client-server program that implements a sliding window data-link layer protocol complete with acknowledgements and retransmissions, writing client and server programs that interact via remote procedure calls, and writing client and server programs that use UDP datgrams to locate and register services with a name server utility and TCP to actually invoke services registered with the name server.
Sentinel scheduling for VLIW and superscalar processors
Authors: Scott A. Mahlke, William Y. Chen, Wen-mei W. Hwu, B. Ramakrishna Rau, Michael S. Schlansker
Venue: ACM SIGPLAN Notices (1992)

Speculative execution is an important source of parallelism for VLIW and superscalar processors. A serious challenge with compiler-controlled speculative execution is to accurately detect and report all program execution errors at the time of occurrence. In this paper, a set of architectural features and compile-time scheduling support referred to as sentinel scheduling is introduced. Sentinel scheduling provides an effective framework for compiler-controlled speculative execution that accurately detects and reports all exceptions. Sentinel scheduling also supports speculative execution of store instructions by providing a store buffer which allows probationary entries. Experimental results show that sentinel scheduling is highly effective for a wide range of VLIW and superscalar processors.
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
Authors: Joseph Cheriyan, John H. Reif
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

Let G = (V, E) be a directed graph and n denote |V|. We show that G is k-vertex connected iff for every subset X of V with |X| = k, there is an embedding of G in the (k-1)-dimensional space Rk-1, f : V &rarr:Rk-1, such that no hyperplane contains k points of {f(v) | v &egr; V}, and for each v &egr; V - X, f(v) is in the convex hull of {f(w) | (v, w) &egr; E}. This result generalizes to directed graphs the notion of convex embeddings of undirected graphs introduced by Linial, Lova&acute;sz and Wigderson in &ldquo;Rubber bands, convex embeddings and graph connectivity,&rdquo; Combinatorica 8 (1988), 91-102. Using this characterization, a directed graph can be tested for k-vertex connectivity by a Monte Carlo algorithm in time O((M(n) + nM(k)).(log n)) with error probability < 1/n, and by a Las Vegas algorithm in expected time O((M(n)+nM(k)).k), where M(n) denotes the number of arithmetic steps for multiplying two n x n matrices (M(n) = O(n2.3755)). Our Monte Carlo algorithm improves on the best previous deterministic and randomized time complexities for k > n0.19; e.g., for k = (n0.5, the factor of improvement is > n0.62. Both algorithms have processor efficient parallel versions that run in O((log n)2) time on the EREW PRAM model of computation, using a number of processors equal to (log n) times the respective sequential time complexities. Our Monte Carlo parallel algorithm improves on the number of processors used by the best previous (Monte Carlo) parallel algorithm by a factor of at least (n2/(log n)3) while having the same running time. Generalizing the notion of s-t numberings, we give a combinatorial construction of a directed s-t numbering for any 2-vertex connected directed graph.
Type isomorphisms in a type-assignment framework
Authors: Robero Di Cosmo
Venue: Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1992)

This paper contains a full treatment of isomorphic types for languages equipped with an ML style polymorphic type inference mechanism. Surprisingly enough the results obtained contradict the common-place feeling that (the core of) ML is a subset of second order &lgr;-calculus: we can provide an isomorphism of types that holds in the core ML language, but not in second order &lgr;-calculus. This new isomorphism not only allows to provide a complete (and decidable) axiomatisation of all the type isomorphic in ML style languages, a relevant issue for the type as specifications paradigm in library searches, but also suggest a natural extension that in a sense completes the type-inference mechanism in ML. This extension is easy to implement and allows to get a further insight in the nature of the let polymorphic construct.
Semantic heterogeneity in distributed geographic databases
Authors: M. F. Worboys, S. M. Deen
Venue: ACM SIGMOD Record (1991)

This paper considers the special problems of semantic heterogeneity in a distributed system of databases containing spatially referenced information. Two forms of semantic heterogeneity are defined. Generic semantic heterogeneity arises when nodes are using different generic conceptual models of the spatial information. Contextual semantic heterogeneity is caused by the particular local environmental conditions at nodes. It is contextual heterogeneity which is especially the consideration with geographic databases and to which the paper devotes most attention. Two possible solutions are proposed, one founded on transforming processors between models and a second using a canonical model which is a generalization of existing generic spatial models.