ppxscal/embedding_network huggingface dataset:
Feature Matching by Searching Maximum Clique on High Order Association Graph
Authors: A. Branca, E. Stella, A. Distante
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this work we consider the most important problem in computer vision of performing matching among elementary features of objects when observed from different point of view. We formulate the problem in terms of sub-graph isomorphism between relational graphs characterized by nodes representing interested object features and linking edges weighted by projective invariant values. The matching involves to determine all nodes in the association graph mutually compatible according to the similarity of the imposed invariant relations encoded on the edges. The solution requires to determine subsets of nodes totally interconnected by edges with highest weights. Moreover, in most contexts, relations among more than two features can be involved, giving rise to association graphs of higher order. Recently it has been recognized to a particular class of dynamical equations to be able of solving the maximum clique problem into an optimal manner. In our work, we have extended and applied such results to solve the most general problem of searching for the maximum edge-weighted clique on high order association graphs. Moreover we have applied the method to a classical problem in computer vision of planar 3D surface reconstruction which is of fundamental importance for an autonomous moving vehicle in order to accomplish some elementary tasks, such as detection of ground floor obstacles or independent moving objects.
An implementation of computer aided test generation techniques
Authors: Robert W. Rozeboom, Jeri Jane Crowley
Venue: Proceedings of the 13th Design Automation Conference (1976)

A computer program which aids the engineer in developing functional test sequences for digital devices is described. A general overview is given along with specific simulation techniques used. The program has several features unique to the implementation of conventional test generation aids.
The Dresser Planning Model
Authors: Charles H. Hatfield,  Jr., Bryant K. Kershaw
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The Dresser Planning Model is a large scale econometric model to forecast sales and earnings for a domestic Division of Dresser Industries. The model uses demand and cost functions. Solution is a mixture of recursive and simultaneous equations.
Determining computer support requirements: Implications for design
Authors: Sidney E. Harris, Harvey J. Brightman
Venue: ACM SIGOA Newsletter (1984)

In this research paper, we discuss a design methodology for determining computer support system needs. We were aware that research work is communications-oriented and highly cognitive in nature, it was necessary to define a profile of the tasks that characterize the key elements of research work. The researcher then selects those tasks that constitute bottlenecks in completing the various research activities. In addition, the modes of support which are essential in completing the tasks are evaluated along several dimensions &mdash; quality, timeliness, dependability, reliability, and cost. This procedure allowed us to define the primary tasks that are consistent barriers in the completion of research work and the modes and nature of support which are inadequately provided as support service capabilities. The design methodology approach was implemented and evaluated using the research faculty at Georgia State University.
Circuit frequency response analysis program with worst-case capabilities (FRWC)
Authors: S. J. Garrett, T. H. Vind
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

Circuit Analysis with s digital computer has become almost commonplace. Such programs as NET-1, ECAP, SCEPTRE, CIRCUS and many others have significantly advanced the state of the art of circuit analysis. So much so that the past several years have witnessed the development of the worst-case analysis era. It is no longer sufficient just to supply a customer with a piece of electronic equipment that is thoroughly tested. Frequently, and especially when the customer is connected with the space program, an analysis is also required that shows the equipment will meet the performance specifications when component parameters are permitted to vary. These variations may be due to purchase tolerances, temperature variation, or end-of-life degradation. The analysis procedure that leads to a worst-case calculation is very tedious. The variation which gives the worst-caste performance must be selected. The analyst is given some aid in his search for the worst-case performance by some computer programs. For example, ECAP will calculate the sensitivities and the worst-case voltages in a DC circuit. However, neither the worst-case transient solution nor the worst-case frequency response solution can be obtained automatically from available programs. A digital computer program which uses the extremes of the parameter varizations to compute the worst-case performance of a lumped-linear model of an electronic circuit was developed by the authors and is presented here. The program is described in this paper in several sections. In Sections II through IV the worst-case feature is described in detail and an example is given to illustrate the use of the program. In Section V the detailed operating instructions for the program are listed. Section VI presents conclusions.
Hierarchical function distribution - a design principle for advanced multicomputer architectures
Authors: W. K. Giloi, P. Behr
Venue: ACM SIGARCH Computer Architecture News (1983)

An abstract view of a computer system is provided by a hierarchy of functions, ranging from the high-level operating system functions down to the primitive functions of the hardware. Vertical migration of high-level functions into the microcode of a CPU or horizontal migration of hardware functions out of the CPU into dedicated processors alone is not an adequate realization method for innovative computer architectures with complex functionality. In the paper, a new design principle called hierarchical function distribution is introduced to cope with the task of designing innovative multicomputer systems with complex functionality. The design rules of hierarchical function distribution are presented, and the advantages of the approach are discussed and illustrated by examples.
The Test Support Program (TSP) a real-time interactive simulation system
Authors: Edward G. Ries, Donald J. Harmon
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

The Test Support Program (TSP) is a real-time interactive computer-based simulation model that provides the environment for testing and verifying the operation of netted air control systems. It provides computer-to-computer simulation of data link timing; message interpretation, response, and transmission; and on-line data analysis and recording for up to nine interfaced systems of various types. Event execution and timing is performed in accordance with a time-ordered pre-stored scenario and operator-initiated console inputs. Live and simulated system interfaces and data may be used. The simulation model can accept and use data from live systems. Event and data inputs are structured in a special language and are validated by a pre-processor to aid in test design and error-free execution. Event control and data entry during program execution are from a CRT/keyboard or magnetic tape. TSP permits earlier and more effective verification of program performance, easier design of complicated tests, and reduces reliance on establishment and operation of large complexes of operational and test bed systems. Program operation can be verified in advance of the availability of interfacing hardware and software in a controlled environment.
Automatic data-recording in real-time control systems
Authors: H. E. Frachtman
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

This paper discusses some of the aspects of data-recording in real-time control systems. A &ldquo;real-time control system&rdquo; senses the conditions existing in some process, converts this into appropriately coded data, assembles it in one place, draws conclusions from it, and transmits instructions to the process control elements. Such a system might be used for controlling a chemical or nuclear reaction, a large and complex system such as a ship, or an environmental situation such as the flow of air traffic over a portion of the country. We will assume that the heart of this system, which does the data assembly, computation, and transmission of output instructions, is a large, high-speed, general-purpose digital computer.
A preprocessor for channel routing
Authors: Ming H. Young, Larry Cooke
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper presents a &ldquo;preprocessor&rdquo; which separates a channel routing problem into two subproblems. One is a specialized channel routing problem where no two nodes of two different nets are of the same y-grid position. The other is a problem of connecting pairs of nodes where each pair of nodes has a path reserved for it. The use of a &ldquo;preprocessor&rdquo; in channel routing[5] is justified by the comparison of routing results.
Characterizations of flowchartable recursions short version
Authors: S. A. Walker, H. R. Strong
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

In this paper we give new characterizations for the flowchartability of recursive functionals. The general question of flowchartability is recursively undecidable. We present here an effective map from recursions to representatives for which the question is decidable. The decision provides a good approximation to a characterization for general flowchartability in the following senses: (1) if a representative is flowchartable then the recursions it represents are, and (2) there is a straightforward method of flowcharting, depending only on recursion structure, such that a recursion is flowchartable by this method if and only if its representative is flowchartable. The main results of the paper are (1) that such a representative is flowchartable if, and only if, it is simple or linear, and (2) that, when the context is restricted so that only invertible operations are considered, such a representative is flowchartable if, and only if, it is nested. The terms &ldquo;simple&rdquo; and &ldquo;linear&rdquo; have been defined in previous papers in the area, although they are extended slightly in this one. The term nested is introduced here. Simple, linear, and nested recursions are very easy to identify by inspection.
Data sharing in an FFP machine
Authors: Gyula Magó
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

The possibility of expressing data sharing in FPs is discussed. The Paterson-Wegman unification algorithm is considered, in which data sharing is indispensable to achieve efficient (linear time) execution. An FP implementation of this algorithm is shown to execute in linear time on an FFP machine. &ldquo;Associative&rdquo; versions of some of Backus's FP functions and combining forms appear to be very useful in dealing with irregular data objects such as graphs.
The use of ATOPSS for presenting elementary operating system concepts
Authors: Will Tracz
Venue: ACM SIGCSE Bulletin (1974)

ATOPSS (Adage Tutorial Operating System Simulator) was designed to provide both a learning tool and a teaching aid for the presentation of elementary operating system concepts to graduate or advanced undergraduate computer science students. As a real learning tool, the simulator itself offers real time interaction and observation of a parametric, discrete time event oriented operating system. For a teaching aid, a series of short movies has been produced using ATOPSS solely as its basis, demonstrating both the use of the simulator and the different concepts it portrays. These movies thus offer the portability necessary for in-classroom presentation and provide a basis for further discussion.
An iteration theorem for one-counter languages.
Authors: L. Boasson
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

We give a definition of one-counter languages. We show that the smallest full AFL containing this family is principal with full generator D'@@@@ @@@@, the semi-Dyck language on two letters. We then give without the proof, which shall be published elsewhere, our main result: an iteration theorem for one-counter languages that yields several corollaries.
A probabilistic framework for system performance evaluation
Authors: Stephen R. Kimbleton, Charles G. Moore
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

A method for comparing throughput, turnaround time and availability is given for a processor-bound computer system. The method appears to be extendable to any computer system in which there is a clearly defined limiting resource.
Performance Estimation of Model-Based Automatic Target Recognition Using Attributed Scattering Center Features
Authors: Hung-Chih Chiang, Randolph L. Moses, William W. Irving
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We present a model for classification performance estimation for synthetic aperture radar (SAR) automatic target recognition. We adopt a model-based approach, in which classification is performed by comparing a feature vector extracted from a measured SAR image chip with a feature vector predicted from a hypothesized target class and pose. The feature vectors are compared using a Bayes likelihood match metric that incorporates uncertainty in both the predicted and extracted feature vectors. The feature vectors parameterize dominant scattering centers on the target, and include attributes that characterize frequency and angle dependence of scattering centers. We develop Bayes matchers that incorporate two different feature correspondence methods. Finally, we compare performance using measured SAR imagery for a 10-class problem under various match operating scenarios.
Learning how to confer: The interplay of theory and practice in computer conferencing (abstract only)
Authors: Robert Parnes
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

Members of the Merit staff first met Robert Parnes in the fall of 1975 and began participating in his experimental CONFERence shortly thereafter. It soon became evident that CONFER could help us provide consultation to our users, who were distributed over a large part of southeastern Michigan, and in January of 1976 Merit started what we believe to be the first CONFERence open to the general public, MNET: CAUCUS.Five years later CAUCUS is still alive and well, and we still use it to provide help to a widely-dispersed user community--in fact, with the advent of Telenet service later that same year, and with Telenet's subsequent expansion of service to Canadian and overseas networks, our users are spread all over the world. But we have learned over the years that computer conferencing is good for much more than simply facilitating the user-consultant relationship. As we gained experience with CONFER we found that it gave us a solution to problems that were so basic we had simply taken them as part of the environment. CONFER also provided a medium for communication among consultants--the Merit staff--and among users.
Impact of information retrieval on Corporate Structure
Authors: J. H. Veyette,  Jr.
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The past several years have seen a growing emphasis on Information Retrieval (IR). Actually, information retrieval is not new. We have had books, libraries and reference librarians for many years. What is new is the application of mechanized methods for accomplishing these age-old tasks and the application of computers to assist in solving what is developing into a national problem. There are some who believe that we have already reached the problem stage, or even gone beyond. Information retrieval is the art of extracting from storage, information desired at a particular point in time, in response to specific requests. The information has been stored originally with consideration for its eventual accessibility. (Information retrieval is not as complicated as many other computer applications although the problems associated with it have been rather difficult to solve.) While the term retrieval connotes the act of &ldquo;regaining&rdquo; or &ldquo;recovering&rdquo; the information, the retrieval concept extends further. It involves the aspects of information collection, selection, indexing, storage, retrieval, and dissemination.
Computer simulation of irregular shaped lesions in radiographs
Authors: John M. DeGroot, Samuel J. Dwyer, Lewis J. Garrotto
Venue: Proceedings of the ACM annual conference (1973)

Facing an ever-increasing demand for diagnostic radiological examinations, the radiologist has turned to other means for assistance. In some cases this has been the utilization of trained technical assistants. New methods and techniques have been tested. In this learning process, simulated lesions can be useful in training of assistants. It can also be an integral part of the evaluation of their abilities to perform the required functions. Second, the study of radiographic images may be quantitatively explored as to their use in diagnosis. Previous radiographic simulations have made use of photographic and television simulations. However, greater quantitative control can be achieved by the utilization of the digital computer. This system provides a qualitative and quantitative control plus a high degree of flexibility throughout the system. Images and radiographs can be studied to determine the ability of the trained observer to perceive information as displayed in the traditional radiograph1. The purpose of this paper is to describe the system used to simulate lesions in the chest radiograms and the effect of shape on the detectability of these lesions. The general effect of contrast and lesion size must continue to be considered during the generation of the lesions. Various levels of contrast must be generated to test the Weber-Fechner law for complex images. Both sharp edges and Gaussian examples were used in determining the threshold of perception for each lesion. The background and immediate surrounding area were used to determine the contrast. The results were not unexpected. The useful lesion shape previously tested consisted of the nodular variety. This, however, is not the only lesion presented to the radiologist; therefore, this experiment concentrated on lesions developing in the bronchus and radiating outward. A series of lesions was generated at various contrast levels, shapes, and sizes. These were then shown to radiologists and their detection ability as a function of contrast and size was measured with a fixed viewing distance.
Complexity theory and design automation
Authors: W. E. Donath
Venue: Proceedings of the 17th Design Automation Conference (1980)

Complexity Theory is discussed and its relationship to Physical Design (i.e. Placement/Wiring) and Test Pattern Generation is shown and developed.
A system for classifying program verification methods: Assigning meanings to program verification methods
Authors: Ali Mili, Jules Desharnais
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Many program verification methods are known nowadays: Inductive Assertion Method, Invariant Assertion Method, Intermittent Assertion Method, Symbolic Execution Method, Subgoal Induction Method, Computational Induction Method, Structural Induction Method, Fixpoint Theory of Programs. This paper presents a simple classification of them.
Educating the working computer scientist(A survey and analysis)
Authors: Ronald L. Danielson
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Due to the strong job market for recipients of Bachelor of Computer Science degrees, fewer graduates are immediately continuing with post-graduate education. These individuals will experience a need for graduate education later, at a time when they are less able to attend school on a full-time basis. This will lead to an increasing demand for part-time graduate programs, especially near centers of computer technology. This paper reports the results of an informal survey of existing part-time degree-granting graduate programs in computer science. Topics discussed include program format, student enrollment, source of faculty, and characteristics of students.
Computer-aided digital autopilot design analysis: Methodology, implementation and verification
Authors: W. V. Albanes, J. B. Meadows
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

This paper details the design methodology for a missile digital autopilot using a digitization approach, and a discrete domain design approach. These two designs rely heavily on computerized system analysis tools in the frequency and time domains. Further, three complex frequency planes are available to the designer, therefore, relative merits of each will be discussed. This paper will also detail the implementation of the autopilot on the missile microcomputer, a six degree of freedom (6DOF) missile simulation, and a hardware in the loop (HWIL) hybrid computer simulation. The 6DOF permits fine-tuning of design parameters for optimum system performance, whereas the HWIL simulation exercises the real flight hardware. Finally, this paper will also show the final autopilot design verification through comprehensive deterministic and Monte Carlo simulations.
EPOS - a specification and design technique for computer controlled real-time automation systems
Authors: Joachim Biewald, Peter Goehner, Rudolf Lauber, Helmut Schelling
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Direct and indirect design techniques are discussed using a model with hierarchical abstraction strata. EPOS is defined as an indirect technique to support the specification, design, operation and maintenance of both hardware and software systems, to provide description means for real-time properties, to be implemented on a mini-computer and to be oriented to process engineers as users. The main parts of EPOS, its basic description model and its application are explained.
Maximal rate pipelined solutions to recurrence problems
Authors: Peter M. Kogge
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

An m thorder recurrence problem is defined as the computation of X1, . . . XN, where Xi&equil;f (&abarbelowi, Xi-1, . . Xi-m) and &abarbelow;i is a set of parameters. On a pipelined computer, where the total stage delay in computing f is df time units, the solution output rate is one new Xi each df time unit. This paper describes a method for increasing this rate to 1 per time unit when the function f has certain simple functional properties. The total stage delay and complexity of the resulting pipelines are also described.