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

作者： Guangyong Zheng Yuming Xu Hengyang Normal University Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Changsha Normal University

With the rapid development and popularization of the Internet, Peerto-Peer(P2 P) network technology has been developing rapidly, and the security trust mechanism of P2 P network has become a prominent problem. This paper presents an improved node resource search algorithm. The algorithm improves the reliability of the system and the success rate of the search by setting the parameter value whether the node is trusted or not and the maximum value of the valid reply message received by the node. At the same time, in view of the shortcomings of the existing credibility calculation methods, an improved credibility update calculation method is proposed. This method can effectively prevent malicious nodes from attacking the trusted nodes and normal nodes and also prevent malicious nodes from improving the credibility of each node by means of small group cooperation.

关键词： P2P network Peer Network Security Trust model Credibility

来源：评论

学校读者我要写书评

暂无评论

A Novel Binary Firefly Algorithm for the Minimum Labeling Spanning Tree Problem

引用

Computer Modeling in Engineering & Sciences 2020年第10期125卷 197-214页

作者： Mugang Lin Fangju Liu Huihuang Zhao Jianzhen Chen College of Computer Science and Technology Hengyang Normal UniversityHengyang421002China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002China School of Computer Science University of South ChinaHengyang421001China

Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different *** is anNP-hard combinatorial optimization problem,which is widely applied in communication networks,multimodal transportation networks,and data *** approximation algorithms and heuristics algorithms have been proposed for the *** algorithm is a new meta-heuristic *** of its simplicity and easy implementation,it has been successfully applied in various ***,the basic firefly algorithm is not suitable for discrete *** this end,a novel discrete firefly algorithm for the MLST problem is proposed in this paper.A binary operation method to update firefly positions and a local feasible handling method are introduced,which correct unfeasible solutions,eliminate redundant labels,and make the algorithm more suitable for discrete *** results show that the algorithm has good *** algorithm can be extended to solve other discrete optimization problems.

关键词： Minimum labeling spanning tree problem binary firefly algorithm meta-heuristics discrete optimization

来源：评论

学校读者我要写书评

暂无评论

Radiation Pattern Decoupled Dipole Antennas with Shorted Stubs for Millimeter-Wave applications

Radiation Pattern Decoupled Dipole Antennas with Shorted Stu...

引用

IEEE Conference on Antenna Measurements & applications (CAMA)

作者： Jingchang Nan Kai Lu Jingtao Cao Pengfei Hu Nan Yang Mingming Gao School of electronic and Information Engineering and Liaoning Provincial Key Laboratory of Radio Frequency Big Data Intelligent Application Liaoning Technical University(LNTU) Huludao China School of Electronics and Information technology and Guangdong Provincial Key Laboratory of Optoelectronic Information Processing Chips and Systems Sun Yat-sen University (SYSU) Guangzhou China

ISBN: (纸本)9781665490382

A pair of shorted stubs are presented in this paper to decouple $1 \times 2$ millimeter-wave printed dipole antennas and to obtain restored radiation patterns. The $1 \times 2$ printed dipole antennas are placed side by side with a spacing of about a half wavelength. By inserting shorted stubs between the dipole arms and the ground, the induced current on the coupled antenna arm is shorted to the ground. Since there is little current left on the dipole arm of the coupled antenna, the isolation between the two ports can be enhanced and the radiation patterns can be therefore restored. To verify the idea, a prototype operating at 37-40 GHz frequency band was designed, fabricated, and tested. Good agreement can be observed. Measured results show an average isolation ($-|S _{2}1|$) of 30 dB over the operating band, and the maximum radiation is corrected to the boresight direction simultaneously.

关键词： Antenna measurements Dipole antennas Current measurement Millimeter wave measurements Prototypes Directive antennas MIMO communication

来源：评论

学校读者我要写书评

暂无评论

Adaptive Image Steganographic Analysis System Based on Deep Convolutional Neural Network

Adaptive Image Steganographic Analysis System Based on Deep ...

引用

作者： Ge Jiao College of Computer Science and Technology Hengyang Normal University Hunan Provincial Key Laboratory of Intelligent Information Processing and Application

Adaptive steganography emplaces the message into the hard-to-detect noise area or the complex texture area of the image, so the steganography analysis method based on artificial design features needs to design a very complex feature extraction algorithm to detect the steganography image. In view of the advantages of deep learning steganography in automatic extraction of image features and high detection accuracy, an image steganography analysis algorithm is designed by using deep convolutional neural network, and an image steganography analysis system based on deep learning is developed. The system realizes the functions of neural network structure analysis, image steganography and verification, steganography analysis and so on. The system simplifies the operation process of algorithm comparison, reduces the complexity of algorithm performance evaluation, and verifies the feasibility of the proposed algorithm.

关键词： Image steganographic analysis Feature extraction Deep learning Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A New Image Encryption Strategy Based on Arnold Transformation and Logistic Map

A New Image Encryption Strategy Based on Arnold Transformati...

引用

作者： Xiyu Sun Zhong Chen College of Computer Science and Technology Hengyang Normal University Hunan Provincial Key Laboratory of Intelligent Information Processing and Application

Aiming at the problem of digital image encryption, an image encryption algorithm is proposed. The algorithm is divided into preparation stage and permutation diffusion stage. In the preparation stage, Arnold algorithm is improved and combined with Logistic chaotic map to generate the necessary sequence for the next stage. In the permutation diffusion stage, the final encrypted image is obtained by permutation, positive XOR operation, shift operation, S-box substitution and reverse XOR operation. The experimental results show that the algorithm can effectively resist the common attacks. For the 128 × 128 Lena gray image, the resistance performance number of pixel change rate(NPCR) is 99.6090, unified average changing intensity(UACI) is 33.4316. In addition, the time consumption of the algorithm is about 0.0055 s, and the experiments show that the algorithm has high security and real-time performance.

关键词： Image encryption Arnold transformation Chaotic system

来源：评论

学校读者我要写书评

暂无评论

Implementation of PRINCE with resource-efficient structures based on FPGAs

引用

Frontiers of information Technology & Electronic Engineering 2021年第11期22卷 1505-1516页

作者： Lang LI Jingya FENG Botao LIU Ying GUO Qiuping LI Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang Normal UniversityHengyang421002China College of Information Science and Engineering Hunan Normal UniversityChangsha410081China College of Computer Science and Technology Hengyang Normal UniversityHengyang421002China

In this era of pervasive computing, low-resource devices have been deployed in various fields. PRINCE is a lightweight block cipher designed for low latency, and is suitable for pervasive computing applications. In this paper, we propose new circuit structures for PRINCE components by sharing and simplifying logic circuits, to achieve the goal of using a smaller number of logic gates to obtain the same result. Based on the new circuit structures of components and the best sharing among components,we propose three new hardware architectures for PRINCE. The architectures are simulated and synthesized on different programmable gate array devices. The results on Virtex-6 show that compared with existing architectures, the resource consumption of the unrolled, low-cost, and two-cycle architectures is reduced by 73, 119, and 380 slices, respectively. The low-cost architecture costs only 137 slices. The unrolled architecture costs 409 slices and has a throughput of 5.34 Gb/s. To our knowledge, for the hardware implementation of PRINCE, the new low-cost architecture sets new area records, and the new unrolled architecture sets new throughput records. Therefore, the newly proposed architectures are more resource-efficient and suitable for lightweight,latency-critical applications.

关键词： Lightweight block cipher Field-programmable gate array(FPGA) Low-cost PRINCE Embedded security

来源：评论

学校读者我要写书评

暂无评论

EQUIVALENT NORMS AND HARDY-LITTLEWOOD TYPE THEOREMS, AND THEIR applicationS

arXiv

引用

arXiv 2023年

作者： Chen, Shaolin Hamada, Hidetaka College of Mathematics and Statistics Hengyang Normal University Hunan Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application 421002 China Faculty of Science and Engineering Kyushu Sangyo University 3-1 Matsukadai 2-Chome Higashi-ku Fukuoka813-8503 Japan

The main purpose of this paper is to develop some methods to investigate equivalent norms and Hardy-Littlewood type Theorems on Lipschitz type spaces of analytic functions and complex-valued harmonic functions. Initially, some characterizations of equivalent norms on Lipschitz type spaces of analytic functions and complex-valued harmonic functions will be given. In particular, we give an answer to an open problem posed by Dyakonov in (Math. Z. 249(2005), 597-611). Furthermore, some Hardy-Littlewood type Theorems of complex-valued harmonic functions are established. The obtained results improve and extend the main results in (Acta Math. 178(1997), 143-167). Additionally, we apply the equivalent norms and Hardy-Littlewood type Theorems to study composition operators between Lipschitz type *** Codes 31A05, 30H05, 47B33, 30C62, 46E15 Copyright © 2023, The Authors. All rights reserved.

关键词： Harmonic functions

来源：评论

学校读者我要写书评

暂无评论

CA-MLIF: Cross-Attention and Multimodal Low-Rank Interaction Fusion Framework for Tumor Prognostic Prediction 39

CA-MLIF: Cross-Attention and Multimodal Low-Rank Interaction...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： An, Yajun Chen, Jiale Lin, Huan Liu, Zhenbing Feng, Siyang Zhang, Hualong Lan, Rushi Liu, Zaiyi Pan, Xipeng School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China School of Artificial Intelligence and Big Data Chongqing College of Finance and Economics Chongqing402160 China Southern Medical University Guangzhou510080 China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin541004 China Guangdong Provincial Key Laboratory of Artificial Intelligence in Medical Image Analysis and Application Guangzhou510080 China

ISBN: (纸本)157735897X

Cancer is a leading cause of death worldwide due to its aggressive nature and complex variability. Accurate prognosis is therefore challenging but essential for guiding personalized treatment and follow-up. Previous research often relied on single data sources, missing the opportunity to combine various types of patient information for more comprehensive survival predictions. To address these challenges, we propose a two-stage fusion method named Cross-Attention and Multimodal Low-Rank Interaction Fusion Framework (CA-MLIF). In the first stage, we propose a CA mechanism for real-time feature updates and cross-modal mutual learning to capture rich semantic information. In the second stage, we design a novel multimodal low-rank interaction fusion method for survival prediction. Specifically, we present modal attention mechanism (MAM) for feature filtration, low-rank multimodal fusion (LMF) for model complexity reduction, and optimal weight concatenation (OWC) for maximizing feature integration. Extensive experiments on two public datasets TCGA-GBMLGG and TCGA-KIRC, as well as a multi-center in-house lung adenocarcinoma (LUAD) dataset validate the effectiveness of CA-MLIF, which demonstrate that our method outperforms existing approaches in survival prediction under both pathology-gene fusion and CT-pathology fusion scenarios. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Learning to rank

来源：评论

学校读者我要写书评

暂无评论

A Flexible Two-Stage Constrained Multi-Objective Evolutionary Algorithm Based on Autonomic Regulation

SSRN

引用

SSRN 2022年

作者： Zou, Juan Luo, Jian Liu, Yuan Yang, Shengxiang Zheng, Jinhua Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Computer science College of Xiangtan University Hunan Province Xiangtan China Faculty of Informational Engineering University of Xiangtan Xiangtan411105 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

The core element in solving constrained multi-objective problems (CMOPs) with evolutionary algorithms is simultaneously balancing objective optimization and constraint satisfaction. The di ffi culty of maintaining this balance increases significantly for existing algorithms when dealing with complex CMOPs because various complex feasible regions often make CMOPs with very di ff erent characteristics. To address this issue, we propose a more flexible two-stage evolutionary algorithm based on autonomic regulation (ARCMO), which can e ff ectively control evolutionary trends to adapt to complex CMOPs. Specifically, the first stage performs a fast global search and passes the population information to the second stage. The second stage consists of two dynamically complementary sub-processes: named exploration subprocess and convergence subprocess. The ratio of these two sub-processes is dynamically adjusted according to the information from the first stage to adapt to CMOPs with di ff erent complexities. Experiments on several recently proposed benchmark suites and real-world application problems show that ARCMO is more adaptable than the contender algorithms when solving di ff erent complex CMOPs. © 2022, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

An optimized aes masking method for resisting side channel analysis 8th

An optimized aes masking method for resisting side channel a...

引用

8th International Conference on Computer Engineering and Networks, CENet 2018

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

ISBN: (纸本)9783030146795

In order to against the side channel analysis attack such as power, electromagnetic waves, and time attack, an optimized masking method is proposed for Advanced Encryption Standard (AES) algorithm in this paper. This scheme adopts random hamming distance mask and offset randomization strategy in the first two rounds, the last round and two rounds randomly selected in the middle of the AES algorithm to ensure the security of each intermediate value. The scheme then adopts fixed-value mask strategy in the five rounds in the middle, which can reduce the time and space consumption to recalculate S box, improve the efficiency of the algorithm and reduce the production cost. To compare with other defence methods, we build a power analysis platform and conduct extensive experiments. The experimental results show that our optimized AES masking method is more secure than the compared methods, and it is able to resist second-order correlation power analysis (CPA) attacks. © Springer Nature Switzerland AG 2020.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：