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

8th International Conference on Sustainable information Engineering and Technology, SIET 2023

作者： Pinandito, Aryo Kharisma, Agi Putra Akbar, Muhammad Aminul Information System Department Faculty of Computer Science Universitas Brawijaya Malang Indonesia Media Game and Mobile Technology Laboratory Information System Department Faculty of Computer Science Universitas Brawijaya Malang Indonesia

ISBN: (纸本)9798400708503

Smartphones and their mobile applications have become an inseparable part of modern daily life. One of them is a public transportation app that helps people commute with public transportation. Many public transportation service providers have mobile applications as a companion for their customers to improve their quality of service. The application provides useful information and/or important features regarding their service, such as timetables or route finding for public transit. Such features run a slow algorithm to provide real-time or time-based information to the users. Dijkstra is one example of an algorithm that allows users to find the shortest path from one location to another in a public transit network. However, Dijkstra is categorized as a greedy algorithm because it looks at all possible solutions. It takes longer for Dijkstra to find the optimum solution when the number of points in a network graph is high. This study attempted to improve the overall route-finding processing time and reduce the memory footprint while keeping the visual cue of a route path reasonably consistent by utilizing Douglas-Peucker line simplification algorithm to simplify the path and reduce the number of points that Dijkstra algorithm processes. The result suggested that Douglas-Peucker simplification process took 0.5% additional memory footprint and put 5.13% additional processing time into the overall route-finding processing time. However, it reduces the overall memory footprint and processing time by 72.56% and 80.83%, respectively. The result conveyed a significant improvement in the practical implementation of Douglas-Peucker algorithm to reduce the input for the Dijkstra algorithm in finding the optimal route, thereby improving the overall route-finding performance. © 2023 ACM.

关键词： Transportation routes

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning Actor-Critic Algorithm based Autonomous Lane Change Decisions in Static Environments 6

Deep Reinforcement Learning Actor-Critic Algorithm based Aut...

引用

6th International Conference on Intelligent Computing in Data sciences, ICDS 2024

作者： Safae, Belkhyr Jaouad, Boumhidi Nikolov Nikola, S. University Sidi Mohamed Ben LISAC Laboratory Computer Science Departement Faculty of Science Dhar EI Mahraz Abdellah Fez Morocco University of Limerick Department of Computer Science and Information Systems Limerick Ireland

ISBN: (纸本)9798350351200

Deep Reinforcement Learning (DRL) has emerged as a pivotal technology in modern transportation systems, offering considerable potential to enhance driving safety and optimize performance. This study underscores the significance of DRL in autonomous driving (AD) and introduces the Advantage Actor-Critic (A2C) approach for lane change decision-making. A2C, representing policy-based methods, is compared with the Prioritized Replay Deep Q-Network (PRDQN), a value-based approach previously used in similar scenarios. Both approaches were evaluated using the CARLA (Car Learning to Act) simulation environment, focusing on static obstacle scenarios. The comparative analysis aims to assess the performance differences between A2C and PRDQN, highlighting the effectiveness of A2C in improving decision-making accuracy, safety, and adaptability. The results demonstrate the superior performance of A2C in improving safety and decision-making within autonomous driving systems. © 2024 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Machine Learning-Based Methods for Materials Inverse Design: A Review

引用

computers, Materials & Continua 2025年第2期82卷 1463-1492页

作者： Yingli Liu Yuting Cui Haihe Zhou Sheng Lei Haibin Yuan Tao Shen Jiancheng Yin Faculty of Information Engineering and Automation Kunming University of Science and TechnologyKunming650093China Yunnan Key Laboratory of Computer Technologies Application Kunming University of Science and TechnologyKunming650500China Yunnan Tin Company Limited Tin Industry Branch Gejiu661000China Faculty of Materials Science and Engineering Kunming University of Science and TechnologyKunming650093China

Finding materials with specific properties is a hot topic in materials *** materials design relies on empirical and trial-and-error methods,requiring extensive experiments and time,resulting in high *** the development of physics,statistics,computer science,and other fields,machine learning offers opportunities for systematically discovering new *** through machine learning-based inverse design,machine learning algorithms analyze the mapping relationships between materials and their properties to find materials with desired *** paper first outlines the basic concepts of materials inverse design and the challenges faced by machine learning-based approaches to materials inverse ***,three main inverse design methods—exploration-based,model-based,and optimization-based—are analyzed in the context of different application ***,the applications of inverse design methods in alloys,optical materials,and acoustic materials are elaborated on,and the prospects for materials inverse design are *** authors hope to accelerate the discovery of new materials and provide new possibilities for advancing materials science and innovative design methods.

关键词： Materials inverse design machine learning target properties deep learning new materials discovery

来源：评论

学校读者我要写书评

暂无评论

Solving the Multi Compartment Vehicle Routing Problem using a Hybridized Simulated Annealing Algorithm

引用

International Journal of Applied and Computational Mathematics 2023年第6期9卷 1-19页

作者： Beneich, Chaymaa Douiri, Sidi Mohamed Laboratory of Mathematics Computer Science Applications and Information Security Faculty of Sciences Mohammed V University in Rabat Rabat Morocco

This paper presents the Multi-Compartment Vehicle Routing Problem as an extension of the Vehicle Routing Problem that allows the transportation of different products together in one vehicle with multiple compartments, each compartment is dedicated to a single type of product and a given demand of product that can’t be splited in two different vehicles. The objective of MCVRP is to minimize the total traveled distance using a minimum number of trucks. To solve the problem, we propose a hybrid algorithm that combines the simulated annealing algorithm and an adaptive neighborhood search. Based on Christofides’s benchmark and Reed’s generating method, 28 experimental instances that were developed by Abdulkader et al. (Appl Soft Comput 37:196-203, 2015) are used to examine the performance of the proposed solution approach and compare its results with other existing results from the literature. The results demonstrate the good performance of the proposed hybrid algorithm. © 2023, The Author(s), under exclusive licence to Springer Nature India Private Limited.

关键词： Local search Meta-heuristic Mixed local search Multi-compartment Simulated annealing Vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

DNBP-CCA:A Novel Approach to Enhancing Heterogeneous Data Traffic and Reliable Data Transmission for Body Area Network

引用

computers, Materials & Continua 2024年第5期79卷 2851-2878页

作者： Abdulwadood Alawadhi Mohd.Hasbullah Omar Abdullah Almogahed Noradila Nordin Salman A.Alqahtani Atif M.Alamri InterNetWorks Research Laboratory School of ComputingUniversiti Utara MalaysiaSintok06010Malaysia Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn MalaysiaParit RajaJohor86400Malaysia School of Games&Creative Technology University for the Creative ArtsFarnhamGU97DSUK Computer Engineering Department College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia Software Engineering Department College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia

The increased adoption of Internet of Medical Things (IoMT) technologies has resulted in the widespread use ofBody Area Networks (BANs) in medical and non-medical domains. However, the performance of IEEE 802.15.4-based BANs is impacted by challenges related to heterogeneous data traffic requirements among nodes, includingcontention during finite backoff periods, association delays, and traffic channel access through clear channelassessment (CCA) algorithms. These challenges lead to increased packet collisions, queuing delays, retransmissions,and the neglect of critical traffic, thereby hindering performance indicators such as throughput, packet deliveryratio, packet drop rate, and packet delay. Therefore, we propose Dynamic Next Backoff Period and Clear ChannelAssessment (DNBP-CCA) schemes to address these issues. The DNBP-CCA schemes leverage a combination ofthe Dynamic Next Backoff Period (DNBP) scheme and the Dynamic Next Clear Channel Assessment (DNCCA)scheme. The DNBP scheme employs a fuzzy Takagi, Sugeno, and Kang (TSK) model’s inference system toquantitatively analyze backoff exponent, channel clearance, collision ratio, and data rate as input parameters. Onthe other hand, the DNCCA scheme dynamically adapts the CCA process based on requested data transmission tothe coordinator, considering input parameters such as buffer status ratio and acknowledgement ratio. As a result,simulations demonstrate that our proposed schemes are better than some existing representative approaches andenhance data transmission, reduce node collisions, improve average throughput, and packet delivery ratio, anddecrease average packet drop rate and packet delay.

关键词： Internet of Medical Things body area networks backoff period tsk fuzzy model clear channel assessment media access control

来源：评论

学校读者我要写书评

暂无评论

Vehicle Routing Problem with Time Windows using Hybrid Metaheuristic Dragonfly Algorithm and Variable Neighborhood Search: Work on Progress 11

Vehicle Routing Problem with Time Windows using Hybrid Metah...

引用

11th International Conference on Electrical Engineering, computer science and Informatics, EECSI 2024

作者： Yunita, Yunita Stiawan, Deris Rini, Dian Palupi Sriwijaya University Faculty of Computer Science Indonesia Sriwijaya University Intelligent System Research Group Faculty of Computer Science South Sumatera Palembang Indonesia Sriwijaya University Communication Network and Information Security Research Group Faculty of Computer Science South Sumatera Palembang Indonesia Sriwijaya University Image Processing Dan Pattern Recognition Laboratory Group Faculty of Computer Science South Sumatera Palembang Indonesia

ISBN: (纸本)9798350355314

One of the problems with Smart Transportation is the problem of cost and travel time. This problem is known as the Variable Routing Problem (VRP). In some real cases, in addition to considering route selection, there are limitations on the capacity and time period for the vehicle to serve each customer known as Time Windows, so VRP has developed into Variable Routing Problem with Time Windows (VRPTW). One way to solve VRPTW is to use metaheuristic methods. However, the metaheuristic method has a weakness, which are it can get stuck in local optimums and fail to find better global solutions. To overcome this, a combination with other methods or known as hybrid is needed. The formulation of this research problem is how to develop a Smart transportation model using a metaheuristic hybrid algorithm. The purpose of this study is to develop a Smart transportation model using a metaheuristic hybrid algorithm. The method used is to combine two metaheuristic algorithms, which are the Dragonfly Algorithm (DA) and the Variable Neighborhood Search (VNS). The result of this research is a new algorithm model which is a hybrid between DA and VNS. Through a combination of global exploration using DA and local exploitation using VNS, this algorithm is expected to be able to find a better solution and faster convergence in solving VRPTW problems © 2024 IEEE.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Phasmatodea Population Evolution Algorithm Based on Spiral Mechanism and Its Application to Data Clustering

引用

computers, Materials & Continua 2025年第4期83卷 475-496页

作者： Jeng-Shyang Pan Mengfei Zhang Shu-Chuan Chu Xingsi Xue Václav Snášel College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266590China School of Artificial Intelligence Nanjing University of Information Science and TechnologyNanjing210044China Department of Information Management Chaoyang University of TechnologyTaichung41349TaiwanChina Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Faculty of Electrical Engineering and Computer Science VŠB-Technical University of OstravaOstrava70833Czech Republic

Data clustering is an essential technique for analyzing complex datasets and continues to be a central research topic in data *** clustering algorithms,such as K-means,are widely used due to their simplicity and *** paper proposes a novel Spiral Mechanism-Optimized Phasmatodea Population Evolution Algorithm(SPPE)to improve clustering *** SPPE algorithm introduces several enhancements to the standard Phasmatodea Population Evolution(PPE)***,a Variable Neighborhood Search(VNS)factor is incorporated to strengthen the local search capability and foster population ***,a position update model,incorporating a spiral mechanism,is designed to improve the algorithm’s global exploration and convergence ***,a dynamic balancing factor,guided by fitness values,adjusts the search process to balance exploration and exploitation *** performance of SPPE is first validated on CEC2013 benchmark functions,where it demonstrates excellent convergence speed and superior optimization results compared to several state-of-the-art metaheuristic *** further verify its practical applicability,SPPE is combined with the K-means algorithm for data clustering and tested on seven *** results show that SPPE-K-means improves clustering accuracy,reduces dependency on initialization,and outperforms other clustering *** study highlights SPPE’s robustness and efficiency in solving both optimization and clustering challenges,making it a promising tool for complex data analysis tasks.

关键词： Phasmatodea population evolution algorithm data clustering meta-heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A Robust Security Detection Strategy for Next Generation IoT Networks

引用

computers, Materials & Continua 2025年第1期82卷 443-466页

作者： Hafida Assmi Azidine Guezzaz Said Benkirane Mourade Azrour Said Jabbour Nisreen Innab Abdulatif Alabdulatif Technology Higher School Essaouira Cadi Ayyad UniversityEssaouira44000Morocco IMIA Laboratory MSIA TeamFaculty of Sciences and TechniquesMoulay Ismail University of MeknesErrachidia50050Morocco CRIL-CNRS Artois UniversityLens62300France Department of Computer Science and Information Systems College of Applied SciencesAlMaarefa UniversityDiriyahRiyadh13713Saudi Arabia Department of Computer Science College of ComputerQassim UniversityBuraydah52571Saudi Arabia

Internet of Things(IoT)refers to the infrastructures that connect smart devices to the Internet,operating *** connectivitymakes it possible to harvest vast quantities of data,creating new opportunities for the emergence of unprecedented *** ensure IoT securit,various approaches have been implemented,such as authentication,encoding,as well as devices to guarantee data integrity and *** these approaches,Intrusion Detection Systems(IDS)is an actual security solution,whose performance can be enhanced by integrating various algorithms,including Machine Learning(ML)and Deep Learning(DL),enabling proactive and accurate detection of *** study proposes to optimize the performance of network IDS using an ensemble learning method based on a voting classification *** combining the strengths of three powerful algorithms,Random Forest(RF),K-Nearest Neighbors(KNN),and Support Vector Machine(SVM)to detect both normal behavior and different categories of *** analysis focuses primarily on the NSL-KDD dataset,while also integrating the recent Edge-IIoT dataset,tailored to industrial IoT *** results show significant enhancements on the Edge-IIoT and NSL-KDD datasets,reaching accuracy levels between 72%to 99%,with precision between 87%and 99%,while recall values and F1-scores are also between 72%and 99%,for both normal and attack *** the promising results of this study,it suffers from certain limitations,notably the use of specific datasets and the lack of evaluations in a variety of *** work could include applying this model to various datasets and evaluating more advanced ensemble strategies,with the aim of further enhancing the effectiveness of IDS.

关键词： IoT security intrusion detection RF KNN SVM EL NSL-KDD Edge-IIoT

来源：评论

学校读者我要写书评

暂无评论

LESaET: Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER

LESaET: Low-Dimensional Embedding Method for Link Prediction...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Ding, Lichao Zhao, Jing Lu, Kai Hao, Zenghao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

Knowledge graphs (KGs) provide a structured representation of the real world through entity-relation triples. However, current KGs are often incomplete, typically containing only a small fraction of all possible facts. This involves inferring missing content from existing information, a task known as link prediction. Existing methods in the field of link prediction struggle with controlling the dimensionality of embedding vectors or suffer from overly complex models. In order to tackle these challenges, we introduce a method in this paper, named Low-Dimensional Embedding Method for Link Prediction Combining Self-Attention and Enhanced-TuckER (LESaET). LESaET leverages both self-attention mechanisms and tensor factorization to learn expressive contextual-enhanced representations of KGs. Specifically, LESaET employs the multi-head self-attention mechanism of Transformer as an encoder to capture the mutual information between entities and relationships, and utilizes Enhanced-TuckER as a decoder, ultimately achieving expressive low-dimensional embeddings for link prediction tasks. LESaET demonstrates competitive performance compared to advanced methods on standard datasets. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

Video Corpus Moment Retrieval with Query-specific Context Learning and Progressive Localization

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年第6期35卷 5659-5670页

作者： Zhang, Long Song, Peipei Duan, Zhangling Wang, Shuo Chang, Xiaojun Yang, Xun School of Information Science and Technology Hefei230026 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei230026 China University of Science and Technology of China School of Information Science and Technology Hefei230026 China Department of Computer Vision Abu Dhabi United Arab Emirates University of Science and Technology of China MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition China

Video corpus moment retrieval (VCMR) aims to retrieve a moment from a large corpus of untrimmed videos corresponding to a given language query. However, existing methods often fall short due to their reliance on simple cross-modal attention mechanisms and one-stop localization, which fail to handle the complex multimodal information and large search space effectively. To address these challenges, we propose a novel VCMR method with Query-specific Context Learning and Progressive Localization (QCLPL). First, we construct query-specific multimodal contexts that capture complementary and consistent semantics across subtitles and frames, ensuring informative and efficient context building. We further introduce a semantic contrastive loss to refine these multimodal contexts, filtering out query-irrelevant information. Additionally, we introduce a progressive localization strategy that transforms the moment localization task into a two-stage process. By classifying frames into foreground and background regions, we present a simplified binary classification problem before boundary prediction, constrained by a region-aware loss. This progressive approach leverages region priors to improve subsequent moment localization. Extensive experiments on the TVR and DiDeMo datasets demonstrate that our method significantly outperforms existing approaches, setting a new state of the art for VCMR. © 1991-2012 IEEE.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：