A novel technique Sumudu transform Adomian decomposition method (STADM), is employed to handle some kinds of nonlinear time-fractional equations. We demonstrate that this method finds the solution without discretization or restrictive assumptions. This method is efficient, simple to implement, and produces good results. The fractional derivative is described in the Caputo sense. The solutions are obtained using STADM, and the results show that the suggested technique is valid and applicable and provides a more refined convergent series solution. The MATLAB software carried out all the computations and graphics. Moreover, a graphical representation was made for the solution of some examples. For integer and fractional order problems, solutio
... Show MoreIn the current worldwide health crisis produced by coronavirus disease (COVID-19), researchers and medical specialists began looking for new ways to tackle the epidemic. According to recent studies, Machine Learning (ML) has been effectively deployed in the health sector. Medical imaging sources (radiography and computed tomography) have aided in the development of artificial intelligence(AI) strategies to tackle the coronavirus outbreak. As a result, a classical machine learning approach for coronavirus detection from Computerized Tomography (CT) images was developed. In this study, the convolutional neural network (CNN) model for feature extraction and support vector machine (SVM) for the classification of axial
... Show MoreNowadays, cloud computing has attracted the attention of large companies due to its high potential, flexibility, and profitability in providing multi-sources of hardware and software to serve the connected users. Given the scale of modern data centers and the dynamic nature of their resource provisioning, we need effective scheduling techniques to manage these resources while satisfying both the cloud providers and cloud users goals. Task scheduling in cloud computing is considered as NP-hard problem which cannot be easily solved by classical optimization methods. Thus, both heuristic and meta-heuristic techniques have been utilized to provide optimal or near-optimal solutions within an acceptable time frame for such problems. In th
... Show MoreHard-grade asphalt binders like AC20-30 typically exhibit excessive stiffness, reduced penetration, and compromised workability, necessitating modification before use in paving applications. This study evaluates the efficacy of regular polyalphaolefin (PAO), a synthetic olefin-based lubricant, as a performance-enhancing modifying agent for such binders. AC20-30 was blended with PAO at dosages ranging from 2 wt.% to 10 wt.%, and the modified binders were characterized via penetration, ductility, softening point, and rotational viscosity measurements, alongside advanced rheological and chemical-morphological analyses. Incorporating PAO in AC20-30 asphalt progressively reduced the binder stiffness and enhanced its flexibility, with all modifie
... Show MoreThis work presents a completely new develop an analyzer, named NAG-5SX1-1D-SSP, that is simple, accurate, reproducible, and affordable for the determination of cefotaxime sodium (CFS) in both pure and pharmaceutical drugs. The analyzer was designed according to flow injection analysis, and conducted to turbidimetric measurements. Ammonium cerium nitrate was utilized as a precipitating agent. After optimizing the conditions, the analysis system exhibited a linear range of 0.008-27 mmol. L-1 (n=29), with a limit of detection of 439.3 ng/sample, a limit of quantification of 0.4805 mg/sample, and a correlation coefficient of 0.9988. The repeatability of the responses was assessed by performing six successive injections of CFS at concentra
... Show MoreIn This paper, we introduce the associated graphs of commutative KU-algebra. Firstly, we define the KU-graph which is determined by all the elements of commutative KU-algebra as vertices. Secondly, the graph of equivalence classes of commutative KU-algebra is studied and several examples are presented. Also, by using the definition of graph folding, we prove that the graph of equivalence classes and the graph folding of commutative KU-algebra are the same, where the graph is complete bipartite graph.