A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducted tests on ten single-objective functions from the 2019 benchmark functions of the Evolutionary Computation (CEC), as well as twenty-four single-objective functions from the 2022 CEC benchmark functions, in addition to four engineering problems. Seven comparative algorithms were utilized: the Differential Evolution Algorithm (DE), Sparrow Search Algorithm (SSA), Sine Cosine Algorithm (SCA), Whale Optimization Algorithm (WOA), Butterfly Optimization Algorithm (BOA), Lion Swarm Optimization (LSO), and Golden Jackal Optimization (GJO). The results of these diverse experiments were compared in terms of accuracy and convergence curve speed. The findings suggest that SBOA is a straightforward and viable approach that, overall, outperforms the aforementioned algorithms.
Multi-carrier direct sequence code division multiple access (MC-DS-CDMA) has emerged recently as a promising candidate for the next generation broadband mobile networks. Multipath fading channels have a severe effect on the performance of wireless communication systems even those systems that exhibit efficient bandwidth, like orthogonal frequency division multiplexing (OFDM) and MC-DS-CDMA; there is always a need for developments in the realisation of these systems as well as efficient channel estimation and equalisation methods to enable these systems to reach their maximum performance. A novel MC-DS-CDMA transceiver based on the Radon-based OFDM, which was recently proposed as a new technique in the realisation of OFDM systems, will be us
... Show MoreIn this article, a new deterministic primality test for Mersenne primes is presented. It also includes a comparative study between well-known primality tests in order to identify the best test. Moreover, new modifications are suggested in order to eliminate pseudoprimes. The study covers random primes such as Mersenne primes and Proth primes. Finally, these tests are arranged from the best to the worst according to strength, speed, and effectiveness based on the results obtained through programs prepared and operated by Mathematica, and the results are presented through tables and graphs.
Neuron-derived neurotrophic factor [NENF], a human plasma neurotrophic factor, also increases neurotrophic activity in conjunction with Parkinson's disease-related proteins in Neudesin. Although Neudesin (neuron-derived neurotrophic secreted protein) is a member of the membrane-associated progesterone receptor (MAPR) protein subclass, it is not evolutionary related to the other members of the same family. The expression of Neudesin is found in both brain and spinal cord from embryonic stages to adulthood, as w Neudesin levels in Parkinson's patients with osteoporosis disease and Parkinson's patients without osteoporosis disease, as well as the relationship between Neudesin levels, Anthropometric and Clinical Features (Age, Gender, BMI) and
... Show MoreGumbel distribution was dealt with great care by researchers and statisticians. There are traditional methods to estimate two parameters of Gumbel distribution known as Maximum Likelihood, the Method of Moments and recently the method of re-sampling called (Jackknife). However, these methods suffer from some mathematical difficulties in solving them analytically. Accordingly, there are other non-traditional methods, like the principle of the nearest neighbors, used in computer science especially, artificial intelligence algorithms, including the genetic algorithm, the artificial neural network algorithm, and others that may to be classified as meta-heuristic methods. Moreover, this principle of nearest neighbors has useful statistical featu
... Show MoreThe first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show MoreThe first successful implementation of Artificial Neural Networks (ANNs) was published a little over a decade ago. It is time to review the progress that has been made in this research area. This paper provides taxonomy for classifying Field Programmable Gate Arrays (FPGAs) implementation of ANNs. Different implementation techniques and design issues are discussed, such as obtaining a suitable activation function and numerical truncation technique trade-off, the improvement of the learning algorithm to reduce the cost of neuron and in result the total cost and the total speed of the complete ANN. Finally, the implementation of a complete very fast circuit for the pattern of English Digit Numbers NN has four layers of 70 nodes (neurons) o
... Show MoreCredit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res
... Show More