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

International Conference on Computer Supported Cooperative Work in Design

作者： Xuanyan Liu Jinling He Hu Song Xinyun Cheng Luyun Hu Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing China State Grid Jiangsu Electric Power Company Limited Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Cloud-edge networks (CEN) has revolutionized the traditional network architecture. However, there are many security issues in CEN needing to be solved. In this case, CEN administrator should be able to detect network anomalies and find out the sources of anomalies rapidly, and respond in time to block anomalies. In order to protect network systems with CEN, we propose a mechanism consisting of two modules, including anomaly detection and anomaly traceback. The self-similarity anomaly detection is introduced for the first time to detect anomalies. In addition, we also propose an anomaly traceback method which utilizes the characteristics of CEN. An CEN testbed is established to evaluate the mechanism we proposed. Results of experiments show that the proposed mechanism can discover anomalies quickly and accurately, and trace anomaly sources and find anomaly paths accurately.

关键词： Federated learning Refining Process control Network security Network architecture Control systems Indexes

来源：评论

学校读者我要写书评

暂无评论

Model-based Offline Policy Optimization with Adversarial Network

arXiv

引用

arXiv 2023年

作者： Yang, Junming Chen, Xingguo Wang, Shengyuan Zhang, Bolei Jiangsu Key Laboratory of Big Data Security and Intelligent Processing China School of Computer Science Nanjing University of Posts and Telecommunications China School of Modern Posts Nanjing University of Posts and Telecommunications China

Model-based offline reinforcement learning (RL), which builds a supervised transition model with logging dataset to avoid costly interactions with the online environment, has been a promising approach for offline policy optimization. As the discrepancy between the logging data and online environment may result in a distributional shift problem, many prior works have studied how to build robust transition models conservatively and estimate the model uncertainty accurately. However, the over-conservatism can limit the exploration of the agent, and the uncertainty estimates may be unreliable. In this work, we propose a novel Model-based Offline policy optimization framework with Adversarial Network (MOAN). The key idea is to use adversarial learning to build a transition model with better generalization, where an adversary is introduced to distinguish between in-distribution and out-of-distribution samples. Moreover, the adversary can naturally provide a quantification of the model’s uncertainty with theoretical guarantees. Extensive experiments showed that our approach outperforms existing state-of-the-art baselines on widely studied offline RL benchmarks. It can also generate diverse in-distribution samples, and quantify the uncertainty more accurately. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Darkfight: A Detection Method of Violent Behavior in Dark Place for intelligent Monitoring System

SSRN

引用

SSRN 2022年

作者： Wang, Jun Xu, Xiaolong Nanjing University of Posts & Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing210023 China Nanjing University of Posts & Telecommunications School of Computer Science Nanjing210023 China

With the continuous development of deep learning, the use of deep learning methods for intelligent violent behavior recognition has become an active research field in computer vision. However, there are relatively few studies on violent behavior recognition in dark light environment. In this paper, we propose the DarkFight network model for violent behavior recognition in dark light environment. In the proposed DarkFight model, Resnet50 is used as the basic network model to extract features. In order to obtain multi-scale spatiotemporal features, DarkFight adds a multi-scale attention module PSA to the network. The DarkFight model uses Zero-DCE for low-light image enhancement. In order not to lose the spatiotemporal characteristics of the low-light environment, DarkFight uses the initial dark-light data and the enhanced data as the input to the two paths of the model. In addition, this paper researches the replacement of the traditional temporal global average pooling layer of the network with the BERT module to better utilize the temporal information when fusing the two path features. We construct a violent behavior dataset VDID (Violence Detection in Dark) in a dark-light environment, and conduct experimental verification on this dataset. The verification results show that the recognition precision of the DarkFight model increases by 2.51%, the accuracy increases by 3.4%, and the F1-score improves by 0.032. © 2022, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Area Charging for Wireless Rechargeable Sensors

Area Charging for Wireless Rechargeable Sensors

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Haipeng Dai Xiaoyu Wang Lijie Xu Chao Dong Qian Liu Lei Meng Guihai Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing CHINA Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing CHINA Nanjing University of Aeronautics and Astronautics Nanjing CHINA

ISBN: (数字)9781728166070

ISBN: (纸本)9781728166087

In this paper, we consider the problem of area charging, that is, assuming that there is a mobile charger (MC) equipped with a directional wireless charger whose charging area is in the shape of a sector, and the MC can only recharge sensors on the boundary of an Area of Interest (AOI), how to design an efficient charging scheme for the MC to recharge any sensor inside the AOI with efficient energy while its overall charging time is minimized. To address this problem, we first partition the AOI into two types of subareas, i.e., rectangle-like subareas and sector-like subareas, based on the Medial Axis of the AOI. Second, we propose rectangle-based moving strategy for the rectangle-like subareas, and sector-based rotating strategy for the sector-like subareas, respectively, for the MC. Finally, we calculate charging time of all subareas based on the above two moving strategies, and prove that our algorithm achieves a constant approximation ratio. We evaluate our algorithm by conducting extensive simulation. The results show that on average, other comparison algorithms require at least 18:70 times of charging time of that of our algorithm.

关键词： Sensors Wireless sensor networks Wireless communication Communication system security Approximation algorithms Shape security

来源：评论

学校读者我要写书评

暂无评论

Collaborative Bi-Aggregation for Directed Graph Embedding

SSRN

引用

SSRN 2023年

作者： Liu, Linsong Chen, Ke-Jia Liu, Zheng Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Jiangsu Nanjing210023 China School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Nanjing210023 China State Key Laboratory of Novel Software Technology Nanjing University Jiangsu Nanjing210093 China

Directed graph is able to model asymmetric relationships between nodes and research on directed graph embedding is of great significance in downstream graph analysis and inference. Learning source and target embeddings of nodes separately to preserve edge asymmetry has become the dominant approach, but also poses challenge for learning representations of low or even zero in/out degree nodes that are ubiquitous in sparse graphs. In this paper, a collaborative bi-directional aggregation method (COBA) for directed graph embedding is proposed. Firstly, the source and target embeddings of the central node are learned by aggregating from the counterparts of the source and target neighbors, respectively;Secondly, the source/target embeddings of the zero in/out degree central nodes are enhanced by aggregating the counterparts of opposite-directional neighbors (i.e. target/source neighbors);Finally, source and target embeddings of the same node are correlated to achieve collaborative aggregation. Both the feasibility and rationality of the model are theoretically analyzed. Extensive experiments on real-world datasets demonstrate that COBA comprehensively outperforms state-of-the-art methods on multiple tasks and meanwhile validates the effectiveness of proposed aggregation strategies. © 2023, The Authors. All rights reserved.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Deep representation learning for road detection using siamese network

arXiv

引用

arXiv 2019年

作者： Liu, Huafeng Han, Xiaofeng Li, Xiangrui Yao, Yazhou Huang, Pu Tang, Zhenming School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

Robust road detection is a key challenge in safe autonomous driving. Recently, with the rapid development of 3D sensors, more and more researchers are trying to fuse information across different sensors to improve the performance of road detection. Although many successful works have been achieved in this field, methods for data fusion under deep learning framework is still an open problem. In this paper, we propose a Siamese deep neural network based on FCN-8s to detect road region. Our method uses data collected from a monocular color camera and a Velodyne-64 LiDAR sensor. We project the LiDAR point clouds onto the image plane to generate LiDAR images and feed them into one of the branches of the network. The RGB images are fed into another branch of our proposed network. The feature maps that these two branches extract in multiple scales are fused before each pooling layer, via padding additional fusion layers. Extensive experimental results on public dataset KITTI ROAD demonstrate the effectiveness of our proposed approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

A Privacy-Preserving and Verifiable Federated Learning Scheme

A Privacy-Preserving and Verifiable Federated Learning Schem...

引用

IEEE International Conference on Communications (ICC)

作者： Xianglong Zhang Anmin Fu Huaqun Wang Chunyi Zhou Zhenzhu Chen School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing PR China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing PR China

ISBN: (数字)9781728150895

ISBN: (纸本)9781728150901

Due to the complexity of the data environment, many organizations prefer to train deep learning models together by sharing training sets. However, this process is always accompanied by the restriction of distributed storage and privacy. Federated learning addresses this challenge by only sharing gradients with the server without revealing training sets. Unfortunately, existing research has shown that the server could extract information of the training sets from shared gradients. Besides, the server may falsify the calculated result to affect the accuracy of the trained model. To solve the above problems, we propose a privacy-preserving and verifiable federated learning scheme. Our scheme focuses on processing shared gradients by combining the Chinese Remainder Theorem and the Paillier homomorphic encryption, which can realize privacy-preserving federated learning with low computation and communication costs. In addition, we introduce the bilinear aggregate signature technology into federated learning, which effectively verifies the correctness of aggregated gradient. Moreover, the experiment shows that even with the added verification function, our scheme still has high accuracy and efficiency.

关键词： Servers Machine learning Training Encryption Aggregates Computational modeling Privacy

来源：评论

学校读者我要写书评

暂无评论

Multi-agent game abstraction via graph attention neural network

arXiv

引用

arXiv 2019年

作者： Liu, Yong Wang, Weixun Hu, Yujing Hao, Jianye Chen, Xingguo Gao, Yang National Key Laboratory for Novel Software Technology Nanjing University Tianjin University NetEase Fuxi AI Lab Noah's Ark Lab Huawei Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications

In large-scale multi-agent systems, the large number of agents and complex game relationship cause great difficulty for policy learning. Therefore, simplifying the learning process is an important research issue. In many multi-agent systems, the interactions between agents often happen locally, which means that agents neither need to coordinate with all other agents nor need to coordinate with others all the time. Traditional methods attempt to use pre-defined rules to capture the interaction relationship between agents. However, the methods cannot be directly used in a large-scale environment due to the difficulty of transforming the complex interactions between agents into rules. In this paper, we model the relationship between agents by a complete graph and propose a novel game abstraction mechanism based on two-stage attention network (G2ANet), which can indicate whether there is an interaction between two agents and the importance of the interaction. We integrate this detection mechanism into graph neural network-based multi-agent reinforcement learning for conducting game abstraction and propose two novel learning algorithms GA-Comm and GA-AC. We conduct experiments in Traffic Junction and Predator-Prey. The results indicate that the proposed methods can simplify the learning process and meanwhile get better asymptotic performance compared with state-of-the-art algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Proxy Re-Encryption Scheme For Complicated Access Control Factors Description in Hybrid Cloud

Proxy Re-Encryption Scheme For Complicated Access Control Fa...

引用

IEEE International Conference on Communications (ICC)

作者： Zheng Lian Mang Su Anmin Fu Huaqun Wang Chunyi Zhou School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing PR China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing PR China

ISBN: (数字)9781728150895

ISBN: (纸本)9781728150901

Hybrid cloud has both the strong computing power of public cloud and easy control of private cloud. It provides users with robust services and convenience, meanwhile faces numerous security challenges. How to implement the effective access control is one of them, the purpose of which is deploying policy in private cloud to protect the ciphertext in public cloud. Furthermore, it becomes more and more difficult to describe the access control policy, which is suitable for multi-factor and dynamic updating. Considering the issues above, we propose a proxy re-encryption (PRE) scheme for complicated access control factors description in hybrid cloud. Firstly, we build the system model combining PRE with access control in hybrid cloud. Secondly, we design the algorithm for our scheme including the key construction with multi-factor and its weight, which achieve the target of dynamic updating. Finally, we analyze the security of this scheme by the mathematical method and performance by theory, experiment and comparisons with some other works. Our scheme has made the deployment of access control in hybrid cloud more reliable and scalable.

关键词： Cloud computing Access control Cryptography XML Reliability Privacy

来源：评论

学校读者我要写书评

暂无评论

Point Cloud Compression Method Based on Curvature Grading and Inter-point Compression for Industrial Products

Point Cloud Compression Method Based on Curvature Grading an...

引用

International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC

作者： Lei Wang Wei Huang Yiping Chen Ran Chen School of Computer Nanjing University of Posts and Telecommunications Nanjing P. R. China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing P. R. China

The traditional point cloud compression methods fail to meet the compression requirements of complex surface point cloud files in the industrial field. This paper proposes a point cloud compression method suitable for industrial products with defective and complex surfaces, which compresses the defect and non-defect parts separately using different compression approaches. A curvature-based compression method is designed for the defect points, and an inter-point compression method is developed for the non-defect part, achieving compression of both components of the point cloud. The experimental results show the advantages of the proposed compression method through a comparative analysis of time efficiency, compression ratio, and reconstruction accuracy for industrial point cloud compression.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：