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

Block-Based Projection Matrix Design for Compressed Sensing

Chinese Journal of Electronics 2016年第3期25卷 551-555页

作者： LI Zhetao XIE Jingxiong ZHU Gengming PENG Xin XIE Yanrong CHOI Youngjune The College of Information Engineering Xiangtan University School of Computer National University of Defense Technology Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University School of Computer Science and Engineering Hunan University of Science and Technology College of Information and Communication Engineering Hunan Institute of Science and Technology Department of Information and Computer Engineering Ajou University

The objective of optimizing a projection matrix is to decrease the mutual coherence between a projection matrix and a basis matrix. In this paper, a novel block-based method is proposed to design a projection matrix in compressed sensing. Here, the projection matrix is divided into two blocks. The relationship between the two blocks was obtained by reasoning and proving. Theoretical analysis demonstrates that the mutual coherence between the whole projection matrix and the whole basis matrix keeps as good as the mutual coherence between the block matrix and blocked basis matrix. Experimental results show that the proposed method obtains better performance compared to existing methods.

关键词： Compressed sensing Projection matrix Block optimization Mutual coherence

来源：评论

学校读者我要写书评

暂无评论

A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion 16th

A Faster Parameterized Algorithm for Bipartite 1-Sided Vert...

引用

16th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2023

作者： Liu, Yunlong Xiao, Guang Liu, Ao Wu, Di Huang, Jingui College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China Xiangtan University Xiangtan411101 China School of Computer Science and Engineering Central South University Changsha410083 China

ISBN: (纸本)9783031496134

Given a bipartite graph G = (T∪ B, E), the problem bipartite 1-sided vertex explosion is to decide whether there exists a planar 2-layer embedding of G after exploding at most k vertices of B. For this problem, which is known to be NP-complete, parameterized algorithms have received increasing attention more recently. In this paper, we focus on the problem parameterized by the number k of allowed exploded vertices of B and develop a faster algorithm for it. More specifically, we show that this parameterized problem admits a kernel of at most 10.5k vertices, and present a fixed-parameter tractable algorithm running in time O(2. 31 k· m), where m is the number of edges of G. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Positive-Guided Knowledge Distillation for Document-Level Relation Extraction with Noisy Labeled Data 12th

Positive-Guided Knowledge Distillation for Document-Level R...

引用

12th National CCF Conference on Natural language processing and Chinese computing, NLPCC 2023

作者： Zeng, Daojian Zhu, Jianling Jiang, Lincheng Dai, Jianhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Institute of AI and Targeted International Communication Hunan Normal University Changsha China College of Advanced Interdisciplinary Studies National University of Defense Technology Changsha China

ISBN: (纸本)9783031446924

Since one entity may have multiple mentions and relations between entities may stretch across multiple sentences in a document, the annotation of document-level relation extraction datasets becomes a challenging task. Many studies have identified that these datasets contain a large number of noisy labels, hindering performance improvement for the document-level relation extraction task. The previous and most straightforward method is denoising noisy labeled data from a data annotation perspective. However, this time-consuming approach is not suitable for large-scale datasets. In this paper, we propose a novel Positive-Guided Knowledge Distillation (PGKD) model to address the noisy labeled data problem for document-level relation extraction. We design a new teacher-student architecture. The teacher model trained with only positive samples can partially supervise the student model. The positive-guided knowledge distillation algorithm transfers the clean positive-class patterns from the teacher model to the student model. In this way, the student model trained with all samples can efficiently prevent the interference of false negative samples. Extensive experiments on Mix-DocRED demonstrate that PGKD achieves state-of-the-art effectiveness for document-level relation extraction with noisy labeled data. Moreover, PGKD also surpasses other baselines even on the well-annotated Re-DocRED. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

A Finite Element Variational Multiscale Method for Stationary Incompressible Magnetohydrodynamics Equations

引用

Advances in Applied Mathematics and Mechanics 2023年第5期15卷 1142-1165页

作者： Huayi Huang Yunqing Huang Qili Tang Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of IntelligentComputing&Information Processing of Ministry of EducationSchool of Mathematics and Computational ScienceXiangtan UniversityXiangtanHunan 411105China

In this paper,we propose a variational multiscale method(VMM)for the stationary incompressible magnetohydrodynamics *** method is defined by large-scale spaces for the velocity field and the magnetic field,which aims to solve flows at high Reynolds *** provide a new VMM formulation and prove its stability and ***,some numerical experiments are presented to indicate the optimal convergence of our method.

关键词： Variational multiscale method stationary incompressible magnetohydrodynamics large-scale spaces stability and convergence high Reynolds numbers

来源：评论

学校读者我要写书评

暂无评论

RECOVERY BASED FINITE ELEMENT METHOD FOR BIHARMONIC EQUATION IN 2D

引用

Journal of Computational Mathematics 2020年第1期38卷 84-102页

作者： Yunqing Huang Huayi Wei Wei Yang Nianyu Yi Key Laboratory of Intelligent Computing&Information Processing of Ministry of Education School of Mathematics and Computational ScienceXiangtan UniversityXiangtan 411105China Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational ScienceXiangtan UniversityXiangtan 411105China

We design and numerically validate a recovery based linear finite element method for solving the biharmonic *** main idea is to replace the gradient operator▽on linear finite element space by G(▽)in the weak formulation of the biharmonic equation,where G is the recovery operator which recovers the piecewise constant function into the linear finite element *** operator G,Laplace operator△is replaced by▽·G(▽).Furthermore,the boundary condition on normal derivative▽u-n is treated by the boundary penalty *** explicit matrix expression of the proposed method is also *** examples on the uniform and adaptive meshes are presented to illustrate the correctness and effectiveness of the proposed method.

关键词： Biharmonic equation Linear finite element Recovery Adaptive

来源：评论

学校读者我要写书评

暂无评论

Design Principle and Method of Lightweight Block Cipher Diffusion Layer 11th

Design Principle and Method of Lightweight Block Cipher Diff...

引用

11th International Conference on Computer Engineering and Networks, CENet2021

作者： Zhao, Junxia Li, Lang Li, Qiuping Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

ISBN: (纸本)9789811665530

Recently, due to the development and popularization of communication and computing technologies, new technologies have emerged one after another. The Internet of Things (IoT) is a state-of-the-art technology that is applicable to all fields. The rapid development of the IoT seriously threatens the security of restricted devices. Lightweight block ciphers, as the main security measures for restricted devices, have attracted the attention of more and more researchers. The diffusion layer is an important part of the lightweight block cipher. Its design not only affects the security of lightweight block ciphers, but also has an important impact on its efficiency in hardware and software implementation. In this paper, we research and analyze the design principle and method of the lightweight block cipher diffusion layer. In addition, combined with the characteristics of lightweight cipher and its application environment, we point out that the diffusion layer of lightweight cipher is worthy of further research in the future. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Bit Slotted ALOHA Algorithm Based on a Polling Mechanism 10th

Bit Slotted ALOHA Algorithm Based on a Polling Mechanism

引用

10th International Conference on Computer Engineering and Networks, CENet 2020

作者： Deng, Hongwei Fu, Wenli Yao, Ming Zhou, Yuxiang Xia, Songling Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

ISBN: (纸本)9789811584619

In this study, we propose a bit slotted ALOHA algorithm based on a polling mechanism (PBSA) to address the tag collision problem of dynamic radio frequency identification (RFID) systems. This algorithm is based on a combination of the dynamic framed slotted ALOHA (DFSA) algorithm and the free framed slotted ALOHA (FSA) algorithm. The polling mechanism is introduced to change the tag removal protocol. While removing the idle slots, the collision slot is converted into a single slot, which improves the tag recognition efficiency per unit frame. Simulation analysis shows that compared with the dynamic framed slotted ALOHA (DFSA) algorithm, the grouped dynamic framed slotted ALOHA (GDFSA) algorithm, and the cancel idle framed slotted ALOHA (CIFSA) algorithm, the PBSA algorithm exhibits lower slot overhead, higher tag throughput, and lower lag loss rate, which improves the efficiency of tag identification in dynamic RFID systems. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Constructions of Lightweight MDS Diffusion Layers from Hankel Matrices 9th

Constructions of Lightweight MDS Diffusion Layers from Hanke...

引用

9th International Conference on Computer Engineering and Networks, CENet2019

作者： Li, Qiuping Li, Lang Zhang, Jian Zhao, Junxia Li, Kangman Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

ISBN: (纸本)9789811537523

Maximal distance separable (MDS) matrices are used as optimal diffusion layers in many block ciphers and hash functions. Recently, the designers paid more attention to the lightweight MDS matrices because it can reduce the hardware resource. In this paper, we give a new method to construct the lightweight MDS matrices. We provide some theoretical results and two kinds of 4 × 4 lightweight Hankel MDS matrices. We also prove that the 2s × 2s involution Hankel MDS matrix does not exist in finite field. Furthermore, we searched the 4 × 4 Hankel MDS matrices over GL(4, F2) and GL(8, F2) that have the better s-XOR counts until now. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Interpretable Saliency Map for Deep Reinforcement Learning

Interpretable Saliency Map for Deep Reinforcement Learning

引用

2020 International Conference on Computer Big Data and Artificial Intelligence, ICCBDAI 2020

作者： Zheng, Hong Dai, Yinglong Yu, Fumin Hu, Yuezhen School of Physics and Electronics Hunan Normal University Changsha410081 China College of Liberal Arts and Sciences National University of Defense Technology Changsha410073 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

Deep reinforcement learning (deep RL) achieved big successes with the advantage of deep learning techniques, while it also introduces the disadvantage of the model interpretability. Bad interpretability is a great obstacle for deep RL to be applied in real situations or human-machine interaction situations. Borrowed from the deep learning field, the techniques of saliency maps recently become popular to improve the interpretability of deep RL. However, the saliency maps still cannot provide specific and clear enough model interpretations for the behavior of deep RL agents. In this paper, we propose to use hierarchical conceptual embedding techniques to introduce prior-knowledge in the deep neural network (DNN) based models of deep RL agents and then generate the saliency maps for all the embedded factors. As a result, we can track and discover the important factors that influence the decisions of deep RL agents. © Published under licence by IOP Publishing Ltd.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

FPGA optimal implementation of PRINCE against power analysis attacks 5

FPGA optimal implementation of PRINCE against power analysis...

引用

5th International Conference on information Science and Cloud computing, ISCC 2017

作者： Zou, Yi Li, Lang College of Computer Science and Technology Hengyang Normal University Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

The algorithm PRINCE proposed in ASIACRYPT 2012 is a lightweight cipher, currently suitable for the implementation on RFID Smart Card of the IoT. It's studied to achieve the optimal implementation of PRINCE encryption algorithm, and to add a fixed random mask to enhance the anti power attacking ability of PRINCE. In this paper, we constructed the same operations into a module called PrinceRound, and used counter to control the PrinceRound module, while the same round operation runs repeatedly. As a result, it can save registers and effectively reduce the amount of computation. Furthermore, we used a special method by adding the random mask to S-box. The experimental results show that the optimized PRINCE occupies area 9.8% fewer than original PRINCE on FPGA and the encryption with a fixed random mask can run correctly. Last but not least, our research is the first one about the implementation of PRINCE algorithm on FPGA, and can serve as a reference for further application of IOT encryption. © Copyright owned by the author(s).

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：