作者：
A.E.M.EljialyMohammed Yousuf UddinSultan AhmadDepartment of Information Systems
College of Computer Engineering and SciencesPrince Sattam Bin Abdulaziz UniversityAlkharjSaudi Arabia Department of Computer Science
College of Computer Engineering and SciencesPrince Sattam Bin Abdulaziz UniversityAlkharjSaudi Arabiaand also with University Center for Research and Development(UCRD)Department of Computer Science and EngineeringChandigarh UniversityPunjabIndia
Intrusion detection systems (IDSs) are deployed to detect anomalies in real time. They classify a network’s incoming traffic as benign or anomalous (attack). An efficient and robust IDS in software-defined networks i...
详细信息
Intrusion detection systems (IDSs) are deployed to detect anomalies in real time. They classify a network’s incoming traffic as benign or anomalous (attack). An efficient and robust IDS in software-defined networks is an inevitable component of network security. The main challenges of such an IDS are achieving zero or extremely low false positive rates and high detection rates. Internet of Things (IoT) networks run by using devices with minimal resources. This situation makes deploying traditional IDSs in IoT networks unfeasible. Machine learning (ML) techniques are extensively applied to build robust IDSs. Many researchers have utilized different ML methods and techniques to address the above challenges. The development of an efficient IDS starts with a good feature selection process to avoid overfitting the ML model. This work proposes a multiple feature selection process followed by classification. In this study, the Software-defined networking (SDN) dataset is used to train and test the proposed model. This model applies multiple feature selection techniques to select high-scoring features from a set of features. Highly relevant features for anomaly detection are selected on the basis of their scores to generate the candidate dataset. Multiple classification algorithms are applied to the candidate dataset to build models. The proposed model exhibits considerable improvement in the detection of attacks with high accuracy and low false positive rates, even with a few features selected.
Diabetes has become one of the significant reasons for public sickness and death in worldwide. By 2019, diabetes had affected more than 463 million people worldwide. According to the International Diabetes Federation ...
详细信息
Topology is usually perceived intrinsically immutable for a given *** argue that optical topologies do not immediately enjoy such ***'optical skyrmions'as an example,we show that they will exhibit varying text...
详细信息
Topology is usually perceived intrinsically immutable for a given *** argue that optical topologies do not immediately enjoy such ***'optical skyrmions'as an example,we show that they will exhibit varying textures and topological invariants(skyrmion numbers),depending on how to construct the skyrmion vector when projecting from real to parameter *** demonstrate the fragility of optical skyrmions under a ubiquitous scenario-simple reflection off an optical *** topology is not without benefit,but it must not be assumed.
Distance and size estimation of objects of interests is an inevitable task for many navigation and obstacle avoidance algorithms mainly used in autonomus and robotic systems. Stereo vision systems, inspired by human v...
详细信息
Most optimization problems of practical significance are typically solved by highly configurable parameterized *** achieve the best performance on a problem instance,a trial-and-error configuration process is required...
详细信息
Most optimization problems of practical significance are typically solved by highly configurable parameterized *** achieve the best performance on a problem instance,a trial-and-error configuration process is required,which is very costly and even prohibitive for problems that are already computationally intensive,*** problems associated with machine learning *** the past decades,many studies have been conducted to accelerate the tedious configuration process by learning from a set of training *** article refers to these studies as learn to optimize and reviews the progress achieved.
Coping with noise in computing is an important problem to consider in large systems. With applications in fault tolerance (Hastad et al., 1987;Pease et al., 1980;Pippenger et al., 1991), noisy sorting (Shah and Wainwr...
详细信息
Coping with noise in computing is an important problem to consider in large systems. With applications in fault tolerance (Hastad et al., 1987;Pease et al., 1980;Pippenger et al., 1991), noisy sorting (Shah and Wainwright, 2018;Agarwal et al., 2017;Falahatgar et al., 2017;Heckel et al., 2019;Wang et al., 2024a;Gu and Xu, 2023;Kunisky et al., 2024), noisy searching (Berlekamp, 1964;Horstein, 1963;Burnashev and Zigangirov, 1974;Pelc, 1989;Karp and Kleinberg, 2007), among many others, the goal is to devise algorithms with the minimum number of queries that are robust enough to detect and correct the errors that can happen during the computation. In this work, we consider the noisy computing of the threshold-k function. For n Boolean variables x = (x1, ..., xn) ∈ {0, 1}n, the threshold-k function THk(·) computes whether the number of 1's in x is at least k or not, i.e., (Equation presented) The noisy queries correspond to noisy readings of the bits, where at each time step, the agent queries one of the bits, and with probability p, the wrong value of the bit is returned. It is assumed that the constant p ∈ (0, 1/2) is known to the agent. Our goal is to characterize the optimal query complexity for computing the THk function with error probability at most δ. This model for noisy computation of the THk function has been studied by Feige et al. (1994), where the order of the optimal query complexity is established;however, the exact tight characterization of the optimal number of queries is still open. In this paper, our main contribution is tightening this gap by providing new upper and lower bounds for the computation of the THk function, which simultaneously improve the existing upper and lower bounds. The main result of this paper can be stated as follows: for any 1 ≤ k ≤ n, there exists an algorithm that computes the THk function with an error probability at most δ = o(1), and the algorithm uses at most (Equation presented) queries in expectation. Here we define m (Eq
Image tampering detection and localization have emerged as a critical domain in combating the pervasive issue of image manipulation due to the advancement of the large-scale availability of sophisticated image editing...
详细信息
Image tampering detection and localization have emerged as a critical domain in combating the pervasive issue of image manipulation due to the advancement of the large-scale availability of sophisticated image editing *** manual forgery localization is often reliant on forensic *** recent times,machine learning(ML)and deep learning(DL)have shown promising results in automating image forgery ***,the ML-based method relies on hand-crafted ***,the DL method automatically extracts shallow spatial features to enhance the ***,DL-based methods lack the global co-relation of the features due to this performance degradation noticed in several *** the proposed study,we designed FLTNet(forgery localization transformer network)with a CNN(convolution neural network)encoder and transformer-based *** encoder extracts local high-dimensional features,and the transformer provides the global co-relation of the *** the decoder,we have exclusively utilized a CNN to upsample the features that generate tampered mask ***,we evaluated visual and quantitative performance on three standard datasets and comparison with six state-of-the-art *** IoU values of the proposed method on CASIA V1,CASIA V2,and CoMoFoD datasets are 0.77,0.82,and 0.84,*** addition,the F1-scores of these three datasets are 0.80,0.84,and 0.86,***,the visual results of the proposed method are clean and contain rich information,which can be used for real-time forgery *** code used in the study can be accessed through URL:https://***/ajit2k5/Forgery-Localization(accessed on 21 January 2025).
This study proposes a hybrid optimization-based mobility management strategy employing Kinetic Gas Molecular Optimization (KGMO) and Ant Lion Optimization (ALO). Initially, KGMO calculates particle properties, such as...
详细信息
In the realm of deep learning, the prevalence of models with large number of parameters poses a significant challenge for low computation device. Critical influence of model size, primarily governed by weight paramete...
详细信息
Brain tumors are ranked highly among the leading causes of cancer-related fatalities. Precise segmentation and quantitative assessment of brain tumors are crucial for effective diagnosis and treatment planning. Howeve...
详细信息
暂无评论