Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the contribution of this paper is to reformulate the maximum overlapped set covers problem to handle the probabilistic sensing model. The problem is addressed as a multi-objective optimization (MOO) problem and the well-known decomposition based multi-objective evolutionary algorithm (MOEA/D) is adopted to solve the stated problem. A Multi-layer MOEA/D is suggested, wherein each layer yields a distinct set cover. Performance evaluations in terms of total number of set covers, total residual energy, and coverage reliability are reported through extensive simulations. The main aspect of the results reveals that the network's lifetime (i.e. total number of set covers) can be extended by increasing number of sensors. On the other hand, the coverage reliability can be increased by increasing sensing ranges but at the expense of decreasing the network's lifetime.
This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).
The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with
... Show More
(3)
(1)
In this paper, a least squares group finite element method for solving coupled Burgers' problem in 2-D is presented. A fully discrete formulation of least squares finite element method is analyzed, the backward-Euler scheme for the time variable is considered, the discretization with respect to space variable is applied as biquadratic quadrangular elements with nine nodes for each element. The continuity, ellipticity, stability condition and error estimate of least squares group finite element method are proved. The theoretical results show that the error estimate of this method is . The numerical results are compared with the exact solution and other available literature when the convection-dominated case to illustrate the effic
... Show More
(2)
(1)
The paper is concerned with the state and proof of the solvability theorem of unique state vector solution (SVS) of triple nonlinear hyperbolic boundary value problem (TNLHBVP), via utilizing the Galerkin method (GAM) with the Aubin theorem (AUTH), when the boundary control vector (BCV) is known. Solvability theorem of a boundary optimal control vector (BOCV) with equality and inequality state vector constraints (EINESVC) is proved. We studied the solvability theorem of a unique solution for the adjoint triple boundary value problem (ATHBVP) associated with TNLHBVP. The directional derivation (DRD) of the "Hamiltonian"(DRDH) is deduced. Finally, the necessary theorem (necessary conditions "NCOs") and the sufficient theorem (sufficient co
... Show More
(1)
This paper has the interest of finding the approximate solution (APPS) of a nonlinear variable coefficients hyperbolic boundary value problem (NOLVCHBVP). The given boundary value problem is written in its discrete weak form (WEFM) and proved have a unique solution, which is obtained via the mixed Galerkin finite element with implicit method that reduces the problem to solve the Galerkin nonlinear algebraic system (GNAS). In this part, the predictor and the corrector techniques (PT and CT, respectively) are proved at first convergence and then are used to transform the obtained GNAS to a linear GLAS . Then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are stud
... Show More
(1)
The main targets for using the edge detection techniques in image processing are to reduce the number of features and find the edge of image based-contents. In this paper, comparisons have been demonstrated between classical methods (Canny, Sobel, Roberts, and Prewitt) and Fuzzy Logic Technique to detect the edges of different samples of image's contents and patterns. These methods are tested to detect edges of images that are corrupted with different types of noise such as (Gaussian, and Salt and pepper). The performance indices are mean square error and peak signal to noise ratio (MSE and PSNR). Finally, experimental results show that the proposed Fuzzy rules and membership function provide better results for both noisy and noise-free
... Show More
This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that
Signal denoising is directly related to sample estimation of received signals, either by estimating the equation parameters for the target reflections or the surrounding noise and clutter accompanying the data of interest. Radar signals recorded using analogue or digital devices are not immune to noise. Random or white noise with no coherency is mainly produced in the form of random electrons, and caused by heat, environment, and stray circuitry loses. These factors influence the output signal voltage, thus creating detectable noise. Differential Evolution (DE) is an effectual, competent, and robust optimisation method used to solve different problems in the engineering and scientific domains, such as in signal processing. This paper looks
... Show More
(10)
(6)