ppxscal/embedding_network huggingface dataset:
Conference report: empirical studies of programmers: fourth workshop
Authors: Jared T. Freeman
Venue: ACM SIGCHI Bulletin (1992)

The fourth annual workshop of Empirical Studies of Programmers was a forum for psychological studies of computer assisted instruction, documentation and programming formats, and cooperative work. Experiments concerning fundamental psychological mechanisms were also presented. In this review of the event, panel discussions and papers are summarized.
A Unified High-Level Petri Net Formalism for Time-Critical Systems
Authors: Carlo Ghezzi, Dino Mandrioli, Sandro Morasca, Mauro Pezzè
Venue: IEEE Transactions on Software Engineering (1991)

The authors introduce a high-level Petri net formalism-environment/relationship (ER) nets-which can be used to specify control, function, and timing issues. In particular, they discuss how time can be modeled via ER nets by providing a suitable axiomatization. They use ER nets to define a time notation that is shown to generalize most time Petri-net-based formalisms which appeared in the literature. They discuss how ER nets can be used in a specification support environment for a time-critical system and, in particular, the kind of analysis supported.
An environment of a graduate curriculum in computer graphics
Authors: Wayne E. Carlson
Venue: ACM SIGCSE Bulletin (1990)

Attention has been focused recently on programs in Computer Graphics within the general Computer Science Curriculum. A successful graduate program in the Department of Computer and Information Science at The Ohio State University is outlined. Facilities and laboratories, courses, and staffing are discussed. Particular attention is given to a software environment, called EDGE (Educational and Development Graphics Environment) which is central to the success of the courses in the curriculum.
UNIVERSAL_FILE_NAMES for Ada
Authors: Y. E. Gail Wang
Venue: ACM SIGAda Ada Letters (1990)

This paper reports on UNIVERSAL_FILE_NAMES (UFN), a set of Ada components designed to provide filename portability between MS-DOS, Unix and VMS.
A linear program driven scheduling and allocation method followed by an interconnect optimization algorithm
Authors: C. A. Papachristou, H. Konuk
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

A new method for high level synthesis is reported whose basic feature is the tight interaction and coupling of the scheduling and allocation phases providing a global direction to synthesis. A linear program based allocation is proposed which uses multifunction ALU cost estimation, and iteratively drives a tree search for scheduling. A major contribution of this paper is a new interconnect optimization algorithm which is based on several interconnect transformations for multiplexer input collapsing and merging. Several other important synthesis aspects are included, e.g. register and interconnect bindings, operation chaining and operation multicycling. The method has been implemented in C on a Sun 3/60,
PRODIGY: an integrated architecture for planning and learning
Authors: Jaime Carbonell, Oren Etzioni, Yolanda Gil, Robert Joseph, Craig Knoblock, Steve Minton, Manuela Veloso
Venue: ACM SIGART Bulletin (1991)

Artificial intelligence has progressed to the point where multiple cognitive capabilities are being integrated into computational architectures, such as SOAR, PRODIGY, THEO, and ICARUS. This paper reports on the PRODIGY architecture, describing its planning and problem solving capabilities and touching upon its multiple learning methods. Learning in PRODIGY occurs at all decision points and integration in PRODIGY is at the knowledge level; the learning and reasoning modules produce mutually interpretable knowledge structures. Issues in architectural design are discussed, providing a context to examine the underlying tenets of the PRODIGY architecture.
Symbolic parametrization of curves
Authors: J. Rafael Sendra, Franz Winkler
Venue: Journal of Symbolic Computation (1991)

If algebraic varieties like curves or surfaces are to be manipulated by computers, it is essential to be able to represent these geometric objects in an appropriate way. For some applications an implicit representation by algebraic equations is desirable, whereas for others an explicit or parametric representation is more suitable. Therefore, transformation algorithms from one representation to the other are of utmost importance. We investigate the transformation of an implicit representation of a plane algebraic curve into a parametric representation. Various methods for computing a rational parametrization, if one exists, are described. As a new idea we introduce the concept of working with classes of conjugate (singular or simple) points on curves. All the necessary operations, like determining the multiplicity and the character of the singular points or passing a linear system of curves through these points, can be applied to such classes of conjugate points. Using this idea one can parametrize a curve if one knows only one simple point on it. We do not propose any new method for finding such a simple point. By classical methods a rational point on a rational curve can be computed, if such a point exists. Otherwise, one can express the coordinates of such a point in an algebraic extension of degree 2 over the ground field.
A maple program for proving hypergeometric identities
Authors: Doron Zeilberger
Venue: ACM SIGSAM Bulletin (1991)

In [Z1](see also [Z2],[WZ],[S],[Ci]) I gave an algorithm for proving any terminating definite hypergeometric identity, and more generally, for finding the linear recurrence satisfied by any definite hypergeometric sum[EQUATION]
Bounds on the Average Number of Products in the Minimum Sum-of-Products Expressions for Multiple-Value Input Two-Valued Output Functions
Authors: Tsutomu Sasao
Venue: IEEE Transactions on Computers (1991)

The authors derive an upper and a lower bound on the average number of products in the minimum sum-of-products expressions (SOPEs). The upper bound is obtained by using the minimization results of functions with fewer variables. The lower bound is based on an assumption, so it is incorrect until this assumption is proven. A lower bound L/sub p/(n,u) and an upper bound U/sub p/(n,u) on S/sub p/(n,u) are derived, where S/sub p/(n,u) is the average number of products in minimum SOPE for p-valued input two-valued output functions, n is the number of the inputs, and u is the number of minterms. The values of S/sub p/(n,u) are obtained by minimizing randomly generated functions, and they are compared to the calculated values of U/sub p/(n,u) and L/sub p/(n,u). These bounds are useful for estimating the size of programming logic arrays.
Semantics modeling issues for processing natural language database queries
Authors: D. G. Shin
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

This work explores data semantics issues necessary for designing an NL interface capable of dealing with incomplete NL queries. First, the notion of incomplete NL queries is clarified to conclude the necessity for enriching the data semantics component of the system. An assumption made by the existing NL interfaces is expounded to argue that the approaches based on this assumption are unable to explore meta-knowledge about the stored data in the query conversion process. A new, unconventional approach is proposed whose tenets underlie the separation between the conceptual interpretation of NL queries and the semantics descriptions of the database constituents. This approach allows explicit descriptions of the conceptual knowledge, referred to herein as epistemological specifications, on the DB constituents.
Classification of Rotated and Scaled Textured Images Using Gaussian Markov Random Field Models
Authors: Fernand S. Cohen, Zhigang Fan, Maqbool A. Patel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

Consideration is given to the problem of classifying a test textured image that is obtained from one of C possible parent texture classes, after possibly applying unknown rotation and scale changes to the parent texture. The training texture images (parent classes) are modeled by Gaussian Markov random fields (GMRFs). To classify a rotated and scaled test texture, the rotation and scale changes are incorporated in the texture model through an appropriate transformation of the power spectral density of the GMRF. For the rotated and scaled image, a bona fide likelihood function that shows the explicit dependence of the likelihood function on the GMRF parameters, as well as on the rotation and scale parameters, is derived. Although, in general, the scaled and/or rotated texture does not correspond to a finite-order GMRF, it is possible nonetheless to write down a likelihood function for the image data. The likelihood function of the discrete Fourier transform of the image data corresponds to that of a white nonstationary Gaussian random field, with the variance at each pixel (i,j) being a known function of the rotation, the scale, the GMRF model parameters, and (i,j). The variance is an explicit function of the appropriately sampled power spectral density of the GMRF. The estimation of the rotation and scale parameters is performed in the frequency domain by maximizing the likelihood function associated with the discrete Fourier transform of the image data. Cramer-Rao error bounds on the scale and rotation estimates are easily computed. A modified Bayes decision rule is used to classify a given test image into one of C possible texture classes. The classification power of the method is demonstrated through experimental results on natural textures from the Brodatz album.
An integration of network communication with workstation architecture
Authors: Gregory G. Finn
Venue: ACM SIGCOMM Computer Communication Review (1991)

A workstation may be thought of as a group of cooperatively connected subsystems. Point--to--point channels may be used to create a small--scale Gigabit LAN to which these subsystems are attached as nodes. The architectural focus of such a workstation shifts towards its internal LAN. An attractive attribute of this LAN is that its aggregate capacity scales linearly with the number of nodes attached to it.If the link--layer of the internal LAN is made equivalent to the link--layer of the external LAN, interior nodes become directly accessible externally. Except for latency the distinction between whether a node is inside a workstation versus outside it need not be significant. This property is particularly attractive for distributed communication--intensive applications.
The architecture of a heterogeneous distributed database management system: the distributed access view integrated database (DAVID)
Authors: Bharat Bhasker, Csaba J. Egyhazy, Konstantinos P. Triantis
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

This paper describes the architecture of a heterogeneous distributed database management system called the Distributed Access View Integrated Database (DAVID). The DAVID system allows uniform access to distributed data stored in different DBMSs that support various data models. The system presents the users with a unified cluster data model and with a uniform high level query language (GSQL). Database heterogeneity issues such as external-to-conceptual view translation, view integration, query processing and the definition of a uniform data access language are presented in the context of the DAVID development.
A Specifier's Introduction to Formal Methods
Authors: Jeannette M. Wing
Venue: Computer (1990)

Formal methods used in developing computer systems (i.e. mathematically based techniques for describing system properties) are defined, and their role is delineated. Formal specification languages, which provide the formal method's mathematical basis, are examined. Certain pragmatic concerns about formal methods and their users, uses, and characteristics are discussed. Six well-known or commonly used formal methods are illustrated by simple examples. They are Z, VDM, Larch, temporal logic, CSP, and transition axioms.
Reconfiguration Strategies for VLSI Processor Arrays and Trees Using a Modified Diogenes Approach
Authors: K. P. Belkhale, P. Banerjee
Venue: IEEE Transactions on Computers (1992)

The authors deal with reconfiguration of a rectangular array of processors arranged as an N*N mesh, and a complete binary tree of N processors. They present new reconfiguration techniques that are modifications of the Diogenes approach proposed earlier by A.L. Rosenberg et al. (1983). These techniques reduce the overheads incurred in the earlier Diogenes schemes. Some of the previous approaches to the problem are summarized. Two schemes are presented for reconfiguring rectangular arrays and a scheme for reconfiguring trees. For the analysis of the different schemes presented, it is assumed that a processor has a square layout. These schemes are analyzed and their performance results are presented.
Behavioral fault simulation in VHDL
Authors: P. C. Ward, J. R. Armstrong
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper presents two tools which facilitate the fault simulation of behavioral models described using VHDL. The first tool is the Behavioral Fault Mapper (BFM). The BFM algorithm accepts a fault-free VHDL model and a fault list of N faults from which it produces N faulty models. The process of mapping the faults in the fault list onto copies of the original VHDL model is automated. The N faulty models are immediately suitable for fault simulation. The second tool presented is the Test Bench Generator (TBG). The TBG algorithm creates the VHDL TestBench and all other files necessary to complete a batch-mode fault simulation of the N faulty models.
Hierarchical Image Analysis Using Irregular Tessellations
Authors: Annick Montanvert, Peter Meer, Azriel Rosenfeld
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A novel multiresolution image analysis technique based on hierarchies of irregular tessellations generated in parallel by independent stochastic processes is presented. Like traditional image pyramids these hierarchies are constructed in a number of steps on the order of log(image-size) steps. However, the structure of a hierarchy is adapted to the image content and artifacts of rigid resolution reduction are avoided. Two applications of these techniques are presented: connected component analysis of labeled images and segmentation of gray level images. In labeled images, every connected component is reduced to a separate root, with the adjacency relations among the components also extracted. In gray level images the output is a segmentation of the image into a small number of classes as well as the adjacency graph of the classes.
The ANSI binding of SQL to ADA
Authors: James W. Moore
Venue: ACM SIGAda Ada Letters (1991)

This paper describes the binding of the Ada programming language and the SQL database language which is specified in ANSI standard X3.168-1989. Background information is provided on the SQL standard and its language bindings followed by information regarding the history of the Ada binding and the specific goals and values realized by that binding. The procedural binding is described in detail and an overview is provided of the embedded binding. Related efforts to build more abstract bindings are described followed by a brief status of standardization and implementation.
Hardware for hidden Markov-model-based, large-vocabulary real-time speech recognition
Authors: M. Weintraub, G. Chen, J. Mankoski, H. Murveit
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

SRI and U.C. Berkeley have begun a cooperative effort to develop a new architecture for real-time implementation of spoken language systems (SLS). Our goal is to develop fast speech recognition algorithms, and supporting hardware capable of recognizing continuous speech from a bigram- or trigram-based 20,000-word vocabulary or a 1,000- to 5,000-word SLS.
Relating number of processing elements in a sparse distributed memory model to learning rate and generalization
Authors: Richard M. Evans, Alvin J. Surkan
Venue: Proceedings of the international conference on APL '91 (1991)

A simulated neural network was developed with APL on an 80386 microcomputer. The network was configured to associate task descriptions with 10 categories of military occupational specialties. The number of processing elements in the problem was varied. Increasing the number of processors increased the speed of learning in the simulation. Generalization was not significantly different for various numbers of processing elements except for one intermediate number at which generalization occurred about 15 percent higher. Analysis of the performance of a trained network suggests that low level, natural language understanding is one form of text processing which promises to become an important application area for neural model-based computing.
A &ldquo;PAC&rdquo; Algorithm for Making Feature Maps
Authors: Philip Laird, Evan Gamble
Venue: Machine Learning (1991)

Kohonen and others have devised network algorithms for computing so-called topological feature maps. We describe a new algorithm, called the CDF-Inversion (CDFI) Algorithm, that can be used to learn feature maps and, in the process, approximate an unknown probability distribution to within any specified accuracy. The primary advantages of the algorithm over previous feature-map algorithms are that it is simple enough to analyze mathematically for correctness and efficiency, and that it distributes the points of the map evenly, in a sense that can be made rigorous. Like other vector-quantization algorithms it is potentially useful for many applications, including monitoring and statistical modeling. While not a network algorithm, the CDFI algorithm is well-suited to implementation on parallel computers.
An interdisciplinary course in digital image processing
Authors: Michael Magee, Sue Englert
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

This paper documents the development and first offering of an interdisciplinary undergraduate course in Digital Image Processing at the University of Wyoming. The course itself was designed to serve majors from a wide range of academic disciplines, although in its initial offering, it was attented mainly by students majoring in Computre Science and Electrical Engineering. National Foundation funding for equipment for the course was used to purchase a high speed image processing system and six state-of-the-art graphics workstations with software that supported basic and intermediate level image processing operations. Students in the course were required to perform a standard set of image processing sequences such as histogramming and histogram equalization, edge detection and evaluation, image smoothing, region growing, Fourier filtering, and image warping. Each student, in consultation with the instructor, then pursued a specific topic in image processing which involved either combining several image processing operations to produce a desired result or developing special code to implement image processing algorithms that were discussed in the text but not included in the provided software. The nature of the course and its impact on education at the University of Wyoming is discussed in the paper that follows.
Separation and approximation of polyhedral objects
Authors: Joseph S. B. Mitchell, Subhash Suri
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

Given a family of disjoint polygons P1, P2,&hellip;, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be separated by a polygonal family consisting of m edges, that is, if there exist polygons R1, R2,&hellip;, Rk with pairwise-disjoint boundaries such that Pi *** Ri and &Sgr;|Ri| &le; m. In three dimensions, the problem of separating even two nested convex polyhedra by a k-facet polyhedron is NP-complete. Many other extensions and generalizations of the polyhedral separation problem, either to families of polyhedra or to higher dimensions, are also intractable. In this paper, we present efficient approximation algorithms for constructing separating families of near-optimal size. Our main results are as follows. In two dimensions, we give an O(n log n) time algorithm for constructing a separating family whose size is within a constant factor of an optimal separating family; n is the number of edges in the input family of polygons. In three dimensions, we can separate a convex polyhedron from a nonconvex polyhedron with a convex polyhedral surface whose facet-complexity is O(log n, times the optimal, where n = |P|+|Q| is the complexity of the input polyhedra. Our algorithm runs in O(n4) time, but improves to O (n3) time if the two polyhedra are nested and convex. Our algorithm for separating a convex polyhedron from a nonconvex polyhedron extends to higher dimensions. In d dimensions, for d &ge; 4, the facet-complexity of the approximation polyhedron is O(d log n) times the optimal, and the algorithm runs in O(nd+1)time. Finally, we also obtain results on separating sets of points, a family of convex polyhedra, and separation by non-polyhedral surfaces, such as spherical patches.
Redundant Logarithmic Arithmetic
Authors: M. G. Arnold, T. A. Bailey, J. R. Cowles, J. J. Cupal
Venue: IEEE Transactions on Computers (1990)

A number system that offers advantages in some situations over conventional floating point and sign/logarithmic number systems is described. Redundant logarithmic arithmetic, like conventional logarithmic arithmetic, relies on table lookups to make the arithmetic unit simpler than an equivalent floating point unit. The cost of 32 bit subtraction in a redundant logarithmic number system is lower than previously published logarithmic subtraction methods. The total memory requirement for a 29-bit redundant logarithmic unit is 16 K words compared to 22 K words by the best previously published conventional sign logarithm unit, assuming similar addition techniques are employed. A redundant logarithmic number system can be implemented with online arithmetic, which would be impractical for a conventional sign logarithm number system. The disadvantages of redundant arithmetic are typical of redundant number systems. First, the redundancy doubles the storage requirements for data values. Second, the representation can become ill-conditioned, especially as a result of iterated multiplications. Third, division and square root operations are more difficult to implement in redundant logarithmic arithmetic.
A semantics of object-oriented sets
Authors: Herman Balsters, Chris C. de Vreeze
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

An account is given of extending the well-known object-oriented type system of Luca Cardelli with set constructs and logical formalism. The system is based on typed &lgr;-notation, employing a subtyping relation and a powertype construct. Sets in this system are value expressions and are typed as some powertype. Sets are built up in a very general manner; in particular, sets can be described by (first-order) predicates. The resulting system, called LPT, is statically typecheckable (in a context of multiple inheritance) and is provided with a set-theoretic semantics. LPT can be used as a mathematical foundation for an object-oriented data model employing sets and constraints.