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

In the present article, we implement the new iterative method proposed by Daftardar-Gejji and Jafari (NIM) [V. Daftardar-Gejji, H. Jafari, An iterative method for solving nonlinear functional equations, J. Math. Anal. Appl. 316 (2006) 753-763] to solve two problems; the first one is the problem of spread of a non-fatal disease in a population which is assumed to have constant size over the period of the epidemic, and the other one is the problem of the prey and predator. The results demonstrate that the method has many merits such as being derivative-free, overcome the difficulty arising in calculating Adomian polynomials to handle the nonlinear terms in Adomian Decomposition Method (ADM), does not require to calculate Lagrange multiplier a

A system was used to detect injuries in plant leaves by combining machine learning and the principles of image processing. A small agricultural robot was implemented for fine spraying by identifying infected leaves using image processing technology with four different forward speeds (35, 46, 63 and 80 cm/s). The results revealed that increasing the speed of the agricultural robot led to a decrease in the mount of supplements spraying and a detection percentage of infected plants. They also revealed a decrease in the percentage of supplements spraying by 46.89, 52.94, 63.07 and 76% with different forward speeds compared to the traditional method.

In this paper the experimentally obtained conditions for the fusion splicing with photonic crystal fibers (PCF) having large mode areas were reported. The physical mechanism of the splice loss and the microhole collapse property of photonic crystal fiber (PCF) were studied. By controlling the arc-power and the arc-time of a conventional electric arc fusion splicer (FSM-60S), the minimum loss of splicing for fusion two conventional single mode fibers (SMF-28) was (0.00dB), which has similar mode field diameter. For splicing PCF (LMA-10) with a conventional single mode fiber (SMF-28), the loss was increased due to the mode field mismatch.

Mass transfer correlations for iron rotating cylinder electrode in chloride/sulphate solution, under isothermal and
controlled heat transfer conditions, were derived. Limiting current density values for the oxygen reduction reaction from
potentiostatic experiments at different bulk temperatures and various turbulent flow rates, under isothermal and heat
transfer conditions, were used for such derivation. The corelations were analogous to that obtained by Eisenberg et all
and other workers.

Hard-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

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

It is widely accepted that early diagnosis of Alzheimer's disease (AD) makes it possible for patients to gain access to appropriate health care services and would facilitate the development of new therapies. AD starts many years before its clinical manifestations and a biomarker that provides a measure of changes in the brain in this period would be useful for early diagnosis of AD. Given the rapid increase in the number of older people suffering from AD, there is a need for an accurate, low-cost and easy to use biomarkers that could be used to detect AD in its early stages. Potentially, the electroencephalogram (EEG) can play a vital role in this but at present, no reliable EEG biomarker exists for early diagnosis of AD. The gradual s

The necessary optimality conditions with Lagrange multipliers  are studied and derived for a new class that includes the system of Caputo–Katugampola fractional derivatives to the optimal control problems with considering the end time free. The formula for the integral by parts has been proven for the left Caputo–Katugampola fractional derivative that contributes to the finding and deriving the necessary optimality conditions. Also, three special cases are obtained, including the study of the necessary optimality conditions when both the final time  and the final state  are fixed. According to convexity assumptions prove that necessary optimality conditions are sufficient optimality conditions.