Theatrical costume constitutes a peculiarity in the theatrical performance because of its ability to communicate and communicate with the rest of the visual elements of the show in highlighting the intellectual and dramatic values. Fashion developments in theatrical performance, the second: the design elements of costumes and their characteristics, the third, which includes research procedures, and the fourth, in which the research results and conclusions were presented, including:

• The play (Happening on the Farm) is considered one of the plays with educational, educational and aesthetic goals, as it carried in its formats the features of simplicity and diversity of the visual formal connotations of the child.
• The c

         A theoretical calculations of the rate constant of electron transfer (ET) in a dye – semiconductor system with variety solvent are applied on system contains safranineT dye with TiO₂ in many solvents like water, 1-propanol, Formamide, Acetonitrile and Ethanol.

    A matlap program has been written to evaluate many parameters such that, the solvent reorganization energy, effective free energy, activation free energy, coupling matrix element and the rate constant of electron transfer.

    The results of the rate constant of electron transfer calculated theoretically are in a good agreement with experimental and theoretical value

Deep learning has recently received a lot of attention as a feasible solution to a variety of artificial intelligence difficulties. Convolutional neural networks (CNNs) outperform other deep learning architectures in the application of object identification and recognition when compared to other machine learning methods. Speech recognition, pattern analysis, and image identification, all benefit from deep neural networks. When performing image operations on noisy images, such as fog removal or low light enhancement, image processing methods such as filtering or image enhancement are required. The study shows the effect of using Multi-scale deep learning Context Aggregation Network CAN on Bilateral Filtering Approximation (BFA) for d

The aim of the research is to apply fibrewise multi-emisssions of the paramount separation axioms of normally topology namely fibrewise multi-T0. spaces, fibrewise multi-T1 spaces, fibrewise multi-R0 spaces, fibrewise multi-Hausdorff spaces, fibrewise multi-functionally Hausdorff spaces, fibrewise multi-regular spaces, fibrewise multi-completely regular spaces, fibrewise multi-normal spaces and fibrewise multi-functionally normal spaces. Also we give many score regarding it.

We define and study new ideas of fibrewise topological space on D namely fibrewise multi-topological space on D. We also submit the relevance of fibrewise closed and open topological space on D. Also fibrewise multi-locally sliceable and fibrewise multi-locally section able multi-topological space on D. Furthermore, we propose and prove a number of statements about these ideas.

The aim of this work presents the analytical studies of both the magnetohydrodynamic (MHD) flux and flow of the non-magnetohydro dynamic (MHD) for a fluid of generalized Burgers’ (GB) withinan annular pipe submitted under Sinusoidal  Pressure (SP)gradient. Closed beginning velocity's' solutions are taken by performing the finite Hankel transform (FHT) and Laplace transform (LT) of the successivefraction derivatives. Lastly, the figures were planned to exhibition the transformations effects of different fractional parameters (DFP) on the profile of velocity of both flows.

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord