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

International Conference on Computer and communications (ICCC)

作者： Yezi Ma Ping Wei Huaguo Zhang School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China Science and Technology on Communication Information Security Control Laboratory School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

In the past localization methods, both mechanical and phased array radars require angle scanning because their beampatterns are only angle-dependent, resulting in the echo time difference only contains the range information of the target. It will cause some ambiguity problems and limitations. Since Frequency Diverse Array (FDA) was proposed, its range-angle dependent beampattern provided more degrees of freedom (DoFs) to obtain more information in array signal processing. However, how to use these increased DoFs to get more information still needs to be studied. In this paper, we propose a novel localization method using FDA beam intersection. In this proposed method, part of the FDA beampattern approximates a straight line and propagates throughout the range axis. This moving beam line can capture the target like a fast-moving net and the echo time difference contains both the angle and range information of the target. By a simple straight-line intersection, we can obtain the whole position information, where two FDA beam lines intersect at the target. A simulation diagram is provided to illustrate the proposed localization process.

关键词： Radar Array signal processing Frequency diversity Radar antennas Phased arrays Mathematical model Receivers

来源：评论

学校读者我要写书评

暂无评论

Twin-field quantum key distribution with passive-decoy state

arXiv

引用

arXiv 2020年

作者： Teng, Jun Lu, Feng-Yu Yin, Zhen-Qiang Fan-Yuan, Guan-Jie Wang, Rong Wang, Shuang Chen, Wei Huang, Wei Xu, Bing-Jie Guo, Guang-Can Han, Zheng-Fu CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei230026 China Synergetic Innovation Center of Quantum Information & Quantum Physics University of Science and Technology of China HefeiAnhui230026 China State Key Laboratory of Cryptography P. O. Box 5159 Beijing100878 China Science and Technology on Communication Security Laboratory Institute of Southwestern Communication ChengduSichuan610041 China

Twin-Field quantum key distribution (TF-QKD) and its variants, e.g. Phase-Matching QKD, Sending-or-not-sending QKD, and No Phase Post-Selection TFQKD promise high key rates at long distance to beat the rate distance limit without a repeater. The security proof of these protocols are based on decoy-state method, which is usually performed by actively modulating a variable optical attenuator together with a random number generator in practical experiments, however, active-decoy schemes like this may lead to side channel and could open a security loophole. To enhance the source security of TF-QKD, in this paper, we propose passive-decoy based TF-QKD, in which we combine TF-QKD with the passive-decoy method. And we present a simulation comparing the key generation rate with that in active-decoy, the result shows our scheme performs as good as active decoy TF-QKD, and our scheme could reach satisfactory secret key rates with just a few photon detectors. This shows our work is meaningful in practice. © 2020, CC-BY.

关键词： Random number generation

来源：评论

学校读者我要写书评

暂无评论

Finite-key analysis for twin-field quantum key distribution based on generalized operator dominance condition

arXiv

引用

arXiv 2020年

作者： Wang, Rui-Qiang Yin, Zhen-Qiang Lu, Feng-Yu Wang, Rong Wang, Shuang Chen, Wei Huang, Wei Xu, Bing-Jie Guo, Guang-Can Han, Zheng-Fu CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei230026 China Synergetic Innovation Center of Quantum Information & Quantum Physics University of Science and Technology of China HefeiAnhui230026 China State Key Laboratory of Cryptography P. O. Box 5159 Beijing100878 China Science and Technology on Communication Security Laboratory Institute of Southwestern Communication ChengduSichuan610041 China

Quantum key distribution (QKD) can help two distant peers to share secret key bits, whose security is guaranteed by the law of physics. In practice, the secret key rate of a QKD protocol is always lowered with the increasing of channel distance, which severely limits the applications of QKD. Recently, twin-field (TF) QKD has been proposed and intensively studied, since it can beat the rate-distance limit and greatly increase the achievable distance of QKD. Remarkalebly, K. Maeda et. al. proposed a simple finite-key analysis for TF-QKD based on operator dominance condition. Although they showed that their method is sufficient to beat the rate-distance limit, their operator dominance condition is not general, i.e. it can be only applied in three decoy states scenarios, which implies that its key rate cannot be increased by introducing more decoy states, and also cannot reach the asymptotic bound even in case of preparing infinite decoy states and optical pulses. Here, to bridge this gap, we propose an improved finite-key analysis of TF-QKD through devising new operator dominance condition. We show that by adding the number of decoy states, the secret key rate can be furtherly improved and approach the asymptotic bound. Our theory can be directly used in TF-QKD experiment to obtain higher secret key rate. Our results can be directly used in experiments to obtain higher key rates. Copyright © 2020, The Authors. All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Topologically Enhanced Circular Dichroism from Metasurfaces

引用

Physical Review Applied 2021年第3期16卷 L031001-L031001页

作者： Jiaxin Chen Lishuan Wang Wei Wu Wei Cai Huasong Liu Mengxin Ren Jingjun Xu Key Laboratory of Weak-Light Nonlinear Photonics Ministry of Education School of Physics and TEDA Applied Physics Institute Nankai University Tianjin 300071 People’s Republic of China Science and Technology on Electro-Optical Information Security Control Laboratory Tianjin 300308 People’s Republic of China Tianjin Key Laboratory of Optical Thin Film Tianjin Jinhang Technical Physics Institute Tianjin 300080 People’s Republic of China Collaborative Innovation Center of Extreme Optics Shanxi University Taiyuan Shanxi 030006 People’s Republic of China

Circular dichroism (CD) is one of the most distinctive properties of chiral materials. In recent decades, chiral metasurfaces have been regarded as a promising framework to realize chiral optical devices with ultrathin thickness and compact footprints. Various efforts have been devoted to increase the CD response from such metasurfaces. Here we present a method to enhance the CD effect from metasurfaces utilizing a topological concept. Two multilayered photonic crystals with different topological invariants are adopted and put in contact leading to the appearance of a topological edge state and a distinct electromagnetic field concentration at the interface. By embedding L-shaped chiral metasurfaces into the interface, the CD response is observed to be obviously boosted. We find that due to the robustness feature of the topological edge state, the spectral position of the CD peak is fixed at the edge-state wavelength and is immune to structural variation of the metasurface array. Considering that the multilayered films are easy to fabricate, such a topological concept could act as a simple and feasible strategy for enhancing chiral optical response from nanoscales, and could find wide applications in realizing ultracompact polarization-selective optical components.

关键词： Edge states Metamaterials Optical & microwave phenomena Photonics Topological effects in photonic systems Devices

来源：评论

学校读者我要写书评

暂无评论

An Integration Testing Framework and Evaluation Metric for Vulnerability Mining Methods

引用

China communications 2018年第2期15卷 190-208页

作者： Jin Li Jinfu Chen Minhuan Huang Minmin Zhou Wanggen Xie Zhifeng Zeng Shujie Chen Zufa Zhang National key laboratory of science and technology on information system security Beijing institute of system engineering School of Computer Science and Communication Engineering Jiangsu University

Software an important way to vulnerability mining is detect whether there are some loopholes existing in the software, and also is an important way to ensure the secu- rity of information systems. With the rapid development of information technology and software industry, most of the software has not been rigorously tested before being put in use, so that the hidden vulnerabilities in software will be exploited by the attackers. Therefore, it is of great significance for us to actively de- tect the software vulnerabilities in the security maintenance of information systems. In this paper, we firstly studied some of the common- ly used vulnerability detection methods and detection tools, and analyzed the advantages and disadvantages of each method in different scenarios. Secondly, we designed a set of eval- uation criteria for different mining methods in the loopholes evaluation. Thirdly, we also proposed and designed an integration testing framework, on which we can test the typical static analysis methods and dynamic mining methods as well as make the comparison, so that we can obtain an intuitive comparative analysis for the experimental results. Final- ly, we reported the experimental analysis to verify the feasibility and effectiveness of the proposed evaluation method and the testingframework, with the results showing that the final test results will serve as a form of guid- ance to aid the selection of the most appropri- ate and effective method or tools in vulnera- bility detection activity.

关键词： software vulnerability detection loopholes information security evaluationmethod testing framework

来源：评论

学校读者我要写书评

暂无评论

MILP-aided bit-based division property for ARX ciphers

引用

science China(information sciences) 2018年第11期61卷 229-231页

作者： Ling SUN Wei WANG Ru LIU Meiqin WANG Key Laboratory of Cryptologic Technology and Information Security Ministry of EducationShandong University Science and Technology on Communication Security Laboratory No.30 Research Institute of China Electronics Technology Group Corporation State Key Laboratory of Cryptology

Division property, which was proposed by Todo [1]at EUROCRYPT 2015, is a new technique to detect integral property. It could explicitly depict the hidden properties between the traditional ALL and BALANCE properties in integral cryptanalysis [2], which made it an effective method to search integral distinguishers. The definition is given as follows.

关键词： MILP-aided bit-based division property for ARX ciphers ARX

来源：评论

学校读者我要写书评

暂无评论

Disease transmission in dynamic social networks constructed by reinforcement learning-driven preventive game

引用

Chaos, Solitons & Fractals 2025年 199卷

作者： Yinuo Qian Dawei Zhao Chengyi Xia School of Control Science and Engineering Tiangong University Tianjin 300387 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan 250014 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan 250014 China School of Artificial Intelligence Tiangong University Tianjin 300387 China

Reinforcement learning delves into the intrinsic behaviors of multi-agents, while complex networks reveal their interactive relationships. In real life, an individual can be considered as a sophisticated multi-agent, whose behavioral choices are influenced by a myriad of factors. When contagious diseases penetrate a population, the adoption of preventive measures represents a manifestation of behavioral selection. This paper introduces reinforcement learning into the multi-agent decision within the network, leveraging the Q-learning algorithm to train individual decision-making. At each time step, individuals select the next preventive strategy based on their utility and strategies, and these choices subsequently alter the network structure, thereby influencing the prevalence of the disease. In addition, the incorporation of additional government incentives prompts individuals to opt for advanced preventive strategies, effectively containing disease transmission within the population. The construction of this model not only showcases the co-evolutionary process between network structure and disease transmission but also validates its efficacy through theoretical analysis and applications in real-world networks, offering a novel perspective towards the epidemic control.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Delay-Optimal Edge Cache Replacement with Non-Markovian Content Fetching

Delay-Optimal Edge Cache Replacement with Non-Markovian Cont...

引用

GLOBECOM 2020 - 2020 IEEE Global communications Conference

作者： Nannan Zhang Wei Wang Pan Zhou Aiping Huang College of Information Science and Electronic Engineering Zhejiang Provincial Key Laboratory of Information Processing Communication and Networking Zhejiang University Hangzhou China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728182988

ISBN: (纸本)9781728182995

Leveraging the content caching technology, popular contents can be in close proximity to the users, which reduces the delay effectively. In this paper, we dedicate to minimizing the long-term average delay for the cache-enabled wireless networks, in which the fetching delay is considered when the uncached contents are retrieved from remote servers. We construct a decision-theoretic framework for this delay-optimal content-caching problem. The most challenging obstacle is that the consideration of imperfect content fetching breaks the Markovian property in the decision-theoretic framework, which makes the problem difficult to solve. To overcome this obstacle, we propose an equivalent transformation by analyzing the queue dynamics during the content fetching delay, so that the transformed problem can be modeled as an infinite horizon semi-Markov decision process (SMDP). To handle the curse of dimensionality for solving the SMDP, we decompose the global optimality equation into several per-content equations, and propose a low-complexity delay-optimal content caching algorithm. Simulation results show that the proposed algorithm achieves significantly lower delay than conventional caching algorithms.

关键词： Delays Servers Mathematical model Wireless networks Queueing analysis Optimization Time measurement

来源：评论

学校读者我要写书评

暂无评论

Velocity-Driven Particle Swarm Optimization 19

Velocity-Driven Particle Swarm Optimization

引用

Proceedings of the 2019 8th International Conference on Computing and Pattern Recognition

作者： Wei Li Yaochi Fan Qiaoyong Jiang Qingzheng Xu School of Computer Science and Engineering Xi'an University of Technology and Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China School of Computer Science and Engineering Xi'an University of Technology Xi'an China College of Information and Communication National University of Defense Technology Xi'an China

ISBN: (纸本)9781450376570

Particle swarm optimization (PSO) is an efficient nature-inspired optimization algorithm, which has been widely applied in many engineering fields. The performance of particle swarm optimization (PSO) has been significantly influenced by velocity update strategy. Traditionally, each particle updates its velocity based on its historical best experience and the global best experience, which may make the swarm lose its diversity and lead to premature convergence. To strengthen the performance of PSO, this paper proposes an improved PSO with the velocity-driven strategy (VD-PSO). In VD-PSO algorithm, the particles whose velocities are driven by better velocities focus on exploitation. The historical velocities, such as better velocities, may effectively characterize the landscape information of the optimization problems. In addition, the particles focus on exploration through information exchange amongst velocities. To verify the effectiveness of the proposed algorithm, experiments are conducted with CEC2014 test problems. The experimental results demonstrate the effectiveness of the proposed algorithm for solving the global optimization problems.

关键词： Evolutionary algorithms Velocity-driven strategy Particle swarm optimization Optimization problems

来源：评论

学校读者我要写书评

暂无评论

communication-efficient coordinated RSS-based distributed passive localization via drone cluster

arXiv

引用

arXiv 2021年

作者： Cheng, Xin Shi, Weiping Cai, Wenlong Zhu, Weiqiang Shen, Tong Shu, Feng Wang, Jiangzhou School of Electronic and Optical Engineering Nanjing University of Science and Technology Nanjing210094 China The 8511 Research Institute China Aerospace Science and Industry Corporation Nanjing210007 China The National Key Laboratory of Science and Technology on Aerospace Intelligence Control Beijing Aerospace Automatic Control Institute Beijing100854 China The School of Information and Communication Engineering Hainan University Haikou570228 China The School of Engineering and Digital Arts University of Kent CanterburyCT2 7NT United Kingdom

Recently, passive unmanned aerial vehicle (UAV) localization has become popular due to mobility and convenience. In this paper, we consider a scenario of using distributed drone cluster to estimate the position of a passive emitter via received signal strength (RSS). First, a distributed majorizeminimization (DMM) RSS-based localization method is proposed. To accelerate its convergence, a tight upper bound of the objective function from the primary one is derived. Furthermore, to reduce communication overhead, a distributed estimation scheme using the Fisher information matrix (DEF) is presented, with only requiring one-round communication between edge UAVs and center UAV. Additionally, a local search solution is used as the initial value of DEF. Simulation results show that the proposed DMM performs better than the existing distributed Gauss-Newton method (DGN) in terms of root of mean square error (RMSE) under a limited low communication overhead constraint. Moreover, the proposed DEF performs much better than MM in terms of RMSE, but has a higher computational complexity than the latter. Copyright © 2021, The Authors. All rights reserved.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：