ppxscal/embedding_network huggingface dataset:
On the connections between range of variable and control structure testing
Authors: Hermann Kopetz
Venue: Proceedings of the international conference on Reliable software (1975)

This paper discusses the subject of systematic program testing from a software engineering point of view. A number of different software error types are defined to facilitate the analysis of the error detection capability of a software module. It is found that many practical programs are, at best, conditionally Correct. Consequently it is not possible to establish the correctness of such a program even by an exhaustive test of the control structure. Keeping those insights in mind, some applicable techniques for the construction, error treatment and test of practical software systems are presented.
On the complexity of the Maximum Subgraph Problem
Authors: John M. Lewis
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

For a fixed graph property, the Maximum Subgraph Recognition Problem for the property is: Given a graph G and integer k, does G have a subgraph induced by k vertices which satisfies the property. This paper studies the complexity of this problem for various properties. The principal result is that if the property is any one of a wide class of monotone properties, the Maximum Subgraph Problem is NP-hard. This suggests a promising direction of inquiry into the P &equil; ?NP question.
Simulation of packet-switching networks controlled on isarithmic principles
Authors: W. L. Price
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

An account is given of simulation experiments on an isarithmically controlled packet-switching network. The isarithmic principle (a method of congestion control by placing an upper limit on the number of data packets in transit at one time) has been developed in such a way as to minimise the amount of &ldquo;empty&rdquo; packet traffic, whilst retaining much of the flexibility of the original concept. It is suggested that one of the important performance measuring criteria is the average time spent by traffic in awaiting admission to the network; it will be shown how this time can be minimized by best choice of the number of packets permitted to be in transit at one time and of the length of queues of &ldquo;empties&rdquo; awaiting traffic. It is further suggested that the performance (measured in terms of throughput rate and end-to-end delay) of the network being studied (a ladder-shaped network of 18 nodes and 31 links) is not improved by applying adaptive routing, though some form of this must be provided to cope with fault conditions.
Interactive operating systems for small computers (Panel Discussion)
Venue: Proceedings of the ACM '81 conference (1981)

With ever more capacity and resources being made available in the contemporary small computer, the issues of operating systems and their interactions with people take on new importance. No longer is the cryptic and puzzling interaction a requirement of hardware capabilities. New capabilities for desk top computers require that we take the position that the most important feature of its operating system software design is the user's interaction environment. The high computational bandwidth and display resolution of today's small computer is rapidly increasing. The older style of operating system interactions which ignore this capability are rapidly becoming obsolete.
Unsupervised Multiscale Image Segmentation
Authors: A. H. Kam, W. J. Fitzgerald
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We propose a general unsupervised multi-scale feature-based approach towards image segmentation. Clusters in the feature space are assumed to be properties of underlying classes, the recovery of which is achieved by the use of the mean shift procedure, a robust non-parametric decomposition method. The subsequent classification procedure consists of Bayesian multi-scale processing which models the inherent uncertainty in the joint class and position domains via a Multi-scale Random Field model. At every scale, the segmentation map and model parameters are estimated by sampling using Markov Chain Monte Carlo simulations. The method is applied to perform color and texture segmentation with good results.
Formal description of processes&mdash;the first step in design automation
Authors: A. D. Falkoff
Venue: Proceedings of the SHARE design automation project (1965)

The formal description of objects is well known and has long been standard practice in many fields. Machine parts, for example, are commonly described by engineering drawings made according to standards which have nearly universal acceptance. The problem of design automation is to take such a description of an object, combine it with information about manufacturing methods and facilities, and automatically generate a formal description of a process which will produce the desired object. In a simple case this may mean no more than generating a tape for a numerically controlled machine tool, while in more complex cases it may require, as intermediate steps, the generation of parts lists and the design of subassemblies.
Comet - a fast component placer
Authors: Valerie K. Smith, Robert J. Smith,  II, Phil A. Preston
Venue: Proceedings of the 17th Design Automation Conference (1980)

Classical Unconnected Set (UCS) and other iterative placement improvement algorithms may converge slowly toward desirable component arrangements. This paper discusses mechanisms that inhibit convergence, then proposes techniques for accelerating rate of improvement. A placer incorporating these procedures is described, and experimental results demonstrating effectiveness of the approach are given.
Numerical experimentation with routines for solving nonlinear systems of equations
Authors: D. L. Kalmey, D. S. Kerr, L. J. White
Venue: Proceedings of the ACM annual conference (1973)

The results of numerical experimentation designed to test some existing routines (Newton, Secant, Brown, Powell, Broyden, and others) for solving nonlinear systems of equations are reported. The design of the testing procedure as well as the characteristics of the testing problem set are described. The methods are compared with respect to several efficiency measures and domains of convergence. Depending on the characteristics exhibited by a given nonlinear system, an indication is given as to which method is best suited for solving the given problem.
The design of a data base organization for an electronic equipment DA system
Authors: Ietoshi Kawano, Hiroshi Fukushima, Takeshi Numata
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper presents the design of a data base organization for an electronic equipment design automation system. First, the requirement for the data base file will be summarized. Then, the logical structure the authors see to be the solution to this particular problem will be developed and demonstrated. Topics on the physical implementation of the file are presented next. Performance analyses are illustrated, and the limitations of the present state of the art in data base technique will be summarized in the conclusion.
Design/synthesis workshop session
Venue: Proceedings of the 20th Design Automation Conference (1983)

Automatic logic synthesis is the generation of system design directly from system specification. It deals almost entirely with digital systems. With Very Large Scale Integration (VLSI), the human system designer is being pushed to his limits, so the challenge lies in having computers assume all the decision making, trade-off analyses, and general conceptual fitting that is involved in creating complete system designs. Logic synthesis is founded mostly on creative thinking, which is a &ldquo;human&rdquo; process. Ergo, logic synthesis, the computer aid, can be useful to keep creative people busy when contract work is at a low point. Many approaches have been tried in logic synthesis. Some of them are capable of being productive. This panel comprises much of the current thinking, speculating, and ruminating in the field. It is expected that workshop attendees will have something to say of significance, and so add to the results of the session.
Straight-line program length as a parameter for complexity measures
Authors: Nancy A. Lynch
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

This paper represents a continuation of work in [LBI] and [LB2] directed toward the development of a unified, relative model for complexity theory. The earlier papers establish a simple, natural and fairly general model, and demonstrated its attractiveness by using it to state and prove a variety of technical results. The present paper uses the same model but deals more specifically with the problems involved in stating complexity bounds in a usable closed form for arbitrary operations on arbitrary data types. Work currently in progress is directed toward similar unified treatment of complexity of data structures.
Computer-assisted software testing
Authors: Robert V. Fultyn
Venue: Proceedings of the ACM '82 conference (1982)

Obtaining appropriate coverage of functionality while attempting to test software products frequently becomes a troublesome issue to the party responsible for performing the tests. A method that formally specifies the &ldquo;language&rdquo; of the software subject being tested and also utilizes some aspects of Monte Carlo simulation techniques for automatic test case selection is described. Metrics useful for attempting to objectively describe quality aspects of the testing exercise are also discussed.
Two-way communication between User Services and Systems programmers
Authors: Thea D. Hodge
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Communication between the User Services Systems and the Systems Software Groups at the University of Minnesota Computer Center is good: not perfect, but more than adequate. Our center staff is relatively stable so that we have had time over a period of years to build up workable communication .to be satisfactory. Procedures will be described.
SICSOFT (Paper Session)
Authors: B. M. Leavenworth, Raymond J. Hookway, George W. Ernst, T. A. Standish, D. F. Kibler, J. M. Neighbors
Venue: Proceedings of the 1976 annual conference (1976)

&ldquo;How to produce efficient and error-free software?&rdquo; is the theme of this session. There will be three papers presented, each describes the result of a current research effort. In the first paper, a testing and debugging methodology which exploits certain properties of a very high level language is presented. The second paper describes a system for verifying correctness of programs. In the third paper, it is shown that the performance of a program can be improved through program manipulation.
GOFER: A system for evaluating projects in the petroleum industry
Authors: Frank B. Arthur
Venue: Proceedings of the eighth international conference on APL (1976)

This paper describes an APL program for evaluating investment projects in the oil and gas industry. It discusses the financial issues and the programming considerations involved.
An automated procedure for developing hybrid computer simulations of turbofan engines
Authors: John R. Szuch, Susan M. Krosel, William M. Bruton
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

This paper offers a systematic, computer-aided, self-documenting methodology for developing hybrid computer simulations of turbofan engines. The methodology that is presented makes use of a host program that can run on a large digital computer and a machine-dependent target (hybrid) program. The host program performs all of the calculations and data manipulations that are needed to transform user-supplied engine design information to a form suitable for the hybrid computer. The host program also trims the self-contained engine model to match specified design point information. A test case is described and comparisons between hybrid simulation and specified engine performance data are presented.
The invariant imbedding numerical method for Fredholm integral equations with displacement kernels
Authors: J. Casti, H. Kagiwada, R. Kalaba
Venue: Proceedings of the 1969 24th national conference (1969)

An initial-value formulation for the solution of the Fredholm integral equation u(t) &equil; g(t) + @@@@ k(&brvbar;t&minus;y&brvbar;)u(y)dy is developed, and a feasible computational scheme outlined. Numerical results are given for an equation arising in the study of radiative transfer processes.
The AUGMENT precompiler as a tool for the development of special purpose arithmetic packages
Authors: F. D. Crary, J. M. Yohe
Venue: ACM SIGNUM Newsletter (1979)

We discuss the use of a FORTRAN precompiler in the development of packages for nonstandard arithmetics. In particular, the use of the FORTRAN precompiler, AUGMENT, renders the source code more lucid, reduces the number of lines of code in a nonstandard arithmetic package, facilitates modification, and ameliorates the problems of transporting such a package to another host system.
Requirements statement language principles for automatic programming
Authors: Thomas I. M. Ho
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The first step in automatic programming is the statement of information requirements in a Requirements Statement Language (RSL), a language for stating system requirements without needing to state the procedures implementing the system. The objective of this paper is development of language design principles for an RSL offering extensive requirements statement facilities. This objective is achieved through the formulation of a formal description of an information processing system. The formal description provides the criteria for requirements statement facilities of an RSL and for the capabilities of software for requirements statement analysis.
Curriculum recommendations for a master's program in information systems development
Authors: Robert L. Ashenhurst
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

Comprehensive recommendations for graduate programs in information systems were recently published by the ACM Curriculum Committee on Computer Education for Management. Some aspects of the courses proposed are discussed, from the point of view of integration and interrelation of diverse subject matter streams.
Philo-a VLSI design system
Authors: R. Donze, J. Sanders, M. Jenkins, G. Sporzynski
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes a design system capable of designing chips in the range of 5K to 7K equivalent three-way NOR gates. A key feature of the system is the ability to design chips with large macros (RAMs and PLAs). This design system is part of IBM's corporate-wide Engineering Design System (EDS). EDS provides the capabilities of logic simulation, automatic placement and wiring, checking, and test pattern generation (I). This paper describes the key capabilities of the system, specifically as applied to IBM's silicon gate process. Topics covered include a description of the chip image and circuits, the automatic generation of large macros, the automatic placement and interconnection of circuits and macros, and a delay calculator/optimizer.
State-of-the-Art of graphic software packages
Venue: Specifications on The SIGGRAPH/GSPC Core System (1977)

This report summarizes the activities of the GSPC State-of-the-Art subcommittee. The subcommittee was charged with reviewing and reporting on existing graphics software for line drawing graphics systems. The approach used to develop the survey criteria, format, and data is first described. The second section is a detailed discussion of the comparison criteria as used by reviewers. The next section presents tabulated survey results. Finally, a summary comparing and contrasting the package features is given.
Optimal n-line Successive Over Relaxation
Authors: Olin G. Johnson
Venue: Proceedings of the 1969 24th national conference (1969)

It is well known in numerical analysis that the computation per iteration in n-line S.O.R. for solving elliptic difference equations increases linearly with n whereas the asymptotic rate of convergence increases only with @@@@n3,4. Hence, it has been said 5 there is no reason to use n-line S.O.R. where n is greater than ten, say. In a modern computing environment, however, the situation is not so simple for problems which are larger than core size. Most computers today offer simultaneous &ldquo;read-write-compute&rdquo;, hence the time per iteration cannot be identified with the computation per iteration. A more reasonable optimization technique would be to find the minimum over n of the maximum of compute time, input time, and output time. However, even this technique suffers from the fact that there are trade-offs between these three which can be taken into account. In this paper, we attempt a quantitative determination of optimal n-line S.O.R. in this more complicated setting. The function to be minimized is, of course, machine dependent. It will vary with compute speed, I/O speed, n, and the programming strategy. In section two, we consider a restricted n-line S.O.R. problem in which there is no trade-off between computation and input-output. That is, programming strategy is omitted. In section three, we identify the trade-offs which are allowable, and in sections four and five we consider the problem with programming strategy. Finally, in section six, we apply the results to representative machine configurations.
Implementation of an interactive computer graphics environment at NASA/JSC
Authors: M. S. Lang, R. L. Cohen, K. E. Eschenberg, J. B. Ochs, F. R. Stocker, J. L. Raney, B. F. Stuckey
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

The implementation of visually-oriented software for graphics support on the high-performance computer graphics hardware at NASA's Johnson Space Center is the latest step in the evolution of an interactive computer applications technology being developed by the Computer Graphics Group at The Applied Research Laboratory of Penn State University. This technology is designed to aid the typical scientist or engineer in learning and using computer graphics productively, including writing his own programs and interfacing to software specialists who will write and maintain his programs. Key aspects of the current development include the creation and incorporation of a visually-oriented learning package for graphics geometric perception and graphics programming, as well as a sophisticated control environment which aids the user in obtaining a quick understanding of and access to the system. Preliminary results indicate that this software support can substantially reduce the startup time for a novice graphics user with some background in Fortran.
Automatic program generation for processing a high level relational-like query language
Authors: A. Timothy Maness, Sue M. Dintelman, Mark H. Skolnick
Venue: Proceedings of the 1979 annual conference (1979)

The Genealogical Information System (GENISYS) utilizes automatic program generation to produce query specific access paths and query specific data access programs. The query language of GENISYS along with the ability to include user defined algorithms in the data access programs provide the query facilities of a general data base system, while the use of program generation allows efficient data access.
Funding for experimetal computer science
Authors: Richard Adrion, Larry Druffel, Samuel Matsa, Robert Ritchie
Venue: Proceedings of the 1983 computer science conference (1983)

For almost a decade funding in experimental computer science has faced a problem similar to the weather&mdash;everyone talked about it but no one did anything about it. Fortunately, there are now some signs of relief. Many industrial and government agencies are trying to find effective ways to provide environments in which experimental computer science can thrive in academia. This session brings together two leaders from government, one from industry and one from academia. Each is uniquely qualified to address the issue of funding for experimental computer science. Dr. Adrion heads the National Science Foundation's funding efforts in this area. Dr. Druffel heads the Department of Defense's newly created Software Technology Initiative. Dr. Matsa is a leader in IBM's effort to support extramural research. And, finally, Dr. Ritchie heads the University of Washington's Computer Science Department, which was the recipient of NSF's first experimental computer science award.
SEGMA - A simulation package for conception aid and fault tolerance evaluation of computing systems
Authors: J. L. Paul, R. Troy
Venue: Proceedings of the 13th Design Automation Conference (1976)

The fault tolerance has been defined as the fitness of a system to minimize the probability of appearance of faults and/or to minimize their effects. The design of a computer needs a constant watching of the fault tolerances components, as computer's reaction to failures that has to be forecasted. Some tools may be helps if they are able to: - estimate the fault tolerant components concerned with the application - examine their evolution as a function of the time and environment conditions - estimate the system efficiency in the execute mission's execution.
A technique for assisting researchers in the orderly transfer of information via magnetic tape
Authors: Frederick P. Morrison
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

In our highly mobile society, it is inevitable that researchers will want to transfer information from one computer to another. Two common reasons are: (1) the need to exchange information by individuals at different computer centers, and (2) the need of one individual to transfer his programs and data to a new location or computer or both. These transfers/exchanges are normally done via magnetic tape. At Arizona State University, we have acknowledged the need for a technique for the orderly transfer of information from one computer to another. Consulting assistance is now available to help users convert tapes created on another computer (called stranger tapes) into a form which can be successfully accessed on the university's UNIVAC 1100/42.
Software engineering education: Needs and objectives
Authors: Peter Freeman
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

A report will be made on the results of a one day invitational workshop held at the University of California at Irvine on 9 February 1976. The workshop will have brought together 50 leading educators and practitioners to discuss software engineering education and training: goals, constraints, and methods as seen from different perspectives. Workshop Goals Increased awareness by all of the specific needs for software engineering education and training; a better understanding of the present and future role of software engineers; feedback on current trends in software engineering education; a published record of the workshop including contributed position papers and an abbreviated report of the discussions in order to make the proceedings available to a wider audience.