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

On Error-Based Step Size Control for Discontinuous Galerkin Methods for Compressible Fluid Dynamics

应用数学与计算数学学报 2025年第1期7卷 3-39页

作者： Hendrik Ranocha Andrew R.Winters Hugo Guillermo Castro Lisandro Dalcin Michael Schlottke-Lakemper Gregor J.Gassner Matteo Parsani Applied Mathematics University of HamburgBundesstr.5520146 HamburgGermany Department of Mathematics Applied Mathematics Linköping UniversityLinköpingSweden Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Applied and Computational Mathematics RWTH Aachen UniversityAachenGermany High-Performance Computing Center Stuttgart University of StuttgartStuttgartGermany Department of Mathematics and Computer Science University of CologneCologneGermany Center for Data and Simulation Science University of CologneCologneGermany Extreme Computing Research Center(ECRC) Computer Electrical and Mathematical Science and Engineering Division(CEMSE)King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia Physical Science and Engineering Division(PSE) King Abdullah University of Science and Technology(KAUST)Thuwal 23955-6900Saudi Arabia

We study a temporal step size control of explicit Runge-Kutta(RK)methods for com-pressible computational fluid dynamics(CFD),including the Navier-Stokes equations and hyperbolic systems of conservation laws such as the Euler *** demonstrate that error-based approaches are convenient in a wide range of applications and compare them to more classical step size control based on a Courant-Friedrichs-Lewy(CFL)*** numerical examples show that the error-based step size control is easy to use,robust,and efficient,e.g.,for(initial)transient periods,complex geometries,nonlinear shock captur-ing approaches,and schemes that use nonlinear entropy *** demonstrate these properties for problems ranging from well-understood academic test cases to industrially relevant large-scale computations with two disjoint code bases,the open source Julia pack-ages *** with *** and the C/Fortran code SSDC based on PETSc.

关键词： Explicit Runge-Kutta(RK)methods Step size control Compressible fluid dynamics Adaptivity in space and time Shock capturing

来源：评论

学校读者我要写书评

暂无评论

Some Results on Ricci-Yamabe Soliton and Its Cosmological Models

引用

IAENG International Journal of applied mathematics 2025年第4期55卷 979-983页

作者： Pandey, Pankaj Yadav, Santosh Kumar Sharma, Kamakshi Chaturvedi, Braj Bhushan Department of Mathematics School of Chemical Engineering and Physical Sciences Lovely Professional University Punjab Phagwara144411 India Department of Mathematics School of Computer Science & Artificial Intelligence SR University Telangana Warangal506371 India Department of Pure & Applied Mathematics Guru Ghasidas Vishwavidyalaya Chhattisgarh Bilaspur495009 India

This article aims to investigate the characteristics of Ricci-Yamabe Soliton (briefly: (RYS)n). We study the cosmological models on (RYS)4 under Lorentzian para Sasakian (LPS)4 spacetime. Parallel Ricci tensor, Poisson structure and gradient property also reveal on (RYS)n. Example of (RYS)4 constructed to verify the results. © (2025), (International Association of Engineers). All rights reserved.

关键词： Solitons

来源：评论

学校读者我要写书评

暂无评论

DEBPIR: enhancing information privacy in decentralized business modeling

引用

Complex and Intelligent Systems 2025年第7期11卷 1-21页

作者： Kumar, Gulshan Saha, Rahul Conti, Mauro Kim, Tai Hoon School of Computer Science and Engineering Lovely Professional University Phagwara India Department of Mathematics University of Padua Padua Italy School of Electrical and Computer Engineering Chonnam National University Gwangju South Korea

Business modelling often involves extensive data collection and analysis, raising concerns about privacy infringement. Integrating Privacy Information Retrieval (PIR) mechanisms within business models is crucial to address privacy concerns, ensure compliance with regulations, safeguard sensitive data, and maintain trust with stakeholders;however, PIR is not included in the existing business models yet. In this paper, we propose the first decentralized business model that uses the PIR. We call our proposed model DEcentralized Business model with PIR (DEBPIR). DEBPIR uses a smart contract for PIR and encryption to share the privacy of classified information. We execute a thorough set of experiments on DEBPIR and evaluate the results based on privacy attainment, latency, and throughput. We also perform a comparative analysis between our proposed DEBPIR and the existing models;we observe that DEBPIR outperforms the existing models and provides 95% privacy attainment. The latency and throughput of our proposed DEBPIR do not outgrow compared to the existing models. Thus, DEBPIR is an efficient solution for business models. © The Author(s) 2025.

关键词： Blockchain Business Decentralized PIR Privacy

来源：评论

学校读者我要写书评

暂无评论

Optical Solitons for the Dispersive Concatenation Model with Differential Group Delay

引用

Nonlinear Optics Quantum Optics 2025年第1-2期61卷 71-97页

作者： Arnous, Ahmed H. Biswas, Anjan Yildirim, Yakup Alshomrani, Ali Saleh Department of Physics and Engineering Mathematics Higher Institute of Engineering El–Shorouk Academy Cairo Egypt Department of Mathematics and Physics Grambling State University GramblingLA71245–2715 United States Department of Mathematics King Abdulaziz University Jeddah21589 Saudi Arabia Department of Applied Sciences Cross–Border Faculty of Humanities Economics and Engineering Dunarea de Jos University of Galati 111 Domneasca Street Galati800201 Romania Department of Mathematics and Applied Mathematics Sefako Makgatho Health Sciences University Medunsa 0204 South Africa Department of Computer Engineering Biruni University Istanbul34010 Turkey Mathematics Research Center Near East University Nicosia99138 Cyprus Faculty of Arts and Sciences University of Kyrenia Kyrenia99320 Cyprus

This paper retrieves optical soliton solutions to the dispersive concatenation model with differential group delay that is with Kerr law of nonlinearity. The enhanced direct algebraic method has made this recovery possible. A full spectrum of optical solitons are presented. The intermediary functions that framed the pathway to the soliton solutions are Weierstrass’ elliptic functions and Jacobi’s elliptic functions. The parameter constraints that guarantees the existence of such solitons are also presented. ©2025 Old City Publishing, Inc.

关键词： Group delay

来源：评论

学校读者我要写书评

暂无评论

A General Framework for Clustering and Distribution Matching with Bandit Feedback

引用

IEEE Transactions on Information Theory 2025年第3期71卷 2116-2139页

作者： Yavas, Recep Can Huang, Yuqi Tan, Vincent Y. F. Scarlett, Jonathan CNRS@CREATE DesCartes Program CREATE Tower 138602 Singapore National University of Singapore Department of Computer Science Queenstown119077 Singapore National University of Singapore School of Computing Department of Information Systems and Analytics Queenstown119077 Singapore National University of Singapore Department of Mathematics Department of Electrical and Computer Engineering Queenstown119077 Singapore Institute of Data Science National University of Singapore Department of Computer Science The Department of Mathematics Queenstown119077 Singapore

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a K-armed bandit model where some subset of K arms is partitioned into M groups. Within each group, the random variable associated to each arm follows the same distribution on a finite alphabet. At each time step, the decision maker pulls an arm and observes its outcome from the random variable associated to that arm. Subsequent arm pulls depend on the history of arm pulls and their outcomes. The decision maker has no knowledge of the distributions of the arms or the underlying partitions. The task is to devise an online algorithm to learn the underlying partition of arms with the least number of arm pulls on average and with an error probability not exceeding a pre-determined value δ. Several existing problems fall under our general framework, including finding M pairs of arms, odd arm identification, and N-ary clustering of K arms belong to our general framework. We derive a non-asymptotic lower bound on the average number of arm pulls for any online algorithm with an error probability not exceeding δ. Furthermore, we develop a computationally-efficient online algorithm based on the Track-and-Stop method and Frank-Wolfe algorithm, and show that the average number of arm pulls of our algorithm asymptotically matches that of the lower bound. Our refined analysis also uncovers a novel bound on the speed at which the average number of arm pulls of our algorithm converges to the fundamental limit as δ vanishes. © 1963-2012 IEEE.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Multidimensional image morphing-fast image-based rendering of open 3D and VR environments

引用

虚拟现实与智能硬件(中英文) 2025年第2期7卷 155-172页

作者： Simon SEIBT Bastian KUTH Bartosz von Rymon LIPINSKI Thomas CHANG Marc Erich LATOSCHIK Game Tech Laboratory Faculty of Computer ScienceNuremberg Institute of TechnologyNuremberg 90489Germany Department of Electrical Engineering and Computer Science Coburg University of Applied Sciences and ArtsCoburg 96450Germany Human-Computer Interaction Group Institute of Computer ScienceUniversity of WuerzburgWuerzburg 97074Germany

Background In recent years,the demand for interactive photorealistic three-dimensional(3D)environments has increased in various fields,including architecture,engineering,and ***,achieving a balance between the quality and efficiency of high-performance 3D applications and virtual reality(VR)remains *** This study addresses this issue by revisiting and extending view interpolation for image-based rendering(IBR),which enables the exploration of spacious open environments in 3D and ***,we introduce multimorphing,a novel rendering method based on the spatial data structure of 2D image patches,called the image *** this approach,novel views can be rendered with up to six degrees of freedom using only a sparse set of *** rendering process does not require 3D reconstruction of the geometry or per-pixel depth information,and all relevant data for the output are extracted from the local morphing cells of the image *** detection of parallax image regions during preprocessing reduces rendering artifacts by extrapolating image patches from adjacent cells in *** addition,a GPU-based solution was presented to resolve exposure inconsistencies within a dataset,enabling seamless transitions of brightness when moving between areas with varying light *** Experiments on multiple real-world and synthetic scenes demonstrate that the presented method achieves high"VR-compatible"frame rates,even on mid-range and legacy hardware,*** achieving adequate visual quality even for sparse datasets,it outperforms other IBR and current neural rendering *** Using the correspondence-based decomposition of input images into morphing cells of 2D image patches,multidimensional image morphing provides high-performance novel view generation,supporting open 3D and VR ***,the handling of morphing artifacts in the parallax image regions remains a topic for future resea

关键词： computer graphics 3D real-time rendering computer vision Image morphing Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Weak and Extremely Low Frequency Magnetic Fields Alter the Growth Rates of HT-1080 Fibrosarcoma

Weak and Extremely Low Frequency Magnetic Fields Alter the G...

引用

2025 United States National Committee of URSI National Radio Science Meeting, USNC-URSI NRSM 2025

作者： Dang, Nhat Keller, Jason Bajtos, Marek Gurhan, Hakki Barnes, Frank Department of Electrical Computer and Energy Engineering College of Engineering and Applied Science University of Colorado Boulder BoulderCO United States Department of Electromagnetics and Biomedical Engineering Faculty of Electrical Engineering and Information Technology University of Zilina Zilina Slovakia

ISBN: (纸本)9781946815200

This study presents experimental results showing that weak, extremely low frequency electromagnetic (EM) fields influence the growth rates of HT-1080 fibrosarcoma cells in vitro and offers a theoretical explanation for these effects. The results demonstrate that weak magnetic fields both increase and decrease the growth rates of fibrosarcoma cells by altering the mitochondrial superoxide (O2-) and calcium ions (Ca2+) concentrations in living cells. Over a 4-day exposure period, fibrosarcoma growth rates were modulated in the presence of low-level alternating current (AC) magnetic fields at a 10 μT amplitude at 13.5 Hz to 30 Hz frequency, superimposed on a 45 μT static background field. Effects due to changes in amplitude from 10 to 30 μT at selected frequencies are also investigated with the same superimposed static field. © 2025 USNC-URSI.

关键词： Electromagnetic field effects

来源：评论

学校读者我要写书评

暂无评论

Integrating local binary patterns and convolutional neural networks with a balanced gray encoded pooling mechanism

引用

Multimedia Tools and Applications 2025年 1-27页

作者： Lai, Cheng-Ling Tseng, Ling-Shen Chang, Chih-Hung Chen, Yi-Han Wu, Chih-Hung Department of Electrical Engineering National University of Kaohsiung 700 Kaohsiung University Rd Nanzih District Kaohsiung81148 Taiwan Department of Applied Mathematics National University of Kaohsiung 700 Kaohsiung University RdNanzih District Kaohsiung81148 Taiwan

Local binary pattern (LBP) is a commonly adopted method for texture description in image analysis applications. However, when used in deep convolutional neural networks (CNNs), standard LBP often fails to retain crucial feature uniformity and diversity during dimensionality reduction, which limits its effectiveness in complex image classification tasks. To address these issues, a novel LBP encoding method utilizing balanced Gray code (BGC) is introduced. In this method, similar LBP features are re-ordered as neighbors to maximally preserve feature integrity and diversity through the pooling process. This approach improves the compatibility of LBP with CNN architectures, enhancing both accuracy and robustness. An efficient algorithm is designed that integrates BGC transformation, LBP counting, and sum pooling for dimensionality reduction without sacrificing key feature characteristics. Several LBP-embedded network architectures based on ResNet have been developed and tested, demonstrating significant performance improvements in the proposed method. The experimental results reveal that our proposed method outperforms typical CNN models with a 15% accuracy improvement for classifying the STL-10 benchmark images. Additionally, our proposed method demonstrates greater robustness to illumination variations, highlighting the potential of this method for enhanced feature representation in deep learning. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Dimensionality reduction

来源：评论

学校读者我要写书评

暂无评论

Degree reduction of ball Said-Ball surfaces using an enhanced coot optimization algorithm

Degree reduction of ball Said-Ball surfaces using an enhance...

引用

作者： Hu, Gang Dou, Wanting Du, Bo Department of Applied Mathematics Xi'an University of Technology Xi'an China School of Computer Science and Engineering Xi'an University of Technology Xi'an China

Degree reduction of ball Said-Ball (BSB) surface is a complex and unsolved problem in computer-aided design (CAD) and computer graphics (CG), which has potential application prospects in many engineering fields of geometric modeling. In this paper, the degree reduction of BSB surface is transformed into the optimization problems of center surface and radius function, and the improved coot optimization algorithm is used to solve it. An effective method to solve the degree reduction of BSB surface by intelligent optimization algorithm is proposed. Firstly, the degree reduction of BSB surface is decomposed into center surface reduction and radius function reduction, and the objective function and constraint conditions are determined according to the optimization idea, then the degree reduction optimization model of center surface and radius function is established. Secondly, an enhanced coot (ECOOT for short) algorithm is proposed, which combines chain strategy, dispersed foraging strategy, and quadratic interpolation strategy. Compared with the original algorithm, ECOOT algorithm has better convergence performance and higher calculation accuracy. Finally, the proposed ECOOT algorithm is used to solve the degree reduction optimization model, and the optimal center surface and minimum distance radius function of the BSB surface after degree reduction are obtained. The experimental results show that the ECOOT algorithm can effectively solve the problem of degree reduction for BSB surface, the degree reduction error is reduced by about 20% compared to the original COOT algorithm, and is superior to other intelligent optimization algorithms in accuracy, robustness, and convergence. © 2023 John Wiley & Sons, Ltd.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Parameters Estimation of Modified Triple Diode Model of PSCs Considering Charge Accumulations and Electric Field Effects Using Puma Optimizer

引用

computer Modeling in engineering & Sciences 2025年第4期143卷 723-745页

作者： Amlak Abaza Ragab A.El-Sehiemy Mona Gafar Ahmed Bayoumi Electrical Engineering Department Faculty of EngineeringKafrelsheikh UniversityKafrelsheikh33516Egypt Department of Computer Engineering and Information College of Engineering inWadi AlddawasirPrince Sattam Bin Abdulaziz UniversityKharj16278Saudi Arabia Machine Learning and Information Retrieval Department Artificial IntelligenceKafrelsheikh UniversityKafrelsheikh33516Egypt Electrical Department Faculty of Engineering and TechnologyBadr University in CairoBadr11829Egypt Physics and Mathematics Department Faculty of EngineeringKafrelsheikh UniversityKafrelsheikh33516Egypt College of Engineering Al-Ayen UniversityThi-Qar64001Iraq

Promoting the high penetration of renewable energies like photovoltaic(PV)systems has become an urgent issue for expanding modern power grids and has accomplished several challenges compared to existing distribution *** study measures the effectiveness of the Puma optimizer(PO)algorithm in parameter estimation of PSC(perovskite solar cells)dynamic models with hysteresis consideration considering the electric field effects on *** models used in this study will incorporate hysteresis effects to capture the time-dependent behavior of PSCs *** PO optimizes the proposed modified triple diode model(TDM)with a variable voltage capacitor and resistances(VVCARs)considering the hysteresis *** suggested PO algorithm contrasts with other wellknown optimizers from the literature to demonstrate its *** results emphasize that the PO realizes a lower RMSE(Root mean square errors),which proves its capability and efficacy in parameter extraction for the *** statistical results emphasize the efficiency and supremacy of the proposed PO compared to the other well-known competing *** convergence rates show good,fast,and stable convergence rates with lower RMSE via PO compared to the other five competitive ***,the lowermean realized via the PO optimizer is illustrated by the box plot for all optimizers.

关键词： Dynamic model of PSCs puma optimizer parameter estimation triple diode model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：