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

DieT Transformer model with PCA-ADE integration for advanced multi-class brain tumor classification

Intelligence-Based Medicine 2025年 11卷 100192-100192页

作者： Amin, Mohammad Nahar, Khalid M.O. Gharaibeh, Hasan Nasayreh, Ahmad Alsalmanc, Neda'a Alomar, Alaa Malkawi, Majd Alqasem, Noor Smerat, Aseel Zitar, Raed Abu Nusier, Shawd Ezugwu, Absalom E. Abualigah, Laith Department of Information Technology and Computer Sciences Yarmouk University Irbid 211633 Jordan Faculty of Computer Studies Arab Open University P.O.Box 84901 Riyadh 11681 Saudi Arabia Department of Computer Science Faculty of Information Technology Jordan University of Science and Technology Irbid 22110 Jordan Department of Medicine Faculty of Medicine Jordan University of Science and Technology Irbid 22110 Jordan Department of Biomedical Systems and Informatics Engineering Hijjawi Faculty for Engineering Technology Yarmouk University Irbid 21163 Jordan Centre for Research Impact & Outcome Chitkara University Institute of Engineering and Technology Chitkara University Punjab Rajpura 140401 India Department of Biosciences Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai 602105 India Artificial Intelligence and Sensing Technologies (AIST) Research Center University of Tabuk Tabuk 71491 Saudi Arabia Faculty of Engineering and Computing Liwa College Abu Dhabi United Arab Emirates Department of Health and Clinical Outcomes Research Saint Louis University St. Louis MO United States Unit for Data Science and Computing North-West University 11 Hofman Street Potchefstroom 2520 South Africa Computer Science Department Al al-Bayt University Mafraq 25113 Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman 19328 Jordan

Early and accurate diagnosis of brain tumors is crucial to improving patient outcomes and optimizing treatment strategies. Long-term brain injury results from aberrant proliferation of either malignant or nonmalignant tissues in the brain. MRIs, or magnetic resonance imaging, are one of the most used approaches for detecting brain tumors. Professionals physically evaluate people after they have had MRI filtering, the process of enhancing MRI scans for radiologist interpretation, to establish if they have a brain tumor. Because different specialists use different frames to make judgments on the same MRI image, their analyses may yield contradictory results. Furthermore, simply detecting a tumor is insufficient. Inconsistent diagnoses can lead to delays in treatment, impacting survival rates and quality of care. It is also crucial to diagnose the patient's tumor so that treatment can begin as soon as possible. In this research, we investigate the multi-class classification of brain tumors utilizing a cutting-edge methodology that includes feature extraction from pictures using the DieT Transformer model, dimensionality reduction with PCA, and feature selection using the ADE algorithm. The proposed model, known in the publication as ADE_DieT, obtained an accuracy of 96.09 %. In addition, this article analyzes the performance of various pre-trained models, including MobileNetV3, NasNet, ResNet50, VGG16, VGG19, and DeiT. The proposed approach shortens the time required for manual diagnosis by clinicians by assisting in the rapid and accurate identification of brain tumors using MRI data. In oncology, this is important since it allows for early treatment. Integrating ADE_DieT into clinical workflows can support radiologists by reducing diagnosis time and enhancing diagnostic consistency. © 2024 The Authors

关键词： Brain tumor Medical image analysis MRI Vision Transformer

来源：评论

学校读者我要写书评

暂无评论

Extracting logical structure and identifying stragglers in parallel execution traces 14

Extracting logical structure and identifying stragglers in p...

引用

2014 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014

作者： Isaacs, Katherine E. Gamblin, Todd Bhatele, Abhinav Bremer, Peer-Timo Schulz, Martin Hamann, Bernd Department of Computer Science University of California Davis United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)9781450326568

We introduce a new approach to automatically extract an idealized logical structure from a parallel execution trace. We use this structure to define intuitive metrics such as the lateness of a process involved in a parallel execution. By analyzing and illustrating traces in terms of logical steps, we leverage a developer's understanding of the happened-before relations in a parallel program. This technique can uncover dependency chains, elucidate communication patterns, and highlight sources and propagation of delays, all of which may be obscured in a traditional trace visualization.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Extracting logical structure and identifying stragglers in parallel execution traces

Extracting logical structure and identifying stragglers in p...

引用

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Boundary determination for trivariate solids 7

Boundary determination for trivariate solids

引用

7th Pacific Conference on computer Graphics and Applications, Pacific Graphics 1999

作者： Joy, Kenneth I. Duchaineau, Mark A. Computer Science Department University of California Davis United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)0769502938

The trivariate tensor-product B-spline solid is a direct extension of the B-spline patch and has been shown to be useful in the creation and visualization of free-form geometric solids. Visualizing these solid objects requires the determination of the boundary surface of the solid, which is a combination of parametric and implicit surfaces. This paper presents a method that determines the implicit boundary surface by examination of the Jacobian determinant of the defining B-spline function. Using an approximation to this determinant, the domain space is adaptively subdivided until a mesh can be determined such that the boundary surface is close to linear in the cells of the mesh. A variation of the marching cubes algorithm is then used to draw the surface. Interval approximation techniques are used to approximate the Jacobian determinant and to approximate the Jacobian determinant gradient for use in the adaptive subdivision methods. This technique can be used to create free-form solid objects, useful in geometric modeling applications. © 1999 IEEE.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Supporting multiple accelerators in high-level programming models 6

Supporting multiple accelerators in high-level programming m...

引用

6th International Workshop on Programming Models and Applications for Multicores and Manycores, PMAM 2015

作者： Yan, Yonghong Lin, Pei-Hung Liao, Chunhua De Supinski, Bronis R. Quinlan, Daniel J. Department of Computer Science and Engineering Oakland University United States Center of Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)9781450334044

Computational accelerators, such as manycore NVIDIA GPUs, Intel Xeon Phi and FPGAs, are becoming common in work-stations, servers and supercomputers for scientific and engineering applications. Efficiently exploiting the massive parallelism these accelerators provide requires the designs and implementations of productive programming models. In this paper, we explore support of multiple accelerators in high-level programming models. We design novel language extensions to OpenMP to support offloading data and computation regions to multiple accelerators (devices). These extensions allow for distributing data and computation among a list of devices via easy-to-use interfaces, including specifying the distribution of multi-dimensional arrays and declaring shared data regions among accelerators. Computation distribution is realized by partitioning a loop iteration space among accelerators. We implement mechanisms to marshal/unmarshal and to move data of non-contiguous array subregions and shared regions between accelerators without involving CPUs. We design reduction techniques that work across multiple accelerators. Combined compiler and runtime support is designed to manage multiple GPUs using asynchronous operations and threading mechanisms. We implement our solutions for NVIDIA GPUs and demonstrate through example OpenMP codes the effectiveness of our solutions for performance improvement. Copyright © 2015 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Testing the Unknown: A Framework for OpenMP Testing via Random Program Generation

Testing the Unknown: A Framework for OpenMP Testing via Rand...

引用

2024 Workshops of the International Conference for High Performance computing, Networking, Storage and Analysis, SC Workshops 2024

作者： Laguna, Ignacio Chapman, Patrick Parasyris, Konstantinos Georgakoudis, Giorgis Rubio-Gonzalez, Cindy Lawrence Livermore National Laboratory Center for Applied Scientific Computing United States University of California Department of Computer Science Davis United States

ISBN: (纸本)9798350355543

We present a randomized differential testing approach to test OpenMP implementations. In contrast to previous work that manually creates dozens of verification and validation tests, our approach is able to randomly generate thousands of tests, exposing OpenMP implementations to a wide range of program behaviors. We represent the space of possible random OpenMP tests using a grammar and implement our method as an extension of the Varity program generator. By generating 1,800 OpenMP tests, we find various performance anomalies and correctness issues when we apply them to three OpenMP implementations: GCC, Clang, and Intel. We also present several case studies that analyze the anomalies and give more details about the classes of tests that our approach creates. © 2024 IEEE.

关键词： differential testing OpenMP random program generation software testing

来源：评论

学校读者我要写书评

暂无评论

Towards ontology-based program analysis 30

Towards ontology-based program analysis

引用

30th European Conference on Object-Oriented Programming, ECOOP 2016

作者： Zhao, Yue Chen, Guoyang Liao, Chunhua Shen, Xipeng Department of Computer Science North Carolina State University United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)9783959770149

Program analysis is fundamental for program optimizations, debugging, and many other tasks. But developing program analyses has been a challenging and error-prone process for general users. Declarative program analysis has shown the promise to dramatically improve the productivity in the development of program analyses. Current declarative program analysis is however subject to some major limitations in supporting cooperations among analysis tools, guiding program optimizations, and often requires much effort for repeated program preprocessing. In this work, we advocate the integration of ontology into declarative program analysis. As a way to standardize the definitions of concepts in a domain and the representation of the knowledge in the domain, ontology offers a promising way to address the limitations of current declarative program analysis. We develop a prototype framework named PATO for conducting program analysis upon ontology-based program representation. Experiments on six program analyses confirm the potential of ontology for complementing existing declarative program analysis. It supports multiple analyses without separate program preprocessing, promotes cooperative Liveness analysis between two compilers, and effectively guides a data placement optimization for Graphic Processing Units (GPU). © Yue Zhao and Chunhua Liao and Xipeng Shen;licensed under Creative Commons License CC-BY.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A scalable eigensolver for large scale-free graphs using 2D graph partitioning

A scalable eigensolver for large scale-free graphs using 2D ...

引用

2011 International Conference for High Performance computing, Networking, Storage and Analysis, SC11

作者： Yoo, Andy Baker, Allison H. Pearce, Roger Henson, Van Emden Lawrence Livermore National Laboratory Center for Applied Scientific Computing United States Department of Computer Science and Engineering Texas A and M University United States

ISBN: (纸本)9781450307710

Eigensolvers are important tools for analyzing and mining useful information from scale-free graphs. Such graphs are used in many applications and can be extremely large. Unfortunately, existing parallel eigensolvers do not scale well for these graphs due to the high communication overhead in the parallel matrix-vector multiplication (MatVec). We develop a MatVec algorithm based on 2D edge partitioning that significantly reduces the communication costs and embed it into a popular eigensolver library. We demonstrate that the enhanced eigensolver can attain two orders of magnitude performance improvement compared to the original on a state-of-art massively parallel machine. We illustrate the performance of the embedded MatVec by computing eigenvalues of a scale-free graph with 300 million vertices and 5 billion edges, the largest scale-free graph analyzed by any in-memory parallel eigensolver, to the best of our knowledge. Copyright 2011 ACM.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Enhancing domain specific language implementations through ontology 5

Enhancing domain specific language implementations through o...

引用

5th International Workshop on Domain-Specific Languages and High-Level Frameworks for High Performance computing, WOLFHPC 2015

作者： Liao, Chunhua Lin, Pei-Hung Quinlan, Daniel J. Zhao, Yue Shen, Xipeng Lawrence Livermore National Laboratory Center for Applied Scientific Computing United States Computer Science Department North Carolina State University United States

ISBN: (纸本)9781450340168

Domain specific languages (DSLs) offer an attractive path to program large-scale, heterogeneous parallel computers since application developers can leverage high-level annotations defined by DSLs to efficiently express algorithms without being distracted by low-level hardware details. However, performance of DSL programs heavily relies on how well a DSL implementation, including compilers and runtime systems, can exploit knowledge across multiple layers of software/ hardware environments for optimizations. The knowledge ranges from domain assumptions, high-level DSL semantics, to low-level hardware features. Traditionally, such knowledge is either implicitly assumed or represented using ad-hoc approaches, including narrative text, source-level annotations, or customized software and hardware specifications in high performance computing (HPC). The lack of a formal, uniform, extensible, reusable and scalable knowledge management approach is becoming a major obstacle to efficient DSLs implementations targeting fast-changing parallel architectures. In this paper, we present a novel DSL implementation paradigm using an ontology-based knowledge base to formally and uniformly exploit the knowledge needed for optimizations. An ontology is a formal and explicit knowledge representation to describe concepts, properties, and individuals in a domain. During the past decades, a wide range of ontology standards and tools have been developed to help users capture, share, utilize and reason domain knowledge. Using modern ontology techniques, we design a knowledge base capturing concepts and properties of a problem domain, DSL programs, and hardware architectures. Compiler interfaces are also defined to allow interactions with the knowledge base to assist program analysis, optimization and code generation. Our preliminary evaluation using stencil computation shows the feasibility and benefits of our approach. © 2015 ACM.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

The C-Cat WordNet package: An open source package for modifying and applying WordNet

The C-Cat WordNet package: An open source package for modify...

引用

6th International Global Wordnet Conference, GWC 2012

作者： Stevens, Keith Huang, Terry Buttler, David Department of Computer Science University of California Los Angeles 90095 United States Center for Applied Scientific Computing LLNL Livermore 94550 United States

ISBN: (纸本)9788026302445

We present the C-Cat Wordnet package, an open source library for using and modifying Wordnet. The package includes four key features: an API for modifying Synsets;implementations of standard similarity metrics, implementations of wellknown Word Sense Disambiguation algorithms, and an implementation of the Castanet algorithm. The library is easily extendible and usable in many runtime environments. We demonstrate it's use on two standard Word Sense Disambiguation tasks and apply the Castanet algorithm to a corpus. © Christiane Fellbaum, Piek Vossen, 2012.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：