检索结果-南通市图书馆

APFA:Ameliorated Pathfinder Algorithm for Engineering Applications

Journal of Bionic Engineering 2024年第3期21卷 1592-1616页

作者： keyu Zhong Fen Xiao Xieping Gao key laboratory of computing and stochastic Mathematics of Ministry of Education Hunan Normal UniversityChangsha410081China School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China School of Computer Science Xiangtan UniversityXiangtan411105China Hunan Provincial key laboratory of Intelligent computing and Language information processing Hunan Normal UniversityChangsha410081China

Pathfinder algorithm(PFA)is a swarm intelligent optimization algorithm inspired by the collective activity behavior of swarm animals,imitating the leader in the population to guide followers in finding the best food *** algorithm has the characteristics of a simple structure and high ***,PFA faces challenges such as insufficient population diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation *** paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization ***,a guidance mechanism based on multiple elite individuals is presented to enhance the global search capability of the ***,to improve the exploration efficiency of the algorithm,the Logistic chaos mapping is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst ***,a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the convergence *** three strategies achieve an effective balance between exploration and exploitation overall,thus improving the optimization performance of the *** performance evaluation,APFA is validated by the CEC2022 benchmark test set and five engineering optimization problems,and compared with the state-of-the-art metaheuristic *** numerical experimental results demonstrated the superiority of APFA.

关键词： Pathfinder algorithm Swarm intelligent Metaheuristic Engineering problems

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

引用

Journal of Bionic Engineering 2024年第3期21卷 1541-1566页

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific *** many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching *** address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED *** proposed algorithm first stores non-dominated optimal solutions found so far into an ***,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index *** mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant ***,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto *** this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching *** proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance ***,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED ***,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs

关键词： Dynamic economic emission dispatch Multi-objective optimization Golden jackal Euclidean distance index

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

NONMONOTONE LOCAL MINIMAX METHODS FOR FINDING MULTIPLE SADDLE POINTS

引用

Journal of Computational Mathematics 2024年第3期42卷 851-884页

作者： Wei Liu Ziqing Xie Wenfan Yi South China Research Center for Applied Mathematics and Interdisciplinary Studies South China Normal UniversityGuangzhou 510631China key laboratory of computing and stochastic Mathematics(Ministry of Education) Hunan Normal UniversityChangshaHunan 410081China Hunan Provincial key laboratory of Intelligent information processing and Applied Mathematics School of MathematicsHunan UniversityChangshaHunan 410082China

In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert *** to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less ***,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is *** feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative ***,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each ***,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary *** numerical results indicate that our approach is very effective and speeds up the LMMs significantly.

关键词： Multiple saddle points Local minimax method Barzilai-Borwein gradient method Normalized nonmonotone search strategy Global convergence

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Audio-guided self-supervised learning for disentangled visual speech representations

引用

Frontiers of Computer Science 2024年第6期18卷 186353-186353页

作者： FENG Dalu YANG Shuang SHAN Shiguang CHEN Xilin key laboratory of Intelligent information processing of Chinese Academy of Sciences Institute of computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences

In this paper, we propose a novel two-branch framework to learn the disentangled visual speech representations based on two particular observations. Its main idea is to introduce the audio signal to guide the learning of speech-relevant cues and introduce a bottleneck to restrict the speech-irrelevant branch from learning high-frequency and fine-grained speech cues. Experiments on both the word-level and sentence-level audio-visual speech datasets LRW and LRS2-BBC show the effectiveness. Our future work is to explore more explicit auxiliary tasks and constraints beyond the reconstruction task of the speech-relevant and irrelevant branch to improve further its ability of capturing speech cues in the video. Meanwhile, it’s also a nice try to combine multiple types of knowledge representations [10] to further boost the obtained speech epresentations, which is also left for the future work.

关键词： Knowledge representation

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

L_(1)-Smooth SVM with Distributed Adaptive Proximal stochastic Gradient Descent with Momentum for Fast Brain Tumor Detection

引用

Computers, Materials & Continua 2024年第5期79卷 1975-1994页

作者： Chuandong Qin Yu Cao Liqun Meng School of Mathematics and information Science North Minzu UniversityYinchuan750021China Ningxia key laboratory of Intelligent information and Big Data processing Yinchuan750021China

Brain tumors come in various types,each with distinct characteristics and treatment approaches,making manual detection a time-consuming and potentially ambiguous *** tumor detection is a valuable tool for gaining a deeper understanding of tumors and improving treatment *** learning models have become key players in automating brain tumor *** descent methods are the mainstream algorithms for solving machine learning *** this paper,we propose a novel distributed proximal stochastic gradient descent approach to solve the L_(1)-Smooth Support Vector Machine(SVM)classifier for brain tumor ***,the smooth hinge loss is introduced to be used as the loss function of *** avoids the issue of nondifferentiability at the zero point encountered by the traditional hinge loss function during gradient descent ***,the L_(1) regularization method is employed to sparsify features and enhance the robustness of the ***,adaptive proximal stochastic gradient descent(PGD)with momentum,and distributed adaptive PGDwithmomentum(DPGD)are proposed and applied to the L_(1)-Smooth *** computing is crucial in large-scale data analysis,with its value manifested in extending algorithms to distributed clusters,thus enabling more efficient processing ofmassive amounts of *** DPGD algorithm leverages Spark,enabling full utilization of the computer’s multi-core *** to its sparsity induced by L_(1) regularization on parameters,it exhibits significantly accelerated convergence *** the perspective of loss reduction,DPGD converges faster than *** experimental results show that adaptive PGD withmomentumand its variants have achieved cutting-edge accuracy and efficiency in brain tumor ***-trained models,both the PGD andDPGD outperform other models,boasting an accuracy of 95.21%.

关键词： Support vector machine proximal stochastic gradient descent brain tumor detection distributed computing

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Applying Hybrid Clustering in Pulsar Candidate Sifting with Multi-modality for FAST Survey

引用

Research in Astronomy and Astrophysics 2024年第3期24卷 283-296页

作者： Zi-Yi You Yun-Rong Pan Zhi Ma Li Zhang Shuo Xiao Dan-Dan Zhang Shi-Jun Dang Ru-Shuang Zhao Pei Wang Ai-Jun Dong Jia-Tao Jiang Ji-Bing Leng Wei-An Li Si-Yao Li School of Physics and Electronic Science Guizhou Normal UniversityGuiyang 550025China Guizhou Provincial key laboratory of Radio Astronomy and Data processing Guizhou Normal UniversityGuiyang 550025China College of Big Data and information Engineering Guizhou UniversityGuiyang 550025China CAS key laboratory of FAST National Astronomical ObservatoriesChinese Academy of SciencesBeijing 100101China key laboratory of information and computing Guizhou Province Guizhou Normal UniversityGuiyang 550001China School of Big data and Computer Science Guizhou Normal UniversityGuiyang 550025China Guizhou Software Engineering Research Center Guiyang 550000China

Pulsar search is always the basis of pulsar navigation,gravitational wave detection and other research ***,the volume of pulsar candidates collected by the Five-hundred-meter Aperture Spherical radio Telescope(FAST)shows an explosive growth rate that has brought challenges for its pulsar candidate filtering ***,the multi-view heterogeneous data and class imbalance between true pulsars and non-pulsar candidates have negative effects on traditional single-modal supervised classification *** this study,a multi-modal and semi-supervised learning based on a pulsar candidate sifting algorithm is presented,which adopts a hybrid ensemble clustering scheme of density-based and partition-based methods combined with a feature-level fusion strategy for input data and a data partition strategy for *** on both high Time Resolution Universe SurveyⅡ(HTRU2)and actual FAST observation data demonstrate that the proposed algorithm could excellently identify pulsars:On HTRU2,the precision and recall rates of its parallel mode reach0.981 and 0.988 *** FAST data,those of its parallel mode reach 0.891 and 0.961,meanwhile,the running time also significantly decreases with the increment of parallel nodes within ***,we can conclude that our algorithm could be a feasible idea for large scale pulsar candidate sifting for FAST drift scan observation.

关键词： methods data analysis-surveys-methods numerical

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An Improved YOLOv5s-Based Smoke Detection System for Outdoor Parking Lots

引用

Computers, Materials & Continua 2024年第8期80卷 3333-3349页

作者： Ruobing Zuo Xiaohan Huang Xuguo Jiao Zhenyong Zhang State key laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China School of information and Control Engineering Qingdao University of TechnologyQingdao266520China State key laboratory of Industrial Control Technology College of Control Science and EngineeringZhejiang UniversityHangzhou310027China key laboratory of computing Power Network and information Security Ministry of EducationQilu University of Technology(Shandong Academy of Sciences)Jinan250353China Text computing&Cognitive Intelligence Engineering Research Center of National Education Ministry Guizhou UniversityGuiyang550025China

In the rapidly evolving urban landscape,outdoor parking lots have become an indispensable part of the city’s transportation *** growth of parking lots has raised the likelihood of spontaneous vehicle combus-tion,a significant safety hazard,making smoke detection an essential preventative ***,the complex environment of outdoor parking lots presents additional challenges for smoke detection,which necessitates the development of more advanced and reliable smoke detection *** paper addresses this concern and presents a novel smoke detection technique designed for the demanding environment of outdoor parking ***,we develop a novel dataset to fill the gap,as there is a lack of publicly available *** dataset encompasses a wide range of smoke and fire scenarios,enhanced with data augmentation to ensure robustness against diverse outdoor ***,we utilize an optimized YOLOv5s model,integrated with the Squeeze-and-Excitation Network(SENet)attention mechanism,to significantly improve detection accuracy while maintaining real-time processing ***,this paper implements an outdoor smoke detection system that is capable of accurately localizing and alerting in real time,enhancing the effectiveness and reliability of emergency *** show that the system has a high accuracy in terms of detecting smoke incidents in outdoor scenarios.

关键词： YOLOv5s smoke detection deep learning SENet

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

UAV-Assisted Dynamic Avatar Task Migration for Vehicular Metaverse Services: A Multi-Agent Deep Reinforcement Learning Approach

引用

IEEE/CAA Journal of Automatica Sinica 2024年第2期11卷 430-445页

作者： Jiawen Kang Junlong Chen Minrui Xu Zehui Xiong Yutao Jiao Luchao Han Dusit Niyato Yongju Tong Shengli Xie IEEE School of Automation Guangdong University of TechnologyGuangzhou 510006China 111 Center for Intelligent Batch Manufacturing based on IoT Technology Guangzhou 510006China key laboratory of Intelligent information processing and System Integration of IoT Ministry of EducationGuangzhou 510006China School of Computer Science and Engineering Nanyang Technological UniversitySingaporeSingapore Pillar of information Systems Technology and Design Singapore University of Technology and DesignSingaporeSingapore College of Communication Engineering Army Engineering University of PLANanjing 210007China National Natural Science Foundation of China Beijing 100085China key laboratory of Intelligent Detection and IoT in Manufacturing Ministry of EducationGuangzhou 510006China Guangdong key laboratory of IoT information Technology Guangzhou 510006China

Avatars, as promising digital representations and service assistants of users in Metaverses, can enable drivers and passengers to immerse themselves in 3D virtual services and spaces of UAV-assisted vehicular Metaverses. However, avatar tasks include a multitude of human-to-avatar and avatar-to-avatar interactive applications, e.g., augmented reality navigation,which consumes intensive computing resources. It is inefficient and impractical for vehicles to process avatar tasks locally. Fortunately, migrating avatar tasks to the nearest roadside units(RSU)or unmanned aerial vehicles(UAV) for execution is a promising solution to decrease computation overhead and reduce task processing latency, while the high mobility of vehicles brings challenges for vehicles to independently perform avatar migration decisions depending on current and future vehicle status. To address these challenges, in this paper, we propose a novel avatar task migration system based on multi-agent deep reinforcement learning(MADRL) to execute immersive vehicular avatar tasks dynamically. Specifically, we first formulate the problem of avatar task migration from vehicles to RSUs/UAVs as a partially observable Markov decision process that can be solved by MADRL algorithms. We then design the multi-agent proximal policy optimization(MAPPO) approach as the MADRL algorithm for the avatar task migration problem. To overcome slow convergence resulting from the curse of dimensionality and non-stationary issues caused by shared parameters in MAPPO, we further propose a transformer-based MAPPO approach via sequential decision-making models for the efficient representation of relationships among agents. Finally, to motivate terrestrial or non-terrestrial edge servers(e.g., RSUs or UAVs) to share computation resources and ensure traceability of the sharing records, we apply smart contracts and blockchain technologies to achieve secure sharing management. Numerical results demonstrate that the proposed approach

关键词： Avatar blockchain metaverses multi-agent deep reinforcement learning transformer UAVs

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Convergence of Gaussian Quadrature Formulas for Power Orthogonal Polynomials

引用

Chinese Annals of Mathematics,Series B 2012年第5期33卷 751-766页

作者： Yingguang SHI College of Mathematics and Computer Science Key Laboratory of High Performance Computing and Stochastic Information Processing (HPCSIP) (Ministry of Education of China)

In classical theorems on the convergence of Gaussian quadrature formulas for power orthogonal polynomials with respect to a weight w on I （a,b）, a function G E S（w）= （f： fxlf（x）lw（x）dx 〈 ∞ satisfying the conditions G（2J）（x）：〉 O, x E （a,b）, j = 0, 1 , and growing as fast as possible as x→ a- and x → b-, plays an important role. But to find such a function G is often difficult and complicated. This implies that to prove convergence of Gaussian quadrature formulas, it is enough to find a function G E S（w） with G ≥ 0 satisfying

关键词： Convergence Gaussian quadrature formula Freud weight

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Survey on Chinese Sign Language Recognition:From Traditional Methods to Artificial Intelligence

引用

Computer Modeling in Engineering & Sciences 2024年第7期140卷 1-40页

作者： Xianwei Jiang Yanqiong Zhang Juan Lei Yudong Zhang School of Mathematics and information Science Nanjing Normal University of Special EducationNanjing210038China School of computing and Mathematical Sciences University of LeicesterLeicesterLE17RHUK Department of information Technology Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia

Research on Chinese Sign Language(CSL)provides convenience and support for individuals with hearing impairments to communicate and integrate into *** article reviews the relevant literature on Chinese Sign Language Recognition(CSLR)in the past 20 *** Markov Models(HMM),Support Vector Machines(SVM),and Dynamic Time Warping(DTW)were found to be the most commonly employed technologies among traditional *** from the rapid development of computer vision and artificial intelligence technology,Convolutional Neural Networks(CNN),3D-CNN,YOLO,Capsule Network(CapsNet)and various deep neural networks have sprung *** Neural Networks(DNNs)and their derived models are integral tomodern artificial intelligence *** addition,technologies thatwerewidely used in the early days have also been integrated and applied to specific hybrid models and customized identification *** language data collection includes acquiring data from data gloves,data sensors(such as Kinect,LeapMotion,etc.),and high-definition ***,facial expression recognition,complex background processing,and 3D sign language recognition have also attracted research interests among *** to the uniqueness and complexity of Chinese sign language,accuracy,robustness,real-time performance,and user independence are significant challenges for future sign language recognition ***,suitable datasets and evaluation criteria are also worth pursuing.

关键词： Chinese Sign Language Recognition deep neural networks artificial intelligence transfer learning hybrid network models

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：