ppxscal/embedding_network huggingface dataset:
Interconnecting local networks via the Packet Radio Network
Authors: John F. Shoch, Lawrence Stewart
Venue: Proceedings of the sixth symposium on Data communications (1979)

The Bay Area Packet Radio Network has been integrated into an existing architecture for network interconnection: it can be used to provide radio communications for directly connected hosts, or as an alternative packet transport mechanism to carry traffic between two local networks. The radio link is operational, and can support regular internetwork communications at rates ranging from 12 to 20 kilobits/second, with the current Packet Radio equipment. Use of the Radionet required only the writing of a network specific driver for the standard communications software package. The driver is responsible for controlling the interface to the Radionet, performing fragmentation and reassembly of large packets, routing within the Radionet, and similar tasks.
Comprehensive graphics system for general users
Authors: Amitava Ghosh
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

In an academic environment consisting of a large population of users in the area of the sciences and engineering, the need for comprehensive graphics capability is very strong. Since many of the users are inexperienced programmers, it is essential that the graphics system must be simple to use and also have an extensive error diagnostics. A comprehensive graphics system has been developed at Clemson called GCALCOMP. This system is used under Speakeasy, which is a very simple but powerful interactive software supplied by Speakeasy Corp. GCALCOMP can be used to perform graphics functions on any of the graphics devices currently supported by the Clemson installation. This graphics system is comprised of several commands which can be used to specify, manipulate, and draw graphs, bar charts, contour plots, etc.
A hardware support mechanism for scheduling resources in a parallel machine environment
Authors: Roy Jenevein, Doug Degroot, G. Jack Lipovski
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

The allocation of resources in an array computer using either an SW-banyan or a tree interconnection network is implemented in hardware. A generalized solution for the resource allocation problem in such machines is presented. The solution reduces network node blockage and node distances and supports differing network topologies and decentralized scheduling. The mechanism presented is shown to reduce significantly the amount of computational work required in software allocation of resources.
A high speed magnetic-core output printer
Authors: Bernard M. Gordon, Renato N. Nicola
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

In many data processing and scientific computing applications there exists a need for very rapidly converting a mass of coded data, centrally stored, to either immediate visual display or to a permanent form capable of being directly read. At present, the full potential effectiveness of many systems has been negated, not by their central decision-making arithmetic equipments, but by the limitations of their output conversion units. The need for a high-speed output device having the properties of flexibility and reliability, and yielding characters of high quality, yet still capable of being produced at an economical cost has been painfully evident. In recent months the fruits of several endeavors to remedy the situation have been presented in the form of electromechanical, rotating magnetic-drum or electrostatic systems. These novel systems have approached the high-speed requirements, but in general they have been extremely complex or adjustment-sensitive and do not meet the requirement of economy.
An Integrated Corporate Data Base concept and its application
Authors: Bernard Plagman, Gene Altshuler
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

The evolution of computer commercial applications has gone from simple, repetitive accounting to extremely complex information systems. The ability to support the multiplicity of applications and information needs of a business entity with a corporate wide information system has been discussed at length over the last few years. Data redundancy and the inability to transfer data on an intersystem basis within the corporation are among the chief problems to be overcome. The implementation of the Integrated Corporate Data Base (ICDB) in support of a total information system is a potential solution to these problems. The ICDB concept can be defined as the logical centralization and control of all data necessary to manage the business enterprise. It entails five basic functional elements, which are defined and discussed in detail. &bull; The Data Bank &bull; The Data Dictionary/Directory &bull; The Data Base Management System &bull; The Data Base Administrator &bull; The User/System Interface The ICDB concept is applied to the information system of the Federal Reserve Bank of New York. The information system is outlined and the ICDB concept applied in its environment.
The application of an APL micro computer solving a commercial problem - a case study
Authors: H J Ward, P W Hurdley
Venue: Proceedings of the international conference on APL (1982)

This paper examines, in detail, three systems originally running on a major APL timesharing service which have been re-developed to run on an MCM APL micro computer complex for BL - a major British motor vehicle manufacturer. Four aspects of this re-development project are considered: a) The background to the project, why re-development was considered and the selection of the computer equipment. b) Appraisal of the three systems and the analysis performed on each - its use; its cost; its size; its operational environment and its overall suitability for the micro computer option. Advantages of a new approach and the development of specific tools to provide the service levels expected by time-sharing service users. c) Systems design and the influence of a changing user environment and the constraints imposed by a micro computer. d) The user's point of view in respect of: - additional and changed responsibilities - field support - the user/machine interface. In conclusion, the suitability of the solution and its development policy is reconsidered after some months of use. Problem areas seen with the benefit of hindsight are now identified and some ideas are put forward in an attempt to avoid them in future.
Efficient implementation of the smalltalk-80 system
Authors: L. Peter Deutsch, Allan M. Schiffman
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

The Smalltalk-80* programming language includes dynamic storage allocation, full upward funargs, and universally polymorphic procedures; the Smalltalk-80 programming system features interactive execution with incremental compilation, and implementation portability. These features of modern programming systems are among the most difficult to implement efficiently, even individually. A new implementation of the Smalltalk-80 system, hosted on a small microprocessor-based computer, achieves high performance while retaining complete (object code) compatibility with existing implementations. This paper discusses the most significant optimization techniques developed over the course of the project, many of which are applicable to other languages. The key idea is to represent certain runtime state (both code and data) in more than one form, and to convert between forms when needed.
A simulation model for evaluating bus routes and schedules in small cities
Authors: John M. Gleason
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

This paper discusses the simulation portion of a computer model which may be used by small city mass transit decision-makers to determine costs and benefits of alternative routing-scheduling systems. Given the results of an origin-destination survey, the model first determines the schedules for the routes, the number of trip demands which will be lost due to poor routing or poor scheduling, and the best travel pattern for the trip demands which can be serviced by the routing-scheduling system. The simulation portion of the model then simulates the operation of the buses on the routes, and the loading, unloading, and transfer of passengers in order to determine trip revenues, vehicle operating costs, and a variety of customer service measures.
The Ada Compiler Validation Capability
Authors: John B. Goodenough
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

The Ada Compiler Validation Capability consists of tests, tools, procedures, and documentation designed to enforce (and encourage) development of compilers that conform to the Ada language Standard. In this paper, we discuss our approach to solving the principal problems faced in developing and using such a capability.
Relativized questions involving probabilistic algorithms
Authors: Charles Rackoff
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

Let R @@@@ NP be the collection of languages L such that for some polynomial time computable predicate P(x,y) and constant k, L &equil; {x|@@@@y, |y|&equil;|x|k,P(x,y)} &equil; {x|@@@@ at least 2|x|k&minus;1 values of y, |y|&equil;|x|k,P(x,y)}. Let U @@@@ NP be the collection of languages L such that for some polynomial time computable predicate P(x,y) and constant k, L &equil; {x|@@@@y,|y|&equil;|x|k,P(x,y)}&equil; {x|@@@@ unique y, |y|&equil;|x|k,p(x,y)}. Let RA,UA, PA,NPA,CO-NPA be the relativization of these classes with respect to an oracle A as in [ 5 ]. Then for some oracle E (NPE @@@@ CO-NPE) &equil; UE &equil; RE &equil; PE @@@@ NPE while for some other oracle D CO-NPD &equil; NPD &equil; UD &equil; RD @@@@ PD.
Simulating musical skills by digital computer
Authors: John Rothgeb
Venue: Proceedings of the 1979 annual conference (1979)

It was perhaps inevitable that the digital computer, an insrument of such enormous potential and accomplishment in the study of both natural and social sciences and humanities, should have been applied to the investigation of problems in the fine arts as well. Among the latter, music was predictably the art form most directly accessible to computational study. Painting and the plastic arts do not readily lend themselves to direct computer applications; their analysis and elucidation with the aid of computers will necessarily await the development of highly sophisticated optical scanning devices at the very least. Music, on the other hand, is normally set down and transmitted graphically in the form of a notated score that can be almost completely represented in a code consisting of discrete symbols. It must be said at once, however, that the notated musical score, even of the simplest traditional western art music, is incomplete: The musical work, as conceived by the composer and as produced by the sensitive musical performer, deviates from the precision of the printed or written score in countless subtle ways &mdash; most obviously with respect to temporal organization, but also, even, with respect to pitch and timbre.1 Thus the score is at best an approximation to what can properly be designated as &ldquo;the&rdquo; composition. To appreciate fully what this means, it is instructive to imagine, or actually to experience, if possible, a literal realization by synthesizer of, say, a Bach sonata for unaccompanied violin (to choose a particularly extreme example). The hearer of such a realization finds it almost impossible to &ldquo;follow&rdquo; the music, to &ldquo;make sense&rdquo; of it; and this has far less to do with the timbral inadequacies of the synthesizer's violin tone than with missing temporal and dynamic nuances. (The same music speaks eloquently on ancient phonorecords, despite their obvious timbral deficiencies.) But the printed score and its representation in an appropriate linear code, incompleteness notwithstanding, present a sufficiently detailed picture of the music's structure to render it accessible to analytical probing in a depth not approachable in many other art-forms.
Centralized vs. diversified user services: A user's perspective
Authors: C. Purvis
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

As a group of professionals who use computers in our work, we see decentralization of computer user services as a possibly inevitable trend of the 1980s. It may be that it is simply no longer possible for a single, monolithic university or organizational computing center to provide adequately all relevant user services to a highly diversified population of users. It is important, therefore, to address the issue of how best to strike a balance between centralized and decentralized user services. That is, what kinds of services would be optimally provided by centralized user service organizations, and what kinds would best be dealt with on a departmental or college-wide basis?
Automatic question generation from text - an aid to independent study
Authors: John H. Wolfe
Venue: ACM SIGCUE Outlook (1976)

This report describes an experimental computer-based educational system called automatic question generation (AUTOQUEST) for assisting independent study of written text. Studies of reading comprehension have shown that retention of material is enhanced if the student is periodically required to answer questions about what he has read (Anderson Biddle, 1975; Anderson et al., 1974; Alessi et al., 1974; Anderson et al., 1975a, 1975b). This principle has been employed in computer-managed instruction, but it requires considerable human effort to prepare the questions.
Special Student Paper Session
Venue: Proceedings of the 1975 annual conference (1975)

The Special student Paper Session was designed to give high school and college students an opportunity to submit their work for consideration toward a spot on the Student Program. The Student Paper Competition called for papers on any topic, the only criteria being that the author was a student at the time his paper was prepared. Papers were reviewed by a panel of students and faculty before acceptances were made. The papers selected for the Special Student Paper Session cover a wide range of topics which should be of interest to students and professionals alike. The format of the session will allow for a question and answer period at the end of each paper.
The DEPOSITS model (deposition performance of sediment in trap structures)
Authors: Andy D. Ward, C. T. Haan
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

DEPOSITS is a conceptual model which simulates the sedimentation process in reservoirs and sediment detention structures. Damages associated with water borne sediment have escalated due to the rapid increase in urban development and strip mining in the last decade. The economic and recreational life of many reservoirs has been greatly reduced due to silting and pollution. The DEPOSITS Model provides a viable design method suitable for determining the impact of these detrimental factors. It may also be used in the design of sediment detention structures downstream of disturbed areas. Recent Federal and state legislation requires provision of detention structures in most disturbed areas and limitations on effluent sediment concentrations. Currently employed methods do not adequately account for the factors affecting sedimentation and give no estimate of effluent sediment concentrations. This paper presents a description of the simulation model the environmental impact and benefits obtained from use of the DEPOSITS Model and an outline of its application as a design method. The model has been tested on five sediment detention basins and gave good predictions of their performance. The model is being used to study the factors affecting sediment deposition in urban and strip mine areas.
Special problems in human movement simulation
Authors: Norman I. Badler, Joseph O'Rourke, Bruce Kaufman
Venue: ACM SIGGRAPH Computer Graphics (1980)

Three dimensional animation of human movement may be obtained by specifying movements in a goal-directed manner and constructing a sophisticated simulator to execute those movements. We briefly describe an architecture for such a simulator and then concentrate on five special problems which arise: scheduling movements which occur concurrently, computing motion of three-link chains, processing contacts, moving the center of gravity and maintaining balance, and adjusting limb twist for a standard orientation.
An architectural alternative to optimizing compilers
Authors: Samuel P. Harbison
Venue: ACM SIGARCH Computer Architecture News (1982)

Programming languages are designed to make programming productive. Computer architectures are designed to make program execution efficient. Although architectures should be designed with programming languages in mind, it may be as inappropriate to make the computer execute the programming language directly it is to make the programmer use machine language. It is the compiler's job to match the programming language and the computer architectures, and therefore making compiler's efficient and easy to write are important design goals of a complete hardware/software system. This paper summerizes research completed in 1980 [5] on a computer architecture, TM, that takes over some of the more burdensome tasks of optimizing compilers for high-level-languages (HLL's), performing these tasks dynamically during the execution of the object program. This is a different approach to making compilers efficient than is commonly taken; more common approaches include devising more efficient optimization algorithms[I], being clever about when to do optimizations [4], and building the compilers semiautomatically [6].
Policy/mechanism separation in Hydra
Authors: R. Levin, E. Cohen, W. Corwin, F. Pollack, W. Wulf
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

The extent to which resource allocation policies are entrusted to user-level software determines in large part the degree of flexibility present in an operating system. In Hydra the determination to separate mechanism and policy is established as a basic design principle and is implemented by the construction of a kernel composed (almost) entirely of mechanisms. This paper presents three such mechanisms (scheduling, paging, protection) and examines how external policies which manipulate them may be constructed. It is shown that the policy decisions which remain embedded in the kernel exist for the sole purpose of arbitrating conflicting requests for physical resources, and then only to the extent of guaranteeing fairness.
Isomorphism of graphs with bounded eigenvalue multiplicity
Authors: László Babai, D. Yu. Grigoryev, David M. Mount
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

We investigate the connection between the spectrum of a graph, i.e. the eigenvalues of the adjacency matrix, and the complexity of testing isomorphism. In particular we describe two polynomial time algorithms which test isomorphism of undirected graphs whose eigenvalues have bounded multiplicity. If X and Y are graphs of eigenvalue multiplicity m, then the isomorphism of X and Y can be tested by an O(n4m+c) deterministic and by an O(n2m+c) Las Vegas algorithm, where n is the number of vertices of X and Y.
A bull's eye view of management and engineering information systems
Authors: Anthony G. Oettinger
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Prophets of doom are apt to misquote Vannevar Bush's statement that -and-ldquo;The investigator is staggered by the findings and conclusions of thousands of other workers -and-mdash; many of which he cannot find time to grasp, much less to remember, as they appear.-and-rdquo; (3) They then extrapolate to such shrill exaggerations as -and-ldquo;The enormous gap in our capacity to store and retrieve information and at the same time meet the demands and responsibilities in our society has created the most costly and wasteful drain on our resources, which is without parallel in the entire history of mankind.-and-rdquo;(4) A milder point of view is reflected in the statement that -and-ldquo;It is certainly not true that the world is about to go to the dogs or to suffocate in its information flood unless information processing is mechanized or otherwise totally overhauled. There is, of course, no doubt that information processing, like any other conceivable human activity, could be improved.-and-rdquo;(5)
Using an oracle to measure potential parallelism in single instruction stream programs
Authors: Alexandru Nicolau, Joseph A. Fisher
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

Horizontally microprogrammable CPUs belong to a class of machines having statically schedulable parallel instruction execution (SPIE machines). Several experiments have shown that within basic blocks, real code only gives a potential speed-up factor of 2 or 3 when compacted for SPIE machines, even in the presence of unlimited hardware. In this paper, similar experiments are described. However, these measure the potential parallelism available using any global compaction method, that is, one which compacts code beyond block boundaries. Global compaction is a subject of current investigation; no measurements yet exist on implemented systems. The approach taken is to first assume that an oracle is available during compaction. This oracle can resolve all dynamic considerations in advance, giving us the ability to find the maximum parallelism available without reformulation of the algorithm. The parallelism found is constrained only by legitimate data dependencies, since questions of conditional jump directions and unresolved indirect memory references are answered by the oracle. Using such an oracle, we find that typical scientific programs may be sped up by anywhere from 3 to 1000 times. These dramatic results provide an upper bound for global compaction techniques. We describe experiments in progress which attempt to limit the oracle progressively, with the aim of eventually producing one which provides only information that may be obtained by a very good compiler. This will give us a more practical measure of the parallelism potentially obtainable via global compaction methods.
Interactive design of visual aids
Authors: Frederic I. Parke, Frank R. Koperda
Venue: Proceedings of the 1977 annual conference (1977)

The implementation of an interactive design tool using computer graphics techniques to produce high quality visual aids is described. The generated two-dimensional shaded images are composed of both pre-defined and user-defined opaque shapes used in conjunction with character strings. The user interface is simple and easy to use. User interaction is primarily via a large data tablet used to specify shapes and control image manipulation. The system alleviates many of the tedious mechanical aspects of visual aid production and allows concentration on the more creative aspects. There is immediate visual feedback for all actions. Implementation was done using a graphics extented Algol-60 in conjunction with an interactive real-time shaded graphics system. This operational system has produced a number of visual aids including those accompaning this paper.
The tight deterministic time hierarchy
Authors: Martin Fürer
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Let k be a constant -&-ge; 2, and let us consider only deterministic k-tape Turing machines. We assume t2(n) -&-gt; n and t2 is computable in time t2. Then there is a language which is accepted in time t2, but not accepted in any time t1 with t1(n) -&-equil; o(t2(n)). Furthermore, we obtain a strong hierarchy (isomorphic to the rationals Q) for languages accepted in fixed space and variable time.