ppxscal/embedding_network huggingface dataset:
A case for intelligent disks (IDISKs)
Authors: Kimberly Keeton, David A. Patterson, Joseph M. Hellerstein
Venue: ACM SIGMOD Record (1998)

Decision support systems (DSS) and data warehousing workloads comprise an increasing fraction of the database market today. I/O capacity and associated processing requirements for DSS workloads are increasing at a rapid rate, doubling roughly every nine to twelve months [38]. In response to this increasing storage and computational demand, we present a computer architecture for decision support database servers that utilizes &ldquo;intelligent&rdquo; disks (IDISKs). IDISKs utilize low-cost embedded general-purpose processing, main memory, and high-speed serial communication links on each disk. IDISKs are connected to each other via these serial links and high-speed crossbar switches, overcoming the I/O bus bottleneck of conventional systems. By off-loading computation from expensive desktop processors, IDISK systems may improve cost-performance. More importantly, the IDISK architecture allows the processing of the system to scale with increasing storage demand.
A Compact 3V, 70mW, 12-bit Video-Speed CMOS ADC
Authors: Geir S. Østrem, Øystein Moldsvor, Oddvar Aaserud
Venue: Analog Integrated Circuits and Signal Processing (1998)

A 12-bit video speed pipelined switched capacitor analog-to-digital converter (ADC) has been implemented in a 0.5 &micro;m standard CMOS process. It operates from a single 2.6&ndash;3.3V supply, dissipates 23mA (independent of supply voltage) at 20 MSPS and occupies only 1.1mm ^2. A 61dB SINAD (f_in &equals; 4.5 MHz) and an effective resolution bandwidth of 9 MHz is achieved.
Recent developments in standardized time series (panel)
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The purposes of these two panel sessions are to present recent research results and to have a panel discussion on future research directions in standardized time series. Because the major research results presented by the panelists will be published in archival journals, they have been asked to publish in the conference proceedings either an extended abstract of their work with appropriate references or a paper describing their results for the practitioner.
Design and Evaluation of a Window-Consistent Replication Service
Authors: Ashish Mehra, Jennifer Rexford, Farnam Jahanian
Venue: IEEE Transactions on Computers (1997)

Real-time applications typically operate under strict timing and dependability constraints. Although traditional data replication protocols provide fault tolerance, real-time guarantees require bounded overhead for managing this redundancy. This paper presents the design and evaluation of a window-consistent primary-backup replication service that provides timely availability of the repository by relaxing the consistency of the replicated data. The service guarantees controlled inconsistency by scheduling update transmissions from the primary to the backup(s); this ensures that client applications interact with a window-consistent repository when a backup must supplant a failed primary. Experiments on our prototype implementation, on a network of Intel-based PCs running RT-Mach, show that the service handles a range of client loads while maintaining bounds on temporal inconsistency.
Analyzing CMOS power supply networks using Ariel
Authors: Don Stark, Mark Horowitz
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper describes Ariel, a system for analyzing voltage drops and current density in the power networks of CMOS VLSI circuits. Three main parts, a Magic-based resistance extractor, a Rsim-based current simulator, and a network analyzer, work in tandem to examine the current/voltage characteristics of the power networks with a minimum of manual effort from the designer. The performance of the system on several chips is given.
Circulant Preconditioners for Markov-Modulated Poisson Processes and Their Applications to Manufacturing Systems
Authors: Wai Ki Ching, Raymond H. Chan, Xun Yu Zhou
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

The Markov-modulated Poisson process (MMPP) is a generalization of the Poisson process and is commonly used in modeling the input process of communication systems such as data traffic systems and ATM networks. In this paper, we give fast algorithms for solving queueing systems and manufacturing systems with MMPP inputs. We consider queueing systems where the input of the queues is a superposition of the MMPP which is still an MMPP. The generator matrices of these processes are tridiagonal block matrices with each diagonal block being a sum of tensor products of matrices. We are interested in finding the steady state probability distributions of these processes which are the normalized null vectors of their generator matrices. Classical iterative methods, such as the block Gauss--Seidel method, are usually employed to solve for the steady state probability distributions. They are easy to implement, but their convergence rates are slow in general. The number of iterations required for convergence increases like $O(m)$, where $m$ is the size of the waiting spaces in the queues. Here, we propose to use the preconditioned conjugate gradient method. We construct our preconditioners by taking circulant approximations of the tensor blocks of the generator matrices. We show that the number of iterations required for convergence increases at most like $O(\log_2 m)$ for large $m$. Numerical results are given to illustrate the fast convergence.As an application, we apply the MMPP to model unreliable manufacturing systems. The production process consists of multiple parallel machines which produce one type of product. Each machine has exponentially distributed up time, down time, and processing time for one unit of product. The interarrival of a demand is exponentially distributed and finite backlog is allowed. We consider hedging point policy as the production control. The average running cost of the system can be written in terms of the steady state probability distribution. Our numerical algorithm developed for the queueing systems can be applied to obtain the steady state distribution for the system and hence the optimal hedging point. Furthermore, our method can be generalized to handle the case when the machines have a more general type of repairing process distribution such as the Erlangian distribution.
Feature Mapping and View Planning with Localized Surface Parameters
Authors: Xiaobu Yuan, Siwei Lu
Venue: Journal of Mathematical Imaging and Vision (1997)

Object recognition is imperative in industry automation since it empowers robots with the perceptual capability of understanding the three-dimensional(3-D) environment by means of sensory devices. Considering object recognition as a mapping between object models and a partial description of an object, this paper introduces a three-phase filtering method that eliminates candidate models when their differences with the object show up. Throughout the process, a view-insensitive modeling method, namely localized surface parameters, is employed.Surface matching is carried out in the first phase to match models with the object by comparing their localized surface descriptions. A model is a candidate of the object only if every object surface matches locally with at least one of the model surfaces. Since the topological relationship between surfaces specifies the global shape of the object and models, it is then checked in the next phase with local coordinate systems to make sure that a candidate model has the identical structure as the object.Because the information of an object cannot be complete in a single viewing direction, the first two conditions can only determine if a candidate has the same portion as the object. The selected model may still be bigger than the object. To avoid the part-to-whole confusion, in the third phase, a back projection from candidate models is performed to ensure that no unmatched model features become visible when a model is virtually brought to the object&lsquo;s orientation.In case multiple models are selected as a result of the insufficient information, disambiguating features and their visible directions are derived to verify the expected feature. In addition to the view independent object recognition under even ambiguous situations, the filtering method has a low computational complexity upper bounded byO(m^2n^2) and lower bounded by O(mn), where m and n are the numbers of model and object features. The three-phase object recognition has been exercised with real and synthesized range images. Experiment results are given in the paper.
Nondegeneracy of Polyhedra and Linear Programs
Authors: Yanhui Wang, Renato D. C. Monteiro
Venue: Computational Optimization and Applications (1997)

This paper deals with nondegeneracy of polyhedra and linear programming (LP) problems. We allow for the possibility that the polyhedra and the feasible polyhedra of the LP problems under consideration be non-pointed. (A polyhedron is pointed if it has a vertex.) With respect to a given polyhedron, we consider two notions of nondegeneracy and then provide several equivalent characterizations for each of them. With respect to LP problems, we study the notion of constant cost nondegeneracy first introduced by Tsuchiya [25] under a different name, namely dual nondegeneracy. (We do not follow this terminology since the term dual nondegeneracy is already used to refer to a related but different type of nondegeneracy.) We show two main results about constant cost nondegeneracy of an LP problem. The first one shows that constant cost nondegeneracy of an LP problem is equivalent to the condition that the union of all minimal faces of the feasible polyhedron be equal to the set of feasible points satisfying a certain generalized strict complementarity condition. When the feasible polyhedron of an LP is nondegenerate, the second result shows that constant cost nondegeneracy is equivalent to the condition that the set of feasible points satisfying the generalized condition be equal to the set of feasible points satisfying the same complementarity condition strictly. For the purpose of giving a preview of the paper, the above results specialized to the context of polyhedra and LP problems in standard form are described in the introduction.
An expository on verification and validation of simulation models
Authors: Robert G. Sargent
Venue: Proceedings of the 17th conference on Winter simulation (1985)

In this expository paper we give a general introduction to verification and validation of simulation models, define the various validation techniques, and present a recommended model validation procedure.
Optimal Cycle Codes Constructed From Ramanujan Graphs
Authors: Jean-Pierre Tillich, Gilles Zémor
Venue: SIAM Journal on Discrete Mathematics (1997)

We aim here to show how some known Ramanujan Cayley graphs yield error-correcting codes that are asymptotically optimal in the class of cycle codes of graphs.The main reason why known constructions of Ramanujan graphs yield good cycle codes is that the number of their cycles of a given length behaves essentially like that of random regular graphs. More precisely, we show that for actual constructions of Ramanujan graphs of degree $\Delta$ which are bipartite, and for the double cover of known Ramanujan graphs which are not bipartite, the number of cycles of length 2l is $\BigOe(\Delta-1+\varepsilon)^{2l}$ (for every $\varepsilon > 0$), which is about what one could expect from a random regular graph of degree $\Delta$. Furthermore, it is possible to show that this property guarantees the highest possible error probability $p$ that the corresponding cycle codes can sustain, among the class of cycle codes of $\Delta$-regular graphs. This gives a constructive answer to an early problem in coding theory, namely, determining what is asymptotically the best possible performance of cycle codes of graphs when submitted to the binary symmetric channel.
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Authors: Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
Venue: SIAM Journal on Computing (1998)

Directed s-t connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the first known deterministic sublinear space, polynomial time algorithm for directed s-t connectivity. For $n$-vertex graphs, our algorithm can use as little as $n/2^{\Theta(\sqrt{\log n})}$ space while still running in polynomial time.
Adaptive Algorithms for Join Processing in Distributed Database Systems
Authors: Peter Scheuermann, Eugene Inseok Chong
Venue: Distributed and Parallel Databases (1997)

Distributed query processing algorithms usually perform data reduction by using a semijoin program, but the problem with these approaches is that they still require an explicit join of the reduced relations in the final phase. We introduce an efficient algorithm for join processing in distributed database systems that makes use of bipartite graphs in order to reduce data communication costs and local processing costs. The bipartite graphs represent the tuples that can be joined in two relations taking also into account the reduction state of the relations. This algorithm fully reduces the relations at each site. We then present an adaptive algorithm for response time optimization that takes into account the system configuration, i.e., the additional resources available and the data characteristics, in order to select the best strategy for response time minimization. We also report on the results of a set of experiments which show that our algorithms outperform a number of the recently proposed methods for total processing time and response time minimization.
Using the BURKS 2 CD-ROM in a principles of programming languages course
Authors: Frances L. Van Scoy
Venue: ACM SIGCSE Bulletin (1998)

In this paper, we describe the use of the BURKS 2 CD-ROM in a principles of programming languages course. The CD-ROM contains compilers and documentation for many programming languages. The course described in this paper emphasises principles and paradigms of languages rather than the details of one or two specific languages.
Stiffness detection and estimation of dominant spectrum with explicit Runge-Kutta methods
Authors: Kersti Ekeland, Brynjulf Owren, Eivor Øines
Venue: ACM Transactions on Mathematical Software (TOMS) (1998)

A new stiffness detection scheme based on explicit Runge-Kutta methods is proposed. It uses a Krylov subspace approximation to estimate the eigenvalues of the Jacobian of the differential system. The numerical examples indicate that this technique is a worthwhile alternative to other known stiffness detection schemes, especially when the systems are large and when it is desirable to know more about the spectrum of the Jacobian than just the spectral radius.
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks
Authors: Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

This paper addresses the one-to-all broadcasting problem and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Broadcasting is the information dissemination problem in which a node of a network sends the same piece of information to all the other nodes. Multicasting is a partial broadcasting in the sense that only a subset of nodes forms the destination set. Both operations have many applications in parallel and distributed computing. In this paper, we study these problems in both line model, and cut-through model. The former assumes long distance calls between nonneighboring processors. The latter strengthens the line model by taking into account the use of a routing function. Long distance calls are possible in circuit-switched and wormhole-routed networks, and also in many networks supporting optical facilities.In the line model, it is well known that one can compute in polynomial time a $\left\lceil {\log_2n} \right\rceil$-round broadcast or multicast protocol for any arbitrary network. Unfortunately, such a protocol is often inefficient from a practical point of view because it does not use the resources of the network in a balanced way. In this paper, we present a new algorithm to compute broadcast or multicast protocols. This algorithm applies under both line and cut-through models. Moreover, it returns protocols that efficiently use the bandwidth of the network. From a complexity point of view, we also show that most of the optimization problems relative to the maximization of the efficiency of broadcast or multicast protocols in terms of switching time or vertex load are NP-complete. We have, however, derived polynomial efficient solutions for tree-networks.
Replication for logic bipartitioning
Authors: Morgan Enos, Scott Hauck, Majid Sarrafzadeh
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a better understanding of the important issues in logic replication. By developing new optimizations to existing algorithms we are able to significantly improve the quality of these techniques, achieving up to 12.5% better results than the best existing replication techniques. When integrated into our already state-of-the-art partitioner, we improve overall cutsizes by 37.8%, while requiring the duplication of at most 7% of the logic.
N-dimensional geometry using APL2
Authors: Charles Haspel, Alphonse Thomas Vasquez
Venue: ACM SIGAPL APL Quote Quad (1985)

We describe a computational investigation of the geometry of fundamental domains and units in totally real algebraic number fields. Our approach requires the finding of convex hulls and fundamental domains in n-dimensional space and their display and manipulation. APL2 [API] and graphics are used for this purpose and appear to be essential for any practical pursuit of this approach. This paper presents a definition of the problem and an example solution including drawings of a fundamental domain in 4-space and portions of the APL2 code for finding n-dimensional convex hull boundaries and picking fundamental domains. The overall approach has been to generalize to n dimensions the techniques of [HV1] and [HV2], which attacked the same problem in three dimensions.
Structural matching and discovery in document databases
Authors: Jason Tsong-Li Wang, Dennis Shasha, George J. S. Chang, Liam Relihan, Kaizhong Zhang, Girish Patel
Venue: ACM SIGMOD Record (1997)

Structural matching and discovery in documents such as SGML and HTML is important for data warehousing [6], version management [7, 11], hypertext authoring, digital libraries [4] and Internet databases. As an example, a user of the World Wide Web may be interested in knowing changes in an HTML document [2, 5, 10]. Such changes can be detected by comparing the old and new version of the document (referred to as structural matching of documents). As another example, in hypertext authoring, a user may wish to find the common portions in the history list of a document or in a database of documents (referred to as structural discovery of documents). In SIGMOD 95 demo sessions, we exhibited a software package, called TreeDiff [13], for comparing two latex documents and showing their differences. Given two documents, the tool represents the documents as ordered labeled trees and finds an optimal sequence of edit operations to transform one document (tree) to the other. An edit operation could be an insert, delete, or change of a node in the trees. The tool is so named because documents are represented and compared using approximate tree matching techniques [9, 12, 14].
A source-level dynamic analysis methodology and tool for high-level synthesis
Authors: Chih-Tung Chen, Kayhan Küçükçakar
Venue: Proceedings of the 10th international symposium on System synthesis (1997)

This paper presents a novel source-level dynamic analysis methodology and tool for High-Level Synthesis (HLS). It not only for the first time enables HLS to offer source-level design debugging on the `synthesized' RTL designs, but also allows the designer to analyze their dynamic characteristics, such as resource utilization, power consumption, etc., at the algorithmic (source) level. This technology has been proven in the industry as the critical element for successfully designing a microcontroller with 300+ instructions with Matisse, an interactive HLS system. Additionally, we demonstrate the use of this technology for architectural power optimization.
Mobile UNITY: reasoning and specification in mobile computing
Authors: Gruia-Catalin Roman, Peter J. McCann, Jerome Y. Plun
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1997)

Mobile computing represents a major point of departure from the traditional distributed-computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns present designers with unprecedented challenges in the areas of modularity and dependability. So far, the literature on mobile computing is dominated by concerns having to de with the development of protocols and services. This article complements this perspective by considering the nature of the underlying formal models that will enable us to specify and reason about such computations. The basic research goal is to characterize fundamental issues facing mobile computing. We want to achieve this in a manner analogous to the way concepts such as shared variables and message passing help us understand distributed computing. The pragmatic objective is to develop techniques that facilitate the verification and design of dependable mobile systems. Toward this goal we employ the methods of UNITY. To focus on what is essential, we center our study on ad hoc networks, whose singular nature is bound to reveal the ultimate impact of movement on the way one computes and communicates in a mobile environment. To understand interactions we start with the UNITY concepts of union and superposition and consider direct generalizations to transient interactions. The motivation behind the transient nature of the interactions comes from the fact that components can communicate with each other only when they are within a a certain range. The notation we employ is a highly modular extension of the UNITY programming notation. Reasoning about mobile computations relies on extensions to the UNITY proof logic.