arXiv subjects

Yu Chen

Publications and source records attributed to Yu Chen.

At least 235 records · Page 13Linked to original sources

arXiv2025

Nearly Complete Segregation of Submerged Grains in a Rotating Drum

Density-driven segregations, extensively studied in a simple rotating drum, are enriched with a wide range of underlying physics. Diverse symmetrical segregation patterns formed by mixing two types of dry mono-sized grains have been revealed due to variations in heavy and light grain densities, $ρ_h$ and $ρ_l$, and rotating speeds, $ω$. We engender experimentally a nearly complete segregation, not occurring in dry conditions of the same $ρ_h$, $ρ_l$, and $ω$, in submerged states. Further, based on the experiment-validated simulations, using coupled computational fluid dynamics and discrete element method, it is found the mixing index can be well predicted over a wide parameter space in the effective density ratio, $D=(ρ_h-ρ_f)/(ρ_l-ρ_f)$ with $ρ_f$ being the fluid density. Specifically, with increasing $D$ well-mixed states transit to fully-segregated states with a rising number of vortices and severer asymmetrical patterns. When the global Reynolds number $\mathrm{Re}_g$ is enlarged, the vortex area of heavy particles shrinks for lower $D$, while the area of light particles gradually saturates; meanwhile, for higher $D$ a new vortex with a continuously expanded area can be encountered in the light particle zone. These results improve our understanding of segregation transitions especially in submerged granular systems and shed new light on various science and engineering practices.

cond-mat.soft↗

arXiv2025

A double-layer placement algorithm for integrated circuit-based modules on printed circuit board

Considering that the physical design of printed circuit board (PCB) follows the principle of modularized design, this paper proposes an automatic placement algorithm for functional modules. We first model the placement problem as a mixed-variable optimization problem, and then, developed tailored algorithms of global placement and legalization for the top-layer centralized placement subproblem and the bottom-layer pin-oriented placement subproblem. Numerical comparison demonstrates that the proposed mixed-variable optimization scheme can get optimized total wirelength of placement. Meanwhile, experimental results on several industrial PCB cases show that the developed centralized strategies can well accommodate the requirement of top-layer placement, and the pin-oriented global placement based on bin clustering contributes to optimized placement results meeting the requirement of pin-oriented design.

cs.OH↗

arXiv2025

Potential to identify neutrino mass ordering with reactor antineutrinos at JUNO

The Jiangmen Underground Neutrino Observatory (JUNO) is a multi-purpose neutrino experiment under construction in South China. This paper presents an updated estimate of JUNO's sensitivity to neutrino mass ordering using the reactor antineutrinos emitted from eight nuclear reactor cores in the Taishan and Yangjiang nuclear power plants. This measurement is planned by studying the fine interference pattern caused by quasi-vacuum oscillations in the oscillated antineutrino spectrum at a baseline of 52.5~km and is completely independent of the CP violating phase and neutrino mixing angle $θ_{23}$. The sensitivity is obtained through a joint analysis of JUNO and Taishan Antineutrino Observatory (TAO) detectors utilizing the best available knowledge to date about the location and overburden of the JUNO experimental site, local and global nuclear reactors, JUNO and TAO detector responses, expected event rates and spectra of signals and backgrounds, and systematic uncertainties of analysis inputs. We find that a 3$σ$ median sensitivity to reject the wrong mass ordering hypothesis can be reached with an exposure to approximately 6.5 years $\times$ 26.6 GW thermal power.

hep-ex↗

arXiv2025

VERITAS and multiwavelength observations of the Blazar B3 2247+381 in response to an IceCube neutrino alert

While the sources of the diffuse astrophysical neutrino flux detected by the IceCube Neutrino Observatory are still largely unknown, one of the promising methods used towards understanding this is investigating the potential temporal and spatial correlations between neutrino alerts and the electromagnetic radiation from blazars. We report on the multiwavelength target-of-opportunity observations of the blazar B3 2247+381, taken in response to an IceCube multiplet alert for a cluster of muon neutrino events compatible with the source location between May 20, 2022 and November 10, 2022. B3 2247+381 was not detected with VERITAS during this time period. The source was found to be in a low-flux state in the optical, ultraviolet and gamma-ray bands for the time interval corresponding to the neutrino event, but was detected in the hard X-ray band with NuSTAR during this period. We find the multiwavelength spectral energy distribution is well described using a simple one-zone leptonic synchrotron self-Compton radiation model. Moreover, assuming the neutrinos originate from hadronic processes within the jet, the neutrino flux would be accompanied by a photon flux from the cascade emission, and the integrated photon flux required in such a case would significantly exceed the total multiwavelength fluxes and the VERITAS upper limits presented here. The lack of flaring activity observed with VERITAS, combined with the low multiwavelength flux levels, and given the significance of the neutrino excess is at 3$σ$ level (uncorrected for trials), makes B3 2247+381 an unlikely source of the IceCube multiplet. We conclude that the neutrino excess is likely a background fluctuation.

astro-ph.HE↗

arXiv2025

An in-depth study of Gamma rays from the Starburst Galaxy M 82 with VERITAS

Assuming Galactic cosmic rays originate in supernovae and the winds of massive stars, starburst galaxies should produce very-high-energy (VHE; E$>$100 GeV) gamma-ray emission via the interaction of their copious quantities of cosmic rays with the large reservoirs of dense gas within the galaxies. Such VHE emission was detected by VERITAS from the starburst galaxy M 82 in 2008-09. An extensive, multi-year campaign followed these initial observations, yielding a total of 254 h of good quality VERITAS data on M 82. Leveraging modern analysis techniques and the larger exposure, these VERITAS data show a more statistically significant VHE signal ($\sim$6.5 standard deviations ($σ$)). The corresponding photon spectrum is well fit by a power law ($Γ= 2.3 \pm 0.3_{stat} \pm0.2_{sys}$) and the observed integral flux is F($>$450 GeV) = $(3.2 \pm0.6_{stat} \pm 0.6_{sys}) \times 10^{-13}~\mathrm{cm^{-2}~s}^{-1}$, or $\sim$0.4\% of the Crab Nebula flux above the same energy threshold. The improved VERITAS measurements, when combined with various multi-wavelength data, enable modeling of the underlying emission and transport processes. A purely leptonic scenario is found to be a poor representation of the gamma-ray spectral energy distribution (SED). A lepto-hadronic scenario with cosmic rays following a power-law spectrum in momentum (index $s\simeq 2.25$), and with significant bremsstrahlung below $1$~GeV, provides a good match to the observed SED. The synchrotron emission from the secondary electrons indicates that efficient non-radiative losses of cosmic-ray electrons may be related to advective escape from the starburst core.

astro-ph.HE↗

arXiv2025

Prediction of Energy Resolution in the JUNO Experiment

This paper presents an energy resolution study of the JUNO experiment, incorporating the latest knowledge acquired during the detector construction phase. The determination of neutrino mass ordering in JUNO requires an exceptional energy resolution better than 3\% at 1~MeV. To achieve this ambitious goal, significant efforts have been undertaken in the design and production of the key components of the JUNO detector. Various factors affecting the detection of inverse beta decay signals have an impact on the energy resolution, extending beyond the statistical fluctuations of the detected number of photons, such as the properties of the liquid scintillator, performance of photomultiplier tubes, and the energy reconstruction algorithm. To account for these effects, a full JUNO simulation and reconstruction approach is employed. This enables the modeling of all relevant effects and the evaluation of associated inputs to accurately estimate the energy resolution. The results of study reveal an energy resolution of 2.95\% at 1~MeV. Furthermore, this study assesses the contribution of major effects to the overall energy resolution budget. This analysis serves as a reference for interpreting future measurements of energy resolution during JUNO data collection. Moreover, it provides a guideline for comprehending the energy resolution characteristics of liquid scintillator-based detectors.

hep-ex↗

arXiv2025

Molecular HDD Logic for Encrypted Massive Data Storage

Organic memories, with small dimension, fast speed and long retention features, are considered as promising candidates for massive data archiving. In order to satisfy the re-quirements for ultra-low power and high-security information storage, we design a concep-tual molecular hard-disk (HDD) logic scheme that is capable to execute in-situ encryption of massive data in pW/bit power-consumption range. Beneficial from the coupled mechanism of counter-balanced redox reaction and local ion drifting, the basic HDD unit consisting of ~ 200 self-assembled RuXLPH molecules in a monolayer (SAM) configuration undergoes unique conductance modulation with continuous, symmetric and low-power switching char-acteristics. 96-state memory performance, which allows 6-bit data storage and single-unit one-step XOR operation, is realized in the RuXLPH SAM sample. Through single-unit XOR manipulation of the pixel information, in-situ bitwise encryption of the Mogao Grottoes mural images stored in the molecular HDD is demonstrated.

cs.ET↗

arXiv2025

A Pioneering Neural Network Method for Efficient and Robust Fluid Simulation

Fluid simulation is an important research topic in computer graphics (CG) and animation in video games. Traditional methods based on Navier-Stokes equations are computationally expensive. In this paper, we treat fluid motion as point cloud transformation and propose the first neural network method specifically designed for efficient and robust fluid simulation in complex environments. This model is also the deep learning model that is the first to be capable of stably modeling fluid particle dynamics in such complex scenarios. Our triangle feature fusion design achieves an optimal balance among fluid dynamics modeling, momentum conservation constraints, and global stability control. We conducted comprehensive experiments on datasets. Compared to existing neural network-based fluid simulation algorithms, we significantly enhanced accuracy while maintaining high computational speed. Compared to traditional SPH methods, our speed improved approximately 10 times. Furthermore, compared to traditional fluid simulation software such as Flow3D, our computation speed increased by more than 300 times.

cs.CV↗

arXiv2025

OmniChat: Enhancing Spoken Dialogue Systems with Scalable Synthetic Data for Diverse Scenarios

With the rapid development of large language models, researchers have created increasingly advanced spoken dialogue systems that can naturally converse with humans. However, these systems still struggle to handle the full complexity of real-world conversations, including audio events, musical contexts, and emotional expressions, mainly because current dialogue datasets are constrained in both scale and scenario diversity. In this paper, we propose leveraging synthetic data to enhance the dialogue models across diverse scenarios. We introduce ShareChatX, the first comprehensive, large-scale dataset for spoken dialogue that spans diverse scenarios. Based on this dataset, we introduce OmniChat, a multi-turn dialogue system with a heterogeneous feature fusion module, designed to optimize feature selection in different dialogue contexts. In addition, we explored critical aspects of training dialogue systems using synthetic data. Through comprehensive experimentation, we determined the ideal balance between synthetic and real data, achieving state-of-the-art results on the real-world dialogue dataset DailyTalk. We also highlight the crucial importance of synthetic data in tackling diverse, complex dialogue scenarios, especially those involving audio and music. For more details, please visit our demo page at \url{https://sharechatx.github.io/}.

cs.CL↗

arXiv2024

Image Quality Assessment: Investigating Causal Perceptual Effects with Abductive Counterfactual Inference

Existing full-reference image quality assessment (FR-IQA) methods often fail to capture the complex causal mechanisms that underlie human perceptual responses to image distortions, limiting their ability to generalize across diverse scenarios. In this paper, we propose an FR-IQA method based on abductive counterfactual inference to investigate the causal relationships between deep network features and perceptual distortions. First, we explore the causal effects of deep features on perception and integrate causal reasoning with feature comparison, constructing a model that effectively handles complex distortion types across different IQA scenarios. Second, the analysis of the perceptual causal correlations of our proposed method is independent of the backbone architecture and thus can be applied to a variety of deep networks. Through abductive counterfactual experiments, we validate the proposed causal relationships, confirming the model's superior perceptual relevance and interpretability of quality scores. The experimental results demonstrate the robustness and effectiveness of the method, providing competitive quality predictions across multiple benchmarks. The source code is available at https://anonymous.4open.science/r/DeepCausalQuality-25BC.

cs.CV↗

arXiv2024

Representation Learning of Daily Movement Data Using Text Encoders

Time-series representation learning is a key area of research for remote healthcare monitoring applications. In this work, we focus on a dataset of recordings of in-home activity from people living with Dementia. We design a representation learning method based on converting activity to text strings that can be encoded using a language model fine-tuned to transform data from the same participants within a $30$-day window to similar embeddings in the vector space. This allows for clustering and vector searching over participants and days, and the identification of activity deviations to aid with personalised delivery of care.

cs.LG↗

arXiv2024

Language model driven: a PROTAC generation pipeline with dual constraints of structure and property

The imperfect modeling of ternary complexes has limited the application of computer-aided drug discovery tools in PROTAC research and development. In this study, an AI-assisted approach for PROTAC molecule design pipeline named LM-PROTAC was developed, which stands for language model driven Proteolysis Targeting Chimera, by embedding a transformer-based generative model with dual constraints on structure and properties, referred to as the DCT. This study utilized the fragmentation representation of molecules and developed a language model driven pipeline. Firstly, a language model driven affinity model for protein compounds to screen molecular fragments with high affinity for the target protein. Secondly, structural and physicochemical properties of these fragments were constrained during the generation process to meet specific scenario requirements. Finally, a two-round screening of the preliminary generated molecules using a multidimensional property prediction model to generate a batch of PROTAC molecules capable of degrading disease-relevant target proteins for validation in vitro experiments, thus achieving a complete solution for AI-assisted PROTAC drug generation. Taking the tumor key target Wnt3a as an example, the LM-PROTAC pipeline successfully generated PROTAC molecules capable of inhibiting Wnt3a. The results show that DCT can efficiently generate PROTAC that targets and hydrolyses Wnt3a.

q-bio.QM↗

arXiv2024

StructRide: A Framework to Exploit the Structure Information of Shareability Graph in Ridesharing

Ridesharing services play an essential role in modern transportation, which significantly reduces traffic congestion and exhaust pollution. In the ridesharing problem, improving the sharing rate between riders can not only save the travel cost of drivers but also utilize vehicle resources more efficiently. The existing online-based and batch-based methods for the ridesharing problem lack the analysis of the sharing relationship among riders, leading to a compromise between efficiency and accuracy. In addition, the graph is a powerful tool to analyze the structure information between nodes. Therefore, in this paper, we propose a framework, namely StructRide, to utilize the structure information to improve the results for ridesharing problems. Specifically, we extract the sharing relationships between riders to construct a shareability graph. Then, we define a novel measurement shareability loss for vehicles to select groups of requests such that the unselected requests still have high probabilities of sharing. Our SARD algorithm can efficiently solve dynamic ridesharing problems to achieve dramatically improved results. Through extensive experiments, we demonstrate the efficiency and effectiveness of our SARD algorithm on two real datasets. Our SARD can run up to 72.68 times faster and serve up to 50% more requests than the state-of-the-art algorithms.

cs.DB↗

arXiv2024

Enhancing Graph Contrastive Learning with Reliable and Informative Augmentation for Recommendation

Graph neural network(GNN) has been a powerful approach in collaborative filtering(CF) due to its ability to model high-order user-item relationships. Recently, to alleviate the data sparsity and enhance representation learning, many efforts have been conducted to integrate contrastive learning(CL) with GNNs. Despite the promising improvements, the contrastive view generation based on structure and representation perturbations in existing methods potentially disrupts the collaborative information in contrastive views, resulting in limited effectiveness of positive alignment. To overcome this issue, we propose CoGCL, a novel framework that aims to enhance graph contrastive learning by constructing contrastive views with stronger collaborative information via discrete codes. The core idea is to map users and items into discrete codes rich in collaborative information for reliable and informative contrastive view generation. To this end, we initially introduce a multi-level vector quantizer in an end-to-end manner to quantize user and item representations into discrete codes. Based on these discrete codes, we enhance the collaborative information of contrastive views by considering neighborhood structure and semantic relevance respectively. For neighborhood structure, we propose virtual neighbor augmentation by treating discrete codes as virtual neighbors, which expands an observed user-item interaction into multiple edges involving discrete codes. Regarding semantic relevance, we identify similar users/items based on shared discrete codes and interaction targets to generate the semantically relevant view. Through these strategies, we construct contrastive views with stronger collaborative information and develop a triple-view graph contrastive learning approach. Extensive experiments on four public datasets demonstrate the effectiveness of our proposed approach.

cs.IR↗

arXiv2024

On the thresholds of degenerate hypergraphs

An $n$-vertex $k$-uniform hypergraph $G$ is $(d,α)$-degenerate if $m_1(G)\le{d}$ and there exists a constant $\varepsilon >0$ such that for every subset $U\subseteq{V(G)}$ with size $2\le|U|\le{\varepsilon n}$, we have $e\left(G[U]\right)\le{d\left(|U|-1\right)-α}$. These hypergraphs include many natural graph classes, such as the degenerate hypergraphs, the planar graphs, and the power of cycles. In this paper, we consider the threshold of the emergence of a $(d,α)$-degenerate hypergraph with bounded maximum degree in the Erdős-Rényi model. We show that its threshold is at most $n^{-1/d}$, improving previous results of Riordan and Kelly-Müyesser-Pokrovskiy.

math.CO↗

arXiv2024

The Gestalt Computational Model by Persistent Homology

Widely employed in cognitive psychology, Gestalt theory elucidates basic principles in visual perception. However, the Gestalt principles are validated mainly by psychological experiments, lacking quantitative research supports and theoretical coherence. In this paper, we utilize persistent homology, a mathematical tool in computational topology, to develop a unified computational model for Gestalt principles, addressing the challenges of quantification and computation. On the one hand, the Gestalt computational model presents quantitative supports for Gestalt theory. On the other hand, it shows that the Gestalt principles can be uniformly calculated using persistent homology, thus developing a coherent theory for Gestalt principles in computation. Moreover, it is anticipated that the Gestalt computational model can serve as a significant computational model in the field of computational psychology, and help the understanding of human being visual perception.

cs.CG↗

arXiv2024

Learning Local Control Barrier Functions for Hybrid Systems

Hybrid dynamical systems are ubiquitous as practical robotic applications often involve both continuous states and discrete switchings. Safety is a primary concern for hybrid robotic systems. Existing safety-critical control approaches for hybrid systems are either computationally inefficient, detrimental to system performance, or limited to small-scale systems. To amend these drawbacks, in this paper, we propose a learning-enabled approach to construct local Control Barrier Functions (CBFs) to guarantee the safety of a wide class of nonlinear hybrid dynamical systems. The end result is a safe neural CBF-based switching controller. Our approach is computationally efficient, minimally invasive to any reference controller, and applicable to large-scale systems. We empirically evaluate our framework and demonstrate its efficacy and flexibility through two robotic examples including a high-dimensional autonomous racing case, against other CBF-based approaches and model predictive control.

cs.RO↗

arXiv2024

ZeroGS: Training 3D Gaussian Splatting from Unposed Images

Neural radiance fields (NeRF) and 3D Gaussian Splatting (3DGS) are popular techniques to reconstruct and render photo-realistic images. However, the pre-requisite of running Structure-from-Motion (SfM) to get camera poses limits their completeness. While previous methods can reconstruct from a few unposed images, they are not applicable when images are unordered or densely captured. In this work, we propose ZeroGS to train 3DGS from hundreds of unposed and unordered images. Our method leverages a pretrained foundation model as the neural scene representation. Since the accuracy of the predicted pointmaps does not suffice for accurate image registration and high-fidelity image rendering, we propose to mitigate the issue by initializing and finetuning the pretrained model from a seed image. Images are then progressively registered and added to the training buffer, which is further used to train the model. We also propose to refine the camera poses and pointmaps by minimizing a point-to-camera ray consistency loss across multiple views. Experiments on the LLFF dataset, the MipNeRF360 dataset, and the Tanks-and-Temples dataset show that our method recovers more accurate camera poses than state-of-the-art pose-free NeRF/3DGS methods, and even renders higher quality images than 3DGS with COLMAP poses. Our project page is available at https://aibluefisher.github.io/ZeroGS.

cs.CV↗