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)
This paper proposed a new method to study functional non-parametric regression data analysis with conditional expectation in the case that the covariates are functional and the Principal Component Analysis was utilized to de-correlate the multivariate response variables. It utilized the formula of the Nadaraya Watson estimator (K-Nearest Neighbour (KNN)) for prediction with different types of the semi-metrics, (which are based on Second Derivative and Functional Principal Component Analysis (FPCA)) for measureing the closeness between curves. Root Mean Square Errors is used for the implementation of this model which is then compared to the independent response method. R program is used for analysing data. Then, when the cov
... Show More
(2)
(1)
(1)
(10)
(6)
(5)
(5)
A new method for determination of allopurinol in microgram level depending on its ability to reduce the yellow absorption spectrum of (I-3) at maximum wavelength ( ?max 350nm) . The optimum conditions such as "concentration of reactant materials , time of sitting and order of addition were studied to get a high sensitivity ( ? = 27229 l.mole-1.cm-1) sandal sensitivity : 0.0053 µg cm-2 ,with wide range of calibration curve ( 1 – 9 µg.ml-1 ) good stability (more then24 hr.) and repeatability ( RSD % : 2.1 -2.6 % ) , the Recovery % : ( 98.17 – 100.5 % ) , the Erel % ( 0.50 -1.83 % ) and the interference's of Xanthine , Cystein , Creatinine , Urea and the Glucose in 20 , 40 , 60 fold of analyate were also studied .
(2)
In this article, a numerical method integrated with statistical data simulation technique is introduced to solve a nonlinear system of ordinary differential equations with multiple random variable coefficients. The utilization of Monte Carlo simulation with central divided difference formula of finite difference (FD) method is repeated n times to simulate values of the variable coefficients as random sampling instead being limited as real values with respect to time. The mean of the n final solutions via this integrated technique, named in short as mean Monte Carlo finite difference (MMCFD) method, represents the final solution of the system. This method is proposed for the first time to calculate the numerical solution obtained fo
... Show More
(15)
(9)
This research presents a particular designing strategy for a free form of surfaces, constructed by the lofting design method. The regarded surfaces were created by sliding a B-spline curves (profile curves), in addition to describing an automatic procedure for selective identification of sampling points in reverse engineering applications using Coordinate Measurement Machine. Two models have been implemented from (Ureol material) to represent the different cases of B-spline types to clarify its scope of application. The interior data of the desired surfaces was designed by MATLAB software, which then were transformed to UG-NX9 software for connecting the sections that were designed in MATLAB program and obtaining G-code programs for the
... Show More
The exponential growth of audio data shared over the internet and communication channels has raised significant concerns about the security and privacy of transmitted information. Due to high processing requirements, traditional encryption algorithms demand considerable computational effort for real-time audio encryption. To address these challenges, this paper presents a permutation for secure audio encryption using a combination of Tent and 1D logistic maps. The audio data is first shuffled using Tent map for the random permutation. The high random secret key with a length equal to the size of the audio data is then generated using a 1D logistic map. Finally, the Exclusive OR (XOR) operation is applied between the generated key and the sh
... Show More