ppxscal/embedding_network huggingface dataset:
A &ldquo;WAIT UNTIL&rdquo; algorithm for general purpose simulation languages
Authors: Jean G. Vaucher
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Modern simulation languages such as SIMSCRIPT II and SIMULA 67 are very powerful general purpose languages which contain facilities to handle lists and to schedule events in simulated system time (imperative sequencing statements). These languages do not include some of the useful but more specialized features of previous languages (GPSS, CSL, SOL) especially interrogative sequencing statements such as &ldquo;SEIZE (facility)&rdquo; or &ldquo;WAIT UNTIL (Boolean expression)&rdquo;; however, the definition capability of the new languages is powerful enough to permit their extension to include the interrogative features. The addition of some features of GPSS to SIMULA 67 was presented at a previous SIMULATION CONFERENCE. The present paper extends that work by describing an efficient algorithm which adds the &ldquo;WAIT UNTIL&rdquo; procedure to SIMULA.
A graphical input capability for APL
Authors: A. L. Jones, R. H. Katyl
Venue: Proceedings of the sixth international conference on APL (1974)

An experimental input capability for APL is described; the system includes a commercially available sonic pen and a specially designed interface. The user digitizes a graph by placing his curve on a special glass &ldquo;tablet&rdquo; and then touching the desired points of the curve with a pen that emits a spark. The time delay for the sound to reach the edges of the glass tablet is converted to x-y coordinates and transmitted to the APL host computer. APL functions convert this raw data into the coordinate system of the user's curve. Examples of the use of this facility are given.
Performance evaluation of multiprogrammed time-shared computer systems
Authors: Akira Sekino
Venue: Proceedings of the ACM annual conference (1973)

A comprehensive set of hierarchically organized modular analytical models is developed for performance evaluation of multlprogralmned vlrtual-memory tlme-shared computer systems. This hierarchy of models includes a user behavior model, a secondary memory model, a progrembehavior model, a processor model, and a total system model. The thesis especially details on the last three models. The program behavior model permits estimation of the frequency of paging. The processor model evaluates the throughput of a given multi-processor multi-memory processing system under multiprcgramming. Finally, the total system model derives response time distribution of an entire computer system under study. Accuracy of performance prediction by these models is examined by comparing the predicted performance and the measured performance of the Multlcs system. These analyses are then applied to the optimization of computer systems and to the selection of the best performing configuration for a given budget. This framework of performance evaluation not only guides human intuition in understanding actual performance problems but presents reliable answers to quantitative performance questions about throughput and response time of actual computer systems.
Formalisms for interprocess communication
Venue: Proceedings of the 1975 ACM SIGCOMM/SIGOPS workshop on Interprocess communications (1975)

The literature is rich in examples of a variety of interprocess communication methods, some of which can be considered simple line control procedures (half duplex, full duplex, polled, etc.) and others which are more elaborate and deal with reordering, duplicate detection, stochastic delays, and so on. Among the most poorly worked out areas of interprocess communication is a formal representation which permits proofs to be made of correct behavior under all circumstances. Some necessary conditions for correct behavior have been proposed in the papers in this Proceedings.
Diatom Identification: A Double Challenge Called ADIAC
Authors: Hans du Buf, Hamid Shahbazkia, Adrian Ciobanu, Micha Bayer, Stephen Droop, Ritchie Head, Steve Juggins, Stefan Fischer, Horst Bunke, Michael Wilkinson, Jos Roerdink, José Pech-Pacheco, Gabriel Cristóbal
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper introduces the project ADIAC (Automatic Diatom Identification and Classification), which started in May 1998 and which is financed by the European MAST (Marine Science and Technology) program. The main goal is to develop algorithms for an automatic identification of diatoms using image information: both valve shape (contour) and ornamentation. The paper presents the goals of the project as well as first results on shape modeling and contour extraction. Public data are available in order to create student projects beyond the ADIAC partnership.
Automated abstracting: A re-evaluation
Authors: Christine A. Montgomery
Venue: Proceedings of the ACM '81 conference (1981)

The automatic production of extract-type abstracts was one of the very early ideas for the application of computers to the processing of natural language text. In an early article, Hans Peter Luhn of IBM discussed the possibility of producing extracts of scientific and technical materials by frequency counts of occurrences of content words [Luhn 1968]. Unfortunately, as in the case of machine translation, the linguistic, statistical, Software and hardware technology were not mature enough to validate&mdash;or invalidate&mdash;the claims that were made for various methodologies by the pioneers in the field. Thus activities in these two areas were characterized by a great deal of arm-waving, claims and counter-claims, and generally trivial experiments which validated or invalidated nothing in particular.
Microprocessor synthesis
Authors: Vijay K. Raj, Barry M. Pangrle, Daniel D. Gajski
Venue: Proceedings of the 21st Design Automation Conference (1984)

The purpose of this paper is to describe a method for translating an instruction set described in a high level language into a register-transfer structure of a microprocessor. The designer interacts with the translator through the constraints imposed on the design, and by giving the initial but not necessarily complete description of the structure. A microinstruction table, which specifies the control sequence, as well as the datapath structure is the output of the translator.
Introduction to simulation modeling
Authors: J. William Schmidt
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Since World War II system modeling has played an increasingly important role in the analysis of complex systems in both the private and public sectors. In the broadest sense, a model may be considered to be a representation of reality without the presence of reality itself. Hence, pictures, graphs, management games, computer programs, and mathematical equations may be considered models of those systems which they represent. For the purposes of this discussion we will restrict our attention to that class of models which attempts to capture the relationship between the behavior of a measure or measures of system effectiveness and the behavior of those variables and parameters which influence the measure(s) of effectiveness and includes analog, simulation and mathematical models. The specific focus of our attention will be on simulation models.
The structure and operation of a design language compatible simulator
Authors: Memhet B. Baray, Stephen Y. H. Su, Robert L. Carberry
Venue: Proceedings of the 8th Design Automation Workshop (1971)

Logic design language provides a powerful tool for digital system specification. When coupled with automated logic design techniques the result is an extremely efficient mechanism for system realization. However, before any design process can be considered complete, the design integrity must be verified and some measure of system performance must be obtained. It is the function of the design language simulator to provide the capability for design verification and performance evaluation. This paper describes the structure and operation of a simulator compatible with the design language of Baray and Su. The overall structure of the simulator is discussed and the data base required by the simulator is specified. An algorithm is presented for extracting the data base information from the design language specification. Finally, the simulator run time environment is examined closely so as to identify the mechanisms which give rise to efficient operation in terms of both execution time and memory space requirements.
A &ldquo;bare bones&rdquo; approach to user seminars
Authors: Patrick J. Gossman
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

The success or failure of a user seminar is often determined by the format with which the subject matter is presented. If specific areas are explained in detail before an overview of the topic is presented, users may fail to grasp the basics. As a result, they may stop listening or even worse, stop attending. In an effort to minimize the number of dropouts, I have formalized a seminar format that is not entirely new and probably not applicable in all instances either. However, it is a method that has been quite successful when used to introduce software packages to new users.
Testing flow graph reducibility
Authors: Robert Tarjan
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Many problems in program optimization have been solved by applying a technique called interval analysis to the flow graph of the program. A flow graph which is susceptible to this type of analysis is called reducible. This paper describes an algorithm for testing whether a flow graph is reducible. The algorithm uses depth-first search to reveal the structure of the flow graph and a good method for computing disjoint set unions to determine reducibility from the search information. When the algorithm is implemented on a random access computer, it requires O(E log* E) time to analyze a graph with E edges, where log* x &equil; min{i/logix&le;1}. The time bound compares favorably with the O(E log E) bound of a previously known algorithm.
AP19 - a shared variable terminal I/O interface for APL systems
Authors: Bruce J. Hartigan
Venue: ACM SIGAPL APL Quote Quad (1981)

AP19 is an auxiliary processor which provides access, through the medium of shared variables, to the terminal input/output processor of an APL system. It allows the user to bring the power of APL to bear upon the management of subordinate and deferred sessions. This paper presents an overview of the design and development of AP19, describes its characteristics from a user's point of view, and gives some examples of how it has been used. Insofar as AP19 is a component of an IBM internal version of APLSV, it is not available to customers. This paper does not constitute a commitment by IBM to provide such a facility, nor is it to be construed as an indication of future product direction.
On the use of transition diagrams in the design of a user interface for an interactive computer system
Authors: David L. Parnas
Venue: Proceedings of the 1969 24th national conference (1969)

This paper deals with what might be called the top level design of an interactive computer system. It examines some problems which arise in trying to specify what the user interface of such a system should be. It proposes a concept&mdash;the terminal state&mdash;and a notation&mdash;the terminal state transition diagram&mdash;which make the design of the top level somewhat easier. It also proposes a user interface in which the notion of terminal state is explicit. This user interface seems to provide a great improvement in flexibility and case of adding subsystems to a general purpose system.
An exhaustive search for optimal multipliers
Authors: Louis R. Moore
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper presents the results of an exhaustive search to find optimal multipliers A for the multiplicative congruential random number generator Zi @@@@ A Zi-1 (mod M) with prime modulus M &equil; 231-1. Since Marsaglia (1968) has shown that k-tuples from this and the more general class of linear congruential generators lie on sets of parallel hyperplanes, it has become common practice to evaluate multipliers in terms of their induced hyperplane structures. This study continues the practice and regards a multiplier as optimal if for k &equil; 2,...,6 and each set of parallel hyperplanes the Euclidean distance between adjacent hyperplanes does not exceed the minimal achievable distance by more than a prespecified amount. The concept of using this distance measure to evaluate multipliers orginated in the spectral test of Coveyou and MacPherson (1967) and has been used notably by Knuth (1981). However, the criterion of optimality defined here is considerably more stringent than the criteria that these writers proposed. First proposed by Lehmer (1951), the multiplicative congruential random number generator has come to be the most commonly employed mechanism for generating random numbers. Jannson (1966) collected the then known properties of these generators. Shortly there-after Marsaglia (1968) showed that all such generators share a common theoretical flaw and Coveyou and MacPherson (1967), Beyer, Roof and Williamson (1971), Marsaglia (1972) and Smith (1971) proposed alternative procedures for rating the seriousness of this flaw for individual multipliers. Later Niederreiter (1976, 1977, 1978a,b) proposed a rating system based on the concept of discrepancy, a measure of error used in numerical integration. With regard to empirical evaluation, Fishman and Moore (1982) described a comprehensive battery of statistical tests and illustrated how they could be used to detect local departures from randomness in samples of moderate size taken from these generators.
Simulated demand in large-scale batch processor acquisitions: Role and justification
Authors: Ross T. Newkirk, James K. Mullin
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

The authors present this paper in the context of a successful acquisition of a multi user large scale batch processing system. They discuss the role of simulated demand (a) in determining basic system requirements, (b) as the major part of system specifications made available to vendors and (c) as a major tool in system testing and evaluation. They discuss the simulation of demand profiles from statistical records and user interviews and how this led to specifying minimum system requirements. The integration of simulated demand in formal system specifications is detailed. In particular, the assembly of an adequate test package to permit vendors to provide meaningful responses with their proposals is of interest. The authors show how an extensive series of benchmark programs and kernel routines were assembled to test adequately total system performance under various combinations. The evaluation process in terms of performance graphs in light of the initial specifications is reviewed. In summary, the authors discuss the results of specification, evaluation, selection and installation process in light of system suitability experienced after an initial period of use.
A methodology for tuning and verifying package simulation models
Authors: David C. Efron
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

The computer system simulation packages are generally regarded as being capable of producing viable performance projections quickly and cheaply relative to the time and cost of programming unique simulation models. Many users also recognize that simulation models cast in the prescribed molds of the packages may be subject to various errors. They will therefore consider all results as coarse indications of expected performance levels. In contrast, this paper demonstrates how the package simulators may be used in situations demanding accuracy and predictive confidence. A methodology is proposed for enhancing hardware, software and workload models within the framework of the packages and benchmarking their performance. An example of the procedure's application is given, whereby the CASE package is used to predict the point at which a workload outgrows the capacity of its host system. The paper illustrates the use of system performance monitors to provide a comparative base for benchmarking model accuracy. It also describes some of the technical details of tuning the package models to achieve predictive reliability. In addition, there is a discussion of the time frame and effort required by this proposed methodology and its suitability in other modeling applications.
Software engineering techniques in design automation&madash;a tutorial
Authors: Robert J. Smith,  II
Venue: Proceedings of the 14th Design Automation Conference (1977)

Several useful software engineering techniques, disciplines and perspectives are related to typical software development problems in design automation. Specific examples from recent experience illustrate both beneficial and undesirable practices. Oriented toward managers and practicing software engineers, the tutorial discusses system structure, control and data structures, programming guidelines, work habits, testing, documentation and operational maintenance.
Double cosets and searching small groups
Authors: Gregory Butler
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Double cosets are an important concept of group theory. Although the desirability of algorithms to compute double cosets has been recognized, there has not appeared any algorithm in the literature. The algorithm which we present is a variant of Dimino's algorithm for computing a list of elements of a small group. (By &ldquo;small&rdquo; we mean groups of order less than 104, whose list of elements we can explicitly store.) The paper focusses on the problem of searching a small group for elements with a given property. For the record we present Dimino's algorithm and a general algorithm for searching a small group. These two algorithms are not original. We analyse the search algorithm and discuss the role of double cosets in searching. The use of double cosets in the search algorithm does not appear to lead to an improvement over the use of right cosets.
Lab interns: A new level of service
Authors: Bradley E. Coxhead
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

Faced with ever increasing financial constraints imposed on universities and increasing demands for service from academic and administrative areas, university computing facilities are being forced to either increase computing charges or limit services. Northern has developed a program designed to increase service while providing better trained personnel at a relatively modest cost to the Academic Computing Center. Before establishing an Internship program, Northern provided two levels of service at two different labs, using undergraduate students, who were paid minimum wage on an hourly basis, graduate students on contract, and full-time consultants. The problem users faced lay in the fact that the consultants were on duty only during the day, the graduate students worked a staggered schedule, some days, some weekends, and the Center could not afford to give undergraduates, who made up the bulk of the work force, the extended training on the different packages and systems that would enable them to help with consulting. The primary responsibilities of the undergrads were maintaining the equipment, filling out reports, and keeping the labs running as smoothly as possible. Consulting provided by undergraduate employees consisted of only helping with syntax errors in Job Control Language and programming languages they were already familiar with, such as COBOL, Assembler, and PL/1. The establishment of an Internship Program provided the Center with an opportunity to provide undergraduate students with training that goes beyond maintaining equipment.
Hierarchical data management
Authors: Jan M. Engel
Venue: Proceedings of the eighth international conference on APL (1976)

An APL program has been developed for storing and maintaining relevant information about a group of persons linked together by a structured hierarchy. Functions that create, modify, and develop useful output from the data set are described with reference to a working example which further illustrates the approach used.
Experimental Polyprocessor System (EPOS)&mdash;architecture
Authors: Mamoru Maekawa, Isamu Yamazaki, Akira Maeda, Misao Miyata, Shigeo Kamiya, Hiroshi Kasai
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

The Experimental Polyprocessor System (EPOS) is described. It is a new computer system based on the concept of the polyprocessor and is intended to obtain a high degree of extensibility, cost/performance, adaptability and reliability. EPOS is composed of computing modules, input/output modules, and shared memory modules which are connected by multiple independent common buses. Modules and system buses can be added or deleted freely to provide a high degree of extensibility. The computing module is using a 7000-gate LSI computing element PULCE and provides extensive support for user and dynamic microprogramming. The input/output modules and the computing modules are connected equally to the system buses, and the same addressing mechanism is applied to them.
Reduction of memory interference in multiprocessor systems
Authors: Cornelis H. Hoogendoorn
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

This paper reports results of a study to determine and compare the effectiveness of various techniques aimed at reducing memory interference in multiprocessor multi memory systems. A simulation model of a multiprocessor, driven by address traces, is used for evaluation purposes. Two approaches to interference reduction are considered, being the reduction of overlapping memory requirements through various memory allocation methods, and the use of local memory to reduce the request rate to shared memory. Both private and cache memory are considered for this purpose.
Case study of a user-oriented conferencing system (abstract only)
Authors: Karl L. Zinn
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

This session described how CONFER, a computer-based conferencing system at the University of Michigan, was developed with participation of users, and what impact the system has on communities of users. At this conference it may be especially interesting to discuss various ways in which help provided to new users has evolved. Some extrapolations may be made for other than electronic communication aids: orientation and training, on-line reference information, on-line consultation, etc.
Synthetically generated performance test loads for operating systems
Authors: B. W. Kernighan, P. A. Hamilton
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

This paper describes the design of and experience with an automated benchmark-generation facility for system testing and performance evaluation. The basic approach involves two components. The first is a simple, highly parameterized &ldquo;synthetic job&rdquo;, that is, a program which uses precisely specified amounts of computing resources, but which does no &ldquo;useful&rdquo; work. Any particular set of resource utilization parameters for the synthetic job specifies an executable program of known characteristics, which can be used to model the behavior of some real or idealized program. The second component is a generator program, which converts a specification of a job stream into a complete, ready-to-run set of synthetic jobs, which are then used to exercise the system.