检索结果-内蒙古大学图书馆

IDS-INT:Intrusion detection system using transformer-based transfer learning for imbalanced network traffic

Digital Communications and Networks 2024年第1期10卷 190-204页

作者： Farhan Ullah Shamsher Ullah Gautam Srivastava Jerry Chun-Wei Lin School of Software Northwestern Polytechnical UniversityXian710072ShaanxiChina Knowledge Unit of Systems and Technology University of Management and TechnologySialkot 51040Pakistan Department of Math and Computer Science Brandon UniversityBrandonMB R7A 6A9Canada Department of Computer Science and Math Lebanese American UniversityBeirut1102Lebanon Western Norway University of Applied Sciences BergenNorway Research Centre for Interneural Computing China Medical UniversityTaichungTaiwanChina

A network intrusion detection system is critical for cyber security against llegitimate *** terms of feature perspectives,network traffic may include a variety of elements such as attack reference,attack type,a subcategory of attack,host information,malicious scripts,*** terms of network perspectives,network traffic may contain an imbalanced number of harmful attacks when compared to normal *** is challenging to identify a specific attack due to complex features and data imbalance *** address these issues,this paper proposes an Intrusion Detection System using transformer-based transfer learning for Imbalanced Network Traffic(IDS-INT).IDS-INT uses transformer-based transfer learning to learn feature interactions in both network feature representation and imbalanced ***,detailed information about each type of attack is gathered from network interaction descriptions,which include network nodes,attack type,reference,host information,***,the transformer-based transfer learning approach is developed to learn detailed feature representation using their semantic ***,the Synthetic Minority Oversampling Technique(SMOTE)is implemented to balance abnormal traffic and detect minority ***,the Convolution Neural Network(CNN)model is designed to extract deep features from the balanced network ***,the hybrid approach of the CNN-Long Short-Term Memory(CNN-LSTM)model is developed to detect different types of attacks from the deep *** experiments are conducted to test the proposed approach using three standard datasets,i.e.,UNsWNB15,CIC-IDS2017,and *** explainable AI approach is implemented to interpret the proposed method and develop a trustable model.

关键词： Network intrusion detection Transfer learning Features extraction Imbalance data Explainable AI Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

Enhancing Missing Data Imputation for Migrants Data: A Neutrosophic Set-Based Machine Learning Approach

引用

Neutrosophic Sets and Systems 2025年 81卷 479-502页

作者： Abdo, Doaa A. Salama, A.A. Abdelmegaly, Alaa A. Mahmoud, Hanan Khadari Mahdi Applied statistics and insurance department faculty of commerce Mansoura university Mansoura Egypt Dept. of Math and Computer Sci. Faculty of Science Port Said Univ. Egypt Higher Institute of Advanced Management Sciences and Computers Al-Buhayrah Egypt Depatrment of applied statistics at the Nile Higher Institute of commercial sciences and Computer Technology in Mansoura Egypt

This study tackles the problem of missing data in migrant datasets by introducing a new framework that combines machine learning techniques with neutrosophic sets. These sets, which can represent uncertainty and ambiguity, are well-suited for managing the complex nature of missing information in sensitive fields like migration research. We test the effectiveness of KNN, SVM, decision tree, random forest, and Ada Boost algorithms on a migrant dataset, comparing their results using different imputation methods (mean/mode, model-based imputer (simple tree), and random values). Our research showed that our proposed approach, which used neutrosophic sets, improved imputation accuracy and strengthened model reliability. Our results underscored the potential of neutrosophic set-based machine learning for addressing missing data issues across various fields. © 2025, University of New Mexico. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Adjacency Sketches in Adversarial Environments

arXiv

引用

arXiv 2023年

作者： Naor, Moni Pekel, Eugene Department of Computer Science and Applied Math Weizmann Institute of Science

An adjacency sketching or implicit labeling scheme for a family F of graphs is a method that defines for any n vertex G ∈ F an assignment of labels to each vertex in G, so that the labels of two vertices tell you whether or not they are adjacent. The goal is to come up with labeling schemes that use as few bits as possible to represent the labels. By using randomness when assigning labels, it is sometimes possible to produce adjacency sketches with much smaller label sizes, but this comes at the cost of introducing some probability of error. Both deterministic and randomized labeling schemes have been extensively studied, as they have applications for distributed data structures and deeper connections to universal graphs and communication complexity. The main question of interest is which graph families have schemes using short labels, usually O(log n) in the deterministic case or constant for randomized sketches. In this work we consider the resilience of probabilistic adjacency sketches against an adversary making adaptive queries to the labels. This differs from the previously analyzed probabilistic setting which is "one shot". We show that in the adaptive adversarial case the size of the labels is tightly related to the maximal degree of the graphs in F . This results in a stronger characterization compared to what is known in the non-adversarial setting. In more detail, we construct sketches that fail with probability Ε for graphs with maximal degree d using 2d log(1/Ε) bit labels and show that this is roughly the best that can be done for any specific graph of maximal degree d, e.g. a d-ary *** Codes 68W20, 68W40, 68Q87 Copyright © 2023, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Grassroots Systems: Concept, Examples, Implementation and Applications

arXiv

引用

arXiv 2023年

作者： Shapiro, Ehud Department of Computer Science and Applied Math Weizmann Institute of Science Israel

Informally, a grassroots system is a distributed system that can have multiple instances, independent of each other and of any global resources, that can interoperate once interconnected. More formally, in a grassroots system the set of all correct behaviors of a set of agents P is strictly included in the set of the correct behaviors of P when embedded within a larger set of agents P′ ⊃ P: Included, meaning that members of P are correct to ignore outside agents indefinitely;strictly included, meaning that the interaction of members of P with outside agents is also a possible and correct behavior. Client-server/cloud computing systems are not grassroots, and neither are systems designed to have a single global instance (Bitcoin/Ethereum with hardwired seed miners/bootnodes), and systems that rely on a single global data structure (IPFS, DHTs). An example grassroots system would be a serverless smartphone-based social network supporting multiple independently-budding communities that can merge when a member of one community becomes also a member of another. Grassroots applications are potentially important as they may allow people to conduct their social, economic, civic, and political lives in the digital realm solely using the networked computing devices they own and operate (e.g., smartphones), free of third-party control, surveillance, manipulation, coercion, or rent seeking (e.g., by global digital platforms such as Facebook or Bitcoin). Here, we formalize the notion of grassroots systems and grassroots implementations;specify an abstract grassroots dissemination protocol;describe and prove an implementation of grassroots dissemination for the model of asynchrony;extend the implementation to mobile (address-changing) devices that communicate via an unreliable network (e.g. smartphones using UDP);and discuss how grassroots dissemination can realize applications that support digital sovereignty – grassroots social networking and grassroots currencies. The mathemat

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

Collaborative Control of Aerial Robots for Inferring Human Intent from Gaze Following

Collaborative Control of Aerial Robots for Inferring Human I...

引用

2023 IEEE Conference on Control Technology and Applications, CCTA 2023

作者： Chipade, Vishnu S. Gilbert, Alia Harari, Daniel Panagou, Dimitra University of Michigan Department of Aerospace Engineering Ann ArborMI United States University of Michigan Department of Robotics Ann ArborMI United States Weizmann Institute of Science Weizmann Ai Center Department of Computer Science and Applied Math Israel

ISBN: (纸本)9798350335446

In an ideal human-robot collaboration, autonomous robots work side-by-side with humans in a joint workspace, often performing complementary tasks to the humans. A robotic ability to infer human intention and goals directly from human behavior will facilitate the collaboration and maximize its efficiency. In this paper, we focus on inferring which object the human wants picked up next, based on what the human is looking at, by visually following the human gaze and head orientation. We develop a coordination protocol for a team of aerial robots to extract effective human head and gaze cues. The aerial robots are controlled to navigate around the human and collect data that improves the detection of the human's gaze and hence the intended object to be picked up. The effectiveness of the approach is shown using simulations in AirSim, a photo-realistic simulator. © 2023 IEEE.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

Secure Computation Meets Distributed Universal Optimality

Secure Computation Meets Distributed Universal Optimality

引用

Annual IEEE Symposium on Foundations of computer science

作者： Merav Parter Department of Computer Science and Applied Math Weizmann Institute Rehovot Israel

We present a new algorithmic approach to distributed secure algorithms that is based on combining two independent lines of research: secure computation and distributed universal optimality. Our end result provides round-efficient distributed algorithms that protect the privacy of the graph vertices against a (possibly large) coalition of semi-honest *** Computation: The notion of perfect privacy dates back to Yao [FOCS ’82], and has been extensively addressed by the Cryptographic community over the years. Most of the prior work considers the Multi-Party-Communication (MPC) model, in which the parties are fully connected. Considerably less is known on the (round) complexity of secure algorithms for general graphs, especially under the classical message passing models, such as the CONGEST model. For any biconnected D-diameter graph, a recent line of works [Parter and Yogev, SODA 19, ICALP 19, PODC 19] presented a simulation result that protects against a single semi-honest corruption, by paying an overhead of $D \cdot \mathsf{poly}(\Delta)$ CONGEST rounds, where $\Delta$ is the maximum degree. Due to an inherent structural barrier, the generalization of the current framework to handling f corruptions, provably leads to an overhead of $O(\Delta D)^{\Theta(f)}$ rounds. This can also be shown to be tight for the class of store-and-forward algorithms 1 . 1 In which nodes can only propagate messages as atomic units, without the ability to mix multiple messages *** Computation & Universal Optimality. We present an improved framework for secure computation which bypasses the current exponential in f barrier. For every graph $G=(V, E)$ with vertex-connectivity $\widetilde{\Omega}(f)$, our simulation provides a round overhead of $\mathsf{poly}(\Delta) \cdot \widehat{O}(\mathbf{S Q}(G))$. 2 The graph measure $\mathbf{S Q}(G)$ (Shortcut Quality) captures the universal optimal complexity of many network optimization tasks in the (non-secure) CONGEST mo

关键词：

来源：评论

学校读者我要写书评

暂无评论

Private everlasting prediction 23

Private everlasting prediction

引用

Proceedings of the 37th International Conference on Neural Information Processing Systems

作者： Moni Naor Kobbi Nissim Uri Stemmer Chao Yan Department of Computer Science and Applied Math Weizmann Institute of Science Department of Computer Science Georgetown University Blavatnik School of Computer Science Tel Aviv University and Google Research

A private learner is trained on a sample of labeled points and generates a hypothesis that can be used for predicting the labels of newly sampled points while protecting the privacy of the training set [Kasiviswannathan et al., FOCS 2008]. Past research uncovered that private learners may need to exhibit significantly higher sample complexity than non-private learners as is the case of learning of one-dimensional threshold functions [Bun et al., FOCS 2015, Alon et al., STOC 2019].We explore prediction as an alternative to learning. A predictor answers a stream of classification queries instead of outputting a hypothesis. Earlier work has considered a private prediction model with a single classification query [Dwork and Feldman, COLT 2018]. We observe that when answering a stream of queries, a predictor must modify the hypothesis it uses over time, and in a manner that cannot rely solely on the training *** introduce private everlasting prediction taking into account the privacy of both the training set and the (adaptively chosen) queries made to the predictor. We then present a generic construction of private everlasting predictors in the PAC model. The sample complexity of the initial training sample in our construction is quadratic (up to polylog factors) in the VC dimension of the concept class. Our construction allows prediction for all concept classes with finite VC dimension, and in particular threshold functions over infinite domains, for which (traditional) private learning is known to be impossible.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Methods for Weather Forecast 21st

Data-Driven Methods for Weather Forecast

引用

21st International Conference on Computational science, ICCS 2021

作者： Nino-Ruiz, Elias David Acevedo García, Felipe J. Applied Math and Computer Science Lab Computer Science Department Universidad del Norte Colombia Barranquilla Colombia

ISBN: (纸本)9783030779696

In this paper, we propose efficient and practical data-driven methods for weather forecasts. We exploit the information brought by historical weather datasets to build machine-learning-based models. These models are employed to produce numerical forecasts, which can be improved by injecting additional data via data assimilation. Our approaches’ general idea is as follows: given a set of time snapshots of some dynamical system, we group the data by time across multiple days. These groups are employed to build first-order Markovian models that reproduce dynamics from time to time. Our numerical models’ precision can be improved via sequential data assimilation. Experimental tests are performed by using the National-Centers-for-Environmental-Prediction department-of-Energy Reanalysis II dataset. The results reveal that numerical forecasts can be obtained within reasonable error magnitudes in the L2 norm sense, and even more, observations can improve forecasts by order of magnitudes, in some cases. © 2021, Springer Nature Switzerland AG.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Adjoint-Free 4D-Var Methods Via Line Search Optimization For Non-Linear Data Assimilation

arXiv

引用

arXiv 2023年

作者： Nino-Ruiz, Elias D. Diaz-Rodriguez, Jairo Applied Math and Computer Science Laboratory Department of Computer Science Universidad del Norte Colombia Department of Mathematics and Statistics York University Canada

This paper proposes two practical implementations of Four-Dimensional Variational (4D-Var) Ensemble Kalman Filter (4D-EnKF) methods for non-linear data assimilation. Our formulations' main idea is to avoid the intrinsic need for adjoint models in the context of 4D-Var optimization and, even more, to handle non-linear observation operators during the assimilation of observations. The proposed methods work as follows: snapshots of an ensemble of model realizations are taken at observation times, these snapshots are employed to build control spaces onto which analysis increments can be estimated. Via the linearization of observation operators at observation times, a line-search based optimization method is proposed to estimate optimal analysis increments. The convergence of this method is theoretically proven as long as the dimension of control-spaces equals model one. In the first formulation, control spaces are given by full-rank square root approximations of background error covariance matrices via the Bickel and Levina precision matrix estimator. In this context, we propose an iterative Woodbury matrix formula to perform the optimization steps efficiently. The last formulation can be considered as an extension of the Maximum Likelihood Ensemble Filter to the 4D-Var context. This employs pseudo-square root approximations of prior error covariance matrices to build control spaces. Experimental tests are performed by using the Lorenz 96 model. The results reveal that, in terms of Root-Mean-Square-Error values, both methods can obtain reasonable estimates of posterior error modes in the 4D-Var optimization problem. Moreover, the accuracies of the proposed filter implementations can be improved as the ensemble sizes are increased. © 2023, CC BY.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

A new trigonometric kernel function for support vector machine

引用

Iran Journal of computer science 2023年第2期6卷 137-145页

作者： Fathi Hafshejani, Sajad Moaberfard, Zahra Department of Applied Mathematics Shiraz University of Technology Modarres Boulevard Fars Shiraz 71557-13876 Iran Department of Math and Computer Science University of Lethbridge 4401 University Dr W Lethbridge T1K 3M4 AB Canada

In the last few years, various types of machine learning algorithms, such as support vector machine (SVM), support vector regression (SVR), and non-negative matrix factorization (NMF) have been introduced. The kernel approach is an effective method for increasing the classification accuracy of machine learning algorithms. This paper introduces a family of one-parameter kernel functions for improving the accuracy of SVM classification. The proposed kernel function consists of a trigonometric term and differs from all existing kernel functions. We show this function is a positive definite kernel function. Finally, we evaluate the SVM method based on the new trigonometric kernel, the Gaussian kernel, the polynomial kernel, and a convex combination of the new kernel function and the Gaussian kernel function on various types of datasets. Empirical results show that the SVM based on the new trigonometric kernel function and the mixed kernel function achieve the best classification accuracy. Moreover, some numerical results of performing the SVR based on the new trigonometric kernel function and the mixed kernel function are presented. © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2022.

关键词： Kernel method Support vector machine Trigonometric kernel function

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：