ppxscal/embedding_network huggingface dataset:
Incremental Computation of Time-Varying Query Expressions
Authors: Lars Bækgaard, Leo Mark
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

We present and analyze algorithms for the incremental computation of time-varying queries in which selection predicates refer to the state of a clock. Such queries occur naturally in many situations where temporal data are processed. Incremental techniques for query computation have proven to be more efficient than other techniques in many situations. However, all existing incremental techniques for query computation assume that old query results remain valid if no intermediate changes are made to the underlying database. Unfortunately, this assumption does not hold for time-varying queries whose results may change just because time passes. In order to solve this problem, we introduce the notion of a superview which contains all current tuples that will eventually satisfy the selection predicate of a time-varying selection. Based on the notion of superview, we develop efficient algorithms for the incremental computation of time-varying selections. Our algorithms, combined with existing incremental algorithms, allow complex time-varying queries to benefit from the proven efficiency of incremental techniques. It is important to notice that without our algorithms, the existing algorithms for incremental computation would be useless for any time-varying query expression.
Packet Synchronization for Synchronous Optical Deflection-Routed Interconnection Networks
Authors: John R. Feehrer, Lars H. Ramfelt
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

Deflection routing resolves output port contention in packet-switched multiprocessor interconnection networks by granting the preferred port to the highest priority packet and directing contending packets out other ports. When combined with optical links and switches, deflection routing yields simple bufferless nodes, high-bit rates, scalable throughput, and low latency. We discuss the problem of packet synchronization in synchronous optical deflection networks with nodes distributed across boards, racks, and cabinets. Synchronous operation is feasible due to very predictable optical propagation delays. A routing control processor at each node examines arriving packets and assigns them to output ports. Packets arriving on different input ports must be bit-wise aligned; there are no elastic buffers to correct for mismatched arrivals. "Time-of-flight" packet synchronization is done by balancing link delays during network design. Using a directed graph network model, we formulate a constrained minimization problem for minimizing link delays subject to synchronization and packaging constraints. We demonstrate our method on a ShuffleNet graph, and show modifications to handle multiple packet sizes and latency-critical paths.
Simulation toolbox for 3D-FISH Spot-counting algorithms
Authors: A. M. Grigoryan, G. Hostetter, O. Kallioniemi, E. R. Dougherty
Venue: Real-Time Imaging (2002)

Fluorescent in situ hybridization (FISH) is a molecular diagnostic technique in which a fluorescent labeled probe hybridizes to a target nucleotide sequence of DNA. Upon excitation, each chromosome containing the target sequence produces a fluorescent signal (spot). New technology provides a stack of images on multiple focal planes throughout a tissue sample. Multiple-focal-plane imaging helps to overcome the biases and imprecision inherent in single-focal-plane methods. New algorithms are being proposed to take advantage of the multiple focal planes. This paper presents a simulation toolbox that generates synthetic spots, both signal and noise, with which to evaluate algorithm performance. By using the toolbox, preset algorithm parameters can be tuned or optimized. Two critical issues for any algorithm are the sampling rate, which is the number of focal planes used, and the parameters for the filter that determines which detected spots are signal and which are noise. One would like to use a minimal number of focal planes for reasons of both time and cost, and one would like to have a noise filter that optimally balances the passing and non-passing of signal and noise spots. As demonstrated, it is possible to go further and calibrate the noise filter so that the expected number of counted spots, both signal and noise, is approximately equal to the actual number of signal spots.
CL: A Flexible and Efficient Tool for Constructing Knowledge-Based Expert Systems
Authors: Masonobu Watanabe, Toru Yamanouchi, Masahiko Iwamoto, Yuriko Ushioda
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

A description is given of CL, the conceptual network-based language, which is a Lisp-based tool kit to assist knowledge engineers in customizing a general framework into an optimal one for a specific domain and achieving high runtime performance with user-defined control strategies. The design objectives embodied in CL are discussed, and its extensibility and domain language primitives are examined. It is shown how the use of CL can improve runtime performance. Experience with CL and its current status are described.
A Derivative-Free Algorithm for Bound Constrained Optimization
Authors: Stefano Lucidi, Marco Sciandrone
Venue: Computational Optimization and Applications (2002)

In this work, we propose a new globally convergent derivative-free algorithm for the minimization of a continuously differentiable function in the case that some of (or all) the variables are bounded. This algorithm investigates the local behaviour of the objective function on the feasible set by sampling it along the coordinate directions. Whenever a &ldquo;suitable&rdquo; descent feasible coordinate direction is detected a new point is produced by performing a linesearch along this direction. The information progressively obtained during the iterates of the algorithm can be used to build an approximation model of the objective function. The minimum of such a model is accepted if it produces an improvement of the objective function value. We also derive a bound for the limit accuracy of the algorithm in the minimization of noisy functions. Finally, we report the results of a preliminary numerical experience.
A Pipeline Design of a Fast Prime Factor DFT on a Finite Field
Authors: T. K. Truong, I. S. Reed, I. -S. Hsu, H. -C. Shyu, H. M. Shao
Venue: IEEE Transactions on Computers (1988)

A conventional prime factor discrete Fourier transform (DFT) algorithm of the Winograd type is used to realize a discrete Fourier-like transform on the finite field GF(q/sup /n). A pipeline structure is used to implement this prime-factor DFT over GF(q/sup /n). This algorithm is developed to compute cyclic convolutions of complex numbers and to aid in decoding the Reed-Solomon codes. Such a pipeline fast prime-factor DFT algorithm over GF(q/sup /n) is regular, simple, expandable, and naturally suitable for most implementation technologies. An example illustrating the pipeline aspect of a 30-point transform over GF(q/sup /n) is presented.
Vector Unit Architecture for Emotion Synthesis
Authors: Atsushi Kunimatsu, Nobuhiro Ide, Toshinori Sato, Yukio Endo, Hiroaki Murakami, Takayuki Kamei, Masashi Hirano, Fujio Ishihara, Haruyuki Tago, Masaaki Oka, Akio Ohba, Teiji Yutaka, Toyoshi Okada, Masakazu Suzuoki
Venue: IEEE Micro (2000)

Two vector units embedded in the Emotion Engine chip support high-quality 3D graphics, emotion synthesis, and 300-MHz, 5.5-Gflops operation for the recently introduced PlayStation2 game entertainment system.
Designing Maintainable, Reusable Interfaces
Authors: Raimund K. Ege, Christian Stary
Venue: IEEE Software (1992)

A conceptual framework, the Interaction Management Network (IMN), that captures the essential structure of any interface from task-oriented specification to object-oriented implementation is presented. IMN is essentially a task-oriented specification scheme based on a semantic network. For each element, as well as for the complete network, there is a direct representation suitable for object-oriented implementation. By capturing task relationships in the interface specification and explicitly representing constraints, designers can create interfaces that meet the often elusive user requirements. The application of IMN to creating an interface system for laying out floors is described.
CASM: A VLSI Chip for Approximate String Matching
Authors: Raghu Sastry, N. Ranganathan, Klinton Remedios
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

The edit distance between two strings a1, ¿, am and b1, ¿, bn is the minimum cost s of a sequence of editing operations (insertions, deletions and substitutions) that convert one string into the other. This paper describes the design and implementation of a linear systolic array chip for computing the edit distance between two strings over a given alphabet. An encoding scheme is proposed which reduces the number of bits required to represent a state in the computation. The architecture is a parallel realization of the standard dynamic programming algorithm proposed by Wagner and Fischer, and can perform approximate string matching for variable edit costs. More importantly, the architecture does not place any constraint on the lengths of the strings that can be compared. It makes use of simple basic cells and requires regular nearest-neighbor communication, which makes it suitable for VLSI implementation. A prototype of this array has been built at the University of South Florida.
Implementation Studies for a VLSI Prolog Coprocessor
Authors: Pierluigi Civera, Gianluca Piccinini, Maurizio Zamboni
Venue: IEEE Micro (1989)

A 32-bit coprocessor designed as one VLSI (very large-scale integrated) circuit that is based on microprogrammed architecture is described. The most innovative aspect of this project is the fully dedicated microarchitecture of the execution unit. A detailed analysis was carried out by considering two execution techniques, 'interpreted' and 'compiled', and the computational model and its implementation were simulated to support the final design decisions. A description is given of compiled execution, which was selected for the final design. The simulations trace the actual behavior of the execution model and point out the performance that can be obtained using different architectural solutions. The results permit the selection of an optimal architecture within the technological constraints of VLSI implementations.
Computer simulation of contaminated soil bioremediation
Authors: S. Yaghmaei, M. Vossoughi, I. Alemzadeh, A. A. Safekordi
Venue: Iranian Journal of Science and Technology (2002)

A mathematical model has been developed and simulated to describe contaminated soil bioremediation. The model equations consist of a system of three non-linear partial differential equations. Dimensional analysis of the model equations has been performed, and solution of these equations has been conducted by an implicit finite difference method. A computer program is runed for solving the model equations and by using this program, the influence of the principal parameters (porosity, soil aggregate radius, and partition coefficient of the substrate) on the fate of chemicals has been studied. The rates of substrate, oxygen diffusion and biodegradation rate have been found to be the controlling mechanisms for remediation in the aggregates.
Product Schema Integration for Electronic Commerce-A Synonym Comparison Approach
Authors: G. Yan, W. K. Ng, E.-P. Lim
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In any electronic commerce system, the heterogeneity of product descriptions is a critical impediment to efficient business information exchange. In the ABECOS electronic commerce system, buyer agents, seller agents, and directory agents liaise with one another in e-commerce activities. Only when agents have a common ontology of product descriptions (also called product schemas) are they able to interact seamlessly in e-commerce activities. This gives rise to the Product Schema Integration problem (PSI); the problem of integrating heterogeneous schemas of a certain product into one globally compatible schema. In this paper, we adopt an integration approach based on product attribute synonyms. We give a formal definition of the problem and show that it is NP-complete. We contrast our approach of study to conventional schema integration in federated databases. We also propose a set of approximate algorithms for PSI and evaluate their performance.
Cash Cow in the Tar Pit: Reengineering a Legacy System
Authors: W. Stephen Adolph
Venue: IEEE Software (1996)

The enemy of all projects is risk: the probability of project failure. Identifying and managing risks is part of the software project-planning process. However, when replacing a legacy system, software professionals often underestimate risk because they assume the legacy system is one of the organization's core competencies and that it represents a set of stable requirements. This perception is true only if the replacement-project development team understands the legacy system and uses it to reduce the risk associated with uncertain requirements. Otherwise, schedules developed under this assumption of design reuse are erroneous. Even if the legacy system's design is reused, it is unlikely that the original methodology and tools will also be reused.In 1989, when I worked at Alcatel-SEL, one of our largest clients came to us with a problem: They were planning a major extension of their transit railway, which was already taxing the limits of their legacy system's host computer. Our initial estimates predicted that the cost of adapting the legacy system to satisfy the client's new requirements was comparable to the cost of replacing the system. We were highly motivated to push for a replacement for other reasons as well: It was becoming very difficult to hire people who were interested in maintaining a 20-year-old assembly-based system, and we had a pent-up dislike of the tedious work the legacy system required. In 1990 the decision was made to replace the legacy system. This article imparts our lessons learned.
Hamiltonian iterated line graphs
Authors: Liming Xiong, Zhanhong Liu
Venue: Discrete Mathematics (2002)

The n-iterated line graph of a graph G is Ln(G) = L(Ln-1(G)), where L1(G) denotes the line graph L(G) of G, and Ln-1(G) is assumed to be nonempty. Harary and Nash-Williams characterized those graphs G for which L(G) is hamiltonian. In this paper, we will give a characterization of those graphs G for which Ln(G) is hamiltonian, for each n ≥ 2. This is not a simple consequence of Harary and Nash-Williams' result. As an application, we show two methods for determining the hamiltonian index of a graph and enhance various results on the hamiltonian index known earlier.
A Transparent Schema-Evolution System Based on Object-Oriented View Technology
Authors: Young-Gook Ra, Elke A. Rundensteiner
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

When a database is shared by many users, updates to the database schema are almost always prohibited because there is a risk of making existing application programs obsolete when they run against the modified schema. This paper addresses the problem by integrating schema evolution with view facilities. When new requirements necessitate schema updates for a particular user, then the user specifies schema changes to his personal view, rather than to the shared-base schema. Our view schema-evolution approach then computes a new view schema that reflects the semantics of the desired schema change, and replaces the old view with the new one. We show that our system provides the means for schema change without affecting other views (and thus without affecting existing application programs). The persistent data is shared by different views of the schema, i.e., both old as well as newly developed applications can continue to interoperate. This paper describes a solution approach of realizing the evolution mechanism as a working system, which as its key feature requires the underlying object-oriented view system to support capacity-augmenting views. In this paper, we present algorithms that implement the complete set of typical schema-evolution operations as view definitions. Lastly, we describe the transparent schema-evolution system (TSE) that we have built on top of GemStone, including our solution for supporting capacity-augmenting view mechanisms.
A Qualitative Discriminant Approach for Generating Quantitative Belief Functions
Authors: Noel (Kweku-Muata) Bryson, Ayodele Mobolurin
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

We present an approach that will be useful in knowledge acquisition from experts on the degree of belief in, or the probability of, the truthfulness of various propositions. Its advantages include exploring the given problem situation using linguistic quantifiers; avoiding the premature use of numeric measures; and identifying input data that is inconsistent with the theory of belief functions.
Utilizing Page-Level Join Index for Optimization in Parallel Join Execution
Authors: Chiang Lee, Zue-An Chang
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

This paper presents a methodology to the optimization in parallel join execution. The past researches on parallel join methods mostly focused on the design of algorithms for partitioning (e.g., hash) relations and distributing data buckets as evenly as possible to the processors. Once data are distributed to the processors, they assume that all processors will complete their tasks at about the same time. We stress that this is true if no further information such as page-level join index (to be discussed later) is available. Otherwise, the join execution can be further optimized and the workload in the processors may still be unbalanced. We study such problems that may incur in a shared-nothing architecture environment and propose algorithms to the problems in the paper. Also, a simulation study is performed to understand the characteristics of the proposed method.
Constrained-Latency Storage Access
Authors: Richard Staehli, Jonathan Walpole
Venue: Computer (1993)

A class of constrained-latency storage access (CLSA) applications that require both large amounts of storage and guarantees for short latencies are presented. A range of existing approaches to meeting the requirements of CLSA applications is surveyed. Their limitations indicate that the technology does not yet exist to support complex CLSA applications on general-purpose storage architectures. A variety of good solutions exists for meeting throughput and latency requirements for continuous media data, including dedication of resources, presequencing, and greedy prefetching. However, none of the current approaches supports the automatic anticipation of scripted data access as required for interactive editing and playback of video segments.
A Regularized Contrast Statistic for Object Boundary Estimation-Implementation and Statistical Evaluation
Authors: F. O'Sullivan, M. Qian
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

We propose an optimization approach to the estimation of a simple closed curve describing the boundary of an object represented in an image. The problem arises in a variety of applications, such as template matching schemes for medical image registration. A regularized optimization formulation with an objective function that measures the normalized image contrast between the inside and outside of a boundary is proposed. Numerical methods are developed to implement the approach, and a set of simulation studies are carried out to quantify statistical performance characteristics. One set of simulations models emission computed tomography (ECT) images; a second set considers images with a locally coherent noise pattern. In both cases, the error characteristics are found to be quite encouraging. The approach is highly automated, which offers some practical advantages over currently used technologies in the medical imaging field.
An Angle Recording Method for CORDIC Algorithm Implementation
Authors: Y. H. Hu, S. Naganathan
Venue: IEEE Transactions on Computers (1993)

The coordinate rotation digital computer (CORDIC), an iterative arithmetic algorithm for computing generalized vector rotations without performing multiplications, is discussed. For applications where the angle of rotation is known in advance, a method to speed up the execution of the CORDIC algorithm by reducing the total number of iterations is presented. This is accomplished by using a technique called angle recoding, which encodes the desired rotation angle as a linear combination of very few elementary rotation angles. Each of these elementary rotation angles takes one CORDIC iteration to compute. The fewer the number of elementary rotation angles, the fewer the number of iterations are required. A greedy algorithm which takes only O(n/sup 2/) operations is developed to perform CORDIC angle recoding. It is proven that this algorithm is able to reduce the total number of required elementary rotation angles by at least 50% without affecting the computational accuracy.
A Clustered Failure Model for the Memory Array Reconfiguration Problem
Authors: D. M. Blough, A. Pelc
Venue: IEEE Transactions on Computers (1993)

Reconfiguration of memory array using spare rows and spare columns, which has been shown to be a useful technique for yield enhancement of memories, is considered. A clustered failure model that adopts the center-satellite approach of F.J. Meyer and D.K. Pradhan (1989) is proposed and utilized to show that the total number of faulty cells that can be tolerated when clustering occurs is larger than when faults are independent. It is also shown that an optimal solution to the reconfiguration problem can be found in polynomial time for a special case of the clustering model. An efficient approximation algorithm is given for the general case of the probabilistic model assumed. It is shown, through simulation, that the computation time required by this algorithm to repair large arrays containing a significant number of clustered faults is small.
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
Authors: Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Sivakumar Ravada
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for data sets which are updated infrequently. The I/O cost of join computation using a join-index with limited buffer space depends primarily on the page-access sequence used to fetch the pages of the base relations. Given a join-index, we introduce a suite of methods based on clustering to compute the joins. We derive upper bounds on the length of the page-access sequences. Experimental results with Sequoia 2000 data sets show that the clustering method outperforms existing methods based on sorting and online-clustering heuristics.