ppxscal/embedding_network huggingface dataset:
Two Computer Vision-Based Tracking Applications Solved Using a Robust Parallel Optimizer
Authors: Pierre-Louis Bazin, Philippe Gérard, André Gagalowicz
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A method was developed as a response to the need for a robust optimizer for two different image vision algorithms. Our new approach is a synthesis of two modalities, a Simulated Annealing technique paired with a parallel search.Using an initial value and the maximum parametric variations, our method searches for a cost function minimum by using parameter subspaces combined with a local Simulated Annealing algorithm step. The following description of our two computer vision applications which relate object tracking to video sequences make it clear why this kind of optimizer was needed. In the cases described below, our method provides encouraging results.
Use of an amputee-computer interactive facility in above-knee prosthesis research
Authors: Woodie C. Flowers
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Significant contributions to the development of improved knee flexion control mechanisms for above-knee prostheses can be made through evaluation of existing computer-developed performance criteria and through evaluation of schemes for providing the amputee with voluntary knee torque control. A new amputee-computer interactive technique and facility has been developed for conducting this research. This new technique allows the evaluation of proposed swing and stance control schemes and proposed voluntary control schemes without additional hardware development. Essentially, a computer controlled prosthesis, which can be worn by an amputee, emulates proposed hardware through computer simulation techniques. This system is currently being used to evaluate proportional electromyographic control of knee damping moments.
Modularization in the pilot compiler and its effect on the length
Authors: Jose C. Ingojo
Venue: Proceedings of the 1976 annual conference (1976)

The length equation for programs, initially suggested by M.H. Halstead, has been studied and experimentally verified by several independent investigators. The sets of programs tested have ranged over a variety of programming languages and program sizes. While such studies have tested the equation for programs taken as a whole, there have been no studies on the length equation when applied to individual modules within a program. This paper provides such a study for a compiler composed of fourteen modules. The length equation is shown to hold for program parts (modules) as well as for program wholes (the total program).
Nassi-Shneiderman charts an alternative to flowcharts for design
Authors: Cornelia M. Yoder, Marilyn L. Schrag
Venue: ACM SIGMETRICS Performance Evaluation Review (1978)

In recent years structured programming has emerged as an advanced programming technology. During this time, many tools have been developed for facilitating the programmer's use of structured programming. One of these tools, the Structured Flowcharts developed by I. Nassi and B. Shneiderman in 1972, is proving its value in both the design phase and the coding phase of program development. Several programming groups in System Products Division, Endicott, New York, have used the Nassi-Shneiderman charts as replacements for conventional flowcharts in structuring programs. The charts have been used extensively on some projects for structured walk-throughs, design reviews, and education. This paper describes the Nassi-Shneiderman charts and provides explanations of their use in programming, in development process control, in walk-throughs, and in testing. It includes an analysis of the value of Nassi-Shneiderman charts compared to other design and documentation methods such as pseudo-code, HIPO charts, prose, and flowcharts, as well as the authors' experiences in using the Nassi-Shneiderman charts. The paper is intended for a general data processing audience and although no special knowledge is required, familiarity with structured programming concepts would be helpful. The reader should gain insight into the use of Nassi-Shneiderman charts as part of the total development process.
A multitasking implementation of system simulation: The emulation of an asynchronous parallel processor for system simulation using a single processor
Authors: Murali Krishnamurthi, Robert E. Young
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper describes the design and the development of a multitasking implementation of system simulation for the purpose of emulating an asynchronous parallel processor for system simulation using a single processor. The multitasking simulation system is a FORTRAN software kernel built around an existing simulation language (GASPIV) so that it emulates an asynchronous parallel processor simulation system. The multitasking simulation system is in full operation on a Texas Instruments 990/12 minicomputer and it is being used successfully to emulate the software architecture of the parallel processor simulation system being designed and built in the Industrial Automation Laboratory at Texas A M University.
Automatic programming and compilers I: Data description in the CL&mdash;II Programming System
Authors: T. E. Cheatham,  Jr.
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

The CL-II system is an integrated programming and operating (monitor) system. CL-II has facilities for: Compiling and filing programs represented in a variety of problem-oriented and machine-oriented languages; inputting, converting and filing collections of data; dynamically linking and allocating programs and data to various memory media; and, controlling the calling and execution of programs. In this paper, we will discuss the ODES&mdash;the basic data descriptor available in the CL-II system. An ODES, which is itself a data set, contains all the information which is required by the various processors of the CL-II system to manipulate a data set. Thus, the ODES for a specific data set contains a complete description of all the elements of the data set, including names, types and mapping functions for all the various representations of the data set which may occur; e.g., internal memory, punched cards, paper tape, and so on. Further, it includes the specification of the composition (of collections) of data elements into larger elements, resulting finally in the complete data set.
Personnel planning databases and modeling: A software approach
Authors: Luis B. Boza
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Two obstacles frequently encountered by model builders in personnel planning are the lack of data on the personal dynamics of organizations and of flexible software systems for execution of models tailored to particular organizations and issues. In this paper we present the main ideas behind the INTERACTIVE FLOW SIMULATOR, a software system constructed to avoid these difficulties. A procedure for building longitudinal personnel databases is outlined. An algorithmic view of discrete time models which encompasses a wide class of personnel planning and other models is presented.
Experimental validation of a structural property of fortran algorithms
Authors: Necdet Bulut, M. H. Halstead, Rudolf Bayer
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Recent studies [1,3,8,9] have shown that theory predicts, and limited experimental data confirm, the existence of a functional relationship between the length, N, of the expression of an algorithm and the number of distinct operators, n1,and of distinct operands, n2,required to express that algorithm in various languages. Data previously examined, however, was restricted to a small sample of rather short, published algorithms, for which n1,n2and N could be measured manually.
The economics of programmable system components
Authors: Harvey G. Cragon
Venue: ACM SIGMICRO Newsletter (1980)

Integrated circuits having complexity levels approaching one million devices per chip (VLSI) present significant problems in the cost of design and use. There are advocates for very capable design automation techniques coupled with rapid turnaround front ends as the path to VLSI. Others advocate the use of programmable devices such as microcomputers and gate arrays. This paper presents cost models for these two approaches which demonstrate that the Programmable System Component (PSC) approach is the only viable path in VLSI. This paper will also describe a set of generic PSCs which will meet the needs of 70%-80% of the sockets, and perhaps 95% of the production volume for VLSI components. The remaining 20%-30% of the sockets and 5% of the volume will be served by specific, nonprogrammable designs.
Documentation for the casual user: A critical overview
Authors: Daniel Rosich
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

Although common wisdom holds that the ultimate success of any office automation system depends upon end user acceptance, little, if any, attention seems given to the system documentation needed to enable the casual user to use the system properly, efficiently, and effectively. The casual user interacts aperiodically with the system and the interactions are not always a direct requirement of job role; most middle management would be included in this class. Several examples of system documentation are reviewed. This paper then attempts to summarize some of the most significant casual user needs and the documentation principles associated with them, to evaluate the applicability of these needs to real-world systems, and to suggest how these needs may be met more effectively.
On the substitution of polynomial forms
Authors: Ellis Horowitz
Venue: Proceedings of the ACM annual conference (1973)

The problem of devising efficient algorithms for computing Q(x1,...,xr-1, P(x1,...,xr-1)) where P and Q are multivariate polynomials is considered. It is shown that for polynomials which are completely dense an algorithm based upon evaluation and interpolation is more efficient than Horner's method. Then various characterizations for sparse polynomials are made and the subsequent methods are re-analyzed. In conclusion a test is devised which takes only linear time to compute and by which a decision can automatically be made concerning whether to use a substitution algorithm which exploits sparsity or one which assumes relatively dense inputs. This choice yields the method which takes the fewest arithmetic operations.
A design for APL software for man-machine dialogue with statistical applications
Authors: Michael L. Friendly, Richard M. Levine
Venue: Proceedings of seventh international conference on APL (1975)

Encouraged by the popularity of interactive computing and technical advances in time-sharing, computer users are increasingly turning to the development of interactive applications. In particular, statistical computing in APL has attracted its share of interest In this paper we will discuss the design of a control structure for a class of interactive applications. We then discuss the method of using the control structure in statistical applications. We also give special attention to XYPAK, a workspace for bivariate analysis that uses the general control structure.
Implementations of APL on small computers
Venue: ACM SIGAPL APL Quote Quad (1979)

The purpose of this session is to discuss implementing APL on small computers. The presentations will deal with design decisions associated with the actual implementations of such systems.
Distributive rounding in commercial applications
Authors: Paul Berry
Venue: Proceedings of the eighth international conference on APL (1976)

The elements of an array may be rounded in such a way that their sums along a particular axis are consistent with their sums before rounding. The needed adjustments can be made &ldquo;fairly&rdquo;&mdash;that is, taking into account both the relative accuracy and the serial position of the rounded elements. Using such an algorithm, it is possible to assure that percentages, budget categories, or arrays used in other applications where a given initial amount is partitioned among several components, add to the expected totals.
The use of color and 3-D temporal and spatial data management techniques in computer-aided design
Authors: Wayne E. Carlson, Richard Parent, Charles Csuri
Venue: Proceedings of the 16th Design Automation Conference (1979)

An interactive system has been developed that facilitates closer interaction by a designer in the design process through the use of shaded color three-dimensional computer graphics to display appropriate design data. The use of traditional computer animation techniques allows for more efficient analysis of time dependent data, and advanced interactive methods of storing and retrieving spatial data offers help in displaying and evaluating the objects being designed. The system is planned to interface with an existing computer-aided design project that emphasizes the structural analysis phase of the design process. The fundamental goal of the project was to incorporate color graphics into the design system while maintaining a high degree of user interaction.
The family binary tree
Authors: Kathleen M. Shockley
Venue: Proceedings of the 1976 annual conference (1976)

Family pedigree data as required by genetics has proven to be difficult to analyze. This paper presents a data collection and structuring technique developed for the program PDGRE, which significantly improves on past computer application performances and produces a binary tree representation for the data. Data is collected in family units, mother, father, and offspring. The units are related by linked lists of those individuals who appear in more than one unit. The algorithm TRANS translates the links from relative pointers to actual memory locations. TRANS also locates those individuals who will be root nodes for the binary tree representations of the pedigree data. Algorithm BUILD creates the binary tree for any root passed to it. Each binary tree represents a subset of the original data set. The subsets prove more suited to analysis than the entire pedigree. The number of subsets is determined by the number of roots located by TRANS. The end result is data represented by a well known data structure at a significantly lower cost than previous applications.
Faculty (Panel Discussion): Recruiting, retraining and retention
Authors: John Beidler
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Why is it so difficult to attract computer science and information systems professionals to academic departments? Why is it so difficult to retain faculty? What does it take to recruit qualified faculty? Can faculty from other areas be retrained and utilized? The purpose of this panel is to discuss these issues and to suggest some possible solutions to these problems.
Space-time tradeoffs and first order problems in a model of programs
Authors: C. K. Yap
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We introduce a model of programs for comparison-based problems. This model gives a measure of space usage and is &ldquo;uniform&rdquo;. We first obtain upper and lower bounds on the selection problems which demonstrate the tradeoffs between time and space. We next introduce the class of first order problems and characterize them semantically. A surprisingly simple classification of first order problems into three complexity classes is shown. Finally we extend the first order problems to the weak second order problems and show that these can be solved in polynomial time by programs in our model augmented with push-down stores.
Computers in the service of man: The computer professional in an alien subculture
Authors: Henry C. Lucas,  Jr.
Venue: Proceedings of the ACM annual conference (1973)

New challenges for the computer professional will result from efforts to apply computers in the service of man. The computer expert may find himself functioning in an alien subculture in which his relationship to members of the organization involved becomes as important as the technical task of systems design. This paper presents a descriptive model of the process of systems development in an unfamiliar environment. The model includes four stages: stimulus, development, implementation and operation. Application of the model is demonstrated by an example of systems design for the United Farm Workers Organizing Committee.
Round robin scheduling in a computer communications system with finite swap time and statistically multiplexed arrivals
Authors: A. L. Dudick, C. D. Pack
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

A study is made of the effect of asynchronous time division multiplexing (ATDM) on the performance of a computer-communications system. The study is based partly on analysis and partly on a simulation of a system model composed of the following subcomponents: 1. an M/D/1 queue for the ATDM, and 2. a &ldquo;round robin&rdquo; processor with finite (nonzero) &ldquo;swap time&rdquo; for the computer. The study is an extension of previous work on the subject which assumed a less general model for the computer and was mostly concerned with the conditions for significant distortion of the arrival process at the computer and an observable change in average total delay for a typical Job. The results include a comparison of the delays encountered by a user request in the system as a whole and in the system subcomponents with and without ATDM. Further, there is a discussion of the effects of varying the parameters of the subsystems on the performance of both the computer subsystem and the computer-communications system as a whole. Finally, there is a warning that in a system with ATDM, under certain conditions, the time-sharing system becomes, effectively, a batch processing system.
ByteLisp and its Alto implementation
Authors: L. Peter Deutsch
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

This paper describes in detail the most interesting aspects of ByteLisp, a transportable Lisp system architecture which implements the Interlisp dialect of Lisp, and its first implementation, on a microprogrammed minicomputer called the Alto. Two forthcoming related papers will deal with general questions of Lisp machine and system architecture, and detailed measurements of the Alto ByteLisp system described here. A highly condensed summary of the series was published at MICRO-11 in November 197815.
A computerized hypertension management system
Authors: George Worm
Venue: Proceedings of the ACM annual conference (1973)

This paper describes a patient management system developed for the Atlanta Hypertension Center. This center is one of fourteen centers established for the assessment of the effects of a rigorous follow-up program on morbidity and mortality resulting from hypertension. This computerized system has been operating since January, 1973, and is being successfully used to store participant information and to provide patient management.
A new statistical model for gate array routing
Authors: Abbas El Gamal, Zahir A. Syed
Venue: Proceedings of the 20th Design Automation Conference (1983)

A new statistical model for routing of gate arrays is described. The model takes into consideration the effect of gate utilization on wiring area requirement. Model computed wiring area estimates suggest that it is better (in terms of area and wire length) to use higher utilization and a relatively large number of tracks than low utilization and smaller number of tracks. This is shown to be consistent with the results of two experiments.
Reducing the bandwidth of sparse symmetric matrices
Authors: E. Cuthill, J. McKee
Venue: Proceedings of the 1969 24th national conference (1969)

The finite element displacement method of analyzing structures involves the solution of large systems of linear algebraic equations with sparse, structured, symmetric coefficient matrices. There is a direct correspondence between the structure of the coefficient matrix, called the stiffness matrix in this case, and the structure of the spatial network delineating the element layout. For the efficient solution of these systems of equations, it is desirable to have an automatic nodal numbering (or renumbering) scheme to ensure that the corresponding coefficient matrix will have a narrow bandwidth. This is the problem considered by R. Rosen1. A direct method of obtaining such a numbering scheme is presented. In addition several methods are reviewed and compared.
Simple multivariate time series for simulations of complex systems
Authors: Peter A. W. Lewis
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Recent work has made the generation of univariate time series for inputs to stochastic systems quite simple. The time series are all random linear combinations of i.i.d. random variables with Exponential, Gamma and hyperexponential marginal distributions. The simplicity of structure of these time series models makes it practical to combine them to model multivariate situations. Thus one can model, for example, alternating sequences of response and think times at a terminal in which response and think times are not only autocorrelated, but also crosscorrelated.
Protection and control of information sharing in multics
Authors: Jerome H. Saltzer
Venue: ACM SIGOPS Operating Systems Review (1973)

This paper describes the design of mechanisms to control sharing of information in the Multics system. Seven design principles help provide insight into the tradeoffs among different possible designs. The key mechanisms described include access control lists, hierarchical control of access specifications, identification and authentication of users, and primary memory protection. The paper ends with a discussion of several known weaknesses in the current protection mechanism design.
Experience with computer science at a two year college
Authors: Philip E. Sticha
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

A little over five years ago Essex Community College moved from its quarters in churches, former barracks, and a local high school to a campus in northeast Baltimore County, Maryland, and began a period of dynamic growth which saw the faculty double twice in two years and the student enrollment grow from less than 2000 to more than 5000 today. With new staff and facilities, Essex began to develop new career programs and to strengthen the two year transfer programs already in existence. This paper relates the situations and experiences of the Division of Science and Mathematics and the Division of Business and Industrial Management in planning and implementing courses and programs in computer science. Discussed in historical order are: the creation of our first programming courses and the selection of computer hardware, the planning of career programs in data processing and computer technology, and the problems expected in implementing these programs and in establishing transfer programs in computer science.
Semantics and axiomatics of a simple recursive language.
Authors: B. Courcelle, J. Vuillemin
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

In this paper, we provide a simple recursive programming language with a semantics and a formal proof system, along the lines of [5], [17] and [23]. We show that the semantics used is the &ldquo;best&rdquo; possible if one admits the validity of Algol's copy rule, and that the proof system is complete with respect to the semantics. The definitions and methods used are meant to provide a basis for a broader theory of program schemas, which models parallel as well as sequential programs.