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...

Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree  and its in-degree . Now let D be a digraph with minimum degree  and edge-connectivity If  is real number, then the zeroth-order general Randic index is defined by   .  A digraph is maximally edge-connected if . In this paper we present sufficient condi...

Edge detection plays an important role in computer vision to extract object boundary. Multiscale edge method provides a variety of image features by different resolution at multiscale edges. The extracts coarse and fine structure edges simultaneously image. Due this, the enables more reliable are detected. Most methods not translation invariant due decimated process. They mostly depend on corre...

an injective map f : e(g) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph g(p, q) if the induced vertex function f*: v (g) → z − {0} defined by f*(v) = (sigma e∈ev) f (e) is one-one, where ev denotes the set of edges in g that are incident with a vetex v and f*(v (g)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} u {k(p+1)/2} accordin...

Let D be an edge-coloured digraph, V (D) will denote the set of vertices of D; a set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the following two conditions: For every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; for every vertex x ∈ V (D) − N there is a vertex y ∈ N such that there is an xy -monochromatic direct...

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

lineaments are the most important phenomena of geological exploration of hydrocarbon reservoirs . concepts in order to map the contours of land need so much time and money. one of the most famous methods in lineaments extraction is satellite image processing. in this paper, an overview of lineament extraction methods and a new method based on canny edge detection algorithm is raised. the result...

Adaptive morphing trailing edge wings have the potential to reduce the fuel burn of transport aircraft. In this paper, we quantify the aerodynamic performance benefits of a morphing trailing using aerodynamic design optimization. The aerodynamic model solves the Reynolds-averaged Navier– Stokes equations with a Spalart–Allmaras turbulence model. A gradient-based optimization algorithm is used i...

We have found a new configurational effect in texture segmentation. In addition to collinear facilitation at the edge, this effect results from contextual modulation within the texture-region, i.e. from texels not abutting the segmented edge. The largest facilitation was found when two conditions were fulfilled: (i) elements along the edge were parallel to the edge and collinear, (ii) elements ...

‎let $g$ be a graph and $chi^{prime}_{aa}(g)$ denotes the minimum number of colors required for an‎ ‎acyclic edge coloring of $g$ in which no two adjacent vertices are incident to edges colored with the same set of colors‎. ‎we prove a general bound for $chi^{prime}_{aa}(gsquare h)$ for any two graphs $g$ and $h$‎. ‎we also determine‎ ‎exact value of this parameter for the cartesian product of ...