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

arXiv 2024年

作者： Islam, Sheikh Mohammed Shariful Abrar, Moloud Tegegne, Teketo Loranjo, Liliana Karmakar, Chandan Awal, Md Abdul Hossain, Md. Shahadat Kabir, Muhammad Ashad Mahmud, Mufti Khosravi, Abbas Siopis, George Moses, Jeban C. Maddison, Ralph Institute for Physical Activity and Nutrition Deakin University Melbourne Australia School of Information Technology Deakin University Melbourne Australia Westmead Applied Research Centre The University of Sydney Sydney Australia School of Electrical Engineering and Computer Science The University of Queensland Brisbane Australia School of Computer Data and Mathematical Sciences Western Sydney University Sydney Australia School of Computing Mathematics and Engineering Charles Sturt University Bathurst Australia Department of Computer Science Nottingham Trent University Nottingham United Kingdom Faculty of Medicine Health and Human Sciences Macquarie University Sydney Australia

Background: Machine learning models have the potential to identify cardiovascular diseases (CVDs) early and accurately in primary healthcare settings, which is crucial for delivering timely treatment and management. Although population-based CVD risk models have been used traditionally, these models often do not consider variations in lifestyles, socioeconomic conditions, or genetic predispositions. Therefore, we aimed to develop machine learning models for CVD detection using primary healthcare data, compare the performance of different models, and identify the best models. Methods: We used data from the UK Biobank study, which included over 500,000 middle-aged participants from different primary healthcare centers in the UK. data collected at baseline (2006-2010) and during imaging visits after 2014 were used in this study. Baseline characteristics, including sex, age, and the Townsend Deprivation Index, were included. Participants were classified as having CVD if they reported at least one of the following conditions: heart attack, angina, stroke, or high blood pressure. Cardiac imaging data such as electrocardiogram and echocardiography data, including left ventricular size and function, cardiac output, and stroke volume, were also used. We used 9 machine learning models (LSVM, RBFSVM, GP, DT, RF, NN, AdaBoost, NB, and QDA), which are explainable and easily interpretable. We reported the accuracy, precision, recall, and F-1 scores;confusion matrices;and area under the curve (AUC) curves. Results: RBFSVM, GP, DT, and AdaBoost were the best performing models (accuracy: 96), and LSVM showed the weakest prediction performance (accuracy: 0.69). While RBFSVM and GP could significantly classify people with CVD better, LSVM and AdaBoost could classify healthy participants more accurately. The LSVM has a better false positive rate but a worse false negative rate. Moreover, the RBFSVM and GP have better performance in terms of false negatives. RBFSVM, GP, DT, NN, and AdaB

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Exploring data Geometry for Continual Learning

arXiv

引用

arXiv 2023年

作者： Gao, Zhi Xu, Chen Li, Feng Jia, Yunde Harandi, Mehrtash Wu, Yuwei Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Electrical and Computer Systems Eng. Monash University Data61 Australia

Continual learning aims to efficiently learn from a non-stationary stream of data while avoiding forgetting the knowledge of old data. In many practical applications, data complies with non-Euclidean geometry. As such, the commonly used Euclidean space cannot gracefully capture non-Euclidean geometric structures of data, leading to inferior results. In this paper, we study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data, and prevents forgetting by keeping geometric structures of old data into account. In doing so, making use of the mixed curvature space, we propose an incremental search scheme, through which the growing geometric structures are encoded. Then, we introduce an angular-regularization loss and a neighbor-robustness loss to train the model, capable of penalizing the change of global geometric structures and local geometric structures. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space. Copyright © 2023, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

MetaTrading: An Immersion-Aware Model Trading Framework for Vehicular Metaverse Services

arXiv

引用

arXiv 2024年

作者： Wu, Hongjia Zeng, Hui Xiong, Zehui Kang, Jiawen Cai, Zhiping Chan, Tse-Tin Niyato, Dusit Han, Zhu Department of Mathematics and Information Technology The Education University of Hong Kong Hong Kong The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore School of Automation Guangdong University of Technology China College of Computer National University of Defense Technology China College of Computing and Data Science Nanyang Technological University Singapore Department of Electrical and Computer Engineering The University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of

Updates of extensive Internet of Things (IoT) data are critical to the immersion of vehicular metaverse services. However, providing high-quality and sustainable data in unstable and resource-constrained vehicular networks remains a significant challenge. To address this problem, we put forth a novel immersion-aware model trading framework that incentivizes metaverse users (MUs) to contribute learning models trained by their latest local data for augmented reality (AR) services in the vehicular metaverse, while preserving their privacy through federated learning. To comprehensively evaluate the contribution of locally trained learning models provided by MUs to AR services, we design a new immersion metric that captures service immersion by considering the freshness and accuracy of learning models, as well as the amount and potential value of raw data used for training. We model the trading interactions between metaverse service providers (MSPs) and MUs as an equilibrium problem with equilibrium constraints (EPEC) to analyze and balance their costs and gains. Moreover, considering dynamic network conditions and privacy concerns, we formulate the reward decisions of MSPs as a multi-agent Markov decision process. Then, a fully distributed dynamic reward method based on deep reinforcement learning is presented, which operates without any private information about MUs and other MSPs. Experimental results demonstrate that the proposed framework can effectively provide higher-value models for object detection and classification in AR services on real AR-related vehicle datasets compared to benchmark schemes. Copyright © 2024, The Authors. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Hybrid malware detection approach with feedback-directed machine learning

引用

science China(information sciences) 2020年第3期63卷 240-242页

作者： Zhetao LI Wenlin LI Fuyuan LIN Yi SUN Min YANG Yuan ZHANG Zhibo WANG Hunan Provincial Key Lab of Internet of Things and Information Security Xiangtan University The College of Information Engineering Xiangtan University Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences School of Computer Science Fudan University Shanghai Institute of Intelligent Electronics & Systems Shanghai Institute for Advanced Communication and Data Science School of Cyber Science and Engineering Wuhan University

Dear editor,In recent years, the number of mobile malware has increased at an alarming rate. According to a report from G data [1], there are approximately 9000 new Android malware instances each *** malicious applica... 详细信息

关键词： Hybrid malware detection approach with feedback-directed machine learning

来源：评论

学校读者我要写书评

暂无评论

Exploring data Geometry for Continual Learning

Exploring Data Geometry for Continual Learning

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhi Gao Chen Xu Feng Li Yunde Jia Mehrtash Harandi Yuwei Wu Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Electrical and Computer Systems Eng. Monash University and Data61 Australia

Continual learning aims to efficiently learn from a non-stationary stream of data while avoiding forgetting the knowledge of old data. In many practical applications, data complies with non-Euclidean geometry. As such, the commonly used Euclidean space cannot gracefully capture non-Euclidean geometric structures of data, leading to in-ferior results. In this paper, we study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data, and pre-vents forgetting by keeping geometric structures of old data into account. In doing so, making use of the mixed cur-vature space, we propose an incremental search scheme, through which the growing geometric structures are en-coded. Then, we introduce an angular-regularization loss and a neighbor-robustness loss to train the model, capa-ble of penalizing the change of global geometric structures and local geometric structures. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secrecy Energy Efficiency Maximization in IRS-Assisted VLC MISO Networks with RSMA: A DS-PPO approach

arXiv

引用

arXiv 2024年

作者： Guo, Yangbo Fan, Jianhui Zhang, Ruichen Chang, Baofang Ng, Derrick Wing Kwan Niyato, Dusit Kim, Dong In School of Computer and Information Engineering Henan Normal University Xinxiang453007 China Engineering Lab of Intelligence Business and Internet of Things Henan453007 China College of Computing and Data Science Nanyang Technological University Singapore School of Electrical Engineering and Telecommunications University of New South Wales NSW2052 Australia Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

This paper investigates intelligent reflecting surface (IRS)-assisted multiple-input single-output (MISO) visible light communication (VLC) networks utilizing the rate-splitting multiple access (RSMA) scheme. In these networks, an eavesdropper (Eve) attempts to eavesdrop on communications intended for legitimate users (LUs). To enhance information security and energy efficiency simultaneously, we formulate a secrecy energy efficiency (SEE) maximization problem. In the formulated problem, beamforming vectors, RSMA common rates, direct current (DC) bias, and IRS alignment matrices are jointly optimized subject to constraints on total power budget, quality of service (QoS) requirements, linear operating region of light emitting diodes (LEDs), and common information rate allocation. Due to the non-convex and NP-hard nature of the formulated problem, we propose a deep reinforcement learning (DRL)-based dual-sampling proximal policy optimization (DS-PPO) approach. The approach leverages dual sample strategies and generalized advantage estimation (GAE). In addition, to further simplify the design, we adopt the maximum ratio transmission (MRT) and zero-forcing (ZF) as beamforming vectors in the action space. Simulation results show that the proposed DS-PPO approach outperforms traditional baseline approaches in terms of achievable SEE and significantly improves convergence speed compared to the original PPO approach. Moreover, implementing the RSMA scheme and IRS contributes to overall system performance, achieving approximately 19.67% improvement over traditional multiple access schemes and 25.74% improvement over networks without IRS deployment. © 2024, CC BY.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Deep Graph Reinforcement Learning for UAV-Enabled Multi-User Secure Communications

引用

IEEE Transactions on Mobile computing 2025年

作者： Tang, Xiao Zhao, Kexin Shen, Chao Du, Qinghe Wang, Yichen Niyato, Dusit Han, Zhu Research & Development Institute Northwestern Polytechnical University Shenzhen518063 China National Key Laboratory of Wireless Communications Chengdu611731 China State Key Laboratory of Intelligent Game Taicang215400 China Northwestern Polytechinical University School of Electronics and Information Xi'an710072 China Xi'an Jiaotong University Faculty of Electronics and Information Engineering Xi'an710049 China Nanyang Technological University College of Computing and Data Science Singapore University of Houston Department of Electrical and Computer Engineering Houston77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

While unmanned aerial vehicles (UAVs) with flexible mobility are envisioned to enhance physical layer security in wireless communications, the efficient security design that adapts to such high network dynamics is rather challenging. The conventional approaches extended from optimization perspectives are usually quite involved, especially when jointly considering factors in different scales such as deployment and transmission in UAV-related scenarios. In this paper, we address the UAV-enabled multi-user secure communications by proposing a deep graph reinforcement learning framework. Specifically, we reinterpret the security beamforming as a graph neural network (GNN) learning task, where mutual interference among users is managed through the message-passing mechanism. Then, the UAV deployment is obtained through soft actor-critic reinforcement learning, where the GNN-based security beamforming is exploited to guide the deployment strategy update. Simulation results demonstrate that the proposed approach achieves near-optimal security performance and significantly enhances the efficiency of strategy determination. Moreover, the deep graph reinforcement learning framework offers a scalable solution, adaptable to various network scenarios and configurations, establishing a robust basis for information security in UAV-enabled communications. © 2002-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

The Role of Generative Artificial Intelligence in Internet of Electric Vehicles

arXiv

引用

arXiv 2024年

作者： Zhang, Hanwen Niyato, Dusit Zhang, Wei Zhao, Changyuan Du, Hongyang Jamalipour, Abbas Sun, Sumei Pei, Yiyang College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Information and Communications Technology Cluster Singapore Institute of Technology Singapore138683 Singapore Department of Electrical and Electronic Engineering University of Hong Kong Pok Fu Lam Hong Kong School of Electrical and Computer Engineering The University of Sydney Australia

With the advancements of generative artificial intelligence (GenAI) models, their capabilities are expanding significantly beyond content generation and the models are increasingly being used across diverse applications. Particularly, GenAI shows great potential in addressing challenges in the electric vehicle (EV) ecosystem ranging from charging management to cyber-attack prevention. In this paper, we specifically consider Internet of electric vehicles (IoEV) and we categorize GenAI for IoEV into four different layers namely, EV’s battery layer, individual EV layer, smart grid layer, and security layer. We introduce various GenAI techniques used in each layer of IoEV applications. Subsequently, public datasets available for training the GenAI models are summarized. Finally, we provide recommendations for future directions. This survey not only categorizes the applications of GenAI in IoEV across different layers but also serves as a valuable resource for researchers and practitioners by highlighting the design and implementation challenges within each layer. Furthermore, it provides a roadmap for future research directions, enabling the development of more robust and efficient IoEV systems through the integration of advanced GenAI techniques. © 2024, CC BY.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Correction to: Multi-agent-based approach for generation expansion planning in isolated micro-grid with renewable energy sources and battery storage

引用

The Journal of Supercomputing 2022年第1期79卷 1156-1157页

作者： Paliwal, Priyanka Webber, Julian L. Mehbodniya, Abolfazl Haq, Mohd Anul Kumar, Anil Chaurasiya, Prem Kumar Department of Electrical Engineering MANIT Bhopal India Department of Electronics and Communication Engineering Kuwait College of Science and Technology (KCST) Doha Area Kuwait Department of Computer Science College of Computer and Information Sciences Majmaah University AlMajmaah Saudi Arabia Data Science Research Group School of Computing DIT University Dehradun India Department of Mechanical Engineering Bansal Institute of Science and Technology Bhopal India

In this article the affiliation details for Julian L. Webber were incorrectly assigned.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fast Intra Mode Prediction Algorithms for SCBS in VVC SCC

Fast Intra Mode Prediction Algorithms for SCBS in VVC SCC

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Dayong Wang Yishen Deng Weisheng Li Xin Lu Frederic Dufaux Bo Hang Ce Zhu Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Faculty of Computing Engineering and Media (CEM) De Montfort University Université Paris-Saclay CNRS CentraleSupélec Laboratoire des Signaux et systèmes The Computer School Hubei University of Arts and Science School of Information and Communication Engineering University of Electronic Science and Technology of China

Versatile Video Coding (VVC) now supports Screen Content Coding (SCC) by integrating two efficient coding modes: Intra Block Copy (IBC) and Palette (PLT). However, the numerous modes and the Quad-Tree Plus Multi-Type Tree (QTMT) structure inherent to VVC contribute to a very high coding complexity. To effectively reduce the computational complexity of VVC SCC, we propose a fast Intra mode prediction algorithm for VVC SCC. More specifically, we first use the difference of minimum Sum of Absolute Transformed Differences (SATD) value of four Directional Modes (DMs) of Intra and the SATD value of the IBC-merge mode to determine whether to early skip Intra checking. Subsequently, we use a decision tree to determine whether to early terminate the checking after block differential pulse coded modulation (BDPCM). Finally, we employ a decision tree to determine whether to early skip multiple transform selection (MTS) and low frequency non-separable transform (LFNST) checking. The results demonstrate that our algorithm achieves an average encoding time reduction of 34.34% with a negligible Bjøntegaard delta bitrate increase of 0.46%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：