Searcharxiv⌕ Search

arXiv subjects

Tao Lin

Publications and source records attributed to Tao Lin.

At least 217 records · Page 12Linked to original sources

An interpretable LSTM neural network for autoregressive exogenous model

In this paper, we propose an interpretable LSTM recurrent neural network, i.e., multi-variable LSTM for time series with exogenous variables. Currently, widely used attention mechanism in recurrent neural networks mostly focuses on the temporal aspect of data and falls short of characterizing variable importance. To this end, our multi-variable LSTM equipped with tensorized hidden states is developed to learn variable specific representations, which give rise to both temporal and variable level attention. Preliminary experiments demonstrate comparable prediction performance of multi-variable LSTM w.r.t. encoder-decoder based baselines. More interestingly, variable importance in real datasets characterized by the variable attention is highly in line with that determined by statistical Granger causality test, which exhibits the prospect of multi-variable LSTM as a simple and uniform end-to-end framework for both forecasting and knowledge discovery.

cs.LG↗

Approximation Capabilities of Immersed Finite Element Spaces for Elasticity Interface Problems

We construct and analyze a group of immersed finite element (IFE) spaces formed by linear, bilinear and rotated Q1 polynomials for solving planar elasticity equation involving interface. The shape functions in these IFE spaces are constructed through a group of approximate jump conditions such that the unisolvence of the bilinear and rotated Q1 IFE shape functions are always guaranteed regardless of the Lamè parameters and the interface location. The boundedness property and a group of identities of the proposed IFE shape functions are established. A multi-point Taylor expansion is utilized to show the optimal approximation capabilities for the proposed IFE spaces through the Lagrange type interpolation operators.

math.NA↗

A Stable Weak Galerkin Finite Element Method for Stokes Problem

We study the weak Galerkin finite element method for Stokes problem. A new weak Galerkin finite element velocity-pressure space pair is presented which satisfies the discrete inf-sup condition. Based on this space pair, we establish a stable weak Galerkin approximation scheme without adding any stability term or penalty term. Then, we further derive the optimal error estimates for velocity and pressure approximations, respectively. Numerical experiments are provided to illustrate the theoretical analysis.

math.NA↗

A ROOT Based Event Display Software for JUNO

An event display software SERENA has been designed for the Jiangmen Underground Neutrino Observatory (JUNO). The software has been developed in the JUNO offline software system and is based on the ROOT display package EVE. It provides an essential tool to display detector and event data for better understanding of the processes in the detectors. The software has been widely used in JUNO detector optimization, simulation, reconstruction and physics study.

physics.ins-det↗

RubyStar: A Non-Task-Oriented Mixture Model Dialog System

RubyStar is a dialog system designed to create "human-like" conversation by combining different response generation strategies. RubyStar conducts a non-task-oriented conversation on general topics by using an ensemble of rule-based, retrieval-based and generative methods. Topic detection, engagement monitoring, and context tracking are used for managing interaction. Predictable elements of conversation, such as the bot's backstory and simple question answering are handled by separate modules. We describe a rating scheme we developed for evaluating response generation. We find that character-level RNN is an effective generation model for general responses, with proper parameter settings; however other kinds of conversation topics might benefit from using other models.

cs.CL↗

A Group of Immersed Finite Element Spaces For Elliptic Interface Problems

We present a unified framework for developing and analysing immersed finite element (IFE) spaces for solving typical elliptic interface problems with interface independent meshes. This framework allows us to construct a group of new IFE spaces with either linear, or bilinear, or the rotated-Q1 polynomials. Functions in these IFE spaces are locally piecewise polynomials defined according to the sub-elements formed by the interface itself instead of its line approximation. We show that the unisolvence for these IFE spaces follows from the invertibility of the Sherman-Morrison matrix. A group of estimates and identities are established for the interface geometry and shape functions that are applicable to all of these IFE spaces. Most importantly, these fundamental preparations enable us to develop a unified multipoint Taylor expansion procedure for proving that these IFE spaces have the expected optimal approximation capability according to the involved polynomials.

math.NA↗

A nonconforming immersed finite element method for elliptic interface problems

A new immersed finite element (IFE) method is developed for second-order elliptic problems with discontinuous diffusion coefficient. The IFE space is constructed based on the rotated Q1 nonconforming finite elements with the integral-value degrees of freedom. The standard nonconforming Galerkin method is employed in this IFE method without any penalty stabilization term. Error estimates in energy and L2 norms are proved to be better than $O(h\sqrt{|\log h|})$ and $O(h^2|\log h|)$, respectively, where the logarithm factors reflect jump discontinuity. Numerical results are reported to confirm our analysis.

math.NA↗

Parallelized JUNO simulation software based on SNiPER

The Jiangmen Underground Neutrino Observatory (JUNO) is a neutrino experiment to determine neutrino mass hierarchy. It has a central detector used for neutrino detection, which consists of a spherical acrylic vessel containing 20 kt LS and about 18,000 20-inch PMTs to collect light from LS. Around the CD, there is a water pool to shield radioactivities. The WP is equipped with about 2000 PMTs to measure cosmic ray muons by detecting Cherenkov light. As one of the important parts in JUNO offline software, the serial simulation framework is developed based on SNiPER. It is in charge of physics generator, detector simulation, event mixing and digitization. However Geant4 based detector simulation of such a large detector is time-consuming and challenging. It is necessary to take full advantages of parallel computing to speedup simulation. Starting from version 10, Geant4 supports event-level parallelism. Even though based on pthread, it could be extended with other libraries such as Intel TBB. Therefore it is possible to parallelize JUNO simulation framework via integrating Geant4 and SNiPER. In this paper, our progress in developing parallelized simulation software are presented. The SNiPER framework can run in sequential mode, Intel TBB mode or other modes. The SNiPER task component is in charge of event loop, which is like a simplified application manager. Two types of tasks are introduced in the simulation framework, one is global task and another is worker task. The global task will run only once to initialize detector geometry and physics processes. The worker tasks will be spawned after global task is done. In each worker task, a Geant4 run manager is invoked to do the real simulation. Therefore the simulation framework and the underlying TBB have been decoupled. Finally, the software performance of parallelized JUNO simulation software is also presented.

physics.ins-det↗

The Application of SNiPER to the JUNO Simulation

JUNO is a multipurpose neutrino experiment which is designed to determine neutrino mass hierarchy and precisely measure oscillation parameters. As one of the important systems, the JUNO offline software is being developed using the SNiPER software. In this proceeding, we focus on the requirements of JUNO simulation and present the working solution based on the SNiPER. The JUNO simulation framework is in charge of managing event data, detector geometries and materials, physics processes, simulation truth information etc. It glues physics generator, detector simulation and electronics simulation modules together to achieve a full simulation chain. In the implementation of the framework, many attractive characteristics of the SNiPER have been used, such as dynamic loading, flexible flow control, multiple event management and Python binding. Furthermore, additional efforts have been made to make both detector and electronics simulation flexible enough to accommodate and optimize different detector designs. For the Geant4-based detector simulation, each sub-detector component is implemented as a SNiPER tool which is a dynamically loadable and configurable plugin. So it is possible to select the detector configuration at runtime. The framework provides the event loop to drive the detector simulation and interacts with the Geant4 which is implemented as a passive service. All levels of user actions are wrapped into different customizable tools, so that user functions can be easily extended by just adding new tools. The electronics simulation has been implemented by following an event driven scheme. The SNiPER task component is used to simulate data processing steps in the electronics modules. The electronics and trigger are synchronized by triggered events containing possible physics signals.

physics.ins-det↗

Exploring detection of nuclearites in a large liquid scintillator neutrino detector

We take the JUNO experiment as an example to explore nuclearites in the future large liquid scintillator detector. Comparing to the previous calculations, the visible energy of nuclearites across the liquid scintillator will be reestimated for the liquid scintillator based detector. Then the JUNO sensitivities to the nuclearite flux are presented. It is found that the JUNO projected sensitivities can be better than $7.7 \times 10^{-17} {\rm cm^{-2} s^{-1} sr^{-1}}$ for the nuclearite mass $10^{15} \; {\rm GeV} \leq M \leq 10^{24}$ GeV and initial velocity $10^{-4} \leq β_0 \leq 10^{-1}$ with a 20 year running. Note that the JUNO will give the most stringent limits for downgoing nuclearites with $1.6 \times 10^{13} \; {\rm GeV} \leq M \leq 4.0 \times 10^{15}$ GeV and a typical galactic velocity $β_0 = 10^{-3}$.

hep-ph↗

A Chunk Caching Location and Searching Scheme in Content Centric Networking

Content Centric Networking (CCN) is a new network infrastructure around content dissemination and retrieval, shift from host addresses to named data. Each CCN router has a cache to store the chunks passed by it. Therefore the caching strategy about chunk placement can greatly affect the whole CCN performance. This paper proposes an implicit coordinate chunk caching location and searching scheme (CLS) in CCN hierarchical infrastructure. In CLS, there is at most one copy of a chunk cached on the path between a server and a leaf router. This copy is pulled down one level towards the leaf router by a request or pushed up one level towards the server by the cache eviction. Thus, it is possible to store more diverse contents in the whole CCN and improve the network performance. Plus, in order to reduce the server workload and file download time, a caching trail of chunk is created to direct the following request where to find the chunk. Extensive test-bed experiments have been performed to evaluate the proposed scheme in terms of a wide range of performance metrics. The results show that the proposed scheme outperforms existing algorithms.

cs.NI↗

Nonconforming Immersed Finite Element Spaces For Elliptic Interface Problems

In this paper, we use a unified framework introduced in [3] to study two classes of nonconforming immersed finite element (IFE) spaces with integral value degrees of freedom. The shape functions on interface elements are piecewise polynomials defined on sub-elements separated either by the actual interface or its line approximation. In this unified framework, we use the invertibility of the well known Sherman-Morison systems to prove the existence and uniqueness of shape functions on each interface element in either rectangular or triangular mesh. Furthermore, we develop a multi-edge expansion for piecewise functions and a group of identities for nonconforming IFE functions which enable us to show that these IFE spaces have the optimal approximation capability.

math.NA↗

Fast Muon Simulation in the JUNO Central Detector

The Jiangmen Underground Neutrino Observatory (JUNO) is a multi-purpose neutrino experiment designed to measure the neutrino mass hierarchy using a central detector (CD), which contains 20 kton liquid scintillator (LS) surrounded by about 17,000 photomultiplier tubes (PMTs). Due to the large fiducial volume and huge number of PMTs, the simulation of a muon particle passing through the CD with the Geant4 toolkit becomes an extremely computation-intensive task. This paper presents a fast simulation implementation using a so-called voxel method: for scintillation photons generated in a certain LS voxel, the PMT's response is produced beforehand with Geant4 and then introduced into the simulation at runtime. This parameterisation method successfully speeds up the most CPU consuming process, the optical photon's propagation in the LS, by a factor of 50. In the paper, the comparison of physics performance between fast and full simulation is also given.

physics.ins-det↗

Neutrino Physics with JUNO

The Jiangmen Underground Neutrino Observatory (JUNO), a 20 kton multi-purpose underground liquid scintillator detector, was proposed with the determination of the neutrino mass hierarchy as a primary physics goal. It is also capable of observing neutrinos from terrestrial and extra-terrestrial sources, including supernova burst neutrinos, diffuse supernova neutrino background, geoneutrinos, atmospheric neutrinos, solar neutrinos, as well as exotic searches such as nucleon decays, dark matter, sterile neutrinos, etc. We present the physics motivations and the anticipated performance of the JUNO detector for various proposed measurements. By detecting reactor antineutrinos from two power plants at 53-km distance, JUNO will determine the neutrino mass hierarchy at a 3-4 sigma significance with six years of running. The measurement of antineutrino spectrum will also lead to the precise determination of three out of the six oscillation parameters to an accuracy of better than 1\%. Neutrino burst from a typical core-collapse supernova at 10 kpc would lead to ~5000 inverse-beta-decay events and ~2000 all-flavor neutrino-proton elastic scattering events in JUNO. Detection of DSNB would provide valuable information on the cosmic star-formation rate and the average core-collapsed neutrino energy spectrum. Geo-neutrinos can be detected in JUNO with a rate of ~400 events per year, significantly improving the statistics of existing geoneutrino samples. The JUNO detector is sensitive to several exotic searches, e.g. proton decay via the $p\to K^++\barν$ decay channel. The JUNO detector will provide a unique facility to address many outstanding crucial questions in particle and astrophysics. It holds the great potential for further advancing our quest to understanding the fundamental properties of neutrinos, one of the building blocks of our Universe.

physics.ins-det↗

Simulation of natural radioactivity backgrounds in the central detector

The Jiangmen Underground Neutrino Observatory (JUNO) is an experiment proposed to determine the neutrino mass hierarchy and probe the fundamental properties of neutrino oscillation. The JUNO central detector is a spherical liquid scintillator detector with 20 kton fiducial mass. It is required to achieve a $3\%/\sqrt{E(MeV)}$ energy resolution with very low radioactive background, which is a big challenge to the detector design. In order to ensure the detector performance can meet the physics requirements, reliable detector simulation is necessary to provide useful information for detector design. A simulation study of natural radioactivity backgrounds in the JUNO central detector has been performed to guide the detector design and set requirements to the radiopurity of detector materials.

physics.ins-det↗

A Priori Error Estimates for Some Discontinuous Galerkin Immersed Finite Element Methods

In this paper, we derive a priori error estimates for a class of interior penalty discontinuous Galerkin (DG) methods using immersed finite element (IFE) functions for a classic second-order elliptic interface problem. The error estimation shows that these methods can converge optimally in a mesh-dependent energy norm. The combination of IFEs and DG formulation in these methods allows local mesh refinement in the Cartesian mesh structure for interface problems. Numerical results are provided to demonstrate the convergence and local mesh refinement features of these DG-IFE methods.

math.NA↗

Partially Penalized Immersed Finite Element Methods for Elliptic Interface Problems

This article presents new immersed finite element (IFE) methods for solving the popular second order elliptic interface problems on structured Cartesian meshes even if the involved interfaces have nontrivial geometries. These IFE methods contain extra stabilization terms introduced only at interface edges for penalizing the discontinuity in IFE functions. With the enhanced stability due to the added penalty, not only these IFE methods can be proven to have the optimal convergence rate in the H1-norm provided that the exact solution has sufficient regularity, but also numerical results indicate that their convergence rates in both the H1-norm and the L2-norm do not deteriorate when the mesh becomes finer which is a shortcoming of the classic IFE methods in some situations. Trace inequalities are established for both linear and bilinear IFE functions that are not only critical for the error analysis of these new IFE methods, but also are of a great potential to be useful in error analysis for other IFE methods.

math.NA↗