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.

In Libya, there are multiple sources of pollution, one of which is animal waste. The anaerobic digestion (AD) of organic wastes to produce biogas has the advantage of producing valuable, renewable energy while reducing the environmental impact of these wastes. Cowmanure have the potential to produce biogas due to their high organic content. This study aimed to study different concentrations for the feedstock (1:1 and 2:1 cow manure: water v/v) to monitor which one gives higher biogas production. A plastic tank with a capacity of 72 liters and a feedstock volume of 60 liters was used to create a pilot scale. The biogas was analyzed using a GC device at the end of the experiment in the Zawiya Oil Refining Company. The result indicated that th

Recently, Image enhancement techniques can be represented as one of the most significant topics in the field of digital image processing. The basic problem in the enhancement method is how to remove noise or improve digital image details. In the current research a method for digital image de-noising and its detail sharpening/highlighted was proposed. The proposed approach uses fuzzy logic technique to process each pixel inside entire image, and then take the decision if it is noisy or need more processing for highlighting. This issue is performed by examining the degree of association with neighboring elements based on fuzzy algorithm. The proposed de-noising approach was evaluated by some standard images after corrupting them with impulse

Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.

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

Academia Open Vol 8 No 2 (2023): December DOI: 10.21070/acopen.8.2023.8087 . Article type: (Medicine)Impact of COVID-19 on Dental Students' Psychological Health Maryam Hameed Alwan, [email protected], (1) Department of Oral Diagnosis, College of Dentistry, Baghdad University, Iraq, Iraq (1) Corresponding author Abstract This study investigates the psychological impact of the COVID-19 pandemic on dental students at Baghdad University College of Dentistry. Conducted between December 2021 and January 2022, this cross-sectional survey aligns with ethical guidelines and the Helsinki Declaration. The study utilized Cochran's equation to determine a sample size of at least 400, ensuring a 95% confidence level with a 5% margin of e

In this paper, a fast lossless image compression method is introduced for compressing medical images, it is based on splitting the image blocks according to its nature along with using the polynomial approximation to decompose image signal followed by applying run length coding on the residue part of the image, which represents the error caused by applying polynomial approximation. Then, Huffman coding is applied as a last stage to encode the polynomial coefficients and run length coding. The test results indicate that the suggested method can lead to promising performance.