ppxscal/embedding_network huggingface dataset:
Team dynamics in systems development and management
Authors: Gerard Shabe, Suzanne Peck, Robert Hickey
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

The need for tight project control has long been recognized within the Department of Defense (DOD). Obtaining the greatest possible return on the contract dollar has been the goal of project officers. In the area of software development, interest in achieving efficiency has grown concurrently with a desire to obtain greater reliability in the delivered software packages. This paper discusses the heretofore largely theoretical concepts and techniques of software engineering, Top-Down Structured Programming, the Chief Programmer Team, and the Program Support Library as applied to the team dynamics of a stand-alone software utility produced by Honeywell Information Systems Incorporated, Federal Systems Operations [HIS/FSO] under contract to the Command and Control Technical Center, WWMCCS ADP Directorate (CCTC/WAD), of the Defense Communications Agency.
Effective use of a computer aided design system
Authors: Stephen J. Urban
Venue: Proceedings of the 7th Design Automation Workshop (1970)

At present many firms (large and small) have computer aided design facilities of some sort. However, possession of such facilities does not necessarily imply that they are efficiently utilized. Therefore, it is germane to ask how these facilities can be most effectively used, and what properties the operating system must have to ensure efficacy. This paper discusses these and related questions. The properties discussed are relevant to a wide class of computer aided design systems. Nevertheless to achieve clarity of presentation, these properties are treated in terms of a specific computer aided design system developed by Philco-Ford. However, the discussion applies to computer aided design in general. The properties of a successful computer aided design system are listed below and discussed in subsequent paragraphs: 1. An adequate standards program, which limits the scope of the system to practical proportions, reduces duplication, and provides a communication medium; 2. Program modularity and a general file structure which afford programming ease and speed, and which enhance user flexibility by permitting programs to be run in various sequences; 3. Verification procedures which ensure that the right problem is being solved, and that all design rules and standards are being followed; 4. Communication between those who design the system and those who use it in order to &ldquo;tune&rdquo; system parameters and determine good strategies, and afford continual assessment of capabilities.
Another look at the discrete structures course
Authors: Ronald E. Prather
Venue: ACM SIGCUE Outlook (1976)

Over the last several years since the introduction of B3 (Discrete Structures) into the undergraduate computer science curriculum, the course has been the subject of continuing controversy. The major difficulties later found in implementing the course were easy to foresee from the most casual reading of its original description in Curriculum '68 [1]. The necessary placement of the course in the sophomore year, the relative sophistication of the intended subject matter, and the lack of sufficient preparation of most beginning students in these areas and in appropriate computer science areas of application, all have contributed to problems in the implementation of the ACM Curriculum Committee recommendations. We will discuss each of these problems in turn, and hope to provide new insights toward achieving a satisfactory solution.
An architecture for fault tolerance in database systems
Authors: Fred J. Maryanski
Venue: Proceedings of the ACM 1980 annual conference (1980)

An architecture for fault tolerance in a database management system is based upon the concepts of careful replacement and differential files on multiple media with backup copies available. An algorithm for transaction execution that preserves the highest degree of consistency is presented along with an algorithm for the reorganization of the database. The reorganization algorithm merges the differential file with the original database in an on-line fashion. Thus the database is available continuously, eliminating one of the drawbacks of differential file processing. A detailed simulation model has been implemented as a step toward the verification of the determinancy of the algorithms. In addition, certain performance aspects of the system have been analyzed statistically in order to estimate the overhead in time and space due to the redundancy in the system.
Using Fractal Encoding for Image Indexing
Authors: Riccardo Distasi, Michele Nappi, Maurizio Tucci
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

As already documented in the literature, fractal image encoding can be exploited to obtain good image indexing systems that are able to deal with the images in compressed form, which makes them suitable for use with large databases.The system proposed in this paper has the additional interesting property of being invariant under two classes of pixel intensity transformations. This property makes the system robust with respect to several types of image transformations that can happen in practical applications: the images can be retrieved even in the presence of illumination and/or color alterations. The system can be queried under both the query by sketch and the query by example paradigms.
A process for reducing cluster representations and retrieval costs
Authors: Donald B. Crouch
Venue: Proceedings of the ACM annual conference (1973)

The use of mechanized or partly mechanized procedures for various information storage and retrieval systems has become wide-spread. One area in particular for which automatic procedures are being developed is the library field. The proliferation of publications, especially within the fields of science and technology, has created a growing problem for the scientist, namely, an ever-expanding body of knowledge of which he must not only necessarily be aware but which he must also have readily accessible to his needs. The objective of automatic document processing techniques for large libraries is to assist the researcher in coping with this so-called &ldquo;information explosion&rdquo; crisis by providing rapid relevant responses to his queries.
Matching of 3-D curves using semi-differential invariants
Authors: T. Pajdla, L. Van Gool
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

A method for matching 3-D curves under Euclidean motions is presented. Our approach uses a semi-differential invariant description requiring only first derivatives and one reference point, thus avoiding the computation of high order derivatives. A novel curve similarity measure building on the notion of /spl epsiv/-reciprocal correspondence is proposed. It is shown that by combining /spl epsiv/-reciprocal correspondence with the robust least median of squares motion estimation, the registration of partially occluded curves can be accomplished. An experiment with real curves extracted from 3-D surfaces demonstrates that curve matching can be successfully performed even on data from a simple and cheap 3-D sensor.
Operational aspects of design automation for the IBM 3081
Authors: Robert F. Woodward
Venue: Proceedings of the 19th Design Automation Conference (1982)

The processes for design and release of LSI chips, thermal conduction modules (TCMs), and boards on the IBM 3081 Processor are highly automated, using the Engineering Design System. This paper describes the automated and manual operations involved in the process of design and release of the various packaging levels to Manufacturing for fabrication and test. The Engineering Design System (EDS) includes a data base of programs and rules for the operations involved in designing and documenting a product. The design system contains all rules, definitions, and programming requirements for system design and complete data transfer to Manufacturing and testing.
An adaptive policy driven scheduler
Authors: Joseph C. Sharp, James N. Roberts
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

The theory of policy driven schedulers (Ref. [1]) is extended to cover cases in which the scheduling parameters are allowed to adapt dynamically as the system's job load varies. The system under consideration offers batch, time sharing and limited real time services. Data from simulated and live loads are presented to evaluate both the static and the adaptive schedulers. A policy driven scheduler makes its decisions with respect to a set of policy functions, fi(t). Each of the policy functions corresponds to a different type of user and specifies the amount of computing resources that the system will try to give a user in that group within a given total amount of elapsed time. It is found that the policy functions must be set conservatively in order to avoid response problems during periods of heavy load, but that during more lightly loaded periods the conservative settings result in widely disparate rates of service to similar jobs. One solution is to vary the policy functions as the job load changes. A dynamic algorithm is presented that maintains responsiveness during heavy loads and provides fairly uniform service rates at other times.
Micro chaos in the 1980's - can we prevent it?
Authors: Gerald Estrin, Erancois Anceau, Gina Granata, Kenneth Hales, Jan Witt
Venue: Proceedings of the 4th international conference on Software engineering (1979)

There will be a large population of users who will not want to design programs as we know them but will simply want to add a new piece of software to their library as they would a book, a phonograph record or a game. Can we design such modular, extensible microsystems with a simple transparent user interface? There will be a population of users who want to design and use programs on microprocessors without ever going to a larger shared resource. What languages and programming systems do we forsee to enforce structure in program design and provide tools sometimes needed for optimization? There will be a population of users who need to write programs that behave well and whose systems interface to foreign devices with real time constraints. What supported methodology can we offer, given that we do not do this very well with larger systems? There will be a population of users who want to solve computer limited problems on highly concurrent systems making use of large ensembles of microprocessors. Can we provide languages and software that make such cooperative computing meaningful? Are there any ways in which we can make use of the highly amortized software investments made to satisfy the needs of mass users? The panel participants will make a short position statement and then questions from the panel members and the audience will be considered.
A 3-dimensional representation for fast rendering of complex scenes
Authors: Steven M. Rubin, Turner Whitted
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

Hierarchical representations of 3-dimensional objects are both time and space efficient. They typically consist of trees whose branches represent bounding volumes and whose terminal nodes represent primitive object elements (usually polygons). This paper describes a method whereby the object space is represented entirely by a hierarchical data structure consisting of bounding volumes, with no other form of representation. This homogencity allows the visible surface rendering to be performed simply and efficiently. The bounding volumes selected for this algorithm are parallelepipeds oriented to minimize their size. With this representation, any surface can be rendered since in the limit the bounding volumes make up a point representation of the object. The advantage is that the visibility calculations consist only of a search through the data structure to determine the correspondence between terminal level bounding volumes and the current pixel. For ray tracing algorithms, this means that a simplified operation will produce the point of intersection of each ray with the bounding volumes. Memory requirements are minimized by expanding or fetching the lower levels of the hierarchy only when required. Because the viewing process has a single operation and primitive type, the software or hardware chosen to implement the search can be highly optimized for very fast execution.
Multivariate ranking and selection without reduction to a univariate problem
Authors: Edward J. Dudewicz, Vidya S. Taneja
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

&ldquo;Ranking and selection&rdquo; procedures are statistical procedures appropriate for use in situations where the experimenter's goal is to &ldquo;select the best&rdquo; (selection) or to &ldquo;rank competing alternatives&rdquo; (ranking). These goals are often present in simulation studies, which are often performed in order to select that one of several procedures (for running a real-world system) which is &ldquo;best.&rdquo; (For a discussion of ranking in simulation, see (2).) Most previous work in this area has dealt with situations where either one has a univariate response, or where a simple univariate function of the multivariate response characterizes the &ldquo;goodness&rdquo; of a procedure. (For example, see (3) for an introduction and some procedures especially useful in univariate-response simulation settings, (8) for a comprehensive review of the area, and (4) for a discussion of selection in simulation and related statistical problems and procedures.) In a recent excellent expository book on the area (7), Gibbons, Olkin, and Sobel noted (Chapter 15, p. 390) that &ldquo;The whole field [of multivariate-response ranking and selection] is as yet undeveloped and the reader is encouraged to regard this chapter as an introduction to a wide area that will see considerable development in the future as more meaningful models are formulated.&rdquo; In this paper we outline a selection model recently developed for this multiple-response problem (6) and develop an example of its use and recommendations for its implementation.
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
Authors: Leo J. Guibas, Jorge Stolfi
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We discuss the following problem: given n points in the plane (the &ldquo;sites&rdquo;), and an arbitrary query point q, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites, and then locating the query point in one of its regions. We give two algorithms, one that constructs the Voronoi diagram in O(n lg n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, the Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed to the separation of the geometrical and topological aspects of the problem, and to the use of two simple but powerful primitives, a geometric predicate and an operator for manipulating the topology of the diagram. The topology is represented by a new data structure for generalized diagrams, that is embeddings of graphs in two-dimensional manifolds. This structure represents simultaneously an embedding, its dual, and its mirror-image. Furthermore, just two operators are sufficient for building and modifying arbitrary diagrams.
SYNGRAPH: A graphical user interface generator
Authors: Dan R Olsen,  Jr., Elizabeth P. Dempsey
Venue: ACM SIGGRAPH Computer Graphics (1983)

The SYNGRAPH system automatically generates graphical user interfaces. It generates interactive Pascal programs from a description of the input language's grammar. From the grammar it deduces information about how to manage both physical and simulated devices, and how prompting and echoing are performed. Input errors are detected, and can be corrected using automatically provided rubout and cancel features. The natural integration of application specific semantics into the system is also shown including appropriate semantic recovery from input errors.
The minimum width routing of A 2-row 2-layer polycell-layout
Authors: Tatsuya Kawamoto, Yoji Kajitani
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper presents a new routing principle that leads to an algorithm to realize the minimum width of the 2-layer channel area between two rows of terminals to be interconnected. Besides the theoretical results, practically applicable routing algorithms based on our principle are developed.
Race analysis of digital systems without logic simulation
Authors: Richard A. Harrison, Daniel J. Olson
Venue: Proceedings of the 8th Design Automation Workshop (1971)

Critical timing races (hazards) are a potential problem in digital systems consisting of a large number of interchangeable modules and replaceable integrated circuits. These hazards can be minimized by careful design procedures and reviews but will still exist due to system complexities. Systems have been proposed for simulating digital networks based on a time-sequenced logical tracing, but these systems require much host computer time and input stimuli to thoroughly exercise the system. The basis of the proposed race analysis system is that all critical races result in an improper flip-flop state. Each flip-flop input is traced, from logic element out-put to input, accumulating delays. Two basic algorithms are required and described to locate the racing of parallel paths on flip-flop inputs. This system requires minimal user inputs and can perform either a statistical or worst case race analysis.
A comparison of three methods of modeling input distributions
Authors: Stephen C. Hora
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

Three methods of estimating the inverse of a continuous cumulative distribution function for the purpose of random deviate generation are discussed. These methods are 1) the empirical approach, 2) the maximum likelihood approach, 3) a newly developed regression based estimation procedure. Analytic results are obtained which permit comparisons of the accuracies of each of these methods under alternative assumptions about the underlying distribution. Expressions for the variance of each estimate at any given quantile of the random variable are provided. A demonstration of the procedures is given using data from the outer continental shelf oil and gas lease program.
Psychological self-image of the systems analyst
Authors: Lin Gingras
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

This paper presents results obtained in two research studies dealing with the psychological characteristics and traits of computer systems designers and analysts in an actual working environment, i.e., analysts and designers who designed and implemented real systems. The objective of the studies was to investigate the psychological self-images of the computer systems specialists and compare those images with the specialists' images of the ideal user of the systems, i.e., their image or perception of the ideal managers who should be using the data and reports generated by their systems. The first part of this paper briefly examines the implications of the psychological characteristics of the analysts and designers for the design of computer systems; the second part presents and elaborates the results obtained in the two studies.
A simulation model of the New York city fire department: Its use in deployment analysis
Authors: Grace Carter, Edward Ignall, Warren Walker
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper describes a simulation model developed as a tool to aid deployment decision-making for the New York City Fire Department. The model, written in Simscript I.5, has been used to evaluate alternative solutions to workload and response problems plaguing the City. These solutions involve new policies for locating, relocating and dispatching fire-fighting units to achieve a more effective utilization of resources. Several specific applications of the simulation are described. In addition, methodological issues concerning the design and use of the model are addressed.
A data management system for a small computer
Authors: Bill Hays, Gordon Stokes, Jim Johnson
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

A data management system for a small computer is presented, including essential algorithms and techniques for implementation. The purpose of this system is to provide high level creation, maintenance, retrieval and updating capabilities for data in a master file residing on systems with limited hardware resources. This system includes the capabilities of data management operations and a query language. The algorithm and implementation details are based upon actual development of a data management system. It is designed as a facility for the reporting of data from a master file. However, the integration of data and associated benefits available in a complete data base management system [Ross 1978] is not achieved.
Designing and implementing an array theory incorporating abstract datatypes
Authors: James T. Kajiya
Venue: ACM SIGAPL APL Quote Quad (1983)

We describe a variant of More's array theory which has an extra function we call promotion. This function effects an abstract datatype facility very similar to Smalltalk classes. We discuss how the addition of promotion solves some programming language design issues not addressed by standard array theory as well as extending the expressive power of array theory. Finally we discuss how the inclusion of classes simplifies the implementation of not only array theory but also present day APL interpreters as well.
Error recovery in systems of communicating processes.
Authors: A. Ciuffoletti
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper deals with some of the relevant problems concerning the backward recovery of autonomous processes. The tools for the description of the past history of a system are formally defined, and an implementation is outlined.
Computer design: Applications of redundancy to improve the accuracy of binary systems
Authors: E. J. Farrell
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE ACCURACY of a data-handling system which is vulnerable to random errors can be measured by several parameters: Variance of the output about the correct output, the probability of the output being within a specified interval about the correct output, the probability of obtaining the correct output, etc. The parameter one selects depends on the system being considered and its application. The accuracy of a system can be improved by introducing redundant subsystems to give extra outputs for error detection and correction. As a result of recent electronic developments, making a subsystem doubly or triply redundant need not double or triple the cost of the subsystem; making three microtronic circuits may be only a little more expensive than making one.