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

Cryptanalysis of a Completely Anonymous Multi-recipient Signcryption Scheme with Public Verification

Journal of Donghua University(English Edition) 2015年第2期32卷 240-243页

作者：张波孙涛于代荣 School of Information Science and Engineering University of Jinan Shandong Provincial Key Laboratory of Network Based Intelligent Computing Shandong Provincial Key Laboratory of Software Engineering

Anonymity is a very important security objective in network ***,Pang et *** a novel multirecipient signcryption scheme with complete anonymity and claimed that the new concrete scheme was strong existential unforgeability under selective multi-ID,chosen message ***,by giving concrete attacks,named " inside attack" and " outside attack" respectively,we indicate that Pang et al.'s scheme is not secure in their security model.

关键词： recipient private claimed secure giving message signer outside secret chosen

来源：评论

学校读者我要写书评

暂无评论

Security-Reliability Analysis and Optimization for Cognitive Two-Way Relay network with Energy Harvesting

引用

China Communications 2024年第11期21卷 163-179页

作者： Luo Yi Zhou Lihua Dong Jian Sun Yang Xu Jiahui Xi Kaixin Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha 410081China School of Electronic Information Central South UniversityChangsha 410075China

This paper investigates the security and reliability of information transmission within an underlay wiretap energy harvesting cognitive two-way relay *** the network,energy-constrained secondary network(SN)nodes harvest energy from radio frequency signals of a multi-antenna power *** SN sources exchange their messages via a SN decode-and-forward relay in the presence of a multiantenna eavesdropper by using a four-phase time division broadcast protocol,and the hardware impairments of SN nodes and eavesdropper are *** alleviate eavesdropping attacks,the artificial noise is applied by SN *** physical layer security performance of SN is analyzed and evaluated by the exact closed-form expressions of outage probability(OP),intercept probability(IP),and OP+IP over quasistatic Rayleigh fading ***,due to the complexity of OP+IP expression,a self-adaptive chaotic quantum particle swarm optimization-based resource allocation algorithm is proposed to jointly optimize energy harvesting ratio and power allocation factor,which can achieve security-reliability tradeoff for *** simulations demonstrate the correctness of theoretical analysis and the effectiveness of the proposed optimization algorithm.

关键词： artificial noise energy harvesting cognitive two-way relay network hardware impairments physical layer security security-reliability tradeoff self-adaptive quantum particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Asymptotic solution of a wide moving jam to a class of higher-order viscous traffic flow models

引用

Applied Mathematics and Mechanics(English Edition) 2018年第5期39卷 609-622页

作者： Chunxiu WU College of Mathematics and Computer Science Quanzhou Normal UniversityQuanzhou 362000Fujian ProvinceChina Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou 362000Fujian ProvinceChina Key Laboratory of Intelligent Computing and Information Processing Quanzhou 362000Fujian ProvinceChina

The boundary-layer method is used to study a wide moving jam to a class of higher-order viscous models. The equations for characteristic parameters are derived to determine the asymptotic solution. The sufficient and essential conditions for the wide moving jam formation are discussed in detail, respectively, and then used to prove or disprove the existence of the wide moving jam solutions to many well-known higher-order models. It is shown that the numerical results agree with the analytical results.

关键词： higher-order traffic flow model wide moving jam boundary-layer method,weighted essentially nonoscillatory （WENO） scheme

来源：评论

学校读者我要写书评

暂无评论

SONICUMOS: An Enhanced Active Face Liveness Detection System via Ultrasonic and Video Signals

引用

IEEE Transactions on Mobile computing 2025年

作者： Wu, Yihao Jiang, Peipei Cheng, Jianhao Zhao, Lingchen Shen, Chao Wang, Cong Wang, Qian Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University School of Cyber Science and Engineering Hubei430072 China Laboratory for AI-Powered Financial Technologies Ltd. 999077 Hong Kong Xi'An Jiaotong University MOE Key Laboratory for Intelligent Networks and Network Security Xi'an710049 China Xi'An Jiaotong University School of Cyber Science and Engineering Xi'an710049 China City University of Hong Kong Department of Computer Science 999077 Hong Kong

SONICUMOS is an enhanced behavior-based face liveness detection system that combines ultrasonic and video signals to sense the 3D head gestures. As face authentication becomes increasingly prevalent, the need for a reliable liveness detection system is paramount. Traditional behavior-based liveness detection methods (e.g., eye-blinking, nodding, etc.), which are widely deployed in mission-critical scenarios like finance and banking applications today, are prone to advanced media-based facial forgery attacks. SONICUMOS aims to incorporate the traditional behaviorbased method for active liveness detection without introducing extra user burden. By employing ultrasonic signals, SONICUMOS capitalizes on the head gestures, significantly raising the security bar. Our approach utilizes the frequency-modulated continuouswave (FMCW) ultrasonic radar for robust 3D gesture recognition compatible with face authentication. We also propose a new dual-feature fusion network that integrates audio and video features at the feature level to increase detection accuracy and resilience against numerous attacks. Our prototype has been tested on seven off-the-shelf Android/iOS smartphones, achieving an overall detection accuracy of 95.83% at an equal error rate (EER) of 4.96% when dealing with 3D impersonation attacks © 2025 IEEE.

关键词： Frequency modulation

来源：评论

学校读者我要写书评

暂无评论

The M-computations induced by accessibility relations in nonstandard models M of Hoare logic

引用

Frontiers of Computer Science 2016年第4期10卷 717-725页

作者： Cungen CAO Yuefei SUI Zaiyue ZHANG Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Computer Science Jiangsu University of Sciences and Technology Zhenjiang 212003 China

Hoare logic is a logic used as a way of specifying semantics of programming languages, which has been extended to be a separation logic to reason about mutable heap structure. In a model M of Hoare logic, each program α induces an M-computable function fα M on the universe of M; and the M-recursive functions are defined on M. It will be proved that the class of all the M-computable functions fα M induced by programs is equal to the class of all the M- recursive functions. Moreover, each M-recursive function is ∑ 1 NM -definable in M, where the universal quantifier is a num- ber quantifier ranging over the standard part of a nonstandard model M.

关键词： Hoare logic recursive ：Function computable function nonstandard model of Peano arithmetic

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Community Detection Algorithm Based on Parallel Incremental Related Vertices 2

A Dynamic Community Detection Algorithm Based on Parallel In...

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Guohui Li Kun Guo YuZhong Chen Ling Wu Danhong Zhu College of Mathematics and Computer Sciences Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing(Fuzhou University) Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education

ISBN: (纸本)9781509036202

One of the traditional ways for detecting dynamic communities is to find the communities at each interval through the static community detection ***,it usually leads to high computation *** this paper,a novel algorithm based on the Map Reduce model and the label propagation progress with the strategy of incremental related vertices is proposed,which is called PLPIRV(Parallel Label Propagation and Incremental Related Vertices).Based on the communities found at the previous interval,the new algorithm adjusts the communities the incremental related vertices belong *** clustering of the whole network can be avoided by incrementally analyzing the variation of the networks,so that the time cost can be greatly *** on artificial and real datasets show that the proposed algorithm performs well on dynamic community detection.

关键词： dynamic community detection parallel computation incremental algorithm label propagation

来源：评论

学校读者我要写书评

暂无评论

Understanding the Dynamical Characteristics of Neural networks by Universal Fuzzy Logical Framework

Understanding the Dynamical Characteristics of Neural Networ...

引用

2005 International Conference on Neural networks and Brain(ICNN&B’05)

作者： Hong Hu Zhongzhi Shi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science

ISBN: (纸本)0780394224

The analytical study of a large scale nonlinear neural network is an uneasy *** try to analyze the function of neural systems by probing into the fuzzy logical framework of the neural ceUs'dynamical *** papers investigate the relation between fuzzy logic and neural *** most investigations focus on finding new function of neural system by combining fuzzy logical and neural system. In this paper,a novel approach is used to understand the nonlinear dynamic characteristics of neural system by analyzing the fuzzy logic framework of neural *** is the only way to understand the behavior of a large scale nonlinear neural *** abstracting the fuzzy logical framework of a neural cell,our analysis enables the delicate design of network *** an example,a difficulty task to build a recurrent network model of primary visual cortex by common dynamical analysis can be easily completed by this kind approach.

关键词： Understanding the Dynamical Characteristics of Neural networks by Universal Fuzzy Logical Framework Fuzzy

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA network With Application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

Parallel Multi-Label Propagation Based on Influence Model and Its Application to Overlapping Community Discovery

Parallel Multi-Label Propagation Based on Influence Model an...

引用

作者： Qiu, Qirong Guo, Wenzhong Chen, Yuzhong Guo, Kun Li, Rongrong School of Economics and Management Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China College of Mathematics and Computer Science Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350116 China

Finding communities in networks is one of the challenging issues in complex network research. We have to deal with very large networks that contain billions of vertices, which makes community discovery a computationally intensive work. Moreover, communities usually overlap each other, which greatly increases the difficulty of identifying the boundaries of communities. In this paper, we propose a parallel multi-label propagation algorithm (PMLPA) that enhances traditional multi-label propagation algorithm (MLPA) in two ways. First, the critical steps of MLPA are parallelized based on the MapReduce model to get higher scalability. Second, new label updating strategy is used to automatically determine the most valuable labels of each vertex. Furthermore, we study the improvement of PMLPA through considering the influence of vertices and labels on label updating. In this way, the importance of each label can be described with higher precision. Experiments on artificial and real networks prove that the proposed algorithms can achieve both high discovering accuracy and high scalability. © 2017 World Scientific Publishing Company.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Tolerance Granulation Based Community Detection Algorithm

引用

Tsinghua Science and Technology 2015年第6期20卷 620-626页

作者： Shu Zhao Wang Ke Jie Chen Feng Liu Menghan Huang Yanping Zhang Jie Tang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Center of Information Support & Assurance TechnologySchool of Computer Science and TechnologyAnhui University School of Computer Science and Technology Tsinghua University

Community structure is one of the most important features in real networks and reveals the internal organization of the vertices. Uncovering accurate community structure is effective for understanding and exploiting networks. Tolerance Granulation based Community Detection Algorithm(TGCDA) is proposed in this paper, which uses tolerance relation(namely tolerance granulation) to granulate a network hierarchically. Firstly, TGCDA relies on the tolerance relation among vertices to form an initial granule set. Then granules in this set which satisfied granulation coefficient are hierarchically merged by tolerance granulation operation. The process is finished till the granule set includes one granule. Finally, select a granule set with maximum granulation criterion to handle overlapping vertices among some granules. The overlapping vertices are merged into corresponding granules based on their degrees of affiliation to realize the community partition of complex networks. The final granules are regarded as communities so that the granulation for a network is actually the community partition of the *** on several datasets show our algorithm is effective and it can identify the community structure more accurately. On real world networks, TGCDA achieves Normalized Mutual information(NMI) accuracy 17.55% higher than NFA averagely and on synthetic random networks, the NMI accuracy is also improved. For some networks which have a clear community structure, TGCDA is more effective and can detect more accurate community structure than other algorithms.

关键词： tolerance relation community tolerance granulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：