ppxscal/embedding_network huggingface dataset:
The definition and use of data structures in REDUCE
Authors: Martin L. Griss
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

This paper gives a brief description and motivation of the mode analyzing and data-structuring extensions to the algebraic language REDUCE. These include generic functions, user defined recursive data structures, mode transfer functions and user modifiable automatic coercion. A number of examples are given to illustrate the style and features of the language, and how it will aid in the construction of more efficient and reliable programs.
Two methods of using APL in the teaching of probability and statistics
Authors: U. M. von Maydell, K. W. Smillie
Venue: Proceedings of seventh international conference on APL (1975)

This paper gives a brief discussion of the use of APL as a programming language and also as a notation in the teaching of an introductory course in probability and statistics, and compares the two methods with a conventional approach to the subjects.
Seeing behind the scene: analysis of photometric properties of occluding edges by the reversed projection blurring model
Authors: N. Asada, H. Fujiwara, T. Matsuyama
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

This paper analyzes photometric properties of occluding edges and proves that (1) we can observe surface edges on the farther object located close to the occluding edge even if they are occluded by the nearer object, (2) the image of an occluding edge coincides with that of a surface edge on the nearer object if the brightness of the farther object is uniform around the occluding edge. First, we propose a blurring model named the reversed projection blurring model to analyze photometric properties of blurring phenomena of an occluding edge. Using this model, the theoretical proof of the two properties mentioned above is given. Finally, experimental results in real world environments demonstrate the validity of our blurring model as well as the observability of the photometric properties of occluding edges.
A normative simulation for airline marketing planning
Authors: Randall L. Schultz, Joe A. Dodson,  Jr.
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper reports on the development of a heuristic aid to making marketing planning decisions that is data based and explicitly considers the uncertainty of competitive behavior. An application of the model to an airline market provides conclusions about the nature of the market and how to assess competitive response. Normative simulation appears to have good potential as a decision-making aid for marketing managers.
Is &ldquo;sometime&rdquo; sometimes better than &ldquo;always&rdquo;?: Intermittent assertions in proving program correctness
Authors: Zohar Manna, Richard Waldinger
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper explores a technique for proving the correctness and termination of programs simultaneously. This approach, which we call the intermittent-assertion method, involves documenting the program with assertions that must be true at some time when control is passing through the corresponding point, but that need not be true every time. The method, introduced by Knuth and further developed by Burstall, promises to provide a valuable complement to the more conventional methods. We first introduce and illustrate the technique with a number of examples. We then show that a correctness proof using the invariant assertion method can always be expressed using intermittent assertions instead, but argue that the reverse is not always the case. The method can also be used just to prove termination, and any proof of termination using the conventional well-founded sets approach can be rephrased as a proof using intermittent assertions. Finally, we show how the method can be applied to prove the validity of program transformations and the correctness of continuously operating programs. This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under Contract DAHC15-73-C-0435, by the National Science Foundation under Grant GJ-36146, by the Office of Naval Research under Contract N00014-75-C-0816, and by a grant from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel.
A case for the GOTO
Authors: Martin E. Hopkins
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

In recent years there has been much controversy over the use of the goto statement. This paper, while acknowledging that goto has been used too often, presents the case for its retention in current and future programming languages.
Introduction to digital Computer programming an IPI approach
Authors: John H. Sistare, Norman E. Sondak
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

The first course in Computer Science is often one of the most difficult to teach. A large number of students enroll, many with widely different aptitudes and backgrounds, so that the traditional lecture/presentation techniques aimed at the average miss the majority. A number of alternates have been proposed to overcome this problem. One of these is Individually Prescribed Instruction (I P I). Using I P I, the course material is initially partitioned into a number of discrete units and given to a student one unit at a time. The student reviews the material contained in the unit and then takes a written &ldquo;assessment&rdquo; to gage his mastery of the concepts. The assessment is evaluated immediately and if the student was successful the next unit is given, otherwise he simply &ldquo;recycles&rdquo; the material. By this means the student can progress at his own pace. The material in this course has been broken down into seven units. In addition to the written material, the student has access to student tutors, faculty instructors and video taped teaching aids. This paper reviews the organization, construction and experience with using the I P I approach over the past two years. Results to date indicate that this method can be highly successful, if administered to a proper subset of the student population.
The MuNet: A scalable decentralized architecture for parallel computation
Authors: Robert H. Halstead,  Jr., Stephen A. Ward
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

The MuNet is a multiprocessor architecture which can be program-transparently scaled over a very wide cost-performance spectrum. Each processor in a MuNet communicates directly only with a limited number ofneighbors..There is no shared memory, central broadcast medium, or other hardware resource shared equally by all processors In the system. This strictly local communication and interconnection strategy means that only a constant amount of additional hardware need be added for each new processor incorporated into the system. MuNet architectures are significant because of their potential for scalability and large capacity, their way of forging a collection of processors into a coherent programming system, and their ability to support a wide range of object management functions on a distributed system without recourse to any central controlling mechanism. The paper gives an overview of the main structural features of the MuNet, along with a status report on the MuNet project.
New procedures for selection among (simulated) alternatives
Authors: Edward J. Dudewicz
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

&ldquo;Ranking and selection&rdquo; procedures were developed 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 are typical goals when a simulation study is performed, often in order to select that one of several procedures (for running a real-world system) which is best (with regard to a specified criterion of goodness). Therefore these procedures have become a standard analysis method in simulation work in recent years (e.g., see the references in (8)). In this paper we: review some of the selection procedures most often found useful in design and analysis of simulation experiments; discuss some other important procedures and related problems; and state some unsolved statistical problems of importance in simulation work.
A 2-dimensional placement algorithm for the layout of electrical circuits.
Authors: Daniel G. Schweikert
Venue: Proceedings of the 13th Design Automation Conference (1976)

PLAC is a multi-algorithm, 2-dimensional placement program which accommodates many of the &ldquo;real world&rdquo; constraints which occur in the layout of electrical circuits. PLAC was implemented as part of LTX [1], a general integrated circuit layout system, but is capable of handling circuit layout tasks from other technologies (e.g., PC boards, ceramic substrates). PLAC interlaces constructive initial placement with iterative pairwise exchange, using an approximation of total routing length as the primary figure-of-merit. The layout designer can influence the placement by providing a &ldquo;seed&rdquo; preplacement of key cells. PLAC results are given for a DIP board layout and two polycell integrated circuit layouts. Comparisons are made to other semi-automatic and manual placement procedures. Running time on an HP21MX minicomputer ranged from 4 minutes on a 34-cell problem to 1 hour on a 511-cell problem.
REGULUS: A general purpose macro processor based on regular expressions part one
Authors: Harvey Abramson
Venue: Proceedings of the 1977 annual conference (1977)

We consider macro processors to be a particular kind of translator writing system rather than simply a mechanism for performing textual replacement. This consideration leads to the application of modern compiler and translator writing system technology to the design and implementation of general macro processors. REGULUS is a general purpose macro processor based on regular expressions and is designed following the above mentioned considerations. REGULUS may be fitted to a variety of lexical environments by a specification in terms of regular expressions of &ldquo;lexemes&rdquo; or &ldquo;tokens&rdquo;. A subsequent paper will deal with the establishment of REGULUS's syntactic (based on regular expressions of lexemes) and semantic environments.
A simulation for the justification and planning of a continuous slab caster
Authors: Beverly J. Wolfe, Mark A. Christobek
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Two major simulation models were developed to aid in planning the multi-million dollar expansion of steelmaking facilities at Bethlehem Steel's Sparrows Point, Maryland, plant. One model looks at the flow of liquid metal through steelmaking facilities while the second model represents the handling of solid slabs produced by the new continuous caster. Both simulation models were written using "Bethsim", a Bethlehem Steel developed simulation language used primarily for discrete event simulation. Bethsim uses a network combined with user written FORTRAN subroutines and package subroutines that aid in the modeling of complex manufacturing elements such as roller lines, crane movements, and storage areas. Output from the models consists of standard Bethsim reports and customized reports produced by FORTRAN subroutines and a SAS postprocessor.
A file definition facility for file structures
Authors: Billy G. Claybrook
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

This paper describes a file definition facility (FDF) for defining files as graph structures. The structure of the file is explicitly declared in the file definition. Primitive functions (from graph theory), operators, and the format of the definition statements are given. The combination of functions and operators appear as directives to the programming system for structuring files. Several simple examples are given to illustrate the use of the FDF. The data organization for the implementation of this facility is described in detail. Problems of considerable importance that are treated are: (1) garbage collection, (2) template construction, and (3) runtime address calculation. The external definitions are represented internally by descriptors. The format of the descriptors is given and a discussion of the items in the descriptors is presented.
MADS - a machine aided drafting system
Authors: H. N. Lerman
Venue: Proceedings of the SHARE design automation project (1966)

The problem of having to maintain and update many drawings of the same type, as well as having to reproduce them quickly without having to completely redraw them manually is a concern throughout the industry. The solution presented here is that of establishing a standardized symbology to describe the simularities between the drawings, and using these symbols and a digital computer to generate and/or maintain these drawings. The drawings are converted into digitized symbol sets organized into files, and these files are then processed into the appropriate commands to drive a mechanical plotter to recreate the required drawings in every drafting detail, including Leroy lettering. These drawings are then maintained on an exception basis by using the updating capabilities of the system. No matter what type of drawing is to be processed, it can be thought of as a particular arrangement of some predetermined building block symbols. In using MADS, the designer need only create a library tape of these symbols, and then use it to generate any drawing needed.
Training the systems analyst to solve complex real world problems
Authors: Thomas H. Athey
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

The milieu of the analyst in the world today and even more so in the post-industrial society of the near future will be characterized as one of great complexity. Accelerating demands will be placed on the analyst as he tries to understand and solve the problems of the various systems with which he is associated. This is especially true for analysts associated with computer-based systems. Rapid technological advancements in hardware and software, increasing interrelatedness among functional areas requiring more encompassing systems, increasing educational levels of managers able to use more sophisticated decision-making techniques, etc. all lead to requiring increasingly complex, but more adequate, information systems.
Partitioning of logic graphs: A theoretical analysis of pin reduction
Authors: Robert B. Hitchcock
Venue: Proceedings of the 7th Design Automation Workshop (1970)

Formulae are derived for the number of pins required by the average partition of a computer logic graph. These formulae are used to construct curves relating the number of pins required by a group of blocks in a graph with certain statistical properties to the number of blocks in the group. The average effect of the two factors which contribute to pin reduction is discussed.
Tube terminology and style
Authors: Glenna James
Venue: Proceedings of the ACM 1980 annual conference (1980)

In the 80's we will be addressing a different audience. This places demands on documentation that we heretofore have not experienced. Computers have historically been used to address operational problems, using discrete elements and handling specific tasks. This isn't the type of information managers will be using in the 80's. So we see new kinds of systems emerging&mdash;design (hence documentation) aimed at a new audience&mdash;managers.
On the VAX/VMS time-critical process scheduling
Authors: Y. T. Wang
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

The VAX/VMS process schedule is briefly described. A simple priority-driven round-robin queuing model is then constructed to analyze the behavior of the time-critical processes of VAX/VMS under such a schedule. Mean and variance of the conditional response time of a process at a given priority are derived, conditioned on the amount of service time required by that process. Numerical results are given with comparisons to the ordinary priority queuing systems.
A primitive-function APL keyed file system
Authors: Geoffrey Wiland
Venue: Proceedings of the international conference on APL: part 1 (1979)

This paper describes a primitive-function APL keyed file system which has been implemented by Time Sharing Resources, Inc. and MegaSystems Associates. Its primary features include access to components by a unique identifier called a &ldquo;key&rdquo;, and the ability to mix data types within a component via the use of a &ldquo;list&rdquo; structure. It has had widespread use as part of Time Sharing Resources' TOTAL\APL timesharing system, and has recently been adapted to operate on MegaSystems' mega-minicomputers.
A concept-oriented approach to introductory computer science
Authors: William M. Conner
Venue: ACM SIGCSE Bulletin (1977)

A framework on which a concept-oriented introductory computer science course can be based is presented and our experience in offering such a course to a special group of high school students is described. It is suggested that introductory college-level courses should be based on this or a similar framework and our reasons for this suggestion are given.
A neighbor connected processor network for performing relational algebra operations
Authors: Kjell Bratbergsengen, Rune Larsen, Oddvar Risnes, Terje Aandalen
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

In a data base computer consisting of cells with processing capability, the desired goal is to achieve an execution time - for each data base operation - to be inversely proportional to the number of cells. Using rings as a basic building block, we have constructed different intercell communication networks. The capacity of the communication network have been analyzed under the workload of relational algebra operations. A k-dimensional network of intersecting rings, each of 2 or 3 cells have been found to give the highest processing capacity per cell in the network. Here k is log2C, where C is the total number of cells. A simple wiring scheme for k-dimensional network of 2 cells per ring has been presented. For this type of network, we have also described the routing logic, and given an estimate of the queueing delay.
Using Lie transformation groups to find closed form solutions to first order ordinary differential equations
Authors: Bruce Char
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Most work on computer programs to find closed form solutions to ordinary differential equations (o.d.e.s) has concentrated on implementing a catalog of those methods often cited in textbooks and reference works (see e.g. Kam61a, Inc44a]): algorithms of certain, easily recognized cases (e.g. separable, exact, homogeneous equations) and a useful guessing framework for changes of variable. This approach has been followed by Moses, Schmidt, and Lafferty, among others [Mos67a, Sch76a], [Sch79a, Laf80a]. We present here a different approach to cataloguing, using the relation between differential equations and Lie transformation groups. When presented with a given a first order o.d.e., we shall be concerned with finding continuous transformations (of the plane) which map the solution curves of the o.d.e. into each other. When a group of such transformations is found, it is possible to construct the solution to the o.d.e. via quadratures. We shall find that for many cases of interest, there are succinct algorithms for finding the transformations without knowing the solution curves beforehand. The guiding relationships for the catalogue search, and the justification for the quadrature formula used, has been known for about a century. Pioneering work was done by Sophus Lie and others in the 19th century (see e.g. [Lie75a]). Its emplacement within a symbolic/algebraic computational setting is, of course, modern-day.
DDDP-a Distributed Data Driven Processor
Authors: Masasuke Kishi, Hiroshi Yasuhara, Yasusuke Kawamura
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

This paper describes an architecture of a data flow computer named the Distributed Data Driven Processor (DDDP), and presents an experimental system and the results of experiments using several benchmarks. The experimental system has four processing elements connected by a ring bus, and a structured data memory. The main features of our system are that each processing element is provided with a hardware hashing mechanism to implement token coloring, and a ring bus is used to pass tokens concurrently among processing elements. A hardware monitor was used to measure the performance of the experimental system. The experimental system adopts a low key technology and yet is capable of executing about 0.7 million instructions per second through the benchmarks. This implies that data flow computers can be alternative to the conventional von-Neumann computers if state-of-the-art technologies are adequately introduced.
A report on random testing
Authors: Joe W. Duran, Simeon Ntafos
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Random testing of programs is usually (but not always) viewed as a worst case of program testing. Test case generation that takes into account the program structure is usually preferred. Path testing is an often proposed ideal for structural testing. Path testing is treated here as an instance of partition testing. (Partition testing is any testing scheme which forces execution of at least one test case from each subset of a partition of the input domain.) Simulation results are presented which treat path and partition testing in a reasonably favorable way, and yet still suggest that random testing may often be more cost effective. Results of actual random testing experiments are presented which tend to confirm the viability of random testing as a useful validation tool.
Software maintenance: A budgeting dilemma
Authors: Dan Hocking, Joe Celko
Venue: Proceedings of the fifteenth SIGCSE technical symposium on Computer science education (1984)

There is considerable effort to reduce the software budget devoted to the maintenance of applications systems. This effort will have the effect of improving productivity of development and maintenance programmers. This means that for a given system over a given time period, the amount spent on software maintenance can be reduced significantly. The reduction might even reach the eighty per cent sometimes shown in the literature. We support and applaud the efforts to improve software maintenance procedures. Despite this type of reduction, it is not certain that organizations will spend less on maintenance relative to development. It is likely that the opposite will occur as more systems are being supported. This paper shows how that can happen through the derivation of some simple cost equations.
Certification of microprograms by an algebraic method
Authors: A. Blikle, S. Budkowski
Venue: Proceedings of the 9th annual workshop on Microprogramming (1976)

This algebraic method provides a mathematical framework for proving input-output properties (such as partial and total correctness) of iterative programs. Technically it uses a calculus of binary relations extended with fixed-point equations. The method has been tested on several microprograms of a computer's arithmetical unit. One example of such a microprogram and its correctness proof is discussed in the paper.