Objective: To examined the common frequency of cervical cancer in Iraqi women. Study Design: Descriptive study Place and Duration of Study: This study was conducted at the Iraqi Cancer Agency and the Cancer Registry data from the Iraqi Ministry of Health provided assistance in data gathering from 1st April 2020 to 31st December 2021. Methods: The study examined 504 women diagnosed with cervical cancer. Their ages ranged from 20 to over 80 years. The data analysis employed descriptive statistics to determine the frequency, proportion, and incidence of cervical cancer. Results: The cervical cancer was predominantly caused by human papillomavirus in women in 2020 (1.29%) and 2021 (2.1%). In 2020, the number of cases of cervical can

This work aims to see the positive association rules and negative association rules in the Apriori algorithm by using cosine correlation analysis. The default and the modified Association Rule Mining algorithm are implemented against the mushroom database to find out the difference of the results. The experimental results showed that the modified Association Rule Mining algorithm could generate negative association rules. The addition of cosine correlation analysis returns a smaller amount of association rules than the amounts of the default Association Rule Mining algorithm. From the top ten association rules, it can be seen that there are different rules between the default and the modified Apriori algorithm. The difference of the obta

The proposed design of neural network in this article is based on new accurate approach for training by unconstrained optimization, especially update quasi-Newton methods are perhaps the most popular general-purpose algorithms. A limited memory BFGS algorithm is presented for solving large-scale symmetric nonlinear equations, where a line search technique without derivative information is used. On each iteration, the updated approximations of Hessian matrix satisfy the quasi-Newton form, which traditionally served as the basis for quasi-Newton methods. On the basis of the quadratic model used in this article, we add a new update of quasi-Newton form. One innovative features of this form's is its ability to estimate the energy functio

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene

Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par

This article examines and proposes a dietary chain model with a prey shelter and alternative food sources. It is anticipated that mid-predators' availability is positively correlated with the number of refuges. The solution's existence and exclusivity are examined. It is established that the solution is bounded. It is explored whether all potential equilibrium points exist and are locally stable. The Lyapunov approach is used to investigate the equilibrium points' worldwide stability. Utilizing a Sotomayor theorem application, local bifurcation is studied. Numerical simulation is used to better comprehend the dynamics of the model and define the control set of parameters.