Searcharxiv⌕ Search

arXiv subjects

Wei Dai

Publications and source records attributed to Wei Dai.

At least 181 records · Page 10Linked to original sources

Particle production at large $p_T$ in Xe+Xe collisions with jet quenching using the higher twist approach

The production of $π^0$, $η$, and $ϕ$ in the most central (0%-5%) Xe+Xe collisions at $\sqrt{s_{NN}}$ = 5.44 TeV is investigated in the framework of the perturbative QCD (pQCD) improved parton model at an accuracy of next-to-leading order (NLO). The jet quenching effect is effectively incorporated by medium-modified fragmentation functions via the higher-twist approach. Predictions of the nuclear modification factors of $π^0$, $η$, and $ϕ$ as functions of the transverse momentum $p_{\rm T}$ are made with the jet transport parameter $\hat{q}_0$, which is extracted from the available experimental data of charged hadrons provided by ALICE and CMS. The particle ratios $η/π^0,\ ϕ/π^0$ as functions of $p_{\rm T}$ in Xe+Xe collisions at $\sqrt{s_{NN}}$ = 5.44 TeV as well as in 0%-5% Pb+Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV are also presented. The numerical simulations of the scaled ratios of charged hadron production in the Xe+Xe 5.44 TeV system over those in the Pb+Pb 5.02 TeV system give a good description of the CMS data, and the scaled ratios of $π^0$, $η$, and $ϕ$ production coincide with the curve of charged hadron production.

hep-ph↗

Substructures of heavy flavor jets in $pp$ and PbPb collisions at $\sqrt{s}$ = 5.02 TeV

Groomed jet substructure measurements, the momentum splitting fraction $z_g$ and the groomed jet radius $R_g$, of inclusive, D$^0$-tagged and B$^0$-tagged jets in $pp$ and central PbPb collisions at $\sqrt{s}=5.02$ TeV are predicted and investigated. Charged jets are constrained in a relatively low transverse momentum interval 15 $\leq p_{\rm T}^{\rm jet\ ch} <$ 30 GeV/$c$ where the QCD emissions are sensitive to mass effects. In $pp$ collisions, heavy flavor jets have less momentum-balanced splittings than inclusive jets and the larger quark mass is, the less momentum-balanced splittings are. B$^0$-tagged jets distribute at lager $R_g$ than both D$^0$-tagged and inclusive jets, while D$^0$-tagged jets distribute at smaller $R_g$ than inclusive jets. That can be explained by the competition between parton mass effects and flavour effects on splitting-angle distributions. In $A$+$A$ collisions, jet quenching effects further suppress the momentum-balanced splittings and enhance the large-angle splittings. Heavy flavor jets suffer more $z_g$ and less $R_g$ modifications due to jet-medium interactions. The mass hierarchy in $z_g$ of inclusive, D$^0$-tagged, B$^0$-tagged jets and competition between mass effects and Casimir colour factors in $R_g$ can also be observed in PbPb collisions.

nucl-th↗

Method of scaling spheres: Liouville theorems in inner or outer (unbounded or bounded) generalized radially convex domains, blowing-up analysis on domains with not necessarily $C^1$ boundary and other applications

In this paper, we aim to introduce the method of scaling spheres (MSS) as a unified approach to Liouville theorems on general domains in $\mathbb R^n$, and apply it to establish Liouville theorems on arbitrary unbounded or bounded MSS applicable domains for general ($\leq n$-th order) PDEs and integral equations without translation invariance or with singularities. The set of MSS applicable domains includes any unbounded or bounded generalized radially convex domains and any complementary sets of their closures, which is invariant under Kelvin transforms and is the maximal collection of simply connected domains such that the MSS works. For instance, $ \mathbb R^n$, $\mathbb R^n_+$, balls, cone-like domains, convex domains, star-shaped domains and all the complements of their closures are MSS applicable domains. MSS applicable domains is to the MSS what convex domains is to the method of moving planes. As applications, we derive a priori estimates and existence of solutions from the boundary Hölder estimates for Dirichlet or Navier problems of Lane-Emden equations by applying the blowing-up argument on domains with blowing-up cone boundary (BCB domains for short). After the blowing-up procedure, the BCB domains allow the limiting shape of the domain to be a cone (half space is a cone). While the classical blowing-up techniques in previous papers work on $C^1$-smooth domains, we are able to apply blowing-up analysis on more general BCB domains on which the boundary Hölder estimates hold (can be guaranteed by uniform exterior cone property etc). Since there are no smoothness conditions on the boundary of MSS applicable domain and BCB domain, our results clearly reveal that the existence and nonexistence of solutions mainly rely on topology (not smoothness) of the domain.

math.AP↗

Explainable Semantic Medical Image Segmentation with Style

Semantic medical image segmentation using deep learning has recently achieved high accuracy, making it appealing to clinical problems such as radiation therapy. However, the lack of high-quality semantically labelled data remains a challenge leading to model brittleness to small shifts to input data. Most works require extra data for semi-supervised learning and lack the interpretability of the boundaries of the training data distribution during training, which is essential for model deployment in clinical practice. We propose a fully supervised generative framework that can achieve generalisable segmentation with only limited labelled data by simultaneously constructing an explorable manifold during training. The proposed approach creates medical image style paired with a segmentation task driven discriminator incorporating end-to-end adversarial training. The discriminator is generalised to small domain shifts as much as permissible by the training data, and the generator automatically diversifies the training samples using a manifold of input features learnt during segmentation. All the while, the discriminator guides the manifold learning by supervising the semantic content and fine-grained features separately during the image diversification. After training, visualisation of the learnt manifold from the generator is available to interpret the model limits. Experiments on a fully semantic, publicly available pelvis dataset demonstrated that our method is more generalisable to shifts than other state-of-the-art methods while being more explainable using an explorable manifold.

eess.IV↗

Multimodal Brain Disease Classification with Functional Interaction Learning from Single fMRI Volume

In neuroimaging analysis, fMRI can well assess the function changes for brain diseases with no obvious structural lesions. To date, most deep-learning-based fMRI studies have employed functional connectivity (FC) as the basic feature for disease classification. However, FC is calculated on time series of predefined regions of interest and neglects detailed information contained in each voxel. Another drawback of using FC is the limited sample size for the training of deep models. The low representation ability of FC leads to poor performance in clinical practice, especially when dealing with multimodal medical data involving multiple types of visual signals and textual records for brain diseases. To overcome this bottleneck problem in the fMRI feature modality, we propose BrainFormer, an end-to-end functional interaction learning method for brain disease classification with single fMRI volume. Unlike traditional deep learning methods that construct convolution and transformers on FC, BrainFormer learns the functional interaction from fMRI signals, by modeling the local cues within each voxel with 3D convolutions and capturing the global correlations among distant regions with specially designed global attention mechanisms from shallow layers to deep layers. Meanwhile, BrainFormer can deal with multimodal medical data including fMRI volume, structural MRI, FC features and phenotypic data to achieve more comprehensive brain disease diagnosis. We evaluate BrainFormer on five independent multi-site datasets on autism, Alzheimer's disease, depression, attention deficit hyperactivity disorder and headache disorders. The results demonstrate its effectiveness and generalizability for multiple brain diseases diagnosis with multimodal features. BrainFormer may promote precision of neuroimaging-based diagnosis in clinical practice and motivate future studies on fMRI analysis.

eess.IV↗

Discovering Limitations of Image Quality Assessments with Noised Deep Learning Image Sets

Image quality is important, and can affect overall performance in image processing and computer vision as well as for numerous other reasons. Image quality assessment (IQA) is consequently a vital task in different applications from aerial photography interpretation to object detection to medical image analysis. In previous research, the BRISQUE algorithm and the PSNR algorithm were evaluated with high resolution (atleast 512x384 pixels), but relatively small image sets (no more than 4,744 images). However, scientists have not evaluated IQA algorithms on low resolution (no more than 32x32 pixels), multi-perturbation, big image sets (for example, tleast 60,000 different images not counting their perturbations). This study explores these two IQA algorithms through experimental investigation. We first chose two deep learning image sets, CIFAR-10 and MNIST. Then, we added 68 perturbations that add noise to the images in specific sequences and noise intensities. In addition, we tracked the performance outputs of the two IQA algorithms with singly and multiply noised images. After quantitatively analyzing experimental results, we report the limitations of the two IQAs with these noised CIFAR-10 and MNIST image sets. We also explain three potential root causes for performance degradation. These findings point out weaknesses of the two IQA algorithms. The research results provide guidance to scientists and engineers developing accurate, robust IQA algorithms. All source codes, related image sets, and figures are shared on the website (https://github.com/caperock/imagequality) to support future scientific and industrial projects.

cs.CV↗

Planting and Mitigating Memorized Content in Predictive-Text Language Models

Language models are widely deployed to provide automatic text completion services in user products. However, recent research has revealed that language models (especially large ones) bear considerable risk of memorizing private training data, which is then vulnerable to leakage and extraction by adversaries. In this study, we test the efficacy of a range of privacy-preserving techniques to mitigate unintended memorization of sensitive user text, while varying other factors such as model size and adversarial conditions. We test both "heuristic" mitigations (those without formal privacy guarantees) and Differentially Private training, which provides provable levels of privacy at the cost of some model performance. Our experiments show that (with the exception of L2 regularization), heuristic mitigations are largely ineffective in preventing memorization in our test suite, possibly because they make too strong of assumptions about the characteristics that define "sensitive" or "private" text. In contrast, Differential Privacy reliably prevents memorization in our experiments, despite its computational and model-performance costs.

cs.CL↗

Generalisable 3D Fabric Architecture for Streamlined Universal Multi-Dataset Medical Image Segmentation

Data scarcity is common in deep learning models for medical image segmentation. Previous works proposed multi-dataset learning, either simultaneously or via transfer learning to expand training sets. However, medical image datasets have diverse-sized images and features, and developing a model simultaneously for multiple datasets is challenging. This work proposes Fabric Image Representation Encoding Network (FIRENet), a universal architecture for simultaneous multi-dataset segmentation and transfer learning involving arbitrary numbers of dataset(s). To handle different-sized image and feature, a 3D fabric module is used to encapsulate many multi-scale sub-architectures. An optimal combination of these sub-architectures can be implicitly learnt to best suit the target dataset(s). For diverse-scale feature extraction, a 3D extension of atrous spatial pyramid pooling (ASPP3D) is used in each fabric node for a fine-grained coverage of rich-scale image features. In the first experiment, FIRENet performed 3D universal bone segmentation of multiple musculoskeletal datasets of the human knee, shoulder and hip joints and exhibited excellent simultaneous multi-dataset segmentation performance. When tested for transfer learning, FIRENet further exhibited excellent single dataset performance (when pre-training on a prostate dataset), as well as significantly improved universal bone segmentation performance. The following experiment involves the simultaneous segmentation of the 10 Medical Segmentation Decathlon (MSD) challenge datasets. FIRENet demonstrated good multi-dataset segmentation results and inter-dataset adaptability of highly diverse image sizes. In both experiments, FIRENet's streamlined multi-dataset learning with one unified network that requires no hyper-parameter tuning.

eess.IV↗

BrainGB: A Benchmark for Brain Network Analysis with Graph Neural Networks

Mapping the connectome of the human brain using structural or functional connectivity has become one of the most pervasive paradigms for neuroimaging analysis. Recently, Graph Neural Networks (GNNs) motivated from geometric deep learning have attracted broad interest due to their established power for modeling complex networked data. Despite their superior performance in many fields, there has not yet been a systematic study of how to design effective GNNs for brain network analysis. To bridge this gap, we present BrainGB, a benchmark for brain network analysis with GNNs. BrainGB standardizes the process by (1) summarizing brain network construction pipelines for both functional and structural neuroimaging modalities and (2) modularizing the implementation of GNN designs. We conduct extensive experiments on datasets across cohorts and modalities and recommend a set of general recipes for effective GNN designs on brain networks. To support open and reproducible research on GNN-based brain network analysis, we host the BrainGB website at https://braingb.us with models, tutorials, examples, as well as an out-of-box Python package. We hope that this work will provide useful empirical evidence and offer insights for future research in this novel and promising direction.

q-bio.NC↗

Jet radius and momentum splitting fraction with dynamical grooming in heavy-ion collisions

We investigate the medium modifications of momentum splitting fraction and groomed jet radius with both dynamical grooming and soft drop algorithms in heavy-ion collisions. In the calculation, the partonic spectrum of initial hard scattering in p+p collisions is provided by the event generator PYTHIA 8, and the energy loss of fast parton traversing in a hot/dense QCD medium is simulated with the Linear Boltzmann Transport (LBT) model. We predict the normalized distributions of the groomed jet radius $θ_g$ and momentum splitting fraction $z_g$ with the dynamical grooming algorithm in Pb+Pb collisions at $\sqrt{s_{\mathrm{NN}}}$ = 5.02 TeV, then compare these quantities in dynamical grooming at $a=0.1$, with that in soft drop at $z_{\mathrm{cut}} = 0.1$ and $β= 0$. It is found that the normalized distribution ratios Pb+Pb/p+p with respect to $z_g$ in $z_{\mathrm{cut}} = 0.1$, $β= 0$ soft drop case are close to unity and those in $a=0.1$ dynamical grooming case show enhancement at small $z_g$, and Pb+Pb/p+p with respect to $θ_g$ in the dynamical grooming case demonstrate weaker modification than those in the soft drop counterparts. We further calculate the groomed jet number averaged momentum splitting fraction $\rm \langle z_g \rangle_{jets}$ and averaged groomed jet radius $\rm \langle θ_g \rangle_{jets}$ in p+p and A+A for both grooming cases in three $p^{\rm ch, jet}_{\rm T}$ intervals, and find that the originally generated well balanced groomed jets will become more momentum imbalanced and less jet size narrowing due to jet quenching, and weaker medium modification of $z_g$ and $θ_g$ in $a =0.1$ dynamical grooming case than in the soft drop counterparts.

nucl-th↗

Unsupervised Galaxy Morphological Visual Representation with Deep Contrastive Learning

Galaxy morphology reflects structural properties which contribute to understand the formation and evolution of galaxies. Deep convolutional networks have proven to be very successful in learning hidden features that allow for unprecedented performance on galaxy morphological classification. Such networks mostly follow the supervised learning paradigm which requires sufficient labelled data for training. However, it is an expensive and complicated process of labeling for million galaxies, particularly for the forthcoming survey projects. In this paper, we present an approach based on contrastive learning with aim for learning galaxy morphological visual representation using only unlabeled data. Considering the properties of low semantic information and contour dominated of galaxy image, the feature extraction layer of the proposed method incorporates vision transformers and convolutional network to provide rich semantic representation via the fusion of the multi-hierarchy features. We train and test our method on 3 classifications of datasets from Galaxy Zoo 2 and SDSS-DR17, and 4 classifications from Galaxy Zoo DECaLS. The testing accuracy achieves 94.7%, 96.5% and 89.9% respectively. The experiment of cross validation demonstrates our model possesses transfer and generalization ability when applied to the new datasets. The code that reveals our proposed method and pretrained models are publicly available and can be easily adapted to new surveys.

astro-ph.GA↗

Classification of solutions to conformally invariant systems with mixed order and exponentially increasing or nonlocal nonlinearity

In this paper, without any assumption on $v$ and under extremely mild assumption $u(x)=O(|x|^{K})$ at $\infty$ for some $K\gg1$ arbitrarily large, we prove classification of solutions to the following conformally invariant system with mixed order and exponentially increasing nonlinearity in $\mathbb{R}^{2}$: \begin{equation*}\\\begin{cases} (-Δ)^{\frac{1}{2}}u(x)=e^{pv(x)}, \qquad x\in\mathbb{R}^{2}, \\ -Δv(x)=u^{4}(x), \qquad x\in\mathbb{R}^{2}, \end{cases}\end{equation*} where $p\in(0,+\infty)$, $u\geq 0$ and satisfies the finite total curvature condition $\int_{\mathbb{R}^{2}}u^{4}(x)\mathrm{d}x<+\infty$. In order to show integral representation formula and crucial asymptotic property for $v$, we derive and use an $\exp^{L}+L\ln L$ inequality, which is itself of independent interest. When $p=\frac{3}{2}$, the system is closely related to single conformally invariant equations $(-Δ)^{\frac{1}{2}}u=u^{3}$ and $-Δv=e^{2v}$ on $\mathbb{R}^{2}$, which have been quite extensively studied (cf. \cite{BF,C,CY,CL,CLL,CLZ} etc). We also derive classification results for nonnegative solutions to conformally invariant system with mixed order and Hartree type nonlocal nonlinearity in $\mathbb{R}^{3}$. Extensions to mixed order conformally invariant systems in $\mathbb{R}^{n}$ with general dimensions $n\geq3$ are also included.

math.AP↗

Brain Network Transformer

Human brains are commonly modeled as networks of Regions of Interest (ROIs) and their connections for the understanding of brain functions and mental disorders. Recently, Transformer-based models have been studied over different types of data, including graphs, shown to bring performance gains widely. In this work, we study Transformer-based models for brain network analysis. Driven by the unique properties of data, we model brain networks as graphs with nodes of fixed size and order, which allows us to (1) use connection profiles as node features to provide natural and low-cost positional information and (2) learn pair-wise connection strengths among ROIs with efficient attention weights across individuals that are predictive towards downstream analysis tasks. Moreover, we propose an Orthonormal Clustering Readout operation based on self-supervised soft clustering and orthonormal projection. This design accounts for the underlying functional modules that determine similar behaviors among groups of ROIs, leading to distinguishable cluster-aware node embeddings and informative graph embeddings. Finally, we re-standardize the evaluation pipeline on the only one publicly available large-scale brain network dataset of ABIDE, to enable meaningful comparison of different models. Experiment results show clear improvements of our proposed Brain Network Transformer on both the public ABIDE and our restricted ABCD datasets. The implementation is available at https://github.com/Wayfear/BrainNetworkTransformer.

cs.LG↗

$p_{T}$ dispersion of inclusive jets in high-energy nuclear collisions

In this paper, we investigate the medium modifications of $p_{T}$ dispersion($p_{T}D$) of inclusive jets with small radius ($R=0.2$) in Pb+Pb collisions at $\sqrt{s}=2.76$~TeV. The partonic spectrum in the initial hard scattering of elementary collisions are obtained by an event generator POWHEG+PYTHIA, which matches the next-to-leading (NLO) matrix elements with parton showering, and energy loss of fast parton traversing in hot/dense QCD medium is calculated by Monte Carlo simulation within Higher-Twist formalism of jet quenching in heavy-ion collisions. We present the model calculations of normalized $p_{T}D$ distributions for inclusive jets in p+p and Pb+Pb collisions at $\sqrt{s}=2.76$~TeV, which give nice descriptions of ALICE measurements. It is shown that the $p_{T}D$ distributions of inclusive jets in Pb+Pb are shifted to higher $p_{T}D$ region relative to that in p+p. Thus the nuclear modification factor of $p_{T}D$ distributions for inclusive jets is smaller than unity at small $p_{T}D$ region, while larger than one at large $p_{T}D$ region. This behaviour results from more uneven $p_T$ of jet constituents as well as the fraction alteration of gluon/quark initiated jets in heavy-ion collisions. The difference of $p_{T}D$ distributions between groomed and ungroomed jets in Pb+Pb collisions are also discussed.

hep-ph↗

Uniform a priori estimates for $n$-th order Lane-Emden system in $\mathbb{R}^{n}$ with $n\geq3$

In this paper, we establish uniform a priori estimates for positive solutions to the (higher) critical order superlinear Lane-Emden system in bounded domains with Navier boundary conditions in arbitrary dimensions $n\geq3$. First, we prove the monotonicity of solutions for odd order (higher order fractional system) and even order system (integer order system) respectively along the inward normal direction near the boundary by the method of moving planes in local ways. Then we derive uniform a priori estimates by establishing the precise relationships between the maxima of $u$, $v$, $-Δu$ and $-Δv$ through Harnack inequality. Our results extended the uniform a priori estimates for critical order problems in [18, 19] from $n=2$ to higher dimensions $n\geq3$ and in [6, 8] from one single equation to system. With such a priori estimates, one will be able to obtain the existence of solutions via topological degree theory or continuation argument.

math.AP↗

Deeply Supervised Skin Lesions Diagnosis with Stage and Branch Attention

Accurate and unbiased examinations of skin lesions are critical for the early diagnosis and treatment of skin diseases. Visual features of skin lesions vary significantly because the images are collected from patients with different lesion colours and morphologies by using dissimilar imaging equipment. Recent studies have reported that ensembled convolutional neural networks (CNNs) are practical to classify the images for early diagnosis of skin disorders. However, the practical use of these ensembled CNNs is limited as these networks are heavyweight and inadequate for processing contextual information. Although lightweight networks (e.g., MobileNetV3 and EfficientNet) were developed to achieve parameters reduction for implementing deep neural networks on mobile devices, insufficient depth of feature representation restricts the performance. To address the existing limitations, we develop a new lite and effective neural network, namely HierAttn. The HierAttn applies a novel deep supervision strategy to learn the local and global features by using multi-stage and multi-branch attention mechanisms with only one training loss. The efficacy of HierAttn was evaluated by using the dermoscopy images dataset ISIC2019 and smartphone photos dataset PAD-UFES-20 (PAD2020). The experimental results show that HierAttn achieves the best accuracy and area under the curve (AUC) among the state-of-the-art lightweight networks. The code is available at https://github.com/anthonyweidai/HierAttn.

eess.IV↗

Interpretable Graph Neural Networks for Connectome-Based Brain Disorder Analysis

Human brains lie at the core of complex neurobiological systems, where the neurons, circuits, and subsystems interact in enigmatic ways. Understanding the structural and functional mechanisms of the brain has long been an intriguing pursuit for neuroscience research and clinical disorder therapy. Mapping the connections of the human brain as a network is one of the most pervasive paradigms in neuroscience. Graph Neural Networks (GNNs) have recently emerged as a potential method for modeling complex network data. Deep models, on the other hand, have low interpretability, which prevents their usage in decision-critical contexts like healthcare. To bridge this gap, we propose an interpretable framework to analyze disorder-specific Regions of Interest (ROIs) and prominent connections. The proposed framework consists of two modules: a brain-network-oriented backbone model for disease prediction and a globally shared explanation generator that highlights disorder-specific biomarkers including salient ROIs and important connections. We conduct experiments on three real-world datasets of brain disorders. The results verify that our framework can obtain outstanding performance and also identify meaningful biomarkers. All code for this work is available at https://github.com/HennyJie/IBGNN.git.

q-bio.NC↗

Solving DC Power Flow Problems Using Quantum and Hybrid algorithms

Power flow calculation plays an important role in planning, operation, and control of the power system. The quantum HHL algorithm can achieve theoretical exponential speedup over classical algorithms on DC power flow calculation. Since the qubit resources in the Noisy Intermediate-scale Quantum (NISQ) era are limited, it is important to discuss the performance considering this limitation. The coefficient matrix of the linear systems of equations in DC power flow problems cannot be represented perfectly by finite binary number strings, which leads to imperfect phase estimation. This work is carried out under the assumption of imperfect phase estimation. The performance of the HHL algorithm is systematically investigated with different accuracy and redundant qubits. In order to further reduce the required qubit resources, a hybrid quantum-classical algorithm is proposed. By comparing errors of the HHL and hybrid algorithms in the DC power flow calculation of the IEEE 5-bus test system, it is found that the hybrid algorithm can achieve comparable precision with fewer qubits than HHL by increasing the number of phase estimation modules, which may make the hybrid algorithm a feasible route in the NISQ era.

quant-ph↗