This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

The Diffie-Hellman is a key exchange protocol to provide a way to transfer shared secret keys between two parties, although those parties might never have communicated together. This paper suggested a new way to transfer keys through public or non-secure channels depending on the sent video files over the channel and then extract keys. The proposed method of key generation depends on the video file content by using the entropy value of the video frames. The proposed system solves the weaknesses in the Diffie-Hellman key exchange algorithm, which is MIMA (Man-in-the-Middle attack) and DLA( Discrete logarithm attack). When the method used high definition videos with a vast amount of data, the keys generated with a large number up to 5

Abstract:
Al-Marba'aniyah, which is a long cold wave, was defined by ancient
Iraqis. It represents the coldest days in Iraq. In this research paper, a new
scale was put to define it. It shows that the period between the minimum
temperature degree recoded in December and the minimum temperature
degree recorded in January is considered to be the period of Al-Marba'aniyah.
The research concluded that Al-Marba'aniyah is unsteady and it changes in
the days of its occurrence. It was also concluded that the dates of the
beginning and the end of Al-Marba'aniyah are unsteady, too. Moreover, it was
found out that each of the Siberian high, European high, and finally the
subtropical high are the responsible systems for

In the present work studies were carried out to extract a cationic dye (Methylene Blue MB) from an aqueous solution using emulsion liquid membrane process (ELM). The organic phase (membrane phase) consists of Span 80 as emulsifier, sulfuric acid solution as stripping agent and hexane as diluent. 

In this study, important factors influencing the extraction of methylene blue dye were studied. These factors include H₂SO₄ concentration in the stripping phase, agitation speed in the dye permeation stage, Initial dye concentration and diluent type.

   More than (98%) of Methylene blue dye was extracted at the following conditions: H₂SO₄ concentration (1.25) M, agitation

Finding orthogonal matrices in different sizes is very complex and important because it can be used in different applications like image processing and communications (eg CDMA and OFDM). In this paper we introduce a new method to find orthogonal matrices by using tensor products between two or more orthogonal matrices of real and imaginary numbers with applying it in images and communication signals processing. The output matrices will be orthogonal matrices too and the processing by our new method is very easy compared to other classical methods those use basic proofs. The results are normal and acceptable in communication signals and images but it needs more research works.

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res