ppxscal/embedding_network huggingface dataset:
Determining the equivalence of algebraic expressions by hash coding
Authors: William A. Martin
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

In algebraic manipulation one often wants to know if two expressions are equivalent under the algebraic and trigonometric identities. One way to check this is to substitute a random value for each variable in the expressions and then see if both expressions evaluate to the same result. Round-off and overflow errors can be avoided if the evaluation is done modulo a large prime number. Of course, there is still a small probability of a random match. If arithmetic expressions in exponents are evaluated, using the same prime number then identities such as xl/2 ï¾ xl/2 &equil; x will not necessarily hold. However, by proper choice of the prime number and the use of special case checks these identities as well as many trigonometric identities can often be preserved.
Automatic pipe routing and material take-off system for chemical plant
Authors: Yoshio Matsui, Hironori Takagi, Shigekazu Emori, Norio Masuda, Shohei Sasabe, Chuzo Yoshimura, Toshikazu Shirai, Susumu Nioh, Bunzi Kinno
Venue: Proceedings of the 16th Design Automation Conference (1979)

An automatic pipe routing system for chemical plants is described. This system determines routes of pipes and positions of fittings and summarizes piping material data.
Computer aided graphics in architecture and planning workshop
Authors: Kaiman Lee
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A one-hour tutorial introduction will be followed by a three-day demonstration workshop of the ARK-2 application system for architects. The ARK-2 system has potential for other professions as well.
Quantitative aspects of software validation
Authors: Raymond J. Rubey
Venue: Proceedings of the international conference on Reliable software (1975)

This paper discusses the need for quantitative descriptions of software errors and methods for gathering such data. The software development cycle is reviewed and the frequency of the errors that are detected during software development and independent validation are compared. Data obtained from validation efforts are presented, indicating the number of errors in 10 categories and three severity levels; the inferences that can be drawn from this data are discussed. Data describing the effectiveness of validation tools and techniques as a function of time are presented and discussed. The software validation cost is contrasted with the software development cost. The applications of better quantitative software error data are summarized.
Characteristic program complexity measures
Authors: James L. Elshoff
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Twenty program complexity measures are studied with respect to how well they identify the more complex procedures in a software system. The measures have been applied to three large sets of PL/I procedures representing three different types of applications. Four of these complexity measures have been found to form a characteristic set. That is, when procedures are kept within reasonable bounds for the four selected measures, they will most likely be within reasonable bounds for all of the other measures. The measures and their interpreted meanings are length&mdash;the quantity of source code, unique operators&mdash;the variety of programming language actions, data difficulty&mdash;the average number of variable appearances, and unique operands&mdash;the variety of constants and variables.
The development of the SIMULA languages
Authors: Kristen Nygaard, Ole-Johan Dahl
Venue: ACM SIGPLAN Notices (1978)

The organizers of this conference have told us that we should write at least 25 pages of manuscript, but that we may produce as many pages more as we wanted. Perhaps they did not envisage the possible consequences, but we have taken their words at face value. This paper has implied a vast amount of work and archeological activities. We are grateful to SIGPLAN for defining a task to which resources had to be allocated by our institutions and which forced us to write down an account of our work from 1961 to 1971. While we are writing this preface, those years are very much alive to us. We realize that we lived through this period in a state of semimadness, a combination of very hard work, frustration, and euphoria.
An algorithmic classification of geometries in general relativity
Authors: Jan E. Aman, Anders Karlhede
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

The complicated coordinate transformations in general relativity make coordinate invariant classification schemes extremely important. A computer program, written in SHEEP, performing an algorithmic classification of the curvature tensor and a number of its derivatives is presented. The output is a complete description of the geometry. The problem to decide whether or not two solutions of Einstein's equations describe the same gravitational field can be solved if the (non-) existence of a solution to a set of algebraic equations can be established. The classification procedure has been carried through for a number of fields, and solutions previously believed to describe physically different situations have been shown to be equivalent. We exemplify with a physically interesting class of geometries.
Graphic applications subroutine packages
Authors: William L. Dunne
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

The Graphic Applications Subroutine Package, GASP, is a set of interdependent two-dimentional programs capable of producing drawings on an automatic digital plotter. GASP was justified and developed in an engineering support environment to satisfy certain requirements within the workload responsibilities of a production drafting room and within the engineering areas. In FORTRAN (G or H level) for the IBM System/360, the package utilizes plotter dependent routines through a simple standard interface. Users with minimal FORTRAN experience can produce drawings using basic geometric elements drawn with selected line types and widths. More experienced users invoke multiple level transformations to manipulate groups of elements as subpictures and utilize features for drafting dimensioning and automatic pen-width compensation. The paper presents features and design philosophy of GASP, and comments on its use and extension. Simple graphic programs are presented along with several representative samples of production artwork.
An approach to describing a data link level protocol with a formal language
Authors: J. Harangozó
Venue: Proceedings of the fifth symposium on Data communications (1977)

A method approaching the formal description of protocols is presented. The method -based on formal languages - utilises the relationship between the formal languages and automata and allows the dialogue between two partners/stations, units of equipments, processes, etc./ to be defined in a formal way. The paper considers a data link level protocol, the High Level Data Link Control Procedure. Two basic models are given: the first is for the description of the operation of the stations in half-duplex, the other for the full-duplex transmission mode. A number of other improved models are introduced taking into consideration the effect of time-out, unknown frame, sequence numbering and the request for retransmission frames with a sequence number. It is shown that the models can follow the way of avoiding the deadlock situation, and the formal grammars are more advantageous for modelling complicated systems than are automata. The advantages and limitations of the approach is emphasized by comparing it with approaches elaborated by other authors.
Functional requirements for very large knowledge bases
Authors: E. Babb
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

A large knowledge based system can be considered equivalent to a large data base system; but, instead of the more usual algorithmic rules, most of the rules are expressed in the form of specifications. Such a form of expression has the considerable advantage that theorem provers can be used to detect inconsistencies between the rules. The proposed general architecture can be summarized in a diagram: (Diagram) In this diagram, the APPLICATION involves physical variables such as time, part, distance, etc. The MODEL of the application defines a relationship between any combination of the corresponding mathematical variables. This is because the model contains general rules which relate these variables. These rules come either &bull;from the user, who himself has induced general rules about the data, or &bull;from the system's own GENERALISER, an adaptive pattern recogniser which induces rules from the data.
The Wisconsin Tax Model system
Authors: David Burress
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

A simulation model is a device, generally a computer system, for predicting responses to actions in the real world; a simulation model operates by calculating the effect on given initial conditions which would follow from a set of processes which have been described to the computer. A microfile model is one which incorporates a large mass of sample data about individuals &mdash; usually households, persons, or business firms &mdash;directly into each simulation (in contrast, a macro-econometric model would employ a relatively small number of statistical averages, moments or correlations.) Empirical studies of taxation economics have relied increasingly on microfile simulation models; most noteworthy is Pechman and Okner's study of U.S. tax incidence[1]Microfile studies of tax incidence at the state level are being performed in Colorado and Wisconsin; the latter study employs the Wisconsin Tax Model, which is the subject of this paper.
Will your bridge stand the load? (Position Paper)
Authors: A. E. Fitch
Venue: Proceedings of the 17th Design Automation Conference (1980)

The successful exploitation of LSI for creating products with greater function at reduced cost per operation is critically dependent on the availability of design systems that comprehend the job to be done. As system and component technologies continue their rapid rate of development, there is an increasingly higher probability that our ability to capitalize on them will be severely impacted by the lack of appropriate design system technology development. These impacts will take the form of our inability to deliver an affordable product to the marketplace while the demand still exists and before the technology is completely absolete. This position statement is not intended as an indictment of those who presently plan and implement &ldquo;DA&rdquo; but rather it is a warning to both users and developers of DA indicating where we will end up unless we look beyond the activities that engage us today and change our focus from &ldquo;Design Automation Tools&rdquo; to &ldquo;Product Design Systems&rdquo;.
Organizing a class in microcomputer to mainframe communication
Authors: William E. Mihalo
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

Northwestern University, has a large number of users with their own microcomputers. Many of these microcomputer owners are interested in terminal emulation, and communication at baud rates approaching 9600. This paper describes the problems encountered in trying to meet the needs of users who attempt to communicate between their microcomputers and the mainframes available at Northwestern.
Process Design engineering a Methodology for Real-time Software development
Authors: S. N. Gaulding, J. D. Lawson
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper describes the Process Design Methodology, a disciplined engineering approach to development of a Real-Time Software Process. The approach described is part of an overall software research thrust, sponsored by the BMD Advanced Technology Center, which is directed at resolving fundamental problems of excessive cost, failure to meet schedules, and inadequate performance associated with the specification, design, implementation, and testing of BMD software processes.
VLSI Implementation of a Foveal Polygon Segmentation Algorithm
Authors: F. J. Coslado, P. Camacho, M. González, F. Arrebola, F. Sandoval
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Conventional vision systems with uniform resolution sensors contain a huge amount of information, great part of it not necessary for the tasks they are intended. This fact difficult processing at speeds that may be desirable for many applications. Opposed to this option, foveal vision offers a wide visual field and high resolution in a small area of the image with a reduced data set, allowing to do real time image processing in many applications. In this field have emerged a great deal of algorithms and hierarchical structures to support the processing of this type of images. In this paper we present an VLSI architecture that implements a level sequential segmentation algorithm in one of these hierarchical structures (a polygon) generated using a Cartesian symmetric lattice topology. This structure is designed to work at real time (20-30 frames/second).
Application of statistical methods to number theory (Clustering of Primes)
Authors: Michael E. Neyer
Venue: Proceedings of the ACM annual conference (1973)

For the purposes of this paper I will define clusters of N primes in M numbers, as the occurrence of N prime numbers in a range of M consecutive numbers. The maximum clustering K in a range of L consecutive numbers is defined as, the number of integers in the range which are not eliminated by any prime number less than (M+1)/2. If M and N can satisfy two conditions, then there are an infinite number of such clusterings (i.e. prime pairs). First, for all J, the maximum clustering K for the range (aJ+b to aJ+b+M&minus;l) is greater than or equal to N. Second, there exists a range L such that for all I for the maximum clustering K in the range (IL+d to IL+d+L&minus;1), the ratio of K/L is less than or equal to 1/N. Due to the complexity of the notation for the proof, I could not fully explain the basic equation in this abstract.
Decentralized computation
Authors: Philip C. Treleaven, Richard P. Hopkins
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

For a decentralized computing system of many computing elements (whether geographically distributed mainframe computers, or miniature computing elements within a single board or even chip), a naturally decentralized model is prerequisite for the organization of computation. This will allow a large number of computer elements to cooperate in the execution of a program. Computational models used in parallel computers (data flow, control flow, and reduction) help to identify the attributes of such a decentralized and general-purpose model. This paper examines data flow, control flow, and reduction models and presents a classification for their underlying concepts. In addition, it describes a computational model called recursive control flow, which is a synthesis of these concepts and which directly supports data flow, control flow, and reduction computation.
Application downloading
Authors: Robert Balzer, Alvin Cooperband, Martin Feather, Philip London, David Wile
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The purpose of our research is to investigate the feasibility of this methodology for distributed application development by examining possible approaches to carrying out such developments. In particular, our emphasis lies in transformation technology, wherein user-invoked source-to-source transformations are applied to the partitioned system for the purpose of optimizing the transactions required to effect the distributed behavior. In this way, the application downloading system need only produce a correct partitioning of the original program, not an efficient one. The user, with system guidance, optimizes the partitioned program by applying transformations chosen from the system library. Thus, application downloading can be viewed as a narrow domain in which to apply the transformation technology we have developed elsewhere in a broader context(1).
Invited papers: Information processing in military command
Authors: W. F. Bauer
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

OF THE MANY TECHNICAL areas in military electronics, information processing in command and control is getting considerable attention and is providing one of the greatest challenges among defense activities. Despite this, it is probably the technical area least understood and the least implemented to date. The subject to be discussed involves the processing of information in direct support of the command processes. It, therefore, includes topic on personnel, weapons, logistics and sensor systems as needed in the command process, although it is not primarily oriented toward these areas. The systems provide the data processing needed to supply information to the commander and his staff; therefore, one of the most salient characteristics of such systems is that they have a man/machine aspect.
Modular simulation package for product design studies
Authors: Dennis B. Ulrich
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

A simulation package designed to facilitate the creation and execution of large FORTRAN based simulations has been developed by the Xerox Corporation. After a discussion of the model assumptions required to use the package, this paper discusses the key components of the package. This explanation includes the structure of the simulation models and data, the preprocessors used to interface the models to the simulation executive, and the capabilities of the executive. To provide a concrete understanding of the package a simple model is developed, interfaced, and executed.
Digital communications technology (Tutorial)
Authors: Edward A. Berg
Venue: Proceedings of the 1971 26th annual conference (1971)

The Datran System, a digital switched network, proposes to integrate electronic switching technology from the computer industry and digital technology of command and control systems with technology of microwave and optical transmission in both terrestrial and outer space. The selection of the proper elements from each of these technologies has been evolving over the last three years. As new technological opportunities appear they are evaluated and merged into the system if economically sound. The best interests of the user will be served by the integration of available technologies from a variety of sources.
APL language summary
Venue: ACM SIGPLAN Notices (1978)

APL is a general-purpose programming language with the following characteristics (reprinted from APL Language [4]): The primitive objects of the language are arrays (lists, tables, lists of tables, etc.). For example, A+B is meaningful for any arrays A and B, the size of an array (&rgr;A) is a primitive function, and arrays may be indexed by arrays as in A[3 1 4 2]. The syntax is simple: there are only three statement types (name assignment, branch, or neither), there is no function precedence hierarchy, functions have either one, two, or no arguments, and primitive functions and defined functions (programs) are treated alike.
An event trace monitor for the VAX 11/780
Authors: Stephen Tolopka
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

This paper describes an event trace monitor implemented on Version 1.6 of the VMS operating system at Purdue University. Some necessary VMS terminology is covered first. The operation of the data gathering mechanism is then explained, and the events currently being gathered are listed. A second program, which reduces the data gathered by the monitor to usable form, is next examined, and some examples depicting its operation are given. The paper concludes with a brief discussion of some of the monitor's uses.
An application of graph theory to software test data selection
Authors: M. E. Stickney
Venue: ACM SIGSOFT Software Engineering Notes (1978)

Graph theory is playing an increasingly important role in the design, analysis, and testing of computer programs. It's importance is derived from the fact that flow of control and flow of data for any program can be expressed in terms of directed graphs. From the graph representing the flow of control, called the program graph, many others can be derived that either partially or completely preserve the program control structure. One derived graph known as a cyclomatic tree is of particular value in program testing. It is so named because the number of leaves of the tree is equal to the cyclomatic number of the program graph. A thorough treatment of cyclomatic numbers is provided in [3]. A program called the Complexity/Path Analyzer (CPA) has been developed that builds and utilizes a program cyclomatic tree to provide test planning information, automatically place software counters called probes as discussed in [9] and [10] in a program, and provide selected parameters such as program length and program graph cyclomatic number. The paper discusses the features and derivation of cyclomatic trees as well as their value and application to testing and test data generation. A cyclomatic tree provides a test planner with information useful for planning program tests. In particular, it furnishes test data selection criteria for developing tests that are minimally thorough as defined by Huang in [9]. A test data selection criterion will be defined as minimally thorough if any complete test with respect to the criterion is at least minimally thorough. The term complete is used as defined by Goodenhough and Gerhart in [13]. A test is defined to be a non empty sequence of test cases. Each test case consists of an element selected from the input domain of the program being tested. The paper discusses the merits of one particular technique selected to achieve a minimally thorough test data selection criteria. Part of the technique is automated by the CPA program.
The inherent ambiguity partial algorithm problem for context free languages
Authors: Joseph S. Ullian
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

It is shown that there is no &ldquo;partial algorithm&rdquo; (effective procedure that may fail to terminate) by which, given a context free grammar, one can always find an unambiguous context free grammar generating the same language if such an unambiguous grammar exists. The argument turns on the degree of unsolvability of the inherent ambiguity problem for context free languages.
Computer user cooperatives: Providing user services to grower-producers
Authors: L. Edward White, Benjamin G. Mullinix
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The type of computer used largely determined the capability of the user before the advent of integrated circuit computers of the early sixties. Until then, most substantial computer complexes required a vast housing facility needing huge cooling capacity. The large-scale integrated-circuit computers of the late sixties made available a new technology called time-sharing which permitted for the first time use of large numbers of interactive terminals. Computer technology during this period was developed in conjunction with the needs of the space and military research projects. Changes occurred in software technology during the same period which enabled users to utilize the computer more to their advantage. This was due in part to the development of easy-to-use languages with simple commands expressed in common English. The greatest breakthrough in technology came when software was married to the hardware to produce a virtual-memory environment enhancing both storage and processing capabilities.