ppxscal/embedding_network huggingface dataset:
The German National Bibliography 1601&ndash;1700: digital images in a cooperative cataloging project
Authors: M. Dörr, H. Haddouti, S. Wiesener
Venue: Proceedings of the IEEE international forum on Research and technology advances in digital libraries (1997)

This article describes the concept and realization of the German National Bibliography 1601-1700. The GNB is an extensive cataloging project funded by the Deutsche Forschungsgemeinschaft (German Research Foundation). At present, six libraries with important holdings covering this period take part in the project. The technical prerequisites have been developed by the Bavarian Research Center For Knowledge-Based Systems (FORWISS), which over the last few years has gained competence in digital library systems. The GNB is conceived as a database for shared cataloging. It is a large- scale bibliographic project with digitized images of key pages forming an integral part of the bibliographic description.
Transactional client-server cache consistency: alternatives and performance
Authors: Michael J. Franklin, Michael J. Carey, Miron Livny
Venue: ACM Transactions on Database Systems (TODS) (1997)

Client-server database systems based on a data shipping model can exploit client memory resources by caching copies of data items across transaction boundaries. Caching reduces the need to obtain data from servers or other sites on the network. In order to ensure that such caching does not result in the violation of transaction semantics, a transactional cache consistency maintenance algorithm is required. Many such algorithms have been proposed in the literature and, as all provide the same functionality, performance is a primary concern in choosing among them. In this article we present a taxonomy that describes the design space for transactional cache consistency maintenance algorithms and show how proposed algorithms relate to one another. We then investigate the performance of six of these algorithms, and use these results to examine the tradeoffs inherent in the design choices identified in the taxonomy. The results show that the interactions among dimensions of the design space impact performance in many ways, and that classifications of algorithms as simply &ldquo;pessimistic&rdquo; or &ldquo;optimistic&rdquo; do not accurately characterize the similarities and differences among the many possible cache consistency algorithms.
Matrix Decomposition on the Star Graph
Authors: Abdel-Elah Al-Ayyoub, Khaled Day
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

We present and evaluate, for the first time, a parallel algorithm for solving the LU decomposition problem on the star graph. The proposed parallel algorithm is of O(N3/n!) computation complexity and uses O(Nn) communication time to decompose a matrix of order N on a star graph of dimension n, where N¿ (n¿ 1)!. The incurred communication time is better than the best known results for the hypercube, O(N log n!), and the mesh, $O(N\sqrt {n!}),$ each with approximately n! nodes. The proposed parallel algorithm takes advantage of the attractive topological qualities of the star graph in order to reduce the communication time involved in tasks such as pivoting, row/column interchanges, and pivot row and multipliers column broadcasts.
An investigation of power delay trade-offs on PowerPC circuits
Authors: Qi Wang, Sarma B. K. Vrudhula, Shantanu Ganguly
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Logic and structural transformations to reduce power havebeen considered by a number of authors.However,all the results presented so far have been based on modelsof power and estimation methods that may not be a accuratereflection of 'real world' constraitns.The performancerequirements of industrial designs often significantly restrictthe applicability of the power reducing transformations.Inthis paper we present the results of investigations on the efficacyof a recently reported logic level power optimizing algorithmon some commercial circuits, using customer suppliedinput waveforms.Based on a accurate delay model,the power consumption of the circuits is estimated using thecommercial package called 'PowerMill".The experimental resultsshow that a maximum 21% average power and 27.7%peak power power reduction can be obtained with only 3% delayincrease.Based on the experiments, we propose a generalmethodology for the practical application of the transformationsfor power optimization of CMOS logic circuits.Finally,a comparison between the experiments using randominput waveforms and customer provided input waveforms ispresented.
Implementing the batch means method in simulation experiments
Authors: Christos Alexopoulos, Andrew F. Seila
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper reviews and evaluates strategies for implementing the batch means method for estimating the mean of a stationary simulation output process.
Dynamic feedback: an effective technique for adaptive computing
Authors: Pedro C. Diniz, Martin C. Rinard
Venue: ACM SIGPLAN Notices (1997)

This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produces several different versions of the same source code; each version uses a different optimization policy. The generated code alternately performs sampling phases and production phases. Each sampling phase measures the overhead of each version in the current environment. Each production phase uses the version with the least overhead in the previous sampling phase. The computation periodically resamples to adjust dynamically to changes in the environment.We have implemented dynamic feedback in the context of a parallelizing compiler for object-based programs. The generated code uses dynamic feedback to automatically choose the best synchronization optimization policy. Our experimental results show that the synchronization optimization policy has a significant impact on the overall performance of the computation, that the best policy varies from program to program, that the compiler is unable to statically choose the best policy, and that dynamic feedback enables the generated code to exhibit performance that is comparable to that of code that has been manually tuned to use the best policy. We have also performed a theoretical analysis which provides, under certain assumptions, a guaranteed optimality bound for dynamic feedback relative to a hypothetical (and unrealizable) optimal algorithm that uses the best policy at every point during the execution.
Computing Optimal Attribute Weight Settings for Nearest NeighborAlgorithms
Authors: Charles X. Ling, Hangdong Wang
Venue: Artificial Intelligence Review (1997)

Nearest neighbor (NN) learning algorithms, examples of the lazy learning paradigm, rely on a distance function to measure the similarity of testing examples with the stored training examples. Since certain attributes are more discriminative, while others can be less or totally irrelevant, attributes should be weighed differently in the distance function. Most previous studies on weight setting for NN learning algorithms are empirical. In this paper we describe our attempt on deciding theoretically optimal weights that minimize the predictive error for NN algorithms. Assuming a uniform distribution of examples in a 2-d continuous space, we first derive the average predictive error introduced by a linear classification boundary, and then determine the optimal weight setting for any polygonal classification region. Our theoretical results of optimal attribute weights can serve as a baseline or lower bound for comparing other empirical weight setting methods.
Making the future safe for the past: adding genericity to the Java programming language
Authors: Gilad Bracha, Martin Odersky, David Stoutamire, Philip Wadler
Venue: ACM SIGPLAN Notices (1998)

We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps type variables to their bounds, and inserts casts where needed. Some subtleties of the translation are caused by the handling of overriding.GJ increases expressiveness and safety: code utilizing generic libraries is no longer buried under a plethora of casts, and the corresponding casts inserted by the translation are guaranteed to not fail.GJ is designed to be fully backwards compatible with the current Java language, which simplifies the transition from non-generic to generic programming. In particular, one can retrofit existing library classes with generic interfaces without changing their code.An implementation of GJ has been written in GJ, and is freely available on the web.
A circuit comparison system with rule-based functional isomorphism checking
Authors: Makoto Takashima, Atsuhiko Ikeuchi, Shoichi Kojima, Toshikazu Tanaka, Tamaki Saitou, Jun-ichi Sakata
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper describes a circuit comparison system which compares two networks and points out inconsistencies. A new approach is used to handle functionally isomorphic circuits which most conventional programs can not handle. Three techniques are included: network reduction, graph isomorphism-based comparison and rule-based functional isomorphism checking for inconsistencies. This system is efficient even for large networks and can eliminate false errors in a flexible manner.
Parallel automated wire-routing with a number of competing processors
Authors: Yoshizo Takahashi, Shigetaka Sasaki
Venue: ACM SIGARCH Computer Architecture News (1990)

The purpose of the automated wire routing for VLSI and printed circuit board design is to connect a number of terminal pairs distributed throughout wiring plane with net paths which do not intersect each other. Although maze running and line search are well known algorithms used for this purpose, they need a considerable computing time. To reduce it we have developed a new parallel routing algorithm in which a number of processors compete in wiring different nets independent of each other, and one master processor verifies their results and judges. The master processor also delivers an assignment message to the processors. The efficiency of this algorithm was evaluated on a binary-tree multicomputer and more than 50 times of speedup was obtained when 3000 random nets were routed by using 63 processing elements.
Simulation methods for RF integrated circuits
Authors: Ken Kundert
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

The principles employed in the development of modern RF simulators are introduced and the various techniques currently in use, or expected to be in use in the next few years, are surveyed. Frequency and time domain techniques are presented and contrasted, as are steady state and envelope techniques and large and small signal techniques.
A new approach to prototyping Ada-based hardware/software systems
Authors: Frank C. Belz, David C. Luckham
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Prototyping is not a single technique, but rather a collection of widely diverse activities, with highly fragmented support technology. TRW and Stanford have recently collaborated to develop an approach for reducing this fragmentation in the future. This approach is particularly supportive of the development of large distributed systems in Ada. It is based upon the design of a prototyping language and system which we are tentatively calling Reality. The Reality language is a departure from &ldquo;normal&rdquo; programming languages, but bears similarities in form and concepts to standard languages Ada and VHDL. In fact, it can be viewed as both an executable design language for distributed Ada systems and a Module Interconnection Language for pre-existing Ada components. The Reality language and system are being designed to support multiple prototyping strategies including (i) evolutionary development based on successive refinements of abstract models, (ii) bottom-up approaches based on using, for example, preexisting Ada components in prototypes of full Ada systems, and (iii) various hybrid approaches.
Efficiency in the APL environment&mdash;a full arsenal for attacking CPU hogs
Authors: Clark Wiedmann
Venue: ACM SIGAPL APL Quote Quad (1985)

This paper is about the quest for efficiency when using APL. We now have many tools for improving the efficiency of APL applications. These tools include (1) compiled APL, (2) other languages in the APL environment, (3) functions written in assembler language, (4) libraries of efficient building blocks, and (5) using inherently better algorithms. These tools can be applied with varying degrees of effort. With this full arsenal at our disposal, we can achieve any desired efficiency while retaining most of the advantages of the APL environment for developing software.
Homotopy Method for the Large, Sparse, Real Nonsymmetric Eigenvalue Problem
Authors: S. H. Lui, H. B. Keller, T. W. C. Kwok
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

A homotopy method to compute the eigenpairs, i.e., the eigenvectors and eigenvalues, of a given real matrix $A_1$ is presented. From the eigenpairs of some real matrix $A_0$, the eigenpairs of $$A(t) \equiv (1-t) A_0 + t A_1 $$ are followed at successive "times" from $t=0$ to $t=1$ using continuation. At $t=1$, the eigenpairs of the desired matrix $A_1$ are found. The following phenomena are present when following the eigenpairs of a general nonsymmetric matrix: bifurcation, ill conditioning due to nonorthogonal eigenvectors, jumping of eigenpaths. These can present considerable computational difficulties. Since each eigenpair can be followed independently, this algorithm is ideal for concurrent computers. The homotopy method has the potential to compete with other algorithms for computing a few eigenvalues of large, sparse matrices. It may be a useful tool for determining the stability of a solution of a PDE. Some numerical results will be presented.
Comments on "Geodesic Saliency of Watershed Contours and Hierarchical Segmentation"
Authors: Cédric Lemaréchal, Roger Fjørtoft, Philippe Marthon, Eliane Cubero-Castan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

In a recent paper on morphological image segmentation [1], Najman and Schmitt introduce the powerful concept of edge dynamics. In this communication, we show that the method that they propose to compute the edge dynamics gives erroneous results for certain spatial configurations, and we propose a new algorithm which always yields correct edge dynamics.
Advanced tutorial&mdash;simulation-based scheduling and control
Authors: Jeffrey S. Smith, Brett A. Peters, James Curry, Glenn R. Drake, Cynthia LaJimodiere
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper presents a simulation control system developed by the Texas A&M Computer Aided Manufacturing Laboratory (TAMCAM). This control system is a research tool that TAMCAM uses to explore the advantages and disadvantages of on-line simulation for process control. The simulation control system is developed directly from information about the shop floor stored in a relational database. Processing times and fallout rates are also estimated directly from external data sources. The system is implemented in Arena, Microsoft Access, and Microsoft Visual C++. The advanced tutorial will demonstrate the software tools described in this paper.
Stability and Chaos in Input Pricing for a Service Facility with Adaptive Customer Response to Congestion
Authors: Christopher M. Rump, Shaler Stidham,  Jr.
Venue: Management Science (1998)

We consider the stability of the equilibrium arrival rate and equilibrium admission price at a service facility, using a generalization of an input-pricing model introduced by Dewan and Mendelson and further examined by Stidham. At the equilibrium, the marginal value of service equals the admission price, that is, the sum of the admission fee and the expected delay cost. Stability means (roughly) that the system returns to the equilibrium after a perturbation, assuming the customers base their join/balk decisions on previous prices. We extend the discrete-time, dynamic-system pricing model of Stidham to allow adaptive expectations in which customers predict the future price based on a convex combination of the current price and the previous prediction. We show that this can lead to chaotic behavior when the equilibrium is unstable. That is, the price and arrival rate can follow aperiodic orbits, which appear to be completely random. Our results suggest an alternative explanation for observed variations in the mean arrival rate to a queueing system, which are often modeled by means of a random exogenous (e.g., Markovian) environment process.
Optimal Binary Morphological Bandpass Filters Induced byGranulometric Spectral Representation
Authors: Edward R. Dougherty
Venue: Journal of Mathematical Imaging and Vision (1997)

Euclidean granulometries are used to decompose a binary image into a disjoint union based on interaction between image shape and the structuring elements generating the granulometry. Each subset of the resulting granulometric spectral bands composing the union defines a filter by passing precisely the bands in the subset. Given an observed image and an ideal image to be estimated, an optimal filter must minimize the expected symmetric-difference error between the ideal image and filtered observed image. For the signal-union-noise model, and for both discrete and Euclidean images, given a granulometry, a procedure is developed for finding a filter that optimally passes bands of the observed noisy image. The key is characterization of an optimal filter in the Euclidean case. Optimization is achieved by decomposing the mean functions of the signal and noise size distributions into singular and differentiable parts, deriving an error representation based on the decomposition, and describing optimality in terms of generalized derivatives for the singular parts and ordinary derivatives for the differentiable parts. Owing to the way in which spectral bands are optimally passed, there are strong analogies with the Wiener filter.
Attractors and Inertial Manifolds for Finite-Difference Approximations of the Complex Ginzburg--Landau Equation
Authors: Gabriel James Lord
Venue: SIAM Journal on Numerical Analysis (1997)

A semidiscrete spatial finite-difference approximation and two fully discrete finite-difference approximations to the complex Ginzburg--Landau equation are considered in this paper. The existence of an inertial manifold is proved inside a discrete H1 absorbing ball for the semi-discrete approximation by showing that certain spectral properties hold for the linear operator and certain Lipschitz properties hold for the nonlinear term. Convergence of the true and discrete inertial manifolds is then shown by considering the contraction mappings used to construct the inertial manifolds. A fully implicit scheme is shown to form a continuous semigroup in a discrete L2-space and absorbing balls of radii independent of the spatial and temporal mesh sizes in discrete L2- and H1-spaces are constructed; existence of a global attractor follows. Furthermore, the existence of an inertial manifold is proved by showing that certain spectral and Lipschitz properties hold. For a semi-implicit scheme existence of absorbing balls in the discrete space L2 of radii independent of the spatial and temporal mesh is proved; existence of a global attractor follows.
Architectural exploration using Verilog-based power estimation: a case study of the IDCT
Authors: Thucydides Xanthopoulos, Yoshifumi Yaoi, Anantha Chandrakasan
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

We describe an architectural design space exploration methodologythat minimizes the energy dissipation of digital circuits.The centerpiece of our methodology is a Verilog-based power estimationtool, Pythia, that blends the accuracy of low-level circuitsimulators such as powermill with the speed of high level powerestimators geared to design exploration. Pythia takes into accountvoltage-dependent capacitive nonlinearities and supports runtimeadaptation of supply voltage. It employs a hybrid modelingaproach in which low-level simulation of logic gates and flip-flopscan be combined with high level macromodels for memory structureswhere the energy per access is not as sensitive to input datastatistics. The speed and accuracy of Pythia has enabled a detailedcase study of two different approaches for the computation of theInverse Discrete Cosine Transform, an integral component of theMPEG video coding algorithm. One approach uses conventionalmethods and the other exploits signal statistics to dynamically minimizethe average number of operations required and the operatingsupply voltage.
Constraint propagation in an object-oriented IC design environment
Authors: Tai A. Ly, Emil F. Girczyc
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper describes a framework of constraint propagation that supports the least-commitment strategy of design. This is implemented in an object-oriented IC design environment. The resulting system incrementally propagates design characteristics whenever they become available, and checks for design specification violations. By managing the interaction among bottom-up characteristics and top-down specifications, constraint propagation can be a powerful aid in IC design.
An Optimal Multiplication Algorithm on Reconfigurable Mesh
Authors: Ju-wook Jang, Heonchul Park, Viktor K. Prasanna
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

An O(1) time algorithm to multiply two N-bit binary numbers using an N×N bit-model of reconfigurable mesh is shown. It uses optimal mesh size and it improves previously known results for multiplication on the reconfigurable mesh. The result is obtained by using novel techniques for data representation and data movement and using multidimensional Rader Transform. The algorithm is extended to result in AT2 optimality over $1\le T\le \sqrt N$ in a variant of the bit-model of VLSI.
Library information access client
Authors: J. Ray Scott
Venue: Conference companion on Human factors in computing systems (1994)

We present an approach to control information flow in object-oriented systems. The decision of whether an informatin flow is permitted or denied depends on both the authorizations specified on the objects and the process by which information is obtained and transmitted. Depending on the specific computations, a process accessing sensitive information could still be allowed to release information to users who are not allowed to directly acces it. Exceptions to the permissions and restrictions stated by the authorizations are specified by means of exceptions associated with methods. Two kinds of exceptions are considered: invoke exceptions, applicable during a method executin, and reply exceptins, applicable to the infomation returned by a method. Information flowing form one object into another or returned to the user is subject to the different exceptions specified for the methods enforcing the transmission. We formally characterized information transmission and flow in a transaction and define the conditins for safe information flow. We define security specifications and characterize safe information flows. We propose an approach to control unsafe flows and present an algorithm to enforce it. We also illustrate an efficient implementation of our controls and present some experimental results evaluating its performance.