ppxscal/embedding_network huggingface dataset:
An experimental approach to system tuning
Authors: Yonathan Bard
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

It is desired to find the values of certain system parameters which maximize some performance criterion. Using standard experimental design techniques, one runs an initial set of experiments which explore the system's response surface. Subsequently, the data are smoothed, and a hill climbing technique is used to locate the maximum. This technique was employed successfully to tune the parameters in an experimental version of the VM/370 scheduler.
Should everyone learn anything?: The question of computer literacy
Authors: Naomi S. Baron
Venue: ACM SIGCSE Bulletin (1984)

In developing a new area of knowledge, one of the most difficult problems is working out a framework in terms of which to define the area. The emerging subject of &ldquo;computer literacy&rdquo; is a case in point. What should colleges and universities teach about computers? And to whom? Rather than beginning with such &ldquo;computer literacy&rdquo; issues themselves, we start with the more basic question of how educators make any decisions about the appropriate content and audience of higher education. The question of teleology in higher education is examined in terms of four conceptual categories: acculturation economic considerations, social mechanisms, and mental discipline. These four categories offer one plausible framework for crafting rational procedures for deciding what to teach college students about computers.
An appreciation of computer simulation
Authors: Ram Vaswani
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Students learning computer simulation often are bewildered by the complexity of computer simulation models. To overcome this difficulty, we have used an exercise which requires modeling a simple system. The student constructs a model and performs hand simulation. Next, the student uses a program deck to perform computer simulation for the same problem. Finally, the student constructs an analytic model and compares the results of simulation runs with calculated results. Experience shows that this three-way exercise, involving hand simulation, computer simulation, and analytic model, gives the beginning student a feeling for and confidence in the validity of computer simulation.
An automatic routing system for high density multilayer printed wiring boards
Authors: Ikuo Nishioka, Takuji Kurimoto, Hisao Nishida, Seiji Yamamoto, Toru Chiba, Toshiaki Nagakawa, Takatsugu Fujioka, Masashi Uchino
Venue: Proceedings of the 17th Design Automation Conference (1980)

Recent advances in the packaging technology of microelectronics have changed the design rules for printed wiring boards (PWB's) such that the number of wiring tracks between adjacent pins of an ordinary dual in line package (DIP) is allowed to be two or more, and the number of signal layers to be laminated is often required to be four or more. When the packaging density or scale of a PWB augments to such an extent, conventional routing schemes are confronted with various difficulties. The present paper describes a new routing system which can cope with such high density PWB's, for which the maximum numbers of layers to be laminated, circuit modules to be mounted, and signal nets are admitted up to 16, 2,000 and 4,000, respectively. The system described operates on a PDP 11/34 computer coupled with a TEKTRONIX 4014 graphics terminal. A set of implementation results are also shown to reveal how much the described system contributes to the reduction of time and labor incurred in laying out multilayer PWB's of high density.
Microbe: A self commenting microassembler
Authors: Ben A. Laws,  Jr.
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

A microassembler is described that generates a symbolic commentary for each microinstruction. This approach yields many of the benefits of programming in a high level language without the high implementation cost. The commentary assists with code optimization and provides a record of the processor's operation. An outline for implementing a commentator gives a sense for its cost, which is small compared to the returned value.
Multimedia Rights Management for the Multiple Devices of End-User
Authors: Kyung-Ah Chang, Byung-Rae Lee
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

This paper describes multimedia rights management enforcement for the multiple devices of end-user. Today, contents sharing and superdistribution of the multiple devices has become easy due to advancement in computer technology. However, most DRM vendors require onlyDRM client system of their own then end-user must have installed various clients and may worry about limited computing capacity. And the DRM vendors may worry that end-users could give or lend the multimedia rights of protected contents to device of another user what the DRM vendors don't allow. To resolve these problems, we propose a multimedia rights management scheme in which multiple devices of end-user are managed by only proxy manager controlled with interoperable client of each device. This scheme supports rights governance by public key based group communication that ensures that only legitimate operations can apply to the multimedia content.
The Air Force software manager
Authors: Richard H. Thayer
Venue: Proceedings of the 1975 annual conference (1975)

The U.S. Air Force has come a long way in its approach to the management of large Automatic Data Processing (ADP) projects. However, there are still many unsolved problems, particularly in the software management area. This short paper traces the evolution of software management of large computer developments in the Air Force from the SAGE Command and Control System in 1954 to the present. This paper also outlines what has been accomplished, what is on the horizon and what further requirements are necessary to provide better software management.
The user as a learning component in a data system during the change-over and use periods
Authors: Pertti Järvinen
Venue: Proceedings of the eighteenth annual computer personnel research conference (1981)

This experimental study consisted of two successive stages: 1) the change-over from a manual to a computerized data system including the first months use, and 2) a programming course for users after one year's use of the new data system. A department in a welfare office acquired ready-made application software to support its functions. Findings from the first stage cover among other things: a) the pros and cons for starting a new system at a certain instant of time compared with gradual transition, b) the regulating effects of a small number of terminals and COM devices on users' work, c) improvements in manual working methods made by users during the first months use. In order to encourage user growth at work on data-processing a programming course was organized for them. Most clerks passed the program comprehension test and some of them constructed small simple programs. The course had a positive influence on their work by giving a more structured image of the computerized part of the system.
On rational function approximations to the exponential function with application to the practical solution of linear differential difference equation with constant coefficients
Authors: Yudell L. Luke
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

In connection with (15), it is important to know the nature of the zeros of Gn(z). All are simple and lie in the left half plane outside the circle of radius 2 (n&equil;1 is an exception where the zero is on the latter circle). If n is even, there are no real zeros, while if n is odd, there is only one real zero. For complete details see [4]* and [5]*. The work of Nassif [6]* shows that if n > 1, the zeros of Gn (z ) lie on or outside a circle of radius 2 [(2n-1)/(n-1)] 1/2, which is an improvement over the above result. Thomson [7]* has tabulated the zeros of Gn (2z) for n &equil; 1(1)9 to 4 decimals. Examination of these data shows that the zeros of Gn (z) lie outside the circle of radius 4n/3 and we conjecture that this is true for all n. In fact, the magnitude of the smallest zero(s) is very nearly (4n+2)/3, for n &equil; 2(1)9, and the latter formula is exact for n&equil;1. Thus the applicable range of the rational approximation (&agr;&equil;&bgr;&equil;0) appears to be limited by the location of the zeros of Gn (z). However, an analysis of (15) reveals that to obtain good accuracy n must be considerably larger than z, so that (15) is dominant in deciding the choice of n for a pre-selected z.
Structured design verification: Function and timing
Authors: C. J. Rimkus, M. R. Wayne, D. D. Cheng, F. J. Magistro
Venue: Proceedings of the 20th Design Automation Conference (1983)

Changes in the design verification environment brought about by VLSI design considerations are discussed. Multi-level modelling support is now required of efficient, interactive verification tools. The role of logic simulators in this environment is analyzed, especially in early error removal during the design cycle. A logic simulation system, which has been implemented as part of the IBM Design and Verification system, is described here. Particular attention is paid to the key areas of hierarchy in the design description, user interaction, and simulation speed.
Real time information processing I: Mathematical considerations of real time digital simulation
Authors: I. M. Salzberg
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

A simulator may be defined as a device which yields all physical stimuli necessary to imitate adequately a phenomena resulting from natural or man-made causes. For most training situations, it has been found that the mathematics of calculus and algebra are ample to develop simulation models. Thus, after a model has been developed, in the form of a set of simultaneous differential and algebraic equations, it is necessary that they be solved to a degree of precision necessary to insure positive training value. In many respects a digital computer is the preferred tool to do this job; however, this means that an inherently continuous problem must be solved in a quantized fashion, thus leading to approximations and inaccuracies. This paper will describe the nature of these errors and discuss the mathematical tools available to determine them. In this pursuit, the paper will cover the following topics: (1)&mdash;Dynamic Accuracy (2)&mdash;Integrating Resolution (3)&mdash;Static Accuracy
TYMNET - maintenance considerations in a very large Network.
Authors: Neil Sullivan
Venue: Proceedings of the fifth symposium on Data communications (1977)

In the past six years of operation, TYMNET has increased from 30 computer nodes to 240 computer nodes spread throughout the United States, Canada and Mexico. Tymnet also provides the equipment, technology and programming for the data base services offered by the local Postal Telephone and Telegraph administrations in England, France, Netherlands, Germany, and Switzerland. Tymnet currently serves over 100 host computers. During these six years the mean time between failures of the TYMNET computer nodes has gone from 1.14 hardware failures per node per year to 0.5 failures per node per year, with a mean time to repair of under four hours. This increase in hardware reliability is a result of equipment modification in response to failures, improvement in monitoring tools, a centralized network control, and decentralized board repair. This paper describes how Tymnet Inc. currently maintains TYMNET and some of the tools that were developed to support this effort.
The role of engineering in the evolving technology/automation interface
Authors: R. P. Lydick
Venue: Proceedings of the 18th Design Automation Conference (1981)

In order to be successful in the rapidly expanding field of LSI and VLSI development, there must be a close interrelationship between the software engineers who develop CAD tools and the hardware engineers who must use those tools. Any new CAD tool must encompass three areas: it must be able to handle complex circuits efficiently; it must be a complete package, including simulation, layout, checking and test program generation; and it must be useable. The hardware engineer can provide valuable system integration experience when the time comes to incorporate each new tool into the complete package. If new tools do not properly interface with existing or projected tools, they will induce errors and not be useful. Finally, if hardware engineers are involved in each of the phases of CAD tool development, they will have a vested interest in ensuring that the package works, and just as importantly, they will use the tools.
IMAGE: An interactive computer system for multi-constrained spatial synthesis
Authors: Guy Weinzapfel, Timothy E. Johnson, John Perkins
Venue: Proceedings of the 8th Design Automation Workshop (1971)

IMAGE is a system of computer programs which generates three dimensional spatial arrangements to satisfy spatial requirements specified by a designer. A problem specification is composed of two elements: geometric descriptions of the spaces to be configured; and relationships between those spaces which the designer wishes to achieve. Given a problem description, IMAGE generates arrangements until a configuration is achieved which satisfies all specified relationships. If no such configuration is possible, IMAGE produces arrangements which minimize dissatification of the specified relationships. IMAGE, the computer design aid system described in this paper, has been developed to go beyond the single parameter approach, to operate on a more flexible set of form explicit criteria and to facilitate its interaction with the designer's own process.
Proving multilevel security of a system design
Authors: R. J. Feiertag, K. N. Levitt, L. Robinson
Venue: ACM SIGOPS Operating Systems Review (1977)

Two nearly equivalent models of multilevel security are presented. The use of multiple models permits the utilization of each model for purposes where that model is particularly advantageous. In this case, the more general model is simple and easily comprehensible, being more abstract, and is useful for exposition of the meaning of multilevel security. The less general model relates well to design specifications and permits straightforward proof of the security of a system design. The correspondence between the two models is easily demonstrated. The two models when applied appropriately are more useful for defining and proving the multilevel security of systems than existing models. The utility of the two models and their relationship to existing models is discussed and the proof of the security of one particular system design is illustrated. The technique for accomplishing the security proof is straightforward and can be extensively automated.
Multiprogramming and program behavior
Authors: G. Scott Graham, Peter J. Denning
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

Dynamic multiprogramming memory management strategies are classified and compared using extant test data. Conclusions about program behavior are then drawn.
Deterministic systems design from functional specifications
Authors: Hans Wojtkowiak
Venue: Proceedings of the 18th Design Automation Conference (1981)

The approach presented is intended to help solve design problems above the logical level. It is based on the use of a special class of PETRI nets to model system components and data flows. Instead of describing an already existing design the functions to be implemented are introduced by a specification program. This serves as a basis for algorithms generating a controlled system structure which exactly performs the functions specified. So, no further verification is necessary. It is finally shown how to interpret the generated control structure.
A new binary code for pattern recognition by parallel computation
Authors: Jerome Rothstein
Venue: Proceedings of the ACM annual conference (1973)

In most pattern recognition schemes, common geometric transformations such as rotation, translation, and perspectivity require computations whose complexity and execution time increase rapidly with increasing grid resolution (number of grid cells). A new code which embodies such transformations as simple, locally applied algorithms (such as rewriting substrings of code as single digits) has been found. By applying these algorithms to the code, the problem of recognizing straight lines on the quadratic lattice has been completely solved. Recognition is achieved by applying a sequence of affine transformations to reduce lines to standard position. This corresponds to reducing a code string to a single digit. The recognition algorithms are parallel (applied simultaneously to entire code string) and are independent of the number of cells in the grid and the slope and position of the line relative to the grid. They are based on some interesting connections between the new code and continued fractions, Farey series, and affine transformations.
On improving the productivity of somewhat larger organizations
Authors: Alonzo Grace
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

In his paper, &ldquo;Structured Programming,&rdquo; (Rome NATO Conference, October, 1969), Edsger Dijkstra explains that his concern is with &ldquo;intrinsically large programs&rdquo; and that &ldquo;the leading question (is whether it is) possible to increase our programming ability by an order of magnitude.&rdquo; Beginning with the accounts of Mills, a number of success stories have appeared in the literature. All have the property that they describe gains made by small groups. The leading question considered in this paper is whether it is possible to improve the productivity of a sizeable organization (say, 50 to 1000 people), not by an order of magnitude, but by a factor of 10% per year, for a period of several years. The paper suggests that there are systematic ways to achieve such gains, and describes, generally, the approach which the author uses. The main thesis is that improving the productivity of any organization is, itself, a systems problem. It is held that, for large organizations, it is likely to be a more difficult problem than any of the other problems which the organization is attacking. The reasons have to do with the dimensions of complexity and a tendency on the part of many people (who are properly concerned with intellectual complexity) not to take organizational complexity seriously enough. The idea that manager and architect are interchangeable (or simply two sides of the same person) is a concept whose value is a decreasing function of the size of the organization for which the manager is responsible. The manager/architect capability is an essential property of many first line managers&mdash;certain professors, surgeons, leaders of small group technical efforts, chief programmers, etc. The concept has considerably less value, however, if the problem is to design and implement a productivity improvement program for a relatively large organization. The top manager cannot be his own architect. There is a further difficulty in that the architect must understand what is involved in managing a large organization. It is not an intellectual exercise, nor can it be hand-waved away as a &ldquo;team-of-teams&rdquo; kind of thing which some of the proponents of chief programmer teams would have us believe.
The National Software Works: A distributed processing system
Authors: Robert E. Millstein
Venue: Proceedings of the 1977 annual conference (1977)

The National Software Works (NSW) is a significant new step in the development of distributed processing systems and computer networks. NSW is an ambitious project to link a set of geographically distributed and diverse hosts with an operating system which appears as a single entity to a prospective user. An initial version of NSW spanning TENEX, MULTICS, and IBM 360 computers has been in regular operation since May 1977. Further enhancement of this system to provide better reliability, improved response time, expanded facilities, and additional host computers is currently under way. In the next section we describe the purpose of NSW and the problem that led to its creation. The following sections give a simplified overview of NSW system design and finally describe the individual components which comprise NSW.
The complexity of relational query languages (Extended Abstract)
Authors: Moshe Y. Vardi
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language as a function of the size of the database, and expression complexity is the complexity of evaluating a query in the language as a function of the size of the expression defining the query. We study the data and expression complexity of logical languages - relational calculus and its extensions by transitive closure, fixpoint and second order existential quantification - and algebraic languages - relational algebra and its extensions by bounded and unbounded looping. The pattern which will be shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity we show completeness in some complexity class.
A network modeling and analysis technique for the evaluation of nuclear safeguards systems effectiveness
Authors: Floyd H. Grant,  III, Robin J. Miner, Dennis Engi
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

Nuclear safeguards systems are concerned with the physical protection and control of nuclear materials. The Safeguards Network Analysis Procedure (SNAP) provides a convenient and standard analysis methodology for the evaluation of safeguards system effectiveness. This is achieved through a standard set of symbols which characterize the various elements of safeguards systems and an analysis program to execute simulation models built using the SNAP symbology. The reports provided by the SNAP simulation program enable analysts to evaluate existing sites as well as alternative design possibilities. This paper describes the SNAP modeling technique and provides an example illustrating its use.
HOPE: An experimental applicative language
Authors: R. M. Burstall, D. B. MacQueen, D. T. Sannella
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

An applicative language called HOPE is described and discussed. The underlying goal of the design and implementation effort was to produce a very simple programming language which encourages the construction of clear and manipulable programs. HOPE does not include an assignment statement; this is felt to be an important simplification. The user may freely define his own data types, without the need to devise a complicated encoding in terms of low-level types. The language is very strongly typed, and as implemented it incorporates a typechecker which handles polymorphic types and overloaded operators. Functions are defined by a set of recursion equations; the left-hand side of each equation includes a pattern used to determine which equation to use for a given argument. The availability of arbitrary higher-order types allows functions to be defined which 'package' recursion. Lazily-evaluated lists are provided, allowing the use of infinite lists which could be used to provide interactive input/output and concurrency. HOPE also includes a simple modularisation facility which may be used to protect the implementation of an abstract data type.
Merrily we roll along: Some aspects of?
Authors: J. O. Shallit
Venue: Proceedings of the international conference on APL (1983)

We present an efficient method for determining the number of invocations of? given the value of (@@@@)RL, and solving the inverse problem. A full implementation is given for the random-number generator in APL\360 and its descendants.