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

Edge-Driven Industrial Computing Power Networks: Digital Twin-Empowered Service Provisioning by Hybrid Soft Actor-Critic

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8095-8109页

作者： Zhang, Long Song, Deng-Ao Zhang, Hongliang Tian, Ni Zhuang, Zirui Niyato, Dusit Han, Zhu Hebei University of Engineering School of Information and Electrical Engineering Handan056038 China Peking University State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Beijing100871 China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Nanyang Technological University College of Computing and Data Science 639798 Singapore 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

With the proliferation of data-intensive industrial applications, the collaboration of computing powers among standalone edge servers is vital to provision such services for smart devices. In this paper, we propose an edge-driven industrial computing power network (CPN) by orchestrating the computing and network resources of edge servers through the centralized resource scheduling and decentralized task computing. However, efficient task offloading and collaborative processing is challenging, which requires higher degrees of network automation and intelligence. Therefore, we incorporate digital twins (DTs) into the edge-driven CPN architecture, where the DTs are created as the digital replicas to assist both the computation offloading and collaborative processing. A joint optimization problem of the computing power assignment, service association, task partition, and transmit power control is formulated for maximizing the system average weighted utility. Due to the temporal-spatial variability of tasks and the resulted dynamic environment, we transform the original problem as a Markov decision process aiming at maximizing the long-term average weighted utility. To efficiently handle the high-dimensional discrete-continuous action space, a hybrid soft actor-critic based deep reinforcement learning algorithm is developed for optimizing the joint design. Simulation results validate the superiority of our proposed algorithm over the benchmarks, showing the significant gains obtained by integrating DTs into the edge-driven CPN. © 1967-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Optimal Illumination Distance Metrics for Person Re-identification 21st

Optimal Illumination Distance Metrics for Person Re-identif...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Wang, Chao Wang, Zhongyuan Hu, Ruimin Wang, Xiaochen Zhou, Wen National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University Wuhan China College of Information Engineering Nanjing University of Finance Economics Nanjing China

ISBN: (纸本)9789819601240

Person re-identification (Re-ID) has been widely used in public security and surveillance. Due to the influence of different shooting times and locations, can lead to lighting variations in the images captured by the camera, and the lighting variations seriously affect the Re-ID performance. Existing methods utilize images under different lighting conditions to transform to uniform lighting conditions to eliminate the effect of lighting on Re-ID. However, these methods ignore the fact that different illumination metric distances have different recognition performances. Therefore, we propose the optimal illumination distance metric, by analyzing different light distances for pedestrians in different light conditions, we find that there exists an optimal light condition in which the distance between image pairs is smaller than the distance in other light conditions. The distance under the optimal lighting condition is used in the retrieval process as the distance between its final sorted image pairs. To verify the effectiveness of our method, Market-1501-IA and Duke-MTMC-IA datasets are constructed, and a large number of experiments are conducted under different lighting conditions to verify the existence of the optimal lighting conditions and the effectiveness of the proposed method. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lighting

来源：评论

学校读者我要写书评

暂无评论

K-Banhatti Sombor Invariants of Certain computer Networks

引用

computers, Materials & Continua 2022年第10期73卷 15-31页

作者： Khalid Hamid Muhammad Waseem Iqbal Abaid Ur Rehman Virk Muhammad Usman Ashraf Ahmed Mohammed Alghamdi Adel A.Bahaddad Khalid Ali Almarhabi Department of Computer Science Superior UniversityLahore54000Pakistan Department of Software Engineering Superior UniversityLahore54000Pakistan Department of Mathematics University of SialkotSialkot51013Pakistan Department of Computer Science GC Women UniversitySialkot53310Pakistan Department of Software Engineering College of Computer Science and EngineeringUniversity of Jeddah21493Saudi Arabia Department of Information System Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of Computer Science College of Computing in Al-QunfudahUmm Al-Qura UniversityMakkah24381Saudi Arabia

Any number that can be uniquely determined by a graph is called a graph *** the last twenty years’countless mathematical graph invariants have been characterized and utilized for correlation ***,no reliable examination has been embraced to decide,how much these invariants are related with a network graph or molecular *** this paper,it will discuss three different variants of bridge networks with good potential of prediction in the field of computer science,mathematics,chemistry,pharmacy,informatics and biology in context with physical and chemical structures and networks,because k-banhatti sombor invariants are freshly presented and have numerous prediction qualities for different variants of bridge graphs or *** study solved the topology of a bridge graph/networks of three different types with two invariants KBanhatti Sombor Indices and its reduced *** deduced results can be used for the modeling of computer networks like Local area network(LAN),Metropolitan area network(MAN),and Wide area network(WAN),backbone of internet and other networks/structures of computers,power generation,bio-informatics and chemical compounds synthesis.

关键词： Bridge networks invariants k-banhatti sombor indices maple network graph molecular graph

来源：评论

学校读者我要写书评

暂无评论

PACE: Reputation-Driven Hierarchical Incentive Mechanism for Trusted Healthcare Transactions in Model Marketplace

引用

IEEE Transactions on Consumer Electronics 2024年第1期71卷 1571-1583页

作者： Lu, Jianfeng Dou, Xiaochi Rathore, Bharati Jhaveri, Rutvij H. Seid, Abegaz Mohammed Erbad, Aiman Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China Ministry of Education Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology China United Kingdom Pandit Deendayal Energy University Department of Computer Science and Engineering School of Technology India Hamad Bin Khalifa University College of Science and Engineering Doha Qatar Qatar University College of Engineering Doha Qatar

Federated learning-based model marketplaces have the potential to securely leverage healthcare data for efficient healthcare transactions. However, the willingness to participate in this marketplace is severely hindered by self-interested model sellers, who maximize their personal gains via distorting the quality of their models. To this end, we propose a rePutation-driven hierArchical inCentive mEchanism, called PACE, which combines contract cooperation and game pricing to motivate model sellers to be honest, thereby improving the sustainability of the model marketplace via two-layer cooperation. Specifically, at the training layer, we design a reward payment rule based on multidimensional contracts, while at the trading layer, we use a competitive market pricing game to develop the accuracy pricing rule. In particular, the above rules cleverly combine the fine-grained model sellers' reputations with the willingness of healthcare devices to indirectly affect the model sellers' utilities. Theoretically, we prove that PACE can effectively incentivize model sellers to truthfully report model quality while satisfying both individual rationality and incentive compatibility with a fairness guarantee. Experimental results conducted on four real-world datasets show that our PACE improves the global performance by up to 12.85% and reduces the global loss by at least 19.23% compared with the state-of-the-art baselines. © 1975-2011 IEEE.

关键词： Marketplaces

来源：评论

学校读者我要写书评

暂无评论

CASKA-CRT: Chinese Remainder Theorem Empowered Certificateless Aggregate Signcryption Scheme with Key Agreement in IoVs

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on Intelligent Vehicles 2024年 1-16页

作者： Hou, Yingzhe Cao, Yue Xiong, Hu Sun, Zhili Mumtaz, Shahid Tian, Daxin School of Cyber Science and Engineering Wuhan University Wuhan China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Institute of Communication Systems University of Surrey Guildford U.K Department of Applied Informatics Silesian University of Technology Akademicka Gliwice Poland State Key Laboratory of Vehicle-Infrastructure Integrated ITS the State Key Laboratory of Intelligent Transportation System and the School of Transportation Science and Engineering Beihang University Beijing China

To enhance the privacy of messages in Internet of Vehicles (IoVs), it is critical to preserve the communication security between Road Side Unit (RSU) and numerous vehicles. The primitive of signcryption is introduced to guarantee the confidentiality, integrity and unforgeability of transmitted messages. Nevertheless, the existing signcryption schemes fail to achieve a balance between security and efficiency. In this paper, we construct a Chinese remainder theorem (CRT) empowered certificateless aggregate signcryption scheme with key agreement (CASKA-CRT). As the vehicle joins and leaves dynamically, the proposed scheme can ensure the dynamic security via one modulo division operation. Besides, the certificateless aggregate signcryption and key agreement mechanisms are embedded. The former idea can both address the certificate management and key escrow problems, while the latter technology can create authentication as a premise of secure communication. Based on this construction, the hash-to-group operation and bilinear pairing are avoided, to realize a faster verification with the increased number of messages. Moreover, the security of proposed scheme is proved under the random oracle model. Finally, the performance analysis demonstrates the advantage of CASKA-CRT in terms of security and reliability over related works. IEEE

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks 25

Dual-level Mixup for Graph Few-shot Learning with Fewer Task...

引用

34th ACM Web Conference, WWW 2025

作者： Liu, Yonghao Li, Mengyu Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education China

ISBN: (纸本)9798400712746

Graph neural networks have been demonstrated as a powerful paradigm for effectively learning graph-structured data on the web and mining content from it. Current leading graph models require a large number of labeled samples for training, which unavoidably leads to overfitting in few-shot scenarios. Recent research has sought to alleviate this issue by simultaneously leveraging graph learning and meta-learning paradigms. However, these graph meta-learning models assume the availability of numerous meta-training tasks to learn transferable meta-knowledge. Such assumption may not be feasible in the real world due to the difficulty of constructing tasks and the substantial costs involved. Therefore, we propose a SiMple yet effectIve approach for graph few-shot Learning with fEwer tasks, named SMILE. We introduce a dual-level mixup strategy, encompassing both within-task and across-task mixup, to simultaneously enrich the available nodes and tasks in meta-learning. Moreover, we explicitly leverage the prior information provided by the node degrees in the graph to encode expressive node representations. Theoretically, we demonstrate that SMILE can enhance the model generalization ability. Empirically, SMILE consistently outperforms other competitive models by a large margin across all evaluated datasets with in-domain and cross-domain settings. Our anonymous code can be found here. © 2025 Copyright held by the owner/author(s).

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Deep Learning Approach for Prediction of Protein Secondary Structure

引用

computers, Materials & Continua 2022年第8期72卷 3705-3718页

作者： Muhammad Zubair Muhammad Kashif Hanif Eatedal Alabdulkreem Yazeed Ghadi Muhammad Irfan Khan Muhammad Umer Sarwar Ayesha Hanif Department of Computer Science Government College UniversityFaisalabadPakistan Department of Computer Science College of Computer and Information SciencesPrincess Nourah Bint Abdulrahman UniversityRiyadh 11671Saudi Arabia Department of Software Engineering/Computer Science Al Ain UniversityAbu DhabiUnited Arab Emirates

The secondary structure of a protein is critical for establishing a link between the protein primary and tertiary *** this reason,it is important to design methods for accurate protein secondary structure *** of the existing computational techniques for protein structural and functional prediction are based onmachine learning with *** deep learning architectures have already been applied to tackle protein secondary structure prediction *** this study,deep learning based models,i.e.,convolutional neural network and long short-term memory for protein secondary structure prediction were *** input to proposed models is amino acid sequences which were derived from CulledPDB *** tuning with cross validation was employed to attain best parameters for the proposed *** proposed models enables effective processing of amino acids and attain approximately 87.05%and 87.47%Q3 accuracy of protein secondary structure prediction for convolutional neural network and long short-term memory models,respectively.

关键词： Convolutional neural network machine learning protein secondary structure deep learning long short-term memory protein secondary structure prediction

来源：评论

学校读者我要写书评

暂无评论

New Algorithms for Distributed Fair k-Center Clustering: Almost Accurate as Sequential Algorithms 23

New Algorithms for Distributed Fair k-Center Clustering: Alm...

引用

23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024

作者： Wu, Xiaoliang Feng, Qilong Huang, Ziyun Xu, Jinhui Wang, Jianxin School of Computer Science and Engineering Central South University Xiangjiang Laboratory Changsha China Department of Computer Science and Software Engineering Penn State Erie The Behrend College Erie United States Department of Computer Science and Engineering State University of New York at Buffalo Buffalo United States Hunan Provincial Key Lab on Bioinformatics Central South University Xiangjiang Laboratory Changsha China

Fair clustering problems have been paid lots of attention recently. In this paper, we study the k-Center problem under the group fairness and data summarization fairness constraints, denoted as Group Fair k-Center (GFkC) and Data Summarization Fair k-Center (DSFkC), respectively, in the massively parallel computational (MPC) distributed model. The previous best results for the above two problems in the MPC model are a 9-approximation with violation 7 (WWW 2022) and a (17 + ∊)-approximation without fairness violation (ICML 2020), respectively. In this paper, we obtain a (3 + ∊)- approximation with violation 1 for the GFkC problem in the MPC model, which is almost as accurate as the best known approximation ratio 3 with violation 1 for the sequential algorithm of the GFkC problem. Moreover, for the DSFkC problem in the MPC model, we obtain a (4 + ∊)-approximation without fairness violation, which is very close to the best known approximation ratio 3 for the sequential algorithm of the DSFkC problem. Empirical experiments show that our distributed algorithms perform better than existing state-of-the-art distributed methods for the above two problems. © 2024 International Foundation for Autonomous Agents and Multiagent Systems.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Autonomous Aspect-Image Instruction A2II: Q-Former Guided Multimodal Sentiment Classification 30

Autonomous Aspect-Image Instruction A2II: Q-Former Guided Mu...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Feng, Junjia Lin, Mingqian Shang, Lin Gao, Xiaoying State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Technology Nanjing University China School of Engineering and Computer Science Victoria University of Wellington New Zealand

ISBN: (纸本)9782493814104

Multimodal aspect-oriented sentiment classification (MABSC) task has garnered significant attention, which aims to identify the sentiment polarities of aspects by combining both language and vision information. However, the limited multimodal data in this task has become a big gap for the vision-language multimodal fusion. While large-scale vision-language pretrained models have been adapted to multiple tasks, their use for MABSC task is still in a nascent stage. In this work, we present an attempt to use the instruction tuning paradigm to MABSC task and leverage the ability of large vision-language models to alleviate the limitation in the fusion of textual and image modalities. To tackle the problem of potential irrelevance between aspects and images, we propose a plug-and-play selector to autonomously choose the most appropriate instruction from the instruction pool, thereby reducing the impact of irrelevant image noise on the final sentiment classification results. We conduct extensive experiments in various scenarios and our model achieves state-of-the-art performance on benchmark datasets, as well as in few-shot settings. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Throughput Maximization in Cognitive Radio Network with NOMA

引用

computers, Materials & Continua 2022年第1期70卷 195-212页

作者： Xiaoli He Yu Song Yu Xue Muhammad Owais Weijian Yang Xinwen Cheng School of Computer Science Sichuan University of Science and EngineeringZigong643000China Department of Network Information Management Center Sichuan University of Science and EngineeringZigong643000China School of Information Engineering South West University of Science and TechnologyMianyang621010China School of Computer and Software Nanjing University of Information Science and TechnologyJiangsu210044China Alhamd Islamic University Airport Road Quetta BalochistanPakistan

Spectrum resources are the precious and limited natural *** order to improve the utilization of spectrum resources and maximize the network throughput,this paper studies the resource allocation of the downlink cognitive radio network with non-orthogonalmultiple access(CRN-NOMA).NOMA,as the key technology of the fifth-generation communication(5G),can effectively increase the capacity of 5G *** optimization problem proposed in this paper aims to maximize the number of secondary users(SUs)accessing the system and the total throughput in the *** the constraints of total power,minimum rate,interference and SINR,CRN-NOMA throughput is maximized by allocating optimal transmission ***,for the situation of multiple sub-users,an adaptive optimization method is proposed to reduce the complexity of the optimization ***,for the optimization problem of nonlinear programming,a maximization throughput optimization algorithm based on Chebyshev and convex(MTCC)for CRN-NOMA is proposed,which converts multi-objective optimization problem into single-objective optimization problem to *** the same time,the convergence and time complexity of the algorithm are *** analysis and simulation results show that the algorithm can effectively improve the system *** terms of interference and throughput,the performance of the sub-optimal solution is better than that of orthogonal-frequency-division-multiple-access(OFDMA).This paper provides important insights for the research and application of NOMA in future communications.

关键词： Resource allocation non-orthogonal multiple access cognitive radio network throughput maximization Chebyshev convex

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：