The process of discovering pharmaceuticals is of great importance in our contemporary life, in a way that without life becomes almost impossible, as this process is the first building block in the field of pharmaceutical industries to search for new methods and means of treatment and treatment. But in fact, the fact that talking about this process is not that simple and easy, because this process is complicated and difficult in a way that makes it take a time range that in some cases reaches what is permissible ten years to reach a chemical formula that can be used later in the manufacturing process Pharmacokinetics, and during this long period of time, this process will have a set of effects, some of which are specific to the researcher di

Background: Cancer is a lethal disease that results from a multifactorial process. Progression into carcinogenesis and an abnormal cell proliferation can occur due to the micro and macro environment as well as genetic mutations and modifications. In this review, cancer and the microbiota – mainly bacteria that inhabit the tumour tissue – have been discussed. The positive and negative impacts of the commensal bacteria on tumours being protective or carcinogenic agents, respectively, and their strategies have also been described. Methods: Related published articles written in English language were searched from Google Scholar, PubMed, Mendeley suggestions, as well as Google search using a combination of the keywords ‘Microbiota, commens

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

HM Al-Dabbas, RA Azeez, AE Ali, IRAQI JOURNAL OF COMPUTERS, COMMUNICATIONS, CONTROL AND SYSTEMS ENGINEERING, 2023

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

Cryptography is a major concern in communication systems. IoE technology is a new trend of smart systems based on various constrained devices. Lightweight cryptographic algorithms are mainly solved the most security concern of constrained devices and IoE systems. On the other hand, most lightweight algorithms are suffering from the trade-off between complexity and performance. Moreover, the strength of the cryptosystems, including the speed of the algorithm and the complexity of the system against the cryptanalysis. A chaotic system is based on nonlinear dynamic equations that are sensitive to initial conditions and produce high randomness which is a good choice for cryptosystems. In this work, we proposed a new five-dimensional of a chaoti