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 research aims to Measurement provide the service from Two perspectives The first perspective Service Provider (doctors) and the second recipient of the service (patients) in Numan General Hospital, and represented the research problem in perceptions of medical staff in the hospital assigned to them responsibility by providing superior services satisfy customers, and how they maintained ready to assist customers and provide services that exceed their perceptions of these services through the use of the developer scale by (Frimpong and Wilson, 2012), includes orientation to provide the service scale four dimensions (Internal cooperative behaviors, service Competence, Service Responsiveness and Enhanced service) and includes do
... Show More
(22)
(14)
(3)
الذات والتحصيل الدراسي . وقد استخدمت الباحثة المنهج الوصفي التحليلي، وبلغت عينة الدراسة (500) طالبًا وطالبة، تم اختيارهم بالطريقة الطبقية العشوائية وهي تمثل (15%) من مجتمع الدراسة البالغ (3328) طالباً وطالبة من طلبة المرحلة الإعدادية واستخدمت الباحثة مقياسين تم بناء مقياس لقياس الجوهر والمظهر وتبني مقياس فاعلية الذات بعد إن قامت بترجمته وتعريبه وجعله ملائم للبيئة العراقية، كم تم استخراج درجات التحصيل الدراسي للع
... Show More
(1)
Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove
... Show More
(8)
(5)
Future wireless networks will require advance physical-layer techniques to meet the requirements of Internet of Everything (IoE) applications and massive communication systems. To this end, a massive MIMO (m-MIMO) system is to date considered one of the key technologies for future wireless networks. This is due to the capability of m-MIMO to bring a significant improvement in the spectral efficiency and energy efficiency. However, designing an efficient downlink (DL) training sequence for fast channel state information (CSI) estimation, i.e., with limited coherence time, in a frequency division duplex (FDD) m-MIMO system when users exhibit different correlation patterns, i.e., span distinct channel covariance matrices, is to date ve
... Show More
(3)
(3)
(1)
(1)
(2)