ppxscal/embedding_network huggingface dataset:
Characteristic errors in programming languages
Authors: J. D. Gannon
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper examines the features of a small ALGOL-like language for characteristic errors. These errors occur in the general use of a language feature, rather than its use in a particular program. Language design and defensive programming are suggested as ways of dealing with these errors. Data collected in observing 33 subjects writing small (43-216 lines), but sophisticated programs demonstrate that these errors are both frequent and persistent in the development of programs.
APL and Halstead's theory: A measuring tool and some experiments
Authors: Timo Laurmaa, Markku Syrjänen
Venue: ACM SIGMETRICS Performance Evaluation Review (1982)

We have designed and implemented an algorithm which measures APL-programs in the sense of software science by M.H. Halstead /1/. The reader is assumed to be familiar with the theories of software science. Our purpose has been to find the best possible algorithm to automatically analyse large quantities of APL-programs. We have also used our measuring tool to make some experiments to find out if APL-programs and workspaces obey the laws of software science or not. Becasue our purpose was to analyse large quantities, i.e. hundreds of programs we have not implemented an algorithm, which gives exactly correct results from software science point of view, because this would necessitate manual clues to the analysing algorithm and thus an interactive mode of analysis. Instead of it we have strived for a tool, which carries out the analysis automatically and as correctly as possible. In the next section some difficulties encountered in the design of the measuring algorithm and some inherent limitations of it are discussed. Section 3 summarises the sources of errors in the analysis carried out by our algorithm, while section 4 gives a more detailed description of the way analysis is carried out. The remaining sections of this paper report on some experiments we have carried out using our measuring tool. The purpose of these experiments has been to evaluate the explaining power of Halstead's theory in connection of APL-programs. However, no attempt has been made to process the results of the experiments statistically. The results of the experiments have been treated here only when 'obvious' (in)compatibilities between the theory and the results have been observed. Possible reasons for the (in)compatibilities are also pointed out.
An implementation of backtracking for programming languages
Authors: Charles J. Prenner, Jay M. Spitzen, Ben Wegbreit
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Primitive operations for backtracking and a technique for their implementation are described. The technique is applicable to all programming languages whose control structure is strictly hierarchical. A general stack model for such languages is presented and a realization of the backtracking primitives is described in terms of this model. The primitives give the user control over which assignments to variables will be 'undone' when backtracking. Moreover, their realization, at each point of choice, does not save the entire current machine state but only a relatively small amount of information sufficient to later reconstruct that machine state. Consequently, the implementation makes efficient use of storage and makes backtracking a practical programming device for dealing with complex problems.
Procurement cycle modeling and simulation
Authors: Victor W. Ruwe
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The objective of this simulation was to ascertain the mean time required to process a procurement action and the variability of this time. A cumulative probability distribution was generated for each step as well as a rejection probability. A Monte Carlo computer program was used to determine the time required to process through the organization and these &ldquo;make time&rdquo; distributions were tested against known distribution for goodness of fit.
An efficient algorithm for determining whether a cubic graph is toroidal
Authors: I. S. Filotti
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

The algorithm of the title is presented. It runs in time bounded by a polynomial in the number of the edges of the graph.
Circuit simulation and timing verification based on MOS/LSI mask information
Authors: Toshiro Akino, Masafumi Shimode, Yukinaga Kurashige, Toshio Negishi
Venue: Proceedings of the 16th Design Automation Conference (1979)

A mask analysis program for MOS/LSI mask layout data has been developed. This program converts all the mask layout data in one chip LSI into the corresponding circuit schema. A partitioning method for the large random logic circuit divides it into small sub-circuits. It is shown that this method takes full advantage of the savings both in computer time and computer storage for the circuit simulation and timing verification of the random logic circuit having more than 500 active devices.
3D Object Recognition by VC-Graphs and Interactive Constraint Satisfaction
Authors: R. Cucchiara, E. Lamma, P. Mello, M. Milano, M. Piccardi
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We propose a novel approach for recognizing 3D CAD-made objects in complex range images containing several overlapped and different objects. Objects are modeled by a graph whose nodes are surfaces and arcs are surface relations. We propose an object-centered graph model, called Visual Constraint graph (VC-graph), with special visual constraints modeling occlusions between object surfaces. The VC-graph is used for recognizing objects from each possible point of view, instead of evaluating many different single-view graphs. The reasoning engine is based on an original extension of the Constraint Satisfaction Problem (CSP) paradigm, called Interactive CSP (ICSP). CSP requires the acquisition of all surfaces before starting constraint propagation; instead, ICSP guides the acquisition of new surfaces only on-demand, without computing useless information and focussing attention only on significant image parts.
On the BLI-model of program behaviour
Authors: Ilkka J. Haikala, Harri Pohjanlahti
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

The BLI-model of program behaviour is sometimes referred to as an exact measure of the locality structure of the programs. However, only limited experimental data is available of the applicability of the BLI-model. In this paper the characteristics of the BLI-model are studied with relatively large empirical data. References to code segments, data segments and references to paged data segments are used in the experiments. The good coverage percentages reported in earlier studies with data segments, are present in our data also. However, the code referencing behaviour turns out to be totally different. Typically only some 50% of the execution time is covered with BLI's of acceptable length. This is shown to be a consequence of occasional references to segments not belonging to the phase or joining the phase during the phase. The behaviour of paged data segments is typically nearer to the behaviour of the code segments than that of the data segments. The BLI-model is also compared with the VMIN-algorithm. A relatively close correspondence between reasonably long BLI's and the VMIN-sets is observed. In general, the results reported in this paper indicate, that the BLI-model can be used with data segments only, or when information concerning short stable phases of the execution is sufficient.
A mathematical mockup - engine envelope described by computer
Authors: C. H. Borgmeyer
Venue: Proceedings of the 7th Design Automation Workshop (1970)

This paper describes a mathematical mockup developed to give engine and airframe designers a tool faster, more accurate, and far more versatile than the conventional, physical engine mockup. The primary uses of this mathematical mockup at present are to facilitate engine/nacelle integration, component location, and tube design and routing. The program's ability to accept and store many engine and part configurations also gives it many applications in configuration management and maintainability planning. When a complete digital description of an engine has been programmed into a computer, a designer can inspect the engine's surface by selecting cross section, quadrant, or side views displayed on a graphics console or plotted by a numerically controlled drafting machine. A designer can also use the mathematical model in changing an engine's external configuration. Potential interference can be discovered immediately.
An approach to assessment of text handling systems
Authors: R. H. Irving
Venue: ACM SIGOA Newsletter (1984)

Office Automation is of major concern to vendors, to users, and to those academics who study relations between organizations, people and technology. Though technologies such as text processing and electronic mail have become common, other more esoteric systems such as file management, relational data bases and distributed information systems have yet to be widely accepted. Several reasons are offered for this lag. One main reason is the lack of acceptable means for cost justifying office automation technology. Uttal [29] reports that direct cost savings are hard to identify. Despite these difficulties, there have been many attempts to develop cost-justification methods. These range from comprehensive approaches such as those suggested by Bair [3, 4] to very specific methods such as those suggested by Boczany [7]. One of the main reasons that justifications are hard to develop is the difficulty in modeling the effects of these new systems in terms of productivity and effectiveness.
Search decision application to in-process inventory balance simulation
Authors: William J. Maddocks
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

Planning and scheduling resources and capabilities in order to minimize in-process inventories in the context of a semi-automated, multi-branch assembly line can be realized through simulation methodology. A desirable refinement relates to the selection of the best combination and also in determining when further search efforts are no longer warranted. A GPSS model supported by search logic and decision rules is examined in this paper.
Topics in design automation data bases
Authors: Dan Nash
Venue: Proceedings of the 15th Design Automation Conference (1978)

Within the last few years more and more organizations are using data base technology to manage large amounts of information. Design automation organizations are no exception. This paper discusses the application of data base technology to the field of design automation. This includes an examination of file versus data base management systems; control and integrity of design automation data; and the impact of data bases on design automation and corporate organization.
Iterative realization of multivalued logic systems
Authors: Vason P. Srini
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

The realization of multivalued combinational functions and sequential machines by using arrays of one type of cells is considered. The algebra used for the multivalued logic system has two binary operations and a set of unary operations. Each of these operations is realized by a cellular array. The cells are combinational and implemented by using binary logic gates. The cells are also designed so that all unrestricted multiple faults in arrays of these cells are detectable. Multivalued combinational functions, storage elements and sequential machines are realized by interconnecting the arrays realizing the operations.
The simon fraser one track universal curriculum for computing science
Authors: T. D. Sterlling, J. J. Weinkam
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

Almost every academic discipline has some potential applicability to any other field of endeavor we might consider. However, there are three disciplines that share the distinction that they are widely applied in virtually every field of human endeavor. In order of seniority, there are: Mathematics, Statistics and Computing Science. We wish to consider the problems that this situation creates with respect to how these subjects should be taught to a wide selection of students and how a curriculum can be constructed to appeal to a diversity of backgrounds and needs.
User microprogrammability in the HP-21MX minicomputer
Authors: W. Gordon Matheson
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The design of a versatile and economical microprogrammable minicomputer is discussed, as embodied in the new HP-21MX computer family. These machines emulate the 2100 line efficiently, yet have a powerful microcode which allows ease of user-microprogramming. 3K words of Control Store addressing space are available for adding special HP firmware options and/or user-generated machine instructions. Some topics to be discussed are: Basic processor organization; Minimization of user concern over processor timing conflict; Interaction with special features such as interrupts, memory protection, and direct memory accesses by the I/O system; Translation of machine instructions into Control Store routine addresses; Organization and execution of microinstructions; Tools available to the user for microprogram development and implementation into ROM or Writeable Control Store.
High level language oriented hardware and the post-von Neumann era
Authors: H. J. Bürkle, A. Frick, Ch. Schlier
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Modern computer hardware does still interpret machine languages, which are not very far from the von Neumann paradigm. To illustrate the possibilities of hardware structures directly interpreting a high level language (HLL) we report on a BASIC computer, &ldquo;Abacus&rdquo;, constructed in this laboratory. Design considerations to obtain hardware which utilizes the parallelism inherent in HLL statements are given. The execution of numerical test programs is roughly twice as fast on Abacus as compiled on a conventional minicomputer.
Inscan: A syntax-directed language processor
Authors: Mark Resnick, Jerome Sable
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The problem of building a language translator can be partitioned into two parts. The first is concerned with the specification of the syntax of the source language and the actions to be taken upon recognition of each syntactic type. The second is concerned with an algorithm for simultaneuosly scanning the source language string and the syntax specification and producing an object language string. That the problem could be broken up in this way has been known for some time and has been extensively reported in the literature. See, for example, the published surveys.1,2,3 One of the theoretical results of partitioning the problem in this way is that the same scanning algorithm can be used with each of several syntax specifications for parsing and translating several languages. Although this has been theoretically understood and often mentioned in the literature of syntax-directed compiling, very little use has been made of multi-language translators in a system context. The ADAM system 4 and the AUERBACH generalized data management system called DM-15 are two systems which have attempted to do this. The purpose of this paper is to discuss some of the possible modes of use of a syntax-directed processor, and the design and use of a particular syntax-directed language processor, called Inscan, which is part of DM-1.
Restricted subset selection for normal populations with unknown and unequal variances
Authors: David W. Sullivan, James R. Wilson
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper develops two extensions of the Gupta-Santner restricted subset selection procedure. The (exact) procedure RE screens a set of k normal populations with unknown and unequal variances using independent random sampling within each alternative population in order to select a final subset of at most m alternatives; in the least favorable configuration of population means, there is the minimal probability P* that the selected subset includes the population with the largest mean. The simulation-oriented (heuristic) procedure RS similarly screens a set of k covariance stationary normal processes with unknown and nonidentical covariance structures such that the (correlated) sampling within each alternative process is carried out independently. A rigorous development is given for procedure RE together with appropriate tables of constants required to apply the rule. The experimental performance of procedure RS is summarized for a wide variety of stationary autoregressive-moving average processes.
The turnover issue in EDP personnel
Venue: Proceedings of the ACM '81 conference (1981)

The data processing professional is a valued asset in every established computer facility. The critical shortage experienced by many installaticns has been attributed to the increase in the demand for qualified data processing persons and a high degree of turnover. While demand is generally related to the steady increase in the number of computers installed, turnover is a unique issue. It is a major factor contributing to the rise in EDP personnel costs. Poor system maintenance and documentation are often the result of frequent changes in personnel. Thus, turnover as a multifaceted issue, warrants serious study. What causes turnover among EDP personnel? What are the indicators of turnover? These and other questions can only be answered in the context of a controlled setting, using objective criteria. The objective of this panel is to (1) review the empirical literature that addresses the turnover issue in EDP personnel, (2) investigate the causes and incidence of turnover based in part on the panelists' experience in their respective organizations, and (3)suggest guidelines for stabilizing analysts and programmers at work. Preliminary findings of a recent empirical study of turnover in the MIS division of two major industries will be reviewed.
Application of simulation to design of classification systems
Authors: Robert DeMoyer,  Jr., Jon I. Fellers
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

In the future, a dramatic increase is likely in use of digital computers to make routine but very complex decisions, particularly decisions involving quantified uncertainty and large amounts of data. This paper formulates a method to classify objects on the basis of a series of imperfect measurements, the results of which may be either discrete or continuous. Digital simulation is demonstrated to be a powerful tool to effect quantitative trades among factors important in the implementation of the classification problem. Basic ideas are illustrated using a contrived example of inference of a satellite mission.
The coming world of &ldquo;what you see is what you get&rdquo; (abstract only)
Authors: Don Hatfield
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

The term 'what you see is what you get' has been used to refer to the editing of fully formatted documents so that every edit change causes the text to be updated immediately to show the document as it would appear when printed, thus eliminating the immediate step of (periodically) invoking a formatter explicitly. This mode of working is generally agreed to result in more and better results with less effort, both because the real-world simulation of a document is easier to use than a mixture of format command statements and unformatted text, and because many errors show up more immediately in a real-world situation than in a complicated abstraction.What happens if we extend this notion throughout the interface between the user and the computer? We enter a world of constrained objects and functional (applicative) actions. If the constraints are algebraic, the result is VISICALC-Iike. If the constraints are formats, the result is format programs which are also (unfilled) documents and can be created and edited as document images. If the constraints are actions themselves, the result is islands of action-programs in a sea of constraints.We propose, as the user interface, a general constraints language for documents. The documents are also "templates" or "forms", and have a robustness that makes them hard to injure. Anything may be represented as a document, from a memo to a database to a protein molecule. The commands for applying constraints all take no arguments other than the thing the user is pointing at when the command is given. The user's world is then like a large Tinkertoy environment, for constructing active and passive things.Examples of working in this world, in black and white and in color, will be given covering traditional text operations, the construction and use of document templates, the equivalent of programming as we know it, the equivalent of programming as we don't know it, and finally a John Milton template to test the relation between Paradise Lost and the fundamental theorem of the calculus.
The TRW Software Productivity System
Authors: Barry W. Boehm, James F. Elwell, Arthur B. Pyster, E. Donald Stuckle, Robert D. Williams
Venue: Proceedings of the 6th international conference on Software engineering (1982)

This paper presents an overview of the TRW Software Productivity System (SPS), an integrated software support environment based on the Unix operating system, a wide range of TRW software tools, and a wideband local network. Section 2 summarizes the quantitative and qualitative requirements analysis upon which the system is based. Section 3 describes the key architectural features and system components. Finally, section 4 discusses our conclusions and experience to date.
Z-NET a microprocessor based local network
Authors: Judy Estrin
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

Z-NET, a microprocessor based local network recently announced by Zilog, Inc., is designed to provide a fourth choice which significantly reduces the effort involved in utilizing a local network. Z-NET is a collection of hardware and software layers that provide the flexibility needed to customize the network to a particular application without rewriting all of the software. The Z-NET architecture is &ldquo;Ethernet&rdquo;-like in that it provides a packet switched, single channel, contention based, multiple access network with fully distributed control. The advantages of this type of architecture have been proven in many research environments.