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

Uncertainty-based Model Acceleration for Cancer Classification in Whole-Slide Images

学校读者我要写书评

暂无评论

Uncertainty-based Model Acceleration for Cancer Classificati...

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Gao, Zeyu Mao, Anyu Wu, Jialun Li, Yang Wang, Chunbao Ding, Caixia Gong, Tieliang Li, Chen Xi'an Jiaotong University School of Computer Science and Technology Xi'an China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an China The First Affiliated Hospital of Xi'an Jiaotong University Department of Pathology Xi'an China Shaanxi Provincial Cancer Hospital Department of Pathology Xi'an China

ISBN: (纸本)9781665468190

Computational Pathology (CPATH) offers the possibility for highly accurate and low-cost automated pathological diagnosis. However, the high time cost of model inference is one of the main issues limiting the application of CPATH methods. Due to the large size of Whole-Slide Image (WSI), commonly used CPATH methods divided a WSI into a large number of image patches at relatively high magnification, then predicted each image patch individually, which is time-consuming. In this paper, we propose a novel Uncertainty-based Model Acceleration (UMA) method for reducing the time cost of model inference, thereby relieving the deployment burden of CPATH applications. Enlightened by the slide-viewing process of pathologists, only a few high-uncertain regions are regarded as 'suspicious' regions that need to be predicted at high magnification, and most of the regions in WSI are predicted at low magnification, thereby reducing the times of image patch extraction and prediction. Meanwhile, uncertainty estimation ensures prediction accuracy at low magnification. We take two fundamental CPATH classification tasks (i.e., cancer region detection and subtyping) as examples. Extensive experiments on two large-scale renal cell carcinoma classification datasets demonstrate that our UMA can significantly reduce the time cost of model inference while maintaining competitive classification performance. © 2022 IEEE.

关键词： Diseases

Hybrid Local Causal Discovery

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ling, Zhaolong Peng, Honghui Zhang, Yiwen Zhou, Peng Wu, Xingyu Yu, Kui Wu, Xindong School of Computer Science and Technology Anhui University Anhui Hefei230601 China School of Hong Kong Polytechnic University Department of Computing 999077 Hong Kong Key Laboratory of Knowledge Engineering with Big Data the Ministry of Education of China China School of Computer Science and Information Technology Hefei University of Technology Hefei230009 China

Local causal discovery aims to learn and distinguish the direct causes and effects of a target variable from observed data. Existing constraint-based local causal discovery methods use AND or OR rules in constructing the local causal skeleton, but using either rule alone is prone to produce cascading errors in the learned local causal skeleton, and thus impacting the inference of local causal relationships. On the other hand, directly applying score-based global causal discovery methods to local causal discovery may randomly return incorrect results due to the existence of local equivalence classes. To address the above issues, we propose a Hybrid Local Causal Discovery algorithm, called HLCD. Specifically, HLCD initially utilizes a constraint-based approach combined with the OR rule to obtain a candidate skeleton and then employs a score-based method to eliminate redundant portions in the candidate skeleton. Furthermore, during the local causal orientation phase, HLCD distinguishes between V-structures and equivalence classes by comparing the local structure scores between the two, thereby avoiding orientation interference caused by local equivalence classes. We conducted extensive experiments with seven state-of-the-art competitors on 14 benchmark Bayesian network datasets, and the experimental results demonstrate that HLCD significantly outperforms existing local causal discovery algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词：

Tailoring Adversarial Attacks on Deep Neural Networks for Targeted Class Manipulation Using DeepFool Algorithm

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Fazle Rabby Labib, S.M. Mondal, Joyanta Jyoti Manab, Meem Arafat Newaz, Sarfaraz Xiao, Xi School of Data and Sciences BRAC University Dhaka Bangladesh Department of Computer Science University of Delaware United States School of Law and Government Dublin City University Dublin Ireland Research Group Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka Bangladesh Department of Computer Science College of Arts and Sciences University of Alabama Birmingham United States

The susceptibility of deep neural networks (DNNs) to adversarial attacks undermines their reliability across numerous applications, underscoring the necessity for an in-depth exploration of these vulnerabilities and the formulation of robust defense strategies. The DeepFool algorithm by Moosavi-Dezfooli et al. (2016) represents a pivotal step in identifying minimal perturbations required to induce misclassification of input images. Nonetheless, its generic methodology falls short in scenarios necessitating targeted interventions. Additionally, previous research studies have predominantly concentrated on the success rate of attacks without adequately addressing the consequential distortion of images, the maintenance of image quality, or the confidence threshold required for misclassification. To bridge these gaps, we introduce the Enhanced Targeted DeepFool (ET DeepFool) algorithm, an evolution of DeepFool that not only facilitates the specification of desired misclassification targets but also incorporates a configurable minimum confidence score. Our empirical investigations demonstrate the superiority of this refined approach in maintaining the integrity of images and minimizing perturbations across a variety of DNN architectures. Unlike previous iterations, such as the Targeted DeepFool by Gajjar et al. (2022), our method grants unparalleled control over the perturbation process, enabling precise manipulation of model responses. Preliminary outcomes reveal that certain models, including AlexNet and the advanced Vision Transformer, display commendable robustness to such manipulations. This discovery of varying levels of model robustness, as unveiled through our confidence level adjustments, could have far-reaching implications for the field of image recognition. Our code will be made public upon acceptance of the paper. © 2023, CC BY-NC-SA.

关键词： Deep neural networks

Motion Planning in Automated Vehicles Based on Hierarchical MPC

学校读者我要写书评

暂无评论

Motion Planning in Automated Vehicles Based on Hierarchical ...

Advances in computer science, Electrical, Electronics, and Communication Technologies (CE2CT), International Conference on

作者： Pooja Kapila Pankaj Kumar Rahul Negi Bhupender Kumar Bharti Akash Punhani Suraj Singh Bisht Department of Artifical Intelligence & Data Science IIMT College of Engineering Department of Statistics Amity University Kolkata India Department of ECE Tula's Institute Dehradun India Department of Mechanical Engineering VMSB UTU Campus Pithoragarh India Department of Computer Science KIET Group of Institutions Noida India Department of ECE Bipin Tripathi Kumaon Institute of Technology Dwarahat Almora India

ISBN: (数字)9798331518578

ISBN: (纸本)9798331518585

In this study, a thorough hierarchical control structure that supports autonomous decision-making that arises in autonomous systems and robots is proposed. Distinct state and decision/control sets are frequently used to describe high-level decision making in a conventional hierarchical control architecture. To keep up with proficiency, wellbeing, and solace, robotized vehicles generally depend serious areas of strength for on powerful movement arranging calculations. The capacity of Model Prescient Control (MPC) to oversee imperatives and upgrade directions progressively has made it a strong system for movement arranging. To approve the proposed strategy, this exploration utilizes MATLAB recreations to look at various levelled MPC for movement arranging in robotized vehicles. With the low-level regulator guaranteeing exact direction observing and the undeniable level organizer computing a worldwide direction, a two-layer progressive MPC structure is fabricated. The discoveries show how well the progressive MPC handles street ebb and flow, dynamic hindrances, and continuous computational impediments. It is demonstrated that the suggested autonomous decision-making scheme's recursive practicality and stability are ensured by carefully crafting its essential components. An intelligent vehicle's autonomous lane-changing system is developed using the suggested framework. Simulation demonstrates that it has a potential capacity to manage a variety of behaviours in complex and dynamic contexts. It is anticipated that the suggested framework will be useful for autonomous decision-making in a variety of robotics along with autonomous technologies where safety as well as optimality are important factors.

关键词： Analytical models Autonomous systems Computational modeling Decision making Turning Planning Trajectory Safety Vehicle dynamics Robots

Lightweight Authenticated Task Offloading in 6G-Cloud Vehicular Twin Networks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Al-Shareeda, Sarah Ozguner, Fusun Redmill, Keith Duong, Trung Q. Canberk, Berk Electrical and Computer Engineering Department The Ohio State University United States BTS Group Turkey Department of AI and Data Engineering Istanbul Technical University Turkey School of Electronics Electrical Engineering and Computer Science Queen’s University Belfast United Kingdom Faculty of Engineering and Applied Science Memorial University of Newfoundland St. John’sNL Canada School of Computing Engineering and The Built Environment Edinburgh Napier University United Kingdom

Task offloading management in 6G vehicular networks is crucial for maintaining network efficiency, particularly as vehicles generate substantial data. Integrating secure communication through authentication introduces additional computational and communication overhead, significantly impacting offloading efficiency and latency. This paper presents a unified framework incorporating lightweight Identity-Based Cryptographic (IBC) authentication into task offloading within cloud-based 6G Vehicular Twin Networks (VTNs). Utilizing Proximal Policy Optimization (PPO) in Deep Reinforcement Learning (DRL), our approach optimizes authenticated offloading decisions to minimize latency and enhance resource allocation. Performance evaluation under varying network sizes, task sizes, and data rates reveals that IBC authentication can reduce offloading efficiency by up to 50% due to the added overhead. Besides, increasing network size and task size can further reduce offloading efficiency by up to 91.7%. As a countermeasure, increasing the transmission data rate can improve the offloading performance by as much as 63%, even in the presence of authentication overhead. The code for the simulations and experiments detailed in this paper is available on GitHub for further reference and reproducibility [1]. © 2025, CC BY.

关键词： Deep reinforcement learning

Low-altitude Friendly-Jamming for Satellite-Maritime Communications via Generative AI-enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverV6T 1Z4 Canada

Low Earth Orbit (LEO) satellites can be used to assist maritime wireless communications for data transmission across wide-ranging areas. However, extensive coverage of LEO satellites, combined with openness of channels, can cause the communication process to suffer from security risks. This paper presents a low-altitude friendly-jamming LEO satellite-maritime communication system enabled by a unmanned aerial vehicle (UAV) to ensure data security at the physical layer. Since such a system requires trade-off policies that balance the secrecy rate and energy consumption of the UAV to meet evolving scenario demands, we formulate a secure satellite-maritime communication multi-objective optimization problem (SSMCMOP). In order to solve the dynamic and long-term optimization problem, we reformulate it into a Markov decision process. We then propose a transformer-enhanced soft actor critic (TransSAC) algorithm, which is a generative artificial intelligence-enable deep reinforcement learning approach to solve the reformulated problem, so that capturing global dependencies and diversely exploring weights. Simulation results demonstrate that the TransSAC outperforms various baselines, and achieves an optimal secrecy rate while effectively minimizing the energy consumption of the UAV. Moreover, the results find more suitable constraint values for the system. Copyright © 2025, The Authors. All rights reserved.

关键词： Multiobjective optimization

Lightweight Authenticated Task Offloading in 6G-Cloud Vehicular Twin Networks

学校读者我要写书评

暂无评论

Lightweight Authenticated Task Offloading in 6G-Cloud Vehicu...

2025 IEEE Wireless Communications and Networking Conference, WCNC 2025

作者： Al-Shareeda, Sarah Ozguner, Fusun Redmill, Keith Duong, Trung Q. Canberk, Berk The Ohio State University Electrical and Computer Engineering Department United States Bts Group Turkey Istanbul Technical University Department of Ai and Data Engineering Turkey School of Electronics Electrical Engineering and Computer Science Queen's University Belfast United Kingdom Memorial University of Newfoundland Faculty of Engineering and Applied Science St. John'sNL Canada School of Computing Engineering and The Built Environment Edinburgh Napier University United Kingdom

ISBN: (纸本)9798350368369

Task offloading management in 6G vehicular net-works is crucial for maintaining network efficiency, particularly as vehicles generate substantial data. Integrating secure communication through authentication introduces additional computational and communication overhead, significantly impacting offloading efficiency and latency. This paper presents a unified framework incorporating lightweight Identity-Based Cryptographic (IBC) authentication into task offloading within cloud-based 6G Vehicular Twin Networks (VTNs). Utilizing Proximal Policy Optimization (PPO) in Deep Reinforcement Learning (DRL), our approach optimizes authenticated offloading decisions to minimize latency and enhance resource allocation. Performance evaluation under varying network sizes, task sizes, and data rates reveals that IBC authentication can reduce offloading efficiency by up to 50% due to the added overhead. Besides, increasing network size and task size can further reduce offloading efficiency by up to 91.7%. As a countermeasure, increasing the transmission data rate can improve the offloading performance by as much as 63%, even in the presence of authentication overhead. The code for the simulations and experiments detailed in this paper is available on GitHub for further reference and reproducibility [1]. © 2025 IEEE.

关键词： Authentication Deep Reinforcement Learning Identity-Based Cryptography Proximal Policy Optimization Task Offloading Vehicular Twin Networks

Aerial Reliable Collaborative Communications for Terrestrial Mobile Users via Evolutionary Multi-Objective Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Sun, Geng Xiao, Jian Li, Jiahui Wang, Jiacheng Kang, Jiawen Niyato, Dusit Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China affiliated with the College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510641 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

Unmanned aerial vehicles (UAVs) have emerged as the potential aerial base stations (BSs) to improve terrestrial communications. However, the limited onboard energy and antenna power of a UAV restrict its communication range and transmission capability. To address these limitations, this work employs collaborative beamforming through a UAV-enabled virtual antenna array to improve transmission performance from the UAV to terrestrial mobile users, under interference from non-associated BSs and dynamic channel conditions. Specifically, we introduce a memory-based random walk model to more accurately depict the mobility patterns of terrestrial mobile users. Following this, we formulate a multi-objective optimization problem (MOP) focused on maximizing the transmission rate while minimizing the flight energy consumption of the UAV swarm. Given the NP-hard nature of the formulated MOP and the highly dynamic environment, we transform this problem into a multi-objective Markov decision process and propose an improved evolutionary multi-objective reinforcement learning algorithm. Specifically, this algorithm introduces an evolutionary learning approach to obtain the approximate Pareto set for the formulated MOP. Moreover, the algorithm incorporates a long short-term memory network and hyper-sphere-based task selection method to discern the movement patterns of terrestrial mobile users and improve the diversity of the obtained Pareto set. Simulation results demonstrate that the proposed method effectively generates a diverse range of non-dominated policies and outperforms existing methods. Additional simulations demonstrate the scalability and robustness of the proposed CB-based method under different system parameters and various unexpected circumstances. © 2025, CC0.

关键词： Unmanned aerial vehicles (UAV)

Implicit Relative Labeling-Importance Aware Multi-Label Metric Learning 39

学校读者我要写书评

暂无评论

Implicit Relative Labeling-Importance Aware Multi-Label Metr...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Mao, Jun-Xiang Rui, Yong Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Ministry of Education China Information Technology and Data Management Department China Mobile Communications Group Zhejiang Co. Ltd. China Lenovo Research Lenovo Group Ltd. Beijing China

ISBN: (纸本)157735897X

Multi-label metric learning, as an extension of metric learning to multi-label scenarios, aims to learn better similarity metrics for objects with rich semantics. Existing multi-label metric learning approaches employ the common assumption of equal labeling-importance, i.e., all associated labels are considered relevant to the training instance, while there is no differentiation in the relative importance of their semantics. However, this common assumption does not reflect the fact that the importance of each relevant label is generally different, even though such importance information is not directly accessible from the training examples. In this paper, we claim that it is beneficial to leverage the implicit Relative Labeling-Importance (RLI) information to facilitate multi-label metric learning. Specifically, the manifold structure within the feature space is exploited by local linear reconstruction, and then the RLIs are recovered by transferring such structure to the label space. Subsequently, a discrimiative multi-label metric learning framework is introduced to align the predictive modeling outputs with the recovered RLIs, under which instances with similar RLI are implicitly pulled closer to each other, while those with dissimilar RLI are pushed further apart. Comprehensive experiments on benchmark multi-label datasets validate the superiority of our proposed approach in learning effective similarity metrics between multi-label examples. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Nameplates