In 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

The encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure. Most QC-LDPC codes have rank deficient parity matrix and this introduces extra complexity over the codes with full rank parity matrix. In this paper an encoding scheme of QC-LDPC codes is presented that is suitable for codes with full rank parity matrix and rank deficient parity matrx. The extra effort required by the codes with rank deficient parity matrix over the codes of full rank parity matrix is investigated.

The wear behavior of alumina particulate reinforced A332 aluminium alloy composites produced by a stir casting process technique were investigated. A pin-on-disc type apparatus was employed for determining the sliding wear rate in composite samples at different grain size (1 µm, 12µm, 50 nm) and different weight percentage (0.05-0.1-0.5-1) wt% of alumina respectively. Mechanical properties characterization which strongly depends on microstructure properties of reinforcement revealed that the presence of ( nano , micro) alumina particulates lead to simultaneous increase in hardness, ultimate tensile stress (UTS), wear resistances. The results revealed that UTS, Hardness, Wear resistances increases with the increase in the percentage of

In this paper, an exact stiffness matrix and fixed-end load vector for nonprismatic beams having parabolic varying depth are derived. The principle of strain energy is used in the derivation of the stiffness matrix.
The effect of both shear deformation and the coupling between axial force and the bending moment are considered in the derivation of stiffness matrix. The fixed-end load vector for elements under uniformly distributed or concentrated loads is also derived. The correctness of the derived matrices is verified by numerical examples. It is found that the coupling effect between axial force and bending moment is significant for elements having axial end restraint. It was found that the decrease in bending moment was
in the

For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs and expedite delivery. Some small and medium businesses still use conventional methods to manage delivery routes. Decisions to manage delivery schedules and routes do not use any specific methods to expedite the delivery settlement process. This process is inefficient, takes a long time, increases costs and is prone to errors. Therefore, the Dijkstra algorithm has been used to improve the delivery management process. A delivery management system was developed to help managers and drivers

The Traveling Salesman Problem is a story application of Atom Swarm Optimizations in this research. We have developed several novel techniques intended for solving TSP with PSO. Additionally, we introduced the notions to Swap Operative and Swap Chronological sequence and redefining the remaining operatives their foundation; that way, the study created unique PSO. Research prove it can produce satisfactory outcomes. The aim of this paper be there to assess the functioning of particle swarm optimization, for the going salesman issue TSP. The solution to this trouble is common to be NP-hard, it has N! permutations. The study's goal is to examine the capacity of both algorithms to solve intercontinental and other benchmark problems. Overall, th