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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Reversible Data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年第13期12卷 23933-23945页

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： Cryptography Encryption Security Data mining Adaptive coding Correlation Cloud computing Polynomials Image coding Streaming media

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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年第3期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

来源：评论

学校读者我要写书评

暂无评论

Using graph embeddings to improve the performance of embedding based recommender Systems 3

Using graph embeddings to improve the performance of embeddi...

引用

3rd International Conference on Innovative research in Applied science, engineering and Technology, IRASET 2023

作者： Ragab, Ahmed Hussein El-Kafrawy, Passant Fawzi, Sahar Ali School of Technolofy and Computer Science Nile University Computer Science Department Cairo Egypt Cis Research Center Nile University Egypt Effat College of Engineering Jedah Menoufia University Sa Faculty of Science Computer Science Department School of Information Technology and Computer Science Egypt

ISBN: (纸本)9798350398366

This paper discusses the use of node2vec graph embeddings to improve the performance of wide and deep recommenders by substituting the embedding layer with graph embeddings to leverage its representational power without major investments in migrating from current recommender systems. First, recommender systems importance in modern day platforms is discussed. Then, the magnitude of investment needed to deploy a recommender system into a production environment is discussed and finally, wide and deep recommenders and their importance in industry is outlined along with our experiments and results in improving its performance using graph embeddings, © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

CCTG-NET: Contextualized Convolutional Transformer-GRU Network for speech emotion recognition

引用

International Journal of Speech Technology 2023年第4期26卷 1099-1116页

作者： Tellai, Mohammed Mao, Qirong Department of Computer Science and Communication Engineering Jiangsu University Jiangsu Province Zhenjiang212013 China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications Jiangsu Province Zhenjiang212013 China

Speech is a crucial aspect of human-to-human interactions and plays a fundamental role in the advancement of human–computer interaction (HCI) systems. Developing an accurate speech emotion recognition (SER) system for human conversations poses a critical yet challenging task. Existing state-of-the-art (SOTA) research in SER primarily focuses on modeling vocal information within individual conversational speech utterances, overlooking the significance of incorporating transactional information from the interaction context. In this paper, we present a novel Contextualized Convolutional Transformer-GRU Network (CCTG-Net) for recognizing speech emotions using Mel-spectrogram features, effectively integrating contextual information for emotion recognition. Our experiments are conducted on the widely-used emotional benchmark dataset, IEMOCAP. Compared to SOTA methods in four-class emotion recognition, our proposed model achieves a weighted accuracy of 88.4% and an unweighted accuracy (UA) of 89.1%. This marks a substantial 3.0% enhancement in UA while maintaining an optimal balance between performance and complexity. © 2023, The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Sparse is Enough in Fine-tuning Pre-trained Large Language Models 41

Sparse is Enough in Fine-tuning Pre-trained Large Language M...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Song, Weixi Li, Zuchao Zhang, Lefei Zhao, Hai Du, Bo National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China Hubei Luojia Laboratory Wuhan430072 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China

With the prevalence of pre-training-fine-tuning paradigm, how to efficiently adapt the pre-trained model to the downstream tasks has been an intriguing issue. Parameter-Efficient Fine-Tuning (PEFT) methods have been proposed for low-cost adaptation. Although PEFT has demonstrated effectiveness and been widely applied, the underlying principles are still unclear. In this paper, we adopt the PAC-Bayesian generalization error bound, viewing pre-training as a shift of prior distribution which leads to a tighter bound for generalization error. We validate this shift from the perspectives of oscillations in the loss landscape and the quasi-sparsity in gradient distribution. Based on this, we propose a gradient-based sparse finetuning algorithm, named Sparse Increment Fine-Tuning (SIFT), and validate its effectiveness on a range of tasks including the GLUE Benchmark and Instruction-tuning. The code is accessible at https://***/song-wx/SIFT. Copyright 2024 by the author(s)

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：