This paper presents a robust image feature that can be used to automatically establish match correspondences between aerial images of suburban areas with large view variations. Unlike most commonly used invariant image features, this feature is view variant. The geometrical structure of the feature allows predicting its visual appearance according to the observer’s view. This feature is named 2...

â â â  â â  â  abstract â  this paper examines the two most important current efforts to devise new rules binding all nations the negotiations in the wto of trade rules and the negotiations under the un framework convention on climate change to devise rules restricting the annual emissions of greenhouse gases. both negotiations have failed after several years of intensive effort. there are rema...

introduction:  clinical settings and teaching methods play a key role in students' learning. so, the present study aimed to investigates the effect of holding special training rounds on performance of pediatric residents. methods: this quasi-experimental study was conducted on 30 residents. they were randomly divided into two case (n=15) and control (n=15) groups. two groups received prete...

It is easy to characterize graphs with no Kk-minors for any integer k ≤ 4, as follows. For k = 1, 2, the problem must be trivial, and for k = 3, 4, those graphs are forests and series-parallel graphs (i.e., graphs obtained from K3 by a sequence of replacing a vertex of degree 2 with a pair of parallel edges, or its inverse operation.) Moreover, Wagner formulated a fundamental characterization o...

Let G be a simple (i.e., no loops and no multiple edges) graph. We investigate the question of how to modify G combinatorially to obtain a sequentially CohenMacaulay graph. We focus on modifications given by adding configurations of whiskers to G, where to add a whisker one adds a new vertex and an edge connecting this vertex to an existing vertex in G. We give various sufficient conditions and...

Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels of the original graph. We pose the question for which graphs this polynomial is a non-negative resp. a sum of squares. This problem is motivated by a recent...

First, a new proof for the existence of an α-labeling of the quadratic graph Q(3, 4k) is presented. Then the existence of α-labelings of special classes of quadratic graphs with some isomorphic components is shown. 1. Introduction. In this paper, all graphs are finite without loops or multiple edges, and all parameters are positive integers. The symbols |A|, P n , and C n denote the cardi-nalit...

the padmakar-ivan (pi) index is a first-generation topological index (ti) based on sums overall edges between numbers of edges closer to one endpoint and numbers of edges closer to theother endpoint. edges at equal distances from the two endpoints are ignored. an analogousdefinition is valid for the wiener index w, with the difference that sums are replaced byproducts. a few other tis are discu...