ppxscal/embedding_network huggingface dataset:
A Pageable Memory Dictionary Information Retrieval System
Authors: Ed Pearce, George Dailey, Allen Menard, Barry L. Bateman, Gerald N. Pitts
Venue: Proceedings of the ACM annual conference (1973)

A Pageable Memory Dictionary Information Retrieval System (PMD) was designed and implemented using a time-sharing operating system under the virtual memory concept. The PMD system utilizes three separate data bases which may be used independently or in conjunction with each other, depending on the search parameters entered into the system. The PMD system was designed to use the ACM Computer Review Number and Category Number in addition to the normal search parameters. The test data base was formulated using information from the ACM Computing Reviews. The presentation includes the design criteria, file descriptions, retrieval techniques, examples of the retrieval process and their associated timings, and conclusions.
An adaptive timeout algorithm for retransmission across a packet switching network
Authors: Stephen William Edge
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

This paper presents and analyses a simple algorithm for setting an adaptive timeout value at a source Host for end-to-end retransmission on a packet-switched connection. The algorithm allows the recipient Host to acknowledge arriving data in either original transmission order or out-of-order. The time out at the source Host is determined from current estimates - using exponentially weighted moving averages - of the mean and variance of successive acknowledgement delays. We show that when these delays are random variables forming certain stationary or non-stationary stochastic processes, the ensuing timeout gives a near-minimum retransmission delay, subject to some specified limit on the amount of unnecessary retransmission. This property is illustrated for a simulated sequence of acknowledgement delays obtained from loop delay measurements.
The complexity of propositional linear temporal logics
Authors: A. P. Sistla, E. M. Clarke
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

We consider the complexity of satisfiability and determination of truth in a particular finite structure for different propositional linear temporal logics. We show that both the above problems are NP-complete for the logic with F operator and are PSPACE-complete for the logics with F,X, with U, with U,S,X, and Wolper's extended logic with regular operators [Wo81].
Factorization of polynomials over finite fields and factorization of primes in algebraic number fields
Authors: Ming-Deh A. Huang
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Based on Kummer Theorem, we study the deterministic complexity of two factorization problems: polynomial factorization over finite fields and prime factorization in algebraic number fields. We show that factoring polynomials of degree n in Fp[x], with p prime, is polynimially equivalent to factoring p in algebraic number field of extension degree n over Q, where p is &ldquo;regular&rdquo; with respect to the generating polynomials of the number fields. Part of the proof also yields an efficient polynomial time algorithm for computing the factorization pattern. Number theoretical methods are then developed to solve two important kinds of polynomials:&fgr;n(x) mod p where &fgr;n is the n-th cyclotomic polynomial, and xn. - &agr; mod p where &agr; &egr; N. We show that when Extended Riemann Hypothesis is assumed, all the roots of both kinds of polynomials in Fp can be found efficiently in time polynomial in n and logp. As &agr; consequence, when p &Xgr; 1(n), factorization of p in the n-th cyclotomic field can be computed in polynomial time. The result on finding all roots of xn &Xgr; &agr;(p) extends &agr; result of Adleman, Menders, and Miller, which states that the least root of xn &Xgr; &agr;(p) can be found in polynomial time, when Extended Riemann Hypothesis is assumed.
APL2M-a general computer-aided software engineering environment for mini and microcomputers
Authors: Jean Rohmer
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper explains how to use APL to build assemblers, PASCAL-like dialects, or special purpose languages. Our technique is to use APL not as a programming language but as an interactive software engineering environment Our experience is that modern programming techniques like extendibility, program and data structuring can be made available to mini and microcomputer programmers at a minimum expense and very quickly.
A major in information systems
Authors: Fred J. Maryanski, Elizabeth A. Unger
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

An information systems major is presented as a second offering by a computer science department. The rationale for the degree program is based upon the demands of industry for graduates skilled in database and information systems. Courses in COBOL, business data processing, database management, and systems analysis are included in the information systems curriculum to prepare the student for employment in the business systems area. The contents of the courses in the information systems core curriculum at Kansas State University are presented as an example of an implemented degree program. In addition, the information systems curriculum is analyzed in terms of its differences with the Curriculum 78 computer science curriculum and of the resources required for its implementation.
Some I2L circuits for multiple-valued logic
Authors: James H. Pugsley, Charles B. Silio,  Jr.
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

While various integrated circuit technologies have been proposed for multiple-valued logic, it appears that for the near future current-mode integrated injection logic (I2L) will predominate. The present paper suggests I2L circuits for the various gate types and design approaches that have been proposed, including some memory elements, and discusses some of the problems of using I2L multiple-valued logic chips in practical designs.
A project oriented course on software engineering
Authors: Sallie Henry
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

This paper makes an attempt to outline Software Engineering course with particular attention on the administration of the project. Section II describes the type of students taking the course, and a general description of the topics covered in the course. In section III the project itself is discussed with attention focused on the need for a project, what is expected of the students and the administration of the project. Section IV describes how parts of the course have been automated to relieve some of the problems of administration. Finally, the last section of the paper summarizes the impact of this course on the students and their employers.
VLSI design methodology the problem of the 80's for microprocessor design
Authors: Bill Lattin
Venue: Proceedings of the 16th Design Automation Conference (1979)

The rapid evolution of semiconductor technology continues to make possible increasingly sophisticated electronic systems on single chips of silicon. By 1982, a single silicon chip is projected to have well over 100,000 transistors. This level of complexity represents a major problem for the VLSI designer in the 1980's. Unless there is a fundamental change in design methodology, this level of VLSI technology will be grossly under-utilized due to the problems of design, layout and checking. With present design methods, the mask set for a 100,000 transistor MOS chip will take 60 man years to lay out and another 60 man years to debug.
A second chance at automation as a design tool
Authors: Robert J. Hogan
Venue: Proceedings of the 14th Design Automation Conference (1977)

Much of the research that has taken place over the past ten years has focused on finding the link between the scientific aspects of computer technology and the non-scientific aspects of design. In the academic environment, this has resulted in the treatment of computers and design as separate entities. Teaching according to this concept has made it difficult for architecture students to comprehend exactly what role the computer could play in the development of their own individual design process. The College of Environmental Design at the University of Oklahoma is somewhat unique among schools of architecture in that only recently has it begun to develop curriculum input related to the topic of computer aided design. After almost eight years of researching and teaching this topic, This unique situation has offered me the opportunity to take a fresh new look at how computer aided design should be taught.
Rural medical care clinic simulation model
Authors: Richard A. Reid, Peter L. Asprey
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

An experimental medical care delivery system was established to provide medical services for a doctorless rural community by linking a remote rural clinic staffed with midlevel medical personnel to supervisory physicians at an urban location. This paper presents a GPSS computer simulation model designed to evaluate alternative configurations of the experimental medical care delivery system. First, the operational components of the delivery system are briefly described. Next, a description of the computer simulation model is presented. Finally, the results of four experiments conducted with the simulation model to evaluate variations in operational configurations are summarized.
An integrated [two- and four- year] curriculum in information processing at a state technical college
Authors: Harold Joseph Highland, Charles B. Thompson
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

This paper is a report of one effort to develop a new curriculum in information processing to provide for: [1] a two-year program, which can be integrated into [2] a four-year program at our College, and simultaneously [3] articulate the transfer of graduates from neighboring community colleges into the upper division permitting the full transfer of 64 college credits.
A unified approach to models of synchronous parallel machines
Authors: Leslie M. Goldschlager
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

A number of different models of synchronous, unbounded parallel computers have appeared in recent literature. Without exception, running time on these models has been shown to be polynomially related to the classical space complexity measure. The general applicability of this relationship is called &ldquo;the parallel computation thesis&rdquo; and strong evidence of its truth is given in this paper by introducing the notion of &ldquo;conglomerates&rdquo; - a very large class of parallel machines, including all those which could feasibly be built. Basic parallel machine models are also investigated, in an attempt to pin down the notion of parallel time to within a constant factor. To this end, a universal conglomerate structure is developed with can simulate any other basic model within linear time. This approach also leads to fair estimates of instruction execution times for various parallel models.
The integration of a Problem Solving Process in the first course
Authors: Daniel C. Hyde, Ben D. Gay, Donald Utter,  Jr.
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

Introductory computer science courses should incorporate a problem solving approach as a pedagogical framework. Many first courses hand out problems to be solved and ask the students for solutions, but very few explicitly teach a problem solving methodology. The authors have developed a simple methodology called the &ldquo;Problem Solving Process&rdquo; (PSP) which focuses on the designing of computer programs for realistic problem situations in the introductory courses. This Problem Solving Process (PSP) is formulated to allow the integration of problem solving throughout the course. Through this integration, the course guarantees active student participation in learning about problem solving techniques as well as performing the act of problem solving.
Network protocol: A structured approach
Authors: Tat Y. Choi, Raymond E. Miller
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Network protocols are modeled by processes exchanging messages through communication channels. For finite state protocols, each process participating in the protocol can be represented by a finite state graph. In this paper, we introduce a structuring principle for finite state protocols in the form of subgraphs. By structured protocols, we mean the following. The protocol graph can be partitioned into or be constructed from subgraphs each having a unique entry node and zero or more exit nodes. The exit nodes of one subgraph can be connected only to the entry nodes of other subgraphs. Moreover, a process in one subgraph can exchange events with another process in its corresponding subgraph only, i.e. there are no 'cross interaction' between subgraphs. Finally, from the standpoint of protocol design or synthesis, we require that when one process makes a transition into another subgraph, the other process will follow suit. Protocols that satisfy the above properties are structured in the sense that their logical correctness can be inferred from the logical correctness of individual protocol subgraphs.
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Authors: Qing Dai, Jie Wu
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless network, where each node uses the same transmission power, while maintaining network connectivity. Three different algorithms, binary search, Prim's MST and its extension are developed to solve the problem, and their performance is compared by simulation study together with Kruskal's minimum spanning tree (MST), a known solution proposed by Ramanathan and Rosales-Hain for topology control by transmission power adjustment. Our results show that Prim's MST outperforms both Kruskal's MST and binary search. The performance between Prim's MST implemented with binary heap and Fibonacci heap is fairly close.
A low cost satellite for fast interactive graphics in a time-sharing environment
Authors: B. Meyer
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes a system that improves the performance of a time-shared host computer for users of TEK-TRONIX series 4010/4014/4015 graphics terminals. The system consists of a mini or microcomputer situated at the terminal, a program that runs in the satellite computer, and a library of FORTRAN callable subroutines that provide a convenient interface between an application program in the host computer and the program in the satellite computer. The system ensures that the satellite has advance information about the expected dialogue, so that the satellite is able to react instantly to input from the user, even if the response of the host computer is slow. The satellite gathers several trivial inputs together and sends them to the host in a burst. This allows the program in the host to process more information each time it is rolled into memory, hence the efficiency of its operation is improved. The satellite also performs such operations as zooming, repainting and identification of entites on the screen.
Systems programming tools
Authors: Harold A. Driscoll
Venue: Proceedings of seventh international conference on APL (1975)

APL, both as a language and as a time sharing implementation, provides a powerful vehicle for constructing systems programming tools. This paper describes one such workspace for working with OS MVT, its uses, and some of the techniques used in constructing it.
Automating the Technical Publications Department
Authors: John D. Browne
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

A DAY AT THE OFFICE&mdash;1995 By the time George Denning arrives at his office at Seacom, Inc., at 10:30 a.m. this morning, he has already done three hours of work. George, a Senior Technical Writer in the Software Publications Department, wanted some isolation this morning to edit a particularly tricky section in a user guide. His home computer, hooked up to Seacom's host computer through the local cable network, allowed him to edit the document on-line in the quiet of his den, browse through his company mailbox, and glance at the latest changes to a functional specification Fred Herbert has been working on. Although Fred is the analyst in charge of project development, George is responsible for all ergonomic considerations. Wishing to avoid the chit-chat of a telephone call, George linked up with Fred and the user liason on the project for a three-way computer conference. In five minutes George had explained the problem he had found, and, with the three looking at the specifications on-line, had changed it to everyone's satisfaction. Finished, George logged off of Seacom and left for the office. Arriving at Seacom, George gets a cup of tea and turns on his terminal. The system alerts him that a document has been returned from review. Although the committee members are scattered around the country, it has only taken five days for the entire review cycle. All of the comments have been made on-line. George calls up the review copy on his terminal. The text of the document is formatted on the screen, and blinking red arrows scattered throughout the document show where comments were made. George issues a command, and the document compresses onto the left-hand half of the screen, while the comments appear on the right-hand half. In an hour he has made the changes and sent the file off to the certification board for approval. Reviewing the document he edited at home in the morning, George decides an illustration is called for. He queries the Corporate Graphics Library on-line for similar illustrations. The description of one sounds promising. Calling it up on the screen, he decides that, with a few changes, it will fill the bill. Rapidly he draws a few more lines and connectors, adds a photo of a particular device (copied from the corporate photo archives in digital form) and incorporates it into his document as a figure. The system instantly boxes and labels it, and updates the List of Figures in the Table of Contents.
ALGOL 68 might-have-beens
Authors: S. G. van der Meulen
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

This paper discusses some language features which might have been in ALGOL68. They would not have complicated the compiler to any considerable extent. They would certainly have contributed to the expressive power of the language. In fact their desirability emerged from the practice of ALGOL68 programming (cf. {4}). &ldquo;Might-have-beens&rdquo; are small super-language features and some of them could even be considered as &ldquo;might-be&rdquo;s in the sense that they still might be incorporated in existing compilers without (great) difficulty. A few of these &ldquo;lost chances&rdquo; have deeper roots and may contribute to the development of future languages.
Pascal procedures and functions for teaching linear data structures
Authors: Joseph M. Fontana
Venue: ACM SIGCSE Bulletin (1983)

Textbook subprogram packages for abstract data structures are often inadequate, inconsistent in design, or are listed as exercises. This paper presents three packages of coordinated Pascal procedures and functions that overcome these deficiencies for a selection of linear data structures. The packages are for array- and link-based stacks and link-based queues. Design guidelines for developing the packages are discussed, and examples of exercises using them are included.
Top down design and testability of VLSI circuits
Authors: Ph. Basset, G. Saucier
Venue: Proceedings of the 19th Design Automation Conference (1982)

A top down design methodology of VLSI Circuits used at the University of Grenoble is briefly presented. The choice of a data path is analyzed with respect to testability and diagnosability requirements. Design modifications (in terms of special test control) help achieves the testability requirements. Such an approach helps to avoid costly techniques like additional scan pathes (LSSD, Bilbo) Combined with dynamic analysis techniques (Stroboscopic analysis), this approach produces efficient VLSI tests.
Design of a microprogrammed alphanumeric terminal
Authors: F. Dromard
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The development of LSI microprocessors in terminal controllers enables tasks decentralization and increases the terminal performances for a lower cost. This paper describes a small alphanumeric display giving the user the opportunity of programming in a high level language, in a conversational mode. The microprocessor manages: the control of the keyboard, the display of the current sentence, the exchanges with the main computer. It also controls a syntactic filtering of the user's sentence. The keyboard is composed of alphanumeric and function keys. The alphanumeric text is not processed, while function keys are considered as delimiters. Each keyword of the language is assigned a keyboard position. The microprocessor has a grammar defining the syntactic rules; the processor generates a coded string corresponding to the sentence. This will be transmitted only if the sentence is correct. The user can modify at any instant the elements of his sentence. The terminal performances can be extended to several languages. To change the language, one has only to replace the grammar and the corresponding microprograms. These ones, such as the grammar, can either be resident or they are sent by the main computer, according to the requirements.
Localized search in sorted lists
Authors: S. Rao Kosaraju
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

It is well known that every one of the set operations insert, delete and member can be performed in O(log n) steps, where n is the number of elements currently in the set. Here we implement these operations and a move operation for a sorted list with f fingers (points of reference) established on the list. It is shown that these operations can be performed in O(log d) steps, where d is the distance between the corresponding finger and the key involved.
An APL environment for testing relational operators and search algorithms
Authors: F. P. Palermo
Venue: Proceedings of seventh international conference on APL (1975)

A description of an APL implementation of the relational operations of join, division, union, intersection, difference and projection is given. A number of functions are also described which are combined to provide an environment for testing search algorithms on a relational data base. These include functions to express a query as a normalized expression in the relational calculus, the conversion of this expression to a set of retrieval tables and the construction of the response relation. The relational database consists of a number of relations stored as CMS files in a virtual machine environment. The database operations use the external file handling capabilities of an APL system under VM.