ppxscal/embedding_network huggingface dataset:
New Algorithms for Generating Conway Polynomials over Finite Fields
Authors: Heath Lenwood S., Loehr Nicholas A.
Venue:  (1998)

Arithmetic in a finite field of prime characteristic p normally employs an irreducible polynomial in Z_p[X]. A particular class of irreducible polynomials, generally known as Conway polynomials, provides a means for representing several finite fields of characteristic p in a compatible manner. Conway polynomials are used in computational algebra systems such as GAP and Magma to represent finite fields. The generation of the Conway polynomials for a particular finite field has previously been done by an often expensive brute force search. As a consequence, only a few Conway polynomials have been generated. We present two algorithms for generating Conway polynomials that avoid the brute force search. We have implemented one of these algorithms in Magma and present numerous new Conway polynomials that implementation generated.
Logicism and Meaning : The Case Against (Draft)
Authors: I. D. Craig
Venue:  (1991)

This paper argues, contrary to the claims of other workers, that formal semantics in the sense of model theory cannot provide an adequate basis for the ascription of meanings in AI programs.
Eigenvector Decomposition of a Multiresolution Operator
Authors: J. Wong, R. G. Wilson
Venue:  (1990)

Pattern recognition using a multiresolution representation was investigated. This was addressed as an eigenvalue problem. Eigenvector decomposition of a multiresolution operator enabled a low-pass pyramid representation to be expressed in terms of the ''eignpatterns'' of the operator. The findings show that different image features ''emerge'' and can be recognised at different levels of the multiresolution structure, i.e. at different resolutions. The level depends on the feature size. This work has implications in the design of a neural network for pattern recognition, namely that a network could ''learn'' the eigenpattern of a multiresolution operator. Patterns recognition processing could proceed in a top-down, hierarchical manner, beginning at a level of coarse features and using information from lower levels in the multiresolution structure to guide the processing of finer detail.
Specification and Testing of Temporal Properties of Concurrent System Designs
Authors: Laura K. Dillon, Qing Yu
Venue:  (1994)

This paper investigates the use of Graphical Interval Logic for specification and testing of concurrent and real-time systems. Past research produced a toolset for creating specifications in GIL and for reasoning about properties of systems that satisfy their specifications. Current research is exploring the use of GIL specifications during system design and implementation. Our work to date has focused primarily on using GIL specifications as oracles during testing of executable designs. The paper presents an example in which GIL specifications for an Ada design are used to uncover faults during testing. It also shows how the graphical representation of formulas can be used to advantage in displaying a trace that violates a specification. The testing methods have yet to be automated.
A graphical interface for viewing mammograms interactively
Authors: Ramachandran Chandrasekhar, Yianni Attikiouzel
Venue:  (1999)

This paper presents the design principles for a graphical user interface for viewing mammograms interactively, in the context of self-paced, computer-aided instruction. Patient data, whole image and full resolution views, feature highlighting, image processing and radiology and pathology reports, are all integrated into a self-contained package with intuitively understood graphical icons to permit rapid learning and comfortable use. The image database is searchable by patient, view, date, similarity of lesion appearance, and pathology so that different slices of the same data may be reviewed to consolidate knowledge and test understanding.
Enabling Technologies for Empirical Modelling in Graphics
Authors: James Allderidge, Meurig Beynon, Richard Cartwright, Yun P Yung
Venue:  (1997)

Empirical Modelling is an approach to computer-based modelling that has been under development at the University of Warwick for over ten years. It combines agent-oriented modelling with state representation based on scripts of definitions that capture the dependencies between observables. Unlike conventional modelling methods, its focus is upon using the computer as a physical artefact and modelling instrument to represent speculative and provisional knowledge. Previous research has indicated the potential for wide application to interactive graphics, computer-aided design, concurrent engineering and concurrent systems modelling. This has been demonstrated in principle by numerous case-studies, but existing tools do not yet exploit the underlying concept fully and efficiently. This paper discusses Empirical Modelling in relation to conventional computer programming, describes technical progress towards better practical implementations and identifies new computer architectures on which the aspirations of Empirical Modelling can be realised.
Markov Random Fields in Visual Reconstruction
Authors: Ola Siksik
Venue:  (1990)

Markov Random Fields (MRFs) are used in computer vision as an effective method for reconstructing a function starting from a set of noisy, or sparse data, or in the integration of early vision processes to label physical discontinuities. The MRF formalism is attractive because it enables the assumptions used to be explicitly stated in the energy function. The drawbacks of such models have been the computational complexity of the implementation, and the difficulty in estimating the parameters of the model. \n In this thesis, the deterministic approximation to the MRF models derived by Girosi and Geiger [10] is investigated, and following that approach, a MIMD based algorithm is developed and implemented on a network of T800 transputers under the Trollius operating system. A serial version of the algorithm has also been implemented on a SUN 4 under Unix. \n The network of transputers is configured as a 2-dimensional mesh of processors (currently 16 configured as a $4 \times 4$ mesh), and the input partitioning method is used to distribute the original image across the network. \n The implementation of the algorithm is described, and the suitability of the transputer for image processing tasks is discussed. \n The algorithm was applied to a number of images for edge detection, and produced good results in a small number of iterations. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Java Layers: Extending Java to Support Component-Based Programming
Authors: Richard Cardone, Don Batory, Calvin Lin
Venue:  (2000)

Java Layers extends the Java programming language by implementing a software component model based on layer composition. Each layer implements a single design feature and may contain code that crosscuts multiple classes. Layer composition enables large software applications to be constructed in a more modular way, and with a higher level of semantic checking, than is typically achieved using current programming techniques such as object-oriented frameworks. This paper describes the Java Layers language extension.
FAULT INTERPRETATION: FINE-GRAIN MONITORING OF PAGE ACCESSES
Authors: Daniel R. Edelson
Venue:  (1992)

This paper presents a technique for obtaining fine-grain information about page accesses from standard virtual memory hardware and UNIX operating system software. This can be used to monitor all user-mode accesses to specified regions of the address space of a process. Application code can intervene before and/or after an access occurs, permitting a wide variety of semantics to be associated with memory pages. The technique facilitates implementing complex replication or consistency protocols on transparent distributed shared memory and persistent memory. The technique can also improve the efficiency of certain generational and incremental garbage collection algorithms. This paper presents our implementation and suggest several others. Efficiency measurements show faults to be about three orders of magnitude more expensive than normal memory accesses, but two orders of magnitude less expensive than page faults. Information about how to obtain the code via anonymous ftp appears at the end of the paper.
Appendix -- Specification and Testing of Temporal Properties of Concurrent System Designs
Authors: Laura K. Dillon, Qing Yu
Venue:  (1994)

[This is the appendix for TRCS94-04.]
Solving Domain Equations in NaDSet
Authors: Paul C. Gilmore, George K. Tsiknis
Venue:  (1991)

Solutions of systems of domain equations is the basis for what is called the Strachey-Scott approach to providing a denotational semantics for programming languages. The solutions offered by the mathematical methods developed by Scott, however, do not provide a computational basis for the semantics in the form of a proof theory. The purpose of this paper is to provide such a theory using the logic and set theory NaDSet. \nThe development of NaDSet was motivated by the following three principles:\\ 1. Abstraction, along with truth functions and quantification, is one of the three fundamental concepts of logic and should be formalized in the same manner as the other two.\\ 2. Natural deduction presentations of logic provide a transparent formalization of Tarski''s reductionist semantics.\\ 3. Atomic formulas receive their truth values from a nominalist interpretation. \nThat these three principles lead to a successful resolution of the set theoretic paradoxes and to a sound formulation of NaDSet has been demonstrated elsewhere with proofs of consistency and completeness. Applications of NaDSet to programming language semantics, category theory, non-well-founded sets, and to foundational questions of mathematics have also been demonstrated. \nThe financial support of the Natural Science and Engineering Research Council of Canada is gratefully acknowledged.
Representation Spatial Experience \& Solving Spatial Problems in a Simulated Robot Environment
Authors: Peter F Rowat
Venue:  (1979)

This thesis is concerned with spatial aspects of perception and action in a simple robot. To this end, the problem of designing a robot-controller for a robot in a simulated robot-envoronment system is considered. The environment is two-dimentional tabletop with movable polygonal shapes on it. The robot has an eye which `sees'' an area of the tabletop centred on itself, with a resolution which decreases from the centre to the periphery. Algorithms are presented for simulating the motion and collision of two dimentional shapes in this environment. These algorithms use representations of shape both as a sequence of boundary points and as a region in digital image. A method is outlined for constructing and updating the world model of the robot as new visual input is received from the eye. It is proposed that, in the world model, the spacial problems of path-finding and object-moving be based on algorithms that find the skeleton of the shape of empty space and of the shape of the moved object. A new iterative algorithm for finding the skeleton, with the property tbat the skeleton of a connected shape is connected, is presented. This is applied to path-finding and simple object-moving problems. Finally, directions for future work are outlined.
Developing Linear Algebra Algorithms: A Collection of Class Projects
Authors: John A. Gunnels, Robert A. van de Geijn
Venue:  (2001)

In this document we present a new approach to developing sequential and parallel dense linear algebra libraries. Given a linear algebra operation, we demonstrate how formal techniques can be used to derive a family of algorithms. Due to the systematic approach used, correctness of the algorithms can be asserted. Next, we introduce a library of routines that hides the manipulation of indices and allows the code to mirror the algorithms as they are naturally presented. The idea is that by having the code mirror the algorithm, the opportunity for introducing indexing errors is minimized. Thus, the correctness assertions regarding the algorithms carry over to the implementations. The philosophy behind the approach is that one should start by systematically deriving the algorithms. The recipe for derivation is given in Chapter 2. Moreover, this derivation should be carefully documented. To facilitate this, we provide a set of LaTeX macros, given in an appendix. Once one or more algorithms have been developed, they are translated to implementations using a library of C routines, as part of the Formal Linear Algebra Methods Environment (FLAME). This library allows the code to look much like the algorithms as written using LaTeX. For all examples in the report we demonstrate that high performance can be attained on an Intel Pentium (R) III processor. We illustrate the techniques with a large number of case studies, most of which were carried out by teams of computer science undergraduate students as part of a class taught in Spring 2001 at UT-Austin titled High-Performance Parallel Algorithms. The names of the members of the teams are given as the authors of the chapter on the operation assigned to that team. Thus we show that the approach makes the development and implementation of high-performance sequential and parallel algorithms for dense linear algebra operations accessible to novices. It is important to realize that this document is meant to capture the progress of the project during a single semester. Thus, the document is incomplete in many ways. For example, the review of the literature is sparse at best. Many sections and chapters are missing or incomplete. Typographical errors are scattered throughout. For each operation, only a few algorithms are derived and implemented. The performance results are limited to a single architecture. While high-performance parallel implementations were also created using our Parallel Linear Algebra Package (PLAPACK), the discussion of these implementations did not make it into the document. It is our hope that there is value in this document despite these shortcomings.
A Coarse Grained Parallel Variable-Complexity Multidisciplinary Optimization Paradigm
Authors: Susan L. Burgee, Anthony A. Giunta, Vladimir Balabanov, Bernard Grossman, William H. Mason, Robert Narducci, Robert T. Haftka, Layne T. Watson
Venue:  (1995)

Modern aerospace vehicle design requires the interaction of multiple discipines, traditionally processed in a sequential order. Multidisciplinary optimization (MDO), a formal methodology for the integration of these disciplines, is evolving towards methods capable of replacing the traditional sequential methodology of aerospace vehicle design by concurrent algorithms, with both an overall gain in product performance and a decrease in design time. A parallel MDO paradigm using variable-complexity modeling and multipoint response surface approximations is presented here for the particular instance of the design of a high speed civil transport (HSCT). This paradigm interleaves the disciplines at one level of complexity, and processes them hierarchically at another level of complexity, achieving parallelism within disciplines, rather than across disciplines. A master-slave paradigm manages a coarse grained parallelism of the analysis and optimization codes required by the disciplines showing reasonable speedups and efficiencies on an Intel Paragon.
INTERACTIVE GRAPHICAL EXPLORATION OFMULTIDIMENSIONAL NONLINEAR DYNAMICAL SYSTEMS
Authors: Judy Challinger
Venue:  (1991)

This paper discusses the application of an inherently three-dimensional graphical representation tool, isosurfaces, as a means to *interactively* explore and visualize the attractors of a nonlinear dynamical system with a fifteen-dimensional parameter space. A program has been written which allows the scientist to interactively select and visualize three-dimensional subspaces of the fifteen- dimensional parameter space. The dynamical system used for this project is a discrete-time, nonlinear, three-nation Richardson model with economic constraints. This dynamical system, which models the shifting alliances of nations in an arms race, maps an initial point in the unit cube to another point in the unit cube after multiple iterations of the model functions. Using an isosurface function on the resulting volumetric data set, surfaces indicating the changing alliances of nations are generated and rendered. [Also in "International Journal of Bifurcation and Chaos", Vol 2, No 2, 1992 pp. 251-26.] The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Dense Edge-Disjoint Embedding of Binary Trees in the Mesh
Authors: A. M. Gibbons, M. S. Paterson
Venue:  (1992)

We present an embedding of the complete binary tree with n leaves in the Vn x Vn mesh, for any n = 2exp(2m) where m is a positive integer. The embedding has the following properties: at most two tree nodes (one of which is a leaf) are mapped onto each mesh node, paths of the tree are mapped onto edge-disjoint paths in the mesh (each mesh edge considered as two anti-parallel directed edges) and the maximum distance from a leaf to the root of the tree is Vn + O (log n) mesh steps. This embedding facilitates efficient implementation of many P-RAM algorithms on the mesh, particularly those using the balanced binary tree technique. Such an embedding offers greater flexibility of use and improves the time complexity of these implementations by a constant factor compared with previously described embeddings.
Formal Techniques in the Development of Blackboard Systems
Authors: I. D. Craig
Venue:  (1991)

This paper describes a formal method for the development of blackboard systems. The method is based, in part, on the informal one. Apart from the difference in emphasis (formal rather than informal), the new approach rests upon a formal definition of the architecture. The essential idea is that the mapping between the formal model of the problem domain ( which is intended to be similar to the formal models proposed by, for example, Hayes) and the blackboard shell should be supported by formal proofs of correctness in a way identical to formal software engineering. The control structure for the resulting system is derived by considering the blackboard as being transformed from an initial state to a set of potential final states. Each of the final states represents one of the possible answers that the system may produce. The paths from initial to final states can be treated either as traces or by regarding the entire control problem as formalizable in a temporal logic.
Speaker Independent Recognition of Small Vocabulary
Authors: Jason Chong, Roberto Togneri
Venue:  (1996)

This paper reports on the implementation of a real-time speaker independentisolated word speech recognition program on a PC Windows platform. The overall structure of the recognition engine is based on the Dynamic Time Warping (DTW) paradigm for computational efficiency. Furthermore, to decrease the recognition time and increase the recognition accuracy, the dictionary is limited to under 15 words. This severely restricts the vocabulary. To overcome this restriction, a new technique is introduced. Many dictionaries are linked in a hierarchical structure and each word in each dictionary will activate a new dictionary related to that word. This represents a basic form of language modelling which is suited for the menu driven interface found in many of today''s applications. The results show that reasonable performance can be achieved by these methods.
A Real-Time System for The Characterisation of Sheep Feeding Phases from Acoustic Signals of Jaw Sounds
Authors: Anthony Zaknich
Venue:  (1996)

Abstract unavailable.
Computational Modeling Systems: Supporting the Development of Scientific Models
Authors: Terence R. Smith, Jianwen Su, Amr El Abbadi, Gustavo Alonso, Amitabh Saran
Venue:  (1994)

We develop a conceptual model of the iterative process of scientific modeling. This model provides an appropriate specification for a large number of concepts relating to those aspects of the scientific modeling process that require significant computational support. In particular, we develop, define and exemplify the unifying concept of representational structures. We employ the conceptual model in developing a framework for a ``computational modeling system'''' (CMS) that supports scientific activity within a simple, unified, computational environment. A high level computational modeling language (CML) is presented with which the modeling concepts that are definable in the computational framework may be constructed and manipulated in a simple, uniform manner. Finally, we describe the design and implementation of a specific computational modeling system, Amazonia, which is intended to support scientific research in the area of earth science. A particularly significant contribution of the paper is the development of a strong conceptual and theoretical basis for the concept of a CMS. (Work supported by NSF grant IRI-9117094.)
The Computational Complexity of Knot and Link Problems
Authors: Joel Hass, Jeffrey C. Lagarias, Nicholas Pippenger
Venue:  (1998)

The Computational Complexity of Knot and Link Problems Joel Hass Department of Mathematics University of California, Davis Davis, CA 95616 USA hass@math.ucdavis.edu Jeffrey C. Lagarias Information Sciences Research A T & T Labs 180 Park Avenue Florham Park NJ 07932-0971 USA jcl@research.att.com Nicholas Pippenger Department of Computer Science University of British Columbia Vancouver, BC V6T 1Z4 CANADA nicholas@cs.ubs.ca We consider the problem of deciding whether a polygonal knot in three dimensional space, or alternatively a knot diagram, is unknotted (that is, whether it is capable of being deformed continuously without self-intersection so that it lies in a plane.) We show that the problem, UNKNOTTING PROBLEM, is in NP. We also consider the problem, SPLITTING PROBLEM, of determining whether two or more such polygons can be split (that is, whether they are capable of being continuously deformed without self-intersection so that they occupy both sides of a plane without intersecting it) and show that it is also in NP. We show that the problem of determining the genus of a polygonal knot (a generalization of the problem of determining whether it is unknotted) is in PSPACE. We also give exponential worst-case running time bounds for deterministic algorithms to solve each of these problems. These algorithms are based on the use of normal surfaces and decision procedures due to W. Haken, with recent extensions by W. Jaco and J. F. Tollefson.
Alternatives in Implementing Noncommutative Grobner Basis Systems
Authors: Keller Benjamin J.
Venue:  (1996)

Alternatives in implementing systems for computing Grobner bases in path algebras (noncommutative polynomial rings) are considered and compared. Adapted forms of the standard variations to the Buchberger''s algorithm (for commutative polynomial rings) are discussed, as is a pattern matching approach that finds the divisors and common multiples among the leading terms of a set of polynomials. Results from preliminary experimentation with a prototype system are used to compare the different configurations of two variations (triple elimination and basis reduction). Eight problem instances split between two classes of problems (one over free algebras, the other over mesh algebras) are used to compare the configurations. An informal analysis suggests that order plays a larger role in determining the execution time for a problem instance that the algorithm. However, by comparing configurations for each of the admissible orders, some observations can be made about the algorithms.