Original Research Paper Mathematics 1-Introduction : In the light of the progress and rapid development of the applications of research in applications fields, the need to rely on scientific tools and cleaner for data processing has become a prominent role in the resolution of decisions in industrial and service institutions according to the real need of these methods to make them scientific methods to solve the problem Making decisions for the purpose of making the departments succeed in performing their planning and executive tasks. Therefore, we found it necessary to know the transport model in general and to use statistical methods to reach the optimal solution with the lowest possible costs in particular. And you know The Transportation Problem (also called Hitchcock Problem and denoted by TP) is one of the classic problems in operation research, a special type of linear programming problem(2): Where : cij = unit transportation cost for each source i to destination j. xij = number of units from source to destination. ai = supply from sources ; bj= demand from destination We have to determine the optimal shipments from a given set of origins to a given set of destinations in such a way as to minimize the total (7) transportation costs. Have been widely studied in computer science and operations research. It is one of the fundamental problems of network flow problem which is usually use to minimize the transportation cost for industries with number of sources and number of destination while (1) satisfying the supply limit and demand requirement. The problem is constrained by known upper limits on the supply at the various origins and by the necessity to satisfy the known demand at each destination. The classical transportation model assumes that the per unit cost for each potential origin destination pair is known a (2) priori. It was first studied by F. L. Hitchcock in 1941, then separately by T. C. Koopmans in 1947, and finally placed in the framework of linear programming and solved by simplex method by G. B. Dantzig in 1951 (3)(4) .The first step of the simplex method for the transportation problem is to determine an initial basic feasible solution. The simplest procedure for finding an initial basic feasible solution was proposed by Dantzig (1951) and was termed the northwest corner rule by charnes (5)
In this paper, we will study non parametric model when the response variable have missing data (non response) in observations it under missing mechanisms MCAR, then we suggest Kernel-Based Non-Parametric Single-Imputation instead of missing value and compare it with Nearest Neighbor Imputation by using the simulation about some difference models and with difference cases as the sample size, variance and rate of missing data.
A nonlinear filter for smoothing color and gray images
corrupted by Gaussian noise is presented in this paper. The proposed
filter designed to reduce the noise in the R,G, and B bands of the
color images and preserving the edges. This filter applied in order to
prepare images for further processing such as edge detection and
image segmentation.
The results of computer simulations show that the proposed
filter gave satisfactory results when compared with the results of
conventional filters such as Gaussian low pass filter and median filter
by using Cross Correlation Coefficient (ccc) criteria.
Rheumatoid arthritis and periodontitis use analogous effector destructive procedures, in that the inflammatory cells and pro-inflammatory cytokines that drive chronic bone erosion in RA and chronic periodontal destruction in Periodontitis are alike. Periodontitis (PD) has appeared as a hazard factor in a number of health situations as rheumatoid arthritis (RA). To determine the effect of anti-tumor necrosis factor alpha biological treatment (methotrexate and Enbrel or infliximab) on periodontal status of patients having rheumatoid arthritis with periodontitis in comparison to those having periodontitis without rheumatoid arthritis and control healthy subjects and to determine the serum levels of anti-cyclic citrullinated peptide (ACCP) in t
... Show More
(58)
(44)
A linear and nonlinear theoretical and experimental aeroelastic investigation of a wing-flap-tab typical section model undergoing two-dimensional incompressible airflow is described. The linear flutter velocity (LFV) and frequency are predicted using linear analysis. Then a freeplay structural nonlinearity is considered in the tab. The structural equations of motion have been coupled with Theodorsen aerodynamic theory to produce the theoretical aeroelastic model which is analyzed by a state space method to predict the LFV and flutter frequency. Linear piecewise function has been used to introduce the tab spring stiffness in the freeplay state. The ground vibration test is used to measure the model structural dynamic characteristics. Then th
... Show More
(24)
(21)
(19)
(20)
In the current worldwide health crisis produced by coronavirus disease (COVID-19), researchers and medical specialists began looking for new ways to tackle the epidemic. According to recent studies, Machine Learning (ML) has been effectively deployed in the health sector. Medical imaging sources (radiography and computed tomography) have aided in the development of artificial intelligence(AI) strategies to tackle the coronavirus outbreak. As a result, a classical machine learning approach for coronavirus detection from Computerized Tomography (CT) images was developed. In this study, the convolutional neural network (CNN) model for feature extraction and support vector machine (SVM) for the classification of axial
... Show More
(13)
(3)
Let G be a graph with p vertices and q edges and be an injective function, where k is a positive integer. If the induced edge labeling defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G. A graph which admits an odd Fibonacci edge irregular labeling is called an odd Fibonacci edge irregular graph. The odd Fibonacci edge irregularity strength ofes(G) is the minimum k for which G admits an odd Fibonacci edge irregular labeling. In this paper, the odd Fibonacci edge irregularity strength for some subdivision graphs and graphs obtained from vertex identification is determined.
(2)
(29)
(24)
(12)
(12)