A new neural network-based fault classification strategy for hard multiple faults in analog circuits is proposed. The magnitude of the harmonics of the Fourier components of the circuit response at different test node...
详细信息
A new neural network-based fault classification strategy for hard multiple faults in analog circuits is proposed. The magnitude of the harmonics of the Fourier components of the circuit response at different test nodes due to a sinusoidal input signal are first measured or simulated. A selection criterion for determining the best components that describe the circuit behaviour under fault-free (nominal) and fault situations is presented. An algorithm that estimates the overlap between different faults in the measurement space is also introduced. The learning vector quantization neural network is then effectively trained to classify circuit faults. Performance measures reveal very high classification accuracy in both training and testing stages. Two different examples, which demonstrate the proposed strategy, are described.
The usual models of the chemostat assume that the competition is purely exploitative, the competition is only through the consumption of the nutrient. However, it is known that microorganisms can produce toxins agains...
详细信息
The usual models of the chemostat assume that the competition is purely exploitative, the competition is only through the consumption of the nutrient. However, it is known that microorganisms can produce toxins against its competitors. The basic experiments are due to Chao and Levin. In this work, we consider a model of competition in the chemostat of two competitors for a single nutrient where one of the competitors can produce a toxin against its opponent at some cost to its reproductive abilities. We give a complete characterization of the outcome of this competition in terms of the relevant parameters in hyperbolic cases. In three of four cases, the asymptotic results are global.
We present a distributed algorithm for rerouting to accommodate unlimited movement of mobile hosts in a mobile-mobile connection. The algorithm is source initiated-that is the source base station is responsible for th...
详细信息
We present a distributed algorithm for rerouting to accommodate unlimited movement of mobile hosts in a mobile-mobile connection. The algorithm is source initiated-that is the source base station is responsible for the rerouting. The algorithm ensures that the establishment of non-optimal and incorrect paths is avoided and that no packets in the session are lost as there is always a path between the base stations in charge of the source and the destination. The design of this distributed algorithm ensures that the processing at the mobile hosts is kept to a minimum. In addition, the proposed framework for rerouting in mobile-mobile communications is independent of the type of rerouting scheme.
During the last few years, several methods have been proposed for handling constraints by evolutionary algorithms for parameter optimisation problems. These methods include those based on penalty functions, preservati...
详细信息
During the last few years, several methods have been proposed for handling constraints by evolutionary algorithms for parameter optimisation problems. These methods include those based on penalty functions, preservation of feasibility, decoders and repair algorithms, as well as some hybrid techniques. Most of these techniques have serious drawbacks (some of them may return infeasible solutions, others require many additional parameters, etc.). Moreover, none of these techniques has utilized knowledge about which constraints are satisfied and which are not. In this paper, we introduce a new element to evolutionary algorithms for constrained parameter optimization problems: the parent matching mechanism. The preliminary results show that the proposed technique works very well on selected test cases.
This article discusses the complexities of real-world planning and how to create planning systems to address them. IMACS, an automated designer's aid, evaluates machined parts and suggests design modifications to ...
详细信息
This article discusses the complexities of real-world planning and how to create planning systems to address them. IMACS, an automated designer's aid, evaluates machined parts and suggests design modifications to improve their manufacturability, offering advantages over planning techniques used in classical planning systems. IEEE intelligent systems.
We study a semi-random graph model for finding independent sets. For /spl alpha/>0, an n-vertex graph with an independent set S of site /spl alpha/n is constructed by blending random and adversarial decisions. Rand...
详细信息
We study a semi-random graph model for finding independent sets. For /spl alpha/>0, an n-vertex graph with an independent set S of site /spl alpha/n is constructed by blending random and adversarial decisions. Randomly and independently with probability p, each pair of vertices, such that one is in S and the other is not, is connected by an edge. An adversary can then add edges arbitrarily (provided that S remains an independent set). The smaller p is, the larger the control the adversary has over the semi-random graph. We design heuristics that with high probability recover S when p>(1+/spl epsiv/)ln n/|S|, for any constant /spl epsiv/>0. We show that when p
We introduce a method for unsupervised clustering of images of 3D objects. Our method examines the space of all images and partitions the images into sets that form smooth and parallel surfaces in this space. It furth...
详细信息
We introduce a method for unsupervised clustering of images of 3D objects. Our method examines the space of all images and partitions the images into sets that form smooth and parallel surfaces in this space. It further uses sequences of images to obtain more reliable clustering. Finally, since our method relies on a non-Euclidean similarity measure we introduce algebraic techniques for estimating local properties of these surfaces without first embedding the images in a Euclidean space. We demonstrate our method by applying it to a large database of images.
For a graph G, let alpha(G) denote the size of the largest independent set in G, and let theta(G) denote the Lovasz theta-function on G. We prove that for some c > 0, there exists an infinite family of graphs such ...
详细信息
For a graph G, let alpha(G) denote the size of the largest independent set in G, and let theta(G) denote the Lovasz theta-function on G. We prove that for some c > 0, there exists an infinite family of graphs such that theta(G) > alpha(G)n/2(c root log n), where n denotes the number of vertices in a graph. This disproves a known conjecture regarding the theta function. As part of our proof, we analyse the behavior of the chromatic number in graphs under a randomized version of graph products. This analysis extends earlier work of Linial and Vazirani, and of Berman and Schnitger, and may be of independent interest.
In this paper a heuristic approach is taken to the investigation of density effects in population growth when the limiting factor is food resources. Explicit modeling of resource dynamics lets us to distinguish betwee...
详细信息
In this paper a heuristic approach is taken to the investigation of density effects in population growth when the limiting factor is food resources. Explicit modeling of resource dynamics lets us to distinguish between density effects that are due to the diminution of the available resources, from density effects arising from direct interference among individuals. While species specific growth dynamics should vary extensively, it is possible to postulate some properties of, hopefully, general applicability. This work examines the consequences of three postulates: (a) no growth occurs in the absence of resources;(b) the per capita growth rate increases with available resources;and (c) intraspecies interference competition causes the per capita growth rate to decrease as population density increases. Using these three postulates. I have constructed generalized functional description for each type of density dependence. These functions let us examine interspecies competition in class specific terms. The results indicate that intraspecies interference confers significant advantages in interspecies competition for long term occupation of ecological niches. Copyright (C) 1997 Elsevier science Ireland Ltd.
暂无评论