Cancer is one of the dangerous diseases that afflict a person through injury to cells and tissues in the body, where a person is vulnerable to infection in any age group, and it is not easy to control and multiply between cells and spread to the body. In spite of the great progress in medical studies interested in this aspect, the options for those with this disease are few and difficult, as they require significant financial costs for health services and for treatment that is difficult to provide.

This study dealt with the determinants of liver cancer by relying on the data of cancerous tumours taken from the Iraqi Center for Oncology in the Ministry of Health 2017. Survival analysis has been used as a m

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

Segmented regression consists of several sections separated by different points of membership, showing the heterogeneity arising from the process of separating the segments within the research sample. This research is concerned with estimating the location of the change point between segments and estimating model parameters, and proposing a robust estimation method and compare it with some other methods that used in the segmented regression. One of the traditional methods (Muggeo method) has been used to find the maximum likelihood estimator in an iterative approach for the model and the change point as well. Moreover, a robust estimation method (IRW method) has used which depends on the use of the robust M-estimator technique in

The primary aim of this paper, is to introduce the rough probability from topological view. We used the Gm-topological spaces which result from the digraph on the stochastic approximation spaces to upper and lower distribution functions, the upper and lower mathematical expectations, the upper and lower variances, the upper and lower standard deviation and the upper and lower r th moment. Different levels for those concepts are introduced, also we introduced some results based upon those concepts.

The study deals with the issue of multi-choice linear mathematical programming. The right side of the constraints will be multi-choice. However, the issue of multi-purpose mathematical programming can not be solved directly through linear or nonlinear techniques. The idea is to transform this matter into a normal linear problem and solve it In this research, a simple technique is introduced that enables us to deal with this issue as regular linear programming. The idea is to introduce a number of binary variables And its use to create a linear combination gives one parameter was used multiple. As well as the options of linear programming model to maximize profits to the General Company for Plastic Industries product irrigation sy

Many of the dynamic processes in different sciences are described by models of differential equations. These models explain the change in the behavior of the studied process over time by linking the behavior of the process under study with its derivatives. These models often contain constant and time-varying parameters that vary according to the nature of the process under study in this We will estimate the constant and time-varying parameters in a sequential method in several stages. In the first stage, the state variables and their derivatives are estimated in the method of penalized splines(p- splines) . In the second stage we use pseudo lest square to estimate constant parameters, For the third stage, the rem

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

:الملخص/كلية التربية هدف البحث الكشف عن التدريس الفاعل لأساتذة الكيمياء( . /ابن الهيثم، من وجهة نظر الطلبة وتكونت عينة البحث من للعلوم الصرفة80)طالبا( من طلبة قسم الكيمياء وللصفوف الأربعة في القسم، وتم تقويم50)أستاذا جامعيامن أساتذة القسم، واستخدم المنهج الوصفي في تحليل بيانات هذا البحث، وكذلك(علي الأزيرجاوي، استخدم مقياس التدريس الفاعل الذي أعده2010)بعد التحقق منصدقه وثباته، وقد أظهرت نتائج البحث أن متوسط درجا

In this paper we generalize some of the results due to Bell and Mason on a near-ring N admitting a derivation D , and we will show that the body of evidence on prime near-rings with derivations have the behavior of the ring. Our purpose in this work is to explore further this ring like behavior. Also, we show that under appropriate additional hypothesis a near-ring must be a commutative ring.

The concept of strong soft  pre-open set was initiated by Biswas and Parsanann.We utilize this notion to study several characterizations and properties of this set. We investigate the relationships between this set and other types of soft open sets. Moreover, the properties of the strong soft  pre-interior and closure are discussed. Furthermore, we define a new concept by using strong soft  pre-closed that we denote as locally strong soft  pre-closed, in which several results are obtained. We establish a new type of soft pre-open set, namely soft  pre-open. Also, we continue to study pre-  soft open set and discuss the relationships among all these sets. Some counter examples are given to show some relations