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

Open and Closed Source Models for LLM-Generated Metaheuristics Solving Engineering Optimization Problem 28th

Open and Closed Source Models for LLM-Generated Metaheuris...

28th European Conference on Applications of Evolutionary Computation, EvoApplications 2025, held as part of EvoStar 2025

作者： Senkerik, Roman Viktorin, Adam Kadavy, Tomas Kovac, Jozef Janku, Peter Pekar, Libor Guzowski, Hubert Smolka, Maciej Byrski, Aleksander Pluhacek, Michal A.I.Lab Faculty of Applied Informatics Tomas Bata University Zlin Czech Republic Department of Automation and Control Engineering Faculty of Applied Informatics Tomas Bata University Zlin Czech Republic Faculty of Computer Science AGH University of Krakow Krakow Poland Center of Excellence in Artificial Intelligence AGH University of Krakow Krakow Poland

ISBN: (纸本)9783031900648

This paper explores the applicability of generative AI (genAI), specifically Large Language Models (LLMs), for the automatic generation and configuration of metaheuristic algorithms to address a real-world engineering problem: the optimal parameter estimation of time-delay systems in interconnected heating-cooling loops. The study introduces a pioneering workflow and iterative architecture with feedback within the emerging field of genAI-driven optimization for real optimization problems, eliminating the need for manually crafted or modified algorithms. This automated system empowers domain experts in engineering to solve complex optimization problems with minimal knowledge of optimization algorithms, lowering the barrier to entry for sophisticated algorithm use. We demonstrate how LLMs can generate effective optimizers under conditions like connstrained optimization problems where the solution lies near the boundaries of the search space. Four state-of-the-art LLMs (closed and open-sourced) have been selected for experiments. These are GPT-4o, GPT-4o mini, Claude Sonnet 3.5 and Llama 3.1. All studied LLMs generated metaheuristics that outperformed the initialization baseline optimization method (Random Search and CMA-ES). Notably, the Claude Sonnet 3.5 model generated a metaheuristic with the best mean results, almost matching the performance of the tuned state-of-the-art DISH algorithm, as an example of adaptive Differential Evolution. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Time of arrival

来源：评论

学校读者我要写书评

暂无评论

Exploring Token-Level Augmentation in Vision Transformer for Semi-Supervised Semantic Segmentation

arXiv

引用

arXiv 2025年

作者： Zhang, Dengke Tang, Quan Liu, Fagui Mei, Haiqing Chen, C.L. Philip The School of Computer Science and Engineering South China University of Technology Guangzhou510006 China The Department of New Network Pengcheng Laboratory Shenzhen518000 China The China Tobacco Guangdong Industrial Corporation Guangzhou510385 China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100080 China

Semi-supervised semantic segmentation has witnessed remarkable advancements in recent years. However, existing algorithms are based on convolutional neural networks and directly applying them to Vision Transformers poses certain limitations due to conceptual disparities. To this end, we propose TokenMix, a data augmentation technique specifically designed for semi-supervised semantic segmentation with Vision Transformers. TokenMix aligns well with the global attention mechanism by mixing images at the token level, enhancing learning capability for contextual information among image patches. We further incorporate image augmentation and feature augmentation to promote the diversity of augmentation. Moreover, to enhance consistency regularization, we propose a dual-branch framework where each branch applies image and feature augmentation to the input image. We conduct extensive experiments across multiple benchmark datasets, including Pascal VOC 2012, Cityscapes, and COCO. Results suggest that the proposed method outperforms state-of-the-art algorithms with notably observed accuracy improvement, especially under limited fine annotations. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Parallel Read-Write Circuit With Fast Amplitude-Adaptive Matching Scheme to Memristor Crossbar Array

引用

IEEE Transactions on Circuits and Systems I: Regular Papers 2025年

作者： Jiang, Ningye Jiang, Mingxuan Huang, Haoen Yang, Le Huang, Yi Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan430074 China Wuhan Institute of Technology School of Electrical and Information Engineering Wuhan430205 China University of Massachusetts Amherst Department of Electrical and Computer Engineering AmherstMA01003 United States

Memristor crossbar array (MCA) is a computing-in-memory (CIM) module for computational acceleration. However, conventional read-write (R-W) circuits for MCA rely heavily on external components and have shortcoming in long writing times. To address these issues, we propose a parallel R-W circuit with a fast amplitude-adaptive matching (AAM) scheme. The fast AAM scheme is designed to accelerate time of writing memristors in MCA by adaptively adjusting the writing voltage to match an optimal amplitude. The architecture of parallel R-W circuit are outlined with the implementation of R-W processes. The design principles of parallel R-W unit, fast AAM unit, and associated control logic are described for analyzing their functions within the circuit. By integrating the parallel R-W circuit with MCA, a computing block is leveraged in a neural network for classification tasks. The experimental results demonstrate that the neural network with multiple computing blocks maintains high accuracy across various datasets (over 80%). Furthermore, the proposed AAM scheme achieves an average 54% reduction in writing time compared to that one without AAM scheme. Compared to the pulse-width scheme, the parallel R-W circuit exhibits an average 3.05× speedup in adjusting a 5×5 MCA, and the speedup efficiency is higher as the increases of MCA size. © 2025 IEEE.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

DSTFormer: 3D Human Pose Estimation with a Dual-scale Spatial and Temporal Transformer Network

DSTFormer: 3D Human Pose Estimation with a Dual-scale Spatia...

引用

International Conference on Advanced Robotics and Mechatronics (ICARM)

作者： Shaokun Zhang Xinde Li Chuanfei Hu Jianping Xu Huaping Liu School of Automation Southeast University Nanjing China Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Nanjing China Nanjing Center for Applied Mathematics Nanjing China Southeast University Shenzhen Research Institute Shenzhen China Science and Technology on Information Systems Engineering Laboratory Nanjing China Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (数字)9798350385724

ISBN: (纸本)9798350385731

Recent transformer-based methods for estimating 3D human pose have gained widespread attention, achieving state-of-the-art results. Previous methods have primarily focused on capturing motion patterns of the human body at a single scale or cascading multiple scales, such as joints, bones, and body-parts. However, they are difficult to simultaneously capture spatial-temporal motion patterns of the human body at different scales due to the complex motion patterns. To address this issue, we propose Dual-scale Spatial and Temporal transFormer (DSTFormer), which can concurrently explore the spatial dependencies and temporal motion patterns of human joints and bones. Additionally, we introduce a Gcn-Spatial Transformer Block (GSTB), which introduces Graph Convolutional Networks (GCN) into transformer to enhance the exploitation of local relationships and global information between adjacent joints or bones. Extensive experiments are conducted on the Human3.6M benchmark dataset, and superior results are reported when comparing to other state-of-the-art methods. More remarkably, our model achieves to-date the best published performance, with P1 errors of 37.9 mm and 15.6 mm, respectively.

关键词： Solid modeling Three-dimensional displays Mechatronics Graph convolutional networks Computational modeling Pose estimation Transformers Bones Joints Robots

来源：评论

学校读者我要写书评

暂无评论

Manifold Learning Inspired Mating Restriction for Evolutionary Constrained Multiobjective Optimization 11th

Manifold Learning Inspired Mating Restriction for Evolutiona...

引用

11th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2021

作者： Li, Lianghao He, Cheng Cheng, Ran Pan, Linqiang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

ISBN: (纸本)9783030720612

Mating restriction strategies are capable of restricting the distribution of parent solutions for effective offspring generation in evolutionary algorithms (EAs). Studies have shown the importance of these strategies in improving the performance of EAs for multiobjective optimization. Our previous study proposed a specific manifold learning inspired mating restriction (MLMR) strategy. It has shown promising capability of solving multiobjective optimization problems (MOPs) with complicated Pareto set shapes. However, the effect of mating restriction strategies in solving constrained MOPs is yet to be well studied. Here, we investigate the effectiveness of MLMR for solving constrained MOPs. The MLMR strategy is embedded into some representative multiobjective EAs and tested on various benchmark constrained MOPs. Experimental results indicate the encouraging performance of MLMR in constrained multiobjective optimization. © 2021, Springer Nature Switzerland AG.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Operator-Adapted Evolutionary Large-Scale Multiobjective Optimization for Voltage Transformer Ratio Error Estimation 11th

Operator-Adapted Evolutionary Large-Scale Multiobjective Opt...

引用

11th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2021

作者： Huang, Changwu Li, Lianghao He, Cheng Cheng, Ran Yao, Xin Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783030720612

Large-scale multiobjective optimization problems (LSMOPs) exist widely in real-world applications, and they are challenging for existing evolutionary algorithms due to their massive volume of search space. Despite that a number of large-scale multiobjective evolutionary algorithms (LSMOEAs) have been proposed in recent years, their effectiveness in solving LSMOPs remains unsatisfactory. One main reason is that most existing LSMOEAs may fail to balance convergence enhancement and diversity maintenance, especially for solving real-world problems. To address this issue, we propose to use a hybridized LSMOEA with adaptive operator selection (AOS) to handle real-world LSMOPs. Specifically, the proposed hybridized LSMOEA with AOS (AOS-LSMOEA) includes multiple different offspring generation and environmental selection strategies extracted from some existing LSMOEAs. Then it uses the AOS to adaptively determine the application rates of different offspring generation and environmental selection operators in an online manner. The proposed approach is capable of taking advantage of existing LSMOEAs, and the AOS enables the algorithm to choose suitable operators for solving different LSMOPs. In this study, the proposed algorithm is expected to solve the voltage transformer ratio error estimation (TREE) problems effectively. Experimental results show that AOS-LSMOEA achieves significant performance improvement due to the hybridization of different operators and the adoption of AOS method. © 2021, Springer Nature Switzerland AG.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Dragonfly Optimization-based MPPT Algorithm for Standalone PV System under Partial Shading

Dragonfly Optimization-based MPPT Algorithm for Standalone P...

引用

2021 IEEE International Conference on Emergency science and Information Technology, ICESIT 2021

作者： Lodhi, Ehtisham Yang, Pu Wang, Lina Khan, M. Adil Lodhi, Zeeshan Javed, Usman Saleem, Qasim School of Automation Science and Electrical Engineering Beihang University Beijing100191 China SKL for Management and Control of Complex Systems Institute OfAutomation Chinese Academy of Sciences Beijing100190 China Chang'an University Department of Computer and Technology Xi'an710062 China COMSATS University Department of Electrical and Computer Engineering Islamabad22060 Pakistan Lahore54000 Pakistan

ISBN: (纸本)9781665435314

Currently, Photovoltaic (PV) technology has higher demand in the market and gaining momentum day by day. However, partial shading is the most significant concern as it reduces the efficiency of standalone PV systems. Partially shading is typically induced by non-uniform sunlight and uncertain temperature fluctuations. The maximum power point tracking (MPPT) algorithms play a major role in determining the overall system's efficiency. The PV system creates several peaks in its power voltage (P-V) characteristic curve under partial shadowing. To make the PV system run under partial shading at global maximum power point (GMPP), the dragonfly optimization (DFO) algorithm is put forward in this research article. The proposed DFO technique and other commonly used MPPT techniques, such as Particle swarm optimization (PSO), Perturb and Observe (PO), is investigated through theoretical analysis and simulation using Matlab/Simulink to authenticate the overall performance of the DFO approach under partial shading. Furthermore, the comparison demonstrates that the suggested DFO strategy provides very high reliability, efficiency, robustness, rapid power tracking and lower response time to trace the GMPP than PSO and PO techniques. Hence, the DFO technique's overall performance under partial shading is appropriate and satisfying. © 2021 IEEE.

关键词： Simulink

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Domain Adaptation on Graphs with Contrastive Learning and Minimax Entropy

arXiv

引用

arXiv 2023年

作者： Xiao, Jiaren Dai, Quanyu Shen, Xiao Xie, Xiaochen Dai, Jing Lam, James Kwok, Ka-Wai Department of Mechanical Engineering The University of Hong Kong Hong Kong Department of Computing The Hong Kong Polytechnic University Hong Kong School of Computer Science and Technology Hainan University Haikou China Department of Automation Harbin Institute of Technology Shenzhen China Institute for Automatic Control and Complex Systems University of Duisburg-Essen Duisburg Germany

Label scarcity in a graph is frequently encountered in real-world applications due to the high cost of data labeling. To this end, semi-supervised domain adaptation (SSDA) on graphs aims to leverage the knowledge of a labeled source graph to aid in node classification on a target graph with limited labels. SSDA tasks need to overcome the domain gap between the source and target graphs. However, to date, this challenging research problem has yet to be formally considered by the existing approaches designed for cross-graph node classification. This paper proposes a novel method called SemiGCL to tackle the graph Semi-supervised domain adaptation with Graph Contrastive Learning and minimax entropy training. SemiGCL generates informative node representations by contrasting the representations learned from a graph’s local and global views. Additionally, SemiGCL is adversarially optimized with the entropy loss of unlabeled target nodes to reduce domain divergence. Experimental results on benchmark datasets demonstrate that SemiGCL outperforms the state-of-the-art baselines on the SSDA tasks. © 2023, CC BY-NC-ND.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

SPP-CNN: An Efficient Framework for Network Robustness Prediction

arXiv

引用

arXiv 2023年

作者： Wu, Chengpei Lou, Yang Wang, Lin Li, Junli Li, Xiang Chen, Guanrong The College of Computer Science Sichuan Normal University Chengdu610066 China The Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China The Department of Computer Science National Yang Ming Chiao Tung University Hsinchu300 Taiwan The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China The Department of Control Science and Engineering Tongji University Shanghai200240 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

This paper addresses the robustness of a network to sustain its connectivity and controllability against malicious attacks. This kind of network robustness is typically measured by the time-consuming attack simulation, which returns a sequence of values that record the remaining connectivity and controllability after a sequence of node- or edge-removal attacks. For improvement, this paper develops an efficient framework for network robustness prediction, the spatial pyramid pooling convolutional neural network (SPP-CNN). The new framework installs a spatial pyramid pooling layer between the convolutional and fully-connected layers, overcoming the common mismatch issue in the CNN-based prediction approaches and extending its generalizability. Extensive experiments are carried out by comparing SPP-CNN with three state-of-the-art robustness predictors, namely a CNN-based and two graph neural networks-based frameworks. Synthetic and real-world networks, both directed and undirected, are investigated. Experimental results demonstrate that the proposed SPP-CNN achieves better prediction performances and better generalizability to unknown datasets, with significantly lower time-consumption, than its counterparts. © 2023, CC BY.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End Robust Estimation

RLSAC: Reinforcement Learning enhanced Sample Consensus for ...

引用

International Conference on computer Vision (ICCV)

作者： Chang Nie Guangming Wang Zhe Liu Luca Cavalli Marc Pollefeys Hesheng Wang Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai Jiao Tong University Department of Computer Science ETH Zürich MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Microsoft Mixed Reality and AI Zürich Lab

Robust estimation is a crucial and still challenging task, which involves estimating model parameters in noisy environments. Although conventional sampling consensus-based algorithms sample several times to achieve robustness, these algorithms cannot use data features and historical information effectively. In this paper, we propose RLSAC, a novel Reinforcement Learning enhanced SAmple Consensus framework for end-to-end robust estimation. RLSAC employs a graph neural network to utilize both data and memory features to guide exploring directions for sampling the next minimum set. The feedback of downstream tasks serves as the reward for unsupervised training. Therefore, RL-SAC can avoid differentiating to learn the features and the feedback of downstream tasks for end-to-end robust estimation. In addition, RLSAC integrates a state transition module that encodes both data and memory features. Our experimental results demonstrate that RLSAC can learn from features to gradually explore a better hypothesis. Through analysis, it is apparent that RLSAC can be easily transferred to other sampling consensus-based robust estimation tasks. To the best of our knowledge, RLSAC is also the first method that uses reinforcement learning to sample consensus for end-to-end robust estimation. We release our codes at https://***/IRMVLab/RLSAC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：