ppxscal/embedding_network huggingface dataset:
An APL pattern-directed module for bidimensional data analysis
Authors: Silvana Bianchi, Piero Mussio, Anna Della Ventura, Anna Rampini, Maurizio Dell'Oca
Venue: ACM SIGAPL APL Quote Quad (1981)

We suggest that APL may effectively be used for the implementation of pattern directed production systems (PDPS) for the analysis of bidimensional data. These systems look for interesting or important situations occurring as patterns in their input or memory data. These patterns cause the execution of suitable functions. Moreover APL makes it possible to carry out in a natural manner the synthetic and expressive definition of the patterns and then allows to verify the efficacy and power of such definition. We face these problems through MIPS (Module Interpreter for Production Systems). In the work described, simple idioms and skeletons are used to set up the definitions and the instruments. The system is described through two examples of application to the analysis of digital images from different experiments.
Problem areas in estimating costs of computer-assisted instruction
Authors: June R. Chapin
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Glowing predictions on the future of education in the USA usually emphasize the expanding role that computer-assisted instruction (CAI) will have on a school or university system. It is expected that the use of computers for instructional purposes will greatly expand at all age levels. In light of the predicted expansion and the present interest in CAI, it appears imperative that administrators and the instructional staff understand some of the problem areas in estimating costs of CAI. The cost problem of computers in industry and education has been a thorny one. Higher education, which has had extensive experience with computer centers, has found the estimation of computer costs to be a complex problem. It can be hypothesized that CAI will be heir to some of the same problems that have plagued cost estimates of computer services in higher education. Part of the difficulty has been due to the inconsistent government and school accounting practices, the great variety of sources of computing support, and the experimental nature of computer use. 1 Studies of cost-usage typically have been incomplete and scant and it has been difficult to estimate the cost per student hour when the usage patterns of students, faculty, research personnel, and administrators are not known.
A simulation based model of a virtual storage system
Authors: H. Gomaa
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

This paper describes how two different modelling techniques, regression and simulation modelling, have been combined within a hybrid simulation/regression model of a virtual storage computer system. In the model, simulation techniques are used to model in detail a task's arrival, entering and dropping from the multiprogramming set, and termination. The rest of the system is modelled in much less detail mainly using regression techniques. The application of this method to modelling an IBM VM/370 system is described.
Interfaces between protocol layers on a multiprocessor system
Authors: Wilfredo A. Colon-Castro, Deborah A. Kirkman
Venue: Proceedings of the eighth symposium on Data communications (1983)

A multi-layer, X.25 based protocol has been implemented on a multiprocessor system. The higher layer protocol resides in the system processor while the lower level protocol (X.25 levels 2 and 3) runs on a peripheral processor. This paper focuses on the boundary between the system and peripheral processors. It discusses how flow control is done, how control information is passed across the boundary, and the synchronization problems that arose. In addition, it describes effects on performance resulting from splitting the protocol across the two processors.
A study of the effect of user program optimization in a paging system
Authors: Lesin W. Comeau
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

Much attention has been directed to paging algorithms and little to the role of the user in this environment. This paper describes an experiment which is an attempt to determine the significance of efforts by the user to improve the paging characteristics of his program. The problem of throughput in a computing system is primarily one of balancing the flow of data and programs through a hierarchy of storages. The problem is considered solved when for every available processor cycle there is a matching demand for that cycle in the primary (execution) store. Since programs and their data usually originate in a location other than the execution store, there is a delay associated with the movement of data and programs to the primary store. The delay has two components, the operational speed (data transfer time) and the positioning, or access time, of the secondary storage device. Since the access time usually exceeds the data transfer time by an order of magnitude, the problem of transferring information to the primary store has been named the &ldquo;access gap&rdquo; problem.
A hybrid scheduling technique for hierarchical logic simulators or &ldquo;Close Encounters of the Simulated Kind&rdquo;
Authors: Will Sherwood
Venue: Proceedings of the 16th Design Automation Conference (1979)

Advancing circuit complexity in LSI technology has brought about an ever growing need for more powerful Computer Aided Design tools. Verification of an IC design through simulation is mandatory to avoid costly mask iterations and delays in product introduction due to design errors. A gate level simulation is one method for reducing errors in a chip design. However, gate level simulations of large designs are extremely expensive. A high level &ldquo;black box&rdquo; or functional simulation gains in efficiency, yet loses accuracy. It is possible to minimize the individual disadvantages of these two approaches with a hierarchical simulator that permits a mixture of the two levels. Further improvement can be realized by incorporating a dual mode (fixed event list/event-driven) scheduler within this hierarchical simulation environment to control more efficiently the model evaluation sequence. This paper describes such a scheduler, and the user interfaces for it.
Polaris: Polarity propagation algorithm for combinational logic synthesis
Authors: T. Shinsha, T. Kubo, M. Hikosaka, K. Akiyama, K. Ishihara
Venue: Proceedings of the 21st Design Automation Conference (1984)

A new algorithm for combinational logic synthesis, POLARIS, is described. POLARIS automatically generates optimized gate level logic from functional level specification described by Boolean expressions. It transforms the Boolean expressions into logical operator trees, and produces a network of physical units or units of physical design by introducing polarity and propagating it along the tree. Experimental results show that more than 96% of gate level logic structures are equal to the logic structures designed by experts.
Optimal testing policies for software systems
Authors: Amrit L. Goel
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

An important problem of practical concern is to determine how much testing should be done before a system is considered ready for release. This decision, of course, depends on the model for the software failure phenomenon and the criterion used for evaluating system readiness. In this paper, we first develop a cost model based on the time dependent failure rate function of Goel and Okumoto. Next, we derive policies that yeild the optimal values of the level of test effort (b*) and software release time (T*). The sensitivity of the optimal solution is also numerically evaluated.
On the additions necessary to compute certain functions
Authors: David Kirkpatrick
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

We introduce a theoretical notion, strongly related to algebraic independence, which can be applied to the terms of any computable expression to derive a lower bound on the number of additions and subtractions required to compute that expression.
Welcoming address
Authors: G. Bruce Dearing
Venue: Proceedings of the conference on APL (1969)

We find ourselves today trying to prepare for the operation of a 21st century institution and trying to solve and resolve the questions and the problems that we all must face, problems that are very different from those that perhaps any of us anticipated when we began our training.
A data structure for dynamic trees
Authors: Daniel D. Sleator, Robert Endre Tarjan
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We propose a data structure to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Our data structure requires O(log n) time per operation when the time is amortized over a sequence of operations. Using our data structure, we obtain new fast algorithms for the following problems: (1) Computing deepest common ancestors. (2) Solving various network flow problems including finding maximum flows, blocking flows, and acyclic flows. (3) Computing certain kinds of constrained minimum spanning trees. (4) Implementing the network simplex algorithm for the transshipment problem. Our most significant application is (2); we obtain an O(mn log n)-time algorithm to find a maximum flow in a network of n vertices and m edges, beating by a factor of log n the fastest algorithm previously known for sparse graphs.
Towards the design of an intrinsically graphical language
Authors: R. P. Futrelle, G. Barta
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

Coding a large and diversified graphics application system is a difficult task. We suggest an approach to this problem in which programs are built up using Objects (e.g., Classes, Modules) newly generated or drawn from a library. Each Object has an Aid which supports an interactive dialogue with the programmer resulting in the insertion of the appropriate references to the Object into the developing code. An Aid can display graphical Objects and accept sketching and picture editing. An Association capability allows the programmer to generate code corresponding to the displayed graphical material. The Association can be literal, with numerical values being inserted, or symbolic, with variable arguments inserted. A Programming System that is so structured implements an Intrinsically Graphical Language because the code can be &ldquo;written&rdquo; using both textual and graphical dialogues.
Extending Halstead's software science for a more precise measure of APL
Authors: Ross A. Mauri, A. Harry Williams
Venue: Proceedings of the international conference on APL (1982)

Software engineering is a growing part of computer science. Software engineering attempts to put measurements and metrics into the area of software programming. One of these metrics, Halstead's software science [1], measures a program's difficulty, a language level, and in turn, a programmer's productivity. Software science uses an extensive measure as opposed to the intensive measure of most other software engineering techniques. This is accomplished by counting functions and operands, and applying several formulae modified from thermodynamics. Even though software science attempts to place an objective measurement on these parameters, it is not meant to be a definitive decision tool, but rather a general guideline. This paper will explore the possible extension of Halstead's theory to include operators, as defined in APL, in the counting methodology and software science formulae.
Simulation: A state of the art tutorial
Venue: Proceedings of the 1975 annual conference (1975)

Discrete event digital simulation is both a powerful and flexible experimental tool. Its proper use is facilitated by a familiarity with certain representational and statistical concepts and techniques. This tutorial is designed to provide impetus to that familiarization by presenting a state of the art summary of the available simulation languages and statistical analysis machinery.
Maintaining dense sequential files in a dynamic environment (Extended Abstract)
Authors: Dan E. Willard
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

In this article, we study an alternate approach that shifts the records among adjacent pages rather than using overflow pointers when space is needed for inserting a record in a sequential file. We show how to use this method to achieve a worst-case record insertion-deletion complexity of O[(log2N)/(D-d)] page-accesses, in (d-D)-dense files.
DIALOG: An operational on-line reference retrieval system
Authors: Roger K. Summit
Venue: Proceedings of the 1967 22nd national conference (1967)

Classification systems in the sciences usually provide an unambiguous structure of mutually exclusive, collectively exhaustive categories. The same formal structuralization, when strictly applied to the classification of technical literature for retrieval purposes, has proved inadequate. At another extreme, approaches to indexing which preclude any hierarchical association are similarly disappointing.
SCALD: Structured Computer-Aided Logic Design
Authors: Thomas M. McWilliams, Lawrence C. Widdoes,  Jr.
Venue: Proceedings of the 15th Design Automation Conference (1978)

SCALD, a graphics-based hierarchical digital logic design system, is described and an example of its use is given. SCALD provides a total computer-aided design environment which inputs a high-level description of a digital system, and produces output for computer-aided manufacture of the system. SCALD has been used in the design of an operational, 15-MIPS, 5500-chip ECL-10K processor.
Algorithms for central extensions of Lie algebras
Authors: Robert E. Beck, Bernard Kolman
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

It follows from [1] that every n-dimensional nilpotent Lie algebra is a central extension of a lower dimensional nilpotent Lie algebra. This paper develops algorithms to handle two problems: (1) the decomposition of a given nilpotent Lie algebra @@@@ as a finite sequence of central extensions of lower dimensional nilpotent Lie algebras and (2) the construction of all n-dimensional nilpotent Lie algebras as central extensions of lower dimensional nilpotent Lie algebras.
Ada debugging and testing support environments
Authors: Richard E. Fairley
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

This paper presents analysis and design considerations for Ada Programming Support Environments (APSEs) to support interactive debugging and testing of embedded, real time software at the Ada source code level. The analysis is based on the &ldquo;Stoneman&rdquo; requirements specification for APSEs (1). Important factors in the analysis and design of Ada debugging and testing support systems include the requirement for a source level system, the host machine-target machine configurations, the real time and concurrent nature of target software, and the KAPSE virtual machine interface to the APSE data base. Although this paper is specifically concerned with debugging and testing issues, the methods utilized and the results obtained are of general applicability. The following sections of the paper address general analysis considerations, source level support environments, design considerations for an interactive source level debugger, and KAPSE design considerations.
LHAP: A Lightweight Hop-by-Hop Authentication Protocol for Ad-Hoc Networks
Authors: Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jajodia
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Most ad hoc networks do not implement any network access control, leaving these networks vulnerable to resource consumption attacks where a malicious node injects packets into the network with the goal of depleting the resources of the nodes relaying the packets. To thwart or prevent such attacks, it is necessary to employ authentication mechanisms that ensure that only authorized nodes can inject traffic into the network. In this paper, we present LHAP, a scalable and light-weight authentication protocol for ad hoc networks. LHAP is based on two techniques: (i) hop-by-hop authentication for verifying the authenticity of all the packets transmitted in the network and (ii) one-way key chain and TESLA for packet authentication and for reducing the overhead for establishing trust among nodes. We analyze the security ofLHAP, and show LHAP is a lightweight security protocol through detailed performance analysis.
Social dimensions of reliability of complex systems
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The purpose of this panel is to explore the limits of our ability to build fully reliable systems and the consequences thereof. As we come to depend more and more on sophisticated computer-based systems, certain of society's functions are placed in jeopardy. In general our dependence grows gradually as we adjust our degree of trust based on incremental experience. But there some tendency to get into trouble by trusting too much too soon. This panel investigates these issues and raises questions about what society might do to deal with them more thoughtfully.
Computer architecture in U. S. and Canadian electrical engineering departments
Authors: M. E. Sloan
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

This paper traces the history of computer architecture courses in U. S. electrical engineering departments. Data from the Fall 1972 survey of U. S. and Canadian electrical engineering departments by the COSINE Committee of the Commission on Education of the National Academy of Engineering are given to show current computer architecture course offerings and texts. Computer architecture courses offered in 1972-73 are analyzed, compared with ACM and COSINE recommendations, and classified into five categories: introductory computer engineering courses with a computer architecture flavor, software -oriented computer organization courses, hardware-oriented computer organization courses, case study courses, and topical seminars Future trends in computer architecture education are predicted.
PASCAL Users' forum
Authors: John C. Knight
Venue: Proceedings of the 1979 annual conference (1979)

SIGPLAN and the PASCAL Users Group will jointly sponsor a session to bring all conference attendees who are interested in PASCAL together to interact. This is not a technical session in the usual sense. However, in order to convey the most information, it will consist, at least in part, of a series of short presentations on PASCAL related topics. Presentations will address varied topics related to the language including experiences with PASCAL, tools for PASCAL programming, PASCAL implementations, etc.
Dynamic rerouting tag schemes for the augmented data manipulator network
Authors: Robert J. McMillen, Howard Jay Siegel
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

The augmented data manipulator (ADM) is a multistage interconnection network designed for large-scale, parallel processing systems. This paper is an extension of an earlier work in which the use of the inverse ADM (IADM) network in an MIMD environment was investigated. Dynamically rerouting messages to avoid busy or faulty links is explored for both the ADM and IADM networks. Several schemes are presented. In some cases, there is no increase in tag overhead, but the switching elements are more complex. In other cases, the size of the routing tag is increased by one bit, but the switching elements are not as complex. A new broadcasting capability is developed that allows one processor to send a message to any number of other processors (with some restriction on the destination addresses). Finally, a scheme for dynamically rerouting a broadcast message is presented.
The testing of cathode ray tubes for use in the Williams type storage system
Authors: A. Robinson
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

This paper describes a series of tests which we have used at Manchester for Williams type cathode-ray storage tubes (type VCRX266) The majority of the tests are functional rather than analytical. They have the advantage of indicating immediately whether a particular tube is fit for use, although it is true that functional tests give less help than analytical tests in tracking the causes of faults. The tests described are at present carried out by an engineer using test equipment which will be described in outline. The equipment has been made for use by Messrs. G.E.C. of Wembley, England, who are the suppliers of the tubes. It is hoped to reduce the test procedure to a routine that can be carried out by less skilled workers. A paper of this kind must inevitably dwell to some extent on the pathology of storage tubes, but it should be recognised that many of the faults mentioned are rare. A table will be given showing the numbers of rejected tubes in two batches which have been tested. In order to quote examples of some of the rarer faults it has been necessary to include as one of these batches a collection of old tubes many of which were rejected as unfit for use at a time before systematic tests were begun.
Overview of the Hydra Operating System development
Authors: W. Wulf, R. Levin, C. Pierson
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

An overview of the hardware and philosophic context in which the Hydra design was done is discussed. The construction methodology is discussed together with some data which suggests the success of this methodological approach.
Automatic hypertext link generation based on conceptual graphs
Authors: Gi-Chul Yang, Key-Sun Choi
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

An efficient way of automatic link generation for a high quality hypertext is described in this article. The syntactic information is not enough to select the correct destination node for a button in a hypertext. The information besides syntactic information such as semantic information and even background knowledge are indispensable. In order to utilize the information, a partner concept table is used along with the ideas of canonical graph and conformity relation in conceptual graph theory. A conceptual graph representation form called U-Form is presented here for efficient processing of conceptual graphs in a machine.
Scaling and related techniques for geometry problems
Authors: Harold N. Gabow, Jon Louis Bentley, Robert E. Tarjan
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Three techniques in computational geometry are explored: Scaling solves a problem by viewing it at increasing levels of numerical precision; activation is a restricted type of update operation, useful in sweep algorithms; the Cartesian tree is a data structure for problems involving maximums and minimums. These techniques solve the minimum spanning tree problem in Rk1 and Rk@@@@ in O(n(lg n)rlg lg n) time and O(n) space, where for Rk@@@@ and k &ge; 3, r &equil; k&minus;2; for Rk1, r &equil; 1, 2, 4 for k &equil; 3, 4, 5 and r &equil; k for k > 5. Other problems solved include Rk1and Rk all nearest neighbors, post office and maximum spanning tree; Rk maxima, Rk rectangle searching problems, and Zkp all nearest neighbors (1 &le; p &le; @@@@).