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 regional monitoring into point monitoring utilizing the discretization method in WSN. In the experiments, the ICS-PSO-OBL with the standard CS and three CS variants (MACS, ICS-2, and ICS) are utilized to execute the simulation experiment under different numbers of nodes (20 and 30, respectively). The experimental results reveal that the optimized coverage of ICS-PSO-OBL is 18.36%, 7.894%, 15%, and 9.02% higher than that of standard CS, MACS, ICS-2, and ICS when the number of nodes is 20. Moreover, it is 16.94%, 9.61%, 12.27%, and 7.75% higher when the quantity of nodes is 30, the convergence speed of ICS-PSO-OBL, and the distribution of nodes is superior to others.
The research aims to shed light on the financing structure, which is one of the important pillars of financial management in the commercial banking sector, which enhances its financial position through financing its various investments, which is one of the pillars of the successful economy of the commercial banking sector. in which country. The contents of the research variables, which were represented by the independent variable, financing structure, the dependent variable, and investment decisions in commercial banks, which the researcher tried to address, as the research began with a basic variable that depends on diagnosing the impact of the financin
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2
Software testing is a vital part of the software development life cycle. In many cases, the system under test has more than one input making the testing efforts for every exhaustive combination impossible (i.e. the time of execution of the test case can be outrageously long). Combinatorial testing offers an alternative to exhaustive testing via considering the interaction of input values for every t-way combination between parameters. Combinatorial testing can be divided into three types which are uniform strength interaction, variable strength interaction and input-output based relation (IOR). IOR combinatorial testing only tests for the important combinations selected by the tester. Most of the researches in combinatorial testing
... Show MoreText based-image clustering (TBIC) is an insufficient approach for clustering related web images. It is a challenging task to abstract the visual features of images with the support of textual information in a database. In content-based image clustering (CBIC), image data are clustered on the foundation of specific features like texture, colors, boundaries, shapes. In this paper, an effective CBIC) technique is presented, which uses texture and statistical features of the images. The statistical features or moments of colors (mean, skewness, standard deviation, kurtosis, and variance) are extracted from the images. These features are collected in a one dimension array, and then genetic algorithm (GA) is applied for image clustering.
... Show Moreconventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation.