ppxscal/embedding_network huggingface dataset:
Finite element mesh generation for planar and shell type structures
Authors: James C. Cavendish, James A. Wixom
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

In many cases, the overriding difficulty associated with finite element analyses of complex structures is the generation of error-free finite element meshes. In view of this situation, a number of mesh generation schemes for planar (e.g., [1], [2]) and shell (e.g., [3], [4]) structures have recently been proposed (see [5] for an extensive bibliography). At one extreme are the fully automatic methods in which the computer is used to determine regions of high and low element densities and then create a finite element mesh accordingly. At the other extreme are methods which require the analyst to completely define the element mesh, while the mesh generating algorithm itself performs only minor clerical tasks such as checking for consistency and error detection. While the fully automatic methods tend to be somewhat inflexible and frequently time consuming to implement, the simplest schemes fail to relieve the user of enough of the tedium accompanying manual decomposition of the structure.
A data flow language for operating systems programming
Authors: Paul R. Kosinski
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

This paper describes a graphical programming language based on the concept of pure data flow sequencing of computations. Programs in this language are constructed through function definition and composition, and are based on the primitive notions of iteration, recursion, conditional expression, data replication, aggregation and selection, and the usual arithmetic and logical operations. Various useful programming devices such as the DO loop and, surprisingly, the memory cell are defined in terms of these primitives. Programs in this language are determinate in operation unless indeterminism is explicitly introduced. The utility of this language for designing and implementing operating systems is discussed.
Interactive support for non-programmers: The relational and network approaches
Authors: E. F. Codd, C. J. Date
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational (1975)

The objectives and strategies of the relational and network approaches are compared. The status of support for non-programming users is examined. General purpose support for such users entails provision of an augmented relationally complete retrieval capability without branching, explicit iteration, or cursors. It is clear how this capability can be realized with the relational approach&mdash;whether with a formal or informal language interface. It is not at all clear how the network approach can reach this goal, so long as the principal schema includes owner-coupled sets &ldquo;bearing information essentially&rdquo;. A relational discipline is suggested as a way out for DBTG users.
Computer aided design of industrial control systems
Authors: F. Prunet, D. Floutier, J. M. Dumas
Venue: Proceedings of the 12th Design Automation Conference (1975)

This paper presents a checking model for the design of industrial automata. Some typical behaviors are defined and their occurring conditions (which allow the engineer to check if its design is or isn't satisfactory) are computed with the sole set of excitation functions, without any need of the flow graph.
A computer-based coding scheme for research data 1,2
Authors: H. N. Polovino, M. P. Farrell, R. H. Strand
Venue: Proceedings of the ACM 1980 annual conference (1980)

This paper addresses the need to reduce the complexity of data encoding and error rates in studies using multiple data bases composed of hierarchical file structures. It describes a coding scheme to represent long alphanumeric values, indicates the efficiency of such a scheme, and discusses error-rate reduction. Several approaches are available that minimize coding errors. Numeric codes with embedded information allocated to positions within the value codes are widely used, but these are unacceptable for variables with many values or levels of classification. Such &ldquo;smart&rdquo; codes require the full knowledge of the universe the variables describe, as well as the potential classification schemes for each variable. We have found that codes without embedded information (&ldquo;nonsense&rdquo; codes), circumvent the problems associated with smart codes. With nonsense codes, alphanumeric variable values are assigned a sequential numeric code as new values are encountered in the data base, irrespective of their value in the alphanumeric sequence. Nonsense codes are especially useful when the data base is first developing, since knowledge of the number of classification levels for each of the variables is not necessary.
Auto-delay: A program for automatic calculation of delay in LSI/VLSI chips
Authors: Rathin Putatunda
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes a program for automatically computing the delay through LSI/VLSI chips which have been laid out using automatic layout programs. A unique algoristhm for synthesizing RC networks from artwork data, which significantly reduces execution time and computer storage, is included. A novel and simple method for determining the delay through logic gates due to arbitrary RC network load at the output is also presented and discussed.
A general examination of engineering design
Authors: B. J. Bennington, C. M. I. Rattray
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

Engineering System Design has often been treated as an art. Successful practitioners, &ldquo;old hands&rdquo; in experience (and often years), produced satisfactory solutions to design problems using principles and rules of thumb which had evolved from many years of practice. Economic solution of the design of complex systems of our present-day industrialized society can only be achieved by a marriage of various numerical adaptive techniques and in a man-machine interactive environment. To this end, our paper discusses the philosophy of good systems design in engineering by describing the difficulties of analytical and numerical solutions, in the presence of a variety of restrictions and constraints, and by giving a general computer-oriented, design procedure.
An APL catalog system
Authors: James Schenck, John Peetz, Chris Clausen
Venue: Proceedings of the sixth international conference on APL (1974)

UCLA has developed an on-line Catalog System which provides the needed documentation of the APL public library. The system provides a controllable method to generate concise, complete, internally consistent, and easy to use documentation. The APL documentation is stored in the APL*PLUS (a registered trademark of Scientific Time Sharing Corp.) File System, and is accessible from a central location, as opposed to present systems which store program documentation within the workspace structure itself.
Verification of hardware designs thru symbolic manipulation
Authors: Todd J. Wagner
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

This paper describes a method for detecting errors in hardware designs based on algebraic manipulation. The behavior of a hardware system is specified using a non-procedural register transfer language. Similar specifications are provided for each component in the circuit. Using the techniques discussed here it should be possible to determine if the device will function correctly. The problem of detecting races and hazards in this framework is also addressed.
Clustering and classification of document structure-a machine learning approach
Authors: A. Dengel, F. Dubiel
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

We describe a system which is capable of learning the presentation of document logical structures, exemplarily shown for business letters. Presenting a set of instances to the system, it clusters them into structural concepts and induces a concept hierarchy. This concept hierarchy is taken as a source for classifying future input. The paper introduces the different learning steps, describes how the resulting concept hierarchy is applied for logical labeling and reports on the results.
Implemented techniques for handling spikes in an assignable delay simulator
Authors: S. A. Szygenda, A. Lekkos, J. Fike
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The needs for Digital Logic Simulation to analyze design timing problems, such as spike and hazards, has been shown previously (1). In this paper, methods for detecting timing problems are investigated and analyzed. A technique is developed to perform spike and hazard analysis in a less pessimistic approach than has been used previously. It was implemented as an extension of the TEGAS2 simulation system (2) and is capable of associating different turn-on and turn-off propagation delays with an element.
Performance of a collision-free local bus network having asynchronous distributed control
Authors: V. Carl Hamacher, Gerald S. Shedler
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

This paper provides an analysis of the performance of an access control scheme recently proposed by Eswaran, Hamacher, and Shedler for a local bus network. The control scheme is simple and asynchronous, and provides for collision-free communication among ports of the network. It is also efficient in the use of the bus bandwidth, in the sense that there is only a small fraction of time during which the bus is idle when there is at least one packet available for transmission. The performance analysis emphasizes the characteristics of bus access response times at the individual ports.
Design automation at Southern Methodist University
Authors: Robert J. Smith
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The growing importance of computer aided design is difficult to ignore. As systems become more complex and design lead times shrink, manual design techniques have proven inadequate, or at best very costly. Utilization of computers to reduce design time and cost has been advertised as a solution to this problem, but automated design methods also have drawbacks. For example, design automation (D.A.) is an immature discipline, suffering from many of the difficulties encountered in the evolution of a new specialization. Moreover, costs are high and outcomes are uncertain. The foundations upon which D.A. rests are themselves unsettled. Computer &ldquo;Science&rdquo; is still somewhat an art and manufacturing technology changes rapidly in some areas of application. Because D.A. is such a new discipline, very few practitioners have been formally trained in this field. There is, however, a recognized need for more entry level engineers and applied scientists with backgrounds in Design Automation. This paper briefly describes current D.A. teaching and research activities at Southern Methodist University, and suggests some of our future directions.
Automatic aids to dictionary revision
Authors: Jules Mersel, Gerhard Reitz
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Updating a bilingual dictionary is a formidable task. The lexicographer has to have an intimate knowledge of both languages involved in all the pertinent fields. To this purpose, the work of professional translators could be used to good advantage. In a large majority of such translations, both the original word and the English equivalent chosen are found in already existing bilingual dictionaries. We are concerned with the case where either the source word or the English equivalent are not listed. The translator ordinarily does not relay his discovery or new interpretation to the lexicographer; he may be quite unaware of this. A side by side comparison of the original and the translation would reveal such deviations to the lexicographer. The original article is sufficient to indicate a missing word in the dictionary. The translation is needed to obtain its equivalent. A dictionary and the translation are needed to detect a new equivalent. This comparison is time-consuming and tedious. The following procedures, programmed at Ramo-Wooldridge relieve the lexicographer of this drudgery and yet supply him with the results.
A proposal for A B.S. in information systems
Authors: George A. Mapp
Venue: ACM SIGCSE Bulletin (1973)

Most of the existing computer science and data-processing programs are either vocationally-oriented aiming at entry-level positions, or theoretical programs with no direct career orientation. By contrast, this program aims at a synthesis of theoretical, &ldquo;design-strategy&rdquo; and practical approaches. By design strategy approach we mean emphasizing a particular type of system, i.e. real-time data-base management or a particular application, i.e. payroll, registration and how that will affect the design constraints from analysis to implementation.
Surface generation for virtual reality displays with a limited polygonal budget
Authors: B. M. Cameron, A. Manduca, R. A. Robb
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Virtual reality offers the promise of highly interactive, natural control of the visualization process, greatly enhancing the scientific value of the data produced by medical imaging systems. Due to the computational and real time update requirements of virtual reality interfaces, however, the complexity of polygonal surfaces which can be displayed is limited. In this paper, we present a novel method for the production of a polygonal surface containing a pre-specified number of polygons from volumetric data. To preserve surface detail, we extract a set of curvature weights from the volumetric data and use these weights as the input to a 2-D Kohonen network. The adaptation of the network to the input vectors results in a display surface that preserves useful detail relative to the number of polygons used.
Security of APL applications packages
Authors: Paul Penfield,  Jr.
Venue: Proceedings of the fourth international conference on APL (1972)

By the term &ldquo;applications package&rdquo; is meant a set of interacting APL functions and variables that a user calls, along with certain &ldquo;background&rdquo; functions and data that are only called indirectly. If there is a proprietary interest in the package, then it is necessary to devise techniques to assure the security of the package. An interpreted language like APL might be thought to pose severe security problems, since (unlike a compiled language such as FORTRAN) the source code is always somewhere nearby. However, with proper design, reasonable security (consistent with the value of the goods protected) can be achieved. This paper deals with security for packages installed both on private computers, and on commercial time-sharing systems, with the emphasis on the latter.
Design automation in network computers
Authors: Edward K. Bowdon,  Sr.
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Network computers are becoming a reality in the seventies. While systems such as the ARPA Network, Carnegie Mellon's PLN, the Collins C-System, CDC's Cybernet, and GE's Time Share Net are coming to fruition, even more grandiose systems are being discussed. These networks all offer the designer the potential of combining the advantages of resource sharing, data base sharing, and message switching with those of design automation. In this paper we present a brief description of a network computer currently under development and then propose an interactive design automation system for this geographically distributed network. The control mechanism for our design automation system is provided by an operating system, resident in each computer, whose primary function is to segment, disseminate, and regulate the jobs generated by the design automation system. When a job enters the system it may be assigned to anyone of the computers in a center. The job then runs to completion under control of that computer, but the segments that make up the job may be executed in any available computer. Additionally, we may transmit jobs between centers to improve the network response time. Thus we see that by detecting when segments are ready to be executed and by queueing this available work uniformly among all computers in the network, our design automation system will give each designer access to the full parallel processing power of the network.
Corporate planning models: What level of abstraction?
Authors: Norman I Agin, Chuck Junkunc
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper considers the problem of appropriate design for a corporate planning model. Two models are described which illustrate the range of choice available concerning level of detail. The first, an accounting level model, is simple to develop but may not be responsive to the changing environment in which most companies operate. Thus, it may have limited predictive capability. The second, an operating level model, while capable of validly representing the company operations, may be overly difficult and expensive to develop, maintain and use.
Modelling constructs of simscript II.5
Authors: Edward C. Russell
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

This tutorial will present the highlights of the SIMSCRIPT II.5 approach to building discrete event simulation models. The approach will be to construct a small example problem, implement the program in SIMSCRIPT II.5, and then to display the modularity which is possible with SIMSCRIPT by adding several &ldquo;real-world&rdquo; complexities to the model.
Computer input/output of mathematical expressions
Authors: William A. Martin
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

Studying mathematics is, in part, a language problem. Naturally, mathematicians are more likely to resist using a computer as a tool in their work if the tedious task of learning a new language for mathematics is part of the bargain. Furthermore, until a new language is thoroughly learned, difficulty in communication will make it less likely that their new experience will be a successful one. Beyond that, if a new computer language does not provide the same visual clues as standard mathematical notation, it may never adequately serve the mathematician. It therefore seems fair to assume that the computer input/output of mathematical expressions in a form resembling standard notation is an important goal. This form of expression is considerably more complex and expensive to handle than those used in, for example, the programming language FORTRAN. But the alternative (e.g., correctly manipulating a one page FORTRAN expression) is often quite painful.
Towards a discipline of real-time programming
Authors: N. Wirth
Venue: ACM SIGPLAN Notices (1977)

Programming is divided into three major categories with increasing complexity of reasoning in program validation: sequential programming, multi-programming, and real-time programming. By adhering to a strict programming discipline and by using a suitable high-level language molded after this discipline, we may drastically reduce the complexity of reasoning about concurrency and execution time constraints. This may be the only practical way to make real-time systems analytically verifyable and ultimately reliable. A possible discipline is outlined and expressed in terms of the language Modula.
A self-paced introductory Fortran programming course
Authors: Curtis R. Cook
Venue: ACM SIGCSE Bulletin (1976)

This paper describes a self-paced audio-tutorial introductory Fortran programming course. The course is designed for students with no previous programming experience and consists of nine lessons. Each lesson has two parts: (1) a handout that directs the student's reading in the course text and contains comments, suggestions, examples and self-test quizzes; (2) a handout and accompanying cassette tape that solves example problems in detail - problem analysis, development of algorithm (flowchart) and program. There are six programming assignments and a test on each lesson. A unique feature of the lessons is the use of peek-a-boo strips to aid and encourage students to carefully read the example programs and to show the structural relation between the flowchart and the program.
Computer science curriculum recommendations for small colleges(Panel Session)
Authors: Lillian Cassel, Richard Austing
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

Panelists will report on the work of the ACM Education Board's ad hoc committee to revise and update the Small College curriculum recommendations published by ACM in 1973. The revised report's completion is expected by the end of 1983. A preliminary report will be given which addresses topics including suggested curriculum content, resources needed, implementation problems, and other matters of concern to small colleges attempting to develop and/or maintain a viable computer science program. Audience response will be welcome to provide input to the committee.
Maiday: An environment for guided programming with a definitional language
Authors: Jacques Guyard, Jean-Pierre Jacquot
Venue: Proceedings of the 7th international conference on Software engineering (1984)

MAIDAY is a programming environment that provides methodological assistance. It supports a definitional language in which the user defines objects instead of manipulating variables as in typical programming languages. In this paper we present the heart of the system: the editor EDME. Editing commands operate only upon the logical structure of the algorithm rather than upon its abstract tree structure. This logical structure is concrete and stratified into four levels. On each level the user manipulates the elements of the next lower level without having access to their internal structure. EDME also provides a carefully designed user interface. Information is displayed by a multi-window screen. The system helps the user in three ways. Syntax errors are corrected or revealed, context-sensitive constraints are validated and a programming methodology is encouraged. We hope to provide automatic guidance about algorithm creation in the future. The current implementation provides a means of experimentation as we investigate the planning processes involved in creating algorithms.
UNIFIT: An interactive computer package for fitting probability distributions to observed data
Authors: Averill M. Law, Stephen G. Vincent
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

UNIFIT is a state-of-the-art, interactive computer package for fitting probability distributions to observed data. By combining the latest statistical techniques with graphical displays, the package allows one to perform a comprehensive analysis of a data set in significantly less time than would otherwise be possible. It employs a three-activity approach for determining an appropriate distribution. UNIFIT is written in FORTRAN IV and is designed to be compatible with standard terminals on almost any moderate-sized computer. It is the culmination of more than five years of statistical research to determine the most definitive techniques for distribution fitting, and it took three years to program.