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

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zhouqing Han Xiaojun Zhu Lijie Xu Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications China

ISBN: (数字)9781728190747

ISBN: (纸本)9781728183824

We consider barrier coverage applications where a set of UAVs are deployed to monitor whether intruders pass through a line, i.e., the barrier. Due to limited energy supply of UAVs, a charging pile is used to recharge UAVs. The problem is to place UAVs on top of the barrier and schedule them to the charging pile such that the barrier is seamlessly covered and the total number of UAVs is minimized. We decompose the problem into subproblems by dividing the barrier into disjoint subsegments and covering each subsegment independently. We prove a theoretical lower bound on the minimum number of UAVs required to cover the barrier forever. We then propose two scheduling strategies. In the first strategy, only fully recharged backup UAVs will be scheduled to take over UAVs running out of energy. If there are enough UAVs, this strategy can cover the barrier forever. The second strategy is proposed to deal with the situation that the number of UAVs is insufficient. Under the strategy, if no backup UAV is fully recharged, the one with the most battery energy will be selected to take over the monitoring task. When the number of UAVs is insufficient, the barrier can still be covered for a long time. We analytically derive the number of UAVs required by the first strategy, and the monitoring duration of the second strategy in case of insufficient UAVs. Simulations verify the effectiveness of the proposed solutions.

关键词： Schedules Conferences Force Batteries Task analysis Monitoring

来源：评论

学校读者我要写书评

暂无评论

An adaptive flow table adjustment algorithm for SDN 21

An adaptive flow table adjustment algorithm for SDN

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Xu, Xiaolong Hu, Liuyun Lin, Haowei Fan, Zexuan School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

SDN (Software-defined networking) are important for current network systems, such as cloud systems. The characteristics of flow in SDN and the impact of flow table entries and controllers on data packet transmission are analyzed. We propose an adaptive flow table adjustment algorithm for SDN called CFC (Combine flow table and controller). It is important for CFC to monitor the network traffic in real time. According to the proportion of active flow entries in the OpenFlow switch, the value of idle-timeout will be set dynamically based on the characteristics of different data flows. When the switch forwards packets, it will minimize the calculation load of controller, and allocate a reasonable value of idle-timeout to the idle flow table entries. So it can delete discarded flow table entries in time and improve the hit rate of data packets. The experiments show that the utilization rate of the flow table resource is enhanced. With the improvement of data packets' forwarding rate, the average throughput of the network has also increased. At the same time, it can also cope with the burst traffic in SDN and ensure them to be forwarded normally and effectively. © 2019 IEEE.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Flight Path Optimization for UAVs to Provide Location Service to Ground Targets

Flight Path Optimization for UAVs to Provide Location Servic...

引用

IEEE Conference on Wireless Communications and Networking

作者： Youpeng Wang Xiaojun Zhu Lijie Xu College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications China

ISBN: (数字)9781728131061

ISBN: (纸本)9781728131078

We consider using UAVs to provide location service to ground targets. UAVs fly over the target area and broadcast their locations periodically via wireless signals. When a UAV flies along a straight line, a target will observe the strongest signal when the UAV is at the closest location, based on which it can infer its location. The problem is to minimize the flight length subject to the constraint that the transmission range of a UAV is limited and all targets in the area should be located. We formulate the problem and give an optimal flight path to cover a square with side length no greater than a certain value. In the general case when the given area cannot be covered by the square, we propose to divide UAVs into two groups, whose flight paths are either parallel or orthogonal. We conduct simulations to compare our approach with existing approaches. Results verify the superiority of our approach in terms of flight length and localization error.

关键词：

来源：评论

学校读者我要写书评

暂无评论

APDPk-means: A new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation 21

APDPk-means: A new differential privacy clustering algorithm...

引用

作者： Fan, Zexuan Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security AND Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728120584

How to protect users' private data during network data mining has become a hot issue in the fields of big data and network information security. Most current researches on differential privacy k-means clustering algorithms focus on optimizing the selection of initial centroids. However, the traditional privacy budget allocation has the problem that the random noise becomes too large as the number of iterations increases, which will reduce the performance of data clustering. To solve the problem, we improved the way of privacy budget allocation in differentially private clustering algorithm DPk-means, and proposed APDPk-means, a new differential privacy clustering algorithm based on arithmetic progression privacy budget allocation. APDPk-means decomposes the total privacy budget into a decreasing arithmetic progression, allocating the privacy budgets from large to small in the iterative process, so as to ensure the rapid convergence in early iteration. The experiment results show that compared with the other differentially private k-means algorithms, APDPk-means has better performance in availability and quality of the clustering result under the same level of privacy protection. © 2019 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Universal deep network for steganalysis of color image based on channel representation

arXiv

引用

arXiv 2021年

作者： Wei, Kangkang Luo, Weiqi Tan, Shunquan Huang, Jiwu The Guangdong Key Lab of Information Security Technology School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Up to now, most existing steganalytic methods are designed for grayscale images, and they are not suitable for color images that are widely used in current social networks. In this paper, we design a universal color image steganalysis network (called UCNet) in spatial and JPEG domains. The proposed method includes preprocessing, convolutional, and classification modules. To preserve the steganographic artifacts in each color channel, in preprocessing module, we firstly separate the input image into three channels according to the corresponding embedding spaces (i.e. RGB for spatial steganography and YCbCr for JPEG steganography), and then extract the image residuals with 62 fixed high-pass filters, finally concatenate all truncated residuals for subsequent analysis rather than adding them together with normal convolution like existing CNN-based steganalyzers. To accelerate the network convergence and effectively reduce the number of parameters, in convolutional module, we carefully design three types of layers with different shortcut connections and group convolution structures to further learn high-level steganalytic features. In classification module, we employ a global average pooling and fully connected layer for classification. We conduct extensive experiments on ALASKA II to demonstrate that the proposed method can achieve state-of-the-art results compared with the modern CNN-based steganalyzers (e.g., SRNet and J-YeNet) in both spatial and JPEG domains, while keeping relatively few memory requirements and training time. Furthermore, we also provide necessary descriptions and many ablation experiments to verify the rationality of the network design. Copyright © 2021, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Energy Consumption of IT System in Cloud data Center: Architecture, Factors and Prediction 16th

Energy Consumption of IT System in Cloud Data Center: Archit...

引用

16th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2019

作者： Lin, Haowei Xu, Xiaolong Wang, Xinheng Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China University of West London LondonW55RF United Kingdom

ISBN: (纸本)9783030307080

In recent years, as cloud data center has grown constantly in size and quantity, the energy consumption of cloud data center has increased dramatically. Therefore, it is of great significance to study the energy-saving issues of cloud data centers in depth. Therefore, this paper analyzes the architecture of energy consumption of IT system in cloud data centers and proposes a new framework for collecting energy consumption. Based on this framework, the factors affecting energy consumption are studied, and various parameters closely related to energy consumption are selected. Finally, the RBF neural network is used to model and predict the energy consumption of the cloud data centers, which is aim to prove the accuracy of the framework for collecting energy consumption and influencing factors. The experimental results show that these parameters under the framework for collecting energy consumption have better accuracy and adaptability to the prediction of energy consumption in cloud data centers than the previous model of energy consumption prediction. © 2019, IFIP International Federation for Information processing.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Application and visualization of typical clustering algorithms in seismic data analysis

引用

Procedia Computer Science 2019年 151卷 171-178页

作者： Z. Fan X. Xu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China

Earthquake brings enormous loss of lives and properties to human beings due to its suddenness, destructiveness and inscrutability. The new techniques for analyzing seismic data can reveal the distribution of earthquakes, which helps us master the laws of earthquake disasters and reduce the risks brought by them. In this paper, we applied K-means and DBSCAN clustering algorithms to the analysis of seismic data. Their performances in fitting seismic belts with seismic datasets are compared. First, we map the positional parameters in the seismic data to coordinate points on a two-dimensional plane and then cluster them with the DBSCAN algorithm. In addition, we combine the magnitude and depth properties of seismic data, use the Elbow method to find the best K value, and then classifies the dataset by K-means algorithm. We visualize the results, and the distinction of each classification is clear. The experimental results show that the DBSCAN algorithm has a better effect on fitting the seismic belt, and the classification results of K-means algorithm for earthquakes are also in line with expectations.

关键词： Seismic Distribution Clustering K-means DBSCAN Visualization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：