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

32nd IEEE Conference on Virtual Reality and 3D User Interfaces, VR 2025

作者： Pavanatto, Leonardo Giovannelli, Alexander Giera, Brian Bremer, Timo Miao, Haichao Bowman, Doug A. Virginia Tech Center for Human-Computer Interaction Department of Computer Science United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing United States

ISBN: (纸本)9798331536459

Locating small features in a large, dense object in virtual reality (VR) poses a significant interaction challenge. While existing multiscale techniques support transitions between various levels of scale, they are not focused on handling dense, homogeneous objects with hidden features. We propose a novel approach that applies the concept of progressive refinement to VR navigation, enabling focused inspections. We conducted a user study where we varied two independent variables in our design, navigation style (STRUCTURED vs. UNSTRUCTURED) and display mode (SELECTION vs. EVERYTHING), to better understand their effects on efficiency and awareness during multiscale navigation. Our results showed that unstructured navigation can be faster than structured and that displaying only the selection can be faster than displaying the entire object. However, using an everything display mode can support better location awareness and object understanding. © 2025 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Hardware-Accelerated Detection of Unauthorized Mining Activities Using YOLOv11 and FPGA

引用

International Journal of Advanced computer science and Applications 2025年第4期16卷 967-979页

作者： Ghodhbani, Refka Saidani, Taoufik Kachoukh, Amani Elsayed, Mahmoud Salaheldin Said, Yahia Ahmed, Rabie Center for Scientific Research and Entrepreneurship Northern Border University Arar73213 Saudi Arabia Department of Information Systems-Faculty of Computing and Information Technology Northern Border University Saudi Arabia Department of Computer Sciences-Faculty of Computing and Information Technology Northern Border University Saudi Arabia DCenter for Scientific Research and Entrepreneurship Northern Border University Arar73213 Saudi Arabia Department of Computer Science-Faculty of Computing and Information Technology Northern Border University Rafha Saudi Arabia Mathematics and Computer Science Department-Faculty of Science Beni-Suef University Beni-Suef Egypt

Illegal mining activities present significant environmental, economic, and safety challenges, particularly in remote and under-monitored regions. Traditional surveillance methods are often inefficient, labor-intensive, and unable to provide real-time insights. To address this issue, this study proposes a computer vision-based solution leveraging the state-of-the-art YOLOv11 Nano and Small models, fine-tuned for the detection of illegal mining activities. A specific dataset comprising aerial and ground-level images of mining sites was curated and annotated to train the models for identifying unauthorized excavation, equipment usage, and human presence in restricted zones. The proposed system integrates the hardware-software design of YOLOv11 on the PynqZ1 FPGA, offering a highperformance, low-latency, and energy-efficient solution suitable for real-time monitoring in resource-constrained environments. This hardware-accelerated approach combines FPGA's parallel processing capabilities with the lightweight deep learning models, enabling efficient deployment for automated illegal mining detection. By providing a scalable, real-time monitoring tool, this work contributes to the development of automated enforcement tools for the mining industry, ensuring better control and surveillance of mining activities. To validate the efficiency of deep learning deployment on edge devices, YOLOv11n was implemented on an FPGA, utilizing 70% of available LUTs, 50% of FFs, and 80% of DSPs, with 8.3 Mbits of on-chip memory. The design achieved 100.33 GOP/s throughput, 18 FPS at 55 ms latency, consuming 4.8 W, and delivering an energy efficiency of 20.90 GOP/s/W. © (2025), (science and Information Organization). All rights reserved.

关键词： Mining industry

来源：评论

学校读者我要写书评

暂无评论

Enhancing single-lead electrocardiogram arrhythmia detection with empirical mode decomposition

引用

Neural computing and Applications 2025年 1-23页

作者： Issa, Mohamed F. Yousry, Ahmed Tuboly, Gergely Wang, Zeyu Zoltan, Juhasz Selim, Mazen M. AbuEl-Atta, Ahmed H. Department of Scientific Computing Faculty of Computers and Artificial Intelligence Benha University Benha13511 Egypt Department of Computer Science Faculty of Computers and Artificial Intelligence Benha University Benha13511 Egypt Department of Electrical Engineering and Information Systems University of Pannonia Veszprem8200 Hungary Department of Mechatronics Delta University for Science and Technology Gamasa35712 Egypt

Cardiac arrhythmias pose a significant challenge to health care, requiring accurate and reliable detection methods to enable early diagnosis and treatment. However, traditional ECG beat classification methods often lack robustness and fail to generalize effectively to diverse clinical scenarios, particularly when using single-lead-I recordings, which are less studied compared to lead II. To address this gap, this paper proposes a novel method that combines deep learning and empirical mode decomposition (EMD) for arrhythmia detection using single-lead-I ECG recordings obtained with electrodes on each hand. The hybrid model comprises 149 layers of one-dimensional convolution, max pooling, and residual blocks. By leveraging EMD, it classifies ECG beats into normal beats, premature ventricular contractions, and atrial premature beats with high sensitivity (99.86%, 99.72%, and 99.84%, respectively) using the first four intrinsic mode functions (IMFs). The proposed method is applicable in clinical and out-of-hospital monitoring scenarios, and an accompanying web application provides real-time analysis and diagnostic results. This approach addresses a critical gap in lead-I ECG analysis, enhancing diagnostic precision and expanding the scope of ECG applications in health care. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Empirical mode decomposition

来源：评论

学校读者我要写书评

暂无评论

Optimizing Secure Multi-User ISAC Systems With STAR-RIS: A Deep Reinforcement Learning Approach for 6G Networks

引用

IEEE Access 2025年 13卷 31472-31484页

作者： Kamal, Mian Muhammad Zain Ul Abideen, Syed Al-Khasawneh, M.A. Alabrah, Amerah Sohail Ahmed Larik, Raja Irfan Marwat, Muhammad Southeast University School of Electronic Science and Engineering Jiangning Jiangsu Nanjing211189 China Qingdao University College of Computer Science and Technology Qingdao266071 China Al-Ahliyya Amman University Hourani Center for Applied Scientific Research Amman19111 Jordan Skyline University College School of Computing University City Sharjah Sharjah United Arab Emirates King Saud University College of Computer and Information Science Department of Information Systems Riyadh11543 Saudi Arabia Ilma University Department of Computer Science Sindh Karachi75190 Pakistan University of Science and Technology Bannu Department of Software Engineering Bannu28100 Pakistan

The rapid evolution of wireless communication technologies and the increasing demand for multi-functional systems have led to the emergence of integrated sensing and communication (ISAC) as a key enabler for future 6G networks. Simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) have recently garnered significant attention for their ability to enhance signal coverage and improve system efficiency. This paper investigates a STAR-RIS-assisted ISAC system designed to secure communication for multiple legitimate users (LUs) while safeguarding against multiple eavesdroppers (Eves). By jointly optimizing the base station (BS) transmit beamforming, STAR-RIS transmission and reflection coefficients, and receive filters, the proposed framework aims to maximize the long-term average secrecy rate for all LUs. Constraints are imposed to ensure minimum echo signal-to-noise ratios (SNRs) for sensing and meet the achievable rate requirements of LUs. To address the inherent complexity of this non-convex problem, two deep reinforcement learning (DRL) algorithms are proposed. Numerical results demonstrate that the proposed system achieves significant improvements in secrecy rate compared to conventional RIS setups. This work provides a scalable and efficient approach for secure multi-user ISAC systems, making it highly relevant for future 6G networks, smart cities, and IoT applications. © 2025 The Authors.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Proceedings of the SC '24 Workshops of the International Conference on High Performance computing, Network, Storage, and Analysis

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

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.

关键词： OpenMP

来源：评论

学校读者我要写书评

暂无评论

Polyp image segmentation based on improved planet optimization algorithm using reptile search algorithm

引用

Neural computing and Applications 2025年第8期37卷 6327-6349页

作者： Abd Elaziz, Mohamed Al-qaness, Mohammed A. A. Al-Betar, Mohammed Azmi Ewees, Ahmed A. Department of Mathematics Faculty of Science Zagazig University Zagazig Egypt College of Physics and Electronic Information Engineering Zhejiang Normal University Jinhua321004 China Zhejiang Institute of Optoelectronics Jinhua321004 China Faculty of Computer Science and Engineering Galala University Suze435611 Egypt Ajman University Ajman346 United Arab Emirates College of Computing and Information Technology University of Bisha Bisha Saudi Arabia Department of Computer Damietta University Damietta Egypt Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman Jordan

To recognize the potential for colon polyps to develop into cancer over time, early diagnosis is crucial for preventative healthcare. Timely identification significantly improves the prognosis and treatment outcomes for colorectal cancer patients. Image segmentation is crucial in medical image analysis for accurate diagnosis and treatment planning. Therefore, in this study, we present an alternative multilevel thresholding polyp segmentation method (MPOA) to enhance the segmentation of polyp images. The proposed method is based on enhancing the planet optimization algorithm (POA) by integrating operators from the reptile search algorithm (RSA). The evaluation of the developed MPOA is tested with different polyp images and compared with other image segmentation approaches. The results highlight the superior capability of MPOA, as evidenced by various performance measures in effectively segmenting polyp images. Furthermore, metrics such as peak signal-to-noise ratio (PSNR), structural similarity index (SSIM), and fitness values demonstrate that MPOA outperforms the basic version of POA and other methods. The evaluation outcomes underscore the significant impact of RSA in enhancing the performance of POA for the segmentation of polyp images. © The Author(s) 2025.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Hashgraph consensus-based simultaneous, asynchronous and big-data supported blockchain mechanism for IT-OT enabled critical infrastructure sectors

引用

Journal of Ambient Intelligence and Humanized computing 2025年 1-13页

作者： Hasan, Mohammad Kamrul Ghazal, Taher M. Issa, Ghassan Islam, Shayla Ismail, Ahmad Fadzil Kabir, S. Rayhan Bangi43600 Malaysia Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman11937 Jordan School of Computing Skyline University College University City Sharjah Skyline University College Sharjah1797 United Arab Emirates Institue of Computer Science and Digitial Innovation UCSI University Malaysia Kuala Lumpur56000 Malaysia Department of Electrical and Computer Engineering International Islamic University of Malaysia Kuala Lumpur53000 Malaysia

Critical Infrastructure (CI) refers to the essential areas made up of public, private, and business sectors for the security of a country's development, such as electricity, water, health, education, etc. where information technologies (ITs) and operational technologies (OTs) enable automation services of CI. Currently, blockchain is being experimented in various CI sectors and any CI sector accumulates the data of millions of people in a country or nation from which big data is being generated. Big data connections are seen with large-scale blockchain networks because as the size of the blockchain network increases, so does the amount of connected data. Typically, the blockchain does not support asynchronous and simultaneous processes that indicate multiple block compilation does not allow at the same time for the blockchain systems. That is why high energy consumption, high bandwidth dependency, long-time computation, high mining process, and system slowness issues are seen on large-scale blockchain networks where big data is also connected. However, Hashgraph is an alternative distributed ledger technology (DLT) to blockchain and is also considered a consensus method that supports Asynchronous Byzantine Fault Tolerance (ABFT) as well as simultaneous process. Moreover, Hashgraph does not need mining and network node verification processes which saves bandwidth. In this research, we proposed a Hashgraph-enabled blockchain model for reducing the above issues and illustrated the adoption of IT-enabled OT to support CI. In addition, this manuscript discusses how the proposed model can create positive impacts in CI areas by replacing traditional blockchain systems. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Critical infrastructures

来源：评论

学校读者我要写书评

暂无评论

Exploring Multiscale Navigation of Homogeneous and Dense Objects with Progressive Refinement in Virtual Reality

Exploring Multiscale Navigation of Homogeneous and Dense Obj...

引用

IEEE Annual International Symposium Virtual Reality

作者： Leonardo Pavanatto Alexander Giovannelli Brian Giera Timo Bremer Haichao Miao Doug A. Bowman Department of Computer Science Center for Human-Computer Interaction Virginia Tech USA Center for Applied Scientific Computing Lawrence Livermore National Laboratory USA

ISBN: (数字)9798331536459

ISBN: (纸本)9798331536466

关键词： Human computer interaction Location awareness Three-dimensional displays Navigation Virtual reality Inspection

来源：评论

学校读者我要写书评

暂无评论

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

Testing GPU Numerics: Finding Numerical Differences Between ...

引用

Proceedings of the SC '24 Workshops of the International Conference on High Performance computing, Network, Storage, and Analysis

作者： Anwar Hossain Zahid Ignacio Laguna Wei Le Department of Computer Science Iowa State University Ames IA Center for Applied Scientific Computing Lawrence Livermore National Laboratory Livermore CA

ISBN: (纸本)9798350355543

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.

关键词： CUDA

来源：评论

学校读者我要写书评

暂无评论

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees

arXiv

引用

arXiv 2025年

作者： Veldt, Nate Stanley, Thomas Priest, Benjamin W. Steil, Trevor Iwabuchi, Keita Jayram, T.S. Sanders, Geoffrey Department of Computer Science and Engineering Texas A&M University United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

Finding a minimum spanning tree (MST) for n points in an arbitrary metric space is a fundamental primitive for hierarchical clustering and many other ML tasks, but this takes Ω(n2) time to even approximate. We introduce a framework for metric MSTs that first (1) finds a forest of disconnected components using practical heuristics, and then (2) finds a small weight set of edges to connect disjoint components of the forest into a spanning tree. We prove that optimally solving the second step still takes Ω(n2) time, but we provide a subquadratic 2.62-approximation algorithm. In the spirit of learning-augmented algorithms, we then show that if the forest found in step (1) overlaps with an optimal MST, we can approximate the original MST problem in subquadratic time, where the approximation factor depends on a measure of overlap. In practice, we find nearly optimal spanning trees for a wide range of metrics, while being orders of magnitude faster than exact algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：