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

SSRN 2024年

作者： Guo, Wenzhong Wang, Hanling Ke, Xiao Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fujian Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou University Fuzhou350116 China

Stereoscopic images usually consist of a left view, a right view, and depth information. Stereoscopic/3D image quality assessment (SIQA) is often more challenging compared to 2D-IQA due to the usual scene differences between left and right views and the complexity of the binocular vision fusion process. To address the problem of quality prediction bias of multi-distortion images, we investigated the visual physiology and the processing of visual information by the primary visual cortex of the human brain and proposed a no-reference stereoscopic image quality evaluation method. The method mainly includes an innovative end-to-end NR-SIQA neural network with a picture patch generation algorithm. The algorithm generates a saliency map by fusing the left and right views and then guides the image cropping in the database based on the saliency map. The proposed models are validated and compared based on publicly available databases. The results show that the model and algorithm together outperform the state-of-the-art NR-SIQA metric in the LIVE 3D database and the WIVC 3D database, and have excellent results in the specific noise metric. The model generalization experiments demonstrate a certain degree of generality of our proposed model. © 2024, The Authors. All rights reserved.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

An object detection network for locating and recognizing cluttered garbage 23

An object detection network for locating and recognizing clu...

引用

Proceedings of the 2023 11th International Conference on information Technology: IoT and Smart City

作者： Guanjun Ji Shuxin Liu SHANGHAI DIANJI UNIVERSITY SCHOOL OF ELECTRICAL ENGINEERINGShangHai?China China SHANGHAI DIANJI UNIVERSITY SCHOOL OF ELECTRICAL ENGINEERINGShangHai China and The Key Laboratory of Cognitive Computing and Intelligent Information Processing of Fujian Education Institutions?Wuyi University??Fujian?China China

ISBN: (纸本)9798400709043

The research on garbage classification have made remarkable achievements in the latest work. However, due to the complexity of the location elements of the garbage background, there are still many difficulties in the accuracy of garbage location detection. For complex backgrounds, it is easy to cause false detection and missed detection. In response to the above problems, we explored the improved YOLOv5n network , added the ContextAggregation module and replaced GIOU with Focal-EIOU, and replaced C3 with C3SAC to improve feature extraction for contextual information. The improved algorithm has been proved by experiments to increase mAP by 2.3%. The accuracy rate of Plastic bowl, Power banks, Cardboard boxes, Tea leaves, Plastic hangers and so on has reached more than 80%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Traffic Engineering in Hybrid Software Defined networks: A Multi-agent Reinforcement Learning Framework

arXiv

引用

arXiv 2023年

作者： Guo, Yingya Tang, Qi Ma, Yulong Tian, Han Chen, Kai The College of Computer and Data Science Fuzhou University China The Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China The Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fujian 350003 China The Department of Computer Science & Engineering Hong Kong University of Science & Technology Hong Kong

Traffic Engineering (TE) is an efficient technique to balance network flows and thus improves the performance of a hybrid Software Defined network (SDN). Previous TE solutions mainly leverage heuristic algorithms to centrally optimize link weight setting or traffic splitting ratios under the static traffic demand. Note that as the network scale becomes larger and network management gains more complexity, it is notably that the centralized TE methods suffer from a high computation overhead and a long reaction time to optimize routing of flows when the network traffic demand dynamically fluctuates or network failures happen. To enable adaptive and efficient routing in TE, we propose a Multi-agent Reinforcement Learning method CMRL that divides the routing optimization of a large network into multiple small-scale routing decision-making problems. To coordinate the multiple agents for achieving a global optimization goal, we construct an interactive environment for training the routing agents that own partial link utilization observations. To optimize credit assignment of multi-agent, we introduce the difference reward assignment mechanism for encouraging agents to take better action. Extensive simulations conducted on the real traffic traces demonstrate the superiority of CMRL in improving TE performance, especially when traffic demands change or network failures happen. Copyright © 2023, The Authors. All rights reserved.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Heterophilic Graph Representation Learning Based on Multi-Order information Extraction and High and Low Pass Filters

Heterophilic Graph Representation Learning Based on Multi-Or...

引用

Smart World Congress (SWC), IEEE

作者： Ling Wu Xinyu Li Yingjie Yang Kun Guo Qishan Zhang College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China School of Computer Science and Informatics De Montfort University Leicester England College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (数字)9798331520861

ISBN: (纸本)9798331520878

Real-world networks can be divided into homophilic and heterophilic graphs. Significantly, many nodes tend to be heterophilic in a homophilic graph. Graph representation learning in heterophilic graphs has attracted considerable significance in recent years as it breaks the homophily assumption and achieves higher-quality graph embeddings. However, existing heterophilic graph representation learning methods often mix attribute and topological information, neglecting the mutual exclusion between attribute information and topological information. Furthermore, algorithms in heterogeneous graphs usually rely on specific matrix structures to capture high-order information, which may restrict the applicability of these methods. To tackle these issues, this paper proposes a GNN-based strategy for Heterophilic graph Representation Learning based on Multi-order information extraction and High and Low pass filters (HRLMHL). First, we designed two relatively independent modules to learn attribute information and topological information, respectively, to address the issue of mismatch. Second, we built a multi-order information extraction module to extract multi-order similarity features, thereby achieving the learning of high-order graph information. Experiments on real datasets show that the node classification accuracy is superior to that of the state-of-the-art methods on most datasets.

关键词： Representation learning Accuracy Low-pass filters information retrieval Feature extraction Graph neural networks Topology Data mining Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-Channel Contrastive Graph Convolutional network with Graph and Feature Fusion

SSRN

引用

SSRN 2023年

作者： Zhong, Luying Lu, Jielong Chen, Zhaoliang Song, Na Wang, Shiping College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Mechanical Electrical and Information Engineering Putian University Putian351100 China

Multi-view semi-supervised classification is an attractive topic in real-world applications. Due to the powerful capability of gathering information from neighbors, Graph Convolutional network (GCN) has become a hotspot in the classification task. However, most multi-view classification works based on GCN only assign weights for feature fusion, and directly consider the weighted sum of the adjacency matrices, ignoring the interaction and correlation among features. These may be problematic because aggregating the matrices from less relevant views may destroy the original topology space, leading to undesired performance. To address these issues, this paper proposes an Adaptive Multi-Channel Graph Convolutional network (AMC-GCN). To extract the interactive information, AMC-GCN designs a deep interactive feature integration network to incorporate consensus and complementary information. To fuse the graph structures, AMC-GCN exploits the relevance between views and imposes an adjacency matrix fusion network to construct multiple GCN channels, thereby delivering valuable information from relevant graphs. To enhance the homogeneity of the framework, AMC-GCN applies a contrastive loss to joint learning during the optimization for classification. With these techniques, AMC-GCN exploits relevant and interactive information between views to promote graph and feature fusion. Extensive experimental results on real-world datasets demonstrate the superiority of the proposed algorithm. © 2023, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

SCESP: An Edge Server Placement Method Based on Spectral Clustering in Mobile Edge computing 8th

SCESP: An Edge Server Placement Method Based on Spectral Cl...

引用

8th International Conference on Artificial Intelligence and Security , ICAIS 2022

作者： Wang, Lijuan Guo, Yingya Yao, Jiangyuan Zhou, Siyu College of Computer and Data Science Fuzhou University Fuzhou350000 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350000 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350003 China School of Computer Science and Cyberspace Security Hainan University Haikou570228 China Tandon School of Engineering New York University New York10012 United States

ISBN: (纸本)9783031067600

With the rapid development of Internet of Things (IoT) and 5G, mobile edge computing is gaining popularity for its low computation latency, bandwidth costs and energy consumption. In mobile edge computing, the placement of edge servers is one of the most significant problems and attracts worldwide attention. However, two major problems of edge server placement: high access delay and unbalanced workload of edge servers, have not been completely solved yet. To better solve these two problems, this paper proposes a new Spectral-Clustering-based Edge Server Placement (SCESP) algorithm, which can effectively reduce the access delay and make the workload of each edge server more balanced. In the evaluation, we use the Shanghai Telecom’s base station dataset to test the performance of SCESP and extensive experiments demonstrate the superior performance of SCESP in reducing the access delay and balancing the edge server workload. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

High-Level Synthesis for Microfluidic Biochips Considering Actual Volume Management and Channel Storage

High-Level Synthesis for Microfluidic Biochips Considering A...

引用

IEEE International Symposium on Quality Electronic Design

作者： Zhengyang Chen Yuhan Zhu Zhen Chen Zhisheng Chen Genggeng Liu College of Computer and Data Science Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing (Fuzhou University) Fuzhou China School of Informatics Xiamen University Xiamen China

ISBN: (数字)9798350309270

ISBN: (纸本)9798350309287

In recent years, microfluidic biochips have been widely applied in various fields of human society. The emergence of distributed channel-storage architecture enables fluid to be directly cached within the flow channels without being transported to the dedicated storage. However, the volume of the flow channels is limited, it is important to carefully consider the fluid volume to be cached to ensure it can be accommodated within the appropriate flow channels. In this paper, we propose a high-level synthesis method considering actual volume management and channel storage through integer linear programming, providing a rational analysis of fluid caching and the temporal relationships between different fluid-handling tasks. Experimental results conducted on multiple benchmark tests demonstrate the effectiveness of the proposed method in reducing the completion time of bioassay, the number of caches, the maximum fluid caching volume, and the number of fluid-handling tasks.

关键词： Fluids Biochips Estimation Cells (biology) Integer linear programming Benchmark testing Task analysis

来源：评论

学校读者我要写书评

暂无评论

Blockchain and Trusted Reputation Assessment-Based Incentive Mechanism for Healthcare Services

SSRN

引用

SSRN 2023年

作者： Liu, Yanhua Liu, Zhihuang Zhang, Qiu Su, Jinshu Li, Xiaoyan College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer National University of Defense Technology Changsha410073 China

Blockchain-based healthcare IoT technology research promotes increased security for smart healthcare services such as real-time monitoring and remote disease diagnosis. In a healthcare IoT service system, it remains a challenging problem to explore effective incentive mechanisms throughout the healthcare service process and feedback to facilitate the efficiency of the blockchain consensus process. In this paper, we propose a blockchain and trusted reputation assessment-based incentive mechanism for healthcare services (BtRaI). BtRaI provides a realistic and comprehensive reputation assessment with feedback to motivate blockchain consensus node participation, effectively defending against malicious behavior in the healthcare service system. Specifically, BtRaI first introduces multiple moderation factors for comprehensive multidimensional reputation assessment and stores the assessment results credibly on the blockchain. Then, we propose an improved PBFT algorithm based on the reputation assessment to enhance blockchain consensus efficiency. Finally, BtRaI designs a token reward and punishment mechanism to motivate all parties to participate in the blockchain honestly, inhibit potential misbehavior, and encourage the healthcare system to provide better service quality. Theoretical analysis and experimental evaluation demonstrate that BtRaI effectively suppresses malicious attacks in healthcare services, improves blockchain node failure tolerance rates, and achieves blockchain transaction processing efficiency within 0.5 seconds in a 100-node consortium chain. The reputation assessment and token incentive mechanism of BtRaI have a realistic differentiation granularity and change curve, making it suitable for dynamic and complex healthcare service scenarios. © 2023, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Collaboration for Vehicular Task Offloading Using Federated Deep Reinforcement Learning

引用

IEEE Transactions on Mobile computing 2025年

作者： Chen, Xing Xiao, Bohuai Lin, Xinyu Chen, Zheyi Min, Geyong Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science ExeterEX4 4QF United Kingdom

Mobile Edge computing (MEC) distributes resources such as computing, storage, and bandwidth to the side close to users, which can provide low-latency services to in-vehicle users, thus promising a more efficient and safer driving environment. However, due to the dynamic scale of vehicle and the variability of resource requirements, it is a significant challenge to quickly obtain effective task offloading in large-scale vehicle scenarios. The existing studies generally adopt the centralized decision-making method, with long decision-making time and high computational overhead, which cannot effectively achieve good offloading decisions in large-scale scenarios. To address these problems, we propose a Multi-agent Collaborative Method for vehicular task offloading using Federated Deep Reinforcement Learning called MCM-FDRL. First, each vehicle as an agent, independently makes offloading decisions based on local information. Next, the offloading decision model of each vehicle is obtained through federated reinforcement learning training. At runtime, an effective vehicle offloading plan can be gradually developed through multi-agent collaboration. Using two real-world datasets, experiments show that the MCM-FDRL has good adaptability and scalability. Moreover, compared to the state-of-the-art methods, the task's average response time of the MCM-FDRL is reduced by 9.75%-64.90%, respectively. © 2002-2012 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：