The wake potential and wake phenomena for swift proton in an amorphous carbon target were studied by utilising various dielectric function formalisms, including the Drude dielectric function, the Drude–Lorentz dielectric function and quantum dielectric function. The Drude model results exhibited a damped oscillatory behaviour in the longitudinal direction behind the projectile; the pattern of these oscillations decreases exponentially in the transverse direction. In addition, the wake potential extends slightly ahead of the projectile which also depends on the proton coordinate and velocity. The effect of electron binding on the wake potential, characterised by the ratio to 0.1, has been studied alongside the Drude–Lorentz dielectric

A nonlinear filter for smoothing color and gray images
corrupted by Gaussian noise is presented in this paper. The proposed
filter designed to reduce the noise in the R,G, and B bands of the
color images and preserving the edges. This filter applied in order to
prepare images for further processing such as edge detection and
image segmentation.
The results of computer simulations show that the proposed
filter gave satisfactory results when compared with the results of
conventional filters such as Gaussian low pass filter and median filter
by using Cross Correlation Coefficient (ccc) criteria.

Many approaches of different complexity already exist to edge detection in
color images. Nevertheless, the question remains of how different are the results
when employing computational costly techniques instead of simple ones. This
paper presents a comparative study on two approaches to color edge detection to
reduce noise in image. The approaches are based on the Sobel operator and the
Laplace operator. Furthermore, an efficient algorithm for implementing the two
operators is presented. The operators have been applied to real images. The results
are presented in this paper. It is shown that the quality of the results increases by
using second derivative operator (Laplace operator). And noise reduced in a good

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

Abstract:Porous Silicon (PSi) has been produced in this work by using Photochemical (PC) etching process by using a hydrofluoric acid (HF) solution. The irradiation has been achieved using quartz- tungsten halogen lamp. The influence of various irradiation times on the properties of PSi اmaterial such as layer thickness, etching rate and porosity was investigated in this work too. The XRD has been studied to determine the crystal structure and the crystalline size of PSi material

Porous Silicon (PSi) has been produced in this work by using Photochemical (PC) etching process by using a hydrofluoric acid (HF) solution. The irradiation has been achieved using quartz- tungsten halogen lamp. The influence of various irradiation times on the properties of PSi اmaterial such as layer thickness, etching rate and porosity was investigated in this work too.
The XRD has been studied to determine the crystal structure and the crystalline size of PSi material

 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

           In the nineteenth century, a new type of cities appeared, known as new cities located on the edges of major cities, and these cities began to  decentralization, urban studies turned to this type of cities to find out the most important reasons for the emergence of new cities and find out what those cities will become . Therefore, we will discuss in this research how the urban emergence of these cities (edge cities) occurs, so the research formulates its problem : The need to know the stages that edge cities go through, ending with their emergence, and the mechanisms that cities take within their context  ( regeneration or adaptation ), Assuming that edge cities are a

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

    In this paper, we devoted to use circular shape sliding block, in image edge determination. The circular blocks have symmetrical properties in all directions for the mask points around the central mask point. Therefore, the introduced method is efficient to be use in detecting image edges, in all directions curved edges, and lines. The results exhibit a very good performance in detecting image edges, comparing with other edge detectors results.