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

Street-Level Landmarks Acquisition Based on SVM Classifiers

Computers, Materials & Continua 2019年第5期59卷 591-606页

作者： Ruixiang Li Yingying Liu Yaqiong Qiao Te Ma Bo Wang Xiangyang Luo State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China Zhengzhou Science and Technology Institute Zhengzhou450001China Henan Institute of Animal Husbandry Economics Zhengzhou450044China State University of New York at Buffalo New York14260-1660United States

High-density street-level reliable landmarks are one of the important foundations for street-level ***,the existing methods cannot obtain enough street-level landmarks in a short period of *** this paper,a street-level landmarks acquisition method based on SVM(Support Vector Machine)classifiers is ***,the port detection results of IPs with known services are vectorized,and the vectorization results are used as an input of the SVM ***,the kernel function and penalty factor are adjusted for SVM classifiers training,and the optimal SVM classifiers are *** that,the classifier sequence is constructed,and the IPs with unknown service are classified using the ***,according to the domain name corresponding to the IP,the relationship between the classified server IP and organization name is *** experimental results in Guangzhou and Wuhan city in China show that the proposed method can be as a supplement to existing typical methods since the number of obtained street-level landmarks is increased substantially,and the median geolocation error using evaluated landmarks is reduced by about 2 km.

关键词： Landmarks acquisition SVM street-level IP geolocation

来源：评论

学校读者我要写书评

暂无评论

Identifying topologies and system parameters of uncertaintime-varying delayed complex networks

引用

Science China(Technological Sciences) 2019年第1期62卷 94-105页

作者： WANG Xiong GU HaiBo WANG QianYao Lü JinHu LSC Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment and Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Node dynamics and network topologies play vital roles in determining the network features and network dynamical *** it is of great theoretical significance and practical value to recover the topology structures and system parameters of uncertain complex networks with available information. This paper presents an adaptive anticipatory synchronization-based approach to identify the unknown system parameters and network topological structures of uncertain time-varying delayed complex networks in the presence of noise. Moreover, during the identification process, our proposed scheme guarantees anticipatory synchronization between the uncertain drive and constructed auxiliary response network simultaneously. Particularly, our method can be extended to several special cases. Furthermore, numerical simulations are provided to verify the effectiveness and applicability of our method for reconstructing network topologies and node parameters. We hope our method can provide basic insight into future research on addressing reconstruction issues of uncertain realistic and large-scale complex networks.

关键词： system parameters and network topologies identification anticipatory synchronization uncertain time-varying delayed complex networks noise-perturbed complex networks

来源：评论

学校读者我要写书评

暂无评论

A Security Sensitive Function Mining Approach Based on Precondition Pattern Analysis

引用

Computers, Materials & Continua 2020年第5期63卷 1013-1029页

作者： Zhongxu Yin Yiran Song Huiqin Chen Yan Cao State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China Henan University of Animal Husbandry&Economy Zhengzhou450046China University of Michigan Transportation Research Institute Michigan48109-2150USA Zhengzhou University Zhengzhou450001China

Security-sensitive functions are the basis for building a taint-style vulnerability *** approaches for extracting security-sensitive functions either don’t analyze data flow accurately,or not conducting pattern analyzing of conditions,resulting in higher false positive rate or false negative rate,which increased manual confirmation *** this paper,we propose a security sensitive function mining approach based on preconditon pattern ***,we propose an enhanced system dependency graph analysis algorithm for precisely extracting the conditional statements which check the function parameters and conducting statistical analysis of the conditional statements for selecting candidate security sensitive functions of the target *** we adopt a precondition pattern mining method based on conditional statements nomalizing and *** with fixed precondition patterns are regarded as security-sensitive *** experimental results on four popular open source codebases of different scales show that the approach proposed is effective in reducing the false positive rate and false negative rate for detecting security sensitive functions.

关键词： Code mining security sensitive function function preconditions single-linkage clustering

来源：评论

学校读者我要写书评

暂无评论

Resolving Anonymous Nodes Based on "Watermelon Patterns" Towards Constructing Router-Level Topology in Mesh Network 29th

Resolving Anonymous Nodes Based on "Watermelon Patterns" Tow...

引用

29th International Conference on Computational and Experimental engineering and Sciences, ICCES 2023

作者： Li, Ruixiang Feng, Xinzhu Liu, Chong Yuan, Fuxiang Ding, Shichang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Key Laboratory of Cyberspace Situation Awareness of Henan Province Zhengzhou China Sichuan University Chengdu China

ISBN: (纸本)9783031425141

Router-level topology, portraying the connection relationship between network devices, is important for discovering key devices in network. In actual networks, there are some anonymous routers, which do not respond traceroute due to network congestion, firewall security settings, router response rate limitations, and other factors. As these anonymous routers are difficult to eliminate, it makes the constructed router-level topology huge in size. Currently, the time cost of finding key nodes is high. Resolving anonymous nodes for reducing the topology size is necessary to improve the efficiency in finding key node. Although anonymous route resolving methods have been available, they are difficult to handle two-hop anonymous route structures in mesh topologies. To this end, based on the four structures summarized in Graph Based Induction (GBI) method, we propose a method to resolve anonymous nodes based on "watermelon patterns". Combining with Kapar, an alias IP merging method, to build router-level topologies in mesh networks. We have conducted experiments in 8 cities, such as New York, Tokyo, Seoul and so on. The experimental results show that, our method can handle the local topology containing two-hop anonymous nodes. And using our method to further reduce the size of the router-level topology built using GBI and Kapar, which is conducive to improving the efficiency of discovering key nodes in the topology. © 2024, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Round-optimal password-based group key exchange protocols in the standard model 13th

Round-optimal password-based group key exchange protocols in...

引用

13th International Conference on Applied Cryptography and Network Security, ACNS 2015

作者： Xu, Jing Hu, Xue-Xian Zhang, Zhen-Feng Trusted Computing and Information Assurance Laboratory Institute of Software Chinese Academy of Sciences Beijing100190 China State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University Zhengzhou450002 China

ISBN: (纸本)9783319281650

Password-based group key exchange protocols allow group users who share only a short, low entropy password to agree on a cryptographically strong session key. One fundamental complexity measure of such protocols is its round complexity. In this paper, we present the first one-round password-based group key exchange protocol in the common random string model. Furthermore, we propose a completely new approach to remove the need for the common random string and then construct a two-round password-based group key exchange protocol that does not require any setup assumption. This is - to the best of our knowledge - the first password-based group key exchange protocol without trusted setup. Using indistinguishability obfuscation as main tool, both protocols are provably secure in the standard model. © Springer International Publishing Switzerland 2015.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Higher-Order Quantum Genetic Algorithm and Its Application on Non-Linear Equations 6

Higher-Order Quantum Genetic Algorithm and Its Application o...

引用

2021 6th International Conference on Electronic Technology and Information Science, ICETIS 2021

作者： Jin, Lei Shan, Zheng Hu, Chunchao Xu, Le School of Information Engineering Zhengzhou University Zhengzhou Henan450000 China State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University Zhengzhou Henan450000 China

The high efficiency of quantum algorithms is caused by the quantum parallelism of the superposition principle and the quantum entangled, but traditional quantum genetic algorithms only use the quantum superposition principle. In order to further improve the performance of the algorithm, this paper proposes a new higher-order quantum genetic algorithm, which adds quantum entanglement properties on the basis of the principle of quantum superposition. Finally, the traditional quantum genetic algorithm and the higher-order quantum genetic algorithm are used to test a set of nonlinear equations many times. The results show that compared with the traditional quantum genetic algorithm, the evolutionary update operation of the higher-order quantum genetic algorithm does not involve multiple judgment conditions of the traditional quantum gate, requires less evolutionary algebra, and can converge quickly. © Published under licence by IOP Publishing Ltd.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

Research on Quantum Programming Framework Based on NISQ Function 6

Research on Quantum Programming Framework Based on NISQ Func...

引用

2021 6th International Conference on Electronic Technology and Information Science, ICETIS 2021

作者： Liu, Xiaonan Xu, Le Hu, Chunchao Jin, Lei School of Information Engineering Zhengzhou University Zhengzhou Henan450000 China State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University Zhengzhou Henan450000 China

In the past two decades, the field of quantum computing has developed rapidly, is gradually able to solve some difficult classical problems. With the development of the facilities for Noisy Intermediate-Scale Quantum(NISQ), the NISQ technology addresses the existing Quantum programming languages or frameworks, suggesting that they cannot fully meet the requirements of Quantum computers. In recent years, some quantum programming languages or frameworks have emerged which claim to support the classical computing algorithms of heterogeneous quantum. However, the code is too cumbersome and redundant, and it is difficult to map the code to heterogeneous quantum classical computation while meeting the requirements of timing. Therefore, a modular programming framework of heterogeneous quantum classical computing algorithm with NISQ function is proposed. The framework optimizes the quantum code and retains the quantum classical interactions that satisfy the temporal constraints. © Published under licence by IOP Publishing Ltd.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Variational Quantum Algorithm and Its Application on Non-Linear Equations 2

Variational Quantum Algorithm and Its Application on Non-Lin...

引用

2021 2nd International Conference on Computer Information and Big Data Applications, CIBDA 2021

作者： Yang, Yihang Shan, Zheng Zhao, Bo Xu, Le School of Information Engineering Zhengzhou University Zhengzhou Henan450000 China State Key Laboratory of Mathematical Engineering and Advanced Computing Information Engineering University Zhengzhou Henan450000 China

Quantum algorithms of factoring problem have been paid more and more attention since Shor's algorithm was proposed. Combining the current quantum computer hardware level and integer factorization quantum algorithms, this paper proposes a "classical + quantum"hybrid solution. This scheme first adopts classical methods and corresponding rules in the preprocessing step to simplify the nonlinear equations, which is used to reduce the number of qubits needed for the cost Hamiltonian. Then the variational quantum algorithm is used to find the approximate ground state of the cost Hamiltonian, which encodes the solution of the nonlinear equations. The program was verified on the IBM QX4 quantum machine, and the results showed that this hybrid solution can effectively reduce the quantum resources required to solve the nonlinear equations. © Published under licence by IOP Publishing Ltd.

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

An Opposition-Based Learning Adaptive Chaotic Particle Swarm Optimization Algorithm

引用

Journal of Bionic engineering 2024年第6期21卷 3076-3097页

作者： Chongyang Jiao Kunjie Yu Qinglei Zhou State Key Laboratory of Mathematical Engineering and Advanced Computing PLA Strategic Support Force Information Engineering UniversityZhengzhou450001China Henan Information Engineering School Zhengzhou Vocational College of Industrial SafetyZhengzhou450000China School of Electrical and Information Engineering Zhengzhou UniversityZhengzhou450001China School of Computer and Artificial Intelligence Zhengzhou UniversityZhengzhou450001China

To solve the shortcomings of Particle Swarm Optimization(PSO)algorithm,local optimization and slow convergence,an Opposition-based Learning Adaptive Chaotic PSO(LCPSO)algorithm was *** chaotic elite opposition-based learning process was applied to initialize the entire population,which enhanced the quality of the initial individuals and the population diversity,made the initial individuals distribute in the better quality areas,and accelerated the search efficiency of the *** inertia weights were adaptively customized during evolution in the light of the degree of premature convergence to balance the local and global search abilities of the algorithm,and the reverse search strategy was introduced to increase the chances of the algorithm escaping the local *** LCPSO algorithm is contrasted to other intelligent algorithms on 10 benchmark test functions with different characteristics,and the simulation experiments display that the proposed algorithm is superior to other intelligence algorithms in the global search ability,search accuracy and convergence *** addition,the robustness and effectiveness of the proposed algorithm are also verified by the simulation results of engineering design problems.

关键词： PSO Opposition-based learning Chaotic motion Inertia weight Intelligent algorithm

来源：评论

学校读者我要写书评

暂无评论

LEFV: A Lightweight and Efficient System for Face Verification with Deep Convolution Neural Networks 19

LEFV: A Lightweight and Efficient System for Face Verificati...

引用

Proceedings of the 3rd International Conference on Video and Image Processing

作者： Ming Liu Ping Zhang Qingbao Li Jinjin Liu Zhifeng Chen State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781450376822

The emergence of deep learning has made great progress in face recognition. With the popularization of embedded devices, deploying the deep model on embedded devices has become a trend. Most high-precision models require lots of computation costs. Therefore, developing a lightweight deep face recognition system running on embedded devices is a hot topic in current research. To achieve high-accuracy real-time performance of an embedded device, we now present a simple and effective face recognition system LEFV, including face detection, face normalization and face recognition. The quantitative experiments on two large-scale challenging datasets, WIDER FACE dataset and IJB-A dataset, show competitive performances on both runtime and accuracy.

关键词： Face Verification Face Detection Deep Convolution Neural Networks Lightweight Model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：