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

Discrimination-Aware Domain Adversarial Neural Network

Journal of Computer Science & Technology 2020年第2期35卷 259-267页

作者： Yun-Yun Wang Jian-Min Gu Chao Wang Song-Can Chen Hui Xue College of Computer Science and Engineering Nanjing University of Posts and Telecommunications Nanjing 210046China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing 210046China College of Computer Science and Technology/College of Artificial Intelligence Nanjing University of Aeronautics and AstronauticsNanjing 210023China Key Laboratory of Pattern Analysis and Machine Intelligence Ministry of Industry and Information Technology Nanjing 210023China School of Computer Science and Engineering Southeast UniversityNanjing 210096China

The domain adversarial neural network(DANN)methods have been successfully proposed and attracted much attention *** DANNs,a discriminator is trained to discriminate the domain labels of features generated by a generator,whereas the generator attempts to confuse it such that the distributions between domains are *** a result,it actually encourages the whole alignment or transfer between domains,while the inter-class discriminative information across domains is not *** this paper,we present a Discrimination-Aware Domain Adversarial Neural Network(DA2NN)method to introduce the discriminative information or the discrepancy of inter-class instances across domains into deep domain ***2NN considers both the alignment within the same class and the separation among different classes across domains in knowledge transfer via multiple *** results show that DA2NN can achieve better classification performance compared with the DANN methods.

关键词： adversarial learning inter-class separation deep neural network discrimination-aware domain adaptation

来源：评论

学校读者我要写书评

暂无评论

Network data Classification Mechanism for Intrusion Detection System

Network Data Classification Mechanism for Intrusion Detectio...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Shuai Jiang Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

Intrusion detection system (IDS), as a network security device, monitors network data in real time and responds actively when it detects suspicious transmissions. However, suffered from the large amount of redundancy and high correlation of network data, the traditional IDS have defects in low detection rate and high computational overhead. In this paper, we propose a network data classification mechanism (CPEL). data preprocessing of network traffic data is first performed using correlation-based feature selection (CFS) and principal component analysis (PCA). CFS selects the best features in the data, PCA to dimensionality reduction and denoising. Then, we use multiple classifiers to perform anomaly detection, and select the best three classifiers according to the classification effect. On this basis, we use the majority vote as the ensemble learning (EL) method of combination rules to further improve the performance of the classifier. Experimental results on the benchmark NSL-KDD and WSN-DS datasets indicate that this mechanism outperforms a single algorithm in accuracy and detection rate. In the meantime, computational overhead is remarkably reduced.

关键词： Dimensionality reduction Wireless sensor networks Redundancy Intrusion detection Telecommunication traffic Feature extraction Real-time systems

来源：评论

学校读者我要写书评

暂无评论

TSC-ECFA:A Trusted Service Composition Scheme for Edge Cloud

TSC-ECFA:A Trusted Service Composition Scheme for Edge Cloud

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yu Jiang Xiaolong Xu Kunda Lin Weihua Duan Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781665408790

In order to select a composition scheme that meets user's needs and high performance from large-scale web services in the edge cloud, this paper proposes a trusted service composition optimization scheme called TSC-ECFA for edge cloud, which applies the predation strategy to the firefly algorithm (FA) and divides the services with the same input and output into one category, reducing the number of combinations to search for feasible solutions. The cotangent chaos theory is used to generate the initial firefly population and disturb the location of the individual to improve the overall search efficiency of FA. This paper also improves the step factor and attractiveness formula of FA to give full play to the detection ability of the step factor in the early stage of the algorithm, and balance the local search and the global search. Considering that the QoS attribute values of the service are vulnerable to be tampered with, the blockchain is used to store the QoS attribute values to ensure the tamper-proof and reliability of the QoS attribute value. Finally, simulation experiments compare the number of iterations and optimization of the three algorithms. The experimental results show that the comprehensive performance of TSC-ECFA is better than other algorithms.

关键词： Chaos Web services Conferences Sociology Quality of service Reliability theory Blockchains

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Blockchain-Based Identity Authentication Scheme for Mobile Crowd Sensing

SSRN

引用

SSRN 2022年

作者： Taochun, Wang Huimin, Shen Jian, Chen Fulong, Chen Qingshan, Wu Dong, Xie School of Computer and Information Anhui Normal University Wuhu241002 China Anhui Engineering Research Centers of Medical Big Data Intelligent System Anhui Normal University Wuhu241002 China Anhui Key Laboratory of Network and Information Security Anhui Normal University Wuhu241002 China

With the continuous innovation and popularization of mobile smart devices, the application of Mobile Crowd Sensing (MCS) has been widely studied. However, the existing centralized MCS applications that use servers for task publishing and data collection have common problems such as a single point of failure and privacy protection. Based on this, we proposes a hybrid blockchain-based identity authentication scheme for MCS named HBIA, which uses blockchain technology to solve the single point failure problem of MCS. HBIA builds a cluster structure based on factors such as geographical location and balance, and uses this to build a hybrid blockchain, with the cluster head node and the node within the cluster authenticating on the public chain and the private chain respectively, and the use of Zero-knowledge proof(ZKP) to ensure the identity privacy of participants, thus balancing the contradiction between blockchain transparency and participant identity privacy. In addition, HBIA uses zero-knowledge succinct non-interactive argument of knowledge(zk-SNARKs) technology to implement off-chain computing and on-chain verification, further reducing the workload of the blockchain. Finally, the HBIA scheme was tested on the Ethereum public test network Ropsten, and the test results showed that the identity authentication scheme proposed in this paper has advantages in execution time and throughput. © 2022, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Inductive Subgraph Embedding for Link Prediction

arXiv

引用

arXiv 2021年

作者： Miao, Chunyu Xie, Chenxuan Zhou, Jiajun Yu, Shanqing Chen, Lina Xuan, Qi The College of Mathematics Physics and Information Engineering Zhejiang Normal University Zhejiang Jinhua310023 China The Key Laboratory of Peace-building Big Data of Zhejiang Province Hangzhou310051 China The Institute of Cyberspace Security Zhejiang University of Technology Hangzhou310023 China The Binjiang Cyberspace Security Institute of ZJUT Hangzhou310023 China

Link prediction, which aims to infer missing edges or predict future edges based on currently observed graph connections, has emerged as a powerful technique for diverse applications such as recommendation, relation completion, etc. While there is rich literature on link prediction based on node representation learning, direct link embedding is relatively less studied and less understood. One common practice in previous work characterizes a link by manipulate the embeddings of its incident node pairs, which is not capable of capturing effective link features. Moreover, common link prediction methods such as random walks and graph auto-encoder usually rely on full-graph training, suffering from poor scalability and high resource consumption on large-scale graphs. In this paper, we propose Inductive Subgraph Embedding for Link Prediciton (SE4LP) - an end-to-end scalable representation learning framework for link prediction, which utilizes the strong correlation between central links and their neighborhood subgraphs to characterize links. We sample the "link-centric induced subgraphs" as input, with a subgraph-level contrastive discrimination as pretext task, to learn the intrinsic and structural link features via subgraph classification. Extensive experiments on five datasets demonstrate that SE4LP has significant superiority in link prediction in terms of performance and scalability, when compared with state-of-the-art methods. Moreover, further analysis demonstrate that introducing self-supervision in link prediction can significantly reduce the dependence on training data and improve the generalization and scalability of model. The source code will be available online. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Estimating Power Consumption of Containers and Virtual Machines in data Centers

Estimating Power Consumption of Containers and Virtual Machi...

引用

IEEE International Conference on Cluster Computing

作者： Xusheng Zhang Ziyu Shen Bin Xia Zheng Liu Yun Li Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications

ISBN: (数字)9781728166773

ISBN: (纸本)9781728166780

Virtualization technologies provide solutions of cloud computing. Virtual resource scheduling is a crucial task in data centers, and the power consumption of virtual resources is a critical foundation of virtualization scheduling. Containers are the smallest unit of virtual resource scheduling and migration. Although many effective models for estimating power consumption of virtual machines (VM) have been proposed, few power estimation models of containers have been put forth. In this paper, we offer a fast-training piecewise regression model based on decision tree to build a VM power estimation model and estimate the containers' power by treating the container as a group of processes on the VM. In our model, we characterize the nonlinear relationship between power and features and realize the effective estimation of the containers on the VM. We evaluate the proposed model on 13 workloads in PARSEC and compare it with several models. The experimental results prove the effectiveness of our proposed model on most workloads. Moreover, the estimated power of the containers is in line with expectations.

关键词： Power demand Processor scheduling Estimation Containers Virtual machining data models Virtualization

来源：评论

学校读者我要写书评

暂无评论

AdAUC: End-to-end Adversarial AUC Optimization Against Long-tail Problems

arXiv

引用

arXiv 2022年

作者： Hou, Wenzheng Xu, Qianqian Yang, Zhiyong Bao, Shilong He, Yuan Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen China

It is well-known that deep learning models are vulnerable to adversarial examples. Existing studies of adversarial training have made great progress against this challenge. As a typical trait, they often assume that the class distribution is overall balanced. However, long-tail datasets are ubiquitous in a wide spectrum of applications, where the amount of head class instances is larger than the tail classes. Under such a scenario, AUC is a much more reasonable metric than accuracy since it is insensitive toward class distribution. Motivated by this, we present an early trial to explore adversarial training methods to optimize AUC. The main challenge lies in that the positive and negative examples are tightly coupled in the objective function. As a direct result, one cannot generate adversarial examples without a full scan of the dataset. To address this issue, based on a concavity regularization scheme, we reformulate the AUC optimization problem as a saddle point problem, where the objective becomes an instance-wise function. This leads to an end-to-end training protocol. Furthermore, we provide a convergence guarantee of the proposed algorithm. Our analysis differs from the existing studies since the algorithm is asked to generate adversarial examples by calculating the gradient of a min-max problem. Finally, the extensive experimental results show the performance and robustness of our algorithm in three long-tail datasets. © 2022, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Tutorial on Movable Antennas for Wireless Networks

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Zhu, Lipeng Ma, Wenyan Mei, Weidong Zeng, Yong Wu, Qingqing Ning, Boyu Xiao, Zhenyu Shao, Xiaodan Zhang, Jun Zhang, Rui National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore National Key Laboratory of Wireless Communications Chengdu611731 China Southeast University National Mobile Communications Research Laboratory Frontiers Science Center for Mobile Information Communication and Security Nanjing210096 China Purple Mountain Laboratories Nanjing211111 China Shanghai Jiao Tong University Department of Electronic Engineering Shanghai200240 China Beihang University School of Electronic and Information Engineering Beijing100191 China University of Waterloo Department of Electrical and Computer Engineering WaterlooONN2L 3G1 Canada Beijing Institute of Technology State Key Laboratory of CNS/ATM Miit Key Laboratory of Complex-field Intelligent Sensing Beijing100081 China The Chinese University of HongKong School of Science and Engineering Shenzhen Research Institute of Big Data Guangdong Shenzhen518172 China

Movable antenna (MA) has been recognized as a promising technology to enhance the performance of wireless communication and sensing by enabling antenna movement. Such a significant paradigm shift from conventional fixed antennas (FAs) to MAs offers tremendous new opportunities towards realizing more versatile, adaptive and efficient next-generation wireless networks such as 6G. In this paper, we provide a comprehensive tutorial on the fundamentals and advancements in the area of MA-empowered wireless networks. First, we overview the historical development and contemporary applications of MA technologies. Next, to characterize the continuous variation in wireless channels with respect to antenna position and/or orientation, we present new field-response channel models tailored for MAs, which are applicable to narrowband and wideband systems as well as far-field and near-field propagation conditions. Subsequently, we review the state-of-the-art architectures for implementing MAs and discuss their practical constraints. A general optimization framework is then formulated to fully exploit the spatial degrees of freedom (DoFs) in antenna movement for performance enhancement in wireless systems. In particular, we delve into two major design issues for MA systems. First, we address the intricate antenna movement optimization problem for various communication and/or sensing systems to maximize the performance gains achievable by MAs. Second, we deal with the challenging channel acquisition issue in MA systems for reconstructing the channel mapping between arbitrary antenna positions inside the transmitter and receiver regions. Moreover, we show existing prototypes developed for MA-aided communication/sensing and the experimental results based on them. Finally, the extension of MA design to other wireless systems and its synergy with other emerging wireless technologies are discussed. We also highlight promising research directions in this area to inspire future investigatio

关键词： Antenna arrays

来源：评论

学校读者我要写书评

暂无评论

PSSPR: A Source Location Privacy Protection Scheme Based on Sector Phantom Routing in WSNs

PSSPR: A Source Location Privacy Protection Scheme Based on ...

引用

IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Jing Sun Yuling Chen Tao Li Jia Liu Yixian Yang State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China Air Force Engineering University Xi'an China School of Cyberspace Security Beijing University of Posts and Telecommnuications Beijing China

ISBN: (纸本)9781665421751

Source location privacy, occupying an unshakable status in wireless sensor networks, has a profound influence on the widespread application of wireless sensor networks (WSNs). Most privacy policies that introduce phantom nodes to the source location have the problem that the transmission path between the phantom node and the source is not diversified enough, and the phantom node area is close to the source. For this reason, a source location privacy protection scheme based on sector domain phantom routing is proposed. The scheme uses the sector domain and the coordinates of the central node $V$ to increase the geographical position diversity of the phantom node, which completely avoids the visible and protects the security of the source location. Theoretical analysis and simulation results show that our scheme can enhance the security of source position.

关键词： Wireless communication Wireless sensor networks Privacy Simulation Phantoms Position measurement Routing

来源：评论

学校读者我要写书评

暂无评论

Learning Task-aware Robust Deep Learning Systems

arXiv

引用

arXiv 2020年

作者： Han, Keji Li, Yun Long, Xianzhong Ge, Yao Nanjing University of Posts and Telecommunications China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing

Many works demonstrate that deep learning system is vulnerable to adversarial attack. A deep learning system consists of two parts: the deep learning task and the deep model. Nowadays, most existing works investigate the impact of the deep model on robustness of deep learning systems, ignoring the impact of the learning task. In this paper, we adopt the binary and interval label encoding strategy to redefine the classification task and design corresponding loss to improve robustness of the deep learning system. Our method can be viewed as improving the robustness of deep learning systems from both the learning task and deep model. Experimental results demonstrate that our learning task-aware method is much more robust than traditional classification while retaining the accuracy. © 2020, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：