ppxscal/embedding_network huggingface dataset:
A functional model of instructional programs
Authors: Abimbola Salako
Venue: ACM SIGCUE Outlook (1976)

A functional model of instructional programs (for Computer Assisted Instruction - CAI) that describes all program types as being essentially composed of a set of primitive building blocks is proposed. The variables that account for the apparent distinguishing characteristics of these programs are then interpreted in the light of this model and a procedure is provided for reducing the different program types to their elementary building blocks. Starting with the primitive building blocks, it is shown how programs of varying descriptions can be generated by an appropriate choice of parameter values. This model provides better insight on the requirements and structure of application-oriented CAI languages, software, and systems. Furthermore, the model provides an easy means of generating CAI synthetic programs for the purpose of simulation modeling directed towards instructional systems design, analysis, and performance evaluation.
Financing user services in the eighties
Authors: Douglas E. Van Houweling
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

It is becoming obvious that computing technology, economics, and applications are undergoing a revolution. The impact of this revolution is beginning to be felt in the university environment, and will transform the place of computing in the university by the end of this decade. This paper will analyze the changes we confront, outline a scenario for academic computing at the end of the decade, analyze the current financing of support services, isolate the problems that will be caused by current financing methods, and recommend an approach which capitalizes on the changed environment expected in 1990.
A versatile queueing model for data switching
Authors: Richard V. Laue
Venue: Proceedings of the seventh symposium on Data communications (1981)

In a data network, when messages arrive at a switch to be served (transmitted) on a line, it seems reasonable to assume that the arrival process can be described as a Poisson (random) process. However, when messages are divided into a number of packets of a maximum length, these packets arrive bunched together. This gives rise to what is referred to as &ldquo;peaked&rdquo; traffic. The degree of peakedness depends on 1) the interarrival time of packets associated with a particular message and 2) the distribution of the number of packets per message. In this paper we describe a queueing model which accounts for the non-Poissonian nature of the packet arrival process as a function of these two factors. Since packets are of a fixed maximum length, the model assumes that the packet service time is constant, as opposed to the mathematically more tractable but less realistic assumption of exponentially-distributed service time. This queueing model is then used to describe the network delay as affected by: 1. Message switching versus packet switching, 2. A priority discipline in the queues, 3. Packet interarrival time per message, which is probably controlled by the line speed at the packet origination point, and 4. A network which carries only short inquiry-response traffic as opposed to a network which also carries longer low-priority printer traffic. The general conclusions are that the peakedness in the arrival process caused by a short interarrival time of packets per message and the longer printer traffic would cause excessive delays in a network. If inquiry-response traffic with a short response-time requirement is also to be carried on the same network a priority discipline has considerable value. Message switching for such a combination of traffic should be avoided.
A maintenance system architecture for data network services
Authors: R. T. Begbie
Venue: Proceedings of the fifth symposium on Data communications (1977)

This paper describes a maintenance system architecture, partially implemented within Bell Canada, for end-to-end testing and maintenance of data network services. This paper emphasizes the end-to-end, overall, maintenance requirements.
An APL package for convex geometry
Authors: Richard A. Vitale, Alan J. Tarr
Venue: Proceedings of seventh international conference on APL (1975)

The package of APL routines described here grew out of some work pursued by the first author in the applications of convex geometry to pattern analysis of plane figures. In using these routines, our experience has been that the computer with display devices can be a powerful tool for geometrical investigations where pencil and paper constructions are laborious or in other applications where randomizing mechanisms are needed. Certain areas of convex geometry are stressed in the package such as the manipulation of vector sums of convex sets, while others are suppressed - notably the set-theoretic operations of union and intersection. Without doubt, the routines in the package are not optimal in terms of space and time resources. Moreover, a number of routines are yet to be added. Nevertheless, we feel that the package is reasonably self-contained and may be of interest to other investigators in similar pursuits. The availability of a plotting device has certainly been a great convenience for us but the package is designed to run independently of such a facility.
Applications of computer simulation in health care
Authors: William England, Stephen D. Roberts
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

Several hundred computer simulation models have been developed in the last 15 years to solve problems in the nation's health care delivery system. These models are categorized and reviewed according to 21 areas of application, along with discussion of general model characteristics. Charts showing trends in health care simulation modeling are given, followed by discussion of problems in model implementation and directions for future research.
Programming with abstract data types, some examples
Authors: Bengt Nordström
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The data structuring facilities of contemporary languages like Algol-68, Pascal and Simula supports only one type of graphs, the general graph. It is only possible to define the structure of a node in a graph, not to define how the nodes are interrelated. Nothing in the languages prevents the programmer from using for instance a node in a binary tree as an element in a double list. This means that the programmer has to prove a lot of invariants on graphs which would not be necessary if the language supported declarations of different graphs. This paper contains some examples of algorithms on different graphs. We use a presentation language which is based on Pascal. We have replaced the pointers in Pascal with a set of type constructors. These type constructors give us a possibility to manipulate different graphs in a safe way.
Human-computer discourse in the design of a PASCAL tutor
Authors: Beverly Woolf, David D. McDonald
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

An effective human-computer discourse system requires more than a clever grammar or a rich knowledge base. It needs knowledge about the user and his understanding of the domain in order to produce a relevant and coherent discourse. We describe MENO, a prototype tutor for elementary PASCAL, which uses a set of speech patterns modelled after complex human discourse and a richly annotated knowledge base to produce a flexible interactive system for the user.
Random access file organization for indirectly addressed records
Authors: Charles A. Olson
Venue: Proceedings of the 1969 24th national conference (1969)

Random access file organization is discussed for the case of indirect addressing and a high rate of additions and deletions. The equations derived for this special situation are substantially different from those usually used in estimating file requirements. Graphs are included which make it possible to estimate file utilization and overflow, as shown in several simple examples.
User services in industry&mdash;starting from scratch
Authors: Michael A. Steinberg, Carl W. Ballard,  Jr.
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

This paper will describe some of the similarities and differences between academic and industrial User Services, and some of the unique opportunities, experiences and problems that can be encountered in the industrial environment.
Examples of hard tautologies in the propositional calculus
Authors: Balakrishnan Krishnamurthy, Robert N. Moll
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We present examples of hard tautologies in propositional calculus by encoding instances of the assertions made by Ramsey's theorem. We provide evidence that these tautologies are indeed hard by 1. showing that there are no short proofs for these tautologies in certain restricted classes of proof systems; 2. relating a proof of these tautologies to the problem of determining the diagonal Ramsey numbers for graphs.
2n-way jump microinstruction hardware and an effective instruction binding method
Authors: Joseph A. Fisher
Venue: ACM SIGMICRO Newsletter (1980)

A scheme is developed by which multiway microprogram jumps may be made to any of 2n next possible microinstructions as a function of any selection of n > 1 logically independent tests. An efficient method of binding microinstructions to memory locations allows this to be done at very low cost, both in terms of speed and hardware. Independent simultaneous tests are a necessity if horizontally microcodable machines are to continue to get wider, since algorithms presumably have fixed operations/tests ratios. This scheme will give parallelizers for such machines maximum flexibility in rearranging flow control.
Experience with intersession courses in computer science
Authors: N. E. Sondak, R. C. Scott, J. H. Sistare
Venue: Proceedings of the ACM annual conference (1973)

During the past two academic years, Worcester Polytechnic Institute has organized its school calendar to allow for a three-week intersession period in January during which short (one- to three-week), high-intensity courses on a variety of subjects were offered. Attendance was open to all segments of the undergraduate student population on a voluntary basis, with possible academic credit. Four courses were offered in Computer Science. Two of these with course titles, Minicomputers and Maxicomputers, were held in cooperation with nine area corporations that either are extensive users of computer systems or are computer manufacturers. The other two courses delt with teaching the BASIC and SNOBOL programming languages. The students were involved for eight to twelve hours for three days with three of the courses and six days for the SNOBOL course. Experience with the courses thus far indicates that they were very popular as choices, and well received by the students. Availability of credit was not an important factor in course selection. However, hetrogenity in class population lead to some problems in the types and levels of presentations, and the intensity of the course was sometimes fatiguing to both the students and the faculty.
Computer auditing and control
Authors: Harvey S. Koch
Venue: Proceedings of the 1979 annual conference (1979)

The purpose of this session is two-fold: 1) to identify major problems in the state-of-the-art of computer auditing techniques, and 2) to propose solutions to a subset of these problems. Since this is an area that is new to most computer scientists, a few words about the objectives of computer auditing seem appropriate at this point. The definition of computer security includes not only protection from internal and external sources of willful misuse or damage of the system, but also the integrity of the system itself&mdash;the assurance that the system does what it's supposed to, as it's supposed to, and that its inputs and outputs are valid and accurate in every respect. Audits of the application system provide this assurance.
Recognition of Real-Life Character Samples Using a Structural Variation and Degradation Model
Authors: Nadeem A. Khan, Hans A. Hegt
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

A character recognition scheme based on structural analysis is presented to deal with unconstrained hand-written characters and degraded samples of multi-font machine-printed characters. It is based on building simplified easy-to-construct shape models representing character classes. The scheme is based on employing a general variation and degradation model to match character samples with these models. Experimental results are presented as proof-of-concept.
A systems analysis of stress-strain in VDT operation
Authors: Steven L. Sauter, Mark S. Gottlieb, Karen C. Jones
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The last half decade has witnessed a rapidly accelerating trend toward the application of video display terminal (VDT) technology for information management in the office workplace, and a growing body of scientific and anecdotal data on the implications of VDT use for the well-being of office workers [2,4,6-8,11,15,16]. A striking aspect of the research on this subject is the degree of conflict among reports regarding the type, magnitude, and causes of adverse changes in the health, comfort, and satisfaction of the VDT user, as is apparent in a recent review by Dainoff [5]. Methodological limitations of much of the work to date probably account for some of these inconsistencies. Many of the studies are demonstrations, or pre-experimental or field investigations with control or statistical measures which allow at best, only general and limited inferences regarding the effects of VDT work [4,8,11,16]. A more serious limitation involves the conceptualization or operational definition of VDT use which in turn determines the elements or factors which eventually figure into a VDT stress model or study design. As an operation or job demand, VDT use is clearly not a unidimensional phenomenon. Based upon findings in an investigation of health complaints and job stress surrounding VDT use in newspaper and insurance facilities, Smith, et al. [16] demonstrated that VDTs may present a wide range of organizational as well as physical or environmental job challenges. To date, numerous investigations have focused mainly on the physical ergonomic demands associated with VDT use [7]. A few have placed strong emphasis on job content, psychosocial, and related operational-organizational factors [8,11,16]. None have systematically examined the unique and integrated effects of these two sets of potential stressors. Smith, et al. [16] maintained that in studying the problems of VDT operators, the contributions of both work and workplace design factors and their interactions must be considered. This is the aim of the present study.
Computers in precollege education (Panel Discussion): What are colleges of education doing?
Authors: J. Richard Dennis, William Schaeffer, James E. Gray, Robert Taylor
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

Instructional use of computers is now common at many secondary schools and in elementary schools. The computer is recognized as a new and important educational medium, as a source of change in existing curriculum, as a new curriculum area. Thus there is growing awareness that pre-service elementary and secondary school teachers need some computer education. What are colleges of education doing to meet this challenge? A panel of faculty from several colleges of education will present their views and insights. They will point out successes, both at their own schools and on a national scale. They will also point out what still remains to be done. There will be time for input from the audience.
Man-machine interaction in the design of rotating electrical machines
Authors: Bernard J. Bennington
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

When engineering design is considered as a part of the more general study of system design or problem solving, it becomes apparent that it subdivides into the separate problems of design analysis, design synthesis and system identification. Rotating electrical machinery presents a uniquely complicated system of non-linear, constrained, discrete and discontinuous relationships. The economical solution of the design of electrical machines in our industrial society can only be achieved by a marriage of various numerical adaptive techniques in a man-machine interactive environment. The first applications of digital computers as aids in the design of electrical machines were to automate the field of design analysis. This was followed by the use of the computer to fulfill the role of design synthesis and design optimization. These approaches were suitable to the batch mode of computing which was the only available mode until recently. The advent of a closer symbiosis of man and machine by interaction in a &ldquo;conversational&rdquo; mode is opening the way to a much more satisfactory and economical solution of the design problem. Some recent experience with &ldquo;conversational&rdquo; mode access by means of time-shared consoles is described, together with some experience in the writing of language aids peculiar to the design of electrical machines. The &ldquo;master designer&rdquo; concept of C. L. Miller is proposed as being a logical evolution in the rotating electrical machines industry and the techniques described in the paper are concluded as leading, in a natural progression, to the fulfillment of this concept.
A multiple processor data flow machine that supports generalized procedures
Authors: Arvind, Vinod Kathail
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Programs for data flow machines are written in functional languages, some of which require efficient support for dynamic procedure invocation to achieve high performance and programming flexibility. Among the proposed data flow machines, few support procedures in any generality. Our machine, which is a hardware realization of the U-interpreter for data flow languages, provides support for a variety of procedure calling conventions. Because the U-interpreter assigns a unique activity name to each instance of a computation (activity), an activity name may become arbitrarily large in the case of nested or recursive procedure calls. Hardware considerations, however, require that an activity name be represented by a fixed-size tag. We describe a mechanism that uses fixed-size, reusable tags in hardware. Like processor and memory resources, a group of tags is allocated and deallocated for each procedure activation. The proposed mechanism passes procedure arguments and results efficiently, given the distributed environment of our machine.
Interactive graphics for schematic editing, a working tool
Authors: M. D. Mancusi, J. C. Wild
Venue: Proceedings of the 9th Design Automation Workshop (1972)

LOGIGRAF, an interactive graphics program to lay out and edit schematic drawings, is now being used in a production environment at Bell Telephone Laboratories. The program runs on a GRAPHIC-211 graphics terminal (fig.1 ) which consists of a Digital Equipment Corporation PDP-15 computer with 8K of memory, secondary storage disk, card reader, 9 track tape, display processor, refreshed 21 inch CRT display, keyboard, light pen, function buttons, storage CRT, and hard copy unit. The cost of this hardware assuming a one shift operation and including maintenance is around &dollar;25/user hour.2 A virtual memory operating system is used to optimize the use of the 8K of core memory. The operating system and graphical programming support were developd as part of a general interactive graphics system for Bell Laboratories. LOGIGRAF is one of about a half dozen major application programs which all use the same system software. LOGIGRAF itself required almost three man years to develop and presently contains about fifty thousand words of Instructions. Programming was done in a higher level macro language designed for graphic application programming. Many technical obstacles had to be overcome in the development of the program. The most important of these had to do with providing a satisfactory user interface. In addition, a number o f new algorithms for dealing with the graphical data base permitted more complete graphical editing functions to be made available to the user.
Dynamic scan-converted images with a frame buffer display device
Authors: J. H. Jackson
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

A color interactive display system which produces images of three-dimensional polygons and labels on a frame buffer display device is being developed. The entire image is scan converted and written into the frame buffer whenever it is modified. Since an entire image cannot be written into the frame buffer faster than 4.6 frames per second for the particular device chosen, an illusion of continuous motion cannot be supported. However, a rate of 3 frames per second has been found sufficient to provide feedback to continuous user input. In order to achieve this frame rate for a reasonably complex picture, the display device has been microprogrammed to accept run length encoded data and text, and the instruction set of the computer has been extended by microprogramming special-purpose instructions which perform visible surface calculations. These microprograms currently can process a scene which consists of up to 170 polygons at 3 frames per second.
Experience in the design, implementation and use of PL-11, a programming language for the PDP-11
Authors: Robert D. Russell
Venue: ACM SIGPLAN Notices (1976)

PL-11 is a programming language for the PDP-11 family of computers designed and implemented as part of the OMEGA Project at CERN (the European Organization for Nuclear Research). Its purpose is to provide an effective tool for both physicists and systems programmers to use in building real-time data acquisition systems that are on-line to high-energy physics experiments. It is a fairly typical member of the PL-class of programming languages (44) which are based on the initial design of PL360 (41) (see Table 1). Each of these languages represents a linguistic model of its specific machine architecture, thereby providing a Systems Implementation Language (SIL) that is extremely efficient on its target machine, yet is also highly effective for human programmers to use. The need for such a tool is obvious on all computer systems, but especially on minicomputers, where most applications are in fact &ldquo;systems programs&rdquo;. For example, in any data acquisition environment the distinction between &ldquo;user&rdquo; and &ldquo;operating system&rdquo; largely disappears&mdash;the user's prime concern is to handle time-dependent sequences of events involving the manipulation of special I/O devices through direct status checking and data streaming&mdash;all functions which are usually buried in the operating system of conventional computing systems. This paper discusses four years of experience with PL-11, especially as this relates to the general topic of SILs on minicomputers.