ppxscal/embedding_network huggingface dataset:
Monotonic evolution: an alternative to induction variable substitution for dependence analysis
Authors: Peng Wu, Albert Cohen, Jay Hoeflinger, David Padua
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

We present a new approach to dependence testing in the presence of induction variables. Instead of looking for closed form expressions, our method computes monotonic evolution which captures the direction in which the value of a variable changes. This information is then used in the dependence test to help determine whether array references are dependence-free. Under this scheme, closed form computation and induction variable substitution can be delayed until after the dependence test and be performed on-demand. To improve computative efficiency, we also propose an optimized (non-iterative) data-flow algorithm to compute evolution. Experimental results show that dependence tests based on evolution information matches the accuracy of that based on closed-form computation (implemented in Polaris), and when no closed form expressions can be calculated, our method is more accurate than that of Polaris.
Analyses of deterministic parsing algorithms
Authors: Jacques Cohen, Martin S. Roth
Venue: Communications of the ACM (1978)

This paper describes an approach for determining the minimum, maximum, and average times to parse sentences acceptable by a deterministic parser. These quantities are presented in the form of symbolic formulas, called time-formulas. The variables in these formulas represent not only the length of the input string but also the time to perform elementary operations such as pushing, popping, subscripting, iterating, etc. By binding to the variables actual numerical values corresponding to a given compiler-machine configuration, one can determine the execution time for that configuration. Time-formulas are derived by examining the grammar rules and the program representing the algorithm one wishes to analyze. The approach is described by using a specific grammar that defines simple arithmetic expressions. Two deterministic parsers are analyzed: a top-down recursive descent LL(1) parser, and a bottom-up SLR(1) parser. The paper provides estimates for the relative efficiencies of the two parsers. The estimates applicable to a specific machine, the PDP-10, are presented and substantiated by benchmarks. Finally, the paper illustrates the proposed approach by applying it to the analyses of parsers for a simple programming language.
Three-dimensional computer display
Authors: D. Ophir, R. J. Spinrad
Venue: Communications of the ACM (1969)

A stereographic display terminal has been produced using the raster display (BRAD) recently developed at Brookhaven. The system uses a rotating refresh memory to feed standard television monitors. To produce a stereographic display the computer calculates the projected video images of an object, viewed from two separated points. The resulting video maps are stored on separate refresh bands of the rotating memory. The two output signals are connected to separate color guns of a color television monitor, thus creating a superimposed image on the screen. Optical separation is achieved by viewing the image through color filters. The display is interactive and can be viewed by a large group of people at the same time.
IT staffing and retention: a success story
Authors: Brian Gill, Anne Banks Pidduck
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

The current high demand for information technology (IT) work to be done and the comparative shortage of well-trained staff have forced many firms to seriously consider unique methods to recruit and keep their IT personnel assets. We provide an industry case study of a firm with a normally high IT workload, overloaded in 1998 with three additional large-scale IT projects. Simultaneously, the firm experienced its highest IT staff turnover in recent years. The firm undertook a four-part research study and analysis or its problems. A balanced program was implemented based on the results of the study, focusing on interesting and challenging work, working environment and compensation. IT retention increased dramatically from a low of 76% in September 1998 to 84% in late 1998 to 98% in most of 1999, Key business imperatives are proceeding on schedule, new work is being managed, and IT's contribution has become a recognized success factor for the company as a whole.
Symbolic factoring of polynomials in several variables
Authors: Dale E. Jordan, Lewis C. Clapp, Richard Y. Kain
Venue: Communications of the ACM (1966)

An algorithm for finding the symbolic factors of a multivariate polynomial with integer coefficients is presented. The algorithm is an extension of a technique used by Kronecker in a proof that the prime factoring of any polynomial may be found in a finite number of steps. The algorithm consists of factoring single-variable instances of the given polynomial by Kronecker's method and introducing the remaining variables by interpolation. Techniques for implementing the algorithm and several examples are discussed. The algorithm promises sufficient power to be used efficiently in an online system for symbolic mathematics.
Algorithm 422: minimal spanning tree [H]
Authors: V. Kevin M. Whitney
Venue: Communications of the ACM (1972)

This algorithm generates a spanning tree of minimal total edge length for an undirected graph specified by an array of inter-node edge lengths using a technique suggested by Dijkstra [1]. Execution time is proportional to the square of the number of nodes of the graph; a minimal spanning tree for a graph of 50 nodes is generated in 0.1 seconds on an IBM System 360/67. Previous algorithms [2, 3, 4, 5] require an amount of computation which depends on the graph topology and edge lengths and are best suited to graphs with few edges.
Polyphase sorting with overlapped rewind
Authors: R. L. McAllester
Venue: Communications of the ACM (1964)

A variation of the polyphase merge technique of sorting is described which permits one tape at a time to be rewound while the merge is continued on the remaining tapes. The result is the overlapping of a major portion of the rewind time. The technique should be considered whenever a sort is written to operate on five or more tapes that cannot be read backwards. The savings of the overlap method appear to increase as the number of available tapes is increased.
Improved event-scanning mechanisms for discrete event simulation
Authors: F. Paul Wyman
Venue: Communications of the ACM (1975)

Simulation models of large, complex &ldquo;real-world&rdquo; applications have occasionally earned the reputation of eating up hours of computer time. This problem may be attributed in part to difficulties such as slow stochastic convergence. However, an additional problem lies in the fact that a significant amount of bookkeeping time is required to keep future events in their proper sequence. This paper presents a method for significantly reducing the time spent scanning future events lists in discrete event simulations. Three models are presented, all of which improve in effectiveness as the events-list scan problem becomes more burdensome.
Multiple-precision arithmetic and the exact calculation of the 3-j and 9-j symbols
Authors: Robert M. Baer, Martin G. Redlich
Venue: Communications of the ACM (1964)

Described in this paper is a system of general-purpose multiple-precision fixed-point routines and their use in subroutines which calculate exactly the quantum-mechanical 3-j, 6-j and 9-j symbols of large arguments.
A Spatial-Domain Technique for the Design of 3-D Separable-DenominatorState-Space Digital Filters
Authors: Akimitsu Doi, Takao Hinamoto
Venue: Multidimensional Systems and Signal Processing (2001)

In this paper, a technique for designing 3-D separable-denominator state-space digital filters is developed. The design process is divided into two phases. First, the coefficient matrices related to stability are constructed for the filter to be stable by using alternating variable method. Next, the other matrices are obtained by solving linear equations. These phases are repeated until there is no significant change in the squared error function.
Web-based intuitive and effective design of symmetric tiles
Authors: Ergun Akleman, Jianer Chen, Burak Meric
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

This paper presents a new approach for intuitive and effective design of periodic symmetric tiles. We observe that planar graphs can effectively represent symmetric tiles and graph drawing provides an intuitive paradigm for designing symmetric tiles. Moreover, based on our theoretical work to represent hexagonal symmetry by rectangular symmetry, we are able to present all symmetric tiles as graphs embedded on a torus and based on simple modulo operations. This approach enables us to develop a simple and efficient algorithm, which has been implemented in Java. By using this software, designers, architects and artists can create interesting symmetric tiles directly on the web. We also have designed a few examples of symmetric tiles to show the effectiveness of the approach.
An optimally robust hybrid mix network
Authors: Markus Jakobsson, Ari Juels
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

We present a mix network that achieves efficient integration of public-key and symmetric-key operations. This hybrid mix network is capable of natural processing of arbitrarily long input elements, and is fast in both practical and asymptotic senses. While the overhead in the size of input elements is linear in the number of mix servers, it is quite small in practice. In contrast to previous hybrid constructions, ours has optimal robustness, that is, robustness against any minority coalition of malicious servers.
Band reduction algorithms revisited
Authors: Linda Kaufman
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

In this paper we explain some of the changes that have been incorporated in the latest version of the LAPACK subroutine for reducing a symmetric banded matrix to tridiagonal form. These modifications improve the performance for larger-bandwidth problems and reduce the number of operations when accumulating the transformations onto the identity matrix, by taking advantage of the structure of the initial matrix. We show that similar modifications can be made to the LAPACK subroutines for reducing a symmetric positive definite generalized eigenvalue problem to a standard symmetric banded eigenvalue problem and for reducing a general banded matrix to bidiagonal form to facilitate the computation of the singular values of the matrix.
Comments on: 'Robust Line Fitting in a Noisy Image by the Method of Moments'
Authors: N. Kiryati, A. M. Bruckstein, H. Mizrahi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Qjidaa and Radouane have recently presented a method for robust line fitting and experimentally compared it to other methods, including a method suggested by us. The results attributed by Qjidaa and Radouane to our algorithm are incorrect. We apply our algorithm to the data used by Qjidaa and Radouane and demonstrate its robustness and accuracy.
A method for overlapping and erasure of lists
Authors: George E. Collins
Venue: Communications of the ACM (1960)

An important property of the Newell Shaw-Simon scheme for computer storage of lists is that data having multiple occurrences need not be stored at more than one place in the computer. That is, lists may be &ldquo;overlapped.&rdquo; Unfortunately, overlapping poses a problem for subsequent erasure. Given a list that is no longer needed, it is desired to erase just those parts that do not overlap other lists. In LISP, McCarthy employs an elegant but inefficient solution to the problem. The present paper describes a general method which enables efficient erasure. The method employs interspersed reference counts to describe the extent of the overlapping.
Morris's Garbage Compaction Algorithm Restores Reference Counts
Authors: David S. Wise
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1979)

The two-pass compaction algorithm of F.L. Morris, which follows upon the mark phase in a garbage collector, may be modified to recover reference counts for a hybrid storage management system. By counting the executions of two loops in that algorithm where upward and downward references, respectively, are forwarded to the relocation address of one node, we can initialize a count of active references and then update it but once. The reference count may share space with the mark bit in each node, but it may not share the additional space required in each pointer by Morris's algorithm, space which remains unused outside the garbage collector.
An energy-conscious exploration methodology for reconfigurable DSPs
Authors: J. Rabaey, M. Wan
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

As the "system-on-a-chip" concept is rapidly becoming a reality, time-to-market and product complexity push the reuse of complex macromodules. Circuits combining a variety of the macromodules (micro-processors, DSPs, programmable logic and embedded memories) are being reported by a number of companies. Most of these systems target the embedded market where speed, area, and power requirements are paramount, and a balance between hardware and software implementation is needed. Reconfigurable computing devices have recently emerged as one of the major alternative implementation approaches, addressing most of the requirements outlined above.
MATLAB and MATHCAD: updates for popular numeric systems
Authors: Donald L. Shirer
Venue: Computing in Science and Engineering (2001)

"Drop everything," barks your boss, dropping a file folder on your desk. "I need a mathematical simulation of this control system to show a customer, and oh yes, give me some good graphics of its behavior for a meeting tomorrow!"
JML (poster session): notations and tools supporting detailed design in Java
Authors: Gary T. Leavens, Clyde Ruby, K. Rustan, M. Leino, Erik Poll, Bart Jacobs
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

JML is a notation for specifying the detailed design of Java classes and interfaces. JML's assertions are stated using a slight extension of Java's expression syntax. This should make it easy to use. Tools for JML aid in static analysis, verification, and run-time debugging of Java code.
Levels of language for portable software
Authors: P. J. Brown
Venue: Communications of the ACM (1972)

An increasing amount of software is being implemented in a portable form. A popular way of accomplishing this is to encode the software in a specially designed machine-independent language and then to map this language, often using a macro processor, into the assembly language of each desired object machine. The design of the machine-independent language is the key factor in this operation. This paper discusses the relative merits of pitching this language at a high level or a low level, and presents some comparative results.
On the implementation of security measures in information systems
Authors: R. W. Conway, W. L. Maxwell, H. L. Morgan
Venue: Communications of the ACM (1972)

The security of an information system may be represented by a model matrix whose elements are decision rules and whose row and column indices are users and data items respectively. A set of four functions is used to access this matrix at translation and execution time. Distinguishing between data dependent and data independent decision rules enables one to perform much of the checking of security only once at translation time rather than repeatedly at execution time. The model is used to explain security features of several existing systems, and serves as a framework for a proposal for general security system implementation within today's languages and operating systems.
Extreme programming in practice
Authors: James Newkirk, Robert C. Martin
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Follow along the implementation of an actual web-based application developed using Extreme Programming (XP). The application implements the user area for a commercial web site, using Java Servlets and JDBC. This report highlights the practices of XP that worked well on the project as well as those that could be improved.
A simple recovery-only procedure for simple precedence parsers
Authors: G. David Ripley
Venue: Communications of the ACM (1978)

A simple method is described enabling simple precedence parsers to recover from syntax errors. No attempt to repair errors is made, yet parsing and most semantic processing can continue. The result is a good &ldquo;first approximation&rdquo; to syntax error handling with negligible increase in parsing time, space, and complexity of both the parser and its table generator.
A systems theoretic approach to behavioural modeling and simulation of analog functional blocks
Authors: R. Rosenberger, S. A. Huss
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Analog simulation methodologies for the generation of macromodels of analog functional blocks, as reported in literature, are of limited use in practical circuit simulation due to frequent accuracy and efficiency problems. In this paper, a new approach to model the behavior of nonlinear functional blocks is proposed. The approach is based upon the principles of systems theory. The outlined methodology supports the mapping of models from component into behavioral level. The nonlinearity of complex analog modules is reflected efficiently while the electrical signals are maintained.
Multiprocessing compactifying garbage collection
Authors: Guy L. Steele,  Jr.
Venue: Communications of the ACM (1975)

Algorithms for a multiprocessing compactifying garbage collector are presented and discussed. The simple case of two processors, one performing LISP-like list operations and the other performing garbage collection continuously, is thoroughly examined. The necessary capabilities of each processor are defined, as well as interprocessor communication and interlocks. Complete procedures for garbage collection and for standard list processing primitives are presented and thoroughly explained. Particular attention is given to the problems of marking and relocating list cells while another processor may be operating on them. The primary aim throughout is to allow the list processor to run unimpeded while the other processor reclaims list storage The more complex case involving several list processors and one or more garbage collection processors are also briefly discussed.
Passage-based Web text mining (poster session)
Authors: Thanaruk Theeramunkong
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

A large amount of textual information on the Web is very useful information resource. In the past, traditional text mining research treated a text document as a single piece of information. However, some Web documents are long and heterogeneous in their contents. This paper presents a new approach to apply the concept of a passage to Web text mining. A single Web text document is considered as several passages, instead of a single text. The effectiveness is investigated using real Thai Web documents. As the preliminary step, we explore influence of the passage-based method on construction of association rules by comparing rules generated by the passage-based method with those generated by the non-passage-based method.
A modification of Efroymson's technique for stepwise regression analysis
Authors: Harold J. Breaux
Venue: Communications of the ACM (1968)

The computational technique conventionally used for stepwise multiple linear regression requires the storage of an n &times; n matrix of data. When the number of variables, n, is large, this requirement taxes the storage capacity of presently used machinery. The near symmetry of the matrices involved permits a modification requiring only half the storage and computations of the conventional algorithm and this additional storage allows the analysis of problems containing more variables. Alternatively, it permits the analysis of problems containing the same number of variables but with all computations performed in double precision.
An Analog Self-Test Based on Differential I_{\tf="P6965" DD} Monitoring Supported by Differential I_{\tf="P6965"OUT} Checking
Authors: M. Sidiropulos, V. Stopjakova´, H. Manhaeve, V. Musil
Venue: Analog Integrated Circuits and Signal Processing (1999)

This paper proposes a novel DFT scheme that combines two test techniques&mdash;differential power supply current (\Delta I_{DD}) monitoring and differential output current (\Delta I_{OUT}) checking&mdash;in a single analog self-test. The DFT scheme is aimed at fully differential analog circuits. Fault detection is provided by means of differential measurement of the on-chip parameters, such as the I_{DD} and I_{OUT} currents. Due to the differential nature of the test principle used, no reference measurement is required prior to the test, thus the fault detection exhibits a significantly reduced dependency on process parameter variations, variation of temperature during the test as well as outside interference&rsquo;s. Based on measurement results, the realistic tolerance band for fault detection was determined and the fault coverage, resulting from previous simulation experiments, was adjusted.
Vclusters: a flexible, fine-grained object clustering mechanism
Authors: Mark L. Mcauliffe, Michael J. Carey, Marvin H. Solomon
Venue: ACM SIGPLAN Notices (1998)

We consider the problem of delivering an effective fine-grained clustering tool to implementors and users of object-oriented database systems. This work emphasizes on-line clustering mechanisms, as contrasted with earlier work that concentrates on clustering policies (deciding which objects should be near each other). Existing on-line clustering methods can be ineffective and/or difficult to use and may lead to poor space utilization on disk and in the disk block cache, particularly for small- to medium-size groups of objects. We introduce variable-size clusters (Vclusters), a fine-grained object clustering architecture that can be used directly or as the target of an automatic clustering algorithm. We describe an implementation of Vclusters in the Shore OODBMS and present experimental results that show that Vclusters significantly outperform other mechanisms commonly found in object database systems (fixed-size clusters and near hints). Vclusters deliver excellent clustering and space utilization with only a modest cost for maintaining clustering during updates.