Searcharxiv⌕ Search

arXiv subjects

Yao Yu

Publications and source records attributed to Yao Yu.

At least 37 records · Page 2Linked to original sources

Five-body $D\to V$ Semileptonic Decays

Our main objective is to derive the decay rate for the semileptonic decays $D\to V\ell^+ν_{\ell}\,(\ell=e,μ)$, where $V$ represents a vector particle. In these decays, the vector particle $V$ decays into three pseudo-scalar particles. To accomplish this, we evaluate the phase-space factor for the five-body decay with a set of eight independent variables which uniquely define a point in the phase space. We further conduct a detailed investigation of the $D\to ω\ell^+ν_{\ell}$, where $ω$ subsequently decays into $π^+π^-π^0$, within the Standard Model and in a general effective field theory description of the weak interactions at low energies. The outcomes of this study have potential applications in the measurement of $D\to ω$ form factors. These measurements can be performed using data obtained from BESIII.

hep-ph↗

Van der Waals Magnetic Electrode Transfer for Two-Dimensional Spintronic Devices

Two-dimensional (2D) materials are promising candidates for spintronic applications. Maintaining their atomically smooth interfaces during integration of ferromagnetic (FM) electrodes is crucial since conventional metal deposition tends to induce defects at the interfaces. Meanwhile, the difficulties in picking up FM metals with strong adhesion and in achieving conductance match between FM electrodes and spin transport channels make it challenging to fabricate high-quality 2D spintronic devices using metal transfer techniques. Here, we report a solvent-free magnetic electrode transfer technique that employs a graphene layer to assist in the transfer of FM metals. It also serves as part of the FM electrode after transfer for optimizing spin injection, which enables the realization of spin valves with excellent performance based on various 2D materials. In addition to two-terminal devices, we demonstrate that the technique is applicable for four-terminal spin valves with nonlocal geometry. Our results provide a promising future of realizing 2D spintronic applications using the developed magnetic electrode transfer technique.

cond-mat.mes-hall↗

Muon mass correction in partial wave analyses of charmed meson semi-leptonic decays

We derive the parameterization formula for partial wave analyses of charmed meson semi-leptonic decays with consideration of the effects caused by the lepton mass. As the proposed super-tau-charm factory will reach much enhanced luminosity and BESIII is taking $ψ(3770)\to D\bar{D}$ data, our results are helpful to improve the measurement precision of future partial wave analyses of charmed meson semi-muonic decays.

hep-ph↗

A Constrained Deep Reinforcement Learning Optimization for Reliable Network Slicing in a Blockchain-Secured Low-Latency Wireless Network

Network slicing (NS) is a promising technology that supports diverse requirements for next-generation low-latency wireless communication networks. However, the tampering attack is a rising issue of jeopardizing NS service-provisioning. To resist tampering attacks in NS networks, we propose a novel optimization framework for reliable NS resource allocation in a blockchain-secured low-latency wireless network, where trusted base stations (BSs) with high reputations are selected for blockchain management and NS service-provisioning. For such a blockchain-secured network, we consider that the latency is measured by the summation of blockchain management and NS service-provisioning, whilst the NS reliability is evaluated by the BS denial-of-service (DoS) probability. To satisfy the requirements of both the latency and reliability, we formulate a constrained computing resource allocation optimization problem to minimize the total processing latency subject to the BS DoS probability. To efficiently solve the optimization, we design a constrained deep reinforcement learning (DRL) algorithm, which satisfies both latency and DoS probability requirements by introducing an additional critic neural network. The proposed constrained DRL further solves the issue of high input dimension by incorporating feature engineering technology. Simulation results validate the effectiveness of our approach in achieving reliable and low-latency NS service-provisioning in the considered blockchain-secured wireless network.

eess.SP↗

Investigating $Z_{cs}(3985)$ and $Z_{cs}(4000)$ exotic states in $Λ_b\to Z^-_{cs}p$ decays

We study the $Z_{cs}(3985)$ and $Z_{cs}(4000)$ exotic states in the decays of $Λ_b$ baryons through a molecular scenario. In the final state interaction, the $Λ_b\to Λ_c^+ D_s^{(*)-}$ decays are followed by the $Λ_c^+ D_s^{(*)-}$ to $Z^-_{cs}p$ rescatterings via exchange of a $D^{(*)}$ meson. We predict a branching fraction of $(3.1^{+1.4}_{-2.6})\times 10^{-4}$ for $Λ_b\to Z^-_{cs}p$, which can be measured in the $Λ_b\to J/ψK^{(*)-}p$ decay. This study proposes a new approach to test the molecular model, and guides future experimental searches for the $Z_{cs}(3985)$ and $Z_{cs}(4000)$.

hep-ph↗

How many preprints have actually been printed and why: a case study of computer science preprints on arXiv

Preprints play an increasingly critical role in academic communities. There are many reasons driving researchers to post their manuscripts to preprint servers before formal submission to journals or conferences, but the use of preprints has also sparked considerable controversy, especially surrounding the claim of priority. In this paper, a case study of computer science preprints submitted to arXiv from 2008 to 2017 is conducted to quantify how many preprints have eventually been printed in peer-reviewed venues. Among those published manuscripts, some are published under different titles and without an update to their preprints on arXiv. In the case of these manuscripts, the traditional fuzzy matching method is incapable of mapping the preprint to the final published version. In view of this issue, we introduce a semantics-based mapping method with the employment of Bidirectional Encoder Representations from Transformers (BERT). With this new mapping method and a plurality of data sources, we find that 66% of all sampled preprints are published under unchanged titles and 11% are published under different titles and with other modifications. A further analysis was then performed to investigate why these preprints but not others were accepted for publication. Our comparison reveals that in the field of computer science, published preprints feature adequate revisions, multiple authorship, detailed abstract and introduction, extensive and authoritative references and available source code.

cs.DL↗

Investigating $η^\prime_{1}(1855)$ exotic states in $J/ψ\toη^\prime_{1}(1855)η^{(\prime)}$ decays

An analysis of the $J/ψ\to ηη^\primeγ$ decay by the BESIII collaboration claims the observation of an exotic state $η_1(1855)$ with $I^GJ^{PC}=0^+1^{-+}$. To establish its C-parity partner $η^\prime_{1}(1855)$ in the picture of the $K \bar{K}_1(1400)$ molecular state, we propose that $J/ψ\toη^\prime_{1}(1855)η^{(\prime)}$ receives the main contributions from the final state interaction of $KK^*$($K^+ K^{*-}$, $K^- K^{*+}$, $K^0 \bar{K}^{*0}$, and $\bar{K}^0 K^{*0}$). Specifically, $K$ and $K^*$ in $J/ψ\to KK^*$ decays transform as $η^\prime_{1}(1855)η^{(\prime)}$, by exchanging a $K_1(1400)$. We predict ${\cal B}(J/ψ\to η^{\prime}_1(1855)η)=(6.3^{+12.6}_{-3.5})\times 10^{-6}$, and ${\cal B}(J/ψ\to η^{\prime}_1(1855)η^{\prime}) =(6.5^{+6.6}_{-4.6})\times 10^{-6}$, which can be studied in the $J/ψ\to K^*\bar{K}^*η^{(\prime)}$ decays.

hep-ph↗

ASMCap: An Approximate String Matching Accelerator for Genome Sequence Analysis Based on Capacitive Content Addressable Memory

Genome sequence analysis is a powerful tool in medical and scientific research. Considering the inevitable sequencing errors and genetic variations, approximate string matching (ASM) has been adopted in practice for genome sequencing. However, with exponentially increasing bio-data, ASM hardware acceleration is facing severe challenges in improving the throughput and energy efficiency with the accuracy constraint. This paper presents ASMCap, an ASM acceleration approach for genome sequence analysis with hardware-algorithm co-optimization. At the circuit level, ASMCap adopts charge-domain computing based on the capacitive multi-level content addressable memories (ML-CAMs), and outperforms the state-of-the-art ML-CAM-based ASM accelerators EDAM with higher accuracy and energy efficiency. ASMCap also has misjudgment correction capability with two proposed hardware-friendly strategies, namely the Hamming-Distance Aid Correction (HDAC) for the substitution-dominant edits and the Threshold-Aware Sequence Rotation (TASR) for the consecutive indels. Evaluation results show that ASMCap can achieve an average of 1.2x (from 74.7% to 87.6%) and up to 1.8x (from 46.3% to 81.2%) higher F1 score (the key metric of accuracy), 1.4x speedup, and 10.8x energy efficiency improvement compared with EDAM. Compared with the other ASM accelerators, including ResMA based on the comparison matrix, and SaVI based on the seeding strategy, ASMCap achieves an average improvement of 174x and 61x speedup, and 8.7e3x and 943x higher energy efficiency, respectively.

cs.AR↗

Detecting and analyzing missing citations to published scientific entities

Proper citation is of great importance in academic writing for it enables knowledge accumulation and maintains academic integrity. However, citing properly is not an easy task. For published scientific entities, the ever-growing academic publications and over-familiarity of terms easily lead to missing citations. To deal with this situation, we design a special method Citation Recommendation for Published Scientific Entity (CRPSE) based on the cooccurrences between published scientific entities and in-text citations in the same sentences from previous researchers. Experimental outcomes show the effectiveness of our method in recommending the source papers for published scientific entities. We further conduct a statistical analysis on missing citations among papers published in prestigious computer science conferences in 2020. In the 12,278 papers collected, 475 published scientific entities of computer science and mathematics are found to have missing citations. Many entities mentioned without citations are found to be well-accepted research results. On a median basis, the papers proposing these published scientific entities with missing citations were published 8 years ago, which can be considered the time frame for a published scientific entity to develop into a well-accepted concept. For published scientific entities, we appeal for accurate and full citation of their source papers as required by academic standards.

cs.DL↗

Automatic Analysis of Available Source Code of Top Artificial Intelligence Conference Papers

Source code is essential for researchers to reproduce the methods and replicate the results of artificial intelligence (AI) papers. Some organizations and researchers manually collect AI papers with available source code to contribute to the AI community. However, manual collection is a labor-intensive and time-consuming task. To address this issue, we propose a method to automatically identify papers with available source code and extract their source code repository URLs. With this method, we find that 20.5% of regular papers of 10 top AI conferences published from 2010 to 2019 are identified as papers with available source code and that 8.1% of these source code repositories are no longer accessible. We also create the XMU NLP Lab README Dataset, the largest dataset of labeled README files for source code document research. Through this dataset, we have discovered that quite a few README files have no installation instructions or usage tutorials provided. Further, a large-scale comprehensive statistical analysis is made for a general picture of the source code of AI conference papers. The proposed solution can also go beyond AI conference papers to analyze other scientific papers from both journals and conferences to shed light on more domains.

cs.SE↗

Modeling Price Elasticity for Occupancy Prediction in Hotel Dynamic Pricing

Demand estimation plays an important role in dynamic pricing where the optimal price can be obtained via maximizing the revenue based on the demand curve. In online hotel booking platform, the demand or occupancy of rooms varies across room-types and changes over time, and thus it is challenging to get an accurate occupancy estimate. In this paper, we propose a novel hotel demand function that explicitly models the price elasticity of demand for occupancy prediction, and design a price elasticity prediction model to learn the dynamic price elasticity coefficient from a variety of affecting factors. Our model is composed of carefully designed elasticity learning modules to alleviate the endogeneity problem, and trained in a multi-task framework to tackle the data sparseness. We conduct comprehensive experiments on real-world datasets and validate the superiority of our method over the state-of-the-art baselines for both occupancy prediction and dynamic pricing.

econ.GN↗

A Robustly Optimized Long Text to Math Models for Numerical Reasoning On FinQA

Numerical reasoning is required when solving most problems in our life, but it has been neglected in previous artificial intelligence researches. FinQA challenge has been organized to strengthen the study on numerical reasoning where the participants are asked to predict the numerical reasoning program to solve financial question. The result of FinQA will be evaluated by both execution accuracy and program accuracy. In this paper, we present our approach to tackle the task objective by developing models with different specialized capabilities and fusing their strength. Overall, our approach achieves the 1st place in FinQA challenge, with 71.93% execution accuracy and 67.03% program accuracy.

cs.CL↗

Distinguishing (Dirac or Majorana) neutrinos in purely leptonic decays of leptons

We investigate purely leptonic decays of leptons $ł^{\prime-}\to l^-\barν_lν_{l^{\prime}}$ to distinguish Dirac or Majorana neutrinos. We derive the differences of the decay width (and associated quantities) between the two neutrino hypotheses by the effect of identical particles. Evidence from experimental data makes the hypothesis of Majorana neutrinos very unlikely and our results strongly favor the hypothesis of Dirac neutrinos (in the standard three-neutrino theory). Moreover, our exploration for decay widths can be extended to the polarization angles of leptons, which will inspire new information for experimental and theoretical studies.

hep-ph↗

Study of the $D_s^+\to a_0(980) ρ$ and $a_0(980) ω$ decays

We study $D_{s}^{+}\toρ^{0(+)}a^{+(0)}_{0}$, $D_{s}^{+}\toωa^{+}_{0}$, and the resonant $D_{s}^{+}\toρa_0$,$a_{0}\to ηπ(KK)$ decays. In the final state interaction, where $D_s^+\to (η^{(\prime)}π^+,K^+\bar K^0)$ are followed by the $(η^{(\prime)}π^+,K^+\bar K^0)$ to $ρ^{0(+)}a^{+(0)}_{0}$ rescatterings, we predict ${\cal B}(D_{s}^{+}\toρ^{0(+)}a^{+(0)}_{0})=(3.0\pm 0.3\pm 1.0)\times 10^{-3}$. Due to the cancellation of the rescattering effects and the suppressed short-distance $W$ annihilation contribution, we expect that ${\cal B}(D_{s}^{+}\toωa^{+}_{0}) \simeq {\cal B}(D_s^+\toπ^+π^0)<3.4\times 10^{-4}$. In our calculation, ${\cal B}(D_{s}^{+}\toρ^{0}(a^{+}_{0}\to)ηπ^{+}) =(1.6^{+0.2}_{-0.3}\pm 0.6)\times 10^{-3}$ agrees with the data, whereas ${\cal B}(D_{s}^{+}\toρ^{+}(a^{0}_{0}\to)K^+K^-)$ is 10 times smaller than the observation, which requires a careful examination.

hep-ph↗

Cabibbo-favored $Λ^+_c\toΛa_{0}(980)^+$ decay in the final state interaction

The anti-triplet charmed baryon decays with the light scalar mesons are rarely measured, whereas the recent observation of the Cabibbo-favored $Λ_c^+\to Ληπ^+$ decay hints a possible $Λ_c^+\toΛa_0(980)^+,a_0(980)^+\to ηπ^+$ process. We hence study the $Λ_c^+\toΛa_0(980)^+$ decay. Particularly, it is found that the final state interaction can give a significant contribution, where $Σ^{+}(1385)$ and $η$ in $Λ_c^+\to Σ^{+}(1385)η$ by exchanging a charged pion are transformed as $Λ$ and $a_0(980)^+$, respectively. Accordingly, we predict ${\cal B}(Λ_c^+\toΛa_0(980)^+)=(1.7^{+2.8}_{-1.0}\pm 0.3)\times 10^{-3}$, accessible to the BESIII, BELLEII and LHCb experiments.

hep-ph↗

New $X_{0,1}(2900)$-like exotic states in $b$-baryon decays

In the $B^+\to D^+ D^-K^+$ decay, LHCb has reported the observation of the open-charm exotic states $X_{0,1}^0\equiv X_{0,1}(2900)^0$ with four different quark flavors~$(ud\bar s \bar c)$, where the subscripts (0,1) denote the spins. To confirm the discovery, we propose $Λ_b\to Σ_c^{0(++)} X_{0,1}^{\prime\,0(--)}$ in the final state interaction, where $X_{0,1}^{\prime\,0(--)}$ with $s u\bar d \bar c$ ($ds\bar u \bar c$) are the new $X_{0,1}$-like exotic states. More specifically, $Λ_c^+D_s^-$ in $Λ_b\to Λ_c^+D_s^-$ are transformed as $Σ_c^{0(++)} X_{0,1}^{\prime\,0(--)}$, by exchanging $π^{+(-)}$. As the order of magnitude estimates, we calculate ${\cal B}(Λ_b\to Σ_c^{0(++)} X_{0,1}^{\prime\,0(--)}) =(2.3\pm 0.6,4.3\pm 0.8^{+3.3}_{-2.5})\times 10^{-4}$. In addition, we estimate other $b$-baryon decays with the $X_{0,1}$-like states, such as ${\cal B}(Ξ_{b}^{0(-)}\to Ξ_{c}^{0(+)}(2645)X_{0}^{\prime\,0(--)}, Λ_{b}\to Ξ_{c}^{\prime\,0}X_{0,1}^{0})\sim 10^{-5}$. While one needs $Λ_b\to Σ_c^{0(++)}M_c M$ to observe $X_{0,1}^{\prime\,0(--)}\to M_c M$ with $M_c M=D_s^-π^+$, $\bar D^0 \bar K^0$ $(D_s^-π^-$, $D^-K^-)$, ${\cal B}(Λ_b\to Σ_c^{0(++)} X_{0,1}^{\prime\,0(--)}, X_{0,1}^{\prime\,0(--)}\to M_c M)\sim 10^{-4}$ are accessible to the LHCb experiment.

hep-ph↗

Itinerary-aware Personalized Deep Matching at Fliggy

Matching items for a user from a travel item pool of large cardinality have been the most important technology for increasing the business at Fliggy, one of the most popular online travel platforms (OTPs) in China. There are three major challenges facing OTPs: sparsity, diversity, and implicitness. In this paper, we present a novel Fliggy ITinerary-aware deep matching NETwork (FitNET) to address these three challenges. FitNET is designed based on the popular deep matching network, which has been successfully employed in many industrial recommendation systems, due to its effectiveness. The concept itinerary is firstly proposed under the context of recommendation systems for OTPs, which is defined as the list of unconsumed orders of a user. All orders in a user itinerary are learned as a whole, based on which the implicit travel intention of each user can be more accurately inferred. To alleviate the sparsity problem, users' profiles are incorporated into FitNET. Meanwhile, a series of itinerary-aware attention mechanisms that capture the vital interactions between user's itinerary and other input categories are carefully designed. These mechanisms are very helpful in inferring a user's travel intention or preference, and handling the diversity in a user's need. Further, two training objectives, i.e., prediction accuracy of user's travel intention and prediction accuracy of user's click behavior, are utilized by FitNET, so that these two objectives can be optimized simultaneously. An offline experiment on Fliggy production dataset with over 0.27 million users and 1.55 million travel items, and an online A/B test both show that FitNET effectively learns users' travel intentions, preferences, and diverse needs, based on their itineraries and gains superior performance compared with state-of-the-art methods. FitNET now has been successfully deployed at Fliggy, serving major online traffic.

cs.IR↗

Resonant $a_0(980)$ state in triangle rescattering $D_s^+\to π^+π^0η$ decays

We study the $D_s^+\to π^+(a_0(980)^0\to)π^0η$, $π^0(a_0(980)^+\to)π^+η$ decays, which have been recently measured by the BESIII collaboration. We propose that $D_s^+\to π^{+(0)}(a_0(980)^{0(+)}\to)π^{0(+)}η$ receives the contributions from the triangle rescattering processes, where $M^0$ and $ρ^+$ in $D_s^+\to M^0 ρ^+$, by exchanging $π^{0(+)}$, are formed as $a_0(980)^{0(+)}$ and $π^{+(0)}$, respectively, with $M^0=(η,η')$. Accordingly, we calculate that ${\cal B}(D_s^+\to a_0(980)^{0(+)}π^{+(0)})=(1.7\pm 0.2\pm 0.1)\times 10^{-2}$ and ${\cal B}(D_s^+\to π^{+(0)}(a_0(980)^{0(+)}\to)π^{0(+)}η)=(1.4\pm 0.1\pm 0.1)\times 10^{-2}$, being consistent with the data.

hep-ph↗