For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

Leading edge serration is now a well-established and effective passive control device for the reduction of turbulence–leading edge interaction noise, and for the suppression of boundary layer separation at high angle of attack. It is envisaged that leading edge blowing could produce the same mechanisms as those produced by a serrated leading edge to enhance the aeroacoustics and aerodynamic performances of aerofoil. Aeroacoustically, injection of mass airflow from the leading edge (against the incoming turbulent flow) can be an effective mechanism to decrease the turbulence intensity, and/or alter the stagnation point. According to classical theory on the aerofoil leading edge noise, there is a potential for the leading edge blowi

    The aim of our work is to develop a new type of games which are related to (D, WD, LD) compactness of topological groups. We used an infinite game that corresponds to our work. Also, we used an alternating game in which the response of the second player depends on the choice of the first one. Many results of winning and losing strategies have been studied, consistent with the nature of the topological groups. As well as, we presented some topological groups, which fail to have winning strategies and we give some illustrated examples. Finally, the effect of functions on the aforementioned compactness strategies was studied.  

The chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.

The mean age of AS patients was (35.0 ± 9.8) years.When the patients and control subjects were divided into different age groups (>40, 30-40, <30 years), the differences were not significantin terms of disease prevalence. The results also showed that the percentage of male patients is higher than that of females. There was no significant difference (P?0.05) between patients and controls in the distribution of males and females.Most of the patients had the disease for a period of 5 years or higher, with a disease severity of ? 2.1 and functional disability degree of I, II. The resultsshoweddifferent patterns of distribution for the three tested cytokines. A significant increase in the level of TNF-?, anon-significantincrease i

With the advancement of modern radiotherapy technology, radiation dose and dose distribution have significantly improved. as part of Natural development, interest has recently been renewed by treatment, especially in the use of heavy charged particles, because these radiation types serve theoretical advantages in all biological and physical aspects. The interactions of alpha particle with matter were studied and the stopping powers of alpha particle with Bone Tissue were calculated by using Zeigler’s formula and SRIM software, also the Range for this particle were calculated by using Mat lab language for (0.01-1000) MeV alpha energy.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

In this research, an analysis for the standard Hueckel edge detection algorithm behaviour by using three dimensional representations for the edge goodness criterion is presents after applying it on a real high texture satellite image, where the edge goodness criterion is analysis statistically. The Hueckel edge detection algorithm showed a forward exponential relationship between the execution time with the used disk radius. Hueckel restrictions that mentioned in his papers are adopted in this research. A discussion for the resultant edge shape and malformation is presented, since this is the first practical study of applying Hueckel edge detection algorithm on a real high texture image containing ramp edges (satellite image).

 An edge dominating set    of a graph  is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number  is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G.  The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin