ppxscal/embedding_network huggingface dataset:
Student consulting&mdash;the front line troops
Authors: John E. Tuecke, James J. Quinn
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

In order to understand fully the role of the student consultant in our environment, one must first understand the organization and philosophy of Academic Services. While we have people with expertise in such areas as statistics, numerical mathematics, mini-computers, image processing, graphics, and documentation preparation, we have done very little compartmentalizing of people or activities. In particular, we have not designated certain full-time staff members as consultants while others are exempt or shielded from this activity. Everyone is expected to participate in software development projects and everyone is expected to be involved in consulting with users. This approach was used as an expediency when our staff was small and continues by choice as our staff has increased. The benefits of feedback on user needs and problems and the stimulation and cross fertilization that accompanies these consulting activities seems to outweigh the disadvantages.
On breaking generalized knapsack public key cryptosystems
Authors: Leonard M. Adleman
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

In this paper new methods, generalizing those of Shamir, are presented for attacking generalizations of the basic system. It is shown how these methods may be applied to the Graham-Shamir public-key crypto-system [2], and the iterated Merkle-Hellman public-key cryptosystem. We are unable to present a rigorous proof that the attacks presented here are effective. However, in the case of the Graham-Shamir system, the methods have been implemented and have performed well in tests. The method of attack uses recent results of Lenstra, Lenstra, and Lovasz [5]. The cryptanalytic problem is treated as a lattice problem rather than a linear programming one as in Shamir's result.
Computer supported study of chemical equilibria
Authors: Glenn Morris
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

In an analytical chemistry course at the undergraduate level, the student is confronted by a variety of important, yet subtle, principles. The student just introduced to this field must rely solely on the instructor to demonstrate, in great detail, all of the relationships and phenomena of chemical equilibrium. In the dissociation of a diprotic acid, the complexity and extent of the calculations involved demands that the instructor lecture on almost every value and trend that occurs. It is far too difficult for the student to generate enough experimental data to illustrate the principles he is studying. Thus, the computer, with its data handling and calculation abilities, can be of tremendous value. This project, developed over the last year, has placed a powerful tool in the student's hands. Now when he performs a titration of a weak diprotic acid he can assemble data through which all the basic principles of chemical equilibrium can be understood. No longer need he rely on lecture and rote memorization. This laboratory-assistance package allows the student to discover the important relationships for himself, through laboratory work and computer support.
Simulation structure for the development of Texas Instruments' Advanced Scientific Computer
Authors: Sidney D. Nolte, Marvin T. Talbott
Venue: Proceedings of the 1st symposium on Simulation of computer systems (1973)

During development of a large-scale computer system, design decisions must be based on more than intuition and past experience. As development continues past the design phase, it is necessary to provide tools to verify that a system or subsystem is doing what it was designed to do from both functional and performance standpoints. Furthermore, it is necessary to have some means of evaluating the effects of proposed changes to an operational system. One valuable tool in satisfying these requirements is simulation. In developing the Advanced Scientific Computer (ASC) system, Texas Instruments relied, in part, upon an extensive simulation capability. This paper describes the various simulators, how they were used in the development and checkout of the ASC, and how they are now being used to assist in &ldquo;tuning&rdquo; the system, and to evaluate potential configurations. The simulators described include: &bull; An operating system simulator which models the operating system program executing in the Peripheral Processing (PP) unit of the ASC. &bull; A Fuctional Unit Simulator (FUS) which models the various functional units of the ASC. This simulator is of special interest because of the variety of techniques it employs and the number of functions it serves. &bull; A Memory Subsystem Simulator which models the affects of multiple device (CP, PP, DISC, etc.) access to Central Memory. An Instruction Level Simulator (ILS) which is a classical interpretive simulator for use in program check out.
Full protection specifications in the semantic model for database protection languages
Authors: H. Rex Hartson, David K. Hsiao
Venue: Proceedings of the 1976 annual conference (1976)

The basic model of semantics for protection languages is reviewed. Advanced protection features are introduced into the model and their impact on authorization and enforcement is discussed. History keeping allows access dependency upon the occurrence of previous data operations. Auxiliary program invocation provides for additional (procedural) protection measures. Extended authorization permits a user to utilize, via authorized procedures, data which are not directly accessible by him. Examples are used to explain each of these features. The enforcement process for full specifications is illustrated with an example.
On abstractions of parallel programs
Authors: Thomas W. Doeppner,  Jr.
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We discuss a parallel program model that allows a very general synchronization mechanism with a scheduler to control the progress of processes &ldquo;undergoing synchronization.&rdquo; We how to &ldquo;abstract&rdquo; the program, i.e. remove the scheduler, resulting in a simpler program. We then show that, for a large class of schedulers, a process can become deadlocked in the original program iff it can become deadlocked in the abstracted program.
VDL&mdash;a Definition system for all levels
Authors: John A. N. Lee
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

The VDL system for the description of programming languages which was originally used for the definition of PL/I is extended to the description of processors. This paper shows the relationship between the language of definition and the abstract machine over which the semantics of the language are specified. It is demonstrated that the level of description can be chosen to suit the various needs of the computing community, each level being well nested within its outer level, whilst using only one language of definition. From the point of view of processor design, indications are given of the means by which a description can be transformed into an implementable system of data paths, registers and drivers.
Signal and noise in programming language
Authors: P. J. Plauger
Venue: Proceedings of the 1975 annual conference (1975)

It has been my observation that the syntax of a programming language affects how it is used all out of proportion to its importance in the overall scheme of things. Specifically, programmers tend to avoid long-winded constructs even after they have been assured that such forms make for nicer code. And they seem to delight in the terse, no matter what the cost in intelligibility or running time. Witness APL. That language at least has the virtue of being consistent; and one can argue at the other extreme that COBOL is uniformly wordy. Most languages are rather inconsistent, and few achieve that delicate balance between the concise and the cryptic that makes for a truly useful notation. It is important, then, to evaluate what parts of a language syntax provide useful signal to the reader, and what are simply noise.
X-Tree: A tree structured multi-processor computer architecture
Authors: Alvin M. Despain, David A. Patterson
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

The problem of organizing multiple, monolithic microprocessors into an effective general purpose computer structure is examined. A tree structure with extra interconnections was found to be especially attractive. It provides a structured hierarchy for control, addressing and message routing. More important, it appears to provide a mechanism to automatically migrate data abstractions and processes over the network of processors. The network can be expanded to any desired size and no global control or routine mechanisms are needed. The potential advantages and disadvantages of the X-Tree structure are discussed and the results of some static simulations are presented.
Decomposing a polygon into its convex parts
Authors: Bernard Chazelle, David Dobkin
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

A common operation in geometric computing is the decomposition of complex structures into more basic structures. Since it is easier to apply most algorithms to triangles or arbitrary convex polygons, there is considerable interest in finding fast algorithms for such decompositions. We consider the problem of decomposing a simple (non-convex) polygon into the union of a minimal number of convex polygons. Although the structure of the problem led to the conjecture that it was NP-complete, we have been able to reach polynomial time bounded algorithms for exact solution as well as low degree polynomial time bounded algorithm/or approximation methods.
Individual learning styles and computer science education
Authors: Stefan Feyock, Thomas Ford
Venue: Proceedings of the 1976 annual conference (1976)

Examination of the learning strategies of large samples of students reveals a natural classification on the basis of the strategy employed: serialist learners, who assimilate information by means of a &ldquo;bottom-up&rdquo; learning strategy, and holist learners, who utilize a &ldquo;top-down&rdquo; approach to learning. Since at present most teaching materials have a strong bias toward one or the other type of student, a significant subset of any class will receive mismatched instruction. This paper discusses techniques for designing educational material oriented toward each type of learning strategy, and describes an experiment designed to evaluate the effectiveness of these techniques.
Performance verification and system parameter identification of spacecraft tape recorder control servo
Authors: Asok K. Mukhopadhyay
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

NASA's 1976 Viking Mars Orbiters and the Voyager 1977 Jupiter-Saturn flyby spacecrafts carried digital tape recorders (DTR) on board. The recorders for both the missions were very similar except for the use of a brushless d.c. motor in the Voyager DTR. The mechanical part of the DTR consisted of fourteen rotating masses (tape reels, idlers and drive capstans) distributed in different planes and connected by three different elastic couplings (magnetic tape, peripheral belt and drive belts). Time simulations reported in this study were based on a program which employed first order integrators only. Severe numerical convergence problems were associated with the use of transfer function simulation subroutines available in the Continuous System Simulation Language (CSSL). The objective of this study is to verify the adequacy of design of the lead-lag compensator of the frequency loop, to check the accuracy of the analytical expression for the electrical motor transfer function (both arrived at empirically) and to understand in depth the performance of the speed control servo of the spacecraft DTR. Four aspects of the system dynamics were interactively adjusted to arrive at a number of stable system configurations, which had significantly different tape transport and/or compensator gain, DTR damping, system lag and electrical motor transfer function than envisioned in the nominal design by either the empirical or the linear frequency-domain methods.
A justification of, and an improvement on, a useful rule for predicting circuit-to-pin ratios
Authors: C. E. Radke
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

A rule for describing the circuit-to-pin relation has been quite useful as an aid to the packaging of electronic components in data processing machines. This rule, which in some circles is referred to as the Rent's Rule, is expressed as XN &equil; aXBr where XB is the number of circuits and XN is the number of pins per package. Historically Rent's Rule was established from experimental data which produced a close to linear pin-to-circuit relation on a log-log plot. In the past, the parameters, a and r, have been chosen within the following ranges depending upon the particular technology used: a, 3.0 to 5.0 r, 0.6 to 0.7 Previously the actual parameters have been derived experimentally. However, often an approximation of the pin-to-circuit relation before packaging is desired. To develop such an approximation it is assumed that a machine, its particular technology, and a partitioning algorithm which is expressed as a computer program are known.
SIGBDP 4 (Panel Discussion): EPOS in the distribution industry
Venue: Proceedings of the 1975 annual conference (1975)

With Electronic Point of Sale Computer Systems (EPOS), the distribution industry is fast becoming a primary user of distributive computing. These systems will bring computer power to retail stores with annual sales volumes ranging from &dollar;3 million to over &dollar;15 million. At this size, each store is a substantial and complex business by itself. In addition, these systems will bring the consumer in close contact with computers on a weekly basis. EPOS systems will be highly visible to the consumer, and gaining consumer confidence and acceptance will not be easy.
A cable-bus protocol architecture
Authors: David C. Wood, Steven F. Holmgren, Anita P. Skelton
Venue: Proceedings of the sixth symposium on Data communications (1979)

The benefits of general-purpose local networks are discussed and the requirements that such networks need to satisfy are defined. A generic network architectural model is described and the major design parameters identified. The role of the local network is to provide network transparency for a multiplicity of computer devices. How well this role is performed is a function of the protocol design and implementation. MITRE's Cablenet is one of several experimental cable-bus networks employing coaxial cable as a shared wideband transmission medium, and using microprocessor based interface units. This paper presents a protocol architecture design based on local network characteristics and the extensive computational capabilities expected from the next generation of microprocessors. We have designed a Flexible Transport Protocol which allows our cable-bus access node to assume a wide range of characteristics; these characteristics can be chosen judiciously to fulfil the needs of a wide spectrum of subscribers.
SILOG: A practical tool for large digital network simulation
Authors: N. Giambiasi, A. Miara, D. Muriach
Venue: Proceedings of the 16th Design Automation Conference (1979)

In this paper, the authors present a set of simulators for complex logical networks. On side of a briefly description of the simulators, emphasis is placed on developing user facilities.
An evaluation of the AUGMENT system
Authors: E. D. Callender
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

For a period of nine months the author used AUGMENT, an electronic office support system. This paper is an evaluation of that system. AUGMENT is a commercially available, time-shared system marketed by TYMSHARE. In an integrated manner, AUGMENT supports functions needed in any electronic office support system. These functions include word processing, electronic mail, computer conferencing and file sharing. It also supports a powerful and unique method of structuring and viewing a file. The author was a member of a group of six people who used the system in their daily activities. Many of the major functions of AUGMENT were regularly used during that period. The author found the system to be extremely supportive in his daily activities and believes that it allowed him to materially increase his productivity. The functions that were supported are reviewed and the strengths and weaknesses of AUGMENT as seen by the author are examined.
A microprocessor-based virtual memory system
Authors: M. D. Ruggiero, S. G. Zaky
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

This paper presents a virtual memory system which may be connected to the memory bus of a host computer. The system is based on the use of a separate processor to interface to the backing store and perform all the processing related to managing the virtual memory. The proposed approach provides a virtual memory that is transparent to the host processor, with one exception. When a memory reference generated by the host results in a page fault, a long delay is encountered. This delay corresponds to the time taken by the virtual memory controller to carry out a page transfer. A prototype system based on the above approach has been constructed. Bubble memory devices are used to implement the backing store. The suitability of bubble memories in this environment is discussed in the paper.
Complexity problems in real time computation
Authors: W. A. Burkhard
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

The study of computational complexity is continued under the additional requirement that the Turing machines operate in real time. The work reported here is motivated by that of Rabin [R] which asks implicitly about the computational power of n tape vs n+1 tape real time Turing machines and that of Hartmanis [H] who attempts a complexity measure for Turing machines in terms of reversals. The first result concerns itself with n tape real time Turing machines operating in a reversal bounded mode. A doubly infinite hierarchy (tapes-reversals) of classes of real time computable functions is shown to exist. The second result deals with n deterministic real time pushdown automata operating independently in parallel. It is shown that an increase in the number of pushdown automata operating in this manner always yields an increase in the computational power of the configuration.
Promoting instructional computing
Authors: Michael A. Steinberg
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

As the use of computers in our society has begun to grow at an exponential rate and, as it appears now, will continue to do so, it is our responsibility as computer professionals to provide students with computer exposure and computer literacy. Tomorrow's well-educated students will not only need to be exposed to the existence and use of computers but will need to be able to manipulate them for their individual purposes. It therefore becomes increasingly important for the educational institutions in this country to promote the use of computing both in and out of the classroom. For a number of reasons, this has not been done as rapidly as we would have liked to see. It then becomes an important responsiblity for the computer professional to assume some of these promotional responsibilities. This paper will address reasons why instructional computing has not been emphasized more in higher education and ways in which it might be possible to change this situation.
Current status of AED
Authors: Douglas T. Ross
Venue: Proceedings of the SHARE design automation project (1965)

At the previous SHARE Design Automation Workshop a general description of the then current activities of the MIT Computer-Aided Design Project was given. The principal activities which were outlined were: (1) The cooperative AED-1 Project in which visiting staff programmers from industry join with our MIT staff in the research and development of advanced compiler and language processing techniques to serve as the foundation for a total Computer-Aided Design System for man-machine problem solving, (2) Studies of mixed verbal and graphical language processing by the uniform techniques of the Algorithmic Theory of Language. Since that time extensive progress has been made in both of these areas.
Scheduling of patients and resources for ambulatory health care
Authors: Stephen R. Smith, Bernard J. Schroer,  Ph.D., Robert E. Shannon,  Ph.D.
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

This paper presents the results of a study of the scheduling of patients and resources in one of the Family Practice Units of The University of Alabama in Huntsville's Ambulatory Care Center. The objective of the study was three-fold: 1) Determine the maximum number of patients the physician staff can see in a 3-hour session, 2) Find the patient appointment schedule for this load that minimizes patient waiting without impacting through-put, and 3) Determine the number of nurses and examining rooms needed to process this patient load in the most efficient, cost-effective manner. A detailed computer model of the Unit was written using SLAM (Simulation Language for Alternative Modeling) which incorporated parameters for theoretical distributions based on nearly a month's actual data taken in the Unit. Using the computer model a number of patient loads, appointment schedules, and resource allocations were examined. A general cost/benefit equation was formulated for evaluating the alternatives, and recommendations were made on how to optimize the Unit's operation.
ACCLAIM&mdash;a computer aided design system
Authors: Miles D. Aakhus, D. Michael Seeman, Donna C. Mazzola, Eugene J. Ptak
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

ACCLAIM&mdash;Automated Circuit Card Layout and Implementation&mdash;is a family of computer programs, written in FORTRAN IV, which reduces Boolean equations to logical elements, translates the logical elements to physically realizable gates, synthesizes the gates into a switching network, and topologically configures a printed circuit card. It then determines the connection signal paths and produces artwork which is photographically processed into an etching template.
The emergence of computational arithmetic as a component of the computer science curriculum
Authors: David W. Matula
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

By computational arithmetic we shall mean the study of those discrete numeric systems suitable for implementation on a digital computer. The structure and limitations of discrete arithmetic, the notions of mixed base and mixed type arithmetic, the incurred &ldquo;roundoff error&rdquo; of psuedo-real arithmetic, and the efficiency of realization of arithmetic operations all form integral parts of this discipline. The foundations for this material are drawn from the logician's analysis of computability, the electrical engineer's analysis of boolean networks, the number theorist's analysis of elementary number theory, and the numerical analyst's study of numerical approximation. The cohesive thread uniting these topics is the relevance to computerized discrete computation, and what emerges is a firm discipline for inclusion in the complete Computer Science Curriculum. The central body of this material certainly should be a prerequisite for anyone who must design hardware and/or software to implement the arithmetic called for in a high level language.