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

An Enigmatic PeVatron in an Area around HII Region G35.6−0.5

arXiv 2024年

作者： Cao, Zhen Aharonian, F. Axikegu Bai, Y.X. Bao, Y.W. Bastieri, D. Bi, X.J. Bi, Y.J. Bian, W. Bukevich, A.V. Cao, Q. Cao, W.Y. Cao, Zhe Chang, J. Chang, J.F. Chen, A.M. Chen, B.Q. Chen, E.S. Chen, H.X. Chen, Liang Chen, Lin Chen, Long Chen, M.J. Chen, M.L. Chen, Q.H. Chen, S. Chen, S.H. Chen, S.Z. Chen, T.L. Chen, Y. Cheng, N. Cheng, Y.D. Chu, M.C. Cui, M.Y. Cui, S.W. Cui, X.H. Cui, Y.D. Dai, B.Z. Dai, H.L. Dai, Z.G. Danzengluobu Dong, X.Q. Duan, K.K. Fan, J.H. Fan, Y.Z. Fang, J. Fang, J.H. Fang, K. Feng, C.F. Feng, H. Feng, L. Feng, S.H. Feng, X.T. Feng, Y. Feng, Y.L. Gabici, S. Gao, B. Gao, C.D. Gao, Q. Gao, W. Gao, W.K. Ge, M.M. Ge, T.T. Geng, L.S. Giacinti, G. Gong, G.H. Gou, Q.B. Gu, M.H. Guo, F.L. Guo, J. Guo, X.L. Guo, Y.Q. Guo, Y.Y. Han, Y.A. Hannuksela, O.A. Hasan, M. He, H.H. He, H.N. He, J.Y. He, Y. Hor, Y.K. Hou, B.W. Hou, C. Hou, X. Hu, H.B. Hu, Q. Hu, S.C. Huang, C. Huang, D.H. Huang, T.Q. Huang, W.J. Huang, X.T. Huang, X.Y. Huang, Y. Huang, Y.Y. Ji, X.L. Jia, H.Y. Jia, K. Jiang, H.B. Jiang, K. Jiang, X.W. Jiang, Z.J. Jin, M. Kang, M.M. Karpikov, I. Khangulyan, D. Kuleshov, D. Kurinov, K. Li, B.B. Li, C.M. Li, Cheng Li, Cong Li, D. Li, F. Li, H.B. Li, H.C. Li, Jian Li, Jie Li, K. Li, S.D. Li, W.L. Li, W.L. Li, X.R. Li, Xin Li, Y.Z. Li, Zhe Li, Zhuo Liang, E.W. Liang, Y.F. Lin, S.J. Liu, B. Liu, C. Liu, D. Liu, D.B. Liu, H. Liu, H.D. Liu, J. Liu, J.L. Liu, M.Y. Liu, R.Y. Liu, S.M. Liu, W. Liu, Y. Liu, Y.N. Luo, Q. Luo, Y. Lv, H.K. Ma, B.Q. Ma, L.L. Ma, X.H. Mao, J.R. Min, Z. Mitthumsiri, W. Mu, H.J. Nan, Y.C. Neronov, A. Ng, K.C.Y. Ou, L.J. Pattarakijwanich, P. Pei, Z.Y. Qi, J.C. Qi, M.Y. Qiao, B.Q. Qin, J.J. Raza, A. Ruffolo, D. Sáiz, A. Saeed, M. Semikoz, D. Shao, L. Shchegolev, O. Key Laboratory of Particle Astrophysics & Experimental Physics Division & Computing Center Institute of High Energy Physics Chinese Academy of Sciences Beijing100049 China University of Chinese Academy of Sciences Beijing100049 China TIANFU Cosmic Ray Research Center Sichuan Chengdu China Dublin Institute for Advanced Studies 31 Fitzwilliam Place 2 Dublin Ireland Max-Planck-Institut for Nuclear Physics P.O. Box 103980 Heidelberg69029 Germany School of Physical Science and Technology School of Information Science and Technology Southwest Jiaotong University Sichuan Chengdu610031 China School of Astronomy and Space Science Nanjing University Jiangsu Nanjing210023 China Center for Astrophysics Guangzhou University Guangdong Guangzhou510006 China Tsung-Dao Lee Institute School of Physics and Astronomy Shanghai Jiao Tong University Shanghai200240 China Institute for Nuclear Research of Russian Academy of Sciences Moscow117312 Russia Hebei Normal University Hebei Shijiazhuang050024 China University of Science and Technology of China Anhui Hefei230026 China State Key Laboratory of Particle Detection and Electronics China Key Laboratory of Dark Matter and Space Astronomy Key Laboratory of Radio Astronomy Purple Mountain Observatory Chinese Academy of Sciences Jiangsu Nanjing210023 China South-Western Institute for Astronomy Research Yunnan University Yunnan Kunming650091 China Research Center for Astronomical Computing Zhejiang Laboratory Zhejiang Hangzhou311121 China Key Laboratory for Research in Galaxies and Cosmology Shanghai Astronomical Observatory Chinese Academy of Sciences Shanghai200030 China School of Physics and Astronomy Yunnan University Yunnan Kunming650091 China Key Laboratory of Cosmic Rays Tibet University Ministry of Education Tibet Lhasa850000 China Department of Physics The Chinese University of Hong Kong New Territories Shatin Hong Kong Key Laboratory of Radio Astronomy and Technology National Astronomical Obse

Identifying Galactic PeVatrons (PeV particle accelerators) from the ultra-high-energy (UHE, >100 TeV) γ-ray sources plays a crucial role in revealing the origin of Galactic cosmic rays. The UHE source 1LHAASO J185... 详细信息

来源：评论

A computationally-efficient sandbox algorithm for multifractal analysis of large-scale complex networks with tens of millions of nodes

arXiv

引用

arXiv 2020年

作者： Ding, Yuemin Liu, Jin-Long Li, Xiaohui Tian, Yu-Chu Yu, Zu-Guo School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China School of Computer Science Queensland University of Technology BrisbaneQLD4000 Australia Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan Hunan411105 China School of Information Science and Engineering Wuhan University of Science and Technology Wuhan Hubei430081 China

The fractality of complex networks has attracted much attention with extensive investigations over the last 15 years. As a generalization of fractal analysis, multifractal analysis (MFA) is a useful tool to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. One of the widely used methods for fractal analysis is box-covering. It uses the minimum number of covering boxes to calculate the fractal dimension of complex networks, and is known to be NP-hard. More severely, in comparison with fractal analysis algorithms, MFA algorithms have much higher computational complexity. Among various MFA algorithms for complex networks, the sandbox MFA algorithm behaves with the best computational efficiency. However, the existing sandbox algorithm is still computationally expensive. Thus, so far it has only been applied to small-scale complex networks of the size of about tens of thousands of nodes. It becomes challenging to implement the MFA for large-scale networks with tens of millions of nodes. It is also not clear whether or not MFA results can be improved by a largely increased size of a theoretical network. To tackle these challenges, a computationally-efficient sandbox algorithm (CESA) is presented in this paper for MFA of large-scale networks. Distinct from the existing sandbox algorithm that uses the shortest-path distance matrix to obtain the required information for MFA of complex networks, our CESA employs the breadth-first search (BFS) technique to directly search the neighbor nodes of each layer of center nodes, and then to retrieve the required information. Our CESA's input is a sparse data structure derived from the compressed sparse row (CSR) format designed for compressed storage of the adjacency matrix of large-scale network. A theoretical analysis reveals that the CESA reduces the time complexity of the existing sandbox algorithm from cubic to quadratic, and also improves the space complexity from quadratic

来源：评论

Mixed bounce-back boundary scheme of the general propagation lattice Boltzmann method for advection-diffusion equations

引用

Physical Review E 2019年第6期99卷 063316-063316页

作者： Xiuya Guo Zhenhua Chai Shengyong Pang Yong Zhao Baochang Shi School of Mathematics and Statistics Huazhong University of Science and Technology Wuhan 430074 China Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and Technology Wuhan 430074 China State Key Laboratory of Material Processing and Die & Mould Technology Huazhong University of Science and Technology Wuhan 430074 China

In this work, a mixed bounce-back boundary scheme of general propagation lattice Boltzmann (GPLB) model is proposed for isotropic advection-diffusion equations (ADEs) with Robin boundary condition, and a detailed asym... 详细信息

来源：评论

The Most Probable Transition Paths of Stochastic Dynamical Systems: A Sufficient and Necessary Characterization

arXiv

引用

arXiv 2021年

作者： Huang, Yuanfei Huang, Qiao Duan, Jinqiao School of Mathematics and Statistics Center for Mathematical Sciences Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and Technology Wuhan430074 China Department of Statistics and Data Science National University of Singapore 6 Science Drive 2 Singapore117546 Singapore School of Data Science City University of Hong Kong Kowloon Hong Kong Department of Mathematics Faculty of Sciences University of Lisbon Campo Grande Edifício C6 LisboaPT-1749-016 Portugal Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University 21 Nanyang Link Singapore637371 Singapore The Dongguan Key Laboratory for Data Science and Intelligent Medicine Department of Mathematics Department of Physics Great Bay University Guangdong Dongguan523000 China

The most probable transition paths of a stochastic dynamical system are the global minimizers of the Onsager–Machlup action functional and can be described by a necessary but not sufficient condition, the Euler–Lagr... 详细信息

来源：评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：