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)
(1)
Estimation of the unknown parameters in 2-D sinusoidal signal model can be considered as important and difficult problem. Due to the difficulty to find estimate of all the parameters of this type of models at the same time, we propose sequential non-liner least squares method and sequential robust M method after their development through the use of sequential approach in the estimate suggested by Prasad et al to estimate unknown frequencies and amplitudes for the 2-D sinusoidal compounds but depending on Downhill Simplex Algorithm in solving non-linear equations for the purpose of obtaining non-linear parameters estimation which represents frequencies and then use of least squares formula to estimate
... Show More
This research was designed to investigate the factors affecting the frequency of use of ride-hailing in a fast-growing metropolitan region in Southeast Asia, Kuala Lumpur. An intercept survey was used to conduct this study in three potential locations that were acknowledged by one of the most famous ride-hailing companies in Kuala Lumpur. This study used non-parametric and machine learning techniques to analyze the data, including the Pearson chi-square test and Bayesian Network. From 38 statements (input variables), the Pearson chi-square test identified 14 variables as the most important. These variables were used as predictors in developing a BN model that predicts the probability of weekly usage frequency of ride-hai
... 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
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
(2)
(1)
(15)
(6)
The fingerprinting DNA method which depends on the unique pattern in this study was employed to detect the hydatid cyst of Echinococcus granulosus and to determine the genetic variation among their strains in different intermediate hosts (cows and sheep). The unique pattern represents the number of amplified bands and their molecular weights with specialized sequences to one sample which different from the other samples. Five hydatitd cysts samples from cows and sheep were collected, genetic analysis for isolated DNA was done using PCR technique and Random Amplified Polymorphic DNA reaction(RAPD) depending on (4) random primers, and the results showed:
... Show More
(1)
The -mixing of - transition in Er 168 populated in Er)n,n(Er 168168 reaction is calculated in the present work by using a2- ratio method. This method has used in previou studies [4, 5, 6, 7] in case that the second transition is pure or for that transition which can be considered as pure only, but in one work we applied this method for two cases, in the first one for pure transition and in the 2nd one for non pure transitions. We take into accunt the experimental a2- coefficient for p revious works and -values for one transition only [1]. The results obtained are, in general, in agood agreement within associated errors, with those reported previously [1], the discrepancies that occur are due to inaccuracies existing
... Show MoreAn easy, eclectic, precise high-Performance Liquid Chromatographic (HPLC) procedure was evolved and validated to estimate of Piroxicam and Codeine phosphate. Chromatographic demarcation was accomplished on a C18 column [Use BDS Hypersil C18, 5μ, 150 x 4.6 mm] using a mobile phase of methanol: phosphate buffer (60:40, v/v, pH=2.3), the flow rate was 1.1 mL/min, UV detection was at 214 nm. System Suitability tests (SSTs) are typically performed to assess the suitability and effectiveness of the entire chromatography system. The retention time for Piroxicam was found to be 3.95 minutes and 1.46 minutes for Codeine phosphate. The evolved method has been validated through precision, limit of quantitation, specificity,
... Show More
(4)
(2)