: In this study, a linear synchronous machine is compared with a linear transverse flux machine. Both machines have been designed and built with the intention of being used as the power take off in a free piston engine. As both topologies are cylindrical, it is not possible to construct either using just flat laminations and so alternative methods are described and demonstrated. Despite the difference in topology and specification, the machines are compared on a common base in terms of rated force and suitability for use as a generator. Experience gained during the manufacture of two prototypes is described.

In the present paper, an eco-epidemiological model consisting of diseased prey consumed by a predator with fear cost, and hunting cooperation property is formulated and studied. It is assumed that the predator doesn’t distinguish between the healthy prey and sick prey and hence it consumed both. The solution’s properties such as existence, uniqueness, positivity, and bounded are discussed. The existence and stability conditions of all possible equilibrium points are studied. The persistence requirements of the proposed system are established. The bifurcation analysis near the non-hyperbolic equilibrium points is investigated. Numerically, some simulations are carried out to validate the main findings and obtain the critical values of th

In recent years, the evolution of the community structure in social networks has gained significant attention. Due to the rapid and continuous evolution of real-world networks over time. This makes the process of identifying communities and tracking their topology changes challenging. To tackle these challenges, it is necessary to find efficient methodologies for analyzing the behavior patterns of dynamic communities. Several previous reviews have introduced algorithms and models for community detection. However, these methods have not been very accurate in identifying communities. Moreover, none of the reviewed papers made an apparent effort to link algorithms that can accurately detect dynamic communities. This review aims to present a ta

The aim of this study was to investigate the effectiveness of binary solvent for regeneration of spent lubricating oil by extraction-flocculation process. The regeneration was investigated by bench scale experiments by using locally provided solvents (Heavy Naphtha, n-Butanol, and iso-Butanol). Solvents to used oil, mixing time, mixing speed and temperatures were studied as operating parameters. The performance on three estimated depended key parameters, namely the percentage of base oil recovered (Yield), percent of oil loss (POL), and the percent of sludge removal (PSR) were used to evaluate the efficiency of the employed binary solvent on extraction process. The best solvent to solvent ratio for binary system were 30:70 for Heavy Naph

The aim of this study was to investigate the effectiveness of binary solvent for regeneration of spent lubricating oil by extraction-flocculation process. The regeneration was investigated by bench scale experiments by using locally provided solvents (Heavy Naphtha, n-Butanol, and iso-Butanol). Solvents to used oil, mixing time, mixing speed and temperatures were studied as operating parameters. The performance on three estimated depended key parameters, namely the percentage of base oil recovered (Yield), percent of oil loss (POL), and the percent of sludge removal (PSR) were used to evaluate the efficiency of the employed binary solvent on extraction process. The best solvent to solvent ratio for binary system were 30:70 for Heavy

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