To obtain the approximate solution to Riccati matrix differential equations, a new variational iteration approach was ‎proposed, which is suggested to improve the accuracy and increase the convergence rate of the approximate solutons to the ‎exact solution. This technique was found to give very accurate results in a few number of iterations. In this paper, the ‎modified approaches were derived to give modified solutions of proposed and used and the convergence analysis to the exact ‎solution of the derived sequence of approximate solutions is also stated and proved. Two examples were also solved, which ‎shows the reliability and applicability of the proposed approach. ‎

The nonhomogeneous higher order linear complex differential equation (HOLCDE) with meromorphic (or entire) functions is considered in this paper. The results are obtained by putting some conditions on the coefficients to prove that the hyper order of any nonzero solution of this equation equals the order of one of its coefficients in case the coefficients are meromorphic functions. In this case, the conditions were put are that the lower order of one of the coefficients dominates the maximum of the convergence exponent of the zeros sequence of it, the lower order of both of the other coefficients and the nonhomogeneous part and that the solution has infinite order. Whiles in case the coefficients are entire functions, any nonzero solutio

The differential protection of power transformers appears to be more difficult than any type of protection for any other part or element in a power system. Such difficulties arise from the existence of the magnetizing inrush phenomenon. Therefore, it is necessary to recognize between inrush current and the current arise from internal faults. In this paper, two approaches based on wavelet packet transform (WPT) and S-transform (ST) are applied to recognize different types of currents following in the transformer. In WPT approach, the selection of optimal mother wavelet and the optimal number of resolution is carried out using minimum description length (MDL) criteria before taking the decision for the extraction features from the WPT tree

Breast cancer is the most common malignancy in female and the most registered cause of women’s mortality worldwide. BI-RADS 4 breast lesions are associated with an exceptionally high rate of benign breast pathology and breast cancer, so BI-RADS 4 is subdivided into 4A, 4B and 4C to standardize the risk estimation of breast lesions. The aim of the study: to evaluate the correlation between BI-RADS 4 subdivisions 4A, 4B & 4C and the categories of reporting FNA cytology results. A case series study was conducted in the Oncology Teaching Hospital in Baghdad from September 2018 to September 2019. Included patients had suspicious breast findings and given BI-RADS 4 (4A, 4B, or 4C) in the radiological report accordingly. Fine needle aspirati

Gumbel 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

The 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

The 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

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 conducte

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process