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

Obstacle Avoidance Capability for Multi-Target Path Planning in Different Styles of Search

computers, Materials & Continua 2024年第10期81卷 749-771页

作者： Mustafa Mohammed Alhassow Oguz Ata Dogu Cagdas Atilla Department of Electrical and Computer Engineering Altinbas UniversityIstanbul34217Turkey Department of Software Engineering Altinbas UniversityIstanbul34217Turkey

This study investigates robot path planning for multiple agents,focusing on the critical requirement that agents can pursue concurrent pathways without *** agent is assigned a task within the environment to reach a designated *** the map or goal changes unexpectedly,particularly in dynamic and unknown environments,it can lead to potential failures or performance degradation in various ***,priority inheritance plays a significant role in path planning and can impact *** study proposes a ConflictBased Search(CBS)approach,introducing a unique hierarchical search mechanism for planning paths for multiple *** study aims to enhance flexibility in adapting to different *** scenarios were tested,and the accuracy of the proposed algorithm was *** the first scenario,path planning was applied in unknown environments,both stationary and mobile,yielding excellent results in terms of time to arrival and path length,with a time of 2.3 *** the second scenario,the algorithm was applied to complex environments containing sharp corners and unknown obstacles,resulting in a time of 2.6 s,with the algorithm also performing well in terms of path *** the final scenario,the multi-objective algorithm was tested in a warehouse environment containing fixed,mobile,and multi-targeted obstacles,achieving a result of up to 100.4 *** on the results and comparisons with previous work,the proposed method was found to be highly effective,efficient,and suitable for various environments.

关键词： Conflict algorithm dynamic environment mobile robot omnidirectional mobile robot unknown environment warehouse

来源：评论

学校读者我要写书评

暂无评论

Advances in Manta Ray Foraging Optimization:A Comprehensive Survey

引用

Journal of Bionic engineering 2024年第2期21卷 953-990页

作者： Farhad Soleimanian Gharehchopogh Shafi Ghafouri Mohammad Namazi Bahman Arasteh Department of Computer Engineering Urmia BranchIslamic Azad UniversityUrmiaIran Department of Computer Engineering Tabriz BranchIslamic Azad UniversityTabrizIran Department of Computer Engineering Maybod BranchIslamic Azad UniversityMaybodIran Department of Software Engineering Faculty of Engineering and Natural ScienceIstinye UniversityIstanbulTurkey

This paper comprehensively analyzes the Manta Ray Foraging Optimization(MRFO)algorithm and its integration into diverse academic *** in 2020,the MRFO stands as a novel metaheuristic algorithm,drawing inspiration from manta rays’unique foraging behaviors—specifically cyclone,chain,and somersault *** biologically inspired strategies allow for effective solutions to intricate physical *** its potent exploitation and exploration capabilities,MRFO has emerged as a promising solution for complex optimization *** utility and benefits have found traction in numerous academic *** its inception in 2020,a plethora of MRFO-based research has been featured in esteemed international journals such as IEEE,Wiley,Elsevier,Springer,MDPI,Hindawi,and Taylor&Francis,as well as at international conference *** paper consolidates the available literature on MRFO applications,covering various adaptations like hybridized,improved,and other MRFO variants,alongside optimization *** trends indicate that 12%,31%,8%,and 49%of MRFO studies are distributed across these four categories respectively.

关键词： Manta ray foraging optimization Metaheuristic algorithms Hybridization Improved Optimization

来源：评论

学校读者我要写书评

暂无评论

A probabilistic generative model for tracking multi-knowledge concept mastery probability

引用

Frontiers of computer Science 2024年第3期18卷 155-170页

作者： Hengyu LIU Tiancheng ZHANG Fan LI Minghe YU Ge YU School of Computer Science and Engineering Northeastern UniversityShenyang 110169China Software College Northeastern UniversityShenyang 110169China

Knowledge tracing aims to track students’knowledge status over time to predict students’future performance *** a real environment,teachers expect knowledge tracing models to provide the interpretable result of knowledge *** chain-based knowledge tracing(MCKT)models,such as Bayesian Knowledge Tracing,can track knowledge concept mastery probability over ***,as the number of tracked knowledge concepts increases,the time complexity of MCKT predicting student performance increases exponentially(also called explaining away problem).When the number of tracked knowledge concepts is large,we cannot utilize MCKT to track knowledge concept mastery probability over *** addition,the existing MCKT models only consider the relationship between students’knowledge status and problems when modeling students’responses but ignore the relationship between knowledge concepts in the same *** address these challenges,we propose an inTerpretable pRobAbilistiC gEnerative moDel(TRACED),which can track students’numerous knowledge concepts mastery probabilities over *** solve explain away problem,we design long and short-term memory(LSTM)-based networks to approximate the posterior distribution,predict students’future performance,and propose a heuristic algorithm to train LSTMs and probabilistic graphical model *** better model students’exercise responses,we proposed a logarithmic linear model with three interactive strategies,which models students’exercise responses by considering the relationship among students’knowledge status,knowledge concept,and *** conduct experiments with four real-world datasets in three knowledge-driven *** experimental results show that TRACED outperforms existing knowledge tracing methods in predicting students’future performance and can learn the relationship among students,knowledge concepts,and problems from students’exercise *** also conduct several case *** case studies show that

关键词： probabilistic graphical model deep learning knowledge tracing learner modeling

来源：评论

学校读者我要写书评

暂无评论

An Experimental Study on Dynamic Lifelong Learning with GPT for Mitigating Catastrophic Forgetting in Aspect-Based Sentiment Analysis

引用

IEEE Access 2025年 13卷 90316-90332页

作者： Huang, Huang Mustafa, Mumtaz Begum Asemi, Adeleh University of Malaya Faculty of Computer Science and Information Technology Department of Software Engineering Kuala Lumpur50603 Malaysia Branch Faculty of Engineering Department of Computer Engineering Isfahan81551-39998 Iran

GPT is widely recognized as one of the most versatile and powerful large language models, excelling across diverse domains. However, its significant computational demands often render it economically unfeasible for individuals and small businesses, underscoring the need for efficient, domain-specific alternatives. In Aspect-Based Sentiment Analysis (ABSA), existing models are typically optimized for single domains, facing challenges in performing effectively across multiple domains. A key issue, known as "catastrophic forgetting,"arises when models trained on one domain lose previously learned knowledge upon exposure to new domain data. This leads to two significant problems: limited cross-domain generalization and difficulty in retaining prior knowledge while learning domain-specific information. To address these challenges, we introduce the Dynamic Lifelong Learning Aspect-Based Sentiment Analysis GPT (DllaGPT), a model designed to handle multiple domains while mitigating catastrophic forgetting. Leveraging datasets from four ABSA domains - Laptops, Restaurants, Tweets, and Finance - this study fine-tunes a pretrained GPT model from HuggingFace sequentially across domains. DllaGPT employs a mechanism to retain real data from earlier domains during new domain training, effectively preserving prior knowledge. Experimental results highlight that DllaGPT achieves an average accuracy of 0.85 and a Backward Transfer (BWT) score of -0.09 across the four domains, showcasing its high accuracy and robust lifelong learning capabilities. © 2013 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A graph neural network technique for the prediction of cerebral stroke using an unbalanced medical dataset

引用

Multimedia Tools and Applications 2025年 1-37页

作者： Sha, Mohemmed Department of Software Engineering College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia

Cerebral stroke is a major health problem, and if not recognized and treated immediately, it can result in considerable morbidity and fatality. Predicting the possibility of a stroke can help with intervention, resulting in improved patient outcomes. However, constructing reliable stroke prediction algorithms can be difficult, especially when working with unbalanced medical data. Timely detection of the various warning signs of a stroke can significantly reduce its severity. To deal with unbalanced data, this research proposed the hybridization of two techniques Noise Reduction and oversampling technique (Noise Reduction-Border Line- Synthetic Minority Oversampling Technique (NR-BL-SMOTE) which only oversamples or strengthens the borderline minority class. It aims at eliminating noise from minority groups while preventing the making of noisy samples and BL-SMOTE is used to create synthetic data to balance the dataset. After that, feature extraction is done to extract features from the cerebral stroke prediction dataset using fine-tuned VGG19 architecture to improve the performance of the proposed model. The fine-tuned model uses an already trained network and re-trains the part of that by the new data set. Finally, classification is done using a graph neural network (GNN) to classify the prediction of normal or cerebral stroke (ischemic and hemorrhagic). Further, to optimize the accuracy of the classification performance;Improved Golden Jackal Optimization (IGJO) is done by repeating their iterations on the GNN hidden layer until we get the final optimal value. The proposed model will be simulated using the PYTHON tool. Then in the simulation results, the proposed approach achieves more powerful classification accuracy than established technologies, demonstrating its efficiency in stroke prediction and classification. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

X-ray Security Inspection Prohibited Items Detection Model based on Improved YOLOv7-tiny

引用

IAENG International Journal of Applied Mathematics 2024年第7期54卷 1279-1287页

作者： Teng, Wenzhao Zhang, Haigang Zhang, Yujun School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China Shenzhen Polytechnic University Shenzhen China Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China

X-ray security inspection for detecting prohibited items is widely used to maintain social order and ensure the safety of people’s lives and property. Due to the large number of parameters and high computational complexity, most current object detection models are challenging to deploy on portable mobile security inspection devices. Therefore, this paper proposes an improved YOLOv7-tiny model for application in prohibited item detection tasks. Firstly, the feature extraction backbone network is replaced with the lightweight GhostNet network to reduce computational complexity and improve detection speed. Secondly, the FPN in the Neck is replaced with BiFPN, further reducing computational complexity and memory access through skip connections. Finally, a lightweight CA attention mechanism is embedded between the Backbone and Neck layers, and the Focal-EIoU Loss function is employed to enhance the detection capability for small-sized items. Experimental results on the SIXray public dataset show a 14.8% reduction in model parameters, a 19.7% reduction in computational complexity, and a 15.9% reduction in volume after the improvements. The detection speed increases from 82.4 to 90.2, and the detection accuracy for prohibited items reaches 90.3%. The experimental results demonstrate that the improved model achieves overall lightweighting while maintaining a high detection rate and improving detection speed. © (2024), (International Association of Engineers). All Rights Reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A Transfer Learning Framework for Deep Multi-Agent Reinforcement Learning

引用

IEEE/CAA Journal of Automatica Sinica 2024年第11期11卷 2346-2348页

作者： Yi Liu Xiang Wu Yuming Bo Jiacun Wang Lifeng Ma the School of Automation Nanjing University of Science and Technology the Department of Computer Science and Software Engineering Monmouth University

Dear Editor,This letter presents a new transfer learning framework for the deep multi-agent reinforcement learning(DMARL) to reduce the convergence difficulty and training time when applying DMARL to a new scenario [1... 详细信息

关键词： Deep agent Framework

来源：评论

学校读者我要写书评

暂无评论

Stability Prediction in Smart Grid Using PSO Optimized XGBoost Algorithm with Dynamic Inertia Weight Updation

引用

computer Modeling in engineering & Sciences 2025年第1期142卷 909-931页

作者： Adel Binbusayyis Mohemmed Sha Department of Software Engineering College of Computer Engineering and Sciences in Al-Kharj Prince Sattam Bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia

Prediction of stability in SG(Smart Grid)is essential in maintaining consistency and reliability of power supply in grid *** the fluctuations in power generation and consumption patterns of smart cities assists in effectively managing continuous power supply in the *** also possesses a better impact on averting overloading and permitting effective energy *** though many traditional techniques have predicted the consumption rate for preserving stability,enhancement is required in prediction measures with minimized *** overcome the complications in existing studies,this paper intends to predict stability from the smart grid stability prediction dataset using machine learning *** accomplish this,pre-processing is performed initially to handle missing values since it develops biased models when missing values are mishandled and performs feature scaling to normalize independent data ***,the pre-processed data are taken for training and *** that,the regression process is performed using Modified PSO(Particle Swarm Optimization)optimized XGBoost Technique with dynamic inertia weight update,which analyses variables like gamma(G),reaction time(tau1–tau4),and power balance(p1–p4)for providing effective future stability in *** PSO attains optimal solution by adjusting position through dynamic inertial weights,it is integrated with XGBoost due to its scalability and faster computational speed *** hyperparameters of XGBoost are fine-tuned in the training process for achieving promising outcomes on *** results are measured through evaluation metrics such as MSE(Mean Square Error)of 0.011312781,MAE(Mean Absolute Error)of 0.008596322,and RMSE(Root Mean Square Error)of 0.010636156 and MAPE(Mean Absolute Percentage Error)value of 0.0052 which determine the efficacy of the system.

关键词： Smart Grid machine learning particle swarm optimization XGBoost dynamic inertia weight update

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Privacy Protection Scheme for Efficient Edge Computation Offloading in IoV

引用

Chinese Journal of Electronics 2024年第4期33卷 910-919页

作者： Liang YAO Xiaolong XU Wanchun DOU Muhammad Bilal School of Software Nanjing University of Information Science and Technology State Key Laboratory for Novel Software Technology Nanjing University Department of Computer and Electronics Systems Engineering Hankuk University of Foreign Studies

As a pivotal enabler of intelligent transportation system(ITS), Internet of vehicles(Io V) has aroused extensive attention from academia and industry. The exponential growth of computation-intensive, latency-sensitive,and privacy-aware vehicular applications in Io V result in the transformation from cloud computing to edge computing,which enables tasks to be offloaded to edge nodes(ENs) closer to vehicles for efficient execution. In ITS environment,however, due to dynamic and stochastic computation offloading requests, it is challenging to efficiently orchestrate offloading decisions for application requirements. How to accomplish complex computation offloading of vehicles while ensuring data privacy remains challenging. In this paper, we propose an intelligent computation offloading with privacy protection scheme, named COPP. In particular, an Advanced Encryption Standard-based encryption method is utilized to implement privacy protection. Furthermore, an online offloading scheme is proposed to find optimal offloading policies. Finally, experimental results demonstrate that COPP significantly outperforms benchmark schemes in the performance of both delay and energy consumption.

关键词： Industries Privacy Energy consumption Transportation Computational efficiency Encryption Protection

来源：评论

学校读者我要写书评

暂无评论

A mathematical multi-objective optimization model and metaheuristic algorithm for effective advertising in the social internet of things

引用

Neural Computing and Applications 2025年第6期37卷 4797-4821页

作者： Molaei, Reza Rahsepar Fard, Kheirollah Bouyer, Asgarali Department of Computer Engineering and Information Technology University of Qom Qom Iran Department of Software Engineering Azarbaijan Shahid Madani University Tabriz Iran Department of Software Engineering Faculty of Engineering and Natural Science Istinye University Istanbul Turkey

The integration of social networks with the Internet of Things (IoT) has been explored in recent research, giving rise to the Social Internet of Things (SIoT). One promising application of SIoT is viral marketing, which plays a critical role in modern advertising. However, current solutions proposed for viral marketing are often impractical in real-world scenarios, and there has been limited investigation into viral marketing within the context of SIoT. To address this issue, we present a multi-objective integer linear programming model named ILP-ASoT that facilitates advertising through SIoT. Our approach introduces two realistic parameters: the node sociality rate and the node appropriateness rate as an advertising destination. By balancing the cost of selecting a seed set with the number of users who receive the advertisement, our model offers an appropriate trade-off. Since this is proven as an NP-hard problem, A PSO-based metaheuristic algorithm is proposed to provide near-optimal solutions for advertising in SIoT, called PSO-ASoT. Through simulations, we show that our PSO-ASoT algorithm outperforms state-of-the-art algorithms in several metrics, such as influence spread, advertising cost, and duplicated advertising rate. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：