ppxscal/embedding_network huggingface dataset:
Keyword Spotting in Poorly Printed Documents using Pseudo 2-D Hidden Markov Models
Authors: S. S. Kuo, O. E. Agazzi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

An algorithm for robust machine recognition of keywords embedded in a poorly printed document is presented. For each keyword, two statistical models, called pseudo 2-D hidden Markov models, are created for representing the actual keyword and all the other extraneous words, respectively. Dynamic programming is then used for matching an unknown input word with the two models and for making a maximum likelihood decision. Although the models are pseudo 2-D in the sense that they are not fully connected 2-D networks, they are shown to be general enough in characterizing printed words efficiently. These models facilitate a nice "elastic matching" property in both horizontal and vertical directions, which makes the recognizer not only independent of size and slant but also tolerant of highly deformed and noisy words. The system is evaluated on a synthetically created database that contains about 26000 words. Currently, the authors achieve a recognition accuracy of 99% when words in testing and training sets are of the same font size, and 96% when they are in different sizes. In the latter case, the conventional 1-D HMM achieves only a 70% accuracy rate.
The Courtship Dance of Bulldogs and Turtles
Authors: Michael B. Spring
Venue: Computer (2001)

The working group's chair is key to defining a standard and producing it rapidly and efficiently.
Fault Diagnosis of Nonlinear Analog Circuits Using Neural Networks with Wavelet and Fourier Transforms as Preprocessors
Authors: Farzan Aminian, Mehran Aminian
Venue: Journal of Electronic Testing: Theory and Applications (2001)

A neural-network based analog fault diagnostic system is developed for nonlinear circuits. This system uses wavelet and Fourier transforms, normalization and principal component analysis as preprocessors to extract an optimal number of features from the circuit node voltages. These features are then used to train a neural network to diagnose soft and hard faulty components in nonlinear circuits. Our neural network architecture has as many outputs as there are fault classes where these outputs estimate the probabilities that input features belong to different fault classes. Application of this system to two sample circuits using SPICE simulations shows its capability to correctly classify soft and hard faulty components in 95% of the test data. The accuracy of our proposed system on test data to diagnose a circuit as faulty or fault-free, without identifying the fault classes, is 99%. Because of poor diagnostic accuracy of backpropagation neural networks reported in the literature (Yu et al., Electron. Lett., Vol. 30, 1994), it has been suggested that such an architecture is not suitable for analog fault diagnosis (Yang et al., IEEE Trans. on CAD, Vol. 19, 2000). The results of the work presented here clearly do not support this claim and indicate this architecture can provide a robust fault diagnostic system.
A finite basis characterization of &#x03B1;-split colorings
Authors: Andras Gyarfas, Andre E. Kezdy, Jeno Lehel
Venue: Discrete Mathematics (2002)

Fix t > 1, a positive integer, and a= (a1,..., at) a vector of nonnegative integers. A t-coloring of the edges of a complete graph is called a-split if there exists a partition of the vertices into t sets V1,..., Vt such that every set of ai + 1 vertices in Vi contains an edge of color i, for i =1,...,t. We combine a theorem of Deza with Ramsey's theorem to prove that, for any fixed a, the family of a-split colorings is characterized by a finite list of forbidden induced subcolorings. A similar hypergraph version follows from our proofs. These results generalize previous work by Kézdy et al. (J. Combin. Theory Ser. A 73(2) (1996) 353) and Gyárfás (J. Combin. Theory Ser. A 81(2) (1998) 255). We also consider other notions of splitting.
Noncontact Testing of Circuits Via a Laser-Induced Plasma Electrical Pathway
Authors: Don L. Millard, Karl R. Umstadter, Robert C. Block
Venue: IEEE Design Test (1992)

Systems using the three most popular probes applied to functional electrical testing, mechanical, electron beam, and laser, are reviewed. A system of noncontact testing that uses a laser-induced plasma 'switch' to provide the electrical pathway for AD and DC measurements on printed wiring boards is presented. With this technique, a DC resistance discrimination of less than 10 Omega and distortion-free AC measurements of a 2.5-MHz oscillator signal were achieved. These results are presented and evaluated.
A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions
Authors: Calvin R. Maurer,  Jr., Rensheng Qi, Vijay Raghavan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in time linear in the total number of voxels N. The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for computing the DT for a wide class of distance functions, including the L_p and chamfer metrics. At each dimension level, the DT is computed by constructing the intersection of the Voronoi diagram whose sites are the feature voxels with each row of the image. This construction is performed efficiently by using the DT in the next lower dimension. The correctness and linear time complexity are demonstrated analytically and verified experimentally. The algorithm may be of practical value since it is relatively simple and easy to implement and it is relatively fast (not only does it run in O(N) time but the time constant is small). A simple modification of the algorithm computes the weighted Euclidean DT, which is useful for images with anisotropic voxel dimensions. A parallel version of the algorithm runs in O(N/p) time with p processors.
Postsilicon Validation Methodology for Microprocessors
Authors: Hemant Rotithor
Venue: IEEE Design Test (2000)

This paper presents a systematic methodology for microarchitecture focused postsilicon system validation in the context of IA-32 Intel microprocessors. The need for a rigorous microarchitecture focused postsilicon validation is first established after analyzing presilicon and postsilicon validation techniques that CPU manufacturers have primarily used. The proposed methodology targets microarchitectural attributes that are prioritized based on their criticality for validation to identify corner cases. Several test templates cover all the critical attributes. Each template has an algorithm covering a subset of the attributes and automatically generates many tests by parameterizing around the corner case. Examples of application of the methodology are presented. Tests based on prioritized attributes help in narrowing the search of the huge validation space for complex logic-interaction type bugs in the early phase of silicon validation. The important issues in design and deployment of such tests are described and our solutions are discussed.
A dualization of the class of transcendental numbers
Authors: Andrei Vernescu
Venue: Octogon Mathematical Magazine (2001)

In this paper we show how for every transcendental (over Q) real number, bigger than 1 and not equal to e, we can associate to it in a nonbanal way a new unique transcendental number, using the equation xy = yx (x,y ∈ R, 0 < x < y), the two numbers being separated by the number e; we name this associating process dualization. We continue by defining a general method of dualization, starting from an equation of the form F(x, y) = 0, in certain natural conditions. We describe a new countable class of transcendental numbers and also a class of algebraic numbers and we state some of their properties. An addenda regarding the mentioned equation closes the paper.
A quartic nonlinear optimization method
Authors: N. Prabhu, W. He
Venue: Neural, Parallel Scientific Computations (2002)

In this paper we present a new algorithm - called the quartic method - for one-dimensional optimization. The quartic method is the third and final member of a family of algorithms called the Taylor Approximation Methods which includes Newton's method and Euler's method. Like its two distinguished relatives, the new method is also expected to be very efficient in practice. We present preliminary numerical results comparing the quartic method with both Newton's method and other fourth order algorithms. The numerical results suggest that the new method is significantly faster than Newton's method (and other fourth order algorithms) both in terms of the number of iterations and the actual running time. Theoretical considerations and preliminary numerical results suggest that the quartic method could emerge as a serious candidate for practical use in the future.
Trends in Databases: Reasoning and Mining
Authors: Jef Wijsen
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

We propose a temporal dependency, called trend dependency (TD), which captures a significant family of data evolution regularities. An example of such regularity is ¿Salaries of employees generally do not decrease.¿ TDs compare attributes over time using operators of $\{,\leq,\geq,\ne\}$. We define a satisfiability problem that is the dual of the logical implication problem for TDs and we investigate the computational complexity of both problems. As TDs allow expressing meaningful trends, ¿mining¿ them from existing databases is interesting. For the purpose of TD mining, TD satisfaction is characterized by support and confidence measures. We study the problem $\rm TDMINE$: given a temporal database, mine the TDs that conform to a given template and whose support and confidence exceed certain threshold values. The complexity of $\rm TDMINE$ is studied, as well as algorithms to solve the problem.
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group
Authors: Z. Miller, D. Pritikin, I. H. Sudborough
Venue: IEEE Transactions on Computers (1994)

Simulations of hypercube networks by certain Cayley graphs on the symmetric group are investigated. Let Q(k) be the familiar k-dimensional hypercube, and let S(n) be the star network of dimension n defined as follows. The vertices of S(n) are the elements of the symmetric group of degree n, two vertices x and y being adjacent if xo(1,i)=y for some i. That is, xy is an edge if x and y are related by a transposition involving some fixed symbol (which we take to be /spl I.bold/1). This network has nice symmetry properties, and its degree and diameter are sublogarithmic as functions of the number of vertices, making it compare favorably with the hypercube network. These advantages of S(n) motivate the study of how well it can simulate other parallel computation networks, in particular, the hypercube. The first step in such a simulation is the construction of a one-to-one map f:Q(k)/spl rarr/S(n) of dilation d, for d small. That is, one wants a map f such that images of adjacent points are at most distance d apart in S(n). An alternative approach, best applicable when one-to-one maps are difficult or impossible to find, is the construction of a one-to-many map g of dilation d, defined as follows. For each point x/spl isin/Q(k), there is an associated subset g(x)/spl sube/V(S(n)) such that for each edge xy in Q(k), every x'/spl isin/g(x) is at most distance d in S(n) from some y'/spl isin/g(y). Such one-to-many maps allow one to achieve the low interprocessor communication time desired in the usual one-to-one embedding underlying a simulation. This is done by capturing the local structure of Q(k) inside of S(n) (via the one-to-many embedding) when the global structure cannot be so captured. Our results are the following. 1) There exist the following one-to-many embeddings: a) f:Q(k)/spl rarr/S(3k+1) with dilation (f)=1; b) f:Q(11k+2)/spl rarr/S(13k+2) with dilation (f)=2. 2) There exists a one-to-one embedding f:Q(n2/sup n/spl minus/1/)/spl rarr/S(2/sup n/) with dilation (f)=3.
A charaterization of reguli in PG(3,K) and PG(5,K)
Authors: Vito Napolitano
Venue: Discrete Mathematics (2002)

In this note, a regulus of lines in PG(3,K) and a regulus of planes in PG(5,K) are characterized by incidence properties.
Dynamic shadow removal from front projection displays
Authors: Christopher Jaynes, Stephen Webb, R. Matt Steele, Michael Brown, W. Brent Seales
Venue: Proceedings of the conference on Visualization '01 (2001)

Front-projection display environments suffer from a fundamental problem: users and other objects in the environment can easily and inadvertently block projectors, creating shadows on the displayed image. We introduce a technique that detects and corrects transient shadows in a multi-projector display. Our approach is to minimize the difference between predicted (generated) and observed (camera) images by continuous modification of the projected image values for each display device. We are unaware of any other technique that directly addresses this problem. Furthermore, we speculate that the general predictive monitoring framework introduced here is capable of addressing more general radiometric consistency problems such as display-surface inter-reflections and the changes in display color and intensity due to projector bulb temperature variation.Using an automatically-derived relative position of cameras and projectors in the display environment and a straightforward color correction scheme, the system renders an expected image for each camera location. Cameras observe the displayed image, which is compared with the expected image to detect shadowed regions. These regions are transformed to the appropriate projector frames, where corresponding pixel values are increased. In display regions where more than one projector contributes to the image, shadow regions are eliminated. We demonstrate an implementation of the technique to remove shadows in a multi-projector front projection system.
Blind multiuser separation of instantaneous mixture algorithm based on geometrical concepts
Authors: A. Mansour, N. Ohnishi, C. G. Puntonet
Venue: Signal Processing (2002)

In this paper, we propose a new and simple algorithm for blind separation of sources based on geometrical concepts. This algorithm deals with the instantaneous mixtures and does not require the estimation of high-order statistics (HOS). The proposed algorithm can separate sources that belong to two different categories: (1) Signals with uniform or close to uniform probability density function (PDF). (2) Unimodal PDF (including Pascal and Gamma) as well as some real signals such as speech or music. Unfortunately, the actual version of the algorithm cannot deal with the mixing of signals from both categories. Finally, the experimental results show good performances and that the separation can be carried out in a very short time (a few seconds, using Matematica as the programming language and our ultra 30 Sun station).
Tunnelling between edge channels in the quantum hall regime manipulated with a scanning force microscope
Authors: T. Ihn, J. Rychen, K. Ensslin, W. Wegscheider, M. Bichler
Venue: Microelectronic Engineering (2002)

The tunnelling conductance between edge channels in the quantum Hall regime was measured. The tunnelling coupling is locally enhanced by a local repulsive potential induced by the conducting tip of a scanning force microscope. This allows mapping the enhanced tunnelling coupling along the sample edge and, in this sense, visualizes the presence of edge channels.
Pseudocomplements of closure operators on posets
Authors: Francesco Ranzato
Venue: Discrete Mathematics (2002)

Some recent results provide sufficient conditions for complete lattices of closure operators on complete lattices, ordered pointwise, to be pseudocomplemented. This paper gives results of pseudocomplementation in the more general setting of closure operators on mere posets. The following result is first proved: closure operators on a meet-continuous meet-semilattice form a pseudocomplemented complete lattice. Furthermore, the following orthogonal result (actually, a slightly more general result) is proved: Closure operators on a directed-complete poset which is transfinitely generated by maximal lower bounds from its set of completely meet-irreducible elements-any poset satisfying the ascending chain condition belongs to this class-form a pseudocomplemented complete lattice.
A Model-Fitting Approach to Cluster Validation with Application to Stochastic Model-Based Image Segmentation
Authors: J. Zhang, J. W. Modestino
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A clustering scheme is used for model parameter estimation. Most of the existing clustering procedures require prior knowledge of the number of classes, which is often, as in unsupervised image segmentation, unavailable and must be estimated. This problem is known as the cluster validation problem. For unsupervised image segmentation the solution of this problem directly affects the quality of the segmentation. A model-fitting approach to the cluster validation problem based on Akaike's information criterion is proposed, and its efficacy and robustness are demonstrated through experimental results for synthetic mixture data and image data.
Transaction Repair for Integrity Enforcement
Authors: L. V. Orman
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

A transaction repair system detects erroneous transactions as they update the database, and for each erroneous transaction, it finds the necessary and sufficient changes to the transaction that would repair it. Detection and repair are the two essential components of semantic integrity maintenance since detection alone would leave the user with the difficult responsibility of manually correcting and reentering an erroneous transaction. Both detection and repair rely on incremental integrity maintenance techniques. The detection process takes advantage of the integrity of the database before the transaction, and detects only the new errors introduced by the transaction. The repair process takes advantage of the integrity before the transaction and integrity violation after the transaction but before the repair. Such a two-step incremental analysis produces the minimal repair necessary and sufficient to correct the transaction. All necessary and sufficient repairs are generated, for all first order constraints, and by using only substitution with no resolution search. Multiple constraints are repaired in parallel, with no sequencing of constraints, and no possibility of cycles. Extensions to recursive constraints and nondeterministic transactions are provided.
Observations on Using Genetic-Algorithms for Channel Allocation in Mobile Computing
Authors: Albert Y. Zomaya, Michael Wright
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

This paper highlights the potential of using genetic algorithms to solve cellular resource allocation problems. Generally, cellular resource allocation deals with how and when to allocate radio frequency channels to mobile hosts. The objective in this work is to gauge how well a GA-based channel borrower performs when compared to a greedy borrowing heuristic. This is needed to establish how suited GA-like (stochastic search) algorithms are for the solution of optimization problems in mobile computing environments. This involves the creation of a simple mobile networking resource environment and design of a GA-based channel borrower that works within this environment. A simulation environment is also built to compare the performance of the GA-based channel-borrowing method with the heuristic. To enhance the performance of the GA, extra attention is paid to developing an improved mutation operator. The performance of the new operator is evaluated against the heuristic borrowing scheme. For a real-time implementation, the GA needs to have the properties of a micro GA strategy. This involves making improvements to the crossover operator and evaluation procedure so the GA can converge to a ¿good¿ solution rapidly.
Bayesian Image Restoration: An Application to Edge-Preserving Surface Recovery
Authors: W. Qian, D. M. Titterington
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Bayesian methods for recovering a 2-D surface are discussed. It is assumed that there is a textural image that can be modeled by a Markov random field and that the original surface is composed of different surfaces, each of which is associated with one textural state. Both parametric and nonparametric methods are used to enforce smoothness of these surfaces. Iterative procedures are examined for simultaneous restoration of the textural image and estimation of underlying parameters. From the estimated textural image and the estimated parameters, an estimate for the original surface is obtained. Two illustrative examples are presented.
Virtual galleries: is 3D better?
Authors: Zayd Hendricks, Jakkaphan Tangkuampien, Katherine Malan
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

Online virtual galleries have been available since the inception of the World Wide Web, mostly in two-dimensional format. More recently, advances in technology have given rise to three-dimensional virtual galleries. There have been relatively few comparative studies done on the effectiveness of two- and three-dimensional environments as hosts for virtual galleries. We have undertaken a comparative study in order to assess the differences between the two types of environments, looking particularly at recreational and educational value to novice users. Navigation is a problem largely associated with three-dimensional environments for novice users. Our study also looked at whether the level of navigational aid in a three-dimensional environment would affect these two factors. Templates of African art galleries were designed for our application to generate three virtual galleries: one was two-dimensional and the other two were three-dimensional, with each gallery varying in the level of navigational aid provided. Results of user studies indicate that visitors to the gallery that had a higher level of navigational support were more likely to explore the gallery and enjoyed themselves more than in the other galleries. The two-dimensional gallery was found to be more suitable for educational purposes as visitors tended to read more information about the artwork than in the other three-dimensional galleries.
A Neural Network Implementation of the Moment-Preserving Technique and its Application to Thresholding
Authors: S. -C. Cheng, W. -H. Tsai
Venue: IEEE Transactions on Computers (1993)

A neural-network implementation of the moment-preserving technique, which is widely used for image processing, is proposed. The moment-preserving technique can be thought of as an information transformation method which groups the pixels of an image into classes. The variables in the so-called moment-preserving equations are determined iteratively by a recurrent neural network and a connectionist neural network which work cooperatively. Both of the networks are designed in such a way that the sum of square errors between the moments of the input image and those of the output version is minimized. The proposed neural network system is applied to automatic threshold selection. The experimental results show that the system can threshold images successfully. The performance of the method is compared with those of four other histogram-based multilevel threshold selection methods. The simulation results show that the proposed technique is at least as good as the other methods.