The aim of this research is to construct a three-dimensional maritime transport model to transport nonhomogeneous goods (k) and different transport modes (v) from their sources (i) to their destinations (j), while limiting the optimum quantities v ijk x to be transported at the lowest possible cost v ijk c and time v ijk t using the heuristic algorithm, Transport problems have been widely studied in computer science and process research and are one of the main problems of transport problems that are usually used to reduce the cost or times of transport of goods with a number of sources and a number of destinations and by means of transport to meet the conditions of supply and demand. Transport models are a key tool in logistics and supply chain management to reduce costs, times or improve services, In this study Three algorithms were proposed to solve the transport matrix (Range(R), Arithmetic Mean(AM), Cost Slop(CO)), and this algorithm must meet the requirements of problem restrictions and goals to reach good solutions, and may sometimes be the optimal solutions so we will adopt any solutions that are the best and optimal through our findings in the application of heuristic algorithms and based on the final results can be based on the heuristic method., The research concluded that the best reasoning method is the (arithmetic mean(AM)) because it gave the best results in reducing the total (cost and time) before and after the optimization method (MODI), It also gave the cost inclination method less total costs and time higher than the method of arithmetic mean After conducting the optimization method(MODI)
Cryptographic applications demand much more of a pseudo-random-sequence
generator than do most other applications. Cryptographic randomness does not mean just
statistical randomness, although that is part of it. For a sequence to be cryptographically
secure pseudo-random, it must be unpredictable.
The random sequences should satisfy the basic randomness postulates; one of them is
the run postulate (sequences of the same bit). These sequences should have about the same
number of ones and zeros, about half the runs should be of length one, one quarter of length
two, one eighth of length three, and so on.The distribution of run lengths for zeros and ones
should be the same. These properties can be measured determinis
The research aims to enhance the level of evaluation of the performance of banking transactions control policies and procedures. The research is based on the following hypothesis: efficient transactions control policies and procedures contribute enhancing financial reporting, by assessing non-application gap of those policies and procedures in a manner that helps to prevent, discover, and correct material misstatements. The researchers designed an examination list that includes the control policies and procedures related to the transactions, as a guide to the bank audit program prepared by the Federal Financial Supervision Bureau. The research methodology is
... Show More
(2)
Silver nanoparticles synthesized by different species
(1)
In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.
(3)
The Beggar (1965) is a story of isolation and depression which is written by the Egyptian novelist Naguib Mahfouz who is considered the father of Arabic Literature in the modern era. Specifically, he refers in his great novel called The Beggar that the man unable to achieve psychological revival after Nasser’s revolution, the man sacrificed his own job and his family for a desire that increases his feelings of alienation and depression which leads him to an emotional outcry against the indifferent. The main aim of the study highlights the concept of existential dilemma as a philosophical problem and personality crisis by the protagonist of The Beggar novel, Omer Al-Hamzawi who had acc
... Show More
This research deals with the use of a number of statistical methods, such as the kernel method, watershed, histogram, and cubic spline, to improve the contrast of digital images. The results obtained according to the RSME and NCC standards have proven that the spline method is the most accurate in the results compared to other statistical methods.
This research deals with the use of a number of statistical methods, such as the kernel method, watershed, histogram and cubic spline, to improve the contrast of digital images. The results obtained according to the RSME and NCC standards have proven that the spline method is the most accurate in the results compared to other statistical methods
This investigation aimed to explain the mechanism of MFCA by applying this method on air-cooled engine factory which was suffering from high production cost. The results of this study revealed that MFCA is a useful tool to identify losses and inefficiencies of the production process. It is found that the factory is suffering from high losses due to material energy and system losses. In conclusion, it is calculated that system losses are the highest among all the losses due to inefficient use of available production capacity.
(2)
In this paper, the topic of forecasting the changes in the value of Iraqi crude oil exports for the period from 2019 to 2025, using the Markov transitional series based on the data of the time series for the period from January 2011 to November 2018, is real data obtained from the published data of the Central Agency Of the Iraqi statistics and the Iraqi Ministry of Oil that the results reached indicate stability in the value of crude oil exports according to the data analyzed and listed in the annex to the research.
Keywords: Using Markov chains