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

Autonomous Multi-Objective Optimization Using Large Language Model

IEEE Transactions on Evolutionary Computation 2025年

作者： Huang, Yuxiao Wu, Shenghao Zhang, Wenjie Wu, Jibin Feng, Liang Tan, Kay Chen Department of Data Science and Artificial Intelligence Hong Kong Polytechnic University Hong Kong Department of Electrical and Elctronics Engineering Hong Kong Polytechnic University Hong Kong Chongqing University College of Computer Science Chongqing Key Laboratory of Big Data Intelligence and Privacy Computing Chongqing400044 China

Multi-objective optimization problems (MOPs) are ubiquitous in real-world applications, presenting a complex challenge of balancing multiple conflicting objectives. Traditional multi-objective evolutionary algorithms (MOEAs), though effective, often rely on domain-specific expertise for improved optimization performance, hindering adaptability to unseen MOPs. In recent years, the Large Language Models (LLMs) has revolutionized software engineering by enabling the autonomous generation and refinement of programs. Leveraging this breakthrough, we propose a new LLM-based framework that autonomously designs MOEAs for solving MOPs. The proposed framework includes a robust testing module to refine the generated MOEA through error-driven dialogue with LLMs, a dynamic selection strategy along with informative prompting-based crossover and mutation to fit textual optimization pipeline. Our approach facilitates the design of MOEA without the extensive demands for expert intervention, thereby speeding up the innovation of MOEA. Empirical studies across various MOP categories validate the robustness and superior performance of our proposed framework. © 1997-2012 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A neural kernel framework for relation extraction

引用

Expert Systems with Applications 2025年 286卷

作者： Wang, Kai Chen, Yanping Yang, Weizhe Huang, Ruizhang Qin, Yongbin Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and Technology Guizhou University China State Key Laboratory of Public Big Data Guizhou University China

Relation extraction (RE) poses significant challenges due to the complexity of identifying semantic relationships between overlapping entity pairs within sentences. Traditional kernel-based methods effectively leverage instance-level similarities but heavily depend on manually designed kernel functions, requiring substantial domain expertise and limiting their flexibility. On the other hand, neural network approaches excel at automatically learning abstract feature representations but typically neglect critical instance-specific information, potentially missing valuable relational details during inference. These limitations motivate the exploration of a hybrid approach that effectively integrates the strengths of traditional kernels with the representational power of neural networks. In this paper, we propose a neural kernel framework designed to bridge this critical gap. The proposed framework employs neural kernels, whose parameters are initialized based on task-specific objectives and optimized through neural training procedures, enabling adaptive learning of similarity measures without relying on handcrafted kernel functions. By maintaining instance-level details through annotated training examples, neural kernels create discriminative, flexible decision boundaries tailored specifically to the relation extraction task. We further develop three complementary neural kernel components, instance kernel, description kernel, and cluster kernel, to show the advantages of kernel substitution. Extensive experiments on the ACE 2005, SemEval 2010, and CoNLL 2004 datasets demonstrate that our neural kernel framework significantly outperforms existing state-of-the-art methods, achieving F1-scores of 88.11 %, 91.08 %, and 98.63 %, respectively. © 2025 Elsevier Ltd

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Particle-Assisted Deep Reinforcement Learning for Quantum State Manipulation

引用

IEEE Transactions on Evolutionary Computation 2025年

作者： Yu, Haixu Liu, Xiang Wang, Bohui Zhao, Xudong Dalian University of Technology Key Laboratory of Intelligent Control and Optimization for Industrial Equipment Ministry of Education Dalian116024 China Dongguan University of Technology Institute of Science and Technology Innovation Dongguan523000 China Talent Big Data Intelligent Analysis and Evaluation Key Laboratory of MIIT Beijing100804 China Xi'an Jiaotong University School of Cyber Science and Engineering Xi'an710049 China

Applying deep reinforcement learning (DRL) to solve quantum control problems has become a popular research direction. However, the exploration capability and reward design for the learning agent, which usually affect the DRL's application performance, has not been sufficiently emphasized. In this article, we propose a particle-assisted DRL (PDRL) method to address the above concern by enhancing exploration capabilities and designing appropriate reward functions for efficient quantum state manipulation. In PDRL, each episode in the quantum learning process is characterized by three kinds of events, i.e., unidentifiable, identifiable, and successful events. To improve exploration, exploration particles and feedback particles are employed in the early learning phase when episodes end in identifiable and successful events, respectively. To assign rewards, three event-based reward functions are provided for the DRL's agent, exploration particles and feedback particles, respectively. Numerical results on single-qubit, two-qubit, and many-qubit systems validate the effectiveness of PDRL. Comparative results with existing DRL methods demonstrate the superior performance of PDRL for quantum state manipulation. © 1997-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

EFIE: Efficient and Fine-Grained Image Encryption Algorithm With Permutation-Substitution Synchronization

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Xie, Dong Zhang, Guiting Yang, Menglin Chen, Fulong Wang, Taochun Hu, Peng Anhui Normal University Anhui Provincial Key Laboratory of Industrial Intelligence Data Security Anhui Engineering Research Centers of Medical Big Data Intelligent System School of Computer and Information Wuhu 241002 China

Currently, both pixel-level and bit-level image encryption algorithms demonstrate excellent visual performance. However, most high-security algorithms usually involve complex encryption steps, which increase the time complexity. In addition, some algorithms are challenging to adjust flexibly according to specific scenarios, making it difficult to achieve a balance between security and efficiency. In this paper, we propose an efficient and fine-grained image encryption algorithm, named EFIE. The main step of EFIE is the proposed permutation-substitution synchronization procedure, which is much more efficient compared to existing image encryption solutions. To our knowledge, we first introduce the concept of fine-grained encryption, which allows the encryptor to flexibly set the encryption unit (e.g., 1-bit, 2-bit, or 1-pixel). The smaller the length of the encryption unit, the longer the encryption time and the higher the level of security. The experimental results and various security analyses demonstrate that EFIE provides excellent encryption performance. When the encryption unit is 1 bit, encrypting a 512 × 512 color image requires only about 2.34 seconds. © 1975-2011 IEEE.

关键词： Fine-grained encryption Fisher-Yates scrambling algorithm Image encryption Permutation-substitution synchronization

来源：评论

学校读者我要写书评

暂无评论

LSU-NET: Lightweight Automatic Organs Segmentation Network for Medical Images

LSU-NET: Lightweight Automatic Organs Segmentation Network f...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yujie Ding Shenghua Teng Zuoyong Li Xiao Chen College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control School of Computer and Big Data Minjiang University Fuzhou China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

UNet and its variants have widespread applications in medical image segmentation. However, the substantial number of parameters and computational complexity of these models make them less suitable for use in clinical settings with limited computational resources. To address this limitation, we propose a novel Lightweight Shift U-Net (LSU-Net). We integrate the Light Conv Block and the Tokenized Shift Block in a lightweight manner, combining them with a dynamic weight multi-loss design for efficient dynamic weight allocation. The Light Conv Block effectively captures features with a low parameter count by combining standard convolutions with depthwise separable convolutions. The Tokenized Shift Block optimizes feature representation by shifting and capturing deep features through a combination of the Spatial Shift Block and depthwise separable convolutions. Dynamic adjustment of the loss weights at each layer approaches the optimal solution and enhances training stability. We validated LSU-Net on the UWMGI and MSD Colon datasets, and experimental results demonstrate that LSU-Net outperforms most state-of-the-art segmentation architectures.

关键词： Training Image segmentation Convolution Dynamic scheduling Stability analysis Resource management Speech processing Standards Monitoring Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Explainable Application Intent for Zero-Touch Networking: An Incorporation of Hypergraph and Transformer

引用

IEEE Transactions on Communications 2025年

作者： Wu, Bing Zou, Sai Liwang, Minghui Ni, Wei Wang, Xianbin Guizhou University College of Big Data and Information Engineering China National Key Laboratory of Autonomous Intelligent Unmanned Systems Department of Control Science and Engineering China Tongji University Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai China Data61 CSIRO Australia Department of Electrical and Computer Engineering Western University Canada

The autonomous interpretation of application intent (APPI) represents the primary step towards achieving closed-loop autonomy in zero-touch networking (ZTN) and also a prerequisite for intent-based networking (IBN). However, understanding APPIs and invoking the corresponding network resources require network professionals with extensive technical expertise to customize network service requests (NSRs), which presents significant challenges for the large-scale deployment of ZTN. This paper investigates an interesting problem of autonomous interpretation of APPIs for ZTN, where a novel mechanism integrating hypergraph and transformer with completeness assurance (HyperTrans-CA) is proposed. In particular, we first involve the Bayesian theory to model APPIs interpretability as maximizing the correct transition probability, where hypergraph is used to describe the complex relationship between application characteristics (e.g., scenario function, and performance) and NSRs, including network devices, virtual network functions (VNFs), and resources. Then, the hypergraph is integrated into the encoder, decoder, and attention mechanisms of Transformer, and a completeness assurance mechanism is designed to improve the prediction accuracy. The convergence of HyperTrans-CA and the corresponding convergence speed of the hypergraph-boosted Transformer in the graph search process are also analyzed. Comprehensive simulations and empirical measurements regarding industrial internet demonstrate that HyperTrans-CA can effectively explain/understand APPIs. Compared to the state-of-the-art Transformer and ChatGPT3.5 models, HyperTrans-CA improves the prediction accuracy of APPIs mapped to VNFs by 23% and 46%, respectively, while raising the prediction accuracy of VNF locations by 8.6 and 17.3 times. © 2025 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

SS4Rec: Continuous-Time Sequential Recommendation with State Space Models

arXiv

引用

arXiv 2025年

作者： Xiao, Wei Wang, Huiying Zhou, Qifeng Department of Automation Xiamen University Xiamen361005 China School of Engineering Westlake University Hangzhou China Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision-making Xiamen University Xiamen China

Sequential recommendation is a key area in the field of recommender systems aiming to model user interest based on historical interaction sequences with irregular intervals. While previous recurrent neural network-based and attention-based approaches have achieved significant results, they have limitations in capturing system continuity due to the discrete characteristics. In the context of continuous-time modeling, state space model (SSM) offers a potential solution, as it can effectively capture the dynamic evolution of user interest over time. However, existing SSM-based approaches ignore the impact of irregular time intervals within historical user interactions, making it difficult to model complexed user-item transitions in sequences. To address this issue, we propose a hybrid SSM-based model called SS4Rec for continuous-time sequential recommendation. SS4Rec integrates a time-aware SSM to handle irregular time intervals and a relation-aware SSM to model contextual dependencies, enabling it to infer user interest from both temporal and sequential perspectives. In the training process, the time-aware SSM and the relation-aware SSM are discretized by variable stepsizes according to user interaction time intervals and input data, respectively. This helps capture the continuous dependency from irregular time intervals and provides time-specific personalized recommendations. Experimental studies on five benchmark datasets demonstrate the superiority and effectiveness of SS4Rec. Copyright © 2025, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

arXiv

引用

arXiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

来源：评论

学校读者我要写书评

暂无评论

Federated Hybrid-Supervised Learning for Universal Medical Image Segmentation

Federated Hybrid-Supervised Learning for Universal Medical I...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Shenhai Zheng Sian Wen Congyu Li Qing Chen Laquan Li College of Computer Science and Technology Chongqing University of Posts and Telecommunications China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education China School of Science Chongqing University of Posts and Telecommunications China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Federated Learning (FL) is an advanced technology that tackles the challenge of blocked data arising from privacy concerns, enabling the training of deep learning models without the need for data sharing. However, FL faces difficulties with heterogeneous data and limited annotations in medical image segmentation. Motivated by this discovery, this study proposes a novel hybrid-supervised federated learning method (FedSLAG) that explores various types of annotations in medical imaging. To focus more on weakly-supervised and unsupervised scenarios within hybrid-supervised learning, a federated Gaussian enhancement module was proposed for heterogeneous sparse annotations (points and scribbles). The feature extraction module combines the features of multiple weakly-supervised clients and establishes the correlation of similar pixels, thus making up for the deficiency of scarce annotations and the insufficient feature extraction capability of a single machine. Then, a two-stage broadcast mechanism based on supervision sparsity was proposed to alleviate optimization deviation in local models. Experiments on breast tumor and skin lesion segmentation tasks demonstrate significant efficiency gains as well as highly competitive segmentation accuracy in many hybrid-supervised situations. Our codes are available at: https://***/TrivenDev/FedSLAG.

关键词： Training Image segmentation Breast tumors Annotations Federated learning Feature extraction Skin Lesions Speech processing Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：