ppxscal/embedding_network huggingface dataset:
Computer aided ship design at MarAd
Authors: Alan H. Woodyard
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The preliminary ship design process is a natural for design automation as it involves an iterative series of calculations based upon a data base which describes the hull shape. Figure I illustrates the spiralling nature of the design verification from basic requirements of the ship to final design and indicates the sequential nature of the calculations. While these programs were computationally efficient they suffered on both the input and output sides. The addition of interactive creation of input files, a digitizer, and a plotter for graphical out-put have since been added to give the total system a new dimension. In order to better describe the system's capability, a sample design will be developed explaining the role of each program in the design spiral.
Near-complete decomposability of queueing networks with clusters of strongly interacting servers
Authors: Hendrik T. Vantilborgh, Richard L. Garner, Edward D. Lazowska
Venue: ACM SIGMETRICS Performance Evaluation Review (1980)

The near-complete decomposability of queueing network models of computer systems is generally supported by very large differences in the service rates of the servers. In this paper we show how such models may still be nearly completely decomposable if on the one hand these large differences can no longer be realistically assumed (as is the case, for example, in computer networks) but if on the other hand clusters of strongly interacting servers exist. Our results may be viewed as a bridge between the approaches to the approximate analysis of queueing networks advanced by Courtois and by Chandy, Herzog and Woo, since we show circumstances under which the former approach leads to exactly the same method of analysis as the latter. In contrast to the Chandy, Herzog and Woo theorem, however, the theory of near-complete decomposability does not rely on the beneficent properties of queueing networks exhibiting product form solutions. Thus our results may point the way towards the theoretically sound application of simple and intuitively appealing approximate analysis techniques to non - product form networks.
A summary of investigations into three and four valued logics
Authors: George Epstein
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

There are a number of basic 3 and 4-valued relationships which have been neglected in the literature. Some of these are relationships which involve key connectives such as strong negation. The latter operation has logical properties corresponding to electrical properties of inverters which are used today in the design of all binary computers (and also used indirectly through the use of NAND or NOR circuits, at the feedback paths within flip-flop circuits, and at the inner inversion points of certain cascaded amplifiers). The reason for such neglect seems to be two-fold: (1) The technical development for general n camouflages specifics for certain low values, such as n&equil;2, 3, or 4; and (2) The concommitant avoidance of immediate practical applications, encourages neglect of practical relationships which are needed by the computer scientist or engineer. The theoretical background for this work occurs as early as 1941, with the algebras of G. Moisil. The inability of these algebras to model &Lstrok;ukasiewicz logics with more than 4 values was noted in 1968 by A. Rose. There are similar results for the P-algebras of Epstein and Horn with either the Meskhi or Cignoli conditions, as reported in the Bulletin of the Section of Logic, Polish Academy of Sciences, 6, #4, pp.156-160, 1977. The practical reason for focus on the 3 and 4-valued cases is the continuing interest in 3-valued digital circuitry and computers, evidenced in our 8 annual symposia on multiple-valued logic of this decade, and the most recent application to 4-valued digital circuitry by Signetics Corporation, reported in May, 1977 at the Seventh International Symposium on Multiple-valued Logic at Charlotte, North Carolina. This encourages a fresh look at interconnections and relationships which hold for the 3 and 4-valued cases, with special emphasis on the key connectives which appear in practical applications.
A system for program refinement
Authors: Thomas E. Cheatham,  Jr., Judy A. Townley, Glenn H. Holloway
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The Program Development System (PDS) is a programming environment, an integrated collection of interactive tools that support the process of program definition, testing, and maintenance. The PDS is intended to aid the development of large programs, especially program families whose members must be maintained in synchrony. The system facilitates implementation by stepwise refinement, and it keeps a refinement history that allows program modifications made at a high level of abstraction to be reflected efficiently and automatically in the corresponding low level code. Analysis tools are used both to support program validation and to guide program refinement. We describe the PDS and the tools incorporated in it, and we conclude with an example of its use.
Functional testing of LSI gate arrays
Authors: G. Vaughn
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This is a report on the testing of LSI gate arrays. A large number of combinational and sequential digital networks were tested using the traditional s-a-1, s-a-0 faul t model. These random logic functions were implemented with LSI gate array devices. This report describes the environment within which these devices were tested and the testing results. Also, some problems encountered in testing these devices and solutions to these problems are summarized.
An integrated CAD data base system
Authors: A. J. Korenjak, A. H. Teger
Venue: Proceedings of the 12th Design Automation Conference (1975)

To integrate existing CAD programs, as well as to provide a nucleus for future growth, a unified CAD data base has been implemented for storing the design data needed by many different types of CAD programs. This paper describes an IC-oriented design system that uses this data base structure a new design language to integrate logic simulation, test generation, IC mask layout, and design verification programs.
GASPL/I: A PL/I based simulation language
Authors: Robert E. Young, A. Alan B. Pritsker
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

GASPL/I is a PL/I based simulation language structured around the GASP simulation philosophy. It is a discrete-event simulator which extends and refines the principles employed in the FORTRAN based GASP II language. In this paper, an example of the use of GASPL/I is presented. The example involves the simulation of a project when resources are limited. Emphasis is given to the file system and the multiple-entry feature of GASPL/I. A portion of the GASPL/I coding for the example is included.
A simulation system for implementation and evaluation of diagnostic programs of a special-purpose telecommunication switching processor
Authors: I. Alleva, M. G. Corti, R. Galimberti, F. Pescarolo
Venue: Proceedings of the 12th Design Automation Conference (1975)

Introduction of electronic switching system in important sectors like telecommunication where service breakdown is not tolerable because of the consequential dangers, bring out the problem of operational continuity of the system itself. It is well known that the ability to identify and localise faults easily is one of the major factors that contribute to the operational continuity of telephonic system and to rapidly execute services. It becomes therefore important to possess a library of diagnostic programs of quick execution and a high degree of reliability so that the system may be subjected to rapid tests in order to assess its soundness and to spot potential faults. Keeping therefore in mind that our primary object is to develop such programs, it is necessary: to be able to analyse the behaviour of the system both in the presence or absence of faults and to process the resulting information in order to compile a dictionary of faults. to be able to evaluate the fault resolving power of the diagnostic programs. This evaluation points to those faults not yet diagnosable, thus giving a figure of merit indicating not only the ability of the program to cover all possible failures but also offering a valuable indication of the degree of development of the diagnostic programs. A suitable software structure should therefore be devised not only to facilitate the development and evaluation of diagnostic programs, but also to be an instrument which can provide design guidance in case of an alternative choice anticipating during the design phase, these improvements which could otherwise be only verified when the prototype has already been developed.
Optimization problems in extensible compilers
Authors: Bruce J. Bolas
Venue: Proceedings of a symposium on Compiler optimization (1970)

Some observations are made about the special problems of optimization in compilers for extensible languages. Different kinds of extension are defined, and their impact on the processes of compiler optimization are briefly discussed. The problems of achieving good optimization for such languages are related to the problems of formalizing the definition of programming languages in general.
That really is a hard problem you've spent six months working on: A tutorial on NP-complete problems
Authors: George Lueker, Edward Robertson
Venue: Proceedings of the ACM '81 conference (1981)

The property of being &ldquo;NP-complete&rdquo; and the &ldquo;P &equil;? NP&rdquo; question are recognized as important theoretical concepts with which a practicing computer scientist should be acquainted. This tutorial will briefly introduce a simple model in which the significance of &ldquo;NP-completeness&rdquo; is discussed and will illustrate what makes a problem NP-complete with several examples. The second part of the tutorial discusses some of the ways of dealing with NP-complete problems. The computational models used in this presentation are deliberately extremely simple. The very simplicity of the model allows it to easily capture an important property of NP-complete problems: finding a solution may be difficult, but if one can guess (or be given) a solution, the validity of this solution can easily be tested. This is the first part of the definition of NP-completeness and puts a (very high) upper limit on how difficult an NP-complete problem can be. The second part of the definition gives a lower limit with a requirement that a problem be as hard as a well-known class of difficult questions. The tutorial will illustrate how relative difficulty is established and will discuss the expected but unproved absolute difficulty of NP-complete problems. The second half of the tutorial will be devoted to examining the implications of NP-completeness. It will be seen that NP-completeness is not always as serious limitation as it might appear to be. For example, sometimes it is possible to compute an approximation in a reasonable amount of time, with a guarantee that the approximation is not too far from the true optimum value. Sometimes it is possible to do a probabilistic analysis which shows that an algorithm does well on the average. Thus the notion of NP-completeness can help people redirect their efforts effectively by giving them some idea of what are realistic goals.
Data communications activities in the Federal Republic of Germany
Authors: Hermann G. Gabler
Venue: Proceedings of the sixth symposium on Data communications (1979)

Since the mid-sixties, when the first public data services were introduced, the Deutsche Bundespost has endeavoured to meet the demands of the market for communications and to enable the data customers to perform their different data processing functions in an efficient and economic manner. To achieve this objective, as required under the mandate conferred on it by law, the Deutsche Bundespost operates public telecommunication networks. Whereas in the beginning there existed only one possibility of data transmission, namely the public switched telephone network, new applications of data transmission have been made available in recent years. This process is still going on. Within the next few years, the data services offered and the number of facilities available to our customers will continue to grow. The purpose of this paper is to give a survey of the current situation in the field of data communications in the Federal Republic of Germany and to provide an insight into the present stage of our projects.
An algorithm generating the decision table of a deterministic bottom up parser for a subset of context free grammars
Authors: Gérard Terrine
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

An algorithm is described, whose input is a context-free grammar G and whose output is, if G fulfils a set of conditions, a decision table for a deterministic bottom up parser yielding the syntactic structure of the terminal sentences that belong to L (G). The complexity of the decision table depends on the stringency of the conditions satisfied by G and corresponds to some subsets of context free grammars which are compared with previously defined subsets such as LL(k), BRC (m,k)-i.e bounded right context -, LR(k).
Public use of an economic data base system. (Abstract Only)
Authors: Charles G. Renfro
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

The subject of this paper is the design of an economic data base system for public use, taking as a case study the Kentucky Economic Information System. This system offers its users facilities ranging from simple data retrieval and display to the capability to construct, maintain, and use econometric models online. It was designed originally to be user friendly to the trained econometrician, offering a semi-natural, verbal-mathematical free-format command language as the basic communication mechanism. However, with the development of the KEIS into a data base system that is widely used by government officials, academics, and others throughout Kentucky, the need has developed to provide a facility that is user friendly to any possible user. This paper considers the issue of user friendliness as a variable, depending upon the category of user. But it also considers tbe role played by the computer network and its operating conventions as a determinant of the user friendly features that are required. For example, in order to make the KEIS useable by reference librarians in universities, it was necessary to design a special interface; this necessity relates to the operating policies of the Kentucky Educational Computing Network, one of the computer networks the KEIS is resident upon. In addition, this paper considers the issue of user friendliness as it arises due to the specific characteristics of data and the operations performed: an economic data base system is inherently more difficult to operate than, say, a bibliographic data base system. Various other aspects of the KEIS have been considered in articles and papers appearing in such journals as the Journal of the American Society for Information Science and the Review of Public Data Use and in the proceedings of such conferences as the 1981 National Online Conference (March 1981) and the 8th European Urban Data Management Symposium, Oslo, Norway (June, 1981). A paper on the econometric modeling language (MODLER) that is available as part of the KEIS will be given at the 1981 Economic Control and Dynamics Conference, Copenhagen, Denmark (June 1981). This paper complements these other articles and papers.
Online documentation and user services
Authors: Kathryn P. Berkbigler, Roger Chaffee, T. R. Girill, Barbara L. Herron, Clement L. Luk, Janet Wallace
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

Online documentation and its role in user services is becoming increasingly important in government and industry computer centers. Many of the reasons for online documentation apply to university computer centers. The panelists, all of whom come from government or industry, will discuss their ideas on what is online documentation, what is it supposed to do, what ways can it be implemented, and what does it cost. The purpose of the discussion is to focus attention on one aspect of user services in which university computer centers might become profitably involved. The following outline lists most of the areas that are related to online documentation. It will not be possible to address each area; however, the panelists will give their views on the relative importance of each area.
Classes of pebble games and complete problems
Authors: T. Kasai, A. Adachi, S. Iwata
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

A &ldquo;pebble game&rdquo; is introduced and some restricted pebble games are considered. It is shown that in each of these games the problem to determine whether there is a winning strategy (two-person game) is harder than the solvability problem (one-person game). We also show that each of these problems is complete in well known complexity classes.
Datagram routing for internet multicasting
Authors: Lorenzo Aguilar
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

We present a solution to the problem of multidestination routing in internetworks. The component subnets of these internets share a common datagram internet layer, and the gateways and hosts can determine the next gateway en route to a foreign net. Our datagram routing offers high resilience to network failures, major reductions in network traffic, and no changes whatsoever to the subnetwork routing. The routing follows &ldquo;shortest&rdquo; paths as defined by the distance criteria of an internet. We intend to use the algorithm as an option of the DoD Internet Protocol with only minor changes to IP while preserving interoperability with IP modules not supporting multidestination.
A laboratory for the development and evaluation of BMD software quality enhancement techniques
Authors: Jeoffrey P. Benson, Richard A. Melton
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper describes a Software Quality Laboratory which will be used to develop new software quality analysis tools and evaluate their effectiveness. The laboratory will consist of a centralized data base for storing information about programs and a set of analysis routines which can be invoked interactively. A major effort using the laboratory will be the development of an executable assertion language. The laboratory will also be used to perform research in program verification and testing.
An integrated approach to the design of fault tolerant computing systems.
Authors: L. Philip Caillouet,  Jr., Bruce D. Shriver,  Sr.
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

This paper offers an introduction to a research effort in fault tolerant computer architecture which has been organized at the University of South-western Louisiana (USL). It is intended as an overview of several topics which have been isolated for study, and as an indication of preliminary undertakings with regard to one particular topic. This first area of concentration involves the systematic design of fault tolerant computing systems via a multi-level approach. Efforts are being initiated also in the areas of diagnosis of microprogrammable processors via firmware, fault data management across levels of virtual machines, development of a methodology for realizing a firmware hardcore on a variety of hosts, and delineation of a minimal set of resources for the design of a practical host for a multi-level fault tolerant computing system. The research is being conducted under the auspices of Project Beta at USL (26).
Capsules: A data abstraction facility for Pascal
Authors: Alessio Giacomucci, Frank L. Friedman
Venue: Proceedings of the ACM '81 conference (1981)

Described is a data type abstraction facility that has been implemented as an extension to the University of Minnesota Pascal 6000 compiler. The facility provides an encapsulation that establishes a static scope of identifiers with controlled visibility. The facility was developed primarily for instructional purposes for use throughout an undergraduate computer science curriculum in which Pascal is the major language for program implementation. The paper begins with a brief background in which earlier abstraction facilities influencing the development of the capsule are described. Then a description of the capsule and capsule parameterization (generics) facilities is provided, followed by an outline of the implementation of the capsule in a Pascal compiler. Plans for a generic capsule library and some comments concerning the use of the system in undergraduate instruction at Temple university are given in the last section.
Computer science in a liberal arts environment
Authors: Robert N. D'heedene
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

This paper describes aspects of an experience setting up a new computer science curriculum in a small four year liberal arts college. Despite previous experience setting up such a program in an engineering environment, and the fact that in retrospect the problems seems obvious, the nature of problems encountered surprised the author. He caused himself and others both discomfort and hard work because he did not perceive fundamental causes sufficiently quickly and clearly, and hopes others working with liberal arts colleagues on curriculum development will find the ideas presented here helpful.
A microprocessor-based optical character recognition check reader
Authors: F. Chin, F. Wu
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

Magnetic Ink Character Recognition (MICR) technology has widely been used for processing bank checks. Since the MICR character set is a special type font, and the ink is also readable by human being, optical approach can also be used. This report will describe the design of a low-cost, but highly accurate, microprocessor-based optical character recognition (OCR) check reader. The performance of our OCR reader is affected by a number of factors, mainly the noise generated by the lens system and the colour image at the check background. In this paper we describe how our software solution can alleviate these problems. As speed is another concern, special attention is paid to the design of recognition algorithm, such as the avoidance of floating point arithmetics, hardware limitations, etc.
Language extensibility and program design
Authors: Ronald D. Hubbard,  Jr.
Venue: Proceedings of the 13th Design Automation Conference (1976)

The purpose of this paper is to define a method of adding extensibility to programming languages and to demonstrate the advantages of extensibility. The paper describes a method of adding ldquo;abstract data and operators&rdquo; to a language. This aids in the design, debugging, monitoring, and optimization of the program. By allowing the programmer to use the data constructs which fit his problem, the design and coding of the algorithm are integrated. Effective monitoring of the code is accomplished by using the newly defined operator entry and exit points as probe points. After initial debugging, the program can be optimized without changing any code by improving the implementation of the data type representation and by implementing important operators in micro-code.