ppxscal/embedding_network huggingface dataset:
SIGBDP 9 structure of future systems (Panel Discussion)
Venue: Proceedings of the 1975 annual conference (1975)

At least three perhaps contradictory trends can be observed in computer installation. One is the move to larger, more powerful centralized systems serving a wide geographic range of users through time sharing, remote job entry, and remote on-line access generally. The other is distributed processing in which the hardware is dispersed to remote sites for local use. A third is distributed processing in the sense of multiple CPU's linked functionally into a single multiprocessing configuration in which one CPU handles I/O, another does file handling, and still others the applications programs. All of these can and have been joined. But the next five years may see further shifts caused by technical or economic trends in the computer industry, communications carriers, or associated industries. Each of the three speakers will represent one of these trends.
Using tours and demonstrations for orienting new users
Authors: Nancy H. Morgan, David Weible
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Each year the computer center acquires new computer users. These users may be faculty, staff, and students who come from other institutions where the computer center was an important resource tool. An important part of any orientation of new computer users is familiarity with the type and location of the various computer services offered. Our experience has been one in which users become acquainted with the computer center through special orientation programs at the beginning of the school year, an Open House in mid-semester, and spur-of-the-moment tours requested perhaps no more than a day or two in advance. This paper describes our experiences with tours and demonstrations in each of the three areas: orientation programs, Open House, and &ldquo;on request&rdquo; tours, and our thoughts about what we have done.
DRAW(IT)N - a computer graphics education package
Authors: Paul A.V. Thomas
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

DRAW(IT)N is a package of four similar interpretive programmes used in teaching computer graphics. The four programmes, each consisting of a Fortran interpreter and subroutines, permits the definition and manipulation of 2-dimensional or 3-dimensional objects in a batch or interactive mode; further-more objects as instances may be grouped in sub-assemblies and assemblies in a hierarchial manner. In each case the output may be plotted on a standard plotter or CRT display unit; also an approximate drawing may be obtained on a line printer or CRT alphanumeric terminal, particularly for debugging purposes. Due to the nature of the programmes, modifications are readily made, that is, subsets can be used or additional commands added. Furthermore, being written in Fortran, the programmes are transportable and in fact have already been run on two different types of computer.
Traffic Monitoring in Motorways by Real-Time Number Plate Recognition
Authors: Paolo Castello, Christopher Coelho, Enrico Del Ninno, Ennio Ottaviani, Michele Zanini, Elsag S. p. A.
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The problem of traffic monitoring in motorways by the number plate recognition of all moving vehicles is addressed. The proposed system is composed by local processing units positioned near the motorway accesses, connected by radio link to a central control station. In the local units we process each frame of the video sequence in order to extract character information and to merge them in a temporal post-processing step. This ensures that most of recognition errors may be recovered during the permanence of the vehicle inside the camera field of view. Moreover, there is no need for an external device to trigger image acquisition, because the whole video sequence is processed. If the recognized number plate is contained into a predefined list, an alarm signal is generated. All number plates are locally stored for further search operations by the authorities. The central control station gathers alarms from the connected processing units and is responsible for the updating and the broadcasting of the list of number plates to be searched.
Beyond the data processing horizon
Authors: Carl Hammer
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The transition to the post-industrial society is characterized by the introduction of electronic computer-communication systems whose mind- amplifying powers have made data and information our most precious resource. Realtime services provide knowledge workers with access to powerful information systems, in offices, factories, laboratories, class rooms and even the home. Spectacular hardware progress has been attributed to the &ldquo;miracle of the chip&rdquo;. We find such chips at the heart of computers, communication devices, and input/output peripherals with whose help we perform such functions as packet-switched communications, distributed data bases, and computer networking. Powerful software engineering tools brought into existence new and improved programming languages, powerful computer operating systems, and a plethora of applications programs. These advances have also created problems. As the data trail grew, citizens voiced their concern about privacy protection of these data. Computer security and the design of trusted computer bases are expected to stem the rising tide of reported &ldquo;computer crimes&rdquo;. Electronic Funds Transfer Systems are used to move astronomical sums of &ldquo;virtual money&rdquo; over worldwide networks; &ldquo;virtual books&rdquo; and other electronic communications are being read widely and instantaneously without the need for hard copy; mechanical slide rules and mechanical watches have gone the way of the Dodo Bird after being replaced by their electronic offspring. Their is even talk of impending changes in the structures of our institutions as a consequence of the pervasive transfer of this new technology into the hands of everyone.
Systems analysis perspectives
Authors: Thomas I. M. Ho
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

It is widely recognized that the systems analyst's task is a formidable one. To perform his duties, the systems analyst must rely upon a broad array of disciplines. In particular, he must be familiar with the intricacies of two diverse worlds: that of the organization and that of the computer. Aside from the obvious size and complexity of these concerns, the contrast between these two ends of the spectrum is most striking. On one hand, the organization is qualitative and unstructured. On the other hand, the computer is technical and rigid. Therefore, it is no surprise to anyone that we have had difficulty with the application of computing technology to the information systems of organizations.
Design of self-checking software
Authors: S. S. Yau, R. C. Cheung
Venue: Proceedings of the international conference on Reliable software (1975)

This paper discusses different techniques for constructing a piece of self-checking software for systems where ultra-reliability is required. Self-checking software can be designed to detect software errors, to locate and to stop the propagation of software errors, to assist in the recovery from errors and to verify the integrity of the system. Self-checking techniques can be implemented in the program to check the function, the control sequence and the data of a process. The functional aspects of a process can be monitored to detect infinite loops, incorrect loop terminations, illegal branches and wrong branches. The validity of data of a process can be assured by performing checks on the integrity of data values, the integrity of data structures and the nature of data values. These self-checking capabilities should be implemented during the initial stage of program development. The cost-effectiveness of each technique in the particular operating environment should be evaluated. Only the most cost-effective techniques should be retained and overhead can be reduced considerably by implementing these techniques in hardware.
Hashing LEMMAs on time complexities with applications to formula manipulation
Authors: Eiichi Goto, Yasumasa Kanada
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In this paper, time complexities of operation on &ldquo;sets&rdquo; and &ldquo;ordered n-tuples&rdquo; based on a hashing table search technique are presented as &ldquo;Hashing LEMMAs&rdquo; and are applied to formula manipulation. Unique normal forms for multivariate symbolic formulas resulting in O(1) time complexity for identity checks are presented. The logarithmic factor log2N, characteristic to sorting algorithms, is shown to all disappear from time complexities of polynomial manipulations. Actual implementation of the hashing technique is outlined and actual timing data are presented in the appendix.
Some deadlock properties of computer systems
Authors: Richard C. Holt
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

First, a &ldquo;meta theory&rdquo; of computer systems is developed so that the terms &ldquo;process&rdquo; and &ldquo;deadlock&rdquo; can be defined. Next, &ldquo;reusable resources&rdquo; are introduced to model objects which are shared among processes, and &ldquo;consumable resources&rdquo; are introduced to model signals or messages passed among processes. Then a simple graph model of computer systems is developed, and its deadlock properties are investigated. This graph model is useful for teaching purposes, unifies a number of previous results, and leads to efficient deadlock detection and prevention algorithms.
Prefilters over an arbitrary Boolean Algebra
Authors: Ira Howard Sack
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

We define the notion of a prefilter and then proceed to characterize the lattice of prefilters over an arbitrary Boolean Algebra. The lattice theoretic terminology can be found in Gr&auml;tzer [5] and [6]. In the second section we further investigate the pseudo-prefilter consequence that was defined by Bloom [ ]. We consider arbitrary prefilter matrices and prove a completeness theorem (Theorem 4 of Section II). Our logical terminology is that of Brown and Suszko [4].
Helping users help themselves
Authors: Mildred S. Joseph
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

This paper discusses how user's can help themselves. In order to help users help themselves, consultants must first examine and redefine their primary responsibilities.
Alternatives to the traditional first course in computing
Authors: John G. Meinke, John A. Beidler
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The first course in Computer Science at the University of Scranton has evolved over a number of years as a course in problem solving utilizing the computer. Bearing in mind that such a course should provide relatively standard programming tools, the course uses a structured derivative of FORTRAN promoting top-down stepwise refinement in programming methodology as well as encourages the utilization of &ldquo;packaged programs&rdquo;. We now have a course that provides a solid foundation for computer science majors as well as offers an excellent introduction to computing to those students for whom the course has a service purpose. This has been accomplished with a minimal faculty at a small university.
Architecture of a massively parallel processor
Authors: Kenneth E. Batcher
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

The massively parallel processor (MPP) system is designed to process satellite imagery at high rates. A large number (16,384) of processing elements (PE's) are configured in a square array. For optimum performance on operands of arbitrary length, processing is performed in a bit-serial manner. On 8-bit integer data, addition can occur at 6553 million operations per second (MOPS) and multiplication at 1861 MOPS. On 32-bit floating-point data, addition can occur at 430 MOPS and multiplication at 216 MOPS.
Architectural flexibility in microprogramming
Authors: Piero A. Biga, Enrico C. Grillo, A. E. Werbrouck
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

Several advantages of the architectural flexibility inherent in microprogramming are given as exemplified in the design of a floating point processor for small computers. Principally these include residual programming to provide two and four-way branches in any instruction, multiple destination moves, and context-dependent shifts.
Generalized fair termination
Authors: Nissim Francez, Dexter Kozen
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

We present a generalization of the known fairness and equifairness notions, called @@@@-fairness, in three versions: unconditional, weak and strong. For each such version, we introduce a proof rule for the @@@@-fair termination induced by it, using well-foundedness and countable ordinals. Each such rule is proved to be sound and semantically complete. We suggest directions for further research.
Course content for computer science at the secondary school level
Authors: Jean B. Rogers
Venue: ACM SIGCSE Bulletin (1984)

A review of a preliminary report by the Task Group on Secondary School Computer Science, working under the ACM Elementary and Secondary Schools Subcommittee.
Can C.A.D. meet the VLSI design problems of the 80's?(Panel Discussion)
Authors: David Gibson
Venue: Proceedings of the 16th Design Automation Conference (1979)

VLSI technology is rapidly approaching a million devices per &ldquo;random&rdquo; logic chip. The potential complexity of such chips will exceed the ability of humans to organize and layout the silicon, and bring out a product in a competitive and timely market position. Traditional computer aided layout techniques will flounder and low layout densities and/or excessive computer costs, and the fast changing technology will obsolete all library data almost as soon as it is used (or before).
APL function variants and system labels
Authors: David A. Rabenhorst
Venue: ACM SIGAPL APL Quote Quad (1983)

While APL extensions are adding power to the language by generalizing and adding operators, the necessity of defining additional attributes of functions is becoming increasingly visible and no longer ignorable. This paper describes the function variant problem, and proposes a solution by introducing the concept of system labels. Three system labels are described: (@@@@)ID for the identity function, (@@@@)INV for the inverse function, (@@@@)FL for the fill function.
Minimization of supervisor conflict for multiprocessor computer systems
Authors: Randy J. Raynor, John M. Gwynn,  Jr.
Venue: ACM SIGSIM Simulation Digest (1976)

In a multiprocessor system, the handling of interrupts generated by jobs in the processors is assigned to a supervisory program and associated data base. The two basic philosophies for deciding which processor executes the supervisor are master-slave and floating executive control. In either case, queueing of requests to the supervisor may occur. With the master-slave structure, the master processor can handle only one request at a time. With floating executive control, while any processor can execute the supervisor, only one processor at a time can be allowed to access the supervisor's data base. A processor which is waiting to use the supervisor is not doing useful work. Therefore, queueing of requests to the supervisor causes a degradation in the performance of the system. Previous studies have indicated that this degradation is significant for systems with a large number of processors. A methodology is developed through simulation which reduces supervisor queueing by scheduling jobs to processors such that they request the use of the supervisor when the supervisor is predicted to be available. Information concerning job execution characteristics required by the scheduler is shown to be available at sufficient accuracy via dynamic monitoring and forecasting during normal program execution.
From teaching-machine to automatic tutor: The changing man-machine interface
Authors: Jurg Nievergelt, Thomas R. Wilcox
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

A steadily increasing fraction of human activities involves interacting with machines, and this interaction will become more sophisticated as more and more machines in our environment are controlled by computers. As the degree of sophistication of this interaction increases, its quality becomes more important. This is particularly true in computer-based education where a student is expected to learn something by interacting with a machine for an extended period of time. Quality of interaction has various aspects. The most obvious is the physical properties of the man-machine interface: to what extent does the machine allow the human senses of sight, sound, touch to come into play? Early teaching machines were at best suitable for rote training tasks in restricted applications. Only recently have computer terminals been developed whose physical properties make this interface suitable for computer-based education in a wide variety of subject areas. All indications are that rapid progress will continue, particularly in the important aspect of reduced costs.
A system for multilayer printed wiring layout
Authors: R. L. Calafiore, J. C. Foster
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The task of routing large multilayer printed wiring boards (most commonly back-planes) is a tedious, time-consuming and error-prone procedure if done manually. The size and general uniformity of the board plus the large number of connections makes the probability of error very high. To aid this process, an interactive graphics system has been built. Because of the specialized nature of the problem, it was both necessary and possible to build the program in such a way as to allow the interactive graphics terminal to be a true design station instead of just an efficient data capture station.
Improved operational techniques in the simulation of a missile autopilot
Authors: Y K Chang, P V Rao
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

A realistic and relatively complex model of a missile autopilot is simulated using improved operational methods. The Direct Substitution with Digital Compensation (DSDC) method is an improvement over conventional substitution techniques [3]. Another new technique, the Split T-integrator which opens new ground to very accurate simulation of complex systems is also presented.
Improved Entropic Edge-Detection
Authors: J. Gómez Lopera, N. Ilhami, P. Luque Escamilla, J. Martínez Aroza, R. Román Roldán
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Using the Jensen-Shannon divergence of grey level histograms obtained by sliding a double window over an image, an edge-detector is presented. A new technique for linking unconnected edge points, based on estimated directions, is also described. The method is suitable for textured images and has proved to be fairly robust in the presence of impulsive noise or spurious patterns. An application to images of Diesel spray injection is shown, that may be used to improve combustion in Diesel motors.
DAMN - a prototype program for the Dynamic Analysis of Mechanical Networks
Authors: Milton A. Chace
Venue: Proceedings of the 7th Design Automation Workshop (1970)

Effective computer-aided design of engineering systems requires comprehensive computer applications software which conveniently adapts to the particular engineering design considered. This paper discusses initial experience with a program of this kind intended for computer-aided design of machine-like mechanical systems, and outlines the use of a time-shared graphic terminal for schematic display of program output. This paper is a successor to one presented at the 1969 Design Automation Workshop1 in which the motivation, definition, and essential methods were outlined.
TOP-DOWN systems design
Authors: Ray D. Wheeler
Venue: Proceedings of the 1979 annual conference (1979)

Effective systems design is premised upon a thorough knowledge of the whole system. Such knowledge can best be acquired by gaining insight via an hierarchical approach. Logically, this should begin at the highest level and proceed downward because this is how a system is conceived. This viewpoint will be reinforced by a more detailed consideration of the TOP-DOWN approach highlighting the advantages and reconciling the disadvantages as perceived by this author.
A new approximate graph coloring algorithm
Authors: Avi Wigderson
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Let A be a graph coloring algorithm. Denote by -&-Agrave; (G) the ratio between the maximum number of colors A will use to color the graph G, and the chromatic number of G,x(G). For most existing polynomial coloring algorithms, -&-Agrave;(G) can be as bad as O(n), where n is the number of vertices in G. The best currently known algorithm guarantees -&-Agrave; (G)-&-equil;O(n/logn). In this paper we present a simple and efficient coloring algorithm which guarantees -&-Agrave;(G)-&-le;x(G)n (equation), a considerable improvem-&-edot;nt over the current bounds.
On the necessary evolution towards improvement specialization in software production teams
Authors: J. Bézivin, F. Gauduel, J. L. Nebut, R. Rannou
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

Human aspects are an essential element in the software production cycle. This has been widely recognized and several proposals such as the &ldquo;chief programmer team&rdquo; have proved their effectiveness as methodologies to produce high quality software at a lower cost. In this paper we investigate the possible short term implications of recent technological and methodological evolution on the basic structure of software production groups.
Performance of a DECnet based disk block server
Authors: Rollins Turner, Jeffrey Schriesheim, Indrajit Mitra
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

This report describes an experimental disk block server implemented for the RSX-11M Operating System using DECnet. The block server allows user programs on one system to access files on a disk physically located on a different system. The actual interface is at the level of physical blocks and IO transfers. Results of basic performance measurements are given, and explained in terms of major components. Performance predictions are made for servers of this type supporting more complex workloads.
Computing in the community colleges&mdash;fact and fancy
Authors: Herbert D. Peckham
Venue: Proceedings of the ACM annual conference (1973)

A realistic look at the economics, hazards and possibilities of the computer in the community college as viewed from a small, remote college actively involved with curriculum applications of the computer.