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

International Conference on Computer and communications (ICCC)

作者： Tao Zhou Shan Luo Peixiang Zheng Rongping Lin School of Aeronautics and Astronautics University of Electronic Science and Technology of China Chengdu China Aircraft Swarm Intelligent Sensing and Cooperative Control Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Chengdu China School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9781728186351

ISBN: (纸本)9781728186368

With the development of wireless communication technology, a large number of spectrum resources are occupied and become increasingly scarce. If drones want to communicate, they need to share spectrum with others. The method of spectrum prediction in cognitive radio can efficiently achieve this. The traditional spectrum status duration prediction method based on the non-stationary hidden Markov model only predict the duration of one fixed geographic location and cannot meet the requirement of UAV's communications. We intend to apply the homotopy theory to the non-stationary hidden Markov model to obtain the spectrum status duration of different locations so that it can apply to UAV's communications. We also conducted experiments to predict the duration of the spectrum status at different locations. The experimental results show that our model can work well.

关键词： Computational modeling Conferences Hidden Markov models Predictive models Markov processes Cognitive radio Drones

来源：评论

学校读者我要写书评

暂无评论

A Novel Threat Sensing Architecture for Heterogeneous Cognitive Sensor Networks

A Novel Threat Sensing Architecture for Heterogeneous Cognit...

引用

Signal, information and Data Processing (ICSIDP), IEEE International Conference on

作者： Yongji Ren Yun Zhang Zheng Zhou Xiaofeng Xu Xiaolei Liu Naval Aviation University Yantai China Science and Technology on Communication Information Security Control Laboratory Jiaxing China Yantai Vocational College Yantai China

ISBN: (数字)9781728123455

ISBN: (纸本)9781728123462

With the rapid development and application of novel network information technologies, the various radar and/or communication transmitters have become more intelligent and networked in modern electromagnetic operational environment, which causes the threat sensing architecture of traditional electronic warfare system more inadequate, especially encountering unknown threat signals or networked targets. In this case, the threat sensing becomes one of the biggest challenges that the traditional electronic warfare system is facing. Therefore, this paper proposed a novel heterogeneous architecture for cognitive sensor networks to facilitate efficient threat sensing. To deal with the heterogeneous problem of cognitive sensor networks, multiple constraints satisfaction based approach has been employed. And the game based resources scheduling scheme has been utilized to facilitate the efficiency. To the best of our knowledge, our work is the first one that introduces the heterogeneous cognitive architecture into threat sensing domain of electronic warfare system. The simulation results show the proposed novel threat sensing architecture for heterogeneous cognitive sensor networks is feasible and effective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Resource Mobility Aware Hybrid Task Planning in Space information Networks

引用

Journal of communications and information Networks 2019年第4期4卷 107-116页

作者： Runzi Liu Yiting Zhu Yan Zhang Weihua Wu Di Zhou Kai Chi School of Information and Control Engineering Xi’an University of Architecture and TechnologyXi’anShaanxi 710055China The State Key Lab of ISN Xidian UniversityXi’anShaanxi 710071China Science and Technology on Communication Networks Laboratory CETC the 54th research instituteShijiazhuangHebei 050081China Electric Information Network Laboratory CETC the 20th research instituteXi’anShaanxi 710068China

In this paper,a resource mobility aware two-stage hybrid task planning algorithm is proposed to reduce the resource conflict between emergency tasks and the common tasks,so as to improve the overall performance of space information ***,in the common task planning stage,a resource fragment avoidance task planning algorithm is proposed,which reduces the contention between emergency tasks and the planned common tasks in the next stage by avoiding the generation of resource *** emergency tasks,we design a metric to quantify the revenue of the candidate resource combination of emergency tasks,which considers both the priority of the tasks and the impact on the planned common *** on this,a resource mobility aware emergency task planning algorithm is proposed,which strikes a good balance between improving the sum priority and avoiding disturbing the planned common ***,simulation results show that the proposed algorithm is superior to the existing algorithms in both the sum task priority and the task completion rate.

关键词： space information network task planning resource mobility

来源：评论

学校读者我要写书评

暂无评论

Several classes of linear codes with few weights derived from Weil sums

引用

Finite Fields and Their Applications 2025年 108卷

作者： Zhao Hu Mingxiu Qiu Nian Li Xiaohu Tang Liwei Wu Key Laboratory of Intelligent Sensing System and Security (Hubei University) Ministry of Education the Hubei Provincial Engineering Research Center of Intelligent Connected Vehicle Network Security School of Cyber Science and Technology Hubei University Wuhan 430062 China State Key Laboratory of Integrated Service Networks Xi'an 710071 China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan 430062 China Information Coding & Transmission Key Lab of Sichuan Province CSNMT Int. Coop. Res. Centre (MoST) Southwest Jiaotong University Chengdu 610031 China Wuhan Maritime Communication Research Institute China

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of t -weight linear codes over F q are presented with the defining sets given by the intersection, difference and union of two certain sets, where t = 3 , 4 , 5 , 6 and q is an odd prime power. By using Weil sums and Gauss sums, the parameters and weight distributions of these codes are determined completely. Moreover, three classes of optimal codes meeting the Griesmer bound are obtained, and computer experiments show that many (almost) optimal codes can be derived from our constructions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Traffic Analysis of a Networks based on Stochastic Geometry to Exclude Malice Flow 2

Traffic Analysis of a Networks based on Stochastic Geometry ...

引用

2018 2nd Annual International Conference on Cloud technology and communication Engineering, CTCE 2018

作者： Dai, Jiahao Xu, Xiaofeng Science and Technology on Communication Information Security Control Laboratory China Electronic Group Corporation No.36 Institute Zhejiang Jiaxing China

Based on stochastic geometry, this paper proposes a mathematical method to estimate the traffic in a D2D based cellular network. The purpose is to determine the normal flow of network to exclude heterogeneous Darknet flow (Tor network). Different from previous work, we assume there are two different kinds of receivers, cellular receivers and D2D receivers, each D2D receiver with its D2D trunking constitutes a D2D pair. We assume that the traffic can be generated in the transmission between a BS and a cellular receiver and that between a D2D trunking and a D2D receiver if and only if the received power is larger than a threshold and the rate in the transmission is above a specified rate. The framework is tractable and able to help us analyze how different parameters influence the network traffic. What's more, we can give the optimal scheme to achieve the maximal network traffic. At the same time, if the results calculated by this paper proposed or traditional formula is not matched, we think that the flow rate may be heterogeneous traffic, such as darknet flow(Tor). © Published under licence by IOP Publishing Ltd.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Sensing Matrix Design for MMV Compressive Sensing: An MVDR Approach

Sensing Matrix Design for MMV Compressive Sensing: An MVDR A...

引用

作者： Zhang, Liang Huang, Lei Li, Bo Yin, Jingwei Bao, Weimin School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen University Shenzhen518060 China Nuance Communication Inc. MontrealQCH3A 3S7 Canada Key Laboratory of Marine Information Acquisition and Security Ministry of Industry and Information Technology Harbin150001 China Science and Technology Council China Aerospace Science and Technology Cooperation Beijing100048 China College of Electronics and Information Engineering Shenzhen University Shenzhen518060 China College of Underwater Acoustic Engineering Harbin Engineering University Harbin150001 China

Compressive sensing (CS) has been widely used in vehicular technology including compressive spectrum sensing, sparse channel estimation, and vehicular communications. The complete procedure of CS consists of sparse representation, sparse measurement, and sparse recovery. In the CS, measurement matrix Φ is utilized to sample a sparse signal, while sensing matrix Ψ is exploited for sparse recovery. It is important to properly design the sensing matrix that significantly affects the signal recovery performance. This paper addresses the issue of the sensing matrix design for the CS with multiple measurement vectors (MMV). We first study sufficient conditions for the MMV-CS and then develop three sensing matrix design approaches in different situations. The proposed methods have their roots in the principle of minimum variance distortionless response (MVDR) beamformer. This allows us to optimally determine the sensing matrix in the framework of the MVDR, which amounts to minimizing local cumulative cross-coherence between Φ and Ψ while keeping the columns of Ψ highly correlated to their counterparts of Φ. Simulation results are presented to verify the effectiveness of the proposed methods. © 1967-2012 IEEE.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Local spin-state manipulation of iron single-atom sites induced by sulfur modification to boost Fenton-like reaction

引用

Chinese Chemical Letters 2025年

作者： Lina Zou Dengke Wang Shiqin Lai Xunheng Jiang Siqi Chen Lanqing Deng Dong Fan Hengshuai Li Zhigang Zhou Denglong Chen Xiangyang Yao Jianping Zou National-Local Joint Engineering Research Center of Heavy Metals Pollutants Control and Resource Utilization Nanchang Hangkong University Nanchang 330063 China College of Environmental and Resource Sciences Zhejiang University Hangzhou 310058 China School of Physics Science and Information Technology & Shandong Key Laboratory of Optical Communication Science and Technology Liaocheng University Liaocheng 252000 China Quangang Research Institute of Petrochemical Technology Fujian Normal University Fuzhou 350007 China Fujian Longking New Land Tech Co. Ltd. Fuzhou 350015 China

A strategy based on local spin-state manipulation was achieved through S-modification on single-Fe-atom catalysts (Fe 1 -NSC). Spectral analyses and theoretical calculations elucidated that a medium-spin reconfiguration of Fe species in Fe 1 -NSC endowed an increased orbital overlap between Fe-3d and O-2p, reinforcing the peroxymonosulfate (PMS) dissociation kinetics. Consequently, Fe 1 -NSC delivered excellent performance in PMS conversion and pollutant degradation. The specific activity of PMS activation over Fe 1 -NSC reached 36.1 × 10 -3 L min -1 m -2 , 4.2-folds that of Fe 1 -NC (8.61 × 10 -3 L min -1 m -2 ) and superior to the state-of-the-art catalysts reported to date. Importantly, the atomic spin-state modulation via S-modification can extend to other metals (Mn, Co and Cu) for improved PMS activation with > 3 times higher than those without S-modification. This work provides a universal scheme for electronic configuration regulation and highlights the significance of local environment modulation in designing high-performance catalysts for PMS activation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving the performance of twin-field quantum key distribution

引用

Physical Review A 2019年第2期100卷 022306-022306页

作者： Feng-Yu Lu Zhen-Qiang Yin Chao-Han Cui Guan-Jie Fan-Yuan Rong Wang Shuang Wang Wei Chen De-Yong He Wei Huang Bing-Jie Xu Guang-Can Guo Zheng-Fu Han Key Laboratory of Quantum Information CAS Center For Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei 230026 China State Key Laboratory of Cryptology P.O. Box 5159 Beijing 100878 China Science and Technology on Communication Security Laboratory Institute of Southwestern Communication Chengdu Sichuan 610041 China

Among the various versions of the twin-field quantum key distribution (TF-QKD) protocol [M. Lucamarini, Z. Yuan, J. Dynes, and A. Shields, Nature (London) 557, 400 (2018)] that can overcome the rate-distance limit, the TF-QKD without phase postselection proposed by Cui et al. [Phys. Rev. Appl. 11, 034053 (2019)] is an elegant TF-QKD that can provide high key rates since the postselection of global phases has been removed. However, the achievable distance of this variant is shorter than that of the original phase-matching QKD [X. Ma, P. Zeng, and H. Zhou, Phys. Rev. X 8, 031043 (2018)]. In this paper, we propose a method for improving its performance by introducing an additional decoy mode. The upper bound of the information leakage can be more tightly estimated; hence, both the key rate and the achievable distance are significantly improved. Interestingly, the operation of the proposed additional decoy mode is the same as that of the code mode; hence, it does not introduce difficulties into the experimental system. In addition, the improvement is substantial with finite decoy states, which is meaningful in practice.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

A Survey on Adaptive Random Testing

arXiv

引用

arXiv 2020年

作者： Huang, Rubing Sun, Weifeng Xu, Yinyin Chen, Haibo Towey, Dave Xia, Xin School of Computer Science and Communication Engineering Jiangsu Key Laboratory of Security Technology for Industrial Cyberspace Jiangsu University ZhenjiangJiangsu212013 China School of Computer Science and Communication Engineering Jiangsu University ZhenjiangJiangsu212013 China School of Computer Science University of Nottingham Ningbo China NingboZhejiang315100 China Faculty of Information Technology Monash University MelbourneVIC3168 Australia

—Random testing (RT) is a well-studied testing method that has been widely applied to the testing of many applications, including embedded software systems, SQL database systems, and Android applications. Adaptive random testing (ART) aims to enhance RT’s failure-detection ability by more evenly spreading the test cases over the input domain. Since its introduction in 2001, there have been many contributions to the development of ART, including various approaches, implementations, assessment and evaluation methods, and applications. This paper provides a comprehensive survey on ART, classifying techniques, summarizing application areas, and analyzing experimental evaluations. This paper also addresses some misconceptions about ART, and identifies open research challenges to be further investigated in the future work. Copyright © 2020, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

The Method to Recognize Linear Block Code Based on the Distribution of Code Weight 10

The Method to Recognize Linear Block Code Based on the Distr...

引用

10th International Conference on communication Software and Networks, ICCSN 2018

作者： Lei, Wang Yizhou, Ge Fucai, Zhao Yong, Wang Science and Technology on Communication Information Security Control Laboratory Jiaxing China Key Laboratory of Electronic Restriction Anhui Province National University of Defense Technology Hefei China

ISBN: (纸本)9781538672235

The definition and matrix description of linear cyclic code is introduced in this paper first. Then the distribution of code weight is analyzed. The distance of code weight distribution is defined according to distance of vectors. The theoretic probability of code weight of random sequence is ratiocinated. The method to estimate code weight distribution of actual sequence is established. The code length and start are estimated by the distance between the code weight distribution and the check matrix and generation matrix are estimated by Gauss Elimination. The results of simulating experiment to different length code show that this method can recognize code with middle and short code length effectively when BER is 10-3. © 2018 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：