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

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

SVT-Net: Super Light-Weight Sparse Voxel Transformer for Large Scale Place Recognition

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Fan, Zhaoxin Song, Zhenbo Liu, Hongyan Lu, Zhiwu He, Jun Du, Xiaoyong Key Laboratory of Data Engineering Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China Gaoling School of Artificial Intelligence Renmin University of China Beijing100872 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Management Science and Engineering Tsinghua University Beijing100084 China

Simultaneous Localization and Mapping (SLAM) and Autonomous Driving are becoming increasingly more important in recent years. Point cloud-based large scale place recognition is the spine of them. While many models have been proposed and have achieved acceptable performance by learning short-range local features, they always skip long-range contextual properties. Moreover, the model size also becomes a serious shackle for their wide applications. To overcome these challenges, we propose a super light-weight network model termed SVT-Net. On top of the highly efficient 3D Sparse Convolution (SP-Conv), an Atom-based Sparse Voxel Transformer (ASVT) and a Cluster-based Sparse Voxel Transformer (CSVT) are proposed respectively to learn both short-range local features and long-range contextual features. Consisting of ASVT and CSVT, SVT-Net can achieve state-of-the-art performance in terms of both recognition accuracy and running speed with a super-light model size (0.9M parameters). Meanwhile, for the purpose of further boosting efficiency, we introduce two simplified versions, which also achieve state-of-the-art performance and further reduce the model size to 0.8M and 0.4M respectively. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

Test-Time Domain Adaptation by Learning Domain-Aware Batch Normalization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wu, Yanan Chi, Zhixiang Wang, Yang Plataniotis, Konstantinos N. Feng, Songhe Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education Beijing Jiaotong University Beijing100044 China School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China The Edward S Rogers Sr. ECE Department University of Toronto TorontoM5S3G8 Canada Department of Computer Science and Software Engineering Concordia University MontrealH3G2J1 Canada

Test-time domain adaptation aims to adapt the model trained on source domains to unseen target domains using a few unlabeled images. Emerging research has shown that the label and domain information is separately embedded in the weight matrix and batch normalization (BN) layer. Previous works normally update the whole network naively without explicitly decoupling the knowledge between label and domain. As a result, it leads to knowledge interference and defective distribution adaptation. In this work, we propose to reduce such learning interference and elevate the domain knowledge learning by only manipulating the BN layer. However, the normalization step in BN is intrinsically unstable when the statistics are re-estimated from a few samples. We find that ambiguities can be greatly reduced when only updating the two affine parameters in BN while keeping the source domain statistics. To further enhance the domain knowledge extraction from unlabeled data, we construct an auxiliary branch with label-independent self-supervised learning (SSL) to provide supervision. Moreover, we propose a bi-level optimization based on meta-learning to enforce the alignment of two learning objectives of auxiliary and main branches. The goal is to use the auxiliary branch to adapt the domain and benefit main task for subsequent inference. Our method keeps the same computational cost at inference as the auxiliary branch can be thoroughly discarded after adaptation. Extensive experiments show that our method outperforms the prior works on five WILDS real-world domain shift datasets. Our method can also be integrated with methods with label-dependent optimization to further push the performance boundary. Our code is available at https://***/ynanwu/MABN. © 2023, CC BY.

关键词： Time domain analysis

RETRACTED ARTICLE: Improved Deep Learning Method for Real-Time Ship Detection and Localization From SAR Image

学校读者我要写书评

暂无评论

Journal of the Indian Society of Remote Sensing 2023年第8期52卷 1855-1855页

作者： Raj J, Anil Idicula, Sumam Mary Paul, Binu Department of Computer Science Cochin University of Science and Technology Kochi India Department of Artificial Intelligence & Data Science Muthoot Institute of Technology and Science Varikoli Kochi India Division of Electronics Engineering School of Engineering Cochin University of Science and Technology Kochi India

Distributed Energy Optimization for Mobile Networks Using Potential Games

学校读者我要写书评

暂无评论

Distributed Energy Optimization for Mobile Networks Using Po...

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Zhizongkai Wang Hanfei Wang Zhongji Wang Yilin Xiao Yunzhi Zhao Xiaowen Li Xufeng Chen Lin Gao Fen Hou Jianwei Huang School of Electronics and Information Engineering and the Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology Harbin Institute of Technology Shenzhen Guangdong P.R. China School of Science and Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen Key Laboratory of Crowd Intelligence Empowered Low-Carbon Energy Network and CSIJRI Joint Research Centre on Smart Energy Storage The Chinese University of Hong Kong Shenzhen Guangdong P.R. China Department of Electrical and Computer Engineering State Key Laboratory of IoT for Smart City University of Macau Macau SAR P.R. China Huawei Technologies P.R. China

ISBN: (数字)9798350363999

ISBN: (纸本)9798350364002

The rapid advancement of information and communication technology (ICT) has made the industry a significant contributor to global carbon emissions. As the foundation of ICT, next-generation mobile communication networks aim to be more powerful and energy-efficient. However, optimizing energy efficiency in real networks is challenging due to large-scale, multi-layer control variables and the dynamic environment. This paper addresses the energy efficiency optimization problem from a network perspective by controlling cross-layer variables including both cell activation status and cell priority, to minimize overall network energy consumption while ensuring user quality-of-experience, which poses an NP-hard mixed-integer nonlinear programming problem. To tackle this, we propose a non-cooperative game where each cell acts as a player, optimizing its activation status and reference signal transmission power (determining its priority). We show that the game is a potential game, guaranteeing the existence of Nash equilibrium and the convergence of simple distributed algorithms towards Nash equilibrium. We further show that the Nash equilibrium points of the game can (but not always) reach the global optimal energy efficiency. Simulation results show that our proposed method can reduce the total system cost (including both energy consumption cost and user experience loss) by up to 28% compared to existing methods in the literature. Moreover, the performance loss of our proposed method, compared to the global optimal solution, is less than 13.7%. In summary, this work offers a realistic network model, introduces a novel game-based method, and provides extensive performance evaluation, making a significant contribution to both industry and academia.

关键词： Industries Energy consumption Costs Simulation Games Nash equilibrium Energy efficiency Information and communication technology Distributed algorithms Optimization

Mitigation Methods of Reducing DDOS Attack Frequency on Blockchain

学校读者我要写书评

暂无评论

Mitigation Methods of Reducing DDOS Attack Frequency on Bloc...

Advance Computing and Innovative Technologies in engineering (ICACITE), International Conference on

作者： R. Sathees Kumar Phanikanth Chintamaneni Madarapu Naresh Kumar Ankita Joshi Bajila Swathi Joshuva Arockia Dhanraj Department of CSE Narasaraopeta Institute of Technology JNTUK University Narasaraopet Andhra Pradesh Department Of CSE Koneru Lakshmaiah Education Foundation Scientist B National Informatics Centre Ministry of Electronics and Information Technology (MEITY) New Delhi National Informatics Centre Ministry of Electronics and Information Technology (MEITY) New Delhi Uttaranchal Institute of Technology Uttaranchal University India School of Computer Science and Artificial Intelligence SR University Warangal Telangana India Department of Mechatronics Engineering Centre for Automation and Robotics (ANRO) Hindustan Institute of Technology and Science Padur Chennai India

A serious risk to genuine organization demands is a distributed denial of service (DDoS) attack. The main DDoS attack was archived in 1996, however, from that point forward, their intricacy and refinement have consistently expanded. A 2 TBps attack on a crucial foundation, including the monetary area, was accounted for in August 2020 during the Coronavirus pandemic. In the accompanying two years, it is anticipated that the number of attacks would twofold, stretching around 15 million. Since its beginning, many relief plans have been made, however, the intricacy is rising, requiring modern arrangements in view of new innovation. A potential and common-sense method for DDoS relief is blockchain. The point of the review is to give an exhaustive examination of the fundamental and intrinsic properties of blockchain, including their decentralization, inside and outer trust lessness, unchanging nature, honesty, obscurity, and evidence, which have demonstrated to be a fantastic contender for battling this destructive cyber threat.

关键词：

Distributional Drift Adaptation with Temporal Conditional Variational Autoencoder for Multivariate Time Series Forecasting

学校读者我要写书评

暂无评论

arXiv 2022年

作者： He, Hui Zhang, Qi Yi, Kun Shi, Kaize Niu, Zhendong Cao, Longbing The School of Medical Technology Beijing Institute of Technology Beijing100081 China The School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China The Department of Computer Science Tongji University Shanghai201804 China The Data Science and Machine Intelligence Lab University of Technology SydneyNSW2007 Australia The Engineering Research Center of Integration and Application of Digital Learning Technology Ministry of Education China The DataX Research Centre School of Computing Macquarie University SydneyNSW2109 Australia

Due to the non-stationary nature, the distribution of real-world multivariate time series (MTS) changes over time, which is known as distribution drift. Most existing MTS forecasting models greatly suffer from distribution drift and degrade the forecasting performance over time. Existing methods address distribution drift via adapting to the latest arrived data or self-correcting per the meta knowledge derived from future data. Despite their great success in MTS forecasting, these methods hardly capture the intrinsic distribution changes, especially from a distributional perspective. Accordingly, we propose a novel framework temporal conditional variational autoencoder (TCVAE) to model the dynamic distributional dependencies over time between historical observations and future data in MTSs and infer the dependencies as a temporal conditional distribution to leverage latent variables. Specifically, a novel temporal Hawkes attention mechanism represents temporal factors subsequently fed into feed-forward networks to estimate the prior Gaussian distribution of latent variables. The representation of temporal factors further dynamically adjusts the structures of Transformer-based encoder and decoder to distribution changes by leveraging a gated attention mechanism. Moreover, we introduce conditional continuous normalization flow to transform the prior Gaussian to a complex and form-free distribution to facilitate flexible inference of the temporal conditional distribution. Extensive experiments conducted on six real-world MTS datasets demonstrate the TCVAE’s superior robustness and effectiveness over the state-of-the-art MTS forecasting baselines. We further illustrate the TCVAE applicability through multifaceted case studies and visualization in real-world *** Codes 68Txx Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

Normal Distribution Function on Descriptor Extraction 11th

学校读者我要写书评

暂无评论

Normal Distribution Function on Descriptor Extraction

11th International Conference on Image and Graphics, ICIG 2021

作者： Yin, Jianhua Liu, Cong Jiang, Jun Wen, Jie Yang, Lihang Zhu, Shilong School of Computer Science and Technology Harbin Institute of Technology Shenzhen518055 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518055 China Peng Cheng Laboratory Shenzhen518055 China Shenzhen Key Laboratory of Visual Object Detection and Recognition Harbin Institute of Technology Shenzhen518055 China College of Big Data and Information Engineering Guizhou University Guizhou Guiyang550025 China

ISBN: (纸本)9783030873578

The triplet-loss function is widely used in fields of descriptor extraction in recent years and owing to its good performance in various databases. However, some recent works make less effort on the relationship of adjacent descriptors from the same sample, which leads to the instability of descriptors and results in the mismatching problem in practical applications. To solve this problem, we introduce the topological relationship with the Normal Distribution Function (NDF) into the triplet loss function. The loss function establishes the relationship of descriptors from the same sample and considers the interrelation of descriptors from different types of samples. Furthermore, to increase the calculation speed, we normalize the algorithm NDF. Finally, we propose the triplet-loss function on three databases. These results demonstrate that our algorithm obtains better performance than state-of-the-art methods. © 2021, Springer Nature Switzerland AG.

关键词： Distribution functions

How Much data are Enough? Investigating dataset Requirements for Patch-Based Brain MRI Segmentation Tasks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Dongang Liu, Peilin Wang, Hengrui Beadnall, Heidi Kyle, Kain Ly, Linda Cabezas, Mariano Zhan, Geng Sullivan, Ryan Cai, Weidong Ouyang, Wanli Calamante, Fernando Barnett, Michael Wang, Chenyu Brain and Mind Centre The University of Sydney CamperdownNSW2050 Australia Sydney Neuroimaging Analysis Centre 94 Mallett Street CamperdownNSW2050 Australia School of Mathematics and Statistics The University of Sydney CamperdownNSW2006 Australia Royal Prince Alfred Hospital CamperdownNSW2050 Australia School of Computer Science The University of Sydney CamperdownNSW2006 Australia Australian Imaging Service CamperdownNSW2006 Australia Shanghai Artificial Intelligence Laboratory China School of Biomedical Engineering The University of Sydney CamperdownNSW2006 Australia Sydney Imaging The University of Sydney CamperdownNSW2006 Australia

Training deep neural networks reliably requires access to large-scale datasets. However, obtaining such datasets can be challenging, especially in the context of neuroimaging analysis tasks, where the cost associated with image acquisition and annotation can be prohibitive. To mitigate both the time and financial costs associated with model development, a clear understanding of the amount of data required to train a satisfactory model is crucial. This paper focuses on an early stage phase of deep learning research, prior to model development, and proposes a strategic framework for estimating the amount of annotated data required to train patch-based segmentation networks. This framework includes the establishment of performance expectations using a novel Minor Boundary Adjustment for Threshold (MinBAT) method, and standardizing patch selection through the ROI-based Expanded Patch Selection (REPS) method. Our experiments demonstrate that tasks involving regions of interest (ROIs) with different sizes or shapes may yield variably acceptable Dice Similarity Coefficient (DSC) scores. By setting an acceptable DSC as the target, the required amount of training data can be estimated and even predicted as data accumulates. This approach could assist researchers and engineers in estimating the cost associated with data collection and annotation when defining a new segmentation task based on deep neural networks, ultimately contributing to their efficient translation to real-world applications. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks