Novel azo ligand based on tryptamine, and its metal complexes with antioxidant properties were synthesized through chemical methods and characterized through various techniques, including IR, Mass, UV-Vis spectroscopy, elemental analysis, conductivity, magnetic sensitivity, and thermogravimetric analysis. According to the IR spectra of the complexes, the azo-ligand, [5-(2-(3H- 1-indol-3-yl) ethyl) diazenyl) quinolin-8-ol] coordinates with metal ions through the nitrogen atom in the quinoline ring and the oxygen atom of the hydroxyl group. Thermal analysis techniques were employed to investigate the thermal behavior of the compounds. The results revealed that the metal complexes possess higher thermal stability compared to the free ligand. T

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other