the graphical technique for nonlinear circuits was described that enable us to optimize circuits to obtain maximum output power, maximum efficiency or minimum intermodulation. according to this method a high power amplifier in the ka band was designed. using a nonlinear model of the transistor, optimum slope for load-line was determined so that maximum power at the output was obtainable, then ...

background: radial movement of the arterial wall is a well-known indicator of the mechanical properties of arteries in arterial disease examinations. in the present study, two different motion estimation methods, based on the block-matching and maximum-gradient algorithms, were examined to extract the radial displacement of the carotid artery wall. methods: each program was separately implement...

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

ÐImage matching applications such as tracking and stereo commonly use the sum-of-squared-difference (SSD) measure to determine the best match. However, this measure is sensitive to outliers and is not robust to template variations. Alternative measures have also been proposed that are more robust to these issues. We improve upon these using a probabilistic formulation for image matching in term...

In the research literature, maximum likelihood principles were applied to stereo matching by altering the stereo pair so that the difference would have a Gaussian distribution. Here in this paper we present a novel method of applying maximum likelihood to stereo matching. In our approach, we measure the real noise distribution from a training set, and then construct a new metric which we denote...

Let S = fC 1 ; C 2 ; : : :; C k g be a collection of pairwise disjoint subsets of U = f1; 2; : : :; ng such that S k i=1 C i = U. A partition matching of S consists of two subsets fa 1 ; a 2 ; : : :; a m g and fb 1 ; b 2 ; : : :; b m g of U together with a sequence of distinct partitions of) such that a i is contained in a subset in the collection A i and b i is contained in a subset in the col...

A matching in a graph G is a subset M of the edges of G such that no two share an endpoint. A matching has maximum cardinality if its cardinality is at least as large as that of any other matching. An odd-set cover OSC of a graph G is a labeling of the nodes of G with integers such that every edge of G is either incident to a node labeled 1 or connects two nodes labeled with the same number i ≥...

In image matching applications such as tracking and stereo matching, it is common to use the sum-of-squareddi erences (SSD) measure to determine the best match for an image template. However, this measure is sensitive to outliers and is not robust to template variations. We describe a robust measure and eÆcient search strategy for template matching with a binary or greyscale template using a ma...

Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared differences (SSD), which is valid from a maximum likelihood perspective when the real noise distribution is Gaussian. However, we have found experimentally that the Gaussian noise distribution assumption is often invalid. This im...