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

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove

The smart city concept has attracted high research attention in recent years within diverse application domains, such as crime suspect identification, border security, transportation, aerospace, and so on. Specific focus has been on increased automation using data driven approaches, while leveraging remote sensing and real-time streaming of heterogenous data from various resources, including unmanned aerial vehicles, surveillance cameras, and low-earth-orbit satellites. One of the core challenges in exploitation of such high temporal data streams, specifically videos, is the trade-off between the quality of video streaming and limited transmission bandwidth. An optimal compromise is needed between video quality and subsequently, rec

In this study, a new technique is considered for solving linear fractional Volterra-Fredholm integro-differential equations (LFVFIDE's) with fractional derivative qualified in the Caputo sense. The method is established in three types of Lagrange polynomials (LP’s), Original Lagrange polynomial (OLP), Barycentric Lagrange polynomial (BLP), and Modified Lagrange polynomial (MLP). General Algorithm is suggested and examples are included to get the best effectiveness, and implementation of these types. Also, as special case fractional differential equation is taken to evaluate the validity of the proposed method. Finally, a comparison between the proposed method and other methods are taken to present the effectiveness of the proposal meth