The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r

Due to the importance of solutions of partial differential equations, linear, nonlinear, homogeneous, and non-homogeneous, in important life applications, including engineering applications, physics and astronomy, medical sciences, and life technology, and their importance in solutions to heat transfer equations, wave, Laplace equation, telegraph, etc. In this paper, a new double integral transform has been proposed.

In this work, we have introduced a new double transform ( Double Complex EE Transform ). In addition, we presented the convolution theorem and proved the properties of the proposed transform, which has an effective and useful role in dealing with the solution of two-dimensional partial differential equations. Moreover

In this paper, we introduce a new complex integral transform namely ”Complex Sadik Transform”. The
properties of this transformation are investigated. This complex integral transformation is used to reduce
the core problem to a simple algebraic equation. The answer to this primary problem can than be obtained
by solving this algebraic equation and applying the inverse of complex Sadik transformation. Finally,
the complex Sadik integral transformation is applied and used to find the solution of linear higher order
ordinary differential equations. As well as, we present and discuss, some important real life problems
such as: pharmacokinetics problem ,nuclear physics problem and Beams Probem

 Uncompressed form of the digital images are needed a very large storage capacity amount, as a consequence requires large communication bandwidth for data transmission over the network. Image compression techniques not only minimize the image storage space but also preserve the quality of image. This paper reveal image compression technique which uses distinct image coding scheme based on wavelet transform that combined effective types of compression algorithms for further compression. EZW and SPIHT algorithms are types of significant compression techniques that obtainable for lossy image compression algorithms. The EZW coding is a worthwhile and simple efficient algorithm. SPIHT is an most powerful technique that utilize for image

One of the recent significant but challenging research studies in computational biology and bioinformatics is to unveil protein complexes from protein-protein interaction networks (PPINs). However, the development of a reliable algorithm to detect more complexes with high quality is still ongoing in many studies. The main contribution of this paper is to improve the effectiveness of the well-known modularity density ( ) model when used as a single objective optimization function in the framework of the canonical evolutionary algorithm (EA). To this end, the design of the EA is modified with a gene ontology-based mutation operator, where the aim is to make a positive collaboration between the modularity density model and the proposed

  With the fast progress of information technology and the computer networks, it becomes very easy to reproduce and share the geospatial data due to its digital styles. Therefore, the usage of geospatial data suffers from various problems such as data authentication, ownership proffering, and illegal copying ,etc. These problems can represent the big challenge to future uses of the geospatial data. This paper introduces a new watermarking scheme to ensure the copyright protection of the digital vector map. The main idea of proposed scheme is based on transforming  the digital map to frequently domain using the Singular Value Decomposition (SVD) in order to determine suitable areas to insert the watermark data.