ppxscal/embedding_network huggingface dataset:
Performance of cache-based multiprocessors
Authors: Fayé A. Briggs, Michel Dubois
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

A possible design alternative to improve the performance of a multiprocessor system is to insert a private cache between each processor and the shared memory. The caches act as high-speed buffers, reducing the memory access time, and affect the delays caused by memory conflicts. In this paper, we study the performance of a multiprocessor system with caches. The shared memory is pipelined and interleaved to improve the block transfer rate, and assumes an L-M organization, previously studied under random word access. An approximate model is developed to estimate the processor utilization and the speedup improvement provided by the caches. These two parameters are essential to a cost-effective design. An example of a design is treated to illustrate the usefulness of this investigation.
The concept of attached processing and attached resource computer systems (Paper Session)
Authors: Paul A.V. Thomas
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

Attached Processing, a new concept in business data processing, specifies a new system architecture constituting an on-line computer system oï¾£ arbitrary size, made up of an arbitrary number of functionally dispersed processors which nevertheless maintain common data bases. Information stored in such a system is immediately accessible, under user-configured security controls, by any processor attached to it. Such a system can expand by simple accretion, without economic penalty. To obtain more processing throughput, one attaches more processors. To obtain more data storage, one attaches additional disk drives as needed. In its practical realization, Attached Processing assumes the form of an Attached Resource Computer. The Attached Resource Computer does not employ a central, controlling host computer. System control is decentralized. Failure oï¾£ any individual processor in the system cannot bring all processing to a halt. Functional reconfigurations are easy since no processor is hard-wired to a specific task or tasks.
Petri Net based search directing heuristics for test generation
Authors: K. E. Torku, B. M. Huey
Venue: Proceedings of the 20th Design Automation Conference (1983)

The use of Petri nets to model the register transfers and change of control states in a sequential machine described in a Computer Hardware Design Language (CHDL) with the aim of guiding state space searches is proposed. Each fault to be detected defines a set of goal nodes for the state space search. These goal nodes together with a CHDL description of the circuit are used to generate a Petri Net (PN). Two guidance mechanisms are derived from the PN: heuristic cost value and input vector guidance. For each machine state encountered during the state space search, a heuristic cost value is computed using a state vector derived from the PN. The PN also contains information about input vectors that are associated with each control state. The most important of these are selected based on an established criteria. The heuristic cost value and input vectors are used to guide test generation searches. In three case studies, the method provides results superior to those previously reported both in guidance accuracy and computational requirements.
A programmable printed-wiring router
Authors: C. S. Slemaker, R. C. Mosteller, L. W. Leyking, A. G. Livitsanos
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper discusses BAAR, a program to route conductor paths on printed-wiring boards. It is based upon the Moore-Lee algorithm1,2 and incorporates an effective path-cost function and a programmability feature. It is written in ALGOL for the Burroughs B6700 and is producing results which are very good in both of two respects: the quality of individual paths is comparable to what a human would produce, and completion rates are very high. The particular path-cost function used is inherently capable of yielding much better paths than a simple Manhattan-distance function, but the principal advantage of the program lies in the feature whereby a user may design a routing strategy for a particular board topography and then &ldquo;program&rdquo; the router to execute that strategy. The result is an algorithm which is remarkably simple, without the usual host of preprocessors, postprocessors, and special-case routines, while at the same time constituting a tool of considerable power and flexibility.
Central DA and its role: An executive view
Authors: R. J. Camoin
Venue: Proceedings of the 20th Design Automation Conference (1983)

The objective of this panel is not to dwell on DA technology nor even on theoretical pros and cons of central DA. The objective of this panel is to share experiences and ideas on the management of central DA operation and how each company represented copes with the problems. One should expect to find much commonality of problems and, equally, that the management solutions are diverse.
A new array indexing system for APL
Authors: G. R. Lewis
Venue: Proceedings of seventh international conference on APL (1975)

The indexing or subscription function in APL has long been recognised as being anomalous. Furthermore its inconsistencies can give rise to ill-defined situations. A system of new and extended functions is proposed that could provide a more consistent basis for array element selection in APL. The functions provide all the capabilities of subscription but are more general and appear to be more fundamental.
MIXS: A mixed level simulator for large digital system logic verification
Authors: Tohru Sasaki, Akihiko Yamada, Shunichi Kato, Terufumi Nakazawa, Kyoji Tomita, Nobuyoshi Nomizu
Venue: Proceedings of the 17th Design Automation Conference (1980)

A mixed level simulator, MIXS, is a logic verification tool which has multiple simulation capabilities. Main MIXS techniques are time wheel and selective trace algorithm for functional level simulation based on 'node' model concept and the linkage function of functional models, described in different detail, with network information. The mixed level simulation for large digital systems can be achieved very efficiently by using the above techniques.
Why A Curriculum In Health Computing?
Authors: Roger H. Shannon, Karen A. Duncan
Venue: Proceedings of the 1978 annual conference (1978)

The significant social need for health computing professionals is discussed and a justification for curriculum development is presented. Health computing is seen to be a discipline or profession which is based in the three academic fields of computer science, health science, and sociology. But there is also a need for a synthesis, or focus, of these fields on the health care system through an achieved power of abstraction and sense of system relationships and dynamics. A concept of the role which health computing professionals must play is given by examination of the health world on three levels - relating to patients as individuals, to people in the aggregate, and to public policy for health care. The intent of the curriculum being developed is to graduate people who are technically competent, socially aware, and equipped to weigh values - people who can function as leaders for the profession.
The problems of programming and the design of programming languages
Authors: J. T. Schwartz
Venue: Proceedings of the 1975 annual conference (1975)

A useful programming language is a tool intended to facilitate programming and to alleviate either problems typical for present day programming practice or problems which can be expected to arise as programming is extended to new areas. Language design must therefore be based on some overall view of programming as an activity. I should like to suggest that three main subareas of programming deserve to be distinguished: Area 1: Programming of adaptations, extensions, and corrections to large pre-existing systems. Area 2: 'Clean-slate' programming, i.e. the design and development of systems of programs 'from scratch'. Area 3: 'Programming for nonprogrammers', i.e., the design of software systems which can be used by persons with little technical training, and who lack the fundamental programmer skills: procedure manipulation and debugging know-how.
The Software Development System
Authors: C. G. Davis, C. R. Vick
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper presents a discussion of the Software Development System (SDS), a methodology addressing the problems involved in the development of software for Ballistic Missile Defense systems. These are large, real-time, automated systems with a requirement for high reliability. The SDS is a broad approach attacking problems arising in requirements generation, software design, coding, and testing. The approach is highly requirements oriented and has resulted in the formulation of structuring concepts, a requirements statement language, process design language, and support software to be used throughout the development cycle. This methodology represents a significant advance in software technology for the development of software for a class of systems such as BMD. The support software has been implemented and is undergoing evaluation.
Digital Simulation of an Aerospace Vehicle
Authors: J. R. Mitchell, J. W. Moore, H. H. Trauboth
Venue: Proceedings of the 1967 22nd national conference (1967)

The rapid development of computer technology and the creation of new engineering oriented languages have established that general purpose digital computers are increasingly suitable for simulation of the dynamics of large physical systems. In the Aerospace Vehicle Simulation (AVS) Program, an effort has been undertaken at Marshall Space Flight Center (MSFC), Huntsville, Alabama, to simulate continuous and discrete dynamics of an aerospace vehicle and its ground support equipment (GSE) on a large digital computer. AVS is primarily being developed as a major tool for the checkout of space vehicles, but eventually it will become an essential part of an integrated engineering information system which can be used by various laboratories at MSFC for the design, checkout, and management of space vehicles.
70's programming style for a developing country programming
Authors: Norman F. Salt
Venue: Proceedings of the 1979 annual conference (1979)

This paper is a case study of the introduction of COBOL Procedure Division programming standards in Swaziland. The standards, based on modern programming theories and practice, require no modification to the syntactic structure of 1974 ANS COBOL. The standards have been used in the coding of more than forty programs. Success in enforcing standards is attributable to programmer involvement in the development of the standards and a locally developed COBOL program for monitoring the use of the Standards.
Virtual machine or virtual operating system?
Authors: J. Bellino, Cl. Hans
Venue: Proceedings of the workshop on virtual computer systems (1973)

Development of a multi-access system from an existing single-user system can be achieved by the virtual machine approach. If the virtual machines generated include as primitives the logical functions used by the single-user system activated on them, these extended virtual machines are able to support the single-user system at a decreased development, maintenance and running cost.
Optimization of the number of copies in a distribution data base
Authors: E. G. Coffman,  Jr., E. Gelenbe, B. Plateau
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

We consider the effect on system performance of the distribution of a data base in the form of multiple copies at distinct sites. The purpose of our analysis is to determine the gain in READ throughput that can be obtained in the presence of consistency preserving algorithms that have to be implemented when UPDATE operations are carried out on each copy. We show that READ throughput diminishes if the number of copies exceeds an optimal value. The theoretical model we develop is applied to a system in which consistency is preserved through the use of Ellis's ring algorithm.
On a transportable high level language for minicomputers
Authors: A Ian Stocks, Jayant Krishnaswamy
Venue: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment (1976)

This paper describes a high-level, PASCAL-based language, which is easily implementable on minicomputers with limited amounts of memory. The added features include a machine and operating system&mdash;independent formalism for describing file structures, and allow either compile time or run-time specification of the actual-formal file correspondence. A similar formalism for handling program overlays is described. These constructs are implemented in a manner consistent with the underlying language PASCAL, and allow one to easily write operating systems components.
Deadlock analysis in the design of data-flow circuits
Authors: Chu S. Jhon, Robert M. Keller
Venue: Proceedings of the 21st Design Automation Conference (1984)

One means of making VLSI design tractable is to proceed from a high-level specification of a circuit in terms of functionality, to the circuit level. A notable error which may occur in a top-down design starting with a data-flow graph representation of a circuit is a design inconsistency due to deadlock. This paper attempts to further develop the theoretical basis for algorithms which analyze the deadlock property of circuits on the basis of their data-flow graph representations. A systematic scheme to verify the absence of deadlock in data-flow graphs is also presented.
A design aids data base for digital components
Authors: Daniel J. Sucher, Donald F. Wann
Venue: Proceedings of the 16th Design Automation Conference (1979)

A data base containing pertinent information about the components used in a design is a central part of all digital design aids systems. This paper outlines a data base that has been developed for accomodating a wide variety of integrated circuits (IC's) as well as discrete components. A detailed description of the file structure and access subroutines is included, along with a discussion of the design decisions made during their construction.
Towards a genetic based prototyper for character shapes
Authors: B. Bontempi, A. Marcelli
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

The paper describes an attempt to use a machine learning approach to solve the problem of designing the set of prototypes to be used by an OCR system. The learning mechanism, based on a genetic algorithm, is exploited for providing the system with a set of reliable prototypes of the characters able to explain the variability encountered while dealing with specimen produced by different writers. In this framework, a new genetic algorithm with a variable population size is proposed, as well as a shape description scheme devised to improve the efficacy and the efficiency of the genetic search. Preliminary experiments show that the proposed approach is a promising step towards the automatic construction of the set of prototypes to be used for the recognition.
Algebraic manipulation
Authors: J. W. Bergquist
Venue: Proceedings of the sixth international conference on APL (1974)

Functions are exhibited which allow the user to deal with polynomials in one variable and vectors of complex nut, bets using the same verbs and mathematical expressions.
Computer-scored, programmed test monitors student progress
Authors: Thomas A. Boyle
Venue: ACM SIGCUE Outlook (1976)

This paper introduces an achievement test format which, in combination with computer scoring, provides some unusual capabilities. The format is an adaptation of one used in programmed instruction. It enables a considerable degree of response contingency, yet is readily scored by computer in batch mode. Short achievement tests of this type, referred to here as branched-program tests, have demonstrated unusual diagnostic capability and inherent security. They thwart common forms of cheating, both by students and by teachers, and single tests of this type can be used several times during a term of related instruction. The unusual characteristics of this type of test have prompted administration in several modes; in one the test appears as an appendix to each student's textbook. Here the test effectively becomes the basis or specifying a principal goal of the learning to be done. Repeated administrations of the test serve to monitor each student's progress.
Equivalence of relational database schemes
Authors: Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We investigate the question of when two database schemes embody the same information. We argue that this question reduces to the equivalence of the sets of fixed points of the project-join mappings associated with the two database schemes in question. When data dependencies are given, we need only consider those fixed points that satisfy the dependencies. A polynomial algorithm to test the equivalence of database schemes, when there are no dependencies, is given. We also provide an exponential algorithm to handle the case where there are functional and/or multivalued dependencies. Furthermore, we give a polynomial time test to determine whether a project-join mapping preserves a set of functional dependencies, and a polynomial time algorithm for equivalence of database schemes whose project-join mappings do preserve the given set of functional dependencies. Lastly, we introduce the &ldquo;update sets&rdquo; approach to database design as an application of these results.
Lexical postprocessing by heuristic search and automatic determination of the edit costs
Authors: A. Weigel, S. Baumann, J. Rohrschneider
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

We describe the realization of a dictionary based lexical postprocessing approach. A character hypotheses lattice (CHL) serves as input which is compared with the words of the vocabulary, using a generalization of the weighted edit distance. The search for the best word is based on a depth first traversal through the paths of the CHL and is directed by several heuristics to achieve a reasonable processing speed without deteriorating the recognition rate significantly. An iterative supervised automatic learning algorithm is proposed which determines the costs for the edit operations. Experiments reveal that this method significantly improves the recognition accuracy.
Supervised learning of smoothing parameters in image restoration by regularization under cellular neural networks framework
Authors: B. Gunsel, C. Guzelis
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Estimation of the smoothing parameters is one of the difficult problems in using regularization techniques for image restoration. The paper shows how cellular neural networks (CNNs) incorporated with a learning algorithm can be useful in adaptive learning of the smoothing parameters of regularization. A CNN model is designed to minimize the regularization cost function which is in a quadratic form. The connection weights of this CNN are obtained by comparing the cost function with a Lyapunov function. Unlike the common approaches in the literature, instead of using the learning connection weights of the neural networks, we propose supervised learning of the regularization smoothing parameters by a modified version of the recurrent perceptron learning algorithm (RPLA) which is developed for completely stable CNNs operating in a bipolar binary output mode. It is concluded that CNNs with the RPLA provides a set of suitable smoothing parameters resulting in a robust restoration of noisy images. For comparison, experimental results obtained by a median filter are also reported.
A low cost device for the real-time on-line entry of handprinted characters
Authors: David D. Thornburg
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

A low-cost device for the recognition of hand-printed characters is described. This device incorporates a special tablet surface which provides stroke sequence and direction information to the host computer where this information is used with a simple dictionary to identify the drawn character. The tablet has been interfaced to several commercially available personal computers. The learning and recognition algorithms are sufficiently compact that the combined software (including the character dictionary) fits in about 3kB of BASIC code.
Medusa: An experiment in distributed operating system structure (Summary)
Authors: John K. Ousterhout, Donald A. Scelza, Pradeep S. Sindhu
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

The paper is a discussion of the issues that arose in the design of an operating system for a distributed multiprocessor, Cm*. Medusa is an attempt to understand the effect on operating system structure of distributed hardware, and to produce a system that capitalizes on and reflects the underlying architecture. The resulting system combines several structural features that make it unique among existing operating systems.
Transformations and translations from the point of view of generalized finite automata theory
Authors: James W. Thatcher
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

The objective of this work is to expand the study of generalized finite automata theory by introducing generalized finite state mappings (finite state mappings of trees). In the process, we hope to provide an algebraic framework in which to study formalizations of transformations (in the sense that linguists use the term) and translations of natural and artificial languages. The concepts, &ldquo;syntax directed translation&rdquo; [2,18,19, 22, 29] and &ldquo;transformation&rdquo; [11, 25] can be formulated quite neatly within this framework. Sections 2 and 3 present basic concepts of generalized finite automata theory and its relationship to context-free languages. We provide some general notation for transformations in Section 4 and in the following four sections, two basic kinds of transformations will be introduced and certain fundamental properties proved. In Section 9, these definitions will be related to others in the literature and several areas for further investigation will be indicated.
Notetaking and comprehension for computer-displayed messages: Personalized versus fixed formats
Authors: Ralph E. Geiselman, Michael G. Samet
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

An experiment was performed to evaluate the usefulness of an option for users of an automated information system to construct their own preferred formats for receiving intelligence messages. It was hypothesized that such an option would enhance the acquisition and comprehension of intelligence data from each message. The results indicated that users who personalized the format arranged the message elements in an interpretable manner, and they took fewer notes during the subsequent paced presentation of messages in their individualized formats than users who received the messages in a reasonable, pre-experimentally fixed format. In addition, the users with personalized formats learned more with the fixed format. These data suggest that the personalization of the message format was useful and led to improved subjective organization of the intelligence data.