Preferred Language
Articles
/
Zhf3oZABVTCNdQwCs487
Some Games Via (D, DL) Compact Topological Groups
...Show More Authors

    The aim of our work is to develop a new type of games which are related to (D, WD, LD) compactness of topological groups. We used an infinite game that corresponds to our work. Also, we used an alternating game in which the response of the second player depends on the choice of the first one. Many results of winning and losing strategies have been studied, consistent with the nature of the topological groups. As well as, we presented some topological groups, which fail to have winning strategies and we give some illustrated examples. Finally, the effect of functions on the aforementioned compactness strategies was studied.  

Scopus Crossref
Preview PDF
Quick Preview PDF
Publication Date
Fri Nov 24 2023
Journal Name
International Journal Of Statistics In Medical Research
A Novel Algorithm for Predicting Antimicrobial Resistance in Unequal Groups of Bacterial Isolates
...Show More Authors

Choosing antimicrobials is a common dilemma when the expected rate of bacterial resistance is high. The observed resistance values in unequal groups of isolates tested for different antimicrobials can be misleading. This can affect the decision to recommend one antibiotic over the other. We analyzed recalled data with the statistical consideration of unequal sample groups. Data was collected concerning children suspected to have typhoid fever at Al Alwyia Pediatric Teaching Hospital in Baghdad, Iraq. The study period extended from September 2021 to September 2022. A novel algorithm was developed to compare the drug sensitivity among unequal numbers of Salmonella typhi (S. Typhi) isolates tested with different antibacterials.

... Show More
View Publication
Scopus Crossref
Publication Date
Mon Jan 08 2024
Journal Name
Iraqi Journal For Computer Science And Mathematics
Applications for the groups S.U.T.(2,p) where p prime upper than 9
...Show More Authors

The problem of finding the cyclic decomposition (c.d.) for the groups ), where  prime upper than 9 is determined in this work. Also, we compute the Artin characters (A.ch.) and Artin indicator (A.ind.) for the same groups, we obtain that after computing the conjugacy classes, cyclic subgroups, the ordinary character table (o.ch.ta.) and the rational valued character table for each group.

View Publication
Scopus (10)
Scopus Crossref
Publication Date
Mon Dec 04 2017
Journal Name
Al-qadisiyah Journal For Administrative And Economic Sciences
Survival Function Estimating of Single age Groups for Generalized Gamma Distribution with Simulation.
...Show More Authors

The analysis of survival and reliability considered of topics and methods of vital statistics at the present time because of their importance in the various demographical, medical, industrial and engineering fields. This research focused generate random data for samples from the probability distribution Generalized Gamma: GG, known as: "Inverse Transformation" Method: ITM, which includes the distribution cycle integration function incomplete Gamma integration making it more difficult classical estimation so will be the need to illustration to the method of numerical approximation and then appreciation of the function of survival function. It was estimated survival function by simulation the way "Monte Carlo". The Entropy method used for the

... Show More
Preview PDF
Publication Date
Wed Feb 01 2023
Journal Name
Baghdad Science Journal
3-D Packing in Container using Teaching Learning Based Optimization Algorithm
...Show More Authors

The paper aims to propose Teaching Learning based Optimization (TLBO) algorithm to solve 3-D packing problem in containers. The objective which can be presented in a mathematical model is optimizing the space usage in a container. Besides the interaction effect between students and teacher, this algorithm also observes the learning process between students in the classroom which does not need any control parameters. Thus, TLBO provides the teachers phase and students phase as its main updating process to find the best solution. More precisely, to validate the algorithm effectiveness, it was implemented in three sample cases. There was small data which had 5 size-types of items with 12 units, medium data which had 10 size-types of items w

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Fri Mar 29 2024
Journal Name
Iraqi Journal Of Science
Biological versus Topological Domains in Improving the Reliability of Evolutionary-Based Protein Complex Detection Algorithms
...Show More Authors

     By definition, the detection of protein complexes that form protein-protein interaction networks (PPINs) is an NP-hard problem. Evolutionary algorithms (EAs), as global search methods, are proven in the literature to be more successful than greedy methods in detecting protein complexes. However, the design of most of these EA-based approaches relies on the topological information of the proteins in the PPIN. Biological information, as a key resource for molecular profiles, on the other hand, acquired a little interest in the design of the components in these EA-based methods. The main aim of this paper is to redesign two operators in the EA based on the functional domain rather than the graph topological domain. The perturb

... Show More
Scopus Crossref
Publication Date
Tue Mar 15 2022
Journal Name
Alustath
The Predicament of Youth in J D Salinger Franny and Zooey
...Show More Authors

This research deals with Salinger's concerns about predicaments of youth like Franny and her brother Zooey. Their predicaments are related to identity, family, religion, beliefs, life and death, education, source of power, and society. It illustrates adults struggle to adapt themselves to live a normal social American life. It proves necessary to balance their coexistence in a materialistic milieu to achieve spiritual peace, tranquility, and stability.

View Publication
Publication Date
Tue Dec 05 2023
Journal Name
Baghdad Science Journal
Further Results on (a, d) -total Edge Irregularity Strength of Graphs
...Show More Authors

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Wed Feb 01 2023
Journal Name
Baghdad Science Journal
Efficient Approach for Solving (2+1) D- Differential Equations
...Show More Authors

     In this article, a new efficient approach is presented to solve a type of partial differential equations, such (2+1)-dimensional differential equations non-linear, and nonhomogeneous. The procedure of the new approach is suggested to solve important types of differential equations and get accurate analytic solutions i.e., exact solutions. The effectiveness of the suggested approach based on its properties compared with other approaches has been used to solve this type of differential equations such as the Adomain decomposition method, homotopy perturbation method, homotopy analysis method, and variation iteration method. The advantage of the present method has been illustrated by some examples.

View Publication Preview PDF
Scopus (8)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Pakistan Journal Of Biotechnology
Sequences of mitocondrial D-loop region in Iraqi persons
...Show More Authors

Scopus (5)
Scopus
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
On The Convergence Speediness of K * and D-Iterations
...Show More Authors
Abstract<p>In this article, we introduced a new concept of mappings called δZA - Quasi contractive mapping and we study the K*- iteration process for approximation of fixed points, and we proved that this iteration process is faster than the existing leading iteration processes like Noor iteration process, CR -iteration process, SP and Karahan Two- step iteration process for 𝛿𝒵𝒜 − quasi contraction mappings. We supported our analytic proof by a numerical example.</p>
View Publication
Scopus (5)
Crossref (5)
Scopus Crossref