The support vector machine, also known as SVM, is a type of supervised learning model that can be used for classification or regression depending on the datasets. SVM is used to classify data points by determining the best hyperplane between two or more groups. Working with enormous datasets, on the other hand, might result in a variety of issues, including inefficient accuracy and time-consuming. SVM was updated in this research by applying some non-linear kernel transformations, which are: linear, polynomial, radial basis, and multi-layer kernels. The non-linear SVM classification model was illustrated and summarized in an algorithm using kernel tricks. The proposed method was examined using three simulation datasets with different sample sizes (50, 100, 200). A comparison between non-linear SVM and two standard classification methods was illustrated using various compared features. Our study has shown that the non-linear SVM method gives better results by checking: sensitivity, specificity, accuracy, and time-consuming. © 2024 Author(s).
Real Time Extended (RTX) technology works to take advantage of real-time data comes from the global network of tracking stations together with inventor locating and compression algorithms to calculate and relaying the orbit of satellite, satellite atomic clock, and any other systems corrections to the receivers, which lead to real-time correction with high accuracy. These corrections will be transferred to the receiver antenna by satellite (where coverage is available) and by IP (Internet Protocol) for the rest of world to provide the accurate location on the screen of smartphone or tablet by using specific software. The purpose of this study was to assess the accuracy of Global Navig
Real Time Extended (RTX) technology works to take advantage of real-time data comes from the global network of tracking stations together with inventor locating and compression algorithms to calculate and relaying the orbit of satellite, satellite atomic clock, and any other systems corrections to the receivers, which lead to real-time correction with high accuracy. These corrections will be transferred to the receiver antenna by satellite (where coverage is available) and by IP (Internet Protocol) for the rest of world to provide the accurate location on the screen of smartphone or tablet by using specific software. The purpose of this study was to assess the accuracy of Global Navig
In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.
In this research, Haar wavelets method has been utilized to approximate a numerical solution for Linear state space systems. The solution technique is used Haar wavelet functions and Haar wavelet operational matrix with the operation to transform the state space system into a system of linear algebraic equations which can be resolved by MATLAB over an interval from 0 to . The exactness of the state variables can be enhanced by increasing the Haar wavelet resolution. The method has been applied for different examples and the simulation results have been illustrated in graphics and compared with the exact solution.
The main work of this paper is devoted to a new technique of constructing approximated solutions for linear delay differential equations using the basis functions power series functions with the aid of Weighted residual methods (collocations method, Galerkin’s method and least square method).
A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.
Many industrial systems involve multiple criteria and objectives, and they are very complex problems in computational science, such as task scheduling. We propose bi-criteria and bi-objective scheduling problems, which are solved by two nature-inspired evolutionary algorithms, such as Simulated Annealing (SA) and Bee Algorithm (BA). This problem is characterized by scheduling a batch of tasks on multiple machines, and it is fundamental because the solution should focus on the simultaneous optimization of two conflicting objectives: the makespan minimization and the total tardiness minimization. This problem is NP-Hard, and therefore, two evolutionary methods were used to search for solutions intelligently in this huge, very complex
... Show MoreWith the rapid development of computers and network technologies, the security of information in the internet becomes compromise and many threats may affect the integrity of such information. Many researches are focused theirs works on providing solution to this threat. Machine learning and data mining are widely used in anomaly-detection schemes to decide whether or not a malicious activity is taking place on a network. In this paper a hierarchical classification for anomaly based intrusion detection system is proposed. Two levels of features selection and classification are used. In the first level, the global feature vector for detection the basic attacks (DoS, U2R, R2L and Probe) is selected. In the second level, four local feature vect
... Show More