ppxscal/embedding_network huggingface dataset:
The control structure facilities of ECL
Authors: Charles J. Prenner
Venue: ACM SIGPLAN Notices (1971)

ECL is a programming language system currently under development at Harvard University. A general description of the system is given in a companion paper [1]. This paper will describe some of the control structure facilities available in ECL - a complete description will appear as part of the author's Ph.D. thesis. Most existing programming languages allow for only one path of control. The programmer is presented with an environment in which he may use conditional statements, iteration statements and nested function calls (perhaps called recursively) to modify the flow of control through his program but it is not usually possible to either suspend execution of the current program (control path) and start up another or to set up another control path to execute in parallel with the current one. EL1, as originally proposed in [2], allows for only one path of control. ECL, however, allows for the creation and manipulation of multiple paths of control. These paths may execute in parallel, or act as coroutines or in any other relation desirable. Since the number of paths which can be created to execute in parallel may be greater than the number of processors available on a given machine, some sort of path scheduling must be done. The path scheduler is written in EL1 and is available for redefinition by the programmer.
Dynamic software engineering: An evolutionary approach to automated software development and management
Authors: Joseph S. Greene,  Jr.
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Cybernomorphic leverage techniques have been extracted from the Air Force Weapons Laboratory HULL system and generalized to provide a new management system called SAIL for producing, updating and maintaining software and data files. SAIL is being used on CDC6600, CDC7600, IBM 360/85 and HIS6080 computers at twelve installations. The system provides a totally new level of centralized software development and maintenance control, while simultaneously decentralizing user applications, providing user controlled task specialization, and realizing transportability between dissimilar machines. Cybernomorphic techniques offer an evolutionary approach to economy in software by encouraging maximum reutilization of existing code without duplication or arbitrary management restraints, and enhancing the benefits realized from modularity and structured programming. The techniques offer economy in hardware resource utilization by producing code which is optimized at execution time for the task. Although the first strategic planning application of the SAIL techniques is only in the preliminary test and evaluation phase, the approach already promises new opportunities for improved effectiveness and economy in mission support applications software.
Direct implementation of compiler specifications or the pascal p-code compiler revisited
Authors: Don Milos, Uwe Pleban, George Loegel
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

We have developed a complete formal specification of the translation semantics of the Pascal P-compiler. The specification is written as a semantic grammar (a variant of extended attribute grammars), and has been extensively tested and debugged with the aid of Lawrence Paulson's experimental semantics processor. The translation semantics models the operational aspects of compilation in detail. It is one-pass, embodying static semantic checking, address assignment, code generation, and a certain amount of code improvement. Our paper describes the development history of the project, compares the new compiler with the existing P-compiler, and discusses our positive experience with semantic grammars and Paulson's system.
A laminate design system
Authors: W. E. Pickrell
Venue: Proceedings of the SHARE design automation project (1965)

This paper describes a technique for automatically designing and producing artwork for multi-layer laminates used in digital computer construction at Litton Industries. This technique consists of a number of computer programs which are a sub-system of a general design automation effort called IDAS (Integrated Design Automation System). The laminate design programs deal with the problems of artwork production and inter-connection of electronic components frequently experienced in computer system design and construction. The laminate programs have been under developments for the past 18 months and are all operational. During the 18 months of development numerous experiments comparing the automatic laminate design method to the manual method have been performed. This paper discusses the results of these experiments along with some details of the programs and their operation. Before a discussion of automatic laminate design can proceed some preliminary definitions are required.
The Multics system programming process
Authors: T. H. Van Vleck, C. T. Clingen
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Features of the Multics system programming process lead to high programmer productivity with a small programming staff and a finished system with high software reliability. Other workers' predictions of increasing difficulty of system maintenance with time have not been observed; reasons for this are suggested.
Algebraic constructions for algorithms (Extended Abstract)
Authors: S. Winograd
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

In the last decade or so there has been an out-growth of research in algebraic complexity of computations which showed how to derive algorithms systematically. One of the features of these derivation is their reliance on algebraic and symbolic constructions. I would like, in this paper, to survey some of the symbolic and algebraic constructions which are used, and then draw some conclusions on the implications of this development for symbol manipulation systems. Let me start by sketching some of these derivations.
Extensible control structures
Authors: Charles J. Prenner
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

A considerable amount of programming language research has been directed towards the development of extensible languages. Typically, these languages allow data type extensions, in which new data types are constructed in terms of built-in or previously defined ones, and syntax extensions, which allow the programmer to express himself in a more convenient notation than that of the base language. For the past few years the author has been experimenting with a third axis of extensibility, namely, control extensions - the introduction of non-standard control structures into programming languages. By non-standard control structures we refer to any one of a set of facilities which have appeared as specialized extensions to existing languages. These include non-deterministic algorithms, backtracking, parallel processing, co-routines, simulation primitives, synchronization operations, and the like. Numerous papers describe how one or more of the above can he added to some language (usually ALGOL-60). However, there have been relatively few studies of either the effects of the extensions on the language as a whole or the possibility of obtaining all of these extensions in a unified way from a common base.
A new stabilized zero-crossing representation in the wavelet transform domain and signal reconstruction
Authors: S. Watanabe, Y. Akimoto, T. Komatsu, T. Saito
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Stabilized multiscale zero-crossing representations are well adapted for extracting local features such as edges from images. For almost all the variants of the representation presented so far, signal reconstruction from it has been formulated as a non-linear optimization problem, and the algorithms for it are based on the formulation of projections onto convex sets. However, they have common drawbacks: difficulty in extending the algorithms to the two-dimensional case, fractional sampling interval accuracy in the positions of zero-crossings requisite for almost complete signal reconstruction, and a large amount of computational efforts involved in signal reconstruction. To cope with the drawbacks, we present a new stabilized zero-crossing representation with a salient feature that the signal reconstruction problem reduces to a typical minimum-norm optimization problem, the solution of which is formulated as a linear simultaneous equation, and develop an iterative algorithm for signal reconstruction. With the iterative reconstruction algorithm we can almost perfectly reconstruct an original image from the stabilized zero-crossing representation, and after some dozens of iterations the algorithm provides a reconstruction image with subjectively high picture quality.
Programming languages, logic and cooperative games
Authors: L. Hodes
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

The author presents an application of computers which is not restricted to a single problem area but is perhaps not general purpose enough to be considered a programming language, even a problem-oriented one. The application is a program to eliminate quantifiers and bound variables from logical statements in the theory of addition on the real numbers. These statements differ from work in linear inequalities by formal use of quantifiers. The first, introductory, part of the paper argues that from one point of view, this application does provide a higher level programming language. The second part is a description of the method, due basically to Langford, that has been programmed. The last section describes a subapplication to the problem area of bargaining sets of cooperative games where other interesting non-numerical problems arise.
Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)
Authors: G. L. Peterson
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

The question of relative efficiencies is studied in the context of a simple model of communicating aynchronous processes. The fundamental problem is whether a simple distributed system, with arbitrary size variables, is any more powerful than a system where only binary valued variables are permitted. The answer was (surprisingly) found to be negative, with an intuitive definition of the power of systems. The development of these notions required formalization of concepts such as equivalence of models, and the reduction of systems between models. It was discovered that requiring a strong definition of equivalence which decreased time apparently results in an increase in space. The trade-offs involved are seen to be tight in one approach to the problem.
APL iconics
Authors: Maurizio S. Dell'Oca, Piero Mussio
Venue: Proceedings of the international conference on APL (1984)

The discipline of iconics refers to the integrated analysis, generation and management of digital images by computer. In pictorial data analysis, iconic techniques help a proper definition and design of interactive systems for the interpretation of digital images. The use of APL allows on the other side, the formal definition and the person-person communication of the designed tools, the quick and economic development of user-oriented prototypes and their tests and checks.
The probability of stability an empirical determination
Authors: Spyros Makridakis
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This study will try to develop a probability function which can predict an important aspect of a dynamic system's behavior: its ability to be stable over a long period of time. The data used by the study were taken to represent systems in general, and it is hoped that the results can be used by any discipline dealing with systems, in accordance with General System Theory's principles (von Bertalanffy, pp. 1-10, 1956), even though it was intended primarily for the behavioral sciences, where the need for dynamic considerations of systems behavior is much greater than in the natural sciences.
CFD &mdash; A FORTRAN-like language for the ILLIAC IV
Authors: K. G. Stevens,  Jr.
Venue: Proceedings of the conference on Programming languages and compilers for parallel and vector machines (1975)

A FORTRAN-like language, CFD, is described as it relates to the parallel hardware of ILLIAC IV. Included are the basic goals of the authors of CFD and some of the author's own experiences during the evolution of the language. CFD was developed for the ILLIAC IV to provide programmers with a language similar to commonly used versions of FORTRAN. Many of the deviations from FORTRAN found in CFD were dictated by the parallel hardware architecture of ILLIAC IV.
Experience with a microprogrammed Interlisp system
Authors: L. Peter Deutsch
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

This paper presents the design of an Interlisp system running on a microprogrammed minicomputer. We discuss the constraints imposed by compatibility requirements and by the hardware, the important design decisions, and the most prominent successes and failures of our design, and offer some suggestions for future designers of small Lisp systems. This extended abstract contains only qualitative results. Supporting measurement data will be presented at MICRO-11.
Design of a fully variable-length structured minicomputer
Authors: Z. G. Vranesic, V. C. Hamacher, Y. Y. Leung
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

Binary-based and fixed-length structure computers are often inconvenient and wasteful of resources. In this paper we present a design for a fully variable-length structured minicomputer. Since all parameters (instructions and data) are unrestricted in length, their boundaries and interpretation are effected by special delimiter codes. For practical reasons (dictated by current technology) the machine utilizes a binary-coded decimal number representation.
On square-free decomposition algorithms
Authors: David Y.Y. Yun
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In this paper, we will give three different (including revamped versions of Horowitz's and Musser's) algorithms for computing the SQFR decomposition of polynomials in R[x]. Some algorithm analysis will be carried out to show the (asymptotic) superiority of the algorithm we propose (last of the three).
Reflections on grades
Authors: J. Philip Benkard, John N. Seebe
Venue: ACM SIGAPL APL Quote Quad (1983)

The APL function REVERSE and a certain defined function generate a group of order four on permutation vectors. The group is extended with the GRADE-UP function to produce GRADE-DOWN and the order eight group known as D4, the fourth dihedral group. The symmetries of a square are generated by REVERSE and TRANSPOSE on square matrices. The resulting isomorphism maps GRADE-DOWN and its inverse to the ninety degree rotations. APL's powerful formalism easily reveals the isomorphisms between the domains of algebra and geometry.
Performance Evaluation of the VF Graph Matching Algorithm
Authors: L. P. Cordella, P. Foggia, C. Sansone, M. Vento
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The paper discusses the performance of a graph matching algorithm tailored for dealing with large graphs without using information about the topology of the graphs to be matched. The algorithm, presented in more details in other papers (and publicly available on the WEB as VF), is now discussed with reference to its computational complexity and memory requirements.The performance analysis is carried out by theoretically characterizing the matching time and the required memory in the best and worst cases. The theoretical analysis is completed by tests on a database of graphs randomly generated.The algorithm is compared with the one proposed by J.R. Ullmann: experimental results confirmed the theoretical expectations, highlighting the overall efficiency of the algorithm. Some results obtained by researchers who recently used the algorithm in application domains requiring a massive use of graph matching techniques are finally reported.
Functional verification of memory circuits from mask artwork data
Authors: Masahiko Kawamura, Haruo Takagi, Kanji Hirabayashi
Venue: Proceedings of the 21st Design Automation Conference (1984)

The timing simulator MACTIS was successfully applied to functional verification of MOS memory circuits from mask artwork data. The circuit description is extracted automatically from artwork data by the mask analysis program. Combining the macromodel technique and the code generation scheme, the timing simulation can be performed cost-effectively. MACTIS can handle circuits with analog features also, including bootstrapping effects, which cannot be done by logic and switch level simulators.
Performance analysis of local communication loops
Authors: Kuno M. Roehr, Horst Sadlowski
Venue: Proceedings of the Computer Network Performance Symposium (1982)

The communication loops analyzed here provide an economic way of attaching many different terminals which may be some kilometers away from a host processor. Main potential bottlenecks were found to be the loop transmission speed, the loop adapter processing rate, and the buffering capability, all of which are analyzed in detail. The buffer overrun probabilities are found by convolving individual buffer usage densities and by summing over the tail-end of the obtained overall density function. Examples of analysis results are given.
Computervision's direction in workstation technology
Authors: Guy D. Haas
Venue: Proceedings of the 21st Design Automation Conference (1984)

Computervision has developed a new generation of engineering workstations, offering multiple applications and fully integrated with other CAE/CAD/CAM systems. Computervision believes that multi-application integration and world-wide quality service is the key to workstation success in the 80's. This presentation centers on the justification for workstations and explores 6 of the initial workstation application packages, as well as the standard hardware and software system. System integration and communication are addressed.
Testing of MOS combinational networks a procedure for efficient fault simulation and test generation
Authors: Yacoub M. El-ziq
Venue: Proceedings of the 16th Design Automation Conference (1979)

The increasing use of large and very large scale integration (LSI and VLSI) have introduced many difficulties in testing large logic networks. This generated the need for designing logic networks for testability. Computer algorithms for designing diagnosable metal oxide semiconductor (MOS) networks, with and without fan-in, fan-out constraints, were described in previous papers. Procedures for efficient fault simulation and test generation will be presented here. First, a basic cell model will be introduced. Next, procedures for generating a complete fault detection set for the complex cell will be given. Both minimal and near-minimal solutions will be presented for both fan-out free and arbitrary cells respectively. The efficiency of this technique will be compared with conventional testing techniques (e.g. N-dimensional path sensitization automatic test generator with a parallel fault simulator) and the results will be reported. Finally, some future work problems will be introduced and the application of this technique for improving LSI and VLSI testability will be discussed.
User services under a free-access computing policy
Authors: John Schofield
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

Computing at Dartmouth College has a reputation of being somehow different, though few people outside the institution know exactly how or why it is different. In a May 1974 Science magazine article, Arthur Luehrmann and John Nevison described the Dartmouth difference in terms of our policy of free-access to computing by everyone in the college community, a way to effect dramatic increases in the number of computer users with only modest costs. This free-access policy has important consequences for our User Services activities; it requires a special set of priorities but permits us to serve a large number of users with a small staff.
Virtual I/O, an experiment
Authors: R. L. Hartung, A. Ammerman
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

This paper describes an experiment in virtualizing Input/Output (I/O) for allowing new I/O technologies, such as ARPANET, to replace old hardwired interface disciplines. This was accomplished using micro-programmable host machines, emulation, and virtual machine concepts. The I/O system under study was the Naval Tactical Data System interface which is a U.S. Navy standard.
The &ldquo;gap&rdquo; between users and designers of CAD/CAM systems: Search for solutions
Authors: Joseph Peled, Michael P. Carroll
Venue: Proceedings of the 18th Design Automation Conference (1981)

The issue of the existing &ldquo;gap&rdquo; between users and developers of CAD/CAM systems was brought up at the panel discussion of last year's conference (17th DAC). The statements expressed were those of the users of CAD/CAM systems. This paper tries to bring the developer's viewpoint on this subject and suggestions for solving this problem, which is also the interest of the developers as well as the interest of the users of CAD/CAM systems.
Evaluation and performance of computers: TRAFFICSIM&mdash;a design/evaluation tool
Authors: P. A. Rota, J. H. DePuyt,  Jr.
Venue: Proceedings of the 1965 20th national conference (1965)

TRAFFICSIM is a digital computer simulation of the cause, effect, and result of processing system message traffic. The cause is simulated by the Message Generation Simulation (MGS) program which provides the capability of simulating system user operations, under various operational conditions, to estimate the message generation loads that are inputted to the system at all input/output (I/O) elements. This represents the basic source of messages, and is accomplished by formulating mathematical models of system user operations. These models are developed on the basis of the number and type of messages that result from the particular operation being simulated. Hence, it relates the messages to their cause (events) and simulates the dual relationships of events and their corresponding message entry to the system.