ppxscal/embedding_network huggingface dataset:
Certification of secondary school computer science teachers some issues and viewpoints
Authors: Joyce Statz, Leland Miller
Venue: Proceedings of the 1975 annual conference (1975)

There are a number of major issues to be considered regarding certification of computer science teachers for secondary schools. Three of these issues are considered in this paper. Issue 1: Is there a need for certification? Issue 2: What certification standards are needed? Issue 3: Where does computer science fit into the curriculum? The authors justify the need for certification by documenting increasing computer usage in secondary schools. They then outline the courses which can comprise a standard for certification of secondary school teachers in computer science. Finally, they show the role of the computer science teacher in teaching algorithmic thinking and computer programming, and in serving as a resource person for teachers in any discipline who wish to use the computer.
The design of a TI980A operating system for classroom use
Authors: Henry R. Bauer,  III
Venue: ACM SIGCSE Bulletin (1975)

To enable students and researchers to concentrate on individual primitives, an operating system is designed with replaceable program parts. In particular, classroom and individual study projects may be assigned which give the students actual practice with a real multiprogramming system. Such projects would replace the simulation exercises usually found in operating systems courses. The minicomputer hardware and software features described here are within reach of most small computer science departments.
The basics of GASP II: A tutorial
Authors: A. Alan B. Pritsker
Venue: Proceedings of the 5th conference on Winter simulation (1971)

GASP II consists of a set of FORTRAN subprograms organized to assist the systems analyst in performing simulation studies. GASP II formalizes an approach to simulation by specifying common elements of simulation studies and providing subprograms for performing those simulation tasks that are independent of a particular problem. The GASP II world-view involves specifying the status of a system in terms of the entities of the system. The entities have characteristics called attributes. The values assigned to the attributes provide a quantitative picture of the status of the system at any point in time. Relationships between entities are maintained by the membership of entities in files. The status of the system changes when attribute values change or the membership of entities in files is altered. When the status of a system changes, an event is said to occur. The GASP II simulation philosophy is that a dynamic simulation of a system can be obtained by modeling the potential events associated with the system and advancing time from one event to the next event. In simulation parlance this is called a next event or discrete event simulation procedure.
The user's view of CAD/CAM (Panel Session)
Authors: Myrl Thompson, D. H. W. Harris, R. Wilson, B. Crowley, C. Boyd M. Wozny
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

&ldquo;The User's View of CAD/CAM&rdquo; will share the experience gained in over 50 man-years of day-to-day use of CAD/CAM systems. Six industry segments are represented in this presentation. In addition, a wide range of systems costing under &dollar;50,000 to over &dollar;1,000,000 will be discussed. There is good news and bad news. All panelists admit to improved productivity and/or reduced design cycle time, but all is not free. You will hear about what it takes to operate and support CAD/CAM systems. Subjects include facilities planning, cost effectiveness, training, internal support requirements, and more. Here is your chance to hear practical and common sense comments about what CAD/CAM can and cannot do for you.
Techniques for programmable logic array folding
Authors: G. D. Hachtel, A. R. Newton, A. L. Sangiovanni-Vincentelli
Venue: Proceedings of the 19th Design Automation Conference (1982)

The optimal PLA folding problem is presented and discussed in its different forms. In particular, new algorithms for row folding in unconstrained architectures and in AND-OR-AND architectures are presented and their complexity examined. The problem of finding an optimal row folding after a column folding has been performed, is described and an algorithm for its solution given. Finally, the organization of an APL package for row and column folding of PLA's is introduced and experimental results reported.
Interactive linkage synthesis on a small computer
Authors: Roger E. Kaufman, Walter G. Maurer
Venue: Proceedings of the 1971 26th annual conference (1971)

An interactive computer program for the kinematic synthesis of motion or function generating linkages is described. The system has been implemented on an 8K IBM 1130 with a storage tube display and a custom-built &ldquo;globe&rdquo; graphical input device. The desired performance of the mechanism at four or five prescribed finitely separated positions is specified to the computer, as is the geometry of the fixed and moving bodies. Graphical input devices, or a keyboard, or cards can be used for this purpose. Interactive graphics capability allows input, modification, and display of a complex moving body and fixed frame. Burmester circlepoint-centerpoint curves or Burmester point pairs are displayed for the specified motion, together with a number of other options such as relative poles of rotation. A dynamic cursor which traverses the circlepoint-centerpoint curves allows selection of input and output links of either a four-bar linkage, a slider-crank mechanism, or a turning-block mechanism capable of satisfying the prescribed input criteria. A flashing display aids in selection of circlepoint-centerpoint pairs by indicating the type of linkage that would result from choice of the link being displayed at that instant Grashof's criteria are used to determine whether such a choice would result in a drag link, double rocker, or crank rocker mechanism. Similar criteria have been developed for the slider and turning block equivalents of these mechanisms. The selected linkage can then be animated on the display screen. Continous display of its transmission angle is optional. Examples are given of the practical use of the program.
Testing polynomials which are easy to compute (Extended Abstract)
Authors: J. Heintz, C. P. Schnorr
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We exploit the fact that the set of all polynomials P&egr;@@@@[x1,..,xn] of degree &le;d which can be evaluated with &le;v nonscalar steps can be embedded into a Zariski-closed affine set W(d,n,v),dim W(d,n,v)&le;(v+1 +n)2 and deg W(d,n,v)&le;(2vd)(v+1+n)2. As a consequence we prove that for u:&equil; 2v(d+1)2 and s:&equil; 6(v+1+n)2 there exist &abarbelow;1,..,&abarbelow;s&egr; [u]n &equil; {1,2,..,u}n such that for all polynomials P&egr;W(d,n,v):P(&abarbelow;1) &equil; p(&abarbelow;2) &equil;...&equil; p(&abarbelow;s) &equil; O implies P&Xgr;O. This means that &abarbelow;1,...,&abarbelow;s is a correct test sequence for a zero test on all polynomials in W(d,n,v). Moreover, &ldquo;almost every&rdquo; sequence &abarbelow;1,..,&abarbelow;s&egr;[u]n is such a correct test sequence for W(d,n,v). The existence of correct test sequences &abarbelow;1,..,&abarbelow;s&egr; [u]n is established by a counting argument without constructing a correct test sequence. We even show that it is beyond the known methods to establish (i.e. to construct and to prove correctness) of such a short correct test sequence for W(d,n,v). We prove that given such a short, correct test sequence for W(d,n,v) we can efficiently construct a multivariate polynomial P&egr;@@@@[x1,..,xn] with deg(P) &equil; d and small integer coefficients such that P@@@@ W(d,n,v). For v>n log d lower bounds of this type are beyond our present methods in algebraic complexity theory.
On the parallel computation for the knapsack problem
Authors: Andrew Chi-Chih Yao
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We are interested in the complexity of solving the knapsack problem with n input real numbers on a parallel computer with real arithmetic and branching operations. A processor-time tradeoff constraint is derived; in particular, it is shown that an exponential number of processors have to be used if the problem is to be solved in time t &le; @@@@n/2.
Bibliometric analysis of ISI's Arts & Humanities Citation Index (abstract only)
Authors: Morton V. Malin, Martha C. Dean
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

The most frequently cited journal articles in the Arts amp; Humanities Citation Index (A amp;HCI) are analyzed in terms of their disciplinary classification. Four years (1976-79) of the A amp;HCI data base yielded 144 journal articles which were cited 10 or more times during the period. These articles are predominantly from the disciplines of Language and Linguistics (31%), Philosophy (23%), History (13%), Religion (8%), and Archeology (6%).However, most citations in the A amp;HCI are to books rather than journal articles (96% versus 4% among those items cited 10 or more times). The discipline of Literature (or Literary Criticism) is predominant in the list of highly cited books.These statistics suggest systematic variation in the resources used by the different disciplines. Various other aspects of the A amp;HCI data base are explored, and some specific examples are discussed in depth.
On attaining reliable software for a secure operating system
Authors: Lawrence Robinson, Karl N. Levitt, Peter G. Neumann, Ashok R. Saxena
Venue: Proceedings of the international conference on Reliable software (1975)

This paper presents a general methodology for the design, implementation, and proof of large software systems, each described as a hierarchy of abstract machines. The design and implementation occur in five stages as described in this paper. Formal proof may take place at each stage. We expect the methodology to simplify the proof effort in such a way as to make proof a feasible tool in the development of reliable software. In addition to the anticipated advantages in proof, we feel that the methodology improves a designer's ability to formulate and organize the issues involved in the design of large systems, with additional benefits in system reliability. These advantages remain even if proof is not attempted. We are currently applying this methodology to the design and proof of a secure operating system. Each level in the system acts as a manager of all objects of a particular type (e .g ., directories, segments, linkage sections), and enforces all of the protection rules involved in the manipulation of these objects. In this paper we illustrate the methodology by examining three of the system levels, including specifications, for a simplified version of these levels. We also demonstrate some proofs of security-related properties and of correctness of implementation.
Estimating the total real property value of geographic areas for equalization&mdash;a computer simulation
Authors: James M. Kraushaar, Steven Hershey
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

A computer model of the equalization rate determination procedure is presented. Several changes in sampling and estimation parameters are examined using a full factorial design.
PLAN*IT: Simulation applied in a marketing decision system
Authors: Stanton G. Cort, Luis V. Dominguez
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

PLAN*IT is an on-line strategic marketing planning model geared to multigoal, multiperiod, multiproduct blending of the marketing mix of a manufacturer competing under oligopolistic market conditions and selling through channel intermediaries. This paper describes PLAN*IT's role and benefits in the strategic marketing planning process and examines the essential features of PLAN*IT's underlying mathematical model.
Hybrid trees: A data structure for lists of keys
Authors: W. A. Walker, C. C. Gotlieb
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

A generalization of the binary tree and the Trie, called the hybrid tree, is defined in which a node can correspond to a key, to any substring in a key, or to a character of the alphabet from which the keys are formed. An algorithm is given for constructing an optimal hybrid tree and it is shown that the search time of an optimal hybrid tree is never larger than the search time of the Trie or the optimal binary tree representing the same set of keys.
Creating high computer impact in a small liberal arts college
Authors: B. L. Houseman
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

During the period from 1977 to 1979, computer usage at Goucher College went from an involvement of 10% to 60% of the student body; a goal of 90% appears to be within reach by 1981. During the past two years, approximately 40% of the faculty have begun to use the computer in some way. This rapid rise in computer usage was accomplished without the introduction of a required course in computing, without acquisition of an on-campus macrocomputer or mini-computer, and without creation of a Computer Center staff devoted to academic computing.
System documentation as software
Authors: Geoffrey James Sickler
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

Accuracy, Timeliness, Flexibility, and Low Cost&mdash;computer buyers want BETTER documentation, they want it NOW, they want it to suit THEIR NEEDS, and they want it CHEAP. Unfortunately, current documentation methods have failed to satisfy these needs. The inadequacies of the traditional technical manual are well known to anyone who has tried to use one, regardless of the herculean effort it probably took to collect and publish the damn thing. Typically, the resources that could have been expended in making the manual easier to read were expended in an impossible battle to make the information available in a reasonable amount of time, without totally sacrificing the accuracy of its contents. The solution to this dilemma lies in changing the way that we view documentation. We must stop thinking of documentation as pieces of paper and start thinking of it as software.
A generalization and proof of the Aanderaa-Rosenberg conjecture
Authors: Ronald L. Rivest, Jean Vuillemin
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

We investigate the maximum number C(P) of arguments of P that must be tested in order to compute P, a Boolean function of d Boolean arguments. We present evidence for the general conjecture that C(P)&equil;d whenever P(0d) @@@@ P(1d) and P is left invariant by a transitive permutation group acting on the arguments. A non-constructive argument (not based on the construction of an &ldquo;oracle&rdquo;) proves the generalized conjecture for d a prime power. We use this result to prove the Aanderaa-Rosenberg conjecture by showing that at least v2/9 entries of the adjacency matrix of a v-vertex undirected graph G must be examined in the worst case to determine if G has any given non-trivial monotone graph property.
Some constraints and tradeoffs in the design of network communications
Authors: E. A. Akkoyunlu, K. Ekanadham, R. V. Huber
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

A number of properties and features of interprocess communication systems are presented, with emphasis on those necessary or desirable in a network environment. The interactions between these features are examined, and the consequences of their inclusion in a system are explored. Of special interest are the time-out feature which forces all system table entries to &ldquo;die of old age&rdquo; after they have remained unused for some period of time, and the insertion property which states that it is always possible to design a process which may be invisibly inserted into the communication path between any two processes. Though not tied to any particular system, the discussion concentrates on distributed systems of sequential processes (no interrupts) with no system buffering.
PL/I Reducer and Direct Processor
Authors: Masakatsu Sugimoto
Venue: Proceedings of the 1969 24th national conference (1969)

A computing system is discussed which is aimed at high speed execution of programs written in a problem-oriented language. This computing system has a new machine language. Parallel processing of consecutive instructions and the type of data conversion required for an operation can be easily indicated in the machine language. PL/I is selected for a problem-oriented source language. The programming system in which a source program is translated into the machine language is analyzed and implemented. The hardware system which executes the machine language is studied and the system is planned. In the system, the machine language is decoded and executed at high speed by refined operation units. The language-directed computer design technique discussed here is becoming increasingly important.
Laying the power and ground wires on a VLSI chip
Authors: Anderew S. Moulton
Venue: Proceedings of the 20th Design Automation Conference (1983)

This :paper presents the approach of MIT's Placement-Interconnect (PI) Project to routing noncrossing VDD and GND trees in single-layer metal. The input to the power-ground phase is a set of rectangular modules on a rectangular chip. There is one VDD pad, one GND pad, and each module has one VDD terminal, one GND terminal, and a current requirement. The power-ground phase calculates a cycle that passes through every module once, dividing the VDD terminals from the GND terminals. This splits the chip into a VDD region and a GND region. Signal-routing techniques find a short Steiner tree in the VDD region t h a t connects the VDD terminals to the VDD pad. This Steiner tree consists of minimum width metal wires. The same techniques route the GND tree. Using each module's current requirement, tree-traveral determines the current requirement and required width of each wire of the trees. Techniques used to widen overcrowded channels widen the wires, producing the final VDD and GND trees.
Introducing Ada
Authors: William E. Carlson, Larry E. Druffel, David A. Fisher, William A. Whitaker
Venue: Proceedings of the ACM 1980 annual conference (1980)

The Ada programming language was finalized in July 1980 with the publication of the proposed standard Ada Language Reference Manual [A1]. That standard document is being reviewed for clarity and internal consistency under American National Standards Institute (ANSI) canvas procedures in preparation for the issuance of an ANSI Standard for Ada. Ada is also on the agenda of the International Standards Organization (ISO). The United States Department of Defense (DoD) has sponsored the development of Ada to provide a standard machine independent high order language (HOL) for software which is embedded in or procured as part of major defense systems. Examples of the intended applications include communications, avionics, air traffic control, missile guidance, and battlefield or shipboard decision support. Computers are usually dedicated to these applications. Frequently, they must operate in unfriendly environments, and are specially hardened to withstand shocks, vibrations, temperature fluctuations and other environmental stresses. DoD's annual investment for software to run on these embedded computers far exceeds that for data processing applications such as payroll, inventory and financial management [C3].
Financial models (General)
Authors: John V. Baumler, F. J. Brewerton, William B. Allen, Phillip M. Wolfe, Donald F. Deutsch, Thomas J. Hindelang, Andre Fourcans, Eugene Comiskey, Mel Greenball, Kenneth Siler, Harry Grossman
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This session reports upon several uses of simulation methodology in finance and accounting. Two papers consider the effect of variability, variability assumptions (e.g. normality), and uncertainty on measurement of investment returns. In addition two applications of simulation in financial planning and control will be discussed.
New bounds for parallel prefix circuits
Authors: Faith E. Fich
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

In this paper, new upper and lower bounds are obtained for the number of gates in parallel prefix circuits with minimum depth when the number of inputs is a power of two. In addition, structural information concerning these circuits is described. Parallel prefix circuits with bounds imposed on the fan-out of the gates are also considered. In both cases, the upper and lower bounds obtained differ by small constant factors.
Modeling the interaction of light between diffuse surfaces
Authors: Cindy M. Goral, Kenneth E. Torrance, Donald P. Greenberg, Bennett Battaile
Venue: ACM SIGGRAPH Computer Graphics (1984)

A method is described which models the interaction of light between diffusely reflecting surfaces. Current light reflection models used in computer graphics do not account for the object-to-object reflection between diffuse surfaces, and thus incorrectly compute the global illumination effects. The new procedure, based on methods used in thermal engineering, includes the effects of diffuse light sources of finite area, as well as the &ldquo;color-bleeding&rdquo; effects which are caused by the diffuse reflections. A simple environment is used to illustrate these simulated effects and is presented with photographs of a physical model. The procedure is applicable to environments composed of ideal diffuse reflectors and can account for direct illumination from a variety of light sources. The resultant surface intensities are independent of observer position, and thus environments can be preprocessed for dynamic sequences.
Privacy and protection in operating systems (Panel Session)
Authors: James P. Anderson, Peter Denning, Roger P. Schell, Clark Weissman
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

In order to allow many users to share a computer system simultaneously in which there is permanent storage of information, some of which must not be examined or altered by some of the users of the system, we must take certain steps to insure the privacy and protection of the information in the system. We must also protect the computer system itself from unauthorized use. The panelists will address themselves to a narrow aspect of the overall security question: the technical aspects of software and hardware, particularly related to operating systems, which need to be considered. Such topics as cryptographic techniques and physical security arrangements, though important, will not be included. This session is the outgrowth of a workshop on this topic held in June at Princeton, New Jersey. A detailed report of the workshop will appear in a future issue of Computer, a magazine published bimonthly by the IEEE Computer Society. The panelists will be asked to address themselves to the following questions: What are the chances we will have secure shared systems in the next few years? What requirements must be satisfied to insure that a system is secure or not? What privacy and protection mechanisms are in view which will help this problem? What deficiencies have been shown to exist in present systems, and can they be cured?