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

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

来源：评论

学校读者我要写书评

暂无评论

Tensor parametric Hamiltonian operator inference

arXiv

引用

arXiv 2025年

作者： Vijaywargiya, Arjun McQuarrie, Shane A. Gruber, Anthony Department of Applied and Computational Mathematics and Statistics University of Notre Dame United States Computational Mathematics Center for Computing Research Sandia National Laboratories Scientific Machine Learning Center for Computing Research Sandia National Laboratories

This work presents a tensor-based approach to constructing data-driven reduced-order models corresponding to semi-discrete partial differential equations with canonical Hamiltonian structure. By expressing parameter-varying operators with affine dependence as contractions of a generalized parameter vector against a constant tensor, this method leverages the operator inference framework to capture parametric dependence in the learned reduced-order model via the solution to a convex, least-squares optimization problem. This leads to a concise and straightforward implementation which compactifies previous parametric operator inference approaches and directly extends to learning parametric operators with symmetry constraints—a key feature required for constructing structure-preserving surrogates of Hamiltonian systems. The proposed approach is demonstrated on both a (non-Hamiltonian) heat equation with variable diffusion coefficient as well as a Hamiltonian wave equation with variable wave *** Codes 15A69, 35B30, 65P10 © 2025, CC BY.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Artificial Sensory Neurons:Biological Fundamentals,Devices,Applications,and Challenges

引用

Nano-Micro Letters 2025年第3期17卷 168-216页

作者： Shuai Zhong Lirou Su Mingkun Xu Desmond Loke Bin Yu Yishu Zhang Rong Zhao Guangdong Institute of Intelligence Science and Technology HengqinZhuhai 519031People’s Republic of China College of Integrated Circuits Zhejiang UniversityHangzhou 3112000People’s Republic of China ZJU-Hangzhou Global Scientific and Technological Innovation Center Hangzhou 310027People’s Republic of China Department of Science Mathematics and TechnologySingapore University of Technology and DesignSingapore 487372Singapore Department of Precision Instruments Tsinghua UniversityBeijing 100084People’s Republic of China Center for Brain‑Inspired Computing Research Tsinghua UniversityBeijing 100084People’s Republic of China IDG/McGovern Institute for Brain Research Tsinghua UniversityBeijing 100084People’s Republic of China

Spike-based neural networks,which use spikes or action potentialsto represent information,have gained a lot of attention because of their high energyefficiency and low power *** fully leverage its advantages,convertingthe external analog signals to spikes is an essential *** including analog-to-digital converters or ring oscillators,and sensorssuffer from high power and area *** efforts are devoted to constructingartificial sensory neurons based on emerging devices inspired by the biologicalsensory *** can simultaneously perform sensing and spike conversion,overcoming the deficiencies of traditional sensory *** review summarizesand benchmarks the recent progress of artificial sensory *** starts with thepresentation of various mechanisms of biological signal transduction,followed bythe systematic introduction of the emerging devices employed for artificial ***,the implementations with different perceptual capabilitiesare briefly outlined and the key metrics and potential applications are also ***,we highlight the challenges and perspectives for the future development of artificial sensory neurons.

关键词： Artificial intelligence Emerging devices Artificial sensory neurons Spiking neural networks Neuromorphic sensing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A semi-adaptive finite difference method for simulating two-sided fractional convection-diffusion quenching problems

arXiv

引用

arXiv 2025年

作者： Dong, Rumin Zhu, Lin Sheng, Qin Zhao, Bingxin School of Mathematics and Statistics Ningxia Key Laboratory of Interdisciplinary Mechanics and Scientific Computing Ningxia Basic Science Research Center of Mathematics Ningxia University Yinchuan750021 China Department of Mathematics Center for Astrophysics Space Physics and Engineering Research Baylor University WacoTX76798-7328 United States

This paper investigates quenching solutions of an one-dimensional, two-sided Riemann-Liouville fractional order convection-diffusion problem. Fractional order spatial derivatives are discretized using weighted averaging approximations in conjunction with standard and shifted Grünwald formulas. The advective term is handled utilizing a straightforward Euler formula, resulting in a semi-discretized system of nonlinear ordinary differential equations. The conservativeness of the proposed scheme is rigorously proved and validated through simulation experiments. The study is further advanced to a fully discretized, semi-adaptive finite difference method. Detailed analysis is implemented for the monotonicity, positivity and stability of the scheme. Investigations are carried out to assess the potential impacts of the fractional order on quenching location, quenching time, and critical length. The computational results are thoroughly discussed and analyzed, providing a more comprehensive understanding of the quenching phenomena modeled through two-sided fractional order convection-diffusion problems. Copyright © 2025, The Authors. All rights reserved.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

The RQR algorithm

引用

Linear Algebra and Its Applications 2025年

作者： Camps, Daan Mach, Thomas Vandebril, Raf Watkins, David S. National Energy Research Scientific Computing Center Lawrence Berkeley National Laboratory United States University of Potsdam Institute of Mathematics Karl-Liebknecht-Str. 24–25 Potsdam14476 Germany Department of Computer Science KU Leuven Belgium Department of Mathematics Washington State University United States

Pole-swapping algorithms, generalizations of bulge-chasing algorithms, have been shown to be a viable alternative to the bulge-chasing QZ algorithm for solving the generalized eigenvalue problem for a matrix pencil A−λB. It is natural to try to devise a pole-swapping algorithm that solves the standard eigenvalue problem for a single matrix A. This paper introduces such an algorithm and shows that it is competitive with Francis's bulge-chasing QR algorithm. © 2025 Elsevier Inc.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Superconvergent Discontinuous Galerkin Method for the Scalar Teukolsky Equation on Hyperboloidal Domains: Efficient Waveform and Self-Force Computation

arXiv

引用

arXiv 2025年

作者： Vishal, Manas Field, Scott E. Gottlieb, Sigal Ryan, Jennifer Department of Mathematics University of Massachusetts DartmouthMA02747 United States Department of Physics University of Massachusetts DartmouthMA02747 United States Center for Scientific Computing and Data Science Research University of Massachusetts DartmouthMA02747 United States Department of Mathematics KTH Royal Institute of Technology Stockholm Sweden

The long-time evolution of extreme mass-ratio inspiral systems requires minimal phase and dispersion errors to accurately compute far-field waveforms, while high accuracy is essential near the smaller black hole (modeled as a Dirac delta distribution) for self-force computations. Spectrally accurate methods, such as nodal discontinuous Galerkin (DG) methods, are well suited for these tasks. Their numerical errors typically decrease as ∝ (∆x)N+1, where ∆x is the subdomain size and N is the polynomial degree of the approximation. However, certain DG schemes exhibit superconvergence, where truncation, phase, and dispersion errors can decrease as fast as ∝ (∆x)2N+1. Superconvergent numerical solvers are, by construction, extremely efficient and accurate. We theoretically demonstrate that our DG scheme for the scalar Teukolsky equation with a distributional source is superconvergent, and this property is retained when combined with the hyperboloidal layer compactification technique. This ensures that waveforms, total energy and angular-momentum fluxes, and self-force computations benefit from superconvergence. We empirically verify this behavior across a family of hyperboloidal layer compactifications with varying degrees of smoothness. Additionally, we show that self-force quantities for circular orbits, computed at the point particle’s location, also exhibit a certain degree of superconvergence. Our results underscore the potential benefits of numerical superconvergence for efficient and accurate gravitational waveform simulations based on DG methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Galerkin methods

来源：评论

学校读者我要写书评

暂无评论

Surrogate modeling of gravitational waves microlensed by spherically symmetric potentials

arXiv

引用

arXiv 2025年

作者： Deka, Uddeepta Prabhu, Gopalkrishna Shaikh, Md Arif Kapadia, Shasvath J. Varma, Vijay Field, Scott E. International Centre for Theoretical Sciences Tata Institute of Fundamental Research Bangalore560089 India Inter-University Centre for Astronomy and Astrophysics Post Bag 4 Ganeshkhind Pune411007 India Department of Physics Vivekananda Satavarshiki Mahavidyalaya Vidyasagar University West Bengal Manikpara721513 India Department of Physics and Astronomy Seoul National University Seoul08826 Korea Republic of Department of Mathematics Center for Scientific Computing and Visualization Research University of Massachusetts DartmouthMA02747 United States

The anticipated observation of the gravitational microlensing of gravitational waves (GWs) promises to shed light on a host of astrophysical and cosmological questions. However, extracting the parameters of the lens from the modulated GWs requires accurate modeling of the lensing amplification factor, accounting for wave-optics effects. Analytic solutions to the lens equation have not been found to date, except for a handful of simplistic lens models. While numerical solutions to this equation have been developed, the time and computational resources required to evaluate the amplification factor numerically make large-scale parameter estimation of the lens (and source) parameters prohibitive. On the other hand, surrogate modeling of GWs has proven to be a powerful tool to accurately, and rapidly, produce GW templates at arbitrary points in parameter space, interpolating from a finite set of available waveforms at discrete parameter values. In this work, we demonstrate that surrogate modeling can also effectively be applied to the evaluation of the time-domain microlensing amplification factor eF(t), for arbitrary lens configurations. We show this by constructing eF(t) for two lens models, viz. point-mass lens, and singular isothermal sphere. We benchmark the evaluation times, and accuracy, of the surrogate microlensed templates, and show that indeed surrogate modeling is a powerful tool to make large-scale parameter estimation in the context of microlensed GWs practicable. © 2025, CC BY.

关键词： Time domain analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing Neural Network Surrogate Models: Application to Black Hole Merger Remnants

arXiv

引用

arXiv 2025年

作者： Thomas, Lucy M. Chatziioannou, Katerina Varma, Vijay Field, Scott E. TAPIR California Institute of Technology PasadenaCA91125 United States LIGO Laboratory California Institute of Technology PasadenaCA91125 United States Department of Mathematics Center for Scientific Computing and Data Science Research University of Massachusetts DartmouthMA02747 United States

Surrogate models of numerical relativity simulations of merging black holes provide the most accurate tools for gravitational-wave data analysis. Neural network-based surrogates promise evaluation speedups, but their accuracy relies on (often obscure) tuning of settings such as the network architecture, hyperparameters, and the size of the training dataset. We propose a systematic optimization strategy that formalizes setting choices and motivates the amount of training data required. We apply this strategy on NRSur7dq4Remnant, an existing surrogate model for the properties of the remnant of generically precessing binary black hole mergers and construct a neural network version, which we label NRSur7dq4Remnant NN. The systematic optimization strategy results in a new surrogate model with comparable accuracy, and provides insights into the meaning and role of the various network settings and hyperparameters as well as the structure of the physical process. Moreover, NRSur7dq4Remnant NN results in evaluation speedups of up to 8 times on a single CPU and a further improvement of 2, 000 times when evaluated in batches on a GPU. To determine the training set size, we propose an iterative enrichment strategy that efficiently samples the parameter space using much smaller training sets than naive sampling. NRSur7dq4Remnant NN requires O(104) training data, so neural network-based surrogates are ideal for speeding-up models that support such large training datasets, but at the moment cannot directly be applied to numerical relativity catalogs that are O(103) in size. The optimization strategy is available through the gwbonsai package. Copyright © 2025, The Authors. All rights reserved.

关键词： Relativity

来源：评论

学校读者我要写书评

暂无评论

EHands: Quantum Protocol for Polynomial Computation on Real-Valued Encoded States

arXiv

引用

arXiv 2025年

作者： Balewski, Jan Amankwah, Mercy G. Bethel, E. Wes Perciano, Talita Van Beeumen, Roel National Energy Research Scientific Computing Center Lawrence Berkeley National Laboratory BerkeleyCA94720 United States Department of Mathematics Applied Mathematics and Statistics Case Western Reserve University ClevelandOH44106 United States Computer Science Department San Francisco State University San FranciscoCA94132 United States Scientific Data Division Lawrence Berkeley National Laboratory BerkeleyCA94720 United States Applied Mathematics and Computational Research Division Lawrence Berkeley National Laboratory BerkeleyCA94720 United States

The novel constructive EHands protocol defines a universal set of quantum operations for multivariable polynomial transformations on quantum processors by introducing four basic subcircuits—multiplication, addition, negation, and parity flip—and by using expectation-value encoding (EVEN) to represent real numbers in quantum states. These elementary arithmetic operations can be systematically composed to compute degree-d polynomials, Pd(x), on a QPU. The resulting quantum circuit structure closely mirrors the stepwise evaluation of polynomials on a classical calculator, providing an intuitive and efficient approach to polynomial computation on quantum hardware. By enabling direct, predictable polynomial and nonlinear data transformations on a QPU, our method reduces dependence on classical post-processing in hybrid quantum-classical algorithms, enabling advancements in many quantum algorithms. The EHands quantum circuits are compact enough to deliver meaningful and accurate results on today’s noisy quantum processors. We present a detailed implementation of P4(x) and report experimental results for polynomial approximations of common functions, obtained using IBM’s Heron-class quantum processors and an ideal Qiskit simulator. Copyright © 2025, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：