ppxscal/embedding_network huggingface dataset:
A virtual machine emulator for performance evaluation (Summary)
Authors: M. D. Canon, D. H. Fritz, J. H. Howard, T. D. Howell, M. F. Mitoma, J. Rodriguez-Rosell
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

Virtual machines have long been used for functional testing of operating systems and to obtain the services of multiple operating systems from a single machine. They have not been used for performance evaluation however, because the timing observed by a program executing in a virtual machine is unpredictable and dependent on such factors as system load, real operating system overhead, real scheduling, etc. System level performance evaluation of hardware and operating systems has typically been done by hardware prototyping and dedicated machine benchmarking. This paper introduces the notion of virtual hardware prototyping for system performance evaluation. The approach makes use of the virtual machine concept by adding timing simulation to virtual machine support. The resulting virtual machines reproduce both machine timing and machine architecture. They are then useful for system performance evaluation.
The two-step commitment protocol: Modeling, specification and proof methodology
Authors: J. L. Baer, G. Gardarin, C. Girault, G. Roucairol
Venue: Proceedings of the 5th international conference on Software engineering (1981)

A two-step commitment algorithm which assures transaction update atomicity in a distributed data base is modelled using colored Petri Nets. The modeling helps in determining the numerous crash possibilities and in specifying recovery procedures and associated protocols. The use of unalterable logs is required and modelled accordingly. A methodology for proof correctness based on linear invariants is presented.
An Efficient Algorithm for Matching a Lexicon with a Segmentation Graph
Authors: David Y. Chen, Jianchang Mao, K. Mohiuddin
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper presents an efficient algorithm for lexicon-driven handwritten word recognition. In this algorithm, a word image is represented by a segmentation graph, and the lexicon is represented by a trie. As opposed to the standard lexicon-driven matching approach, where dynamic programming is invoked independently for matching each entry in the lexicon against the segmentation graph, the proposed algorithm matches the trie with the segmentation graph.Computation is saved by the efficient representation of the lexicon using the trie data structure. The performance of the proposed approach is compared with the standard dynamic programming algorithm. The proposed approach saves about 48.4% (excluding the trie initialization cost) and 15% of computation time from the standard algorithm when a dynamic lexicon is used. Better performance can be expected in static lexicon cases where the trie needs to be constructed only once.
An Interpretation System for Cadastral Maps
Authors: E. Katona, G. Hudra
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

To create a spatial database for some GIS application, it is a big challenge to recognize automatically all the simple and complex map objects on scanned maps. This paper presents a robust map interpretation system developed to process Hungarian land register maps (cadastral maps). Processing starts with a raster-to-vector conversion generating a raw vector image from the scanned map. All recognition steps are performed on this raw vector image: segmentation, recognition of separated and not separated symbols, recognition of more complex objects (buildings and parcels). Finally, drawing quality is enhanced utilizing the recognition results.Interpretation is supported by a special data structure -called DG - ensuring dynamic description of hierarchical structures of drawing objects. This data structure is an essential part of our concept, therefore it is discussed in the paper.
An Extension to a Filter Implementation of a Local Quadratic Surface for Image Noise Estimation
Authors: Allan Aasbjerg Nielsen
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Based on regression analysis this paper gives a description for simple image filter design. Specifically 3_3 filter implementations of a quadratic surface, residuals from this surface, gradients and the Laplacian are given. For the residual a 5_5 filter is given also. It is shown that the 3_3 filter for the residual gives low values for horizontal and vertical lines and edges as opposed to diagonal ones. Therefore an extension including a rotated version of the filter for the residual to ensure low values for lines and edges in all directions is suggested. It is also shown that the 5_5 filter for the residual does not give low values for lines and edges in any direction. The performance of six noise models including the ones mentioned above are compared.Based on visual inspection of results from an example using a generated image (with all directions and many spatial frequencies represented) it is concluded that if striping is to be considered as a part of the noise, the residual from a 3_3 median filter seems best. If we are interested in a salt-and-pepper noise estimator the proposed extension to the 3_3 filter for the residual from a quadratic surface seems best. Simple statistics and auto-correlation in the estimated noise images support these findings.
How to save money with computer monitoring
Authors: Gary Carlson
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Computer monitoring is a new technique to control costs and improve performance. Critical differences between hardware and software monitors are indicated. Monitoring requires a pragmatic approach since little theory is yet available. Monitoring should be done to one, save money; two, understand the computer system; and three, to indicate future developments. Several specific cases are given showing types of activities monitored, improvements achieved, and concepts used. Fallacies of intuition can be clarified with monitors. Three are mentioned: peak load processing, reasons for delay in terminal response time, and effect of arm contention on dual density disk drives. Future developments should include greater modularity of hardware and software systems, inclusion of specific aids for monitoring (like the Honeywell 6000), and development of measurable performance specifications and units.Problems and costs of monitoring are mentioned.
Contraction map methods for discrete rational Chebychev approximation
Authors: David F. McAllister
Venue: Proceedings of the ACM annual conference (1973)

Generalizations of H. L. Loeb's dynamic programming algorithm' for rational Chebychev approximation are discussed and conditions for monotone convergence of the sequence of deviations are derived. Implementation strategies to insure feasibility and possible modifications to produce super linear convergence are included.
Determining wet surfaces from dry
Authors: H. B. Mall,  Jr., N. da Vitoria Lobo
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Wet surfaces are ubiquitous in our visual experience. Autonomous machines with vision systems will need to identify wet surfaces from dry. Wet surfaces (especially rough, absorbent ones) appear darker when wet. This paper presents the Lekner and Dorf (1988) model for describing the darkening caused by wetting. We explain how to use this optics model to transform intensity values of a region of an image to make that region appear wet. We also show how the model can be reversed in order to make a wet part of an image appear dry. It is also shown that this technique can be used to identify wet regions. This identification is contrasted with darkening caused by shadows. Comparisons of the gray-level histograms of these real images show the validity of this approach for distinguishing wet surfaces from dry.
Structured requirements definition in the 80s
Authors: Kenneth T. Orr
Venue: Proceedings of the ACM 1980 annual conference (1980)

In the last few years, structured programming and structured systems design have become increasingly popular. Recently, there has been considerable application of structuring to the front-end of the systems life cycle, in particular to the requirements definition process. This paper discusses the experience with one methodology the Langston, Kitch Structured Systems Development Methodology (SSD), and forecasts what the major developments in requirements development will be in the 1980s.
Simulation and decision analysis in FMS justification
Authors: Henry C. Co, Jianhua Liu
Venue: Proceedings of the 16th conference on Winter simulation (1984)

It is a concensus among practitioners that the problem of justifying a flexible manufacturing system is complex, difficult, and often paradoxical. In many instances, the FMS is designed for uncertain objectives. Some parts that the FMS is supposed to make may not be conceived/designed yet at the time the system is being evaluated. This paper presents a methodology which applies queueing theory, decision theory, and simulation to analyze the economic merit of an FMS application. At each decision point the decision-maker interacts with the simulation model by specifying alternative courses of actions to be evaluated. The capacity of the flexible manufacturing system may be augmented if projected demand exceeds current capacity. An after-tax analysis provides the decision-maker the performance measure for selecting the best alternative.
A semantic model for a language processor
Authors: Robert V. Zara
Venue: Proceedings of the 1967 22nd national conference (1967)

The purpose of this paper is to describe a language processor which is presently being developed at the United Aircraft Research Laboratories. The processor is called the Semantic Plex Processor* and is a bootstrap processor in the sense that it starts with a basic vocabulary, but one which is capable of generating new language with relative ease. Thus the set of statements which are ultimately acceptable to the processor is open-ended. Furthermore, the set of statements which are meaningful to the processor is a function not only of the set of statements which occurred in the past, but also of those which may occur in the future. (In this paper the words &ldquo;time,&rdquo; &ldquo;past,&rdquo; &ldquo;future,&rdquo; etc., are used to denote relative positions of statements as they appear from left to right in the input string.)
Classroom use of replaceable parts in a multiprogramming system
Authors: Henry R. Bauer,  III
Venue: Proceedings of the sixth SIGCSE technical symposium on Computer science education (1976)

A multiprogramming operating system for the TI980A permits replacement of system primitives by a programmer familiar with the system's design and data structures. This paper describes the hardware features available; the method of use of the replaceable parts facility; typical student assignments for an operating systems course (e.g. ACM Curriculum '68 I4); and student reaction to the projects.
Expressional loops
Authors: Richard C. Waters
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

This paper proposes an expressional loop notation (XLoop) based on the ideas described in [16,17] which makes it practical to express loops as compositions of functions. The primary benefit of XLoop is that it brings the powerful metaphor of expressions and decomposability to bear on the domain of loops. Wherever this metaphor can be applied, it makes algorithms much easier to construct, understand, and modify. XLoop applies the expressional metaphor to loops by introducing a new data type series. A series is an ordered one dimensional sequence of data objects. Series are used to represent intermediate results during a computation. Algorithms which would typically be rendered as iterative loops are instead represented as compositions of functions operating on series. For example, the program SUM_VECT computes the sum of the elements in a vector of integers by using ENUM_VECTOR to create a series of the integers in the vector and then using SUM to compute their sum.
A 10-wire interface for data communications
Authors: A. G. Fraser
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

A synchronous serial interface for connecting data processing equipment to a communications system is described. The 10-wire interface is more flexible than existing standards and can handle certain desirable extensions to communications control functions. Reasons for considering a new interface at this time are given.
A symbolic design system for integrated circuits
Authors: K. H. Keller, A. R. Newton, S. Ellis
Venue: Proceedings of the 19th Design Automation Conference (1982)

As integrated circuit design has become increasingly complex, the need for more effective data description techniques has become critical. Design verification from mask artwork data alone can consume vaste amounts of computer time for VLSI circuits, if it can be performed at all. The use of a symbolic design description, which allows the designer or synthesis program to express circuit structure as well as maintain full connectivity information, can reduce dramatically the burden placed on the verification tools: This paper describes a symbolic design system, its associated data manager, its color graphics viewport manager, and its application to a variety of design methods. The data manager can store a variety of representations of the design, including simulation data, geometric layout, symbolic layout, and schematic diagrams. The viewport manager can manage a number of viewports concurrently and the use of a model frame buffer allows it to function easily on a variety of graphics terminals and hard-copy devices. The system is designed with an engineering work station in mind.
Descriptive databases in some design/manufacturing environments
Authors: Edward Marlow Hoskins
Venue: Proceedings of the 16th Design Automation Conference (1979)

In the development of substantial integrated computer-aided design systems, one of the most crucial features is the creation of purpose-made data structures. These have to be designed with growth and change in mind and in the course of the design process can reach a substantial size. They form the central source and design information about a particular product. They are used to generate drawings, assembly information schedules etc. for production purposes as well as being the data source and repository of results for integral analytical and detail design procedures. This paper outlines some of ARC's work in the creation, implementation and use of such data structures.
PASC-HLL: An experience in design techniques for firmware and the supporting hardware
Authors: J. P. Schoellkopf
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

PASC-HLL design started from a study of the high-level language PASCAL which allowed the definition of a special purpose intermediate language. A new mechanism for pipe-lined execution of polish strings using a FIFO queue instead of a push-down stack [1] made possible the design of a pipe-lined architecture bit-slice computer for high level language called PASC-HLL [2]. That computer consists in five special purpose microprogrammed processors, each being involved in a special function (instruction fetch, operand fetch, execution of operators, local storage management, and memory access).
Automatic programming and compilers III: On the efficient construction of automatic programming systems
Authors: W. H. Landen,  Jr., W. H. Wattenburg
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

AUTOMATIC PROGRAMMING systems and operating systems (software) have become as complex and, in some cases, as expensive as the computers for which they are constructed. However, the manner in which most software is being constructed leaves a great deal to be desired when compared with the advances that have been made in hardware construction. Better methods for constructing software will have to be developed, accepted and used if future needs are to be satisfied at reasonable costs. This paper will describe the results of the latest in a series of compiler projects which have proved to be a significant step forward in this field.
Evaluation of incomplete elliptic integrals by gaussian integration
Authors: John G. Haynes
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

For the first method the classic tables of Legendre1 are available which give functional values of both integrals, to 9 decimal digits of accuracy, by one degree increments of the amplitude and the modulus. For a very restricted range of &Oslash; and k, table look-up with linear interpolation is feasible. For any amount of generality, a rather large table must be stored and non-linear interpolation used. This can become quite costly in both space and time in computers with 2000 (or fewer) word capacity. There are several series expansions available for the second method.2, 3 Two serious faults exist; the series in general converge rather slowly, and they involve high order terms of both k and some f(&Oslash;), which necessitates rather complex and extensive programming. It is probable that this method might be feasible on a large scale computer.
Simulating scheduling plans
Authors: C. E. Montagnon
Venue: Proceedings of the third conference on Applications of simulation (1969)

This model simulates the activities of planning and manufacturing batches of components in a job shop. Simulation of the planning stage forms the basis of a tool to completely reschedule the shop from its actual position, having regard to due dates and machine resources. The execution of this plan is simulated giving management data on the effects of present decisions. A significant feature of the model is the use of simulation of present clerical rules as a basis for a more powerful shoploading system.
A High Precision 3D Object Reconstruction Method Using a Color Coded Grid and NURBS
Authors: Philippe Lavoie, Dan Ionescu, Emil Petriu
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A high precision technique for reconstructing three dimensional (3D) objects from its one-camera 2D views and using a color coded structured light is described. The method does not require any a-priori knowledge of the absolute positioning and orientation of the camera, nor of a point in the scene. However, a calibration process precedes the 3D reconstruction algorithm leading to a high precision calculation of the position of the camera. The structured light, which is pseudo-randomly color encoded, is used to determine unique points and lines on the surface of the object.The lines once extracted from a view of the object, are used for the determination of non-uniform rational Bézier splines (NURBS) curves to generate the surface of the object. The precision of the technique depends on the adaptation of the sampling rate of the structured light to the surface of the object. In a recent test, the precision of 7 tau (thousands of an inch) was achieved with a relatively smooth object. The paper describes only the 3D reconstruction process and not the integration of multiple views into one single 3D image of the object.
Parallel programmable video co-processor design
Authors: An-Yeu Wu, K. J. R. Liu, A. Raghupathy, Shang-Chieh Liu
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Modern video applications call for computationally intensive data processing at very high data rate. In order to meet the high-performance/low-cost constraints, the state-of-the-art video processor should be a programmable design which performs various tasks in video applications without sacrificing the computational power and the manufacturing cost in exchange for such flexibility. In this paper, we present a programmable video co-processor design that is capable of performing FIR/IIR filtering, subband filtering, and most discrete orthogonal transforms (DT), for the host processor in video applications. The computational speed of this co-processor is as fast as that of ASIC designs which are optimized for individual specific applications. We also show that the system can be easily reconfigured to perform multirate FIR/IIR/DT operations at negligible hardware overhead. Hence, we can either double the processing speed on the fly based on the same processing elements, or apply this feature to the low-power implementation of this co-processor.
SCRATCHPAD/1: An interactive facility for symbolic mathematics
Authors: J. H. Griesmer, R. D. Jenks
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

The SCRATCHPAD/1 system is designed to provide an interactive symbolic computational facility for the mathematician user. The system features a user language designed to capture the style and succinctness of mathematical notation, together with a facility for conveniently introducing new notations into the language. A comprehensive system library incorporates symbolic capabilities provided by such systems as SIN, MATHLAB, and REDUCE.
APL used for management in a reprocessing plant
Authors: Bruno Petruschka
Venue: Proceedings of the eighth international conference on APL (1976)

A package of APL functions for data maintaining and processing is discussed in some detail. The data is recorded during the cycle of irradiated fuels and is used to control the reprocessing plant at the Karlsruhe Nuclear Research Center. First reprocessing and waste treatment are discussed and nuclear fuel processing is explained. A short justification is given of the reasons why the program language APL and the facilities of the file subsystem APL*PLUS had been chosen for data handling. This is followed by the description of file organization and some of the mainfunctions of the package. Finally, an example of a user session and the output of daily and monthly reports are presented.
Tutorial - Group Technology
Authors: Hriday R. Prasad
Venue: Proceedings of the 20th Design Automation Conference (1983)

The Group Technology tutorial consists of a tutorial and a discussion. The tutorial objectives are to provide the participants with an overview of Group Technology - its meaning, ramifications, and opportunities offered. Group Technology is the realization that &ldquo;many problems are similar, and that by grouping similar problems, a single solution can be found to a set of problems, thus saving time and effort&rdquo;. In this tutorial I will discuss fundamentals of Group Technology, its meaning, benefits, application areas, and selected case studies. I will also use one or more videotapes to demonstrate the impact of Group Technology on engineering/manufacturing operations.
S*(QM-1): An instantiation of the high level microprogramming language scheme S* for the nanodata QM-11
Authors: Alynn Klassen, Subrata Dasgupta
Venue: ACM SIGMICRO Newsletter (1981)

In previous papers [1,2,3] a high level microprogramming language schema called S* was described. S* is a partially specified language such that for a given host machine M1, a particular language S*(M1) results when M1's properties are used to complete the specifications of S*. We say that S* is instantiated into S*(M1) with respect to M1. This paper describes the instantiation of S* with respect to the Nanodata QM-1. The resulting language S*(QM-1) allows high level &ldquo;nanoprograms&rdquo; to be written for the QM-1. The major objective of this research was to examine the language schema S*, from which S*(QM-1) was instantiated, in light of its overall philosophy and usefulness as a tool in the development of a specific microprogramming language for a highly complex microprogrammable machine.