ppxscal/embedding_network huggingface dataset:
Links Between Markov Models and Multilayer Perceptrons
Authors: H. Bourland, C. J. Wellekens
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

The statistical use of a particular classic form of a connectionist system, the multilayer perceptron (MLP), is described in the context of the recognition of continuous speech. A discriminant hidden Markov model (HMM) is defined, and it is shown how a particular MLP with contextual and extra feedback input units can be considered as a general form of such a Markov model. A link between these discriminant HMMs, trained along the Viterbi algorithm, and any other approach based on least mean square minimization of an error function (LMSE) is established. It is shown theoretically and experimentally that the outputs of the MLP (when trained along the LMSE or the entropy criterion) approximate the probability distribution over output classes conditioned on the input, i.e. the maximum a posteriori probabilities. Results of a series of speech recognition experiments are reported. The possibility of embedding MLP into HMM is described. Relations with other recurrent networks are also explained.
Hierarchical representations of collections of small rectangles
Authors: Hanan Samet
Venue: ACM Computing Surveys (CSUR) (1988)

A tutorial survey is presented of hierarchical data structures for representing collections of small rectangles. Rectangles are often used as an approximation of shapes for which they serve as the minimum rectilinear enclosing object. They arise in applications in cartography as well as very large-scale integration (VLSI) design rule checking. The different data structures are discussed in terms of how they support the execution of queries involving proximity relations. The focus is on intersection and subset queries. Several types of representations are described. Some are designed for use with the plane-sweep paradigm, which works well for static collections of rectangles. Others are oriented toward dynamic collections. In this case, one representation reduces each rectangle to a point in a higher multidimensional space and treats the problem as one involving point data. The other representation is area based&mdash;that is, it depends on the physical extent of each rectangle.
A VLSI based microprogramming evaluation system to support an instructional laboratory
Authors: A. Parker, J. O. Hamblen
Venue: Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture (1989)

A new low-cost VLSI based microprogrammable computer system is described. This system is an ideal candidate for use in student microprogramming laboratories. The authors describe their experiences in using this computer.
Use of the Cloze procedure in testing a model of complexity
Authors: P. B. van Verth, L. Bakalik, M. Kilcoyne
Venue: ACM SIGCSE Bulletin (1989)

This paper describes an experiment designed and conducted by undergraduate students as part of a senior research project in Computer Science. The experiment tested whether the program comprehension of a set of Fortran 77 programs can be predicted by the Oviedo/Van Verth model of program complexity. In the study, student programmers were asked to demonstrate their ability to understand programs through use of the cloze procedure. Three different kinds of Fortran 77 programs were used at three different levels of complexity determined by the model. It was hypothesized that program comprehension would decrease, i.e. the number of incorrect answers would increase, as the complexity of the programs increased. Due to a variety of reasons, the results were inconclusive. The purpose of this paper is to discuss the experiment, the method selected, and implications for future experiments.
Effects of Response and Stability on Scheduling in Distributed Computing Systems
Authors: T. L. Casavant, J. G. Kuhl
Venue: IEEE Transactions on Software Engineering (1988)

An examination is made of the effects of response and stability on scheduling algorithms for general-purpose distributed computing systems. Response characterizes the time required, following a perturbation in the system state, to reach a new equilibrium state. Stability is a measure of the ability of a mechanism to detect when the effects of further actions will not improve the system state as defined by a user-defined objective. These results have implications for distributed computations in general. Analysis is based on formal communicating finite automata models of two distinct approaches to the scheduling problem, each using the objective of global optimal load balancing. The results indicate that absolute stability is not always necessary in dynamic systems for the same reasons that relatively small amounts of instability are tolerated in the design of analog control systems. It is shown that response is a very important first-order metric of dynamic scheduling behavior, and that response and stability are related.
Recognition and Shape Synthesis of 3-D Objects Based on Attributed Hypergraphs
Authors: A. K. C. Wong, S. W. Lu, M. Rioux
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A computer vision system is presented for shape synthesis and recognition of three-dimensional objects using an attributed hypergraph representation. The vision system is capable of: (1) constructing an attributed hypergraph representation (AHR) based on the information extracted from an image with range data; (2) synthesizing several AHRs obtained from various views of an object to form a complete AHR of the object; and (3) recognizing any view of an object of finding the graph monomorphism between the AHR of that view and the complete AHR of a prototype object. This system is implemented on a Grinnell imaging system driven by a VAX 11/750 running VMS.
I-structures: data structures for parallel computing
Authors: Arvind, Rishiyur S. Nikhil, Keshav K. Pingali
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1989)

It is difficult to achieve elegance, efficiency, and parallelism simultaneously in functional programs that manipulate large data structures. We demonstrate this through careful analysis of program examples using three common functional data-structuring approaches-lists using Cons, arrays using Update (both fine-grained operators), and arrays using make-array (a &ldquo;bulk&rdquo; operator). We then present I-structure as an alternative and show elegant, efficient, and parallel solutions for the program examples in Id, a language with I-structures. The parallelism in Id is made precise by means of an operational semantics for Id as a parallel reduction system. I-structures make the language nonfunctional, but do not lose determinacy. Finally, we show that even in the context of purely functional languages, I-structures are invaluable for implementing functional data abstractions.
Similarity-based reasoning about diagnosis of analog circuits
Authors: Juan E. Vargas, J. R. Bourne, A. J,  Brodersen, Martin Hofmann, G. C. Collins
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

This paper advocates the use of similarity-based reasoning to improve the efficacy of AI applications dealing with diagnosis of electronic circuits. A paradigm for similarity-based matching is presented, application of this paradigm to diagnosis of electronic circuits is discussed, and a system architecture that supports this concept is described.
If there is artificial intelligence? Is there such a thing as artificial stupidity
Authors: J. Liebowitz
Venue: Issue 109 (July 1989) (1989)

With AI applications being developed and used worldwide, an interesting question to ask is, "How smart are these AI systems?" Or another way of asking the question is, "How much 'artificial stupidity' do these systems possess?" This paper takes a look at the current limitations of the most practical application of AI -- expert systems. This paper provides a general idea of how expert systems could be improved.
A basic set of abstract object classes for representation of complex documents
Authors: Randy S. Weinberg, Michael J. Bozonie
Venue: ACM SIGOIS Bulletin (1988)

To support the creation, editing, storage, retrieval, and transmission of electronic multimedia documents, a system must maintain and manage complex, nonhierarchical relationships among the documents and their constituent components. A basic set of high level object classes that can be used in a hybrid object oriented development environment to represent complex documents, their constituent parts, and interrelationships is presented. These object classes are intended to provide a stable base for development of a PC-based document management system.
Vectorized Monte Carlo molecular aerodynamics simulation of the Reyleigh problem
Authors: D. V. Pryor, P. J. Burns
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

A fully vectorized version of a 1-dimensional Monte Carlo algorithm applied to molecular aerodynamics is presented. The algorithm is applied to the Rayleigh problem, an impulsively accelerated, heated flat plate, and is implemented on the CYBER 205. Issues relating to the details of vectorization, including the use of bit addressability, the maintaining of long vector lengths, and vector gather/scatter use, are discussed. Speedup factors due to vectorization in the range of 5 to 18 are reported, and depend upon problem parameters. The results indicate that, under certain circumstances, the problem performs well on vector architectures.
FINGER&mdash;Formalizing Interaction for Gesture Recognition
Authors: G. Weber, P. Wetzel
Venue: ACM SIGCHI Bulletin (1989)

Tactile braille displays and speech output devices help blind computer users to overcome their inability to receive feedback from a screen; nonetheless user interfaces based on graphics for output and pointing devices for input are still unusable by the blind. For example dragging an icon on the screen cannot verbally be described. A tactile representation of an icon also doesn't fit on the canvas of usual braille displays with 20 - 80 braille cells.
A hard-core predicate for all one-way functions
Authors: O. Goldreich, L. A. Levin
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are &ldquo;hard-core&rdquo; predicates b of functions (permutations) &fnof;, discovered in [Blum Micali 82]. Such b(x) cannot be efficiently guessed (substantially better than 50-50) given only &fnof;(x). Both b, &fnof; are computable in polynomial time. [Yao 82] transforms any one-way function &fnof; into a more complicated one, &fnof;*, which has a hard-core predicate. The construction applies the original &fnof; to many small pieces of the input to &fnof;* just to get one &ldquo;hard-core&rdquo; bit. The security of this bit may be smaller than any constant positive power of the security of &fnof;. In fact, for inputs (to &fnof;*) of practical size, the pieces effected by &fnof; are so small that &fnof; can be inverted (and the &ldquo;hard-core&rdquo; bit computed) by exhaustive search. In this paper we show that every one-way function, padded to the form &fnof;(p, x) = (p, g(x)), &Verbar;&Verbar;p&Verbar;&Verbar; = &Verbar;x&Verbar;, has by itself a hard-core predicate of the same (within a polynomial) security. Namely, we prove a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors p, x is a hard-core of every one-way function &fnof;(p, x) = (p, g(x)). The result extends to multiple (up to the logarithm of security) such bits and to any distribution on the x's for which &fnof; is hard to invert.
Intelligent back end of a goal directed simulation environment for discrete-part manufacturing
Authors: S. Prakash, R. E. Shannon
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper discusses the issues involved in developing an intelligent back end for a goal directed simulation environment. The intelligent back end serves to analyze the simulation output and suggest changes to the model parameters that may lead the simulation towards the goals. The main thrust is on incorporating domain behavioral knowledge to the back end. A discussion on issues that need to be considered when conducting a simulation analysis of manufacturing systems is given. This is followed by a classification of manufacturing systems developed to aid in the development of the rule base. This rule base essentially emulates the thought process of a simulation analyst. Finally a sample rule base is given, followed by future research directions.
Threshold Decomposition of Gray-Scale Morphology into Binary Morphology
Authors: F. Y.-C. Shih, O. R. Mitchell
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Recently, a superposition property called threshold decomposition and another property called stacking were introduced and shown to apply successfully to gray-scale morphological operations. This property allows gray-scale signals to be decomposed into multiple binary signals. The signals are processed in parallel, and the results are combined to produce the desired gray-scale result. The authors present the threshold decomposition architecture and the stacking property that allows the implementation of this architecture. Gray-scale operations are decomposed into binary operations. This decomposition allows gray-scale morphological operations to be implemented using only logic gates in VLSI architectures that can significantly improve speed as well as give theoretical insight into the operations.
Generational reference counting: a reduced-communication distributed storage reclamation scheme
Authors: B. Goldberg
Venue: ACM SIGPLAN Notices (1989)

This paper describes generational reference counting, a new distributed storage reclamation scheme for loosely-coupled multiprocessors. It has a significantly lower communication overhead than distributed versions of conventional reference counting. Although generational reference counting has greater computational and space requirements than ordinary reference counting, it may provide a significant saving in overall execution time on machines in which message passing is expensive. The communication overhead for generational reference counting is one message for each copy of an interprocessor reference (pointer). Unlike conventional reference counting, when a reference to an object is copied no message is sent to the processor on which the object lies. A message is sent only when a reference is discarded. Unfortunately, generational reference counting shares conventional reference counting's inability to reclaim cyclical structures. In this paper, we present the generational reference counting algorithm, prove it correct, and discuss some refinements that make it more efficient. We also compare it with weighted reference counting, another distributed reference counting scheme described in the literature.
Cesar: a static sequencing constraint analyzer
Authors: K. Olender, L. Osterweil
Venue: ACM SIGSOFT Software Engineering Notes (1989)

This paper relates experience with building and using a programmable sequencing analyzer based on data flow analysis algorithms. An earlier paper described both the motivation for and the specification of Cecil, a powerful language for defining constraints on the sequencing of events and gave an algorithm for mapping the sequencing specifications defined by Cecil to data flow analysis algorithms. In this paper, we sketch the architecture of Cesar, a system for carrying out the analysis of Cecil sequencing constraints, describe the problems arising in the analysis of real-world programs, and indicate how we resolved these problems. Finally, we describe our experience in using Cesar, citing speed and efficiency characteristics of the current implementation, and suggesting the error-detection features and powers of Cesar.
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines
Authors: David Bernstein, Michael Rodeh Izidor Gertner
Venue: IEEE Transactions on Computers (1989)

The problem of optimal scheduling of a job system for two dedicated processors is presented. A machine model with two functional units which can be either sequential or pipelined is considered. The complexity of optimal scheduling for a set of expressions on such machines is investigated. Some previous NP-completeness results are reviewed and several new ones are presented. For one restricted case, a polynomial-time algorithm is described and analyzed.
HDTV (Hi-Vision) computer graphics
Authors: K. Omura, R. Mochizuki, H. Tamegaya, Y. Kawajuchi, D. Miskowich
Venue: ACM SIGGRAPH 89 Panel Proceedings (1989)

Good afternoon, ladies and gentlemen. We'll begin the panel session -- HDTV Computer Graphics. I am Koichi Omura at Osaka Municipal University. I am the chair of this panel. At first I'd like to thank SIGGRAPH, giving us the opportunity speaking today.The first presentation is by Mr. Ryou Mochizuki. He is the controller of NHK Engineering Service Corporation. He will discuss the compact disc application of HDTV, and after that he will present the brief introduction of HDTV.
Recognition of Kidney Glomerulus by Dynamic Programming Matching Method
Authors: H. Yamada, C. Merritt, T. Kasvand
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

Dynamic programming was applied to locate the glomeruli in microscopic images of kidney tissue section. The glomeruli were modeled by a polygon whose sides could be varied within a given range of lengths. The objects were located by determining the best match of the model according to a so-called optimum criterion in which all possible shapes were evaluated at all possible positions in the input image. The best model was selected according to the maximum average gray level. To increase the probability of obtaining a closed contour, a distance criterion was added and the maximum gray-level requirement was relaxed somewhat. The optimum criterion was modified to include a directionality constraint in which the difference in angle between model segments and the edge values in the image was minimized, thereby increasing the performance of the method. A hierarchical multiresolution strategy was used to reduce calculation time. The cyclical property of a contour is also taken into account.
Inversibility of rational mappings and structural identifiability in automatics
Authors: F. Ollivier
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

We investigate different methods for testing whether a rational mapping &fnof; from kn to km admits a rational inverse, or whether a polynomial mapping admits a polynomial one. We give a new solution, which seems much more efficient in practice than previously known ones using &ldquo;tag&rdquo; variables and standard basis, and a majoration for the degree of the standard basis calculations which is valid for both methods in the case of a polynomial map which is birational. We further show that a better bound can be given for our method, under some assumption on the form of &fnof;. Our method can also extend to check whether a given polynomial belongs to the subfield generated by a finite set of fractions. We then illustrate our algorithm, with a application to structural identifiability. The implementation has been done in the IBM computer algebra system Scratchpad II.
The Modula-2 experience
Authors: Nan C. Schaller
Venue: ACM SIGCSE Bulletin (1988)

The 1987-88 school year represents the first time that the Undergraduate Computer Science Department at Rochester Institute of Technology (RIT) has offered its five quarter course programming skills sequence with Modula-2 as its primary teaching language. What follows is a description of RIT's first year Modula-2 experience including the trials and tribulations of new languages, new compilers, and untried texts. With only the first half of the sequence having been offered using Modula-2, the benefits derived from the change thus far will be discussed as well as suggestions, conclusions, and a preview of what is yet to come.
A more cost effective algorithm for finding perfect hash functions
Authors: E. A. Fox, Q.-F. Chen, L. Heath, S. Datta
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

As the use of knowledge-based systems increases, there will be a growing need for efficient artificial intelligence systems and methods to access large lexicons. In the COmposite Document Expert/extended/effective Retrieval (CODER) system we have, in order to provide rapid access to data items on CD-ROMs and to terms in a lexicon built from machine readable dictionaries, investigated the construction of perfect hash functions. We have considered algorithms reported earlier in the literature, have made numerous enhancements to them, have developed new algorithms, and here report on some of our results. This paper covers an O(n3) algorithm that has been applied to building hash functions for a collection of 69806 words on a CD-ROM. Most recently we have developed a much better algorithm and have succeeded in finding a perfect hash function for a set of 130,199 words taken from sources including the Collins English Dictionary.
A note on two simulation benchmarks
Authors: Daniel E. House
Venue: ACM SIGSIM Simulation Digest (1989)

This note presents the results of a comparative study done on the popular simulation languages SLAM and GPSS. The models that we tested were executed on a CDC Cyber 750, a multiprogramming system with 3770008 words of main memory and no virtual memory. A single server queueing model and a multiqueuing model for simulating a token ring local area network were used for the comparison. In addition to SLAM and GPSS, we also develop FORTRAN versions of the models to obtain an idea of how a low level model performs in comparison to a model constructed in a well developed simulation language. The note includes a discussion and some graphical results that may be useful to a modelling practitioner in planning a simulation study.
A characterization of ten rasterization techniques
Authors: N. Gharachorloo, S. Gupta, R. F. Sproull, I. E. Sutherland
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

With widespread use of raster scan displays and the ever-increasing desire for faster interactivity, higher image complexity, and higher resolution in displayed images, several techniques have been proposed for rasterizing primitive graphical objects. This paper characterizes the performance of these techniques and shows how they evolve for more complex images on higher resolution displays. This characterization will not only show the strengths and deficiencies of existing rasterization techniques, but will also reveal new architectures for future raster graphics systems.
Correction to 'Allocating Programs Containing Branches and Loops Within a Multiple Processor System'
Authors: Don Towsley
Venue: IEEE Transactions on Software Engineering (1990)

A number of typographical errors in the above-mentioned paper are corrected.
Parallel tree pattern matching
Authors: R. Ramesh, I. V. Ramakrishnan
Venue: Journal of Symbolic Computation (1990)

Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance of any variable in the pattern occurs at most once. In this paper we describe a new parallel algorithm for linear tree pattern matching using a parallel random access machine model.