ppxscal/embedding_network huggingface dataset:
Formal semantics for the automated derivation of micro-code
Authors: Robert A. Mueller, Joseph Varghese
Venue: Proceedings of the 19th Design Automation Conference (1982)

A semantics based scheme for use in machine-independent microprogram synthesis is described. The input to the synthesis system consists of a micro-instruction set processor model and requirement specifications. Validity and transformation rules which are an integral part of the system are used in an attempt to prove the existence of a microprogram satisfying the requirements and if feasible such a microprogram can be extracted directly from the proof. The primary goal of this paper is to describe a system of validity and transformation rules for use in such a synthesis system.
Towards a specification of syntax and semantics for languages for horizontally microprogrammed machines
Authors: Tomlinson G. Rauscher
Venue: ACM SIGPLAN Notices (1974)

Horizontally microprogrammable computers provide the potential for efficient use of hardware through parallel operation of internal resources. Present languages for microprogramming such computers, however, contain unnatural symbolism, inflexible format requirements, and additional constraints that are unnecessary for the functions the languages perform. The intrinsic characteristics of horizontally microprogrammable machines suggest the use of operator precedence languages to program them. We formally describe the syntax of a language, ANIMIL, along these lines and discuss some initial ideas on semantics of languages for horizontally microprogrammable machines. A brief report on present status and thoughts for future work conclude the paper.
The complexity of finding periods
Authors: Robert Sedgewick, Thomas G. Szymanski
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

Given a function f over a finite domain D and an arbitrary starting point x, the sequence x,f(x),f(f(x)),... is ultimately periodic. Such sequences typically are used for constructing random number generators. The cycle problem is to determine the first repeated element fn(x) in the sequence. Previous algorithms for this problem have required 3n operations. In this paper we present an algorithm which only requires n(1+O(1/(@@@@)M)) steps, if M memory cells are available to store values of the function. By increasing M, this running time can be made arbitrarily close to the information-theoretic lower bound on the running time of any algorithm for the cycle problem. Our treatment is novel in that we explicitly consider the performance of the algorithm as a function of the amount of memory available as well as the relative cost of evaluating f and comparing sequence elements for equality.
APL functions for precision control in floating-point computations
Authors: Augustin A. Dubrulle
Venue: Proceedings of seventh international conference on APL (1975)

Floating-point arithmetic[1] is the design almost universally accepted for computers dealing with so-called scientific computations. It was present in some of the earliest machines and successfully survived the controversies that followed its first implementations. Since then, it has been consistently available in the hardware of many systems and it has been extensively used by high-level programming languages. The description of a numerical algorithm is truly accurate if and only if it includes pertinent statements on the precision of the computation. Therefore, it is most desirable that an algorithmic language such as APL give the designer the ability to express such statements. Accordingly, if this language is also used for programming, it is essential that the programmer be allowed to access the full range of available hardware precisions. These considerations are the basis for the proposal to add to APL a system variable and a system function, @@@@CP and @@@@FP, described in this paper.
Fifth workshop on computer architecture for non-numeric processing: A flexible image processor using array elements
Authors: Ronnie K. L. Poon, Kwan Y. Wong
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

The purpose of this short paper is to describe some activities in our laboratory on designing a flexible image processor using array processing elements. In many document creation applications, it is desirable to include image handling capability in the system together with keystroke captured text processing function. However, this image handling creates two problems: one is the large amount of data needed for image storage, and the other is the large amount of processing required to produce an output image. Data compression reduces storage and transmission bandwidth requirements, but it also requires processing power to do compression and de-compression of images. The objective of the study is to provide low-cost hardware which has the flexibility to do a variety of image processing algorithms.
Programming-in-the large versus programming-in-the-small
Authors: Frank DeRemer, Hans Kron
Venue: Proceedings of the international conference on Reliable software (1975)

We distinguish the activity of writing large programs from that of writing small ones. By large programs we mean systems consisting of many small programs (modules), possibly written by different people. We need languages for programming-in-the-small, i.e. languages not unlike the common programming languages of today, for writing modules. We also need a &ldquo;module interconnection language&rdquo; for knitting those modules together into an integrated whole and for providing an overview that formally records the intent of the programmer(s) and that can be checked for consistency by a compiler. We explore the software reliability aspects of such an interconnection language. Emphasis is placed on facilities for information hiding and for defining layers of virtual machines.
Computer simulation of organizational choice processes under conditions of ambiguity and conflict - the case of West German universities
Authors: Holger Franck
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

This article deals with the computer simulation of processes of organizational choice under conditions of ambiguity and/or conflict. It is in line with efforts by Cohen, March, Olsen and others to investigate in those areas of problem resolution and organizational choice, which have not been covered by traditional rational theories relevant for organizational choice and problem solving such as organization theory, microeconomics, operation research, or planning theory. It goes beyond these efforts by taking into account a realistic organizational structure, non-choice processes, communication and activation processes, basic political conflict, and long-run changes in choice processes by certain outcomes of personnel decisions. A corresponding computer simulation model implemented in SIMSCRIPT II.5 and some experimentation and validation endeavors are described. The model serves at this stage of development above all as a conceptual framework for theory and empirical research. Most of the incorporated special assumptions stem from observations of choice processes and interviews of participants West German universities. It is argued, however, that conditions of ambiguity and conflict hold for many organizations.
A chip for low-cost raster-scan graphic display
Authors: Philippe Matherat
Venue: ACM SIGGRAPH Computer Graphics (1978)

Lowering the cost of graphic display units for use in personnal computers and as time-sharing consoles suggests the use of TV sets. Display electronics for such a raster-scan unit will include a screen memory containing the state of all displayable points, that is up to 256 Kbits for 512 &times; 512 B W display and more for colour applications. Technological advances in NMOS memories make such memory sizes cheaper and cheaper. The control part ensuring screen refresh, memory management, vector and character generation, and computer coupling remains very complex. A microprocessor-oriented Large-Scale-Integrated circuit including all these functions has been designed at the Ecole Normale Sup&eacute;rieure. Versatility has guided the design, as well for screen memory organization as for microprocessor interface. Display resolution from 64 &times; 64 to 512 &times; 512 are possible, with any number of colours or grey levels, depending only upon the memory size. Microprocessor interface is standard: an eight bits bidirectionnal data bus, a four bits address bus, a read-write signal and an interrupt request. These signals control the vector and character generators which execute microprocessor's commands during the idle phasis of the display controller. This permits an always clean diplay and yet a decent average speed of one point every 1.3 &mgr;s. In addition, a light-pen or crosshair circuitry allows interactive graphic use.
Experiments on an adaptive computer model of a distribution channel
Authors: Martin Pfaff
Venue: Proceedings of the second conference on Applications of simulations (1968)

The aim of the paper is to use computer simulation models of an entire industry's distribution channel as instruments of theory development. The major phenomena to be explained center around recent developments in distribution systems, resulting from advancing technology in the logistics of distribution as well as in communications between the various levels of the channel. Dynamic instabilities and various adaptive response patterns are found to be explainable more immediately by the hierarchical nature of the feedback-control relationships prevailing between various levels of the distribution channel than by environmental changes reflected in demand patterns.
Toward a data structure extension for APL
Authors: Wm J Mein
Venue: Proceedings of the eighth international conference on APL (1976)

An overview of some recent research in the area of data structure extensions to APL is presented and a number of critical issues in the proposed data structure extensions are enunciated. A minimal set of primitives to be included in a data structure extension is also given.
A Proposed Masters Degree In Software Engineering
Authors: A. A. J. Hoffman
Venue: Proceedings of the 1978 annual conference (1978)

A proposed masters degree program and curriculum in Software Engineering is presented. This program features courses in communication and management skills, as well as improved programming methodologies. Descriptions of seventeen new courses are included in the text. This program is designed to upgrade experienced software technicians and teach them to manage large software development projects.
Making use of a medium scale computer in an operationally oriented work environment
Authors: Robert Hahn
Venue: Proceedings of the third annual computer personnel research conference (1965)

Test operations support is the principal business activity of Edgerton, Germeshausen Grier, Inc. Since 1956, EG G personnel has provided the instrumentation and controls support for the Project Rover tests beginning with the early experimental reactors of the Kiwi series. As a part of this effort, EG G has designed, built and is operating on-site one of the largest analog telemetry systems in the United States. A contributor to the earliest diagnostic studies of nuclear explosions, the company has long been involved in timing, firing, data recording, and analysis of the nuclear tests performed by the U. S. Atomic Energy Commission. EG G is particularly experienced in the development and fielding of instrumentation systems as well as in techniques for analysis of the data gathered by such systems. We will now address ourselves to the Las Vegas facility equipment and show how it has been used and how staffing was performed following the installation.
A practical method of documenting and verifying Ada programs with packages
Authors: David C. Luckham, Wolfgang Polak
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

We present a method of formal specification of Ada programs containing packages. The method suggests concepts and guidelines useful for giving adequate informal documentation of packages by means of comments. The method depends on (1) the standard inductive assertion technique for subprograms, (2) the use of history sequences in assertions specifying the declaration and use of packages, and (3) the addition of three categories of specifications to Ada package declarations: (a) visible specifications, (b) boundary specifications, (c) internal specifications. Axioms and proof rules for the Ada package constructs (declaration, instantiation, and function and procedure call) are given in terms of history sequences and package specifications. These enable us to construct formal proofs of the correctness of Ada programs with packages. The axioms and proof rules are easy to implement in automated program checking systems. The use of history sequences in both informal documentation and formal specifications and proofs is illustrated by examples.
Implementation of high speed data sets with microprogrammable data processors
Authors: Glenn N. Caplin, Anne R. Clayton, Richard L. Stuart
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

Modern high speed data sets (or Modems) are usually required to perform a great deal of digital signal processing to maintain acceptable error rates for worst-case channel conditions. Previously, this digital processing task was implemented with dedicated SSI/MSI TTL circuits. With the advent of high speed microprogrammable units (ALU's, sequencers, etc.), it has become possible to replace a random logic design with a functionally equivalent microprogrammed design. This results in better density, lower power requirements, and greater versatility and flexibility. The microprogrammed system described is designed to provide accurate emulation of an existing data set while maintaining the advantages of microprogrammed architecture versus random logic.
On the machine conversion of B5500 Algol to CDC 6000 Algol
Authors: Richard E. Marks
Venue: Proceedings of the 1971 26th annual conference (1971)

This paper describes the machine conversion of Algol for the Burroughs B5500 to Algol for the CDC 6000 series. CDC Algol is essentially Algol 60 and is a subset of Burroughs Algol which is the primary language for the B5500. Burroughs Algol implements extensive input-output and file manipulation operations. Burroughs Algol allows bit manipulation; the B5500 and the CDC 6000 series have different internal representations of both arithmetic and boolean quantities An overview of the conversion program is given. A discussion of conversion of the machine dependent constructs and of radically differing syntactic and semantic constructs is presented.
How to show something is not: Proofs in formal language and computability theory
Authors: Keith Harrow
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

Most introductory courses in theoretical computer science (formal language theory or computability theory) start with a seemingly endless series of definitions, including what it means for a grammar or language to be regular, context-free, etc., or what it means for a function to be recursive, primitive recursive, or partial recursive. Bright students immediately ask two questions. First, what are examples of languages or functions that belong to one class but not the other? Second, is some particular language context-free, or is a particular function recursive? We must develop new techniques which allow us to give a negative answer to question two (and thus to answer question one as well). In this note we will discuss some of the methods that are often used in elementary proofs in formal language theory and computability theory.
Software product assurance (Panel Discussion)
Venue: Proceedings of the 1975 annual conference (1975)

Software buyers and users have a strong desire to be assured of the product's quality. Some techniques to generally improve software quality are reasonably well know&mdash;structured walk-throughs, precise statement of requirements, and use of appropriate programming languages. Experience with developing large scale software, however, has indicated that additional techniques are required. This session will deal with some techniques used by developers of large-scale software to achieve quality, and to provide assurance of the product's quality. These techniques are design validation (prior to implementation), configuration management (during implementation), and software validation (of implemented software).
Foundations of computer science for entry-level graduate students
Authors: Leonard H. Weiner
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

In recent years, as colleges and universities have established new interdisciplinary programs, students have tended increasingly to combine (or switch) academic fields as they pass from one degree level to the next. This has brought about a situation in which many students try to enter new academic areas at the graduate level without having the prerequisite undergraduate course background. And so for some time now, academicians have sought to develop programs and courses that will help those students make up their deficiencies and prepare them for more advanced work, rather than lower the standards of the basic courses. The course described in this paper was designed to cover approximately two and a half years of undergraduate computer science material in a six-credit, two-semester sequence. It is directed at graduate students from a variety of academic areas and does not require more than the usual resources for a programming course. Therefore, it should be of interest to institutions faced with limited budgets at a time when they are trying to build quality computer science graduate programs.
Tree transducers, L systems and two-way machines (Extended Abstract)
Authors: J. Engelfriet, G. Rozenberg, G. Slutzki
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

This extended abstract is a condensed version of the results presented in two technical reports ([16] and [13]). In [16] a systematic treatment of the relationships between parallel rewriting systems (top-down tree transducer, ETOL system) and two-way machines (2-way gsm, tree-walking automaton, checking stack automaton) is given. Particular attention is paid to the effect of restricting the copying power of these devices. In [13] the results of [16] are employed to show that the iteration of nondeterministic top-down tree transducers, of nondeterministic 2-way gsm's and of control on ETOL systems each gives rise to a proper hierarchy.
Printer graphics: New horizons in graphic output on the IBM 1403 printer
Authors: Michael Gordon, Arthur Oratorio
Venue: Proceedings of the SHARE design automation workshop (1964)

Graphic data processing is a product of evolution. Expansive information systems and a real time need for facts have necessitated new modes of data presentation. In the past conceptual and technological problems had limited development in this area. The purpose of this paper is to discuss a significant advance in this field - the increased graphic capabilities of the IBM 1403 Printer.
Simulating service station operations: A planning tool for SOHIO management
Authors: Phiroz P. Darukhanavala, Ross D. Hitti, Sujit R. Kumar, Chanaka Wijayasinha
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

SOHIO's service station layout simulator is presented as a planning tool assisting SOHIO management in making layout-related decisions. The need for a layout simulator at SOHIO is discussed and its role in the site-evaluation process is highlighted. An overview of the GPSS model is also included. Future plans involve the possibility of marketing the simulator to other oil companies on a nationwide basis through a timesharing network.
Optimization of the influence of problem modifications on given microprogrammed controllers
Authors: G. Biehl, W. Grass, S. Hall
Venue: Proceedings of the 17th Design Automation Conference (1980)

For the logic design of digital controllers, efficient synthesis algorithms have been published. Most of these assume, that a completely new hardware consisting of the fewest number of components has to be built. The implementation of those algorithms form an important part of a CAD system for logic design. In order to be accepted in practice, a CAD system has to take into account additional requirements. One of these concerns with the minimization of hardware changes caused by subsequent modifications of the control task which often become necessary after the completion of the hardware implementation. This paper describes a method which solves this problem for an universal structure of microprogrammed controllers. This method is implemented as a module of the CAD program system LOGE. LOGE supports the logic design of hardwired, microprogrammed, and microprocessor based controllers. LOGE already proved to be a powerful design tool in several industrial applications.
A functional level modelling language for digital simulation
Authors: P. J. DesMarais, E. S.Y. Shew, P. S. Wilcox
Venue: Proceedings of the 19th Design Automation Conference (1982)

FML, a high-level function modelling language developed and used at Bell-Northern Research (BNR), is described in terms of its features, structure, timing capability and manner of execution. The language is presented, not in its full syntactic details, but by way of more helpful illustrations and examples. FML is fully integrated with BNR's functional simulator, FUNSIM, and thereby allows accurate timing and concurrent fault simulation. FML is a register level language with sub-register scheduling and tolerance timing, and it features an efficient mechanism for unknown state processing. To the user, FML is a circuit-designer-oriented, highly readable, easily applied design tool for both IC and PCB design.
Knowledge-Based Methods for Classifier Combination: An Experimental Investigation
Authors: V. Di Lecce, A. Guerriero, G. Dimauro, S. Impedovo, G. Pirlo, A. Salzo
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Many combination methods have been proposed so far for classifier combination. In order to achieve better performance, some methods also use a-priori knowledge on the set of classifiers. Unfortunately, in this case the effectiveness of the methods is very difficult to predict since there is little assurance that the results obtained in controlled tests can be obtained under different working conditions imposed by the real applications.In this paper, the role of a-priori knowledge in classifier combination is evaluated. A recent methodology is used for the analysis of methods for classifier combination. The performance of a combination method is measured under different working conditions by simulating sets of classifiers with different characteristics for the test. A random variable is used to simulate each classifier while a suitable estimator of stochastic correlation is used to measure the agreement among classifiers.
Syntactic experiments with arrays of functions and operators
Authors: J. Philip Benkard
Venue: Proceedings of the international conference on APL (1984)

The syntactic binding hierarchy of Benkard is refined to produce a numeric table. This table has been used by Bunda and Gerth to implement a syntactic model of APL2. The model is extended to include new classes of objects and strands of objects other than data. Directions for syntactic development are suggested, tending toward a language which achieves flexibility by nesting simple levels in a remarkable parallel with nested arrays. Cautious experimentation with models such as this one is urged before firm extensions are made to the language.