ppxscal/embedding_network huggingface dataset:
Optimization of negative gate networks realized in weinberger-LIKF layout in a boolean level silicon compiler
Authors: Andrzej Wieclawski, Marek Perkowski
Venue: Proceedings of the 21st Design Automation Conference (1984)

The random logic portion of a chip Implementing a set of Boolean functions and sequential circuits usually represents a major contribution to chip area. Obviously, there are many circuits which realize the same Boolean function. Unfortunately, at present there is no general theory that provides designers (and design automation programs) with lower bounds for total area, for gate oxide area, and for delay time of logic Implementations in Integrated systems. Therefore, the main task for the computer optimization program appears In choice of the circuit with the most convenient layout. DIADES is a design automation system with register-transfer level description on its Input and CIF file on output [5]. The digital circuit can be described in both behavioral and structural mode. A set of successive compilations and hardware implementing and optimizing transformations create the description of the network on the level of logic gates and pass transistors. As the output of hardware compilation from the higher level, this description is usually nonoptimal and thus is next optimized by recursive technology independent transformations based on Boolean algebra (like A*O &equil; O, A*A &equil; A, etc.). Inverters are also inserted into long chains of AND or OR gates, being the results of iterative circuits' compilation [4]. The next stages are: technology dependant optimization of the logic network, and network's layout. It is assumed that the resultant network is multilevel, consists of complex negative gates, and is realized in semiregular Weinberger-style gate matrix layout. The logic minimization method intended for layout minimization is described in this paper. It is assumed in our silicon compiler, that logic is constructed of n-channel, polysilicon gate MOSFET ratioless complex gates, performing any negative function. By negative function we understand negation of positive function, while positive function is any combination of AND and OR functors [1]. Functions for evaluation of circuit's performance parameters such as total area, area of gate oxide, and gate delay time are used. These functions are defined in terms of basic technology and selected topology parameters. The method can be adapted to other technologies.
Graphic Data Processing
Authors: Christopher F. Smith
Venue: Proceedings of the SHARE design automation workshop (1964)

The scope and breadth of Graphic Data Processing, as indicated by the myriad of applications, industries, and disciplines to which is applies, is immense. Graphic technology and methodology, in turn, is new and growing. The individual problem areas of programming, drawing input, stored program graphic processing, console manipulation, digital image storage, and drawing output, are each subjects that could fill a book. This introduction will concentrate on one of these areas, drawing output. Graphics output is the &ldquo;business&rdquo; end of Graphic Data Processing, and by summarizing what is being produced by Graphic Data Processing systems today a good idea of the current scope of graphics can be achieved.
Meeting a restricted consulting budget with part-time help
Authors: Ron Witt
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

At Northwestern University's Academic Computing Center, the first level of user consulting is provided by a carefully selected and trained group of 23 student consultants that report to User Services. These consultants are able to handle between 90 and 95 percent of all user problems without any further staff assistance. The total budget approximately equal to one full-time staff member without much of the overhead.
Computer rendering of fractal curves and surfaces
Authors: Loren C. Carpenter
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

Fractals are a class of highly irregular shapes that have myriad counterparts in the real world, such as islands, river networks, turbulence, and snowflakes. Classic fractals include Brownian paths, Cantor sets, and plane-filling curves. Nearly all fractal sets are of fractional dimension and all are nowhere differentiable. Previously published procedures for calculating fractal curves employ shear displacement processes, modified Markov processes, and inverse Fourier transforms. They are either very expensive or very complex and do not easily generalize to surfaces. This paper presents a family of simple methods for generating and displaying a wide class of fractal curves and surfaces. In so doing, it introduces the concept of statistical subdivision in which a geometric entity is split into smaller entities while preserving certain statistical properties.
Conceptual design for automatic test system simulator
Authors: F. Liguori
Venue: Proceedings of the 1969 24th national conference (1969)

This paper describes the concepts pursued in the design of a &ldquo;software&rdquo; simulator for a large-scale, multipurpose, automatic test system. The test system (General Purpose Automatic Test System) has been in field use for several years, and the demand for new operational programs has increased beyond the available machine time to validate the programs. Hence the simulator must provide a practical means for prevalidating programs intended for the real test system. This unique application of a simulator has many interesting features including complete software construction, modularized organization, and automatic generation of signal tracings and flow charts. The simulator is operable on a general purpose computer and requires little input data other than the machine language program normally produced for the real test system.
The role of operators in APL
Authors: Kenneth E. Iverson
Venue: ACM SIGAPL APL Quote Quad (1979)

Operators, which apply to functions to produce functions, are an important component of APL. Despite their importance, their role is not well understood, and they are often lumped with functions in expositions of the language. This paper attempts to clarify the role of operators in APL by tracing their development, outlining possible future directions, and commenting briefly on their roles in other languages, both natural and programming.
&ldquo;Interactive&rdquo; - a user friendly simulation language
Authors: Ronald R. Mourant, Raman Lakshmanan
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

INTERACTIVE is a Pascal based network simulation language that is designed to be used on microcomputers. The language enables simulation models to be represented in a process-oriented structure using eighteen network node symbols. The simulation of a network model is performed in four steps. First, the physical model is described as a network diagram by combining the node symbols. In step 2, the details of the network diagram are entered into the computer using a &ldquo;Forms Editor.&rdquo; In step 3, INTERACTIVE automatically creates a network flow model. The final step is the execution of the simulation model. In this step, run-time status messages, summary reports, and graphical plots are presented on the computer display for monitoring the system performance and possible user interaction.
Calculating properties of programs by valuations on specific models
Authors: Michel Sintzoff
Venue: Proceedings of ACM conference on Proving assertions about programs (1972)

The proof that a program verifies some property is carried out by the valuation of the program in a model characterizing that property. Specific models are given for sufficient conditions of the correctness of types, locations and asynchronous computations; a hypothetical programming language is used, which includes functions and locations and allows their recursive composition. The application of the method in studying termination or correctness problems is discussed on particular programs.
Simulation analysis of expert power in joint decision making against competition
Authors: Jehoshua Eliashberg, Ralph L. Day
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

A simulation model was utilized to investigate the influence of &ldquo;expert power&rdquo; when cooperating decision makers attempt to make optimal decisions of a strategic nature against competition. The simulation model is a modified version of one used previously to study the effects of conflicts in perceptions [1] and employs empirically derived utility functions, alternative game theoretic structures, and a &ldquo;Group Bayesian&rdquo; interpretation of joint decision making. The simulation results showed no effect of expert power when the criterion was market share (constant sum game) but some effects when the criterion was profit (nonconstant sum game) and the level of variability in the environment was high. As expected the results showed that competition was more intense when the criterion was market share.
High level language programs run ten times faster in microstore
Authors: Henry G. Baker,  Jr., Clinton Parker
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

A true microcode compiler for a minicomputer is described which translates an algebraic language directly into executable microcode. The compiler performs extensive optimization and produces code which is a good compromise between speed and size. This compiler was produced in order to make user microprogramming more accessible to the applications programmer. Several representative programs were compiled, and their run time improved by a factor of ten, on the average.
Process control languages and APL
Authors: J. A. Richter
Venue: Proceedings of seventh international conference on APL (1975)

At the moment, the trend on software developing shows generalized and flexible macro-routines by which any user with an explicit knowledge to his process should be able to write his own software for control, optimization, and information. Generalized software are mostly of the compiler level type and the evolution of these languages in the on-line control field is lagging behind the development in general edp and scientific field by three to five years. The gap is easily explained because on-line control is complex, diversified in application and time dependent. That no standard on-line control language has become generally accepted yet is an important observation. Viewing the possibilities within APL it is remarkable that no APL system dedicated to process control is on the market although APL has been implemented since 1966. The present paper, therefore, is dealing with the general problems which arise for an APL system for process control but the discussion is made specific by referring to the experience by using APL on an IBM 1800 process control computer. An APL system for process control will here be called APL-PC in analogy to the APL shared variables system APL SV.
Theoretical results in compiler design and implementation (Tutorial Session)
Authors: Michael Harrison, Susan Graham, Kenneth Kennedy
Venue: Proceedings of the 1976 annual conference (1976)

The aim of this session is to survey some advances in theoretical computer science and their impact on the design of programming language compilers. There has been considerable research activity in three major areas: the analysis of program syntax (parsing), the detection of errors at compile time, and the optimization of compiled code. The tutorials presented here do not purport to summarize all the work that has been done; instead, they attempt to capture the flavor of current research in these areas and demonstrate its practical importance.
Machine Vision for Medical Image Analysis and Virtual Surgery
Authors: Nicholas Ayache
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Medical Image Analysis and Surgery Simulation are young research 1/2elds with enormous potentials but many unsolved and challenging research problems. I will present a list of such problems including rigid and non-rigid registration, motion analysis and soft-tissue modeling, and discuss some recent advances and perspectives. I will illustrate my presentation with current projects involving our research group Epidaure at INRIA.
A fuzzy sets based linguistic approach: Theory and applications
Authors: Piero P. Bonissone
Venue: Proceedings of the 12th conference on Winter simulation (1980)

Fuzzy sets theory and fuzzy logic constitute the basis for the linguistic approach. Under this approach, variables can assume linguistic values. Each linguistic value is characterized by a label and a meaning. The label is a sentence of a language. The meaning is a fuzzy subset of a universe of discourse. Models, based on this approach, can be constructed to simulate approximate reasoning. The implementation of these models presents two major problems, namely how to associate a label to an unlabelled fuzzy set on the basis of semantic similarity (linguistic approximation) and how to perform arithmetic operations with fuzzy numbers. For each problem a solution is proposed. Two illustrative applications are discussed.
Sizing and assessing computer design alternatives using simulation
Authors: Gary J. Wright, Thomas L. Hannan
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper describes the major phases of a computer system simulation study performed by the Federal Computer Performance Evaluation and Simulation Center for the Federal Aviation Administration. The Central Flow Control System, the system simulated, was in the preliminary design stage when the study was initiated. The study was undertaken to assess the performance of the proposed system, as well as the performance of system design alternatives. This study demonstrates the utility of using simulation during the early stages of a system's life cycle by providing designers insight into the system's performance and by identifying design alternatives that will improve performance. This paper contains descriptions of the system, the simulation process and objectives, the alternatives simulated, and the results and benefits derived through the use of simulation.
The use of context for correcting garbled English text
Authors: Charles M. Vossler, Neil M. Branston
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The paper describes two different methods for using context to correct garbled English text. The first makes use of a dictionary of English words containing their probability of occurrence. The second uses letter digram frequencies to roughly approximate English word probabilities. Probabilities of various letter substitutions are obtained from a confusion matrix of the simulated character recognizer whose operation produced the garbling. This information is combined using a maximum likelihood scheme to obtain word recognition or, if only digram information is available, the recognition of word approximations. In order to test the methods empirically, computer programs were written, and experiments were run using textual material from various sources. Besides a rather limited comparison of the -and-ldquo;dictionary-and-rdquo; and -and-ldquo;digram-and-rdquo; methods on material from a children's primer, a test was made of a combined system on material from newspaper articles and from a book on psychology.
Planning for instructional time-sharing service
Authors: Dale La Frenz
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

The Minnesota Educational Computing Consortium (MECC) faced a serious instructional time-sharing service problem in the Fall, 1976. After having survived the 1975-76 poor-service year, while the Univac 1110 underwent extensive software development, an October, 1976, MECC/Univac agreement to terminate the long term contract was reached. It was mutually agreed that the Ul110 would provide service for the academic year and leave in June, 1977. The eight step process for planning, selecting, and implementing the MECC Cyber 73 instructional time-sharing service will be reviewed. The presentation will briefly review the history of MECC statewide time-sharing with focus on the planning/installation and conclude with a status report of the current Cyber 73 service situation.
&ldquo;An interactive, graphical system for the design of photomasks&rdquo;
Authors: F. K. Richardson
Venue: Proceedings of the 9th Design Automation Workshop (1972)

A stand alone computer, a graphics input/output terminal and a comprehensive software system provide a rapid visual verification of digitized data from schematics to artwork.
A nested transaction mechanism for LOCUS
Authors: Erik T. Mueller, Johanna D. Moore, Gerald J. Popek
Venue: Proceedings of the ninth ACM symposium on Operating systems principles (1983)

Atomic transactions are useful in distributed systems as a means of providing reliable operation in the face of hardware failures. Nested transactions are a generalization of traditional transactions in which transactions may be composed of other transactions. The programmer may initiate several transactions from within a transaction, and serializability of the transactions is guaranteed even if they are executed concurrently. In addition, transactions invoked from within a given transaction fail independently of their invoking transaction and of one another, allowing use of alternate transactions to accomplish the desired task in the event that the original should fail. Thus nested transactions are the basis for a general-purpose reliable programming environment in which transactions are modules which may be composed freely. A working implementation of nested transactions has been produced for LOCUS, an integrated distributed operating system which provides a high degree of network transparency. Several aspects of our mechanism are novel. First, the mechanism allows a transaction to access objects directly without regard to the location of the object. Second, processes running on behalf of a single transaction may be located at many sites. Thus there is no need to invoke a new transaction to perform processing or access objects at a remote site. Third, unlike other environments, LOCUS allows replication of data objects at more than one site in the network, and this capability is incorporated into the transaction mechanism. If the copy of an object that is currently being accessed becomes unavailable, it is possible to continue work by using another one of the replicated copies. Finally, an efficient orphan removal algorithm is presented, and the problem of providing continued operation during network partitions is addressed in detail.
Computer aided design system for logic equipment applied to design of electronic switching equipment
Authors: Tatsuro Hirano, Kazuyuki Hirakawa
Venue: Proceedings of the 10th Design Automation Workshop (1973)

This description is intended for the purpose of relating a brief history of the development of the design automation system in our OKI Electric Industry Co., Ltd. and an outline of the design automation system used at present in our company; it relates specially an introduction of the package design system which is one of the subsystems in the design automation systems. Moreover, with regard to the electronic switching equipment, type DEX developed by the Nippon Telegraph Telephone Public Corporation and the four manufacturers (OKI Electric Industry Co., Ltd., Nippon Electric Co., Ltd., Fujitsu Co., and Hitachi Co., Ltd.) in the field of production of telecommunication equipments in Japan, it relates how the design files were applied to the production and inspection process in our plant.
An introduction to network computers
Authors: Larry D. Wittie, Andre M. van Tilborg
Venue: Proceedings of the ACM '82 conference (1982)

Low cost, compactness, and surprising compute power combine to make microprocessor computing elements attractive as building blocks for large parallel computers. Many applications ranging from brain simulation to real-time traffic control can be solved by using inherently parallel techniques executing on loosely-coupled ensembles of microcomputers known as network computers. However, network computer technology is still in its infancy. The main technical problems that remain to be solved relate to software control in distributed operating systems. The MICRONET network computer at SUNY/Stony Brook is being built as a testbed laboratory to experiment with decentralized control techniques, distributed programming languages, and distributed real-time monitoring.
A multi-step formation of variable valued logic hypotheses
Authors: James Larson
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

A multi-step method for forming variable valued logic hypotheses is given. An experiment applying this method to a problem in medical diagnosis is described. The results are compared to those of a direct (one-step) method and to a classical Bayesian approach.
A design study of a shared resource computing system
Authors: A. Thomasian, A. Avizienis
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

The motivations for the design study of a modular, shared resource computing system are given by discussing fault-tolerance and resource utilization issues in parallel processing architectures. A design is presented which employs an array of pipelined arithmetic processors to perform array operations. The design provides for fault-tolerance (&ldquo;graceful degradation&rdquo;) capability and is efficient in using main memory bandwidth. Various architectural tradeoffs of the design are discussed. Some results of simulations used for the verification of design decisions are also reported.
Use of performance analysis statistics in computer system simulation
Authors: P. R. Katonak
Venue: Proceedings of the 5th conference on Winter simulation (1971)

A general purpose job stream simulation model has been developed for routine use in evaluating hardware configurations and performance tuning a large scale multiprocessor computing system operating in a multiprogramming mode. The model is designed to simulate a variable workload of jobs statistically generated from attributes of the actual workload for any time period. Major functional modules include job-step generation, job classing, scheduling and step initiation, core allocation, cpu operation, and I/O activity. Hardware attributes (such as, available core and number of DASD control units), operating considerations (such as, number and priority class structure of initiators), and workload characteristics can readily be varied at model initialization time.
The Tarski decision procedure
Authors: George E. Collins
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The Tarski decision procedure can be briefly described as an algorithm for deciding on the validity of any elementary statement about polynomials over the field of real numbers. The adjective &ldquo;elementary%rdquo; is used here in a technical sense, but its meaning will be indicated by examples.
Modular expansion in a class of homogeneous networks
Authors: Alan Mink, Charles B. Silio,  Jr.
Venue: Proceedings of the Computer Network Performance Symposium (1982)

We consider a special class of homogeneous computer network comprising several essentially identical but independent computing systems (ICSs) sharing a single resource. Of interest here are the effects of modularly expanding the network by adding ICSs. We use a previously presented approximate queueing network model to analyze modular expansion in this class of network. The performance measure used in this analysis is the mean cycle time, which is the mean time between successive requests for service by the same job at the CPU of an ICS. In this analysis we derive an intuitively satisfying mathematical relation between the addition of ICSs and the incremental increase in the service rate of the shared resource required to maintain the existing level of system performance.