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

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

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Feature Selection Method Based on Rankability

SSRN

引用

SSRN 2024年

作者： Kong, Lingping Velasquez, Juan D. Perfilieva, Irina Pant, Millie Pan, Jeng-Shyang Snášel, Václav Department of Computer Science VSB-Technical University of Ostrava Ostrava Czech Republic Department of Industrial Engineering University of Chile Santiago Chile Santiago Chile Institute for Research and Applications of Fuzzy Modeling Centre of Excellence IT4Innovations division of The University of Ostrava Ostrava Czech Republic Department of Applied Mathematics and Scientific Computing Indian Institute of Technology Uttarakhand Roorkee247667 India School of Artificial Intelligence Nanjing University of Information Science and Technology China Instituto Sistemas Complejos de Ingeniería Santiago Chile Santiago Chile Faculty of Computer Science and Telecommunications Cracow University of Technology Kraków Poland Mehta Family School of Data Science and Artificial Intelligence Indian Institute of Technology Uttarakhand Roorkee247667 India College of Computer Science and Engineering Shandong University of Science and Technology China

Within the realm of data mining and machine learning, feature selection stands out as an essential technique for dimensionality reduction, presenting both popularity and complexity. Feature selection involves a nuanced trade-off that results in information loss. This distinction underscores the necessity for the development of lightweight, efficient, and practical methods capable of minimizing information loss while executing dimensional reduction. In this paper, we introduce a rankability-based feature selection method. The concept of rankability, proposed in 2019 and similar to the entropy concept, remains relatively unexplored. Our proposed method distinguishes itself by its lightweight complexity, eliminating the need for iterative *** evaluate the effectiveness of our approach, we conducted experiments on forty-one datasets and compared the results with four other algorithms using refined data with 10\%, 30\%, and 50\% feature dimension reduction. The findings reveal that our rankability-based feature selection method consistently outperforms the other four methods across a majority of datasets in terms of accuracy, precision, recall, and F1-macro performance. Specifically, the classification score exceeds 0.9 on accuracy for 50\% feature dimension reduction in twelve datasets, with nine datasets achieving scores over 0.9 in recall, F1-macro, and precision. Overall, our proposed feature selection method demonstrates promising performance. © 2024, The Authors. All rights reserved.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Radial kinks in a Schwarzschild-like geometry

arXiv

引用

arXiv 2024年

作者： Caputo, Jean-Guy Dobrowolski, Tomasz Gatlik, Jacek Kevrekidis, Panayotis G. Laboratoire de Mathématiques INSA de Rouen Avenue de l’Université Saint-Etienne du Rouvray76801 France Department of Computer Physics and Quantum Computing University of the National Education Commission in Krakow Podchoŗ azych 2 Cracow30-084 Poland AGH University of Krakow Faculty of Physics and Applied Computer Science Krakow30-059 Poland Department of Mathematics and Statistics University of Massachusetts AmherstMA01003-4515 United States

We study the propagation of a domain wall (kink) of the 4 model in a radially symmetric environment defined by a gravity source. This source introduces a Schwarzschild-like geometry. We introduce an effective model that accurately describes the dynamics of the kink center. This description works well even outside the perturbation region, i.e., even for large masses of the gravitating object. We observed that such a spherical domain wall surrounding a star-type object inevitably "collapses", i.e., shrinks in radius towards the origin and offer an understanding of the latter phenomenology. The relevant analysis is presented for a circular domain wall and a spherical one. © 2024, CC BY.

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

Efficient Inverse-designed Structural Infill for Complex Engineering Structures

arXiv

引用

arXiv 2023年

作者： Jensen, Peter Dørffler Ladegaard Olsen, Tim Felle Bærentzen, J. Andreas Aage, Niels Sigmund, Ole Department of Civil and Mechanical Engineering Solid Mechanics Technical University of Denmark Koppels Allé B.404 Kgs. Lyngby2800 Denmark Department of Applied Mathematics and Computer Science Visual Computing Technical University of Denmark Richard Petersens Plads B.321 Kgs. Lyngby2800 Denmark

Inverse design of high-resolution and fine-detailed 3D lightweight mechanical structures is notoriously expensive due to the need for vast computational resources and the use of very fine-scaled complex meshes. Furthermore, in designing for additive manufacturing, infill is often neglected as a component of the optimized structure. In this paper, both concerns are addressed using a so-called de-homogenization topology optimization procedure on complex engineering structures discretized by 3D unstructured hexahedrals. Using a rectangular-hole microstructure (reminiscent to the stiffness optimal orthogonal rank-3 multi-scale) as a base material for the multi-scale optimization, a coarse-scale optimized geometry can be obtained using homogenization-based topology optimization. Due to the microstructure periodicity, this coarse-scale geometry can be up-sampled to a fine single-scale physical geometry with optimized infill, with only a minor loss in structural performance and at a fraction of the cost of a fine-scale solution. The upsampling on 3D unstructured grids is achieved through stream surface tracing which aligns with the optimized local orientation. The periodicity of the physical geometry can be tuned, such that the material serves as a structural component and also as an efficient infill for additive manufacturing designs. The method is demonstrated through three examples of varying geometrical complexity. It achieves comparable structural performance to state-of-the-art methods but stands out for its significant computational time reduction, much faster than the base-line method. By allowing multiple active layers, the mapped solution becomes more mechanically stable, leading to an increased critical buckling load factor without additional computational expense. The proposed approach achieves promising results, benchmarking against large-scale SIMP models demonstrates computational efficiency improvements of up to 250 times. © 2023, CC BY-NC-SA.

关键词： Shape optimization

来源：评论

学校读者我要写书评

暂无评论

BLIS-Net: Classifying and Analyzing Signals on Graphs

arXiv

引用

arXiv 2023年

作者： Xu, Charles Goldman, Laney Guo, Valentina Hollander-Bodie, Benjamin Trank-Greene, Maedee Adelstein, Ian De Brouwer, Edward Ying, Rex Krishnaswamy, Smita Perlmutter, Michael Department of Mathematics Yale University United States Department of Computer Science Yale University United States Department of Mathematics Harvey Mudd College United States Department of Genetics Yale School of Medicine United States Department of Applied Mathematics University of Colorado Boulder United States Department of Mathematics Boise State University United States Program in Computing Boise State University United States

Graph neural networks (GNNs) have emerged as a powerful tool for tasks such as node classification and graph classification. However, much less work has been done on signal classification, where the data consists of many functions (referred to as signals) defined on the vertices of a single graph. These tasks require networks designed differently from those designed for traditional GNN tasks. Indeed, traditional GNNs rely on localized low-pass filters, and signals of interest may have intricate multi-frequency behavior and exhibit long range interactions. This motivates us to introduce the BLIS-Net (Bi-Lipschitz Scattering Net), a novel GNN that builds on the previously introduced geometric scattering transform. Our network is able to capture both local and global signal structure and is able to capture both low-frequency and high-frequency information. We make several crucial changes to the original geometric scattering architecture which we prove increase the ability of our network to capture information about the input signal and show that BLIS-Net achieves superior performance on both synthetic and real-world data sets based on traffic flow and fMRI data. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Spatial Attention Cooperative-Based Graph Convolutional Model for Person Re-Identification

SSRN

引用

SSRN 2023年

作者： Xiong, Mingfu Xiong, Jiefan Wang, Zhongyuan Chen, Jia Hu, Ruimin Ser, Javier Del Muhammad, Khan Xiong, Zixiang School of Computer Science and Artificial Intelligence Wuhan Textile University Wuhan430200 China School of Cyber Science and Engineering Wuhan University Wuhan430072 China Department of Applied Artificial Intelligence School of Convergence College of Computing and Informatics Sungkyunkwan University Seoul03063 Korea Republic of Derio48160 Spain Bilbao48013 Spain The Department of Electrical and Computer Engineering Texas A&M University College StationTX7784 United States

Recently, person re-identification (person Re-ID) equipped with an attention mechanism has gradually emerged as one of the most active areas of study in the field of computer vision and neural processing. Despite the upsurge in related research, existing attention-based methods still face two major challenges when recognizing different persons with similar appearances in unpredictable realistic environments: (1) the adaptability of a single local salient feature to hostile scenes cannot be guaranteed, and (2) most existing methods originating from attention features usually find a simple linear transformation or implement variation strategies, which makes it difficult to discriminate different pedestrians with similar appearance attributes. To address these issues, this paper proposes a spatial attention cooperative-based graph convolutional model (SACGCM) to examine the relevance of local body regions for individuals. The proposed framework encompasses a multi-dimensional attention model (MAM) and spatial adaptive graph convolutional model (SAGCM). In particular, the MAM comprises a dual-attention (local and global) module and feature channel-attention stage, which are used to capture multiple key points for each person. Then, SAGCM is used to construct spatial nonlinear transformation relationships among the various body regions for each person using graph optimization. Extensive experiments were conducted using public person Re-ID datasets (Market-1501, DukeMTMC-reid, and CUHK-03). The results demonstrate that the performance of the proposed approach is superior to that of state-of-the-art methods by between 2 and 10\% at Rank-1 (mAP). © 2023, The Authors. All rights reserved.

关键词： Linear transformations

来源：评论

学校读者我要写书评

暂无评论

Intelligent Energy-Aware Thermal Exchange Optimization with Deep Learning Model for IoT-Enabled Smart Healthcare

引用

Journal of Healthcare Engineering 2023年第1期2023卷 3830857页

作者： Ragab, Mahmoud Binyamin, Sami Saeed Information Technology Department Faculty of Computing and Information Technology King Abdulaziz University Jeddah21589 Saudi Arabia Department Faculty of Science Al-Azhar University Nasr City Cairo11884 Egypt Centre for Artificial Intelligence in Precision Medicines King Abdulaziz University Jeddah21589 Saudi Arabia Computer and Information Technology Department Applied College King Abdulaziz University Jeddah21589 Saudi Arabia

In recent years, Internet of Things (IoT) and advanced sensor technologies have gained considerable interest in linking different medical devices, patients, and healthcare professionals to improve the quality of medical services in a cost-effective manner. The evolution of the smart healthcare sector has considerably enhanced patient safety, accessibility, and operational competence while minimizing the costs incurred in healthcare services. In this background, the current study develops intelligent energy-aware thermal exchange optimization with deep learning (IEA-TEODL) model for IoT-enabled smart healthcare. The aim of the proposed IEA-TOEDL technique is to group the IoT devices into clusters and make decisions in the smart healthcare sector. The proposed IEA-TEODL technique constructs clusters using the energy-aware chaotic thermal exchange optimization-based clustering (EACTEO-C) scheme. In addition, the disease diagnosis model also intends to classify the collected healthcare data as either presence or absence of the disease. To accomplish this, the proposed IEA-TODL technique involves several subprocesses such as preprocessing, K-medoid clustering-based outlier removal, multihead attention bidirectional long short-term memory (MHA-BLSTM), and weighted salp swarm algorithm (WSSA). The utilization of outlier removal and WSSA-based hyperparameter tuning process assist in achieving enhanced classification outcomes. In order to demonstrate the enhanced outcomes of the IEA-TEODL approach, a wide range of simulations was conducted against benchmark datasets. The simulation results inferred the enhanced outcomes of the IEA-TEODL technique over recent techniques under distinct evaluation metrics. © 2023 Mahmoud Ragab and Sami Saeed Binyamin.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Preparing for HPC on RISC-V: Examining Vectorization and Distributed Performance of an Astrophysics Application with HPX and Kokkos

Preparing for HPC on RISC-V: Examining Vectorization and Dis...

引用

High Performance computing, Networking, Storage and Analysis, SC-W: Workshops of the International Conference for

作者： Patrick Diehl Panagiotis Syskakis Gregor Daiß Steven R. Brandt Alireza Kheirkhahan Srinivas Yadav Singanaboina Dominic Marcello Chris Taylor John Leidel Hartmut Kaiser Applied Computer Science (CCS-7) Los Alamos National Laboratory Los Alamos NM U.S.A. Department of Physics and Astronomy Louisiana State University Baton Rouge LA U.S.A. LSU Center for Computation & Technology Louisiana State University Baton Rouge LA U.S.A. IPVS University of Stuttgart Stuttgart Germany Tactical Computing Labs Lindsay TX U.S.A. Department of Computer Science Louisiana State University Baton Rouge LA U.S.A.

ISBN: (数字)9798350355543

ISBN: (纸本)9798350355550

In recent years, interest in RISC-V computing architectures has moved from academic to mainstream, especially in the field of High Performance computing where energy limitations are increasingly a concern. As of this year, the first single board RISC-V CPUs implementing the finalized ratified vector specification are being released. The RISC-V vector specification follows in the tradition of vector processors found in the CDC STAR-100, the Cray-1, the Convex C-Series, and the NEC SX machines and accelerators. The family of vector processors offers support for variable-length array processing as opposed to the fixed-length processing functionality offered by SIMD. Vector processors offer opportunities to perform vector-chaining which allows temporary results to be used without the need to resolve memory *** this work, we use the Octo-Tiger multi-physics, multi-scale, 3D adaptive mesh refinement astrophysics application to study these early RISC-V chips with vector machine support. We report on our experience in porting this modern C++ code (which is built upon several open-source libraries such as HPX and Kokkos) to RISC-V. In addition, we show the impact of the RISC-V Vector extension on a RISC-V single board computer by implementing the std :: experimental:simd interface and integrating it with our code. We also compare the application’s performance, scalability, and power consumption on desktop-grade RISC-V computer to an A64FX *** results presented in this paper are part of a longer-term evaluation of RISC-V’s viability for HPC applications.

关键词： Power demand Astrophysics High performance computing Europe computer architecture Hardware Vectors Supercomputers Libraries Vector processors

来源：评论

学校读者我要写书评

暂无评论

AMG Preconditioners based on Parallel Hybrid Coarsening and Multi-objective Graph Matching

AMG Preconditioners based on Parallel Hybrid Coarsening and ...

引用

Euromicro Conference on Parallel, Distributed and Network-Based Processing

作者： Pasqua D'Ambra Fabio Durastante S M Ferdous Salvatore Filippone Mahantesh Halappanavar Alex Pothen National Research Council (CNR) Institute for Applied Computing “M. Picone” (IAC) Napoli Italy Department of Mathematics University of Pisa Pisa Italy Pacific Northwest National Laboratory Physical and Computational Sciences Richland WA USA Dept. of Civil and Computer Engineering University of Rome Tor-Vergata Rome Italy Computer Science Department Purdue University West Lafayette IN USA

We describe preliminary results from a multi-objective graph matching algorithm, in the coarsening step of an aggregation-based Algebraic MultiGrid (AMG) preconditioner, for solving large and sparse linear systems of equations on high-end parallel computers. We have two objectives. First, we wish to improve the convergence behavior of the AMG method when applied to highly anisotropic problems. Second, we wish to extend the parallel package PSCToolkit to exploit multi-threaded parallelism at the node level on multi-core processors. Our matching proposal balances the need to simultaneously compute high weights and large cardinalities by a new formulation of the weighted matching problem combining both these objectives using a parameter $\lambda$ . We compute the matching by a parallel $2/3-\varepsilon$ -approximation algorithm for maximum weight matchings. Results with the new matching algorithm show that for a suitable choice of the parameter $\lambda$ we compute effective preconditioners in the presence of anisotropy, i.e., smaller solve times, setup times, iterations counts, and operator complexity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence for science in Quantum, Atomistic, and Continuum Systems

arXiv

引用

arXiv 2023年

作者： Zhang, Xuan Wang, Limei Helwig, Jacob Luo, Youzhi Fu, Cong Xie, Yaochen Liu, Meng Lin, Yuchao Xu, Zhao Yan, Keqiang Adams, Keir Weiler, Maurice Li, Xiner Fu, Tianfan Wang, Yucheng Strasser, Alex Yu, Haiyang Xie, YuQing Fu, Xiang Xu, Shenglong Liu, Yi Du, Yuanqi Saxton, Alexandra Ling, Hongyi Lawrence, Hannah Stärk, Hannes Gui, Shurui Edwards, Carl Gao, Nicholas Ladera, Adriana Wu, Tailin Hofgard, Elyssa F. Tehrani, Aria Mansouri Wang, Rui Daigavane, Ameya Bohde, Montgomery Kurtin, Jerry Huang, Qian Phung, Tuong Xu, Minkai Joshi, Chaitanya K. Mathis, Simon V. Azizzadenesheli, Kamyar Fang, Ada Aspuru-Guzik, Alán Bekkers, Erik Bronstein, Michael Zitnik, Marinka Anandkumar, Anima Ermon, Stefano Liò, Pietro Yu, Rose Günnemann, Stephan Leskovec, Jure Ji, Heng Sun, Jimeng Barzilay, Regina Jaakkola, Tommi Coley, Connor W. Qian, Xiaoning Qian, Xiaofeng Smidt, Tess Ji, Shuiwang Department of Computer Science & Engineering Texas A&M University College StationTX United States Department of Chemical Engineering Massachusetts Institute of Technology Cambridge United Kingdom AMLab University of Amsterdam Amsterdam Netherlands Department of Computer Science University of Illinois Urbana-Champaign UrbanaIL United States Department of Electrical & Computer Engineering Texas A&M University College StationTX United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge United Kingdom Department of Materials Science & Engineering Texas A&M University College StationTX United States Department of Physics & Astronomy Texas A&M University College StationTX United States Department of Applied Mathematics & Statistics Stony Brook University Stony BrookNY United States Department of Computer Science Stony Brook University Stony BrookNY United States Department of Computer Science Cornell University IthacaNY United States Department of Computer Science Technical University of Munich München Germany Department of Computer Science Stanford University StanfordCA United States Department of Computer Science & Engineering University of California San Diego La Jolla CA United States Department of Computer Science & Technology University of Cambridge Cambridge United Kingdom Nvidia Santa ClaraCA United States Department of Chemistry and Chemical Biology Harvard University Cambridge United Kingdom Department of Chemistry University of Toronto Toronto Canada Department of Computer Science University of Toronto Toronto Canada Department of Computer Science University of Oxford Oxford United Kingdom Department of Biomedical Informatics Harvard University BostonMA United States Department of Computing & Mathematical Sciences California Institute of Technology PasadenaCA United States Computational Science Initiative Brookhaven National Laboratory UptonNY United States

Advances in artificial intelligence (AI) are fueling a new paradigm of discoveries in natural sciences. Today, AI has started to advance natural sciences by improving, accelerating, and enabling our understanding of natural phenomena at a wide range of spatial and temporal scales, giving rise to a new area of research known as AI for science (AI4science). Being an emerging research paradigm, AI4science is unique in that it is an enormous and highly interdisciplinary area. Thus, a unified and technical treatment of this field is needed yet challenging. This work aims to provide a technically thorough account of a subarea of AI4science;namely, AI for quantum, atomistic, and continuum systems. These areas aim at understanding the physical world from the subatomic (wavefunctions and electron density), atomic (molecules, proteins, materials, and interactions), to macro (fluids, climate, and subsurface) scales and form an important subarea of AI4science. A unique advantage of focusing on these areas is that they largely share a common set of challenges, thereby allowing a unified and foundational treatment. A key common challenge is how to capture physics first principles, especially symmetries, in natural systems by deep learning methods. We provide an in-depth yet intuitive account of techniques to achieve equivariance to symmetry transformations. We also discuss other common technical challenges, including explainability, out-of-distribution generalization, knowledge transfer with foundation and large language models, and uncertainty quantification. To facilitate learning and education, we provide categorized lists of resources that we found to be useful. We strive to be thorough and unified and hope this initial effort may trigger more community interests and efforts to further advance AI4science. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：