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

TEVA: Training-Efficient and Verifiable Aggregation for Federated Learning for Consumer Electronics in Industry 5.0

IEEE Transactions on Consumer Electronics 2024年

作者： Xia, Yuanjun Liu, Yining Chen, Jingxue Liang, Yangfan Khan, Fazlullah Alturki, Ryan Wang, Xiaopei Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software School of Computer and Information Security Guilin541004 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325027 China University of Technology School of Mathematical and Physical Sciences SydneyNSW2007 Australia Jiaxing University Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems The Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province The Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing314001 China University of Nottingham Ningbo China School of Computer Science Faculty of Science and Engineering Zhejiang Ningbo315104 China Umm AI-Qura University Makkah Department of Software Engineering College of Computing Saudi Arabia Riverside Department of Computer Science and Engineering University of California CA92521 United States

Federated learning (FL) has been widely used for privacy-preserving model updates in Industry 5.0, facilitated by 6G networks. Despite FL's privacy-preserving advantages, it remains vulnerable to attacks where adversaries can infer private data from local models or manipulate the central server (CS) to deliver falsified global models. Current privacy-preserving approaches, primarily based on the FedAvg algorithm, fail to optimize training efficiency for non-independent and identically distributed (non-IID) data. This article proposes training-efficient and verifiable aggregation (TEVA) for FL to resolve these issues. This scheme combines threshold Paillier homomorphic encryption (TPHE), verifiable aggregation, and an optimized double momentum update mechanism (OdMum). TEVA not only leverages TPHE to protect the privacy of local models but also ensures the integrity of the global model through a verifiable aggregation mechanism. Additionally, TEVA integrates the OdMum algorithm to effectively address the challenges posed by non-IID data, promoting rapid model convergence and significantly enhancing overall training efficiency. Security analysis indicates that TEVA meets the requirements for privacy protection. Extensive experimental results demonstrate that TEVA can accelerate model convergence while incurring lower computational and communication overheads. © 1975-2011 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Using Machine Learning to Determine Preoperative Feasibility and Postoperative Outcomes in Liver Transplantation

引用

HPB 2023年 25卷 S562-S562页

作者： Gulla, A. Jakiunaite, I. Besselt, C. Strupas, K. Dzemyda, G. Vilnius University Surgery Vilnius Lithuania Vilnius University Faculty of Medicine Vilnius Lithuania Vilnius University Cognitive Computing Group Institute of Data Science and Digital Technologies Vilnius Lithuania

来源：评论

学校读者我要写书评

暂无评论

An Approach to Prevent Weight Manipulation by Minimum Adjustment and Maximum Entropy Method in Large-Scale Group Decision Making

SSRN

引用

SSRN 2022年

作者： Sun, Qi Wu, Jian Chiclana, Francisco Wang, Sha Herrera-Viedma, Enrique School of Economics and Management Shanghai Maritime University Shanghai201306 China Center for Artificial Intelligence and Decision Sciences Shanghai Maritime University Shanghai201306 China Institute of Artificial Intelligence Faculty of Computing Engineering and Media De Montfort University Leicester United Kingdom Andalusian Research Institute in Data Science and Computational Intelligence Dept. of Computer Science and AI University of Granada Granada18071 Spain Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia

This paper proposes a theoretical framework to prevent weight manipulation in large-scale group decision making (LSGDM). Firstly, a community detection based method is used to cluster the large group. The power relations of subgroups are measured by the rights index (RI), which depends on the subgroups size and cohesion. Then, a minimum adjustment feedback model with maximum entropy is proposed to prevent subgroups’manipulation behavior. The minimum adjustment rule aims for ‘effificiency’ while the maximum entropy rule aims for ‘justice’. Consequently, by keeping a balance between ‘effificiency’ and ‘justice’ in the mechanism of assigning weights, the rationality of weight allocation to reach consensus effificiently can be ensured. Detailed numerical and simulation analyses are carried out to verify the validity of the proposed method. © 2022, The Authors. All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

A Survey on Indoor Visible Light Positioning Systems: Fundamentals, Applications, and Challenges

arXiv

引用

arXiv 2024年

作者： Zhu, Zhiyu Yang, Yang Chen, Mingzhe Guo, Caili Cheng, Julian Cui, Shuguang The Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China The Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China The Faculty of Applied Science School of Engineering The University of British Columbia KelownaBCV1V 1V7 Canada The Chinese University of Hong Kong Shenzhen518172 China

The growing demand for location-based services in areas like virtual reality, robot control, and navigation has intensified the focus on indoor localization. Visible light positioning (VLP), leveraging visible light communications (VLC), becomes a promising indoor positioning technology due to its high accuracy and low cost. This paper provides a comprehensive survey of VLP systems. In particular, since VLC lays the foundation for VLP, we first present a detailed overview of the principles of VLC. Then, we provide an in-depth overview of VLP algorithms. The performance of each positioning algorithm is also compared in terms of various metrics such as accuracy, coverage, and orientation limitation. Beyond the physical layer studies, the network design for a VLP system is also investigated, including multi-access technologies, resource allocation, and light-emitting diode (LED) placements. Next, the applications of the VLP systems are overviewed. Finally, this paper outlines open issues, challenges, and opportunities for the research field. In a nutshell, this paper constitutes the first holistic survey on VLP from state-of-the-art studies to practical uses. Copyright © 2024, The Authors. All rights reserved.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Investigating effective transfer of deep learning models from adults to children for lung ultrasound data analysis

Investigating effective transfer of deep learning models fro...

引用

IEEE Symposium (IUS) Ultrasonics

作者： Russell Thompson Umair Khan Jason Li Lauren. P. Etter Ingrid Camello Rachel. C. Pieciak Ilse. Castro-Aragon Bindu Setty Christopher. C. Gill Libertario Demi Margrit Betke University of Massachusetts Dartmouth MA USA Department of Information Engineering & Computer Science University of Trento TN Italy The Faculty of Computing & Data Sciences Boston University Boston MA USA University of Wisconsin Madison Madison WI USA Pediatric Infectious Disease Augusta University Augusta GA USA Department of Global Health Boston University School of Public Health Boston MA USA Department of Radiology Boston Medical Center Boston MA USA

Automated assessment of LUS data from adult population is an ongoing research over the last few years. To this extent, various deep learning DL-based methods have been proposed to assess lung alterations caused by pneumonia. However, no work has been done in this regard to evaluate the LUS data from children for the presence/absence of consolidations due to pneumonia. Pediatric healthcare data acquisition in a resource constraint environment is a challenging task. As a result of which limited data is acquired. This prevents the effective training of DL models for the development of reliable computer aided assessment systems. To address this challenge, we employed pre-trained DL models, previously trained on LUS data from adults, and evaluated them over LUS data from children in a transfer learning (TL) setting. Two TL strategies i.e. linear probing (LP) and fine-tuning (FT) are utilized. The models are trained and tested in a leave-one-out cross validation manner with results showing that all the pre-trained models achieved higher classification performance for FT in comparison to LP. Among the models it is found that with the addition of spatial attention and custom loss to the base CNN, the model outperformed with the highest mean F1-Score of 81.9%. While evaluating the model’s performance w.r.t age, it is found that the more accurate the model, the less impact of age has on the underlying classification performance. These findings lay down the foundation for accurate consolidation classification in LUS data from children in a resource constraint environment

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting risk of cardiovascular disease using retinal optical coherence tomography imaging

arXiv

引用

arXiv 2024年

作者： Maldonado-Garcia, Cynthia Bonazzola, Rodrigo Ferrante, Enzo Julian, Thomas H. Sergouniotis, Panagiotis I. Ravikumar, Nishant Frangi, Alejandro F. Centre for Computational Imaging and Simulation Technologies in Biomedicine School of Computing University of Leeds Leeds United Kingdom CONICET-UNL Santa Fe Argentina Division of Evolution Infection and Genomics School of Biological Sciences Faculty of Biology Medicine and Health University of Manchester Manchester United Kingdom Manchester Royal Eye Hospital Manchester University NHS Foundation Trust Manchester United Kingdom Manchester Centre for Genomic Medicine Saint Mary’s Hospital Manchester University NHS Foundation Trust Manchester United Kingdom Wellcome Genome Campus Cambridge United Kingdom Division of Informatics Imaging and Data Sciences School of Health Sciences Faculty of Biology Medicine and Health University of Manchester Manchester United Kingdom School of Computer Science Faculty of Science and Engineering University of Manchester Kilburn Building Manchester United Kingdom Christabel Pankhurst Institute University of Manchester Manchester United Kingdom NIHR Manchester Biomedical Research Centre Manchester Academic Health Science Centre Manchester United Kingdom

Cardiovascular diseases (CVD) are the leading cause of death globally. Non-invasive, cost-effective imaging techniques play a crucial role in early detection and prevention of CVD. Optical coherence tomography (OCT) has gained recognition as a potential tool for early CVD risk prediction, though its use remains underexplored. In this study, we investigated the potential of OCT as an additional imaging technique to predict future CVD events. We analysed retinal OCT data from the UK Biobank. The dataset included 612 patients who suffered a myocardial infarction (MI) or stroke within five years of imaging and 2,234 controls without CVD (total: 2,846 participants). A self-supervised deep learning approach based on Variational Autoencoders (VAE) was used to extract low-dimensional latent representations from high-dimensional 3D OCT images, capturing distinct features of retinal layers. These latent features, along with clinical data, were used to train a Random Forest (RF) classifier to differentiate between patients at risk of future CVD events (MI or stroke) and healthy controls. Our model achieved an AUC of 0.75, sensitivity of 0.70, specificity of 0.70, and accuracy of 0.70, outperforming the QRISK3 score (the third version of the QRISK cardiovascular disease risk prediction algorithm;AUC = 0.60, sensitivity = 0.60, specificity = 0.55, accuracy = 0.55). The choroidal layer in OCT images was identified as a key predictor of future CVD events, revealed through a novel model explainability approach. This study demonstrates that retinal OCT imaging is a cost-effective, non-invasive alternative for predicting CVD risk, offering potential for widespread application in optometry practices and hospitals. © 2024, CC BY-NC-ND.

关键词： Optical coherence tomography

来源：评论

学校读者我要写书评

暂无评论

Low latency FPGA implementation of twisted Edward curve cryptography hardware accelerator over prime field

arXiv

引用

arXiv 2025年

作者： Hossain, Md. Rownak Rahman, Md. Sazedur Zaman, Kh. Shahriya El Fezzani, Walid Bhuiyan, Mohammad Arif Sobhan Kang, Chia Chao JiaYew, Teh Miraz, Mahdi H. Khulna University of Engineering & Technology Khulna9203 Bangladesh Hajee Mohammad Danesh Science and Technology University Dinajpur Bangladesh Independent University Bangladesh Dhaka1229 Bangladesh Electrical and Electronic Engineering Department College of Engineering Gulf University Sanad26489 Bahrain School of Artificial Intelligence and Robotics Xiamen University Malaysia Selangor Sepang43900 Malaysia School of Computing and Data Science Xiamen University Malaysia Selangor Sepang43900 Malaysia School of Computing Faculty of Arts Science and Technology Wrexham University Wrexham United Kingdom Faculty of Computing Engineering and Science University of South Wales Swansea United Kingdom

The performance of any elliptic curve cryptography hardware accelerator significantly relies on the efficiency of the underlying point multiplication (PM) architecture. This article presents a hardware implementation of field-programmable gate array (FPGA) based modular arithmetic, group operation, and point multiplication unit on the twisted Edwards curve (Edwards25519) over the 256-bit prime field. An original hardware architecture of a unified point operation module in projective coordinates that executes point addition and point doubling within a single module has been developed, taking only 646 clock cycles and ensuring a better security level than conventional approaches. The proposed point multiplication module consumes 1.4 ms time, operating at a maximal clock frequency of 117.8 MHz utilising 164,730 clock cycles having 183.38 kbps throughput on the Xilinx Virtex-5 FPGA platform for 256-bit length of key. The comparative assessment of latency and throughput across various related recent works indicates the effectiveness of our proposed PM architecture. Finally, this high throughput and low latency PM architecture will be a good candidate for rapid data encryption in high-speed wireless communication networks. © 2025, CC BY-NC-ND.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

A novel binary modified beluga whale optimization algorithm using ring crossover and probabilistic state mutation for enhanced bladder cancer diagnosis

引用

Informatics in Medicine Unlocked 2024年 50卷

作者： Gharaibeh, Hasan Alawad, Noor Aldeen Nasayreh, Ahmad Al Mamlook, Rabia Emhamed Makhadmeh, Sharif Naser Bashkami, Ayah Abualigah, Laith Ezugwu, Absalom E. Computer Science Department Faculty of Information Technology and Computer Sciences Yarmouk University Irbid 21163 Jordan Department of Business Administration Trine University IN United States Department of Mechanical and Industrial Engineering University of Zawia Tripoli Libya Department of Information Technology King Abdullah II School of Information Technology The University of Jordan Amman 11942 Jordan Department Medical Laboratory Sciences – Faculty of Science Al Balqa Applied University Salt 19117 Jordan Department of Cyber Security and Cloud Computing Faculty of Information Technology Applied Science Private University Amman 11937 Jordan Artificial Intelligence and Sensing Technologies (AIST) Research Center University of Tabuk Tabuk 71491 Saudi Arabia Computer Science Department Al al-Bayt University Mafraq 25113 Jordan MEU Research Unit Middle East University Amman 11831 Jordan Applied science research center Applied science private university Amman 11931 Jordan Centre for Research Impact & Outcome Chitkara University Institute of Engineering and Technology Chitkara University Punjab Rajpura 140401 India Unit for Data Science and Computing North-West University 11 Hofman Street Potchefstroom 2520 South Africa Artificial Intelligence Research Center (AIRC) College of Engineering and Information Technology Ajman University Ajman P.O. Box 346 United Arab Emirates

Bladder cancer (BC) remains a significant global health challenge, requiring the development of accurate predictive models for diagnosis. In this study, a new Binary Modified White Whale Optimization (B-MBWO) algorithm is proposed to address the BC problem. The proposed method utilizes circular transitivity optimization and the Probabilistic State Mutation Algorithm (PSMA) to enhance its optimization performance. The new method is called the BBWORCPS algorithm. High-dimensional and complex medical datasets pose challenges to the original optimization algorithms in addressing the BC problem, motivating the proposed modifications to the original Beluga Whale Optimization algorithm. These enhancements, including quantum-inspired mutation and circular crossing, aim to improve solution space exploration and enhance the algorithm's effectiveness in handling intricate feature spaces. Through comprehensive experiments on BC datasets, the superiority of the BBWORCPS algorithm in terms of feature selection accuracy and computational efficiency is demonstrated compared to existing optimization methods. The obtained findings suggest that BBWORCPS offers a promising approach for developing more precise and reliable predictive models for bladder cancer analysis. © 2024 The Author(s)

关键词： Binary modified beluga whale optimization Bladder cancer Feature selection Machine learning Predictive modeling

来源：评论

学校读者我要写书评

暂无评论

ConTIG: Continuous representation learning on temporal interaction graphs

arXiv

引用

arXiv 2021年

作者： Yan, Xu Fan, Xiaoliang Yang, Peizhen Wu, Zonghan Pan, Shirui Chen, Longbiao Zang, Yu Wang, Cheng Fujian Key Laboratory of Sensing and Computing for Smart Cities School of Informatics Computer Science & Technology Department Xiamen University Xiamen China Centre for Artificial Intelligence FEIT University of Technology Sydney Australia Department of Data Science and AI Faculty of Information Technology Monash University Australia

—Representation learning on temporal interaction graphs (TIG) is to model complex networks with the dynamic evolution of interactions arising in a broad spectrum of problems. Existing dynamic embedding methods on TIG discretely update node embeddings merely when an interaction occurs. They fail to capture the continuous dynamic evolution of embedding trajectories of nodes. In this paper, we propose a two-module framework named ConTIG, a continuous representation method that captures the continuous dynamic evolution of node embedding trajectories. With two essential modules, our model exploit three-fold factors in dynamic networks which include latest interaction, neighbor features and inherent characteristics. In the first update module, we employ a continuous inference block to learn the nodes’ state trajectories by learning from time-adjacent interaction patterns between node pairs using ordinary differential equations. In the second transform module, we introduce a self-attention mechanism to predict future node embeddings by aggregating historical temporal interaction information. Experiments results demonstrate the superiority of ConTIG on temporal link prediction, temporal node recommendation and dynamic node classification tasks compared with a range of state-of-the-art baselines, especially for long-interval interactions prediction. © 2021, CC BY.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

CFAD: Coarse-to-Fine Action Detector for Spatiotemporal Action Localization 16th

CFAD: Coarse-to-Fine Action Detector for Spatiotemporal Acti...

引用

16th European Conference on Computer Vision, ECCV 2020

作者： Li, Yuxi Lin, Weiyao See, John Xu, Ning Xu, Shugong Yan, Ke Yang, Cong Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China Institute for Advanced Communication and Data Science Shanghai University Shanghai China Faculty of Computing and Informatics Multimedia University Cyberjaya Malaysia Adobe Research San Francisco United States Clobotics Shanghai China

ISBN: (纸本)9783030585167

Most current pipelines for spatio-temporal action localization connect frame-wise or clip-wise detection results to generate action proposals, where only local information is exploited and the efficiency is hindered by dense per-frame localization. In this paper, we propose Coarse-to-Fine Action Detector (CFAD), an original end-to-end trainable framework for efficient spatio-temporal action localization. The CFAD introduces a new paradigm that first estimates coarse spatio-temporal action tubes from video streams, and then refines the tubes location based on key timestamps. This concept is implemented by two key components, the Coarse and Refine Modules in our framework. The parameterized modeling of long temporal information in the Coarse Module helps obtain accurate initial tube estimation, while the Refine Module selectively adjusts the tube location under the guidance of key timestamps. Against other methods, the proposed CFAD achieves competitive results on action detection benchmarks of UCF101-24, UCFSports and JHMDB-21 with inference speed that is 3.3 faster than the nearest competitor. © 2020, Springer Nature Switzerland AG.

关键词： Tubes (components)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：