ppxscal/embedding_network huggingface dataset:
Disposable and endurant programming
Authors: Philip Levy
Venue: ACM SIGCSE Bulletin (1980)

Several characteristics of &ldquo;good&rdquo; programs relate to extension of their lifetime. Categories of such features are documentation, structure (modules, procedures, abstractions), and language features that increase checkable redundancy in a program. These features have nonzero and, perhaps, unjustified cost if the program is disposed of. Programs that are developed primarily for the &ldquo;answer&rdquo; and then discarded are termed &ldquo;disposable&rdquo;. The educational ramifications of disposable programs are significant. Programs produced by students in programming courses are by nature disposable; they are disposed of at the end of the term. This conflicts with the emphasis by many instructors and textbooks on endurance, the converse of disposablility. A danger of disposable programs is their retention. Another danger is the failure to consider the endurance required during the production of that program. There is a domain of problems that can be solved economically by disposable programs. This domain is discussed and some heuristics are presented for determining whether a problem is in it.
Cyberail simulation
Authors: Philip G. Drew, Stephen Swerling, Arthur D. Little Allen B. Fonda
Venue: Proceedings of the second conference on Applications of simulations (1968)

Castle Automated Systems manufacturers Cyberail, an automated system for transporting materials within hospitals&mdash;meals, linen, trash, mail, paperwork, drugs, and so forth. Although early models of the system are in use in hospitals in Europe, and Cyberail is planned for installation in a number of new hospitals in the U.S., there is as yet no operating experience with the new system. Early in engineering development, Castle recognized that it would be quite possible to design a system, all of whose components worked satisfactorily, but which would be considered unsatisfactory by users if they found excessive delays due to poor layout or lack of equipment. Designing a suitable configuration of tracks, switches, stations, and parking for a particular hospital was a problem which rapidly outran one's ability to analyze mentally. Therefore Castle retained Arthur D. Little, Inc., which was doing a major portion of the engineering design, to construct a simulation of the system. The intent was to have a computer model on which proposed configurations of equipment could be subjected to the anticipated pattern of demands in a particular hospital. In this way Castle could be assured that its proposed layouts would not produce excessive delays due to bottlenecks or shortages and yet would be no more elaborate and expensive than necessary.
Brazil's pioneer undergraduate program in information systems
Authors: Maria Lúcia Blanck Lisbôa
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

In the early 70's, the number of computers installed in Brazil was growing at a rate of 30% per year, which was higher than in European countries, the U. S. and Japan, placing Brazil among the eight top world users of computers.1 By that time, only few Brazilian Universities were offering courses in data processing. The lack of a formal education structure resulted in data processing positions being mainly filled with people trained by manufacturers. The high demand for data processing professionals, mainly in the top levels of the career, became one of the Brazilian government's concerns. Since Brazil is a developing nation, resources had to be efficiently used and foreign reserves could not be spent on equipments which were not used to their full potential. Therefore, highly qualified professional were needed. In view of these facts, the Federal Government decided to support and encourage the creation of professional data processing programs, mainly at the Universities. The role of the University in education is extremely important, since it makes possible to improve the qualification of the labor power and also to improve the education professionals themselves. In 1973 and 1974, with the support of the Federal Government, about 15 programs for graduation of technicians in systems programming, analysis and design have been created. Those programs, with the duration of two years, were intended to be a short term solution, providing a highly qualified labor force. Besides the programs created directly by the Government, several courses have been implemented at Universities that assumed the task of preparing qualified data processing man power, accomplishing their social role. With this purpose, the Pontifical Catholic University of Rio Grande do Sul, in 1974, implemented an undergraduate' program in Information Systems Analysis. The pioneering aspect rises from the area involved, that of Information Systems.
Generating multivariate distributions for statistical applications
Authors: Mark E. Johnson
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Methods for generating random vectors from multi- variate distributions are required in a variety of statistical research contexts. Examples of topics include examination of the robustness of multivariate tests such as Roy's largest root test, assessment of error rates in discriminant analysis, and comparing multivariate goodness-of-fit methods. This presentation assimilates the material in a coherent framework and identifies some useful generation algorithms. The slant is admittedly to statistical applications but this does not preclude its use in other areas.
Structure of digital system description languages
Authors: Harry F. Jordan, Burton J. Smith
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

Several languages have been developed for or applied to the problem of describing digital hardware systems. This paper points out some of the problems encountered in hardware descriptions, particularly where they are distinct from concepts appearing in programming languages.
Using simulation to measure bias in principal components regression
Authors: Philip G. Enns
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

Multicollinearity is a serious problem in regression analysis. High correlation among predictor variables can lead to unstable estimates of the regression coefficients. Principal components offers one approach to reducing the sampling variance of the coefficient estimates. However, this method produces biased estimates and the bias cannot be measured without knowledge of the true coefficients. This paper uses simulation to study the degree of bias in a model employing real economic data.
Teaching basic computer organization through &ldquo;microprogramming&rdquo;
Authors: Miriam R. Tausner
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

To reinforce concepts of CPU organization students are asked to write a &ldquo;microprogrammed&rdquo; interpreter to be run on a theoretical microprogrammable computer which is simulated using an IBM 360 or 370.
Telecommunications earnings estimation model (TEEM)
Authors: Wayne H. Wagner, Lawrence T. Akutagawa, Larry J. Cuneo
Venue: Proceedings of the third conference on Applications of simulation (1969)

TEEM is a corporate simulation model developed for the Security Analysts of Wells Fargo Bank. It is a probabilistic interactive model designed to estimate an income statement and a funds flow analysis for any manufacturing or distribution firm for which history data is readily available. The primary objective is to generate more accurate, systematic, and consistent estimates for companies which are of investment interest to Trust accounts. Both the analyst and the computer contribute unique and complementary facilities to the process: the computer contributes its abilities to organize and recall data, to calculate and to structure an estimation process, while the analyst contributes his information gathering abilities and his ability to integrate into the structure of the model.
A log file design for analyzing secondary storage occupancy
Authors: H. Pat Artis
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

A description of the design and implementation of a log file for analyzing the occupancy of secondary storage on IBM computer systems is discussed. Typical applications of the data contained in the log are also discussed.
Comparison of Texture Features Based on Gabor Filters
Authors: P. Kruizinga, N. Petkov, S. E. Grigorescu
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The performance of a number of texture feature operators is evaluated. The features are all based on the local spectrum which is obtained by a bank of Gabor filters. The comparison is made using a quantitative method which is based on Fisher's criterion. It is shown that, in general, the discrimination effectiveness of the features increases with the amount of post-Gabor processing.
Information content of CPU memory referencing behavior
Authors: D. W. Hammerstrom, E. S. Davidson
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

The memory reference trace of a computation is modeled as a probabilistic process and the information content of that process is derived. Techniques are developed for analyzing the effectiveness of the addressing architecture and Memory/CPU traffic of existing machines with respect to the information theoretic bound for a given trace. Several techniques for analyzing particular aspects of addressing architecture are also developed. Possible areas of improvement for addressing architecture, compilers, and memory architecture are suggested for performance enhancement.
On determining the order of a group
Authors: John J. Cannon
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

The recent past has seen a proliferation of algorithms designed to carry out a variety of calculations with groups. Chief among these is a family of algorithms for determining the order of a group. While computing the order of a group is often of great interest in itself, the importance of many of these algorithms lies in the fact that they also &ldquo;construct&rdquo; the group in such a way that makes possible the application of powerful algorithms for computing aspects of the group's structure. In the first half of the paper I treat algorithms for groups given by concrete sets of generators. Commencing with an efficient algorithm for explicitly listing all the elements of a small group, I then describe Sims' Schreier technique for permutation groups and Butler's extension of it to matrix groups. Algorithms for working with groups given by abstract defining relations comprise the second half of the paper. A brief outline of the Todd-Coxeter algorithm and some of its applications is given. This is followed by an account of the recently developed algorithm of Macdonald and Wamsley for nilpotent groups. The paper concludes with some examples showing how certain problems may be successfully attacked using a combination of methods.
The graphic design of friendly faces for information management (abstract only)
Authors: Aaron Marcus
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)

Principles of graphic design have been utilized in redesigning the interface for Seedis, a large information management system. The structure and processes of Seedis are briefly described. The graphic design approach is explained and graphic design principles are outlined. Examples of enhanced menus, prompts, help messages and data directories are shown to indicate the nature of improvements.
A comparison connection assignment for diagnosis of multiprocessor systems
Authors: Miroslaw Malek
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

A comparison method for diagnosis of multiprocessor systems is introduced. Given a system of n units modeled by a linear graph, problems of finding the minimum number of comparison edges required for fault detection and fault location are solved by the use of a covering algorithm. The bounds for the number of comparison edges, the number of necessary comparisons and test cycles in fault detection and fault location in systems with n units are determined and an algorithm for an optimal comparison connection assignment is given. Simplicity and ease of implementation make the described method applicable for fault detection and location in multiprocessor systems.
Personal work-stations at the University of Waterloo
Authors: Sandra Ward
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

Students and faculty at the University of Waterloo are using the IBM Personal Computer as a powerful workstation to develop programs, and do their applications. The PCs are connected using two different network technologies. In one case, the PCs are connected into a micro-mainframe network called Waterloo PC Network, which allows both files and software to be located in a centralized file system accessed from any PC. Since the language and applications software is portable and runs on both the mainframe or micro the user may choose to run an application on the computer that is appropriate for the size of the job. In the other case, the PCs are connected to another PC which acts as a file and print server. In both cases, the workstations do not have any local file storage. The talk will describe the design goals for PC Networks, their design, current applications, and future plans.
UDSYS a microcode development system
Authors: Robert W. Beauchamp, Neal R. Firth
Venue: ACM SIGMICRO Newsletter (1982)

This paper describes a microcode development system called UDSYS that is currently in use at Data General Corporation across several radically different micro-architectures. The system was developed to overcome some of the deficiencies of meta-assemblers, namely, one-to-one meaning of symbols vs. action, lack of rigorous syntax verification, and lack of application specific error messages. The system is explained by way of a specific example about the sequencer portion of a hypothetical microword. Microcoding is slowly loosing its status as an artform. Many of the tools available for increasing the productivity of software engineers are now starting to become available for the generation of microcode. There is work being done on machine independent microcoding languages, microcode generators, and microcode optimizers to name but a few such tools. However, many of these tools are still in the developmental stages. At Data General, our current microcode production system took the approach of leaving the optimization in the hands of the coder, but giving him the capability of building a very friendly interface to the hardware. The system is called UDSYS and this paper presents an overview of some of its major concepts and features.
Efficient Boolean operations on IC masks
Authors: James A. Wilmore
Venue: Proceedings of the 18th Design Automation Conference (1981)

Circuit extraction and design rule checking programs make extensive use of Boolean operations which accept IC mask data as operands. A wide variety of computer algorithms have been written that implement Boolean operations on sets of geometric entities. These algorithms vary in their efficiency and can be characterized by how they represent, sort, and compare IC artwork files. A bit-map representation of IC layout data precisely localizes mask information and eliminates the need for sorting the layout data prior to or during the performance of Boolean operations. The bit patterns of the mask operands may be compared using the CPU's own Boolean operators. A compacted bit-map format that can represent IC layouts concisely, therefore, provides an excellent data base for a very efficient algorithm to perform geometric Boolean operations.
Consistency of risk attitude in the investment decision process
Authors: Moon K. Kim
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

Risky investments are analyzed through a computer simulation process or with the use of the risk-adjusted discount rate and certainty-equivalent coefficient. A constant risk-adjusted discount rate or certainty-equivalent coefficient is frequently used in the evaluation of risky projects, while a constant risk-aversion coefficient is used in the simulation approach. The question raised in this paper is that one's consistent risk attitude is properly reflected in the risk analysis. Each approach was compared to each other to see if the risk-adjusted discount rate and certainty-equivalent coefficient become constant when the risk-aversion coefficient is held constant. Namely, this paper shows that the risk-adjusted discount rate and certainty-equivalent coefficient should be different from project to project to have a consistent risk attitude. Indeed, if a constant risk-adjusted discount rate or certainty-equivalent coefficient is used, variant risk-aversion coefficients or risk attitudes would be the result.
Discrete univariate random variate generation
Authors: Voratas Kachitvichyanukul
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Most of the early research done in random variate generation is in the area of continuous distributions. Not until 1979 was research published on exact, uniformly fast discrete univariate random variate generation. Since then the state of the art of discrete univariate random variate generation has been advanced steadily, and exact, uniformly fast algorithms are now available for Poisson, binomial, hypergeometric and negative binomial distributions. This paper surveys the algorithms for these commonly used univariate discrete distributions. Timing comparisons of some of the algorithms are presented along with the references of recent papers. A copy of the visual aids is also given.
User requirements for digital design verification simulators
Authors: W. Werner, W. Minnick
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

The increased complexity of advanced, microprocessor based digital systems coupled with ever present emphasis on low system development cost and schedule, has necessitated a re-evaluation of digital Design Automation (DA) systems requirements and definition of appropriate CAD program developments to meet these needs. Requirements for the design verification portions of a DA system are presented, and the capabilities of the new AIDS DA system designed to meet these requirements are described. Examples of AIDS worst case timing analysis capabilities are presented and a problem associated with existing worst case analysis methods is identified.
Maintaining integrity in complex shape definitions
Authors: Adrian E. Baer
Venue: Proceedings of the 15th Design Automation Conference (1978)

A method is discussed for combining flexibility in defining 3-dimensional geometric shape with system maintained integrity. Such capabilities allow the user to concentrate on local considerations in modifying design databases in an interactive environment. The System discussed in this paper attempts to accommodate the mixed use of three classes of shapes occuring in design: linear, flat and solid ones.
Maximization problems on graphs with edge weights chosen from a normal distribution (Extended Abstract)
Authors: George S. Lueker
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

we consider optimization problems on complete graphs with edge weights chosen from identical but independent normal distributions. We show some very general techniques for obtaining upper and lower bounds on the asymptotic behavior of these problems. Often, but not always, these bounds are equal, enabling us to state the asymptotic behavior of the maximum. Problems in which the bounds are tight include finding the optimum traveling salesman tour, finding a minimum cost spanning tree, and finding a heaviest clique on k vertices. We then discuss some greedy heuristic algorithms for these problems.
Formal languages and power series
Authors: D. F. Stanat
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

Section 1 of this paper presents the basic mathematical definitions for our work. Section 2 defines the notion of a weighted phrase-structure grammar over either a semiring or zero monoid coefficient structure. The notion of canonical derivations (from Griffiths [1968]) and top-down derivations is defined in section 3, along with some of their basic properties. Equivalence relations over weighted phrase-structure grammars are defined in section 4 as well as power series representations of the associated languages. Section 5 shows that every weighted type 0 grammar is equivalent to a grammar in standard form. Section 6 describes the equations associated with a grammar in standard form and describes a process of iteratively obtaining approximations to the language.
An Optimal Early Stopping Uniform C onsensus Protocol in Synchronous Distributed Systems with Orderly Crash Failures
Authors: Xianbing Wang, Jiannong Cao
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Most existing consensus protocols for synchronous distributed systems are designed to tolerate crash failures of processes. It has been proved that there is non-process stopping consensus protocol for synchronous distributed systems that tolerates up to t crash failures, in which all non-faulty processes always decide by the end of round t, where t
The MIMOLA design system: Detailed description of the software system
Authors: Peter Marwedel
Venue: Proceedings of the 16th Design Automation Conference (1979)

A software system is described which aids in the design of digital processors with a top-down method. It takes the design language MIMOLA as its input. Input may be either a high level functional or a structural description of the hardware. The output is a description of the hardware on the block level. In the case of a high level functional input, the output contains a listing of the hardware which is necessary to execute the input together with utilization factors of the hardware units. The amount of creatable hardware may be limited in a declaration. If there is not enough hardware to execute the input statements in parallel, the necessary intermediate steps are inserted by the system and a corresponding functional description is presented.
A microcomputer demonstration and evaluation lab
Authors: Anthony Skrabak
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

The Ohio State University Instruction and Research Computer (IRCC) has operated a Microcomputer Demonstration and Evaluation Laboratory for several years. This panel will cover the original goals of the lab and the hardware and software that were included. It will also explain the types of demonstration and evaluation services that were provided for customers and vendors, as well as changes that have occurred and the type of services now provided. Several other academic computer centers have such facilities, differing in philosophy and operation from the IRCC Demonstration/Evaluation Lab.