ppxscal/embedding_network huggingface dataset:
muFP, a language for VLSI design
Authors: Mary Sheeran
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

In this paper, we present a VLSI design language &mgr;FP, which is a variant of Backus' FP [Backus 78, 81]. &mgr;FP differs from conventional VLSI design languages in that it can describe both the semantics (or behaviour) of a circuit and its layout (or floorplan) [Sheeran 83]. We chose to base our design language on FP for several reasons. Functional programs are easier to write and to reason about than imperative ones. We hope to bring some of these benefits to IC design. FP, in particular, is designed to allow the programmer to reason about his or her programs by manipulating the programs themselves. Likewise, in &mgr;FP, programs (or circuit descriptions) are just expressions &ldquo;made&rdquo; from a small number of primitive functions and combining forms (functionals that map functions into functions). These functions and combining forms (CFs) were chosen because they have nice algebraic properties. Thus, circuit descriptions are concise and can be easily manipulated using the algebraic laws of the language. Also, each CF has a simple geometric interpretation, so that every &mgr;FP expression has an associated floorplan. This interpretation exists because &mgr;FP expressions represent functions rather than objects, allowing us to associate a function with each section of the floorplan. Most VLSI design languages are designed either for layout description or for behavioural specification. &mgr;FP, with its dual interpretation, allows the designer to consider the effect on the final layout of a particular design decision or to manipulate the layout while keeping the semantics constant. In the following sections, we show how &mgr;FP is constructed from FP by the addition of a single combining form &mgr;, which encapsulates a very simple notion of &ldquo;state&rdquo;.
Solvability by radicals is in polynomial time
Authors: Susan Landau, Gary Lee Miller
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Every high school student knows how to express the roots of a quadratic equation in terms of radicals; what is less well-known is that this solution was found by the Babylonians a millenia and a half before Christ [Ne]. Three thousand years elapsed before European mathematicians determined how to express the roots of cubic and quartic equations in terms of radicals, and there they stopped, for their techniques did not extend. Lagrange published a treatise which discussed why the methods that worked for polynomials of degree less than five did not work for quintic polynomials [Lag], They require double exponential time. Through the years other mathematicians developed alternate algorithms all of which, however, remained exponential. A major impasse was the problem of factoring polynomials, for until the recent breakthrough of Lenstra, Lenstra, and Lov&aacute;sz [L3], all earlier algorithms had exponential running time. Their algorithm, which factors polynomials over the rationals in polynomial time, gave rise to a hope that some of the classical questions of Galois theory might have polynomial time solutions. Galois transformed the question of solvability by radicals from a problem concerning fields to a problem about groups. What we do is to change the inquiry into several problems concerning the solvability of certain primitive groups.
The SAC-1 system: An introduction and survey
Authors: George E. Collins
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

SAC-1 is a program system for performing operations on multivariate polynomials and rational functions with infinite-precision coefficients. It is programmed, with the exception of a few simple primitives, in ASA Fortran. As a result the system is extremely accessible, portable, easy to learn, and indeed has been implemented at more than 20 institutions. The SAC-1 system's range of programmed capabilities is exceptionally broad, including, besides the usual operations, polynomial greatest common divisor and resultant calculation, polynomial factorization, exact polynomial real zero calculation, partial fraction decomposition, rational function integration, and solution of systems of linear equations with polynomial coefficients. SAC-1 is also outstanding in its computing time efficiency, which is achieved partially through the use of appropriate data structures, but primarily through the use of mathematically sophisticated and analyzed algorithms, which are briefly surveyed. The efficiency gains, frequently orders of magnitude, are such that many new applications are rendered feasible.
Impact of general systems orientation: Present and future
Authors: Bernard P. Zeigler
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The present impact of general systems orientation, i.e., theory and approach, on the simulation community is briefly outlined and assessed. Prospects for the future are contingent upon the evolution of educational and corporate settings conducive to &ldquo;modelling in the large&rdquo; methodologies.
Intelligent CAI: The role of the curriculum in suggesting computational models of reasoning
Authors: Lee Blaine, Robert L. Smith
Venue: Proceedings of the 1977 annual conference (1977)

Computer-assisted instruction (CAI) offers many opportunities for the application of artificial intelligence (AI) techniques. One advantage of doing AI research within the CAI paradigm is that the curriculum provides a ready framework for the evaluation of any AI model that we might propose. In this paper we describe the models of informal mathematical reasoning that we have employed in developing a CAI system, called EXCHECK, for teaching set theory and other mathematically based courses at Stanford University. Specificially, we discuss how the maturing of mathematical reasoning is accommodated in the EXCHECK model. Methodologically, we wish to conclude that there is a good deal to be learned by implementing entire college curricula within a CAI system, and solving whatever information processing problems are present within those curricula.
A graph theoretic approach to the verification of program structures
Authors: John R. Brown, Kurt F. Fischer
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

For large computer programs, verification of compliance with structured programming rules can present difficult problems for programmers and managers. In order to certify that code is structured, an algorithm and test tool were recently developed to audit source code and verify the use of structured constructs. The paper describes the segmentation of programs as a way of representing their logical control structure; presents the basic algorithm, illustrates algorithm extensions; and briefly reports on experience in using the tool on a large software project.
A computer controlled cartridge case quality assurance inspection system
Authors: Myron R. Compton, Marvin D. Erickson
Venue: Proceedings of the 1975 annual conference (1975)

A new high-speed quality assurance inspection system has been developed for total inspection of parts on a continuous 1200 part per minute production line. The heart of this inspection system is the data acquisition and control computer subsystem which performs the complete quality assurance tasks in real-time response to all process measurements and control conditions of the production line. An event-driven, real-time executive and an efficient inventory method have been developed to implement the computer subsystem. The high-speed inspection techniques developed in this system can be applied to quality assurance and inventory control tasks in a variety of continuous manufacturing line processes.
Should a university computer center newsletter aspire to literary grandeur?
Authors: John J. Simon,  Jr.
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

What follows is a brief paper, the intent of which is to discuss whether a university computer center newsletter should aspire to literary heights. It is a premise of this paper that the contemporary audience for such newsletters includes increasing numbers of non-technical people, such as new users, faculty, and administrators, that this constitutes an &ldquo;academic initiate&rdquo; more disposed toward &ldquo;reading&rdquo;, less toward &ldquo;reference&rdquo;, and that an editor may be able to realize some of his or her literary aspirations in the evolution of a manner of intercourse appropriate to its refreshed readership. With respect to the newsletter's public relations role, the paper postulates that style and tone can be manipulated in such a way as to enhance a computer center's public image, that a certain level of literary sophistication can enhance the newsletter's appeal to administrative types and faculty members, and that an admixture, consisting of a slight amount of pomp and a subdued tone of camaraderie, can work favorably upon an audience's self esteem, so as to educe feelings of tenderness toward the publication, and ultimately, its originators. The efficacy of the paper and its premises are as one.
Nodes and arcs, the ideal structural primitives for language?
Authors: Edward S. Lowry
Venue: Proceedings of the ACM 1980 annual conference (1980)

For a language to be reasonably small while providing referencing facilities which are adequate for direct natural expression, it is necessary that all operands be built from a small number of primitive structural types. For the referencing capabilities to be used in a clearly readable way the structure of the data must accurately reflect the structure of the conceptual objects being modeled without representational distortions. For objects from a small set of primitive structural types to be combined in a way that accurately reflects the structure of many kinds of object it is necessary that the structural primitives have a minimum of internal structure. These considerations and others indicate that nodes and arcs of directed graphs are probably a permanent optimum choice of structural primitives for a comprehensive programming and system description language. They provide a highly &ldquo;plastic material&rdquo; which can be &ldquo;shaped and hardened&rdquo; by declarations to accurately model the structure of many kinds of parts of different problem environments. Current major languages emphasize function but distort the structure in system descriptions. Accurate structural description simplifies application programs by eliminating irrelevant representational conventions and providing higher level, declarative information about the problem environment enabling the computer to be more helpful. It provides a basis for combining the advantages of many languages, leading to simpler and more coherently designed software systems. Accurate description of preexisting data and systems can ease many interfacing and compatibility problems. The DAWN language based on the above ideas is described briefly. It is a general language with a fully integrated semantic data model for data base and system control. A number of interdependencies among various kinds of language improvement are also described. The process of eliminating representational irrelevancies can probably be completed soon since those remaining are becoming sparse and objectively identifiable when similar language constructs are compared.
Selecting a scheduling rule that meets pre-specified response time demands
Authors: E. G. Coffman,  Jr., I. Mitrani
Venue: ACM SIGOPS Operating Systems Review (1975)

In this paper we study the problem of designing scheduling strategies when the demand on the system is known and waiting time requirements are pre-specified. This important synthesis problem has received little attention in the literature, and contrasts with the common analytical approach to the study of computer service systems. This latter approach contributes only in-directly to the problem of finding satisfactory scheduling rules when the desired (or required) response-time performance is specifiable in advance.
The system bal: a technique for spreading the use of CAD techniques within an industrial environment.
Authors: G. Blain, A. Labarthe, J. C. Rault
Venue: Proceedings of the 12th Design Automation Conference (1975)

Promoting CAD techniques within industry encounters usually three stumbling blocks: - the use of conventional computer tools requires acquaintance with intricate &ldquo;indications for use&rdquo; with too much of a computer flavor. Potential users are reluctant to accept this &ldquo;unnecessary&rdquo; burden which might make their job more difficult and wipe out expected gains in time and efficiency. - cost for using and developping computer tools is, as a rule, high. Frequently, this cost is perceived by users, having to operate with a tight budget, as mere extra expenses to be added to those entailed by the different steps in their specific engineering work. - there is common tendency among engineers to consider their work as very specific and not amenable to general methods. In particular, non-creative steps in the design process are underestimated; design engineers are confident in their ability to easily create, in due time, the tools, and especially computing tools, that they will need. A &ldquo;distressing&rdquo; feature of the above difficulties is that it does not seem feasible to eradicate them simultaneously. As a matter of fact, any solution for eliminating one tends to reenforce the two remaining ones. The BAL system presented in this paper corresponds to a tradeoff taking into account inclinations of software engineers, needs of designers in an industrial environnement, and available financial resources. This systems is aimed at smoothing away the above difficulties in the particular context of the THOMSON-CSF group, a large electronics concern.
A consideration of the number of horizontal grids used in the routing of a masterslice layout
Authors: Masayuki Terai, Hajime Kanada, Koji Sato, Toshihiko Yahara
Venue: Proceedings of the 19th Design Automation Conference (1982)

In the masterslice LSI, since the wiring area is fixed, local wiring congestion is likely to occur, which may cause the occurrence of some wiring nets to be unroutable. If the number of grids used in the routing can be accurately predicted before the wire routing, it is possible to reduce greatly the occurrence of wiring nets to be unroutable. This paper describes that the minimum number of horizontal grids used in a routing can be theoretically proved under the condition that the net interconnecting n terminals has at most n sites for trunk partitions. The experimental results on a masterslice LSI with 624 gate cells are in good agreement with the theoretical results.
A pyramidal approach to parallel processing
Authors: Steven L. Tanimoto
Venue: ACM SIGARCH Computer Architecture News (1983)

This paper presents the architecture of a parallel computer called a pyramid machine. The system consists of a pyramidal array of processing elements, each of which executes the instructions broadcast by a controller. Each processing element except those on the outside of the array is directly connected to thirteen neighboring elements: eight on the same level, four on the next finer level and one on the next coarser level. The architecture combines features of tree machines and features of mesh-connected parallel computers. As a result it is able to rapidly perform computations of local and global processing. The main areas of application are image processing, graphics and spatial problem solving. The motivation, basic structure, and applications of the system are discussed.
Use computers to demonstrate the differential equations of aerodynamics
Authors: Carl A. Forbrich,  Jr.
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

A majority of engineering students are apprehensive about the first courses they take in which they are expected to solve differential equations. Fluid mechanics in aeronautical engineering is perhaps the most difficult engineering specialty from the point of view of differential equations. For this reason, aeronautics instructors should become familiar with and use techniques which make the solutions to differential equations less frightening to the students. Versatile computer techniques to demonstrate the characteristics of solutions to differential equations and the effect of boundary conditions on their solutions are currently available for student use. Several of the computational techniques not requiring an extensive computer background are discussed.
System optimization: Automatic flow chart design
Authors: G. Hain, K. Hain
Venue: Proceedings of the 1965 20th national conference (1965)

A PROGRAM can be logically described as a set of elements Aj, which contain the instructions, and a matrix cjk which gives the connections between these elements (JUMP instructions). (In PERT terms the elements Aj are events, and the cj,i are activities.) Here the attempt is made to draw a two-dimensional picture of the logical structure of a program by disregarding the specific contents of the elements. To get this picture two facts are important. (a) - There is a hierarchy, namely the order by which the elements are called. This order would be unique if there were no closed loops. Therefore, the first aim is to achieve this unique order by handling the loops appropriately and then setting up the sequential order. (Level structure, y-coordinates.) (b) - Usually there will be more than one element in one of these levels, so that the task is now to sort the elements in such a way that there will be as little crossing of connecting lines as possible; furthermore, similar elements shall be brought as close together as possible. (Branch structure, x-coordinates).
A Computer Science program at a college with limited resources
Authors: Caroline Wardle
Venue: ACM SIGCSE Bulletin (1975)

At Hunter College, the B.A. degree in Computer Science was the work of two people, whose goals were to provide a high quality degree, with as much choice of program specialization as possible under the constraints imposed by Hunter. It was felt that the program should be structured so as to provide a useful background for obtaining a job in industry or business, for those students not intending to go on to graduate school. The City University of New York is committed to Open Enrollment which means that our students have extremely diverse academic backgrounds. Because of limited commitment and resources, we have been forced to rely heavily on part-time instructors. Consequently we have not been able to offer all of the advanced courses on a regular basis. As a result of these factors, we settled on a small program, offering two specializations, that could be covered with a minimum of full-time faculty backed up by adjuncts.
A decomposition method for the analysis and design of finite state protocols
Authors: Tat Y. Choi, Raymond E. Miller
Venue: Proceedings of the eighth symposium on Data communications (1983)

Finite state automata have been applied with success to the modeling of Computer Network Protocols. The interaction of finite state machines can be very complex especially if the protocol involves a large number of states. To counteract the complexity of analysis and design, we propose an approach of decomposition. Through this approach, the protocol graph can be partitioned into subgraphs each having a unique entry node and zero or more exit nodes. The exit nodes of one subgraph can be connected only to the entry nodes of other subgraphs. From the standpoint of protocol analysis, the correctness of the entire protocol graph can be inferred from the correctness of individual protocol subgraphs. From the standpoint of protocol design, the individual protocol subgraphs can be designed to correspond to different phases of the protocol. If the individual protocol subgraphs are designed correctly and the connections between subgraphs conform to the structure discussed above, then we show that the entire protocol graph will operate correctly.
New languages for numerical software
Authors: Bill Coughran, Eric Grosse
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

Existing languages for numerical software are not altogether satisfactory. Fortran, even preprocessed, has troublesome limitations. Unfortunately, proposed replacements have been discouragingly large, or omit essential features like variably dimensioned arrays and Fortran compatibility. A new language has been designed to include such crucial features, but otherwise be as small as possible. This language, called T, includes: indention to indicate block structure, novel loop syntax, and engineering format for real constants. By preprocessing into PL/I, implementation cost was kept low. But this language can only be regarded as a stopgap. The next step is to deal with more fundamental issues, by more fully exploiting arrays, by making pointers available in a controlled way, and by arranging for better declaration and syntax for using subroutine libraries.
N-decomposition and decomposition matrix for automata
Authors: Arthur T. Poe
Venue: Proceedings of the ACM annual conference (1973)

This continues the study on generalized mutiple decomposition allowing 2-way interconnection [1]. Let N&egr;Z+.An automaton M &equil; <D, T,F> is an N-automaton iff the set of states D &le; &pgr;Si and each Si &equil; &pgr;i (D) where &pgr;i is the projection map onto the ith component. Since the states in an N-automation are N-tuples, we may interpret M as consisting of N component automata Ml,..MN, where Mi &equil; <Si, &pgr;Sj,fi> for each i.If (sl,..sN,t)&egr; D(F),then fi (si,(&pgr;si,t))&equil; &pgr;i(F((sl,..SN),t). We call an N-automation M &equil; <D,T,F> a generalized N-decomposition (GND) of M &equil; <S,T,f> if M realizes M. Any GND of M induces a set of N *-covers on S. A sufficient condition for a set of *-covers to give rise to a GND is established. The Properties of a GND can be represented by a matrix of relations. The diagonal entries are induced by the components and the off-diagonal entries represent the interconnections.The conditions which give rise to zero connection lines are then determined.