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.

Abstract:

The six Arab Gulf states (Bahrain, Kuwait, Oman, Qatar, Saudi Arabia, UAE) play a vital role, especially with its geographical location and natural  resources (oil and gas) as well as other cultural and civilizational elements, in achieving  global economic balance and more specifically global energy security, naturally  because of  these countries have a comparative advantage in the field of fossil energy (oil and gas), thus this sector becomes more attractive for local and international investments alike. Being  the energy sector a leader sector in the economic development process, and the basic factor to achieve savings and financial surpluses in thes

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination

The semiempirical (PM3) and DFT quantum mechanical methods were used to investigate the theoretical degradation of Indigo dye. The chemical reactivity of the Indigo dye was evaluated by comparing the potential energy stability of the mean bonds. Seven transition states were suggested and studied to estimate the actually starting step of the degradation reaction. The bond length and bond angle calculations indicate that the best active site in the Indigo dye molecule is at C10=C11.  The most possible transition states are examined for all suggested paths of Indigo dye degradation predicated on zero-point energy and imaginary frequency. The first starting step of the reaction mechanism is proposed. The change in enthalpy, Gibbs free energ

This paper attempts to shed light on the most influential factors in the importance of religious buildings were destroyed because of the recent war due to the control of terrorist gangs of ISIS over the city of Mosul, and to prioritize their reconstruction and their role in reviving the historical center of Mosul.

The research’s problem emerged in the lack of knowledge about the identifying the most influential factors in the importance of religious buildings and utilizing them to prioritize their reconstruction. This study aims to analyze the factors influencing the importance of religious buildings using the Expert Choice software through the Analytic Hierarchy Process (AHP) to reach an analysis of their weights and propose p

 

    The combination of wavelet theory and neural networks has lead to the development of wavelet networks. Wavelet networks are feed-forward neural networks using wavelets as activation function. Wavelets networks have been used in classification and identification problems with some success.

  In this work we proposed a fuzzy wavenet network (FWN), which learns by common back-propagation algorithm to classify medical images. The library of medical image has been analyzed, first. Second, Two experimental tables’ rules provide an excellent opportunity to test the ability of fuzzy wavenet network due to the high level of information variability often experienced with this type of images.

&n

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.