ppxscal/embedding_network huggingface dataset:
Artificial intelligence and software engineering: The Programmer's Apprentice project
Authors: Charles Rich
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

An overview of the goals, methods and progress of the Programmer's Apprentice Project: The goals of the project are to develop an artificial intelligence theory of how expert programmers analyze, synthesize, modify, explain, verify and document programs, and to apply that theory towards automating the programming process. Recognizing that the long-term goal of totally automatic programming is very far off, we are presently concentrating on applying our research towards developing an intelligent computer assistant for programmers, called the Programmer's apprentice. One of our key observations is that expert programmers rely heavily on a large body of standard implementation methods and program forms. A central part of the research has therefore been to identify and codify these standard forms. For this purpose, we have developed a programming-language independent formalism, called the Plan Calculus, in which these standard forms can be written down in a canonical and abstract way, and used by an automatic programming system. An initial library of several hundred plans using has been compiled using this formalism.
How to define a language using PROLOG
Authors: Chris D.S. Moss
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

There have been many papers, conferences and theses concerned with the task of defining programming languages. Yet, twenty years after McCarthy's (1962) seminal paper there is still no widely accepted method which will deal with all parts of a language clearly and concisely. Everyone who invents a language writes a BNF definition and the more theoretically minded will attempt a denotational semantics. For a complete definition of the syntax, attribute grammars are gaining increasing acceptance while more practically minded language designers will use one of the compiler definition languages such as Meta4 or CDL. At the same time as the PROLOG language was defined, a grammar system called Metamorphosis Grammar (M-grammar for short) was invented by Colmerauer (1978). This has been shown to be suitable (Moss 1981) for defining both the full syntax and semantics of programming languages. The present paper attempts to give an overview of this method in the form of a practical guide to writing a language definition. This includes the context sensitive syntax, and semantics using denotational, relational or axiomatic methods. This definition is not simply of theoretical interest. Since PROLOG is a practical programming language, though with a sound theoretical basis (Warren, Pereira, Pereira 1977), the definition can be used as a prototyping tool for a new language. With the addition of plan-formation techniques one might form a PROLOG based compiler generator and by adding other axioms form a program proving system.
MDELTA - a digital program for control system analysis
Authors: B. H. Anstiss
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

Design and analysis of high-order control systems requires a great deal of laborious calculations. Stability analyses are usually conducted with standard techniques such as root locus or frequency response. The calculations involved in these analyses are generally too complex to do by hand. Graphical techniques and approximations may be used, but often introduce unacceptably large errors. The advent of modern digital computers led to the development of a great many programs to perform stability analysis. Generally, these programs were designed to perform one specific analysis using a single technique such as root locus. Such programs seldom shared common input formats, making multiple analyses difficult. Program input was often in the form of polynomial coefficients of the system's transfer function. The determination of these coefficients was difficult, for all but the most simple control systems. The MDELTA program was designed to satisfy all of the above requirements. New features are still being included after three years of successful usage in Boeing aerospace projects. The major analytical techniques used within the program are outlined below.
Users view
Authors: J. R. Colton, F. E. Swiatek, D. H. Edwards
Venue: Proceedings of the 21st Design Automation Conference (1984)

The complexity of communications systems and products developed and manufactured by AT T demands a sophisticated set of Computer Aided Engineering tools. These tools are required to manage the complexities ranging from the integrated circuit level, through the circuit pack level, to the levels of shelves and frames of equipment. They are used at the very onset of the design process, starting with initial design intent capture, through fabrication of prototypes and models, and culminating in information transfer and manufacture. To meet these needs within a common design environment, a CAE system is required which possesses considerable technical depth, great flexibility, and the capacity to evolve to meet changing needs. The Unified CAD System is a comprehensive and integrated system of CAE tools used at AT T for the design, development, and manufacture of electronic circuit packs and backplanes. This system was conceived and developed at AT T Bell Laboratories and is now in heavy use by AT T product development and manufacturing organizations. When used in its complete form, the system provides a totally data driven process from design capture to manufactured product. This is achieved with a minimum of manual intervention and with the availability of audits to verify the integrity of data at each step along the way. This paper addresses the users view of the system. At AT T, the users consist of design engineers, specialists in physical design realization, documentation, and information transmittal, and manufacturing engineers. This paper presents a description of how the system is used today, its performance in these environments, and a users view of future directions. We find that the Unified CAD System improves quality, reduces costs, reduces intervals, and improves human interfaces. Use of the system has resulted in fewer design iterations, reduced design activity, and elimination of duplication of effort. The system has had a profound effect in bringing designs into manufacture, and the users are anxious to extend its benefits into even more aspects of the product development and manufacturing process.
Optimal control of a M/M/m queue
Authors: Aurel A. Lazar
Venue: Proceedings of the Computer Network Performance Symposium (1982)

The problem of optimal control of a M/M/m queueing system is investigated. As in the M/M/l case the optimum control is shown to be a window type mechanism. The window size L depends on the maximum allowable time delay T and can be explicitly computed. The throughput time delay function of the M/M/m system is briefly discussed.
Evaluation of computer and network security systems
Authors: Stelio Thompson
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This topic deals with the net difference in the security posture resulting from the proliferation of the business world by microcomputers and computer networks. The following are the premises that will be discussed: A. Large 4th generation computer systems, while not fully secured, were designed with some level of controls, auditibility and recovery; B. Microcomputer design and operational characteristics have created a multitude of new security problems while resolving a variety of old security problems; C. Networks, while compounding some security problems, also mitigated many microcomputers related data base system controls and auditing problems.
An evaluation of the N. mPc design environment
Authors: Gregory M. Ordy, Frederic I. Parke
Venue: Proceedings of the 16th Design Automation Conference (1979)

Presents experimentally derived performance data on the N.mPc system. Data describing the type, size, and speed of simulations is presented. The implications of using the ISP' Hardware Description Language in constructing various models of the same components are considered. A set of design examples are presented to illustrate the range of simulation capabilities.
Parameter sensitivity studies for internal combustion engine control and design purposes
Authors: Carl F. Boehm,  Jr., John J. Allan,  III
Venue: Proceedings of the 10th Design Automation Workshop (1973)

The computer simulation of internal combustion engines is a task that numerous researchers have contributed to in recent years, primarily because of the advent of digital computers with large storage and fast processing capabilities. Engine simulation is particularly important today as we try to solve the problems of air pollution and energy depletion. Many aspects of engine operation are poorly understood because of the problems encountered when attempting to measure the variables that describe the engine's operation. This fact complicates both the control and design of engines. Parameter sensitivity studies could very well lead to improved performance measures that will enhance both the control and design of internal combustion engines in the years to come. These studies are discussed here in terms of what they could contribute for control and also for design purposes.
An efficient environment allocation scheme in an interpreter for a lexically-scoped LISP
Authors: Drew McDermott
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

Lexically-scoped LISP dialects offer great flexibility and expressive power. Unfortunately, they tend to be inefficiently implemented, because many interpreter structures such as variable binding environments must be allocated in the heap rather than on the stack. One solution to this problem is to allocate them on the stack, then move them to the heap if necessary. This means moving the environment of a function only if it passes an environment pointer to the last function it calls, returns an environment pointer as a value, sets a global variable to one, or CONSes one into a list structures. To make this work, the interpreter must be able to tell which current environments a function call is the last function call of, and must know exactly what parts of the stack can be moved. This approach saves dramatically on garbage collections, at the price of increasing function application time a bit. It is worth doing if free storage is not abundant, or if it is important to avoid garbage collections.
Optimized machine-independent extended FORTRAN for minicomputer programming
Authors: Gordon Bennett-Novak
Venue: ACM SIGPLAN Notices (1976)

A FORTRAN compiler is being developed to aid in writing systems and application programs for minicomputers. The compiler is machine-independent in the sense that it can be made to generate code for a new machine with relatively little effort. The FORTRAN language accepted by the compiler is extended to facilitate the writing of &ldquo;systems&rdquo; programs. Particular emphasis is placed on optimization of the generated code for efficiency of storage utilization.
A Framework for Concurrency Control in Real-Time Distributed Collaboration for Mobile Systems
Authors: D. Janaki Ram, M. A. Maluk Mohamed, V. R. Devanathan
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Real-time distributed collaboration applications are characterized by close co-operation among processes. Concurrency control and timeliness of the response are essential requirements for such applications. As mobile systems are characterized by frequent disconnections and physical mobility from one cell to another, providing real-time distributed collaboration for mobile systems is a real challenge. In this paper, we propose a framework for concurrency control in real-time distributed collaboration applications for mobile systems. We view mobile systems as a three-tier architecture and propose a data-centric framework for optimistic concurrency control. The framework is built on top of a totally ordered exactly-once multicast protocol. Our model ensures that number of messages on the wired network is independent of the number of mobile hosts in the system. We have implemented and tested our framework by developing a collaborative text editor application over exactly-once multicast protocol.
SYNGLISH - a high level query language for the RAP database machine
Authors: Tamer M. Ozso, Esen A. Ozkarahan
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

This paper describes a high-level query language developed and implemented for the RAP database machine. The language, called SYNGLISH, is based on the semantic structure of the English sentences. The software system developed accepts SYNGLISH queries and produces RAP assembler code which is then executed by the RAP software emulator.
Recursive programming through table look-up
Authors: Daniel P. Friedman, David S. Wise, Mitchell Wand
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

The maintenance of arbitrarily large tables of previously computed values for functions on integer domains becomes practical when those tables are built using constructor functions which suspend evaluation of their arguments. Two styles of programming with such tables are presented. The first results from replacing recursive invocations within standard recursive function definitions with a reference into a table which is predefined to be all the possible results of the function. The second, more sophisticated, style requires that the table be defined strictly through a generation scheme. In either case the table may be available to the user as a data structure exclusive of the function definition with entries still being manifested only when they are actually used.
A network approach to APL implementation
Authors: M. D. Harbinson, L. J. Howard
Venue: Proceedings of seventh international conference on APL (1975)

This paper originated in a study made of the possibility of building an APL system capable of supporting more than one thousand simultaneous interactive users. when the number of ports is as large as one thousand, the traditional configuration for an APL system, with all terminals connected to a large general purpose computer, is quite infeasible. The reason is simple. The CPU loading imposed is far beyond the capacity of any existing computer. So the decision was made that the workload must in some way be spread amongst a number of processors, which must then be connected in order to provide inter-user communication. Having adopted this approach, it became clear that the optimum configuration is a network type system with a large number of quite small processors. Such an APL network is described in the remainder of this paper.
Applications of the theory of random graphs to average algorithm performance analysis
Authors: Henry K. DeWitt
Venue: Proceedings of the 1979 annual conference (1979)

In the past, most algorithmic analysis has centered On the determination of the worst case performance. In real world applications, the average performance of an algorithm is of far more interest. In this paper, we use the results of the theory of random graphs to aid in the design and analysis of more efficient graph theoretic optimization algorithms. The results show that the theory of random graphs can be a powerful tool in the analysis of average algorithm performance. The topics covered in this paper include a discussion of one to one shortest path algorithms, minimum spanning tree algorithms, and algorithms for the traveling salesman problem. We conclude with a discussion of areas for future research. The purpose of this paper is to give a flavor of what is possible using the theory of random graphs. Thus the discussion is kept relatively free of mathematical detail.
Simulation as a vehicle for project experience
Authors: J. D. Powell, M. J. Lee
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

One of the criticisms directed at many computer science programs is the lack of involvement of the students in &ldquo;large scale, real-life problems&rdquo;. Panel discussions between computer science educators and computing practitioners frequently devote a great deal of time to this topic. The practitioners charge that students are frequently presented with well-defined problems that illustrate specific computing concepts. While these problems are important, they do not prepare students for the ill-defined problems they will typically face in a usual job situation. Since a large portion of the graduates from our degree programs move directly into the business and industrial environments, we should seriously consider this criticism. Separate project courses have been described by Khailand and Saxon [2] and by Crenshaw [1]. In these courses, a series of projects are presented to the students. Depending on the size of the class, one or more of the projects are chosen and the class is divided into teams to work on the projects. Classroom time is devoted to organizational structure, skills, and techniques that are important to successful completion of a project satisfying the standards and requirements of the project assignment. Most of the work is performed within the individual teams. The instructor meets periodically with the students to review and monitor their progress. At the end of the course, each team is required to make a formal presentation of its results.
An approach to teaching simulation to undergraduates
Authors: Maurice F. Aburdene, David Finkel
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Although traditionally a subject for graduate study, simulation has recently been included in many undergraduate curricula. After a discussion of the objectives of a simulation course for undergraduates, this paper recommends an approach to teaching such a course which makes use of a commercially available simulation language, such as GPSS or SLAM. This approach is discussed in relation to the course objectives. Finally, the results of the authors' experience with this approach are discussed.
Visual Data Extraction from Bi-Level Document Images Using a Generalized Kernel Family with Compact Support, in Scale-Space
Authors: L. Remaki, M. Cheriet
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper presents a generalization of a new kernel family with compact support in scale space which we recently published. We have shown that the proposed kernels are able to recover the information loss when using the Gaussian kernel while they drastically reduce the processing time. Furthermore, the generalized kernel family preserves all the properties of the previous one and it offers other important properties, like the behavior of the first and second derivatives which are guaranteed to be the same as the Gaussian kernel one at any scale space. The latter property plays an important role in image processing as we will show in this paper. The construction and some properties shown in the previous version are recalled and some of the new properties of the new version are proven. An application of extracting handwritten data from noisy bi-level document images is presented to point out the practical impact of the improved version of the proposed kernels.
Workload representations in queueing models of computer systems
Authors: John Zahorjan
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

There are two basic representations of workload populations in load independent, separable queueing network models. These correspond to the notions of open and closed classes, an open class being one in which customers may arrive and depart the model, and a closed class being one in which the number of customers is fixed. This paper examines the effect on mean system performance measures of the workload representation chosen. Open and closed representations are compared under the equivalency constraints that they result in identical system throughput or mean system population level for the class being considered. It is shown formally for a limited class of networks that the open representation results in larger system response times than equivalent closed representations, and that one of the closed representations results in the smallest system response time of those considered. Extensive numerical results show for a more general class of models that there is a strict ordering (in terms of system response time) of the natural class representations considered. These results can be used in at least two ways. One is to guide the initial representation of computer system workloads in performance models. The other application is as a component of approximate analysis techniques for queueing models that decompose individual networks into multiple submodels, each of which is then solved in isolation. Here the goal is to represent customer classes in each submodel in a way that is convenient computationally, and that results in performance measures closely matching those observed in the full network. It is this latter application that we assume in this paper. An example of the application of our results to an existing approximation technique is given.
Facet: A procedure for the automated synthesis of digital systems
Authors: Chia-Jeng Tseng, Daniel P. Siewiorek
Venue: Proceedings of the 20th Design Automation Conference (1983)

In the past decade significant effort has been devoted to the development of methodologies for design at the register-transfer level. However, effective and versatile procedures are still not available. This paper presents an efficient procedure for the automated synthesis of data paths at the register-transfer level. The procedure minimizes the numbers of storage elements, data operators, and interconnection units. In addition, the procedure has the capability of exploring alternatives in the design space. In some preliminary experiments the procedure produced designs nearly identical to commercially produced designs.
Recent numerical experiments comparing successive overrelaxation iterative methods with implicit alternative direction iterative methods
Authors: H. S. Price, R. S. Varga, R. M. Fitzgerald
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Recent theoretical advances in variants of both the successive overrelaxation iterative methods (such as the Golub-Varga cyclic Chebyshev semi-iterative method (196l) and the implicit alternating direction iterative methods (such as the Wachspress-Habetler normalized Peaceman-Rachford iterative method (1960))suggest extensions of the numerical experiments by Young and Ehrlich (1959) comparing these iterative methods. These experiments were carried out on the IBM-704 and 7090 for the set of problems originally considered by Young and Ehrlich, with the addition of a set of numerical problems encountered in the petroleum industry.
Capability requirements in a multimicro processor, hardware/software simulation environment
Authors: Paul J. Drongowski
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

As part of the research into computer assisted development of microprocessor based systems, a set of target machine independent software tools have been developed for the PDP-11. This set of tools includes a general microassembler and simulator system. The development software adapts to target processors through the use of machine descriptions in a register transfer notation. This report discusses some of the requirements placed upon a simulator system in a multimicro processor, hardware/software simulation environment.