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

FLDDoS: DDoS Attack Detection Model based on Federated Learning

学校读者我要写书评

暂无评论

FLDDoS: DDoS Attack Detection Model based on Federated Learn...

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Jiachao Zhang Peiran Yu Le Qi Song Liu Haiyu Zhang Jianzhong Zhang Institute of Systems and Networks Nankai University College of Computer Science Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Shijiazhuang Huayan Traffic Technology Co. Ltd.

ISBN: (纸本)9781665416597

Recently, DDoS attack has developed rapidly and become one of the most important threats to the Internet. Traditional machine learning and deep learning methods can-not train a satisfactory model based on the data of a single client. Moreover, in the real scenes, there are a large number of devices used for traffic collection, these devices often do not want to share data between each other depending on the research and analysis value of the attack traffic, which limits the accuracy of the model. Therefore, to solve these problems, we design a DDoS attack detection model based on federated learning named FLDDoS, so that the local model can learn the data of each client without sharing the data. In addition, considering that the distribution of attack detection datasets is extremely imbalanced and the proportion of attack samples is very small, we propose a hierarchical aggregation algorithm based on K-Means and a data resampling method based on SMOTEENN. The result shows that our model improves the accuracy by 4% compared with the traditional method, and reduces the number of communication rounds by 40%.

关键词： Deep learning Privacy data privacy Computational modeling Clustering algorithms Denial-of-service attack Collaborative work

Graph Regularized Nonnegative Latent Factor Analysis Model for Temporal Link Prediction in Cryptocurrency Transaction networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhou, Yue Liu, Zhigang Yuan, Ye The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The Chongqing School University of Chinese Academy of Sciences Chongqing400714 China The College of Computer and Information Science Southwest University Chongqing400715 China

With the development of blockchain technology, the cryptocurrency based on blockchain technology is becoming more and more popular. This gave birth to a huge cryptocurrency transaction network has received widespread attention. Link prediction learning structure of network is helpful to understand the mechanism of network, so it is also widely studied in cryptocurrency network. However, the dynamics of cryptocurrency transaction networks have been neglected in the past researches. We use graph regularized method to link past transaction records with future transactions. Based on this, we propose a single latent factor-dependent, non-negative, multiplicative and graph regularized-incorporated update (SLF-NMGRU) algorithm and further propose graph regularized nonnegative latent factor analysis (GrNLFA) model. Finally, experiments on a real cryptocurrency transaction network show that the proposed method improves both the accuracy and the computational efficiency. © 2022, CC BY-NC-ND.

关键词： Multivariant analysis

VEIN: High Scalability Routing Algorithm for Blockchain-based Payment Channel networks

学校读者我要写书评

暂无评论

VEIN: High Scalability Routing Algorithm for Blockchain-base...

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Qianyun Gong Chengjin Zhou Le Qi Jianbin Li Jianzhong Zhang Jingdong Xu Institute of Systems and Networks College of Computer Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Shijiazhuang Huayan Traffic Technology Co. Ltd.

ISBN: (纸本)9781665416597

The payment channel networks (PCNs), as the main method of blockchain off-chain expansion, have received extensive attention in recent years. Using the PCNs, two unconnected parties in a transaction can forward payments through existing payment channels of other nodes, which dramatically reduces interactions with the blockchain. But in large-scale dynamic PCNs, the routing mechanism is a challenge. Existing PCNs routing algorithms have some limitations. The landmark routing destroys the decentralization of blockchain. The static routing requires nodes having a global view and ultra-high computing power, which can not be applied to light nodes. We propose VEIN, a dynamic multi-path source routing algorithm, which is suitable for not only full nodes but also light nodes. We present an ingenious routing protocol, a modified max-flow algorithm to find edge-disjoint paths, and a path selection algorithm to deal with the NP-hard multi-path selection problem. Extensive experiments show that VEIN increases the transaction success ratio by 34% with the state-of-art algorithm, and realizes multiple orders of magnitude reduction in storage. In addition, we implement a prototype of VEIN on the Ethereum testnet to verify its feasibility.

关键词： Privacy Heuristic algorithms Veins Scalability Conferences Prototypes Routing

Towards 6G wireless communication networks:vision, enabling technologies, and new paradigm shifts

学校读者我要写书评

暂无评论

science China(Information sciences) 2021年第1期64卷 5-78页

作者： Xiaohu YOU Cheng-Xiang WANG Jie HUANG Xiqi GAO Zaichen ZHANG Mao WANG Yongming HUANG Chuan ZHANG Yanxiang JIANG Jiaheng WANG Min ZHU Bin SHENG Dongming WANG Zhiwen PAN Pengcheng ZHU Yang YANG Zening LIU Ping ZHANG Xiaofeng TAO Shaoqian LI Zhi CHEN Xinying MA Chih-Lin I Shuangfeng HAN Ke LI Chengkang PAN Zhimin ZHENG Lajos HANZO Xuemin (Sherman) SHEN Yingjie Jay GUO Zhiguo DING Harald HAAS Wen TONG Peiying ZHU Ganghua YANG Jun WANG Erik G.LARSSON Hien Quoc NGO Wei HONG Haiming WANG Debin HOU Jixin CHEN Zhe CHEN Zhangcheng HAO Geoffrey Ye LI Rahim TAFAZOLLI Yue GAO H.Vincent POOR Gerhard P.FETTWEIS Ying-Chang LIANG National Mobile Communications Research Laboratory School of Information Science and EngineeringSoutheast University Purple Mountain Laboratories Shanghai Institute of Fog Computing Technology (SHIFT) ShanghaiTech University Research Center for Network Communication Peng Cheng Laboratory State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications National Engineering Laboratory for Mobile Network Technologies Beijing University of Posts and Telecommunications National Key Laboratory of Science and Technology on Communications University of Electronic Science and Technology of China (UESTC) China Mobile Research Institute School of Electronics and Computer Science University of Southampton Department of Electrical and Computer Engineering University of Waterloo Global Big Data Technologies Centre (GBDTC) University of Technology Sydney School of Electrical and Electronic Engineering The University of Manchester LiFi Research and Development Centre Institute for Digital CommunicationsSchool of EngineeringThe University of Edinburgh Huawei Technologies Canada Co. Ltd. Huawei Technologies Department of Electrical Engineering (ISY) Link?ping University Institute of Electronics Communications & Information Technology (ECIT)Queen's University Belfast State Key Laboratory of Millimeter Waves School of Information Science and EngineeringSoutheast University School of Electrical and Computer Engineering Georgia Institute of Technology 5G Innovation Centre University of Surrey Princeton University Vodafone Chair Mobile Communications Systems Technische Universit?t Dresden Center for Intelligent Networking and Communications (CINC) University of Electronic Science and Technology of China (UESTC)

The fifth generation(5G) wireless communication networks are being deployed worldwide from 2020 and more capabilities are in the process of being standardized, such as mass connectivity, ultra-reliability,and guaranteed low latency. However, 5G will not meet all requirements of the future in 2030 and beyond, and sixth generation(6G) wireless communication networks are expected to provide global coverage, enhanced spectral/energy/cost efficiency, better intelligence level and security, etc. To meet these requirements, 6G networks will rely on new enabling technologies, i.e., air interface and transmission technologies and novel network architecture, such as waveform design, multiple access, channel coding schemes, multi-antenna technologies, network slicing, cell-free architecture, and cloud/fog/edge computing. Our vision on 6G is that it will have four new paradigm shifts. First, to satisfy the requirement of global coverage, 6G will not be limited to terrestrial communication networks, which will need to be complemented with non-terrestrial networks such as satellite and unmanned aerial vehicle(UAV) communication networks, thus achieving a space-airground-sea integrated communication network. Second, all spectra will be fully explored to further increase data rates and connection density, including the sub-6GHz, millimeter wave(mmWave), terahertz(THz),and optical frequency bands. Third, facing the big datasets generated by the use of extremely heterogeneous networks, diverse communication scenarios, large numbers of antennas, wide bandwidths, and new service requirements, 6G networks will enable a new range of smart applications with the aid of artificial intelligence(AI) and big data technologies. Fourth, network security will have to be strengthened when developing 6G networks. This article provides a comprehensive survey of recent advances and future trends in these four aspects. Clearly, 6G with additional technical requirements beyond those of 5G will enable f

关键词： 6G vision network architecture air interface and transmission technologies space-air-ground-sea integrated network all spectra artificial intelligence network security

Continual domain adaptation for machine reading comprehension

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Su, Lixin Guo, Jiafeng Zhang, Ruqing Fan, Yixing Lan, Yanyan Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China China University of Chinese Academy of Sciences Beijing China

Machine reading comprehension (MRC) has become a core component in a variety of natural language processing (NLP) applications such as question answering and dialogue systems. It becomes a practical challenge that an MRC model needs to learn in non-stationary environments, in which the underlying data distribution changes over time. A typical scenario is the domain drift, i.e. different domains of data come one after another, where the MRC model is required to adapt to the new domain while maintaining previously learned ability. To tackle such a challenge, in this work, we introduce the Continual Domain Adaptation (CDA) task for MRC. So far as we know, this is the first study on the continual learning perspective of MRC. We build two benchmark datasets for the CDA task, by re-organizing existing MRC collections into different domains with respect to context type and question type, respectively. We then analyze and observe the catastrophic forgetting (CF) phenomenon of MRC under the CDA setting. To tackle the CDA task, we propose several BERT-based continual learning MRC models using either regularization-based methodology or dynamic-architecture paradigm. We analyze the performance of different continual learning MRC models under the CDA task and show that the proposed dynamic-architecture based model achieves the best performance. Copyright © 2020, The Authors. All rights reserved.

关键词： Memory architecture

L2R2: Leveraging ranking for abductive reasoning

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhu, Yunchang Pang, Liang Lan, Yanyan Cheng, Xueqi CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China China University of Chinese Academy of Sciences Beijing China

The abductive natural language inference task (αNLI) is proposed to evaluate the abductive reasoning ability of a learning system. In the αNLI task, two observations are given and the most plausible hypothesis is asked to pick out from the candidates. Existing methods simply formulate it as a classification problem, thus a cross-entropy log-loss objective is used during training. However, discriminating true from false does not measure the plausibility of a hypothesis, for all the hypotheses have a chance to happen, only the probabilities are different. To fill this gap, we switch to a ranking perspective that sorts the hypotheses in order of their plausibilities. With this new perspective, a novel L2R2 approach is proposed under the learning-to-rank framework. Firstly, training samples are reorganized into a ranking form, where two observations and their hypotheses are treated as the query and a set of candidate documents respectively. Then, an ESIM model or pre-trained language model, e.g. BERT or RoBERTa, is obtained as the scoring function. Finally, the loss functions for the ranking task can be either pair-wise or list-wise for training. The experimental results on the ART dataset reach the state-of-the-art on the public leaderboard. © 2020, CC BY.

关键词： Learning systems

A secure deduplication scheme based on data popularity with fully random tags

学校读者我要写书评

暂无评论

A secure deduplication scheme based on data popularity with ...

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Guanxiong Ha Hang Chen Chunfu Jia Ruiqi Li Qiaowen Jia College of Cyber Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781665416597

It is difficult to provide semantic security for user data while using deduplication to save storage space in cloud storage. Some studies attempt to provide different levels of security for data according to their popularity for a reasonable trade-off between security and efficiency. However, existing schemes generally need a trusted third party to store deterministic data tags to record data popularity. If the trusted third party is compromised by adversaries, the deterministic tags will expose data information. In this paper, we propose a popularity-based secure deduplication scheme with fully random tags, which does not need to store deterministic tags. Our solution is using the homomorphic encryption to generate comparable random tags to record data popularity and using binary search to reduce time complexity of tag comparison to logarithmic time. Besides, we also design a proof of ownership protocol based on homomorphic encryption to prevent adversaries with only the data tag from tampering with the data popularity, which are not considered in the existing popularity-based schemes. We implement our scheme for system efficiency evaluation. Compared with the scheme of Stanek et al., our scheme has a slight improvement in encryption efficiency.

关键词： Privacy Cloud computing Protocols Conferences Semantics Prototypes Resists

Dynamics and Resonance Fluorescence from a Superconducting Artificial Atom Doubly Driven by Quantized and Classical Fields

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ruan, Xinhui Wang, Jia-Heng He, Dong Song, Pengtao Li, Shengyong Zhao, Qianchuan Kuang, L.M. Tsai, Jaw-Shen Zou, Chang-Ling Zhang, Jing Zheng, Dongning Astafiev, O.V. Liu, Yu-Xi Peng, Zhihui Department of Automation Tsinghua University Beijing100084 China Key Laboratory of Low-Dimensional Quantum Structures and Quantum Control of Ministry of Education Department of Physics and Synergetic Innovation Center of Quantum Effects and Applications Hunan Normal University Changsha410081 China School of Integrated Circuits Tsinghua University Beijing100084 China Institute of Physics Chinese Academy of Sciences Beijing100190 China School of Physical Sciences University of Chinese Academy of Sciences Beijing100190 China Center for Quantum Computing RIKEN Saitama351-0198 Japan Graduate School of Science Tokyo University of Science 1-3 Kagurazaka Shinjuku Tokyo162-0825 Japan CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei Anhui230026 China Hefei National Laboratory Hefei230088 China School of Automation Science and Engineering Xi'an Jiaotong University Xi’an710049 China MOE Key Lab for Intelligent Networks and Network Security Xi'an Jiaotong University Xi’an710049 China Skolkovo Institute of Science and Technology Nobel str. 3 Moscow143026 Russia Moscow Institute of Physics and Technology Institutskiy Pereulok 9 Dolgoprudny141701 Russia Royal Holloway University of London Surrey EghamTW20 0EX United Kingdom

We report an experimental demonstration of resonance fluorescence in a two-level superconducting artificial atom under two driving fields coupled to a detuned cavity. One of the fields is classical and the other is varied from quantum (vacuum fluctuations) to classical one by controlling the photon number inside the cavity. The device consists of a transmon qubit strongly coupled to a one-dimensional transmission line and a coplanar waveguide resonator. We observe a sideband anti-crossing and asymmetry in the emission spectra of the system through a one-dimensional transmission line, which is fundamentally different from the weak coupling case. By changing the photon number inside the cavity, the emission spectrum of our doubly driven system approaches to the case when the atom is driven by two classical bichromatic fields. We also measure the dynamical evolution of the system through the transmission line and study the properties of the first-order correlation function, Rabi oscillations and energy relaxation in the system. The study of resonance fluorescence from an atom driven by two fields promotes understanding decoherence in superconducting quantum circuits and may find applications in superconducting quantum computing and quantum networks. Copyright © 2024, The Authors. All rights reserved.

关键词： Electric lines

How medical crowdfunding helps people? A large-scale case study on waterdrop fundraising

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Huang, Junjie Shen, Huawei Cao, Qi Cai, Li Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Beijing Zongqing Xiangqian Science and Technology Co Ltd Beijing China

While online medical crowdfunding achieved tremendous success, quantitative study about whether and how medical crowdfunding helps people remains little explored. In this paper, we empirically study how online medical crowdfunding helps people using more than 27, 000 fundraising cases in Waterdrop Fundraising, one of the most popular online medical crowdfunding platforms in China. We find that the amount of money obtained by fundraisers is broadly distributed, i.e., a majority of lowly donated cases coexist with a handful of very successful cases. We further investigate the factors that potentially correlate with the success of medical fundraising cases. Profile information of fundraising cases, e.g., geographic information of fundraisers, affects the donated amounts, since detailed description may increase the credibility of a fundraising case. One prominent finding lies in the effect of social network on the success of fundraising cases: the spread of fundraising information along social network is a key factor of fundraising success, and the social capital of fundraisers play an important role in fundraising. Finally, we conduct prediction of donations using machine learning models, verifying the effect of potential factors to the success of medical crowdfunding. Altogether, this work presents a data-driven view of medical fundraising on the web and opens a door to understanding medical crowdfunding. Copyright © 2020, The Authors. All rights reserved.

关键词： Crowdsourcing