This paper proposed an edge detection scheme which is deduced from Fresnel diffraction. Analysis in this paper shows that Fresnel convolution kernel function performs well on edge enhancement when images are transformed into complex functions. Due to its mathematical complexity, the method is simplified into a linear convolution filter. The new edge detector is designed based on the simplified ...

Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...

 Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...

this paper is a computational study of the behavior of aerodynamics  characteristics of an airfoil with blunt trailing edge and  studies the effects aerodynamic performance caused by modifications made to the trailing edge. blunt trailing edge airfoils are of interest in the engineering of large wind turbine blades because they allow for a strong structure with a high aerodynamic lift to struct...

the edge tenacity te(g) of a graph g is de ned as:te(g) = min {[|x|+τ(g-x)]/[ω(g-x)-1]|x ⊆ e(g) and ω(g-x) > 1} where the minimum is taken over every edge-cutset x that separates g into ω(g - x) components, and by τ(g - x) we denote the order of a largest component of g. the objective of this paper is to determine this quantity for split graphs. let g = (z; i; e) be a noncomplete connected spli...

By means of ab-initio calculations on the basis of the FPLAPW method, we compared the energy loss near edge structure (ELNES) of carbon K edges in crystalline phenanthrene and its isomer, anthracene. In these two organic compounds, different non-equivalent carbon atoms can result in distinct K edge spectra due to the different carbon-carbon bond lengths, as a characteristic behavior of the mole...

let $g$ be a connected graph of order $3$ or more and $c:e(g)rightarrowmathbb{z}_k$‎ ‎($kge 2$) a $k$-edge coloring of $g$ where adjacent edges may be colored the same‎. ‎the color sum $s(v)$ of a vertex $v$ of $g$ is the sum in $mathbb{z}_k$ of the colors of the edges incident with $v.$ the $k$-edge coloring $c$ is a modular $k$-edge coloring of $g$ if $s(u)ne s(v)$ in $mathbb{z}_k$ for all pa...

In the present work, KTP crystals have been grown by spontaneous nucleation technique in flux medium using K6P4O13 flux. 0.4-1 °C/h cooling rates were applied in the spontaneous nucleation process. The presence and amount of impurities has been determined by using XRF. The optical transmission spectra of impure KTP crystals in the UV–visible region are discussed. The transmission cut-off is cle...

in this paper, at first we mention to some results related to pi and vertex co-pi indices and then we introduce the edge versions of co-pi indices. then, we obtain some properties about these new indices.

for two normal edge-transitive cayley graphs on groups h and k which have no common direct factor and gcd(jh=h ′j; jz(k)j) = 1 = gcd(jk=k ′j; jz(h)j), we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.