ppxscal/embedding_network huggingface dataset:
A framework for scalable global IP-anycast (GIA)
Authors: Dina Katabi, John Wroclawski
Venue: Workshop on Data communication in Latin America and the Caribbean (2001)

This paper proposes GIA, a scalable architecture for global IP-anycast. Existing designs for providing IP-anycast must either globally distribute routes to individual anycast groups, or confine each anycast group to a pre-configured topological region. The first approach does not scale because of expressive growth in the routing tables, whereas the second one severly limits the utility of the service. Our design scales by dividing inter-domain anycast routing into two components. The first component builds inexpensive default anycast routes that consume no bandwidth or storage space. The second component, controlled by the edge domains, generates enhanced anycast routes that are customized according to the beneficiary domain's interests. We evaluate the performance of our design using simulation, and prove its practicality by implementing it in the Multi-threaded Routing Toolkit.
Automated printed circuit routing with a stepping aperture
Authors: Stanley E. Lass
Venue: Communications of the ACM (1969)

A computer program for routing interconnections on a two-sided printed circuit board with a regular pattern of lines, pins (terminals), and vias (feed-through holes) is described. In this program, each interconnection is given a planned routing&mdash;typically, down from the upper pin, through a via, and horizontally to the lower pin. From the top, a virtual aperture (i.e. a long horizontal slit) is stepped down the board. The planned routing is the basis for rerouting interconnections within the aperture to resolve conflicts for lines and vias below the aperture and to maximize the effective line usage. If a conflict has not been resolved before the aperture arrives at the lower pin, interconnections are deleted to resolve the conflict. Extensions of this technique to the control of crosstalk between routed interconnections and to the problem of obtaining 100 percent interconnect are also discussed.
Estimation of the Bivariate Stable Spectral Representation by theProjection Method
Authors: J. Huston McCulloch
Venue: Computational Economics (2000)

A method of estimating the spectral representation of a generalized bivariate stable distribution is presented, based on a series of maximum likelihood (ML) estimates of the stable parameters of univariate projections of the data. The corresponding stable spectral density is obtained by solving a quadratic program. The proposed method avoids the often arduous task of computing the multivariate stable density, relying instead on the standard univariate stable density. The paper applies this projection procedure, under the simplifying assumption of symmetry, to simulated data as well as to foreign exchange return data, with favorable results. Kanter projection coefficients governing conditional expectations are computed from the estimated spectral density. For the simulated data these compare well to their known true values.
A stochastic evaluation model for database organizations in data retrieval systems
Authors: Kenneth F. Siler
Venue: Communications of the ACM (1976)

Experimental work in the valuation of large scale data retrieval systems has been scarce due to its difficulty and prohibitive cost. This paper discusses a simulation model of a data retrieval system which has the effect of significantly reducing the cost of experimentation and enabling research never attempted before. The model is designed to estimate the retrieval workload of alternative data retrieval systems. These data retrieval systems can be organized under several database organizations, including inverted list, threaded list, and cellular list organizations and hybrid combinations of these systems. Effectiveness of the methodology is demonstrated by using the model to study the effect of database organizations in data retrieval systems. In particular, the impact of query complexity is analyzed.
Comment on London's certification of algorithms 245
Authors: K. A. Redish
Venue: Communications of the ACM (1971)

In his Certification of Algorithm 245 [1], Ralph L. London exhibits a common confusion between an algorithm, its representation, and its implementation on a processor&mdash;a code. In the present state of the art we can attempt, in general, to prove an algorithm and to test a code. For example, London states that &ldquo;&hellip; the algorithm TREESORT 3 [2] is proved to perform properly its claimed task of sorting an array M[1:n] into ascending order.&rdquo; While this is true of the algorithm, it is not true of the code unless we place restrictions on the array elements. The trouble arises in this example from the finite precision of processors; the Boolean expression A &ge; B (real A, B) will usually be implemented as A - B &ge; 0, which can fail due to floating point overflow or underflow.
Architectural simulation in the context of behavioral synthesis
Authors: A. Jemai, P. Kission, A. A. Jerraya
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper deals with integrating an interactive simulator within a behavioral synthesis tool, thereby allowing concurrent synthesis and simulation. The resulting environment provides a cycle based simulation of a behavioral module under synthesis. The simulator and the behavioral synthesis are based on a single model that allows to link the behavioral description and the architecture produced by synthesis. The basic simulation-synthesis model is extended in order to allow for concurrent architectural simulation of several modules under synthesis. This paper also discusses an implementation of this concept resulting in a simulator, called AMIS. This tool assists the designer for understanding the results of behavioral synthesis and for architecture exploration. It may also be used to debug the behavioral specification.
Korean text summarization using an aggregate similarity
Authors: Jae-Hoon Kim, Joon-Hong Kim Dosam Hwang
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

In this paper, each document is represented by a weighted graph called a text relationship map. In the graph, each node represents a vector of nouns in a sentence, an undirected link connects two nodes if two sentences are semantically related, and a weight on the link is a value of the similarity between a pair of sentences. The vector similarity can be computed as the inner product between corresponding vector elements. The similarity is based on the word overlap between the corresponding sentences. The importance of a node on the map, called an aggregate similarity, is defined as the sum of weights on the links connecting it to other nodes on the map. In this paper, we present a Korean text summarization system using the aggregate similarity. To evaluate our system, we used two test collections: one collection (PAPER-InCon) consists of 100 papers in the domain of computer science; the other collection (NEWS) is composed of 105 articles in the newspapers. Under the compression rate of 20%, we achieved the recall of 46.6% (PAPER-InCon) and 30.5% (NEWS), and the precision of 76.9% (PAPER-InCon) and 42.3% (NEWS). Experiments show that our system outperforms two commercial systems.
More on kth shortest paths
Authors: B. L. Fox
Venue: Communications of the ACM (1975)

In a recent paper [4], Minieka proposes an algorithm for finding kth shortest paths between all pairs of nodes in an N node network. His claimed time is O(k2N3).
Minit algorithm for linear programming
Authors: Å. Kolm, T. Dahlstrand
Venue: Communications of the ACM (1971)

In his Certification of Algorithm 245 [1], Ralph L. London exhibits a common confusion between an algorithm, its representation, and its implementation on a processor&mdash;a code. In the present state of the art we can attempt, in general, to prove an algorithm and to test a code. For example, London states that &ldquo;&hellip; the algorithm TREESORT 3 [2] is proved to perform properly its claimed task of sorting an array M[1:n] into ascending order.&rdquo; While this is true of the algorithm, it is not true of the code unless we place restrictions on the array elements. The trouble arises in this example from the finite precision of processors; the Boolean expression A &ge; B (real A, B) will usually be implemented as A - B &ge; 0, which can fail due to floating point overflow or underflow.
Relaxed multi-way trees with group updates
Authors: Kim S. Larsen
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

Data structures with relaxed balance differ from standard structures in that rebalancing can be delayed and interspersed with updates. This gives extra flexibility in both sequential and parallel applications. We study the version of multi-way trees called (a,b)-trees (which includes B-trees) with the operations insertion, deletion, and group insertion. The latter has applications in for instance document databases and WWW search engines. We prove that we obtain the optimal asymptotic rebalancing complexities of amortized constant time for insertion and deletion and amortized logarithmic time in the size of the group for group insertion. These results hold even for the relaxed version. Our results also demonstrate that a binary tree scheme with the same complexities can be designed. This is an improvement over the existing results in the most interesting cases.
Efficient DC fault simulation of nonlinear analog circuits
Authors: M. W. Tian, C.-J. R. Shi
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper describes a method to improve the efficiency of nonlinear DC fault simulation. The method uses the Newton-Raphson algorithm to simulate each faulty circuit. The key idea is to order the given list of faults in such a way that the solution of previous faulty circuit can serve as a good initial point for the simulation of the next faulty circuit. To build a good ordering, one step Newton-Raphson iteration is performed for all the faulty circuits once, and the results are used to quantify how faulty circuits and the good circuit are close in their behaviors. With one-step Newton-Raphson iteration implemented by Householder's formula, the proposed method has virtually no overhead. Experimental results on a set of 36 MCNC benchmark circuits show an average speedup of 4.4 and as high as $15$ over traditional stand-alone fault simulation.
The Minimum Distance Diagram of Double-Loop Networks
Authors: Chiuyuan Chen, F. K. Hwang
Venue: IEEE Transactions on Computers (2000)

It is well-known that the minimum distance diagram of a double-loop network yields an L-shape. It is important to know, for a given L-shape, whether there exists a double-loop network realizing it. Necessary and sufficient conditions were given before, but were said to be cumbersome. They also need some clarification. We give new conditions and a simple proof. We also prove that all double-loop networks realizing the same L-shape are isomorphic as the existing proof was given in a Spanish dissertation.
Randomized k-set agreement
Authors: Achour Mostefaoui, Michel Raynal
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

The k-Set Agreement problem generalizes the consensus problem (which corresponds to the case k = 1). The processes propose values and each correct process has to decide a value such that (1) a decided value is a proposed value, and (2) no more than k distinct values are decided. Let f be the maximum number of processes that can crash. It has first been shown that the consensus problem cannot be solved in asynchronous distributed systems when f > 0 (this is the well-known FLP's impossibility result). It has then been shown that this impossibility still holds for the k-set agreement problem when f &gne; k. In the case of the consensus problem, two main approaches have been investigated to circumvent this impossibility: randomization and unreliable failure detectors. For the more general case of the k-set agreement problem, the failure detector approach has recently been investigated. This paper presents a randomization approach to solve the k-set agreement problem in asynchronous distributed systems in which f &gne; k. It requires that at least a majority of processes be correct. The proposed protocol does not require the a priori knowledge of the set of values proposed by processes. It relies on a relatively simple combination of reliable broadcast with randomization. Interestingly, the proposed protocol shows that more choices allow more faults or more efficient runs.
Hardware/software partitioning of embedded system in OCAPI-xl
Authors: G. Vanmeerbeeck, P. Schaumont, S. Vernalde, M. Engels, I. Bolsens
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

The implementation of embedded networked appliances requires a mix of processor cores and HW accelerators on a single chip. When designing such complex and heterogeneous SoCs, the HW / SW partitioning decision needs to be made prior to refining the system description. With OCAPI-xl, we developed a methodology in which the partitioning decision can be made anywhere in the design flow, even just prior to doing code-generation for both HW and SW. This is made possible thanks to a refinable, implementable, architecture independent system description. The OCAPI-xl model was used to develop a stand alone, networked camera, with on-board GIF engine and network layer.
Execution characteristics of programs in a page-on-demand system
Authors: John W. Boyse
Venue: Communications of the ACM (1974)

h show the execution characteristics of two types of commonly used programs in a large-scale, time-shared computer system. A software monitoring facility built into the supervisor was used for data collection during normal system operation. These data were analyzed, and results of this analysis are presented for a Fortran compiler and an interactive line file editor. Probability distribution functions and other data are given for such things as CPU intervals, I/O intervals, and the number of such intervals during execution. Empirical distributions are compared with simple theoretical distributions (exponential, hyperexponential, and geometric). Other data show paging characteristics of tasks as a function of the number of pages those tasks have in core.
IOCIMU - an integrated off-chip IDDQ measurement unit
Authors: M. Svajda, B. Straka, H. Manhaeve
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The implementation of an Off-Chip IDDQ monitor to support the test of complex ASICs is presented in this paper. The monitor can be incorporated into a standard automated test equipment (ATE). It is capable of driving a 2mF capacitive load and can perform measurements of the IDDQ of a device under test (DUT) in the 0-1mA range. According to measurements the monitor can operate at the test rates up to 30kHz and offers an resolution better than 0.1mA. The on-chip integrated bypass switch is capable of handling DUT transient currents up to several amps. The IOCIMU prototype was fabricated in the 2-mm Mietec BiCMOS technology and has an active chip area of 20mm2.
An experimental model of system/360
Authors: Jesse H. Katz
Venue: Communications of the ACM (1967)

The problem of predicting the performance of modern computer systems is formidable. One general technique which can ease this problem is macroscopic simulation. This paper reports on the applicability of that technique to System/360. The paper describes an experimental model of System/360&mdash;its hardware, software, and its environment. The measures of system performance produced by the model consist of statistics relating to turnaround time, throughput, hardware utilization, software utilization, and queueing processes. The model is mechanized in SIMSCRIPT and consists of some 1750 statements. An auxiliary program, the Job Generator, creates automatically the properties of System/360 jobs that get simulated.
The programmer as navigator
Authors: Charles W. Bachman
Venue: Communications of the ACM (1973)

This year the whole world celebrates the five-hundredth birthday of Nicolaus Copernicus, the famous Polish astronomer and mathematician. In 1543, Copernicus published his book, Concerning the Revolutions of Celestial Spheres, which described a new theory about the relative physical movements of the earth, the planets, and the sun. It was in direct contradiction with the earth-centered theories which had been established by Ptolemy 1400 years earlier.
A development toolkit to realize autonomous and interoperable agents
Authors: Federico Bergenti, Agostino Poggi
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Autonomy and inter- operability are two characteristics of software agents that are advocating agent technology as an ideal candidate to support next generation of software systems. This paper presents a Java development toolkit supporting the realization of autonomous and inter- operable agents. This toolkit provides the developer with a goal- oriented agent architecture for FIPAcompliant agents. Goal- orientation supports autonomy because the developer is no longer requested to describe what the agent should do in reaction to events. To this extent, our development toolkit provides a planning engine capable of building plans to achieve the agents goals autonomously. Goal- orientation is also a key aspect of inter- operability because it is the basis of the semantics of FIPA ACL. Our development toolkit can be used at two levels of abstraction. The higher level, that we call the agent level, allows describing the agent in terms of its natural characteristics such as goals, beliefs and social organization. A code generator producing Java skeletons from UML diagrams supports this level. The developer can choose any UML CASE tool to model her agents because this code generator works with files in a standard format. The generated skeletons must be completed with application- specific code at the lower level of abstraction, that we call object level. At this level, agents are seen as Java programs and the developer is provided with a development library to integrate her code within the generated skeletons. This two- level approach allows describing agents in their natural terms at the agent level, while supporting the integration of application- specific and legacy code at the object level. Moreover, the generated code can be customized at the object level to integrate application- specific optimizations.
Real-time biomechanical simulation of volumetric brain deformation for image guided neurosurgery
Authors: Simon K. Warfield, Matthieu Ferrant, Xavier Gallez, Arya Nabavi, Ferenc A. Jolesz
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

We aimed to study the performance of a parallel implementation of an intraoperative nonrigid registration algorithm that accurately simulates the biomechanical properties of the brain and its deformations during surgery. The algorithm was designed to allow for improved surgical navigation and quantitative monitoring of treatment progress in order to improve the surgical outcome and to reduce the time required in the operating room. We have applied the algorithm to two neurosurgery cases with promising results. High performance computing is a key enabling technology that allows the biomechanical simulation to be executed quickly enough for the algorithm to be practical. Our parallel implementation was evaluated on a symmetric multi-processor and two clusters and exhibited similar performance characteristics on each. The implementation was sufficiently fast to be used in the operating room during a neurosurgery procedure. It allowed a three-dimensional volumetric deformation to be simulated in less than ten seconds.
Compiler Analysis for Cache Coherence: Interprocedural Array Data-Flow Analysis and Its Impact on Cache Performance
Authors: Lynn Choi, Pen-Chung Yew
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

In this paper, we present compiler algorithms for detecting references to stale data in shared-memory multiprocessors. The algorithm consists of two key analysis techniques, stale reference detection and locality preserving analysis. While the stale reference detection finds the memory reference patterns that may violate cache coherence, the locality preserving analysis minimizes the number of such stale references by analyzing both temporal and spatial reuses. By computing the regions referenced by arrays inside loops, we extend the previous scalar algorithms [9] for more precise analysis. We develop a full interprocedural array data-flow algorithm, which performs both bottom-up side-effect analysis and top-down context analysis on the procedure call graph to further exploit locality across procedure boundaries. The interprocedural algorithm eliminates cache invalidations at procedure boundaries, which were assumed in the previous compiler algorithms [9]. We have fully implemented the algorithm in the Polaris parallelizing compiler [28]. Using execution-driven simulations on Perfect Club benchmarks, we demonstrate how unnecessary cache misses can be eliminated by the automatic stale reference detection. The algorithm can be used to implement cache coherence in the shared-memory multiprocessors that do not have hardware directories, such as Cray T3D [21].
Additional results on key-to-address transform techniques: a fundamental performance study on large existing formatted files
Authors: V. Y. Lum, P. S. T. Yuen
Venue: Communications of the ACM (1972)

In an earlier paper by Lum, Yuen, and Dodd [1] experimental results comparing six commonly used key-to-address transformation techniques were presented. One transformation in that study referred to as &ldquo;Lin's method&rdquo; is an elaborate technique based on radix transformation. Andrew Lin has since pointed out to the authors that his method of transformation [2] consists of not just a radix transformation algorithm but also the specific ways the values of p and q are chosen as well as hardware implementation to carry out the steps of this transformation in an efficient manner. Since our study was intended for general radix transformations rather than Lin's specific implementation, we think it is more appropriate to change the label of that transformation in [1] from &ldquo;Lin's method&rdquo; to &ldquo;generalized radix transformation method&rdquo; and we use this term here.
The system for business automation (SBA): programming language
Authors: Moshé M. Zloof, S. Peter de Jong
Venue: Communications of the ACM (1977)

The system for business automation (SBA) is a system within which application experts&mdash;nonprogrammers&mdash;can describe and execute their applications on a computer. The user of SBA views his application as manipulation of information in two-dimensional pictures of tables, business forms, and reports on a display terminal. He can gradually automate this application by giving &ldquo;examples&rdquo; to the system of how he manually manipulates the information. The Query-by-Example database language is a subset of the SBA programming language.
Estimation of heart parameters using skin potential measurements
Authors: R. Bellman, C. Collier, H. Kagiwada, R. Kalaba, R. Selvester
Venue: Communications of the ACM (1964)

A fundamental problem of vectorcardiography is the estimation of the state of the heart on the basis of skin potential measurements. A mathematical model relating ventricular dipoles to surface potentials is sketched. Then it is shown that the inverse problem&mdash;that of determining electrical heart parameters on the basis of skin potential measurements&mdash;may be viewed as a nonlinear multipoint boundary value problem. A feasible solution, employing quasilinearization and high-speed digital computers, is given.