ppxscal/embedding_network huggingface dataset:
Short Courses: Using video-tapes for instructor's self evaluation
Authors: Margaret Baker
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

Computing Services at the University of California, Berkeley presents a wide variety of Short Courses each quarter. We cover CMS and UNIX, a number of program products, and installation-specific general information. Last Spring Quarter we presented 24 courses ranging in length from 2 hours to 9 hours. They were attended by about 650 people. The instructors are members of our Consulting staff and of our Applications Software Group. The demand for these courses far outstrips our ability to provide instruction, in terms of space, number of instructors, and expertise of instructors&mdash;expertise over the broad range of products that we offer and expertise as teachers. We are exploring a number of avenues of providing self-paced instruction, including audio and video-tapes, and we spend a significant amount of staff time developing, writing, revising, and generally improving the quality of, our documentation. But users like to have their hands held, and no matter how much self-paced material we can ever provide, they are still going to want personal instruction. Our goals are to reduce the amount of live instruction altogether and to wean them from the feeling that they should receive step by step help. If we are successful, we expect to reach a much larger audience per instructor hour. Obviously, we have to have good teachers - and teachers skilled in developing material for various media- to do any of these kinds of instruction.
Workshop - technology design rules for design automation
Authors: Mel Heilweil, Tom Reinke, Robert Smith, Gayla VonEhr
Venue: Proceedings of the 20th Design Automation Conference (1983)

Technology design rules are one cornerstone to the production of quality products. Rules are required to execute a design and to check a design for accuracy. Design tools and checking programs, driven by rules, are utilized to assist in the design process. How can we build design tools and checking programs which will survive in this environment? How can we give these CAD program some measure of technology independence? Can the rule-generation process be simplified and automated? Can the rule-generation process be formalized to bridge different and changing technologies? Can design integrity be improved through computer-aided design rule generation? Can the tedious job of manual rule generation be eliminated? Can design rules automation improve product quality? These are some of the problems the workshop participants will be addressing. The participants have been asked to submit a brief position paper along with a 10-minute explanation of their views.
Finite element mesh generation employing satellite graphics
Authors: Sze-Keung Lee, Walter S. Reed
Venue: Proceedings of the 13th Design Automation Conference (1976)

The use of a satellite graphics system is presented as an approach to preprocessing finite element analysis data. The paper discusses the use of curved isoparametric shape functions as the basis of finite element mesh generation and the effects this approach has on the design of a system to support these activities. A minicomputer based design system is presented and its application to a practical three dimensional mesh generation problem is demonstrated.
A local computer network simulation
Authors: John M. McCoy, Stewart L. French, Razmik Abnous, M. J. Niccolai
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Computer Networks are an important part of our society and they are quickly becoming an integral part of computer science basic curriculum. This paper describes the development of a computer simulation model for a local computer network and its use as a viable tool in computer science education.
On generalized finite automata and unrestricted generative grammars
Authors: H. W. Buttelmann
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

The notion of the graphical representation of a &ldquo;canonical derivation&rdquo; is extended to semi-thue systems; the graphs are called &ldquo;derivation structures.&rdquo; Derivation structures are distinguished from phrase structures and generative grammars are distinguished from phrase structure grammars. The distinctions disappear only in the context free case. This paper considers generative grammars and derivation structures. (A subsequent paper will consider phrase-structure grammars and phrase structures.) The notion of generalized finite automaton (tree automaton) is extended to systems which process arbitrary labeled directed ordered acyclic graphs. We study a restriction of these automata which process derivation structures. Analogous to the hierarchy of generative grammars, it is shown that there is a hierarchy of generalized finite automata which recognize the same languages. Their structure-defining relationship is a generalization of the context free case, i.e., the structures recognized by the automata are projections of the structures defined by the grammars. The proofs give algorithms for constructing the automata from the grammars and the grammars from the automata.
On the Stability of Autonomous Decentralized Flow Control in High-Speed Networks with Asymmetric Configurations
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In high-speed network, the principle adopted for a time-sensitive flow control mechanism should be autonomous decentralized control. In this mechanism, each node in a network handles its local traffic flow only on the basis of the information it is aware of, although it is desirable that the decision-making at each node leads to high performance of the network as a whole. To implement this mechanism, we need first to investigate the relationship between the flow control mechanism of each node and network performance. In particular, the stability of the network performance is important. Our previous studies have proposed a simple mechanism for autonomous decentralized flow control and have shown that it has desirable stability. However, since we used a simple, symmetric, and homogeneous network model having a single bottleneck in the evaluation, the results cannot be generalized. In this paper, by using more complex network con.gurations in evaluations, we show that the principle of autonomous decentralized flow control can be applied to high-speed network with asymmetric configurations.
M65MP: An experiment in OS/360 multiprocessing
Authors: Bernard I. Witt
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The System/360 Model 65 multiprocessing system (M65MP) described in this paper exists and is in operation at the IBM facility in Gaithersburg, Mary - land. The Gaithersburg programming effort is the base for IBM's support of multiprocessing announced on January 3, 1968. The only purpose of this paper, however, is to relate strictly personal observations about the development period and the results accomplished.
&ldquo;Ada after one year: How have government politics, industry concerns, and academia mixed?&rdquo;
Venue: Proceedings of the ACM '81 conference (1981)

A potpourri of mini-debates and talks constituting an overview of what's happening throughout the community in Ada and delving into &ldquo;psychological/societal/political&rdquo; issues. 6 activists wrestling with Ada introduction, representing diverse constituencies, have agreed to express their views and expose the issues. Audience interaction will be encouraged!
A modular approach to the simulation of manufacturing processes
Authors: Sarah A. Shoaf
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

During a recent computer simulation study of a highly automated Electronics Assembly Plant, a new approach to modeling manufacturing systems was developed. This new approach involves a modular structure for modeling that will facilitate the design, description, coding and use of the models. In this paper, seven functional &ldquo;modules&rdquo; are defined, each containing functionally related subroutines that are interconnected according to the nature of the relevant system. Use of this modular approach provides a more flexible and less expensive method of simulation modeling.
Documentation- a bridge from the 70's to the 80's
Authors: Frank Melanson
Venue: Proceedings of the 1979 annual conference (1979)

A pragmatic forum where each panelist presented a short talk on a specified area of documentation, standards, writing, uses, and the future role of information transfer services personnel in enabling the coming Integration Information Resources. The talks were followed by an open discussion where attendees and panelists exchanged their experiences, problems and partial solutions.
Practical considerations in implementing a real-time controller design automation system
Authors: R. J. Smith,  II, M. N. Matelan
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

A methodology for reducing the complexity of designing real-time control systems has been previously reported. Techniques based on the methodology, using automatic hardware and software synthesis, are outlined. Practical considerations in implementing a usable design automation system, employing these techniques and producing a complete real-time controller given only a behavioral application description, are discussed.
A data highway for realtime distributed systems architecture and formalization
Authors: A. Faro, O. Mirabella
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

In this paper the authors describe the Proway, a standard data highway architecture for process control, that I.E.C. is developing. Communication aspects are examinated and a formal description of Highway layer is performed by using a state finite graph.
An upper level computer science curriculum
Authors: Y. S. Chua, C. N. Winton
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

In response to national curricular trends, the computer science curriculum at the University of North Florida has undergone three iterations since its inception in 1972. Experiences with the development of the North Florida curriculum coupled with recent exposure to the current thinking of the IEEE-CS Curriculum Committee motivate this paper. The curriculum as outlined in this paper owes its origins to the earlier ACM and IEEE-CS model curricula.
Toward an algebra of nondeterministic programs
Authors: A. Toni Cohen, Thomas J. Myers
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

Two major advantages of the FP Algebra of Programs are its mathematical tractability and the ease with which parallel evaluation may be introduced. Unfortunately, some aspects of parallelism involve nondeterministic computations which, at times, yield indeterminate results. It is possible to introduce special operators to express the indeterminacy; the augmented language is, however, less tractable than the original. Indeterminacy destroys referential transparency: program transformation is not applicable when, for example, the expression x&equil;x may not be identically true. In this paper, we extend the Algebra of Programs by introducing nondeterministic operators and formulating algebraic laws describing their behavior and the transformations applicable to them.
The Geometry Engine: A VLSI Geometry System for Graphics
Authors: James H. Clark
Venue: ACM SIGGRAPH Computer Graphics (1982)

The Geometry Engine[1] is a special-purpose VLSI processor for computer graphics. It is a four-component vector, floating-point processor for accomplishing three basic operations in computer graphics: matrix transformations, clipping and mapping to output device coordinates. This paper describes the Geometry Engine and the Geometric Graphics System it composes. It presents the instruction set of the system, its design motivations and the Geometry System architecture.
Process structuring, synchronization, and recovery using atomic actions
Authors: D. B. Lomet
Venue: ACM SIGPLAN Notices (1977)

This paper explores the notion of an atomic action as a method of process structuring. This notion, first introduced explicitly by Eswaren et al [6] in the context of data base systems, reduces the problem of coping with many processes to that of coping with a single process within the atomic action. A form of process synchronization, the await statement, is adapted to work naturally with atomic actions. System recovery is also considered and we show how atomic actions can be used to isolate recovery action to a single process. Explicit control of recovery is provided by a reset procedure that permits information from rejected control paths to be passed to subsequent alternative paths.
The impact and issues of the fifth generation: Ethical issues in new computing technologies
Authors: Terry Winograd, Paul Smolensky, Roland Schinzinger
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The spread of computer applications throughout American society is a form of social action, not simply a &ldquo;scientific&rdquo; laboratory exercise. Like all social actions which effect the well-being of people, different approaches to computerization entail ethical judgements, however implicit. This session examines some ethical issues which are especially pertinent in the mobilization, development, and diffusion of new generation computing technologies.
Translating APL, an empirical study
Authors: M. A. Jenkins
Venue: Proceedings of seventh international conference on APL (1975)

The wide acceptance of APL\360 and other APL systems as computational tools indicates the usefulness of APL notation for expressing solutions to computational problems. This paper discusses techniques for translating APL to fixed object programs and describes an empirical study of the gains to be made in execution speed of APL programs by such translations compared to direct interpretive execution. The purpose is to determine how great the inefficiencies in interpreting APL are and how much can be recovered by using a translation (or compilation) approach. As a byproduct of this research we hope to produce an APL translator which complements an existing APL interpreter, in that it will be possible to generate an equivalent ALGOL program from an APL workspace with minimal effort. No attempt has been made to produce a hybrid system which will allow a mixture of interpretive and compiled code. Ashcroft [2] considers some of the implications of such system.
A model of software engineering
Authors: Lawrence J. Peters, Leonard L. Tripp
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

The field of software engineering is currently in its formative stages. Consequently, it does not exhibit the structure and discipline present in other, more established engineering disciplines. The technique of morphological analysis is applied to the field of software engineering to identify the form and structure present. Applications in the areas of software engineering research and software engineering curricula are discussed.
Changing the Government's role in design automation (Position Paper)
Authors: J. M. Gould
Venue: Proceedings of the 18th Design Automation Conference (1981)

The Government's traditional role in technology development has been implemented through each agency's acquisition or enhancement of that technology sufficient to enable its mission at a reasonable cost. There has been a new role suggested for the Government in technology development and that is to serve the national interest in areas not directly in any agency's charter (not defense, not space, etc.). This national interest pertains to the health of the electronics industry. This suggested new role, if justifiable, could be implemented by high level directives to fund technology development beyond the scopes of present agency charters. If not justifiable at that level, it could be accomplished in two other ways. The first would be to simply provide a marked increase in funding based on the traditional role in technology development. The second way would be for the Government to sponsor the means for more efficient Design Automation (DA) development.
Analytical power/timing optimization technique for digital system
Authors: A. E. Ruehli, P. K. Wolff, G. Goertzel
Venue: Proceedings of the 14th Design Automation Conference (1977)

A method for logic gate delay assignment is described which achieves power minimization of digital logic while satisfying system timing. The logic gates are described by a single design parameter macromodel. A Newton optimization scheme is employed using exact sparse updating. Systems consisting of up to 1200 digital logic gates have been optimized. A companion paper describes how a further optimization of the system is achieved if power-oriented placement improvement is included in the optimization procedure.
Teaching human-computer interaction in introductory courses
Authors: Eileen B. Entin
Venue: ACM SIGCSE Bulletin (1983)

In this paper I have attempted to point out some ways in which an instructor can sensitize students to the human-computer interface aspect of programming. By discussing this topic at the introductory level, students are made aware early on both of how important this aspect of programming is and, at the same time, how difficult and time-consuming it is to produce quality interface. Most of the suggestions for lecture or discussion presented here can be covered fairly briefly, without taking too much time away from the discussion of the syntax and semantics of the programming language or languages being covered in the course. Just how much time is devoted to the topic of interface is, of course, at the discretion of the instructor. The suggestions for project assignments also require small additions or modifications to the traditional programming assignments. Furthermore, these ideas can be incorporated into more advanced courses. As the students' programming abilities increase and they are able to produce more and more complex code, the dimensions for evaluation of user interface can be broadened. None of the foregoing is meant to imply that it would not be desirable to have students take a course specifically devoted to issues in human-computer interface. It would certainly be appropriate for students to pursue this topic in depth, and a special course such as the one outlined by Shneiderman [6], would be excellent. The important goal at the introductory level is to make students aware that user interface is an important aspect of good programming. If they gain this awareness at the outset, it will pervade their thinking so that one does not have to correct their orientation later in the curriculum, or later still, after they begin their professional career.
A MOS/LSI oriented logic simulator
Authors: Dan Holt, Dave Hutchings
Venue: Proceedings of the 18th Design Automation Conference (1981)

A logic simulator capable of efficiently modelling complex MOS/LSI circuits is presented. The circuit is simulated at the combinational logic and transmission gate level using a set of six node-states. Gate models have inertial delay and assignable nominal rise and fall delays. Both unidirectional and bidirectional transmission gates are accurately simulated, and functional models are provided for ROM, RAM, etc.
Geometric transformations in APL
Authors: John W. Wade
Venue: Proceedings of the international conference on APL (1984)

While geometric transformations that scale, translate, and rotate are in commonplace use, especially in computer graphics, they can be written and used very differently in APL. Because the plus/times inner product is a ready-made matrix multiplier, each transformation function has only to focus on organizing the transformation matrix for the envisioned use. Since inner product generalizes to arrays of higher dimension, a 3-D transformation array can be used to generate multiple objects each transformed as desired. The resultant object group is held in an array one rank higher than the original object that was transformed. With certain careful restrictions, such a resultant can be transposed to collapse along a principal diagonal, and produce an object of the same rank as the original object, but with its component parts transformed differently. For example, each latitude of a cylinder can be scaled differently to produce a curvilinear figure of revolution.
Some techniques and trade-offs affecting large data base retrieval times
Authors: Burton H. Bloom
Venue: Proceedings of the 1969 24th national conference (1969)

This paper presents a theoretical analysis of certain techniques for organizing large amounts of stored data to facilitate fast retrieval of desired information. The well-known access method involving the use of an inverted file to provide multi-keyword access to records is analyzed and shown to significantly reduce retrieval time at the cost of increased file maintenance time. It is shown that further improvements in retrieval time can result from exploiting several techniques for compacting the inverted file, including the use of a bit-pattern representation of the inverted file records. In addition, a direct keyword access method is introduced which avoids the use of a large disk resident concordance/index for locating disk resident information by maintaining a relatively small core resident table.
Restoring the maintenance/enhancement team's long-range design perspective
Authors: John Hadsell, Lucia Harrison
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

One of the classic problems confronting the data processing industry is how to develop the major new system rather than perpetuate the piecemeal approach to satisfying organizational data processing needs and desires. Even when data processing management is wholly supportive of the concept of large integrated systems, other problems exist. Paramount among these is getting both users and data processing applications support personnel to focus their efforts on major new systems rather than maintaining and enhancing existing systems. This paper describes the factors which contribute to this reluctance to develop major systems, then presents a solution. This &ldquo;remedy&rdquo; focuses on principles currently being used by Administrative Data Processing (ADP) at the University of Wisconsin-Madison and relates these principles to the authors' experience with the successful implementation of a major project at the University.
Current systems implementation languages: One user's view
Authors: John Slimick
Venue: Proceedings of the SIGPLAN symposium on Languages for system implementation (1971)

One user's experience with five current systems implementation languages is outlined stressing virtues and vices of each; the five are: FORTRAN, PASS, GOGOL, XPL, and PL360. Some criteria for future systems implementation languages are suggested; the most crucial features of a systems implementation language are (1) access to the &ldquo;real&rdquo; machine, (2) compatibility with existing software, (3) linguistic structure, and (4) predictability of code generator and storage management.
Temporal anti-aliasing in computer generated animation
Authors: Jonathan Korein, Norman Badler
Venue: ACM SIGGRAPH Computer Graphics (1983)

The desirability of incorporating temporal anti-aliasing, or motion blur, into computer generated animation is discussed and two algorithms for achieving this effect are described. The first approximates continuous object movement and determines intervals during which each object covers each pixel. Hidden surface removal is then performed, allowing the calculation of visible object intensity functions and subsequent filtering. The second form of algorithm detailed involves supersampling the moving image and then filtering the resulting intensity function to &ldquo;multiply-expose&rdquo; each output picture. The effects of filter types and the relationship of the algorithms to forms of spatial anti-aliasing are discussed.