Modified Black Widow Optimization-Based Enhanced Threshold Energy Detection Technique for Spectrum Sensing in Cognitive Radio Networks

This study develops an Enhanced Threshold Based Energy Detection approach(ETBED)for spectrum sensing in a cognitive radio network.The threshold identification method is implemented in the received signal at the secondary user based on the square law.The proposed method is implemented with the signal transmission of multiple outputs-orthogonal frequency division multiplexing.Additionally,the proposed method is considered the dynamic detection threshold adjustments and energy identification spectrum sensing technique in cognitive radio systems.In the dynamic threshold,the signal ratio-based threshold is fixed.The threshold is computed by considering the Modified Black Widow Optimization Algorithm(MBWO).So,the proposed methodology is a combination of dynamic threshold detection and MBWO.The general threshold-based detection technique has different limitations such as the inability optimal signal threshold for determining the presence of the primary user signal.These limitations undermine the sensing accuracy of the energy identification technique.Hence,the ETBED technique is developed to enhance the energy efficiency of cognitive radio networks.The projected approach is executed and analyzed with performance and comparison analysis.The proposed method is contrasted with the conventional techniques of theWhale Optimization Algorithm(WOA)and GreyWolf Optimization(GWO).It indicated superior results,achieving a high average throughput of 2.2 Mbps and an energy efficiency of 3.8,outperforming conventional techniques.

Modified Shuffled Frog Leaping Algorithm for Solving Economic Load Dispatch Problem

In the recent restructured power system scenario and complex market strategy, operation at absolute minimum cost is no longer the only criterion for dispatching electric power. The economic load dispatch (ELD) problem which accounts for minimization of both generation cost and power loss is itself a multiple conflicting objective function problem. In this paper, a modified shuffled frog-leaping algorithm (MSFLA), which is an improved version of memetic algorithm, is proposed for solving the ELD problem. It is a relatively new evolutionary method where local search is applied during the evolutionary cycle. The idea of memetic algorithm comes from memes, which unlike genes can adapt themselves. The performance of MSFLA has been shown more efficient than traditional evolutionary algorithms for such type of ELD problem. The application and validity of the proposed algorithm are demonstrated for IEEE 30 bus test system as well as a practical power network of 203 bus 264 lines 23 machines system.

Efficient implementation of x-ray ghost imaging based on a modified compressive sensing algorithm

Towards efficient implementation of x-ray ghost imaging(XGI),efficient data acquisition and fast image reconstruction together with high image quality are preferred.In view of radiation dose resulted from the incident x-rays,fewer measurements with sufficient signal-to-noise ratio(SNR)are always anticipated.Available methods based on linear and compressive sensing algorithms cannot meet all the requirements simultaneously.In this paper,a method based on a modified compressive sensing algorithm with conjugate gradient descent method(CGDGI)is developed to solve the problems encountered in available XGI methods.Simulation and experiments demonstrate the practicability of CGDGI-based method for the efficient implementation of XGI.The image reconstruction time of sub-second implicates that the proposed method has the potential for real-time XGI.

Modified Bat Algorithm for Optimal VM’s in Cloud Computing

All task scheduling applications need to ensure that resources are optimally used,performance is enhanced,and costs are minimized.The purpose of this paper is to discuss how to Fitness Calculate Values(FCVs)to provide application software with a reliable solution during the initial stages of load balancing.The cloud computing environment is the subject of this study.It consists of both physical and logical components(most notably cloud infrastructure and cloud storage)(in particular cloud services and cloud platforms).This intricate structure is interconnected to provide services to users and improve the overall system’s performance.This case study is one of the most important segments of cloud computing,i.e.,Load Balancing.This paper aims to introduce a new approach to balance the load among Virtual Machines(VM’s)of the cloud computing environment.The proposed method led to the proposal and implementation of an algorithm inspired by the Bat Algorithm(BA).This proposed Modified Bat Algorithm(MBA)allows balancing the load among virtual machines.The proposed algorithm works in two variants:MBA with Overloaded Optimal Virtual Machine(MBAOOVM)and Modified Bat Algorithm with Balanced Virtual Machine(MBABVM).MBA generates cost-effective solutions and the strengths of MBA are finally validated by comparing it with Bat Algorithm.

A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage and Retrieval System of E-commerce

E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.

Pipe-assembly approach for ships using modified NSGA-Ⅱ algorithm

Pipe-routing for ship is formulated as searching for the near-optimal pipe paths while meeting certain objectives in an environment scattered with obstacles. Due to the complex construction in layout space, the great number of pipelines, numerous and diverse design constraints and large amount of obstacles, finding the optimum route of ship pipes is a complicated and time-consuming process. A modified NSGA-II algorithm based approach is proposed to find the near-optimal solution to solve the problem. By simplified equipment models, the layout space is firstly divided into three dimensional （3D） grids to build its mathematical model. In the modified NSGA-II algorithm, the concept of auxiliary point is introduced to improve the search range of maze algorithm （MA） as well as to guarantee the diversity of chromosomes in initial population. Then the fix-length coding mechanism is proposed, Fuzzy set theory is also adopted to select the optimal solution in Pareto solutions. Finally, the effectiveness and efficiency of the proposed approach is demonstrated by the contrast test and simulation. The merit of the proposed algorithm lies in that it can provide more appropriate solutions for the designers while subject certain constrains.

Enhanced Wolf Pack Algorithm (EWPA) and Dense-kUNet Segmentation for Arterial Calcifications in Mammograms

Breast Arterial Calcification(BAC)is a mammographic decision dissimilar to cancer and commonly observed in elderly women.Thus identifying BAC could provide an expense,and be inaccurate.Recently Deep Learning(DL)methods have been introduced for automatic BAC detection and quantification with increased accuracy.Previously,classification with deep learning had reached higher efficiency,but designing the structure of DL proved to be an extremely challenging task due to overfitting models.It also is not able to capture the patterns and irregularities presented in the images.To solve the overfitting problem,an optimal feature set has been formed by Enhanced Wolf Pack Algorithm(EWPA),and their irregularities are identified by Dense-kUNet segmentation.In this paper,Dense-kUNet for segmentation and optimal feature has been introduced for classification(severe,mild,light)that integrates DenseUNet and kU-Net.Longer bound links exist among adjacent modules,allowing relatively rough data to be sent to the following component and assisting the system in finding higher qualities.The major contribution of the work is to design the best features selected by Enhanced Wolf Pack Algorithm(EWPA),and Modified Support Vector Machine(MSVM)based learning for classification.k-Dense-UNet is introduced which combines the procedure of Dense-UNet and kU-Net for image segmentation.Longer bound associations occur among nearby sections,allowing relatively granular data to be sent to the next subsystem and benefiting the system in recognizing smaller characteristics.The proposed techniques and the performance are tested using several types of analysis techniques 826 filled digitized mammography.The proposed method achieved the highest precision,recall,F-measure,and accuracy of 84.4333%,84.5333%,84.4833%,and 86.8667%when compared to other methods on the Digital Database for Screening Mammography(DDSM).

MODIFIED APPROXIMATE PROXIMAL POINT ALGORITHMS FOR FINDING ROOTS OF MAXIMAL MONOTONE OPERATORS

In order to find roots of maximal monotone operators, this paper introduces and studies the modified approximate proximal point algorithm with an error sequence {e k} such that || ek || \leqslant hk || xk - [(x)\tilde]k ||\left\| { e^k } \right\| \leqslant \eta _k \left\| { x^k - \tilde x^k } \right\| with ?k = 0￥ ( hk - 1 ) < + ￥\sum\limits_{k = 0}^\infty {\left( {\eta _k - 1} \right)} and infk \geqslant 0 hk = m\geqslant 1\mathop {\inf }\limits_{k \geqslant 0} \eta _k = \mu \geqslant 1 . Here, the restrictions on {η k} are very different from the ones on {η k}, given by He et al (Science in China Ser. A, 2002, 32 (11): 1026–1032.) that supk \geqslant 0 hk = v < 1\mathop {\sup }\limits_{k \geqslant 0} \eta _k = v . Moreover, the characteristic conditions of the convergence of the modified approximate proximal point algorithm are presented by virtue of the new technique very different from the ones given by He et al.

CONVERGENCE OF A MODIFIED SLP ALGORITHM FOR THE EXTENDED LINEAR COMPLEMENTARITY PROBLEM

A modified sequential linear programming algorithm is presented, whose subproblem is always solvable, for the extended linear complementarity problem (XLCP), the global convergence of the algorithm under assumption of X-row sufficiency or X-colunm monotonicity is proved. As a result, a sufficient condition for existence and boundedness of solution to the XLCP are obtained.

A novel genomic prediction method combining randomized Haseman-Elston regression with a modified algorithm for Proven and Young for large genomic data

Computational efficiency has become a key issue in genomic prediction(GP) owing to the massive historical datasets accumulated. We developed hereby a new super-fast GP approach(SHEAPY) combining randomized Haseman-Elston regression(RHE-reg) with a modified Algorithm for Proven and Young(APY) in an additive-effect model, using the former to estimate heritability and then the latter to invert a large genomic relationship matrix for best linear prediction. In simulation results with varied sizes of training population, GBLUP, HEAPY|A and SHEAPY showed similar predictive performance when the size of a core population was half that of a large training population and the heritability was a fixed value, and the computational speed of SHEAPY was faster than that of GBLUP and HEAPY|A. In simulation results with varied heritability, SHEAPY showed better predictive ability than GBLUP in all cases and than HEAPY|A in most cases when the size of a core population was 4/5 that of a small training population and the training population size was a fixed value. As a proof of concept, SHEAPY was applied to the analysis of two real datasets. In an Arabidopsis thaliana F2 population, the predictive performance of SHEAPY was similar to or better than that of GBLUP and HEAPY|A in most cases when the size of a core population(2 0 0) was 2/3 of that of a small training population(3 0 0). In a sorghum multiparental population,SHEAPY showed higher predictive accuracy than HEAPY|A for all of three traits, and than GBLUP for two traits. SHEAPY may become the GP method of choice for large-scale genomic data.

Solving Optimal Power Flow Using Modified Bacterial Foraging Algorithm Considering FACTS Devices

In this paper, a new Modified Bacterial Foraging Algorithm (MBFA) method is developed to incorporate FACTS devices in optimal power flow (OPF) problem. This method can provide an enhanced economic solution with the use of controllable FACTS devices. Two types of FACTS devices, thyristor controlled series compensators (TCSC) and Static VAR Compensator (SVC) are considered in this method. The basic bacterial foraging algorithm (BFA) is an evolutionary optimization technique inspired by the foraging behavior of the E. coli bacteria. The strategy of the OPF problem is decomposed in two sub-problems, the first sub-problem related to active power planning to minimize the fuel cost function, and the second sub-problem designed to make corrections to the voltage deviation and reactive power violation based in an efficient reactive power planning of multi Static VAR Compensator (SVC). The specified power flow control constraints due to the use of FACTS devices are included in the OPF problem. The proposed method decomposes the solution of such modified OPF problem into two sub problems’ iteration. The first sub problem is a power flow control problem and the second sub problem is a modified Bacterial foraging algorithm (MBFA) OPF problem. The two sub problems are solved iteratively until convergence. Case studies are presented to show the effectiveness of the proposed method.

Modeling and Adaptive Self-Tuning MVC Control of PAM Manipulator Using Online Observer Optimized with Modified Genetic Algorithm

In this paper, the application of modified genetic algorithms (MGA) in the optimization of the ARX Model-based observer of the Pneumatic Artificial Muscle (PAM) manipulator is investigated. The new MGA algorithm is proposed from the genetic algorithm with important additional strategies, and consequently yields a faster convergence and a more accurate search. Firstly, MGA-based identification method is used to identify the parameters of the nonlinear PAM manipulator described by an ARX model in the presence of white noise and this result will be validated by MGA and compared with the simple genetic algorithm (GA) and LMS (Least mean-squares) method. Secondly, the intrinsic features of the hysteresis as well as other nonlinear disturbances existing intuitively in the PAM system are estimated online by a Modified Recursive Least Square (MRLS) method in identification experiment. Finally, a highly efficient self-tuning control algorithm Minimum Variance Control (MVC) is taken for tracking the joint angle position trajectory of this PAM manipulator. Experiment results are included to demonstrate the excellent performance of the MGA algorithm in the NARX model-based MVC control system of the PAM system. These results can be applied to model, identify and control other highly nonlinear systems as well.

Optimal Placement of Phasor Measurement Units Using a Modified Canonical Genetic Algorithm for Observability Analysis

This paper proposes a method for optimal placement of synchronized PMUs （phasor measurement units） in electrical power systems using a MCGA （modified canonical genetic algorithm）, which the goal is to determine the minimum number of PMUs, as well as the optimal location of these units to ensure the complete topological observability of the system. In case of more than one solution, a strategy of analysis of the design matrix rank is applied to determine the solution with the lower number of critical measurements. In the proposed method of placement, modifications are made in the crossover and mutation genetic operators, as well as in the formation of the subpopulation, and are considered restrictive hypotheses in the search space to improve the performance in solving the optimization problem. Simulations are performed using the IEEE 14-bus, IEEE 30-bus and New England 39-bus test systems. The proposed method is applied on the IEEE 118-bus test system considering the presence of observable zones formed by conventional measurements.

Modified particle swarm optimization-based antenna tilt angle adjusting scheme for LTE coverage optimization

In order to solve the challenging coverage problem that the long term evolution（ LTE） networks are facing, a coverage optimization scheme by adjusting the antenna tilt angle（ ATA） of evolved Node B（ e NB） is proposed based on the modified particle swarm optimization（ MPSO） algorithm.The number of mobile stations（ MSs） served by e NBs, which is obtained based on the reference signal received power（RSRP） measured from the MS, is used as the metric for coverage optimization, and the coverage problem is optimized by maximizing the number of served MSs. In the MPSO algorithm, a swarm of particles known as the set of ATAs is available; the fitness function is defined as the total number of the served MSs; and the evolution velocity corresponds to the ATAs adjustment scale for each iteration cycle. Simulation results showthat compared with the fixed ATA, the number of served MSs by e NBs is significantly increased by 7. 2%, the quality of the received signal is considerably improved by 20 d Bm, and, particularly, the system throughput is also effectively increased by 55 Mbit / s.

Fused and Modified Evolutionary Optimization of Multiple Intelligent Systems Using ANN, SVM Approaches

The Fused Modified Grasshopper Optimization Algorithm has been proposed,which selects the most specific feature sets from images of the disease of plant leaves.The Proposed algorithm ensures the detection of diseases during the early stages of the diagnosis of leaf disease by farmers and,finally,the crop needed to be controlled by farmers to ensure the survival and protection of plants.In this study,a novel approach has been suggested based on the standard optimization algorithm for grasshopper and the selection of features.Leaf conditions in plants are a major factor in reducing crop yield and quality.Any delay or errors in the diagnosis of the disease can lead to delays in the management of plant disease spreading and damage and related material losses.Comparative new heuristic optimization of swarm intelligence,Grasshopper Optimization Algorithm was inspired by grasshopper movements for their feeding strategy.It simulates the attitude and social interaction of grasshopper swarm in terms of gravity and wind advection.In the decision on features extracted by an accelerated feature selection algorithm,popular approaches such as ANN and SVM classifiers had been used.For the evaluation of the proposed model,different data sets of plant leaves were used.The proposed model was successful in the diagnosis of the diseases of leaves the plant with an accuracy of 99.41 percent(average).The proposed biologically inspired model was sufficiently satisfied,and the best or most desirable characteristics were established.Finally,the results of the research for these data sets were estimated by the proposed Fused Modified Grasshopper Optimization Algorithm(FMGOA).The results of that experiment were demonstrated to allow classification models to reduce input features and thus to increase the precision with the presented Modified Grasshopper Optimization Algorithm.Measurement and analysis were performed to prove the model validity through model parameters such as precision,recall,f-measure,and precision.

A Novel Self Adaptive Modification Approach Based on Bat Algorithm for Optimal Management of Renewable MG

In the new competitive electricity market, the accurate operation management of Micro-Grid (MG) with various types of renewable power sources (RES) can be an effective approach to supply the electrical consumers more reliably and economically. In this regard, this paper proposes a novel solution methodology based on bat algorithm to solve the op- timal energy management of MG including several RESs with the back-up of Fuel Cell (FC), Wind Turbine (WT), Photovoltaics (PV), Micro Turbine (MT) as well as storage devices to meet the energy mismatch. The problem is formulated as a nonlinear constraint optimization problem to minimize the total cost of the grid and RESs, simultaneously. In addition, the problem considers the interactive effects of MG and utility in a 24 hour time interval which would in- crease the complexity of the problem from the optimization point of view more severely. The proposed optimization technique is consisted of a self adaptive modification method compromised of two modification methods based on bat algorithm to explore the total search space globally. The superiority of the proposed method over the other well-known algorithms is demonstrated through a typical renewable MG as the test system.

Best compromising crashworthiness design of automotive S-rail using TOPSIS and modified NSGAⅡ

In order to reduce both the weight of vehicles and the damage of occupants in a crash event simultaneously, it is necessary to perform a multi-objective optimal design of the automotive energy absorbing components. Modified non-dominated sorting genetic algorithm II(NSGA II) was used for multi-objective optimization of automotive S-rail considering absorbed energy(E), peak crushing force(Fmax) and mass of the structure(W) as three conflicting objective functions. In the multi-objective optimization problem(MOP), E and Fmax are defined by polynomial models extracted using the software GEvo M based on train and test data obtained from numerical simulation of quasi-static crushing of the S-rail using ABAQUS. Finally, the nearest to ideal point(NIP)method and technique for ordering preferences by similarity to ideal solution(TOPSIS) method are used to find the some trade-off optimum design points from all non-dominated optimum design points represented by the Pareto fronts. Results represent that the optimum design point obtained from TOPSIS method exhibits better trade-off in comparison with that of optimum design point obtained from NIP method.

AN OPTIMAL SELF-SCALING STRATEGY TO THE MODIFIED SYMMETRIC RANK ONE UPDATING

In the paper, the optimal self-scaling strategy to the modified symmetric rank one (HSR1) update, which satisfies the modified quasi-Newton equation, is derived to improve the condition number of the updates. The scaling factors are derived from minimizing the estimate of upper bounds on the condition number of the updating matrix. Theoretical analysis, and numerical experiments and comparisons show that introducing the optimal scaling factor into the modified symmetric rank one update preserves the positive definiteness of updates, and greatly improves the stability and numerical performance of the modified symmetric rank one algorithm.

Optimization of multi-revolution low-thrust transfer based on modified direct method

A modified direct optimization method is proposed to solve the optimal multi-revolution transfer with low-thrust between Earth-orbits. First, through parameterizing the control steering angles by costate variables, the search space of free parameters has been decreased. Then, in order to obtain the global optimal solution effectively and robustly, the simulated annealing and penalty function strategies were used to handle the constraints, and a GA/SQP hybrid optimization algorithm was utilized to solve the parameter optimization problem, in which, a feasible suboptimal solution obtained by GA was submitted as an initial parameter set to SQP for refinement. Comparing to the classical direct method, this novel method has fewer free parameters, needs not initial guesses, and has higher computation precision. An optimal-fuel transfer problem from LEO to GEO was taken as an example to validate the proposed approach. The results of simulation indicate that our approach is available to solve the problem of optimal muhi-revolution transfer between Earth-orbits.

Availability Capacity Evaluation and Reliability Assessment of Integrated Systems Using Metaheuristic Algorithm

Contemporarily,the development of distributed generations(DGs)technologies is fetching more,and their deployment in power systems is becom-ing broad and diverse.Consequently,several glitches are found in the recent studies due to the inappropriate/inadequate penetrations.This work aims to improve the reliable operation of the power system employing reliability indices using a metaheuristic-based algorithm before and after DGs penetration with feeder system.The assessment procedure is carried out using MATLAB software and Mod-ified Salp Swarm Algorithm(MSSA)that helps assess the Reliability indices of the proposed integrated IEEE RTS79 system for seven different configurations.This algorithm modifies two control parameters of the actual SSA algorithm and offers a perfect balance between the exploration and exploitation.Further,the effectiveness of the proposed schemes is assessed using various reliability indices.Also,the available capacity of the extended system is computed for the best configuration of the considered system.The results confirm the level of reli-able operation of the extended DGs along with the standard RTS system.Speci-fically,the overall reliability of the system displays superior performance when the tie lines 1 and 2 of the DG connected with buses 9 and 10,respectively.The reliability indices of this case namely SAIFI,SAIDI,CAIDI,ASAI,AUSI,EUE,and AEUE shows enhancement about 12.5%,4.32%,7.28%,1.09%,4.53%,12.00%,and 0.19%,respectively.Also,a probability of available capacity at the low voltage bus side is accomplished a good scale about 212.07 times/year.