ppxscal/embedding_network huggingface dataset:
Processor System Modeling - a language and simulation system
Authors: Fredrick Pfisterer, William C. Purdy, Leonard Lehmann
Venue: ACM SIGSIM Simulation Digest (1976)

There is a need for a language and simulation system that computer systems designers (rather than programmers) can use to build and exercise models of computer systems. The major characteristics of such a language and system are presented. A brief overview of the Processor System Modeling (PSM) system, consisting of PSM language input, translation to Simscript, execution, and interactive post processor operation on a trace of the results, is outlined. The different types of statements in the language of the PSM system and their use are described. The major features of the language and system, which allow it to be used for constructing simple models quickly while still permitting complex systems and behavior to be simulated, are presented. Examples are used to demonstrate the use of these features, to illustrate the structure of the language, and to show its naturalness for the job of simulating computer systems. The reasons for having a post-processor rather than statistics gathering routines are given. The two types of queries that may be made through the post-processor, about sequential events and about statistics, are described and examples given.
Correction and wiring check-system for master-slice LSI
Authors: Yasuhiro Ikemoto, Toshiki Sugiyama, Kenichi Igarashi, Hiroshi Kano
Venue: Proceedings of the 13th Design Automation Conference (1976)

A Computer Aided Design (CAD) system for bipolar logic LSI based on master-slice method, has been developed. During every phase of designing LSI, various errors are prone to occur. These errors are mostly detected after having actually manufacturing the LSI. The main purpose of this CAD system is as follows: 1. Error-free design. 2. Lower design cost. 3. Shorter design cycles. This paper mainly describes two systems, one for correction patterns of interconnected terminals and the other for design verification of corrected patterns.
Dynamic Fair Bandwidth Allocation in Multiservice CDMA Networks
Authors: Chengzhou Li, Symeon Papavassiliou
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In this paper we study the fundamental problem of allocating with efficiency and fairness the available resources in a CDMA wireless system that supports multi-rate multimedia services. We propose the Channel Adaptive Rate Scheduling (CARS) algorithm which adopts the use of dynamically assigned data rates that match the channel capacity in order to improve the system throughput and overcome the problems associated with the channel changing conditions, the variable system capacity and the transmission power limitation. In addition to the throughput improvement CARS also achieves the objective of fairness by adjusting the users' weights dynamically. The performance analysis and evaluation of our proposed algorithm is achieved via modeling and simulation in terms of achievable throughput and fairness.
A computer-aided linkage analysis system
Authors: F. Bitonti, D. W. Cooper, D. N. Frayne, H. H. Hansen
Venue: Proceedings of the SHARE design automation project (1965)

A significant portion of mechanical engineering effort is spent in the kinematic analysis of mechanisms such as gears, cams, and linkages. Although linkages present a more complex problem of analysis than most other basic mechanisms, they are widely used because of their reliability, speed, and force-transmission properties. Engineers continuously seek improvements in existing linkages and devise linkages for new mechanical systems. Linkage analyses have traditionally been performed on the drafting board, but this process is difficult and time consuming, and complete analyses are not feasible for the more involved linkage systems encountered in practice. This paper describes an experimental tool for the analysis proposed two-or three-dimensional linkages. Called KAM (for Kinematic Analysis Method), the tool consists of a programmed system for the IBM 1620. Based on mathematical procedures due to Chace1the system can provide position, motion, and force analyses for a wide class of linkages. The user describes a proposed linkage to KAM in a language modeled after the APT Language.2 The language functions solely as a means of describing the connectivity of parts in a linkage; the action statements that request calculations are specified by other means. From a linkage description in KAM Language, the KAM program uses a storage-allocation technique described by Ross3 to form a tree-organized model of the linkage within computer memory.
The AFWL HULL code codes for large problems fluid dynamics
Authors: Daniel A. Matuska, Charles E. Needham, Richard E. Durrett
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

The Air Force Weapons Laboratory (AFWL) has maintained a strong interest in large scale fluid dynamics problems since its establishment some ten years ago. Typically, these problems have a spatial extent which changes by several orders of magnitude between the initial conditions and the solution of interest. Time variations of orders of magnitude are also possible. In any case the large scale fluid dynamics problems solved by AFWL may be defined as those in which the smallest lineal resolution desired is less than one percent of the total dimension of interest. A large number of problems fit into this category in two and three dimensions. The AFWL has developed a system of solution for such problems which is easy to use, adaptable to many different problems and computers, and, most importantly, extremely accurate. This system is represented by the HULL code. The basic part of the code is a second order accurate, multi-dimensional Eulerian hydrodynamic code. The differencing method was developed by Capt. D. Matuska at AFWL and is itself unique.
The design of a language-directed editor for block-structured languages
Authors: Joseph M. Morris, Mayer D. Schwartz
Venue: ACM SIGPLAN Notices (1981)

A language-directed editor combines the text manipulation functions of a general-purpose editor with the syntax-checking functions of a compiler. It allows a user to create and modify a program in terms of its syntactic structure. The design of a user interface and an implementation for one such editor is described in language-independent terms. The design rationale is given. The implementation is outlined in terms of its major data structures.
Panel on computer science curriculum (Session LI)
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The need for education in the computer field is one of the most pressing issues facing the computer profession. The purpose of this panel discussion on curriculum is to present to the audience outlines of complete undergraduate degree programs in computer science. Some indications of graduate programs will also be given. The first program presented below is in the process of being formulated. The next two already have several years of experience back of them. These presentations are for the purpose of presenting some ideas and guidance to the many schools starting or about to start programs in computer science or its equivalent.
The PRIM system: An alternative architecture for emulator development and use
Authors: Joel Goldberg, Alvin Cooperband, Louis Gallenson
Venue: ACM SIGMICRO Newsletter (1977)

The architecture of PRIM is unique in coupling a powerful microprogrammable machine (the Standard Computer Corporation MLP-900) to a modern general-purpose computing system (the DEC PDP-10). The TENEX timesharing system running in the PDP-10 is responsible for scheduling use of the MLP-900. Emulator microcode runs in the MLP-900 under the control of a small resident executive that swaps its users and mediates references to PDP-10 services and shared memory. The PRIM system in the PDP-10 (also running under control of TENEX) provides emulators with access to the TENEX file system and peripherals. PRIM also permits on-line user control of an emulation and supports interactive symbolic debugging of both emulator microcode and target code for the various emulated machines. The resulting sharable system, accessible via the ARPANET to users anywhere, supports both emulator developers and users. This architecture has allowed the development of a more powerful and convenient tool with less effort than would have been possible on a stand-alone microprogrammable host. The hardware and software components of the PRIM system are described and the operation of PRIM is outlined from the user's viewpoint. Requirements for creating PRIM-like systems are discussed, and the PRIM approach is compared with other, more conventional approaches.
Why industry hires our graduates
Authors: Fred C. Homeyer
Venue: Proceedings of the 1977 annual conference (1977)

Two of the greatest weaknesses of undergraduate computer science students entering the industrial job market today are linked to communication skills. The typical graduate of an undergraduate computer science program cannot write or speak with competence. Described in this paper is an undergraduate computer science program that attempts to strengthen weak communication skills.
An Anisotropic Diffusion PDE for Noise Reduction and Thin Edge Preservation
Authors: Zhouchen Lin, Qingyun Shi
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper, an image denoising operator defined by a non-linear partial differential equation(PDE) is presented. Similar to the operators proposed by Perona, Malik and Catte et al., it can remove noise, enhance step-like edges and keep the locality of the edges. Its extra ability is to keep thin edges. The criterion for stopping time is also investigated. The new operator is capable of removing rather high uniform noise without sacrificing the details of the image. If the noise is Gaussian with not too high standard deviation, the result is also quite good.
LSI microprocessors and microprograms for user-oriented machines
Authors: Imsong Lee
Venue: Supplement to the conference record of the 7th annual workshop on Microprogramming (1974)

The fundamental aspect of microprogramming as introduced by Wilkes in 1951 [1,2] is the implementation of sequential control with stored or programmed logic in contrast to hardwired random logic involving adhoc connections of large numbers of simple logic gates. The microprogramming became practical with the availability of high speed memories at reasonable cost during the 60s and has become a very popular tool even for the design of small, low-cost computers. [3,4] ,Now steadily improving performance of LSI memories at declining cost and availability of LSI functional components to implement combinatorial and sequential logic functions tend to obliterate the classic distinction between logic and memory based on old technologies, i.e., electronic logic and magnetic memory with incompatible speeds, signal levels, and power requirements. Although we still do have minor incompatibilities between TTL and MOS signal levels, these are bang eliminated with introduction of NMOS (N-channel Metal Oxide Semiconductor) LSI devices which are fully TTL compatible. The full compatibility of memory and logic at hardware level, and availability of LSI memories and processing elements in convenient sizes, speeds and capacities at a steadily declining cost seem to favor use of programmed logic over hardwired random logic in many old and new applications, just as the microprogramming has been favored over hardwired logic for the design of control unit. This technological development provides the computer architect and digital system designer with new freedom to distribute &ldquo;intelligent, programmable&rdquo; chips throughout his system from the control processor within a central processor to &ldquo;dumb&rdquo; peripheral devices. This unprecedented design freedom seems to be the most significant aspect of LSI technology that the designer must realize before he can bring its benefits to users. This paper attempts to explore potentials and limits of LSI technology, and its profound implications for microprogramming, computer design, and computer usage.
Tight bounds on the complexity of parallel sorting
Authors: Tom Leighton
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

In this paper, we prove tight upper and lower bounds on the number or processors, information transfer, wire area and time needed to sort N numbers in a bounded-degree fixed-connection network. Our most important new results are: 1) the construction of an O(N))-node bounded-degree network capable of sorting N numbers in O(log N) word steps, 2) a proof that any network capable of sorting N(7 log N)-bit numbers in T bit-steps requires area A where AT2&ge; &Ohgr;(N2log2N), and 3) the construction of a &ldquo;small-constant-factor&rdquo; bounded-degree network that sorts N &thgr;(log N)-bit numbers in T &equil; &thgr;(log N) bit steps with A &equil; &thgr;(N2) area.
Initial experiences with an on-line catalog (abstract only)
Authors: Rebecca D. Dixon, Edmund D. Meyers,  Jr.
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

P-STAT began as a collection of integrated commands which read rectangular files sequentially. A simple modification language for recoding and case selection was added in the late 1960's. Commands were added throughout the 1970's. Recently, however, a major effort has gone into language enhancement and file structure improvements.P-RADE, a random access data enhancement to P-STAT, is an example. This type of file structure supports up to 10 indexing keys, allowing a case or a group of cases to be accessed very rapidly. In addition, any P-STAT command can read a P-RADE file sequentially in any key order.In some ways, this approach blends aspects of database technology into statistical software. Examples of its use will be given.
Data Processing in Bolivia
Authors: Max O. Mehlis
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

The largest computer in Bolivia is an IBM 1440 system which by established standards is roughly a medium-size computer. It is also, at the present time, one of three computers in the whole country, all located in La Paz. This computer belongs to the Corporacion Minera de Bolivia. The Corporacion Minera de Bolivia is the basis of the Bolivian economy and directly employs over 20,000 people; at the same time it is a government-owned and controlled company. Within the corporation the Data Processing Department reports directly to the Finance Manager. It consists of a programming section, machine operations section and document control section. The purpose of this paper is to present the behind-the-scenes situations, environmental factors, problems and solutions and techniques involved in the attempt to make this particular data processing department, and what it represents to all concerned, a worthwhile approach and a dynamic success.
A hardware instrumentation approach to evaluation of a large scale system
Authors: D. J. Roek, W. C. Emerson
Venue: Proceedings of the 1969 24th national conference (1969)

Determining and substantiating the capabilities and limitations of complex hardware/software systems are tasks of increasing importance to computer manufacturers and users alike. The identification and elimination of many system inefficiencies have been impossible due to the lack of a factual basis in the design and utilization of the system. A significant step in solving this problem has been the development of instrumentation which provides a profile of executed instructions in a non-degraded system; in particular, special attention has been given to inefficiencies in the operating system. Initial favorable results indicate that a step in the right direction has been taken toward providing an instrumentation capability which provides a factual basis for the enhancement of prresent systems and for the design of future systems.
The increasing threat from technology
Authors: Robert D. Parslow
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

Although new technology sometimes enables us to perform new tasks (e.g. space travel) and usually improves the quality of the product and the speed of production, the main reason for its adoption is to cut costs. Hence the primary effect of savings in wages is to increase unemployment and only later can the increased sales and emergence of new industries counter this effect. In my previous papers |1,2,3| I quoted 1978 predictions of unemployment in the UK increasing to 4.1 million, a rate of 1 in 6 by the end of 1983. Although these predictions were generally ignored and occasionally attacked they have proved uncannily accurate. The criticism in |4| was, as in some medieval discourse, attempting to disprove my conclusions by showing that the arguments given were not logically rigorous. Causality is notoriously difficult to prove (despite the evidence, it was possible for some time to avoid the conclusion that smoking caused cancer). The statements we made were true and the predictions, however unpalatable, have now been shown to be correct, but governments were able to reject such findings and avoid taking effective action leaving the present set of unsolved problems.
Tutorial on programming language research
Venue: ACM SIGPLAN Notices (1981)

Rowe: I am going to talk a little about data abstraction from a programming language viewpoint. I suspect that what I will say in some places will be every bit as controversial amongst programming language folks, as what Dennis said was amongst database folks. Historically, programming languages evolve continually, from very low-level representations or descriptions of computations to higher-level descriptions. The idea is to express computations in a way that makes them easier to write, faster to debug, and make them survive change. All these marvelous buzzwords!
TPLAN a table driven planning system
Authors: S. B. Jaffe
Venue: Proceedings of the international conference on APL (1983)

A general broad based APL system has been developed for the storage, retrieval and analysis of financial planning or accounting type data. It is valuable for the class of problems arising from collecting, organizing and consolidating data according to set formulas or recipes. The system, called TPLAN for Table driven PLANning system, has as its foundation three principal tables: a table of line or account names; a table of formulas specifying how each account is to be calculated; and a table of data with one row for each account. TPLAN is an &ldquo;Open&rdquo; system that provides the user with a collection of conformable utility functions which operate on the principal tables. The package consists of 52 APL functions which contain an average of 3-4 lines of code.
Extending object oriented programming in Smalltalk
Authors: Ira P. Goldstein, Daniel G. Bobrow
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

Smalltalk is an object oriented programming language with behavior invoked by passing messages between objects. Objects with similar behavior are grouped into classes. These classes form a hierarchy. When an object receives a message, the class or one of its superclasses provides the corresponding method to be executed. We have built an experimental Personal Information Environment (PIE) in Smalltalk that extends this paradigm in several ways. A PIE object, called a node, can have multiple perspectives, each of which provides independent specialized behaviors for the object as a whole, thus providing multiple inheritance for nodes. Nodes have metadescription to guide viewing of the objects during browsing, provide default values, constrain the values of attributes, and define procedures to be run when values are sought or set. All nodes have unique names which allow objects to migrate between users and machines. Finally attribute lookup for nodes is context sensitive, thereby allowing alternative descriptions to be created and manipulated. This paper first reviews Smalltalk, then discusses our implementation of each of the above capabilities within PIE, a Smalltalk system for representing and manipulating designs. We then describe our experience with PIE applied to software development and technical writing. Our conclusion is that the resulting hybrid is a viable offspring for exploring design problems.
Architecture of the PSC-a programmable systolic chip
Authors: Allan L. Fisher, H. T. Kung, Louis M. Monier, Yasunori Dohi
Venue: ACM SIGARCH Computer Architecture News (1983)

In recent years, many systolic algorithms have been proposed as solutions to computationally demanding problems in signal and image processing and other areas. Such algorithms exploit the regularity and parallelism of problems to achieve high performance and low I/O requirements. Since systolic algorithms generally consist of a few types of simple processors, or systolic cells, connected in a regular pattern, they are less expensive to design and implement than more general machines. This advantage is offset by the fact that a particular systolic system can generally be used only on a narrow set of problems, and thus design cost cannot be amortized over a large number of units. One way to approach this problem is to provide a programmable systolic chip (PSC), many copies of which can be connected and programmed to implement many systolic algorithms. The systolic environment, by virtue of its emphasis on continuous, regular flow of data and fairly simple per-cell processing, imposes new design requirements for programmable processors which are quite different from those found in a general-purpose system. This paper describes the CMU PSC, a single-chip microprocessor suitable for use in groups of tens or hundreds for the efficient implementation of a broad variety of systolic arrays. The processor has been fabricated in nMOS, and is undergoing testing.
The consistency of "P = NP" and related problems with fragments of number theory
Authors: Richard A. DeMillo, Richard J. Lipton
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

The main results of this paper demonstrate the consistency of &ldquo;P &equil; NP&rdquo; and a variant of &ldquo;NP @@@@ coNP&rdquo; with certain natural fragments of number theory to be defined precisely in the sequel.@@@@ Consistency results represent an approach to the lower bound problems of complexity theory which points to a number of interesting lines of inquiry. Our ultimate goal is to make precise the difficulty of proving certain nontrivial lower bounds. Among the possibilities which follow from this approach are: (1) that logical techniques may help us resolve the P &equil; NP question, (2) that showing why certain arguments must fail may lead to mathematical tools capable of resolving the problems, and (3) that the special character of model theoretic methods in complexity theory may lead to new results which are of purely logical interest. We will address these possibilities below.
Experimental mathematics: An application retarded ordinary differential equations with infinite lag to
Authors: Alan Feldstein, Carolyn K. Grafton
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

As shown by the ACM Symposium on Interactive Systems for Experimental Applied Mathematics (held in conjunction with the 1967 National Conference), the subject of experimental mathematics is. a timely one. The author's propose in this paper to discuss their partial success in an experimental study of linear retarded ordinary differential equations (hereafter called RODE) where the lag may become infinite.