ppxscal/embedding_network huggingface dataset:
SLIDE: Subspace-Based Line Detection
Authors: H. K. Aghajan, T. Kailath
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

An analogy is made between each straight line in an image and a planar propagating wavefront impinging on an array of sensors so as to obtain a mathematical model exploited in recent high resolution methods for direction-of-arrival estimation in sensor array processing. The new so-called SLIDE (subspace-based line detection) algorithm then exploits the spatial coherence between the contributions of each line in different rows of the image to enhance and distinguish a signal subspace that is defined by the desired line parameters. SLIDE yields closed-form and high resolution estimates for line parameters, and its computational complexity and storage requirements are far less than those of the standard method of the Hough transform. If unknown a priori, the number of lines is also estimated in the proposed technique. The signal representation employed in this formulation is also generalized to handle grey-scale images as well. The technique has also been generalized to fitting planes in 3-D images. Some practical issues of the proposed technique are given.
Realities of Off-Shore Reengineering
Authors: Guido Dedene, Jean-Pierre De Vreese
Venue: IEEE Software (1995)

This paper describes in a nonsophisticated way the experiences with the outsourcing of maintenance activities for major legacy systems to a remote off-shore software house in the Philippines. The two cases presented illustrate much of the spectrum of possibilities enabled by this type of conversion activity. Concrete data are presented on both projects.
Improved Digital Signature Suitable for Batch Verification
Authors: Chi-Sung Laih, Sung-Ming Yen
Venue: IEEE Transactions on Computers (1995)

In this paper, an improved digital signature is developed based on the famous Schnorr or Brickell-McCurley schemes. It is shown that both the new scheme and the previous two originals rely on the same security assumptions. The novel feature of this proposed signature is that it can be verified in a batch manner and the improved efficiency is approximately proportional to the number of signatures to be verified.
The Object-Powered Web
Authors: Vivekanand P. Kochikar
Venue: IEEE Software (1998)

The World Wide Web-whether Internet, intranet, or extranet- has become a key element of post-industrial society. The author contends that the convergence of Web and OO technologies will provide the ability to use new or legacy code on distant machines to build distributed, three-tier client-server applications. These applications will transcend conventional boundaries of platform, organizational function, enterprise, industry, and geography to leverage the power of distributed computing.
Partitioning and Mapping Nested Loops on Multiprocessor Systems
Authors: J. P. Sheu, T. H. Thai
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A method for executing nested loops with constant loop-carried dependencies in parallelon message-passing multiprocessor systems to reduce communication overhead is presented. In the partitioning phase, the nested loop is divided into blocks that reduce the interblock communication, without regard to the machine topology. The execution ordering of the iterations is defined by a given time function based on L. Lamport's (1974) hyperplane method. The iterations are then partitioned into blocks so that the execution ordering is not disturbed, and the amount of interblock communication is minimized. In the mapping phase, the partitioned blocks are mapped onto a fixed-size multiprocessor system in such a manner that the blocks that have to exchange data frequently are allocated to the same processor or neighboring processors. A heuristic mapping algorithm for hypercube machines is proposed.
Capability Maturity Model, Version 1.1
Authors: Mark C. Paulk, Bill Curtis, Mary Beth Chrissis, Charles V. Weber
Venue: IEEE Software (1993)

The capability maturity model (CMM), developed to present sets of recommended practices in a number of key process areas that have been shown to enhance software-development and maintenance capability, is discussed. The CMM was designed to help developers select process-improvement strategies by determining their current process maturity and identifying the issues most critical to improving their software quality and process. The initial release of the CMM, version 1.0, was reviewed and used by the software community during 1991 and 1992. A workshop on CMM 1.0, held in April 1992, was attended by about 200 software professionals. The current version of the CMM is the result of the feedback from that workshop and ongoing feedback from the software community. The technical report that describes version 1.1. is summarized.
Ear decomposition for pair comparison data
Authors: Martin Lages
Venue: Journal of Mathematical Psychology (2002)

An efficient graph-theoretical decomposition technique is introduced that treats inconsistencies in behavioral data as systematic adaptations rather than random errors. This technique, which is known as ear decomposition, reduces inconsistencies in any binary data set to a basis of directed cycles. Such a basis characterizes the data set in terms of inconsistencies and its size offers an improved measure of internal consistency. In two examples it is illustrated how different implementations of the ear decomposition technique can help to identify choices that are critical for violations of transitivity.
Recasting Algorithms to Encourage Reuse
Authors: Bruce W. Weide, William F. Ogden, Murali Sitaraman
Venue: IEEE Software (1994)

Instead of viewing algorithms as single large operations, the authors use a machine-oriented view to show how they can be viewed as collections of smaller objects and operations. Their approach promises more flexibility especially in making performance trade-offs, and encourages black-box reuse. They recommend black-box reuse because the real value of reused code lies in its properties, such as correctness with respect to an abstract specification. If you make even small structural or environmental changes, the confidence in these properties tends to evaporate, and with it most of the component's value. They show how to design an entire category of more flexible black-box reusable software components by applying a general design technique that recasts algorithms as objects. To illustrate the technique, they recast a sorting algorithm and a spanning-forest algorithm into objects.
On the Multiple-Query Optimization Problem
Authors: T. Sellis, S. Ghosh
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

The complexity of the multiple-query optimization problem in database management systems is examined. It is shown that the problem is NP-hard. Then the authors examine the performance of a heuristic algorithm to solve the multiple-query optimization problem and suggest some heuristics for query ordering which improve the efficiency of the algorithm considerably. Some experimental results on the performance of various heuristics are also presented.
Application-Level Fault Tolerance as a Complement to System-Level Fault Tolerance
Authors: Joshua Haines, Vijay Lakamraju, Israel Koren, C. Mani Krishna
Venue: The Journal of Supercomputing (2000)

As multiprocessor systems become more complex, their reliability will need to increase as well. In this paper we propose a novel technique which is applicable to a wide variety of distributed real-time systems, especially those exhibiting data parallelism. System-level fault tolerance involves reliability techniques incorporated within the system hardware and software whereas application-level fault tolerance involves reliability techniques incorporated within the application software. We assert that, for high reliability, a combination of system-level fault tolerance and application-level fault tolerance works best. In many systems, application-level fault tolerance can be used to bridge the gap when system-level fault tolerance alone does not provide the required reliability. We exemplify this with the RTHT target tracking benchmark and the ABF beamforming benchmark.
Design for Debug: Catching Design Errors in Digital Chips
Authors: Bart Vermeulen, Sandeep Kumar Goel
Venue: IEEE Design Test (2002)

For large, complex ICs, engineers need efficient techniques for debugging first silicon. The system presented here consists of an on-chip debug infrastructure and supporting debugger software,which interacts with the infrastructure to make the chip's features accessible through a serial interface.
Essential independent sets and long cycles
Authors: Kazuhide Hirohata
Venue: Discrete Mathematics (2002)

An independent set S of a graph G is said to be essential if S has a pair of vertices that are distance two apart in G. For S ⊆ V(G) with S ≠ φ, let Δ(S) = max{dG(x)|x ∈ S}. We prove the following theorem. Let k ≥ 2 and let G be a k-connected graph. Suppose that Δ(S) ≥ d for every essential independent set S of order k. Then G has a cycle of length at least min{|G|,2d}. This generalizes a result of Fan.
Simple 8-Designs with Small Parameters
Authors: Anton Betten, Adalbert Kerber, Reinhard Laue, Alfred Wassermann
Venue: Designs, Codes and Cryptography (1998)

We show the existence of simple 8-(31,10,93) and 8-(31,10,100) designs. For each value of &lambda; we show 3 designs in full detail. The designs are constructed with a prescribed group of automorphisms PSL(3,5) using the method of Kramer and Mesner KramerMesner76. They are the first 8-designs with small parameters which are known explicitly. We do not yet know if PSL(3,5) is the full group of automorphisms of the given designs. There are altogether 138 designs with &lambda; = 93 and 1658 designs with &lambda; = 100 and PSL(3,5) as a group of automorphisms. We prove that they are all pairwise non-isomorphic. For this purpose, a brief account on the intersection numbers of these designs is given. The proof is done in two different ways. At first, a quite general group theoretic observation shows that there are no isomorphisms. In a second approach we use the block intersection types as invariants, they classify the designs completely.
The Automatic Construction of a View-Independent Relational Model for 3-D Object Recognition
Authors: S. Zhang, G. D. Sullivan, K. D. Baker
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A view-independent relational model (VIRM) used in a vision system for recognizing known 3-D objects from single monochromatic images of unknown scenes is described. The system inspects a CAD model from a number of different viewpoints, and a statistical interference is applied to identify relatively view-independent relationships among component parts of the object. These relations are stored as a relational model of the object, which is represented in the form of a hypergraph. Three-dimensional components of the object, which can be associated with extended image features obtained by grouping of primitive 2-D features are represented as nodes of the hypergraph. Covisibility of model features is represented by means of hyperedges of the hypergraph, and the pairwise view-independent relations form procedural constraints associated with the hypergraph edges. During the recognition phase, the covisibility measures allow a best-first search of the graph for acceptable matches.
The GigaRing Channel
Authors: Steve Scott
Venue: IEEE Micro (1996)

This article describes the SCX system interconnect and I/O channel from Cray Research. The SCX channel provides high performance, scalable, reliable inter-system and system-to-peripheral communication. It is slated for use across all Cray platforms in 1996 and beyond, and will be made available as an open standard.The SCX channel is ring-based, and borrows heavily from the logical layer of the IEEE standard Scalable Coherent Interface. The channel has been enhanced, however, to address the reliability, flexibility and performance needs of distributed supercomputer environments. The SCX channel is capable of sustaining data payload bandwidths in excess of 900 MB/s half duplex, or 2 % 800 MB/s full duplex.
Dynamic Queries for Visual Information Seeking
Authors: Ben Shneiderman
Venue: IEEE Software (1994)

Considers how dynamic queries allow users to "fly through" databases by adjusting widgets and viewing the animated results. In studies, users reacted to this approach with an enthusiasm more commonly associated with video games. Adoption requires research into retrieval and display algorithms and user-interface design. The author discusses how experts may benefit from visual interfaces because they will be able to formulate more complex queries and interpret intricate results.
Strategic Reasoning Under Trade-Offs between Action Costs and Advantages
Authors: Silvano Mussi
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

This paper proposes a model for making the most opportune choice among a number of alternatives in situations involving trade-offs and uncertainty. Alternative actions are evaluated on the basis of strategic attributes, such as cost and effectiveness, and the choice is dynamically determined. The issue is addressed by proposing a set of rules (trade-off rules) representing strategic knowledge specifically oriented to solve trade-off problems. Trade-off rules are encoded in conditional sentences such as: "if P then Ci is preferred to Cj," where P specifies a condition that must be satisfied by the strategic attributes associated with two candidate alternatives, and Ci and Cj are general selection criteria such as "Select alternative with the minimum (or maximum) value of a specific attribute ATTR." In the first part of the paper, a deep analysis of various trade-off problems and various interdependencies among choices is presented. The second part proposes a general paradigm for strategic reasoning under trade-offs. The paradigm is evaluated using a diagnostic application in the medical domain. Finally, the proposal is discussed in the context of related work.
Software Law: Retrospect and Prospect
Venue: IEEE Software (1994)

Discusses the legal and policy aspects of information technology use and development, reviewing what issues have gained attention since 1991, and what issues are likely to be important in the near future.
A System for Approximate Tree Matching
Authors: J. T. -L. Wang, K. Zhang, K. Jeong, D. Shasha
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology, programming compilation, and natural language processing. Many of the applications involve comparing trees or retrieving/extracting information from a repository of trees. Examples include classification of unknown patterns, analysis of newly sequenced RNA structures, semantic taxonomy for dictionary definitions, generation of interpreters for nonprocedural programming languages, and automatic error recovery and correction for programming languages. Previous systems use exact matching (or generalized regular expression matching) for tree comparison. This paper presents a system, called approximate-tree-by-example (ATBE), which allows inexact matching of trees. The ATBE system interacts with the user through a simple but powerful query language; graphical devices are provided to facilitate inputing the queries. The paper describes the architecture of ATBE, illustrates its use and describes some aspects of ATBE implementation. We also discuss the underlying algorithms and provide some sample applications.
Pancyclicity in claw-free graphs
Authors: R. J. Gould, F. Pfender
Venue: Discrete Mathematics (2002)

In this paper, we present several conditions for K1,3-free graphs, which guarantee the graph is subpancyclic. In particular, we show that every K1,3-free graph with a minimum degree sum δ2 > 2 √3n+1 - 4; every {K1,3P7}-free graph with δ2 ≥ 9; every {K1,3Z4}-free graph with δ2 ≥ 9; and every K1,3-free graph with maximum degree Δ, diam(G) ≤ (Δ + 6)/4 and δ2 ≥ 9 is subpancyclic.
Performance evaluation of a parallel cascade semijoin algorithm for computing path expressions in object database systems
Authors: Wang Guoren, Yu Ge
Venue: Journal of Computer Science and Technology (2002)

With the emerging of new applications, especially in Web, such as E-Commerce, Digital Library and DNA Bank, object database systems show their stronger functions than other kinds of database systems due to their powerful representation ability on complex semantics and relationship. One distinguished feature of object database systems is path expression, and most queries on an object database are based on path expression because it is the most natural and convenient way to access the object database, for example, to navigate the hyperlinks in a web-based database. The execution of path expression is usually extremely expensive on a very large database. Therefore, the improvement of path expression execution efficiency is critical for the performance of object databases. As an important approach realizing high-performance query processing, the parallel processing of path expression on distributed object databases is explored in this paper. Up to now, some algorithms about how to compute path expressions and how to optimize path expression processing have been proposed for centralized environments. But, few approaches have been presented for computing path expressions in parallel. In this paper, a new parallel algorithm for computing path expression named Parallel Cascade Semijoin (PCSJ) is proposed. Moreover, a new scheduling strategy called right-deep zigzag tree is designed to further improve the performance of the PCSJ algorithm. The experiments have been implemented in an NOW distributed and parallel environment. The results show that the PCSJ algorithm outperforms the other two parallel algorithms (the parallel version of forward pointer chasing algorithm (PFPC) and the index splitting parallel algorithm (IndexSplit)) when computing path expressions with restrictive predicates and that the right-deep zigzag tree scheduling strategy has better performance than the right-deep tree scheduling strategy.
On Time Optimal Supernode Shape
Authors: Edin Hodzic, Weijia Shang
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

With the objective of minimizing the total execution time of a parallel program on a distributed memory parallel computer, this paper discusses the selection of an optimal supernode shape of a supernode transformation (also known as tiling). We identify three parameters of a supernode transformation: supernode size, relative side lengths, and cutting hyperplane directions. For supernode transformations on algorithms with perfectly nested loops and uniform dependencies, we prove the optimality of a constant linear schedule vector and give a necessary and sufficient condition for optimal relative side lengths. We also prove that the total running time is minimized by a cutting hyperplane direction matrix from a particular subset of all valid directions and we discuss the cases where this subset is unique. The results are derived in continuous space and should be considered approximate. Our model does not include cache effects and assumes an unbounded number of available processors, the communication cost approximated by a constant, uniform dependences, and loop bounds known at compile time. A comprehensive example is discussed with an application of the results to the Jacobi algorithm.
Storage in the PowerPC
Authors: Janice M. Stone, Robert P. Fitzgerald
Venue: IEEE Micro (1995)

The PowerPC architecture permits aggressive hardware and software implementations that improve performance by hiding the large relative latency of memory accesses. Hardware and software cooperatively determine the behavior of the memory system, using the architecture's provisions for atomicity, coherence, and synchronization of accesses. The design philosophy is to streamline interfaces among components, to limit synchronization delays. For the memory system, the problem is to reduce processor delays during memory accesses. This motivated the development of systems in which useful work can be accomplished during latency periods. While the processor awaits the arrival of a datum, it can often fetch other data, do computations that do not require the awaited datum, and store other data. Such reordering is limited by data dependences among accesses and computation.
A+ Certification Kit with Cdrom
Authors: David Groth
Venue:  (1998)

:A+ certification exams! This box set contains the A+: Core Module Study Guide and the A+: DOS/Windows Study Guide. Each book provides detailed coverage of every objective defined by CompTIA for its exam. Use the Sybex A+ Test-Preparation Programs included on the two CDs to make sure you're ready to ace the exams the first time.
Precise Interrupts
Authors: Mayan Moudgill, Stamatis Vassiliadis
Venue: IEEE Micro (1996)

Interrupts and in particular precise interrupts constitute an integral part of all computer architectures. Implementing precise interrupts can substantially inhibit the performance of computers. To gain some insight into the problem, we divide common interrupts into four classes, and examine the cost of implementing precise interrupts. Two of these classes, external-critical and external-error, can be implemented cheaply on a pipelined processor, with little or no impact on performance. We propose that interrupts be implemented imprecisely, except during debugging, of a third class of interrupts, internal-error interrupts. Finally, we introduced some techniques that can be used to cheaply implement precise interrupts for the fourth class of interrupts, internal-critical interrupts, but may not apply generally. While the central concern is precision, or lack thereof, we also deal with several peripheral issues that arise when implementing interrupts on aggressive implementations. These include sparse restart, which will arise whenever we weaken the requirements for precision on an out-of-order issue processor, and the impact of parallel (e.g., superscalar) issue.
Place/transition Petri net evolutions: recording ways, analysis and synthesis
Authors: Ludwik Czaja
Venue: Fundamenta Informaticae (2002)

Four semantic domains for Place/Transition Petri nets and their relationships are considered. They are monoids of respectively: firing sequences, processes, traces and dependence graphs. For each of them the analysis and synthesis problem is stated and solved. The monoid of processes is defined in a non-standard way. Nets under consideration involve weights of arrows and capacities (finite or infinite) of places. However, the analysis and synthesis tasks require nets to be pure, i.e. each of their transition must have the pre-set and post-set disjoint.
A Wave Propagation Method for Conservation Laws and Balance Laws with Spatially Varying Flux Functions
Authors: Derek S. Bale, Randall J. LeVeque
Venue: SIAM Journal on Scientific Computing (2002)

We study a general approach to solving conservation laws of the form qt+f(q,x)x=0, where the flux function f(q,x) has explicit spatial variation. Finite-volume methods are used in which the flux is discretized spatially, giving a function fi(q) over the ith grid cell and leading to a generalized Riemann problem between neighboring grid cells. A high-resolution wave-propagation algorithm is defined in which waves are based directly on a decomposition of flux differences fi(Qi)-f-1(Qi-1) into eigenvectors of an approximate Jacobian matrix. This method is shown to be second-order accurate for smooth problems and allows the application of wave limiters to obtain sharp results on discontinuities. Balance laws $q_t+f(q,x)_x=\psi(q,x)$ are also considered, in which case the source term is used to modify the flux difference before performing the wave decomposition, and an additional term is derived that must also be included to obtain full accuracy. This method is particularly useful for quasi-steady problems close to steady state.