Lung cancer is one of the most serious and prevalent diseases, causing many deaths each year. Though CT scan images are mostly used in the diagnosis of cancer, the assessment of scans is an error-prone and time-consuming task. Machine learning and AI-based models can identify and classify types of lung cancer quite accurately, which helps in the early-stage detection of lung cancer that can increase the survival rate. In this paper, Convolutional Neural Network is used to classify Adenocarcinoma, squamous cell carcinoma and normal case CT scan images from the Chest CT Scan Images Dataset using different combinations of hidden layers and parameters in CNN models. The proposed model was trained on 1000 CT Scan Images of cancerous and non-c

Various speech enhancement Algorithms (SEA) have been developed in the last few decades. Each algorithm has its advantages and disadvantages because the speech signal is affected by environmental situations. Distortion of speech results in the loss of important features that make this signal challenging to understand. SEA aims to improve the intelligibility and quality of speech that different types of noise have degraded. In most applications, quality improvement is highly desirable as it can reduce listener fatigue, especially when the listener is exposed to high noise levels for extended periods (e.g., manufacturing). SEA reduces or suppresses the background noise to some degree, sometimes called noise suppression alg

The effect of the tensor term in the Skyrme interaction has been estimated in calculating the static and dynamic nuclear properties in sd and fp-shell model spaces nuclei. The nuclear shell gaps have been studied with different Skyrme parameterizations; Skxta and Skxtb with tensor interaction, SkX, SkM, and SLy4 without tensor interaction, and Skxcsb with consideration of the effect of charge symmetry breaking. We have examined the stability of N = 28 for 42Si and 48Ca. The results showed that the disappearance of the magicity occurs in the shell closure of 42Si. Furthermore, excitation energy, quadrupole deformation, neutron separation energy, pairing energy, and density profile have also been calculated. Quadrupole deformation indicates a

In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of

     Task scheduling in an important element in a distributed system. It is vital how the jobs are correctly assigned for each computer’s processor to improve performance. The presented approaches attempt to reduce the expense of optimizing the use of the CPU. These techniques mostly lack planning and in need to be comprehensive. To address this fault, a hybrid optimization scheduling technique is proposed for the hybridization of both First-Come First-Served (FCFS), and Shortest Job First (SJF). In addition, we propose to apply Simulated Annealing (SA) algorithm as an optimization technique to find optimal job’s execution sequence considering both job’s entrance time and job’s execution time to balance them to reduce the job

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio

The aim of this research is to employ starch as a stabilizing and reducing agent in the production of CdS nanoparticles with less environmental risk, easy scaling, stability, economical feasibility, and suitability for large-scale production. Nanoparticles of CdS have been successfully produced by employing starch as a reducing agent in a simple green synthesis technique and then doped with Sn in certain proportions (1%, 2%, 3%, 4%, and 5%).According to the XRD data, the samples were crystallized in a hexagonal pattern, because the average crystal size of pure CdS is 5.6nm and fluctuates in response to the changes in doping concentration 1, 2, 3, 4, 5 %wt Sn, to become   4.8, 3.9, 11.5, 13.1, 9.3 nm respectively. An increase in crystal

This paper presents a new design of a nonlinear multi-input multi-output PID neural controller of the active brake steering force and the active front steering angle for a 2-DOF vehicle model based on modified Elman recurrent neural. The goal of this work is to achieve the stability and to improve the vehicle dynamic’s performance through achieving the desired yaw rate and reducing the lateral velocity of the vehicle in a minimum time period for preventing the vehicle from slipping out the road curvature by using two active control actions: the front steering angle and the brake steering force. Bacterial forging optimization algorithm is used to adjust the parameters weights of the proposed controller. Simulation resul

The traditional shortest path problem is mainly concerned with identifying the associated paths in the transportation network that represent the shortest distance between the source and the destination in the transportation network by finding either cost or distance. As for the problem of research under study it is to find the shortest optimal path of multi-objective (cost, distance and time) at the same time has been clarified through the application of a proposed practical model of the problem of multi-objective shortest path to solve the problem of the most important 25 commercial US cities by travel in the car or plane. The proposed model was also solved using the lexicographic method through package program Win-QSB 2.0 for operation