ppxscal/embedding_network huggingface dataset:
Robust detection of degenerate configurations for the fundamental matrix
Authors: P. H. S. Torr, A. Zisserman, S. J. Maybank
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

New methods are reported for the detection of multiple solutions (degeneracy) when estimating the fundamental matrix, with specific emphasis on robustness in the presence of data contamination (outliers). The fundamental matrix can be used as a first step in the recovery of structure from motion. If the set of correspondences is degenerate then this structure cannot be accurately recovered and many solutions will explain the data equally well. It is essential that we are alerted to such eventualities. However, current feature matchers are very prone to mismatching, giving a high rate of contamination within the data. Such contamination can make a degenerate data set appear non degenerate, thus the need for robust methods becomes apparent. The paper presents such methods with a particular emphasis on providing a method that will work on real imagery and with an automated (non perfect) feature detector and matcher. It is demonstrated that proper modelling of degeneracy in the presence of outliers enables the detection of outliers which would otherwise be missed. Results using real image sequences are presented. All processing, point matching, degeneracy detection and outlier detection is automatic.
Probabilistic models of computer systems
Authors: E. Gelenbe, G. Pujolle
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

We develop a method based on diffusion approximations in order to compute, under some general conditions, the queue length distribution for a queue in a network. Applications to computer networks and to time-sharing systems are presented.
Classes of computable functions defined by bounds on computation: Preliminary Report
Authors: E. M. McCreight, A. R. Meyer
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

The structure of the functions computable in time or space bounded by t is investigated for recursive functions t. The t-computable classes are shown to be closed under increasing recursively enumerable unions; as a corollary the primitive recursive functions are shown to equal the t-computable functions for a certain recursive t. Any countable partial order can be isomorphically embedded in the family of t-computable classes partially ordered by set inclusion. For any recursive t, there is a recursive t' which is (approximately) equal to an actual running time such that the t-computable functions equal the t'-computable functions.
Petri nets as a common tool for design verification and hardware simulation
Authors: Pierre Azema, Robert Valette, Michel Diaz
Venue: Proceedings of the 13th Design Automation Conference (1976)

An APL simulation is developped in the case of parallel systems which communicate with the environment. This method using interpreted PETRI nets, helps the design verification.
Professional development seminars: The myths of the computer consultant
Authors: Bill Rieken
Venue: Proceedings of the ACM '82 conference (1982)

Consultants and contractors are common sights around DP shops these days, but how much do people who are not consultants themselves know about this business? The role of the consultant in the industry, an examination of the pros and cons of consulting, and what it takes to be a consultant are discussed in this talk. The myths of the manpower crunch, the amount of money that can be made, and the complaint of incompetent consultants are examined to find the truth behind them.
A numerical solution of the helium wave equation with the SEAC
Authors: J. H. Wegstein
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

Gronwall's wave equation for s states of helium has been simplified so that boundary singularities will not interfere with a numerical solution. The corresponding difference equations are written for a coarse net of varying mesh size, and are solved for wave function values and the eigenvalue of the ground state. A simple iteration procedure is used with the SEAC. The rate of convergence is observed and an accelerating technique is employed which considerably shortens the running time for the problem.
Modeling jobs in a distributed system
Authors: R. A. McBride, E. A. Unger
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The original motivation for this paper came from an attempt to find a model for office systems which could be used to provide the basis for either an implementation or simulation. It was realized that the office is just an instance of a distributed system, so instead a model for this larger set of systems was sought. Five major components were identified that are necessary to model the processing of a unit of work or a job in a distributed environment: 1. a structural model for each procedure or function provided in a distributed system, 2. a structural model of the control program that directs the processing of an individual job, 3. the status of a job (including both its control and data state), 4. global information accessible to all jobs and functions in the system, 5. data files (whose usage may be restricted and therefore do not represent global information). This paper describes a model which can be used to depict the control and information flow of a job in a distributed processing environment. The basic technique that is used employs individual Petri nets to describe each of the procedures that a unit of work must invoke. In addition, a so-called &ldquo;control&rdquo; Petri net is used to model the equivalent of a control program for a job which has the responsibility for overseeing the execution of procedures available in the distributed system.
A Deterministic finite automaton approach to design rule checking for VLSI
Authors: R. Alan Eustace, Amar Mukhopadhyay
Venue: Proceedings of the 19th Design Automation Conference (1982)

Integrated circuit fabrication technologies place certain restrictions on the relationships with and between mask layers. These &ldquo;design rules&rdquo; are intended to describe the class of designs that the fabrication process will correctly implement. The intent of this paper is to describe a general design rule checking algorithm that will take as input the rasterized design and a set of fabrication rules in the form of deterministic finite automaton and report any errors in the design layout. This approach allows flexible design rule definitions, technology independent, design rule checking code and is ideally suited for hardware implementation.
Session I: University applications
Venue: Proceedings of the conference on APL (1969)

This session was presided over by Mr. Walter Niehoff who is the Manager of Engineering Education at IBM, Endicott. He has been using APL for about two years and his prime interest now is the application of APL for: (1)Communication problems - those specifically referring to Computer Science instruction (2)Machine description Mr. Niehoff introduced the three speakers on this panel and led the ensuing discussion period. Included below is a consolidated version of Mr. Mueller's address which he generously provided, and descriptions of Mr. Searle's and Mr. Foster's speeches.
Efficient FORTRAN subprograms for the solution of elliptic partial differential equations.
Authors: Paul Swarztrauber, Roland Sweet
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

The purpose of this paper is to describe technical note, NCAR TN/IA-109, which is intended to provide scientists with a package of computer programs which make use of current methods for solving elliptic partial differential equations. Computer models of geophysical processes often require the numerical solution of elliptic partial differential equations. This is particularly true for models which make use of stream functions, velocity potentials, or vorticity equations, or in which the pressure of an incompressible fluid is computed. The numerical solution of elliptic equations can be a formidable programming task. Also, the equations are often time-dependent, requiring repeated solutions and, hence, considerable computing resources. Efficient, reliable, and well-documented computer subroutines for solving such equations are needed. With recent advances in computing methods, it became apparent to the authors that a very large class of elliptic equations (separable) could be solved rapidly and with minimal storage. Of particular importance was the fact that, as a result of work on singular problems, this class was free of special cases for which solutions could not be obtained numerically.
Budgeting in a time of inflation and austerity - some UK experiences
Authors: J. B. Slater
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

The main purpose of this paper is to discuss about the budgeting in inflation and austerity.
Measurement and evaluation of modern programming practices
Authors: Philip Milliman
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

In research sponsored by the Rome Air Development Center, a 4 man year project was studied to determine the effect of modern programming practices on the life cycle of a project. Analysis of errors and error rates, the source code, and development characteristics indicated that while the project was not more productive than the standard industry project, it was consistently different and better than a similar project in the same development environment. Among the metrics chosen to examine the projects were Halstead's effort metric, McCabe's flow complexity metric, and McCall's software quality metrics. These metrics indicated that the project using modern programming practices had a higher relative level of code and higher quality software than a similar project using conventional techniques. It was concluded that environmental considerations can obscure the benefits of modern programming practices when compared to projects in other development environments. Thus, there is great utility in the examination of matched projects, allowing a greater degree of control over the environment while not requiring the project manager to attempt too many new procedures at a given time.
A design for the education of computer programmers at the associate level within a baccalaureate level institution
Authors: John T. Gorgone, John F. Schrage
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The associate degree program in computer programming which services as the first two years of a bachelor's degree is a unique model. This 2+2 model is effective in keeping the articulation problems with community/junior colleges at a minimum. Described in the paper are the environmental, college, and departmental settings, and the curriculum requirements within a typical semester sequence of a business oriented two-year program for computer programmers.
Information Resource Management: Theory applied
Authors: Boulton B. Miller
Venue: Proceedings of the ACM '81 conference (1981)

Information Resource Management (IRM) grew out of the efforts of the Federal Paperwork Commission and the leadership of Dr. Forrest Woody Horton, during the 1970s. The Diebold Group claims that it first introduced the IRM concept to the business world in one of its proprietary client reports in 1977. Whatever the origin, the concept of IRM is well established within the federal government through the enactment of the Paperwork Reduction Act of 1980. This legislation was signed by the President on December 11, 1980 and became PL 96-511. During the past year federal agencies have been required to develop and implement the IRM concept in their organizations. In the private sector many large firms and other organizations have implemented the IRM concept or are making plans to do so. It was the anticipation of the enactment of the legislation and the appointment of corporate vice presidents for IRM management, such as at the McDonnell Douglas Corporation, which encouraged us to offer a graduate course in IRM last fall. It was well received and is being offered again this fall.
Perception and representation of spatial relations in a program for playing Go
Authors: Walter Reitman, Bruce Wilcox
Venue: Proceedings of the 1975 annual conference (1975)

Observation of human spatial perception suggests several characteristics that may serve as useful guidelines in the design of perception components for artificial intelligence systems. This paper describes one component designed in accordance with these principles, a web perception processor for a Go playing program. After a brief discussion of some basic strategic Go concepts, the paper describes the construction and modification of perceptual webs. Then, using examples from a real game situation, it shows how web structures, and changes in those structures, provide meaningfully organized representations of significant strategic properties in actual play. The paper concludes with some observations on the central significance of perceptual processing for Go programs and human Go players alike.
Is anyone here a systems analyst?
Authors: Dennis L. Dance
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

The systems analyst (SA), found in many information processing installations, is an ambiguous position having a generic definition to an extreme. That is, available descriptions are exceedingly general and often include wording which leaves the reader confused as to what such an individual, the analyst, does in a computing environment. The purpose of this paper is to provide a &ldquo;working&rdquo; definition based on the qualifications expected of the SA rather than providing a formal definition. Certainly one could argue that a formal definition might stand better the test of time, whereas a description using existing job expectations might rapidly become obsolete. As will be demonstrated the SA characteristics and duties have indeed been modified indicating that &ldquo;working&rdquo; definitions may be useful until further studies and investigations yield a nationally or internationally accepted standard.
Programming as an evolutionary process
Authors: F. L. Bauer
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Programming is studied as an evolutionary process (starting with the problem description and ending with some computer program), which is done in a sequence of transformation steps. Nature of these steps at several levels is illustrated by typical examples. The aim is to arrive at a computer-surveyed, intuition-controlled programming support system (CIPS). Some aspects of this project, which is under way at the Technical University of Munich Informatics Institute, are discussed.
BFS&mdash;realization of a fault-tolerant architecture
Authors: Gerhard W. Geitz, Ernst J. Schmitter
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

The paper considers possibilities of distributed architecture to improve the reliability of microcomputer systems to realize a fault-tolerant system. By using and extending existing redundancies of hardware, software, and time, a partially meshed ring structure that meets the requirements of a fault-tolerant architecture has been designed. Aspects of hardware implementation, system software structure, operating system requirements, fault diagnosis, and reconfiguration are explained, based on the fault-tolerant architecture basic fault-tolerant system&mdash;BFS.
Design considerations of statistical multiplexors
Authors: Wesley W. Chu
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

Design considerations for statistical multiplexors with Poisson message arrivals and the following three types of messages are considered: 1) constant length messages, 2) random length messages, and 3) segmented random length messages with fixed-size blocks. The operating costs of the multiplexors can be divided into transmission costs and storage costs. The transmission costs are dependent on the transmission rates of the lines and the number of lines used. The storage costs are dependent on the buffer length required, the cost of overhead in buffer management, and the cost of waste spaces of fixed-size block messages. The queuing delays imposed by multiplexors are dependent, for example, on delays due to buffering and computer scheduling algorithms. The trade-offs among transmission costs, storage costs, and delays are described. An optimal multiplexor is the one that yields minimum operating costs yet satisfies the required performances (e.g., delays, overflow probabilities). Some design considerations of multiplexing systems are then illustrated via examples.
On directly constructing LR(k) parsers without chain reductions
Authors: Wilf R. LaLonde
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

A chain production is a production of the form A&rarr;M where A is a nonterminal and M is either a terminal or nonterminal. Pager in [Pag5] has presented an algorithm which removes all chain reductions from LR(1) parsers after they have been constructed. In this paper, we present an algorithm for directly constructing LR(k) parsers with arbitrary subsets of the chain productions, called the useless chain productions, optimized out. If this subset is empty, the algorithm is a standard one [And 1, Kn]. If this subset consists of all chain productions, the result is a parser with all chain reductions optimized away. The algorithm, as in [Pag5], also eliminates from the parsers all nonterminals which occur as the left part of useless chain productions. This latter optimization along with the chain reduction optimization significantly decreases the storage space and execution times of the parsers. This provides an efficient solution of the open problem posed by Aho and Ullman [A U2] for all LR(k) grammars.
Rapid identification of repeated patterns in strings, trees and arrays
Authors: Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

In this paper we look at a number of matching problems and devise general techniques for attacking such problems. In particular, we describe a strategy for constructing efficient algorithms for solving two types of matching problems. We use this strategy to develop explicit algorithms for these two problems applied to strings (where the patterns are substrings) and arrays (where the patterns are subarrays or blocks). We also develop algorithms for these and related problems for trees, where the patterns are subtrees. Certain special cases of these algorithms are also discussed. Although we do not claim that these algorithms are optimal, we analyze each algorithm to estimate its computational cost. This provides some basis for choosing which algorithm is most desirable in any given situation.
The master of science program in computer and information science at San Jose State University
Authors: L. D. NEIDLEMAN
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Recently, in the fall of 1974, San Jose State University (SJSU) launched a new master's program in Computer and Information Science (CIS). The main function of this paper is to describe the program&mdash;detailing its origins, content, administration, present status and potential future. A secondary purpose is to present material about one of the program's options&mdash;Management Information Systems.(MIS). In order to accomplish the above goals, the paper is divided into five sections as follows: Background, Program Description, Current Results, MIS Option, and Summary.
The realization of monotone Boolean functions (Preliminary Version)
Authors: Nicholas Pippenger
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean function. We consider realizations by means of networks and formulae. In both cases the possibility exists that although a monotone function can always be realized in terms of monotone basis functions, a more economical realization may be possible if basis functions that are not themselves monotone are used. Thus, we have four cases, namely: 1. The cost of realizing a monotone function with a network over a universal basis. 2. The cost of realizing a monotone function with a network over a monotone basis. 3. The cost of realizing a monotone function with a formula over a universal basis. 4. The cost of realizing a monotone function with a formula over a monotone basis. For the first case, we obtain a complete solution to the problem. For the other three cases, we obtain improvements over previous results and come within a logarithmic factor or two of a complete solution.
The undergraduate program in information systems development
Authors: J. D. Couger
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

The need for education related to information systems in organizations is discussed, and a curriculum is proposed for an undergraduate program. Material necessary for such programs is identified, and courses incorporating it are specified. Detailed course descriptions are presented, program organization discussed, and implementation questions considered.
Conversion of complex contour line definitions into polygonal element mosaics
Authors: H. N. Christiansen, T. W. Sederberg
Venue: ACM SIGGRAPH Computer Graphics (1978)

A simple algorithm is presented for processing complex contour arrangements to produce polygonal element mosaics which are suitable for line drawing and continuous tone display. The program proceeds by mapping adjacent contours onto the same unit square and, subject to ordering limitations, connecting nodes of one contour to their nearest neighbors in the other contour. While the mapping procedure provides a basis for branching decisions, highly ambiguous situations are resolved by user interaction. The program was designed to interface a contour definition of the components of a human brain. These brain data are a most complex definition and, as such, serve to illustrate both the capabilities and limitations of the procedures.