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

SSRN 2025年

作者： Ye, Jialu Tan, Chaogui Xia, Yizhang Hou, Zhanglu Liu, Yuan Zou, Juan Hunan Engineering Research Center of intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan National Applied Mathematics Center China Xiangtan University China

Population co-evolution strategies are widely used to handle constrained multi-objective optimization problems (CMOPs). However, existing coevolutionary algorithms oversimplify population collaboration and are rigid in evolving the auxiliary population, ignoring the importance of maintaining population diversity, especially for CMOPs with irregular feasible regions. To tackle this issue, we propose a new dual-population evolutionary algorithm, denoted as AACMO, which attempts to mine the relational features between the unconstrained Pareto front (UPF) and the constrained Pareto front (CPF) to better adapt to CMOPs with various constraints. Specifically, the method is categorized into two phases: a learning phase and an evolving phase. First, the main population (MP) aims to quickly learn the relationships between the UPF and the CPF by leveraging the advantages of different operators, namely, genetic algorithm operators and differential evolution operators, during the learning phase. Secondly, two auxiliary strategies are designed to collaborate with the MP during the evolving phase. These strategies are capable of employing a more effective co-evolution method to assist the MP in maintaining diversity, based on the degree of alignment between the learned UPF and CPF at the end of the learning phase. The effectiveness of AACMO is confirmed through comparative analysis with eight state-of-the-art algorithms across four CMOP benchmark suites. © 2025, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

NetPrompt: Neural Network Prompting Enhances Event Extraction in Large Language Models

引用

IEEE Transactions on Big Data 2025年

作者： Mu, Lin Cheng, Yide Shen, Jun Zhang, Yiwen Zhong, Hong School of Computer Science and Technology Anhui University Anhui Hefei230601 China The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education the Anhui Engineering Laboratory of IoT Security Technologies the School of Computer Science and Technology the Institute of Physical Science and Information Technology Anhui University Hefei230039 China

Event Extraction involves extracting event-related information such as event types and event arguments from context, which has long been tackled through well-designed neural networks or fine-tuned pre-trained language models. These approaches require substantial annotated data for tuning parameters and are resource-intensive. Recently, Prompting strategies with frozen parameters, such as Chain-of-Thought and Self-Consistency, have delivered success in NLP using LLMs by generating intermediate thought steps. However, they suffer from the challenge of error propagation and lack of interaction between different thoughts. In this paper, we propose Neural Network-based Prompting (NetPrompt), a novel network-structured prompting strategy for event extraction. The core idea behind NetPrompt is to imitate the excellent information integration capabilities of neural network structures. Specifically, we first decompose the event extraction problem into diverse intermediate subtasks, and each subtask is represented as a node in different layers of the network, the output of the nodes in the preceding layer is fed into the subsequent layer. Secondly, we propose pruning strategies to adapt the reasoning overhead to different problems. Finally, we have conducted extensive experiments on two widely used event extraction benchmarks to evaluate NetPrompt. The results demonstrated that NetPrompt significantly improved the event extraction performance compared to previous methods. ©2015 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

A contrastive learning framework of graph reconstruction and hypergraph learning for key node identification

引用

Chaos, Solitons and Fractals 2025年 197卷

作者： Huang, Xu-Dong Zhang, Xian-Jie Zhang, Hai-Feng Data Intelligence Lab Research Center For Data To Cyberspace School of Cyber Science and Technology University of Science and Technology of China Hefei Anhui230026 China The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei Anhui230601 China

With the emergence of complex networks in various domains, the key node identification has become one of the critical issues that needs to be studied. Traditional index methods typically focus on single structural information, while existing data-driven approaches often rely solely on the intrinsic lower-order features of nodes. However, assessing the importance of nodes requires a comprehensive consideration of both network structures and higher-order features from multiple perspectives. To address these challenges, this paper proposes a novel deep learning framework based on Graph Reconstruction and Hypergraph Contrastive Learning, termed GRHCL. The GRHCL method constructs hypergraph structures from original graphs using random walks, followed by leveraging graph reconstruction and hypergraph learning methods to capture both structural and higher-order embedding features of nodes. Positive and negative node pairs are then constructed across different views for contrastive learning. Finally, the model is trained using a training sample set obtained through a clustering sampling strategy, along with a joint loss function. Comparative experiments against various baseline methods demonstrate that the GRHCL method achieves superior predictive performance with smaller training sets, improving accuracy by over 5% on some datasets compared to the next best-performing method. © 2025 Elsevier Ltd

关键词： Clustering sampling Contrastive learning Graph reconstruction learning Hypergraph learning key node identification

来源：评论

学校读者我要写书评

暂无评论

Metasurface-Loaded Circularly Polarized Dual-Band MIMO Cellphone Frame Antenna for Mobile Communication Applications

引用

IEEE Antennas and Wireless Propagation Letters 2025年

作者： Meng, Yanfeng Ren, Aidi Wang, Chao Xu, Guanghui Zhao, Luyu Li, Yingsong Yang, Lixia Huang, Zhi-Xiang Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Hefei230039 China Anhui University School of Electronic and Information Engineering Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei230039 China Anhui Province Key Laboratory of Target Recognition and Feature Extraction Anhui237010 China Anhui University Key Laboratory of Electromagnetic Environment al Sensing of Anhui Higher Education Institutes Hefei230039 China

In this letter, a set of circularly polarized (CP) multiple-input multiple-output (MIMO) cellphone frame antennas for mobile communication applications is proposed. The planar inverted-F antenna (PIFA) and monopole antenna operate at frequencies of 3.5 GHz and 5.5 GHz with impedance and axial ratio (AR) bandwidths overlapping at 11.4% (3.3-3.7 GHz) and 7.3% (5.2-5.6 GHz), respectively. To reduce the electromagnetic coupling between the two antennas, the V-shaped mental fence is added and different rectangular metasurface (RMS) arrays are adopted to enhance the CP radiation performances. This design not only covers 5G communication, LTE, and the 5 GHz Wi-Fi band. It also provides a communication strategy for future direct satellite communication from cellphones, enhancing efficient switching between satellite and cellular networks. © 2002-2011 IEEE.

关键词： Monopole antennas

来源：评论

学校读者我要写书评

暂无评论

THREE-PRECISION ITERATIVE REFINEMENT WITH PARAMETER REGULARIZATION AND PREDICTION FOR SOLVING LARGE SPARSE LINEAR SYSTEMS

arXiv

引用

arXiv 2025年

作者： Ge, Jifeng Zhang, Juan Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Hunan KeyLaboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

This study presents a novel mixed-precision iterative refinement algorithm, GADI-IR, within the general alternating-direction implicit (GADI) framework, designed for efficiently solving large-scale sparse linear systems. By employing low-precision arithmetic, particularly half-precision (FP16), for computationally intensive inner iterations, the method achieves substantial acceleration while maintaining high numerical accuracy. key challenges such as overflow in half-precision and convergence issues for low precision are addressed through careful backward error analysis and the application of a regularization parameter α. Furthermore, the integration of low-precision arithmetic into the parameter prediction process, using Gaussian Process Regression (GPR), significantly reduces computational time without degrading performance. The method is particularly effective for large-scale linear systems arising from discretized partial differential equations and other high-dimensional problems, where both accuracy and efficiency are critical. Numerical experiments demonstrate that the use of mixed-precision strategies not only accelerates computation but also ensures robust convergence, making the approach advantageous for various applications. The results highlight the potential of leveraging lower-precision arithmetic to achieve superior computational efficiency in high-performance computing. © 2025, CC BY.

关键词： Convergence of numerical methods

来源：评论

学校读者我要写书评

暂无评论

MEFA-Net: A mask enhanced feature aggregation network for polyp segmentation

引用

Computers in Biology and Medicine 2025年 186卷 109601-109601页

作者： Ke, Xiao Chen, Guanhong Liu, Hao Guo, Wenzhong Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350116 China

Accurate polyp segmentation is crucial for early diagnosis and treatment of colorectal cancer. This is a challenging task for three main reasons: (i) the problem of model overfitting and weak generalization due to the multi-center distribution of data;(ii) the problem of interclass ambiguity caused by motion blur and overexposure to endoscopic light;and (iii) the problem of intraclass inconsistency caused by the variety of morphologies and sizes of the same type of polyps. To address these challenges, we propose a new high-precision polyp segmentation framework, MEFA-Net, which consists of three modules, including the plug-and-play Mask Enhancement Module (MEG), Separable Path Attention Enhancement Module (SPAE), and Dynamic Global Attention Pool Module (DGAP). Specifically, firstly, the MEG module regionally masks the high-energy regions of the environment and polyps through a mask, which guides the model to rely on only a small amount of information to distinguish between polyps and background features, avoiding the model from overfitting the environmental information, and improving the robustness of the model. At the same time, this module can effectively counteract the "dark corner phenomenon" in the dataset and further improve the generalization performance of the model. Next, the SPAE module can effectively alleviate the inter-class fuzzy problem by strengthening the feature expression. Then, the DGAP module solves the intra-class inconsistency problem by extracting the invariance of scale, shape and position. Finally, we propose a new evaluation metric, MultiColoScore, for comprehensively evaluating the segmentation performance of the model on five datasets with different domains. We evaluated the new method quantitatively and qualitatively on five datasets using four metrics. Experimental results show that MEFA-Net significantly improves the accuracy of polyp segmentation and outperforms current state-of-the-art algorithms. Code posted on https://***/

关键词： Endoscopy

来源：评论

学校读者我要写书评

暂无评论

Unified Feature Selection Approach for Complex Data Based on Fuzzy β-Covering Reduction via Information Granulation

引用

IEEE Transactions on Neural Networks and Learning Systems 2025年 PP卷 PP页

作者： Zou, Xiongtao Dai, Jianhua Hunan Normal University Key Laboratory of Computing and Stochastic Mathematics (Ministry of Education) Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering School of Mathematics and Statistics Changsha 410081 China

Feature selection, as an important step of data analysis, is widely used in the fields of data mining, machine learning, and artificial intelligence. It can not only effectively alleviate the curse of dimensionality and improve model performance but also enhance model interpretability. In the real world, data is usually complex such as different feature types, the presence of missing values, and so on. However, most existing feature selection approaches are only capable of handling data with a single feature type. To address the issue of feature selection under the environment of complex data, this article proposes a unified feature selection (UFS) approach for complex data based on fuzzy β-covering reduction via information granulation. To begin with, several monotonic uncertainty measures for fuzzy β-covering are constructed from the viewpoints of algebra and information theory. Based on the proposed measures, two forward heuristic algorithms are designed for fuzzy β-covering reduction. Meanwhile, the complex data with multiple features is represented by fuzzy β-covering via information granulation. On this basis, a UFS approach is put forward for complex data. Finally, the effectiveness and superiority of the proposed approach are verified through a series of experiments compared with 12 state-of-the-art feature selection approaches. © 2012 IEEE.

关键词： Complex data feature selection fuzzy conditional entropy (FCE) fuzzy rough set (FRS) fuzzy β-covering granular computing

来源：评论

学校读者我要写书评

暂无评论

Vector Field-Guided Circumnavigation for an Unmanned Surface Vehicle With Boundary and Obstacle Constraints

引用

IEEE Transactions on Emerging Topics in computing 2025年

作者： Wu, Nailong Wang, Jigang Wang, Yueying He, Shuping Donghua University College of Information Science and Technology Shanghai201620 China Donghua University Engineering Research Center of Digitized Textile & Apparel Technology Ministry of Education Shanghai201620 China Shanghai University School of Mechatronic Engineering and Automation Shanghai200444 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Electrical Engineering and Automation Hefei230601 China

This article aims to tackle the challenge of rapid target circumnavigation by unmanned surface vehicles (USVs) under boundary and obstacle constraints through leveraging an emerging computing architecture specifically tailored for unmanned systems. Owing to the underactuation of USV dynamic systems and the presence of various time-varying surface disturbances, attaining rapid and accurate position control along with maneuverability poses a significant challenge to USVs. Therefore, when an USV maneuvers around a target in a confined search area with obstacles, it is essential for the guidance law to consider collision risks and environmental disturbances. This paper proposes a modified Lyapunov vector field with heading deviation compensation to circle the target in complex search regions. The vector field is designed to increase the radial velocity of the USV and accelerate convergence towards the target circle during the pursuit phase. By combining the proposed Lyapunov vector field with a boundary vector field, the USV can swiftly avoid boundaries and dynamic obstacles and then continue circling the target. The proposed computing architecture extends the application scope of the target circumnavigation to practical water surface environments, which is validated by extensive simulations and rigorous experiments. © 2025 IEEE.

关键词： Unmanned surface vehicles

来源：评论

学校读者我要写书评

暂无评论

Lifetime Prediction of Topcon Modules Based on Accelerated Damp Heat Life Tests

SSRN

引用

SSRN 2025年

作者： Ren, Xingang Duan, Junwei Yang, Lixia Xu, Tao Yu, Yuanjie Chen, Zhiliang Lv, Ruirui Ye, Feihong Wang, Gang Ahmed, Rida Jiang, Hao Yang, Lixia Huang, Zhixiang Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei230601 China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei230601 China CSI Cells Co. Ltd. Suzhou215129 China Anhui University of Chinese Medicine China Hong Kong Polytechnic University Hong Kong

Tunnel Oxide Passivation Contacts (TOPCon) solar cells have achieved high efficiency and become mainstream product in the global photovoltaic (PV) market. However, their long-term reliability, especially under high-temperature and high-humidity conditions, lacks sufficient field validation, and there is a lack of lifetime prediction models for TOPCon modules. To address this, we developed a robust accelerated aging model by integrating an improved Peck model with a sigmoidal degradation function, incorporating internal humidity and temperature as critical factors. The model employs a particle swarm optimization (PSO) algorithm to calibrate activation energy and humidity sensitivity parameters, enabling precise degradation trajectory simulation. Validated through a "fitting + testing" framework, the model achieves high accuracy (RMSE = 0.7%) in predicting power degradation under Damp Heat (DH), Highly Accelerated Stress Test (HAST), and modified Pressure Cooker Test (mPCT) conditions. Accelerated aging tests reveal that DH-induced degradation primarily reduces fill factor (FF) due to finger corrosion, with minimal impact on Voc and Isc. Experimental validation using a non-commercial corrosion-sensitive BOM combination shows that polyolefin elastomer (POE)-encapsulated modules exhibit superior corrosion resistance, projecting a service lifetime 23 years longer than EVA/EVA encapsulation in high-humidity regions like Hainan. This work bridges the gap in TOPCon module lifetime prediction under extreme environments, offering actionable insights for optimizing encapsulation materials and enhancing reliability. The model provides a scalable framework for evaluating module performance under site-specific climatic conditions, accelerating the development of durable PV technologies. © 2025, The Authors. All rights reserved.

关键词： Corrosion resistance

来源：评论

学校读者我要写书评

暂无评论

A Passive Mixed Loaded Over-Hundred-Octave Miniaturized Super-Wideband Antenna

引用

IEEE Antennas and Wireless Propagation Letters 2025年

作者： Xia, Yinfeng Li, Yingsong Xue, Wei Elsherbeni, Atef Harbin Engineering University College of Information and Communication Engineering Harbin 150001 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui Hefei 230601 China Colorado School of Mines Golden CO United States

An over-hundred-octave miniaturized super- wideband antenna based on passive elements mixed loading is proposed and analyzed in this paper. The proposed antenna is composed of inversed E-radiation patch, feeding line, several passive mixed loaded elements. The entire size of the proposed antenna is 0.012λ×0.01λ×0.00005λ (where λ is the lowest frequency of realized bandwidth). Derived from the analysis of impedance and equivalent circuit, by properly adjusting the inversed E-radiation patch and loading 5 passive elements into the construction of the antenna in position, the bandwidth is greatly improved. The simulated and measured results show that a -10dB fractional bandwidth of 196.2% is realized. Moreover, good omni-directional radiation patterns within the operating frequency band have been achieved from 10MHz to 1051MHz for HF, VHF and UHF applications. © 2002-2011 IEEE.

关键词： Over-hundred-octave passive mixed loaded super- wideband antenna

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：