ppxscal/embedding_network huggingface dataset:
User behavior patterns in the Electronic Information Exchange System
Authors: Murray Turoff, Starr Roxanne Hiltz
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The Electronic Information Exchange System (EIES) is a computerized conferencing system intended to allow both the facilitation of scientific and technical communications and experimentation and research into human information-communication cognitive processes. To meet the first objective EIES offers functional components of messaging, conferencing, notebooks and bulletins for its users. To meet the second objective EIES allows for the tailoring of interfaces by individuals and groups, and the incorporation of special processing and interconnect options to other computer and information systems. EIES is designed as a research tool or laboratory without walls in order to allow information scientists and those in related fields to observe, evaluate, experiment with and investigate the utilization of such systems by individuals and groups.
A survey of the use of audio-visual materials in user and staff training
Authors: Doris R. Waggoner, Denise Kervin
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

Audio-visual materials for training have found wide use in many disciplines. How widely used are they for user and staff training by academic computing centers? On what subjects have media products been created? What leads computing centers to use media&mdash;or not to use media? To investigate such questions, the Academic Computing Center at the University of Wisconsin-Madison surveyed a random sample of 200 academic computing centers. Our first goal was to gather information to help us decide what if anything we wanted to do with media in our training program. Our second goal was to provide for other computing centers information that might help them make their own decisions on media use.
Recent progress in the performance evaluation of fundamental allocation algorithms
Authors: E. G. Coffman,  Jr.
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

Our understanding of several allocation algorithms basic to operating systems and to data base systems has improved substantially as a result of a number of research efforts within the past one or two years. The results have stirred considerable excitement in both theorists and practitioners. This is not only because of the inroads made into long-standing problems, but also because of the surprising nature of the results; in particular, we refer to proofs that certain classical algorithms described as approximate are in fact optimal in a strong probabilistic sense. The work discussed here will be classified according to the application areas, archival and dynamic storage allocation. In both cases we are concerned with the packing problems that arise in making efficient use of storage. Equivalents of the archival problems also have importance in scheduling applications [4]; however, we shall focus exclusively on the storage allocation setting.
Patchable control store for reduced microcode risk in a VLSI VAX microcomputer
Authors: Richard E. Calcagni, Will Sherwood
Venue: ACM SIGMICRO Newsletter (1984)

A VLSI VAX microcomputer, which implements the native VAX computer architecture and instruction set, uses 16K by 40 bits of ROM control store. To decrease the cost of making changes to released microcode, the hardware supports a patching mechanism whereby control flow can be switched between the read-only control memory and a smaller writable control memory. This paper describes the system design considerations that led to the development of the patchable control store, actual implementation of the control store, the effectiveness of the patching scheme, and its impact on system performance.
Introduction to SIMAN
Authors: C. Dennis Pegden
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper discusses the concepts and methods simulating manufacturing systems using the SIMAN simulation language. SIMAN is a new general purpose simulation language which incorporates special purpose features for modeling manufacturing systems. These special purpose features greatly simplify and enhance the modeling of the material handling component of a manufacturing system.
Modules for standard ML
Authors: David MacQueen
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

The functional programming language ML has been undergoing a thorough redesign during the past year, and the module facility described here has been proposed as part of the revised language, now called Standard ML. The design has three main goals: (1) to facilitate the structuring of large ML programs; (2) to support separate compilation and generic library units; and (3) to employ new ideas in the semantics of data types to extend the power of ML's polymorphic type system. It is based on concepts inherent in the structure of ML, primarily the notions of a declaration, its type signature, and the environment that it denotes.
The future for user services
Authors: A. Faye Borthick
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

User Services is firmly entrenched in computing, and it is now time to consider the prospects for its future. That is, what functions will User Services continue to support and what new functions will be added? How will these functions change and in what ways? What must computing professionals in User Services do to prepare themselves for the years ahead? Will the training that is available today be adequate for insuring the growth of computing professionals for User Services over the next decade? This paper explores some of the assumptions that are being made now about the place of computing and technology. With an understanding of the direction of computing technology and societal concerns affecting technological endeavors, User Services people should be able to answer the questions for their own installations.
Finding euler circuits in logarithmic parallel time
Authors: B. Awerbuch, A. Israeli, Y. Shiloach
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

A parallel algorithm for finding Euler circuits in graphs is presented. Its depth is log |E| and it employs |E| processors. The computational model considered is the PRAM (the shared memory model). This algorithm is a nice example of utilizing another parallel algorithm that does not seem to be closely related to our problem, namely the algorithm for finding the connected components and a spanning forest of an undirected graph.
An experiment in architectural instruction
Authors: Robert W. Dvorak
Venue: Proceedings of the 15th Design Automation Conference (1978)

The College of Architecture at the University of Arizona uses the Plato computer to teach freshman basic drawing skills. The purpose of this paper is to describe how computer-aided instruction was designed and used in the Graphics Communications class and to relate the students' reaction to this experience.
Automatic test generation for stuck-open faults in CMOS VLSI
Authors: Yacoub M. Elziq
Venue: Proceedings of the 18th Design Automation Conference (1981)

Because of its relative low power dissipation, intermediate speed, and high density, CMOS (Complementary Metal Oxide Semiconductor) will emerge as one of the leading VLSI technologies. Therefore, testing CMOS VLSI circuits is very important. The conventional stuck-at fault assumptions are not sufficient for modeling some faults that are peculiar to CMOS circuitry, specifically the stuck-open faults. These faults are sequential in nature. This means that when a fault occurs in a combinational circuits, the circuit behaves as a sequential circuit. Therefore, special test pattern generation techniques are necessary to test this type of faults. In this paper, we present an algorithm which uses the conventional stuck-at list to detect some stuck-open faults. Some modifications of the conventional testing procedure are necessary. Such modifications and their associated programming effort are expected to be straight forward. For the stuck-open faults that cannot be detected by the conventional stuck-at test list, a second algorithm is descirbed that generates the tests for such faults. The algorithm generates the test if such a test exists. If not, the fault is declared as undetectable. First, we will discuss the stuck-open fault and its peculiarity to CMOS circuitry. Second, we will describe the step-by-step algorithms used to generate a complete test list for this type of fault. Finally, a small example circuit will be used to illustrate the new test generation technique and some conclusive remarks will be given.
Algorithms for a self-tuning microprogrammed computer
Authors: K. A. El-Ayat, J. A. Howard
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

Manual tuning techniques are widely applied but are generally slow, costly and require a great deal of expertise. This paper addresses the problem of automatically tuning the virtual architecture of a microprogrammed computer by microprogramming techniques. Two algorithms are presented to automate the tuning process. The algorithms are implemented on the same dynamic microprogrammed computer that executes the given application. After execution of the program the algorithms are invoked and a tuning iteration performed on the architecture and the program. Several tuning iterations are performed with different data sets over a period of time to select the optimized architecture. It is demonstrated that individual code segments experience a 2-8 speed improvement over their corresponding non-tuned versions, while the overall execution time of the program is reduced by 30-45%. The computational requirements of the algorithms are shown to be very modest.
The complexity of priority queue maintenance
Authors: Mark R. Brown
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

A notion of priority queue efficiency is defined, based on comparison counting. A good lower bound on the average and worst case number of comparisons is derived; several priority queue algorithms are exhibited which nearly attain the bound. It is shown that one of these algorithms, using binomial queues, can be characterized in a simple way based on the number and type of comparisons that it requires. The proof of this result involves an interesting problem on trees for which Huffman's construction gives a solution.
A heuristic method for optimizing an intercity data transmission network
Authors: Rodolfo A. Pazos
Venue: Proceedings of the seventh symposium on Data communications (1981)

This paper deals with the problem of finding the minimum cost flow pattern for a large intercity data transmission network which provides private lines between pairs of cities and which is subject to capacity constraints. This problem can be formulated as a minimum cost multicommodity flow problem. The most efficient linear and integer programming approaches yield programs with memory requirements proportional to the square of the problem size, making impractical their use for large scale problems. In this paper a heuristic method is described which produces suboptimal solutions with smaller execution time requirements, and memory requirements linear with the problem size. Experimental results are presented comparing the proposed method with a Linear Programming approach.
Productivity expectations in the level of COBOL programming for business (Panel Discussion)
Authors: James E. Benjamin, Marjorie Leeson, James Linderman
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

The key to almost every business-oriented computer program is the sequence of programming courses in the major language utilized in that geographic area. The overall major language, based on almost every computer survey, has been COBOL. With the availability of COBOL on micro-computers that utilization will probably increase. With the industry concerns on the depth of programming knowledge of graduates, the major programming sequence should be at a level consistent with the needs of the business/industry served.
An improved switch-level simulator for MOS circuits
Authors: Vijaya Ramachandran
Venue: Proceedings of the 20th Design Automation Conference (1983)

The notion of a well-designed circuit is introduced, and improvements are presented to the earlier switch-level simulators of Bryant [B80] and Lipton, Sedgewick, and Valdes [LSV81], so that race conditions can be detected, and undefined values can be handled in a clean and simple way in these circuits.
The architecture of a database computer - a summary
Authors: David K. Hsiao, Krishnamurthi Kannan
Venue: ACM SIGARCH Computer Architecture News (1977)

The motivation for seeking hardware solutions to database management functions traditionally carried out by software has been apparent to data-base designers for sometime now. Firstly, database management software has grown in complexity and size over the years. This growth is prompted by the increase in user requirements, by the formulation of sophisticated models and by the change in data processing mode from an off-line, batched, single user environment to an on-line, concurrent and multi-user environment. Large and complex software systems tend to be failure-prone. Further-more, practical verification methods for software systems are still not in sight. On the other hand, methods for verifying hardware functionality, design and production have long been available. Advanced technology has also overcome some of the problems of the logic complexity and capacity requirements, making the construction of relatively large and complex computers viable. By incorporating basic database management functions into hardware, not only can we provide more reliable basic functions, but we can also improve the software reliability since the software requirements will be less complex and the system software will be smaller in size.
An automated management system for applications software
Authors: John Jacobsen
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

The Applications Group at the Academic Computing Center maintains approximately 100 applications software products on our CDC 170/750 Cyber computer. We also maintain some 30 products on each of five instructional Digital Equipment VAXes. Most of these we receive from vendors, some have been developed locally, and some of these we distribute to other sites. In order to manage the workload, we have developed over a period of time an automated product management system, which we call Hellas. The basic philosophy behind Hellas is that a software maintenance system will be successful if it is simple to use, has a straight-forward methodology, and fits our computing system management requirements. For the most part, this paper will describe the Hellas system as it is implemented on the Cyber computer. The features, however, have their analogs on the VAX computers as well.
Presidents' forum: Current issues in Computer Graphics
Authors: Donald Feddersen, Ralph T. Linsalata, Peter Preuss, Richard N. Spann
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

Computer Graphics has been an integral part of the computer environment since the mid-1950's with origins in military, academic and industrial applications. Presidents of several leading computer graphics companies will discuss some of the issues they see facing this dynamic industry. One president believes that the 1980's will belong to the systems integrators because of the rapid rate of change in both technology and the competitive environment. Vertical integration will not be a successful strategy for the 1980's. Another president is concerned that industry research analysts are misusing the term &ldquo;CAD/CAM&rdquo; and that, in fact, most of today's CAD/CAM systems are simply productive drafting systems. He is concerned about the confusion between realistic pictures and solid modelling and about the proper mix of functionality and interactivity. Still another president believes the crucial issues in computer graphics are those that concern users; those that have access to the tools and those of future development of hardware and software to meet their needs. He suggests that only about one to five percent of the potential users have adopted computer graphics. He is concerned about providing increased access to computer graphics facilities and about removing the widespread psychological barrier of &ldquo;I can't use the computer to do what I want!&rdquo;. Other current issues will also be addressed.
The use of APL in management education
Authors: Ephraim R. McLean
Venue: Proceedings of the sixth international conference on APL (1974)

With the growing demand for managers trained in the use of the computer as an aid in problem-solving, particularly in a conversational interactive mode, the Graduate School of Management at the University of California, Los Angeles, has turned to the use of APL to provide this capability. A short course in APL, given to all incoming M.B.A. students in the Fall of their first year, has proved to be an effective vehicle in providing a base for this subsequent use. Although some educators argue that BASIC is a more logical choice as a beginning language for business students, a number of reasons are offered why APL was chosen instead of BASIC. Also, several specific applications of APL to management topics are described.
Electronic computer applications in urban transportation planning
Authors: Ralph E. Schofer, Franklin F. Goodyear
Venue: Proceedings of the 1967 22nd national conference (1967)

The transportation planning process is a set of analytical techniques used to forecast future transportation requirements and to evaluate proposed systems. While some of the techniques described in this paper can be used in the solution of current problems, the primary concern is with the problems of long-range planning. The following sections of this paper describe a transportation planning process. The process described is one that is widely (but not exclusively) used for urban transportation studies in the United States. This collection of survey techniques, analysis methods, and computer programs which makes up the process, has been developed over the past two decades by hundreds of researchers from diverse fields. This research and planning activity has been supported by the communities for which studies have been made, state highway departments, the Bureau of Public Roads, and the Department of Housing and Urban Development. While improvements in the methodology continue to be made, and are necessary if better techniques are to be developed, the process seems to have been somewhat standardized in the form presented.
Score '82 - a summary (at IBM systems research institute, 3/23-3/24/82)
Authors: John E. Gaffney,  Jr.
Venue: ACM SIGMETRICS Performance Evaluation Review (1982)

&ldquo;Score '82&rdquo;, the first workshop on software counting rules, was attended by practitioners who are working with &ldquo;software metrics&rdquo;. The concern was with methodologies for counting such software measurables as the number of &ldquo;operators&rdquo;, &ldquo;operands&rdquo; or the number of lines of code in a program. A &ldquo;metric&rdquo; can be a directly countable &ldquo;measurable&rdquo; or a quantity computable from one or several such &ldquo;measureables&rdquo;. &ldquo;Metrics&rdquo; quantify attributes of the software development process, the software itself, or some aspect of the interaction of the software with the processor that hosts it. In general, a &ldquo;metric&rdquo; should be useful in the development of software and in measuring its quality. It should have some theory to support its existence, and it should be based on actual software data. This workshop was concerned principally with the data aspects of &ldquo;metrics&rdquo;, especially with the rules underlying the collection of the data from which they are computed.
The small computer: Pro and con
Authors: Aaron Konstam
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

A university computing center is unique in the diversity of users it supports. It must serve the research and instructional needs of the faculty as well as the information processing needs of the college administrators. Each type of user makes different demands on a computer installation, and for each type of user a different computer system would be best suited. To a faculty member, easy access to the computer by means of terminals and time sharing would be far more desirable than faster memory cycle time or speed of input-output. Administrators would shutter at being required to transfer information in and out of a computer at terminal speeds. Few commercial computer service bureaus are faced with users less compatible from a computer service point of view. These incompatibilities, as well as the companion problem of service priorities, are continually plaguing the university computer center. The computer center director faced with this diversity of needs is continually performing his juggling act of services so as to offend the fewest people, and periodically he is confronted with the problem of choosing equipment to optimize his services. In this paper we discuss the advantages and disadvantages of the use of a small computer to handle the diverse needs present in the college environment. In particular, we will treat the question of the use of a small computer to meet the computing needs of the small liberal arts college.
A hardware assisted design rule check architecture
Authors: Larry Seiler
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes an architecture for design rule checking that uses a small amount of special purpose hardware to achieve a significant speed improvement over conventional methods. A fixed grid raster scan algorithm is used that allows checking of 45&deg; angled edges at a modest cost in performance. Operations implemented directly in hardware include width checks, edge condition checks, boolean operations on masks, and shrinking and expansion of masks. Hardware support for rasterization is also provided. Software in a controlling processor handles all geometric data manipulation. This architecture should be able to check a simple set of design rules on a 300 mil square layout in one and one half minutes, if the controlling processor can provide data quickly enough. Layouts have been completed for two of four custom chips used in this architecture, and one has been fabricated and proven functional.
A placement algorithm for polycell LSI and ITS evaluation
Authors: T. Kambe, T. Chiba, S. Kimura, T. Inufushi, N. Okuda, I. Nishioka
Venue: Proceedings of the 19th Design Automation Conference (1982)

An automatic placement algorithm for standard cell and polycell LSI is described, which is constructed on the basis of heuristics for a set of interrelated placement subproblems. The algorithm is incorporated into a hierarchical layout system intended not only for standard cell and polycell LSI but for general cell LSI, by which standard cell and polycell LSI have begun to be laid out in practice. A part of implementation results are also shown to reveal how high the layout performance of the placement program.
The undesirability of rigid standards for programming languages
Authors: Richard K. Ridgway
Venue: Proceedings of the 1967 22nd national conference (1967)

It is my primary purpose to show that while it is possible to develop a neat, tight, rigorous, standard definition of a programming language, it is not desirable to do so for economic reasons. Some of the problems will be sketched and an attempt will be made to give some of the flavor of the considerations involved.