<span lang="EN-US">Diabetes is one of the deadliest diseases in the world that can lead to stroke, blindness, organ failure, and amputation of lower limbs. Researches state that diabetes can be controlled if it is detected at an early stage. Scientists are becoming more interested in classification algorithms in diagnosing diseases. In this study, we have analyzed the performance of five classification algorithms namely naïve Bayes, support vector machine, multi layer perceptron artificial neural network, decision tree, and random forest using diabetes dataset that contains the information of 2000 female patients. Various metrics were applied in evaluating the performance of the classifiers such as precision, area under the c
... Show MoreGas hydrate formation poses a significant threat to the production, processing, and transportation of natural gas. Accurate predictions of gas hydrate equilibrium conditions are essential for designing the gas production systems at safe operating conditions and mitigating the problems caused by hydrates formation. A new hydrate correlation for predicting gas hydrate equilibrium conditions was obtained for different gas mixtures containing methane, nitrogen and carbon dioxide. The new correlation is proposed for a pressure range of 1.7-330 MPa, a temperature range of 273-320 K, and for gas mixtures with specific gravity range of 0.553 to 1. The nonlinear regression technique was applie
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.
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 Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreThroughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.
Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.
This study aimed to develop a more accurate model for predicting the widths of unerupted canines and premolars in Emirati children, using deep learning and machine learning techniques. Dental models of 380 Emirati individuals aged 15–30 years were collected. The mesiodistal widths of permanent teeth were measured with a standardized orthodontic digital caliper. Regression models were developed using linear regression, Support Vector Regression (SVR; machine learning), and Artificial Neural Networks (ANN; deep learning). The widths of mandibular lateral incisors, central incisors, and the summed width of mandibular incisors were used as predictors. A two-tail
This paper contains an equivalent statements of a pre- space, where are considered subsets of with the product topology. An equivalence relation between the preclosed set and a pre- space, and a relation between a pre- space and the preclosed set with some conditions on a function are found. In addition, we have proved that the graph of is preclosed in if is a pre- space, where the equivalence relation on is open.
On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that
... Show More