Searcharxiv⌕ Search

arXiv subjects

Jun Cao

Publications and source records attributed to Jun Cao.

At least 73 records · Page 4Linked to original sources
arXiv2022

Sub-percent Precision Measurement of Neutrino Oscillation Parameters with JUNO

JUNO is a multi-purpose neutrino observatory under construction in the south of China. This publication presents new sensitivity estimates for the measurement of the $Δm^2_{31}$, $Δm^2_{21}$, $\sin^2 θ_{12}$, and $\sin^2 θ_{13}$ oscillation parameters using reactor antineutrinos, which is one of the primary physics goals of the experiment. The sensitivities are obtained using the best knowledge available to date on the location and overburden of the experimental site, the nuclear reactors in the surrounding area and beyond, the detector response uncertainties, and the reactor antineutrino spectral shape constraints expected from the TAO satellite detector. It is found that the $Δm^2_{31}$, $Δm^2_{21}$, and $\sin^2 θ_{12}$ oscillation parameters will be determined to better than 0.5% precision in six years of data collection, which represents approximately an order of magnitude improvement over existing constraints.

hep-ex↗
arXiv2022

Hessian heat kernel estimates and Calderón-Zygmund inequalities on complete Riemannian manifolds

We address some fundamental questions concerning geometric analysis on Riemannian manifolds. It has been asked whether the $L^p$-Calderón-Zygmund inequalities extend to a reasonable class of non-compact Riemannian manifolds without the assumption of a positive injectivity radius. In the present paper, we give a positive answer for $1 2$, we complement the study in Güneysu-Pigola (2015) and derive sufficient geometric criteria for the validity of the Calderón-Zygmund inequality by adding Kato class bounds on the Riemann curvature tensor and the covariant derivative of Ricci curvature. Probabilistic tools, like Hessian formulas and Bismut type representations for heat semigroups, play a significant role throughout the proofs.

math.DG↗
arXiv2021

Learning Kernel-Smoothed Machine Translation with Retrieved Examples

How to effectively adapt neural machine translation (NMT) models according to emerging cases without retraining? Despite the great success of neural machine translation, updating the deployed models online remains a challenge. Existing non-parametric approaches that retrieve similar examples from a database to guide the translation process are promising but are prone to overfit the retrieved examples. In this work, we propose to learn Kernel-Smoothed Translation with Example Retrieval (KSTER), an effective approach to adapt neural machine translation models online. Experiments on domain adaptation and multi-domain machine translation datasets show that even without expensive retraining, KSTER is able to achieve improvement of 1.1 to 1.5 BLEU scores over the best existing online adaptation methods. The code and trained models are released at https://github.com/jiangqn/KSTER.

cs.CL↗
arXiv2021

Renewable energy integration and microgrid energy trading using multi-agent deep reinforcement learning

In this paper, multi-agent reinforcement learning is used to control a hybrid energy storage system working collaboratively to reduce the energy costs of a microgrid through maximising the value of renewable energy and trading. The agents must learn to control three different types of energy storage system suited for short, medium, and long-term storage under fluctuating demand, dynamic wholesale energy prices, and unpredictable renewable energy generation. Two case studies are considered: the first looking at how the energy storage systems can better integrate renewable energy generation under dynamic pricing, and the second with how those same agents can be used alongside an aggregator agent to sell energy to self-interested external microgrids looking to reduce their own energy bills. This work found that the centralised learning with decentralised execution of the multi-agent deep deterministic policy gradient and its state-of-the-art variants allowed the multi-agent methods to perform significantly better than the control from a single global agent. It was also found that using separate reward functions in the multi-agent approach performed much better than using a single control agent. Being able to trade with the other microgrids, rather than just selling back to the utility grid, also was found to greatly increase the grid's savings.

cs.MA↗
arXiv2021

Status and Perspectives of Neutrino Physics

This review demonstrates the unique role of the neutrino by discussing in detail the physics of and with neutrinos. We deal with neutrino sources, neutrino oscillations, absolute masses, interactions, the possible existence of sterile neutrinos, and theoretical implications. In addition, synergies of neutrino physics with other research fields are found, and requirements to continue successful neutrino physics in the future, in terms of technological developments and adequate infrastructures, are stressed.

hep-ph↗
arXiv2021

Radiogenic neutron background in reactor neutrino experiments

We report a novel correlated background in the antineutrino detection using the inverse beta decay reaction. Spontaneous fissions and $(α,n)$ reactions in peripheral materials of the antineutrino detector, such as borosilicate glass of photomultipliers, produce fast neutrons and prompt gamma rays. If the shielding from the material to the detector target were not thick enough, neutrons and gammas could enter the target volume and mimic antineutrino signals. This paper revisits the yields and energy spectra of neutrons produced in B$(α,n)$N and F$(α,n)$Na reactions. A Geant4 based simulation has been carried out using a simplified detector geometry for the present generation reactor neutrino experiments. The background rates in these experiments are estimated. If this background was not taken into account, the value of the neutrino mixing angle $\sin^22θ_{13}$ would be underestimated. We recommend that Daya Bay, RENO, Double Chooz, and JUNO, carefully examine the masses and radiopurity levels of detector materials that are close to the target and rich in boron and fluorine.

physics.ins-det↗
arXiv2021

Radioactivity control strategy for the JUNO detector

JUNO is a massive liquid scintillator detector with a primary scientific goal of determining the neutrino mass ordering by studying the oscillated anti-neutrino flux coming from two nuclear power plants at 53 km distance. The expected signal anti-neutrino interaction rate is only 60 counts per day, therefore a careful control of the background sources due to radioactivity is critical. In particular, natural radioactivity present in all materials and in the environment represents a serious issue that could impair the sensitivity of the experiment if appropriate countermeasures were not foreseen. In this paper we discuss the background reduction strategies undertaken by the JUNO collaboration to reduce at minimum the impact of natural radioactivity. We describe our efforts for an optimized experimental design, a careful material screening and accurate detector production handling, and a constant control of the expected results through a meticulous Monte Carlo simulation program. We show that all these actions should allow us to keep the background count rate safely below the target value of 10 Hz in the default fiducial volume, above an energy threshold of 0.7 MeV.

physics.ins-det↗
arXiv2021

JUNO sensitivity to low energy atmospheric neutrino spectra

Atmospheric neutrinos are one of the most relevant natural neutrino sources that can be exploited to infer properties about cosmic rays and neutrino oscillations. The Jiangmen Underground Neutrino Observatory (JUNO) experiment, a 20 kton liquid scintillator detector with excellent energy resolution is currently under construction in China. JUNO will be able to detect several atmospheric neutrinos per day given the large volume. A study on the JUNO detection and reconstruction capabilities of atmospheric $ν_e$ and $ν_μ$ fluxes is presented in this paper. In this study, a sample of atmospheric neutrino Monte Carlo events has been generated, starting from theoretical models, and then processed by the detector simulation. The excellent timing resolution of the 3'' PMT light detection system of JUNO detector and the much higher light yield for scintillation over Cherenkov allow to measure the time structure of the scintillation light with very high precision. Since $ν_e$ and $ν_μ$ interactions produce a slightly different light pattern, the different time evolution of light allows to discriminate the flavor of primary neutrinos. A probabilistic unfolding method has been used, in order to infer the primary neutrino energy spectrum from the detector experimental observables. The simulated spectrum has been reconstructed between 100 MeV and 10 GeV, showing a great potential of the detector in the atmospheric low energy region.

hep-ex↗
arXiv2021

Multi-Agent Deep Deterministic Policy Gradient Algorithm for Peer-to-Peer Energy Trading Considering Distribution Network Constraints

In this paper, we investigate an energy cost minimization problem for prosumers participating in peer-to-peer energy trading. Due to (i) uncertainties caused by renewable energy generation and consumption, (ii) difficulties in developing an accurate and efficient energy trading model, and (iii) the need to satisfy distribution network constraints, it is challenging for prosumers to obtain optimal energy trading decisions that minimize their individual energy costs. To address the challenge, we first formulate the above problem as a Markov decision process and propose a multi-agent deep deterministic policy gradient algorithm to learn optimal energy trading decisions. To satisfy the distribution network constraints, we propose distribution network tariffs which we incorporate in the algorithm as incentives to incentivize energy trading decisions that help to satisfy the constraints and penalize the decisions that violate them. The proposed algorithm is model-free and allows the agents to learn the optimal energy trading decisions without having prior information about other agents in the network. Simulation results based on real-world datasets show the effectiveness and robustness of the proposed algorithm.

eess.SY↗
arXiv2021

A Review on Cybersecurity in Smart Local Energy Systems: Requirements, Challenges, and Standards

Smart local energy system (SLES) is considered as a promising pathway facilitating a more effective and localised operation, benefited from the complex information and communication technology (ICT) infrastructures and Internet of things (IoT) technologies. As a part of the critical infrastructure, it is important to not only put effective detection and management to tackle potential cybersecurity issues, but also require considerable numbers of standards to ensure the security of the internet of things system to minimise the risks. This study aims to review the existing standards, investigate how the compatibility with SLES development, and identify the area to focus on in the future. Although existing standards and protocols are highly fragmented, our findings suggest that many of them can meet the requirements of the applications and infrastructures of SLES. Additionally, many standards have been introduced to protect information security and personal privacy due to their increasing importance. The research also suggests that the industry needs to produce more affordable and cyber-secured devices and services. For the government and regulators, relevant guidelines on the minimum function and security requirements for applications should be provided. Additionally, compliance testing and certifications should be in place and carried out by an independent third party to ensure the components of SLES ecosystem with a satisfied security level by design.

cs.CR↗
arXiv2021

The Volctrans Neural Speech Translation System for IWSLT 2021

This paper describes the systems submitted to IWSLT 2021 by the Volctrans team. We participate in the offline speech translation and text-to-text simultaneous translation tracks. For offline speech translation, our best end-to-end model achieves 8.1 BLEU improvements over the benchmark on the MuST-C test set and is even approaching the results of a strong cascade solution. For text-to-text simultaneous translation, we explore the best practice to optimize the wait-k model. As a result, our final submitted systems exceed the benchmark at around 7 BLEU on the same latency regime. We will publish our code and model to facilitate both future research works and industrial applications. This paper describes the systems submitted to IWSLT 2021 by the Volctrans team. We participate in the offline speech translation and text-to-text simultaneous translation tracks. For offline speech translation, our best end-to-end model achieves 7.9 BLEU improvements over the benchmark on the MuST-C test set and is even approaching the results of a strong cascade solution. For text-to-text simultaneous translation, we explore the best practice to optimize the wait-k model. As a result, our final submitted systems exceed the benchmark at around 7 BLEU on the same latency regime. We release our code and model at \url{https://github.com/bytedance/neurst/tree/master/examples/iwslt21} to facilitate both future research works and industrial applications.

cs.CL↗
arXiv2021

Curvature Graph Neural Network

Graph neural networks (GNNs) have achieved great success in many graph-based tasks. Much work is dedicated to empowering GNNs with the adaptive locality ability, which enables measuring the importance of neighboring nodes to the target node by a node-specific mechanism. However, the current node-specific mechanisms are deficient in distinguishing the importance of nodes in the topology structure. We believe that the structural importance of neighboring nodes is closely related to their importance in aggregation. In this paper, we introduce discrete graph curvature (the Ricci curvature) to quantify the strength of structural connection of pairwise nodes. And we propose Curvature Graph Neural Network (CGNN), which effectively improves the adaptive locality ability of GNNs by leveraging the structural property of graph curvature. To improve the adaptability of curvature to various datasets, we explicitly transform curvature into the weights of neighboring nodes by the necessary Negative Curvature Processing Module and Curvature Normalization Module. Then, we conduct numerous experiments on various synthetic datasets and real-world datasets. The experimental results on synthetic datasets show that CGNN effectively exploits the topology structure information, and the performance is improved significantly. CGNN outperforms the baselines on 5 dense node classification benchmark datasets. This study deepens the understanding of how to utilize advanced topology information and assign the importance of neighboring nodes from the perspective of graph curvature and encourages us to bridge the gap between graph theory and neural networks.

cs.LG↗
arXiv2021

Data-driven battery operation for energy arbitrage using rainbow deep reinforcement learning

As the world seeks to become more sustainable, intelligent solutions are needed to increase the penetration of renewable energy. In this paper, the model-free deep reinforcement learning algorithm Rainbow Deep Q-Networks is used to control a battery in a small microgrid to perform energy arbitrage and more efficiently utilise solar and wind energy sources. The grid operates with its own demand and renewable generation based on a dataset collected at Keele University, as well as using dynamic energy pricing from a real wholesale energy market. Four scenarios are tested including using demand and price forecasting produced with local weather data. The algorithm and its subcomponents are evaluated against two continuous control benchmarks with Rainbow able to outperform all other method. This research shows the importance of using the distributional approach for reinforcement learning when working with complex environments and reward functions, as well as how it can be used to visualise and contextualise the agent's behaviour for real-world applications.

cs.LG↗
arXiv2021

JUNO Physics and Detector

The Jiangmen Underground Neutrino Observatory (JUNO) is a 20 kton LS detector at 700-m underground. An excellent energy resolution and a large fiducial volume offer exciting opportunities for addressing many important topics in neutrino and astro-particle physics. With 6 years of data, the neutrino mass ordering can be determined at 3-4 sigma and three oscillation parameters can be measured to a precision of 0.6% or better by detecting reactor antineutrinos. With 10 years of data, DSNB could be observed at 3-sigma; a lower limit of the proton lifetime of 8.34e33 years (90% C.L.) can be set by searching for p->nu_bar K^+; detection of solar neutrinos would shed new light on the solar metallicity problem and examine the vacuum-matter transition region. A core-collapse supernova at 10 kpc would lead to ~5000 IBD and ~2000 (300) all-flavor neutrino-proton (electron) scattering events. Geo-neutrinos can be detected with a rate of ~400 events/year. We also summarize the final design of the JUNO detector and the key R&D achievements. All 20-inch PMTs have been tested. The average photon detection efficiency is 28.9% for the 15,000 MCP PMTs and 28.1% for the 5,000 dynode PMTs, higher than the JUNO requirement of 27%. Together with the >20 m attenuation length of LS, we expect a yield of 1345 p.e. per MeV and an effective energy resolution of 3.02%/\sqrt{E (MeV)}$ in simulations. The underwater electronics is designed to have a loss rate <0.5% in 6 years. With degassing membranes and a micro-bubble system, the radon concentration in the 35-kton water pool could be lowered to <10 mBq/m^3. Acrylic panels of radiopurity <0.5 ppt U/Th are produced. The 20-kton LS will be purified onsite. Singles in the fiducial volume can be controlled to ~10 Hz. The JUNO experiment also features a double calorimeter system with 25,600 3-inch PMTs, a LS testing facility OSIRIS, and a near detector TAO.

hep-ex↗
arXiv2021

The Design and Sensitivity of JUNO's scintillator radiopurity pre-detector OSIRIS

The OSIRIS detector is a subsystem of the liquid scintillator fillling chain of the JUNO reactor neutrino experiment. Its purpose is to validate the radiopurity of the scintillator to assure that all components of the JUNO scintillator system work to specifications and only neutrino-grade scintillator is filled into the JUNO Central Detector. The aspired sensitivity level of $10^{-16}$ g/g of $^{238}$U and $^{232}$Th requires a large ($\sim$20 m$^3$) detection volume and ultralow background levels. The present paper reports on the design and major components of the OSIRIS detector, the detector simulation as well as the measuring strategies foreseen and the sensitivity levels to U/Th that can be reached in this setup.

physics.ins-det↗
arXiv2021

Graph Information Vanishing Phenomenon inImplicit Graph Neural Networks

One of the key problems of GNNs is how to describe the importance of neighbor nodes in the aggregation process for learning node representations. A class of GNNs solves this problem by learning implicit weights to represent the importance of neighbor nodes, which we call implicit GNNs such as Graph Attention Network. The basic idea of implicit GNNs is to introduce graph information with special properties followed by Learnable Transformation Structures (LTS) which encode the importance of neighbor nodes via a data-driven way. In this paper, we argue that LTS makes the special properties of graph information disappear during the learning process, resulting in graph information unhelpful for learning node representations. We call this phenomenon Graph Information Vanishing (GIV). Also, we find that LTS maps different graph information into highly similar results. To validate the above two points, we design two sets of 70 random experiments on five Implicit GNNs methods and seven benchmark datasets by using a random permutation operator to randomly disrupt the order of graph information and replacing graph information with random values. We find that randomization does not affect the model performance in 93\% of the cases, with about 7 percentage causing an average 0.5\% accuracy loss. And the cosine similarity of output results, generated by LTS mapping different graph information, over 99\% with an 81\% proportion. The experimental results provide evidence to support the existence of GIV in Implicit GNNs and imply that the existing methods of Implicit GNNs do not make good use of graph information. The relationship between graph information and LTS should be rethought to ensure that graph information is used in node representation.

cs.LG↗