ppxscal/embedding_network huggingface dataset:
Performance models of token ring local area networks
Authors: Robert Berry, K. Mani Chandy
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

This paper presents a simple heuristic analytic algorithm for predicting the &ldquo;response times&rdquo; of messages in asymmetric token ring local area networks. A description of the token ring and the model is presented in section 2 the algorithm is described in section 3 and the empirical results in section 4. The analytic results were compared against a detailed simulation model and the results are extremely close over a wide range of models. Local area networks (or LANS) offer a very attractive solution to the problem of connecting a large number of devices distributed over a small geographic area. They are an inexpensive readily expandable and highly flexible communications media. They are the backbone of the automated office - a significant component of the office of the future. This importance of LANS in the future of applied computer science has resulted in a tremendous burst of interest in the study of their behaviour. There are already many different LAN architectures proposed and studied in the literature [Tropper 81] [Tannenbaum 81] [Babic 78] [Metcalfe 76] [Clark 78] One LAN architecture is significant for several reasons. This architecture is the token ring [Carsten 77]. It has attracted interest because of its simplicity fairness and efficiency. The interest it has generated has resulted in the proposal of several different versions. This paper concentrates on one of these versions - the single token token ring protocol as described in [Bux 81]. This particular version is attractive because of its overall simplicity and reliability. This paper presents an algorithm for predicting response times in a token ring with the single token protocol.
An interactive graphics editor for document preparation
Authors: V. Joloboff
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

This paper describes an interactive graphics editor for designing illustrations to be inserted in documents (diagrams, flow-charts, functional schemas, ...). The main feature of this editor is the possibility to establish relationships between graphics objects at creation time. Those relationships are retained for further use in editing operations. The editor has been implemented on a PERQ machine running the Perq Operating System.
Some structural properties of polynomial reducibilities and sets in NP
Authors: Paul Young
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

In this abstract and discussion of forthcoming papers, we will be concerned with variations on a common theme: without assuming a solution to P vs NP, what can one say of a general nature that relates structural properties of general classes of sets in NP to reducibilities among these sets? By &ldquo;structural&rdquo; we mean, in ways that will become clearer as we proceed, properties which arise from general definitions rather than properties which may arise from a perhaps more &ldquo;natural&rdquo; computational point of view. Although quite a bit is known about such questions relative to oracles or relative to the assumption that P @@@@ NP, in so far as possible we wish to obtain absolute results; that is results which are about sets in NP (not relativized) and which can be obtained without assuming a solution to P vs NP. In a final section summarizing our results we will make some general comments about the historical antecedents and possible future significance of this approach.
A user looks at da&mdash;yesterday, today, tomorrow
Authors: A. E. Fitch
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

While much has been written about the technical detail of Design Automation, little has written about how a amp-ldquo;user&rdquo; views DA. This paper will not address the technical details of Design Automation, nor will it consider the entire range of DA facilities and users in existence today. Instead, the paper will contrast a specific user's needs to the facilities available to that user yesterday and today. This contrast will follow a general definition of the term DA, and a detailed description of the various tasks confronting the particular user. For the purpose of this paper, the user's job is to develop a computing system.
Design and specification of the minimal subset of an operating system family (Abstract only)
Authors: D. L. Parnas, G. Handzel, H. Würges
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The authors are engaged in a project to produce a precise description of a design for a family of operating systems. The design decisions are being expressed by means of formal module specifications. In an attempt to write a concise specification of one of the most critical modules, a &ldquo;virtual memory mechanism&rdquo;, some previously discussed specification techniques proved to be inadequate. The specification was much too large. Through a series of improvements in both the design and the specification techniques we have achieved a much more compact description. This paper begins with the motivation for the design, explains the problems discovered in earlier approaches, and describes the improvements that were made. Finally, the design and its specification are explained. Another version of this paper has been submitted to the Eurocomp held in London, Sept. 14-16
The file descriptor: Use of a descriptive tool to retrieve general queries to files
Authors: Adolfo Guzmán
Venue: Proceedings of the 3rd annual international conference on Systems documentation (1984)

The file descriptor is a data structure that describes or documents the characteristics (position type, initial value, etc.) of the information within a file. Each file containing information possesses a unique file descriptor. The file descriptors for a collection of related files are stored together in a file named DESCRIPTORS. This paper explains the use of the file descriptor for: answering general queries to a file- &ldquo;retrieve all records satisfying predicate P&rdquo; This is embodied in a tool called the consultator. a general tool for data input - the capturer - wich allows inputting appropriate data for any file. a tool for report production - the report printer - which allows design of arbitrary output reports. a specification for transformations from several input files into one or more output files - the file transformer - and its corresponding tool (program to interpret such notation). The above tools allow for input, consultation or retrieval, transformations (&ldquo;computation&rdquo; or &ldquo;processing&rdquo; of data into results) among files, and report generation, all of these without writing programs in high level languages (Pascal, Cobol,...). Instead, we use a simpler description of (a) the screen to be presented for inputting data; (b) the query or predicate; (c) the transformation; (d) the report. The description used in (a) through (d) can be considered as a concise language for specifying data-manipulation (v. gr, administrative or managerial) tasks. If the tools prove to be useful, one can expect considerable savings in the time and effort spent in specifying and programming such data-manipulation tasks. The system in being implemented in Pascal for an IBM-PC network.
Is software development manageable?
Authors: J. T. Sullivan, Claus H. Correll, Louis Pouzin, Gaetano Lanzarone, I. R. Elliott, Jacques Duby
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Does the adherence to software engineering concepts allow effective management in planning, organizing, staffing, monitoring, and controlling the development of quality software with-in time and resources budgets? Our panel of experts will provide realistic analysis of current management problems with software development and proven successful approaches and techniques for solving these problems in the production and subsequent maintenance of software. Issues to be discussed include: Inadequate planning for changes and management of change control Overcoming continuous project redefinition of goals, schedules and responsibilities Progress measurement of actual technical accomplishments Improving communications between users, analysts, designers, and programmers Validity of software development estimating techniques in planning Programmer productivity improvement utilizing structured design and programming techniques Top down implementation Configuration management
Scribe: How to use it for document production
Authors: Brian Reid
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Scribe is a document production system that makes it easier to produce and maintain large complex technical documentation. Although its primary purpose is high-quality text formatting, Scribe also performs cross-reference tabulations, indexing, automatic generation of text such as tables of contents, figure integration. Many text formatting programs exist, and many can do some or all of what Scribe can do. But Scribe has proven through the years to be much easier to learn and use than most other systems, and documents produced in Scribe have proven to be much easier to edit and maintain than documents produced other ways.
Input process models
Authors: P. A. Jacobs, P. A. W. Lewis, E. McKenzie
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

Time series models for positive-valued and discrete-valued input processes are discussed, with the emphasis on the simulation problems which arise in generating time series from these models.
Simulation of advanced manufacturing systems
Authors: Bayard E. Wynne, George K. Hutchinson
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

Flexible manufacturing systems (FMSes) use a variety of direct numerical control machines embedded within unique material handling systems. An FMS is a hybrid between fixed production and job shop facilities. Possible order-of-magnitude decreases are foreseen in unit manufacturing costs through the use of an FMS. The input-output conversion process of an FMS is so complex that evaluation is most readily accomplished by simulation within experimental designs. A Simscript model is in use to: determine FMS physical configuration; create decision rule sets for online computer controls; and reduce the management uncertainty in considering investment in FMS installations.
A New Approach for Fast Line Detection Based on Combinatorial Optimization
Authors: M. Mattavelli, V. Noel, E. Amaldi
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper we present a new algorithm for detecting lines in digital images. The algorithm is based on a general combinatorial optimization approach for estimating piecewise linear models that we introduced in [1]. A linear system is constructed with the coordinates of all contour points in the image as coefficients and the line parameters as unknowns.The resulting linear system is then partitioned into a close-to-minimum number of consistent subsystems using a greedy strategy based on a thermal variant of the perceptron algorithm. While the partition into consistent subsystems yields the classification of the corresponding image points into a close-to-minimum number of lines, the solution of each subsystem provides the parameters of those lines.An extensive comparison with the standard Hough Transform and the Randomized Hough Transform shows the considerable advantages of our combinatorial optimization approach in terms of memory requirements, time complexity, robustness with respect to noise, and quality of the solution regardless of the parameter settings.
A simulation model of a University Health Service Outpatient Clinic
Authors: Robert Baron, Edward J. Rising
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper focuses on the development of a simulation model of a University Health Service Outpatient Clinic the implementation of which has resulted in significant improvements to system performance. The details of these improvements are published elsewhere; they amouted to savings in excess of fifty thousand dollars the first year the model was used, improved physician morale, and acceptance on the part of the Health Service staff of the simulation model as a tool for decision-making. The Health Service provides complete outpatient medical care and limited inpatient care for about 19,000 people. The resulting outpatient load of over 400 persons a day requires the services of 12 full-time physicians. The simulation model for which appointment and walk-in patients are generated separately, was developed over a two-year period and takes the general form of a multiple stage, parallel queueing system with a variable number of servers. Validation problems are discussed, and data is presented.
Design automation effects on the organization
Authors: F. G. Paul
Venue: Proceedings of the SHARE design automation workshop (1964)

As the manager of a manufacturing facility, my perspective and evaluation of Design Automation is naturally oriented toward the impact it has had on manufacturing, on its people, and its ability to accomplish in terms of product manufacture what appeared impossible a few years ago. In the mid 1950's we in the Endicott Plant were faced with the challenge of converting a high volume electro mechanical manufacturing facility almost overnight into a high volume electronic manufacturing facility. To add to the problem the product we intended to manufacture, namely the computer, was a highly complex electronic assembly which, while packaged within certain standards, had many variations and extremely critical quality control specifications. The answer to the manufacturing problem, being able to produce in great volume the highly complex portions of the computer, lay obviously in the application of automation to the manufacturing process. ~Te had a dilemma, however, and this was the great number of variations of the product which made the conventional automated manufacturing line impractical because of the high number and cost of setups.
A comparison of the use of links and secondary indices in a relational data base system
Authors: Michael Stonebraker
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The possibility of supporting relational data sublanguages on top of a data base system with an underlying network data structure has been widely suggested. In this paper we present a formal model of a mix of interactions in one non procedural relational language. Under a collection of assumptions concerning the data base and the performance criteria, we compare the following performance oriented data structures: (1) secondary indices (2) a network structure similar to a pointer array implementation of DBTG sets (3) structures 1) and 2) together It is shown that option 2) is never preferred to both @@@@ and 3) over the range of model parameters, Hence, the sole use of sets or &ldquo;links&rdquo; as a performance oriented access path is questionable.
An introductory computer science course for all majors
Authors: Norman E. Gibbs
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

The purpose of this paper is to relate experience we have had with our first course in computer science at the College of William and Mary. Like many other universities, we have had to deal with increased student demand from outside departments, differing levels of student mathematical maturity and problem solving skills, a variety of student goals, and a state legislature which will not allow the university to expand its faculty.
On the topological aspects of the circuit layout problem
Authors: W. M. vanCleemput
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper investigates the topological and geometrical characteristics of the circuit layout problem. A topological layout procedure is presented. This procedure can be especially useful for integrated circuit layout.
Fault tolerance of a class of connecting networks
Authors: John P. Shen, John P. Hayes
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

Several proposals have been made for using a class of connecting networks called &bgr;-networks in multicomputer systems, such as systems containing large numbers of microprocessors. A &bgr;-network is a network of 2 &times; 2 crossbar switches called &bgr;-elements. This paper presents an analysis of the fault tolerance of &bgr;-networks intended for multicomputer applications. A fault model is used which allows &bgr;-elements to be stuck in either of their two normal states. A new connectivity property called dynamic full access (DFA) is introduced which serves as the criterion for fault tolerance. A &bgr;-network is said to have the DFA property if each of its inputs can be connected to any of its outputs in a finite number of passes through the network. A fault is called critical if it destroys the DFA property. Two graph-theoretical characterizations of the critical faults of a &bgr;-network are presented. It is shown that there is a one-to-one correspondence between minimal critical faults and the cutsets of the circuit adjacency graphs derived from the &bgr;-network. It is further shown that a fault is critical if and only if it is incompatible with all Eulerian circuits associated with the &bgr;-network. Some applications of the theory are discussed.
Foundations for an information technology
Authors: Tuncer I. Ören
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

An information technology to manage complex problems would benefit from a synergy of simulation, software engineering, artificial intelligence, and general system theories. A perception of the needs, the importance of problematique (i.e., systems of ill-structured, ill-defined, or ill-delimited problems), different approaches to problems, and the uprise of systemic thinking are outlined. Model-based activities are defined to encompass simulation. Possibilities for synergies of simulation, software engineering, artificial intelligence, and general system theories are explored.
Special forms in Lisp
Authors: Kent M. Pitman
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

Special forms are those expressions in the Lisp language which do not follow normal rules for evaluation. Some such forms are necessary as primitives of the language, while others may be desirable in order to improve readability, control the evaluation environment, implement abstraction and modularity, affect the flow of control, allow extended scoping mechanisms, define functions which accept a variable number of arguments, or achieve greater efficiency. There exist several long-standing mechanisms for specifying the definition of special forms: FEXPR's, NLAMBDA's and MACRO's. In this paper, the motivations for using special forms are discussed, followed by a summary of the advantages and disadvantages of employing MACRO's, FEXPR's, and NLAMBDA's as tools for their implementation. It is asserted that MACRO's offer an adequate mechanism for specifying special form definitions and that FEXPR's do not. Evidence is given which supports the author's contention that FEXPR's interfere with the correct operation of code-analyzing programs such as the compiler. Finally, it is suggested that, in the design of future Lisp dialects, serious consideration be given to the proposition that FEXPR's should be omitted from the language altogether.
Permutation representations and the subgroup lattice
Authors: John D. Dixon
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

There is a close correspondence between the set of subgroups of a finite group G and the set of inequivalent transitive permutation representations of G. For many purposes the latter is as useful as the former and more easily calculated. The present paper describes a program which computes a complete set of transitive permutation representations of G (specified by their values on a fixed set of generators of G) whenever a single faithful permutation representation of G is supplied.
On the equivalence of schemes
Authors: Stephen J. Garland, David C. Luckham
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

One objective of the study of schemes for computation is that of finding general methods for checking or verifying a given program against its specifications. If one views the program and its specification as presenting two supposedly equivalent schemes for a computation, then the objective reduces to one of finding general methods for determining whether, in fact, the two schemes are equivalent. Unfortunately, for many classes of schemes which are sufficiently powerful, this &ldquo;equivalence problem&rdquo; is not decidable, i.e. there are no general methods capable of determining, in all cases, whether two schemes in the class are equivalent. In this report we investigate the question of which classes of schemes have decidable equivalence problems, or, in otherwords the question of for which classes of schemes there exist general methods capable of determining equivalence.
A generalized multi-stage cost minimization model in APL
Authors: Harley M. Courtney
Venue: Proceedings of the sixth international conference on APL (1974)

Job shops manufacture to specification so that excess production has little value, and when spoilage occurs in production additional setup costs must be incurred to complete an order. A generalized APL model was constructed which can be used in a variety of situations and which will indicate a cost-minimizing production order size. The model was found to have a variety of applications in addition to production scheduling. The structure of APL permitted are relatively easy construction of the model.
The simulation of hospital patient treatment systems
Authors: Henry R. Grooms, Tung Au
Venue: Proceedings of the third conference on Applications of simulation (1969)

A simulation model of function-oriented patient treatment systems in general hospitals is proposed for studying the effectiveness of scheduling diagnostic and clinical treatments for patients. The effectiveness of a system can be measured by a number of criteria. The simulation model is characterized by a computerized procedure for generating a tentative feasible schedule and for improving the schedule according to certain heuristics. Possible applications of the simulated model are briefly discussed.
Economical typesetting from small computer text files
Authors: Jonathan Sachs
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

Many individuals and small organizations face the problem of how to publish good looking documents at an affordable price. Today's technology offers a number of affordable tools that can help them: offset lithography, film ribbon type-writers, and now small computers with word processing software. But for many people, typeset quality is still out of reach. Typesetting remains a labor intensive service requiring expensive hardware and special skills. We will look at a new option for those who want high quality at low cost: a typesetting service that works from text files prepared on word processing computers. By allowing the user to do his own keyboarding, such a service eliminates the labor-intensive (and expensive) part of the process. We will discuss the advantages and disadvantages of computer typesetting&mdash;economic and otherwise&mdash;and some of the aesthetic problems it presents.