ppxscal/embedding_network huggingface dataset:
A system architecture for the concurrent evaluation of applicative program expressions
Authors: Claudia Schmittgen, Werner Kluge
Venue: ACM SIGARCH Computer Architecture News (1983)

The paper outlines the principles for the concurrent evaluation of applicative programs based on Berklings reduction language. The recursive style of program design supported by this language lends itself to a recursive partitioning scheme which, for suitable program expressions, generates dynamically a hierarchy of processes for the concurrent evaluation of subexpressions. This hierarchy can elegantly be mapped onto a system of cooperating reduction machines featuring a stack architecture. A special ticket mechanism enforces an upper limit on the number of processes that, at any time, may exist within the system, which does not significantly exceed the number of the available machines.
The EZ GCD algorithm
Authors: Joel Moses, David Y. Y. Yun
Venue: Proceedings of the ACM annual conference (1973)

This paper presents a preliminary report on a new algorithm for computing the Greatest Common Divisor (GCD) of two multivariate polynomials over the integers. The algorithm is strongly influenced by the method used for factoring multivariate polynomials over the integers. It uses an extension of the Hensel lemma approach originally suggested by Zassenhaus for factoring univariate polynomials over the integers. We point out that the cost of the Modular GCD algorithm applied to sparse multivariate polynomials grows at least exponentially in the number of variables appearing in the GCD. This growth is largely independent of the number of terms in the GCD. The new algorithm, called the EZ (Extended Zassenhaus) GCD Algorithm, appears to have a computing bound which in most cases is a polynomial function of the number of terms in the original polynomials and the sum of the degrees of the variables in them. Especially difficult cases for the EZ GCD Algorithm are described. Applications of the algorithm to the computation of contents and square-free decompositions of polynomials are indicated.
Similarity and entropy
Authors: Richard V. Smith
Venue: Proceedings of the 1964 19th ACM national conference (1964)

There is much interest today in inductive processes. This typically involves the necessity to classify objects through some sort of pattern recognition without benefit of any previously given classification rules. Either a learning approach or a direct approach may be taken. When a direct approach is used, the question of similarity among the objects arises and a measure for similarity is required. In this paper we will suggest such a measure to give the similarity of objects in a given set relative to a given set of properties. Measures of this kind have previously been proposed but none adequately consider the effect of dependency among the properties. The measure we will develop has its roots in the measurement of entropy. Therefore, we will begin with a brief summary of this topic from information theory.
MGX: An integrated symbolic layout system for VLSI
Authors: Masaru Ozaki, Miho Watanabe, Morio Kakinuma, Mikio Ikeda, Koji Sato
Venue: Proceedings of the 21st Design Automation Conference (1984)

A symbolic layout system for double-metal silicon-gate MOS technology in the style of Gate Matrix is presented. This system provides an integrated layout environment which consists of stick-figure-based graphic editor, a mask artwork generator, a connectivity checker, a circuit parameter extracter and simulator interfaces. All the modules are designed to deal with symbol data, rather than mask artwork, so that fast execution is realized. A method to associate symbol data with actual mask geometry is described along with the data structure employed. Also described is network partitioning by signal names taking into account logical equivalence of transistor circuits.
AUTONOTE: A personal information storage and retrieval system
Authors: Walter Reitman, R. Bruce Roberts, Richard W. Sauvain, Daniel D. Wheeler, William Linn
Venue: Proceedings of the 1969 24th national conference (1969)

This paper describes AUTONOTE, a personal storage and retrieval system designed for use by individuals working with large bodies of information. The user may enter a variety of textual materials and assign descriptors and phrases by which these materials may be retrieved. He has available mechanisms for deleting, replacing, linking, and hierarchically organizing text items. The system is operating on-line in a time-sharing environment, and can be utilized from a variety of terminals. Both use and implementation are discussed in detail, with special attention to utilization of AUTONOTE through an alphanumeric CRT display. Also mentioned are potential artificial intelligence extensions and the use of the system in a study of scientific problem solving.
A message system supporting fault tolerance
Authors: Anita Borg, Jim Baumbach, Sam Glazer
Venue: ACM SIGOPS Operating Systems Review (1983)

A simple and general design uses message-based communication to provide software tolerance of single-point hardware failures. By delivering all interprocess messages to inactive backups for both the sender and the destination, both backups are kept in a state in which they can take over for their primaries. An implementation for the Auragen 4000 series of M68000-based systems is described. The operating system, AurosTM, is a distributed version of UNIX*. Major goals have been transparency of fault tolerance and efficient execution in the absence of failure.
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
Authors: Stephen A. Cook
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The motivation for this work comes from two general sources. The first source is the basic open question in complexity theory of whether P equals NP (see [1] and [2]). Our approach is to try to show they are not equal, by trying to show that the set of tautologies is not in NP (of course its complement is in NP). This is equivalent to showing that no proof system (in the general sense defined in [3]) for the tautologies is &ldquo;super&rdquo; in the sense that there is a short proof for every tautology. Extended resolution is an example of a powerful proof system for tautologies that can simulate most standard proof systems (see [3]). The Main Theorem (5.5) in this paper describes the power of extended resolution in a way that may provide a handle for showing it is not super. The second motivation comes from constructive mathematics. A constructive proof of, say, a statement @@@@&times;A must provide an effective means of finding a proof of A for each value of x, but nothing is said about how long this proof is as a function of x. If the function is exponential or super exponential, then for short values of x the length of the proof of the instance of A may exceed the number of electrons in the universe. In section 2, I introduce the system PV for number theory, and it is this system which I suggest properly formalizes the notion of a feasibly constructive proof.
A system for machine-written and hand-written character distinction
Authors: K. Kuhnke, L. Simoncini, Zs. M. Kovacs-V
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

In applications of character recognition where machine-printed and hand-written characters are involved, it is important to know if the character image, or the whole word, is machine- or hand-written. This is due to the accuracy difference between the algorithms and systems oriented to machine- or handwritten characters. Obviously, this type of knowledge leads to the increase of the overall system quality. In this work a classification system is presented which reads a raster image of a character and outputs two confidence values, one for "machine-written" and one for "hand-written" character classes, respectively. The proposed system features a preprocessing step, which transforms a general uncentered character image into a normalized form, then the feature extraction phase extracts relevant information from the image, and at the end, a standard classifier based on a feedforward neural network creates the final response. At the end, some results on a proprietary image database are reported.
Establishing documentation standards or creating chaos out of confusion
Authors: David M. Clayton
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Establishing rules for any process or procedure is usually complicated. In developing documentation standards we discovered that the situation increased in complexity. Normally, documentation proceeds in its day-to-day fashion with the writer or editor adding his or her own uniqueness to the resultant product. But with the establishment of standards, style is more rigidly defined. Certain basic standards are easily developed. In the interest of expediency, one person can define such items as page width, lines per page, indentation, chapter and subsection notation, etc. These items can be discussed endlessly and we want to save the controversy for more substantive matters. Those aspects of documenting which affect the presentation of the document are most subject to varied opinion. And there are often as many opinions of what the standards should be as there are writers, editors, and managers. When these various opinions are considered, compromises made, and standards written, the result can be most enlightening.
Structuring the MIS development and operation function
Authors: Donald L. Evans
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

The purpose of this document is to provide a firm basis on which the Management Information System (MIS) function can move towards its goal within an urban or business environment. While the examples and experience on which the report is based have been in an urban environment, the results are seen equally applicable, with minor modifications, to any MIS environment. Issues upon which the report concentrates are: concerns surrounding the appropriate organizational structure to best cope with the development of an MIS; and the development of strategic operational plans to provide a framework and direction for reaching the MIS goal. Other concerns such as hardware requirements, standards, documentation, and training are addressed as related, but not as primary issues in that their development must be coordinated with and will be enhanced by an improved organizational structure and development plan. The report is divided into four sections. The first section has reviewed the purpose and scope of the report. The second section examines the problems being faced by the MIS function. The third section analyzes these problems in the context of several functions necessary to successful performance of the MIS function. In section four the concept of Matrix organization and how it facilitates the MIS function is discussed; and an hierarchical organization structure is developed which supports the matrix concept and alleviates the problems outlined in Section II.
You can offer inexpensive statistical consulting
Authors: Bill Landrum
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Recent papers at User Services Conferences have offered the notion that we should be careful to avoid over-commitment of our staffs to helping researchers, particularly graduate student researchers, in the area of statistical consulting. The reasons usually given include: (a) The User Services Group (USG) does not have the statistical expertise to help the student, (b) The USG doesn't have the staff or staff time to help the user with statistical consulting, or (c) The USG is in danger of usurping the student's advisor's role to the point that the USG may have political problems with university professors. All these problems can be resolved to a satisfactory degree (at least for schools that offer some graduate programs in the behavioral sciences) by adopting the following policies and philosophies.
Simulation methodology II
Authors: William E. Biles, J. W. Schmidt, R. E. Taylor, V. Chachra, Michael A. Crane, Donald L. Inglehart, Grace Carter
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This session focuses on new techniques to assist practitioners of simulation in obtaining desired results efficiently. Many such users are attempting to find optimum performance of a simulated system. In this situation, the problem of selecting a procedure to search for the best choice is a challenging one. Two papers in this session compare alternate strategies for attacking this question. Other users face the task of finding confidence intervals for quantities obtained from simulation experiments. This job is often complicated by statistical dependence of successive observations. The third paper in this session suggests a way around this difficulty by utilizing properties found in many stable stochastic systems.
A simulation model for the comparison of sampling strategies used in estimating total residential market value for a geographic area
Authors: James M. Kraushaar
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

The total property market value for a taxing district is used to: distribute federal, state, and county taxes; apportion joint school district tax levies; limit taxing and borrowing powers. This total market value cannot be calculated by simple summing the individual property values as listed on the local assessment roll because assed values may or may not reflect current market values, depending on many factors related to the assessment process. Consequently, total district assessed value cannot be a basis for tax allocation. Stratified random sampling and ratio estimators are often used to reduce the large sampling error. However, measuring the precision (i.e., bias and variance) of these ratio estimators is difficult when samples are small because the second product moment equation may be unreliable.(1) Without a measure of precision, the effectiveness of various sampling design factors (e.g., number of strata, stratum boundary rule, and type of ratio estimator) can not be evaluated. A simulation model composed of three separate modules was developed to measure the precision of the total market value estimators for a population of properties.
Switching strategies in a class of packet switching networks
Authors: Manoj Kumar, Daniel M. Dias, J. R. Jump
Venue: ACM SIGARCH Computer Architecture News (1983)

This paper investigates some methods for improving the performance of Single Stage Shuffle Exchange Networks (SENs) and Multistage Interconnection Networks (MINs). The three new switching strategies proposed use extra buffers to enhance performance. Approximate analysis and simulation results indicate significant improvement in performance for both SENs and MINs. An intuitive method for determining the applicability of the approximate analysis is discussed and some performance measures, which should be useful in evaluating the performance of networks are defined.
Applications in the physical sciences: Procedure Network Analysis
Authors: A. B. Kahn
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE CURRENT ADVANCES in automation have done little to relieve the extensive manual analysis required for the synthesis of specific systems from off-the-shelf items. This paper represents a brief progress report on a study to develop manual and automatic aids for this task. In the space available, it is possible only to outline the basic concepts of Procedure Network Analysis. Details will be left for further publication. Hardware designers have long found logic network analysis a useful technique. The Procedure Network is a more general interpretation of this technique. The basic hypothesis of this study is that Procedure Network Analysis can serve as a useful tool in the synthesis and evaluation of system designs. Furthermore, this analysis can also fill several vital monitoring roles for operational systems. Two examples are: The diagnosis of failures, and the selection of alternatives in the face of a failure. These techniques are not restricted to hardware systems. They may be applied to any discipline which involves the selection and organization of logically related elements. Computer programs are an example close to the interests of the ACM. In the current context, a program is a system synthesized from a set of routines or procedures.
Perturbation calculations for the spin up problem using REDUCE
Authors: I. Cohen, F. Bark
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

The algebraic computer language REDUCE is used to obtain expansions for the physical variables in the spin-up problem for a rapidly rotating gas at low Mach number.
VLSI - a challenge for system designers (Position Statement)
Authors: Martin B. Roberts
Venue: Proceedings of the 17th Design Automation Conference (1980)

As design automation and computer design professionals, we have come to equate VLSI with a chip having 106 devices, or 105 random logic devices, or 105 gates, etc. However, the size argument does not explain what use the system designer will be able to make of such complex devices.
Fast Localization of Mechanical Components Using Hough Transform
Authors: Stefano Pace
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this article it will be presented the work developed as degree thesis of Informatic Engineering that has been carried out at the Laboratory of Artificial Vision in the Department of Informatica and Sistemistica of the University of Pavia, during the years 1997 and 1998.It will be described, an artificial vision system based on the Generalized Hough Transform to find the position and the orientation of hydraulic components with the aim of driving a mechanical arm in the keeping and repositioning operations. A prototype of this system has been successfully integrated with an existing industrial robot and currently it's in final testing phase in a real production environment.The vision system and its interface has been developed under the Linux operating system using the Tcl/Tk tools for the control interface and the C language for the time critical sections. 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
Object-oriented coding using successive motion field segmentation and estimation
Authors: Dam LeQuang, A. Zaccarin, S. Caron
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Block-based motion compensation assumes that all pixels within a block have the same translational motion. That hypothesis, however, results in inaccurate compensation of moving objects' boundaries. Object-oriented video compression algorithms typically segment each image in regions of uniform motion and estimates the motion of these regions to generate more accurate motion compensated images. We present a two-stage algorithm for motion field segmentation and estimation in an object-oriented coder. In the algorithm's first stage, a standard block-matching algorithm and a maximum a posteriori probability estimate are used to compute a translational motion field and its segmentation. This segmentation is then utilized in the second stage to estimate the parameters of complex motion models. The parameters of the complex motion models are only estimated in the algorithm's second stage which reduces the computational complexity of the proposed algorithm. Simulation results show that the proposed algorithm significantly reduces the bit rate needed to encode video sequences when compared to standard block-based algorithms.
Continuous Pseudo-Inverse Image Reconstruction in Spiral Magnetic Resonance Imaging
Authors: Rik Van de Walle, Bart Desplanques, Ignace Lemahieu
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A minimum-norm least-squares image-reconstruction method for the reconstruction of magnetic resonance images from non-Cartesian sampled data is proposed. The method is based on a general formalism for continuous-to-discrete mapping and pseudo-inverse calculation. It does not involve any regridding or interpolation of the data and therefore the methodology differs fundamentally from existing regridding-based methods. Moreover, the method uses a continuous representation of objects in the image domain instead of a discretized representation. Simulations and experiments show the possibilities of the method in spiral imaging. Simulations revealed that minimum-norm least-squares image reconstruction can result in a decrease of artifacts compared with regridding-based reconstruction. Besides, both in vivo and phantom experiments showed that minimum-norm least-squares image reconstruction leads to contrast improvement and increased signal-to-noise ratio compared with image reconstruction based on regridding. At the end of this paper, some possible applications of our reconstruction technique are proposed.
Proposal for a prototyping kit
Authors: Jan Jantzen
Venue: Proceedings of the international conference on APL (1984)

The three-levelled ANSI/SPARC architecture for database systems forms a framework on which software prototypes can be built. The external level corresponds to screen panels, the conceptual level to the data model, and the internal level to the stored files of the prototype. The paper identifies prototype design tools and building-blocks with respect to this architecture. A screen design tool illustrates ideas using nested arrays. A novel aspect is, that the paper takes a step towards an operational formulation of the prototyping approach by emphasizing the computerized implementation.
A multiprocessor implementation of relaxation-based electrical circuit simulation
Authors: J. T. Deutsch, A. R. Newton
Venue: Proceedings of the 21st Design Automation Conference (1984)

The electrical circuit simulation of large integrated circuits is very expensive. New relaxation-based algorithms promise to reduce this cost by exploiting the properties of large networks. However, this speed improvement is not sufficient for the cost-effective analysis of very large circuits. While array processors have helped inprove the performance of circuit simulators, further improvement can be achieved by the use of special-purpose multiprocessors. In this paper, the implementation of a relaxation-based circuit simulation algorithm, called Iterated Timing Analaysis, on a multi-processor is described. Initial results indicate that this approach has a great deal of potential for reducing the cost of circuit simulation.
On correct program development
Authors: Andrzej Blikle
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The paper presents a method of correct programs' derivation. Our programs consist of an operational part (the virtual program) and a specification. Both these parts are subject to the development and the refinement process. Specifications consist of a precondition and a postcondition (global specification) plus a set of assertions (local specification). A program is correct if: l) it is partially correct wrt the global specification, 2) the precondition guarantees that the program neither loops indefinitely nor aborts, 3) the assertions are adequate for the proof of l) and 2). Programs are developed by means of correctness preserving transformations. The requirement of handling the problem of abortion leads to the necessity of using a partial (or three valued) logic, We are using McCarthy's logic for this purpose.