The building edge detection plays a key role during building extraction, which is important and necessary for building description. The edges detected from aerial images have high horizontal accuracy and represent various edge shapes well. But the edge detection in images is often influenced by contrast, illumination and occlusion. LIDAR data are suitable for judging building regions, but miss ...

although host species generally face increased risk of brood parasitism in fragmented temperate landscapes and forest edge, little information exists to assess such risks in tropical birds. we studied how cuculidae species populations, host species population, and micro-environmental variables changed along an edge-to-interior gradient in peninsular malaysia. bird observations and environmental...

Given a graph G = (V, E) with a length function on edges and a subset R of V , the full Steiner tree is defined to be a Steiner tree in G with all the vertices of R as its leaves. Then the full Steiner tree problem is to find a full Steiner tree in G with minimum length, and the bottleneck full Steiner tree problem is to find a full Steiner tree T in G such that the length of the largest edge i...

 Abstract: This paper presents the results of an experimental examination of the effect of non-uniform wall temperature on local heat transfer coefficient in a rotating smooth-walled square channel. Three different thermal boundary situations were investigated: (a) even and odd (four) wall uniform temperature, (b) even and odd (four) wall uniform heat flux, and (c) even (leading and trailing) w...

This article focuses on the derivation of simplified predictive models for identification overall compressive stiffness and strength corrugated cardboards. As a representative example an unsymmetrical 5-ply sample (with E B flute) was used in this study. In order to exclude unreliable displacement measurement standard edge crush test, virtual strain gauges were used. Video extensometry employed...

The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...

‎For a coloring $c$ of a graph $G$‎, ‎the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively‎ ‎$sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$‎, ‎where the summations are taken over all edges $abin E(G)$‎. ‎The edge-difference chromatic sum‎, ‎denoted by $sum D(G)$‎, ‎and the edge-sum chromatic sum‎, ‎denoted by $sum S(G)$‎, ‎a...