A5090650844- Particle physics theoretical and experimental studies
- Quantum Chromodynamics and Particle Interactions
- High-Energy Particle Collisions Research
- Black Holes and Theoretical Physics
- Particle Accelerators and Free-Electron Lasers
- Neutrino Physics Research
- Computational Physics and Python Applications
- advanced mathematical theories
- Atomic and Subatomic Physics Research
- Dark Matter and Cosmic Phenomena
- Stochastic processes and statistical mechanics
- Particle Detector Development and Performance
- Advanced NMR Techniques and Applications
- Thermal and Kinetic Analysis
- Quantum many-body systems
- Advanced Banach Space Theory
- Blockchain Technology Applications and Security
- Spectral Theory in Mathematical Physics
- Imbalanced Data Classification Techniques
- Data Analysis with R
- Digital Radiography and Breast Imaging
- Algorithms and Data Compression
- Photoacoustic and Ultrasonic Imaging
- Data Visualization and Analytics
- Pulsars and Gravitational Waves Research
Wuhan University
2024-2025
University of Edinburgh
2024
The complexity classification of the Holant problem has remained unresolved for past fifteen years. Counting complex-weighted Eulerian orientation problems, denoted as \#EO, is regarded one most significant challenges to comprehensive problem. This article presents an $\text{FP}^\text{NP}$ vs. \#P dichotomy demonstrating that \#EO defined by a signature set either \#P-hard or polynomial-time computable with specific NP oracle. result provides and potentially leads Furthermore, we derive...
\textsf{Holant} is an essential framework in the field of counting complexity. For over fifteen years, researchers have been clarifying complexity classification for complex-valued on Boolean domain, a challenge that remains unresolved. In this article, we prove dichotomy domain when non-trivial signature odd arity exists. This based \textsf{\#EO}, and consequently $\text{FP}^\text{NP}$ vs. \#P as well, stating each problem either or \#P-hard. Furthermore, establish generalized version...
This paper defines, analyzes, and discusses the emerging genre of visualization atlases. We currently witness an increase in web-based, data-driven initiatives that call themselves "atlases" while explaining complex, contemporary issues through data visualizations: climate change, sustainability, AI, or cultural discoveries. To understand this inform their design, study, authoring support, we conducted a systematic analysis 33 atlases semi-structured interviews with eight atlas creators....
Let $\mu_{\{M_n\},\{D_n\}}$ be a Moran measure on $\mathbb{R}^2$ generated by sequence of expanding matrices $\{M_n\}\subset GL(2, \mathbb{Z})$ and integer digit sets $\{D_n\}$ where $D_n=\left\{\begin{pmatrix} 0 \\ \end{pmatrix},\begin{pmatrix} \alpha_{n_1} \alpha_{n_2} \beta_{n_1} \beta_{n_2} -\alpha_{n_1}-\beta_{n_1} -\alpha_{n_2}-\beta_{n_2} \end{pmatrix} \right\}$ with $\alpha_{n_1}\beta_{n_2}-\alpha_{n_2}\beta_{n_1}\notin2\mathbb{Z}$. If $|\det(M_n)|>4$ for $n\geq1$, $\sup\limits_{n\ge...