A novel approach to design optimal 2-D digital differentiator using vortex search optimization algorithm

Author(s):  
Suman Yadav ◽  
Richa Yadav ◽  
Ashwni Kumar ◽  
Manjeet Kumar
2021 ◽  
Vol 104 (2) ◽  
pp. 003685042110254
Author(s):  
Armaghan Mohsin ◽  
Yazan Alsmadi ◽  
Ali Arshad Uppal ◽  
Sardar Muhammad Gulfam

In this paper, a novel modified optimization algorithm is presented, which combines Nelder-Mead (NM) method with a gradient-based approach. The well-known Nelder Mead optimization technique is widely used but it suffers from convergence issues in higher dimensional complex problems. Unlike the NM, in this proposed technique we have focused on two issues of the NM approach, one is shape of the simplex which is reshaped at each iteration according to the objective function, so we used a fixed shape of the simplex and we regenerate the simplex at each iteration and the second issue is related to reflection and expansion steps of the NM technique in each iteration, NM used fixed value of [Formula: see text], that is, [Formula: see text]  = 1 for reflection and [Formula: see text]  = 2 for expansion and replace the worst point of the simplex with that new point in each iteration. In this way NM search the optimum point. In proposed algorithm the optimum value of the parameter [Formula: see text] is computed and then centroid of new simplex is originated at this optimum point and regenerate the simplex with this centroid in each iteration that optimum value of [Formula: see text] will ensure the fast convergence of the proposed technique. The proposed algorithm has been applied to the real time implementation of the transversal adaptive filter. The application used to demonstrate the performance of the proposed technique is a well-known convex optimization problem having quadratic cost function, and results show that the proposed technique shows fast convergence than the Nelder-Mead method for lower dimension problems and the proposed technique has also good convergence for higher dimensions, that is, for higher filter taps problem. The proposed technique has also been compared with stochastic techniques like LMS and NLMS (benchmark) techniques. The proposed technique shows good results against LMS. The comparison shows that the modified algorithm guarantees quite acceptable convergence with improved accuracy for higher dimensional identification problems.


Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 757
Author(s):  
Yongke Pan ◽  
Kewen Xia ◽  
Li Wang ◽  
Ziping He

The dataset distribution of actual logging is asymmetric, as most logging data are unlabeled. With the traditional classification model, it is hard to predict the oil and gas reservoir accurately. Therefore, a novel approach to the oil layer recognition model using the improved whale swarm algorithm (WOA) and semi-supervised support vector machine (S3VM) is proposed in this paper. At first, in order to overcome the shortcomings of the Whale Optimization Algorithm applied in the parameter-optimization of the S3VM model, such as falling into a local optimization and low convergence precision, an improved WOA was proposed according to the adaptive cloud strategy and the catfish effect. Then, the improved WOA was used to optimize the kernel parameters of S3VM for oil layer recognition. In this paper, the improved WOA is used to test 15 benchmark functions of CEC2005 compared with five other algorithms. The IWOA–S3VM model is used to classify the five kinds of UCI datasets compared with the other two algorithms. Finally, the IWOA–S3VM model is used for oil layer recognition. The result shows that (1) the improved WOA has better convergence speed and optimization ability than the other five algorithms, and (2) the IWOA–S3VM model has better recognition precision when the dataset contains a labeled and unlabeled dataset in oil layer recognition.


Author(s):  
Ali Pourfard ◽  
Esmaeel Khanmirza ◽  
Reza Madoliat

Simulation of a natural gas network operation is a prerequisite for optimization and control tasks. Treating gas in a transient manner is necessary for accurate simulation of gas networks. However, solving the governing nonlinear partial differential equations of pipe flows is a challenging task. In this paper, a novel approach is proposed based on using an intelligent algorithm called teaching–learning-based optimization. This approach simplifies transient simulation of gas networks with a specified type of boundary conditions. Teaching–learning-based optimization estimates different values for network inlet flow rates. Then by knowing the inlet boundary conditions of the network, the discretized flow equations become linear and the flow equations of each pipe can be solved independently. Thus, the network outlet flow variables can be easily obtained. The differences of obtained and actual network outlet flow rates are considered as a cost function or error. Finally, this intelligent algorithm determines the optimum inlet flow rates at each time level, which minimize the error. The proposed approach is implemented on the in-service gas network. To validate the simulation results, a conventional gradient-based method called trust region dogleg is also used for simulation of the gas network. The comparison of numerical results confirms the accuracy and efficiency of this approach, while it is more computationally efficient. Moreover, the substitution of teaching–learning-based optimization with another powerful intelligent optimization algorithm would not improve the performance of the proposed approach.


Author(s):  
RASHI VOHRA ◽  
BRAJESH PATEL

The utmost negative impact of advancement of technology is an exponential increase in security threats, due to which tremendous demand for effective electronic security is increasing importantly. The principles of any security mechanism are confidentiality, authentication, integrity, non-repudiation, access control and availability. Cryptography is an essential aspect for secure communications. Many chaotic cryptosystem has been developed, as a result of the interesting relationship between the two field chaos and cryptography phenomenological behavior. In this paper, an overview of cryptography, optimization algorithm and chaos theory is provided and a novel approach for encryption and decryption based on chaos and optimization algorithms is discussed. In this article, the basic idea is to encrypt and decrypt the information using the concept of genetic algorithm with the pseudorandom sequence further used as a key in genetic algorithm operation for encryption: which is generated by application of chaotic map. This attempt result in good desirable cryptographic properties as a change in key will produce undesired result in receiver side. The suggested approach complements standard, algorithmic procedures, providing security solutions with novel features.


Sign in / Sign up

Export Citation Format

Share Document