ppxscal/embedding_network huggingface dataset:
Certification of computer personnel (Panel Session)
Authors: Fred H. Harris
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

DPMA established a Certification and Testing Advisory Committee with representatives from ACM, DPMA, and ASM. The importance of this effort to DPMA and to ACM was apparent from the active participation of their presidents in the meetings held in the spring and summer of 1972. The committee considered a number of known issues dealing with certification in general, and existing programs in particular, and did an excellent job of defining the complexity facing any new effort. Moreover, it reaffirmed the work of the ad hoc committee and refined the concept of the proposed Computer Foundation.
A lab approach for introductory programming courses
Authors: Lynn J. Olson
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

The lab portion of the introductory computer science course at Wartburg College is described. These two-hour time blocks are designed to facilitate a high degree of student involvement through intensive practice in the development of algorithms and the application of key programming concepts. Several positive outcomes of the laboratory approach are delineated and examples of specific lab sessions are provided.
A management approach to the development of computer-based systems
Authors: R. Turn, M. R. Davis, R. N. Reinstedt
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Many organizations have experienced serious difficulties in developing complex computer-based systems, especially their software components. The problems include large cost overruns, schedule slippages, inadequate performance, and inability to use the system as originally envisioned. One major reason for such lack of success has been the inability of the management of the organization or the development effort to understand the need for a total-system management approach. In particular, acquisition of software and hardware separately with the hope of integrating them later does not work in complex systems. This paper outlines a management approach to acquiring computer systems which encompasses the whole system, with emphasis on the software, from the initial concept formulation to the support of the operational system. Expected improvements in the development process and organizational implications of this management approach are discussed.
An interactive FORTRAN structuring aid
Authors: Julian E. Gomez
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper describes a tool at the Jet Propulsion Laboratory which aids a programmer in converting FORTRAN to a structured syntax. The program is a highly interactive system using computer graphics techniques to facilitate the operations necessary for such a conversion. Editing and structure recognition capabilities, including the ability to handle arbitrary levels of block structure, have been combined into a system that reduces the effort involved in updating old software.
New algorithms and lower bounds for the parallel evaluation of certain rational expressions
Authors: H. T. Kung
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

This paper presents new algorithms for the parallel evaluation of certain polynomial expression. In particular, for the parallel evaluation of xn,we introduce an algorithm which takes two steps of parallel division and [log2n] steps of parallel addition, while the usual algorithm takes [log2n] steps of parallel multiplication. Hence our algorithm is faster than the usual algorithms when multiplication takes more time than addition. Similar algorithm for the evaluation of other polynomial expressions are also introduced. Lower bounds on the time needed for the parallel evaluation of rational expressions are given. All the algorithms presented in the paper are shown to be asymptotically optimal. Moreover, we prove that by using parallelism the evaluation of any first order rational recurrence, e.g., [equation], and any non-linear polynomial recurrence can be sped up at most by a constant factor, no matter how many processors are used.
Some Comments On EQS, A Near Term Natural Language Data Base Query System
Authors: William A. Martin
Venue: Proceedings of the 1978 annual conference (1978)

Problems and possibilities for near term natural language query systems are discussed, with emphasis on the author's own system, EQS. First, the general objectives for near term systems in the areas of syntax, world knowledge, discourse, and problem solving are considered. Next, a comparison is made between the ATN parsing strategies in LADDER, ROBOT, PLANES, and EQS. Evidence for the importance of giving answers to queries not directly available in the data base is given together with some speculation on how the knowledge necessary for this might be acquired. After some general discussion of semantic data models, the semantic data model used in EQS is described, and the method used for building a semantic data model of an existing CODASYL data base is sketched. Lastly, the use of Multiple levels of representation as a way to control complexity of such query systems is discussed.
Classical indeterminacy, many-valued logic, and supervaluations
Authors: John Martin
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The problem of representing 3-valued supervaluational languages by 2-dimensional product languages is pursued in [3], [8], and [4]. A solution is presented here that attempts to incorporate into such a representation familiar and plausible intuitive principles from traditional many-valued theories. In particular, it is argued in Sections II and III that the concept of classical indeterminacy, which is the key motivational idea behind supervaluation, also underlies the matrices of Jan&Lstrok;ukasiewicz and of S.C. Kleene's strong connectives and that indeterminacy is of quite general importance to the understanding of one tradition in many-valued logic. In Section IV the kinship between supervaluations, on the one hand, and the 3-valued matrices of &Lstrok;ukasiewicz and Kleene, on the other, is developed both in intuitive discussion and in a formal characterization of the former in terms of the latter. In Section V the four-valued semantics of Hans Herzberger [3] is interpreted in terms of classical indeterminacy and is used to express in two dimensions and four values the ideas of the Kleene and &Lstrok;ukasiewicz theories. Then by the characterization of Section IV supervaluations are represented in two dimensions. Finally, in Section VI this representation is shown to be co-extensive to that of Herzberger in [4] and to provide, in effect, a defense of his theory in terms of traditional conceptual foundations.
Experience with a &ldquo;universal&rdquo; introductory course in computer science
Authors: T. Sterling, S. Pollack
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

The increased demand for some type of introductory computing/computer science course does not stem solely from computer science epartments. A variety of other disciplines re discovering that the adequate training of computer users involves more than a short course in a programming language. Consequently, there is a need for a basic course sequence that: 1. Teaches the fundamentals of computing to students from a wide variety of disciplines (including computer science); 2. Provides the student with some useful skills, regardless of where he terminates in that sequence; 3. Permits students who become interested in computing to study advanced topics without paying undue penalties (i.e., without trapping them in terminal courses); 4. Accomplishes these aims without hopeless fragmentation of the department's offerings (as is still the case in mathematics) or giving up responsibility for most service courses (as is the case with statistics).
Computer-Aided Design, Manufacturing, Assembly and Test (CADMAT)
Authors: F. C. Bergsten
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes an integrated Computer-Aided Design, Manufacturing, Assembly and Test System to achieve increased productivity and quality. The term CADMAT which encompasses Automated Test also implies the integration of all design automated and computer augmented processes throughout the product and business organizations. In the design and test phase of electronics, Interactive Graphiss (IAG), verification, automated board layout, and automatic test vector generation are discussed. In the mechanical area, the use of 2D and 3D graphics techniques, computerized finite element modeling, and structural analysis programs are described. The use of the design data base in N/C manufacturing, automated inspection and testing is examined as is the role of automated software development and the development and use of management information systems.
The design of synchronizing buffers for collecting and distribution digital data
Authors: Henry C. Kreide
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

It is generally known that a shift register converts binary digits from parallel to serial form or vice-versa. For example, it may collect bits from m input channels and distribute it to one output channel. The shift register function is generalized by designing a buffer which collects bits m at a time and distributes them n at a time. Such a device with multiple inputs and outputs is considered here.
Time-share computer services at St. John's University
Authors: James Peters
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

I have found an astonishing thing, which is, that we can represent all sorts of truths and consequences by Numbers (G.W. Leibniz, &ldquo;The Art of Discovery,&rdquo; 1685) Cam machines think? Allan Turing once asked this question. It is not my purpose, here, to offer an answer to this question and engage in the current controversy between M. Minsky et al and H. Dreyfus, but rather to offer an interpolation of this question: Can Machines (prompt) Thinking? The Data Center which I began at St. John's University came into being as a result of my own experience in a think-tank at the University of North Dakota in 1970.1 This think-tank was an oblong room set aside for persons preparing batch computer jobs in mathematics and physics. Typical problems like finding order 4 semigroups or rocket launch simulations, for example, were restructured to permit computer searches and representations. That was a good room to be in. Seemingly novel procedures and approaches were taken to familiar problems&mdash;representations of them with numbers via the computer. In 1972 we started with 2 terminals in a Physics seminar room at SJU; there were online to the University of Minnesota. It was the beginning of a think-tank reminscent of the one at UND. Student and faculty interest soon out-paced the capacities of our 2 terminals. Then, when considering the possibility and the cost of expanding to 10 terminals connected to the U of M, we instead, introduced on-campus systems capable of reaching across the upper midwest to supply our needs. The other services we supply to our campus users, and, to some extent, our off-campus users, are secondary totally to this primary one, the introduction of a think-tank wherein thinking is prompted by machines.
Dynamic storage allocation systems
Authors: B. Randell, C. J. Kuehner
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

In many recent computer system designs, hardware facilities have been provided for easing the problems of storage allocation. This paper presents a method of characterizing dynamic storage allocation systems, according to the functional capabilities provided, and the underlying techniques used. The basic purpose of the paper is to provide a useful perspective from which the utility of various hardware facilities may be assessed. The paper includes as an appendix, a brief survey of storage allocation facilities in several representative computer systems.
Multiprocessor self diagnosis, surgery, and recovery in air terminal traffic control
Authors: W. Walther
Venue: ACM SIGOPS Operating Systems Review (1973)

The rapid growth of global aviation for business and pleasure has created the need for automated terminal systems of increasing complexity and capability. Continued increases in the aircraft population will require higher levels of automation. Sperry Univac is responding to this challenge with a multiprocessing system, including hardware and software, currently under development which will enable controllers to safely manage the crowded skies.
Structured programming in a production programming environment
Authors: F. T. Baker
Venue: Proceedings of the international conference on Reliable software (1975)

This paper discusses how structured programming methodology has been introduced into a large production programming organization using an integrated but flexible approach. It next analyzes the advantages and disadvantages of each component of the methodology and presents some quantitative results on its use. It concludes with recommendations based on this generally successful experience, which could be useful to other organizations interested in improving reliability and productivity.
System development techniques for small and medium size installations
Authors: Amilcar Morales, Luis Barra
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

Increasing attention has been focused on team management as a better way to improve software production. Nevertheless, most of the experiences described in recent publications to support the present trends in software engineering, deal mainly with large installations and -apparently- large human groups involved in systems development. The implementation of such techniques in small working groups, implies some important changes in order to produce an effective tool that provides software quality and production cost reductions. Not much attention, either, has been given to the psychological factors affecting the small group behaviour, where the individual influence comes to be higher than in large systems; our experiences intending to implement Chief Programmer Teams in structured COBOL groups, show that it is not feasible to implement the above mentioned techniques, unless an adaptation is made for small teams, before any practical work be done. The present paper describes how these techniques were adapted and implemented. A brief analysis of the experiences and results so far obtained support a set of solutions found, pointing to the building of a practical methodology to be used by these groups. The later experiences herein described -based on these new working methods- show results indicating a productivity rising over 30% and an excellent individual disposition towards the daily workload. Higher productivity and personal enthusiastic attitudes provide a better opportunity to satisfy institutional objectives and individual personal goals.
A genetic theory of scientific development
Authors: Warren Jones
Venue: Proceedings of the ACM annual conference (1973)

A theory is presented to account for some aspects of information and knowledge dissemination. Information and knowledge phenomena seem to involve the transmission of many factors which may be linked, may compete for the attention of the receivers, and may be subject to different environmental pressures. Furthermore, it is apparent that new knowledge and information may be introduced into a population quite independently of the processes of dissemination. These features of information processes suggest that techniques similar to those employed in genetics may be adaptable to the study of information processes and in particular to the growth of science. Analysis is performed by the application of suitably designed PL/1 programs that identify the analogues of two factor crosses among stable markers of the scientific literature. The hypothesis to be tested is whether there exists maps of the literature which have the salient properties of genetic maps.
Compositing digital images
Authors: Thomas Porter, Tom Duff
Venue: ACM SIGGRAPH Computer Graphics (1984)

Most computer graphics pictures have been computed all at once, so that the rendering program takes care of all computations relating to the overlap of objects. There are several applications, however, where elements must be rendered separately, relying on compositing techniques for the anti-aliased accumulation of the full image. This paper presents the case for four-channel pictures, demonstrating that a matte component can be computed similarly to the color channels. The paper discusses guidelines for the generation of elements and the arithmetic for their arbitrary compositing.
The value of an intentionally mis-designed simulation
Authors: Dean A. Lebestky, Francis D. Tuggle
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

An effective and successful multi-purpose class-room experience was developed using an intentionally mis-designed simulation model. Our design philosophy, of intentionally misrepresenting reality with a simulation model, was completely counter to the maxims and precepts to be found in standard reference texts:l, 2 make the model as analogous as possible to reality, within time and money constraints, and with regard to the need for parsimony. Our motives in misdesigning the model were to educate a class of managers: the potential usefulness of simulation models, how to detect inadequate simulation models, and effective ways of using consultants.
Run-time characteristics of a simulation model
Authors: Edward F. Gehringer, Herbert D. Schwetman
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

This paper compares the efficiency of trace-driven simulation models of computer systems with the efficiency of function driven models. In a trace-driven model (TDM), the next service request for a task is selected from a file of requests which was created earlier, often from data derived from a functioning system. This can be compared to a function-driven model (FDM), in which the next service request is selected using generation techniques based on random deviates. While both kinds of models can produce statistically accurate results, a TDM is thought to be inherently more accurate, but it has been suspected that a FDM is faster. The comparison of these two techniques is based on a simulation model of a computer system which has been specially constructed so as to operate either as a TDM or an FDM. The key feature of the study is that by using this model, we have isolated the demand-generation technique (either trace-driven or function-driven) as the single factor affecting performance of the model. A run-time program monitor and a software-monitor event probe are used to evaluate the resources used by various runs of the two kinds of simulation models. The results indicate that, contrary to earlier expectations, the performance of both techniques is comparable. We also demonstrate the effects of various block sizes on the performance of the TDM and the effects of the complexity of the request functions on the performance of the FDM.
Computational aspects of data fitting with a new multivariate spline
Authors: Philip B. Zwart
Venue: Proceedings of the ACM annual conference (1973)

The multivariate splines considered are piecewise polynomials of total degree s, with continuous derivatives of order s-1. The piecewise domains consist of the polyhedra obtained by partitioning En with any k hyperplanes. For nondegenerate partitions, the splines have data fitting power which is greater than a single polynomial and less than the standard tensor product splines. An especially simple canonical form represents these splines. This representation, although numerically ill-conditioned, can be effectively used with standard software on problems with 1&le;s&le;3, 1&le;n&le;3, 1&le;k&le;8. Fixed partition problems can be solved with IBM's Scientific Subroutine Package programs for min-max or least squares fitting. Variable partitions can be handled with Marquardt's method, modified to avoid redundant placement of partitions.
The challenge of computer science in New Zealand
Authors: B. A.M. Moon
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

Some aspects of computer science education in New Zealand are discussed and the role of the universities is assessed. While there is much common ground with countries overseas there are also particular local conditions to be met. It is suggested that the first priority is the setting up of an honours degree program and a course outline is proposed.
Experience with the central server model on a lightly-loaded system
Authors: A. K. Agrawala, R. L. Larsen
Venue: ACM SIGSIM Simulation Digest (1976)

Analytic models potentially provide an elegant means of estimating the performance of computer systems at a rather nominal cost. The assumptions which must be made about a system in order to construct a mathematically tractable model, however, are usually severe enough to cast doubt on the validity of the results produced by such a model. Further, relaxation of an assumption often renders an analytic technique inapplicable, such that simulation becomes the preferred approach to system modeling. To investigate the boundary between analytic models and simulation models a computer program has been developed which provides a framework within which to develop and compare both analytic and simulation models. A general queuing network architecture has been adopted. The program is extensible with respect to analytic techniques, queuing disciplines and probability density functions. Using this program, models of a lightly loaded batch multiprogramming system were constructed. The system was viewed as a network of servers preceded by queues. The central processing unit was one server and each I/O channel was treated as a separate server. The channels were organized in parallel with respect to each other, and in series with respect to the central processing unit. Tasks were viewed as tokens flowing through the network, being delayed by each server for queuing delays and service. Delays between task termination and initiation of a new task were modeled by additional servers operating in parallel to the I/O channel servers. An analytic solution was computed for this model for the steady state case with exponentially distributed service times and the first-come-first-served queuing discipline with unlimited capacity queues. Typical errors of 18% were observed for cpu utilization and I/O activity. The model was then modified to more realistically account for the behavior of partitions. The delay servers were modeled with unit capacity queues. This model was solved by simulation, yielding errors of 4% for cpu utilization and I/O activity.
Pure and applied programming
Authors: M. V. Wilkes
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

It is possible to discuss the technique of writing programmes without reference to particular problems, in the same way as it is possible to discuss, for example, the solution of differential equations without reference to particular examples. This study might be called &ldquo;pure programming&rdquo;, whereas the application to specific problems of the techniques discussed would be &ldquo;applied programming&rdquo;. In spite of my title, I shall be concerned in this lecture with one or two aspects of pure programming only. I do not mean to suggest that pure programming has any importance apart from its applications; rather the object of developing the less obvious programme techniques is to make it easier to draw up programmes for specific problems quickly and accurately.