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

Machine Learning Applications in Internet-of-Drones: Systematic Review, Recent Deployments, and Open Issues

ACM Computing Surveys 2023年第12期55卷 1-45页

作者： Heidari, Arash Navimipour, Nima Jafari Unal, Mehmet Zhang, Guodao Department of Computer Engineering Tabriz Branch Islamic Azad University Tabriz Iran Department of Computer Engineering Faculty of Engineering and Natural Sciences Kadir Has University Istanbul34083 Turkey Future Technology Research Center National Yunlin University of Science and Technology Douliou Yunlin64002 Taiwan Department of Computer Engineering Nisantasi University Istanbul Turkey Department of Digital Media Technology Hangzhou Dianzi University Hangzhou310018 China

Deep Learning (DL) and Machine Learning (ML) are effectively utilized in various complicated challenges in healthcare, industry, and academia. The Internet of Drones (IoD) has lately cropped up due to high adjustability to a broad range of unpredictable circumstances. In addition, Unmanned Aerial Vehicles (UAVs) could be utilized efficiently in a multitude of scenarios, including rescue missions and search, farming, mission-critical services, surveillance systems, and so on, owing to technical and realistic benefits such as low movement, the capacity to lengthen wireless coverage zones, and the ability to attain places unreachable to human beings. In many studies, IoD and UAV are utilized interchangeably. Besides, drones enhance the efficiency aspects of various network topologies, including delay, throughput, interconnectivity, and dependability. Nonetheless, the deployment of drone systems raises various challenges relating to the inherent unpredictability of the wireless medium, the high mobility degrees, and the battery life that could result in rapid topological changes. In this paper, the IoD is originally explained in terms of potential applications and comparative operational scenarios. Then, we classify ML in the IoD-UAV world according to its applications, including resource management, surveillance and monitoring, object detection, power control, energy management, mobility management, and security management. This research aims to supply the readers with a better understanding of (1) the fundamentals of IoD/UAV, (2) the most recent developments and breakthroughs in this field, (3) the benefits and drawbacks of existing methods, and (4) areas that need further investigation and consideration. The results suggest that the Convolutional Neural Networks (CNN) method is the most often employed ML method in publications. According to research, most papers are on resource and mobility management. Most articles have focused on enhancing only one parameter, with

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

Deep Bimodal Fusion Approach for Apparent Personality Analysis

引用

computers, Materials & Continua 2023年第4期75卷 2301-2312页

作者： Saman Riaz Ali Arshad Shahab S.Band Amir Mosavi Department of Computer Science National University of TechnologyIslamabad44000Pakistan Department of Computer Science Institute of Space TechnologyIslamabad44000Pakistan Future Technology Research Center National Yunlin University of Science and TechnologyDouliu64002YunlinTaiwan Faculty of Civil Engineering Technische Universitat DresdenDresden01069Germany

Personality distinguishes individuals’ patterns of feeling, thinking,and behaving. Predicting personality from small video series is an excitingresearch area in computer vision. The majority of the existing research concludespreliminary results to get immense knowledge from visual and Audio(sound) modality. To overcome the deficiency, we proposed the Deep BimodalFusion (DBF) approach to predict five traits of personality-agreeableness,extraversion, openness, conscientiousness and neuroticism. In the proposedframework, regarding visual modality, the modified convolution neural networks(CNN), more specifically Descriptor Aggregator Model (DAN) areused to attain significant visual modality. The proposed model extracts audiorepresentations for greater efficiency to construct the long short-termmemory(LSTM) for the audio modality. Moreover, employing modality-based neuralnetworks allows this framework to independently determine the traits beforecombining them with weighted fusion to achieve a conclusive prediction of thegiven traits. The proposed approach attains the optimal mean accuracy score,which is 0.9183. It is achieved based on the average of five personality traitsand is thus better than previously proposed frameworks.

关键词： Apparent personality analysis deep bimodal fusion convolutional neural network long short-term memory bimodal information fusion approach

来源：评论

学校读者我要写书评

暂无评论

A cloud service composition method using a fuzzy-based particle swarm optimization algorithm

引用

Multimedia Tools and Applications 2024年第19期83卷 56275-56302页

作者： Nazif, Habibeh Nassr, Mohammad Al-Khafaji, Hamza Mohammed Ridha Jafari Navimipour, Nima Unal, Mehmet Department of Mathematics Payame Noor University Tehran Iran Communication Technology Engineering Department Tartous University Tartus Syria Dpartment of Mathematics and Natural Sciences Gulf University for Science and Technology Mishref Campus Mubarak Al-Abdullah Kuwait Biomedical Engineering Department College of Engineering and Technologies Al-Mustaqbal University Babil Hillah51001 Iraq Department of Computer Engineering Faculty of Engineering and Natural Sciences Kadir Has University Istanbul Turkey Future Technology Research Center National Yunlin University of Science and Technology Yunlin Douliou64002 Taiwan Department of Computer Engineering Nisantasi University Istanbul Turkey

In today's dynamic business landscape, organizations heavily rely on cloud computing to leverage the power of virtualization and resource sharing. Service composition plays a vital role in cloud computing, combining multiple cloud services to fulfill complex user requests. Service composition in cloud computing presents several challenges. These include service heterogeneity, dynamic service availability, QoS (Quality of Service) constraints, and scalability issues. Traditional approaches often struggle to handle these challenges efficiently, leading to suboptimal resource utilization and poor service performance. This work presents a fuzzy-based strategy for composing cloud services to overcome these obstacles. The fact that service composition is NP-hard has prompted the use of a range of metaheuristic algorithms in numerous papers. Therefore, Particle Swarm Optimization (PSO) has been applied in this paper to solve the problem. Implementing a fuzzy-based PSO for service composition requires defining the fuzzy membership functions and rules based on the specific service domain. Once the fuzzy logic components are established, they can be integrated into the PSO algorithm. The simulation results have shown the high efficiency of the proposed method in decreasing the latency, cost, and response time. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2023.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Designing Quantum-Resilient Blockchain Frameworks: Enhancing Transactional Security with Quantum Algorithms in Decentralized Ledgers

引用

International Journal of Advanced computer science and Applications 2025年第4期16卷 618-628页

作者： Kale, Meenal R. Baker El-Ebiary, Yousef A. Sathiya, L. Burugari, Vijay Kumar Yulduz, Erkiniy Muniyandy, Elangovan Alanazi, Rakan Department of Humanities Yeshwantrao Chavan College of Engineering Hingna Nagpur India Faculty of Informatics and Computing UniSZA University Malaysia Department of CSE Panimalar Engineering College Chennai India Dept of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Vaddeswaram Andhra Pradesh Guntur India Automatic Control and Computer Engineering Department Turin Polytechnic University in Tashkent Tashkent Uzbekistan Department of Biosciences-Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai India Applied Science Research Center Applied Science Private University Amman Jordan Department of Information Technology Faculty of Computing and Information Technology Northern Border University Rafha Saudi Arabia

Quantum computing is progressing at a fast rate and there is a real threat that classical cryptographic methods can be compromised and therefore impact the security of blockchain networks. All of the ways used to secure blockchain like Rivest–Shamir–Adleman (RSA), Elliptic Curve Cryptography (ECC) and Secure Hash Algorithm 256-bit (SHA256) are the characteristic of the traditional cryptographic techniques vulnerable to attack by quantum algorithms: Shor’s and Grover’s algorithms: can efficiently break asymmetric encryption and speed up brute force attacks. Because of this vulnerability, there exists a need to develop an advance quantum resilient blockchain framework to protect the decentralized ledgers from the future threats of the quantum. This research proposes Post-Quantum Cryptography (PQC), Quantum Key Distribution (QKD) and Quantum Random Number Generation (QRNG) as a formidable architectural integration, to fortify security of blockchain. Classical encryption is replaced with PQC, QKD with secure key exchange by detecting eavesdropping, and QRNG with improving cryptographic randomness to remove the predictable key vulnerability. Only with a small loss of transaction efficiency, we increase transaction encryption accuracy, key exchange security, and resistance to quantum attacks. In this quantum enhanced blockchain design, the idea is to preserve the decentralization, transparency and security and at the same time overcome the future quantum threat. By going through rigorous analysis and comparative evaluation, we demonstrate that the approach saves blockchain networks from the emerging quantum risks to make sure that the decentralized finance, smart contracts and cross chain transactions. © (2025), (science and Information Organization). All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

An Improved Reversible Data Hiding Scheme Based on Referred Frequencies for a VQ Compressed Index 2

An Improved Reversible Data Hiding Scheme Based on Referred ...

引用

2nd International Conference on Machine vision, Image Processing and Imaging Technology, MVIPIT 2024

作者： Hwang, Min-Shiang Fatima, Kanza Wang, Yu-Lun Chan, Chi-Shiang Wu, Chia-Chun Department of Computer Science & Information Engineering Fintech and Blockchain Research Center Asia University Taichung Taiwan Department of Computer Science & Information Engineering Asia University Taichung Taiwan Department of Management Information Systems National Chung Hsing University Taichung Taiwan Department of M-Commerce and Multimedia Applications Asia University Taichung Taiwan Department of Computer Science and Information Engineering National Quemoy University Kinmen Taiwan

ISBN: (纸本)9798331543037

Nowadays, we usually compress images before uploading them to social media. However, images on social media can easily be copied, so embedding secret messages in compressed images has become increasingly popular. There are many compression methods, such as Huffman, VQ, ZIP, AMBTC, RAR, JPEG, etc. In this article, we propose an improved data hiding in VQ compression method to achieve better capacity and high quality. Experimental results show that our data-hiding approach is practical. ©2024 IEEE.

关键词： compressed image data hiding LSB matching reversible data hiding steganography vector quantization

来源：评论

学校读者我要写书评

暂无评论

A Novel Multiobjective Fireworks Algorithm and Its Applications to Imbalanced Distance Minimization Problems

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1476-1489页

作者： Shoufei Han Kun Zhu MengChu Zhou Xiaojing Liu Haoyue Liu Yusuf Al-Turki Abdullah Abusorrah College of Computer Science and Technology Nanjing University of Aeronautics and Astronauticsand also with the Collaborative Innovation Center of Novel Software Technology and IndustrializationNanjing 211106China Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102 USA Center of Research Excellence in Renewable Energy and Power Systems Department of Electrical and Computer EngineeringFaculty of Engineeringand also with the K.A.CARE Energy Research and Innovation CenterKing Abdulaziz UniversityJeddah 21589Saudi Arabia

Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing *** goal is to find a Pareto front and as many equivalent Pareto optimal solutions as *** some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions *** this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision *** first extend a latest single-objective fireworks algorithm to handle *** we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special ***,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization *** results show that the proposed algorithm is superior to compared algorithms in solving ***,its runtime is less than its peers'.

关键词： Adaptive strategy fireworks algorithm multimodal multiobjective optimization problems(MMOP)

来源：评论

学校读者我要写书评

暂无评论

A Global Best-guided Firefly Algorithm for engineering Problems

引用

Journal of Bionic engineering 2023年第5期20卷 2359-2388页

作者： Mohsen Zare Mojtaba Ghasemi Amir Zahedi Keyvan Golalipour Soleiman Kadkhoda Mohammadi Seyedali Mirjalili Laith Abualigah Department of Electrical Engineering Faculty of EngineeringJahrom UniversityJahrom***FrasIran Department of Electronics and Electrical Engineering Shiraz University of TechnologyShiraz***Iran Department of Electrical and Computer Engineering Tarbiat Modares UniversityTehran***Iran Department of Computer Engineering Sari BranchIslamic Azad UniversitySari***Iran Department of Electrical Engineering Urmia BranchIslamic Azad UniversityUrmia571696896Iran Centre for Artificial Intelligence Research and Optimisation Torrens University AustraliaBrisbaneQLD4006Australia Yonsei Frontier Lab Yonsei UniversitySeoul03722South Korea Computer Science Department Prince Hussein Bin Abdullah Faculty for Information TechnologyAl Al-Bayt UniversityMafraq25113Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman UniversityAmman19328Jordan Faculty of Information Technology Middle East UniversityAmman11831Jordan School of Computer Sciences Universiti Sains Malaysia11800George TownPulau PinangMalaysia University Research and Innovation Center Obuda University1034BudapestHungary School of Engineering and Technology Sunway University MalaysiaPetaling Jaya27500Malaysia Applied science research center Applied science private universityAmman11931Jordan

The Firefly Algorithm(FA)is a highly efficient population-based optimization technique developed by mimicking the flashing behavior of fireflies when *** article proposes a method based on Differential Evolution(DE)/current-to-best/1 for enhancing the FA's movement *** proposed modification increases the global search ability and the convergence rates while maintaining a balance between exploration and exploitation by deploying the global best ***,employing the best solution can lead to premature algorithm convergence,but this study handles this issue using a loop adjacent to the algorithm's main ***,the suggested algorithm’s sensitivity to the alpha parameter is reduced compared to the original *** GbFA surpasses both the original and five-version of enhanced FAs in finding the optimal solution to 30 CEC2014 real parameter benchmark problems with all selected alpha ***,the CEC 2017 benchmark functions and the eight engineering optimization challenges are also utilized to evaluate GbFA’s efficacy and robustness on real-world problems against several enhanced *** all cases,GbFA provides the optimal result compared to other *** that the source code of the GbFA algorithm is publicly available at https://***/projects/gbfa.

关键词： Firefly algorithm New movement vector Global best-guided firefly algorithm Global optimization engineering design

来源：评论

学校读者我要写书评

暂无评论

Improving the Interpretability through Maximizing Mutual Information for EEG Emotion Recognition

引用

IEEE Transactions on Affective Computing 2024年第2期16卷 744-757页

作者： Yang, Hua Philip Chen, C.L. Chen, Bianna Zhang, Tong North Carolina State University Department of Computer Science United States South China University of Technology Guangdong Provincial Key Laboratory of AI Large Model and Intelligent Cognition The School of Computer Science and Engineering Guangzhou510006 China Pazhou Lab Guangzhou510335 China Engineering Research Center The Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human Guangzhou China

Trustworthy Graph Neural Networks (GNNs) for EEG emotion recognition should identify emotions accurately and elucidate corresponding rationales. Current GNNs have achieved notable performance by dynamically modeling emotional connections between EEG channels. However, these GNNs lack interpretability due to the absence of explicit rationale behind their predictions. This paper conducts a comprehensive identification of important EEG channels to enhance the interpretability of EEG emotion recognition from the perspective of mutual information. Specifically, an Adjacency-Explainable Graph Neural Network (AEG) for ante-hoc interpretability is proposed to capture genuine EEG emotional connections, which gives a theoretical guarantee to remove spurious connections. Moreover, a Channel-wise Adaptive Class Activation Mapping Explainer (CACA) for post-hoc interpretability is developed to locate the EEG channels that contribute most to predictions. Experimental results on three datasets, i.e., SEED, SEED-IV, and DREAMER, prove that imbuing training processes with enhanced interpretability ensures significant performance improvements in emotion recognition. Quantitative comparisons of post-hoc interpretability also demonstrate the superiority of CACA. Furthermore, this paper illustrates two potential applications of the proposed methodologies, showing their broader utility and significance. © 2010-2012 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A reliable method for data aggregation on the industrial internet of things using a hybrid optimization algorithm and density correlation degree

引用

Cluster Computing 2024年第6期27卷 7521-7539页

作者： Heidari, Arash Shishehlou, Houshang Darbandi, Mehdi Navimipour, Nima Jafari Yalcin, Senay Department of Software Engineering Haliç University Istanbul34060 Turkey Department of Computer Engineering Tabriz Branch Islamic Azad University Tabriz Iran Pôle Universitaire Léonard de Vinci Paris France Department of Computer Engineering Kadir Has University Istanbul Turkiye and Future Technology Research Center National Yunlin University of Science and Technology Yunlin Douliou64002 Taiwan Department of Energy System Engineering School of Engineering and Natural Sciences Bahçeşehir University Istanbul Turkey

The Internet of Things (IoT) is a new information technology sector in which each device may receive and distribute data across a network. Industrial IoT (IIoT) and related areas, such as Industrial Wireless Networks (IWNs), big data, and cloud computing, have made significant strides recently. Using IIoT requires a reliable and effective data collection system, such as a spanning tree. Many previous spanning tree algorithms ignore failure and mobility. In such cases, the spanning tree is broken, making data delivery to the base station difficult. This study proposes an algorithm to construct an optimal spanning tree by combining an artificial bee colony, genetic operators, and density correlation degree to make suitable trees. The trees’ fitness is measured using hop count distances of the devices from the base station, residual energy of the devices, and their mobility probabilities in this technique. The simulation outcomes highlight the enhanced data collection reliability achieved by the suggested algorithm when compared to established methods like the Reliable Spanning Tree (RST) construction algorithm in IIoT and the Hop Count Distance (HCD) based construction algorithm. This proposed algorithm shows improved reliability across diverse node numbers, considering key parameters including reliability, energy consumption, displacement probability, and distance. © The Author(s) 2024.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

pFedCal: Lightweight Personalized Federated Learning with Adaptive Calibration Strategy

引用

IEEE Transactions on Services Computing 2025年第03期18卷 1627-1640页

作者： Deng, Dongshang Wu, Xuangou Zhang, Tao Xiang, Chaocan Zhao, Wei Xu, Minrui Kang, Jiawen Han, Zhu Niyato, Dusit Anhui University of Technology School of Computer Science and Technology Anhui Province Key Laboratory of Digital Twin Technology in Metallurgical Industry Anhui Engineering Research Center for Intelligent Applications and Security of Industrial Internet Ma'anshan243002 China Beijing Jiaotong University School of Cyberspace Science and Technology Beijing100044 China Anhui Provincial Key Laboratory of Digital Twin Technology in Metallurgical Industry Anhui243002 China Chongqing University College of Computer Science Chongqing400044 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore Guangdong University of Technology School of Automation Guangzhou510062 China University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

Federated learning (FL) is a promising artificial intelligence framework that enables clients to collectively train models with data privacy. However, in real-world scenarios, to construct practical FL frameworks, several challenges have to be addressed, including statistical heterogeneity, constrained resources, and fairness. Therefore, we first investigate an aggregation gap caused by statistical heterogeneity during local model initialization, which not only causes additional computational overhead for clients but also leads to the degradation of fairness. To bridge this gap, we propose pFedCal, a novel personalized federated learning with lightweight adaptive calibration strategy that performs calibration compensation through the prior knowledge of clients. Specifically, we introduce compensation for each client at the model initialization, with the compensation derived from the global gradient and the latest gradient bias. To enhance the calibration effect, we introduce a smoothing-based calibration strategy, and we design an adaptive calibration strategy. A representative example demonstrates that the proposed calibration and smoothing strategies improve fairness for clients. The theoretical analysis indicates that with an appropriate learning rate, pFedCal converges to a first-order stationary point for non-convex loss functions. Comprehensive experimental results show that pFedCal achieves faster convergence, higher accuracy, and improved fairness than the state-of-the-art methods. © 2008-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：