The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons

Background: Scientific education aims to be inclusive and to improve students learning achievements, through appropriate teaching and learning. Problem Based Learning (PBL) system, a student centered method, started in the second half of the previous century and is expanding progressively, organizes learning around problems and students learn about a subject through the experience of solving these problems.Objectives:To assess the opinions of undergraduate medical students regarding learning outcomes of PBL in small group teaching and to explore their views about the role of tutors and methods of evaluation. Type of the study: A cross-sectional study.Methods: This study was conducted in Kerbala Medical Colleges among second year students

The production companies in the Iraqi industry environment facing many of the problems related to the management of inventory and control In particular in determining the quantities inventory that should be hold it. Because these companies  adoption on personal experience and some simple mathematical methods which lead to the identification of inappropriate quantities of inventory.

       This research aims to identify the economic quantity of production and purchase for the Pepsi can 330ml and essential components in Baghdad soft drinks Company in an environment dominated by cases of non ensure and High fluctuating as a result of fluctuating demand volumes and costs ass

The main objective of this paper is to designed algorithms and implemented in the construction of the main program designated for the determination the tenser product of representation for the special linear group.

In this paper, we introduced some new definitions on P-compact topological ring and PL-compact topological ring for the compactification in topological space and rings, we obtain some results related to P-compact and P-L compact topological ring.

The deep learning algorithm has recently achieved a lot of success, especially in the field of computer vision. This research aims to describe the classification method applied to the dataset of multiple types of images (Synthetic Aperture Radar (SAR) images and non-SAR images). In such a classification, transfer learning was used followed by fine-tuning methods. Besides, pre-trained architectures were used on the known image database ImageNet. The model VGG16 was indeed used as a feature extractor and a new classifier was trained based on extracted features.The input data mainly focused on the dataset consist of five classes including the SAR images class (houses) and the non-SAR images classes (Cats, Dogs, Horses, and Humans). The Conv

              In this paper, the packing problem for complete (  4)-arcs in  is partially solved. The minimum and the maximum sizes of complete (  4)-arcs in  are obtained. The idea that has been used to do this classification is based on using the algorithm introduced in Section 3 in this paper. Also, this paper establishes the connection between the projective geometry in terms of a complete ( , 4)-arc in  and the algebraic characteristics of a plane quartic curve over the field  represented by the number of its rational points and inflexion points. In addition, some sizes of complete (  6)-arcs in the projective plane of order thirteen are established, namely for  = 53, 54, 55, 56.

          The use of silicon carbide is increasing significantly in the fields of research and technology. Topological indices enable data gathering on algebraic graphs and provide a mathematical framework for analyzing the chemical structural characteristics. In this paper, well-known degree-based topological indices are used to analyze the chemical structures of silicon carbides. To evaluate the features of various chemical or non-chemical networks, a variety of topological indices are defined. In this paper, a new concept related to the degree of the graph called "bi-distance" is introduced, which is used to calculate all the additive as well as multiplicative degree-based indices for the isomer of silicon carbide, Si₂

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.