Drama is one of the means of transmitting human experiences, as it presents within it the life ideas and visions of the spectator, who is subject to their influence on him, robbed of the will in front of its charm and various display arts, which invade him with its dimensions and affect his references, and this art form is based on stories revolving around personalities involved in events that have grown As a result of the struggle of two conflicting opponents, or two opposing forces or emotions generated as a result of a voluntary conflict, as this dramatic conflict represents the most important elements of those events, as it is embodied in an inevitable scene that emerges from other scenes, and this scene is sometimes subject to the

The research topic (The dramatic structure transformations in the Iraqi Feature Film) studies the dramatic structure and its transformations in the Iraqi feature film. The research determined the research problem and the need for it in addition to the aims and the limits of the study as well as its importance. The theoretical framework consists of the following themes: the dramatic transformations mechanism and dramatic data in the Iraq film 1957-2003 then the dramatic values transformations and the performance contradictions in the Iraqi film.
The research, after concluding the theoretical framework, came up with a number of indicators of the theoretical framework that have been used as a tool to analyze the sample. The research proc

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co