This research work considers one of the authentic and most modern modes of storytelling, as employed by Garcia Marquez in one of his famous stories "An Old ManWith Enormous Wings" (1972). Technically, the work is divided into four parts: the first serves as an introduction to his literary works, his use of magic realism, and addresses mainly the interests of Arab readers; the second handles the development of modern short story through the perspective of realism, until the emergence of magic realism as a new style; the third deals with the origin, nature and development of this style, and his mastery of it; the fourth part tries to analyze the story and its plot, thoughts, characters, symbols and metaphors, in the light of the artistic p

In this paper, we characterize normal composition operators induced by holomorphic self-map , when and .Moreover, we study other related classes of operators, and then we generalize these results to polynomials of degree n.

Necessary and sufficient conditions for the operator equation I AXAX n*, to have a real positive definite solution X are given. Based on these conditions, some properties of the operator A as well as relation between the solutions X andAare given.

Antimicrobial resistance (AMR) is a serious challenge for infectious disease prevention and treatment, according to the World Health Organization. It is a worldwide problem caused primarily by inappropriate and insufficient therapy, misuse of antimicrobials without physician supervision, unnecessary hospital readmissions, and other factors. AMR has several consequences, including increased medical costs and mortality. The present study aimed to evaluate imipenem resistance in gram-negative bacteria in Central Pediatric Teaching Hospital in Baghdad, Iraq, and determine this bacteria resistance in different samples. Initially, a total of 100 different samples were collected from child patients from October 1, 2020, to August 31, 2021. Each is

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the