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

Resolvability of classical-quantum channels

学校读者我要写书评

暂无评论

IEEE Transactions on Information Theory 2025年

作者： Hayashi, Masahito Cheng, Hao-Chung Gao, Li Chinese University of Hong Kong School of Data Science Shenzhen Longgang District Shenzhen518172 China Nagoya University Graduate School of Mathematics Nagoya464-8602 Japan National Taiwan University Graduate Institute of Communication Engineering Department of Mathematics Institute of Applied Mathematical Sciences Center for Quantum Science and Engineering epartment of Electrical Engineering Taipei10617 Taiwan National Center for Theoretical Sciences Physics Division Taipei10617 Taiwan Quantum Computing Center New Taipei City236 Taiwan Wuhan University School of Mathematics and Statistics Wuhan430072 China

Channel resolvability concerns the minimum resolution for approximating the channel output. We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and from the fixed independent and identically distributed (i.i.d.) input. The direct part of the worst-input setting is derived from sequential hypothesis testing as it involves non-i.i.d. inputs. The strong converse of the worst-input setting is obtained via the connection to identification codes. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to prove the strong converse. © 1963-2012 IEEE.

关键词： Quantum channel

Decomposed photon anomalous dimension in QCD and the fβg-expanded representations for the Adler function

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Kataev, A.L. Molokoedov, V.S. Institute for Nuclear Research The Russian Academy of Science Moscow117312 Russia Research Computing Center Moscow State University Moscow119991 Russia Moscow Center for Fundamental and Applied Mathematics Moscow119992 Russia Moscow Institute of Physics and Technology Dolgoprudny Moscow Region141700 Russia

This work is devoted to the study of the fβg expansion of the perturbative expressions for the eþe− annihilation Adler function DðQ2Þ and for the related renormalization group functions, namely, for the photon vacuum polarization function and its anomalous dimension γðαsÞ in QCD at the Oðα4sÞ order. We emphasize that γðαsÞ is not a conformal-invariant contribution to DðQ2Þ;therefore, for a consistent analysis, it is necessary to decompose its higher-order perturbation theory coefficients in powers of the β-function coefficients in the same way as for the Adler function. The arguments in favor of this statement are given. The comparison of the MS and principal of maximum conformality and Brodsky-Lepage-Mackenzie scale approximants are demonstrated. We comment briefly on theoretical and phenomenologically related consequences of this comparison. Copyright © 2023, The Authors. All rights reserved.

关键词： Photons

Harnessing computational models to uncover the role of the immune system in tuberculosis treatment

学校读者我要写书评

暂无评论

Harnessing computational models to uncover the role of the i...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Enrico Mastrostefano Alessandro Ravoni Elia Onofri Paolo Tieri Filippo Castiglione Institute for Applied Computing "Mauro Picone" National Research Council Rome Italy Dept. Mathematics and Physics University of Roma Tre Rome Italy Biotechnology Research Center Technology Innovation Institute Abu Dhabi United Arab Emirates

The importance of the immune system (IS) in tuberculosis (TB) drug development is often underestimated because of the intricate nature of experiments and the specialized knowledge needed. In vitro and animal studies fall short in replicating the intricate reactions of the human IS to drugs and infections. In this study, we present our initial efforts in employing an in silico approach to comprehend how an individual’s IS impacts the efficacy of therapy, particularly in managing mycobacterium tuberculosis (Mtb) infection and minimizing the risk of relapse. We employed a well-established agent-based IS simulator called C-IMMSIM. We conducted simulations to investigate the long-term outcomes of TB disease in a virtual cohort infected with Mtb over a 50-year period. Our simulations revealed that individuals with competent IS showed a high success rate in containing Mtb infection. Furthermore, to better understand the dynamic interactions between Mtb and the IS, we deliberately introduced specific IS deficiencies, thus successfully inducing short-term relapses and mortality. These results confirm the model’s ability to elucidate the mechanisms underlying the interactions between Mtb and the IS.

关键词：

Two nonmonotone multiobjective memory gradient algorithms 1

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Peng, Jian-Wen Zhang, Jie-Wen Yao, Jen-Chih School of Mathematical Sciences Chongqing Normal University Chongqing401331 China Research Center for Interneural Computing China Medical University Taichung40402 Taiwan Department of Applied Mathematics National Sun Yat-sen University Kaohsiung804 Taiwan

In this paper, two types of nonmonotone memory gradient algorithm for solving unconstrained multiobjective optimization problems are introduced. Under some suitable conditions, we show the convergence of the full sequence generated by the proposed algorithms to a weak Pareto optimal point. Copyright © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

Reducing Spatial Discretization Error on Coarse CFD Simulations Using an OpenFOAM-Embedded Deep Learning Framework

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Gonzalez-Sieiro, Jesus Pardo, David Nava, Vincenzo Calo, Victor M. Towara, Markus BCAM - Basque Center for Applied Mathematics Bilbao Spain Leioa Spain Ikerbasque - Basque Foundation for Sciences Bilbao Spain Derio Spain School of Electrical Engineering Computing and Mathematical Sciences Curtin University Perth Australia Software and Tools for Computational Engineering RWTH Aachen University Aachen Germany

We propose a method for reducing the spatial discretization error of coarse computational fluid dynamics (CFD) problems by enhancing the quality of low-resolution simulations using deep learning. We feed the model with fine-grid data after projecting it to the coarse-grid discretization. We substitute the default differencing scheme for the convection term by a feed-forward neural network that interpolates velocities from cell centers to face values to produce velocities that approximate the down-sampled fine-grid data well. The deep learning framework incorporates the open-source CFD code OpenFOAM, resulting in an end-to-end differentiable model. We automatically differentiate the CFD physics using a discrete adjoint code version. We present a fast communication method between TensorFlow (Python) and OpenFOAM (c++) that accelerates the training process. We applied the model to the flow past a square cylinder problem, reducing the error from 120% to 25% in the velocity for simulations inside the training distribution compared to the traditional solver using an x8 coarser mesh. For simulations outside the training distribution, the error reduction in the velocities was about 50%. The training is affordable in terms of time and data samples since the architecture exploits the local features of the physics. © 2024, CC BY.

关键词： Computational fluid dynamics

Efficient reduction of Feynman integrals on supercomputers

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Belitsky, Andrei V. Kokosinskaya, Anna A. Smirnov, Alexander V. Voevodin, Vadim V. Zeng, Mao Department of Physics Arizona State University TempeAZ85287-1504 United States Moscow State University Research Computing Center Moscow119992 Russia Moscow Center for Fundamental and Applied Mathematics Moscow119992 Russia Higgs Centre for Theoretical Physics University of Edinburgh EdinburghEH9 3FD United Kingdom

—Feynman integral reduction by means of integration-by-parts identities is a major power gadget in a theorist toolbox indispensable for calculation of multiloop quantum effects relevant for particle phenomenology and formal theory alike. An algorithmic approach consists of solving a large sparse non-square system of homogeneous linear equations with polynomial coefficients. While an analytical way of doing this is legitimate and was pursued for decades, it undoubtedly has its limitations when applied in complicated circumstances. Thus, a complementary framework based on modular arithmetic becomes critical on the way to conquer the current ‘what is possible’ frontier. This calls for use of supercomputers to address the reduction problem. In order to properly utilize these computational resources, one has to efficiently optimize the technique for this purpose. Presently, we discuss and implement various methods which allow us to significantly improve performance of Feynman integral reduction within the FIRE environment. Copyright © 2024, The Authors. All rights reserved.

关键词： Supercomputers

Research on integrated test and evaluation of information system equipment

学校读者我要写书评

暂无评论

Research on integrated test and evaluation of information sy...

2021 Guangdong-Hong Kong-Macao Greater Bay Area Artificial Intelligence and Big Data Forum, AIBDF 2021

作者： Ma, Jing Wang, Ruihua Wang, Jiajia Yang, Zhou Li, Na Beijing Jinghang Research Institute of Computing and Communication Beijing China PLA Academy of Military Science Beijing China Applied Mathematics Research Center of China Aerospace Science and Industry Group Beijing China Innovation Center for Intelligent System on Recognition and Decision Beijing China

The integrated test of weapons and equipment is an urgent need for the development of weapons and equipment under the contemporary information conditions, because it can reduce the resource requirements, test cost and risk, as well as improve the test efficiency and the degree of confidence. This paper based on the objective requirements of integrated evaluation of information system equipment test, aims at performance test for information system equipment. For the same equipment testing, test means to analysis the factors that affect *** implementation is based on prior knowledge and expert experience response parameters, including regression model building, and the credibility of the weighted multi-source data fusion evaluation method research. It provides technical and theoretical support for the integrated test evaluation of information system equipment multi-source test. © 2021 Institute of Physics Publishing. All rights reserved.

关键词： Information systems

An extended plane wave framework for the electronic structure calculations of twisted bilayer material systems

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Dai, Xiaoying Zhou, Aihui Zhou, Yuzhi LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China CAEP Software Center for High Performance Numerical Simulation Beijing100088 China Institute of Applied Physics and Computational Mathematics Beijing100088 China

In this paper, we propose an extended plane wave framework to make the electronic structure calculations of the twisted bilayer 2D material systems practically feasible. Based on the foundation in [Y. Zhou, H. Chen, A. Zhou, J. Comput. Phys. 384, 99 (2019)], following extensions take place: (1) an tensor-producted basis set, which adopts PWs in the incommensurate dimensions, and localized basis in the interlayer dimension, (2) a practical application of a novel cutoff techniques we have recently developed, and (3) a quasi-band structure picture under the small twisted angles and weak interlayer coupling limits. With (1) and (2) now the dimensions of Hamiltonian matrix are reduced by about 2 orders of magnitude compared with the original framework. And (3) enables us to better organize the calculations and understand the results. For numerical examples, we study the electronic structures of the linear bilayer graphene lattice system with the magic twisted angle (∼ 1.05◦). The famous flat bands have been reproduced with their features in quantitative agreement with those from experiments and other theoretical calculations. Moreover, the extended framework has much less computational cost compared to the commensurate cell approximations, and is more extendable compared to the traditional model hamiltonians and tight binding models. Finally this framework can readily accommodate nonlinear models thus will laid the foundations for more effective yet accurate Density Functional Theory (DFT) calculations. © 2023, CC BY.

关键词： Electronic structure

NEURAL NETWORK-ENHANCED hr-ADAPTIVE FINITE ELEMENT ALGORITHM FOR PARABOLIC EQUATIONS

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Hao, Jiaxiong Huang, Yunqing Yi, Nianyu Yin, Peimeng Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China National Center for Applied Mathematics in Hunan Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan University Hunan Xiangtan411105 China Department of Mathematical Sciences University of Texas at El Paso El PasoTX79968 United States

In this paper, we present a novel enhancement to the conventional hr-adaptive finite element methods for parabolic equations, integrating traditional h-adaptive and r-adaptive methods via neural networks. A major challenge in hr-adaptive finite element methods lies in projecting the previous step’s finite element solution onto the updated mesh. This projection depends on the new mesh and must be recomputed for each adaptive iteration. To address this, we introduce a neural network to construct a mesh-free surrogate of the previous step finite element solution. Since the neural network is mesh-free, it only requires training once per time step, with its parameters initialized using the optimizer from the previous time step. This approach effectively overcomes the interpolation challenges associated with non-nested meshes in computation, making node insertion and movement more convenient and efficient. The new algorithm also emphasizes SIZING and GENERATE, allowing each refinement to roughly double the number of mesh nodes of the previous iteration and then redistribute them to form a new mesh that effectively captures the singularities. It significantly reduces the time required for repeated refinement and achieves the desired accuracy in no more than seven space-adaptive iterations per time step. Numerical experiments confirm the efficiency of the proposed algorithm in capturing dynamic changes of *** Codes 92B20, 65M60, 35K57 © 2025, CC BY.

关键词： Interpolation