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

Enhanced prairie dog optimization with Levy flight and dynamic opposition-based learning for global optimization and engineering design problems

引用

Neural computing and Applications 2024年第19期36卷 11137-11170页

作者： Biswas, Saptadeep Shaikh, Azharuddin Ezugwu, Absalom El-Shamir Greeff, Japie Mirjalili, Seyedali Bera, Uttam Kumar Abualigah, Laith Department of Mathematics National Institute of Technology Agartala Tripura Agartala India Unit for Data Science and Computing North-West University 11 Hoffman Street Potchefstroom2520 South Africa Faculty of Natural and Agricultural Sciences School of Computer Science and Information Systems North-West University Vanderbijlpark South Africa Centre for Artificial Intelligence Research and Optimization Torrens University Australia Fortitude Valley BrisbaneQLD4006 Australia Research Center University of Tabuk Tabuk71491 Saudi Arabia Computer Science Department Al al-Bayt University Mafraq25113 Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman19328 Jordan Applied Science Research Center Applied Science Private University Amman11931 Jordan Department of Electrical and Computer Engineering Lebanese American University Byblos13-5053 Lebanon School of Engineering and Technology Sunway University Malaysia Petaling Jaya27500 Malaysia College of Engineering Yuan Ze University Taoyuan32003 Taiwan MEU Research Unit Middle East University Amman11831 Jordan

This study proposes a new prairie dog optimization algorithm version called EPDO. This new version aims to address the issues of premature convergence and slow convergence that were observed in the original PDO algorithm. To improve performance, several modifications are introduced in EPDO. First, a dynamic opposite learning strategy is employed to increase the diversity of the population and prevent premature convergence. This strategy helps the algorithm avoid falling into local optima and promotes global optimization. Additionally, the Lévy dynamic random walk technique is utilized in EPDO. This modified Lévy flight with random walk reduces the algorithm’s running time for the test function’s ideal value, accelerating its convergence. The proposed approach is evaluated using 33 benchmark problems from CEC 2017 and compared against seven other comparative techniques: GWO, MFO, ALO, WOA, DA, SCA, and RSA. Numerical results demonstrate that EPDO produces good outcomes and performs well in solving benchmark problems. To further validate the results and assess reliability, the authors employ average rank tests, the measurement of alternatives, and ranking according to the compromise solution (MARCOS) method, as well as a convergence report of EPDO and other algorithms. Furthermore, the effectiveness of the EPDO algorithm is demonstrated by applying it to five design problems. The results indicate that EPDO achieves impressive outcomes and proves its capability to address practical issues. The algorithm performs well in solving benchmark and practical design problems, as supported by the numerical results and validation methods used in the study. © The Author(s) 2024.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT NONLINEAR MULTISCALE SPECTRAL GFEM applied TO COMPOSITE AEROSPACE STRUCTURES 23

EFFICIENT NONLINEAR MULTISCALE SPECTRAL GFEM APPLIED TO COMP...

引用

23rd International Conference on Composite Materials, ICCM 2023

作者： Bénézech, J. Seelinger, L. Reinarz, A. Dodwell, T.J. Butler, R. Scheichl, R. Material & Structure Research Centre University of Bath Bath United Kingdom Interdisciplinary Center for Scientific Computing Institute for Applied Mathematics Heidelberg University Heidelberg Germany Department of Computer Science Durham University Durham United Kingdom Institute of Data Science and AI University of Exeter Exeter United Kingdom DigiLab Exeter United Kingdom

来源：评论

学校读者我要写书评

暂无评论

Testing GPU Numerics: Finding Numerical Differences Between NVIDIA and AMD GPUs

arXiv

引用

arXiv 2024年

作者： Zahid, Anwar Hossain Laguna, Ignacio Le, Wei Department of Computer Science Iowa State University AmesIA United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA United States

As scientific codes are ported between GPU platforms, continuous testing is required to ensure numerical robustness and identify potential numerical differences between platforms. Compiler-induced numerical differences can occur when a program is compiled and run on different GPUs and compilers, and the numerical outcomes are different for the same input. We present a study of compiler-induced numerical differences between NVIDIA and AMD GPUs, two widely used GPUs in HPC clusters. Our approach uses a random program generator (Varity) to generate thousands of short numerical tests in CUDA and HIP, and their inputs;then, we use differential testing to check if the program produced a numerical inconsistency when run on NVIDIA and AMD GPUs, using the same compiler optimization level. We also use the AMD’s HIPIFY tool to convert CUDA tests into HIP tests and test if there are numerical inconsistencies induced by HIPIFY. In our study, we generated more than 600,000 tests and found subtle numerical differences occurring between the two classes of GPUs. We found that some of the differences come from (1) math library calls, (2) differences in floating-point precision (FP64 versus FP32), and (3) converting code to HIP with HIPIFY. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Direct GPU Compilation and Execution for Host Applications with OpenMP Parallelism 8

Direct GPU Compilation and Execution for Host Applications w...

引用

8th IEEE/ACM Annual Workshop on the LLVM Compiler Infrastructure in HPC, LLVM-HPC 2022

作者： Tian, Shilei Huber, Joseph Parasyris, Konstantinos Chapman, Barbara Doerfert, Johannes Stony Brook University Department of Computer Science Stony Brook United States Advanced Micro Devices Austin United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore United States

ISBN: (纸本)9781665475587

Currently, offloading to accelerators requires users to identify which regions are to be executed on the device, what memory needs to be transferred, and how synchronization is to be resolved. On top of these manual tasks, many standard (C/C++ library) functions, such as file I/O or memory manipulation, cannot be directly executed on the device and need to be worked around by the user explicitly. This makes it challenging to port programs in the first place and hinders developers from testing features on the GPU and within the GPU compilation pipeline. Existing tests and test suites for the host are effectively unusable for accelerators and need to be manually ported to provide the same benefits for the devices as they do on the host. In this paper, we propose a direct GPU compilation scheme that leverages the portable target offloading interface provided by LLVM/OpenMP. Utilizing this infrastructure allows us to compile an existing host application for the GPU and execute it there with only a minimal wrapper layer for the user code, command line arguments, and a compiler provided GPU implementation of C/C++ standard library functions. The C/C++ library functions are partially implemented for direct device execution and otherwise fallback to remote procedure call (RPC) to call host functions transparently. Our proposed prototype will allow users to quickly compile for, and test on, the GPU without explicitly handling kernel launches, data mapping, or host-device synchronization. We evaluate our implementation using three proxy applications with host OpenMP parallelism and three microbenchmarks to test the correctness of our prototype GPU compilation. © 2022 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

The Advanced Encryption Standard with a Dynamic S-Box Using the RC4 Key Schedule 4

The Advanced Encryption Standard with a Dynamic S-Box Using ...

引用

4th IEEE International Conference on Electrical, computer, and Energy Technologies, ICECET 2024

作者： Altigani, Abdelrahman Ghalib, Muhammad Rukunuddin Elshoush, Huwaida T. Elsadig, Muawia A. Alrefai, Nashat Naserelden, Shiraz Higher Colleges of Technology Computer Information Science Al Ain United Arab Emirates School of Engineering & Computing De Monfort University Dubai United Arab Emirates University of Khartoum Faculty of Mathematical Sciences and Informatics Computer Science Department Khartoum Sudan College of Computer Science and Information Technology Imam Abdulrahman bin Faisal University Dammam Saudi Arabia College of Science Imam Abdulrahman Bin Faisal University Basic and Applied Scientific Research Center Imam Abdulrahman Bin Faisal University Department of Mathematics Dammam Saudi Arabia Faculty of Science Universiti Teknologi Malaysia Department of Mathematical Sciences Johor Malaysia

ISBN: (纸本)9798350395914

Since the inception of secure communication, safeguarding data confidentiality has been paramount. With the increased reliance on technology, the need for robust security mechanisms is more critical than ever. This paper explores confidentiality in cybersecurity, focusing on symmetric encryption algorithms. While symmetric encryption, particularly the Advanced Encryption Standard (AES), is in wide use, concerns arise regarding its static nature. Therefore, the paper introduces a dynamic cipher, augmenting AES security by introducing a key-dependent S-Box. By leveraging the RC4 key schedule, the proposed cipher generates unique S-Boxes for each encryption key, significantly increasing security against non-generic attacks. Theoretical analysis demonstrates the proposed cipher is capable of resisting brute force, linear cryptanalysis, and differential cryptanalysis. Furthermore, its adaptability to existing AES implementations ensures practicality and ease of adoption. © 2024 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

HPC Application Parameter Autotuning on Edge Devices: A Bandit Learning Approach

arXiv

引用

arXiv 2025年

作者： Hossain, Abrar Badawy, Abdel-Hameed A. Islam, Mohammad A. Patki, Tapasya Ahmed, Kishwar Department of Electrical Engineering and Computer Science The University of Toledo United States Department of Electrical and Computer Engineering New Mexico State University United States Department of Computer Science and Engineering The University of Texas Arlington United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory

The growing necessity for enhanced processing capabilities in edge devices with limited resources has led us to develop effective methods for improving high-performance computing (HPC) applications. In this paper, we introduce LASP (Lightweight Autotuning of scientific Application Parameters), a novel strategy designed to address the parameter search space challenge in edge devices. Our strategy employs a multi-armed bandit (MAB) technique focused on online exploration and exploitation. Notably, LASP takes a dynamic approach, adapting seamlessly to changing environments. We tested LASP with four HPC applications: Lulesh, Kripke, Clomp, and Hypre. Its lightweight nature makes it particularly well-suited for resource-constrained edge devices. By employing the MAB framework to efficiently navigate the search space, we achieved significant performance improvements while adhering to the stringent computational limits of edge devices. Our experimental results demonstrate the effectiveness of LASP in optimizing parameter search on edge devices. © 2025, CC BY-NC-ND.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

HPC-Coder: Modeling Parallel Programs using Large Language Models

HPC-Coder: Modeling Parallel Programs using Large Language M...

引用

ISC High Performance 2024 Research Paper Proceedings (39th International Conference)

作者： Daniel Nichols Aniruddha Marathe Harshitha Menon Todd Gamblin Abhinav Bhatele Department of Computer Science University of Maryland College Park MD USA Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA USA Livermore Computing Lawrence Livermore National Laboratory Livermore CA USA

Parallel programs in high performance computing (HPC) continue to grow in complexity and scale in the exascale era. The diversity in hardware and parallel programming models make developing, optimizing, and maintaining parallel software even more burdensome for developers. One way to alleviate some of these burdens is with automated development and analysis tools. Such tools can perform complex and/or remedial tasks for developers that increase their productivity and decrease the chance for error. Until recently, such tools for code development and performance analysis have been limited in the complexity of tasks they can perform, especially for parallel programs. However, with recent advancements in language modeling, and the availability of large amounts of open-source code related data, these tools have started to utilize predictive language models to automate more complex tasks. In this paper, we show how large language models (LLMs) can be applied to tasks specific to high performance and scientific codes. We introduce a new dataset of HPC and scientific codes and use it to fine-tune several pre-trained models. We compare several pre-trained LLMs on HPC-related tasks and introduce a new model, HPC-Coder, fine-tuned on parallel codes. In our experiments, we show that this model can auto-complete HPC functions where generic models cannot, decorate for loops with OpenMP pragmas, and model performance changes in scientific application repositories as well as programming competition solutions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ML-based Modeling to Predict I/O Performance on Different Storage Sub-systems

ML-based Modeling to Predict I/O Performance on Different St...

引用

International Conference on High Performance computing

作者： Yiheng Xu Pranav Sivaraman Hariharan Devarajan Kathryn Mohror Abhinav Bhatele Palantir Technologies Inc. Denver USA Department of Computer Science University of Maryland College Park USA Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore USA

ISBN: (数字)9798331509095

ISBN: (纸本)9798331509101

Parallel applications can spend a significant amount of time performing I/O on large-scale supercomputers. Fast near-compute storage accelerators called burst buffers can reduce the time a processor spends performing I/O and mitigate I/O bottlenecks. However, determining if a given application could be accelerated using burst buffers is not straightforward even for storage experts. The relationship between an application's I/O characteristics (such as I/O volume, processes involved, etc.) and the best storage sub-system for it can be complicated. As a result, adapting parallel applications to use burst buffers efficiently is a trial-and-error process. In this work, we present a Python-based tool called PrismIO that enables programmatic analysis of I/O traces. Using PrismIO, we identify performance bottlenecks when using burst buffers and parallel file systems, and explain why certain I/O patterns perform poorly. Further, we use machine learning to model the relationship between I/O characteristics and file system selections. We use IOR, an I/O benchmark to gather performance data for training the machine learning model. Our model can predict the better performing storage system for unseen IOR scenarios with an accuracy of 94.47% and for four real applications with an accuracy of 95.86%.

关键词： Training Accuracy File systems Computational modeling High performance computing Machine learning Predictive models Benchmark testing Data models Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Machine Learning and Network Traffic to Distinguish Between Malware and Benign Applications 1st

Machine Learning and Network Traffic to Distinguish Between ...

引用

1st International Conference on Pervasive Knowledge and Collective Intelligence on Web and Social Media, PerSOM 2022

作者： Abualigah, Laith Abualigah, Sayel Almahmoud, Mothanna Forestiero, Agostino Sachdeva, Gagan Hanandeh, Essam S. Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman Jordan Faculty of Information Technology Middle East University Amman Jordan Applied Science Research Center Applied Science Private University Amman Jordan School of Computer Sciences Universiti Sains Malaysia Pulau Pinang George Town Malaysia Computer Science Department Prince Hussein Bin Abdullah Faculty for Information Technology Al Al-Bayt University Mafraq25113 Jordan Department of Computer Information Systems Jordan University of Science and Technology Ar-Ramtha Jordan Performance Computing and Networking National Research Council of Italy Rende87036 Italy First Abu Dhabi Bank Abu Dhabi United Arab Emirates Department of Computer Information System Zarqa University Zarqa Jordan

ISBN: (纸本)9783031314681

Virus detection software is widely used for servers, systems, and devices that seek to maintain security and reliability. Although these programs provide an excellent safety level, the traditional defense methods fail to detect new Malware. The more advanced approach relies on predicting malicious behavior with dynamic analysis of the process executed. This paper presents a new method for detecting malware using machine learning algorithms applied to data obtained from the Cuckoo sandbox. The Cuckoo sandbox isolates the file being analyzed, providing detailed dynamic analysis reports. The machine learning algorithms were compared and the most important features were identified. The results were obtained using six popular classifiers, including SVM, Random Forest, and LightGBM, and the XGBOOST algorithm had the highest accuracy, at an average of 97%. However, the research on machine learning-based malware analysis is limited in terms of computational complexity and detection accuracy. © 2023, ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

A Two-level GPU-Accelerated Incomplete LU Preconditioner for General Sparse Linear Systems

arXiv

引用

arXiv 2023年

作者： Xu, Tianshi Li, Ruipeng Osei-Kuffuor, Daniel Department of Computer Science and Engineering University of Minnesota Minnesota United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory CA United States

This paper presents a parallel preconditioning approach based on incomplete LU (ILU) factorizations in the framework of Domain Decomposition (DD) for general sparse linear systems. We focus on distributed memory parallel architectures, specifically, those that are equipped with graphic processing units (GPUs). In addition to block Jacobi, we present general purpose two-level ILU Schur complement-based approaches, where different strategies are presented to solve the coarse-level reduced system. These strategies are combined with modified ILU methods in the construction of the coarse-level operator, in order to effectively remove smooth errors. We leverage available GPU-based sparse matrix kernels to accelerate the setup and the solve phases of the proposed ILU preconditioner. We evaluate the efficiency of the proposed methods as a smoother for algebraic multigrid (AMG) and as a preconditioner for Krylov subspace methods, on challenging anisotropic diffusion problems and a collection of general sparse *** Codes G.1.3 Copyright © 2023, The Authors. All rights reserved.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：