ppxscal/embedding_network huggingface dataset:
Discrete rational approximation in the L1 and L@@@@ norms using the Simplex Method
Authors: Edward Hill,  Jr.
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

An extended Levenberg-Marquardt method for non-linear curve-fitting in the L2 Norm is used for rational approximations in the L1 and L@@@@ norms using the Simplex Method. The coefficients of the approximation are determined by the Simplex Method so as to minimize the error in the L1 and L@@@@ norms. The iterative method used gives the desired coefficients for rational approximation problems. Finally, some numerical results are presented.
The daughter of CELIA, the french flag and the firing squad
Authors: G. T. Herman, W. H. Liu
Venue: Proceedings of the 6th conference on Winter simulation (1973)

In earlier work (1, 2) we have reported on a program, called CELIA, for simulating the behavior of linear iterative arrays of cells. The action of a cell is influenced by both its neighbors. Our main application area was biology, where the program can be used to test hypotheses about the developmental rules for organisms. More recently we have been applying our program to test proposed solutions to some fairly complicated biologically based problems. We have investigated (3) whether one can achieve regulative global polarity in organisms without polarity in individual cells, by solving the French flag problem of Wolpert (4) using only symmetric elements. In our attempted simulation of pigmentation patterns on the shells of sea-snails, we have found it necessary to find a solution to a generalized version of the firing squad synchronization problem (3), in which the firing squad is growing while it is trying to synchronize itself. We found that our original program CELIA was somewhat awkward for simulating such complicated situations. A new program has been devised where the state of the individual cells is described by an array of attributes, such that each attribute itself may be a list structure. The present paper reports on these changes and explains how they turn out to be useful in the applications mentioned above.
On the extremely fair treatment of probabilistic algorithms
Authors: Amir Pnueli
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

A proof system based on linear temporal logic for the qualitative verification of concurrent probabilistic programs is proposed. The concept of extreme fairness is introduced as an approximation to the notion of probabilistic executions. The proof system proposed is shown to be relatively complete with respect to validity over all extremely fair computations. The proof methodology is demonstrated by proving correctness of a new probabilistic algorithm for solving the mutual exclusion problem ([CLP]).
Numerical methods and the micro: Color graphics as an aid to comprehension
Authors: William E. McBride
Venue: ACM SIGCSE Bulletin (1983)

Most of us that teach in the numerical analysis/numerical methods area have been relying on large mainframes for years as a valuable tool in solving our problems of any size. Thus when the micros came along a few years back our natural inclination was to avoid them since they appeared to have nothing new to offer us. We perhaps thought &ldquo;How could such a small machine compete with the real number crunchers we had become enamored with?&rdquo; However, we only have to read the popular press to see the impact they are having all around us. Hence, it became imperative that we do look into the possibility that maybe they can make some valuable contributions. As Kelch and Hansen [1] implied in their article, there are many small colleges that can ill-afford the cost of a mainframe or even a mini but still they wish to teach meaningful courses. Aside from this perhaps there are concepts that can be illustrated in a more meaningful fashion even if a super-mini or mainframe is available. It was in this later vein that this project was undertaken. After viewing the rather amazing graphics that one could realize on an Apple II in a game-playing environment, the author decided that there must be some way that they could be used in a meaningful way in a classroom or course. The purpose of this report is to discuss the way that the Apple II graphics were used to display several popular numerical algorithms. It should be pointed out here that there is nothing special about the Apple II and the graphics did not have to be done in color to illustrate most of the important points. It was simply the case that the author used the type of machine that was most readily available to him. It was the author's feeling that beginning numerical methods students could more readily relate to many of the techniques if they had a visual image to relate to. The old adage &ldquo;a picture is worth a thousand words&rdquo; comes to mind. Although it is possible to give graphical illustrations in a textbook and in class, typically this is such a time-consuming task that one can only look at a few special cases. It was the plan of the author to allow the programs to accept a variety of functions for actual implementation by the user. The student will be able to alter various parameters as he runs an algorithm which will allow him to answer questions like &ldquo;What if I do the following?&rdquo;
One-step methods for nonlinear n-th order integro-differential equations
Authors: Walter A. Snow
Venue: Proceedings of the ACM annual conference (1973)

The general n-th order integro-differential equation (1)[equation] where the vector &ymarc;(x) represents the vector of y(x) and its n-1 derivatives (2)[equation] has a unique family of solutionsy (x ), with one solution for each initial condition y(xo) &equil; Yo One-step methods for numerically approximating these solutions are defined as satisfying (3)[equation] These methods are shown to converge to &ymarc;(x) iff &fgr;and &psgr; are consistent with the integro-differential equation (1), and several numerical examples are developed as demonstrations. The rate of convergence for y(x) is O[h2n-min(p, q-1, r-1)]; where p, q, r are the orders of the highest derivatives actually used in f, K(x), and K(s) respectively.
Aquatic simulation on secondary cooling for ECCS
Authors: Meyer Katzper
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Using a series of &ldquo;logical switches&rdquo; this model simulates an aquatic ecosystem; The model considers the influence of physical factors such as chemical nutrients and temperature in conjunction with a study of the interaction of trophic levels. The model is constructed as a series of modules each with its own threshold conditions. This allows for a study of the possibilities starting at the lowest trophic level. The use of threshold conditions results in efficient simulation and allows for a correspondence with variables that can be observed experimentally.
ADL: An algorithmic design language for integrated circuit synthesis
Authors: W. H. Evans, J. C. Ballegeer, Nguyen H. Duyet
Venue: Proceedings of the 21st Design Automation Conference (1984)

The Algorithmic Design Language (ADL), provides a means to procedurally describe the functional, circuit, schematic and mask aspects of integrated circuits. The constructs of this language have been coded in the C language and are intended for application to IC design. C programs that incorporate ADL routines are executed to build a data base from which CIF files, input files to circuit simulation programs or a textual representation of ADL's own highly structured data base can be generated.
Gate for gate modular replacement of combinational switching networks
Authors: Douglas C. Schmidt
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Design automation processors are best known for their ability to competently accomplish the more tedious tasks in computer design. Almost invariably they are restricted to tasks which occur after the logic design is completed (diagnosis, partitioning, assignment, routing, etc.). The procedure presented in this paper may be applied to take fuller advantage of the computer's capabilities.
Quasi-Behavioral Objectives for curriculum specification
Authors: Lynne J. Baldwin
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

Quasi-Behavioral Objectives supersede the usual course descriptions, as are found in Curriculum 68 and college curriculum syllabi, by also describing the required behavior of the student and the learning level in the specified content area. The specification of an entire curriculum based on these objectives facilitates a smooth interfacing of courses, both in the hierarchy of course materials and in the progressive skill levels of the students. The development process for the creation of a curriculum specification based on Quasi-Behavioral Objectives is described and uses of these objectives beyond curriculum specification alone are suggested.
An alternative approach to macro processing
Authors: Michael Hammer
Venue: Proceedings of the international symposium on Extensible languages (1971)

This paper presents the basic principles of, and the motivation for, an alternative method of processing syntax macros. The inspiration for this work derives from some obvious shortcomings and inefficiencies in conventional macro processing schemes. However, our primary interest is not in designing a faster macro processor; rather it lies in isolating the underlying ideas of syntax macros, realizing their implications, and producing a clean and economical scheme based on these principles. The compiler model in terms of which we shall couch our discussions is a very familiar one, namely that of the two-pass compilation process. The first pass consists of syntactic and semantic analysis, and converts a source language program into an intermediate language (computation tree) form, which represents the meaning of the program. The second pass is then either an object code selector or an interpreter.
Political determinants of system design and content
Authors: Ronald Webb
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Computerized information systems seemingly offer technical solutions to corporate organization and adjustment problems. This idea of the system as the solution has certainly become the focus of information industry rhetoric and sales propaganda. Industry advertising promotes ideas such as (1) the advantages of instant communication in the relative success of any business, or (2) the threat posed by the volume of information produced by a company and unorganized by a particular micro-system. The questions missing from the rhetoric and propaganda are what problems require solutions and what do those problems have to do with the capabilities of computerized information systems. The information industry has transformed these questions in a rather interesting way: they have been handed over to their sales and marketing divisions.
Efficient partitioning of components
Authors: Howard R. Charney, Donald L. Plato
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

This paper presents a technique for dividing a network of interconnecting components into groups of components so that the total number of interconnecting wires between groups tends to be minimized. The method of solution is noniterative, and provides good solutions using small amounts of computer time. The solution is based on the use of an electrical analogue which may be useful in aiding other design automation tasks.
An integer arithmetic path expansion algorithm
Authors: T. A. Weber, D. G. Schweikert
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Graphical display systems are often built around a minicomputer with limited word size, core, and instruction repertoire. Thus, plotting algorithms which do not need floating point software or hardware are particularly valuable. Since the usual (CRT) graphical display has limited resolution, the typical floating point evaluations of square roots and transcendental functions are often unnecessarily accurate. Extending the integer arithmetic functional plotting concepts, integer algorithms are presented for the calculation of Euclidean distance, plotting of lines perpendicular and parallel to a given line segment, and the calculations of the intersection of two (slant) lines, all to an accuracy of one screen unit. These algorithms are combined into an algorithm to plot the outline of a path expanded from a centerline of straight-line segments, with unrestricted orientations. The algorithms have been implemented on a PDP-8 minicomputer with a Tektronics 611 storage scope. They are routinely used to display integrated circuit mask descriptions.
Recent advances in user assistance
Authors: N. Relles, N. K. Sondheimer, G. P. Ingargiola
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)

As interactive users find conventional methods of training and documentation inadequate, designers are providing systems with online reference information, descriptions of valid input, elaboration of error messages, and explanations of a system's behavior. This paper describes some existing commercial systems that offer online assistance and more experimental approaches by the research community. The following material was originally presented at the SIGSOC conference on Easier and More Productive Use of Computing Systems. An extended version will appear in a special issue of the IEEE Transactions on Systems, Man, and Cybernetics (Volume SMC-12, March/April, 1982), and is reprinted here with the permission of the IEEE.Online user assistance is now offered on commercial systems and is the subject of investigation in experimental settings. It is difficult to compare the advantages and limitations of different approaches because they vary along many dimensions and because there is no commonly accepted terminology. A grouping of these dimensions into major categories is a necessary first step towards more empirical evaluations. The major software-related features of online assistance appear to fall into four categories: bull; access method -- the way users can construct or enter requests for assistance; bull; data structure -- the manner in which different portions of assistance information are related to each other; bull; software architecture -- how assistance requests and their responses are communicated among a user, an operating system, application programs, and the assistance database; and bull; contextual knowledge -- how much information is retained about the assistance environment, including the user, the application, and the tasks being performed.
An alchemical approach to brokerage
Authors: Dennis M. Earle
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

The essence of the commodities business is the ability to react quickly to evolving market conditions. Mocatta, a N.Y. based bullion dealer, is a firm which uses its Data Processing to provide both front office (trading) flexibility and back-office capacity to handle large volume days. The business is characterized by the constant trade-off of time against money. Corporate philosophy is to spend money to react quickly rather than to react slowly but perhaps at lower costs. The life cycle of a system in this environment normally begins with a marketing report reflecting a new market nitch which the firm can take advantage of. Data Processing is involved almost from the inception of the idea to provide an indication of what existing systems can do for this new opportunity. Because of the nature of the business, each new product offered is usually so unique as to make it impossible for existing systems to support a new product from a trading point of view. Back-office applications are somewhat more common across products, so existing systems can usually provide some support. The key point is that all we really know is that we want to market the new product. Some idea of the time frame in which the product is to be offered is also obtained. The exact workings of defining the product and determining the parameters under which it will be traded usually remain to be worked out prior to the offering date. This therefore means that we have, at the point of commitment, the necessity for evolving data processing support in the same time frame in which the definition is evolving about what it is that we are to support.
Enhancing the usability of an Office Information System through direct manipulation
Authors: Alison Lee, F. H. Lochovsky
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

In Office Information Systems, the primary focus has been to integrate facilities for the communication and management of information. However, the human factors aspects of the design of office systems are equally important considerations if such office systems are to gain widespread acceptance and use. The application of design techniques from Human Factors can help enhance the usability of an office system. In this paper, we describe the user interface of an office system developed by adapting such design techniques.
Subtree replacement systems: A unifying theory for recursive equations, LISP, lucid and combinatory logic
Authors: Mike O'Donnell
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

Recent work on computation of functions defined by sets of recursive equations by Cadiou [Ca72], Vuillemin [Vu74] and Downey and Sethi [DS76] depends on semantic interpretations of such equations. A purely syntactic, combinatory approach yields similar results for a much wider class of sets of equations, including sets of defining equations for LISP, Lucid and the combinator calculus. The application to LISP proves several conjectures of Henderson and Morris [HM76].
SICSOFT (Panel Session)
Authors: Barry W. Boehm, Richard Fairley, Warren Franz, Raymond Yeh, Anthony I. Wasserman
Venue: Proceedings of the 1976 annual conference (1976)

This panel discussion will focus on software engineering education and training programs: goals, constraints, and methods as seen from different perspectives. Panelists will include both educators and practitioners in the field of software engineering. Following brief statements by each panelist, the discussion will be opened to audience participation in an effort to maximize the interchange of information and ideas. Emphasis will be placed on the interface between formal education and actual practice in software engineering, rather than on the internal details of specific educational programs or software development methodologies. The current status of software engineering curriculum development will be described.
An experimental Computer Science problem seminar
Authors: Ronald Alter, Thaddeus B. Curtz
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

In conjunction with the development of a new Master's degree program, yet to receive final approval, the University of Kentucky Computer Science Department has devised and implemented a problem seminar. Students who enter graduate training in the department are required to present four of six specified items of academic background. It has been our experience that they present these credentials but have little working knowledge of their relation to Computer Science. The seminar is therefore designed to encourage the student to use and apply certain techniques he is expected already to know. On the other hand, we make no great point of this with the students-the problems are presented to them (usually) without comment on the expected method of solution; although the background, importance and relevance of the problem is discussed. In what follows we discuss the objectives of our seminar, how it is organized to attain these objectives, and finally our plans for the future development of the course. We conclude by speculating briefly how we might best employ a third classroom hour.
Compiling prolog programs for parallel execution on a cellular machine
Authors: Alexis Koster
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This paper investigates features of a PROLOG compiler for Mago's cellular machine. The compiler generates parallel FFP (Formal Functional Programming) code. Hence high efficiency in the execution of PROLOG programs can be achieved on this machine, owing to the almost unbounded parallelism it can accommodate. Techniques for implementing the parallel evaluation of the clauses of a relation (OR parallelism) are given. Problems in the exploitation of the parallel evaluation of a conjunction of goals (AND parallelism) are discussed. An FFP representation of the run-time environment of PROLOG is given. It is based on a previously published FFP implementation of unification. It allows matching of arguments through unification in linear time and space.
An approach to a multifaceted student information system in large medical school.
Authors: F. Clancy, S. Hoke, T. Mullan
Venue: Proceedings of seventh international conference on APL (1975)

The Faculty of Medicine of the University of Toronto presently provides a complete undergraduate, postgraduate and speciality curriculum for over 2000 students. The physical facilities of the medical school are located in several buildings on campus as well as eleven teaching hospitals in the surrounding city. It was decided due to the existing size and complexity and an anticipated 28% increase in enrolment (which will bring the number of graduates to 320 per year) that some use would be made of data processing techniques to relieve the administrative workload of both academic and nonacademic staff. The area which seemed most practical was the development of a combined Student Record and Computer Administered Examination System. Here is an overview of the system with the arrows indicating access routes, and interrelationships with the files.
High-speed concurrent fault simulation with vectors and scalars
Authors: E. Ulrich, D. Lacy, N. Phillips, J. Tellier, M. Kearney, T. Elkind, R. Beaven
Venue: Proceedings of the 17th Design Automation Conference (1980)

Basic goals for logic and fault simulation are accuracy, execution speed, and modeling ease. Accuracy means that adequate state and timing detail must be maintained, and that good and faulted networks must be simulated with equal accuracy. High speed simulation is desirable to perform massive fault simulations of large networks, and modeling ease is desirable to build models easily and quickly. It should be observed that some of the above goals are in mutual conflict. For example, modeling ease and high execution speed are normally only achievable by a sacrifice in accuracy, and high accuracy is only possible by more elaborate modeling efforts or slower execution speeds, or both. As a consequence it becomes important to achieve a balance between these goals. The balance achieved here, in part dictated by the demands of fault simulation, emphasizes execution speed, adequate accuracy, and a simple modeling method. A new logic and fault simulator, VOTE (Verification of Test Effectiveness) is described. The specifics to be described here fall into two categories: those which are of general interest, and those which are strictly implementation items.