It is the regression analysis is the foundation stone of knowledge of statistics , which mostly depends on the ordinary least square method , but as is well known that the way the above mentioned her several conditions to operate accurately and the results can be unreliable , add to that the lack of certain conditions make it impossible to complete the work and analysis method and among those conditions are the multi-co linearity problem , and we are in the process of detected that problem between the independent variables using farrar –glauber test , in addition to the requirement linearity data and the lack of the condition last has been resorting to the

      Data mining has the most important role in healthcare for discovering hidden relationships in big datasets, especially in breast cancer diagnostics, which is the most popular cause of death in the world. In this paper two algorithms are applied that are decision tree and K-Nearest Neighbour for diagnosing Breast Cancer Grad in order to reduce its risk on patients. In decision tree with feature selection, the Gini index gives an accuracy of %87.83, while with entropy, the feature selection gives an accuracy of %86.77. In both cases, Age appeared as the  most effective parameter, particularly when Age<49.5. Whereas  Ki67  appeared as a second effective parameter. Furthermore, K- Nearest Neighbor is based on the minimu

Ferritin is a key organizer of protected deregulation, particularly below risky hyperferritinemia, by straight immune-suppressive and pro-inflammatory things. , We conclude that there is a significant association between levels of ferritin and the harshness of COVID-19. In this paper we introduce a semi- parametric method for prediction by making a combination between NN and regression models. So, two methodologies are adopted, Neural Network (NN) and regression model in design the model; the data were collected from مستشفى دار التمريض الخاص for period 11/7/2021- 23/7/2021, we have 100 person, With COVID 12 Female & 38 Male out of 50, while 26 Female & 24 Male non COVID out of 50. The input variables of the NN m

     This paper develop conventional Runge-Kutta methods of order four and order five to solve ordinary differential equations with oscillating solutions. The new modified Runge-Kutta methods (MRK) contain the invalidation of phase lag, phase lag’s derivatives, and amplification error. Numerical tests from their outcomes show the robustness and competence of the new methods compared to the well-known Runge-Kutta methods in the scientific literature.

    The current study was designed to investigate the occurrence of aflatoxin B1 in thirty two samples of fish feedstuff were collected randomly from some Iraqi local markets using ELISA technique. Aflatoxin B1 was detected in thirty samples and the concentration of toxin ranged from 50 ppb to 1000 ppb.  

   Microwave and ozone were used for detoxification of aflatoxin B1 from sample with highest concentration (1000 ppb), two degree of temperature and two times (50°C and 100°C for 5 minute and 10 minute to each degree) of microwave, also two doses and two times (2 g and 4 g for 5 minute and 10 minute to each dose) of ozone gas were used.

   Degradation of aflatoxin B1 by

In this study, a genetic algorithm (GA) is used to detect damage in curved beam model, stiffness as well as mass matrices of the curved beam elements is formulated using Hamilton's principle. Each node of the curved beam element possesses seven degrees of freedom including the warping degree of freedom. The curved beam element had been derived based on the Kang and Yoo’s thin-walled curved beam theory. The identification of damage is formulated as an optimization problem, binary and continuous genetic algorithms
(BGA, CGA) are used to detect and locate the damage using two objective functions (change in natural frequencies, Modal Assurance Criterion MAC). The results show the objective function based on change in natural frequency i

Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff