ppxscal/embedding_network huggingface dataset:
Sum Versus Vote Fusion in Multiple Classifier Systems
Authors: J. Kittler, F. M. Alkoot
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Amidst the conflicting experimental evidence of superiority of one over the other, we investigate the Sum and majority Vote combining rules in a two class case, under the assumption of experts being of equal strength and estimation errors conditionally independent and identically distributed. We show, analytically, that, for Gaussian estimation error distributions, Sum always outperforms Vote. For heavy tail distributions, we demonstrate by simulation that Vote may outperform Sum. Results on synthetic data confirm the theoretical predictions. Experiments on real data support the general findings, but also show the effect of the usual assumptions of conditional independence, identical error distributions, and common target outputs of the experts not being fully satisfied.
Dispel those computer myths!
Authors: Kathryn E. Smith
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

In the future, it will be the continued responsibility of User Services to educate everyone concerning the basics of computing. Part of our responsibility is to disseminate accurate information to those people who do not use the computer, but still whose lives are greatly affected by computer technology. Everyday these people participate in transactions which rely upon a computer. Through the educational efforts of User Services, everyone can comfortably enter the mainstream of a computer-oriented society.
The Future of Unix in the CASE Renaissance
Authors: Bill Cureton
Venue: IEEE Software (1988)

The possibility of cross-fertilization of technology between scientific and commercial software user groups is examined. The role of the Unix operating system in providing the technological bridge between the two communities is explored. The development of computer-aided software engineering, which is viewed as being linked to future improvements in Unix, is discussed in this context.
Groups of Flagged Homotopies and Higher Gauge Theory
Authors: V. Dolotin
Venue: Journal of Dynamical and Control Systems (1999)

Groups &Pi;k(X&semi;&sigma;) of &ldquo;flagged homotopies&rdquo; are introduced of which the usual (abelian for k > 1) homotopy groups &pi;k(X&semi;p) is the limit case for flags &sigma; contracted to a point p. The calculus of exterior forms with values in an algebra A is developped of which the limit cases are the differential forms calculus (for A = {\Bbb R}) and gauge theory (for 1-forms). Moduli space of integrable forms with respect to higher gauge transforms (cohomology with coefficients in A) is introduced with elements giving representations of &Pi;k in G &equals; expA.
Incremental CAD
Authors: Olivier Coudert, Jason Cong, Sharad Malik, Majid Sarrafzadeh
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Comprehensive study of incremental algorithms and solutions in the context of CAD tool development is an open area of research with a great deal of potential. Incremental algorithms for synthesis and layout are needed when design undergoes local or incremental change. Often these local changes are made to react to local change in the design, correct local errors or to make local improvements in one or more of the design quality metrics. In this paper we outline fundamental problems in incremental logic synthesis and physical design. Preliminary solutions to a subset of these problems will be outlined.
Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor Communications
Authors: C. Qiao, R. Melhem
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Time division multiplexed multistage interconnection networks (TDM-MIN's) are proposed for multiprocessor communications. Connections required by an application are partitioned into a number of subsets, called mappings, such that connections in each mapping can be established in an MIN without conflict. Switch settings for establishing connections in each mapping are determined and stored in shift registers. By repeatedly changing switch settings, connections in each mapping are established for a time slot in a round-robin fashion. Thus, all connections required by an application may be established in an MIN in a time division multiplexed way. TDM-MIN's can emulate a completely connected network using N time slots. It can also emulate regular networks such as rings, meshes, cube-connected-cycles (CCC), binary trees, and n-dimensional hypercubes using 2, 4, 3, 4, and n time slots, respectively. The problem of partitioning an arbitrary set of requests into a minimal number of mappings is NP-hard. Simple heuristic algorithms are presented and their performances are shown to be close to optimal. The flexibility of TDM-MIN's allows for the support of run-time requests through dynamic reconfigurations. The techniques are especially suitable for hybrid electro-optical systems with optical interconnects.
Expert Systems in Japan
Authors: Koichi Ishii, Sakae Hayami
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

A background and overview of artificial intelligence (AI) research in Japan is provided. Industrial AI research in the steel, construction, and energy-related industries is examined. A trend is revealed toward addressing design and productivity as opposed to the diagnosis and cost-saving approach dominating US expert systems.
Capture Effect of Randomly Addressed Polling Protocol
Authors: Jiang-Whai Dai
Venue: Wireless Personal Communications: An International Journal (1999)

The capture effect, discussed in this paper, is generally considered to enhance the system&lsquo;s performance in a wireless network. This paper also considers the Randomly Addressed Polling (RAP) protocol in the presence of a fading mobile radio environment. Herein, a deterministic channel, which rules according to inverse &agr; power propagation law, is established to obtain the probability that one collided packet can capture the channel from distance distribution. Through the probability, we analyze the performance of the RAP protocol by using an embedded Markov chain. According to our results, the performance of the RAP protocol does not obviously change in terms of power control, implying that it can be more aptly applied in power control skill than other protocols.
An Introduction to Programming with C++, 1st edition
Authors: Diane Zak
Venue:  (1998)

:In keeping with the success of the previous edition, An Introduction to Programming with C++, Second Edition provides a thorough introduction to programming using C++ as the illustrative language.
d-Disjunct matrices: bounds and Lovasz local lemma
Authors: Hong-Gwa Yeh
Venue: Discrete Mathematics (2002)

A binary matrix is said to be d-disjunct if the union (or Boolean sum) of any d columns does not contain any other column. Such matrices constitute a basis for nonadaptive group testing algorithms and binary d-superimposed codes. Let t(d, n) denote the minimum number of rows for a d-disjunct matrix with n columns. In this note we study the bounds of t(d, n) and its variations. Lovász Local Lemma (Colloq. Math. Soc. Jãnos Bolyai 10 (1974) 609-627; The Probabilistic Method, Wiley, New York, 1992 (2nd Edition, 2000)) and other probabilistic methods are used to extract better bounds. For a given random t × n binary matrix, the Stein-Chen method is used to measure how 'bad' it is from a d-disjunct matrix.
Semi-Implicit Spectral Element Atmospheric Model
Authors: S. J. Thomas, R. D. Loft
Venue: Journal of Scientific Computing (2002)

A semi-implicit spectral element shallow water model on the cubed-sphere is described and numerical results are compared with an explicit formulation and the traditional spectral transform method using the standard test cases proposed by Williamson et al. (1992). The explicit time step is limited by the phase speed of the fastest gravity waves. Semi-implicit time integration schemes remove this stability restriction but require the solution of an elliptic problem. A weak variational formulation of the governing equations leads to a symmetric Helmholtz operator. The resulting implicit problem for the geopotential is then solved using a block-Jacobi preconditioned conjugate gradient solver. The simulation rate of the semi-implicit model is accelerated relative to the explicit model for practical climate resolutions by a factor of two.
Some Sets of Type (m,n) in Cubic Order Planes
Authors: L. M. Batten, J. M. Dover
Venue: Designs, Codes and Cryptography (1999)

A (4,9)-set of size 829 in {\cal PG}(2,5^3) is constructed, as is a (4,11)-set of size 3189 in {\cal PG}(2,7^3).
Evaluation of Parallel Copying Garbage Collection on a Shared-Memory Multiprocessor
Authors: A. Imai, E. Tick
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A parallel copying garbage collection algorithm for symbolic languages executing on shared-memory multiprocessors is proposed. The algorithm is an extension of Baker's sequential algorithm with a novel method of heap allocation to prevent fragmentation and facilitate load distribution during garbage collection. An implementation of the algorithm within a concurrent logic programming system, VPIM, has been evaluated and the results, for a wide selection of benchmarks, are analyzed here. The authors show 1) how much the algorithm reduces the contention for critical sections during garbage collection, 2) how well the load-balancing strategy works and its expected overheads, and 3) the expected speedup achieved by the algorithm.
Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space
Authors: Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore precompute the result of any nearest-neighbor search which corresponds to a computation of the Voronoi cell of each data point. In a second step, we store conservative approximations of the Voronoi cells in an index structure efficient for high-dimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precomputation of the solution space, it is dynamic, i.e., it supports insertions of new data points. An extensive experimental evaluation of our technique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the search time compared to nearest neighbor search in other index structures such as the X-tree.
Walvelet Analysis of Commodity Price Behavior
Authors: Russell Davidson, Walter C. Labys, Jean-Baptiste Lesourd
Venue: Computational Economics (1998)

We propose a form of semi-nonparametric regression based on wavelet analysis. Traditional time series methods usually involve either the time or the frequency domain, but wavelets can combine the information from both of these. While wavelet transforms are typically restricted to equally spaced observations an integer power of 2 in number, we show how to go beyond these constraints. We use our methods to construct &rsquo;patios&lsquo; for 21 important international commodity price series. These graph the magnitude of the variations in the series at different time scales for various subperiods of the full sample.
Hammerstein Models for Identification of Stochastic Systems
Authors: G. R. Bolkvadze
Venue: Automation and Remote Control (2003)

Identification of nonlinear stochastic systems in the class of Hammerstein models is investigated with regard for the nonlinearities of the investigated object. Hammerstein models are constructed with regard for the output noise in the form of a martingale sequence and moving mean are constructed. Necessary and sufficient conditions for the strong consistency of estimates of parameters of stochastic gradient algorithms are formulated. Their convergence rates are estimated. The results are applicable to adaptive tracking of the output of an object.
On Critical Point Detection of Digital Shapes
Authors: Pengfei Zhu, Paul M. Chirlian
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In this paper, we present a nonlinear algorithm for critical point detection (CPD) of 2D digital shapes. The algorithm eliminates the problems arising from curvature approximation and Gaussian filtering in the existing algorithms. Based on the definition of ¿critical level,¿ we establish a set of criteria for the design of an effective CPD algorithm for the first time. By quantifying the critical level to the modified area confined by three consecutive ¿pseudocritical points,¿ a simple but very effective algorithm is developed. The comparison of our experimental results with those of many other CPD algorithms shows that the proposed algorithm is superior in that it provides a sequence of figures at every detail level, and each has a smaller integral error than the others with the same number of critical points. The experimental results on shapes with various complexities also show the algorithm is reliable and robust with regard to noise.
Zero-Aliasing for Modeled Faults
Authors: Sandeep K. Gupta, Mody Lempel
Venue: IEEE Transactions on Computers (1995)

When using built-in self-test (BIST) for testing VLSI circuits the circuit response to an input test sequence, which may consist of thousands to millions of bits, is compacted into a signature which consists of only tens of bits. Usually a linear feedback shift register (LFSR) is used for response compaction via polynomial division. The compacting function is a many-to-one function and as a result some erroneous responses may be mapped to the same signature as the good response. This is known as aliasing.In this paper we deal with the selection of a feedback polynomial for the compacting LFSR, such that an erroneous response resulting from any modeled fault is mapped to a signature that is different from that for the good response. Such LFSRs are called zero-aliasing LFSRs. Only zero-aliasing LFSRs with primitive or irreducible feedback polynomials are considered due to their suitability for BIST test pattern generation.Upper bounds are derived for the least degree irreducible and primitive zero-aliasing LFSR polynomials. These bounds show that in all practical test applications such a polynomial will be of degree less than 53. Expected bounds are derived and show that when the number of faults is less than 106, then this degree is at most 21.Procedures to find irreducible and primitive zero-aliasing LFSR polynomials of: 1) the smallest degree and 2) a pre-specified degree; are presented. A low-complexity procedure to find a zero-aliasing LFSR polynomial is also presented. The worst case as well as expected time complexities of all these procedures are derived. Experimental results are presented for practical problem sizes to demonstrate the applicability of the proposed procedures.
Reliable Objects: Lightweight Testing for OO Languages
Authors: Jean-Marc Jézéquel, Daniel Deveaux, Yves Le Traon
Venue: IEEE Software (2001)

A major challenge in software development research today is to come up with low-overhead methods and tools to help developers deliver quality products within tight time and budget constraints. This is particularly true of testing because of its cost and impact on final product reliability. The authors propose a lightweight approach to embedding tests into components, making them self-testable. They also propose a method to evaluate testing efficiency based on mutation techniques, which ultimately provides an estimation of a component's quality.
Fast Local and Global Projection-Based Methods for Affine Motion Estimation
Authors: Dirk Robinson, Peyman Milanfar
Venue: Journal of Mathematical Imaging and Vision (2003)

The demand for more effective compression, storage, and transmission of video data is ever increasing. To make the most effective use of bandwidth and memory, motion-compensated methods rely heavily on fast and accurate motion estimation from image sequences to compress not the full complement of frames, but rather a sequence of reference frames, along with &ldquo;differences&rdquo; between these frames which results from estimated frame-to-frame motion. Motivated by the need for fast and accurate motion estimation for compression, storage, and transmission of video as well as other applications of motion estimation, we present algorithms for estimating affine motion from video image sequences. Our methods utilize properties of the Radon transform to estimate image motion in a multiscale framework to achieve very accurate results. We develop statistical and computational models that motivate the use of such methods, and demonstrate that it is possible to improve the computational burden of motion estimation by more than an order of magnitude, while maintaining the degree of accuracy afforded by the more direct, and less efficient, 2-D methods.
Safe System Level Diagnosis
Authors: N. H. Vaidya, D. K. Pradham
Venue: IEEE Transactions on Computers (1994)

A new approach called safe system level diagnosis is proposed. With this approach, in the event of a small number of faults, all the faulty nodes can be identified; also, in the event of a large number of faults, the fault condition can be detected. Systems which achieve a specified level of safe diagnosis are characterized and a diagnosis algorithm for such systems is presented. Also, an application of safe diagnosis to adaptive diagnosis on arbitrary t-diagnosable graphs is discussed.
The Asymptotic Behavior for the Streaming Operator in Slab Geometry
Authors: M. Boulanouar
Venue: Journal of Dynamical and Control Systems (2003)

In this paper, we complete &ldquo;Generation theorem for the streaming operator in slab geometry,&rdquo; where we have proved that the one-dimensional streaming operator in slab domain, with general boundary conditions described by a linear operator K, generates a strongly continuous semigroup. Here, under the positivity and irreducibility of the boundary operator K, we prove the positivity and the irreducibility of the generated semigroup. We also study the spectral properties of the streaming operator and characterize its spectral bound. Under the compactness of the boundary operator K, we determine the essential type of the generated semigroup and find its behavior asymptotic in the operator norm topology.
E-Process Design and Assurance Using Model Checking
Authors: Wenli Wang, Zoltán Hidvégi, Andrew D. Bailey, Andrew B. Whinston
Venue: Computer (2000)

Trust in e-commerce is difficult to establish and maintain. Almost daily, news headlines cover some incident, causing users to question e-commerce systems' trustworthiness. Strong e-process design and implementation is the first line of defense against errors, fraud, and hacking. Minimizing program faults in business operations is critical for an e-business's survival. Carefully designed and implemented code can handle most expected situations, so these e-processes often function well within their defined boundaries. But guaranteeing correct processing under all circumstances is extremely difficult, if not impossible. Hidden flaws and errors, triggered only under unexpected, hard-to-anticipate scenarios, lead to subtle mistakes and even catastrophic failures. The authors use an online ticket sales example to illustrate the potential of model checking (an advanced formal method) for economically finding certain flaws. Model checking is a powerful verification method that determines whether a system model satisfies certain specifications under all circumstances. It can locate subtle but critical flaws that conventional design and assurance methods, such as testing and simulation, often miss.
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
Authors: Ming-Ling Lo, Chinya V. Ravishankar
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets of spatial joins may not all have precomputed indices, particularly when they are dynamically generated by other selection or join operations. Also, existing spatial indices are mostly designed for spatial selections, and are not always efficient for joins. This paper explores the design and implementation of seeded trees [1], which are effective for spatial joins and efficient to construct at join time. Seeded trees are R-tree-like structures, but divided into seed levels and grown levels. This structure facilitates using information regarding the join to accelerate the join process, and allows efficient buffer management. In addition to the basic structure and behavior of seeded trees, we present techniques for efficient seeded tree construction, a new buffer management strategy to lower I/O costs, and theoretical analysis for choosing algorithmic parameters. We also present methods for reducing space requirements and improving the stability of seeded tree performance with no additional I/O costs. Our performance studies show that the seeded tree method outperforms other tree-based methods by far both in terms of the number disk pages accessed and weighted I/O costs. Further, its performance gain is stable across different input data, and its incurred CPU penalties are also lower.
Indexing and Retrieval for Genomic Databases
Authors: H. E. Williams, Justin Zobel
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Genomic sequence databases are widely used by molecular biologists for homology searching. Amino acid and nucleotide databases are increasing in size exponentially, and mean sequence lengths are also increasing. In searching such databases, it is desirable to use heuristics to perform computationally intensive local alignments on selected sequences and to reduce the costs of the alignments that are attempted. We present an index-based approach for both selecting sequences that display broad similarity to a query and for fast local alignment. We show experimentally that the indexed approach results in significant savings in computationally intensive local alignments and that index-based searching is as accurate as existing exhaustive search schemes.
Conceptual Data Modeling of Expert Systems
Authors: James P. Held, John V. Carlis
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

Database management system (DBMS) support for expert system knowledge bases requires data-modeling tools matching system needs. To assess its power and fit for this application, the authors applied their logical data structures data-modeling tool, LDS, to an existing rule-based expert system, Galen, and produced a clear logical schema, comprehensible by its producers and other audiences. They believe that this technique could help the design of novel systems and that its use on existing systems will facilitate DBMS support.
BM3D: motion estimation in time dependent volume data
Authors: Wim de Leeuw, Robert van Liere
Venue: Proceedings of the conference on Visualization '02 (2002)

This paper describes BM3D: a method for the analysis of motion in time dependent volume data. From a sequence of volume data sets a sequence of vector data sets representing the movement of the data is computed. A block matching technique is used for the reconstruction of data movement. The derived vector field can be used for the visualization of time dependent volume data. The method is illustrated in two applications.