ppxscal/embedding_network huggingface dataset:
Comparative complexity of grammar forms
Authors: Seymour Ginsburg, Nancy Lynch
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The definition of &ldquo;grammar form&rdquo; introduced in [CG] makes it possible to state and prove results about various types of grammars in a uniform way. Among questions naturally formalizable in this framework are many about the complexity or efficiency of grammars of different kinds. Grammar forms provide a reasonable way of considering the totality of other forms we might use, and so answering the question with both upper and lower bound results. The general question considered in this paper is the following: which grammar forms are more efficient than other grammar forms for the expression of classes of languages, and how much gain in efficiency is possible? Our results deal solely with context-free grammars, and use both derivation complexity and size of grammars as complexity measures.
A requirements and design aid for relational data bases
Authors: Max L. Wilson
Venue: Proceedings of the 5th international conference on Software engineering (1981)

A tool is described for defining data processing system requirements and for automatically generating data base designs from the requirements. The generated designs are specific to System R but the mapping rules are valid for the relational model in general and can be adapted to other data models as well. The requirements and design are stored in a System R data base, are cross-referenced with each other, and can be accessed and used for other purposes. The requirements are defined in terms of an organized common-sense semantic model and serve the function of the Conceptual Schema in the ANSI/SPARC three schema framework. The tool generates (synthesizes) relational designs that have no redundancy, no update anomalies, and are in 5th normal form. The requirements analysis and design generation procedures are illustrated with a case study.
A comparative study of distributed resource sharing on multiprocessors
Authors: Benjamin W. Wah
Venue: ACM SIGARCH Computer Architecture News (1983)

In this paper, we have studied the interconnection of resources to multiprocessors and the distributed scheduling of these resources. Three different classes of interconnection networks have been investigated; namely, single shared bus, multiple shared buses, and networks with logarithmic delays such as the cube and Omega networks. For a given network, the resource mapping problem entails the search of one (or more) of the free resources which can be connected to each requesting processor. To prevent the bottleneck of sequential scheduling, the type(s) and number(s) of resources desired by a processor are given to the network and it is the responsibility of the network to find the necessary resources and connect them to the processor. The addressing mechanism is, thus, distributed in the network. This is a generalization of conventional interconnection networks with routing tags in which all the resources are of different types.
Engineering Data Management System (EDMS) for computer aided design of digital computers
Authors: Masakazu Soga, Chiyozi Tanaka, Kinya Tabuchi, Katsuhiko Seo, Michiko Kunioka, Hiroo Tsuji
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The current technology lets a DA system handle the data on various design levels such that pure logical, logical and physical and pure physical information are mixedly used on a PCB design. The design process has not been uniformly carried out, such that the simulation of digital system, the routing and a PCB and a unit design has been carried out at the same time, and made the operation and the management be more difficult and complicated. Therefore, only extention of traditional DA systems tends to be difficult to cope with these situations. We have studied these problems and developed Engineering Data Management System - EDMS - so as to be open-ended general purpose DA system which can meet with the future innovation of the technology.
SIGSOFT tutorial on program verification (Tutorial Session)
Authors: Donald I. Good
Venue: Proceedings of the 1976 annual conference (1976)

An introduction is given to the fundamental issues of proving properties of computer programs. No attempt is made to provide an exhaustive survey, but rather to convey enough of the basic concepts and techniques of proving programs so that the interested reader can pursue specific interests on his own. Three fundamental aspects of program proving are described. The first is a general view of basic goals and objectives. The second is an introduction to the basic techniques of proving programs by inductive assertions. The third addresses applying these techniques in practice.
Achieving excellence in communications: A key to developing complete, accurate and shared information requirements
Authors: Robert P. Bostrom, Barry D. Thomas
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

After 25 years of experience building Computer-Based Information Systems, we still seem to have plenty of problems. A major cause of these problems is incomplete and/or inaccurate specifications (i.e., functional specifications or logical design) of requirements. Inadequate specifications reflect ineffective communication transactions between system users and developers. The ability of system developers and users to develop a shared (i.e., clearly understood by both parties), complete and accurate model of the current and desired (i.e., requirements) systems is the key to a successful implementation. Although recently a number of techniques have emerged to facilitate requirements definition (e.g. structured design methodologies), the key remains effective communication between system developers and users. In this paper we are introducing a generalized communication model called PRECISION which quickly and accurately establishes &ldquo;shared&rdquo; models or maps. We also discuss preliminary research findings which describe the success of the PRECISION Model in eliciting information requirements. Our findings indicate that the use of this model would greatly increase the ability of both systems developers and users to create shared, complete and accurate requirement specifications.
Test generation for programmable logic arrays
Authors: Pradip Bose, Jacob A. Abraham
Venue: Proceedings of the 19th Design Automation Conference (1982)

The problem of fault detection and test generation for programmable logic arrays (PLAs) is investigated. The effect of actual physical failures is viewed in terms of the logical changes of the product terms (growth, shrinkage, appearance and disappearance) constituting the PLA. Methods to generate a minimal single fault detection test set (Ts) from the product term specification of the PLAs, are presented. It is shown that such a test set can be derived using a set of simple, easily implementable algorithms. Methods to augment Ts in order to obtain a multiple fault detection test set (TM) are also presented.
Micro emulation: When to do it and when not to do it
Authors: Lee Hoevel
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

In this paper, we will attempt to analyze those conditions under which the use of a nontrivial interpreter will enhance the performance of a two-phase processing system. This analysis is couched in terms of a search for an &ldquo;ideal&rdquo; DEL, given a particular source language SL and base machine M. This &ldquo;ideal&rdquo; DEL would minimize the overall space and time needed to evaluate a typical SL program. There are two obvious choices for such an &ldquo;ideal&rdquo; DEL: the source language (SL) and the language accepted directly by the base machine (ML). We intend to show that there exist currently plausible technological conditions under which neither SL nor ML is &ldquo;ideal&rdquo; (and hence that further study of DELs may be Justified from space-time considerations alone, without resorting to less &ldquo;tangible&rdquo; arguments).
Personal computer networks and graphical animation: Rationale and practice for education
Authors: Marc Brown, Norman Meyrowitz
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

This paper examines how progress in computer hardware and software may be applied to solve several serious problems in teaching computer science courses. It is concerned primarily with two such problems: 1) the lack of immediate reinforcement of computing concepts because of long delays between learning and practice, and 2) the difficulty instructors have motivating and explaining complex topics with currently available instruction tools and techniques. The paper first reviews the involvement of educational institutions in the evolution of computing. It then briefly surveys recent experiments in powerful personal computing. It describes an experiment in the application of new personal computer technology at Brown University which addresses the two educational problems noted above. It then outlines in detail the initial courseware for the environment. Finally, it discusses what changes in pedagogy will be needed to make such technology usable on a wide-scale.
Surface reconstruction: GNCs and MFA
Authors: M. Nielsen
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

The reconstruction of noise corrupted surfaces can be inferred by methodologies such as Bayesian estimation and minimum description length. Both of these imply a formulation where the reconstruction minimizes a functional. Often this functional is non convex and the minimum cannot be found by simple gradient methods. The paper concerns functionals with quadratic data term, criteria for such functionals to be convex, and the variational approach of minimizing non convex functionals. Initial convexity of the approximating functional is considered to be a critical point. Two fully automatic methods of generating convex functionals are presented. They are based on Gaussian convolution and are compared to the Blake-Zisserman graduated non convexity (GNC) (A. Blake, A. Zisserman, 1987) and G.L. Bilbro et al. (1992) and D. Geiger and F. Girosi's (1991) mean field annealing (MFA) of the weak membrane.
Motion analysis with a camera with unknown, and possibly varying intrinsic parameters
Authors: T. Vieville, O. D. Faugeras
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

In the present paper we address the problem of computing structure and motion, given a set point correspondences in a monocular image sequence, considering small motions when the camera is not calibrated. We first set the equations defining the calibration, rigid motion and scene structure. We then review the motion equation, the structure from equation and the depth evolution equation, including the particular case of planar structures, considering a discrete displacement between two frames. A step further, we develop the first order expansion of these equations and analyse the observability of the related infinitesimal quantities. It is shown that we obtain a complete correspondence between these equations and the equation derived in the discrete case. However, in the case of infinitesimal displacements, the projection of the translation (focus of expansion or epipole) is clearly separated from the rotational component of the motion. This is an important advantage of the present approach. Using this last property, we propose a mechanism of image stabilization in which the rotational disparity is iteratively canceled. This allows a better estimation of the focus of expansion, and simplifies different aspects of the analysis of the equations: structure from motion equation, analysis of ambiguity, geometrical interpretation of the motion equation.
Simulation methods for response times in networks of queues
Authors: Donald L. Iglehart, Gerald S. Shedler
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

We describe theoretically sound and computationally efficient estimation methods for &ldquo;passage times&rdquo; in certain closed networks of queues. Informally, a passage time is the time for a job to traverse a portion of the network. Such quantities are important in computer and communication system models where they represent job response times, and in this context, quantities other than mean values are of interest. From a single simulation run, the methods described here provide both point estimates and confidence intervals for general characteristics of response times.
Realizing a virtual machine
Authors: Brian Forbes, Tom Weidner, Ron Yoder, Tony Pitchford
Venue: Proceedings of the 9th annual workshop on Microprogramming (1976)

Historically, microprogramming has been viewed as an emulation tool or a means of extending hardware instruction sets. This usually results in a piecemeal application of microprogramming techniques. The concept of a virtual machine, in which firmware realizes the complete functional structure of an idealized computer, is often debated but infrequently attempted. This paper examines microcoded interpretation of high-level languages and microcoded support of complex algorithms in a front-end peripheral processor as implemented for a commercial computer subsystem. The virtual machine and its supporting structure are outlined and specific advantages of microprogramming are discussed. Microprogramming is presented as a generalized systems resource.
A direct method for solving linear algebraic equations
Authors: E. E. Osborne
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

This talk concerns a method for solving the set of simultaneous linear equations (A &minus; &agr;I)x &equil; b, in which the n x n matrix A, the scaler &agr;, the vector b and the unknown vector x can either be all single precision or all double precision. The bulk of the arithmetic involved is single precision. The computing time in either case is comparable to that of other single precision direct methods.
Student attitudes toward computers
Authors: Theodore C. Willoughby
Venue: ACM SIGCSE Bulletin (1973)

At Penn State certain major areas within Business Administration require a computer programming course in the curriculum. The course usually taken is Computer Science 403, a FORTRAN programming course especially designed for business students. In recent years student complaints about CS 403 have been heard. Similarly, computer science faculty have had complaints about the students. There has been a problem. Research was begun to determine some of the dimensions of the problem. This investigation explored the attitudes of the students toward computers. By measuring attitudes it was expected that some explanation of the student unrest would materialize. Other possible contributing courses such as the FORTRAN language (rather than COBOL) and the level of student ability have been or will be separately studied. Some of the possible causes for the problem which were considered at the beginning of the investigation were: This was just one evidence of a general public distaste with computer technology. The course had a bad reputation which was communicated to students before they enrolled in CS 403. The course itself created negative attitudes. The instructor created negative attitudes. An information systems course created more positive attitudes.
Automated facilities Layout Programs
Authors: Jerrold M. Seehof, Wayne O. Evans, James W. Friederichs, James J. Quigley
Venue: Proceedings of the 1966 21st national conference (1966)

The Automated Layout Design Program (ALDEP) is a tool to aid the plant designer in developing an optimum layout for organizational units (functions) within the restraints of space availability. Using this technique, the layout planner eliminates the repetitious task of constructing and evaluating numerous block layouts. The program considers thousands of possibilities, scores them, selects the better results for further study by the planner and produces an output, if requested, in graphical form.
Numerical applications of minicomputers at the National Bureau of Standards
Authors: Daniel W. Lozier
Venue: ACM SIGPLAN Notices (1976)

At the National Bureau of Standards, minicomputers are used in a variety of applications requiring the acquisition and processing of physical data. In this paper, a general view of minicomputer use in laboratories at NBS is given. Several specific applications with current and future requirements in numerical processing are discussed. Computation on small computers is typically constrained, more severely than on large computers, by hardware limitations. These can be overcome only by mathematical software that is not required in large computer systems. The validity of computed results depends on this software as well as on the same type of mathematical software that would be used to solve the same problem on a large computer. But mathematical software of known high quality is less readily available for minicomputers. Some possible means of alleviating the software problems of minicomputers, and some steps taken in this direction at NBS, are discussed.
PLANET - a user's viewpoint
Authors: John E. Barker
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

This paper describes PLANET (Planned Logistics ANalysis and Evaluation Technique), the generalized maintenance and logistics model developed at RAND. Particular mention is made of problems encountered and solved in the application of PLANET to large-scale maintenance and logistics systems. The use of PLANET's generality to model unusual (i. e., beyond the normal scope of the model) maintenance policies is discussed, with examples. The paper further considers some of the operational techniques found useful in performing maintenance and logistics simulations. 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
WaveTool: an integrated software for wavelet and multirate signal processing
Authors: H. Singh, P. N. Heller
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Wavelets and multi-rate filter banks are increasingly important tools for various digital image processing (DIP) and image analysis tasks in addition to their traditional applications in one dimensional signal processing. WaveTool, is an integrated software environment for rapid prototyping of wavelet-based algorithms. It is particularly attractive for signal processing because of its rich collection of filter bank choices, online multi-rate filter design, and interactive tree building. This paper presents a general overview of WaveTool with emphasis on its image processing capabilities. Example applications to texture classification, seismic data compression, and image restoration are presented, and the future direction of WaveTool is discussed.
Models (fractal and otherwise) for perception and generation of images
Authors: Alex P. Pentland
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Perception is best understood as the interpretation of sensory data in terms of models of how the world is structured and how it behaves; these models are exactly those that are most useful for generation of computer images. By recognizing and exploiting this commonality we have been able to make surprising progress in both fields.
A study of organizational structures in academic computing centers
Authors: John E. Bucher
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

This paper reports the findings of an informal survey of organizational structures in several academic computing centers. Small, medium, and large centers were studied and an attempt was made to identify the advantages and disadvantages or the various structures. Not unexpectedly, the most serious criticisms of their own structures came from small computing centers, where severe shortage of staff was listed as the biggest disadvantage. All sizes of computing centers claimed that dual responsibilities for both academic and administrative computing frequently caused severe organizational problems. Successful organizational structures are most often due to a cooperative staff and good lines of communication.
More design data for stack architectures
Authors: Ilkka J. Haikala
Venue: Proceedings of the ACM '82 conference (1982)

Some behavioural properties of programs running on a B6700 are presented. The data has been collected from simulations of many large and medium sized programs. The data present includes the percentages of different types of memory references, the average sequence lengths between transfers of control, and statistical information from the segments of the programs. The results collected have some interesting implications concerning the design of processors executing programs written in modern, high level languages.
Logic simulation for LSI
Authors: Kazuyuki Hirakawa, Noboru Shiraki, Michiaki Muraoka
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes the logic simulation system and the design verification method for logic design, timing analysis, and testing for VLSI. The integrity of test and network data on a logic design stage must be kept in LSI testing in the final verification stage. In dealing with consistency, emphasis is placed on the discrepancy between the real time domain on a simulator and a testing time domain on an LSI tester. The logic simulation system (Block INtegrator and AnaLYzer: BINALY) handles a hierarchical structure, a detailed timing model, and a timing alignment method for a testing time domain.
Intercalation theorems for stack languages
Authors: William F. Ogden
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

This paper develops necessary conditions for languages to be stack generable, stack decidable, and non-erasing stack generable. The result for stack generable languages shows that the languages {an3&brvbar;n&ge; 0} and {an bn2 cn &brvbar;n&ge;0) are not stack generable. It also shows that the language {am bm2 cn &brvbar;m, n&ge1} &ugr;{am bn2 cn &brvbar;m, n&ge;1} is inherently ambiguous as a stack language. In addition, it shows that the infiniteness problem for stack generable languages is solvable. The necessary conditions for stack decidable and non-erasing stack generable languages show that {an bn2 &brvbar;n&ge;1} &ugr;{an b2n2 c&brvbar;n&ge;1} is not stack decidable and that {an bn2 &brvbar;n&ge;0}is not non-erasing stack generable. These examples show that these two families of languages are not closed under reversal. Two unsolvability results are also obtained. The question of whether a stack generable language is inherently ambiguous as a stack language is undecidable. The question of whether the reversal of a non-erasing stack generable language is also non-erasing stack generable is undecidable.
MicroTAL - a machine-dependent, high-level microprogramming language
Authors: Joel F. Bartlett
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

The design and implementation of a high-level microprogramming language is described. The language is a subset of an existing systems programming language, TAL, which allows algorithms to be written and debugged using that language. The procedure may then be recompiled using the microTAL compiler to produce a semantically equivalent microprogram which is accessed via an opcode rather than a procedure call. The microTAL compiler automatically generates code to handle interrupts and page faults which may occur during the execution of the procedure.