ppxscal/embedding_network huggingface dataset:
Schedule&mdash;constrained job scheduling in a multiprogrammed computer system
Authors: Thomas Murray Cook
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The schedule-constrained job scheduling problem is defined as the problem of deciding what jobs should co-exist in the memory of a multiprogrammed computer to insure satisfactory schedule performance and adequate resource utilization. At the present time, the job scheduling function in many multiprogrammed computer systems is being accomplished in a suboptimal manner. In computer installations that must pay strict attention to schedule performance, the scheduling module of the operating system, because it does not consider schedule constraints, cannot be allowed to schedule jobs as they beome available for processing. Instead, human judgment must override the operating system by deciding which jobs should be input to the computer. To solve the schedule-constrained job scheduling problem, the author has developed and tested seven scheduling algorithms using a digital simulation model.
Optimal loop topologies for distributed systems
Authors: C. S. Raghavendra, M. Gerla
Venue: Proceedings of the seventh symposium on Data communications (1981)

Double loop network architectures offer higher performance and reliability than single loop networks. In this paper, a double loop network which is optimal among all double loops is described. This network topology consists of a loop in the forward direction connecting all the neighboring nodes, and a backward loop connecting nodes that are separated by a distance @@@@@@@@N@@@@, where N is the number of nodes in the network. We show that this network is optimal in terms of hop distance between nodes, delay, throughput, and terminal reliability. The paper includes derivation of closed form expressions for the maximum and average hop distance between nodes, number of distinct routes between two farthest nodes, and throughput. The effect of node and link failures on network performance is also considered.
Namespaces semipermeable membranes for APL applications
Authors: Ronald C. Murray
Venue: ACM SIGAPL APL Quote Quad (1981)

Namespaces are proposed as an extension to APL which can provide for large APL applications the same sort of structure and communications control provided in living structures by semipermeable membranes. Living systems are partitioned by a variety of semipermeable membranes. Those membranes provide protection and isolation for subenvironments of the entity. They also control the flow of information and material between the subenvironments. Large applications designed for maintainability and extensibility are similar to living systems. They are hierarchically subdivided into simple subunits which are defined in terms of other subunits and which communicate with them in controlled ways. APL and most other programming environments do not provide suitable means to enforce the isolation and communication control conventions that are appropriate for large applications. Instead isolation depends on the good intentions and discipline of the implementers and the maintenance programmers.
Average case selection
Authors: Walter Cunto, J. Ian Munro
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We consider problems such as selecting the k-th smallest of n numbers in as few comparisons as possible on average. n + k - 0(1) comparisons are proved to be necessary for this particular problem when k &le; n/2. This shows a technique of Floyd and Rivest is essentially optimal. 7n/4 &equil; o(n) comparisons, on average, are shown to be necessary and sufficient to find the maximum and median of a set. An upper bound of 9n/4 + o(n) and a lower bound of 2n &minus; o(n) are shown for the max-min-median problem.
Measures, models and measurements for time-shared computer utilities
Authors: G. Estrin, L. Kleinrock
Venue: Proceedings of the 1967 22nd national conference (1967)

Recent literature1-6has summarized many of the characteristics of time-shared systems which have been or are being built for experimental or commercial application. Fortunately system designers are not waiting for a formal theory before experimenting. Unfortunately some of the results are so diverse in effectiveness that greater emphasis on analysis must be achieved. If predictability cannot lower the risks associated with the tremendous investments required to implement information processing utilities, progress in this field may be markedly decreased. The present paper presents a characterization of the time-sharing system environment, a set of measures associated with the system, an integrated summary of models and a discussion of measurements. In the final section new proposals for systems, measures, models and measurements are considered.
Resource simulator for an F-4E air force training squadron
Authors: A. J. Parker, Timothy I. Chen, John Duncan
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Within the United States Air Force exist various Tactical Fighter Wings. The mission of the Wing simulated in the model is twofold: (1) Training of airmen for combat and (2) Maintaining a combat ready status. In the model the Wing consists of three squadrons, with a total of fiftysix F-4E fighter aircraft. Two of the squadrons are used for fighter training and the third is on combat ready status.
Design considerations of a proposed local area computer network emphasizing the needs of the health sciences
Authors: Michael W. Diffley
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

A small computer network has been implemented at the Divisions of Health Computer Sciences (HCS) at the University of Minnesota. Experience with this network has led to plans for extending it to serve a variety of health care related functions in the Minneapolis-St. Paul metropolitan area. Design considerations of the proposed network and examples of its use in the health sciences are presented.
Evaluation methods in SARA&mdash;the graph model simulator
Authors: Rami R. Razouk, Mary Vernon, Gerald Estrin
Venue: ACM SIGSIM Simulation Digest (1979)

The supported methodology evolving in the SARA (System ARchitects' Apprentice) system creates a design frame-work on which increasingly powerful analytical tools are to be grafted. Control flow analyses and program verification tools have shown promise. However, in the realm of the complex systems which interest us there is a great deal of research and development to be done before we can count on the use of such powerful tools. We must always be prepared to resort to experiments for evaluation of proposed designs. This paper describes a fundamental SARA tool, the graph model simulator. During top-down refinement of a design, the simulator is used to test consistency between the levels of abstraction. During composition, known building blocks are linked together and the composite graph model is tested relative to the lowest top-down model. Design of test environments is integrated with the multilevel design process. The SARA methodology is exemplified through design of a higher level building block to do a simple FFT.
A Two-Step Algorithm and its Parallelization for the Generation of Minimum Containing Rectangles for Document Image Segmentation
Authors: Shamik Sural, P. K. Das
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In document processing, segmentation is done to uniquely identify each foreground connected region of an image by specifying its minimum containing rectangle (MCR). MCR is the rectangle with minimum dimensions that completely encloses a geometric pattern. In this paper, we present a two-step MCR detection algorithm and its parallelization method. The first step determines the boundary of each connected component in a document image. This reduces resource requirements and speeds up the subsequent rectangle detection step.The rectangle detection step determines MCRs of the connected components from the detected boundaries. A comparison is made between a single-step and the two-step approaches of MCR detection. Both the boundary detection and the rectangle detection steps are parallelized and implemented on transputers to reduce the total processing time.
Binarization of Document Images Using Hadamard Multiresolution Analysis
Authors: Fu Chang, Kung-Hao Liang, Tzu-Ming Tan, Wen-Liang Hwang
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this article, we propose a new method that combines the use of a global threshold and a window-based scheme for computing local thresholds. The latter scheme compares the contrast of gray values within a neighborhood whose size varies with the scale of the objects being examined. To compute the scale quantity, a new wavelet model entitled Hadamard multiresolution analysis is also proposed. When the window-based scheme is applied to the areas where global threshold is likely to fail, we obtain uniformly better binary results than using a global threshold only. Significant improvements to OCR performance can also be achieved by our binary results.
Image segmentation by reaction-diffusion bubbles
Authors: H. Tek, B. B. Kimia
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Figure-ground segmentation is a fundamental problem in computer vision. The main difficulty is the integration of low-level, pixel-based local image features to obtain global object-based descriptions. Active contours in the form of snakes, balloons, and level-set modeling techniques have been proposed that satisfactorily address this question for certain applications. However, these methods require manual initialization, do not always perform well near sharp protrusions or indentations, or often cross gaps. We propose an approach inspired by these methods and a shock-based representation of shape in terms of parts, protrusions, and bends. Since initially it is not clear where the objects or their parts are, parts are hypothesized in the form of fourth order shocks randomly initialized in homogeneous areas of images. These shocks then form evolving contours, or bubbles, which grow, shrink, merge, split and disappear to capture the objects in the image. In the homogeneous areas of the image bubbles deform by a reaction-diffusion process. In the inhomogeneous areas, indicated by differential properties computed from low-level processes such as edge-detection, texture, optical-flow and stereo, etc., bubbles do not deform. As such, the randomly initialized bubbles integrate low-level information and, in the process, segment the figures from the ground.
Analysis of bottling and storage operations at Brown Forman Distillers Corporation
Authors: S. M. Alexander, G. R. Weckman
Venue: Proceedings of the 12th conference on Winter simulation (1980)

This paper describes a simulation model developed for the analysis of the bottling and storage operations and facilities of the Brown-Forman Distillers Corporation in Louisville, Kentucky. The paper evolved from a continuing study of the bottling and storage operations at the Brown Forman bottling facility, which began in the Fall of 1978.
Completeness classes in algebra
Authors: L. G. Valiant
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

In the theory of recursive functions and computational complexity it has been demonstrated repeatedly that the natural problems tend to cluster together in &ldquo;completeness classes&rdquo;. These are families of problems that (A) are computationally interreducible and (B) are the hardest members of some computationally defined class. The aim of this paper is to demonstrate that for both algebraic and combinatorial problems this phenomenon exists in a form that is purely algebraic in both of the respects (A) and (B). Such computational consequences as NP-completeness are particular manifestations of something more fundamental. The core of the paper is self-contained, consisting as it does essentially of the two notions of &ldquo;p-definability&rdquo; and the five algebraic relations that are proved as theorems. In the remainder our aim is to elucidate the computational consequences of these basic results. Hence in the auxiliary propositions and discussion for convenience we do assume familiarity with algebraic and Boolean complexity theory.
Automating the software design process by means of software design and documentation language
Authors: Henry Kleine
Venue: Proceedings of the 15th Design Automation Conference (1978)

The Software Design and Documentation Language (SDDL) approach to software design automation consists of (1) a design and documentation language with forms and syntax that are simple, unrestrictive, and communicative, (2) a processor which can take design specifications written in the SDDL language and produce an intelligible, informative, machine reproducible document, and (3) methodology for effective use of language and processor for top-down design development. The language and processor capabilities are described and suggestions and guidelines for using SDDL are discussed.
Further investigation into spectral analysis for confidence intervals in steady state simulations
Authors: Neil B. Marks
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

In using spectral analysis for confidence intervals in steady state simulations, the parameter 1 must be specified. This quantity determines the order of the covariances which are needed in computation of the standard error. This paper investigates the effect of 1 on the standard error using a small experiment conducted on four queueing systems.
General interest (Paper Session)
Authors: Frederick E. Petry, Alan W. Biermann, Monroe M. Newborn, Helmut Kerner, Werner Beyerle, Kathleen M. Shockley
Venue: Proceedings of the 1976 annual conference (1976)

This session contains papers appealing to diverse interests. It includes a simulator generator which models architecture, load, and operating systems in a modular fashion allowing recombination of components; and improved proof for a theorem on search algorithms which find minimal cost paths in graphs; a method of reconstruction of algorithms from memory snapshots applied to an interesting assortment of algorithms; and an improved method of generating a binary tree representation for family pedigree data for genetics research.
Iterative relaxation methods for image reconstruction
Authors: Gabor T. Herman, Arnold Lent, Peter H. Lutz
Venue: Proceedings of the 1975 annual conference (1975)

The problem of recovering an image (a function of two variables) from experimentally available integrals of its grayness over thin strips is of great importance in a large number of scientific areas. An important version of the problem in medicine is that of obtaining the exact density distribution within the human body from X-ray projections. One approach that has been taken to solve this problem consists of translating the available information into a system of linear inequalities. The size and the sparsity of the resulting system of inequalities (typically, 25,000 inequalities with less than 1% of the coefficients nonzero) makes methods using successive relaxations computationally attractive. A variety of such methods have been proposed with differing relaxation parameters.
Comments on advantages of the relational view
Authors: D. Tsichritzis
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational (1975)

I will be drawing a lot of my material from the application programming paper by Chris Date and Ted Codd. It's an excellent paper and I suggest you read it. The major focus of my talk and most of the arguments I'll be presenting have to do with a certain divergence that I see at least between what all the other people in program methodology are trying to do and what the DBTG proposal represents. On one hand, those having anything to do with program methodology are trying to define very concise, high level constructs and discipline programming by cutting down freedom and richness in the programming language. On the other hand, we have the opposite point of view in some of the constructs that we can see in the DBTG proposals. Let us look first at the classic example of a data base concerning suppliers S, parts P, and shipments SP. In the network approach you have two set types, the S-SP and P-SP, in addition to the three record types. In the S-SP set every supplier is an owner and then you have SP member records. Similarly, in the P-SP set occurrence, every part is an owner and the member records are of type SP.
Using microcomputers as satellites in a time-sharing environment
Authors: Lynn Arthur Steen, J. Arthur Seebach
Venue: Proceedings of the ACM '82 conference (1982)

So it goes, these days, in colleges across the land. The comments about 8's and 89's are from Ph.D. mathematicians, not discussing number theory, but debating microcomputers. (The fellow in the back obviously had not kept up with the newest new math.) Even the ivory tower mathematicians are being drawn into the microcomputer revolution. Until a few years ago, mathematics and science at St. Olaf College, as at most colleges, used a central time-sharing minicomputer for all instructional needs. The twin Dartmouth inventions of BASIC and time-sharing seemed ideal tools for computing in an undergraduate environment.
The Euclid Language: a progress report
Authors: Richard C. Holt, David B. Wortman, James R. Cordy, David R. Crowe
Venue: Proceedings of the 1978 annual conference (1978)

Euclid is a programming language for writing verifiable system programs. A compiler for Euclid is being implemented by the authors. Since its definition [1], the language has evolved largely in response to problems discovered in the course of implementation. This paper gives a summary of language changes, the status of the implementation and some observations about use of Euclid as a practical programming language.
Simulation model to evaluate operational system performance and repair shop workloads at a navy field site
Authors: James T. Newell
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

This paper presents the background and procedures leading to development of a simulation model to analyze the impact of certain decision variables on operational system performance and workloads at the repair facility of a typical Navy field site. The research examined the impact of maintenance concepts, as implemented by changes in the decision variables associated with the potential application of Automatic Test Equipment. The initial effort consisted of data collection and field site surveys which culminated in defining a work flow model illustrating typical repair facility operations. The work flow model was translated into a computer simulation model. The baseline model contained all the values for failure rates, delay times, and probability decision parameters derived from the available field data. The simulation model was then exercised and the output data recorded for comparison with historical data to validate the model and provide a baseline for comparison as the decision parameters were varied. Of those variables exercised it appears that the Built-in-Test (BIT), or Self-test capability, is one of the more important design considerations in the original operating systems. The programming language used for the simulation model is entitled FLOW SIMULATOR, a UNIVAC version of GPSS.
Aesthetics and programming
Authors: Peter Molzberger
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

The paper at hand is based on interviews with a total of eight so-called "superprogrammers", software people, who show exceptional performance quantitatively as well as qualitatively. It becomes apparent that these people do not experience programming as a purely rational activity, but that for them it possesses strong intuitive components. Programs are visualized wholistically as three-dimensional structures. In this, aesthetics plays a special part: the structure must please optically, be elegant&mdash;then it is functionally acceptable. Logical mistakes manifest themselves as interfering with this aesthetics. The author suggests that in the area of software as well there is something like the absolute beautiful: perfect solutions with a maximum of transparence beyond all rivaling design parameters. He has a feeling that the faculties described in this paper are widespread and may open up a totally new dimension in programming.
Experiences in self-selection of disadvantaged people into a computer operator training program
Authors: Jean P. Gilbert, David B. Mayer
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

This paper describes the experiences of both the authors and the special group of disadvantaged people who entered a computer operator training course in New York City in the fall of 1968. The course was sponsored by a group of computer professionals on a volunteer basis, from various institutions and companies, in collaboration with local community groups. The project attempted a unique approach to selection of potential candidates as students: it allowed them to pass through a structured entrance experience during or after which they made their own decision to select themselves in or select themselves out of the next phase, namely, training. No selection tests were used or given. This resulted in a group of students who had a higher level of interest in computer operating entry level jobs, with a consequently higher level of motivation. It thus allowed men of the most minimal level of comprehension capabilities, ninth grade approximately, to enter into a presumably complex occupational training course and complete it effectively. That they then went forth and actually obtained jobs in their new vocation, despite their educational deficiencies, rounded out our project's experience. Details of the structured experience are given, as well as a description of the group, the training course and the role of counselors in remediation and in the decision-making processes, along with statistical results.
Interpreter/compiler integration in ECL
Authors: Glenn H. Holloway
Venue: Proceedings of the international symposium on Extensible languages (1971)

As mentioned in [1], a primary design objective of the ECL programming system [2, 3] has been to maximize the flexibility afforded its user, particularly during the design and debugging of his programs, without sacrificing the efficiency of his final product. The programmer is given the facility first to tailor the system to his needs, then to shed unneeded variability in exchange for increased efficiency. To this end, ECL includes both an interpreter and a compiler for the language EL1. The integration of two compatible language processors in a single system is achieved with a minimum of duplicate syntactic or semantic analysis.
Automating software design
Authors: Peter Freeman
Venue: Proceedings of the 10th Design Automation Workshop (1973)

To anyone that has had the slightest connection with the design and construction of large programs for digital computers, it is obvious that it is not a trivial task. What may not be so obvious is the almost complete lack of automation that has been applied to the task of software design. While computer scientists and technologists have been busy helping to apply computers to many other complex tasks, they have been notably tardy in applying the symbol-manipulating and decision-making power of the computer to the creation of software. While this has been the case in the past, there has recently been an upswing in activity aimed at automating software design. The purpose of this short paper is to provide some context, background, and initial roadmaps to people working in other areas of design automation who may wish to help us with the task of automating software design.