ppxscal/embedding_network huggingface dataset:
The Invention and Development of the Hollerith Punched Card: In Commemoration of the 130th Anniversary of the Birth of Herman Hollerith and for the 100th Anniversary of Large Scale Data Processing
Authors: F. W. Kistermann
Venue: IEEE Annals of the History of Computing (1991)

A detailed and exemplified account is given on the invention and development of the Hollerith Punched Card from the beginning in 1886 until 1928. The change of use from counting to value statistics is shown. The size of the Hollerith Punched Card was standardized very early. The cards were soon used both for data capture and data punching - the dual purpose punched card. The first Hollerith cards were punched with a conductor's punch, soon be replaced by the Pantograph Punch, and, after the decimal columns have appeared, a Mechanical Key Punch, the Type 001, later replaced by the Electrical Key Punch Type 011, was used.
An operating systems project
Authors: Angela Goh
Venue: ACM SIGCSE Bulletin (1992)

An operating systems project which is part of an introductory course in operating systems is described. The project, which emphasizes on process management within operating systems, was implemented on the Motorola 68000 Single Computer Board. In order to complete the work, the students were required to integrate knowledge gained from other courses.
Temporal databases status and research directions
Authors: Richard Snodgrass
Venue: ACM SIGMOD Record (1990)

It seems somehow fitting to begin this paper on databases that store historical information with a chronology, touching briefly on all work that I am aware of in this area. I discuss in some detail what I consider to be the ten most important papers and events in terms of their impact on the discipline of temporal databases. These are emphatically not meant to detract from the other excellent papers in temporal databases. My goal is to characterize the evolution of this field, as an introduction to the approximately 350 papers specifically relating time to databases that have appeared thus far. I then identify and discuss areas where more work is needed.
A practical approach to software quality assurance
Authors: Nikolay S. Bukovsky
Venue: ACM SIGSOFT Software Engineering Notes (1991)

Software quality assurance (SQA) has been recognized as an effective approach to quality problems. This paper reflects INTERPROGRAMA Institute's experience in developing and implementing a SQA program. Topics to be discussed will include: Phased approach to SQA implementation; Management and organization of SQA; Quality measurement; Quality control procedures; Quality measurement tools; Developers' participation in SQA; Anomaly reporting; Quality planning; Defects analysis; INTERPROGRAMA's practical experience and results.
Ring-connected ring (RCR) topology for high-speed networking: analysis and implementation
Authors: Aloknath De, N. Prithviraj
Venue: ACM SIGCOMM Computer Communication Review (1991)

The paper discusses the problems associated with the conventional ring topology and suggests a ring-connected-ring (RCR) topology to tackle some of these problems. Implementation details as well as the analysis of this topology are provided in the article.
Test Generation from LOTOS Specifications
Authors: Piyu Tripathy, Behcet Sarikaya
Venue: IEEE Transactions on Computers (1991)

A novel approach is proposed for generating test cases from LOTOS specifications for protocol conformance testing. A set of transformation rules is applied to the specification, and the specification is mapped to an extended finite state machine called a chart. The flow of data in the chart is modeled by a data flow graph. Test cases are generated from the chart. Program testing strategies are applied for test case selection. A tool implementing this methodology on a workstation is also discussed.
`PRABHA'&mdash;a distributed concurrency control algorithm
Authors: Albert Burger, Vijay Kumar
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

We propose a non-preemptive, deadlock free concurrency control mechanism for distributed database systems. The algorithm uses a combination of transaction blocking and roll-back to achieve serialization. Unlike other locking mechanisms presented in the past, the algorithm proposed here uses dynamic attributes of transactions to resolve conflicts to achieve serialization. We argue that using the dynamic attributes of transactions economizes memory use and reduces conflict resolution time.
Complexity of Fault Diagnosis in Comparison Models
Authors: Douglas M. Blough, Andrzej Pelc
Venue: IEEE Transactions on Computers (1992)

The authors consider a comparison-based probabilistic model for multiprocessor fault diagnosis. They study the problem of optimal diagnosis, which is to correctly identify the status (faulty/fault-free) of units in the system, with maximum probability. For some parameter values, this probabilistic model is well approximated by the asymmetric comparison model introduced by M. Malek (1980). For arbitrary systems it is shown that optimal diagnosis in the probabilistic model and in Malek's model is NP-hard. However, the authors construct efficient diagnosis algorithms in the asymmetric comparison model for a class of systems corresponding to bipartite graphs which includes hypercubes, grids, and forests. Furthermore, for ring systems, a linear-time algorithm to perform optimal diagnosis in the probabilistic model is presented.
From Uncertainty to Visual Exploration
Authors: Peter Whaite, Frank P. Ferrie
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors attempt to determine what can be inferred from ambiguity in processes of visual interpretation. They discuss this question in a specific context: the interpretation of scene geometry in the form of parametrized volumetric models. Ambiguity is described as a local probabilistic property of the misfit error surface in the parameter space of superellipsoid models, namely, as an ellipsoid of confidence in which there is a given probability that the true parameters can be found. The authors show how to project the ellipsoid of confidence back into 3D space to obtain the shell in which the true 3D surface most probably lies and introduce what they call the uncertainty as a local property of the fitted model's surface. They propose a technique that can use this information to plan a new direction of view that minimizes the ambiguity of subsequent interpretation.
Character Recognition Based on Attribute-Dependent Programmed Grammar
Authors: Kyoon Ha Lee, Kie-Bum Eom, R. L. Kashyap
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The recognition of Korean characters by a syntactic method is considered. Korean characters are composed of phonetic symbols in two dimensions and contain very little redundancy. In addition, the phonetic symbols in each character are different in shape and number depending on how they are composed. Thus, attribute information is important. A Korean character recognition algorithm based on an attribute-dependent programmed grammar is presented. The preprocessing and primitive extraction algorithm is also described. The algorithm was implemented and tested with more than 9600 Korean characters in pages randomly selected from children's story books. The algorithm based on the attribute-dependent programmed grammar recognized characters reasonably quickly, with more than 95.1% accuracy.
A note on Fortran 90 source form
Authors: L. P. Meissner
Venue: ACM SIGPLAN Fortran Forum (1990)

Text prepared in accordance with the following rules (which are adapted from X3J3 S8.115, June 1990) is compatible with both the fixed source form and the free source form of Fortran 90. In particular, such text could appear in a file that is intended for possible reference from include lines in either fixed form or free form program units.
Dynamic point location in general subdivisions
Authors: Hanna Baumgarten, Hermann Jung, Kurt Mehlhorn
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

The dynamic planar point location problem is the task of maintaining a dynamic set S of n non-intersecting, except possibly at endpoints, line segments in the plane under the following operations: &bull;Locate(q point): Report the segment immediately above q, i.e., the first segment intersected by an upward vertical ray starting at q; &bull;Insert(s segment): Add segment s to the collection S segments; &bull;Delete(s segment): Remove segment s from the collection S of segments. We present a solution which requires space O(n), has query and insertion time O(log n loglog n) and deletion time O(log2 n). A query time below O(log2 n) was previously only known for monotone subdivisions and horizontal segments and required non-linear space.
Trinocular Stereo Vision for Robotics
Authors: Nicholas Ayache, Francis Lustman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

An approach to building a three-dimensional description of the environment of a robot using three cameras is presented. The main advantages of trinocular versus binocular stereo are simplicity, reliability, and accuracy. It is believed that these advantages make trinocular stereo vision of practical use for many robotics applications. The technique has been successfully applied to several indoor and industrial scenes. Experimental results are presented and discussed.
Image Interpretation Using Multiple Sensing Modalities
Authors: Chen-Chau Chu, J. K. Aggarwal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The AIMS (automatic interpretation using multiple sensors) system, which uses registered laser radar and thermal imagers, is discussed. Its objective is to detect and recognize man-made objects at kilometer range in outdoor scenes. The multisensor fusion approach is applied to four sensing modalities (range, intensity, velocity, and thermal) to improve both image segmentation and interpretation. Low-level attributes of image segments (regions) are computed by the segmentation modules and then converted to the KEE format. The knowledge-based interpretation modules are constructed using KEE and Lisp. AIMS applies forward chaining in a bottom-up fashion to derive object-level interpretations from databases generated by the low-level processing modules. The efficiency of the interpretaton process is enhanced by transferring nonsymbolic processing tasks to a concurrent service manager (program). A parallel implementation of the interpretation module is reported. Experimental results using real data are presented.
The Formal Description and Verification of Hardware Timing
Authors: George J. Milne
Venue: IEEE Transactions on Computers (1991)

A formalism in which timing properties of digital hardware may be specified, derived, and formally verified is introduced as a rigorous theory for hardware timing. A rigorous modeling framework has been used to create a family of related verification techniques rather than a single timing analysis tool. This framework is based on a model of interacting finite state machines called CIRCAL, a formalism developed for the purpose of describing and validating complex concurrent systems. In this approach to hardware timing analysis, the presence of a composition operator is all-pervasive. It provides a single, uniform mechanism for describing the behavior of interacting hardware modules and for establishing and describing the timing properties of such modules.
Parallel Algorithms for Image Processing on OMC
Authors: Mary Mehrnoosh Eshaghian
Venue: IEEE Transactions on Computers (1991)

The author studies a class of VLSI organizations with optical interconnects for fast solutions to several image processing tasks. The organization and operation of these architectures are based on a generic model called OMC, which is used to understand the computational limits in using free space optics in VLSI parallel processing systems. The relationships between OMC and shared memory models are discussed. Also, three physical implementations of OMC are presented. Using OMC, several parallel algorithms for fine grain image computing are presented. A set of processor efficient optimal O(log N) algorithms and a set of constant time algorithms are presented for finding geometric properties of digitized images. Finally, designs tailored to meet both the computation and communication needs of problems such as those involving irregular sparse matrices are examined.
Operational versus definitional: a perspective on programming paradigms
Authors: Allen L. Ambler, Margaret M. Burnett, Betsy A. Zimmerman
Venue: Computer (1992)

Various paradigms that support high-level programming are discussed independently of supporting languages. The paradigms are grouped according to their approach to problem solving. The operational approach describes step-by-step how to construct a solution. The demonstrational approach is a variation on it that illustrates the solution operationally for specific examples and lets the system generalize these example solutions for other cases. The definitional approach is different. It states properties about the solution to constrain it without describing how to compute it. These three approaches are viewed on a continuum from operational to definitional. A pure language solution to the problem of sorting a list into some linear order is presented for each paradigm.
A note on comparison of nonlinear least squares algorithms
Authors: Zafar Khan, Sudhir Chawla, Dinesh Dave
Venue: ACM SIGNUM Newsletter (1990)

The nonlinear least squares problem is a special case of the unconstrained minimization problem. While a large number of new algorithms have been developed in recent years, both for general unconstrained minimization and the least squares case, comparative studies are limited. Further, there has been practically a revolution in algorithm testing and comparison methodology. Recent advances include a more comprehensive performance criteria, use of large numbers of randomly generated test problems, and application of sophisticated statistical techniques for experiment design and data evaluation.These developments have made questionable the findings of the few earlier comparative studies of least squares algorithms. This creates a necessity of a comparative study employing current methodology that evaluates the specialized least squares algorithms along with a few general algorithms for unconstrained minimization.
How to pack better than best fit: tight bounds for average-case on-line bin packing
Authors: Peter W. Shor
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

An O(n log n)-time online algorithm is given for packing items i.i.d. uniform on (0, 1) into bins of size 1 with expected wasted space Theta (n/sup 1/2/ log /sup 1/2/n). This matches the lowest bound that no online algorithm can achieve O(n/sup 1/2/ log /sup 1/2/ n) wasted space. It is done by analyzing another algorithm which involves putting balls into buckets online. The analysis of this second algorithm also gives bound on the stochastic rightward matching problem, which arises in analyzing not only the above online bin packing problem, but also a 2-D problem of packing rectangles into a half-infinite strip. The bounds on rightward matching thus give good bounds for the 2-D strip packing problem.
Formal Verification of Ada Programs
Authors: D. Guaspari, C. Marceau, W. Polak
Venue: IEEE Transactions on Software Engineering (1990)

The Penelope verification editor and its formal basis are described. Penelope is a prototype system for the interactive development and verification of programs that are written in a rich subset of sequential Ada. Because it generates verification conditions incrementally, Penelope can be used to develop a program and its correctness proof in concert. If an already-verified program is modified, one can attempt to prove the modified version by replaying and modifying the original sequence of proof steps. Verification conditions are generated by predicate transformers whose logical soundness can be proven by establishing a precise formal connection between predicate transformation and denotational definitions in the style of continuation semantics. Penelope's specification language, Larch/Ada, belongs to the family of Larch interface languages. It scales up properly, in the sense that one can demonstrate the soundness of decomposing an implementation hierarchically and reasoning locally about the implementation of each node in the hierarchy.
Logarithmic time cost optimal parallel sorting is not yet fast in practice!
Authors: Lasse Natvig
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

When looking for new and faster parallel sorting algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel sorting in the field of theoretical computer science. Such &ldquo;theoretical&rdquo; algorithms are mainly described for the PRAM (Parallel Random Access Machine) model of computation [13,26]. This paper shows how this kind of investigation can be done on a simple but versatile environment for programming and measuring of PRAM algorithms [19,20]. The practical value of Cole's Parallel Merge Sort algorithm [10,11] have been investigated by comparing it with Batcher's bitonic sorting [5]. The &Ogr;(log n) time consumption of Cole's algorithm implies that it must be faster than bitonic sorting which is &Ogr;(log2 n) time-if n is large enough. However, we have found that bitonic sorting is faster as long as n is less than 1.2 x 1021, i.e. more than 1 Giga Tera items!. Consequently, Cole's logarithmic time algorithm is not fast in practice.
A parallel computer model supporting procedure-based communication
Authors: Jeffrey X. Zhou
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Procedure-based communication can convert variant communication patterns of parallel computation to a simple data sending and receiving process. This paper describes a general purpose, MIMD parallel architecture that effectively supports the procedure-based communication. The system uses a two-dimensional memory array and a multiple bus system as data transfer media. The system eliminates bus contention and reduces memory access conflicts. In spite of its partially shared memory, the architecture guarantees direct data access for all processors if a procedure-based communication is employed.
Stable placements for spider robots
Authors: J.-D. Boissonnat, O. Devillers, L. Donati, F. P. Preparata
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We study the problem of computing the set of admissible and stable placements of spider robots, a simple case of legged robots. The environment consists of a set of n points in the plane representing authorized footholds. We show that the space of admissible and stable placements of such robots has size &thgr;(n2) and can be constructed in O(n2 log n) time and O(n2) space. We give also efficient algorithms for several related problems.
MONT3E: a Monte Carlo electron heat transfer code
Authors: J. D. Maltby, B. T. Kornblum
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

A Monte Carlo code, MONT3E, was written to analyze heat transfer due to electron backscattering. The availability of supercomputers has made large-scale applications of this analysis technique possible. Statistically valid solutions of complicated engineering problems can now be performed. In this paper, the physical theory of electron trajectories is described and related to the implementation of an electron tracing algorithm. The analysis requires three types of information: a geometric description of the enclosed volume under analysis, a magnetic field definition, and a model of electron-surface interaction. The implementation of these three components in MONT3E is presented. Suitability of the formulation to various computer architectures is discussed. An electron backscatter experiments was modeled using the code. The MONT3E predictions compared favorably to the experimental data, lending confidence to code predictions. Additional information available in the simulations provided new physical insights into the electron experiment.
Ellie language definition report
Authors: B. Andersen
Venue: ACM SIGPLAN Notices (1990)

This report defines the parallel object-oriented language Ellie in details by means of informal definitions and examples. The syntax of Ellie is defined by a grammar. Ellie has been designed as a part of my Ph.D. thesis.The goals of Ellie are to achieve machine independent parallel programming and great language flexibility. Machine independent parallel programming is achieved by allowing the programmer to have a huge number of small processes for a virtual distributed memory parallel computer. If an actual distributed parallel computer can not execute the huge number of processes efficiently then a compiler can combine small processes hereby reducing the number of processes.Great language flexibility is achieved by allowing definitions of new types and control structures and by using a non-strict type system. Ellie is meant as an all-purpose programming language that has the flexibility of languages like Smalltalk and Lisp without losing efficiency in numerical calculations etc.
Essential language el(&agr;)&mdash;a reduced expression set language for system programming
Authors: Tan Watanabe, Kazuko Sakuma, Hideyuki Arai, Kohbun Umetani
Venue: ACM SIGPLAN Notices (1991)

Essential Language el( alpha;) is developed as a "Reduced Expression Set Language" which is simple and yet satisfies conditions for efficient programming and efficient execution. The grammar of el( alpha;) is determined by unifying a machine model applicable to almost all computers and a language model with features essential for system programming. Much efforts are exerted to make the language machine independent and to eliminate execution-time overhead. Its simple syntax drawn in 2 diagrams covers from the module interface specifications to low level operations required for embedded software. Descriptive power of the language and object code efficiency of the compiler are certified by its applications for production programming.
Adaptive Determination of Filter Scales for Edge Detection
Authors: Hong Jeong, C. I. Kim
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors suggest a regularization method for determining scales for edge detection adaptively for each site in the image plane. Specifically, they extend the optimal filter concept of T. Poggio et al. (1984) and the scale-space concept of A. Witkin (1983) to an adaptive scale parameter. To avoid an ill-posed feature synthesis problem, the scheme automatically finds optimal scales adaptively for each pixel before detecting final edge maps. The authors introduce an energy function defined as a functional over continuous scale space. Natural constraints for edge detection are incorporated into the energy function. To obtain a set of optimal scales that can minimize the energy function, a parallel relaxation algorithm is introduced. Experiments for synthetic and natural scenes show the advantages of the algorithm. In particular, it is shown that this system can detect both step and diffuse edges while drastically filtering out the random noise.
On the Peeper's Voronoi diagram
Authors: F. Aurenhammer, G. Stöckl
Venue: ACM SIGACT News (1991)

In the peeper's Voronoi diagram for n sites, any point in the plane belongs to the region of the closest site visible from it. Visibility is constrained to a segment on a line avoiding the convex hull of the sites. We show that the peeper's Voronoi diagram attains a size of Theta;(n2) in the worst case, and that it can be computed in O(n2)time and space.