ppxscal/embedding_network huggingface dataset:
A review of current studies on complexity of algorithms for partial differential equations
Authors: Hatem M. Khalil, Dana L. Ulery
Venue: Proceedings of the 1976 annual conference (1976)

We review current work in analytic computational complexity of sequential algorithms for partial differential equations. Included are studies which analyze and compare classes of algorithms for hyperbolic, elliptic and parabolic problems. Emphasis is on the criteria and techniques used to perform the analysis and comparisons.
Problems in biomedical computing:: what are they, and who is solving or creating them?
Authors: Lynn L. Peterson
Venue: Proceedings of the ACM '82 conference (1982)

SESSION OVERVIEW: The general theme of ACM '82, &ldquo;The Computer Industry, Solving or Creating Today's Problems&rdquo;, generates a number of questions for the biomedical computing community. What are today's problems in biomedical computing? What are today's problems WITH biomedical computing? These questions raise a number of issues which should be of interest to the broader audience of ACM.
Describing program behavior in a multiprogramming computer system
Authors: Joseph W. Keim, H. D. Schwetman
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

In order to simulate the behavior of a computing system some type of description of the behavior of jobs in that system needs to be specified. In this paper the behavior of batch jobs in a multiprogramming computer system is studied. A detailed trace of system and resource usage patterns over a time interval is collected using a software monitor embedded in the operating system. From this trace data the system and resource usage of each job encountered during that time interval can be obtained. A job is considered to consist of a sequence of steps with each step being invoked by a control card. We are then able to associate with each control card the behavior of the job during the time in which that control card is in force. One model of behavior is presented; this model describes a job step in terms of its CPU and system service routine requirements. Since many control cards invoke standard system programs (compilers, utilities, etc.) the typical behavior of these programs can be deduced. Data describing this behavior for various programs is presented in this paper. Application of such information to the simulation and evaluation of adaptive scheduling policies is mentioned.
Semi-automatic delineation of regions in floor plans
Authors: K. Ryall, S. Shieber, J. Marks, M. Mazer
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

We propose a technique that uses a proximity metric for delineating partially or fully bounded regions of a scanned bitmap that depicts a building floor plan. A proximity field is defined over the bitmap, which is used both to identify the centers of subjective regions in the image and to assign pixels to regions by proximity. The region boundaries generated by the method tend to match well the subjective boundaries of regions in the image. We discuss incorporation of the technique in a semi-automated interactive system for region identification in floor plans. In contrast to area-filling techniques for delineating areal regions of images, our approach works robustly for partially bounded regions. Furthermore, the frailties of the method that do remain, unlike those of alternative techniques, are well-moderated by simple human intervention.
A stream processing network
Authors: D. Morris, P. C. Treleaven
Venue: ACM SIGPLAN Notices (1975)

This paper is concerned with a programming system based on the notion of stream operands. These are sequences of scalar operands in which only the current member of the stream can be accessed at any one time and after that only the next member. The language discussed is aimed initially at a system consisting of a network of microprocessors. It has a fairly conventional appearance and the new facilities are introduced mainly as procedure calls. Once the semantic characteristics have been established a more appropriate syntax will be developed. The long term goal is a style of high level language that will lead away from conventional systems, for large problems which lend themselves to streaming.
The LOCUS distributed operating system
Authors: Bruce Walker, Gerald Popek, Robert English, Charles Kline, Greg Thiel
Venue: Proceedings of the ninth ACM symposium on Operating systems principles (1983)

LOCUS is a distributed operating system which supports transparent access to data through a network wide filesystem, permits automatic replication of storage, supports transparent distributed process execution, supplies a number of high reliability functions such as nested transactions, and is upward compatible with Unix. Partitioned operation of subnet's and their dynamic merge is also supported. The system has been operational for about two years at UCLA and extensive experience in its use has been obtained. The complete system architecture is outlined in this paper, and that experience is summarized.
Toward a new framework for office support
Authors: Raymond R. Panko, Ralph H. Sprague,  Jr.
Venue: Proceedings of the SIGOA conference on Office information systems (1982)

Office automation is the outgrowth of one form of corporate information technology&mdash;the office products category. If we are really to enhance the total office function, however, we will need a much broader concept of office information systems. This paper proposes one such concept, which we call office support.
Information retrieval II: A data structure for data retrieval
Authors: P. Kugel
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

A WAY OF ORGANIZING DATA for storage and retrieval will be described and some of its characteristics discussed. This way of organizing data is an adaptation of the (chain) list structures used in heuristic programming and other information processing applications. In such list structures, each item in a (serial) list is stored with the address of the next item on the list, this has several advantages, the main one being perhaps of the ease with which lists may be altered during the running of a program. The extension with which this paper will be concerned consists of indicating, with each item, not only the address of the next item on the (serial) list in which it appears, but also the address of the preceding item. This allows the retrieval of a list from any point on that list and the representation of mathematically more complex structures than lists or trees. It also makes it possible to allow elements which appear on several lists to appear only once in the internal representation. When an item appears on more than one list, this is indicated not by duplicating the item but by referencing the same instance of the item in representing all the lists on which it appears. Thus, with each item there is a list of chaining addresses indicating its predecessor and successor on each of the lists on which it appears externally. Such a list is called a from/to list and is a (chain) list of pairs of addresses, each such pair representing a piece of a (serial) list.
An overview of ACM guidelines and recommendations for a community and junior college career program in computer programming
Authors: Joyce Currie Little
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The Community and Junior College Subcommittee of the Curriculum Committee on Computer Education (C3E-CAJC) of the Association for Computing Machinery has recently completed work on its first report. Entitled &ldquo;Curriculum Recommendations and Guidelines for a Community and Junior College Career Program in Computer Programming,&rdquo; the report presents findings from more than two years of discussion, interaction, and analysis by a large working group of educators and industry persons. This paper provides an overview of the recommendations, which are directed toward the education of applications computer programmers, who would work in conjunction with a systems analyst in the type of environment usually found in a medium to large scale computer facility. Specific objectives and the subject matter outline from the report are presented; facilities and resources needed for implementation of the program are discussed.
Measures of technical competence (Keynote Address)
Authors: Jean E. Sammet
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

The topic addressed is the (alleged) measures of professional/technical competence and what ACM and the field are and are not doing. It should be noted first that professional and technical competence are different. Professional competence involves general knowledge, background, and some analytic ability, whereas technical competence implies specific detailed knowledge of particular issues. There are four common (or possible) measures of competence - courses, self-assessment tests, certification and licensing. Issues to be considered with regard to each of them involve (a) who creates the measure, (b) who judges the results, and (c) what type of dissemination of the results occurs
Principles of design in the octopus computer network
Authors: John G. Fletcher
Venue: Proceedings of the 1975 annual conference (1975)

The concepts and methods are reviewed which have proven to be of the most value in designing and implementing the Octopus computer network, which is one of the largest concentrations of computing capability in the world. The discussion summarizes design principles relating to the scope of system software, privacy and security, processor organization, file structure, network connections, hardware selection, programming techniques, standards, and use of resources. Differences with what appear to be widespread belief and practice are cited, including such matters as the size of the programmer staff, the significance of the privacy issue, the importance of the choice of languages and language constructions, the primary causes of system failure, and efficiency.
An effective graphics user interface for rules and inference mechanisms
Authors: J. W. Lewis,  Ph.D.
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

As the technology of rule-based inference mechanisms matures, knowledge acquisition&mdash;the creation, structuring, and verification of rules&mdash;becomes increasingly important. The accuracy and completeness of the rules in the knowledge base determine expert system performance, and the cost of acquiring that knowledge base dominates all other hardware and software costs in practical systems. To reduce knowledge acquisition time and error rate, a new interactive graphics interface for rules is being designed and implemented in GE Corporate Research and Development. In the new system, each set of rules is represented as an AND/OR graph and parts of the rule base are displayed on a CRT screen as an AND/OR tree. A user&mdash;even an unsophisticated user&mdash;can navigate the AND/OR graph, identify nodes to be modified, analyze the behavior of the graph, verify its correctness graphically, and follow the execution of inference engines.
Evaluation of the UNIX host for a model development environment
Authors: Richard E. Nance, Osman Balci, Robert L. Moose,  Jr.
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The needs for model development and the functionality of UNIX are reviewed in order to evaluate the capability of UNIX for either hosting an environment or supporting the development of an environment. Based on an ideal system comparison, the deficiencies of UNIX serve to define the second iteration in a rapid prototyping effort.
Compilation of optimized syntactic recognizers from Floyd-Evans productions
Authors: H. R. Haynes, L. J. Schutte
Venue: Proceedings of a symposium on Compiler optimization (1970)

Floyd-Evans productions are becoming increasingly popular as the metalanguage to be used in describing the syntactic analysis phase of programming language processors. Techniques for compiling optimized syntactic recognizers from Floyd-Evans productions are presented. Such recognizers promise to yield significant gains in recognition speed with no increase in storage requirements when compared to table-driven interpretive recognizers. The compiled recognizers can be described in terms of macros that are essentially machine-independent.
A unified approach to test data analysis
Authors: Michael A. Gianfagna
Venue: Proceedings of the 15th Design Automation Conference (1978)

To provide cost-effective performance evaluation or engineering feedback from circuit test results often requires that complex analyses be performed on large volumes of non-standard data. Using a large scale data management system and a modular design philosophy, a system to cope with the above requirements has been developed. TDAS (Test Data Analysis System) has provided timely and economic solutions to test data analysis problems which might have been intractable by other means.
Building Energy Analysis Programs
Authors: Henry Lau, J. Marx Ayres
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

Building Energy Analysis Computer Programs consist of Loads, Systems, Plant, and Economic sub-programs. They are used by engineers and architects in the design and analysis of energy efficient building envelopes, heating, ventilating, and air conditioning, electrical and other service systems. The historical development of energy analysis programs is presented, the methodologies used in various programs are compared, and areas for future improvements are discussed.
SYNVER: A system for the automatic synthesis and verification of synchronization processes
Authors: Patricia Griffiths
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The automatic synthesis of systems of synchronized processes and the proof of the synchronization's correctness is discussed. A general system, SYNVER, is proposed. Its input is a problem description and its output is a set of communicating processes proven correct. A high-level assertion language is presented in which certain types of synchronization problems may be described in a natural but formal way. Heuristics are developed for SYNVER so that it may infer from the problem description what data structures and what operations are necessary to realize the described synchronization. From this information, the code pertaining to synchronization is synthesized. Finally, SYNVER applies verification techniques to prove that the assertions made about the synchronization of the processes are not only consistent, but are also realized by the code synthesized.
A reexamination: Centralized versus decentralized computers in biomedical environments
Venue: Proceedings of the 1971 26th annual conference (1971)

We feel that, rather than asking whether biomedical investigators should be supported by centralized or decentralized computers, we should ask how investigators may be given effective access to the various kinds of computing service they require. Optimality of a computer configuration cannot be meaningfully assessed apart from the job-mix priorities it is to serve. It is difficult to think of an area of application wherein requirements would differ more from location to location than in biomedical computing. What is good for control of on-line experiments in a physiological laboratory would tend to be inefficient or altogether inadequate for processing the major statistical computations widely encountered in biology and medicine. Conversely, it would usually be uneconomical to tie up a system well suited to statistical computations for continual monitoring of experiments. Not only do we find a spectrum of biologists whose requirements range from control of experiments to complex modeling and statistical analysis, we also find the entire spectrum represented in the work of a single investigator&mdash;often, in fact, in a single study. Thus, after preliminary reduction by the laboratory computer, the neurophysiologist's data may require major statistical analysis. In fact, it is likely that occasional bursts of such major support during the course of an experiment might be desired for more sophisticated guidance of the experiment.
State-transition programming techniques and their use in producing teleprocessing device control programs
Authors: Dennis M. Birke
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

The problems of writing programs for complex and timing dependent processes are discussed and programming techniques using state-transition diagrams are defined. It is shown that programming effort can be reduced by these techniques. Their use in writing teleprocessing device control programs and many other programs is discussed. It is shown that programs written using these techniques are extendable to more general application. A Binary Synchronous Communications multileaving control program in the Pitt Time Sharing System implemented by using these techniques is discussed. A considerable reduction of programming effort was realized for this implementation.
UIDs as internal names in a distributed file system
Authors: Paul J. Leach, Bernard L. Stumpf, James A. Hamilton, Paul H. Levine
Venue: Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing (1982)

The use of UIDs as internal names in an operating system for a local network is discussed. The use of internal names in other distributed systems is briefly surveyed. For this system, UIDs were chosen because of their intrinsic location independence and because they seemed to lend themselves to a clean structure for the operating system nucleus. The problems created by UIDs were: generating UIDs; locating objects; supporting multiple versions of objects; replicating objects; and losing objects. Some solutions to these problems are presented; for others, no satisfactory solution has yet been implemented.
Implementation of an interactive printed circuit design system
Authors: K. R. Stevens, W. M. vanCleemput, T. C. Bennett, J. A. Hupp
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper describes the implementation and performance of SPRINT, an interactive system for printed circuit board design developed at the Stanford Linear Accelerator Center (SLAC). Topics discussed include the placement subsystem, the routing subsystem consisting of an interactive manual router, an automatic batch router, and a via elimination program, as well as the structure of the design file around which the entire system is centered.
Arbitrarily-sized module location technique in the lop system
Authors: Gotaro Odawara, Kazuhiko Iijima, Tetsuro Kiyomatsu
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes a new location technique in the LOcation Processor (LOP), which is an automatic module location system for PWB. This technique consists of two items: one is the advanced algorithm for arbitrarily-sized and - shaped module location, and the other is the empirical path-anticipation method in the location optimization. Several experiments have proven the effectiveness of this technique, and have suggested a new approach to the automatic layout system for PWB and LSI.
Geometric Analysis and Computing of Projective Structure and Motion
Authors: Eduardo Bayro-Corrochano, Vladimir Banarer
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The paper focus on the analysis and computing of the projective structure and motion using geometric invariants. This work relates current approaches in the geometric algebra framework as a result the approach gains geometric transparency and elegance. The paper presents experiments regarding projective reconstruction of shape and motion using both simulated and real images.
Master slice LSI Computer Aided Design system
Authors: Y. Ozawa, M. Murakami, K. Suzuki
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper presents a Computer Aided Design (CAD) system which is intended for practical use in master-slice LSI design and testing. This system includes five sub-systems; PLACEMENT, ROUTING, IMPROVE, ARTWORK, and TEST GENERATION.
A minisystem programming language
Authors: Robert Lechner, William Stallings
Venue: Proceedings of the ACM annual conference (1973)

TRAIL is a block-structured language and programming system for the development of programming support systems and translators for problem-oriented languages on minicomputers. The programming system includes an interpreter for an intermediate language (IL) into which various source languages (including TRAIL itself) may be translated. The interpreter size is about 1400 bytes. The choice of an interpreted target language was guided by the objectives of minimum object code size and machine independence of the developed software. Both of these have been achieved, at the expense of a 20:1 slowdown of execution speed relative to directly assembled code. The interpreted object code is at least 50% smaller than assembly code. The source language was designed to match the requirements of language translator software; software design directly models syntax checking, context-free translation, and context-sensitive translation aspects, in ascending order of complexity. Anticipated benefits include greater productivity in design and debug phases, and enhanced communication between programmers via simplified documentation procedures.