ppxscal/embedding_network huggingface dataset:
Tutorial on data base machines
Authors: P. Bruce Berra
Venue: Proceedings of the ACM '81 conference (1981)

The cost of the hardware components that make up modern day digital computers continues to drop at a rapid rate. Along with this cost reduction there exists a simultaneous increase in the number of components that one can place on an integrated circuit chip. This leads to what seems to be an ever decreasing cost of hardware combined with a continued increase in functional capability. When these improvements are coupled with the ever increasing costs of software, primarily caused by increased personnel costs, it becomes imperative to consider moving functions that are primarily executed in software, to hardware. One field that has received increased attention vis-a-vis movement of software functions to hardware is the database management field. Owing to size and complexity, managing databases becomes increasingly difficult. Over the past few years, increasing efforts have been expended in the study of new types of hardware called database machines which are designed solely for the purpose of managing data. This research has been driven by the decreasing cost of hardware and by the need for performance improvements due to increased database size and complexity and a maturing database theory.
The problem in perspective
Authors: Dick H. Brandon
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The growth of computer programming is a function of two independent factors: the growth of the computer industry, and the increasing complexity of computer technology. Our domestic computer industry, of course, has expanded from a base of ten computer installations in 1951 to some 55,000 installed computers, and may exceed 70,000 by the end of 1968.1 The technology itself has grown in complexity at an equally rapid rate and, as a result, computers have become immensely more powerful and sophisticated. The confluence of these developments has led to an unprecedented need for programmers. In fact, the current programmer shortage is in excess of 50,000 in the U. S.2 By 1970 an additional 60,000 will be required, leading to a total shortage of 110,000, minus the 20,000 or so to be trained in the next two years.3
The use of APL for production applications: The concept of &ldquo;throwaway code&rdquo;
Authors: Ephraim R. McLean
Venue: Proceedings of the eighth international conference on APL (1976)

Although APL has been highly praised as a powerful tool for individual problem-solving, many EDP managers have expressed concern about its suitability in a production environment. They feel that APL's powerful and compact notation makes it &ldquo;unreadable&rdquo; and thus &ldquo;unmaintainable.&rdquo; This paper explores the background of this issue and offers six rules which may help to alleviate the situation, chief among these being the concept of &ldquo;throwaway code.&rdquo;
Generation of linguistic filter structures for image enhancement
Authors: R. C. Gonzalez
Venue: Proceedings of the ACM annual conference (1973)

This abstract describes ongoing research in the application of formal language theory to the problem of generating two-dimensional digital filter structures for image enhancement. This work is related to the development of an interactive enhancement language for use in teleoperator systems. The approach presently being followed consists of altering the Fourier transform of an image by means of a two-dimensional filter structure. The inverse transform then yields an image which has been enhanced in some sense. This paper describes typical filter primitives and the grammars used to generate appropriate filters. The problem of generating pseudo-color linguistic structures is also discussed.
On reference string generation processes
Authors: Arvind, R. Y. Kain, E. Sadeh
Venue: ACM SIGOPS Operating Systems Review (1973)

Efficient memory management is important for optimizing computer usage. Intuition, simulation, experience, and analysis have contributed to the design of space management algorithms. Analytical models require accurate and concise descriptions of the system's environment. The referencing pattern, describing the sequence of memory addresses, is the environment for memory management problems. One referencing model assigns probabilities to positions in an LRU stack of memory pages. &ldquo;Local&rdquo; behavior is easily described using this model. However, the distinctly different behavior among instruction and data references is lost. In this paper we generalize the LRU stack model to an arbitrary number of memory spaces which are selected by the transitions of a Markov chain. The additional detail affects the behavior of the models for a working set management strategy.
Resource management in a distributed system
Authors: Mark Yudkin
Venue: Proceedings of the eighth symposium on Data communications (1983)

In the Cambridge Distributed System, developed at the Computer Laboratory. Cambridge, terminals, machines and peripherals are separated by a ring network. A problem that arises is the establishment and control of suitable connexions between the individual components, so that users may use machines, machines may use peripherals or other machines, etc. in a secure manner. This paper describes an experimental mechanism used to control the connexions and provide security in our particular system. The solution is not restricted to the Cambridge ring, although a different architecture may suggest alternative solutions more suited to its specific features. Some possibilities are discussed.
A look-ahead data staging architecture for relational data base machines
Authors: K. Seo, A. Minematsu, H. Aiso, N. Kamibayashi
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

This paper proposes a novel data staging architecture of the relational data base machine (RDBM) using a memory hierarchy system and moving head disks as a data base store (DBS). From a realistic viewpoint of implementing RDBM to support large data bases, RDBM based on this configuration is the most practical approach. However, a crucial problem exists in RDBM of this type; namely, the total performance is restricted by poor throughput of the data movement between the processing subsystem and DBS. To solve the problem, we have designed a powerful architecture to enhance the capability of the data staging, taking the properties of a relational data base environment into consideration. This paper describes the design and implementation issues of the data staging subsystem for RDBM developed by the authors and confirms the advantages through simulation study with GPSS.
Modeling a genetic control program for the tobacco budworm with SLAM
Authors: Richard A. Levins, Murl Wayne Parker
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

A simulation model is described and used to investigate the potential for controlling the tobacco budworm through hybrid sterilization. The results indicated that high levels of population control appear feasible with relatively large release ratios. However, driving population levels to zero may be ruled out by such factors as different egg laying capabilities between budworm and backcross moths and by in-migration of budworm moths. A general SLAM insect model is also described and developed which may be of value to other researchers studying population dynamics. The authors were well satisfied with the capabilities of SLAM.
Statistical consulting vs statistical software selection, or; how many ways can you get in trouble by giving statistical advice?
Authors: James F. Moore, Charles E. Fisher
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

What follows are situations that may not be encountered universally but are known to have occurred at our institution. Our aim is not to issue a set of rules concerning the limits that should be placed on statistical consulting because we are sure that at some institutions it is considered part of the function of the computing center. Rather, our emphasis here will be on the role of the consultant as he interacts with graduate students and their thesis and dissertation committees and all the ways that the consultant can get into trouble.
The dependence of computer system queues upon processing time distribution and central processor scheduling
Authors: Forest Baskett
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

The stationary distribution of the number of jobs being served by a processor-sharing central server is independent of both the distribution of service times and the distribution of interarrival times when those distributions have rational Laplace-Stieltjes transforms. This result holds for both finite source and infinite source models. The steady state is identical to the steady state when all distributions are exponential. The expected response time, queue size, and central processor idle time of the finite source model under processor-sharing and FCFS scheduling are compared. These measures of system performance are all larger under processor-sharing for a class of central processor service time distributions with a coefficient of variation less than one. The measures are all smaller under processor-sharing for a class of distributions with a coefficient of variation greater than one. Experiments with data collected from actual computer systems indicate that these results extend to more general models and have practical applications in existing computer systems.
An information system in architectural practices
Authors: C. David Sides,  Jr.
Venue: Proceedings of the 8th Design Automation Workshop (1971)

The described computer-based information system provides a minimum of restrictions for future development, and can meet the immediate demands of the architectural profession within limits of ecomonic feasibility.
TAGINE, an interactive tool for report generation
Authors: Colette Yazigi
Venue: ACM SIGAPL APL Quote Quad (1981)

This paper describes an APL tool designed as an aid to report writing. Using APL formatting symbols is quite difficult, and the report formatting phase of a business application program is often very long: TAGINE has been designed to allow quick and easy programming of reports. TAGINE is divided into two modules: 1 - TANA is a simple macro-language intended for describing computations to be performed, and building a model of the final report (with automatic justifications, titles, formatting and decoration). 2 - TEDI performs the report generating using the model that has been stored. Most frequently, the end-user uses only the TEDI module. At the APL division of SLIGOS, we have been using TAGINE for one year and have reduced the report programming effort by a factor of 10 compared to direct use of formatting primitives. We have built 400 models with TANA, and produced 10000 tables with TEDI. Systematic use of TAGINE has greatly improved: &bull; Applications portability &bull; Linking of a variety of applications &bull; Product maintenance and reliability
Learning theory and political socialization: A module for computer assisted instruction
Authors: Kathleen M. Swigger
Venue: ACM SIGCUE Outlook (1976)

The purpose of this C.A.I. module is to introduce students enrolled in undergraduate courses in political science, sociology, and education to aspects of learning theory that have direct application to a study of political socialization. The interactive module demonstrates how various models representing learning theories can be used to describe the process by which individuals acquire their political behavior. The purpose of this C.A.I. module is to describe learning theory in such a way as to guide students in critically constructing and evaluating their own assumptions concerning the nature of the process of political socialization. Thus, it is felt that these lessons can contribute to a better understanding of the prominent literature that deals with questions considered relevant to a discussion of political socialization. The lessons in the module were written in the Instructional Dialogue Facility (IDF) on a Hewlett-Packard 2000 at the University of Iowa. These lessons call over a dozen BASIC programs specifically written for the module. The lessons allow for self-pacing and freedom of choice concerning the number and type of learning subtasks that the student undertakes at any particular time. The module not only enhances the courses for which they were designed but also adds to the inventory of interactive lessons available to all users of computer assisted instruction.
Computing permutations with double-ended queues, parallel stacks and parallel queues
Authors: Vaughan R. Pratt
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

A memory may be regarded as a computer with input, output and storage facilities, but with no explicit functional capability. The only possible outputs are permutations of a multiset of its inputs. Thus the natural question to ask of a class of memories is, what permutations can its members compute? We are particularly interested here in switchyard networks studied by Knuth [1968], Even and Itai [1971], and Tarjan [1972], where the permutations are of the set of inputs, rather than of a multiset of them.
A computer manufacturer's perspective of computer education
Authors: Jack Walsh
Venue: Proceedings of the twelfth annual SIGCPR conference (1974)

I appreciate the opportunity to be here today and to share with you my thoughts on computer education from the perspective of the computer manufacturer and, more specifically, from Honeywell Information Systems. My personal objectives as Manager of Education Development within Honeywell Information Systems (HIS) are three-fold: A. Provide training programs for our internal technical personnel that give the capability to sell, install, and maintain Honeywell computer systems. B. Provide training programs to enable the end user to effectively utilize Honeywell computer systems, and minimize user dependence on Honeywell's technical resource personnel. C. Minimize allocation of Honeywell's instructor resources in basic classroom support; and maximize allocation of those resources into advanced classroom areas such as language workshops, data base and networking. It is the latter two areas that I'd like to focus on today, and specifically to discuss three areas: A. Education's role within Honeywell with the resulting challenges to the education function. B. Major education approaches used in Honeywell, the resulting products, and the key factors involved in selecting a specific approach for a given product. C. The Education structure required to develop and implement the various approaches within Honeywell's organization structure. Discussion of the latter points will give you an understanding of how we meet our basic objectives.
Representation and modeling of distributed computer systems
Authors: Armen Gabrielian
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The general problem of the representation and performance-oriented modeling of the behavior of distributed computer systems is discussed. A description of an integrated System Design/Static and Dynamic Modeling (SD/SDM) tool set is presented. In SD/SDM, a data base organization is used for the representation of the architecture, load, application software and the operating system of a distributed system. Modeling is performed statically or dynamically through a generic simulation model that does not require recompilation. Applications of SD/SDM in actual projects are discussed briefly.
A procedure for generating floor plans computer aided design
Authors: Hanna Ben-joshua Shapira, Robert S. Frew
Venue: Proceedings of the 11th Design Automation Workshop (1974)

The following study concerns itself with the generation of rough ideas of floor plans in a relatively short time and low cost. A methodical procedure is sought in the form of a computer program which may subsequently be used by someone unskilled on an interactive basis that will help the designer and his client gain an understanding of the layout. The idea of user generated design is the foundation of this work. Client's values of required proxemic distances are translated into a spatial layout, in the form of dimensioned map, with great ease. Preference values are first used to build a polyomino reflecting the order of importance given to each pair-wise distances between cells. The technique that transforms a set of proxemic distances generated by the client into a spatial layout (a polyomino) and which in turn was thought to be the minimum of absolute differences in the summation of distances between the pattern generated and a given set of preferences was first introduced by R. S. Frew in, &ldquo;Towards a Theory of System Architecture&rdquo; University of Waterloo, Canada. The means of finding the order of links from the highest to lowest priority was retained but a new procedure has been developed to build patterns (polyominoes), the effectiveness of each judged under the same criteria stated above. The present study, then, introduced a new procedure for pattern construction and in addition worked out and coded a procedure for the conversion of a polyomino into a dimensional map in which each of the elements can be of different proportion or size.
An engineering methodology for presenting software functional architecture
Authors: Leighton R Scott
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

A method of presenting software architecture has been developed which is useful for reviewing and documenting software designs. Diagrams showing all software levels as well as inputs and outputs are systematically developed to provide an understanding of the construction and operation of software systems and programs. The manner in which the software architecture is displayed provides an effective way for managers to understand and review software designs.
Algebraic computation for the masses
Authors: Joel Moses
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Powerful algebraic manipulation systems will be available at very low costs in this decade. We are thus close to achieving the goal many of us have been after for nearly two decades, namely, availability of our systems to the masses. In this talk we shall discuss the problems we still face in making our systems useful to the hordes of potential users.
A characterization of Mal'cev's preiterative algebras
Authors: I. G. Rosenberg
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

In universal algebras, propositional calculi, combinatorial switching circuits new operations are formed by composition. The process of composing operations is usually described by Menger algebras or by partial or graded algebras (clones). The inherent limitations are due to the preservation of arities. A.I. Mal'cev avoided this by introducing an algebra P@@@@ &equil; <0A,&zgr;,&tgr;,&Dgr;,*> of type <1,1,1,2> on the set 0A of all finitary operations on A such that the subalgebras of P@@@@ (called preiterative algebras) agree with the sets of all polynomials of universal algebras on A. In this paper, we study the abstract structure of these concrete preiterative algebras; that is, we describe the preiterative algebras in terms of the properties of &zgr;, &tgr;, &Dgr;, and * only.
WEIRD: An approach to concept-based information retrieval
Authors: Matthew B. Koll
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

WEIRD is an automatic document retrieval system designed and implemented at Syracuse University, which attempts to advance the art of computerized retrieval from word-matching to judging conceptual similarity. WEIRD uses a vector space model to represent the relations among terms and documents. Items in the space are located according to their -&-ldquo;meaning-&-rdquo;, which is their proximity to all other items in the data base as measured by co-occurrence frequencies. This is done without manipulating large matrices. The dimensions of the space are not used to define relations; items are defined solely by their position relative to the other items. Retrieval is determined by Euclidean distance from the plotted query. In the first section of the paper the basic characteristics of WEIRD are described. Second, the results of a preliminary evaluation are reported. Alternatives for further development of WEIRD are then considered.
Graf/Pen
Authors: Albert L. Whetstone
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

The Graf/Pen is a digitizing or data gathering device in which the operator simply holds a pen to point or to create graphical input for digital systems. Previous attempts to provide a natural graphical input have suffered from one or more disadvantages. The method in which strings extend from the cursor to mechanical or optical encoders (mangiospago) does not allow the operator to sketch as naturally as with a pen. The method of crossed wire grids and capacitive sensing known as the Rand Tablet is inherently expensive while being limited in size and format. Other methods using resistive sheets and capacitive sensing suffer from poor integral linearity, and in addition, require ADC's. Our own R D group has long had all of the technology needed to solve the problems, but we were in a different area of science and were unaware of the need for a natural man-machine interface. A little accidental cross-fertilization between us and computer scientists prompted us to develop the extremely simple and versatile device I am about to describe.
Fuzzy reasoning and the logics of uncertainty
Authors: B. R. Gaines
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

This paper is concerned with the foundations of fuzzy reasoning and its relationships with other logics of uncertainty. The definitions of fuzzy logics are first examined and the role of fuzzification discussed. It is shown that fuzzification of PC gives a known multivalued logic but with inappropriate semantics of implication and various alternative forms of implication are discussed. In the main section the discussion is broadened to other logics of uncertainty and it is argued that there are close links, both formal and semantic, between fuzzy logic and probability logics. A basic multivalued logic is developed in terms of a truth function over a lattice of propositions that encompasses a wide range of logics of uncertainty. Various degrees of truth functionality are then defined and used to derive specific logics including probability logic and Lukasiewicz infinitely valued logic. Quantification and modal operators over the basic logic are introduced. Finally, a semantics for the basic logic is introduced in terms of a population (of events, or people, or neurons) and the semantic significance of the constraints giving rise to different logics is discussed.
Consistency and correctness of duplicate database systems
Authors: Clarence A. Ellis
Venue: ACM SIGOPS Operating Systems Review (1977)

Solutions to the duplicate database update problem are considered, and a formal validation technique using the theory of L systems is developed and applied to the problem. The paper shows some particular solutions but is primarily concerned with general properties of the problem, convenient representational techniques, and formal proof procedures which are general enough to apply to this and to a number of other problems in parallel processing and synchronization.