Researcher profile

Jiawei Zhang

Jiawei Zhang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author

110works

0followers

22topics

4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

DecodingTrust-Agent Platform (DTap): A Controllable and Interactive Red-Teaming Platform for AI Agents

AI agents are increasingly deployed across diverse domains to automate complex workflows through long-horizon and high-stakes action executions. Due to their high capability and flexibility, such agents raise significant security and safety concerns. A growing number of real-world incidents have shown that adversaries can easily manipulate agents into performing harmful actions, such as leaking API keys, deleting user data, or initiating unauthorized transactions. Evaluating agent security is inherently challenging, as agents operate in dynamic, untrusted environments involving external tools, heterogeneous data sources, and frequent user interactions. However, realistic, controllable, and reproducible environments for large-scale risk assessment remain largely underexplored. To address this gap, we introduce the DecodingTrust-Agent Platform (DTap), the first controllable and interactive red-teaming platform for AI agents, spanning 14 real-world domains and over 50 simulation environments that replicate widely used systems such as Google Workspace, Paypal, and Slack. To scale the risk assessment of agents in DTap, we further propose DTap-Red, the first autonomous red-teaming agent that systematically explores diverse injection vectors (e.g., prompt, tool, skill, environment, combinations) and autonomously discovers effective attack strategies tailored to varying malicious goals. Using DTap-Red, we curate DTap-Bench, a large-scale red-teaming dataset comprising high-quality instances across domains, each paired with a verifiable judge to automatically validate attack outcomes. Through DTap, we conduct large-scale evaluations of popular AI agents built on various backbone models, spanning security policies, risk categories, and attack strategies, revealing systematic vulnerability patterns and providing valuable insights for developing secure next-generation agents.

preprint2026arXiv

MMViR: A Multi-Modal and Multi-Granularity Representation for Long-range Video Understanding

Long videos, ranging from minutes to hours, present significant challenges for current Multi-modal Large Language Models (MLLMs) due to their complex events, diverse scenes, and long-range dependencies. Direct encoding of such videos is computationally too expensive, while simple video-to-text conversion often results in redundant or fragmented content. To address these limitations, we introduce MMViR, a novel multi-modal, multi-grained structured representation for long video understanding. MMViR identifies key turning points to segment the video and constructs a three-level description that couples global narratives with fine-grained visual details. This design supports efficient query-based retrieval and generalizes well across various scenarios. Extensive evaluations across three tasks, including QA, summarization, and retrieval, show that MMViR outperforms the prior strongest method, achieving a 19.67% improvement in hour-long video understanding while reducing processing latency to 45.4% of the original.

preprint2026arXiv

Mosaic: Unlocking Long-Context Inference for Diffusion LLMs via Global Memory Planning and Dynamic Peak Taming

Diffusion-based large language models (dLLMs) have emerged as a promising paradigm, utilizing simultaneous denoising to enable global planning and iterative refinement. While these capabilities are particularly advantageous for long-context generation, deploying such models faces a prohibitive memory capacity barrier stemming from severe system inefficiencies. We identify that existing inference systems are ill-suited for this paradigm: unlike autoregressive models constrained by the cumulative KV-cache, dLLMs are bottlenecked by transient activations recomputed at every step. Furthermore, general-purpose memory reuse mechanisms lack the global visibility to adapt to dLLMs' dynamic memory peaks, which toggle between logits and FFNs. To address these mismatches, we propose Mosaic, a memory-efficient inference system that shifts from local, static management to a global, dynamic paradigm. Mosaic integrates a mask-only logits kernel to eliminate redundancy, a lazy chunking optimizer driven by an online heuristic search to adaptively mitigate dynamic peaks, and a global memory manager to resolve fragmentation via virtual addressing. Extensive evaluations demonstrate that Mosaic achieves an average 2.71$\times$ reduction in the memory peak-to-average ratio and increases the maximum inference sequence length supportable on identical hardware by 15.89-32.98$\times$. This scalability is achieved without compromising accuracy and speed, and in fact reducing latency by 4.12%-23.26%.

preprint2026arXiv

Qwen-Image-2.0 Technical Report

We present Qwen-Image-2.0, an omni-capable image generation foundation model that unifies high-fidelity generation and precise image editing within a single framework. Despite recent progress, existing models still struggle with ultra-long text rendering, multilingual typography, high-resolution photorealism, robust instruction following, and efficient deployment, especially in text-rich and compositionally complex scenarios. Qwen-Image-2.0 addresses these challenges by coupling Qwen3-VL as the condition encoder with a Multimodal Diffusion Transformer for joint condition-target modeling, supported by large-scale data curation and a customized multi-stage training pipeline. This enables strong multimodal understanding while preserving flexible generation and editing capabilities. The model supports instructions of up to 1K tokens for generating text-rich content such as slides, posters, infographics, and comics, while significantly improving multilingual text fidelity and typography. It also enhances photorealistic generation with richer details, more realistic textures, and coherent lighting, and follows complex prompts more reliably across diverse styles. Extensive human evaluations show that Qwen-Image-2.0 substantially outperforms previous Qwen-Image models in both generation and editing, marking a step toward more general, reliable, and practical image generation foundation models.

preprint2026arXiv

Revisiting Photometric Ambiguity for Accurate Gaussian-Splatting Surface Reconstruction

Surface reconstruction with differentiable rendering has achieved impressive performance in recent years, yet the pervasive photometric ambiguities have strictly bottlenecked existing approaches. This paper presents AmbiSuR, a framework that explores an intrinsic solution upon Gaussian Splatting for the photometric ambiguity-robust surface 3D reconstruction with high performance. Starting by revisiting the foundation, our investigation uncovers two built-in primitive-wise ambiguities in representation, while revealing an intrinsic potential for ambiguity self-indication in Gaussian Splatting. Stemming from these, a photometric disambiguation is first introduced, constraining ill-posed geometry solution for definite surface formation. Then, we propose an ambiguity indication module that unleashes the self-indication potential to identify and further guide correcting underconstrained reconstructions. Extensive experiments demonstrate our superior surface reconstructions compared to existing methods across various challenging scenarios, excelling in broad compatibility. Project: https://fictionarry.github.io/AmbiSuR-Proj/ .

preprint2026arXiv

Synthetic American Option Pricing via Jump-HMM-Driven Heston Implied Volatility

Generating realistic synthetic option prices requires implied volatility as an input, yet implied volatility is itself derived from observed option prices, creating a circular dependency that limits synthetic data for machine-learning and risk-analysis applications. We break this circularity with a pipeline in which implied volatility emerges as an output of a structural model of equity returns. A Jump Hidden Markov Model produces multi-asset price paths with realistic stylized facts and cross-asset tail dependence; a modified Heston variance process, whose mean-reversion target depends on regime state, days to expiration, moneyness, and a market-mood indicator, converts those paths into implied-volatility paths; and a recombining binomial lattice prices American options from the resulting surface. Initializing variance at its mean-reversion target for each strike-expiration pair lets smile, skew, and term structure emerge without external calibration. We calibrate the shape function through a hierarchy spanning a parametric baseline, a globally shared neural surrogate, and a sector-specific neural surrogate fit to a multi-ticker, multi-sector option ladder. A temporal holdout on a multi-day capture isolated scheduled corporate events as the dominant source of test-time generalization error, and calendar-derived earnings-distance and same-sector peer-coupling features recovered the anticipatory portion of that signal. We then apply the framework as a synthetic-data generator on real near-the-money put and call contracts, forward-simulating price paths, and recovering path-conditional implied volatility, finite-difference American Greeks, and terminal short-premium profit and loss from one coherent simulation, and confirm cross-ticker robustness by re-running on a second underlying from a different sector and volatility regime. The framework is released as an open-source Julia package.

preprint2026arXiv

Virtual-force Based Visual Servo for Multiple Peg-in-Hole Assembly with Tightly Coupled Multi-Manipulator

Multiple Peg-in-Hole (MPiH) assembly is one of the fundamental tasks in robotic assembly. In the MPiH tasks for large-size parts, it is challenging for a single manipulator to simultaneously align multiple distant pegs and holes, necessitating tightly coupled multi-manipulator systems. For such MPiH tasks using tightly coupled multiple manipulators, we propose a collaborative visual servo control framework that uses only the monocular in-hand cameras of each manipulator to reduce positioning errors. Initially, we train a state classification neural network and a positioning neural network. The former divides the states of the peg and hole in the image into three categories: obscured, separated, and overlapped, while the latter determines the position of the peg and hole in the image. Based on these findings, we propose a method to integrate the visual features of multiple manipulators using virtual forces, which can naturally combine with the cooperative controller of the multi-manipulator system. To generalize our approach to holes of different appearances, we varied the appearance of the holes during the dataset generation process. The results confirm that by considering the appearance of the holes, classification accuracy and positioning precision can be improved. Finally, the results show that our method achieves 100\% success rate in dual-manipulator dual peg-in-hole tasks with a clearance of 0.2 mm, while robust to camera calibration errors.

preprint2025arXiv

Local Path Optimization in The Latent Space Using Learned Distance Gradient

Constrained motion planning is a common but challenging problem in robotic manipulation. In recent years, data-driven constrained motion planning algorithms have shown impressive planning speed and success rate. Among them, the latent motion method based on manifold approximation is the most efficient planning algorithm. Due to errors in manifold approximation and the difficulty in accurately identifying collision conflicts within the latent space, time-consuming path validity checks and path replanning are required. In this paper, we propose a method that trains a neural network to predict the minimum distance between the robot and obstacles using latent vectors as inputs. The learned distance gradient is then used to calculate the direction of movement in the latent space to move the robot away from obstacles. Based on this, a local path optimization algorithm in the latent space is proposed, and it is integrated with the path validity checking process to reduce the time of replanning. The proposed method is compared with state-of-the-art algorithms in multiple planning scenarios, demonstrating the fastest planning speed

preprint2025arXiv

Online training and pruning of multi-wavelength photonic neural networks

CMOS-compatible photonic integrated circuits (PICs) are emerging as a promising platform in artificial intelligence (AI) computing. Owing to the compact footprint of microring resonators (MRRs) and the enhanced interconnect efficiency enabled by wavelength division multiplexing (WDM), MRR-based photonic neural networks (PNNs) are particularly promising for large-scale integration. However, the scalability and energy efficiency of such systems are fundamentally limited by the MRR resonance wavelength variations induced by fabrication process variations (FPVs) and environmental fluctuations. Existing solutions use post-fabrication approaches or thermo-optic tuning, incurring high control power and additional process complexity. In this work, we introduce an online training and pruning method that addresses this challenge, adapting to FPV-induced and thermally induced shifts in MRR resonance wavelength. By incorporating a power-aware pruning term into the conventional loss function, our approach simultaneously optimizes the PNN accuracy and the total power consumption for MRR tuning. In proof-of-concept on-chip experiments on the Iris dataset, our system PNNs can adaptively train to maintain a 96% classification accuracy, while achieving a 44.7% reduction in tuning power via pruning. Additionally, our approach reduces the power consumption by orders-of-magnitude on larger datasets. By addressing chip-to-chip variation and minimizing power requirements, our approach significantly improves the scalability and energy efficiency of MRR-based integrated analog photonic processors, paving the way for large-scale PICs to enable versatile applications including neural networks, photonic switching, LiDAR, and radio-frequency beamforming.

preprint2024arXiv

Contrastive Sequential Interaction Network Learning on Co-Evolving Riemannian Spaces

The sequential interaction network usually find itself in a variety of applications, e.g., recommender system. Herein, inferring future interaction is of fundamental importance, and previous efforts are mainly focused on the dynamics in the classic zero-curvature Euclidean space. Despite the promising results achieved by previous methods, a range of significant issues still largely remains open: On the bipartite nature, is it appropriate to place user and item nodes in one identical space regardless of their inherent difference? On the network dynamics, instead of a fixed curvature space, will the representation spaces evolve when new interactions arrive continuously? On the learning paradigm, can we get rid of the label information costly to acquire? To address the aforementioned issues, we propose a novel Contrastive model for Sequential Interaction Network learning on Co-Evolving RiEmannian spaces, CSINCERE. To the best of our knowledge, we are the first to introduce a couple of co-evolving representation spaces, rather than a single or static space, and propose a co-contrastive learning for the sequential interaction network. In CSINCERE, we formulate a Cross-Space Aggregation for message-passing across representation spaces of different Riemannian geometries, and design a Neural Curvature Estimator based on Ricci curvatures for modeling the space evolvement over time. Thereafter, we present a Reweighed Co-Contrast between the temporal views of the sequential network, so that the couple of Riemannian spaces interact with each other for the interaction prediction without labels. Empirical results on 5 public datasets show the superiority of CSINCERE over the state-of-the-art methods.

preprint2024arXiv

EPA: Neural Collapse Inspired Robust Out-of-Distribution Detector

Out-of-distribution (OOD) detection plays a crucial role in ensuring the security of neural networks. Existing works have leveraged the fact that In-distribution (ID) samples form a subspace in the feature space, achieving state-of-the-art (SOTA) performance. However, the comprehensive characteristics of the ID subspace still leave under-explored. Recently, the discovery of Neural Collapse ($\mathcal{NC}$) sheds light on novel properties of the ID subspace. Leveraging insight from $\mathcal{NC}$, we observe that the Principal Angle between the features and the ID feature subspace forms a superior representation for measuring the likelihood of OOD. Building upon this observation, we propose a novel $\mathcal{NC}$-inspired OOD scoring function, named Entropy-enhanced Principal Angle (EPA), which integrates both the global characteristic of the ID subspace and its inner property. We experimentally compare EPA with various SOTA approaches, validating its superior performance and robustness across different network architectures and OOD datasets.

preprint2024arXiv

Generalized Lagrangian Neural Networks

Incorporating neural networks for the solution of Ordinary Differential Equations (ODEs) represents a pivotal research direction within computational mathematics. Within neural network architectures, the integration of the intrinsic structure of ODEs offers advantages such as enhanced predictive capabilities and reduced data utilization. Among these structural ODE forms, the Lagrangian representation stands out due to its significant physical underpinnings. Building upon this framework, Bhattoo introduced the concept of Lagrangian Neural Networks (LNNs). Then in this article, we introduce a groundbreaking extension (Genralized Lagrangian Neural Networks) to Lagrangian Neural Networks (LNNs), innovatively tailoring them for non-conservative systems. By leveraging the foundational importance of the Lagrangian within Lagrange's equations, we formulate the model based on the generalized Lagrange's equation. This modification not only enhances prediction accuracy but also guarantees Lagrangian representation in non-conservative systems. Furthermore, we perform various experiments, encompassing 1-dimensional and 2-dimensional examples, along with an examination of the impact of network parameters, which proved the superiority of Generalized Lagrangian Neural Networks(GLNNs).

preprint2024arXiv

Investigation of the $ΔI = 1/2$ rule and test of CP violation through the measurement of decay asymmetry parameters in $Ξ^-$ decays

Using $(10087\pm44)\times 10^{6}$ $J/ψ$ events collected with the BESIII detector, numerous $Ξ^-$ and $Λ$ decay asymmetry parameters are simultaneously determined from the process $J/ψ\to Ξ^- \barΞ^+ \to Λ(pπ^-) π^- \barΛ(\bar{n} π^0) π^+$ and its charge-conjugate channel. The precisions of $α_0$ for $Λ\to nπ^0$ and $\barα_0$ for $\barΛ \to \bar{n}π^0$ compared to world averages are improved by factors of 4 and 1.7, respectively. The ratio of decay asymmetry parameters of $Λ\to nπ^0$ to that of $Λ\to pπ^-$, $\langle α_0 \rangle/ \langle α_{Λ-} \rangle $, is determined to be $ 0.873 \pm 0.012^{+0.011}_{-0.010}$, where the first and the second uncertainties are statistical and systematic, respectively. The ratio is smaller than unity more than $5σ$, which signifies the existence of the $ΔI = 3/2$ transition in $Λ$ for the first time. Beside, we test for CP violation in $Ξ^- \to Λπ^-$ and in $Λ\to n π^{0}$ with the best precision to date.

preprint2023arXiv

Deep Dynamic Scene Deblurring from Optical Flow

Deblurring can not only provide visually more pleasant pictures and make photography more convenient, but also can improve the performance of objection detection as well as tracking. However, removing dynamic scene blur from images is a non-trivial task as it is difficult to model the non-uniform blur mathematically. Several methods first use single or multiple images to estimate optical flow (which is treated as an approximation of blur kernels) and then adopt non-blind deblurring algorithms to reconstruct the sharp images. However, these methods cannot be trained in an end-to-end manner and are usually computationally expensive. In this paper, we explore optical flow to remove dynamic scene blur by using the multi-scale spatially variant recurrent neural network (RNN). We utilize FlowNets to estimate optical flow from two consecutive images in different scales. The estimated optical flow provides the RNN weights in different scales so that the weights can better help RNNs to remove blur in the feature spaces. Finally, we develop a convolutional neural network (CNN) to restore the sharp images from the deblurred features. Both quantitative and qualitative evaluations on the benchmark datasets demonstrate that the proposed method performs favorably against state-of-the-art algorithms in terms of accuracy, speed, and model size.

preprint2023arXiv

Search for hidden-charm tetraquark with strangeness in $e^{+}e^{-}\rightarrow K^+ D_{s}^{-} D^{0}+c.c.$

We report a search for a heavier partner of the recently observed $Z_{cs}(3985)^{-}$ state, denoted as $Z_{cs}^{\prime -}$, in the process $e^{+} e^{-}\rightarrow K^{+}D_{s}^{*-}D^{* 0}+c.c.$, based on $e^+e^-$ collision data collected at the center-of-mass energies of $\sqrt{s}=4.661$, 4.682 and 4.699 GeV with the BESIII detector. The $Z_{cs}^{\prime -}$ is of interest as it is expected to be a candidate for a hidden-charm and open-strange tetraquark. A partial-reconstruction technique is used to isolate $K^+$ recoil-mass spectra, which are probed for a potential contribution from $Z_{cs}^{\prime -}\to D_{s}^{*-}D^{* 0}$ ($c.c.$). We find an excess of $Z_{cs}^{\prime -}\rightarrow D_{s}^{*-}D^{*0}$ ($c.c.$) candidates with a significance of $2.1σ$, after considering systematic uncertainties, at a mass of $(4123.5\pm0.7_\mathrm{stat.}\pm4.7_\mathrm{syst.})\ \mathrm{MeV}/c^{2}$. As the data set is limited in size, the upper limits are evaluated at the 90\% confidence level on the product of the Born cross sections ($σ^{\mathrm{Born}}$) and the branching fraction ($\mathcal{B}$) of $Z_{cs}^{\prime-}\rightarrow D_{s}^{*-}D^{* 0}$, under different assumptions of the $Z_{cs}^{\prime -}$ mass from 4.120 to 4.140 MeV and of the width from 10 to 50 MeV at the three center-of-mass energies. The upper limits of $σ^{\rm Born}\cdot\mathcal{B}$ are found to be at the level of $\mathcal{O}(1)$ pb at each energy. Larger data samples are needed to confirm the $Z_{cs}^{\prime -}$ state and clarify its nature in the coming years.

preprint2023arXiv

TI-CNN: Convolutional Neural Networks for Fake News Detection

With the development of social networks, fake news for various commercial and political purposes has been appearing in large numbers and gotten widespread in the online world. With deceptive words, people can get infected by the fake news very easily and will share them without any fact-checking. For instance, during the 2016 US president election, various kinds of fake news about the candidates widely spread through both official news media and the online social networks. These fake news is usually released to either smear the opponents or support the candidate on their side. The erroneous information in the fake news is usually written to motivate the voters' irrational emotion and enthusiasm. Such kinds of fake news sometimes can bring about devastating effects, and an important goal in improving the credibility of online social networks is to identify the fake news timely. In this paper, we propose to study the fake news detection problem. Automatic fake news identification is extremely hard, since pure model based fact-checking for news is still an open problem, and few existing models can be applied to solve the problem. With a thorough investigation of a fake news data, lots of useful explicit features are identified from both the text words and images used in the fake news. Besides the explicit features, there also exist some hidden patterns in the words and images used in fake news, which can be captured with a set of latent features extracted via the multiple convolutional layers in our model. A model named as TI-CNN (Text and Image information based Convolutinal Neural Network) is proposed in this paper. By projecting the explicit and latent features into a unified feature space, TI-CNN is trained with both the text and image information simultaneously. Extensive experiments carried on the real-world fake news datasets have demonstrate the effectiveness of TI-CNN.

preprint2022arXiv

A Comprehensive Survey with Quantitative Comparison of Image Analysis Methods for Microorganism Biovolume Measurements

With the acceleration of urbanization and living standards, microorganisms play increasingly important roles in industrial production, bio-technique, and food safety testing. Microorganism biovolume measurements are one of the essential parts of microbial analysis. However, traditional manual measurement methods are time-consuming and challenging to measure the characteristics precisely. With the development of digital image processing techniques, the characteristics of the microbial population can be detected and quantified. The changing trend can be adjusted in time and provided a basis for the improvement. The applications of the microorganism biovolume measurement method have developed since the 1980s. More than 62 articles are reviewed in this study, and the articles are grouped by digital image segmentation methods with periods. This study has high research significance and application value, which can be referred to microbial researchers to have a comprehensive understanding of microorganism biovolume measurements using digital image analysis methods and potential applications.

preprint2022arXiv

A State-of-the-art Survey of Object Detection Techniques in Microorganism Image Analysis: From Classical Methods to Deep Learning Approaches

Microorganisms play a vital role in human life. Therefore, microorganism detection is of great significance to human beings. However, the traditional manual microscopic detection methods have the disadvantages of long detection cycle, low detection accuracy in large orders, and great difficulty in detecting uncommon microorganisms. Therefore, it is meaningful to apply computer image analysis technology to the field of microorganism detection. Computer image analysis can realize high-precision and high-efficiency detection of microorganisms. In this review, first,we analyse the existing microorganism detection methods in chronological order, from traditional image processing and traditional machine learning to deep learning methods. Then, we analyze and summarize these existing methods and introduce some potential methods, including visual transformers. In the end, the future development direction and challenges of microorganism detection are discussed. In general, we have summarized 142 related technical papers from 1985 to the present. This review will help researchers have a more comprehensive understanding of the development process, research status, and future trends in the field of microorganism detection and provide a reference for researchers in other fields.

preprint2022arXiv

Amplitude analysis and branching fraction measurement of the decay $D_{s}^{+} \to K^+π^+π^-$

Using $6.32$ fb$^{-1}$ of $e^{+}e^{-}$ collision data collected at the center-of-mass energies between 4.178 and 4.226 GeV with the BESIII detector, we perform an amplitude analysis of the decay $D^+_s \to K^+π^+π^-$ and determine the amplitudes of the various intermediate states. The absolute branching fraction of $D^+_s\to K^+π^+π^-$ is measured to be ($6.11\pm0.18_{\rm stat.}\pm0.11_{\rm syst.})\times 10^{-3}$. The branching fractions of the dominant intermediate processes $D_{s}^{+} \to K^+ρ^0, ρ^0 \to π^+π^-$ and $D_{s}^{+} \to K^*(892)^0π^+, K^*(892)^0 \to K^+π^-$ are determined to be $(1.96\pm0.19_{\rm stat.}\pm0.23_{\rm syst.})\times 10^{-3}$ and $(1.85\pm0.12_{\rm stat.}\pm0.13_{\rm syst.})\times 10^{-3}$, respectively. The intermediate resonances $f_0(500)$, $f_0(980)$, and $f_0(1370)$ are observed for the first time in this channel.

preprint2022arXiv

Amplitude analysis and branching-fraction measurement of $D_{s}^{+} \to π^{+}π^{0}η^{\prime}$

Using data collected with the BESIII detector in $e^+e^-$ collisions at center-of-mass energies between 4.178 and 4.226 GeV and corresponding to 6.32~fb$^{-1}$ of integrated luminosity, we report the amplitude analysis and branching-fraction measurement of the $D^+_s \to π^+ π^0 η^{\prime}$ decay. We find that the dominant intermediate process is $D^+_s \toρ^+ η^{\prime}$ and the significances of other resonant and nonresonant processes are all less than $3σ$. The upper limits on the branching fractions of $S$-wave and $P$-wave nonresonant components are set to $0.10\%$ and $0.74\%$ at the $90\%$ confidence level, respectively. In addition, the branching fraction of the $D^+_s \to π^+ π^0 η^{\prime}$ decay is measured to be $(6.15\pm0.25(\rm stat.)\pm0.18(\rm syst.))\%$, which receives significant contribution only from $D_s^+\to ρ^+η^{\prime}$ according to the amplitude analysis.

preprint2022arXiv

An application of Pixel Interval Down-sampling (PID) for dense tiny microorganism counting on environmental microorganism images

This paper proposes a novel pixel interval down-sampling network (PID-Net) for dense tiny object (yeast cells) counting tasks with higher accuracy. The PID-Net is an end-to-end convolutional neural network (CNN) model with an encoder--decoder architecture. The pixel interval down-sampling operations are concatenated with max-pooling operations to combine the sparse and dense features. This addresses the limitation of contour conglutination of dense objects while counting. The evaluation was conducted using classical segmentation metrics (the Dice, Jaccard and Hausdorff distance) as well as counting metrics. The experimental results show that the proposed PID-Net had the best performance and potential for dense tiny object counting tasks, which achieved 96.97\% counting accuracy on the dataset with 2448 yeast cell images. By comparing with the state-of-the-art approaches, such as Attention U-Net, Swin U-Net and Trans U-Net, the proposed PID-Net can segment dense tiny objects with clearer boundaries and fewer incorrect debris, which shows the great potential of PID-Net in the task of accurate counting.

preprint2022arXiv

Applications of Artificial Neural Networks in Microorganism Image Analysis: A Comprehensive Review from Conventional Multilayer Perceptron to Popular Convolutional Neural Network and Potential Visual Transformer

Microorganisms are widely distributed in the human daily living environment. They play an essential role in environmental pollution control, disease prevention and treatment, and food and drug production. The analysis of microorganisms is essential for making full use of different microorganisms. The conventional analysis methods are laborious and time-consuming. Therefore, the automatic image analysis based on artificial neural networks is introduced to optimize it. However, the automatic microorganism image analysis faces many challenges, such as the requirement of a robust algorithm caused by various application occasions, insignificant features and easy under-segmentation caused by the image characteristic, and various analysis tasks. Therefore, we conduct this review to comprehensively discuss the characteristics of microorganism image analysis based on artificial neural networks. In this review, the background and motivation are introduced first. Then, the development of artificial neural networks and representative networks are presented. After that, the papers related to microorganism image analysis based on classical and deep neural networks are reviewed from the perspectives of different tasks. In the end, the methodology analysis and potential direction are discussed.

preprint2022arXiv

CARE: Certifiably Robust Learning with Reasoning via Variational Inference

Despite great recent advances achieved by deep neural networks (DNNs), they are often vulnerable to adversarial attacks. Intensive research efforts have been made to improve the robustness of DNNs; however, most empirical defenses can be adaptively attacked again, and the theoretically certified robustness is limited, especially on large-scale datasets. One potential root cause of such vulnerabilities for DNNs is that although they have demonstrated powerful expressiveness, they lack the reasoning ability to make robust and reliable predictions. In this paper, we aim to integrate domain knowledge to enable robust learning with the reasoning paradigm. In particular, we propose a certifiably robust learning with reasoning pipeline (CARE), which consists of a learning component and a reasoning component. Concretely, we use a set of standard DNNs to serve as the learning component to make semantic predictions, and we leverage the probabilistic graphical models, such as Markov logic networks (MLN), to serve as the reasoning component to enable knowledge/logic reasoning. However, it is known that the exact inference of MLN (reasoning) is #P-complete, which limits the scalability of the pipeline. To this end, we propose to approximate the MLN inference via variational inference based on an efficient expectation maximization algorithm. In particular, we leverage graph convolutional networks (GCNs) to encode the posterior distribution during variational inference and update the parameters of GCNs (E-step) and the weights of knowledge rules in MLN (M-step) iteratively. We conduct extensive experiments on different datasets and show that CARE achieves significantly higher certified robustness compared with the state-of-the-art baselines. We additionally conducted different ablation studies to demonstrate the empirical robustness of CARE and the effectiveness of different knowledge integration.

preprint2022arXiv

Cross section measurements of the processes $e^+e^- \rightarrow ωπ^{0}$ and $ωη$ at center-of-mass energies between 3.773 and 4.701 GeV

The Born cross sections of the processes $e^+e^- \rightarrow ωπ^{0}$ and $e^+e^- \rightarrow ωη$ are measured at center-of-mass energies between 3.773 and 4.701 GeV using a total integrated luminosity of 22.7 fb$^{-1}$ collected with the BESIII detector operating at the BEPCII collider. A simple $s^{-n}$ dependence for the continuum process can describe the measured Born cross sections. No significant contributions from the $ψ(4160)$, $Y(4230)$, $Y(4360)$, $ψ(4415)$, $Y(4660)$ resonances are found, which indicates relative small branching fractions for these resonances into the $ωπ^{0}$ and $ωη$ final states.

preprint2022arXiv

Decentralized Non-Convex Learning with Linearly Coupled Constraints

Motivated by the need for decentralized learning, this paper aims at designing a distributed algorithm for solving nonconvex problems with general linear constraints over a multi-agent network. In the considered problem, each agent owns some local information and a local variable for jointly minimizing a cost function, but local variables are coupled by linear constraints. Most of the existing methods for such problems are only applicable for convex problems or problems with specific linear constraints. There still lacks a distributed algorithm for such problems with general linear constraints and under nonconvex setting. In this paper, to tackle this problem, we propose a new algorithm, called "proximal dual consensus" (PDC) algorithm, which combines a proximal technique and a dual consensus method. We build the theoretical convergence conditions and show that the proposed PDC algorithm can converge to an $ε$-Karush-Kuhn-Tucker solution within $\mathcal{O}(1/ε)$ iterations. For computation reduction, the PDC algorithm can choose to perform cheap gradient descent per iteration while preserving the same order of $\mathcal{O}(1/ε)$ iteration complexity. Numerical results are presented to demonstrate the good performance of the proposed algorithms for solving a regression problem and a classification problem over a network where agents have only partial observations of data features.

preprint2022arXiv

First Observation of the Semileptonic Decay $Λ_c^+\rightarrow pK^- e^+ν_e$

Using $4.5~\mathrm{fb}^{-1}$ of $e^+e^-$ annihilation data samples collected at the center-of-mass energies ranging from 4.600~GeV to 4.699~GeV with the BESIII detector at the BEPCII collider, a first study of the semileptonic decays $Λ_c^+\rightarrow pK^-e^+ν_e$, $Λ_c^+\rightarrow Λ(1520) e^+ν_e$ and $Λ_c^+\rightarrow Λ(1405) e^+ν_e$ is performed. The $Λ_c^+\rightarrow pK^-e^+ν_e$ decay is observed with a significance of $8.2σ$ and the branching fraction is measured to be $\mathcal{B}(Λ_c^+\rightarrow pK^- e^+ν_e)=(0.88\pm0.17_{\rm stat.}\pm0.07_{\rm syst.})\times 10^{-3}$. We also report evidence of $Λ_c^+\rightarrow Λ(1520)e^+ν_e$ and $Λ_c^+\rightarrow Λ(1405)e^+ν_e$ with significances of $3.3σ$ and $3.2σ$, respectively, and measure $\mathcal B(Λ^+_c\rightarrow Λ(1520)e^+ν_e)=(1.02\pm0.52_{\rm stat.}\pm0.11_{\rm syst.})\times10^{-3}$ and $\mathcal B(Λ^+_c\rightarrow Λ(1405)[\rightarrow pK^-]e^+ν_e)=(0.42\pm0.19_{\rm stat.}\pm0.04_{\rm syst.})\times10^{-3}$. Combining these with the inclusive semileptonic $Λ_c^+$ branching fraction measured by BESIII, the relative fraction is determined to be $[\mathcal{B}(Λ_c^+\rightarrow pK^-e^+ν_e)/\mathcal{B}(Λ_c^+\rightarrow X e^+ν_e)]=(2.1\pm0.4_{\rm stat.}\pm0.2_{\rm syst.})\%$, which provides a clear confirmation that semileptonic $Λ_c^+$ decays are not saturated by the $Λ\ell^+ν_{\ell}$ final state.

preprint2022arXiv

Is a Classification Procedure Good Enough? A Goodness-of-Fit Assessment Tool for Classification Learning

In recent years, many non-traditional classification methods, such as Random Forest, Boosting, and neural network, have been widely used in applications. Their performance is typically measured in terms of classification accuracy. While the classification error rate and the like are important, they do not address a fundamental question: Is the classification method underfitted? To our best knowledge, there is no existing method that can assess the goodness-of-fit of a general classification procedure. Indeed, the lack of a parametric assumption makes it challenging to construct proper tests. To overcome this difficulty, we propose a methodology called BAGofT that splits the data into a training set and a validation set. First, the classification procedure to assess is applied to the training set, which is also used to adaptively find a data grouping that reveals the most severe regions of underfitting. Then, based on this grouping, we calculate a test statistic by comparing the estimated success probabilities and the actual observed responses from the validation set. The data splitting guarantees that the size of the test is controlled under the null hypothesis, and the power of the test goes to one as the sample size increases under the alternative hypothesis. For testing parametric classification models, the BAGofT has a broader scope than the existing methods since it is not restricted to specific parametric models (e.g., logistic regression). Extensive simulation studies show the utility of the BAGofT when assessing general classification procedures and its strengths over some existing methods when testing parametric classification models.

preprint2022arXiv

Iso-CapsNet: Isomorphic Capsule Network for Brain Graph Representation Learning

Brain graph representation learning serves as the fundamental technique for brain diseases diagnosis. Great efforts from both the academic and industrial communities have been devoted to brain graph representation learning in recent years. The isomorphic neural network (IsoNN) introduced recently can automatically learn the existence of sub-graph patterns in brain graphs, which is also the state-of-the-art brain graph representation learning method by this context so far. However, IsoNN fails to capture the orientations of sub-graph patterns, which may render the learned representations to be useless for many cases. In this paper, we propose a new Iso-CapsNet (Isomorphic Capsule Net) model by introducing the graph isomorphic capsules for effective brain graph representation learning. Based on the capsule dynamic routing, besides the subgraph pattern existence confidence scores, Iso-CapsNet can also learn other sub-graph rich properties, including position, size and orientation, for calculating the class-wise digit capsules. We have compared Iso-CapsNet with both classic and state-of-the-art brain graph representation approaches with extensive experiments on four brain graph benchmark datasets. The experimental results also demonstrate the effectiveness of Iso-CapsNet, which can out-perform the baseline methods with significant improvements.

preprint2022arXiv

Measurement of $e^{+}e^{-} \to K^{+}K^{-}π^{0}$ cross section and observation of a resonant structure

Based on $e^{+}e^{-}$ collision data collected by the BESIII detector at the BEPCII collider at center-of-mass energies from 2.000 to 3.080 GeV, a partial-wave analysis is performed for the process $e^{+}e^{-} \to K^{+}K^{-}π^{0}$. The Born cross section of the process $e^{+}e^{-} \to K^{+}K^{-}π^{0}$ and its subprocesses $e^{+}e^{-} \to ϕπ^{0}$, $K^{*}(892)K$ and $K^{*}_{2}(1430)K$ are measured. The results for $e^{+}e^{-} \to K^{+}K^{-}π^{0}$ and $ϕπ^{0}$ are consistent with the BaBar measurements and with improved precision. By analyzing the cross section, of the subprocesses $e^{+}e^{-} \to$ $K^{*}(892)K$ and $K^{*}_{2}(1430)K$, a structure with mass $M_R$ = (2208 $\pm$ 19 $\pm$ 24) MeV/$c^{2}$ and width $Γ_R$ = (168 $\pm$ 24 $\pm$ 39) MeV is observed with a combined statistical significance of 7.6$σ$. The measured resonance parameters suggest it can be identified as the $ϕ(2170)$, thus the results provide valuable input to understand the internal nature of this state.

preprint2022arXiv

Measurement of $Λ$ baryon polarization in $e^+e^-\rightarrowΛ\barΛ$ at $\sqrt{s} = 3.773$ GeV

Using a data sample of $ψ(3770)$ events collected with the BESIII detector at BEPCII corresponding to an integrated luminosity of 2.9 fb$^{-1}$, we report a measurement of $Λ$ spin polarization in $e^+e^-\rightarrowΛ\barΛ$ at $\sqrt{s} = 3.773$ GeV. The significance of polarization is found to be 2$σ$ including the systematic uncertainty, which implies a zero phase between the transition amplitudes of the $Λ\barΛ$ helicity states. This phase can be interpreted in terms of psionic form factors, and is determined to be $ΔΦ^Ψ$ = $Φ^Ψ_{E} - Φ^Ψ_{M}$ = $(71^{+66}_{-46}$ $\pm$ 5)$^{\circ}$. Similarly, the ratio between the form factors is found to be $R^ψ$ = $|G^Ψ_{E}/G^Ψ_{M}|$ = $0.48^{+0.12}_{-0.07}$ $\pm$ 0.04. The first uncertainties are statistical and the second systematic.

preprint2022arXiv

Measurement of the $D \to K^-π^+π^+π^-$ and $D \to K^-π^+π^0$ coherence factors and average strong-phase differences in quantum-correlated ${D\bar{D}}$ decays

The decays $D\to K^-π^+π^+π^-$ and $D \to K^-π^+π^0$ are studied in a sample of quantum-correlated $D\bar{D}$ pairs produced through the process $e^+e^- \to ψ(3770) \to D\bar{D}$, exploiting a data set collected by the BESIII experiment that corresponds to an integrated luminosity of 2.93 fb$^{-1}$. Here $D$ indicates a quantum superposition of a $D^0$ and a $\bar{D}^0$ meson. By reconstructing one neutral charm meson in a signal decay, and the other in the same or a different final state, observables are measured that contain information on the coherence factors and average strong-phase differences of each of the signal modes. These parameters are critical inputs in the measurement of the angle $γ$ of the Unitarity Triangle in $B^- \to DK^-$ decays at the LHCb and Belle II experiments. The coherence factors are determined to be $R_{K3π}=0.52^{+0.12}_{-0.10}$ and $R_{Kππ^0}=0.78 \pm 0.04$, with values for the average strong-phase differences that are $δ_D^{K3π}=\left(167^{+31}_{-19}\right)^\circ$ and $δ_D^{Kππ^0}=\left(196^{+14}_{-15}\right)^\circ$, where the uncertainties include both statistical and systematic contributions. The analysis is re-performed in four bins of the phase-space of the $D \to K^-π^+π^+π^-$ to yield results that will allow for a more sensitive measurement of $γ$ with this mode, to which the BESIII inputs will contribute an uncertainty of around 6$^\circ$.

preprint2022arXiv

Measurement of the branching fraction and decay asymmetry of $Λ\to nγ$

The radiative hyperon decay $Λ\to nγ$ is studied using $(10087\pm44)\times 10^6$ $J/ψ$ events collected with the BESIII detector operating at BEPCII. The absolute branching fraction of the decay $Λ\to nγ$ is determined with a significance of 5.6$σ$ to be $[0.832\pm0.038(\rm stat.)\pm0.054(\rm syst.)]\times10^{-3}$, which lies significantly below the current PDG value. By analyzing the joint angular distribution of the decay products, the first determination of the decay asymmetry $α_γ$ is reported with a value of $-0.16\pm0.10(\rm stat.)\pm0.05(\rm syst.)$.

preprint2022arXiv

Measurement of the branching fraction for $ψ(3686)\to ωK^0_SK^0_S$

Analyzing $(448.1\pm2.9)\times10^6$ $ψ(3686)$ events collected with the BESIII detector at the BEPCII collider, the $ψ(3686)\to ωK_{S}^{0}K_{S}^{0}$ decay is observed for the first time. The branching fraction for this decay is determined to be $\mathcal{B}_{ψ(3686)\to ωK_{S}^{0}K^{0}_{S}}$=$(7.04\pm0.39\pm0.36)$$\times10^{-5}$, where the first uncertainty is statistical and the second is systematic.

preprint2022arXiv

Measurement of the branching fraction of the doubly Cabibbo-suppressed decay $D^0\to K^+π^-π^0$ and search for $D^0\to K^+π^-π^0π^0$

Using $2.93\,\rm fb^{-1}$ of $e^+e^-$ collision data collected at a center-of-mass energy of 3.773\,GeV with the BESIII detector, we present a measurement of the branching fraction of the doubly Cabibbo-suppressed (DCS) decay $D^0\to K^+π^-π^0$ and a search for the DCS decay $D^0\to K^+π^-π^0π^0$. The branching fraction of $D^0\to K^+π^-π^0$ is determined to be $[3.13^{+0.60}_{-0.56}({\rm stat}) \pm 0.09({\rm syst})] \times 10^{-4}$. No signal is observed for $D^0\to K^+π^-π^0π^0$ and an upper limit of $3.6 \times 10^{-4}$ is set on the branching fraction at the 90\% C.L. We combine these results with the world-average branching fractions of their counterpart Cabibbo-favored decays to determine the ratios of the doubly Cabibbo-suppressed over the Cabibbo-favored branching fractions, ${\mathcal B}(D^0\to K^+π^-π^0)/{\mathcal B}(D^0\to K^-π^+π^0)=(0.22\pm 0.04)\%$~and ${\mathcal B}(D^0\to K^+π^-π^0π^0)/{\mathcal B}(D^0\to K^-π^+π^0π^0)<0.40\%$ at the 90\% C.L., which correspond to $(0.75\pm 0.14)\tan^{4} θ_C$~and $1.37\times \tan^{4} θ_C$, respectively, where $θ_C$ is the Cabibbo angle.

preprint2022arXiv

Measurement of the Cross Section for $e^{+}e^{-}\to$ hadrons at Energies from 2.2324 to 3.6710 GeV

Based on electron-positron collision data collected with the BESIII detector operating at the Beijing Electron Positron Collider II storage rings, the value of $R\equivσ(e^{+}e^{-}\to$hadrons)/$σ(e^{+}e^{-}\toμ^{+}μ^{-})$ is measured at 14 center-of-mass energies from 2.2324 to 3.6710 GeV. The resulting uncertainties are less than $3.0\%$, and are dominated by systematic uncertainties.

preprint2022arXiv

Measurement of the cross section of $e^{+}e^{-}\toηπ^{+}π^{-}$ at center-of-mass energies from 3.872 GeV to 4.700 GeV

Using data samples with an integrated luminosity of 19 fb$^{-1}$ at twenty-eight center-of-mass energies from 3.872 GeV to 4.700 GeV collected with the BESIII detector at the BEPCII electron--positron collider, the process $e^{+}e^{-}\toηπ^{+}π^{-}$ and the intermediate process $e^{+}e^{-}\toηρ^{0}$ are studied for the first time. The Born cross sections are measured. No significant resonance structure is observed in the cross section lineshape.

preprint2022arXiv

Measurement of the total and leptonic decay widths of the $J/ψ$ resonance with an energy scan method at BESIII

Using $e^+e^-$ annihilation data sets collected with the BESIII detector, we measure the cross sections of the processes $e^+e^- \to e^+e^-$ and $e^+e^- \to μ^+μ^-$ at fifteen center-of-mass energy points in the vicinity of the $J/ψ$ resonance. By a simultaneous fit to the measured, center-of-mass energy dependent cross sections of the two processes, the combined quantities $Γ_{ee} Γ_{ee} / Γ_{\rm tot}$ and $Γ_{ee} Γ_{μμ} / Γ_{\rm tot}$ are determined to be ($0.346 \pm 0.009$) and ($0.335 \pm 0.006$) keV, respectively, where $Γ_{ee}$, $Γ_{μμ}$, and $Γ_{\rm tot}$ are the electronic, muonic, and total decay widths of the $J/ψ$ resonance, respectively. Using the resultant $Γ_{ee} Γ_{μμ} / Γ_{\rm tot}$ and $Γ_{ee} Γ_{ee} / Γ_{\rm tot}$, the ratio $Γ_{ee} / Γ_{μμ}$ is calculated to be $1.031 \pm 0.015$, which is consistent with the expectation of lepton universality within about two standard deviations. Assuming lepton universality and using the branching fraction of the $J/ψ$ leptonic decay measured by BESIII in 2013, $Γ_{\rm tot}$ and $Γ_{ll}$ are determined to be ($93.0 \pm 2.1$) and ($5.56 \pm 0.11$) keV, respectively, where $Γ_{ll}$ is the average leptonic decay width of the $J/ψ$ resonance.

preprint2022arXiv

Measurements of Absolute Branching Fractions of $D^0\to K_L^0ϕ$, $K_L^0η$, $K_L^0ω$, and $K_L^0η^{\prime}$

We report the first measurements of the absolute branching fractions of $D^0\to K_L^0ϕ$, $D^0\to K_L^0η$, $D^0\to K_L^0ω$, and $D^0\to K_L^0η^{\prime}$, obtained by analyzing $2.93\,\rm fb^{-1}$ of $e^+e^-$ collision data taken at a center-of-mass energy of 3.773 GeV with the BESIII detector. Taking the world averages of the branching fractions of $D^0\to K_S^0ϕ$, $D^0\to K_S^0η$, $D^0\to K_S^0ω$, and $D^0\to K_S^0η^{\prime}$, the $K_S^0$-$K_L^0$ asymmetry $\mathcal{R}(D^0)$ in these decay modes are obtained. The CP asymmetries in these decays are also determined. No significant $CP$ violation is observed.

preprint2022arXiv

Measurements of the absolute branching fractions of hadronic $D$-meson decays involving kaons and pions

By analyzing an electron-positron collision data sample corresponding to an integrated luminosity of $2.93\,\rm fb^{-1}$ taken at the center-of-mass energy of 3.773 GeV with the BESIII detector, we obtain for the first time the absolute branching fractions for seven $D^0$ and $D^+$ hadronic decay modes and search for the hadronic decay $D^0\to K^0_S K^0_Sπ^0$ with much improved sensitivity. The results are ${\mathcal B}(D^0\to K^0_Sπ^0π^0π^0 )=( 7.64\pm 0.30\pm 0.29)\times 10^{-3}$, ${\mathcal B}(D^0\to K^-π^+π^0π^0π^0 )=( 9.54\pm 0.30\pm 0.31)\times 10^{-3}$, ${\mathcal B}(D^0\to K^0_Sπ^+π^-π^0π^0)=(12.66\pm 0.45\pm 0.43)\times 10^{-3}$, ${\mathcal B}(D^+\to K^0_Sπ^+π^0π^0 )=(29.04\pm 0.62\pm 0.87)\times 10^{-3}$, ${\mathcal B}(D^+\to K^0_Sπ^+π^+π^-π^0)=(15.28\pm 0.57\pm 0.60)\times 10^{-3}$, ${\mathcal B}(D^+\to K^0_Sπ^+π^0π^0π^0)=( 5.54\pm 0.44\pm 0.32)\times 10^{-3}$, ${\mathcal B}(D^+\to K^-π^+π^+π^0π^0 )=( 4.95\pm 0.26\pm 0.19)\times 10^{-3}$, ${\mathcal B}({D^0\to K^0_S K^0_Sπ^0}) < 1.57 \times 10^{-4}$ at the 90\% confidence level. Here the first uncertainties are statistical and the second ones systematic. The newly studied decays greatly enrich the knowledge of the $D\to \bar Kπππ$ and $D\to \bar Kππππ$ hadronic decays, and open a bridge to access more two-body hadronic $D$ decays containing scalar, vector, axial and tensor mesons in the charm sector.

preprint2022arXiv

Observation of $a_0(1710)^+ \to K_S^0K^+$ in study of the $D_s^+\to K_S^0K^+π^0$ decay

Using $e^+e^-$ annihilation data corresponding to an integrated luminosity of 6.32 fb$^{-1}$ collected at center-of-mass energies between 4.178 GeV and 4.226 GeV with the BESIII detector, we perform the first amplitude analysis of the decay $D_s^+\to K_S^0K^+π^0$ and determine the relative branching fractions and phases for intermediate processes. We observe the $a_0(1710)^+$, the isovector partner of the $f_0(1710)$ and $f_0(1770)$ mesons, in its decay to $K_S^0K^+$ for the first time. In addition, we measure the ratio $\frac{\mathcal{B}(D_{s}^{+} \to \bar{K}^{*}(892)^{0}K^{+})}{\mathcal{B}(D_{s}^{+} \to \bar{K}^{0}K^{*}(892)^{+})}$ to be $2.35^{+0.42}_{-0.23\text{stat.}}\pm 0.10_{\rm syst.}$. Finally, we provide a precision measurement of the absolute branching fraction $\mathcal{B}(D_s^+\to K_S^0K^+π^0) = (1.46\pm 0.06_{\text{stat.}}\pm 0.05_{\text{syst.}})\%$.

preprint2022arXiv

Observation of $η_c(2S) \to 3(π^+π^-)$ and measurements of $χ_{cJ} \to 3(π^+π^-)$ in $ψ(3686)$ radiative transitions

The hadronic decay $η_c(2S) \to 3(π^+π^-)$ is observed with a statistical significance of 9.3 standard deviations using $(448.1\pm2.9)\times10^6$ $ψ(3686)$ events collected by the BESIII detector at the BEPCII collider. The measured mass and width of $η_c(2S)$ are $(3643.4 \pm 2.3 (\rm stat.) \pm 4.4 (\rm syst.))$ MeV/$c^2$ and $(19.8 \pm 3.9 (\rm stat.) \pm 3.1 (\rm syst.))$ MeV, respectively, which are consistent with the world average values within two standard deviations. The product branching fraction $\mathcal{B}[ψ(3686)\to γη_c(2S)]\times\mathcal{B}[η_c(2S)\to3(π^+π^-)]$ is measured to be $(9.2 \pm 1.0 (\rm stat.) \pm 0.9 (\rm syst.))\times10^{-6}$. Using $\mathcal{B}[ψ(3686)\to γη_c(2S)]=(7.0^{+3.4}_{-2.5})\times10^{-4}$, we obtain $\mathcal{B}[η_c(2S) \to 3(π^+π^-)] = (1.31 \pm 0.15 (\rm stat.) \pm 0.13 (\rm syst.)(^{+0.64}_{-0.47}) (\rm extr))\times10^{-2}$, where the third uncertainty is from $\mathcal{B}[ψ(3686) \to γη_c(2S)]$. We also measure the $χ_{cJ} \to 3(π^+π^-)$ ($J=0, 1, 2$) decays via $ψ(3686) \to γχ_{cJ}$ transitions. The branching fractions are $\mathcal{B}[χ_{c0} \to 3(π^+π^-)] = (2.080\pm0.006 (\rm stat.)\pm0.068 (\rm syst.))\times10^{-2}$, $\mathcal{B}[χ_{c1} \to 3(π^+π^-)] = (1.092\pm0.004 (\rm stat.)\pm0.035 (\rm syst.))\times10^{-2}$, and $\mathcal{B}[χ_{c2} \to 3(π^+π^-)] = (1.565\pm0.005 (\rm stat.)\pm0.048 (\rm syst.))\times10^{-2}$.

preprint2022arXiv

Observation of resonance structures in $e^+e^-\to π^+π^-ψ_2(3823)$ and mass measurement of $ψ_2(3823)$

Using a data sample corresponding to an integrated luminosity of 11.3 $\rm fb^{-1}$ collected at center-of-mass energies from $4.23$ to $4.70$ GeV with the BESIII detector, we measure the product of the $e^+e^-\to π^+π^-ψ_2(3823)$ cross section and the branching fraction $\mathcal{B}[ψ_2(3823)\to γχ_{c1}]$. For the first time, resonance structure is observed in the cross section line shape of $e^+e^-\to π^+π^-ψ_2(3823)$ with significances exceeding $5σ$. A fit to data with two coherent Breit-Wigner resonances modeling the $\sqrt{s}$-dependent cross section yields $M(R_1)=4406.9\pm 17.2\pm 4.5$ MeV/$c^2$, $Γ(R_1)=128.1\pm 37.2\pm 2.3$ MeV, and $M(R_2)=4647.9\pm 8.6\pm 0.8$ MeV/$c^2$, $Γ(R_2)=33.1\pm 18.6\pm 4.1$ MeV. Though weakly disfavored by the data, a single resonance with $M(R)=4417.5\pm26.2\pm3.5$ MeV/$c^2$, $Γ(R)=245\pm48\pm13$ MeV is also possible to interpret data. This observation deepens our understanding of the nature of the vector charmoniumlike states. The mass of the $ψ_2(3823)$ state is measured as $(3823.12\pm 0.43\pm 0.13)$ MeV/$c^2$, which is the most precise measurement to date.

preprint2022arXiv

Observation of the double Dalitz decay $η'\to e^+e^-e^+e^-$

Based on $(10087 \pm 44)\times10^6$ $J/ψ$ events collected with the BESIII detector at BEPCII, the double Dalitz decay $η'\to e^+e^-e^+e^-$ is observed for the first time via the $J/ψ\toγη'$ decay process. The significance is found to be 5.7$σ$ with systematic uncertainties taken into consideration. Its branching fraction is determined to be $\mathcal{B}(η'\to e^+ e^- e^+ e^-) =(4.5\pm1.0(\mathrm{stat.})\pm0.5(\mathrm{sys.})) \times 10^{-6}$.

preprint2022arXiv

Observation of the electromagnetic Dalitz decay $D^{\ast 0}\to D^{0}e^{+}e^{-}$

Based on 3.19 fb$^{-1}$ of $e^+e^-$ collision data accumulated at the center-of-mass energy 4.178 GeV with the BESIII detector operating at the BEPCII collider, the electromagnetic Dalitz decay $D^{\ast 0}\to D^{0}e^{+}e^{-}$ is observed for the first time with a statistical significance of $13.2σ$. The ratio of the branching fraction of $D^{\ast 0}\to D^{0}e^{+}e^{-}$ to that of $D^{\ast 0}\to D^{0} γ$ is measured to be $(11.08\pm0.76\pm0.49)\times 10^{-3}$. By using the world average value of the branching fraction of $D^{\ast 0}\to D^{0} γ$, the branching fraction of $D^{\ast 0}\to D^{0}e^{+}e^{-}$ is determined to be $(3.91\pm0.27\pm0.17\pm0.10)\times 10^{-3}$, where the first uncertainty is statistical, the second systematic and the third external branching fractions.

preprint2022arXiv

Observation of the Singly Cabibbo-Suppressed Decay $Λ_{c}^{+} \to nπ^{+}$

The singly Cabibbo-suppressed decay $Λ_{c}^{+} \to nπ^{+}$ is observed for the first time with a statistical significance of $7.3σ$ by using 3.9 $\mathrm{fb}^{-1}$ of $e^{+}e^{-}$ collision data collected at center-of-mass energies between 4.612 and 4.699 GeV with the BESIII detector at BEPCII. The branching fraction of $Λ_{c}^{+} \to nπ^{+}$ is measured to be $(6.6\pm1.2_{\rm stat}\pm0.4_{\rm syst})\times 10^{-4}$. By taking the upper limit of branching fractions of $Λ_{c}^{+} \to pπ^0$ from the Belle experiment, the ratio of branching fractions between $Λ_{c}^{+} \to nπ^{+}$ and $Λ_{c}^{+} \to pπ^0$ is calculated to be larger than 7.2 at the 90% confidence level, which disagrees with the current predictions of available phenomenological models. In addition, the branching fractions of the Cabibbo-favored decays $Λ_{c}^{+} \to Λπ^{+}$ and $Λ_{c}^{+} \to Σ^{0}π^{+}$ are measured to be $(1.31\pm0.08_{\rm stat}\pm0.05_{\rm syst})\times 10^{-2}$ and $(1.22\pm0.08_{\rm stat}\pm0.07_{\rm syst})\times 10^{-2}$, respectively, which are consistent with previous results.

preprint2022arXiv

Partial wave analysis of $J/ψ\to γη^{\prime} η^{\prime}$

Using a sample of $(10.09~\pm~0.04)\times10^{9} ~J/ψ$ events collected with the BESIII detector, a partial wave analysis of $J/ψ\toγη^{\prime}η^{\prime}$ is performed. The masses and widths of the observed resonances and their branching fractions are reported. The main contribution is from $J/ψ\rightarrowγf_0(2020)$ with $f_0(2020)\rightarrowη^{\prime}η^{\prime}$, which is found with a significance of greater than 25$σ$. The product branching fraction ${\cal B}\left(J/ψ\rightarrowγf_0(2020)\right)\cdot{\cal B}\left(f_0(2020)\rightarrowη^{\prime}η^{\prime}\right)$ is measured to be $(2.63\pm0.06({\rm stat.})^{+0.31}_{-0.46}({\rm syst.}))\times10^{-4}$.

preprint2022arXiv

PERFECT: A Hyperbolic Embedding for Joint User and Community Alignment

Social network alignment shows fundamental importance in a wide spectrum of applications. To the best of our knowledge, existing studies mainly focus on network alignment at the individual user level, requiring abundant common information between shared individual users. For the networks that cannot meet such requirements, social community structures actually provide complementary and critical information at a slightly coarse-grained level, alignment of which will provide additional information for user alignment. In turn, user alignment also reveals more clues for community alignment. Hence, in this paper, we introduce the problem of joint social network alignment, which aims to align users and communities across social networks simultaneously. Key challenges lie in that 1) how to learn the representations of both users and communities, and 2) how to make user alignment and community alignment benefit from each other. To address these challenges, we first elaborate on the characteristics of real-world networks with the notion of delta-hyperbolicity, and show the superiority of hyperbolic space for representing social networks. Then, we present a novel hyperbolic embedding approach for the joint social network alignment, referred to as PERFECT, in a unified optimization. Extensive experiments on real-world datasets show the superiority of PERFECT in both user alignment and community alignment.

preprint2022arXiv

Realization of bound states in the continuum in anti-PT-symmetric optical systems

Novel physical concepts that originate from quantum mechanics, such as non-Hermitian systems (dealing mostly with PT and anti-PT symmetry) and bound states in the continuum (BICs), have attracted great interest in the optics and photonics community. To date, BICs and anti-PT symmetry seem to be two independent topics. Here, we for the first time propose a parallel cascaded-resonator system to achieve BICs and anti-PT symmetry simultaneously. We found that the requirements for the Fabry-Pérot BIC and anti-PT symmetry can both be satisfied when the phase shift between any two adjacent resonators is an integer multiple of π. We further analyzed the cascaded-resonator systems which consist of different numbers of resonators and demonstrated their robustness to fabrication imperfections. The proposed structure can readily be realized on an integrated photonic platform, which can have many applications that benefit from the advantages of both BICs and anti-PT symmetry, such as ultralow-linewidth lasing, enhanced optical sensing, and optical signal processing.

preprint2022arXiv

RestoreFormer: High-Quality Blind Face Restoration from Undegraded Key-Value Pairs

Blind face restoration is to recover a high-quality face image from unknown degradations. As face image contains abundant contextual information, we propose a method, RestoreFormer, which explores fully-spatial attentions to model contextual information and surpasses existing works that use local operators. RestoreFormer has several benefits compared to prior arts. First, unlike the conventional multi-head self-attention in previous Vision Transformers (ViTs), RestoreFormer incorporates a multi-head cross-attention layer to learn fully-spatial interactions between corrupted queries and high-quality key-value pairs. Second, the key-value pairs in ResotreFormer are sampled from a reconstruction-oriented high-quality dictionary, whose elements are rich in high-quality facial features specifically aimed for face reconstruction, leading to superior restoration results. Third, RestoreFormer outperforms advanced state-of-the-art methods on one synthetic dataset and three real-world datasets, as well as produces images with better visual quality.

preprint2022arXiv

Revisiting Domain Generalized Stereo Matching Networks from a Feature Consistency Perspective

Despite recent stereo matching networks achieving impressive performance given sufficient training data, they suffer from domain shifts and generalize poorly to unseen domains. We argue that maintaining feature consistency between matching pixels is a vital factor for promoting the generalization capability of stereo matching networks, which has not been adequately considered. Here we address this issue by proposing a simple pixel-wise contrastive learning across the viewpoints. The stereo contrastive feature loss function explicitly constrains the consistency between learned features of matching pixel pairs which are observations of the same 3D points. A stereo selective whitening loss is further introduced to better preserve the stereo feature consistency across domains, which decorrelates stereo features from stereo viewpoint-specific style information. Counter-intuitively, the generalization of feature consistency between two viewpoints in the same scene translates to the generalization of stereo matching performance to unseen domains. Our method is generic in nature as it can be easily embedded into existing stereo networks and does not require access to the samples in the target domain. When trained on synthetic data and generalized to four real-world testing sets, our method achieves superior performance over several state-of-the-art networks.

preprint2022arXiv

Search for $X(3872)\toπ^0χ_{c0}$ and $X(3872)\toππχ_{c0}$ at BESIII

Using 9.9 fb$^{-1}$ of $e^+e^-$ collision data collected by the BESIII detector at center-of-mass energies between 4.15 and 4.30 GeV, we search for the processes $e^+e^-\toγX(3872)$ with $X(3872)\rightarrowπ^0χ_{c0}$ and $X(3872)\rightarrowππχ_{c0}$. Depending on the fitting model, the statistical significance for $X(3872)\toπ^0χ_{c0}$ ranges from 1.3$σ$ to 2.8$σ$. We set upper limits (at 90\% C.L.) of $\frac{\mathcal{B}(X(3872)\rightarrowπ^0χ_{c0})}{\mathcal{B}(X(3872)\toπ^+π^-J/ψ)}<3.6$, $\frac{\mathcal{B}(X(3872)\rightarrowπ^+π^-χ_{c0})}{\mathcal{B}(X(3872)\toπ^+π^-J/ψ)}<0.68$, and $\frac{\mathcal{B}(X(3872)\rightarrowπ^0π^0χ_{c0})}{\mathcal{B}(X(3872)\toπ^+π^-J/ψ)}<1.7$. Combined with the BESIII measurement of $X(3872)\toπ^0χ_{c1}$, we also set an upper limit of $\frac{\mathcal{B}(X(3872)\rightarrowπ^0χ_{c0})}{\mathcal{B}(X(3872)\toπ^0χ_{c1})}<4.4$.

preprint2022arXiv

Search for baryon and lepton number violating decays $D^{0}\to \bar{p}e^{+}$ and $D^{0}\to pe^{-}$

Using an electron-positron collision data sample corresponding to an integrated luminosity of 2.93~fb$^{-1}$ collected with the BESIII detector at a center-of-mass energy of 3.773 GeV, we search for the baryon and lepton number violating decays $D^{0}\to \bar{p}e^{+}$ and $D^{0}\to pe^{-}$. No obvious signals are found with the current statistics. The upper limits on the branching fractions for $D^{0}\to \bar{p}e^{+}$ and $D^{0}\to pe^{-}$ are set to be $1.2\times 10^{-6}$ and $2.2\times 10^{-6}$ at 90\% confidence level, respectively.

preprint2022arXiv

Search for baryon and lepton number violation decay $D^{\pm}\to n(\bar{n})e^{\pm}$

Using a data set of electron-positron collisions corresponding to an integrated luminosity of ${\rm 2.93~fb^{-1}}$ taken with the BESIII detector at a center-of-mass energy of 3.773 GeV, a search for the baryon ($B$) and lepton ($L$) number violating decays $D^{\pm}\to n(\bar{n})e^{\pm}$ is performed. No signal is observed and the upper limits on the branching fractions at the $90\%$ confidence level are set to be $1.43\times10^{-5}$ for the decays $D^{+(-)}\to \bar{n}(n)e^{+(-)}$ with $Δ|B-L|=0$, and $2.91\times10^{-5}$ for the decays $D^{+(-)}\to n(\bar{n})e^{+(-)}$ with $Δ|B-L|=2$ , where $Δ|B-L|$ denotes the change in the difference between baryon and lepton numbers.

preprint2022arXiv

Search for invisible decays of the $Λ$ baryon

A search for invisible decays of the $Λ$ baryon is carried out in the process $J/ψ\toΛ\barΛ$ based on $(1.0087\pm0.0044)\times10^{10}$ $J/ψ$ events collected with the BESIII detector located at the BEPCII storage ring. No signals are found for the invisible decays of $Λ$ baryon, and the upper limit of the branching fraction is determined to be $7.4 \times 10^{-5}$ at the 90% confidence level. This is the first search for invisible decays of baryons; such searches will play an important role in constraining dark sector models related to the baryon asymmetry.

preprint2022arXiv

Search for new hadronic decays of $h_{c}$ and observation of $h_{c}\to p\bar{p}η$

A search for the hadronic decays of the $h_{c}$ meson to the final states $p\bar{p}π^{+}π^{-}π^{0}$, $p\bar{p}η$, and $p\bar{p}π^0$ via the process $ψ(3686) \to π^{0}{h_c}$ is performed using $(4.48\pm0.03)\times10^{8}$ $ψ(3686)$ events collected with the BESIII detector. The decay channel $h_{c}\to p\bar{p}η$ is observed for the first time with a significance greater than $5σ$ and a branching fraction of $\left( {6.41 \pm 1.74 \pm 0.53 \pm 1.00} \right) \times {10^{ -4}}$, where the uncertainties are statistical, systematic, and that from the branching fraction of $ψ(3686)\toπ^{0}h_{c}$. Strong evidence for the decay ${h_c} \to p\bar{p}{π^+}{π^-}{π^0}$ is found with a significance of $4.9σ$ and a branching fraction of $\left( {3.84 \pm 0.83 \pm0.69} \pm 0.58 \right) \times {10^{ - 3}}$. The significances include systematic uncertainties. No clear signal of the decay $h_c\to p\bar{p}π^{0}$ is found, and an upper limit of $6.59\times 10^{-4}$ on its branching fraction is set at the 90% confidence level.

preprint2022arXiv

Search for the decay $D^{0} \to π^{0} ν\barν$

We present the first experimental search for the rare charm decay $D^{0} \to π^{0} ν\barν$. It is based on an $e^+e^-$ collision sample consisting of $10.6\times10^{6}$ pairs of $D^0\bar{D}^0$ mesons collected by the BESIII detector at $\sqrt{s}$=3.773 GeV, corresponding to an integrated luminosity of 2.93~fb$^{-1}$. A data-driven method is used to ensure the reliability of the background modeling. No significant $D^{0} \to π^{0} ν\barν$ signal is observed in data and an upper limit of the branching fraction is set to be $2.1\times 10^{-4}$ at the 90$\%$ confidence level. This is the first experimental constraint on charmed-hadron decays into dineutrino final states.

preprint2022arXiv

Search for the decay $h_c\rightarrowπ^0J/ψ$

A search for the decay $h_c\rightarrowπ^0J/ψ$ is performed using a sample of $h_c$ produced in the reaction $e^+e^-\rightarrowπ^+π^-h_c$. The data samples were collected with the BESIII detector at center-of-mass energies between 4.189 and 4.437 GeV, corresponding to a total integrated luminosity of 11 fb$^{-1}$. No significant signal is observed. Upper limits on the branching ratio $\mathcal{B}(h_c\rightarrowπ^0J/ψ)/\mathcal{B}(h_c\rightarrowγη_c\rightarrowγK^+K^-π^0)$ and on the branching fraction $\mathcal{B}(h_c\rightarrowπ^0J/ψ)$ are determined to be $7.5\times10^{-2}$ and $4.7\times10^{-4}$ at $90\%$ confidence level, respectively. The latter is derived from the former using the measured branching fraction of the normalization channel. This is the first determination of the upper limit of the decay $h_c\rightarrowπ^0J/ψ$.

preprint2022arXiv

Self-recoverable Adversarial Examples: A New Effective Protection Mechanism in Social Networks

Malicious intelligent algorithms greatly threaten the security of social users' privacy by detecting and analyzing the uploaded photos to social network platforms. The destruction to DNNs brought by the adversarial attack sparks the potential that adversarial examples serve as a new protection mechanism for privacy security in social networks. However, the existing adversarial example does not have recoverability for serving as an effective protection mechanism. To address this issue, we propose a recoverable generative adversarial network to generate self-recoverable adversarial examples. By modeling the adversarial attack and recovery as a united task, our method can minimize the error of the recovered examples while maximizing the attack ability, resulting in better recoverability of adversarial examples. To further boost the recoverability of these examples, we exploit a dimension reducer to optimize the distribution of adversarial perturbation. The experimental results prove that the adversarial examples generated by the proposed method present superior recoverability, attack ability, and robustness on different datasets and network architectures, which ensure its effectiveness as a protection mechanism in social networks.

preprint2022arXiv

Targeted Cross-Validation

In many applications, we have access to the complete dataset but are only interested in the prediction of a particular region of predictor variables. A standard approach is to find the globally best modeling method from a set of candidate methods. However, it is perhaps rare in reality that one candidate method is uniformly better than the others. A natural approach for this scenario is to apply a weighted $L_2$ loss in performance assessment to reflect the region-specific interest. We propose a targeted cross-validation (TCV) to select models or procedures based on a general weighted $L_2$ loss. We show that the TCV is consistent in selecting the best performing candidate under the weighted $L_2$ loss. Experimental studies are used to demonstrate the use of TCV and its potential advantage over the global CV or the approach of using only local data for modeling a local region. Previous investigations on CV have relied on the condition that when the sample size is large enough, the ranking of two candidates stays the same. However, in many applications with the setup of changing data-generating processes or highly adaptive modeling methods, the relative performance of the methods is not static as the sample size varies. Even with a fixed data-generating process, it is possible that the ranking of two methods switches infinitely many times. In this work, we broaden the concept of the selection consistency by allowing the best candidate to switch as the sample size varies, and then establish the consistency of the TCV. This flexible framework can be applied to high-dimensional and complex machine learning scenarios where the relative performances of modeling procedures are dynamic.

preprint2022arXiv

TOD-CNN: An Effective Convolutional Neural Network for Tiny Object Detection in Sperm Videos

The detection of tiny objects in microscopic videos is a problematic point, especially in large-scale experiments. For tiny objects (such as sperms) in microscopic videos, current detection methods face challenges in fuzzy, irregular, and precise positioning of objects. In contrast, we present a convolutional neural network for tiny object detection (TOD-CNN) with an underlying data set of high-quality sperm microscopic videos (111 videos, $>$ 278,000 annotated objects), and a graphical user interface (GUI) is designed to employ and test the proposed model effectively. TOD-CNN is highly accurate, achieving $85.60\%$ AP$_{50}$ in the task of real-time sperm detection in microscopic videos. To demonstrate the importance of sperm detection technology in sperm quality analysis, we carry out relevant sperm quality evaluation metrics and compare them with the diagnosis results from medical doctors.

preprint2022arXiv

VPNets: Volume-preserving neural networks for learning source-free dynamics

We propose volume-preserving networks (VPNets) for learning unknown source-free dynamical systems using trajectory data. We propose three modules and combine them to obtain two network architectures, coined R-VPNet and LA-VPNet. The distinct feature of the proposed models is that they are intrinsic volume-preserving. In addition, the corresponding approximation theorems are proved, which theoretically guarantee the expressivity of the proposed VPNets to learn source-free dynamics. The effectiveness, generalization ability and structure-preserving property of the VP-Nets are demonstrated by numerical experiments.

preprint2022arXiv

What is a Good Metric to Study Generalization of Minimax Learners?

Minimax optimization has served as the backbone of many machine learning (ML) problems. Although the convergence behavior of optimization algorithms has been extensively studied in the minimax settings, their generalization guarantees in stochastic minimax optimization problems, i.e., how the solution trained on empirical data performs on unseen testing data, have been relatively underexplored. A fundamental question remains elusive: What is a good metric to study generalization of minimax learners? In this paper, we aim to answer this question by first showing that primal risk, a universal metric to study generalization in minimization problems, which has also been adopted recently to study generalization in minimax ones, fails in simple examples. We thus propose a new metric to study generalization of minimax learners: the primal gap, defined as the difference between the primal risk and its minimum over all models, to circumvent the issues. Next, we derive generalization error bounds for the primal gap in nonconvex-concave settings. As byproducts of our analysis, we also solve two open questions: establishing generalization error bounds for primal risk and primal-dual risk, another existing metric that is only well-defined when the global saddle-point exists, in the strong sense, i.e., without strong concavity or assuming that the maximization and expectation can be interchanged, while either of these assumptions was needed in the literature. Finally, we leverage this new metric to compare the generalization behavior of two popular algorithms -- gradient descent-ascent (GDA) and gradient descent-max (GDMax) in stochastic minimax optimization.

preprint2021arXiv

A SARS-CoV-2 Microscopic Image Dataset with Ground Truth Images and Visual Features

SARS-CoV-2 has characteristics of wide contagion and quick propagation velocity. To analyse the visual information of it, we build a SARS-CoV-2 Microscopic Image Dataset (SC2-MID) with 48 electron microscopic images and also prepare their ground truth images. Furthermore, we extract multiple classical features and novel deep learning features to describe the visual information of SARS-CoV-2. Finally, it is proved that the visual features of the SARS-CoV-2 images which are observed under the electron microscopic can be extracted and analysed.

preprint2021arXiv

Adversarial Active Learning based Heterogeneous Graph Neural Network for Fake News Detection

The explosive growth of fake news along with destructive effects on politics, economy, and public safety has increased the demand for fake news detection. Fake news on social media does not exist independently in the form of an article. Many other entities, such as news creators, news subjects, and so on, exist on social media and have relationships with news articles. Different entities and relationships can be modeled as a heterogeneous information network (HIN). In this paper, we attempt to solve the fake news detection problem with the support of a news-oriented HIN. We propose a novel fake news detection framework, namely Adversarial Active Learning-based Heterogeneous Graph Neural Network (AA-HGNN) which employs a novel hierarchical attention mechanism to perform node representation learning in the HIN. AA-HGNN utilizes an active learning framework to enhance learning performance, especially when facing the paucity of labeled data. An adversarial selector will be trained to query high-value candidates for the active learning framework. When the adversarial active learning is completed, AA-HGNN detects fake news by classifying news article nodes. Experiments with two real-world fake news datasets show that our model can outperform text-based models and other graph-based models when using less labeled data benefiting from the adversarial active learning. As a model with generalizability, AA-HGNN also has the ability to be widely used in other node classification-related applications on heterogeneous graphs.

preprint2021arXiv

Cross section measurements of the $e^+e^-\to D^{+}D^{-}$ and $e^+e^-\to D^{*+}D^{-}$ processes at center-of-mass energies from 4.085 to 4.600 GeV

The Born cross sections of the $e^+e^-\to D^{*+}D^{*-}$ and $e^+e^-\to D^{*+}D^{-}$ processes are measured using $e^+e^-$ collision data collected with the BESIII experiment at center-of-mass energies from 4.085 to 4.600 GeV, corresponding to an integrated luminosity of $15.7~{\rm fb}^{-1}$. The results are consistent with and more precise than the previous measurements by the Belle, Babar and CLEO collaborations. The measurements are essential for understanding the nature of vector charmonium and charmonium-like states.

preprint2021arXiv

Cross sections for the reactions $e^+e^-\rightarrow K^+K^-π^+π^-(π^0)$, $K^+K^-K^+K^-(π^0)$, $π^+π^-π^+π^-(π^0)$, $p\bar{p}π^+π^-(π^0)$ in the energy region between 3.773 and 4.600 GeV

Using the data samples collected in the energy range from 3.773 to 4.600 GeV with the BESIII detector at the BEPCII collider, we measure the dressed cross sections as a function of center-of-mass energy for $e^+e^-\rightarrow K^+K^-π^+π^-(π^0)$, $K^+K^-K^+K^-(π^0)$, $π^+π^-π^+π^-(π^0)$, and $p\bar{p}π^+π^-(π^0)$. The cross sections for $e^+e^-\rightarrow K^+K^-K^+K^-π^0$, $p\bar{p}π^+π^-(π^0)$ are the first measurements. Cross sections for the other five channels are much more precise than previous results in this energy region. We also search for charmonium and charmonium-like resonances, such as the $Y(4230)$, decaying into the same final states. We find evidence of the $ψ(4040)$ decaying to $π^+π^-π^+π^-π^0$ with a statistical significance of $3.6σ$. Upper limits are provided for other decays since no clear signals are observed.

preprint2021arXiv

Fake News Detection on News-Oriented Heterogeneous Information Networks through Hierarchical Graph Attention

The viral spread of fake news has caused great social harm, making fake news detection an urgent task. Current fake news detection methods rely heavily on text information by learning the extracted news content or writing style of internal knowledge. However, deliberate rumors can mask writing style, bypassing language models and invalidating simple text-based models. In fact, news articles and other related components (such as news creators and news topics) can be modeled as a heterogeneous information network (HIN for short). In this paper, we propose a novel fake news detection framework, namely Hierarchical Graph Attention Network(HGAT), which uses a novel hierarchical attention mechanism to perform node representation learning in HIN, and then detects fake news by classifying news article nodes. Experiments on two real-world fake news datasets show that HGAT can outperform text-based models and other network-based models. In addition, the experiment proved the expandability and generalizability of our for graph representation learning and other node classification related applications in heterogeneous graphs.

preprint2021arXiv

Label Contrastive Coding based Graph Neural Network for Graph Classification

Graph classification is a critical research problem in many applications from different domains. In order to learn a graph classification model, the most widely used supervision component is an output layer together with classification loss (e.g.,cross-entropy loss together with softmax or margin loss). In fact, the discriminative information among instances are more fine-grained, which can benefit graph classification tasks. In this paper, we propose the novel Label Contrastive Coding based Graph Neural Network (LCGNN) to utilize label information more effectively and comprehensively. LCGNN still uses the classification loss to ensure the discriminability of classes. Meanwhile, LCGNN leverages the proposed Label Contrastive Loss derived from self-supervised learning to encourage instance-level intra-class compactness and inter-class separability. To power the contrastive learning, LCGNN introduces a dynamic label memory bank and a momentum updated encoder. Our extensive evaluations with eight benchmark graph datasets demonstrate that LCGNN can outperform state-of-the-art graph classification models. Experimental results also verify that LCGNN can achieve competitive performance with less training data because LCGNN exploits label information comprehensively.

preprint2021arXiv

Measurement of Branching Fractions of $J/ψ$ and $ψ(3686)$ decays to $Σ^{+}$ and $\overlineΣ^-$

Using $1310.6\times10^{6}$ $J/ψ$ and $448.1\times10^{6}$ $ψ(3686)$ events collected with the BESIII detector, the branching fractions of $J/ψ$ and $ψ(3686)$ decays to $Σ^{+}\overlineΣ^{-}$ are measured to be $(10.61 \pm 0.04 \pm 0.36) \times 10^{-4}$ and $(2.52 \pm 0.04 \pm 0.09) \times 10^{-4}$, respectively. In addition, the ratio of $\mathcal{B}(ψ(3686) \rightarrow Σ^{+}\overlineΣ^{-})/\mathcal{B}(J/ψ\rightarrow Σ^{+}\overlineΣ^{-})$ is determined to be $(23.8 \pm 1.1)\%$ which violates the "$12\%$ rule".

preprint2021arXiv

Measurement of cross-section for $e^+e^-\toΞ^-\barΞ^+$ near threshold at BESIII

The Born cross-sections and effective form factors for process $e^+e^-\toΞ^-\barΞ^+$ are measured at eight center-of-mass energies between 2.644 and 3.080 GeV, using a total integrated luminosity of 363.9 pb$^{-1}$ $e^+e^-$ collision data collected with the BESIII detector at BEPCII. After performing a fit to the Born cross-section of $e^+e^-\toΞ^-\barΞ^+$, no significant threshold effect is observed.

preprint2021arXiv

Measurement of the $e^{+}e^{-}\toΣ^{0}\barΣ^{0}$ cross sections at center-of-mass energies from $2.3864$ to $3.0200$ GeV

The Born cross sections of $e^{+}e^{-}\to Σ^{0}\barΣ^{0}$ are measured at center-of-mass energies from $2.3864$ to $3.0200$ GeV using data samples with an integrated luminosity of $328.5$ pb$^{-1}$ collected with the BESIII detector operating at the BEPCII collider. The analysis makes use of a novel reconstruction method for energies near production threshold, while a single-tag method is employed at other center-of-mass energies. The measured cross sections are consistent with earlier results from BaBar, with a substantially improved precision. The cross-section lineshape can be well described by a perturbative QCD-driven energy function. In addition, the effective form factors of the $Σ^{0}$ baryon are determined. The results provide precise experimental input for testing various theoretical predictions.

preprint2021arXiv

Measurements of $e^+e^-\rightarrow η_{\rm c}π^+ π^-π^0$, $η_{\rm c}π^+ π^-$ and $η_{\rm c}π^0γ$ at $\sqrt{s}$ from 4.18 to 4.60\,GeV, and search for a $Z_{\rm c}$ state close to the $D\bar{D}$ threshold decaying to $η_{\rm c}π$ at $\sqrt{s}$ = 4.23 GeV

We study $η_{\rm c}$ production at center-of-mass energies $\sqrt{s}$ from 4.18 to 4.60 GeV in $e^+e^-$ annihilation data collected with the BESIII detector operating at the BEPCII storage ring, corresponding to 7.3 fb$^{-1}$ of integrated luminosity. We measure the cross sections of the three different exclusive reactions $e^+e^-\rightarrow η_{\rm c}π^+ π^-π^0$, $e^+e^- \rightarrow η_{\rm c}π^+ π^-$, and $e^+e^- \rightarrow η_{\rm c}π^0γ$. We find significant $η_{\rm c}$ production in $e^+e^-\rightarrow η_{\rm c}π^+ π^-π^0$ at $\sqrt{s}$ of 4.23 GeV and 4.26 GeV and observe a significant energy-dependent Born cross section that we measure to be consistent with the production via the intermediate $Y(4260)$ resonance. In addition, we perform a search for a charmonium-like $Z_{\rm c}$ state close to the $D\bar{D}$ threshold that decays to $η_{\rm c}π$, involving ground state charmonium, and observe no signal. Corresponding upper limits on the cross section of $η_{\rm c}$ and $Z_{\rm c}$ production are provided, where the yields are not found to be significant.

preprint2021arXiv

Measuring and Sampling: A Metric-guided Subgraph Learning Framework for Graph Neural Network

Graph neural network (GNN) has shown convincing performance in learning powerful node representations that preserve both node attributes and graph structural information. However, many GNNs encounter problems in effectiveness and efficiency when they are designed with a deeper network structure or handle large-sized graphs. Several sampling algorithms have been proposed for improving and accelerating the training of GNNs, yet they ignore understanding the source of GNN performance gain. The measurement of information within graph data can help the sampling algorithms to keep high-value information while removing redundant information and even noise. In this paper, we propose a Metric-Guided (MeGuide) subgraph learning framework for GNNs. MeGuide employs two novel metrics: Feature Smoothness and Connection Failure Distance to guide the subgraph sampling and mini-batch based training. Feature Smoothness is designed for analyzing the feature of nodes in order to retain the most valuable information, while Connection Failure Distance can measure the structural information to control the size of subgraphs. We demonstrate the effectiveness and efficiency of MeGuide in training various GNNs on multiple datasets.

preprint2021arXiv

Model independent determination of the spin of the $Ω^{-}$ and its polarization alignment in $ψ(3686)\rightarrowΩ^{-}\barΩ^{+}$

We present an analysis of the process $ψ(3686) \to Ω^- \barΩ^+$ ($Ω^-\to K^-Λ$, $\barΩ^+\to K^+\barΛ$, $Λ\to pπ^-$, $\barΛ\to \bar{p}π^+$) based on a data set of $448\times 10^6$ $ψ(3686)$ decays collected with the BESIII detector at the BEPCII electron-positron collider. The helicity amplitudes for the process $ψ(3686) \to Ω^- \barΩ^+$ and the decay parameters of the subsequent decay $Ω^-\to K^-Λ$ $(\barΩ^+\to K^+\barΛ)$ are measured for the first time by a fit to the angular distribution of the complete decay chain. The branching fraction of $ψ(3686) \to Ω^- \barΩ^+$ is measured to be $(5.82\pm 0.12\pm 0.24)\times 10^{-5}$, with an improved precision compared to previous measurements.

preprint2021arXiv

Observation of $e^{+}e^{-}\rightarrowηψ(2S)$ at center-of-mass energies from 4.236 to 4.600 GeV

Using a total of $5.25~{\rm fb}^{-1}$ of $e^{+}e^{-}$ collision data with center-of-mass energies from 4.236 to 4.600 GeV, we report the first observation of the process $e^{+}e^{-}\to ηψ(2S)$ with a statistical significance of $5σ$. The data sets were collected by the BESIII detector operating at the BEPCII storage ring. We measure the yield of events integrated over center-of-mass energies and also present the energy dependence of the measured cross section.

preprint2021arXiv

Search for the $X(2370)$ and observation of $η_{c}\toηηη^\prime$ in $J/ψ\toγηηη^{\prime}$

Using a sample of $1.31\times10^{9} ~J/ψ$ events collected with the BESIII detector, we perform a study of $J/ψ\toγηηη^{\prime}$ to search for the $X(2370)$ and $η_{c}$ in the $ηηη^{\prime}$ invariant mass distribution. No significant signal for the $X(2370)$ is observed, and we set an upper limit for the product branching fraction of ${\cal B}(J/ψ\toγX(2370)\cdot{\cal B}(X(2370)\toηηη^{\prime}) < 9.2\times10^{-6}$ at the 90% confidence level. A clear $η_{c}$ signal is observed for the first time, yielding a product branching fraction of ${\cal B}(J/ψ\to γη_{c})\cdot{\cal B}(η_{c}\to ηηη^{\prime}) = (4.86\pm0.62~({\rm stat.})\pm0.45~({\rm sys.}))\times10^{-5}$.

preprint2021arXiv

Systematic electrochemical etching of various metal tips for tunneling spectroscopy and scanning probe microscopy

Hard point-contact spectroscopy and scanning probe microscopy/spectroscopy are powerful techniques for investigating materials with strong expandability. To support these studies, tips with various physical and chemical properties are required. To ensure the reproducibility of experimental results, the fabrication of tips should be standardized, and a controllable and convenient system should be set up. Here a systematic methodology to fabricate various tips is proposed, involving electrochemical etching reactions. The reaction parameters fall into four categories: solution, power supply, immersion depth, and interruption. An etching system was designed and built so that these parameters could be accurately controlled. With this system, etching parameters for copper, silver, gold, platinum/iridium alloy, tungsten, lead, niobium, iron, nickel, cobalt, and permalloy were explored and standardized. Among these tips, silver and niobium's new recipes were explored and standardized. Optical and scanning electron microscopies were performed to characterize the sharp needles. Relevant point-contact experiments were carried out with an etched silver tip to confirm the suitability of the fabricated tips.

preprint2021arXiv

Topology Learning Aided False Data Injection Attack without Prior Topology Information

False Data Injection (FDI) attacks against powersystem state estimation are a growing concern for operators.Previously, most works on FDI attacks have been performedunder the assumption of the attacker having full knowledge ofthe underlying system without clear justification. In this paper, wedevelop a topology-learning-aided FDI attack that allows stealthycyber-attacks against AC power system state estimation withoutprior knowledge of system information. The attack combinestopology learning technique, based only on branch and bus powerflows, and attacker-side pseudo-residual assessment to performstealthy FDI attacks with high confidence. This paper, for thefirst time, demonstrates how quickly the attacker can developfull-knowledge of the grid topology and parameters and validatesthe full knowledge assumptions in the previous work.

preprint2021arXiv

Weak phases and CP-symmetry tests in sequential decays of entangled double-strange baryons

Using a sample of $1.31\times10^9$ $J/ψ$ events collected with the BESIII detector at the electron-positron collider BEPCII, we analyse the full $J/ψ\to$ $Ξ^-\overlineΞ^+$, $Ξ^-\to Λπ^-$, $Λ\to pπ^-$, $\overlineΞ^+\to\overlineΛπ^+$, $\overlineΛ\to\overline{p}π^+$ decay chain. A new method, exploiting the fact that the $Ξ^-\overlineΞ^+$ pair is entangled and sequentially decaying, and where the complete decay chains are reconstructed, is applied for the first time. This enables precision measurements of the decay parameters for the $Ξ^-\toΛπ^-$ decay ($α_Ξ$, $ϕ_Ξ$) as well as the $\overlineΞ^+\to\overlineΛπ^+$ decay ($\overlineα_Ξ$, $\overlineϕ_Ξ$). From the decay parameters, two independent CP tests were performed, quantified by the observables $A_{\rm CP}^Ξ$ and $Δϕ_Ξ$. Our results, $A_{\rm CP}^Ξ$ = $(6.0\pm13.4\pm5.6)\times10^{-3}$ and $Δϕ_Ξ= (-4.8\pm13.7\pm2.9)\times10^{-3}~{\rm rad}$, are consistent with CP symmetry. Furthermore, our method enables a separation of strong and weak $Ξ\toΛπ$ decay amplitudes. This results in the first direct measurement of the weak phase difference for any baryon decay. The result is found to be $(ξ_{P} - ξ_{S}) = (1.2\pm3.4\pm0.8)\times10^{-2}$ rad and is one of the most precise tests of CP symmetry for strange baryons. The strong phase difference is measured to be $(δ_P - δ_S) = (-4.0\pm3.3\pm1.7)\times10^{-2}$ rad. In addition, we provide an independent measurement of the recently debated $Λ$ decay parameter, $α_Λ = 0.757 \pm 0.011 \pm 0.008 $. The $Λ\overlineΛ$ asymmetry is measured to be $A_{\rm CP}^Λ = (-3.7\pm11.7\pm9.0)\times10^{-3}$.

preprint2020arXiv

$Σ^{+}$ and $\barΣ^-$ polarization in the $J/ψ$ and $ψ(3686)$ decays

From $1310.6\times10^{6}$ $J/ψ$ and $448.1\times10^{6}$ $ψ(3686)$ events collected with the BESIII experiment, we report the first observation of $Σ^{+}$ and $\barΣ^{-}$ spin polarization in $e^+e^-\rightarrow J/ψ(ψ(3686)) \rightarrow Σ^{+} \barΣ^{-}$ decays. The relative phases of the form factors $ΔΦ$ have been measured to be $(-15.5\pm0.7\pm0.5)^{\circ}$ and $(21.7\pm4.0\pm0.8)^{\circ}$ with $J/ψ$ and $ψ(3686)$ data, respectively. The non-zero value of $ΔΦ$ allows for a direct and simultaneous measurement of the decay asymmetry parameters of $Σ^{+}\rightarrow p π^{0}~(α_0 = -0.998\pm0.037\pm0.009)$ and $\barΣ^{-}\rightarrow \bar{p} π^{0}~(\barα_0 = 0.990\pm0.037\pm0.011)$, the latter value being determined for the first time. The average decay asymmetry, $(α_{0} - \barα_{0})/2$, is calculated to be $-0.994\pm0.004\pm0.002$. The CP asymmetry $A_{\rm CP,Σ} = (α_0 + \barα_0)/(α_0 - \barα_0) = -0.004\pm0.037\pm0.010$ is extracted for the first time, and is found to be consistent with CP conservation.

preprint2020arXiv

A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization

Error bound analysis, which estimates the distance of a point to the solution set of an optimization problem using the optimality residual, is a powerful tool for the analysis of first-order optimization algorithms. In this paper, we use global error bound analysis to study the iteration complexity of a first-order algorithm for a linearly constrained nonconvex minimization problem. we develop a global dual error bound analysis for a regularized version of this nonconvex problem by using a novel ``decomposition'' technique. Equipped with this global dual error bound, we prove that a suitably designed primal-dual first order method can generate an $ε$-stationary solution of the linearly constrained nonconvex minimization problem within $\mathcal{O}(1/ε^2)$ iterations, which is the best known iteration complexity for this class of nonconvex problems.

preprint2020arXiv

A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization

Consider the minimization of a nonconvex differentiable function over a polyhedron. A popular primal-dual first-order method for this problem is to perform a gradient projection iteration for the augmented Lagrangian function and then update the dual multiplier vector using the constraint residual. However, numerical examples show that this approach can exhibit "oscillation" and may not converge. In this paper, we propose a proximal alternating direction method of multipliers for the multi-block version of this problem. A distinctive feature of this method is the introduction of a "smoothed" (i.e., exponentially weighted) sequence of primal iterates, and the inclusion, at each iteration, to the augmented Lagrangian function a quadratic proximal term centered at the current smoothed primal iterate. The resulting proximal augmented Lagrangian function is inexactly minimized (via a gradient projection step) at each iteration while the dual multiplier vector is updated using the residual of the linear constraints. When the primal and dual stepsizes are chosen sufficiently small, we show that suitable "smoothing" can stabilize the "oscillation", and the iterates of the new proximal ADMM algorithm converge to a stationary point under some mild regularity conditions. Furthermore, when the objective function is quadratic, we establish the linear convergence of the algorithm. Our proof is based on a new potential function and a novel use of error bounds.

preprint2020arXiv

CG-BERT: Conditional Text Generation with BERT for Generalized Few-shot Intent Detection

In this paper, we formulate a more realistic and difficult problem setup for the intent detection task in natural language understanding, namely Generalized Few-Shot Intent Detection (GFSID). GFSID aims to discriminate a joint label space consisting of both existing intents which have enough labeled data and novel intents which only have a few examples for each class. To approach this problem, we propose a novel model, Conditional Text Generation with BERT (CG-BERT). CG-BERT effectively leverages a large pre-trained language model to generate text conditioned on the intent label. By modeling the utterance distribution with variational inference, CG-BERT can generate diverse utterances for the novel intents even with only a few utterances available. Experimental results show that CG-BERT achieves state-of-the-art performance on the GFSID task with 1-shot and 5-shot settings on two real-world datasets.

preprint2020arXiv

DEAM: Adaptive Momentum with Discriminative Weight for Stochastic Optimization

Optimization algorithms with momentum, e.g., (ADAM), have been widely used for building deep learning models due to the faster convergence rates compared with stochastic gradient descent (SGD). Momentum helps accelerate SGD in the relevant directions in parameter updating, which can minify the oscillations of parameters update route. However, there exist errors in some update steps in optimization algorithms with momentum like ADAM. The fixed momentum weight (e.g., β_1 in ADAM) will propagate errors in momentum computing. In this paper, we introduce a novel optimization algorithm, namely Discriminative wEight on Adaptive Momentum (DEAM). Instead of assigning the momentum term weight with a fixed hyperparameter, DEAM proposes to compute the momentum weight automatically based on the discriminative angle. In this way, DEAM involves fewer hyperparameters. DEAM also contains a novel backtrack term, which restricts redundant updates when the correction of the last step is needed. Extensive experiments demonstrate that DEAM can achieve a faster convergence rate than the existing optimization algorithms in training the deep learning models of both convex and non-convex situations.

preprint2020arXiv

Deep Blind Video Super-resolution

Existing video super-resolution (SR) algorithms usually assume that the blur kernels in the degradation process are known and do not model the blur kernels in the restoration. However, this assumption does not hold for video SR and usually leads to over-smoothed super-resolved images. In this paper, we propose a deep convolutional neural network (CNN) model to solve video SR by a blur kernel modeling approach. The proposed deep CNN model consists of motion blur estimation, motion estimation, and latent image restoration modules. The motion blur estimation module is used to provide reliable blur kernels. With the estimated blur kernel, we develop an image deconvolution method based on the image formation model of video SR to generate intermediate latent images so that some sharp image contents can be restored well. However, the generated intermediate latent images may contain artifacts. To generate high-quality images, we use the motion estimation module to explore the information from adjacent frames, where the motion estimation can constrain the deep CNN model for better image restoration. We show that the proposed algorithm is able to generate clearer images with finer structural details. Extensive experimental results show that the proposed algorithm performs favorably against state-of-the-art methods.

preprint2020arXiv

EfficientFCN: Holistically-guided Decoding for Semantic Segmentation

Both performance and efficiency are important to semantic segmentation. State-of-the-art semantic segmentation algorithms are mostly based on dilated Fully Convolutional Networks (dilatedFCN), which adopt dilated convolutions in the backbone networks to extract high-resolution feature maps for achieving high-performance segmentation performance. However, due to many convolution operations are conducted on the high-resolution feature maps, such dilatedFCN-based methods result in large computational complexity and memory consumption. To balance the performance and efficiency, there also exist encoder-decoder structures that gradually recover the spatial information by combining multi-level feature maps from the encoder. However, the performances of existing encoder-decoder methods are far from comparable with the dilatedFCN-based methods. In this paper, we propose the EfficientFCN, whose backbone is a common ImageNet pre-trained network without any dilated convolution. A holistically-guided decoder is introduced to obtain the high-resolution semantic-rich feature maps via the multi-scale features from the encoder. The decoding task is converted to novel codebook generation and codeword assembly task, which takes advantages of the high-level and low-level features from the encoder. Such a framework achieves comparable or even better performance than state-of-the-art methods with only 1/3 of the computational cost. Extensive experiments on PASCAL Context, PASCAL VOC, ADE20K validate the effectiveness of the proposed EfficientFCN.

preprint2020arXiv

Erratum to "Measurement of the $e^+e^-\toπ^+π^-$ cross section between 600 and 900 MeV using initial state radiation"

In Phys. Lett. B 753, 629-638 (2016) [arXiv:1507.08188] the BESIII collaboration published a cross section measurement of the process $e^+e^-\to π^+ π^-$ in the energy range between 600 and 900 MeV. In this erratum we report a corrected evaluation of the statistical errors in terms of a fully propagated covariance matrix. The correction also yields a reduced statistical uncertainty for the hadronic vacuum polarization contribution to the anomalous magnetic moment of the muon, which now reads as $a_μ^{ππ\mathrm{, LO}}(600 - 900\,\mathrm{MeV}) = (368.2 \pm 1.5_{\rm stat} \pm 3.3_{\rm syst})\times 10^{-10}$. The central values of the cross section measurement and of $a_μ^{ππ\mathrm{, LO}}$, as well as the systematic uncertainties remain unchanged.

preprint2020arXiv

First Measurements of $χ_{cJ}\rightarrow Σ^{-} \barΣ^{+} (J = 0, 1, 2)$ Decays

We measured the branching fractions of the decays $χ_{cJ}\toΣ^{-}\barΣ^{+}$ for the first time using the final states $n\bar{n}π^{+}π^{-}$. The data sample exploited here is $448.1\times10^{6}$ $ψ(3686)$ events collected with BESIII. We find $\mathcal{B}(χ_{cJ}\rightarrowΣ^{-}\barΣ^{+}) = (51.3\pm2.4\pm4.1)\times10^{-5},\, (5.7\pm1.4\pm0.6)\times10^{-5},\, \rm{and}~ (4.4\pm1.7\pm0.5)\times10^{-5}$, for $J=0,1,2$, respectively, where the first uncertainties are statistical and the second systematic.

preprint2020arXiv

G5: A Universal GRAPH-BERT for Graph-to-Graph Transfer and Apocalypse Learning

The recent GRAPH-BERT model introduces a new approach to learning graph representations merely based on the attention mechanism. GRAPH-BERT provides an opportunity for transferring pre-trained models and learned graph representations across different tasks within the same graph dataset. In this paper, we will further investigate the graph-to-graph transfer of a universal GRAPH-BERT for graph representation learning across different graph datasets, and our proposed model is also referred to as the G5 for simplicity. Many challenges exist in learning G5 to adapt the distinct input and output configurations for each graph data source, as well as the information distributions differences. G5 introduces a pluggable model architecture: (a) each data source will be pre-processed with a unique input representation learning component; (b) each output application task will also have a specific functional component; and (c) all such diverse input and output components will all be conjuncted with a universal GRAPH-BERT core component via an input size unification layer and an output representation fusion layer, respectively. The G5 model removes the last obstacle for cross-graph representation learning and transfer. For the graph sources with very sparse training data, the G5 model pre-trained on other graphs can still be utilized for representation learning with necessary fine-tuning. What's more, the architecture of G5 also allows us to learn a supervised functional classifier for data sources without any training data at all. Such a problem is also named as the Apocalypse Learning task in this paper. Two different label reasoning strategies, i.e., Cross-Source Classification Consistency Maximization (CCCM) and Cross-Source Dynamic Routing (CDR), are introduced in this paper to address the problem.

preprint2020arXiv

Get Rid of Suspended Animation Problem: Deep Diffusive Neural Network on Graph Semi-Supervised Classification

Existing graph neural networks may suffer from the "suspended animation problem" when the model architecture goes deep. Meanwhile, for some graph learning scenarios, e.g., nodes with text/image attributes or graphs with long-distance node correlations, deep graph neural networks will be necessary for effective graph representation learning. In this paper, we propose a new graph neural network, namely DIFNET (Graph Diffusive Neural Network), for graph representation learning and node classification. DIFNET utilizes both neural gates and graph residual learning for node hidden state modeling, and includes an attention mechanism for node neighborhood information diffusion. Extensive experiments will be done in this paper to compare DIFNET against several state-of-the-art graph neural network models. The experimental results can illustrate both the learning performance advantages and effectiveness of DIFNET, especially in addressing the "suspended animation problem".

preprint2020arXiv

Graph Neural Distance Metric Learning with Graph-Bert

Graph distance metric learning serves as the foundation for many graph learning problems, e.g., graph clustering, graph classification and graph matching. Existing research works on graph distance metric (or graph kernels) learning fail to maintain the basic properties of such metrics, e.g., non-negative, identity of indiscernibles, symmetry and triangle inequality, respectively. In this paper, we will introduce a new graph neural network based distance metric learning approaches, namely GB-DISTANCE (GRAPH-BERT based Neural Distance). Solely based on the attention mechanism, GB-DISTANCE can learn graph instance representations effectively based on a pre-trained GRAPH-BERT model. Different from the existing supervised/unsupervised metrics, GB-DISTANCE can be learned effectively in a semi-supervised manner. In addition, GB-DISTANCE can also maintain the distance metric basic properties mentioned above. Extensive experiments have been done on several benchmark graph datasets, and the results demonstrate that GB-DISTANCE can out-perform the existing baseline methods, especially the recent graph neural network model based graph metrics, with a significant gap in computing the graph distance.

preprint2020arXiv

Graph-Bert: Only Attention is Needed for Learning Graph Representations

The dominant graph neural networks (GNNs) over-rely on the graph links, several serious performance problems with which have been witnessed already, e.g., suspended animation problem and over-smoothing problem. What's more, the inherently inter-connected nature precludes parallelization within the graph, which becomes critical for large-sized graph, as memory constraints limit batching across the nodes. In this paper, we will introduce a new graph neural network, namely GRAPH-BERT (Graph based BERT), solely based on the attention mechanism without any graph convolution or aggregation operators. Instead of feeding GRAPH-BERT with the complete large input graph, we propose to train GRAPH-BERT with sampled linkless subgraphs within their local contexts. GRAPH-BERT can be learned effectively in a standalone mode. Meanwhile, a pre-trained GRAPH-BERT can also be transferred to other application tasks directly or with necessary fine-tuning if any supervised label information or certain application oriented objective is available. We have tested the effectiveness of GRAPH-BERT on several graph benchmark datasets. Based the pre-trained GRAPH-BERT with the node attribute reconstruction and structure recovery tasks, we further fine-tune GRAPH-BERT on node classification and graph clustering tasks specifically. The experimental results have demonstrated that GRAPH-BERT can out-perform the existing GNNs in both the learning effectiveness and efficiency.

preprint2020arXiv

Learning a Reinforced Agent for Flexible Exposure Bracketing Selection

Automatically selecting exposure bracketing (images exposed differently) is important to obtain a high dynamic range image by using multi-exposure fusion. Unlike previous methods that have many restrictions such as requiring camera response function, sensor noise model, and a stream of preview images with different exposures (not accessible in some scenarios e.g. some mobile applications), we propose a novel deep neural network to automatically select exposure bracketing, named EBSNet, which is sufficiently flexible without having the above restrictions. EBSNet is formulated as a reinforced agent that is trained by maximizing rewards provided by a multi-exposure fusion network (MEFNet). By utilizing the illumination and semantic information extracted from just a single auto-exposure preview image, EBSNet can select an optimal exposure bracketing for multi-exposure fusion. EBSNet and MEFNet can be jointly trained to produce favorable results against recent state-of-the-art approaches. To facilitate future research, we provide a new benchmark dataset for multi-exposure selection and fusion.

preprint2020arXiv

Measurement of Singly Cabibbo-Suppressed Decays $D \to ωππ$

Using 2.93 fb$^{-1}$ of $e^{+}e^{-}$ collision data taken at a center-of-mass energy of 3.773 GeV by the BESIII detector at the BEPCII, we measure the branching fractions of the singly Cabibbo-suppressed decays $D \to ωππ$ to be $\mathcal{B}(D^0 \to ωπ^+π^-) = (1.33 \pm 0.16 \pm 0.12)\times 10^{-3}$ and $\mathcal{B}(D^+ \to ωπ^+π^0) =(3.87 \pm 0.83 \pm 0.25)\times 10^{-3}$, where the first uncertainties are statistical and the second ones systematic. The statistical significances are $12.9σ$ and $7.7 σ$, respectively. The precision of $\mathcal{B}(D^0 \to ωπ^+π^-)$ is improved by a factor of 2.1 over the CLEO measurement, and $\mathcal{B}(D^+ \to ωπ^+π^0)$ is measured for the first time. No significant signal of $\mathcal{B}(D^0 \to ωπ^0π^0)$ is observed, and the upper limit on the branching fraction is $\mathcal{B}(D^0 \to ωπ^0π^0) < 1.10 \times 10^{-3}$ at the $90\%$ confidence level. The branching fractions of $D\to ηππ$ are also measured and consistent with existing results.

preprint2020arXiv

Measurement of the Born Cross Sections for $e^+e^-\to D_s^+ D_{s1}(2460)^- +c.c.$ and $e^+e^-\to D_s^{\ast +} D_{s1}(2460)^- +c.c.$

The processes $e^+e^-\to D_s^+ D_{s1}(2460)^- +c.c.$ and $e^+e^-\to D_s^{\ast +} D_{s1}(2460)^- +c.c.$ are studied for the first time using data samples collected with the BESIII detector at the BEPCII collider. The Born cross sections of $e^+e^-\to D_s^+ D_{s1}(2460)^- +c.c.$ at nine center-of-mass energies between 4.467\,GeV and 4.600\,GeV and those of $e^+e^-\to D_s^{\ast +} D_{s1}(2460)^- +c.c.$ at ${\sqrt s}=$ 4.590\,GeV and 4.600\,GeV are measured. No obvious charmonium or charmonium-like structure is seen in the measured cross sections.

preprint2020arXiv

Meta Diagram based Active Social Networks Alignment

Network alignment aims at inferring a set of anchor links matching the shared entities between different information networks, which has become a prerequisite step for effective fusion of multiple information networks. In this paper, we will study the network alignment problem to fuse online social networks specifically. Social network alignment is extremely challenging to address due to several reasons, i.e., lack of training data, network heterogeneity and one-to-one constraint. Existing network alignment works usually require a large number of training data, but such a demand can hardly be met in applications, as manual anchor link labeling is extremely expensive. Significantly different from other homogeneous network alignment works, information in online social networks is usually of heterogeneous categories, the incorporation of which in model building is not an easy task. Furthermore, the one-to-one cardinality constraint on anchor links renders their inference process intertwistingly correlated. To resolve these three challenges, a novel network alignment model, namely ActiveIter, is introduced in this paper. ActiveIter defines a set of inter-network meta diagrams for anchor link feature extraction, adopts active learning for effective label query and uses greedy link selection for anchor link cardinality filtering. Extensive experiments are conducted on real-world aligned networks datasets, and the experimental results have demonstrated the effectiveness of ActiveIter compared with other state-of-the-art baseline methods.

preprint2020arXiv

Observation of a resonant structure in $e^{+}e^{-} \to ωη$ and another in $e^{+}e^{-} \to ωπ^{0}$ at center-of-mass energies between 2.00 and 3.08 GeV

Born cross sections for the processes $e^+e^- \to ωη$ and $e^+e^- \to ωπ^{0}$ have been determined for center-of-mass energies between 2.00 and 3.08 GeV with the BESIII detector at the BEPCII collider. The results obtained in this work are consistent with previous measurements but with improved precision. Two resonant structures are observed. In the $e^{+}e^{-} \to ωη$ cross sections, a resonance with a mass of $(2179 \pm 21 \pm 3)\text{MeV}/c^2$ and a width of $(89 \pm 28 \pm 5)\text{MeV}$ is observed with a significance of 6.1$σ$. Its properties are consistent with the $ϕ(2170)$. In the $e^{+}e^{-} \toωπ^{0}$ cross sections, a resonance denoted $Y(2040)$ is observed with a significance of more than 10$σ$. Its mass and width are determined to be $(2034 \pm 13 \pm 9)\text{MeV}/c^2$ and $(234 \pm 30 \pm 25)\text{MeV}$, respectively, where the first uncertainties are statistical and the second ones are systematic.

preprint2020arXiv

Observation of a structure in $e^+e^- \to ϕη^{\prime}$ at $\sqrt{s}$ from 2.05 to 3.08 GeV

The process $e^{+}e^{-} \to ϕη^{\prime}$ has been studied for the first time in detail using data sample collected with the BESIII detector at the BEPCII collider at center of mass energies from 2.05 to 3.08 GeV. A resonance with quantum numbers $J^{PC}=1^{--}$ is observed with mass $M$ = (2177.5 $\pm$ 4.8 (stat) $\pm$ 19.5 (syst)) MeV/${ \it{c}^{\mathrm{2}}}$ and width $Γ$ = (149.0 $\pm$ 15.6 (stat) $\pm$ 8.9 (syst)) MeV with a statistical significance larger than 10$σ$. The observed structure could be identified with the $ϕ(2170)$, then the ratio of partial width between the $ϕη^{\prime}$ by BESIII and $ϕη$ by BABAR is ($\mathcal{B}^{R}_{ϕη}Γ^{R}_{ee})/{(\mathcal{B}^{R}_{ϕη^{\prime}}Γ^{R}_{ee})}$ = 0.23 $\pm$ 0.10 (stat) $\pm$ 0.18 (syst), which is smaller than the prediction of the $s\bar{s}g$ hybrid models by several orders of magnitude.

preprint2020arXiv

Observation of the $Y(4220)$ and $Y(4360)$ in the process $e^{+}e^{-} \to ηJ/ψ$

The cross sections of the process $e^{+}e^{-} \to ηJ/ψ$ at center-of-mass energies ($\sqrt{s}$) between 3.81 and 4.60 GeV are measured with high precision by using data samples collected with the BESIII detector operating at the BEPCII storage ring. Three structures are observed by analyzing the lineshape of the measured cross sections, and a maximum-likelihood fit including three resonances is performed by assuming the lowest lying structure is the $ψ(4040)$. For the other resonances, we obtain masses of $(4218.7 \pm 4.0 \pm 2.5)$ and $(4380.4 \pm 14.2 \pm 1.8)$ MeV/c$^{2}$ with corresponding widths of $(82.5 \pm 5.9 \pm 0.5)$ and $(147.0 \pm 63.0 \pm 25.8)$ MeV, respectively, where the first uncertainties are statistical and the second ones systematic. The measured resonant parameters are consistent with those of the $Y(4220)$ and $Y(4360)$ from pr evious measurements of different final states. For the first time, we observe the decays of the $Y(4220)$ and $Y(4360)$ into $ηJ/ψ$ final states.

preprint2020arXiv

Physics-Based Generative Adversarial Models for Image Restoration and Beyond

We present an algorithm to directly solve numerous image restoration problems (e.g., image deblurring, image dehazing, image deraining, etc.). These problems are highly ill-posed, and the common assumptions for existing methods are usually based on heuristic image priors. In this paper, we find that these problems can be solved by generative models with adversarial learning. However, the basic formulation of generative adversarial networks (GANs) does not generate realistic images, and some structures of the estimated images are usually not preserved well. Motivated by an interesting observation that the estimated results should be consistent with the observed inputs under the physics models, we propose a physics model constrained learning algorithm so that it can guide the estimation of the specific task in the conventional GAN framework. The proposed algorithm is trained in an end-to-end fashion and can be applied to a variety of image restoration and related low-level vision problems. Extensive experiments demonstrate that our method performs favorably against the state-of-the-art algorithms.

preprint2020arXiv

Probing efficient n-type lanthanide dopants for Mg$_3$Sb$_2$ thermoelectrics

The recent discovery of n-type Mg$_3$Sb$_2$ thermoelectric has ignited intensive research activities on searching for potential n-type dopants for this material. Using first-principles defect calculations, here we conduct a systematic computational screening of potential efficient n-type lanthanide dopants for Mg$_3$Sb$_2$. In addition to La, Ce, Pr, and Tm, we find that high electron concentration ($\geq$ 10$^{20}$ cm$^{-3}$ at the growth temperature of 900 K) can be achieved by doping on the Mg sites with Nd, Gd, Ho, and Lu, which are generally more efficient than other lanthanide dopants and the anion-site dopant Te. Experimentally, we confirm Nd and Tm as effective n-type dopants for Mg$_3$Sb$_2$ since doping with Nd and Tm shows superior thermoelectric figure of merit zT $\geq$ 1.3 with higher electron concentration than doping with Te. Through codoping with Nd (Tm) and Te, simultaneous power factor improvement and thermal conductivity reduction are achieved. As a result, we obtain high zT values of about 1.65 and 1.75 at 775 K in n-type Mg$_{3.5}$Nd$_{0.04}$Sb$_{1.97}$Te$_{0.03}$ and Mg$_{3.5}$Tm$_{0.03}$Sb$_{1.97}$Te$_{0.03}$, respectively, which are among the highest values for n-type Mg$_3$Sb$_2$ without alloying with Mg$_3$Bi$_2$. This work sheds light on exploring promising n-type dopants for the design of Mg$_3$Sb$_2$ thermoelectrics.

preprint2020arXiv

Scalable Heterogeneous Social Network Alignment through Synergistic Graph Partition

Social network alignment has been an important research problem for social network analysis in recent years. With the identified shared users across networks, it will provide researchers with the opportunity to achieve a more comprehensive understanding of users' social activities both within and across networks. Social network alignment is a very difficult problem. Besides the challenges introduced by the network heterogeneity, the network alignment problem can be reduced to a combinatorial optimization problem with an extremely large search space. The learning effectiveness and efficiency of existing alignment models will be degraded significantly as the network size increases. In this paper, we will focus on studying the scalable heterogeneous social network alignment problem, and propose to address it with a novel two-stage network alignment model, namely \textbf{S}calable \textbf{H}eterogeneous \textbf{N}etwork \textbf{A}lignment (SHNA). Based on a group of intra- and inter-network meta diagrams, SHNA first partitions the social networks into a group of sub-networks synergistically. Via the partially known anchor links, SHNA will extract the partitioned sub-network correspondence relationships. Instead of aligning the complete input network, SHNA proposes to identify the anchor links between the matched sub-network pairs, while those between the unmatched sub-networks will be pruned to effectively shrink the search space. Extensive experiments have been done to compare SHNA with the state-of-the-art baseline methods on a real-world aligned social networks dataset. The experimental results have demonstrated both the effectiveness and efficiency of the {\our} model in addressing the problem.

preprint2020arXiv

Search for New Hadronic Decays of $h_c$ and Observation of $h_c\rightarrow K^{+}K^{-}π^{+}π^{-}π^{0}$

Ten hadronic final states of the $h_c$ decays are investigated via the process $ψ(3686)\rightarrow π^0 h_c$, using a data sample of $(448.1 \pm 2.9) \times 10^6$ $ψ(3686)$ events collected with the BESIII detector. The decay channel $h_c\rightarrow K^{+}K^{-}π^{+}π^{-}π^{0}$ is observed for the first time with a significance of $6.0 σ$. The corresponding branching fraction is determined to be $\mathcal{B}(h_c\rightarrow K^{+}K^{-}π^{+}π^{-}π^{0}) =(3.3 \pm 0.6 \pm 0.6)\times 10^{-3}$ (the first uncertainty is statistical and the second systematical). Evidence for the decays $h_c\rightarrow π^{+} π^{-} π^{0} η$ and $h_c\rightarrow K^{0}_{S}K^{\pm}π^{\mp}π^{+}π^{-}$ is found with a significance of $3.6 σ$ and $3.8 σ$, respectively. The corresponding branching fractions (and upper limits) are obtained to be $\mathcal{B}(h_c\rightarrow π^{+} π^{-} π^{0} η) =(7.2 \pm 1.8 \pm 1.3)\times 10^{-3}$ $(< 1.8 \times 10^{-2})$ and $\mathcal{B}(h_c\rightarrow K^{0}_{S}K^{\pm}π^{\mp}π^{+}π^{-}) =(2.8 \pm 0.9 \pm 0.5)\times 10^{-3}$ $(<4.7\times 10^{-3})$. Upper limits on the branching fractions for the final states $h_c \rightarrow K^{+}K^{-}π^{0}$, $K^{+}K^{-}η$, $K^{+}K^{-}π^{+}π^{-}η$, $2(K^{+}K^{-})π^{0}$, $K^{+}K^{-}π^{0}η$, $K^{0}_{S}K^{\pm}π^{\mp}$, and $p\bar{p}π^{0}π^{0}$ are determined at a confidence level of 90\%.

preprint2020arXiv

Search for the decay $J/ψ\toγ+ \rm {invisible}$

We search for $J/ψ$ radiative decays into a weakly interacting neutral particle, namely an invisible particle, using the $J/ψ$ produced through the process $ψ(3686)\toπ^+π^-J/ψ$ in a data sample of $(448.1\pm2.9)\times 10^6$ $ψ(3686)$ decays collected by the BESIII detector at BEPCII. No significant signal is observed. Using a modified frequentist method, upper limits on the branching fractions are set under different assumptions of invisible particle masses up to 1.2 $\mathrm{\ Ge\kern -0.1em V}/c^2$. The upper limit corresponding to an invisible particle with zero mass is 7.0$\times 10^{-7}$ at the 90\% confidence level.

preprint2020arXiv

Search for the semileptonic decay $D^{0(+)}\to b_1(1235)^{-(0)} e^+ν_e$

Using $2.93~\mathrm{fb}^{-1}$ of $e^+e^-$ annihilation data collected at a center-of-mass energy $\sqrt{s}=3.773$ GeV with the BESIII detector operating at the BEPCII collider, we search for the semileptonic $D^{0(+)}$ decays into a $b_1(1235)^{-(0)}$ axial-vector meson for the first time. No significant signal is observed for either charge combination. The upper limits on the product branching fractions are ${\mathcal B}_{D^0\to b_1(1235)^- e^+ν_e}\cdot {\mathcal B}_{b_1(1235)^-\to ωπ^-}<1.12\times 10^{-4}$ and ${\mathcal B}_{D^+\to b_1(1235)^0 e^+ν_e}\cdot {\mathcal B}_{b_1(1235)^0\to ωπ^0}<1.75\times 10^{-4}$ at the 90\% confidence level.

preprint2020arXiv

Segmented Graph-Bert for Graph Instance Modeling

In graph instance representation learning, both the diverse graph instance sizes and the graph node orderless property have been the major obstacles that render existing representation learning models fail to work. In this paper, we will examine the effectiveness of GRAPH-BERT on graph instance representation learning, which was designed for node representation learning tasks originally. To adapt GRAPH-BERT to the new problem settings, we re-design it with a segmented architecture instead, which is also named as SEG-BERT (Segmented GRAPH-BERT) for reference simplicity in this paper. SEG-BERT involves no node-order-variant inputs or functional components anymore, and it can handle the graph node orderless property naturally. What's more, SEG-BERT has a segmented architecture and introduces three different strategies to unify the graph instance sizes, i.e., full-input, padding/pruning and segment shifting, respectively. SEG-BERT is pre-trainable in an unsupervised manner, which can be further transferred to new tasks directly or with necessary fine-tuning. We have tested the effectiveness of SEG-BERT with experiments on seven graph instance benchmark datasets, and SEG-BERT can out-perform the comparison methods on six out of them with significant performance advantages.

preprint2020arXiv

Study of BESIII Trigger Efficiencies with the 2018 $J/ψ$ Data

Using a dedicated data sample taken in 2018 on the $J/ψ$ peak, we perform a detailed study of the trigger efficiencies of the BESIII detector. The efficiencies are determined from three representative physics processes, namely Bhabha-scattering, dimuon production and generic hadronic events with charged particles. The combined efficiency of all active triggers approaches $100\%$ in most cases with uncertainties small enough as not to affect most physics analyses.

preprint2020arXiv

Study of open-charm decays and radiative transitions of the X(3872)

The processes $X(3872)\to D^{*0}\bar{D^{0}}+c.c.,~γJ/ψ,~γψ(2S),$ and $γD^{+}D^{-}$ are searched for in a $9.0~\rm fb^{-1}$ data sample collected at center-of-mass energies between $4.178$ and $4.278$ GeV with the BESIII detector. We observe $X(3872)\to D^{*0}\bar{D^{0}}+c.c.$ and find evidence for $X(3872)\toγJ/ψ$ with statistical significances of $7.4σ$ and $3.5σ$, respectively. No evident signals for $X(3872)\toγψ(2S)$ and $γD^{+}D^{-}$ are found, and upper limit on the relative branching ratio $R_{γψ} \equiv\frac{\mathcal{B}(X(3872)\toγψ(2S))}{\mathcal{B}(X(3872)\toγJ/ψ)}<0.59$ is set at 90$\%$ confidence level. Measurements of branching ratios relative to decay $X(3872)\toπ^+π^- J/ψ$ are also reported for decays $X(3872)\to D^{*0}\bar{D^{0}}+c.c., ~γψ(2S),~γJ/ψ$, $γD^{+}D^{-}$, as well as the non-$D^{*0}\bar{D}^{0}$ three-body decays $π^0 D^{0}\bar{D}^{0}$ and $γD^{0}\bar{D}^{0}$.

preprint2019arXiv

Continuous-Time Relationship Prediction in Dynamic Heterogeneous Information Networks

Online social networks, World Wide Web, media and technological networks, and other types of so-called information networks are ubiquitous nowadays. These information networks are inherently heterogeneous and dynamic. They are heterogeneous as they consist of multi-typed objects and relations, and they are dynamic as they are constantly evolving over time. One of the challenging issues in such heterogeneous and dynamic environments is to forecast those relationships in the network that will appear in the future. In this paper, we try to solve the problem of continuous-time relationship prediction in dynamic and heterogeneous information networks. This implies predicting the time it takes for a relationship to appear in the future, given its features that have been extracted by considering both heterogeneity and temporal dynamics of the underlying network. To this end, we first introduce a feature extraction framework that combines the power of meta-path-based modeling and recurrent neural networks to effectively extract features suitable for relationship prediction regarding heterogeneity and dynamicity of the networks. Next, we propose a supervised non-parametric approach, called Non-Parametric Generalized Linear Model (NP-GLM), which infers the hidden underlying probability distribution of the relationship building time given its features. We then present a learning algorithm to train NP-GLM and an inference method to answer time-related queries. Extensive experiments conducted on synthetic data and three real-world datasets, namely Delicious, MovieLens, and DBLP, demonstrate the effectiveness of NP-GLM in solving continuous-time relationship prediction problem vis-a-vis competitive baselines

preprint2018arXiv

Relating chemical bonding to physical properties: The origin of unexpected isotropic properties in layered materials

Layered materials span a very broad range of solids ranging from van der Waals materials to highly complex crystal structures such as clays. They are commonly believed to have highly anisotropic properties, which is essentially attributed to weak interlayer interactions. The layered Mg3Sb2 structure is currently being intensely scrutinized due to its outstanding thermoelectric properties. Based on quantitative chemical bonding analysis we unravel that Mg3Sb2 exhibits a nearly isotropic three-dimensional (3D) bonding network with the interlayer and intralayer bonds being surprisingly similar, and these unique chemical bonding features are the origin of the nearly isotropic structural and thermal properties. The isotropic 3D bonding network is found to be broadly applicable to many Mg-containing compounds with the layered CaAl2Si2-type structure. Intriguingly, a parameter based on the electron density can be used as an indicator measuring the anisotropy of lattice thermal conductivity in layered structures. This work extends our understanding of structure and properties based on chemical bonding analysis, and it will guide the search for, and design of, layered materials with tailored anisotropic properties.

Institution

Affiliation not imported yet

This author record came from a source that does not expose affiliation metadata. Once the author claims the profile or we enrich the record from another provider, this section will link to the concrete institution.

Source provenance

Where this author record came from

arxivconfidence 95%

external id: arxiv:2512.24272:author:1:jiawei-zhang

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2412.08184:author:1:jiawei-zhang

Imported May 21, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2605.13998:author:3:jiawei-zhang

Imported May 20, 2026Synced May 21, 2026

arxivconfidence 95%

external id: arxiv:2605.04808:author:6:jiawei-zhang

Imported May 20, 2026Synced May 20, 2026

arxivconfidence 95%

external id: arxiv:2605.10730:author:45:jiawei-zhang

Imported May 20, 2026Synced May 20, 2026

arxivconfidence 95%

external id: arxiv:2605.12494:author:2:jiawei-zhang

Imported May 20, 2026Synced May 20, 2026

Trust 2154 works

A. Amoroso

Researcher

A. Amoroso contributes to research discovery and scholarly infrastructure.

Open to collaborate

Trust 2154 works

M. Ablikim

Researcher

M. Ablikim contributes to research discovery and scholarly infrastructure.

Open to collaborate

Trust 2154 works

M. N. Achasov

Researcher

M. N. Achasov contributes to research discovery and scholarly infrastructure.

Open to collaborate

Trust 2154 works

O. Bakina

Researcher

O. Bakina contributes to research discovery and scholarly infrastructure.

Open to collaborate

Jiawei Zhang

Quick read

Decide how to stay connected

How to connect with this researcher

Open a focused conversation when the fit is right

See the researcher in context

Building this graph slice

110 published item(s)

DecodingTrust-Agent Platform (DTap): A Controllable and Interactive Red-Teaming Platform for AI Agents

MMViR: A Multi-Modal and Multi-Granularity Representation for Long-range Video Understanding

Mosaic: Unlocking Long-Context Inference for Diffusion LLMs via Global Memory Planning and Dynamic Peak Taming

Qwen-Image-2.0 Technical Report

Revisiting Photometric Ambiguity for Accurate Gaussian-Splatting Surface Reconstruction

Synthetic American Option Pricing via Jump-HMM-Driven Heston Implied Volatility

Virtual-force Based Visual Servo for Multiple Peg-in-Hole Assembly with Tightly Coupled Multi-Manipulator

Local Path Optimization in The Latent Space Using Learned Distance Gradient

Online training and pruning of multi-wavelength photonic neural networks

Contrastive Sequential Interaction Network Learning on Co-Evolving Riemannian Spaces

EPA: Neural Collapse Inspired Robust Out-of-Distribution Detector

Generalized Lagrangian Neural Networks

Investigation of the $ΔI = 1/2$ rule and test of CP violation through the measurement of decay asymmetry parameters in $Ξ^-$ decays

Deep Dynamic Scene Deblurring from Optical Flow

Search for hidden-charm tetraquark with strangeness in $e^{+}e^{-}\rightarrow K^+ D_{s}^{*-} D^{*0}+c.c.$

TI-CNN: Convolutional Neural Networks for Fake News Detection

A Comprehensive Survey with Quantitative Comparison of Image Analysis Methods for Microorganism Biovolume Measurements

A State-of-the-art Survey of Object Detection Techniques in Microorganism Image Analysis: From Classical Methods to Deep Learning Approaches

Amplitude analysis and branching fraction measurement of the decay $D_{s}^{+} \to K^+π^+π^-$

Amplitude analysis and branching-fraction measurement of $D_{s}^{+} \to π^{+}π^{0}η^{\prime}$

An application of Pixel Interval Down-sampling (PID) for dense tiny microorganism counting on environmental microorganism images

Applications of Artificial Neural Networks in Microorganism Image Analysis: A Comprehensive Review from Conventional Multilayer Perceptron to Popular Convolutional Neural Network and Potential Visual Transformer

CARE: Certifiably Robust Learning with Reasoning via Variational Inference

Cross section measurements of the processes $e^+e^- \rightarrow ωπ^{0}$ and $ωη$ at center-of-mass energies between 3.773 and 4.701 GeV

Decentralized Non-Convex Learning with Linearly Coupled Constraints

First Observation of the Semileptonic Decay $Λ_c^+\rightarrow pK^- e^+ν_e$

Is a Classification Procedure Good Enough? A Goodness-of-Fit Assessment Tool for Classification Learning

Iso-CapsNet: Isomorphic Capsule Network for Brain Graph Representation Learning

Measurement of $e^{+}e^{-} \to K^{+}K^{-}π^{0}$ cross section and observation of a resonant structure

Measurement of $Λ$ baryon polarization in $e^+e^-\rightarrowΛ\barΛ$ at $\sqrt{s} = 3.773$ GeV

Measurement of the $D \to K^-π^+π^+π^-$ and $D \to K^-π^+π^0$ coherence factors and average strong-phase differences in quantum-correlated ${D\bar{D}}$ decays

Measurement of the branching fraction and decay asymmetry of $Λ\to nγ$

Measurement of the branching fraction for $ψ(3686)\to ωK^0_SK^0_S$

Measurement of the branching fraction of the doubly Cabibbo-suppressed decay $D^0\to K^+π^-π^0$ and search for $D^0\to K^+π^-π^0π^0$

Measurement of the Cross Section for $e^{+}e^{-}\to$ hadrons at Energies from 2.2324 to 3.6710 GeV

Measurement of the cross section of $e^{+}e^{-}\toηπ^{+}π^{-}$ at center-of-mass energies from 3.872 GeV to 4.700 GeV

Measurement of the total and leptonic decay widths of the $J/ψ$ resonance with an energy scan method at BESIII

Measurements of Absolute Branching Fractions of $D^0\to K_L^0ϕ$, $K_L^0η$, $K_L^0ω$, and $K_L^0η^{\prime}$

Measurements of the absolute branching fractions of hadronic $D$-meson decays involving kaons and pions

Observation of $a_0(1710)^+ \to K_S^0K^+$ in study of the $D_s^+\to K_S^0K^+π^0$ decay

Observation of $η_c(2S) \to 3(π^+π^-)$ and measurements of $χ_{cJ} \to 3(π^+π^-)$ in $ψ(3686)$ radiative transitions

Observation of resonance structures in $e^+e^-\to π^+π^-ψ_2(3823)$ and mass measurement of $ψ_2(3823)$

Observation of the double Dalitz decay $η&#39;\to e^+e^-e^+e^-$

Observation of the electromagnetic Dalitz decay $D^{\ast 0}\to D^{0}e^{+}e^{-}$

Observation of the Singly Cabibbo-Suppressed Decay $Λ_{c}^{+} \to nπ^{+}$

Partial wave analysis of $J/ψ\to γη^{\prime} η^{\prime}$

PERFECT: A Hyperbolic Embedding for Joint User and Community Alignment

Realization of bound states in the continuum in anti-PT-symmetric optical systems

RestoreFormer: High-Quality Blind Face Restoration from Undegraded Key-Value Pairs

Revisiting Domain Generalized Stereo Matching Networks from a Feature Consistency Perspective

Search for $X(3872)\toπ^0χ_{c0}$ and $X(3872)\toππχ_{c0}$ at BESIII

Search for baryon and lepton number violating decays $D^{0}\to \bar{p}e^{+}$ and $D^{0}\to pe^{-}$

Search for baryon and lepton number violation decay $D^{\pm}\to n(\bar{n})e^{\pm}$

Search for invisible decays of the $Λ$ baryon

Search for new hadronic decays of $h_{c}$ and observation of $h_{c}\to p\bar{p}η$

Search for the decay $D^{0} \to π^{0} ν\barν$

Search for the decay $h_c\rightarrowπ^0J/ψ$

Self-recoverable Adversarial Examples: A New Effective Protection Mechanism in Social Networks

Targeted Cross-Validation

TOD-CNN: An Effective Convolutional Neural Network for Tiny Object Detection in Sperm Videos

VPNets: Volume-preserving neural networks for learning source-free dynamics

What is a Good Metric to Study Generalization of Minimax Learners?

A SARS-CoV-2 Microscopic Image Dataset with Ground Truth Images and Visual Features

Adversarial Active Learning based Heterogeneous Graph Neural Network for Fake News Detection

Cross section measurements of the $e^+e^-\to D^{*+}D^{*-}$ and $e^+e^-\to D^{*+}D^{-}$ processes at center-of-mass energies from 4.085 to 4.600 GeV

Cross sections for the reactions $e^+e^-\rightarrow K^+K^-π^+π^-(π^0)$, $K^+K^-K^+K^-(π^0)$, $π^+π^-π^+π^-(π^0)$, $p\bar{p}π^+π^-(π^0)$ in the energy region between 3.773 and 4.600 GeV

Fake News Detection on News-Oriented Heterogeneous Information Networks through Hierarchical Graph Attention

Label Contrastive Coding based Graph Neural Network for Graph Classification

Measurement of Branching Fractions of $J/ψ$ and $ψ(3686)$ decays to $Σ^{+}$ and $\overlineΣ^-$

Measurement of cross-section for $e^+e^-\toΞ^-\barΞ^+$ near threshold at BESIII

Measurement of the $e^{+}e^{-}\toΣ^{0}\barΣ^{0}$ cross sections at center-of-mass energies from $2.3864$ to $3.0200$ GeV

Measurements of $e^+e^-\rightarrow η_{\rm c}π^+ π^-π^0$, $η_{\rm c}π^+ π^-$ and $η_{\rm c}π^0γ$ at $\sqrt{s}$ from 4.18 to 4.60\,GeV, and search for a $Z_{\rm c}$ state close to the $D\bar{D}$ threshold decaying to $η_{\rm c}π$ at $\sqrt{s}$ = 4.23 GeV

Search for hidden-charm tetraquark with strangeness in $e^{+}e^{-}\rightarrow K^+ D_{s}^{-} D^{0}+c.c.$

Observation of the double Dalitz decay $η'\to e^+e^-e^+e^-$

Cross section measurements of the $e^+e^-\to D^{+}D^{-}$ and $e^+e^-\to D^{*+}D^{-}$ processes at center-of-mass energies from 4.085 to 4.600 GeV

Erratum to "Measurement of the $e^+e^-\toπ^+π^-$ cross section between 600 and 900 MeV using initial state radiation"