ppxscal/embedding_network huggingface dataset:
Submesh Determination in Faulty Tori and Meshes
Authors: Hsing-Lung Chen, Shu-Hua Hu
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower potential performance degradation, because the time for executing a parallel algorithm tends to depend on the size of the assigned submesh. This paper proposes an efficient approach for identifying all the maximum healthy submeshes present in a faulty torus/mesh. The proposed approach is based on manipulating set expressions, with the search space reduced considerably by taking advantage of the interesting properties of a faulty torus/mesh. This procedure is a distributed one, because every healthy node performs the same procedure independently and concurrently. We show that the proposed scheme may outperform previous methods.
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
Authors: Michael Saks, Fotios Zaharoglou
Venue: SIAM Journal on Computing (2000)

In the classical consensus problem, each of n processors receives a private input value and produces a decision value which is one of the original input values, with the requirement that all processors decide the same value. A central result in distributed computing is that, in several standard models including the asynchronous shared-memory model, this problem has no deterministic solution. The k-set agreement problem is a generalization of the classical consensus proposed by Chaudhuri [ Inform. and Comput., 105 (1993), pp. 132--158], where the agreement condition is weakened so that the decision values produced may be different, as long as the number of distinct values is at most k. For $n>k\geq 2$ it was not known whether this problem is solvable deterministically in the asynchronous shared memory model. In this paper, we resolve this question by showing that for any k < n, there is no deterministic wait-free protocol for n processors that solves the k-set agreement problem. The proof technique is new: it is based on the development of a topological structure on the set of possible processor schedules of a protocol. This topological structure has a natural interpretation in terms of the knowledge of the processors of the state of the system. This structure reveals a close analogy between the impossibility of wait-free k-set agreement and the Brouwer fixed point theorem for the k-dimensional ball.
Summary remarks
Authors: S. Gorn
Venue: Communications of the ACM (1964)

The topics began with discussion of almost exclusively syntactic analysis and methods. Beginning with context-free phrase-structure languages, we considered limitations thereof to remove generative syntactic ambiguities (Floyd), and extensions thereto to introduce more context-dependence (Rose). As the conference proceeded we ran through a spectrum of considerations in which the expressions in the languages considered were examined less and less as meaningless objects (the formal, or purely syntactic approach, as in the paper by Steel) and required more and more meaningful interpretations. In other words, we became more and more involved with semantic considerations. It is clear, then, that applications of the study of mechanical languages to programming must involve semantic questions; ADD must mean something more than the concatenation of three (not two) characters. The papers beyond Session 1 were therefore discussing the mechanization of semantics, but in only one case did we hear about the formalization (and hence mechanization) of the specification of the semantics of a language (McCarthy).
Platform independent dynamic Java virtual machine analysis: the Java Grande Forum Benchmark suite
Authors: Charles Daly, Jane Horgan, James Power, John Waldron
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

In this paper we present a platform independent analysis of the dynamic profiles of Java programs when executing on the Java Virtual Machine. The Java programs selected are taken from the Java Grande Forum benchmark suite, and five different Java-to-bytecode compilers are analysed. The results presented describe the dynamic instruction usage frequencies, as well as the sizes of the local variable, parameter and operand stacks during execution on the JVM. These results, presenting a picture of the actual (rather than presumed) behaviour of the JVM, have implications both for the coverage aspects of the Java Grande benchmark suites, for the performance of the Java-to-bytecode compilers, and for the design of the JVM.
Storage-efficient representation of decimal data
Authors: Tien Chi Chen, Irving T. Ho
Venue: Communications of the ACM (1975)

Usually n decimal digits are represented by 4n bits in computers. Actually, two BCD digits can be compressed optimally and reversibly into 7 bits, and three digits into 10 bits, by a very simple algorithm based on the fixed-length combination of two variable field-length encodings. In over half of the cases the compressed code results from the conventional BCD code by simple removal of redundant 0 bits. A long decimal message can be subdivided into three-digit blocks, and separately compressed; the result differs from the asymptotic minimum length by only 0.34 percent. The hardware requirement is small, and the mappings can be done manually.
Tilcara: an OO perspective to handle continuous fields in GIS
Authors: Arturo Zambrano, L. Polasek, S. Gordillo, J. Bazzocco, G. Trilla, D. Cano, A. Lliteras
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

It is now usual that GIS applications need to define and handle continuous information. This is of extreme relevance in areas like meteorology and environmental applications. GIS do not have tools that allow the use of this type of information, which often prevents to make a complete analysis. In this work we present an application using object-oriented technology that allows us to manipulate continuous data.
A multi-version data model for executing real-time transactions in a mobile environment
Authors: Kam-Yiu Lam, Guo Hui Li, Tei-Wei Kuo
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

With the significant advances in mobile computing technology, there is an increasing demand for various mobile applications to process transactions in a real-time fashion. When remote data access is considered in a mobile environment, data access delay becomes one of the most serious problems in meeting transaction deadlines. In this paper, we propose a multi-version data model and adopt the relative consistency as the correctness criterion for processing of real-time transactions in a mobile environment. The purpose is to reduce the impacts of unpredictable and unreliable mobile network on processing of the real-time transactions. Under the proposed model, the overheads for concurrency control can be significantly reduced, and the data availability is much enhanced even under network failures. A real-time transaction may access stale data, provided that they are relatively consistent with the data accessed by the transaction, and the staleness of the data is within the requirements. An image transaction model, which pre-fetches multiple data versions at fixed hosts, is proposed to reduce the data access delay and to simplify the management of the real-time transactions in a mobile environment. The image transaction model also helps in reducing the transaction-restart overheads and minimizing the impacts of the unpredictable performance of mobile network on transaction executions.
Capability-based addressing
Authors: R. S. Fabry
Venue: Communications of the ACM (1974)

Various addressing schemes making use of segment tables are examined. The inadequacies of these schemes when dealing with shared addresses are explained. These inadequacies are traced to the lack of an efficient absolute address for objects in these systems. The direct use of a capability as an address is shown to overcome these difficulties because it provides the needed absolute address. Implementation of capability-based addressing is discussed. It is predicted that the use of tags to identify capabilities will dominate. A hardware address translation scheme which never requires the modification of the representation of capabilities is suggested. The scheme uses a main memory hash table for obtaining a segment's location in main memory given its unique code. The hash table is avoided for recently accessed segments by means of a set of associative registers. A computer using capability-based addressing may be substantially superior to present systems on the basis of protection, simplicity of programming conventions, and efficient implementation.
Algorithm 449: solution of linear programming problems in 0-1 variables
Authors: František Fiala
Venue: Communications of the ACM (1973)

This subroutine solves the linear zero-one programming problem of the following form.
e-Business 2.0: roadmap for success
Authors: Ravi Kalakota, Marcia Robinson
Venue:  (2001)

Revolutions begin with attacks on the language. Today's managers are bombarded with an alphabet soup of technology acronyms such as CRM, ERP, and SCM. Managers must manage in the fog of this technology revolution. Kalakota and Robinson's book provides a lens for managers who want to understand the terminology and take action--to grasp the opportunities or defend against the invading virtual competitors. When the history of e-business is written--perhaps sooner than we think--this book will go down as a management landmark that helped clear the fog of mumbo jumbo and provided a beacon through which managers could chart their course. --Michael Quinn, eStrategy Director, B2B Commerce Ltd.To survive and succeed in today's complex business world, all companies--from established industry leaders to feisty upstarts--must develop a strategy that allows them to take maximum advantage of the latest trends in technology. Successful companies have implemented focused e-business strategies to build cutting-edge enterprises that serve and retain customers, manage suppliers, and integrate selling chains better than ever before. Others, unfortunately, are lured into ill-fated ventures by the ever-changing roster of buzzwords, fads and analogies.A timely follow-up to the best-seller on this crucial topic, e-Business 2.0 reveals how managers are rewiring the enterprise to take maximum advantage of e-business. Ravi Kalakota and Marcia Robinson present an innovative application framework that guides the migration from a traditional business model to an e-business model. Drawing on their extensive personal experience working with leading businesses, they provide a clear picture of the benefits and challenges that e-business companies face and identify the fundamental design principles for building a successful e-business blueprint.This new edition incorporates the latest strategies and techniques gained from the experiences of the first generation of e-businesses. In addition to updated information on application framework design, the book now features more detail on strategy and e-business execution. e-Business 2.0 shows how e-commerce has evolved into e-business and identifies the 20 key e-business trends that are shaping today's economy. It then addresses core application frameworks--customer relationship management, selling chain management, enterprise resource planning, supply chain management, e-procurement, and business intelligence--and shows how each forms the foundation of an e-business strategy. 0201721651B06012001
Proof techniques for hierarchically structured programs
Authors: Lawrence Robinson, Karl N. Levitt
Venue: Communications of the ACM (1977)

A method for describing and structuring programs that simplifies proofs of their correctness is presented. The method formally represents a program in terms of levels of abstraction, each level of which can be described by a self-contained nonprocedural specification. The proofs, like the programs, are structured by levels. Although only manual proofs are described in the paper, the method is also applicable to semi-automatic and automatic proofs. Preliminary results are encouraging, indicating that the method can be applied to large programs, such as operating systems.
Clarification of Fortran standards&mdash;second report
Authors: C. Kerpelman
Venue: Communications of the ACM (1971)

In 1966, after four years of effort, Fortran became the first programming language standardized in the United States. Since that initial achievement, study and application of the standard specifications have revealed the need for maintenance of the standards. As the result of work initiated in 1967, an initial set of clarifying interpretations was prepared and this clarification was published in Communications of the ACM in May 1969. That work has continued and has resulted in the preparation of this second set of clarifying interpretations. The nature of the maintenance and the new set of corrections to and interpretations of the standard specifications are reported.
A note on the use of the Abacus in number conversion
Authors: H. Kanner
Venue: Communications of the ACM (1960)

Conversion of integers in both directions between the base ten and any desired base can be accomplished with remarkable simplicity by use of the abacus. In fact, the conversion procedures are far more cumbersome on the electric desk calculator, for reasons which will be apparent.
Origin of the online species: ethical perspectives on copyright and the web
Authors: Connie Ury, Frank Baudino, Patricia McFarland
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

The online environment challenges information professionals to stretch the historical boundaries of the understanding of fair use.The authors create and maintain an academic library Web site of more than 500 pages. Recently we have encountered copies of our library instructional materials downloaded from our Web site and uploaded on another academic library's server without express permission to use or modify those materials. Grappling with these issues regarding Internet plagiarism and copyright piqued our interest in this gray area of ethical practice. We continue to struggle with questions such as those posed in the following scenarios: Is the design and format of a Web page (including tables, color schemes, forms, and organizational style) a form of expression that is protected under copyright, much like essays, drawings, dances, and speeches? Does copying the text of an online tutorial that discusses ideas and concepts in the public domain constitute a violation of copyright? Of academic integrity?
Extremely portable random number generator
Authors: J. B. Kruskal
Venue: Communications of the ACM (1969)

Extremely portable subroutines are sometimes needed for which moderate quality and efficiency suffice. Typically, this occurs for library functions (like random number generation and incore sorting) which are not entirely universal or are not used in a standardized way. The literature on random number generators does not seem to contain an algorithm that meets requirements of this sort. An extremely portable 8-line FORTRAN program is provided which is based on an important paper by Coveyou and MacPherson (1967). Using their methods, Fourier analysis is applied to the probability function for the consecutive n-tuples provided by our generator (with n less than or equal to 4). While the small modulus which must be used to maintain portability prevents the quality of the generator from being high, the generator compares well with the bounds established in the above mentioned paper.
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Authors: Alok Baveja, Aravind Srinivasan
Venue: Mathematics of Operations Research (2000)

Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and/or integrality gaps for all problems considered; the central theme of this work is the underlying multicommodity flow relaxation. Applications of these techniques to approximating families of packing integer programs are also presented.
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Authors: Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih
Venue: Machine Learning (2000)

Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the case of trees) number of leaves. Classification accuracy is measured by mean error rate and mean rank of error rate. Both criteria place a statistical, spline-based, algorithm called POLYCLSSS at the top, although it is not statistically significantly different from twenty other algorithms. Another statistical algorithm, logistic regression, is second with respect to the two accuracy criteria. The most accurate decision tree algorithm is QUEST with linear splits, which ranks fourth and fifth, respectively. Although spline-based statistical algorithms tend to have good accuracy, they also require relatively long training times. POLYCLASS, for example, is third last in terms of median training time. It often requires hours of training compared to seconds for other algorithms. The QUEST and logistic regression algorithms are substantially faster. Among decision tree algorithms with univariate splits, C4.5, IND-CART, and QUEST have the best combinations of error rate and speed. But C4.5 tends to produce trees with twice as many leaves as those from IND-CART and QUEST.
Architecture of the space shuttle primary avionics software system
Authors: Gene D. Carlow
Venue: Communications of the ACM (1984)

PASS, perhaps the most complex flight computer program ever developed, epitomizes the benefits to be gained by establishing a well-structured system architecture at the front end of the development process
On validating planar worlds
Authors: Vida Dujmoviác Sue Whitesides
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We present an optimal linear time algorithm for solving a map validation problem: a robot equipped with one portable marker must determine the correctness of a given map of its graph-like world, modelled as a possibly non-planar embedding of a planar graph.
A counterintuitive example of computer paging
Authors: Ronald Fagin
Venue: Communications of the ACM (1976)

A counterexample is exhibited to a natural conjecture concerning the optimal way to group records into pages in the independent reference model of computer paging (an organization is said to be optimal if the &ldquo;least recently used&rdquo; miss ratio is minimized).
Exploiting Parallelism in Geometry Processing with General Purpose Processors and Floating-Point SIMD Instructions
Authors: Chia-Lin Yang, Barton Sano, Alvin R. Lebeck
Venue: IEEE Transactions on Computers (2000)

Three-dimensional (3D) graphics applications have become very important workloads running on today's computer systems. A cost-effective graphics solution is to perform geometry processing of 3D graphics on the host CPU and have specialized hardware handle the rendering task. In this paper, we analyze microarchitecture and SIMD instruction set enhancements to a RISC superscalar processor for exploiting parallelism in geometry processing for 3D computer graphics. Our results show that 3D geometry processing has inherent parallelism. Adding SIMD operations improves performance from 8 percent to 28 percent on a 4-issue dynamically scheduled processor that can issue at most two floating-point operations. In comparison, an 8-issue processor, ignoring cycle time effects, can achieve 20 to 60 percent performance improvement over a 4-issue. If processor cycle time scales with the number of ports to the register file, then doubling only the floating-point issue width of a 4-issue processor with SIMD instructions gives the best performance among the architectural configurations that we examine (the most aggressive configuration is an 8-issue processor with SIMD instructions).
Timing analysis and optimization of a high-performance CMOS processor chipset
Authors: U. Fassnacht, J. Schietke
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

We describe the timing analysis and optimization methodology used for the chipset inside the IBM S/390 Parallel Enterprise Server - Generation 3. After an introduction to the concepts of static timing analysis, we describe the timing-modeling for the gates and interconnects, explain the optimization schemes and present obtained results.
PowerShake: a low power driven clustering and factoring methodology for Boolean expressions
Authors: S. Roy, H. Arts, P. Banerjee
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper describes algebraic techniques that target low power consumption. A unique power cost function based on de-composed factored form representation of a Boolean expression is introduced to guide the structural transformations. Circuits synthesized by the SIS and POSE consume 54.5% and 10.4% more power than that obtained by our tool respectively.
MSO definable string transductions and two-way finite-state transducers
Authors: Joost Engelfriet, Hendrik Jan Hoogeboom
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

We extend a classic result of B&uuml;chi, Elgot, and Trakhtenbrot: MSO definable string transductions i.e., string-to-string functions that are definable by an interpretation using monadic second-order (MSO) logic, are exactly those realized by deterministic two-way finite-state transducers, i.e., finite-state automata with a two-way input tape and a one-way output tape. Consequently, the equivalence of two mso definable string transductions is decidable. In the nondeterministic case however, MSO definable string tranductions, i.e., binary relations on strings that are mso definable by an interpretation with parameters, are incomparable to those realized by nondeterministic two-way finite-state transducers. This is a motivation to look for another machine model, and we show that both classes of MSO definable string transductions are characterized in terms of Hennie machines, i.e., two-way finite-state transducers that are allowed to rewrite their input tape, but may visit each position of their input only a bounded number of times.