arXiv subjects

Ye Yan

Publications and source records attributed to Ye Yan.

29 records · Page 2Linked to original sources

arXiv2023

Prediction of $P_{cc}$ states in quark model

Inspired by the observation of hidden-charm pentaquark $P_c$ and $P_{cs}$ states by the LHCb Collaboration, we explore the $qqc\bar{c}c$ ($q~=~u$ or $d$) pentaquark systems in the quark delocalization color screening model. The interaction between baryons and mesons and the influence of channel coupling are studied in this work. Three compact $qqc\bar{c}c$ pentaquark states are obtained, whose masses are 5259 MeV with $I(J^P)$ = $0(1/2^-)$, 5396 MeV with $I(J^P)$ = $1(1/2^-)$, and 5465 MeV with $I(J^P)$ = $1(3/2^-)$. Two molecular states are obtained, which are $I(J^P)$ = $0(1/2^-)$ $Λ_c J/ψ$ with 5367 MeV and $I(J^P)$ = $0(5/2^-)$ $Ξ_{cc}^* \bar{D}^*$ with 5690 MeV. These predicted states may provide important information for future experimental search.

hep-ph↗

arXiv2023

Exotic $Qq\bar{q}\bar{q}$ states in the chiral quark model

In the framework of the chiral quark model, we investigate the $Qq\bar{q}\bar{q}$ ($Q= c, b$ and $q= u, d$) tetraquark system with two structures: $Q\bar{q}$-$q\bar{q}$ and $Qq$-$\bar{q}\bar{q}$. The bound-state calculation shows that for the single channel, there is no evidence for any bound state below the minimum threshold in both $cq\bar{q}\bar{q}$ and $bq\bar{q}\bar{q}$ systems. However, after coupling all channels of two structures, we obtain a bound state below the minimum threshold in the $cq\bar{q}\bar{q}$ system with the energy of $1998$ MeV, and the quantum number is $IJ^{P}=\frac{1}{2}0^{+}$. Meanwhile, in the $bq\bar{q}\bar{q}$ system, two bound states with energies of $5414$ MeV and $5456$ MeV are obtained, and the quantum numbers are $IJ^{P}=\frac{1}{2}0^{+}$ and $IJ^{P}=\frac{1}{2}1^{+}$, respectively. Besides, we also employe the real-scaling method to search for resonance states in the $cq\bar{q}\bar{q}$ and $bq\bar{q}\bar{q}$ systems. Unfortunately, no genuine resonance states were obtained in both systems. We suggest future experiments to search for these three possible bound states.

hep-ph↗

arXiv2023

Investigating excited $Ω_c$ states from pentaquark perspective

Inspired by the recent observation of new $Ω_c^0$ states by the LHCb Collaboration, we explore the excited $Ω_{c}$ states from the pentaquark perspective in the quark delocalization color screening model. Our results indicate that the $Ω_c(3185)$ can be well interpreted as a molecular $ΞD$ predominated resonance state with $J^P=1/2^-$. The $Ω_c(3120)$ can also be interpreted as a molecular $Ξ_c^* \bar{K}$ state with $J^P=3/2^-$ and a new molecular state $Ξ^*_c \bar{K}^*$ with $J^P=5/2^-$ and a mass of 3527 MeV is predicted, which is worth searching in the future. Other reported $Ω_c$ states cannot be well described in the framework of pentaquark systems in present work. The three-quark excited state, or the unquenched picture may be a good explanation, which is worth further exploration.

hep-ph↗

arXiv2023

Grounded Entity-Landmark Adaptive Pre-training for Vision-and-Language Navigation

Cross-modal alignment is one key challenge for Vision-and-Language Navigation (VLN). Most existing studies concentrate on mapping the global instruction or single sub-instruction to the corresponding trajectory. However, another critical problem of achieving fine-grained alignment at the entity level is seldom considered. To address this problem, we propose a novel Grounded Entity-Landmark Adaptive (GELA) pre-training paradigm for VLN tasks. To achieve the adaptive pre-training paradigm, we first introduce grounded entity-landmark human annotations into the Room-to-Room (R2R) dataset, named GEL-R2R. Additionally, we adopt three grounded entity-landmark adaptive pre-training objectives: 1) entity phrase prediction, 2) landmark bounding box prediction, and 3) entity-landmark semantic alignment, which explicitly supervise the learning of fine-grained cross-modal alignment between entity phrases and environment landmarks. Finally, we validate our model on two downstream benchmarks: VLN with descriptive instructions (R2R) and dialogue instructions (CVDN). The comprehensive experiments show that our GELA model achieves state-of-the-art results on both tasks, demonstrating its effectiveness and generalizability.

cs.CV↗

arXiv2023

Prediction of charmed-bottom pentaquarks in quark model

Inspired by the fully heavy tetraquark states reported by the LHCb, ATLAS and CMS Collaborations, we perform a systemical investigation of the low-lying fully heavy pentaquark systems composed of charm and bottom quarks (anti-quark) in the chiral quark model. With the help of the channel-coupling, we obtain several fully heavy pentaquark candidates, which are $cccc\bar{b}$ and $bbbb\bar{c}$ systems with $J^P = 1/2^-$ and $3/2^-$, $cccb\bar{c}$, $bbbc\bar{b}$, $cccb\bar{b}$ and $bbbc\bar{c}$ systems with $J^P = 5/2^-$. The binding energies of these states are all below 10 MeV and the root mean square (RMS) are around 1.8 fm, which indicates that these states are likely to be molecular states. These predicted exotic states may provide new ideas for experimental searches and we expect more experimental and theoretical researches to study and understand the fully heavy states in future.

hep-ph↗

arXiv2023

Data Volume-aware Computation Task Scheduling for Smart Grid Data Analytic Applications

Emerging smart grid applications analyze large amounts of data collected from millions of meters and systems to facilitate distributed monitoring and real-time control tasks. However, current parallel data processing systems are designed for common applications, unaware of the massive volume of the collected data, causing long data transfer delay during the computation and slow response time of smart grid systems. A promising direction to reduce delay is to jointly schedule computation tasks and data transfers. We identify that the smart grid data analytic jobs require the intermediate data among different computation stages to be transmitted orderly to avoid network congestion. This new feature prevents current scheduling algorithms from being efficient. In this work, an integrated computing and communication task scheduling scheme is proposed. The mathematical formulation of smart grid data analytic jobs scheduling problem is given, which is unsolvable by existing optimization methods due to the strongly coupled constraints. Several techniques are combined to linearize it for adapting the Branch and Cut method. Based on the topological information in the job graph, the Topology Aware Branch and Cut method is further proposed to speed up searching for optimal solutions. Numerical results demonstrate the effectiveness of the proposed method.

cs.DC↗

arXiv2023

Online Network Slicing for Real Time Applications in Large-scale Satellite Networks

In this work, we investigate resource allocation strategy for real time communication (RTC) over satellite networks with virtual network functions. Enhanced by inter-satellite links (ISLs), in-orbit computing and network virtualization technologies, large-scale satellite networks promise global coverage at low-latency and high-bandwidth for RTC applications with diversified functions. However, realizing RTC with specific function requirements using intermittent ISLs, requires efficient routing methods with fast response times. We identify that such a routing problem over time-varying graph can be formulated as an integer linear programming problem. The branch and bound method incurs $\mathcal{O}(|\mathcal{L}^τ| \cdot (3 |\mathcal{V}^τ| + |\mathcal{L}^τ|)^{|\mathcal{L}^τ|})$ time complexity, where $|\mathcal{V}^τ|$ is the number of nodes, and $|\mathcal{L}^τ|$ is the number of links during time interval $τ$. By adopting a k-shortest path-based algorithm, the theoretical worst case complexity becomes $O(|\mathcal{V}^τ|! \cdot |\mathcal{V}^τ|^3)$. Although it runs fast in most cases, its solution can be sub-optimal and may not be found, resulting in compromised acceptance ratio in practice. To overcome this, we further design a graph-based algorithm by exploiting the special structure of the solution space, which can obtain the optimal solution in polynomial time with a computational complexity of $\mathcal{O}(3|\mathcal{L}^τ| + (2\log{|\mathcal{V}^τ|}+1) |\mathcal{V}^τ|)$. Simulations conducted on starlink constellation with thousands of satellites corroborate the effectiveness of the proposed algorithm.

cs.NI↗

arXiv2022

Molecular state interpretation of charmed baryons in the quark model

Stimulated by the observation of $Λ_c(2910)^+$ by the Belle Collaboration, the $S$-wave $qqq\bar{q}c~(q=u~\text{or}~d)$ pentaquark systems with $I$ = 0, $J^P$ = $\frac{1}{2}^-,~\frac{3}{2}^- and~\frac{5}{2}^-$ are investigated in the framework of quark delocalization color screening model(QDCSM). The real-scaling method is utilized to check the bound states and the genuine resonance states. The root mean square of cluster spacing is also calculated to study the structure of the states and estimate if the state is resonance state or not. The numerical results show that $Λ_{c}(2910)$ cannot be interpreted as a molecular state, and $Σ_{c}(2800)$ cannot be explained as the $ND$ molecular state with $J^P=1/2^-$. $Λ_{c}(2595)$ can be interpreted as the molecular state with $J^P=\frac{1}{2}^-$ and the main component is $Σ_{c}π$. $Λ_{c}(2625)$ can be interpreted as the molecular state with $J^P=\frac{3}{2}^-$ and the main component is $Σ_{c}^{*}π$. $Λ_{c}(2940)$ is likely to be interpreted as a molecular state with $J^P=3/2^-$, and the main component is $ND^{*}$. Besides, two new molecular states are predicted, one is the $J^P=3/2^-$ $Σ_{c}ρ$ resonance state with the mass around 3140 MeV, another one is the $J^P=\frac{5}{2}^-$ $Σ_{c}^*ρ$ with the mass of 3188.3 MeV.

hep-ph↗

arXiv2022

Optimal Job Scheduling and Bandwidth Augmentation in Hybrid Data Center Networks

Optimizing data transfers is critical for improving job performance in data-parallel frameworks. In the hybrid data center with both wired and wireless links, reconfigurable wireless links can provide additional bandwidth to speed up job execution. However, it requires the scheduler and transceivers to make joint decisions under coupled constraints. In this work, we identify that the joint job scheduling and bandwidth augmentation problem is a complex mixed integer nonlinear problem, which is not solvable by existing optimization methods. To address this bottleneck, we transform it into an equivalent problem based on the coupling of its heuristic bounds, the revised data transfer representation and non-linear constraints decoupling and reformulation, such that the optimal solution can be efficiently acquired by the Branch and Bound method. Based on the proposed method, the performance of job scheduling with and without bandwidth augmentation is studied. Experiments show that the performance gain depends on multiple factors, especially the data size. Compared with existing solutions, our method can averagely reduce the job completion time by up to 10% under the setting of production scenario.

cs.DC↗

arXiv2021

Fully heavy pentaquarks in quark models

The fully heavy pentaquarks $cccc\bar{c}$ and $bbbb\bar{b}$ are systematically investigated within the chiral quark model and quark delocalization color screening model. The results are consistent in both two moelds, and the effect of the channel-coupling is crucial for forming a bound state of the fully heavy pentaquark system. Three possible fully heavy pentaquarks are obtained, which are the $cccc\bar{c}$ state with $J^P = 1/2^-$ and the mass of $7891.9 \sim 7892.7$ MeV, the $bbbb\bar{b}$ state with $J^P=1/2^-$ and the mass of $23810.1 \sim 23813.8$ MeV, and the $bbbb\bar{b}$ state with $J^P = 3/2^-$ and the mass of $23748.2 \sim 23752.3$ MeV. All these fully heavy pentaquark states are worth searching in future experiments.

hep-ph↗

arXiv2020

Planimation

Planimation is a modular and extensible open source framework to visualise sequential solutions of planning problems specified in PDDL. We introduce a preliminary declarative PDDL-like animation profile specification, expressive enough to synthesise animations of arbitrary initial states and goals of a benchmark with just a single profile.

cs.AI↗