ppxscal/embedding_network huggingface dataset:
Impact of economics on compiler optimization
Authors: Arch D. Robison
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

Compile-time program optimizations are similar to poetry: more are written than are actually published in commercial compilers. Hard economic reality is that many interesting optimizations have too narrow an audience to justify their cost in a general-purpose compiler, and custom compilers are too expensive to write. An alternative is to allow programmers to define their own compile-time optimizations. This has already happened accidentally for C++, albeit imperfectly, in the form of template metaprogramming. This paper surveys the problems, the accidental success, and what directions future research might take to circumvent current economic limitations of monolithic compilers.
An effective way to represent quadtrees
Authors: Irene Gargantini
Venue: Communications of the ACM (1982)

A quadtree may be represented without pointers by encoding each black node with a quaternary integer whose digits reflect successive quadrant subdivisions. We refer to the sorted array of black nodes as the &ldquo;linear quadtree&rdquo; and show that it introduces a saving of at least 66 percent of the computer storage required by regular quadtrees. Some algorithms using linear quadtrees are presented, namely, (i) encoding a pixel from a 2n &times; 2>n array (or screen) into its quaternary code; (ii) finding adjacent nodes; (iii) determining the color of a node; (iv) superposing two images. It is shown that algorithms (i)-(iii) can be executed in logarithmic time, while superposition can be carried out in linear time with respect to the total number of black nodes. The paper also shows that the dynamic capability of a quadtree can be effectively simulated.
Automatic adjustment of invalid feature models
Authors: Alex Noort, Willem F. Bronsvoort
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

In current feature modeling systems, all dimensions in a model have to be fully specified by the user. It is desirable that systems become more flexible in this respect, i.e. that non-critical dimensions in a model can be declared as variant, and that the model can be automatically adjusted when this is appropriate. A method and an implementation to realize this will be described. The underlying feature model definition and validation approach will be introduced. Validation is done by a collection of constraint solvers. An overview of invalid situations in which automatic model adjustment can be applied will be given. The constrain solving scheme and, in particular, the automatic model adjustment strategies for different types of constraints will elaborated. Applications in the areas of design by features, creating a member from a family of products, and feature conversion will be given. These will illustrate that automatic feature model adjustment is a very useful concept.
A card format for reference files in information processing
Authors: Mandalay Grems
Venue: Communications of the ACM (1961)

This paper proposes a card format suitable for a variety of reference files in information processing. An 80-column IBM card is divided into two fields&mdash;reference material field (columns 1-67) and identification field (columns 68-80). The format for the reference material is flexible, while the format for the identification is rigid. The reference material includes basically an index, title, source, class, summary and cross reference for each entry. The identification includes basically codes for a matrix of descriptors, an entry number, and the kind, major interest, and source of the reference. The identification also provides a choice to identify material for personal as well as general files. Since this card format is sufficient to identify the material normally associated with reference files for books, articles, programming terms, hardware terms, equipment, machine systems, abbreviations, etc., it is suitable as a standard for card reference files in information processing.
Preparing students for the workforce
Authors: Gordon S. Lowe
Venue: Proceedings of the Australasian conference on Computing education (2000)

Transition from academic studies to life as a professional is one of the most challenging and important roles in educating students. Students spend most of their academic life learning through completion of assignment work, yet will be expected to work as a member of a team in industry. The skills they will require are more diverse than technical skills, particularly communication, how to manage a project, and team work. This paper discusses the significance of an industry related project to student learning and commitment. Discussion of the difficulties experienced by students is also covered. One of the main outcomes of the project was the positive response from students and their increased awareness of critical non technical issues that make a project successful. One final goal of this paper is to draw attention to autonomous robots as a source of project work for programmers, hardware designers, artificial intelligence developers, and researchers.
A global parser for context-free phrase structure grammars
Authors: Stephen H. Unger
Venue: Communications of the ACM (1968)

An algorithm for analyzing any context-free phrase structure grammar and for generating a program which can then parse any sentence in the language (or indicate that the given sentence is invalid) is described. The parser is of the &ldquo;top-to-bottom&rdquo; type and is recursive. A number of heuristic procedures whose purpose is to shorten the basic algorithm by quickly ascertaining that certain substrings of the input sentence cannot correspond to the target nonterminal symbols are included. Both the generating algorithm and the parser have been implemented in RCA SNOBOL and have been tested successfully on a number of artificial grammars and on a subset of ALGOL. A number of the routines for extracting data about a grammar, such as minimum lengths of N-derivable strings and possible prefixes, are given and may be of interest apart from their application in this particular context.
Computer information systems and organization structure
Authors: Daniel Robey
Venue: Communications of the ACM (1981)

A study of Computer Information Systems and Management (CISM) is described and selected results relating to changes in organizational structure in eight organizations are presented. In five of the organizations no changes in formal structure accompanied the introduction of CIS. Where organizational changes did occur, the existing structure of the organization was usually reinforced. These findings suggest that CIS is a flexible tool that is compatible with a variety of organizational design options and not a cause of design per se.
A high-performance Web-based system design for spatial data accesses
Authors: Shu-Ching Chen, Xinran Wang, Naphtali Rishe, Mark Allen Weiss
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

With the increasing use of geographical data in real-world applications, Geographic Information Systems (GISs) have recently emerged as a fruitful area for research. Nowadays, a GIS can be combined with World Wide Web (WWW) techniques to provide information to a multitude of users. A high-performance web-based GIS, called TerraFly, has been developed in order to provide web-based GIS accesses to the general public. The design of TerraFly considers three major aspects including system architecture, data structures, and networking. The system architecture utilizes the existing resources to achieve maximum performance by using the &ldquo;Internally Distributed Multithreading (IDMT)&rdquo; technique. A spatial access method, semantic R-trees, is used to search an object based on both spatial and semantic information. System performance results are presented and analyzed. Reducing network traffic to achieve faster response to users is also discussed.
The state of digital computer technology in Europe
Authors: Nelson M. Blachman
Venue: Communications of the ACM (1961)

This report indicates the level of computer development and application in each of the thirty countries of Europe, most of which were recently visited by the author
An algorithm for generating root locus diagrams
Authors: Allan M. Krall, Robert Fornaro
Venue: Communications of the ACM (1967)

A technique for using a digital computer to draw both ordinary and time-lag root locus diagrams is described. Ordinary diagrams are drawn much faster and more accurately than ever before. Time-lag diagrams, which had been impossible to obtain, are drawn with the same speed and accuracy as ordinary diagrams.
A framework for modeling human-like driving behaviors for autonomous vehicles in driving simulators
Authors: Talal Al-Shihabi, Ronald R. Mourant
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

A framework for modeling driver behavior within driving simulators is described in this paper. This framework serves as a basis for building human- like driving behavior models for autonomous vehicles operating within the virtual environment of a driving simulator. The framework consists of four units, the Perception Unit, the Emotions Unit, the Decision- making Unit (DMU), and the Decision- implementation Unit (DIU). The Perception Unit defines how the model perceives its environment in local and global terms. The Emotions Unit defines how the model responds emotionally to its environment. The DMU investigates the environment for possible actions that might potentially serve the model's emotional demands. And finally the DIU tries to implement these decisions when a traffic condition, perceived as safe enough for such an implementation, emerges. Each of these units has its own set of fuzzy variables and fuzzy ifthen rules. Any driving model, that is based on this framework, should provide membership function parameters for these fuzzy variables in accordance with the category of human driving behavior this model is targeting. Our framework addresses decision making and implementation at the maneuvering and operational levels of the driving task. Decisions at the planning level are addressed through a script- based traffic controller. The present model is limited to simulating human behaviors when driving in a two- lane rural environment.
Finding motifs using random projections
Authors: Jeremy Buhler, Martin Tompa
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Pevzner and Sze [23] considered a precise version of the motif discovery problem and simultaneously issued an algorithmic challenge: find a motif M of length 15, where each planted instance differs from M in 4 positions. Whereas previous algorithms all failed to solve this (15,4)-motif problem. Pevzner and Sze introduced algorithms that succeeded. However, their algorithms failed to solve the considerably more difficult (14,4)-, (16,5)-, and (18,6)-motif problems. We introduce a novel motif discovery algorithm based on the use of random projections of the input's substrings. Experiments on simulated data demonstrate that this algorithm performs better than existing algorithms and, in particular, typically solves the difficult (14,4)-, (16,5)-, and (18,6)-motif problems quite efficiently. A probabilistic estimate shows that the small values of d for which the algorithm fails to recover the planted (l, d)-motif are in all likelihood inherently impossible to solve. We also present experimental results on realistic biological data by identifying ribosome binding sites in prokaryotes as well as a number of known transcriptional regulatory motifs in eukaryotes.
A Tight Bound on the Irregularity Strength of Graphs
Authors: Till Nierhoff
Venue: SIAM Journal on Discrete Mathematics (2000)

An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are different. The {irregularity strength} s(G) is the maximal weight, minimized over all irregular assignments. It is set to $\infty$ if no such assignment is possible. Let $G \neq K_3$ be a graph on n vertices, with s(G) < \infty$. Aigner and Triesch [SIAM J. Discrete Math, 3 (1990), pp. 439--449] used the congruence method to construct irregular assignments, showing $s(G) \le n-1$ if G is connected and $s(G) \le n+1$ in general. We refine the congruence method in the disconnected case and show that $s(G) \leq n-1$ holds for all graphs with s(G) finite, except for K3. This is tight and settles a conjecture of Aigner and Triesch.
The augmented predictive analyzer for context-free languages&mdash;its relative efficiency
Authors: Susumu Kuno
Venue: Communications of the ACM (1966)

It has been proven by Greibach that for a given context-free grammar G, a standard-form grammar Gs, can be constructed, which generates the same language as is generated by G and whose rules are all of the form Z&rarr; cY1 &middot;&middot;&middot; Ym (m &ge; 0) where Z and Yi are intermediate symbols and c a terminal symbol. Since the predictive analyzer at Harvard uses a standard-form grammar, it can accept the language of any context-free Grammar G, given an equivalent standard-form grammar Gs. The structural descriptions SD(Gs, &khgr;) assigned to a given sentence &khgr; by the predictive analyzer, however, are usually different from the structural descriptions SD(G, &khgr;) assigned to the same sentence by the original context-free grammar G from which Gs is derived. In Section 1, an algorithm, originally due to Abbott is described, which converts a given context-free grammar into an augmented standard-form grammar each of whose rules is in standard form, supplemented by additional information describing its derivation from the original context-free grammar. A technique for performing the SD(Gs, &khgr;) to SD(G, &khgr;) transformation effectively is also described. In Section 2, the augmented predictive analyzer as a parsing algorithm for arbitrary context-free languages is compared with two other parsing algorithms: a selective top-to-bottom algorithm similar to Irons' &ldquo;error correcting parse algorithm&rdquo; and
A Framework for Computer Performance Evaluation Using Benchmark Sets
Authors: Umesh Krishnaswamy, Isaac D. Scherson
Venue: IEEE Transactions on Computers (2000)

Benchmarking is a widely used approach to measure computer performance. Current use of benchmarks only provides running times to describe the performance of a tested system. Glancing through these execution times provides little or no information about system strengths and weaknesses. A novel benchmarking methodology is proposed to identify key performance parameters; the methodology is based on measuring performance vectors. A performance vector is a vector of ratings that represents delivered performance of primitive operations of a system. In order to measure performance vectors, a geometric model is proposed which defines system behavior using the concepts of support points, context lattice, and operating points. In addition to the performance vector, other metrics derivable from the geometric model include the variation in system performance and the compliance of benchmarks. Using this methodology, the performance vectors of the Sun SuperSPARC (desktop workstation) and the Cray C90 (vector supercomputer) are evaluated using the SPEC benchmarks and the Perfect Club, respectively. The proposed methodology respects several practical constraints and issues in benchmarking. The instrumentation required is minimal. The benchmarks used are realistic (not synthetic) in order to reflect the delivered (not peak) performance. Finally, operations in the performance vector are not measured individually since there may be significant interplay in their executions.
A simple automatic derivative evaluation program
Authors: R. E. Wengert
Venue: Communications of the ACM (1964)

A procedure for automatic evaluation of total/partial derivatives of arbitrary algebraic functions is presented. The technique permits computation of numerical values of derivatives without developing analytical expressions for the derivatives. The key to the method is the decomposition of the given function, by introduction of intermediate variables, into a series of elementary functional steps. A library of elementary function subroutines is provided for the automatic evaluation and differentiation of these new variables. The final step in this process produces the desired function's derivative. The main feature of this approach is its simplicity. It can be used as a quick-reaction tool where the derivation of analytical derivatives is laborious and also as a debugging tool for programs which contain derivatives.
Improving the access time for random access files
Authors: Philip Clapson
Venue: Communications of the ACM (1977)

Clustering in the key set is decreased by smoothing the key-to-address transformation, and by adding shadow buckets to an open chaining file. The keys are pre-hashed before the address division, to remove the effect of sequential properties in the key set. Shadow buckets in the key search sequence reduce the effect of nonuniformity in file loading, and decrease the number of maximum probes needed to locate a record. The combined effects of these techniques lead to improved file performance for secondary storage devices, as shown by empirical studies.
Collinearity and Two-Step Estimation of Sample Selection Models: Problems, Origins, and Remedies
Authors: Siu Fai Leung, Shihti Yu
Venue: Computational Economics (2000)

This paper investigates the origins of the collinearity problems encountered in the two-step estimation method for sample selection models. The analysis reveals several critical misconceptions and deficiencies in the literature. Remedies to the collinearity problems are proposed and evaluated. Monte Carlo experiments as well as an empirical example based on Mroz's (1987) data are used to illustrate the practical relevance and importance of the analysis.
Efficient adaptive meshing of parametric models
Authors: Alla Sheffer, Alper Üngör
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

Parametric modeling is becoming the representation of choice for most modern solid modelers. However, when generating the finite-element mesh of the model for simulation and analysis, most meshing tools ignore the parametric information and use only the boundary representation of the model for meshing. This results in re-meshing the model basically from scratch each time a parametric change is instantiated, which happens numerous times throughout the design process. In this paper we look at ways to use the parametric information during the meshing procedure to prevent unnecessary re-meshing. The paper examines existing meshing techniques developed for other purposes, which can be applied to this problem. It also suggests several new mesh modification techniques specifically designed for efficient mesh adjustment after parametric model changes.
A bonus from van Wijngaarden's device
Authors: James H. Morris,  Jr.
Venue: Communications of the ACM (1972)

In [1] van Wijngaarden presented a rather remarkable technique for rewriting ALGOL 60 programs to eliminate all labels. The purpose of this note is to point out that the rewriting would also eliminate the use of array returning (procedure returning, label returning, etc.) procedures had they been legal constructs of ALGOL 60. Hence, the many languages which allow such things to be returned as procedure values are not such large extensions of ALGOL 60 as one might think [2, 3, 4, 5].
Deterministic resource discovery in distributed networks
Authors: Shay Kutten, David Peleg, Uzi Vishkin
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

The resource discovery problem was introduced by Harchol-Balter, Leigh ton and Lewin. They developed a number of algorithms for the problem in the weakly connected directed graph model. This model is a directed logical graph, that represents the vertices' &ldquo;knowledge&rdquo; about the topology of the underlying communication network. The current paper proposes a deterministic algorithm for the problem in the same model, with improved time, message, and communication complexities. Each previous algorithm had a complexity that was higher at least in one of the measures. Specifically, previous deterministic solutions required either time linear in the diameter of the initial network, or communication complexity &Ogr;(n3) (with message complexity &Ogr;(n2)), or message complexity &Ogr;(&brvbar;E0&brvbar; log n) (where E0 is the edge set of the initial graph). Compared to the main randomized algorithm of Harchol-Balter, Leigh ton, and Lewin, the time complexity is reduced from &Ogr;(log2 n) to &Ogr;(log n), the message complexity from &Ogr;(n log2 n) to &Ogr;(n log n), and the communication complexity from &Ogr;(n2 log3 n) to &Ogr;(&brvbar;E0&brvbar; log2 n). Our work significantly extends the connectivity algorithm of Shiloach and Vishkin which was originally given for a parallel model of computation. Our result also confirms a conjecture of Harchol-Balter, Leighton, and Lewin, and addresses an open question due to R. Lipton.
DUNE: a multi-layer gridless routing system with wire planning
Authors: J. Cong, J. Fang, K.-Y. Khoo
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

In this paper, we present a multi-layer gridless detailed routing system with wire planning for deep sub-micron (DSM) physical designs. It includes a multi-layer gridless detailed routing engine that can efficiently route point-to-point connections, and a wire planning algorithm that uses exact gridless design rules (variable width and variable spacing) to accurately estimate the routing resources and distribute nets into routing regions. The wire planning method also enables efficient rip-up and reroute in gridless routing. Unlike previous approaches which explore alternatives of blocked nets by gradually tightening the design rules, our planning based approach can take the exact gridless rules and resolve the congestion and blockage at a higher level. Our experimental result shows that using the wire planning algorithm in our detailed routing system can improve the routability and also speed up the run time by 3-17 times.
Oracle parallel processing
Authors: Tushar Mahapatra, Sanjay Mishra
Venue:  (2000)

These days, databases often grow to enormous sizes, straining the ability of single-processor or single computer systems to handle the load. More and more organizations are turning to parallel processing to give them the performance they need. Oracle Parallel Processing is the first book to describe the full range of parallel processing capabilities in the Oracle environment. It demystifies the features and benefits of Oracle parallel processing, the various parallel architectures, parallel execution features, and the Oracle parallel server option.
Design-manufacturing interface: Part II - applications
Authors: W. Maly, H. T. Heineken, J. Khare, P. K. Nag, P. Simon, C. Ouyang
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper illustrates via examples problems at the design-manufacturing interface that exist in the IC industry today, and the ability of the YAN/PODEMA framework in solving these problems. The need for further development of the framework is also emphasized.