ppxscal/embedding_network huggingface dataset:
Mediator: An integrated approach to Information Retrieval
Authors: Jacob Slonim, Fred J. Maryanski, Paul S. Fisher
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

Mediator: An Integrated Approach to Information Retrieval The Mediator is a pseudo intelligent software controller which accomplishes two ends. First, it -&-ldquo;mediates-&-rdquo; between an Information Retrieval System and its end-user. On the assumption that the user of such a system will have at best a minimal knowledge of the operations of computers, it hides from him the internal complexities of the system, and presents to him a simplified -&-ldquo;abstract-&-rdquo; of the operations of the system. The Mediator allows the end-user to communicate with any application program in his own terms and to carry out operations of any degree of complexity which can be defined within those terms. Secondly, the controller enables a single system to extract unified information from data-banks of both data base management and textual environments. The Mediator is driven by a combination of hierarchically structured internal and external tables. The external tables contain a vocabulary selected by the user for his personal communication with the system; the internal tables contain directives which determine the appropriate path to be followed by the retrieval system in accomplishing the user's request.
Progress report on the study of program reading
Authors: Philip Koltun, Lionel E. Deimel,  Jr., Jo Perry
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

We present some ideas here about prose reading comprehension tests, with analogies to program reading exercises, and suggest the potential usefulness of a standardized, nationwide program reading comprehension test as a means to assess on a comparative basis individual and department-wide progress through the computer science curriculum. We conclude with a research agenda on program reading and encourage contributions to the work from interested colleagues.
Simulation of a railed automated highway
Authors: Donald Ingerman
Venue: Proceedings of the second conference on Applications of simulations (1968)

This paper is concerned with a useful application of simulation to aid the systems design of a high speed intercity ground transportation system. The approach simulated utilizes a computer controlled constant speed main-line railed vehicle carrying occupied vehicles, freight, and passenger modules. Shuttle trains mate with the main-line trains at transfer points, and simultaneously transfer vehicles on and off the main-line train at full speed. The simulation results showed the minimum headways possible for the various shuttle configurations under study, the vehicle handling capacity for the different configurations, and vehicle speed through the system. GPSS/360-NORDEN was used with its ability to use the 2250 display unit. This facilitated the development of systems studies.
On the effective use of the individual programmer and the programming team
Authors: Stephen W. Smoliar, Lynne Weber
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

The effective structuring of programming teams must be viewed as a managerial problem of organizational design. Finding individuals who are skilled in the techniques necessary for a programming task is only a partial solution to this problem. A collection of skilled individuals does not necessarily constitute an effective team. Anyone who has ever worked on a team, successfully or unsuccessfully, can appreciate the importance of interaction among team members and how this interaction can aid or disrupt a project. Effective team structuring involves an understanding of how the behavior of individual team members will contribute to the interaction patterns which determine the behavior of the team. Many software projects are confronted with a managerial paradox. Software production has attempted such approaches as chief programmer teams, top-down design techniques, and the cultivation of &ldquo;egoless programming&rdquo; among programmers. Such management attitudes have, themselves, been characterized as &ldquo;top-down&rdquo; in nature, i.e. decisions made at a high level are implemented at lower ones (Kilmann, 1977). Most of these &ldquo;top-down&rdquo; approaches have been thoroughly and readably discussed in a survey by Edward Yourdon (1975). However, this same survey also reveals the heart of the paradox at stake. Every one of Yourdon's points is supported by anecdotes of programmer behavior&mdash;generally amusing and all with appropriately cataclysmic punch lines. Yourdon has indicated a problem, but &ldquo;top-down&rdquo; management is not necessarily the solution. These anecdotes reveal the formation of a consistent pattern of human nature&mdash;individuals who are unhappy with a &ldquo;top-down&rdquo; managerial approach whose discontent is manifested in poor performance. The solution may, in fact, lie in a more flexible attitude which allows participation in decision-making at all levels of the managerial hierarchy. Such managerial structures have been called &ldquo;organic-adaptive&rdquo; by Warren Bennis (1966). We are interested in how they can be applied to the management of computer programmers.
Unconventional architecture
Authors: Wayne T. Wilner
Venue: Proceedings of the 1976 annual conference (1976)

Just as one-way streets sometimes make it inconvenient to get from here to there, the primitiveness of computer operations and the procrustean inflexibility of systems and devices can make it difficult to get from having an information-processing problem to having a computer's solution to it. Conventional architecture is a one-way street which makes it easy to solve a very limited class of problems and difficult to solve the rest. Conventional architecture reflects itself into programming languages and into the way in which we use computers. If we attack current deficiencies by changing architecture, then we can expect monumental changes to be required in software and methods of use as well. It has been suggested that computers which are simply much faster and much cheaper will relieve the difficulties. Speed and economy do nothing to relieve the primitiveness and inflexibility of computers. They merely make the cost of such agony smaller and available to more people.
A microinstruction sequencer and language package for structured microprogramming
Authors: David R. Hawk
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

This paper describes a microinstruction sequencing unit and an accompanying high level language package for the implementation of microprogrammable systems with structured microcode. The sequencer hardware is designed to be implemented in four bit slice integrated circuits. Thus, three IC's (12 bits) are all that are required to sequence the microinstructions from a 4K control store. The system can be made versatile enough to be applied to a broad class of microprogrammable systems.
A user's approach to requirements analysis of a large software system
Authors: Meir Burstin, Moshe Ben-Bassat
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Arriving at all the requirements of a large software system is a very difficult task, whose success or failure significantly affects the system design and implementation. A user oriented approach is suggested in this paper, that expands the definition of a user and allows hierarchal decomposition of users. Requirements are formed at the elementary level of the users and then composed to upper levels and checked. The checks are done against the real needs of the user community rather then among the requirements themselves. A possible use of automated tools in this process is suggested.
Subrecursive program schemata I II(I. Undecidable equivalence problems, II. Decidable equivalence problems)
Authors: Robert L. Constable, Steven S. Muchnick
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

The study of program schemata and the study of subrecursive programming languages are both concerned with limiting program structure in order to permit a more complete analysis of algorithms while retaining sufficiently rich computing power to allow interesting algorithms. In this paper we combine these approaches by defining classes of subrecursive program schemata and investigating their equivalence problems. Since the languages are all subrecursive, any scheme written in any one of them must halt (as long as we assume the basic functions and predicates are all total). Hence equivalence of schemes is the first question of interest we can ask about these languages. We consider schematic versions of various subrecursive programming languages similar to the Loop language. We distinguish between Pre-Loop and Post-Loop languages on the basis of whether the exit condition in an iteration loop is tested before iteration, as in Algol (Pre-), or after iteration, as in FORTRAN (Post-). We show that at the program level all these languages have the same computing power (the primitive recursive functions) and all have unsolvable equivalence problems (of arithmetic degree &pgr;01). But at the level of schemes, Pre-Loop has an unsolvable equivalence problem, while at least one formulation of Post-Loop has a solvable equivalence problem.
Leading a Child to a Computer Culture
Authors: Cynthia J. Solomon
Venue: ACM SIGCUE Outlook (1976)

&ldquo;LOGO&rdquo; is sometimes used as the name of a programming language. It is also used as the name of ... what shall I call it ? ... an environment, a culture, way of thinking about computers and about learning and about putting the two together. I shall try to convey to you how I bring a child into this environment. The environment is made of ideas, of things and of people. The things include various types of turtles: computer controlled mechanical beasts which use touch sensors or eye-sight to crawl around the floor and display turtles, which live on TV-like screens where they draw in phosphor white or inmulti-color.
Logic design system in Japan
Authors: Tohru Moto-Oka, Tadashi Kurachi, Tsutomu Shiino, Masakatsu sugimoto
Venue: Proceedings of the 12th Design Automation Conference (1975)

In accordance with the growth of complexity and amount of logic, computer-aided design of electronic computer became indispensable for designing and manufacturing. Though many design automation systems to support physical implementation design, manufacturing process and test process have been developed by computer manufacturers in Japan, there are few reports on logic design of digital systems. To describe the functions or the macroscopic structure of digital systems, various kinds of language have been proposed but it seems difficult to describe digital systems in various stages of design by a single level of language. So languages which have several levels corresponding to various design stages had been proposed, (1)(2)(3) and automatic conversion of the language from a rough level to a fine level has been studied. Though they seem to be very helpful for designing large scale digital systems, further study seems necessary to put them into practical use. On the other hand it is almost impossible to design error-free large scale digital systems without using any kind of design verification tool such as logic simulators. However, logic simulation requires a lot of test data to verify the designed system and also needs a lot of computer time.
Analysis of system bottlenecks using a queueing network model
Authors: Jeffrey Buzen
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

While it is well known that queues can build up at various points in large scale multiprogramming computer systems, comparatively little is known about the factors which govern the lengths of these queues and their relationship to overall system performance. The first part of this paper is concerned with developing a queueing network model which can be used to study a number of such questions. The model is then applied to a specific problem concerning the proportion of processing requests which should be directed to each of a set of functionally equivalent peripheral processors (e.g., disks and drums) in order to optimize overall system performance. A surprising result is that optimal performance is not attained when queue lengths and processor utilization percentages are equal, but rather when the fastest processor has the longest expected queue and is in effect creating a system bottleneck.
Dynamic selection of a performance-effective transmission sequence for token-passing networks with mobile nodes
Authors: Yaron I. Gold, Shlomo Moran
Venue: Proceedings of the eighth symposium on Data communications (1983)

We describe a distributed method for keeping down &ldquo;token-passing&rdquo; overhead in a mobile multi-access network, by performing local corrections in the token-passing sequence as they become necessary due to changes in node spatial configuration. These corrections involve only a subset of the nodes in the network, thus reducing the required computational effort. The method consists of three distributed protocols. The first is for detecting deterioration and identifying a subset of nodes that constitutes a &ldquo;problem area&rdquo;, the second is to provide each node with the distances (propagation delays) to all other nodes, and the third is to use this topological information to construct a minimal spanning tree, from which a good &ldquo;token passing&rdquo; sequence can be derived. The second and third protocols may also have applications other than the one described here, such as position location, routing and broadcasting.
A multi-microprocessor architecture with hardware support for communication and scheduling
Authors: Sudhir R. Ahuja, Abhaya Asthana
Venue: ACM SIGPLAN Notices (1982)

We describe a multiprocessor system that attempts to enhance the system performance by incorporating into its architecture a number of key operating system concepts. In particular: &mdash; the scheduling and synchronization of concurrent activities are built in at the hardware level, &mdash; the interprocess communication functions are performed in hardware, and, &mdash; a coupling between the scheduling and communication functions is provided which allows efficient implementation of parallel systems that is precluded when the scheduling and communication functions are realized in software.
A dogleg &ldquo;optimal&rdquo; channel router with completion enhancements
Authors: Michi M. Wada
Venue: Proceedings of the 18th Design Automation Conference (1981)

Routing algorithms have been developed for use in automatic Integrated Circuit (IC) layout programs. The algorithms address the following issues: (1) completion enhancements to eliminate cyclic constraints and achieve 100 percent routing completion, although possibly sacrificing optimality; (2) a dogleg &ldquo;optimal&rdquo; channel router which allows more than one horizontal segment per net and uses a branch and bound method to find a minimal routing for the given set of nets; and (3) shortcut techniques to reduce the amount of time spent using the branch and bound method.
A performance information system for data processors
Authors: Francis L. Harmon, George W. Mayeske, Albert S. Glickman
Venue: Proceedings of the third annual computer personnel research conference (1965)

During the past three years the Personnel Research Staff of the U. S. Department of Agriculture has been doing research aimed at improving our performance information systems. I am going to tell you about the work we have done with one group&mdash;the 400-odd ADP people employed in the Department.
Simulation of a Coordinated Accident Rescue system
Authors: M. Wayne Parker, L. Ray Johnson
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

Project CARE-SOM (Coordinated Accident Rescue Endeavor-State of Mississippi) was a 15-month study of emergency medical evacuation systems for the National Highway Safety Bureau, U.S. Department of Transportation. The object of the project was to develop, demonstrate, and evaluate an integrated system for emergency medical evacuation. The system contained existing ground ambulance services, expanded communication abilities, and helicopter ambulance units. This paper describes a simulation of the experimental system used to evaluate rescue performances under various helicopter dispatching decision rules. The simulation language is GPSS/360.
A facility for the downward extension of a high-level language
Authors: Thomas N. Turba
Venue: Proceedings of the 1982 SIGPLAN symposium on Compiler construction (1982)

This paper presents a method whereby a high-level language can be extended to provide access to all the capabilities of the underlying hardware and operating system of a machine. In essence, it is a facility that allows a user to make special purpose extensions to a language without requiring the compiler to be modified for each extension. Extensions are specified in an assembler-like language that is used at compile time to produce executable code to be combined with compiler-generated code. This facility has been implemented in a systems-programming language and was designed to provide access to facilities not directly available in the language. The way in which the facility was implemented calls for a minimum of user-visible language changes and is well suited for generating code sequences for any language. The facility provides the extension writer access to information available in the high-level language during compilation, permits the selective generation of user-defined code sequences depending on the context in which they are being used, provides for the integration of this code with compiler-generated code, and provides for the generation of user-understandable error messages when an extension is used incorrectly.
A general class of processor interconnection strategies
Authors: Laxmi N. Bhuyan, Dharma P. Agrawal
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

A new class of general topologies is proposed in this paper for interconnecting a large network of computers in parallel and distributed environment. These structures have been shown to possess small internode distances, fairly low number of links per node, easy message routing and large number of alternate paths that can be used in case of faults in the system. The interconnection is based on a mixed radix number system, presented in this paper. The technique results in a variety of structures for a given number of processors N, depending on the required diameter in the network. A bus oriented structure is also introduced here, based on the same mathematical framework. These structures possess only two I/O ports per processor and are also shown to have small internode distances.
Design of 2-D state-space digital filters with powers-of-two coefficients based on a genetic algorithm
Authors: Young-Ho Lee, M. Kawamata, T. Higuchi
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

This paper presents a new design method of 2-D state-space digital filters (2D-SSDFs) with powers-of-two coefficients based on a genetic algorithm (GA). The design problem is formulated in a state-space model. All coefficients of 2D-SSDF are then encoded to binary strings in order to apply the GA to the design problem. In addition, a stability test routine is embedded in the GA procedure to ensure the stability of the resulting 2D-SSDFs. The proposed method can obtain 2D-SSDFs with small approximation error in a nonuniform discrete space such as powers-of-two coefficients, which means that the designed 2D-SSDFs are attractive for high-speed operation and simple hardware architecture. The effectiveness of the proposed method is demonstrated by a design example.
Proving the correctness of a flight-director program for an airborne minicomputer
Authors: W. D. Maurer
Venue: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment (1976)

Over the past five years, our research efforts have been devoted in large part to developing techniques for proving the correctness of assembly-language and machine-language programs running on actual computers. In this paper, we report upon an effort to put this work into practice by proving the correctness of a program written for the Litton C4000 airborne computer. This includes overflow analysis, non-self-modification analysis, round-off and truncation analysis, fixed-point scaling considerations, and analysis of the sub-routine parameter and return-address conventions used in the given program. The basic method we use is the inductive assertion method of (Floyd, 1967), suitably modified and extended for application to a machine-language situation.
AFIPS secondary education curriculum in information technology
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This session includes a report on work in progress by a committee developing an interdisciplinary computers and information-based course/curriculum intended for all students at the secondary level. Content, objectives, and a topical outline will be discussed. Audience reaction and input are requested. In the fall of 1983, the AFIPS (American Federation of Information Processing Societies) Education Committee funded a project to develop a technologically oriented, interdisciplinary course /curriculum for all students at the secondary level. A Steering Committee met in September 1983 and recommended that a working committee be formed to produce recommendations on course/curriculum.
MODLISP
Authors: James H. Davenport, Richard D. Jenks
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

This paper discusses the design and implementation of MODLISP, a LISP-like language enhanced with the idea of MODes. This extension permits, but does not require, the user to declare the types of various variables, and to compile functions with the arguments declared to be of a particular type. It is possible to declare several functions of the same name, with arguments of different type (e.g. PLUS could be declared for Integer arguments, or Rational, or Real, or even Polynomial arguments) and the system will apply the correct function for the types of the arguments. The MODLISP language differs from other abstract data type languages such as CLU [Liskov Zilles, 1974; Liskov et al, 1977] and Russell [Donahue,1977] in that it allows dynamic construction of new parametrised data types and possesses a unified semantics covering interpreted and compiled code, which can call one another at will. In short, it is LISP-like.