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

Intelligent Computing and Human-Computer Interaction (ICHCI), International Conference on

作者： Wei Meng Meng Tia School of computer and information engineering Henan University Henan Key Laboratory of Big Data Analysis and Processing Henan Engineering Laboratory of Spatial Information Processing Kaifeng China

Currently, major security incidents caused by the “unlicensed flying” of Unmanned Aerial Vehicle (UAV) have emerged one after another, which poses a grave threat to the security issues of public facilities and sensitive areas. Whether it can timely detect and prevent “unlicensed flying” of UAV has become a social concern. In response to this demand, the transfer learning method is adopted in this paper to conduct twoclassification and detection on UAV images. Image recognition technology based on transfer learning is an effective method to improve recognition accuracy by applying deep learning models to small samples. Different from the large number of training samples required by deep learning, transfer learning transfers the weights of the pre-trained deep neural network, and uses only small sample data to obtain good results in UAV image recognition. First of all, this paper proposes to construct a UAV data set according to different types of UAV shape structures, to perfect the classification and detection effect and the generalization ability of the model. Then, based on the transfer learning method, experimental comparison is made between three classic deep convolutional neural network classification models (Inception V3, ResNet 101 and VGG16) and two classic deep convolutional neural network detection models (Faster RCNN and SSD). Finally, an experimental evaluation is conducted on the collected UAV test data set. Compared with the traditional recognition model, the image classification model based on transfer learning employed in this paper has achieved important improvements in accuracy, recall and precision. Especially in the InceptionV3 model of transfer training, the recall reaches 96.98%. In addition, the image detection model based on transfer learning has achieved good detection results in accuracy, recall and F1-score.

关键词： Training Deep learning Image recognition Shape Transfer learning Buildings Unmanned aerial vehicles

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal Evolution analysis of NO 2 Column Density before and after COVID-19 Pandemic in henan province Based on SI-APSTE Model

Research Square

引用

Research Square 2021年

作者： Liu, Yang Zhao, Jinhuan Song, Kunlin Cheng, Cheng Li, Shenshen Cai, Kun Henan Engineering Laboratory of Spatial Information Processing Henan Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Henan University Kaifeng475004 China State Key Laboratory of Remote Sensing Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100101 China School of Information and Electronics Beijing Institute of Technology Beijing100081 China

Air pollution is the result of comprehensive evolution of a dynamic and complex system composed of emission sources, topography, meteorology and other environmental factors. The establishment of spatiotemporal evolution model is of great significance for the study of air pollution mechanism, trend prediction, identification of pollution sources and pollution control. In this paper, the air pollution system is described based on cellular automata and restricted agents, and a Swarm Intelligence based Air Pollution SpatioTemporal Evolution (SI-APSTE) model is constructed. Then the spatiotemporal evolution analysis method of air pollution is studied. Taking henan province before and after COVID-19 pandemic as an example, the NO2 products of TROPOMI and OMI were analysed based on SI-APSTE model. The tropospheric NO2 Vertical Column Densities (VCDs) distribution characteristics of spatiotemporal variation of henan province before COVID-19 pandemic were studied. Then the tropospheric NO2 VCDs of TROPOMI was used to study the pandemic period, month-on-month and year-on-year in 18 urban areas of henan province. The results show that SI-APSTE model can effectively analyse the spatiotemporal evolution of air pollution by using environmental big data and swarm intelligence, and also can establish a theoretical basis for pollution source identification and trend prediction. © 2021, CC BY.

关键词： Air pollution

来源：评论

学校读者我要写书评

暂无评论

Fast Parallel Extraction Method of Normalized Vegetation Index

Fast Parallel Extraction Method of Normalized Vegetation Ind...

引用

International Conference on Computer Science & Education (ICCSE)

作者： Xianyu Zuo Tongyuan Qi Baojun Qiao Zhitao Deng Qiang Ge Key Laboratory of Big Data Analysis and Processing School of Computer and Information Engineering Henan University Kaifeng China

ISBN: (数字)9781728172675

ISBN: (纸本)9781728172682

At present, accelerated processing of remote sensing big data has become an important research topic in the field of remote sensing. Remote sensing image processing based on large-scale clusters currently is the mainstream. However, how to fully tap the computing power of a single computing node in the cluster has become issues that cannot be ignored in the field of remote sensing image processing. Traditional GPU programming is difficult to develop, the development cycle is long, and the requirements for developers are very high. In order to improve the efficiency of GPU programming and shorten the development cycle of parallel programs, Nvidia, Grary, PGI and CAPS jointly launched a new programming standard-OpenAcc. In this paper, OpenAcc-NDVI, as a fast parallel extraction method is used to optimize NDVI algorithm. Based on different computing scenarios, two granularity acceleration models are proposed. It has been verified by multiple experiments that when the data size reaches 10000 * 10000, OpenAcc-NDVI can achieve an acceleration of about 5.3 times. After error analysis, the error of algorithm experiment result is 0, there is no loss of precision. The NDVI algorithm based on OpenAcc has excellent acceleration performance, efficient development process, and high calculation accuracy.

关键词： Acceleration Graphics processing units Histograms Parallel processing Vegetation mapping Remote sensing Arrays

来源：评论

学校读者我要写书评

暂无评论

Spatial fuzzy C-means clustering and deep belief network for change detection in synthetic aperture radar images 5

Spatial fuzzy C-means clustering and deep belief network for...

引用

IET International Radar Conference 2020, IET IRC 2020

作者： Qi, Wenwen Wu, Lin Guo, Zhengwei Huang, Dan College of Computer and Information Engineering Henan University Kaifeng475004 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng475004 China College of Environment and Planning Henan University Kaifeng475004 China Department of Laboratory and Equipment Management Henan University Kaifeng475004 China

ISBN: (纸本)9781839535635

In this study, spatial fuzzy c-means (SFCM) clustering and deep belief network (DBN) method is presented for change detection in SAR images. There are three primary steps of this approach, they are given as follows: 1) Difference Image (DI) is firstly obtained by calculating the similarity of gray levels between multitemporal SAR images. 2) SFCM clustering is used to analyze DI, which combines the spatial information factor and the fuzzy cluster membership function, thus can effectively eliminate the interference of speckle noise. 3) DBN, a powerful data processing methodology that integrates deep learning techniques to extract underlying features and structures of complicated data, is trained to classify pixels to be changed or unchanged. The effectiveness and robustness of the proposed method are verified by experimental results with the Ottawa dataset. © 2020 Institution of Engineering and Technology. All rights reserved.

关键词： Membership functions

来源：评论

学校读者我要写书评

暂无评论

Efficient processing of top-k frequent spatial keyword queries

Research Square

引用

Research Square 2021年

作者： Xu, Tao Xu, Aopeng Mango, Joseph Liu, Pengfei Ma, Xiaqing Zhang, Lei Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China School of Computer and Information Engineering Henan University Kaifeng475004 China Key Laboratory of Geographical Information Science Ministry of Education East China Normal University Shanghai200241 China Key Research Institute of Yellow River Civilization and Sustainable Development Henan University Kaifeng475004 China

The rapid popularization of high-speed mobile communication technology and the continuous development of mobile network devices have given spatial textual big data (STBD) new dimensions due to their ability to record geographical objects from multiple sources and with complex attributes. data mining from spatial textual datasets has become a meaningful study. As a popular topic for STBD, the top-k spatial keyword query has been developed in various forms to deal with different retrievals requirements. However, previous research focused mainly on indexing locational attributes and retrievals of few target attributes, and these correlations between large numbers of the textual attributes have not been fully studied and demonstrated. To further explore interrelated-knowledge in the textual attributes, this paper defines the top-k frequent spatial keyword query (tfSKQ) and proposes a novel hybrid index structure, named RCL-tree, based on the concept lattice theory. We also develop the tfSKQ algorithms to retrieve the most frequent and nearest spatial objects in STBD. One existing method and two baseline algorithms are implemented, and a series of experiments are carried out using real datasets to evaluate its performance. Results demonstrated the effectiveness and efficiency of the proposed RCL-tree in tfSKQ with the complex spatial multi keyword query conditions. © 2021, CC BY.

关键词： big data

来源：评论

学校读者我要写书评

暂无评论

引用

16th Web Information Systems and Applications Conference, WISA 2019

作者： Ma, Youzhong Zhang, Ruiling Zhang, Yongxin School of Information and Technology Luoyang Normal University Luoyang471934 China Key Laboratory of E-commerce Big Data Processing and Analysis of Henan Province Luoyang471934 China

ISBN: (纸本)9783030309510

Top-k similarity join on high-dimensional data plays an important role in many applications. The traditional tree-like index based approaches can’t deal with large scale high-dimensional data efficiently because of "curse of dimensionality". So in this paper, we firstly propose an approach to construct the similarity distribution histogram using stratified sampling method, then to estimate the similarity threshold according to the number of the required returned results, finally we propose a novel Top-k similarity join algorithm based on similarity distribution histogram. We conduct comprehensive experiments and the experimental results show that our proposed approaches has good efficiency and scalability. © 2019, Springer Nature Switzerland AG.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Secrecy Performance analysis in Internet of Satellites: Physical Layer Security Perspective

Secrecy Performance Analysis in Internet of Satellites: Phys...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Yongpeng Shi Ya Gao Yujie Xia Henan Key Laboratory of E-commerce Big Data Processing and Analysis School of Physics and Electronic Information Luoyang Normal College China

ISBN: (数字)9781728173276

ISBN: (纸本)9781728173283

As the latest evolving architecture of space networks, Internet of Satellites (IoSat) is regarded as a promising paradigm in the future beyond 5G and 6G wireless systems. However, due to the extremely large number of satellites and open links, it is challenging to ensure communication security in IoSat, especially for wiretap resisting. To the best of our knowledge, it is an entirely new problem to study the security issue in IoSat, since existing works concerning physical layer security (PLS) in satellite networks mainly focused on the space-to-terrestrial links. It is also noted that, we are the first to investigate PLS problem in IoSat. In light of this, we present in this paper an analytical model of PLS in IoSat where a terrestrial transmitter delivers its information to multi-satellite in the presence of eavesdroppers. By adopting the key parameters such as satellites' deployment density, minimum elevation angle, and orbit height, two major secrecy metric including average secrecy capacity and probability are derived and analyzed. As demonstrated by extensive numerical results, the presented theoretical framework can be utilized to efficiently evaluate the secrecy performance of IoSat, and guide the design and optimization for communication security in such systems.

关键词： Wireless communication Analytical models Satellites Physical layer security Orbits Internet Security

来源：评论

学校读者我要写书评

暂无评论

PWG-IDS: An intrusion detection model for solving class imbalance in IIoT networks using generative adversarial networks

arXiv

引用

arXiv 2021年

作者： Zhang, Lei Jiang, Shuaimin Shen, Xiajiong Gupta, Brij B. Tian, Zhihong Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng47500 China Institute of Data and Knowledge Engineering Henan University Kaifeng47500 China School of Computer and Information Engineering Henan University Kaifeng47500 China National Institute of Technology Kurukshetra India Asia University Taichung Taiwan The Department of Cyberspace Insitute of Advanced Technology GuangZhou University GuangZhou510006 China

With the continuous development of industrial IoT (IIoT) technology, network security is becoming more and more important. And intrusion detection is an important part of its security. However, since the amount of attack traffic is very small compared to normal traffic, this imbalance makes intrusion detection in it very difficult. To address this imbalance, an intrusion detection system called pretraining Wasserstein generative adversarial network intrusion detection system (PWG-IDS) is proposed in this paper. This system is divided into two main modules: 1) In this module, we introduce the pretraining mechanism in the Wasserstein generative adversarial network with gradient penalty (WGAN-GP) for the first time, firstly using the normal network traffic to train the WGAN-GP, and then inputting the imbalance data into the pre-trained WGAN-GP to retrain and generate the final required data. 2) Intrusion detection module: We use LightGBM as the classification algorithm to detect attack traffic in IIoT networks. The experimental results show that our proposed PWG-IDS outperforms other models, with F1-scores of 99% and 89% on the 2 datasets, respectively. And the pretraining mechanism we proposed can also be widely used in other GANs, providing a new way of thinking for the training of GANs. Copyright © 2021, The Authors. All rights reserved.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Relays Selection Algorithm of Collaborative Communication Network on Condition of Channel Statistic Information Error

Relays Selection Algorithm of Collaborative Communication Ne...

引用

IEEE International Conference on Signal processing, Communications and Computing (ICSPCC)

作者： Yong Zhang Junwei Li Kunlin Song Yong Jin Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng PR China School of Information and Electronics Beijing Institute of Technology Beijing PR China

ISBN: (数字)9781728172026

ISBN: (纸本)9781728172033

To date, an original method has been proposed for regional collaborative relays and relays selection based in cognitive radio networks. Considering the different fading characteristics between users and relays in communication links, the regional collaborative relays are introduced to optimize the allocation of powers through selecting available relays. Moreover, the ℓ0-norm usually is replaced with ℓl-norm which is used as the closet convex approximation. Therefore, the neoteric NP-hard optimal problem can be relaxed as a tractable convex optimization problem. Therefore, a computationally efficient and near-optimal solution is obtained by an iteratively re-weighted algorithm. Simulations show that the proposed algorithm satisfied the predetermined service levels at relatively small excess transmission power in collaborative relay network scenarios.

关键词： Relays Collaboration Interference Signal to noise ratio Array signal processing Transforms Channel estimation

来源：评论

学校读者我要写书评

暂无评论

Protection of Large Sparse Network Through Optimal Cropped Depth-First Traversal Tree

引用

IEEE Transactions on Network Science and Engineering 2025年

作者： Wei, Wei Hu, Qiuyuan Zhang, Qinghui Li, Peng Henan University of Technology Key Laboratory of Grain Information Processing and Control Ministry of Education Zhengzhou450001 China Henan University of Technology Henan Key Laboratory of Grain Storage Information Intelligent Perception and Decision Making Zhengzhou450001 China Henan University of Technology Henan Grain Big Data Analysis and Application Engineering Research Center Zhengzhou450001 China Beijing Institute of Technology No. 5 Zhongguancun South Street Haidian District Beijing100086 China

The robustness of the network is its ability to withstand unexpected failures. There is an urgent need to enhance the robustness of sparse networks as they are prone to breakage. Among the various ways to enhance network robustness measured by the edge connectivity of the entire network, shielding candidate edges is a popular method when redundant edges are not affordable. However, existing tree-cutting favors dense graphs with exponential cropped-tree growth of search space, but the search space only scales linearly in sparse graphs. We explore sparse-graph limitations by extending cropping to maximum depth while maintaining sublinear overhead, leveraging ancestor-node constraints and cropping-chain theorems for optimal efficiency. Compared with the optimal algorithm, the results in representative network types show that the robustness measurement of small-scale graphs can be enhanced to 100%, and the ratio of acceleration can be greater than 105. In large-scale graphs with millions of nodes, robustness can be improved to over 99%, while the time can be as low as tens of seconds. © 2013 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：