ppxscal/embedding_network huggingface dataset:
On Quantization Errors in Computer Vision
Authors: Ping Wah Wong
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The author considers the error resulting in the computation of multivariable functions h(X/sub 1/, X, . . ., X/sub n/), where all the X/sub i/s are only available in the quantized form. In image processing and computer vision problems, the variables are typically a mixture of the spatial coordinates and the intensity levels of objects in an image. A method is introduced using a first-order Taylor series expansion together with a periodic extension of the resulting expression and its Fourier series representation so that the moments and the probability distribution function of the error can be computed in closed form. This method only requires that the joint probability density function of X/sub i/s be known and makes no assumption on the behavior on the quantization errors of the variables. Examples are also given where these results are applied.
Theoretical Aspects of Gray-Level Morphology
Authors: Henk J. A. M Heijmans
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

After a brief discussion of the extension of mathematical morphology to complete lattices, the space of gray-level functions is considered and the concept of a threshold set is introduced. It is shown how one can use binary morphological operators and thresholding techniques to build a large class of gray-level morphological operators. Particular attention is given to the class of so-called flat operators, i.e. operators which commute with thresholding. It is also shown how to define dilations and erosions with nonflat structuring elements if the gray-level set is finite. It is reported that mere truncation yields wrong results.
Parallel Algorithms for Geometric Connected Component Labeling on a Hypercube Multiprocessor
Authors: K. P. Belkhale, P. Banerjee
Venue: IEEE Transactions on Computers (1992)

Parallel algorithms for the geometric connected component labeling (GCCL) problem on a hypercube multiprocessor can be designed by dividing the domain, consisting of a number of rectangles, into regions using a slice or rectangular partitioning scheme. Each processor in the hypercube is assigned one partition. The processor determines the connected sets of rectangles in its partition. The connected sets at different processors have to then be combined across processors into globally connected sets. This merging problem is defined as the GCCL problem. Different algorithms for the GCCL problem are presented. Each of the algorithms involves d stages of message passing, for a d-dimensional hypercube. The basic idea in these algorithms is that in each stage a processor increases its knowledge of the domain. The algorithms described in this paper differ in their run time, memory requirements, and message complexity. These algorithms have been implemented on an Intel iPSC2/D4/MX hypercube.
A survey of computer graphics image encoding and storage formats
Authors: Wayne E. Carlson
Venue: ACM SIGGRAPH Computer Graphics (1991)

This paper is a survey of several storage formats used for computer generated or sampled images, both for purposes of archival storage and transmission (transfer from one location or platform to another). Various methodologies for the compression of such images are presented and discussed, Image storage standards and some of the more common commercial image storage techniques are presented in terms of the underlying compression algorithms they are based upon and the general internal data structures and formats.
Sensitive security points in PC microcomputers: understanding for building secure solutions to intrusions
Authors: Daniel Guinier
Venue: ACM SIGSAC Review (1992)

The future of computer security is very dependent on the wild development of networking and microcomputing, and it is more and more difficult to protect microcomputers against enhanced piracy or "viruses". Also, a revision of such systems must be taken into consideration involving machines, operating systems, applications and data to avoid unauthorized access, abusive use of resources and losses of confidentiality, integrity and availability.Solutions need to be realistic to guarantee effective security. This involves mechanisms which are dependent on hardware and system software. MS-DOS components at work, boot, interrupts, DOS call functions are examined, and at the same time advanced "viruses" usages involving active and passive techniques, to suggest and evaluate possible solutions.A dual software examiner and security board solution is described. It does not necessitate modifying actual versions of the operating system, or applications in use, and new information about files can be stored in a secure way to avoid manipulation. Such a proposition can help to build security as a countermeasure to various intrusions, these from men, "viruses", worms and Trojan horses. It is better than any pure software solution which cannot guarantee overall security and especially in case of advanced "stealthy virus" attacks. It is possible to implement an intrusion detection model to predict future action from different intruders. This model has to support intuition exploration, and uncertainty or adaptative reasoning, working under control of a software security examiner which is itself under control of a hardware.
An Optimal Approach for Random Signals Classification
Authors: Christian Doncarli, Eric Le Carpentier
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

A method is proposed which solves the problem of the Bayes classification of ARMA (autoregressive moving average) signals when the models of classes and samples are not exactly known but only estimated from finite-length data sequences. Justified approximations and the hypothesis lead to decision rules including the variances of the estimations. The results obtained on a large set of simulated data show that this approach is superior to the best classical methods (cepstral distance or Kullback divergence), particularly in the common case where the hypothesis of those methods is not verified (short samples. small training sets. random classes).
Efficient Unidirectional Error Codes for Block Memories
Authors: Bruce L. Montgomery
Venue: IEEE Transactions on Computers (1991)

Unidirectional error-correcting (UEC) codes are presented that are suitable for memory systems in which data are stored in blocks consisting of tracks. UEC codes are proposed that can correct any error pattern consisting of unidirectional errors confined to a single track. For two or more information tracks, a code exists for any given nontrivial length. It is shown that the codes can be constructed for any large track length and codes can have significantly higher information rates than other such UEC codes.
Reflection facilities and realistic programming
Authors: Yutaka Ishikawa
Venue: ACM SIGPLAN Notices (1991)

We propose a new reflection model called 2-dimensional hierarchical reflection. The model naturally describes reflective facilities which enable us to change the language semantics as well as the underlying environment, i.e., memory management and cpu scheduling. The concurrent object-oriented programming language called AL-1 has been designed based on the model. The language is an adaptable/extensible system in the sense that the system's bevavior is dynamically changed by the way of reflection. In order to demonstrate how the language is adapted in user's demand, the typical reflective programming in the language is presented.
Extended object oriented model to design relational databases (abstract)
Authors: Asad Khailany, Wafa Khorshid
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

The recent trend in designing relational databases systems has been toward using object oriented model in high level. The next step is to convert the high level model into the relational diagrams from which relational are extracted. Finally the relations are examined to make it sure that they are fully normalized. In the current Object Oriented model a number of important concepts of the relational data bases such as generalization, subset hierarchy, the relation of a record type to itself..etc either can not be represented or it hard to represent them. In this presentation the object oriented model is extended to have a better representation of the concepts such as optional or mandatory relationship, aggregation objects, association objects, generalization, subset hierarchy and others.
EST: The new frontier in automatic test-pattern generation
Authors: John Giraldi, Michael L. Bushnell
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We present a new algorithm, EST, that accelerates any combinatorial circuit Automatic Test-Pattern Generation algorithm. EST detects equivalent search states, which are saved for all faults during ATPG. The search space is reduced by using Binary Decision Diagram fragments to detect previously-encountered search states (possibly from prior faults). Search terminates earlier than before. Redundant fault analysis further accelerates ATPG. ATPG is accelerated 1347 times for hard-to-test faults in the ISCAS '85 benchmarks.
Pragmatic parsing in Common Lisp; or, putting defmacro on steroids
Authors: Henry G. Baker
Venue: ACM SIGPLAN Lisp Pointers (1991)

We review META, a classic technique for building recursive descent parsers, that is both simple and efficient. While META does not handle all possible regular or context-free grammars, it handles a surprisingly large fraction of the grammars encountered by Lisp programmers. We show how META can be used to parse streams, strings and lists---including Common Lisp's hairy lambda expression parameter lists. Finally, we compare the execution time of this parsing method to the built-in methods of Common Lisp.
Massively Parallel Model Matching: Geometric Hashing on the Connection Machine
Authors: Isidore Rigoutsos, Robert Hummel
Venue: Computer (1992)

The parallelizability of geometric hashing is explored, and two algorithms are presented. Geometric hashing uses the collection of models in a preprocessing phase (executed off line) to build a hash table data structure. The data structure encodes the model information in a highly redundant, multiple-viewpoint way. During the recognition phase, when presented with a scene and extracted features, the hash table data structure indexes geometric properties of the scene features to candidate models. The first uses: parallel hypercube techniques to route information through a series of maps and building-block parallel algorithms. The second algorithm uses the Connection Machine's large memory resources and achieves parallelism through broadcast facilities from the front end. The discussion is confined to the problem of recognizing dot patterson embedded in a scene after they have undergone translation, rotation, and scale changes.
An Entropy-Based Measure of Software Complexity
Authors: Warren Harrison
Venue: IEEE Transactions on Software Engineering (1992)

It is proposed that the complexity of a program is inversely proportional to the average information content of its operators. An empirical probability distribution of the operators occurring in a program is constructed, and the classical entropy calculation is applied. The performance of the resulting metric is assessed in the analysis of two commercial applications totaling well over 130000 lines of code. The results indicate that the new metric does a good job of associating modules with their error spans (averaging number of tokens between error occurrences).
The design of digital filters using REDUCE
Authors: Manfred Hollenhorst
Venue: ACM SIGSAM Bulletin (1992)

A central problem in signal processing is the filtering of signals. In the design of digital filters with the aid of the bilinear transform REDUCE [1] can be used with great benefit. A filter - as used in signal processing - is a circuitry or a processor that transforms incoming signals, e.g. suppresses noise.
Surface Reconstruction Using Deformable Models with Interior and Boundary Constraints
Authors: Y. F. Wang, Jih-Fang Wang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors introduce a technique for 3D surface reconstruction using elastic deformable-models. The model used is an imaginary elastic grid, which is made of membranous, thin-plate-type material. The elastic grid can bent, twisted, compressed, and stretched into any desired 3D shape, which is specified by the shape constraints derived automatically from images of a real 3D object. Shape reconstruction is guided by a set of imaginary springs that enforce the consistency in the position, orientation, and/or curvature measurements of the elastic grid and the desired shape. The dynamics of a surface reconstruction process is regulated by Hamilton's principle or the principle of the least action. Furthermore, a 1D deformable template that borders the elastic grid may be used. This companion boundary template is attracted/repelled by image forces to conform with the silhouette of the imaged object. Implementation results using simple analytic shapes and images of real objects are presented.
Epikit: a library of subroutines supporting declarative representations and reasoning
Authors: Narinder Singh, Michael Genesereth
Venue: ACM SIGART Bulletin (1991)

Epikit is a library of Common Lisp subroutines intended for use in the construction of programs that operate on databases encoded in Knowledge Interchange Format (KIF).The goals of Epikit are to provide a robust, portable, and efficient library of subroutines to support representation and reasoning methods based on Logic. The focus primarily is on first-order logic (FOL) with extensions to support meta-knowledge, i.e., knowledge about other expressions in the KIF language, and extensions to support the specification and interpretation of programs for intelligent control applications.
Is software warfare &ldquo;unthinkable&rdquo;? or is there a rational basis for its adoption?: A proposal for ethical reflection and action
Authors: Eric V. Leighninger
Venue: ACM SIGSAC Review (1991)

We in the information security community have lost our claim to innocence. We have known sin. For years, we have been viewing ourselves as crusading defenders of the faith, guardians of a mythical "cyberspace" community against the infidels of computing, those who would penetrate, vandalize, and exploit the systems of innocent users. We have painted the security technology we have been developing as good and the intrusive methods developed by the "hackers", "phreaks", and computer terrorists as bad. The labels appeared clear - we, the computer security folks, wore the white hats and the other guys, the black. However, in much the same way that knowledge of computer security flaws aided the penetrators of systems, so our knowledge of malicious software methods has contributed to our ability to build more robust, resilient, intrusion-resistant systems. Where we differ from the bad guys, we think, is in application and motive for use. But times are changing. The spectre of computer warfare, the dark twin to INFOSEC, has arisen. The computer security technology that we selectively considered as benignly good has a darker side which is becoming more apparent, as happened to the technologies for nuclear energy and biochemistry. If history has been any teacher, computer technology, security related or otherwise, will be no exception. We now have a two-edged Sword of Damocles at our disposal. It, like its nuclear and biochemical warfare cousins, is poised to hang over our heads. We need to heed Santayana's advice: "Those who cannot remember the past are condemned to repeat it." and not ignore history in examining early on the threats software warfare may pose now and in the distant future.
Management of a remote backup copy for disaster recovery
Authors: Richard P. King, Nagui Halim, Hector Garcia-Molina, Christos A. Polyzois
Venue: ACM Transactions on Database Systems (TODS) (1991)

A remote backup database system tracks the state of a primary system, taking over transaction processing when disaster hits the primary site. The primary and backup sites are physically isolated so that failures at one site are unlikely to propogate to the other. For correctness, the execution schedule at the backup must be equivalent to that at the primary. When the primary and backup sites contain a single processor, it is easy to achieve this property. However, this is harder to do when each site contains multiple processors and sites are connected via multiple communication lines. We present an efficient transaction processing mechanism for multiprocessor systems that guarantees this and other important properties. We also present a database initialization algorithm that copies the database to a backup site while transactions are being processed.
A fiber optic hypermesh for SIMD/MIMD machines
Authors: Ted Sztnabski
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

A fiber optic multidimensional mesh-based network for SIMD and MIMD multiprocessors is proposed. For the basic building block, a novel distributed optical switch is proposed; The switch requires 50 % fewer lasers/receivers than previous WDM optical crossbars and uses a novel random-access scheme which supports prioritized traffic. To implement very large networks using lasers with limited tunability (or electronic crossbars of small degree) we propose arranging switches into a novel n-dimensional network which we call a &ldquo;hypermesh&rdquo;. The hypermesh is unique in that it matches the &Ogr;(logN) delay for random communications in dynamic multistage networks and the &Ogr;(1) delay for permutations over nearest neighbors in a hypercube. A hypermesh also uses far fewer lasers/receivers than hypercubes of similar size, has many more nearest neighbors and has a much smaller diameter, all very attractive features. The hypermesh can be modelled as a hypergraph, and when d &ge; k its size exceeds the Moore bound (which applies to graphs rather than hypergraphs). It is proved that the hypermesh can realize all &OHgr; and &OHgr;-1 passable permutations &ldquo;in one pass&rdquo; and in minimum distance, like the hypercube. Therefore, by doubling the number of lasers/receivers in each node the hypermesh is rear-rangeably nonblocking. The hypermesh is recursively partitionable into smaller hypermeshes, each of which can be independently operated as a message-passing or circuit-switched network for MIMD machines or a permutation network for SIMD machines. An electronic hypermesh seems particularly well suited for interconnecting T800 Transputer type nodes with small bounded degree.
Three new-generation software environments
Authors: Enn Tyugu
Venue: Communications of the ACM (1991)

As a result of the Soviet computer project START, a number of intelligent software environments have been developed. In the heart of these environments lies structural program synthesis&mdash;an automatic program synthesis technique developed in the Estonian Academy of Sciences and initially implemented on old mainframe computers [4]. This program synthesis technique can be considered as a particular method of logic programming&mdash;propositional logic programming [12].
Case studies of SNePS
Authors: Stuart C. Shapiro
Venue: ACM SIGART Bulletin (1991)

SNePS, the Semantic Network Processing System, has been designed to be a system for representing the beliefs of a natural-language-using intelligent system (a "cognitive agent"). This paper expands on this motivation, discusses some of the system features that derived from this motivation, and presents four case studies of interactions with SNePS demonstrating some of these features. The features demonstrated in the case studies are: non-standard connectives; the use of recursive rules; the Unique Variable Binding Rule, that says that two variables in a rule cannot be instantiated to the same term; and discussing sentences and propositions in natural language.
Reasoning about programs in continuation-passing style.
Authors: Amr Sabry, Matthias Felleisen
Venue: Proceedings of the 1992 ACM conference on LISP and functional programming (1992)

Plotkin's &lgr;-value calculus is sound but incomplete for reasoning about &bgr;eegr;-transformations on programs in continuation-passing style (CPS). To find a complete extension, we define a new, compactifying CPS transformation and an &ldquo;inverse&rdquo;mapping, un-CPS, both of which are interesting in their own right. Using the new CPS transformation, we can determine the precise language of CPS terms closed under &bgr;7eegr;-transformations. Using the un-CPS transformation, we can derive a set of axioms such that every equation between source programs is provable if and only if &bgr;&eegr; can prove the corresponding equation between CPS programs. The extended calculus is equivalent to an untyped variant of Moggi's computational &lgr;-calculus.
AI based simulation in reusability
Authors: M. W. Aiken
Venue: ACM SIGSOFT Software Engineering Notes (1990)

This paper presents a knowledge-based approach for selecting and testing modular reusable code. This approach entails three stages: system definition through a system entity structure (SES), SES pruning and model synthesis using an expert system (ES), and the evaluation of candidate design models using discrete event simulation (DEVS). An example of this approach is shown through the development of a Group Decision Support System (GDSS) idea generation tool.
The Galaxy Distributed Operating System
Authors: Pradeep K. Sinha, Mamoru Maekawa, Kentaro Shimizu, Xiaohua Jia, Hyo Ashihara, Naoki Utsunomiya, Kyu S. Park, Hirohiko Nakano
Venue: Computer (1991)

The Galaxy research project, which is attempting to design, implement, and use a distributed computing environment, based on the idea of making gradual improvements by learning from existing systems and trying to overcome their limitations, is described. The design goals and novel aspects of the project are outlined, and the Galaxy system architecture is described. Galaxy's object naming and locating mechanisms, interprocess communication, and computation model are discussed.
Sparse extensions to the FORTRAN Basic Linear Algebra Subprograms
Authors: David S. Dodson, Roger G. Grimes, John G. Lewis
Venue: ACM Transactions on Mathematical Software (TOMS) (1991)

This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extension is targeted at sparse vector operations, with the goal of providing efficient, but portable, implementations of algorithms for high-performance computers.
The decoupled simulation model for virtual reality systems
Authors: Chris Shaw, Jiandong Liang, Mark Green, Yunqi Sun
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The Virtual Reality user interface style allows the user to manipulate virtual objects in a 3D environment using 3D input devices. This style is best suited to application areas where traditional two dimensional styles fall short, but the current programming effort required to produce a VR application is somewhat large. We have built a toolkit called MR, which facilitates the development of VR applications. The toolkit provides support for distributed computing, head-mounted displays, room geometry, performance monitoring, hand input devices, and sound feedback. In this paper, the architecture of the toolkit is outlined, the programmer's view is described, and two simple applications are described.