In this study, condensation polymerization was used to synthesize a number of novel liquid crystal polymers with 1,3,4-oxadiazole rings based on melamine. The new synthesized polymers were characterized by Fourier transform infrared (FTIR) and proton nuclear magnetic resonance (1HNMR) spectroscopy. Differential scanning calorimetry (DSC) and optical polarization microscopy (OPM) were used to investigate their liquid crystalline properties. The results demonstrated that throughout a wide temperature range, most of the polymers exhibited columnar (CohX) and nematic (N) liquid crystalline phases.

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.

Optimizing system performance in dynamic and heterogeneous environments and the efficient management of computational tasks are crucial. This paper therefore looks at task scheduling and resource allocation algorithms in some depth. The work evaluates five algorithms: Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), Firefly Algorithm (FA) and Simulated Annealing (SA) across various workloads achieved by varying the task-to-node ratio. The paper identifies Finish Time and Deadline as two key performance metrics for gauging the efficacy of an algorithm, and a comprehensive investigation of the behaviors of these algorithms across different workloads was carried out. Results from the experiment

To evaluate the Interaction of Mn(II), Fe(II), Co(II), Ni(II),Cu(II), Zn(II) And Cd(II) Mixed- Ligand Complexes of cephalexin mono hydrate (antibiotics) And Furan-2-Carboxylic Acid To The Different DNA Sources. All the metal complexes were observed to cleave the DNA. A difference in the bands of complexes .The cleavage efficiency of the complexes compared with that of the control is due to their efficient DNA-binding ability and the other factors like solubility and bond length between the metal and ligand may also increase the DNA-binding ability. The ligands (Cephalexin mono hydrate (antibiotics) and Furan-2- Carboxylic acid and there newly synthesized metal complexes shows good antimicrobial activities and Binding DNA , thus, can be used

Prostheses are used as an alternative to organs lost from the body. Flex-Foot Cheetah is considered one of the lower limb prostheses used in high-intensity activities such as running. This research focused on testing two samples of Flex-Foot Cheetah manufactured of two various materials (carbon, glass) with polyester and compare between them to find the foot with the best performance in running on the level of professional athlete. In the numerical analysis, the maximum principal stress, maximum principal elastic strain, strain energy; finally, the blade total deformation were calculated for both feet. In experimental work, the load-deflection test was done for foot to calculate the bending the results were very close to

In this research, the focus was on estimating the parameters on (min- Gumbel distribution), using the maximum likelihood method and the Bayes method. The genetic algorithmmethod was employed in estimating the parameters of the maximum likelihood method as well as  the Bayes method. The comparison was made using the mean error squares (MSE), where the best  estimator  is the one who has the least mean squared error. It was noted that the best estimator was (BLG_GE).

Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff