ppxscal/embedding_network huggingface dataset:
Two applications of a probabilistic search technique: Sorting X+Y and building balanced search trees
Authors: Michael L. Fredman
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

Let X &equil; {x1,...,xN} and Y &equil; {y1,...,yN} be sets of N real numbers. We denote by X + Y the multiset {xi + yj; 1 &le; i, j &le; N} of size N2. Berklekamp has posed the problem of sorting X + Y. Harper, Payne, Savage and Strauss [1] show that N21og2N comparisons suffice to sort X + Y, thereby saving a factor of 2 over sorting without exploiting the structure of X + Y. (Given u in X + Y, we assume that we know the i,j indices such that u &equil; xi + yj.) Furthermore, they show that this bound is tight for a restricted class of comparison algorithms. However, without their restriction the order of magnitude comparison complexity of this problem has remained an open question. In this paper we show that X + Y can be sorted with O(N2) comparisons. Our proof is unusual for this type of problem in that we do not explicitly exhibit an algorithm. Instead, it is a particular application of a more general search technique whose behavior is easily related to information theoretic lower bounds. In the context of sorting, this search method translates into an insertion sort, where the insertions are not performed by means of the usual binary search, but rather as off-centered searches designed so that each comparison, roughly speaking, equally divides the space of remaining possibilities. We draw attention to this search technique because it might find application to other problems, and we illustrate this possibility with a second application. Our second application concerns the construction of probabilistically balanced binary search trees.
Practical experience with virtual memory systems (Panel Session)
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Virtual memory systems have been a subject of considerable controversy in the last few years, but with the wider availability of these systems from the major manufacturers, the use of virtual memory systems should be commonplace by 1975. This session will examine the use of these systems and user reaction to them. Particular emphasis will be placed upon changes in programming style to exploit the new environment, type of applications helped and hindered by the use of virtual memory systems, and the methods employed for feeding back information to the programmer about the types of demands his program is placing on the computer system. The session will encourage questions from the audience order to cover many of the issues of interest to organizations considering the installation of a virtual memory system.
A standard cell initial placement strategy
Authors: Bill D. Richard
Venue: Proceedings of the 21st Design Automation Conference (1984)

A standard cell initial placement strategy has been developed that incorporates characteristics of both the class of algorithms that is constructive in nature (i.e., bottom-up) and the class that utilizes a top-down partitioning scheme. This approach has been pursued recognizing the fact that while both of these types of algorithms exhibit some rather adverse traits both also possess advantageous properties. Specifically, the placement strategy described in this paper incorporates both the simplicity of constructive placement methods and the global connectivity information characteristic of placement schemes involving partitioning. The specified algorithm has been implemented within the microelectronics computer-aided design facility at Sandia National Laboratories.
Automatic extraction of Irregular Network digital terrain models
Authors: Robert J. Fowler, James J. Little
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

For representation of terrain, an efficient alternative to dense grids is the Triangulated Irregular Network (TIN), which represents a surface as a set of non-overlapping contiguous triangular facets, of irregular size and shape. The source of digital terrain data is increasingly dense raster models produced by automated orthophoto machines or by direct sensors such as synthetic aperture radar. A method is described for automatically extracting a TIN model from dense raster data. An initial approximation is constructed by automatically triangulating a set of feature points derived from the raster model. The method works by local incremental refinement of this model by the addition of new points until a uniform approximation of specified tolerance is obtained. Empirical results show that substantial savings in storage can be obtained.
Interactive specification of structured designs
Authors: Andreas Bechtolsheim
Venue: Proceedings of the 15th Design Automation Conference (1978)

In structured design a design is expressed in high-level components, which are defined in terms of lower-level components. Structured design combines design information of all levels in one consistent data structure. It promotes a top down design and a bottom-up implementation. High-level components are partitioned into more and more detailed components, whereas low-level components are used to build more and more complex building blocks. The components of a design communicate only through well defined interfaces and are otherwise isolated from each other. This increases the modularity of a design, and is a first step towards technology-independent design. A design can be recompiled as new design primitives become available. Capturing the structure of the design also facilitates machine processing, such as logic simulation and verification, automatic placement and layout. Structured design greatly improves the ability to understand and maintain a design. It increases the correctness of a design, it makes the designer more productive and shortens the design cycle. Finally, the design itself serves as accurate documentation.
On Localized Prediction for Power Efficient Object Tracking in Sensor Networks
Authors: Yingqi Xu, Wang-Chien Lee
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Energy is one of the most critical constraints for sensor network applications. In this paper, we exploit the localized prediction paradigm for power-e.cient object tracking sensor network. Localized prediction consists of a localized network architecture and a prediction mechanism called dual prediction, which achieve power savings by allowing most of the sensor nodes stay in sleep mode and by reducing the amount of long-range transmissions. Performance evaluation, based on mathematical analysis, shows that localized prediction can significantly reduce the power consumption in object tracking sensor networks.
An innovative approach to system requirements analysis by using structural modeling method
Authors: Norihisa Komoda, Koichi Haruna, Hiroyuki Kaji, Hiroshi Shinozawa
Venue: Proceedings of the 5th international conference on Software engineering (1981)

As an innovative approach to the system requirements analysis, this paper proposes a computer aided method to develop objectives trees. This method consists of a procedure, algorithms and, a man-machine interactive graphic system. And two typical kinds of applications of the objectives tree in computer applications system planning are described. By this method, working man-hours to develop an objectives tree can be decreased, and quality of communication among system venders, end-users of a computer system, EDP managers and top executives, can be highly improved.
Advances in the BBN BYBLOS OCR System
Authors: Zhidong Lu, Richard Schwartz, Premkumar Natarajan, Issam Bazzi, John Makhoul
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper, we present some recent advances in the BBN BYBLOS OCR system. This OCR system can be used to recognize Arabic, Chinese, and English with high accuracy. A major change in the system is the use of continuous-density HMMs, which allow us to take advantage of large amount of training data and to use unsupervised adaptation methods to improve accuracy in many cases, e.g. on degraded data. Another advance is the substantial increase in recognition speed. With this increased speed, the system is fast enough for practical use on Arabic and English data. The extension of the system to Chinese further demonstrated the language independence of this system and showed that this system can be used on languages with large character sets and complicated character structures. The Chinese OCR system yielded high accuracy on newspaper data.
Simulation models for evaluation of airport baggage-handling systems
Authors: Gerald L. Robinson
Venue: Proceedings of the third conference on Applications of simulation (1969)

Computer simulation models were used to evaluate alternative designs of hypothetical baggage-handling systems for large-capacity aircraft under different baggage-per-passenger conditions. The program was written in GPSS III. Performance indices and criteria used in evaluating relative merits of various system-design alternatives include (1) average delay for individual passengers, (2) standard deviation of delay for individual passengers, (3) maximum delay for individual passengers, and (4) total delay for all passengers, in passenger-hours. Recommendations are made for refinements of the models and for further research.
Reducibility, randomness, and intractibility (Abstract)
Authors: Leonard Adleman, Kenneth Manders
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

The method of showing a problem NP-complete by polynomial reduction is one of the most elegant and productive in our theory ([ 1 ], [ 3 ]). It is a means of providing compelling evidence that a problem in NP is not in P. In this paper we will demonstrate new methods for showing this. Our methods, based on a new notion of reducibility (gamma-reducibility) are apparently of more general applicability than that of polynomial reduction and are intended to be of practical value to researchers in the field. We use our methods to &ldquo;demonstrate&rdquo; (i.e., give compelling evidence) that some natural problems in NP which are not known to be NP-complete are, nonetheless, not in P.
An approach towards information systems with very large numbers of subscribers
Authors: G. Creutz, F. Kiel
Venue: ACM SIGIR Forum (1980)

The Federal Ministry of Research and Technology (BMFT) took the initiative in starting a project concerning two-way cable television in 1976 at the Heinrich-Hertz-Institute. The two-way cable television provided a model for investigating the possibilities of new screen-orientated, interactive systems for large numbers of subscribers using alpha-numerics, graphics, motion-pictures, and sound. One of the most important research aspects proved to be the construction of a computer control centre which would cater for this type of hybrid information system. At present a laboratory model of such a control centre is being developed by the Heinrich-Hertz-Institute in collaboration with the Computer Industry. This model is based on a mini-computer multi-processor system.
Compiling into APL
Authors: George R. Mayforth
Venue: Proceedings of the international conference on APL (1981)

In some programming situations APL code can become as obtuse as that of other languages. One possible way to deal with such instances is to create a high-order programming language (HOPL) which provides an easy-to-code, easy-to-maintain structure and which may be compiled straight-forwardly into APL functions for execution. Since the HOPL is designed for relatively narrow fields of use, it can be tailored directly to the problem which it solves. Two of the areas where the HOPL concept has proven useful are implementation of a simple, interactive graphics system and selection of data records from a database. We draw examples from these areas to discuss the concept and use of HOPL's.
APL and Halstead's theory of software metrics
Authors: Joseph L.F. De Kerf
Venue: ACM SIGAPL APL Quote Quad (1981)

The increasing complexity of computer programs and of the development of systems creates an ever growing need of objective methods for measuring the quality of software. A theory providing this measure to some extent has been developed in the last decade by M.H. Halstead. The only parameters in the developed formulae are the number of operators and the number of operands in the routines. Numerous statistical studies have shown a relatively good correlation between theory and experimental results. The theory is applied in this paper to a set of APL defined functions and the results are compared with those obtained by Halstead for other languages.
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
Authors: Ilan Adler, Nimrod Megiddo
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

It has been a challenge for mathematicians to theoretically confirm the extremely good performance of simplex-type algorithms for linear programming. In this paper we analyze the average number of steps performed by a simplex algorithm so-called the self-dual method. Instead of starting the algorithm at the traditional point (1, ..., 1)T, we use points of the form (1, &egr;, &egr;2, ...) T, with &egr; sufficiently small. The result that we get is much better, in two respects, than those of the previous analyses. First, we show that the expected number of steps is bounded between two quadratic functions c1(min(m, n))2 and c2(min(m, n))2 of the smaller dimension of the problem. This should be compared with the previous two major results in the field. Borgwardt proves an upper bound of O(n4m1/(n-1)) under a restrictive model which implies that the zero-vector satisfies all the constraints, and also the algorithm under his consideration solves only problems from the particular subclass. Smale analyzes a less restrictive algorithm. He shows that for any fixed m there is a constant c(m) such the expected number of steps is less than c(m)(ln n)m(m+1); Megiddo has shown that, under Smale's model, an upper-bound C(m) exists. Thus, we prove for the first time a polynomial upper bound with no restrictions (except for non-degeneracy) on the problem, and establish for the first time a nontrivial lower bound of precisely the same order of magnitude. Secondly, our probabilistic model is much less restrictive than the previous ones. Both Borgwardt and Smale require the input vectors to be drawn from spherically
Eigenanalysis and polynomial root finding primitive functions
Authors: S. Schmidt, J. A. Brown, M. A. Jenkins
Venue: ACM SIGAPL APL Quote Quad (1982)

Working in conjunction with complex arithmetic extensions to APL, two new experimental primitive functions have been defined. They are an eigenanalysis primitive function and one for polynomial root finding. This paper traces our procedures of defining and testing the new functions, as well as an outline of the algorithms themselves. A few sample problems are given.
Programming is a part time job
Authors: Edrice Addleman
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

A lot of people are predicting the future these days. Some are saying that in five years applications programmers will be an extinct species. Others are predicting that software will become so extensive that naive users will be able to write their own programs. In any event, the future of applications programmers promises to be insecure at best. I say none of these predictions will come true. With all this advance warning, programmers and programming managers will once again find a way to survive. This is the natural behavior of anyone in danger. But I would like to suggest that we take a fresh look at the situation. I am not chastising programmers. As their jobs are defined, they are doing what is required of them. They have not deliberately set out to make things difficult for their organizations. The fact is, however, that organizations are in some confusion as to just what good their data processing departments are doing for them. We have been trying for over 25 years to define our jobs in this field, and so far all we've managed to do is protect our own interests. What I am going to suggest here is that we challenge ourselves on this. One of the ways I suggest we challenge ourselves is to face up to the fact that programming is not a full time job. It is 20% of a job. The remaining 80% is the topic of this paper.
An introductory course in the applications of computer technology in the health sciences
Authors: G. Bordage, Robin B. Lake
Venue: ACM SIGCSE Bulletin (1976)

This paper discusses the contents of an introductory course in the applications of computer technology in the health sciences. A set of instructional goals is described, designed to meet the basic needs of the health professional involved in understanding and developing computer-based applications in his environment. From these goals, a list of specific objectives is constructed and presented as the student's minimum level of achievement for the course. The implementation, evaluation and impact of the course are reviewed.
Engineering applications I: Implicit function simulation of the ablation problem using Finite Fourier Transforms
Authors: E. Liban, R. E. Kopp
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THIS PAPER will describe a new method of simulating the temperature distribution and melting rate encountered in the ablation problem. The most elementary form of the problem can be stated as follows. One side of a solid slab is subjected to a time-varying neat input q (t) and the other side is insulated. When the temperature T reaches the melting point Tm, melting occurs and the liquid is immediately removed. The length l (t) of the slab therefore changes with time t after melting occurs. We let the heated side, before and during melting, always be at the space coordinate x &equil; 0 and the insulated side at x &equil; l (t). The initial length of the slab is l (0) &equil; l0. The boundary conditions before melting are given by specifying the heat fluxes,k @@@@T/@@@@x, at both sides. At the heated side the flux equals the given heat input, q (t), and at the insulated side the flux equals zero. During melting the temperature of the heated side, x &euil; 0, remains at the constant melting temperature Tm and at the insulated side x &equil; l (t), the flux or temperature gradient vanishes. The melting rate, and hence the instantaneous length l (t) of the remaining slab, is a function of the heat input and the flux at x &equil; 0. The standard method for the solution of this problem consists of a coordinate transformation such that the boundary conditions can be given at fixed points. The transformed equation, however, is considerably more difficult to simulate on the analog computer than the heat equation of a bar with fixed length. The method to be discussed in this paper leads to a much simpler analog simulation of the problem during melting. We extend the length of the remaining solid bar such that it always equals the initial length l0 of the slab and postulate the existence of a heat flux at x &equil; l0 such that the prescribed conditions at x &equil; 0 and x &equil; l (t) are satisfied. The actual instantaneous length l (t) of the melting slab is obtained from the equation relating flux and heat input at x &equil; 0 to the melting rate. A simple, though rigorous, mathematical argument is given which proves that the temperature distribution for 0 &le; x &le; l (t) and the melting rate of the reformulated problem satisfy the original equations and boundary conditions of the melting slab.
APL on a multiprocessor architecture
Authors: Norman Brenner
Venue: Proceedings of the international conference on APL (1982)

Several computers have been built experimentally which incorporate a large number of identical CPUs. One example known to this author contains 65 identical microprocessors: one is the &ldquo;master&rdquo; and issues orders (normally identical or nearly so) to the other 64, called &ldquo;slaves&rdquo;. The master and each slave has its own storage unit. It is proposed that such a computer could be used as an auxiliary to a conventional computer to assist in the execution of APL code. APL vectors would be stored in scattered fashion, one element per slave memory, so that they can be processed in parallel. Reduce and scan operations are considered in detail, and requirements are derived for the data interconnection paths among the processors.
An architecture with many operand registers to efficiently execute block-structured languages
Authors: Roger B. Dannenberg
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

Register allocation schemes are presented that effectively use many registers in the execution of block-structured languages. Simulation statistics for a machine with many registers and a conventional architecture are compared. The results indicate that the average operand access time and the required memory bandwidth of conventional machines can be significantly reduced. The implications of the register allocation schemes for machine architecture are discussed.
POPSS - a parametric operating system simulator
Authors: Justin C. Walker, Charles E. Hughes
Venue: ACM SIGCSE Bulletin (1973)

In this paper we describe POPSS, an event driven simulator which is intended to simulate the activity of a computer system- hardware together with an operating system - as it processes a work-load. Input to the simulator is in the form of keyword parameters which are used for describing all three components - hardware, operating system, and workload. POPSS is a simulator as opposed to a simulation language. It is designed to model the inner workings of a computer system in addition to yielding the results usually associated with simulation. The program is highly modular, consisting of some 45 subprograms. Of these, there are 22 modules, each of which represents an operating system component (or possibly a part of one such component). Included in POPSS are built-in replacement features to allow a user the capability of designing alternative resource allocation strategies. These features are in addition to the standard subprogram replacement automatically available through the use of FORTRAN IV.
A new approach to teaching a first course in compiler construction
Authors: Henry D. Shapiro, M. Dennis Mickunas
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

A new approach to teaching a first course in compiler construction is presented, in which the traditional term project is replaced by several smaller, independent, programming assignments. Each assignment is a compiler for a simple language using a different parsing technique. A means is described to augment the programming assignments, so that a greater variety of experiences is provided students. A short review of the literature is included.
Clamping: A method of antialiasing textured surfaces by bandwidth limiting in object space
Authors: Alan Norton, Alyn P. Rockwood, Philip T. Skolmoski
Venue: ACM SIGGRAPH Computer Graphics (1982)

An object space method is given for interpolating between sampled and locally averaged signals, resulting in an antialiasing filter which provides a continuous transition from a sampled signal to its selectively dampened local averages. This method is applied to the three standard Euclidean dimensions and time, resulting in spatial and frame to frame coherence. The theory allows filtering of a variety of functions, including continuous and discrete representations of planar texture.