ppxscal/embedding_network huggingface dataset:
Solving systems of bivariate algebraic equations by using primitive polynomial remainder sequences
Authors: M. Kalkbrener
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

Let K be a field, K the algebraic closure of K and &fnof; = qm(x)ym + &hellip; + qo(x) a polynomial in K[x,y] with qm &ne; 0. The polynomial qm is called the leading coefficient of &fnof;, abbreviated lc(&fnof;). The degree of &fnof; in y is denoted by deg(&fnof;). Let &fnof;1, &fnof;2, &hellip;, &fnof;k be the primitive polynomial remainder sequence of the primitive polynomials &fnof;1 and &fnof;2 in K[x,y], abbreviated pprs(&fnof;1, &fnof;2). For every i &isin; {2, &hellip;, k-1} let ci be the content of the pseudoremainder of &fnof;i-1 and &fnof;i, li := lc(&fnof;i)deg(fi-1)-deg(fi)+1, Mi:= {p &isin; K[x] - K | p is irreducible, monic and there exists a j &isin; N such that pj divides c2 &middot; &middot; &middot; ci but not l2 &middot; &middot; &middot; li}, {pi, 1, &hellip;, pi, @@@@} := {p &isin; Mi @@@@ p &notin; Mr for r = 2, &hellip;, i-1 } and ei := pi,1&hellip; pi,@@@@. e2, &hellip;, ek-1 is called the elimination sequence of f1 and f2, abbreviated elimseq (&fnof;1, &fnof;2).
Efficient Parallel Algorithms for Image Template Matching on Hypercube SIMD Machines
Authors: V. K. Prasana Kumar, V. Krishnan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Efficient parallel algorithms developed on hypercube SIMD (single-instruction multiple data-stream) machines for image template matching are presented. Most of these parallel algorithms are asymptotically optimal in their time complexities. These results improve the known bounds in the literature.
LYYTI&mdash;integrated design and control system
Authors: Timo Teileri, Toivo Olkkola
Venue: ACM SIGAPL APL Quote Quad (1990)

LYYTI is an APL2-based integrated system for design and manufacturing of customer-tailored switchgears, consisting of some expert system features. System development started year 1981. LYYTI system uses relational database DB2 and has interfaces to FORTRAN, GDDM and CADAM (via FORTRAN). Lyyti is used in mainframe IBM 3090-180S under TSO and all of the c. 120 daily users use the same packaged work space. (Transferring into PC-PS/2 network system is under development on winter 1990).
Information retrieval using impression of documents as a clue
Authors: F. Hirabayashi, H. Matoba, Y. Kasahara
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

Proposed here is an internal representation and mapping method for multimedia information in which retrieval is based on the impression documents are desired to make. A user interface design for a system using this method is also proposed. The proposed internal representation and mapping method represents each desired document impression as an axis in a semantic space. Documents are represented as points in the space. Queries are represented as subspaces. The proposed user interface design employs a method of visual presentation of the semantic space. For evaluation purposes, a prototype system has been developed. An image retrieval experiment shows that the proposed internal representation and mapping method and the user interface design provide effective tools for information retrieval.
Rendering cubic curves and surfaces with integer adaptive forward differencing
Authors: S.-L. Chang, M. S. R. Rocchetti
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

For most compute environments, adaptive forward differencing is much more efficient when performed using integer arithmetic than when using floating point. Previously low precision integer methods suffered from serious precision problems due to the error accumulation inherent to forward differencing techniques. This paper proposes several different techniques for implementing adaptive forward differencing using integer arithmetic, and provides an error analysis of forward differencing which is useful as a guide for integer AFD implementation. The proposed technique using 32 bit integer values is capable of rendering curves having more than 4K forward steps with an accumulated error of less than one pixel and no overflow problems. A hybrid algorithm employing integer AFD is proposed for rendering antialiased, texture-mapped bicubic surfaces.
Implementation of Ray tracing on the hypercube
Authors: D. E. Orcutt
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

This preliminary report presents one implementation of a ray tracing system. The ray tracing system was divided and distributed onto the hypercube based on the data to be processed. The implementation which includes a dynamic load balancing scheme will be shown to be very efficient for large scenes.
Stochastic petri net simulation
Authors: G. Balbo, G. Chiola
Venue: Proceedings of the 21st conference on Winter simulation (1989)

Petri nets are a formal modelling tool very well suited to the description of distributed and concurrent systems which exhibit synchronization and contention for shared resources. Adding random temporal specifications to Petri nets, stochastic Petri nets are obtained from which event driven simulators can be automatically constructed. This paper discusses the double role that stochastic Petri net simulation plays as an aid in the debugging of the correctness of the model and as a vehicle for the evaluation of the efficiency of the system. A modelling tool that has been developed for these purposes is illustrated with an emphasis on the modelling environment it provides and on its internal software architecture.
Automatic Representation of Binary Images
Authors: C. A. Cabrelli, U. M. Molter
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A method of representing black and white images through the description of the boundaries of the objects that define such images is proposed. In order to obtain such a representation, this method uses several algorithms which perform boundary extraction, contour following, segmentation, pattern classification, and curve fitting. One of the advantages of this method is that the image can be reconstructed at any size. It can also be rotated or translated without losing any quality. In addition to achieving a good data-compression rate, the coding-decoding process is computationally very efficient. Also shown is the application of these algorithms to characters in order to obtain fonts that may be downloaded for modern laser printers.
A qualitative modelling environment for design diagnosis of automation
Authors: D. Pearce, E. Grant
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

This paper describes a qualitative modelling toolbox for designing and developing application independent architectures.Developed out of a remote monitoring application, the toolbox uses object-oriented software and encapsulates knowledge-based information from a human expert to construct the model. Being object-oriented there is full inheritance between individual objects. It was considered feasible that the original work could be the basis of a design tool for automation architectures.Currently, application specific, hierarchically ordered architectures for automation are a barrier to progress. The present monolithic layering of such architectures means fault detection and monitoring remain the domain of the human expert. Here, we can produce the qualitative model in the form of an interactive user interface that can be used in fault monitoring and diagnosis and report faults. This modular, evolvable approach to designing architectures should aid in the reduction of their complexity particularly at the design stage.
A computer oriented algorithm for the determination of the dimension and character of a modular irreducible SL(n, K)-module
Authors: Marilena Pittaluga, Elisabetta Strickland
Venue: Journal of Symbolic Computation (1989)

The problem of determining the dimension and character of the irreducible representations of the special linear group of invertible n x n matrices of determinant 1, with coefficients in a field K, is completely solved in characteristic zero, as in this case there is an explicit formula due to Weyl ( 1946). In characteristic p instead, the problem is almost completely open. In this paper we present an algorithm that allows the computation of the character and the dimension of the irreducible representations of SL(n, K), K being an infinite field. The algorithm has been implemented on a computer system, using language @m-simp, and has as a starting point a classical result of representation theory, which says that each irreducible representation of SL(n, K) has a unique (up to scalars) highest weight vector, and non-isomor-phic representations have different highest weight. Therefore, the problem of computing character and dimension of all irreducible representation of SL(n, K) reduces to the problem of determining character and dimension of an irreducible representation with given highest weight. Moreover, the so-called ''straightening formula'' enables an explicit basis to be written for the Schur modules and once this has been achieved one can easily write down the matrix of an integral linear map whose rank equals the dimension of the irreducible module associated to the given Schur module.
Prototyping techniques for different problem contexts
Authors: O. Gutierrez
Venue: ACM SIGCHI Bulletin (1989)

Rapid prototyping and other experimental techniques are playing an increasingly important role in software development. Some common issues that concern their adoption are identifying the place in a system's life cycle where they may be appropriate, and selecting which tools to use. This paper presents a model of different problem types, suggesting that a fit must be found between the nature of the problem at hand and the features associated with available techniques. Emphasis is placed on the fact that most commercial tools are suitable for only certain problem types.Some areas of further development are highlighted and implications concerning human-computer interaction discussed.
A Real Time Sectional Image Measuring System Using Time Sequentially Coded Grating Method
Authors: M. Matsuki, T. Ueda
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A real-time sectional image measuring system is developed using the time-sequentially-coded grating method, and its application to automatic 3D image data measuring systems is studied. A PLZT electron shutter array is used to project time-sequentially-coded grating patterns on the object. The sectional image is calculated from deformed grating images which are picked up by a TV camera. This system takes about 530 ms to project the 100-slit time-sequentially-coded grating patterns and about 30 ms to calculate one sectional image.
The &ldquo;Worm&rdquo; programs&mdash;early experience with a distributed intelligence
Authors: Edward N. Schwartz
Venue: ACM SIGART Bulletin (1990)

Following a mention in a recent article of our preliminary experiments on worm programs (Witten amp; Thimbleby, 1989), we have been deluged with enquiries about the progress of this research project. Although we had planned to wait until further concrete results were available before going to press, we feel obliged to satisfy curiosity by publishing some details of the research program now. Moreover, our lawyers have advised us that this step is advisable in order to forestall others who may plan to patent this new computational technique
A short note on results of testing two random number generators
Authors: Joseph M. Saur
Venue: ACM SIGSIM Simulation Digest (1989)

Park and Miller argue for a minimal standard generator using the Lehmer model. Wichmann and Hill take a different track, and propose a three-tiered multiplicative model. In practice, real differences exist in their behavior, and this paper presents the results of some simple statistical testing and runtime comparisons. The results raise questions about the statistical behavior of the the Park and Miller minimal generator when creating random streams within a narrow range. The Wichmann and Hill generator produces statistically better results under the circumstances we tested, but takes approximately twice as long to run.
Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search
Authors: M. Newborn
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A parallel alpha-beta search algorithm called unsynchronized iteratively deepening parallel alpha-beta search is described. The algorithm's simple control strategy and strong performance in complicated positions make it a viable alternative to the principal variation splitting algorithm (PVSA). Processors independently carry out iteratively deepening searches on separate subsets of moves. The iterative deepening is unsynchronized, e.g. one processor may be in the middle of the fifth iteration while another is in the middle of the sixth. Narrow windows diminish the importance of backing-up a score to the root of the tree as quickly as possible (one of the principal objectives of the PVSA). Speedups measured on one, two, four, and eight chess-playing computers are reported.
The displacement method for implicit blending surfaces in solid models
Authors: A. P. Rockwood
Venue: ACM Transactions on Graphics (TOG) (1989)

To date, methods that blend solids, that is, B-rep or CSG models, with implicit functions require successive composition of the blending functions to handle an arbitrary solid model. The shape of the resulting surfaces depends upon the algebraic distances defined by these functions. To achieve meaningful shapes, previous methods have relied on blending functions that have a pseudo-Euclidean distance measure. These methods are abstracted, resulting in some general observations. Unfortunately, the functions used can exhibit unwanted discontinuities. A new method, the displacement form of blending, embeds the zero surface of the blending functions in a form for which algebraic distance is C1 continuous in the entire domain of definition. Characteristics of the displacement form are demonstrated using the superelliptic blending functions. Intuitive and mathematical underpinnings are provided.
Information retrieval using a hypertext-based help system
Authors: F. R. Campagnoni, Kate Ehrlich
Venue: ACM Transactions on Information Systems (TOIS) (1989)

Hypertext offers users a simple, flexible way to navigate through electronic information systems but at the potential risk of becoming lost in the network of interconnected pieces of information. A study was conducted on information retrieval using a commercial hypertext-based help system. It was found that the predominant search strategy was &ldquo;browsing&rdquo; (characterized by scanning tables of contents and paging through topics), rather than employing the indexes ("analytical search"). Although subjects did not get lost, individuals with better spatial visualization skills, as measured by a standardized test, were faster at retrieving information and returned to the top of the information hierarchy less often than those with poorer spatial visualization skills. These results support previous studies that have found a strong preference by users for browsing in hypertext systems and extend those findings to a new domain (help), a different type of user interface, and a different information architecture. In addition, the results demonstrate the importance of spatial visualization ability for efficient navigation and information retrieval in a hierarchical hypertext system.
Chameleon: A System for Solving the Data-Translation Problem
Authors: S. A. Mamrak, M. J. Kaelbling, C. K. Nicholas, M. Share
Venue: IEEE Transactions on Software Engineering (1989)

A comprehensive data translation system is described with the following characteristics: (1) it is derived from a formal model of the translation task; (2) it supports the building of translation tools; (3) it supports the use of translation tools; and (4) it is accessible to its targeted end users. A software architecture to achieve the translation capability is fully implemented. Translators have been generated using the architecture, both by the original software developers and by industrial associates who have installed the architecture at their own sites.
Intensions and extensions in a reflective tower
Authors: Olivier Danvy, Karoline Malmkjaer
Venue: Proceedings of the 1988 ACM conference on LISP and functional programming (1988)

This article presents a model of the reflective tower based on the formal semantics of its levels. They are related extensionally by their mutual interpretation and intensionally by reification and reflection. The key points obtained here are: a formal relation between the semantic domains of each level; a formal identification of reification and reflection; the visualisation of intensional snapshots of a tower of interpreters; a formal justification and a generalization of Brown's meta-continuation; a (structural) denotational semantics for a compositional subset of the model; the distinction between making continuations jumpy and pushy; the discovery of the tail-reflection property; and a Scheme implementation of a properly tail-reflective and single-threaded reflective tower. Section 1 presents the new approach taken here: rather than implementing reification and reflection leading to a tower, we consider an infinite tower described by the semantics of each level and relate these by reification and reflection. Meta-circularity then gives sufficient conditions for implementing it. Section 2 investigates some aspects of the environments and control in a reflective tower. An analog of the funarg problem is pointed out, in relation with the correct environment at reification time. Jumpy and pushy continuations are contrasted, and the notions of ephemeral level and proper tail-reflection are introduced. Our approach is compared with related work and after a conclusion, some issues are proposed.
Neural networks and artificial intelligence
Authors: N. E. Sondak
Venue: ACM SIGCSE Bulletin (1989)

Neural networks have been called &ldquo;more important than the atomic bomb&rdquo; and have received a major funding commitment from DARPA. Nevertheless, it is difficult to find even a mention of neural network concepts and applications in many computer science or information systems curricula. In fact, few computer science or information systems faculty are aware of the profound implications of neurocomputing on the future of their field. This paper contends that neural networks must be a significant part of any artificial intelligence course. It illustrates how neural network concepts can be integrated into traditional artificial intelligence course material. Two programming packages for simulating neural networks on personal computers are recommended.
The computer reaches out: the historical continuity of interface design
Authors: Jonathan Grudin
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

This paper examines the evolution of the focus of user interface research and development from the first production of commercial computer systems in the 1950s through the present. The term &ldquo;user interface&rdquo; was not needed in the beginning, when most users were engineers and programmers; it may again become inappropriate when more applications are written for groups than for individuals. But there is a continuity to the outward movement of the computer's interface to its external environment, from hardware to software to increasingly higher-level cognitive capabilities and finally to social processes. As the focus shifts, the approaches to design and the skills required of practitioners changes. In this paper five foci or levels of development are identified. Most development today is positioned in the third level and considerable research is directed at the fourth. Some attention is now being given to the fifth: repositioning the interface in the work group or organization itself. Work at the different levels is not entirely independent, so establishing a comprehensive framework may enable us to position existing research and development efforts and plan future work more effectively.
PROQUEL: a PROgramming QUEry language
Authors: Jean-Yves Lingat, Colette Rolland
Venue: Proceedings of the second international workshop on Database programming languages (1989)

This paper presents PROQUEL, an executable specification language conceived for the RUBIS system, an Information System development tool. PROQUEL is at the same time a specification language, data manipulation language and programming language; making it particularly well suited for prototyping database applications. After a brief introduction to the RUBIS system, the functionnality and the various advantages of the PROQUEL language are examinated.
Optimal algorithms for approximate clustering
Authors: Tomás Feder, Daniel Greene
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

In a clustering problem, the aim is to partition a given set of n points in d-dimensional space into k groups, called clusters, so that points within each cluster are near each other. Two objective functions frequently used to measure the performance of a clustering algorithm are, for any L4 metric, (a) the maximum distance between pairs of points in the same cluster, and (b) the maximum distance between points in each cluster and a chosen cluster center; we refer to either measure as the cluster size. We show that one cannot approximate the optimal cluster size for a fixed number of clusters within a factor close to 2 in polynomial time, for two or more dimensions, unless P=NP. We also present an algorithm that achieves this factor of 2 in time &Ogr;(n log k), and show that this running time is optimal in the algebraic decision tree model. For a fixed cluster size, on the other hand, we give a polynomial time approximation scheme that estimates the optimal number of clusters under the second measure of cluster size within factors arbitrarily close to 1. Our approach is extended to provide approximation algorithms for the restricted centers, suppliers, and weighted suppliers problems that run in optimal &Ogr;(n log k) time and achieve optimal or nearly optimal approximation bounds.
On the asymptotic analysis of the Euclidean algorithm
Authors: G. H. Norton
Venue: Journal of Symbolic Computation (1990)

Let N>=2 and @e > 0. For uniformly distributed integers in the interval [1, N], the Euclidean algorithm requires an average of 12ln@?2@p^2(ln@?N-12+@z^'(2)@z^'(2))+C-12+O(N^@e^-^1^/^6) divisions, where C is Porter's constant.
One-Dimensional Regularization with Discontinuities
Authors: David Lee, Theo Pavlidis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

Regularization is equivalent to fitting smoothing splines to the data so that efficient and reliable numerical algorithms exist for finding solutions. however, the results exhibit poor performance along edges and boundaries. To cope with such anomalies, a more general class of smoothing splines that preserve corners and discontinuities is studied. Cubic splines are investigated in detail, since they are easy to implement and produce smooth curves near all data points except those marked as discontinuities or creases. A discrete regularization method is introduced to locate corners and discontinuities in the data points before the continuous regularization is applied.