One of the most fundamental features of digital image and the basic steps in image processing, analysis, pattern recognition and computer vision is the edge of an image where the preciseness and reliability of its results will affect directly on the comprehension machine system made objective world. Several edge detectors have been developed in the past decades, although no single edge detector...

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

On the 800th anniversary of the publication of Liber Abaci, I wish to draw the attention of the reader to some of my favorite facts about Fibonacci numbers concerning squares, multiples of squares and powerful numbers amongst the Fibonacci numbers.

One of the locations of renal artery atherosclerosis is at the orifice of the renal artery, therefore thestructure of this orifice was assessed in 6 normal, adult male dogs by light microscopy (LM) andtransmission electron microscopy (TEM). For the LM study, processed tissues were embedded in paraffinand sectioned serially into 6-μm thickness. Sections were stained with orcein. For the TEM stud...

potential field images obtained in potential field data measurements are suitable tools for mineral and hydrocarbons resources explorations. these images consist of different anomalies which in many cases are contaminated with noise. the horizontal location of the boundaries of potential field anomaly sources is of interest in potential field interpretation. however, the edge of potential field...

This note is a sequel to [1] . First let us recall some of the notations . Denote by G(n, in) a graph with n vertices and m edges. Let K d (r,, . . ., rd ) be the complete dpartite graph with r ; vertices in its i-th class and put K,(t) = K d (t, . . ., t), K d = Kd (1) . Given integers n > d(> 2), let in d(n) be the minimal integer with the property that every G(n, in), where an > na d (n), co...