In this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app

Objectives: Teenage pregnancy with gestational diabetes mellitus (GDM) offers a real challenge to the health system and needs a special care. We aimed to evaluate possible obstetrical and neonatal adverse events of different treatment protocols in adolescent GDM including lifestyle, metformin (MTF), and insulin. Methods: All teen pregnant women ≤ 19 years old visiting Baghdad Teaching Hospital throughout four years (from June 1, 2016 till May 31, 2020) diagnosed with GDM were included in this cohort study and followed-up closely throughout pregnancy and after delivery. Included adolescents were put on lifestyle alone during the first week of presentation. Adolescents who reached target glucose measurements were categorized i

This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

The study of cohomology groups is one of the most intensive and exciting researches that arises from algebraic topology. Particularly, the dimension of cohomology groups is a highly useful invariant which plays a rigorous role in the geometric classification of associative algebras. This work focuses on the applications of low dimensional cohomology groups. In this regards, the cohomology groups of degree zero and degree one of nilpotent associative algebras in dimension four are described in matrix form.

Image pattern classification is considered a significant step for image and video processing. Although various image pattern algorithms have been proposed so far that achieved adequate classification, achieving higher accuracy while reducing the computation time remains challenging to date. A robust image pattern classification method is essential to obtain the desired accuracy. This method can be accurately classify image blocks into plain, edge, and texture (PET) using an efficient feature extraction mechanism. Moreover, to date, most of the existing studies are focused on evaluating their methods based on specific orthogonal moments, which limits the understanding of their potential application to various Discrete Orthogonal Moments (DOM