ppxscal/embedding_network huggingface dataset:
Optimal Parallel Initialization Algorithms for a Class of Priority Queues
Authors: S. Olariu, Z. Wen
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

An adaptive parallel algorithm for inducing a priority queue structure on an n-element array is presented. The algorithm is extended to provide optimal parallel construction algorithms for three other heap-like structures useful in implementing double-ended priority queues, namely min-max heaps, deeps, and min-max-pair heaps. It is shown that an n-element array can be made into a heap, a deap, a min-max heap, or a min-max-pairheap in O(log n+(n/p)) time using no more than n/log n processors, in the exclusive-read-exclusive-write parallel random-access machine model.
Non-conformable subgraphs of non-conformable graphs
Authors: A. J. W. Hilton, H. R. Hind
Venue: Discrete Mathematics (2002)

We show that if G and H are non-conformable graphs, with H being a subgraph of G of the same maximum degree Δ(G), and if Δ(G) ≥ ⌈½|V(G|⌉, then |V(H)| = |V(G)|. We also show that this inequality is best possible, for when Δ(G)= ⌈½|V(G)|⌉ there are examples of graphs G and H with Δ(H)= Δ(G) and |V(H)|≤ |V(G)| which are both non-conformable. We determine all such examples. Interest in this stems from the modified Conformability Conjecture of Chetwynd, Hilton and Hind, which would characterize all graphs G with Δ(G) ≥ ⌈½|V(G)|⌉, for which the total chromatic number χT(G) satisfies χT(G)=Δ(G)+1, in terms of nonconformable subgraphs.
Fuzzy rule-based expert system for short-range seismic prediction
Authors: Christian D. Klose
Venue: Computers Geosciences (2002)

In Switzerland, the 57 km long Gotthard base tunnel is being built as part of the AlpTransit project with a maximum overburden of 2000 m. Because of the difficult geological situation, an exploratory tunnel was set up to explore the Piora-Mulde, a possibly unstable carbonate rock zone in south Central Switzerland. A geophysical forecast system called tunnel seismic prediction has been designed by Amberg Measuring Technique Ltd. to explore the geology during the tunnelling process. But several difficulties occurred in interpretation of the seismic data in terms of geological forecasts. This paper describes a simple approach to geological interpretation of seismic diffraction stack images by using fuzzy logic. A fuzzy rule-based expert system was developed to classify lithologic and tectonic rock units by interpreting those seismic images.
Reliability Models for Fault-Tolerant Private Network Applications
Authors: M. Balakrishnan, A. Reibman
Venue: IEEE Transactions on Computers (1994)

A private or corporate network connects the offices of a single large organization, such as an airline or a bank, using leased private lines. To improve the reliability of network applications, fault-tolerance can be incorporated directly into the private network. In this paper, we use a state-space model to capture the effect of dynamic rerouting and repair and investigate the effect on reliability of different repair-and-rerouting strategies at the application or call level. To reduce the potentially large state space that results, we construct an approximate Markov model with a smaller state space by lumping together similar states. The lumped model includes coverage parameters that can be estimated without considering the original model in its entirety. This allows the state-space model to be solved accurately and efficiently. We compare results of the approximation technique with results obtained by a complete simulation of the original network. We expect similar approximation techniques to be effective on models with large state spaces which obtain processes with many time-scales.
Interactive analysis and visualization of geoscience data with ocean data view
Authors: Reiner Schlitzer
Venue: Computers Geosciences (2002)

Ocean Data View (ODV) is a freeware package for the interactive exploration and graphical display of multi-parameter profile or sequence data. Although originally developed for oceanographic observations only, the underlying concept is more general, and data or model output from other areas of geosciences, like for instance geology, geophysics, geography and atmospheric research can be maintained and explored with ODV as well. The data format of ODV is designed for dense storage and direct data access, and allows the construction of very large datasets, even on affordable and portable hardware. ODV supports display of original data by colored dots or actual data values at the measurement locations. In addition, two fast and reliable variable-resolution gridding algorithms allow color shading and contouring of gridded fields along sections and on general 3D surfaces. A large number of derived quantities can be selected and calculated online. These variables are displayed and analyzed in the same way as the basic variables stored in disk files. ODV runs on PCs under Windows and on UNIX workstations under SUN Solaris. The software and extensive sets of coastline, topography, river-, lake- and border outlines as well as various gazetteers of topographic features are available at no cost over the Internet. In addition, the electronic atlas eWOCE that consists of oceanographic data from the World Ocean Circulation Experiment (WOCE) is also available free of charge over the Internet. A gallery of prepared plots of property distributions along WOCE sections provides a quick overview over hydrographic, nutrient, oxygen and transient tracer fields in the ocean and, apart from the scientific use for oceanographic research, can serve as tutorial material for introductory or advanced courses on oceanography.
Computers and Thought
Authors: Edward A. Feigenbaum, Julian Feldman
Venue:  (1963)

:Computers and Thought showcases the work of the scientists who not only defined the field of Artificial Intelligence, but who are responsible for having developed it into what it is today. Originally published in 1963, this collection includes twenty classic papers by such pioneers as A. M. Turing and Marvin Minsky who were behind the pivotal advances in artificially simulating human thought processes with computers. Among the now hard-to-find articles are reports of computer programs that play chess and checkers, prove theorems in logic and geometry, solve problems in calculus, balance assembly lines, recognize visual temporal patterns, and communicate in natural language. The reports of simulation of cognitive processes include computer models of human behavior in logic problems, deciding on common stock portfolios, and carrying out social interaction. Models of verbal learning behavior, predictive behavior in two-choice experiments, and concept formation are also included. Articles by: Paul Armer. Carol Chomsky. Geoffrey P. E. Clarkson. Edward A. Feigenbaum. Julian Feldman. H. Gelernter. Bert F. Green, Jr. John T. Gullahorn. Jeanne E. Gullahorn. J. R. Hansen. Carl I. Hovland. Earl B. Hunt. Kenneth Laughery. Robert K. Lindsay. D. W. Loveland. Marvin Minsky. Ulric Neisser. Allen Newell. A. L. Samuel. Oliver G. Selfridge. J. C. Shaw. Herbert A. Simon. James R. Slagle. Fred M. Tonge. A. M. Turing. Leonard Uhr. Charles Vossler. Alice K. Wolf.
Flag-Oriented Parallel Associative Architectures and Applications
Authors: Djamshid Tavangarian
Venue: Computer (1994)

Flag transformation, a new design concept for parallel associative memory and processor architectures, maps word-oriented data into flag-oriented data. A flag vector represents each word in a set. The flag position corresponds to the value of the transformed word, and all flags in a vector are processed simultaneously to obtain parallel operations. The results of complex search operations performed by modular, cascadable hardware components are also represented by flags and retransformed into word-oriented data. This transformation method allows parallel processing of associative or content-addressable data in uniprocessor architectures, expedites IC design rule checks, and accelerates complex memory tests. It can also be used to develop associative processor architectures and to emulate very fast, modular, cascadable artificial neural networks.
Image Surface Approximation with Irregular Samples
Authors: C. H. Lee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A method to approximate image surfaces using irregular samples is proposed. Experimental results show that a high compression ratio can be achieved for simple or complicated images. A method accounting for the three-dimensional effects is proposed as a way of selecting the irregular samples from the image. Approximation spline knots are chosen along the contours, and the knot replacement is sensitive to the curvature along contours and the density of contours in the near neighborhood. In general, the proposed method was shown to reduce the reconstruction error both qualitatively and quantitatively, and can be used to model the image surface for the purpose of data compression and representation. This approach retains key features in images and throws away redundant data.
Tight binding molecular dynamics
Authors: S. Goedecker, L. Colombo
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

With a new and intrinsically parallel algorithm for Tight Binding Molecular Dynamics we obtain a performance of 3.4 Gigaflops per million dollar on a cluster of 8 Hewlett Packard workstations in a simulation of 216 Silicon atoms. One time step with this new algorithm takes as much time for the 216 atom system as one time step with a conventional algorithm on a NEC-SX3 supercomputer. In addition, the linear scaling of new algorithm allows us to calculate systems of unprecedented size which are not any more accessible by the combination of standard algorithms and vector supercomputers.
Mining Associations with the Collective Strength Approach
Authors: C. C. Aggarwal, P. S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

The large itemset model has been proposed in the literature for finding associations in a large database of sales transactions. A different method for evaluating and finding itemsets referred to as strongly collective itemsets is proposed. We propose a criterion stressing the importance of the actual correlation of the items with one another rather than their absolute level of presence. Previous techniques for finding correlated itemsets are not necessarily applicable to very large databases. We provide an algorithm which provides very good computational efficiency, while maintaining statistical robustness. The fact that this algorithm relies on relative measures rather than absolute measures such as support also implies that the method can be applied to find association rules in data sets in which items may appear in a sizeable percentage of the transactions (dense data sets), data sets in which the items have varying density, or even negative association rules.
Specifying Concurrent Systems with TSL
Authors: David S. Rosenblum
Venue: IEEE Software (1991)

The Task Sequencing Language (TSL), which lets programmers specify constraints on the behavior of concurrent programs, is described. The constraints, specified by high-level annotations to Ada programs, are monitored at runtime; when a violation is detected, control is returned to the user, along with information about the nature of the violation. It is argued that such a tool is a necessary crutch for human reasoning capabilities when dealing with the complexities of concurrent process interaction. The first large-scale application of TSL, the specification and validation of a distributed tasking supervisor for Ada, is described.
Performance Evaluation of Transaction Processing Coupling Architectures for Handling System Dynamics
Authors: P. S. Yu, A. Dan
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

As the demand for high volume transaction processing grows, coupling multiple computing nodes becomes increasingly attractive. This paper presents a comparison on the resilience of the performance to system dynamics of three architectures for transaction processing. In the shared nothing (SN) architecture, neither disks nor memory is shared. In the shared disk (SD) architecture, all disks are accessible to all nodes while in the shared intermediate memory (SIM) architecture, a shared intermediate level of memory is introduced. A transaction processing system needs to be configured with enough capacity to cope with the dynamic variation of load or with a node failure. Three specific scenarios are considered: 1) a sudden surge in load of one transaction class, 2) varying transaction rates for all transaction classes, and 3) failure of a single processing node. We find that the different architectures require different amounts of capacity to be reserved to cope with these dynamic situations. We further show that the data sharingarchitecture, especially in the case with shared intermediate memory, is more resilient tosystem dynamics and requires far less contingency capacity compared to the SNarchitecture.
The Case for Inductive Programming
Authors: Derek Partridge
Venue: Computer (1997)

The science of creating software is based on deductive methods. But induction, deduction's ignored sibling, could have a profound effect on the future development of computer science theory and practice. Computer scientists and software developers in the late 1960s started a formal science to guide software production. The underlying framework of this science has always been based on deduction (reasoning from the general to the specific) rather than induction (reasoning from the specific to the general). Today inductive programming is found only in "machine learning," a subset of artificial intelligence. Computer scientists may use inductive techniques to explore a philosophy of cognition, develop a theory of adaptive behavior, or find a way around a particularly awkward problem, but they do not use it to create programs. Nearly all basic computing science textbooks fail to include inductive programming. However, inductive reasoning can solve problems outside the realm of machine learning, too. Formal methods to underpin inductive techniques are emerging, but they have yet to be viewed, accepted, and developed as a fundamental alternative to deductive computer science.
High Order Finite Difference Approximations of Electromagnetic Wave Propagation Close to Material Discontinuities
Authors: Jan Nordström, Rikard Gustafsson
Venue: Journal of Scientific Computing (2003)

Electromagnetic wave propagation close to a material discontinuity is simulated by using summation by part operators of second, fourth and sixth order accuracy. The interface conditions at the discontinuity are imposed by the simultaneous approximation term procedure. Stability is shown and the order of accuracy is verified numerically.
CrossCheck: An Innovative Testability Solution
Authors: Susheel Chandra, Kerry Pierce, Gopal Srinath, Hector R. Sucar, Vic Kulkarni
Venue: IEEE Design Test (1993)

CrossCheck, an approach to the application-specific integrated circuit ASIC test problem that is based on embedding test structures into the base array of the ASIC, is discussed. With a specially designed storage element called the cross-controlled latch, CrossCheck combines controllability and observability to produce a highly testable ASIC having minimal area and performance overhead. CrossCheck is a designer-transparent solution that imposes none of the rules and restrictions of other design-for-testability (DFT) methodologies. In CrossCheck, test structures are embedded into the ASIC base, rather than added by the designer to the schematic as with scan or built-in self-test (BIST) methodologies. The built-in observability also offers easier debugging and diagnostics methods to the designer. Experimental results that demonstrate the potential of the CrossCheck method on a broad range of ASIC styles and sizes are presented.
SLDRAM: High-Performance, Open-Standard Memory
Authors: Peter Gillingham, Bill Vogley
Venue: IEEE Micro (1997)

The primary objective of DRAM (Dynamic Random Access Memory) is to offer the largest memory capacity at the lowest possible cost. This is achieved by two means; First, by optimizing the process and the design to minimize die area and second, ensuring that the device can serve high volume markets and can be manufactured in the highest possible volume to achieve the greatest economies of scale. SLDRAM (Synchronous Link DRAM) is a new DRAM interface standard meeting the high data bandwidth requirements of emerging processor architectures. SLDRAM retains the low cost advantages of earlier DRAM interface standards and is therefore destined to become the mainstream commodity memory in the 21st century.
Distributed Load Balancing for Parallel Main Memory Hash Join
Authors: Walid R. Tout, Sakti Pramanik
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Parallel joins have been widely studied during the past decade and a number of efficient algorithms were presented. While it is known that the performance of these algorithms may suffer greatly in the presence of skewed input data, the work on load balancing schemes for parallel join has been limited. The main contribution of this paper is the development and analysis of a new distributed data structure and an effective load balancing scheme for parallel main memory hash join on NUMA architecture. Multiprocessors based on this architecture are scalable in both size of main memory and number of processors, and provide very high memory bandwidth. The load balancing scheme is based on random probing to avoid the hot spot problems caused by probing sequentially. We have modeled this load balancing scheme both analytically and experimentally. The experiments were run on a BBN TC2000 multiprocessor system.
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data
Authors: M. Spasojevic, P. Berman
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

This paper investigates the problem of finding an optimal static pessimistic replica control scheme. It has been widely accepted that coteries (proposed by Garcia-Molina and Barbara) provide the most general framework for such schemes. We demonstrate that voting schemes, a very small subset of static pessimistic schemes, are optimal for fully connected networks with negligible link failure rates, as well as for Ethernet systems. Wealso show that voting is not optimal for somewhat more general systems. We propose amodification of the algorithm of Z. Tong and R.Y. Kain (1988) for computing optimal voting in operation independent case, so that it runs in linear (rather than exponential) time. Finally, we propose the first efficient algorithm for computing the optimal vote assignment and appropriate thresholds for fully connected networks when relative frequencies of read and write operations are known. We also extend this result to Ethernet systems.
Plug-and-Play IDDQ Testing for Test Fixtures
Authors: Keith Baker, Alan Hales
Venue: IEEE Design Test (1995)

IDDQ testing is expected to make an important breakthrough as the mainstream CMOS test technology. However, before this happens it must be feasible to make at least a few hundred IDDQ measurements in the fleeting seconds of an IC's production test. QTAG is an initative to develop IDDQ test instrumentation for present ATE systems to solve this problem.
Random induced graphs
Authors: B. Bollobas, P. Erdos, R. J. Faudree, C. C. Rousseau, R. H. Schelp
Venue: Discrete Mathematics (2002)

Given a monotone graphical property Q, how large should d(n) be to ensure that if (Hn) is any sequence of graphs satisfying |Hn| = n and δ(Hn) ≥ d(n), then almost every induced subgraph of Hn has property Q? We prove essentially best possible results for the following monotone properties: (i) k-connected for fixed k, (ii) Hamiltonian.
View Variation of Point-Set and Line-Segment Features
Authors: J. Brian Burns, R. S. Weiss, E. M. Riseman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The variation, with respect to view, of 2D features defined for projections of 3D point sets and line segments is studied. It is established that general-case view-invariants do not exist for any number of points, given true perspective, weak perspective, or orthographic projection models. Feature variation under the weak perspective approximation is then addressed. Though there are no general-case weak-perspective invariants, there are special-case invariants of practical importance. Those cited in the literature are derived from linear dependence relations and the invariance of this type of relation to linear transformation. The variation with respect to view is studied for an important set of 2D line segment features: the relative orientation, size, and position of one line segment with respect to another. The analysis includes an evaluation criterion for feature utility in terms of view-variation. This relationship is a function of both the feature and the particular configuration of 3D line segments. The use of this information in objection recognition is demonstrated for difficult discrimination tasks.
An efficient backcalculation algorithm of time domain for large-scale pavement structures using Ritz vectors
Authors: Q. X. Dong, Y. Hachiya, O. Takahashi, Y. Tsubokawa, K. Matsui
Venue: Finite Elements in Analysis and Design (2002)

This paper describes a backcalculation algorithm to determine the layer moduli and damping coefficients in the time domain for large-scale pavement structures. Pavement is modeled by three-dimensional finite element (3D FE). The parameter identification procedure makes use of Ritz vectors to reduce the size of matrices involved in the forward dynamic response analysis and the deflection sensitivity analysis. An exact complex mode superposition technique is used to obtain the dynamic response of the reduced equation system in the time domain. This method is more efficient, accurate and stable. The parameter estimates are improved iteratively by means of an algorithm that calls the finite element program of dynamic response analysis as a subroutine combining truncated singular value decomposition (TSVD) method. Simulation of a numerical solution validates the efficiency of the proposed method. Finally, the method is implemented for two experimentally tested sections of semiflexible pavement. All parameters are determined using the surface deflections of pavement experimentally recorded at the sensor locations of falling weight deflectometer (FWD).
A WordNet interface to APL2
Authors: Enrique Alfonseca
Venue: Proceedings of the 2002 conference on APL: array processing languages: lore, problems, and applications (2002)

Lexical ontologies have proven a very useful tool for natural language processing, specially where some semantic analysis is necessary. One of the most widely used is WordNet [Miller, 1995]. In this work, we describe an implementation of WordNet that extends its initial functionalities, and which is directly accessible from APL2. The interface is very simple, as only a few functions and one operator are sufficient to use all the capabilities of WordNet.