ppxscal/embedding_network huggingface dataset:
Analysis of error processes in computer software
Authors: Norman F. Schneidewind
Venue: Proceedings of the international conference on Reliable software (1975)

A non-homogeneous Poisson process is used to model the occurrence of errors detected during functional testing of command and control software. The parameters of the detection process are estimated by using a combination of maximum likelihood and weighted least squares methods. Once parameter estimates are obtained, forecasts can be made of cumulative number of detected errors. Forecasting equations of cumulative corrected errors, errors detected but not corrected, and the time required to detect or correct a specified number of errors, are derived from the detected error function. The various forecasts provide decision aids for managing software testing activities. Naval Tactical Data System software error data are used to evaluate several variations of the forecasting methodology and to test the accuracy of the forecasting equations. Because of changes which take place in the actual detected error process, it was found that recent error observations are more representative of future error occurrences than are early observations. Based on a limited test of the model, acceptable accuracy was obtained when using the preferred forecasting method.
Operations on doubled binary pictures
Authors: R. L. Stafford, S. J. Walljasper
Venue: Proceedings of the ACM annual conference (1973)

A doubled binary picture can be obtained from a &ldquo;normal&rdquo; binary picture by replacing each element in the &ldquo;normal&rdquo; picture by four elements. Doubled pictures exhibit a variety of special properties. For example, classical border following techniques always produce simple closed curves in doubled pictures. Also, if a doubled picture is subject to thickening and thinning operations, the resulting picture is also a double picture. These properties can be used to achieve a variety of effects. It is possible to derive a &ldquo;contour map&rdquo; from a doubled picture by successively 1) thickening or thinning the picture and 2) locating the closed curve that represents the boundary. This contour map leads to an efficient algorithm for determining the effect of thickening and thinning operations on the topological structure of the picture. In addition, the doubled picture provides a convenient data structure for defining a variety of picture skeletons. By exploiting the relationships between descrete and continuous skeletons, a connected skeleton for descrete pictures is easily derived.
TinyTalk, a subset of Smalltalk-76 for 64KB microcomputers
Authors: Kim McCall, Larry Tesler
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

Smalltalk-76 is an interactive, object-oriented programming language. Several versions of Smalltalk-76 have been implemented on minicomputers with 128K bytes or more of RAM, a swapping disk, a high resolution bit-mapped display, and a pointing device. The programming environment includes over a hundred classes, thousands of methods, and thousands of other objects. Applications programs typically define a dozen or more classes and a hundred or more procedures, and they may create thousands of additional objects. We have implemented TinyTalk on a microcomputer containg an Intel 8086 and 64K bytes of RAM. Most memory space is occupied by the interpreter, storage manager, and standard class library (including an incremental compiler and an interactive source language debugger), leaving approximately 8K bytes of free space for user programs&mdash;about two or three pages of source code.
Borel sets and circuit complexity
Authors: Michael Sipser
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

It is shown that for every k, polynomial-size, depth-k Boolean circuits are more powerful than polynomial-size, depth-(k&minus;1) Boolean circuits. Connections with a problem about Borel sets and other questions are discussed.
Maintenance reliability models
Authors: Richard E. Barlow, Carsten Boe, Tor Heimly, Tor-Chr. Mathliesen, Aridaman K. Jain, V. P. Sobczynski, C. J. Pearson
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Three models are presented in which stochastic simulation models are used to construct simulations of systems composed of unreliable components. The releability of the resultant systems is inferred from behavior of these simulation models.
Dynamic Supervisors - their design and construction
Authors: D. H. R. Huxtable, M. T. Warwick
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

The paper demonstrates the technology necessary to bring the facilities of Supervisor construction and modification to the level at which a user can, without a great deal of research and analysis modify his installation's Operating System The Supervisor is seen to be a set of processes linked by a formalised control mechanism.
Motion estimation with quadtree splines
Authors: R. Szeliski, Heung-Yeung Shum
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

This paper presents a motion estimation algorithm based on a new multiresolution representation, the quadtree spline. This representation describes the motion field as a collection of smoothly connected patches of varying size, where the patch size is automatically adapted to the complexity of the underlying motion. The topology of the patches is determined by a quadtree data structure, and both split and merge techniques are developed for estimating this spatial subdivision. The quadtree spline is implemented using another novel representation, the adaptive hierarchical basis spline, and combines the advantages of adaptively-sized correlation windows with the speedups obtained with hierarchical basis preconditioners. Results are presented on some standard motion sequences.
Continuing education of systems personnel: Improving communication across functional boundaries
Authors: Edward Schulman
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

In the past few years the data processing industry has made many attempts to increase program quality and programmer productivity. The primary target has been the lack of meaningful communication across functional boundaries within the general data processing environment. These boundaries are defined with respect to the functional areas which they separate. Attempts at buffering these technical mismatches are explored. The conclusion is drawn that barriers are not just of a technical nature, but also are caused by a general lack of understanding, empathy, and trust for people outside of one's own functional area. The author suggests that efforts to enhance the &ldquo;socialization process&rdquo; compose the necessary first step to improving communication across these functional boundaries.
Efficient reducibility between programming systems (Preliminary Report)
Authors: Nancy A. Lynch, Edward K. Blum
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

Much of the research on semantic theories has concentrated on qualitative properties such as definability (of such programming concepts as recursive procedures), equivalence (of different language constructs), and verifiability (of the correctness, or consistency, of one expression relative to another). Current qualitative theories are in a tentative state and much remains to be done. However, there is also a quantitative side to semantics. Indeed, many of the questions which any semantic theory must answer are at once qualitative and quantitative. We would like to draw upon complexity-theoretic techniques to answer such questions. We are currently working on the development of new algebraic constructs to provide a mathematical framework for both qualitative and quantitative analysis of semantic problems.
A do-it-yourself instant compiler.kit
Authors: R. J. Abbott
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

The theory of compiler-compilers is well known. Here we present a small collection of SNOBOL subroutines which make the SNOBOL pattern matcher a self-documenting instant compiler. All one need add are the syntax productions (as simple SNOBOL patterns mimicking BNF) and the associated (synthesyzing) semartic transformation in the form of arbitrarily simple SNOBOL programs. The resulting compiler produces a complete (or partial at the us&eacute;r's discretion) trace of the parse showing how the syntax matches or fails to match the input. After a match is achieved, the semantic rules are executed on the resulting parse tree. The execution of these rules too are optionally traced so that one has a full picture of just which transformations were performed at each node of the tree. Finally the parse tree is printed.
Monte Carlo simulation of system reliability
Authors: Thomas L. Fagan, Myron A. Wilson
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A number of authors have considered the problem of synthesizing an interval estimate of system reliability from component test data, test time and number of failures. Among those who have treated the topic analytically are Lipow; Springer and Thompson; Lindstrom and Madden; Garner and Vail; Nishime, Conner and Wells; Madansky, Dempskey, and Rubenstein. 1-10 In this brief working paper we present a Monte Carlo simulation procedure which enables synthesis of the probability distributions of reliability parameters where the components are individually exponential. Confidence limits are interpreted as percentiles of the system distribution. The technique permits testing, comparison and verification of the analytical methods cited above.
Application of the CAMPUS simulation models to the major planning decisions of a large university
Authors: Jack B. Levine
Venue: Proceedings of the second conference on Applications of simulations (1968)

Administrative planning and budgeting procedures within universities usually center around an argumentative pie-cutting process. Various factions argue their case for incremental increases in their budgets by moving from general statements of objectives to very specific requests for additional resources. Lack of a formal link between these two extremes makes it virtually impossible for senior administrative bodies to assay the justification of the request. An exploration and structuring of this middle ground between generalized objectives and specific resource requests must be undertaken if colleges and universities are to meet the mounting pressures on them to use their resources wisely. Educators will have to be more systematic in deciding on the physical and financial needs of new or expanded institutions, justifying budget requests to governments, foundations, etc. and allocating funds to competing users within the institution. CAMPUS (Comprehensive Analytical Methods for Planning in University Systems) is an attempt to close this gap. CAMPUS, under development since 1964 at the University of Toronto, is composed of three integrated components.
Automatic optical design with accos v program
Authors: Max Amon
Venue: Proceedings of the 14th Design Automation Conference (1977)

Many automatic optical design computer programs have been in operation for some time. Little in the way of complex optical system design is done without the aid of one of these programs. ACCOS V is a program used extensively at Martin Marietta for this purpose. It is a real-time program using interactive graphics terminals operating in a time-sharing system. With it a designer is able to characterize optical elements, array them, examine the results on a CRT screen, and modify the system interactively. This paper describes how the system is used, its virtues, limitations, and possible future growth potential from a user's point of view.
Computer-based courses(Panel Discussion)
Authors: Kenneth Bowles, Patrick Suppes, Robert Noel
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This session will be concerned with undergraduate courses which employ the computer, in a substantial Way, as a learning medium. The session participants will each describe one ongoing course which makes extensive use of the computer, showing the role played by the computer in the student learning system provided in the course.
Implementing the ISO-OSI reference model
Authors: R. Popescu-Zeletin
Venue: Proceedings of the eighth symposium on Data communications (1983)

The ISO-OSI reference model was the design framework for the implementation of a heterogeneous network in a local environment. The HMINET-2 is a network based on standards in data communication. The paper focus on the OSI model feasability and outlines the encountered problems and the adopted solutions in the network design and implementation.
A marketing approach utilized in the designing of a computer model of a rail passenger transportation network
Authors: Newell Chiesl
Venue: Proceedings of the 12th conference on Winter simulation (1980)

A computer model of a rail passenger transportation network is presented. The model uses marketing information for its primary data base. The model develops a fast track route and a regular track route between terminal nodal metropolitan areas.
Simulation of some autoregressive Markovian sequences of positive random variables
Authors: A. J. Lawrance, P. A. W. Lewis
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

Methods for simulating dependent sequences of continuous positive-valued random variables with exponential, Gamma, mixed exponential and uniform marginal distributions are given. In most cases the sequences are first-order, linear autoregressive, Markovian processes. A two-parameter family of this type with exponential marginals is defined and its transformation to a similar multiplicative process with uniform marginals is given. It is shown that for a subclass of this two-parameter family extension to mixed exponential marginals is possible, giving a model of broad applicability for analyzing data and modelling stochastic systems. Efficient simulation of some of these schemes is discussed.
A simulation of the operations of an illegal numbers game
Authors: David L. Rados
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

The question of legalized gambling has arisen in recent years to pique the interest of the American public. Most proposals for legalization stem from beliefs that existing prohibitions against gambling are not enforced and are perhaps unenforceable, and that the public will accept heavy taxes on such a venture, as they accept &ldquo;sin&rdquo; taxes on cigarettes, liquor, and horse racing. The topic at issue in this paper is a legalized numbers game (1).
A defense view of software engineering
Authors: William A. Whitaker
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The Department of Defense is engaged in a number of management initiatives to improve the cost and quality of Defense software systems. A new DoD Directive 5000.29 provides guidelines for management and technology to promote software engineering in the DoD. A major Defense-wide initiative is a thrust toward common programming languages. An HOL Working Group has set unified requirements for DoD languages and in evaluating existing languages against these requirements. Interim common languages are being set. The eventual goal is a minimal number of common high order programming languages for Defense systems. These will be provided with rigorous control and extensive support facilities.
An on-line question-answering systems with natural language and pictorial input
Authors: L. Stephen Coles
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Various approaches have been employed in the design of question-answering systems with natural language input. An excellent survey of such systems can be found in Simmons.1 A more recent and critical survey of data-retrieval systems prepared by Kasher points out what he considers to be some of the major weaknesses of previous work. One of the problems cited by Kasher is the difficulty of dealing with the inherent ambiguity of natural language. In this paper we will propose a technique for dealing with syntactic ambiguity that involves the use of a restricted semantic universe of discourse. The universe of discourse is defined by means of a graphic display console. We will show by means of an example taken from the area of electrical circuits how this technique can be used to resolve syntactic ambiguity.
Government interest and involvement in design automation development (Panel Discussion)
Authors: Jonathan Allen, Robert Dutton, John Gould, Charles W. Gwyn, Paul Losleben, Dan Nash, Lawrence Sumney, Wayne Spence
Venue: Proceedings of the 18th Design Automation Conference (1981)

The state of the art in design automation is a key to the effective utilization of the increasing density and functional complexity attainable on a &ldquo;chip&rdquo; today. The Department of Defense's Very High Speed Integrated Circuits (VHSIC) program is targeting a density-speed product of 1 &times; 1013 Gate-Hz/CM2 by the late 80's. Commercial developments are also achieving greater and greater densities. That the problems of design have been greatly exacerbated by the present and anticipated VLSI densities is well documented in the technical literature. The DAC panels in 1979 and in 1980 focused upon design automation and VLSI in the 80's. The questions before this panel center upon the role of Government in acceleration of design automation development and whether or not commercial development of design automation capability for VLSI can keep pace with Government requirements. The attached outline (Figure 1) provides an overview of the many facets related to the depth and breadth of the Government's interest and potential involvement in the development of design automation capability. The panelists have been asked to submit a short position paper and prepare a five-minute explanation of their views.
Construction of econometric planning models for business units
Authors: Robert K. Perdue
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

This paper describes a method for constructing econometric planning models that can translate macroeconomic information into projected income statements for each of a corporation's various business units. Each business unit is modeled by equations expressing historical relationships between micro variables of interest (sales, various costs, net income) and their macro and/or internal determinants. The text provides guidelines for designing a model structure, specifying and estimating major equations, and using the model.
Optimizing delayed branches
Authors: Thomas R. Gross, John L. Hennessy
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

Delayed branches are commonly found in micro-architectures. A compiler or assembler can exploit delayed branches. This is achieved by moving code from one of several points to the positions following the branch instruction. We present several strategies for moving code to utilize the branch delay, and discuss the requirements and benefits of these strategies. An algorithm for processing branch delays has been implemented and we give empirical results. The performance data show that a reasonable percentage of these delays can be avoided.
A new stochastic projection-based image recovery method
Authors: D. Schonfeld, Yi Qiao
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

The method of projections onto convex sets has been used effectively in the solution many important signal and image processing applications. This method however fails in circumstances when the desired constraints form non-convex sets. A new approach to image recovery based on a stochastic projections method is presented. At its core the method relies on the iteration of projections onto closed sets (not necessarily convex). A stochastic parameter is used to update the projections among the images in their neighborhood subsequent to each iteration. Computer simulation experiments are used for the comparison of the stochastic projections with several existing methods to signal recovery for phase-from-magnitude image restoration.
JANUS: An interactive system for document composition
Authors: Donald D. Chamberlin, James C. King, Donald R. Slutz, Stephen J.P. Todd, Bradford W. Wade
Venue: ACM SIGPLAN Notices (1981)

This paper describes the architecture of a proposed document composition system named JANUS, which is intended to provide support for authors of complex documents containing mixtures of text, line art, and tone art. The JANUS system is highly interactive, providing authors with immediate feedback and direct electronic control over page layouts, using a special two-display workstation. Authors communicate with the system by marking up their documents with high-level descriptive &ldquo;tags&rdquo;. A tag definition language is provided whereby new tags may be defined and the format of each tagged object may be controlled.
Breuer's grow factor algorithm in computer algebra
Authors: J. A. van Hulzen
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Computer algebra can be of importance in solving electrical network synthesis problems. It enables to generate automatically FORTRAN-programs needed to solve the underlying systems of nonlinear multivariate polynomial equations. Such systems are obtained by equating the numerical target function and a symbolically computed equivalent. Breuer's grow factor algorithm is extended not only to eventually improve the result of required determinant calculations, but also to optimize FORTRAN-code describing the system and the associated Jacobian. It is indicated how this common subexpression search approach can be extended.
Comments on computer center policy
Authors: Jim McDonald
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

Several years ago we started teaching a beginning FORTRAN programming course, and, having no computer of our own, we used the University of South Dakota, which is about 45 miles away. This meant that I had to reserve the college station wagon and drive five or six students at a time so they could take programming. Later we got some organizations in town to lend us their computers, but these computers were only available at inconvenient times, and they would just as soon bump us off then as any other time. So we wound up back at the University of South Dakota. Eventually, I got tired of driving and said, &ldquo;I Just want to teach mathematics, and I don't want any more to do with the computer.&rdquo; At that time the National Science Foundation began a program, the College Science Improvement Program, and someone pointed out to me that we might be able to get some money to get a computer of our own. Along with several other faculty members, I wrote a proposal to do this. It was during the first four months after the institution of this program, and I guess the NSF found out they were swamped with people who wanted computers. They moved into the Office of Computing Activities, and our particular draft was one of the first to go in there. Somebody made the remark yesterday, I believe, that it helps if you're first, and I think that's right. We were proposing an academic computer center; we were proposing that we buy an 1130, which we eventually did. We were visited by the NSF, and we did get a &dollar;45,000 grant to help us buy the computer.