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

A Client Selection Method Based on Loss Function Optimization for Federated Learning

computer Modeling in engineering & sciences 2023年第10期137卷 1047-1064页

作者： Yan Zeng Siyuan Teng Tian Xiang Jilin Zhang Yuankai Mu Yongjian Ren Jian Wan School of Computer Science and Technology Hangzhou Dianzi UniversityHangzhou310018China Key Laboratory of Complex System Modeling and Simulation Ministry of EducationHangzhou310018China Zhejiang Engineering Research Center of Data Security Governance Hangzhou310018China Intelligent Robotics Research Center Zhejiang LabHangzhou311100China HDU-ITMO Joint Institute Hangzhou Dianzi UniversityHangzhou310018China

Federated learning is a distributedmachine learningmethod that can solve the increasingly serious problemof data islands and user data privacy,as it allows training data to be kept locally and not shared with other *** trains a globalmodel by aggregating locally-computedmodels of clients rather than their ***,the divergence of local models caused by data heterogeneity of different clients may lead to slow convergence of the global *** this problem,we focus on the client selection with federated learning,which can affect the convergence performance of the global model with the selected local *** propose FedChoice,a client selection method based on loss function optimization,to select appropriate local models to improve the convergence of the global *** firstly sets selected probability for clients with the value of loss function,and the client with high loss will be set higher selected probability,which can make them more likely to participate in ***,it introduces a local control vector and a global control vector to predict the local gradient direction and global gradient direction,respectively,and calculates the gradient correction vector to correct the gradient direction to reduce the cumulative deviationof the local gradient causedby *** experiments to verify the validity of FedChoice on CIFAR-10,CINIC-10,MNIST,EMNITS,and FEMNIST datasets,and the results show that the convergence of FedChoice is significantly improved,compared with FedAvg,FedProx,and FedNova.

关键词： Federated learning model aggregation Non-IID

来源：评论

学校读者我要写书评

暂无评论

SharDAG: Scaling DAG-Based Blockchains Via Adaptive Sharding 40

SharDAG: Scaling DAG-Based Blockchains Via Adaptive Sharding

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Cheng, Feng Xiao, Jiang Liu, Cunyang Zhang, Shijie Zhou, Yifan Li, Bo Li, Baochun Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab China Hong Kong University of Science and Technology Hong Kong University of Toronto Canada

ISBN: (纸本)9798350317152

Directed Acyclic Graph (DAG)-based blockchain (a.k.a distributed ledger) has become prevalent for supporting highly concurrent applications. Its inherent parallel data structure accelerates block generation significantly, shifting the bottleneck from performance to storage scalability. An intuitive solution is to apply state sharding that divides the entire ledger (i.e., transactions and states) into multiple shards. While each node only stores proportional transactions, it suffers from the challenges of storing and ensuring the processing consistency of cross-shard transactions. In this paper, we propose SharDAG, a new mechanism that leverages adaptive sharding for DAG-based blockchains to achieve high performance and strong consistency. The key idea of SharDAG is to exploit unique characteristics -silent assets -and design a lightweight processing mechanism based on avatar account caching. Furthermore, we design a Byzantine resilient cross-shard verification mechanism with a theoretically optimal number of participating nodes, which guarantees the consistency and security of avatar account aggregation. Our comprehensive evaluations on real-world workloads demonstrate that SharDAG presents up to 3.8 x throughput improvement compared to the state-of-the-art and reduces the storage overhead of cross-shard transactions. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Temporal-Aware Multimodal Feature Fusion for Sentiment Analysis 4

Temporal-Aware Multimodal Feature Fusion for Sentiment Analy...

引用

4th Multimodal Sentiment Analysis Challenge and Workshop, MuSe 2023, In conjunction with ACM Multimedia 2023

作者： Li, Qi Tang, Shulei Zhang, Feixiang Wang, Ruotong Xu, Yangyang Zhao, Zhuoer Sun, Xiao Wang, Meng AHU-IAI AI Joint Laboratory Anhui University HeFei China Institute of Advanced Technology University of Science and Technology of China HeFei China School of Computer Science and Information Engineering Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center ZhongJuYuan Intelligent Technology Co Ltd HeFei China School of Computer Science and Information Engineering Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center HeFei China

ISBN: (纸本)9798400702709

In this paper, we present a solution to the MuSe-Personalisation sub-challenge in the Multimodal Sentiment Analysis Challenge 2023. The task of MuSe-Personalisation aims to predict a time-continuous emotional value (i.e., arousal and valence) by using multimodal data. The MuSe-Personalisation sub-challenge faces the individual variations problem, resulting in poor generalization on unknown test sets. To solve the above problem, we first extract several informative visual features, and then propose a framework containing feature selection, feature learning and fusion strategy to discover the best combination of features for sentiment analysis. Finally, our method achieved the Top 1 performance in the MuSe-Personalisation sub-challenge, and the result in the combined CCC of physiological arousal and valence was 0.8681, outperforming the baseline system by a large margin (i.e., 10.42%) on the test set. © 2023 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

CiRLExplainer: Causality-Inspired Explainer for Graph Neural Networks via Reinforcement Learning

引用

IEEE Transactions on Neural Networks and Learning Systems 2025年第6期36卷 9970-9984页

作者： Wenya Hu Jia Wu Quan Qian School of Computer Engineering and Science Shanghai University Shanghai China School of Computing Macquarie University Sydney NSW Australia School of Computer Engineering and Science the Center of Materials Informatics and Data Science Materials Genome Institute the Key Laboratory of Silicate Cultural Relics Conservation Ministry of Education and Shanghai Institute for Advanced Communication and Data Science Shanghai University Shanghai China

In this article, we propose a new graph neural network (GNN) explainability model, CiRLExplainer, which elucidates GNN predictions from a causal attribution perspective. Initially, a causal graph is constructed to analyze the causal relationships between the graph structure and GNN predicted values, identifying node attributes as confounding factors between the two. Subsequently, a backdoor adjustment strategy is employed to circumvent these confounders. Additionally, since the edges within the graph structure are not independent, reinforcement learning is incorporated. Through a sequential selection process, each step evaluates the combined effects of an edge and the previous structure to generate an explanatory subgraph. Specifically, a policy network predicts the probability of each candidate edge being selected and adds a new edge through sampling. The causal effect of this action is quantified as a reward, reflecting the interactivity among edges. By maximizing the policy gradient during training, the reward stream of the edge sequence is optimized. The CiRLExplainer is versatile and can be applied to any GNN model. A series of experiments was conducted, including accuracy (ACC) analysis of the explanation results, visualization of the explanatory subgraph, and ablation studies considering node attributes as confounding factors. The experimental results demonstrate that our model not only outperforms current state-of-the-art explanation techniques, but also provides precise semantic explanations from a causal perspective. Additionally, the experiments validate the rationale for considering node attributes as confounding factors, thereby enhancing the explanatory power and ACC of the model. Notably, across different datasets, our explainer achieved improvements over the best baseline models in the ACC-area under the curve (AUC) metrics by 5.89%, 5.69%, and 4.87%, respectively.

关键词： Predictive models Graph neural networks Reinforcement learning Accuracy Training Prediction algorithms Analytical models Sustainable development Focusing data science

来源：评论

学校读者我要写书评

暂无评论

JTMA: Joint Multimodal Feature Fusion and Temporal Multi-head Attention for Humor Detection 4

JTMA: Joint Multimodal Feature Fusion and Temporal Multi-hea...

引用

4th Multimodal Sentiment Analysis Challenge and Workshop, MuSe 2023, In conjunction with ACM Multimedia 2023

作者： Li, Qi Xu, Yangyang Zhao, Zhuoer Tang, Shulei Zhang, Feixiang Wang, Ruotong Sun, Xiao Wang, Meng AHU-IAI AI Joint Laboratory Anhui University HeFei China Institute of Advanced Technology University of Science and Technology of China HeFei China School of Computer Science and Information Engineering Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center ZhongJuYuan Intelligent Technology Co Ltd HeFei China School of Computer Science and Information Engineering Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center HeFei China

ISBN: (纸本)9798400702709

In this paper, we propose a model named Joint multimodal feature fusion and Temporal Multi-head Attention (JTMA) to solve the MuSe-Humor sub-challenge in Multimodal Sentiment Analysis Challenge 2023. The goal of MuSe-Humor sub-challenge is to predict whether humor occurs in the given dataset that includes data from multiple modalities (e.g., text, audio and video). The cross-cultural testing presents a new challenge that makes it different from the previous years. To solve the above problems, the proposed model JTMA firstly uses a 1-D CNN to aggregate temporal information within the unimodal feature. Then the interactions of inter-modality and intra-modality are performed by the multimodal feature encoder module. Finally, we integrate the high-level representations learned from multiple modalities to accurately predict humor. The effectiveness of our proposed model is demonstrated through experimental results obtained on the official test set. Our model achieves an impressive AUC score of 0.8889, surpassing the performance of all other participants in the competition, and securing the Top 1 ranking. © 2023 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Multi-Trip Routing for Municipal Solid Waste Collection by Contribution-Based Adaptive Particle Swarm Optimization

引用

Complex System Modeling and Simulation 2023年第3期3卷 202-219页

作者： Xiaoning Shen Hongli Pan Zhongpei Ge Wenyan Chen Liyan Song Shuo Wang Collaborative Innovation Center of Atmospheric Environment and Equipment Technology and also with the Jiangsu Key Laboratory of Big Data Analysis TechnologySchool of AutomationNanjing University of Information Science and TechnologyNanjing 210044China School of Automation Nanjing University of Information Science and TechnologyNanjing 210044China Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation the Department of Computer Science and EngineeringSouthern University of Science and TechnologyShenzhen 518055China School of Computer Science University of BirminghamBirminghamB152TTUK

Waste collection is an important part of waste management *** costs and carbon emissions can be greatly reduced by proper vehicle ***,each vehicle can work again after achieving its capacity limit and unloading the *** this,an energy-efficient multi-trip vehicle routing model is established for municipal solid waste collection,which incorporates practical factors like the limited capacity,maximum working hours,and multiple trips of each *** both economy and environment,fixed costs,fuel costs,and carbon emission costs are minimized *** solve the formulated model effectively,contribution-based adaptive particle swarm optimization is *** strategies named greedy learning,multi-operator learning,exploring learning,and exploiting learning are specifically designed with their own searching *** assessing the contribution of each learning strategy during the process of evolution,an appropriate one is selected and assigned to each individual adaptively to improve the searching efficiency of the ***,an improved local search operator is performed on the trips with the largest number of waste sites so that both the exploiting ability and the convergence accuracy of the algorithm are *** of the proposed algorithm is tested on ten waste collection instances,which include one real-world case derived from the Green Ring Company of Jiangbei New District,Nanjing,China,and nine synthetic instances with increasing scales generated from the commonly-used capacitated vehicle routing problem benchmark *** with five state-of-the-art algorithms show that the proposed algorithm can obtain a solution with a higher accuracy for the constructed model.

关键词： municipal solid waste collection energy conservation multi-trip contribution particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Bag of Freebies Techniques to Improve Face Detection Accuracy for Small Faces

Bag of Freebies Techniques to Improve Face Detection Accurac...

引用

Iranian Conference on Electrical engineering (ICEE)

作者： Nahid Seyed Ebrahimian Azadeh Ashouri Reza Akhoundzade Mohammad Reza Mohammadi PART AI Research Center Tehran Iran School of Computer Engineering Iran University of Science and Technology Tehran Iran

ISBN: (数字)9798350376340

ISBN: (纸本)9798350376357

Face detection is a primary and essential task in the domain of face recognition and identification, serving as the initial and crucial step in the process. There are several models for face detection, such as RetinaFace, Yolov5-Face, and SCRFD. The best model can vary based on specific criteria such as accuracy, speed, memory efficiency, and suitability for different applications. Among these face detection models, the SCRFD model has the most optimal trade-off between speed and accuracy, which makes it a popular and suitable model for face detection applications. However, in the real world, extracting meaningful features and detecting small faces in surveillance videos can be challenging due to the low resolution. In this research, we focus on enhancing the accuracy of the SCRFD(Sample and Computation Redistribution for Efficient Face Detection) model on small faces. We conduct a comprehensive enhancement using multiple strategies, including expanding the dataset, adjusting input shape during training time, tuning weight decay, optimizing the learning rate scheduler, and testing different augmentations. By analyzing these factors systematically, we achieved mAP of 69.88% and 85.23% at 640 × 640 and 1280 × 1280 resolutions respectively in the Hard dataset, which outperforms the original SCRFD by 0.39% and 1.58%.

关键词： Training Accuracy Shape Face recognition Computational modeling Feature extraction Face detection

来源：评论

学校读者我要写书评

暂无评论

GANs-guided Conditional Diffusion Model for Synthesizing Contrast-enhanced Computed Tomography Images 46

GANs-guided Conditional Diffusion Model for Synthesizing Con...

引用

46th Annual International Conference of the IEEE engineering in Medicine and Biology Society, EMBC 2024

作者： Yang, Yulin Liu, Jing Chen, Qingqing Li, Yinhao Han, Xian-Hua Hu, Hongjie Lin, Lanfen Chen, Yen-Wei Ritsumeikan University Gradate School of Information Science and Engineering Shiga Japan Zhejiang Lab. Research Center for Healthcare Data Science Hangzhou China Zhejiang University School of Medicine Department of Radiology Sir Run Run Shaw Hospital Hangzhou China Ritsumeikan University College of Information Science and Engineering Shiga Japan Yamaguchi University Artificial Intelligence Research Center Yamaguchi Japan Zhejiang University College of Computer Science and Technology Hangzhou China

ISBN: (纸本)9798350371499

In contrast to non-contrast computed tomography (NC-CT) scans, contrast-enhanced (CE) CT scans can highlight discrepancies between abnormal and normal areas, commonly used in clinical diagnosis of focal liver lesions. However, the use of contrast agents in CE-CT scans imposes significant physical and economic burdens on patients in clinical practice. Recently, Generative Adversarial Networks (GANs)-based synthesis models offer an alternative approach that obtains CE-CT images from NC-CT images. However, poor coverage and mode collapse greatly limit their performance. Diffusion models (DMs)-based methods have demonstrated superior performance in natural image synthesis tasks. Nevertheless, our experiment shows that CE-CT images synthesized from DMs-based method exhibit higher overall quality but lower local quality. The quality of local areas, particularly those related to lesion areas, is crucial in medical image synthesis tasks. Hence, we propose a GANs-guided conditional diffusion model (GANs-CDM), combining the GANs and conditional diffusion model (CDM), to generate CECT images. In the proposed GANs-CDM, the GANs is to generate a preliminary CE-CT image, serving as conditional input for guiding the subsequent CDM to produce refined CE-CT images. Qualitative and quantitative evaluation on arterial and portal venous phase synthesis tasks demonstrates that our proposed GANs-CDM can significantly improve both the local and global quality of synthetic images. © 2024 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Novelty of Different Distance Approach for Multi-Criteria Decision-Making Challenges Using q-Rung Vague Sets

引用

computer Modeling in engineering & sciences 2024年第6期139卷 3353-3385页

作者： Murugan Palanikumar Nasreen Kausar Dragan Pamucar Seifedine Kadry Chomyong Kim Yunyoung Nam Saveetha School of Engineering Saveetha Institute of Medical and Technical SciencesChennai602105India Department of Mathematics Faculty of Arts and ScienceYildiz Technical UniversityEsenlerIstanbul34220Turkey Department of Operations Research and Statistics Faculty of Organizational SciencesUniversity of BelgradeBelgrade11000Serbia College of Engineering Yuan Ze UniversityTaoyuan City320315TaiwanChina Department of Applied Data Science Noroff University CollegeKristiansand4612Norway Artificial Intelligence Research Center(AIRC) Ajman UniversityAjman346United Arab Emirates Department of Electrical and Computer Engineering Lebanese American UniversityByblos1102-2801Lebanon ICT Convergence Research Center Soonchunhyang UniversityAsan31538South Korea Department of Computer Science and Engineering Soonchunhyang UniversityAsan31538South Korea

In this article,multiple attribute decision-making problems are solved using the vague normal set(VNS).It is possible to generalize the vague set(VS)and q-rung fuzzy set(FS)into the q-rung vague set(VS).A log q-rung normal vague weighted averaging(log q-rung NVWA),a log q-rung normal vague weighted geometric(log q-rung NVWG),a log generalized q-rung normal vague weighted averaging(log Gq-rung NVWA),and a log generalized q-rungnormal vagueweightedgeometric(logGq-rungNVWG)operator are discussed in this *** is provided of the scoring function,accuracy function and operational laws of the log q-rung *** algorithms underlying these functions are also described.A numerical example is provided to extend the Euclidean distance and the Humming ***,idempotency,boundedness,commutativity,and monotonicity of the log q-rung VS are examined as they facilitate recognizing the optimal alternative more quickly and help clarify *** chose five anemia patients with four types of symptoms including seizures,emotional shock or hysteria,brain cause,and high fever,who had either retrograde amnesia,anterograde amnesia,transient global amnesia,post-traumatic amnesia,or infantile *** numbers q are used to express the results of the *** demonstrate the effectiveness and accuracy of the models we are investigating,we compare several existing models with those that have been developed.

关键词： Vague set aggregating operators euclidean distance hamming distance decision making

来源：评论

学校读者我要写书评

暂无评论

RailPC: A large-scale railway point cloud semantic segmentation dataset

引用

CAai Transactions on Intelligence Technology 2024年第6期9卷 1548-1560页

作者： Tengping Jiang Shiwei Li Qinyu Zhang Guangshuai Wang Zequn Zhang Fankun Zeng Peng An Xin Jin Shan Liu Yongjun Wang Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application Nanjing Normal UniversityNanjingChina Technology Innovation Center for Integrated Applications in Remote Sensing and Navigation Ministry of Natural ResourcesNanjingChina Eastern Institute of Technology(EIT) NingboChina Tianjin Key Laboratory of Rail Transit Navigation Positioning and Spatio-temporal Big Data Technology TianjinChina College of Computer Science and Engineering Northwest Normal UniversityLanzhouChina Mckelvey School of Engineering Washington University in St.LouisSt.LouisMissouriUSA School of Electronic and Information Engineering Ningbo University of TechnologyNingboChina

Semantic segmentation in the context of 3D point clouds for the railway environment holds a significant economic value,but its development is severely hindered by the lack of suitable and specific ***,the models trained on existing urban road point cloud datasets demonstrate poor generalisation on railway data due to a large domain gap caused by non-overlapping special/rare categories,for example,rail track,track bed *** harness the potential of supervised learning methods in the domain of 3D railway semantic segmentation,we introduce RailPC,a new point cloud *** provides a large-scale dataset with rich annotations for semantic segmentation in the railway ***,RailPC contains twice the number of annotated points compared to the largest available mobile laser scanning(MLS)point cloud dataset and is the first railway-specific 3D dataset for semantic *** covers a total of nearly 25 km railway in two different scenes(urban and mountain),with 3 billion points that are finely labelled as 16 most typical classes with respect to railway,and the data acquisition process is completed in China by MLS *** extensive experimentation,we evaluate the performance of advanced scene understanding methods on the annotated dataset and present a synthetic analysis of semantic segmentation *** on our findings,we establish some critical challenges towards railway-scale point cloud semantic *** dataset is available at https://***/NNU-GISA/GISA-RailPC,and we will continuously update it based on community feedback.

关键词： data benchmark MLS point clouds railway scene semantic segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：