ppxscal/embedding_network huggingface dataset:
Optimal Parallel and Pipelined Processing Through a New Class of Matrices with Application to Generalized Spectral Analysis
Authors: M. J. Corinthios
Venue: IEEE Transactions on Computers (1994)

A new class of general-base matrices, named sampling matrices, which are meant to bridge the gap between algorithmic description and computer architecture is proposed. "Poles," "zeros," "pointers," and "spans" are among the terms introduced to characterize properties of this class of matrices. A formalism for the decomposition of a general matrix in terms of general-base sampling matrices is proposed. "Span" matrices are introduced to measure the dependence of a matrix span on algorithm parameters and, among others, the interaction between this class of matrices and the general-base perfect shuffle permutation matrix previously introduced. A classification of general-base parallel "recirculant" and parallel pipelined processors based on memory topology, access uniformity and shuffle complexity is proposed. The matrix formalism is then used to guide the search for algorithm factorizations leading to optimal parallel and pipelined processor architecture.
A Combinatorial Algorithm for Performance and Reliability Analysis Using Multistate Models
Authors: M. Veeraraghavan, K. S. Trivedi
Venue: IEEE Transactions on Computers (1994)

The need for the combined performance and reliability analysis of fault tolerant systems is increasing. The common approach to formulating and solving such problems is to use (semi-)Markov reward models. However, the large size of state spaces is a problem that plagues Markovian models. Combinatorial models have been used for modeling reliability and availability of complex systems without paying the price of large Markov models. However, assumptions of two-state behavior of components (and that of the system), independence assumptions of component state transitions, and restrictive repair assumptions decrease the potential of combinatorial models for realistic systems. The authors propose a combinatorial algorithm for the combined performance and reliability analysis of coherent repairable systems with multistate components, allowing interdependent component state transitions. An example illustrating the algorithm is also presented.
Clustering validity checking methods: part II
Authors: Maria Halkidi, Yannis Batistakis, Michalis Vazirgiannis
Venue: ACM SIGMOD Record (2002)

Clustering results validation is an important topic in the context of pattern recognition. We review approaches and systems in this context. In the first part of this paper we presented clustering validity checking approaches based on internal and external criteria. In the second, current part, we present a review of clustering validity approaches based on relative criteria. Also we discuss the results of an experimental study based on widely known validity indices. Finally the paper illustrates the issues that are under-addressed by the recent approaches and proposes the research directions in the field.
Computation of Lyapunov characteristic exponents for continuous dynamical systems
Authors: Firdaus E. Udwadia, Hubertus F. von Bremen
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

A new method for computing all the Lyapunov characteristic exponents (LCEs) of n-dimensional continuous dynamical systems is presented. The method relies on the use of the Cayley Transform and a development of the ability to restart the computations for the variational equation. The method intrinsically maintains the orthogonality of the Q matrix in the QR decomposition of the solution of the variational equation. It therefore does not suffer from the type of computational breakdown that occurs with the standard method for computing LCEs. An example of a Lorenz system showing the breakdown of the standard method is presented, and the same example is used to compute the LCEs by the present method. Comparisons of the computational efficiency of the proposed method in relation to the standard method, and the standard-method-with-reorthogonalization are presented. Issues of accuracy are addressed.
State and Fault Information for Compaction-Based Test Generation
Authors: Ashish Giani, Shuo Sheng, Michael S. Hsiao, Vishwani D. Agrawal
Venue: Journal of Electronic Testing: Theory and Applications (2002)

We present a new test generation procedure for sequential circuits using newly traversed state and newly detected fault information obtained between successive iterations of vector compaction. Two types of techniques are considered. One is based on the new states a sequential circuit is driven into, and the other is based on the new faults that are detected between consecutive iterations of vector compaction. These data modify an otherwise random selection of vectors, to bias vector sequences that cause the circuit to reach new states, and cause previously undetected faults to be detected. The biased vectors, when used to extend the compacted test set, provide a more intelligent selection of vectors. The extended test set is then compacted. Repeated applications of state and fault analysis, vector generation and compaction produce significantly high fault coverage using relatively small computing resources. We obtained improvements in terms of higher fault coverage, fewer vectors for the same coverage, or smaller number of iterations and time required, consistently for several benchmark circuits.
Single Output Distributed Two-Rail Checker with Diagnosing Capabilities for Bus Based Self-Checking Architectures
Authors: Michele Favalli, Cecilia Metra
Venue: Journal of Electronic Testing: Theory and Applications (2002)

This paper proposes a distributed two-rail checker architecture which is specifically targeted to self-checking bus-based systems. The architecture makes use of a single bus line to provide error indication. With respect to conventional two-rail checkers additional diagnosing capabilities are provided. The checker is totally-self-checking with respect to stuck-at faults. It features also good self-testing properties with respect to parametric faults, such as bridgings and delay faults.
ARM7TDMI Power Consumption
Authors: Simon Segars
Venue: IEEE Micro (1997)

RISC CPUs can be found at the heart of many high volume portable and hand held consumer products. Examples of such products include pagers, mobile phones and PDAs. The processor often accounts for a major component of the system's power consumption. Therefore careful consideration must be taken at the design stage to ensure that the processor's power consumption is minimized. In this article, the sources of power consumption in a microprocessor are discussed and a power analysis of ARM7 is presented. The processor's impact on the power consumption at the system level is then introduced.
Optional and Responsive Fine-Grain Locking in Internet-Based Collaborative Systems
Authors: Chengzheng Sun
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Locking is a standard technique in distributed computing and database systems used to ensure data integrity by prohibiting concurrent conflicting updates on shared data objects. Internet-based collaborative systems are a special class of distributed applications which support human-to-human interaction and collaboration over the Internet. In this paper, a novel optional and responsive fine-grain locking scheme is proposed for consistency maintenance in Internet-based collaborative editors. In the proposed scheme, locking is made optional in the sense that a user may update any part of the document without necessarily requesting a lock, thus saving the users the burden of having to use locks while editing and the system the overhead of executing locking operations most of the time in a collaborative editing session. In the face of high communication latency in the Internet environment, responsive locking is achieved by granting the permit to the user for updating the data region immediately after issuing a locking request. Moreover, multiple fine-grain locks can be placed on different regions inside a document to allow concurrent and mutually exclusive editing on the same document. Protocols and algorithms for locking conflict resolution and consistency maintenance are devised to address special technical issues involved in optional and responsive fine-grain locking. The proposed locking scheme and supporting techniques have been implemented in an Internet-based collaborative editor to demonstrate its feasibility and usability.
A Note on the Recursive and Parallel Structure of the Birge and Qi Factorization for Tree Structured Linear Programs
Authors: Georg Ch. Pflug, Ladislav Halada
Venue: Computational Optimization and Applications (2003)

In this note, we derive the complete recursive structure of the Birge and Qi factorization for interior point methods (IPM) for tree structured linear programs as they appear in multistage stochastic programs. This recursive structure allows for an elegant implementation on parallel hardware, since multiple versions of the same program may be run on on different processors. Our preliminary computational experiment, conducted on a Beowulf cluster, demonstrates the scalability of this approach.
Layered set partitioning in hierarchical tree for image coding
Authors: Wen-Jyi Hwang, Chung-Kun Wu, Kuo-Jung Li
Venue: Signal Processing (2002)

A new layered image transmission (LIT) design algorithm is presented in this paper. The algorithm allows various decoder devices with different resolution and rate requirements to share a common image encoder. The number of layers for the transmission, and the resolution and the average rate associated with each layer can be determined from the requirements of the decoders. Based on the constraints for each layer, a novel layered set partitioning in hierarchical tree scheme is used to encode images for transmission. Simulation results show that the new algorithm is very effective for constructing LIT systems.
A Pattern Adaptive Technique to Handle Data Quality Variation
Authors: P. M. Wong, T. D. Gedeon
Venue: Neural Processing Letters (1999)

This study proposes a new technique, namely the Pattern Adaptive Neural Network (PANN), for simplifying existing noise detection and removal methods. This technique is developed based on a modified backpropagation algorithm using a fuzzy membership function on the error term. It is able to make use of noisy data in a single step, with an automatic adjustment of data contribution to network training. It is demonstrated via an application on an oil well data set. The results show that the predictions from PANN matched well with the expert interpretations on the data set regarding the data quality.
Digital Libraries and Autonomous Citation Indexing
Authors: Steve Lawrence, C. Lee Giles, Kurt Bollacker
Venue: Computer (1999)

The revolution the Web has brought to information dissemination is not so much due to the availability of data--huge amounts of information has long been available in libraries--but rather the improved efficiency of accessing (improved accessibility to) that information. The Web promises to make more scientific articles more easily available. By making the context of citations easily and quickly browsable, Autonomous Citation Indexing can help to evaluate the importance of individual contributions more accurately and quickly.Digital libraries incorporating ACI can help organize scientific literature and may significantly improve the efficiency of dissemination and feedback. ACI may also help speed the transition to scholarly electronic publishing.
DOLPHIN: Digital Online Library Providing Human-Like Interactive Navigation
Authors: Yoshiaki Seki, Tetsuo Hidaka
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

In a digital library environment, we propose a new support concept that is like a reference service in real libraries. Based on the concept, we have developed a prototype, called DOLPHIN, using a frame-based knowledge base to support reference services in a digital library. DOLPHIN can guide the user to appropriate service.
Attacking Malicious Code: A Report to the Infosec Research Council
Authors: Gary McGraw, Greg Morrisett
Venue: IEEE Software (2000)

The accelerating trends of interconnectedness, complexity, and extensibility are aggravating the already-serious threat posed by malicious code. To combat malicious code, these authors argue for creating sound policy about software behavior and enforcing that policy through technological means.
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Authors: Jie Wu
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we extend dominating-set-based routing to networks with unidirectional links. Specifically, an efficient localized algorithm for determining a dominating and absorbant set of vertices (mobile hosts) is given and this set can be easily updated when the network topology changes dynamically. A host \big. v\bigr. is called a dominating neighbor (absorbant neighbor) of another host \big. u\bigr. if there is a directed edge from \big. v\bigr. to \big. u\bigr. (from \big. u\bigr. to \big. v\bigr.). A subset of vertices is dominating and absorbant if every vertex not in the subset has one dominating neighbor and one absorbant neighbor in the subset. The derived dominating and absorbant set exhibits good locality properties; that is, the change of a node status (dominating/dominated) affects only the status of nodes in the neighborhood. The notion of dominating and absorbant set can also be applied iteratively on the dominating and absorbant set itself, forming a hierarchy of dominating and absorbant sets. The effectiveness of our approach is confirmed and the locality of node status update is verified through simulation.
Re-embedding structures of 5-connected projective-planar graphs
Authors: Shigeru Kitakubo, Seiya Negami
Venue: Discrete Mathematics (2002)

We shall identify the structures of 5-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane and show a short proof of the result, due to Kitakubo [3], that every 5-connected projective-planar nonplanar graph has exactly 1, 2, 3, 4, 6, 9 or 12 inequivalent embeddings on the projective plane.
Area and power reduction of embedded DSP systems using instruction compression and re-configurable encoding
Authors: Subash Chandar G, Mahesh Mehendale, R. Govindarajan
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this paper, we propose a reconfiguration mechanism that allows multiple instruction compression to reduce both code size, which in turn reduces the cost, and (instruction fetch) power, which enhances the battery lifetime, two key considerations in embedded DSP systems. We enhance Texas Instruments DSP core TMS320C27x to incorporate this mechanism and evaluate the improvements on code size and instruction fetch energy using real life embedded control application programs. We show that even with minimal hardware overhead, we can improve code size by over 10% and instruction fetch energy by over 40%.
Classifying Subspaces of Hamming Spaces
Authors: Patric R. J. Östergård
Venue: Designs, Codes and Cryptography (2002)

A linear code in Fnq with dimension k and minimum distance at least d is called an &lsqb;n, k, d&rsqb;q code. We here consider the problem of classifying all &lsqb;n, k, d&rsqb;q codes given n, k, d, and q. In other words, given the Hamming space Fnq and a dimension k, we classify all k-dimensional subspaces of the Hamming space with minimum distance at least d. Our classification is an iterative procedure where equivalent codes are identified by mapping the code equivalence problem into the graph isomorphism problem, which is solved using the program nauty. For d &equals; 3, the classification is explicitly carried out for binary codes of length n &le; 14, ternary codes of length n &le; 11, and quaternary codes of length n &le; 10.
Application of statistical quality control measures for near-surface geochemical petroleum exploration
Authors: John Q. Belt,  Jr., Gary K. Rice
Venue: Computers Geosciences (2002)

There are four major quality control measures that can apply to geochemical petroleum exploration data: statistical quality control charts, data reproducibility-Juran approach, ethane composition index, and hydrocarbon cross plots. Statistical quality control, or SQC, charts reflect the quality-performance of the analytical process composed of equipment, instrumentation, and operator technique. An unstable process is detected through assignable causes using SQC charts. Knowing data variability is paramount to tying geochemical data over time for in-fill samples and/or project extensions. The Juran approach is a statistical tool used to help determine the ability of a process to maintain itself within the limits of set specifications for reproducing geochemical data. Ethane composition index, or ECI, is a statistical calculation based on near-surface, light hydrocarbon measurements that help differentiate thermogenic, petroleum sources at depth. The ECI data are integrated with subsurface geological information, and/or seismic survey data to determine lower-risk drilling locations. Hydrocarbon cross plots are visual correlation techniques that compare two hydrocarbons within a similar hydrocarbon suite (e.g., ethane versus propane, benzene versus toluene, or 2-ring aromatics versus 3-ring aromatics). Cross plots help determine contamination, multiple petroleum sources, and low-quality data versus high-quality data indigenous to different geochemical exploration tools. When integrated with geomorphology, subsurface geology, and seismic survey data high-quality geochemical data provides beneficial information for developing a petroleum exploration model. High-quality data is the key to the successful application of geochemistry in petroleum exploration modeling. The ability to produce high-quality, geochemical data requires the application of quality control measures reflective of a well managed ISO 9000 quality system. Statistical quality control charts, Juran studies, and data cross plots are basic elements found within such a system. ISO 9000 is briefly discussed in Appendix A.
Polynomials with All Zeros Real and in a Prescribed Interval
Authors: Jean B. Lasserre
Venue: Journal of Algebraic Combinatorics: An International Journal (2002)

We provide a characterization of the real-valued univariate polynomials that have only real zeros, all in a prescribed interval &lsqb;a,b&rsqb;. The conditions are stated in terms of positive semidefiniteness of related Hankel matrices.
Rearrangeable Three-Stage Interconnection Networks and Their Routing Properties
Authors: B. G. Douglass
Venue: IEEE Transactions on Computers (1993)

A rearrangeable network is an interconnection network which can achieve all possible permutations of its inputs' connections to its outputs. One class of rearrangeable networks, which have been studied are Clos three-stage networks. Earlier procedures to route such networks rapidly require an excessive amount of hardware, either in the network itself or in the device required to compute the routing. A class of rearrangeable three-stage networks which is both compact and which can be routed quickly is introduced, along with a routing scheme. Switches are added to the network so as to reduce the interdependence between the switch settings, allowing faster routing while only moderately increasing network complexity. A network with O(Nlog/sup 1.5/N) hardware and O(log/sup 1.5/N) depth is derived from O(log/sup 2.5/N) switch setup time.
Parallel CRC Generation
Authors: Guido Albertengo, Riccardo Sisto
Venue: IEEE Micro (1990)

Theoretical aspects of encoding cyclic redundant codes (CRCs) are reviewed. A method of designing hardware parallel encoders for CRCs that is based on digital system theory and z-transforms is presented. It allows designers to derive the logic equations of the parallel encoder circuit for any generator polynomial. A few interesting application areas for hardware parallel encoders are pointed out.
APL Extended Compared With Other Languages According to Halstead's Theory
Authors: F. H. D. van Batenburg, Joseph de Kerf
Venue: ACM SIGPLAN Notices (1998)

In a previous paper, Halstead's theory was applied to first generation APL. Those implementations only support simple arrays (APL/SA). In this paper we extend the application of Halstead's theory to second generation APL; the main difference being that those implementations support arrays of arrays or nested arrays (APL/NA). In both investigations, Halstead's theory had to be adjusted in order to account for the fact that in APL operations may be functions or operators. It is shown that the language level increases from 3.07 for APL/SA to 3.62 for APL/NA This means that language efficiency of APL versus assembler raises from about 12 for APL/SA to nearly 17 for APL/NA.
Adaptive Local Thresholding by Verification-Based Multithreshold Probing with Application to Vessel Detection in Retinal Images
Authors: Xiaoyi Jiang, Daniel Mojon
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

In this paper, we propose a general framework of adaptive local thresholding based on a verification-based multithreshold probing scheme. Object hypotheses are generated by binarization using hypothetic thresholds and accepted/rejected by a verification procedure. The application-dependent verification procedure can be designed to fully utilize all relevant informations about the objects of interest. In this sense, our approach is regarded as knowledge-guided adaptive thresholding, in contrast to most algorithms known from the literature. We apply our general framework to detect vessels in retinal images. An experimental evaluation demonstrates superior performance over global thresholding and a vessel detection method recently reported in the literature. Due to its simplicity and general nature, our novel approach is expected to be applicable to a variety of other applications.
Topological Zone Organization of Scalar Volume Data
Authors: Jim Cox, D. B. Karron, Nazma Ferdous
Venue: Journal of Mathematical Imaging and Vision (2003)

We present a new method for preprocessing and organizing discrete scalar volume data of any dimension on external storage. We describe our implementation of a visual navigation system using our method. The techniques have important applications for out-of-core visualization of volume data sets and image understanding. The applications include extracting isosurfaces in a manner that helps reduce both I/O and disk seek time, a priori topologically correct isosurface simplification (prior to extraction), and producing a visual atlas of all topologically distinct objects in the data set. The preprocessing algorithm computes regions of space that we call topological zone components, so that any isosurface component (contour) is completely contained in a zone component and all contours contained in a zone component are topologically equivalent. The algorithm also constructs a criticality tree that is related to the recently studied contour tree. However, unlike the contour tree, the zones and the criticality tree hierarchically organize the data set. We demonstrate that the techniques work on both irregularly and regularly gridded data, and can be extended to data sets with nonunique values, by the mathematical analysis we call Digital Morse Theory (DMT), so that perturbation of the data set is not required. We present the results of our initial experiments with three dimensional volume data (CT) and describe future extensions of our DMT organizing technology.