ppxscal/embedding_network huggingface dataset:
Information retrieval: digital handling of chemical structures and associated information
Authors: S. J. Tauber
Venue: Proceedings of the 1965 20th national conference (1965)

THE NEED for ready access to chemical information is by now generally recognized as common to many different agencies within government as well as to industrial, academic, and other private organizations. A review of techniques available for finding chemical information and of work in progress toward improving and augmenting those techniques will not here be attempted1. This paper concentrates on our work at the National Bureau of Standards and our approach to developing the techniques required for a major chemical information system. Our group seeks to develop the necessary techniques but has no desire to establish or operate a chemical information center. We instead make the results of our work available to those organizations with responsibility for such an operation.
Some implications of APL order-of-execution rules
Authors: Richard H. Lathwell
Venue: Proceedings of the international conference on APL: part 1 (1979)

An implementation of APL is necessarily a rigid encoding of the rules of the language, including a de facto order in which expressions are evaluated. The order of execution is perceived in an APL program by the way in which side effects such as nested specification, specification of global variables within defined functions, and shared variable values affect the outcome of expressions. Concern about variation among implementations and distasteful results (see for example, &ldquo;APL Problems with Order of Execution&rdquo;, Clark Wiedmann, in the March 1978 issue of Quote Quad) led to a proposed definition for the order of evaluation of APL expressions which received general acceptance at an APL implementors' workshop at Minnowbrook in September 1977. The refined &ldquo;right to left&rdquo; evaluation rule is examined and compared with other possible choices, through the use of simple APL syntax analysis models, to determine its implications on storage requirements, computation requirements, and mathematical identities.
Synthesis of p-valued asynchronous sequential circuits by using a general clock function
Authors: J. L. Huertas, J. I. Acha
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

A selfsynchronization method for implementing p-v&abarbelow;lued asynchronous sequential machines is given. The general clock function of each multistable type is devel&obarbelow;ped. This function is the kernel of the proposed adapt&ibarbelow;ve synchronism. An implementation of this function is given which does not depend on the number of logic levels. Constraints and advantages are discussed.
Global and local deformations of solid primitives
Authors: Alan H. Barr
Venue: ACM SIGGRAPH Computer Graphics (1984)

New hierarchical solid modeling operations are developed, which simulate twisting, bending, tapering, or similar transformations of geometric objects. The chief result is that the normal vector of an arbitrarily deformed smooth surface can be calculated directly from the surface normal vector of the undeformed surface and a transformation matrix. Deformations are easily combined in a hierarchical structure, creating complex objects from simpler ones. The position vectors and normal vectors in the simpler objects are used to calculate the position and normal vectors in the more complex forms; each level in the deformation hierarchy requires an additional matrix multiply for the normal vector calculation. Deformations are important and highly intuitive operations which ease the control and rendering of large families of three-dimensional geometric shapes.
Performance measurements on the ARPA computer network
Authors: Gerald D. Cole
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

An extensive measurement capability has been implemented in the Interface Message Processors (IMP's) of the ARPA network of computers. These measurement facilities were implemented by the network contractor, Bolt Beranek and Newman, Inc., to meet the measurement needs of the UCLA Network Measurement Center, and consist of software routines within the store-and-forward IMP's to accumulate statistics, periodically record snap-shots, trace selected messages through the net, and to be able to generate artificial traffic. These capabilities have been augmented by routines at the Network Measurement Center to provide selective control over the data gathering functions, as well as, providing data reduction and print-out routines, and more extensive artificial traffic generation facilities. The purpose of the measurement effort is to provide insight into network behavior, and to support the analytic and simulation modeling work being done at UCLA. In this latter role, the measurements provide a means of verifying, or correcting, models of network behavior by performing appropriate tests in the actual network environment. The result of several such efforts will be discussed.
Numerical applications: updating the product form of the inverse for the revised simplex method
Authors: G. B. Dantzig, R. P. Harvey, R. D. McKnight
Venue: Proceedings of the 1965 20th national conference (1965)

COMPUTER CODES for solving linear programs by the simplex method usually use one of three forms in representing the problem during the course of solution. These are: (a) - the standard form or original simplex method; (b) - the revised simplex method with explicit inverse; and (c) - the revised simplex method with inverse in product form1. [For a comparison of the relative efficiencies of the three methods, see text by Wolfe and Cutler2.] It is hoped that the method to be proposed will at least partially alleviate one of the principal disadvantages of (c), the product form algorithm, namely the need for frequent reinversion of the basis to reduce the number of transformations, without sacrificing too much of some of its advantages, such as the sparseness of the inverse and the ease with which the inverse is kept current. The chief advantage of this proposal is that the number of non-zeros in the inverse representation is conserved and remains approximately constant after the initial buildup. The product form of an inverse with which we are concerned here is the indicated product of a number of elementary m&times;m transformation matrices, each such matrix being an identity matrix with the exception of one column, the so-called transformation column. Computer codes using the product form of the inverse need to store only these exceptional columns and their column indices; usually only the non-zero elements of these columns and their row positions are stored.
Permanence-Based Shape Decomposition in Binary Pyramids
Authors: Gunilla Borgefors, Giuliana Ramella, Gabriella Sanniti di Baja
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

An algorithm to decompose hierarchically bidimensional patterns is introduced. The single-scale input pattern is first transformed into a multi-scale data set. The multi-resolution skeleton is then computed and its hierarchical decomposition is obtained by using the notion of permanence. A constrained reverse distance transformation is applied to the skeleton components to reconstruct the regions into which the pattern is decomposed. A merging process then reduces the number of components to the most significant ones and improves decomposition stability.
A structured approach to problem solving at the introduction level in computer science
Authors: Gerald N. Pitts, Barry L. Bateman
Venue: ACM SIGCSE Bulletin (1977)

Problem solving is a task which is basic to many every day situations. Generally, people are not fully aware of the thought processes which enter into the solution of their particular situation. A problem presents itself and the solution, if determined, is implemented. Humans are able to solve problems in a relatively informal manner. Computers, due to their limited abilities, usually cannot be used to solve problems in this fashion. Greater success in computerized problem solution is often attained through strict, rigid expression of the problem and of its solution (i.e. a structured approach). There are a variety of techniques which one can use in formally defining a problem situation. One that has found some favor is to precisely define the problem by subdividing it into lesser problems and then to define the subproblems into lesser problems until the entire problem has been broken into relatively elementary operations. The problem and all of its subdivisions are then analyzed in order to determine the required input values (i.e. what information or action does each segment need in order to perform its function properly?), and the required output values (i.e. what information or action does the step produce in order for succeeding steps to perform their function properly or for the solution to the problem to be furthered?). Completion of the subdivision and analysis steps is followed by translation of the problem into a computer language and by the subsequent testing of the solution to insure that it is truly correct. Four commonly used methods for expression of the analyses of the problem are a word description of the problem, a list of the major points of the problem, a &ldquo;flowchart&rdquo; of the problem, or an artificial language (commonly a computer language) description of the problem solution. Quite often a combination of the four basic methods is employed. The main purpose of the methods is to completely define the problem and its solution so that every facet of these two items is completely understood. Consequently, it is best to employ whatever method or combination of methods one finds easiest to use in order to further his comprehension of the problem.
The design of the virtual memory aspects of a virtual machine
Authors: D. L. Parnas, W. R. Price
Venue: Proceedings of the workshop on virtual computer systems (1973)

This paper discusses the design of a virtual memory mechanism for use as the first level of an operating system. The virtual memory mechanism provides a virtual machine which retains many of the properties of the host computer system. An implementation on the PDP-11/45 is briefly described.
Efficient Localized Routing for Wireless Ad Hoc Networks
Authors: Xiang-Yang Li, Yu Wang
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We consider a wireless ad hoc network consisting of n points randomly distributed in a two-dimensional plane. We show that, with high probability, we can locally .nd a path for any pair of nodes such that the length of the path is no more than a constant factor of the minimum. By assuming each node knows its position, the method decides where to forward the message purely based on the positions of current node, its neighbors, and the positions of the source and the target. Our method is based on a novel structure called localized Delaunay triangulation [1] and an efficient localized routing method [2] that guarantees that the distance traveled by the packets is no more than a small constant factor of the minimum when the Delaunay triangulation of wireless nodes are known.Our experiments show that the delivery rates of existing localized routing protocols are increased when localized Delaunay triangulation is used instead of several previously proposed topologies, and the localized routing protocol based on Delaunay triangulation works well in practice. We also conducted extensive simulations of another localized routing protocol, FACE method [3]. The path found by this protocol is also reasonably good compared with previous one although it cannot guarantee a constant approximation on the length of the path traveled theoretically.
Data space testing
Authors: Michael Paige
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

A complete software testing process must concentrate on examination of the software characteristics as they may impact reliability. Software testing has largely been concerned with structural tests, that is, test of program logic flow. In this paper, a companion software test technique for the program data called data space testing is described. An approach to data space analysis is introduced with an associated notation. The concept is to identify the sensitivity of the software to a change in a specific data item. The collective information on the sensitivity of the program to all data items is used as a basis for test selection and generation of input values.
A design automation system for electronic switching systems
Authors: T. Hosaka, K. Ueda, H. Matsuura
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes the development and operation experience of NTT's design automation (DA) system for analog/digital switching systems. The DA system is composed of several subsystems, such as logic design, physical design, documentation and manufacturing data conversion programs, organized around the centralized data base management system. By using this system, hardware standardization and products compatibility among different manufacturers have been achieved. The outlook for the future DA technology is also discussed.
Towards an in-house integrated publishing service
Authors: W. J. Kease
Venue: ACM SIGOA Newsletter (1984)

An in-house printing and publishing department has advantages over its equivalent in the outside world in that its market can, to some extent, be captive. But it has disadvantages too, for it can become neglected if the primary business of the organisation it serves is far removed from the world of Garamond 10 point and perfect binding. This paper describes the work of an internal publishing house which is a part of an international UK-based Company working in the fields of telecommunications and electronic systems; and how it is moving, over a period of a few short months and years, from being a somewhat run-down printing unit to being up with the leaders in its field, and in some cases actually pioneering the use of new techniques.
A communications system simulation for a network displaying circuit-switching, message-switching, and packet service
Authors: Paul P. Boehm, Jeffery J. Guzy, Richard K. Paetzold
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This paper describes a computer based simulation which models a network comprised of switching nodes capable of supporting circuit-switching, message-switching and packet-switching. The paper contains three major elements: description of the variable parameters which can be exercised to give insight into the simulated network performance, and some conclusions of the simulation. The specific model is structured into three elements: (1) Traffic Generator, (2) Network Simulator, and (3) Statistics Report. The Simulation model, written in GPSS can represent an hierarchical network or, alternately, a non-hierarchical network. Each model is comprised of all nodes serving as circuit-switches, with a small number of arbitrarily selected nodes acting as message-switch facilities and/or packet-switch facilities. Traffic introduced is comprised of voice calls, message traffic, and packet traffic. Signalling and supervision, and routing plans are evaluated as part of the simulation analysis. Insight into network control information, throttling points, relative queue lengths, and call/message connect - delivery times are derived.
The computer terminal fair and applications symposium
Authors: Al Roberts
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

Providing information to users about computer timesharing terminals and having users tell other users about their computer applications is a highly productive activity for us, and for users a convenient way of learning about interactive terminals and their timesharing applications. About 4 years ago the UW-Madison Academic Computing Center, or MACC, began having computer terminal fairs. Before going on, let me define our &ldquo;Computer Terminal Fair&rdquo;. It is simply a few days set aside during the week when a number of vendors of timesharing terminals set up and display their equipment in one place, preferably on or near our campus. On our campus, which is heavily research oriented, research projects, departemnts, schools and colleges have a great deal of autonomy in selecting terminals for their particular applications. Many types of terminals are used, and with the continuous growth of general purpose timesharing, new terminals are continually being considered for acquisition.
NAPSS&mdash;a numerical analysis problem solving system
Authors: John R. Rice, Saul Rosen
Venue: Proceedings of the 1966 21st national conference (1966)

It has long been a recognized goal of computer programming technology to permit problems to be stated in languages appropriate to the fields in which the problems exist, and to provide for the solution of such problems as stated without requiring the services of specially trained programmers and analysts. Systems that provide these capabilities are &ldquo;problem solving systems.&rdquo; Their languages are problem-oriented languages. Systems of this type have been proposed and developed in a number of areas of engineering and design. Examples are the COGO system developed at MIT 1 and the DACS system developed by General Motors 2. At Purdue University during the past year we have been working on a design for a Numerical Analysis Problem Solving System (NAPSS). This paper discusses some of the features of the language and system design, and an approach through the development of so-called polyalgorithms to the design of the numerical analysis packages that are the essential elements of the problem solving system.
PERT and simulation
Authors: David E. Douglas
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

PERT (Program Evaluation and Review Technique) is a network planning technique used to plan, schedule, and control projects. Unlike the CPM (Critical Path Method) which assumes actual project activity times are deterministic, PERT views the actual performance time for an activity as a random variable. The conventional PERT procedure ignores all subcritical paths which leads to an optimistically biased estimate of the expected earliest occurrence time for the network events. The most promising approach to solving this problem (called the merge event bias problem) appears to be simulation.
Classroom presentation of dynamic events using Hypertext
Authors: Darrell L. Ward, Tom C. Irby
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Problems associated with classroom presentation of dynamic events and associated concepts are developed. The use of Hypertext as a tool for enhancing the learning process with respect to such dynamic events is introduced. The in-class application of this tool is illustrated in two different areas of Computer Science, Introduction to Problem Solving and Data Structures. The advantages of instructor use of the Hypertext tool is summarized and areas of additional work are delineated.
Storage management for ALGOL68
Authors: A. C. Birrell
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

This paper describes some of the techniques which can be used for managing the run time storage required for an ALGOL68 program. The emphasis is on stack storage, since garbage collection techniques would require another paper. The problems caused by some ALGOL68 constructs are described: the solutions given are mainly those adopted in the Cambridge ALGOL68C system.
A computer analysis of chronologies in Genesis
Authors: David E. Y. Sarna
Venue: Proceedings of the 1967 22nd national conference (1967)

Biblical Scholars have long been intrigued by the chronology of the Book of Genesis. Most scholars today agree that the unnaturally large ages mentioned do not represent literal numbers. Professor E. A. Speiser 1 suggested, regarding the literalness of the numbers in Genesis, that One can see at a glance that the Masoretic [received] text is transparently schematic. 1 J. Skinner explains the differences between the Biblical versions as follows: These differences [in chronology, between the Masoretic text, the Septuagint and the Samaritan Torah] are certainly not accidental. They are due to carefully constructed artificial systems of chronology.... That problem has never been satisfactorily solved. 2 A search of the literature** did not turn up a satisfactory schematic arrangement; It can be seen that the life-spans are arranged in a pattern such that while the left term decreases by two, the squared term increases by one. This suggested that perhaps the chronologies in Genesis could be arranged into a scheme of factors not dissimilar to this one. Our first problem was to look for additional examples of this kind, taking into account the 64 different numbers in Genesis.
Motion Detection, Labeling, Data Association And Tracking, in Real-Time on RISC Computer
Authors: Lionel Lacassagne, Maurice Milgram, Patrick Garda
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This article introduces some algorithms for motion detection and tracking. To be able to track moving objects, the analysis rate must be fast enough in order to keep the considered movements slow (and the features of the objects not changing too fast).We are presenting a Markov Random Field based motion detection algorithm running in real time on Pentium II and DSP C6x. For the medium level, we have developed a fast labeling algorithm, a benchmark is provided. The high level is fast because the previous processing steps are running at a faster rate than the video rate.
Computer utilities and the ESS: Accommodations or intimidations
Authors: Michael A. Duggan
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Substantial problems are posed in the &ldquo;computer utility&rdquo; industry, particularly concerning possible large scale entry by communications common carriers. On the other hand, considerable excitement has been generated by the &ldquo;computer utility&rdquo; concept. By 1970 practically all computers will be capable of real-time operation. Most computers will be on-line (tied into other computers for direct communication). Some 60% of all computers will be tied into the nation's communications networks, and half of the information transmitted over that network will be in data form. Indeed, the projections of growth for the computer utility industry indicate it could develop into a two- and-a-half to ten billion dollar market within the next decade. From an economic viewpoint, the computer utility industry is not inherently a &ldquo;natural monopoly.&rdquo; However, either through ill-considered regulation, or through lack of government action, one or a very few parties could easily dominate the industry.
Experiments with a supercompiler
Authors: Valentin F. Turchin, Robert M. Nirenberg, Dimitri V. Turchin
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

In this paper we present and discuss some examples of the operation of the first experimental model of a supercompiler. We have chosen our examples to serve as &ldquo;exhibits&rdquo; which highlight most important features of the supercompiler and intimate its potential uses (this is reflected in section names). The acquaintance with REFAL is not assumed in this paper; our comments will be sufficient for a reader experienced in programming languages to understand REFAL programs (and almost to learn REFAL in the process).