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

A modified Leslie-Gower predator-prey model with a Beddington-DeAngelis functional response is proposed and studied. The purpose is to examine the effects of fear and quadratic fixed effort harvesting on the system's dynamic behavior. The model's qualitative properties, such as local equilibria stability, permanence, and global stability, are examined. The analysis of local bifurcation has been studied. It is discovered that the system experiences a saddle-node bifurcation at the survival equilibrium point whereas a transcritical bifurcation occurs at the boundary equilibrium point. Additionally established are the prerequisites for Hopf bifurcation existence. Finally, using MATLAB, a numerical investigation is conducted to verify t

A modified Leslie-Gower predator-prey model with a Beddington-DeAngelis functional response is proposed and studied. The purpose is to examine the effects of fear and quadratic fixed effort harvesting on the system's dynamic behavior. The model's qualitative properties, such as local equilibria stability, permanence, and global stability, are examined. The analysis of local bifurcation has been studied. It is discovered that the system experiences a saddle-node bifurcation at the survival equilibrium point whereas a transcritical bifurcation occurs at the boundary equilibrium point. Additionally established are the prerequisites for Hopf bifurcation existence. Finally, using MATLAB, a numerical investigation is conducted to verify the va

This study examined the correlation between binder-level fatigue properties and mixture-level cracking resistance in asphalt binders modified with five Nanomaterials (NMs): Nano-Silica (NS), Nano-Alumina (NA), and Nano-Titanium dioxide (NT) at 2%, 4%, and 6% as well as Nano-Zinc oxide (NZ) and Carbon Nanotubes (CNTs) at 1%, 2%, and 3%. Modified binders were subjected to Rolling Thin-Film Oven Test (RTFOT) and Pressure Aging Vessel (PAV) aging and tested at 25 °C using the Linear Amplitude Sweep (LAS) test to determine fatigue life (Nf) and the fatigue parameter G*.sin δ. The corresponding asphalt mixtures were evaluated using the IDEAL-CT test. The results indicated strong correlations between binder and mixture performance for

This study concerns the removal of a trihydrate antibiotic (Amoxicillin) from synthetically contaminated water by adsorption on modified bentonite. The bentonite was modified using hexadecyl trimethyl ammonium bromide (HTAB), which turned it from a hydrophilic to a hydrophobic material. The effects of different parameters were studied in batch experiments. These parameters were contact time, solution pH, agitation speed, initial concentration (C0) of the contaminant, and adsorbent dosage. Maximum removal of amoxicillin (93 %) was achieved at contact time = 240 min, pH = 10, agitation speed = 200 rpm, initial concentration = 30 ppm, and adsorbent dosage = 3 g bentonite per 1L of pollutant solution. The characterization of the adsorbent, modi

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

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