Searcharxiv⌕ Search

arXiv subjects

Jing Li

Publications and source records attributed to Jing Li.

At least 667 records · Page 37Linked to original sources

Model reduction for a power grid model

We apply model reduction techniques to the DeMarco power grid model. The DeMarco model, when augmented by an appropriate line failure mechanism, can be used to study cascade failures. Here we examine the DeMarco model without the line failure mechanism and we investigate how to construct reduced order models for subsets of the state variables. We show that due to the oscillating nature of the solutions and the absence of timescale separation between resolved and unresolved variables, the construction of accurate reduced models becomes highly non-trivial since one has to account for long memory effects. In addition, we show that a reduced model which includes even a short memory is drastically better than a memoryless model.

eess.SP↗

MLSys: The New Frontier of Machine Learning Systems

Machine learning (ML) techniques are enjoying rapidly increasing adoption. However, designing and implementing the systems that support ML models in real-world deployments remains a significant obstacle, in large part due to the radically different development and deployment profile of modern ML methods, and the range of practical concerns that come with broader adoption. We propose to foster a new systems machine learning research community at the intersection of the traditional systems and ML communities, focused on topics such as hardware systems for ML, software systems for ML, and ML optimized for metrics beyond predictive accuracy. To do this, we describe a new conference, MLSys, that explicitly targets research at the intersection of systems and machine learning with a program committee split evenly between experts in systems and ML, and an explicit focus on topics at the intersection of the two.

cs.LG↗

Deep Image-to-Video Adaptation and Fusion Networks for Action Recognition

Existing deep learning methods for action recognition in videos require a large number of labeled videos for training, which is labor-intensive and time-consuming. For the same action, the knowledge learned from different media types, e.g., videos and images, may be related and complementary. However, due to the domain shifts and heterogeneous feature representations between videos and images, the performance of classifiers trained on images may be dramatically degraded when directly deployed to videos. In this paper, we propose a novel method, named Deep Image-to-Video Adaptation and Fusion Networks (DIVAFN), to enhance action recognition in videos by transferring knowledge from images using video keyframes as a bridge. The DIVAFN is a unified deep learning model, which integrates domain-invariant representations learning and cross-modal feature fusion into a unified optimization framework. Specifically, we design an efficient cross-modal similarities metric to reduce the modality shift among images, keyframes and videos. Then, we adopt an autoencoder architecture, whose hidden layer is constrained to be the semantic representations of the action class names. In this way, when the autoencoder is adopted to project the learned features from different domains to the same space, more compact, informative and discriminative representations can be obtained. Finally, the concatenation of the learned semantic feature representations from these three autoencoders are used to train the classifier for action recognition in videos. Comprehensive experiments on four real-world datasets show that our method outperforms some state-of-the-art domain adaptation and action recognition methods.

cs.CV↗

Generalizable Resource Allocation in Stream Processing via Deep Reinforcement Learning

This paper considers the problem of resource allocation in stream processing, where continuous data flows must be processed in real time in a large distributed system. To maximize system throughput, the resource allocation strategy that partitions the computation tasks of a stream processing graph onto computing devices must simultaneously balance workload distribution and minimize communication. Since this problem of graph partitioning is known to be NP-complete yet crucial to practical streaming systems, many heuristic-based algorithms have been developed to find reasonably good solutions. In this paper, we present a graph-aware encoder-decoder framework to learn a generalizable resource allocation strategy that can properly distribute computation tasks of stream processing graphs unobserved from training data. We, for the first time, propose to leverage graph embedding to learn the structural information of the stream processing graphs. Jointly trained with the graph-aware decoder using deep reinforcement learning, our approach can effectively find optimized solutions for unseen graphs. Our experiments show that the proposed model outperforms both METIS, a state-of-the-art graph partitioning algorithm, and an LSTM-based encoder-decoder model, in about 70% of the test cases.

cs.LG↗

Discrete Argument Representation Learning for Interactive Argument Pair Identification

In this paper, we focus on extracting interactive argument pairs from two posts with opposite stances to a certain topic. Considering opinions are exchanged from different perspectives of the discussing topic, we study the discrete representations for arguments to capture varying aspects in argumentation languages (e.g., the debate focus and the participant behavior). Moreover, we utilize hierarchical structure to model post-wise information incorporating contextual knowledge. Experimental results on the large-scale dataset collected from CMV show that our proposed framework can significantly outperform the competitive baselines. Further analyses reveal why our model yields superior performance and prove the usefulness of our learned representations.

cs.CL↗

Landau Levels of Bilayer Graphene in a WSe$_2$/Bilayer Graphene van der Waals Heterostructure

Heterostructures formed between two different van der Waals materials enable interactions and functionalities absent in each component. In this work we show that vicinity to an atomically thin WSe$_2$ sheet dramatically impacts the energies of the symmetry-broken low Landau levels of bilayer graphene, possibly due to screening. We present a systematic study of the magnetic field and electrical displacement field dependences of the Landau level gaps at filling factor $ν$ = 1, 2, 3, and compare to BN encapsulated pristine bilayer graphene. The exchange-dominated energy splitting between the N = 0 and 1 orbital wave functions is significantly enhanced, which leads to a modified phase diagram at filling factor $ν$ = 0 and larger energy gaps at $ν$ = 1 and 3 in WSe$_2$/bilayer graphene heterostructures. The exchange-enhanced spin gap at $ν$ = 2, on the other hand, is reduced by approximately two-fold. Our results demonstrate a possible way to engineer quantum Hall phenomena via van der Waals heterostructures.

cond-mat.mes-hall↗

An improved bound for strong unitary uncertainty relations with refined sequence

We derive the lower bound of uncertainty relations of two unitary operators for a class of states based on the geometric-arithmetic inequality and Cauchy-Schwarz inequality. Furthermore, we propose a set of uncertainty relations for three unitary operators. Compared to the known bound introduced in Phys.Rev.A.100,022116(2019), the unitary uncertainty relations bound with our method is tighter, to a certain extent. Meanwhile, some examples are given in the paper to illustrate our conclusions.

quant-ph↗

A Spin Quintet in a Silicon Double Quantum Dot: Spin Blockade and Relaxation

Spins in gate-defined silicon quantum dots are promising candidates for implementing large-scale quantum computing. To read the spin state of these qubits, the mechanism that has provided the highest fidelity is spin-to-charge conversion via singlet-triplet spin blockade, which can be detected in-situ using gate-based dispersive sensing. In systems with a complex energy spectrum, like silicon quantum dots, accurately identifying when singlet-triplet blockade occurs is hence of major importance for scalable qubit readout. In this work, we present a description of spin blockade physics in a tunnel-coupled silicon double quantum dot defined in the corners of a split-gate transistor. Using gate-based magnetospectroscopy, we report successive steps of spin blockade and spin blockade lifting involving spin states with total spin angular momentum up to $S=3$. More particularly, we report the formation of a hybridized spin quintet state and show triplet-quintet and quintet-septet spin blockade. This enables studies of the quintet relaxation dynamics from which we find $T_1 \sim 4 ~μs$. Finally, we develop a quantum capacitance model that can be applied generally to reconstruct the energy spectrum of a double quantum dot including the spin-dependent tunnel couplings and the energy splitting between different spin manifolds. Our results open for the possibility of using Si CMOS quantum dots as a tuneable platform for studying high-spin systems.

cond-mat.mes-hall↗

On Analysis of the Bitcoin and Prism Backbone Protocols

Bitcoin is a peer-to-peer payment system proposed by Nakamoto in 2008. Properties of the bitcoin backbone protocol have been investigated in some depth: the blockchain growth property quantifies the number of blocks added to the blockchain during any time intervals; the blockchain quality property ensures the honest miners always contribute at least a certain fraction of the blockchain; the common prefix property ensures if a block is deep enough, it will eventually be adopted by all honest miners with high probability. Following the spirit of decoupling various functionalities of the blockchain, the Prism protocol is proposed to dramatically improve the throughput while maintaining the same level of security. Prior analyses of the bitcoin and Prism backbone protocols assume the lifespan of blockchain is finite. This paper presents a streamlined and strengthened analysis without the finite horizon assumption. Specifically, the results include a blockchain growth property, a blockchain quality property, and a common prefix property of the bitcoin backbone protocol, as well as the liveness and persistence of the Prism backbone protocol regardless of whether the blockchains have a infinite lifespan. We also express the properties of bitcoin and Prism backbone protocols in explicit expressions rather than order optimal results, which lead to tighter bounds and practical references for public transaction ledger protocol design.

cs.CR↗

KAM theorem for reversible mapping of low smoothness with application

Assume the mapping $$A:\left\{ \begin{array}{ll} x_{1}=x+ω+y+f(x,y), y_{1}=y+g(x,y), \end{array} \right. (x, y)\in \mathbb{T}^{d}\times B(r_{0}) $$ is reversible with respect to $G: (x, y)\mapsto (-x, y),$ and $| f | _{C^{\ell}(\mathbb{T}^{d}\times B(r_{0}))}\leq \varepsilon_{0}, | g |_{C^{\ell+d}(\mathbb{T}^{d}\times B(r_{0}))}\leq \varepsilon_{0},$ where $B(r_{0}):=\{|y|\le r_0:\; y\in\mathbb R^d\},$ $\ell=2d+1+μ$ with $0<μ\ll 1.$ Then when $\varepsilon_{0}=\varepsilon_{0}(d)>0$ is small enough and $ω$ is Diophantine, the map $A$ possesses an invariantS torus with rotational frequency $ω.$ As an application of the obtained theorem, the Lagrange stability is proved for a class of reversible Duffing equation with finite smooth perturbation.

math.DS↗

Improving solution accuracy and convergence for stochastic physics parameterizations with colored noise

Stochastic parameterizations are used in numerical weather prediction and climate modeling to help capture the uncertainty in the simulations and improve their statistical properties. Convergence issues can arise when time integration methods originally developed for deterministic differential equations are applied naively to stochastic problems. (Hodyss et al 2013, 2014) demonstrated that a correction term to various deterministic numerical schemes, known in stochastic analysis as the Itô correction, can help improve solution accuracy and ensure convergence to the physically relevant solution without substantial computational overhead. The usual formulation of the Itô correction is valid only when the stochasticity is represented by {\it white} noise. In this study, a generalized formulation of the Itô correction is derived for noises of any color. The formulation is applied to a test problem described by an advection-diffusion equation forced with a spectrum of fast processes. We present numerical results for cases with both constant and spatially varying advection velocities to show that, for the same time step sizes, the introduction of the generalized Itô correction helps to substantially reduce time integration error and significantly improve the convergence rate of the numerical solutions when the forcing term in the governing equation is rough (fast varying); alternatively, for the same target accuracy, the generalized Itô correction allows for the use of significantly longer time steps and hence helps to reduce the computational cost of the numerical simulation.

math.NA↗

Polarization fraction measurement in ZZ scattering using deep learning

Measuring longitudinally polarized vector boson scattering in the ZZ channel is a promising way to investigate unitarity restoration with the Higgs mechanism and to search for possible new physics. We investigated several deep neural network structures and compared their ability to improve the measurement of the longitudinal fraction Z_L Z_L. Using fast simulation with the Delphes framework, a clear improvement is found using a previously investigated 'particle-based' deep neural network on a preprocessed dataset and applying principle component analysis to the outputs.A significance of around 1.7 standard deviations can be achieved with the integrated luminosity of 3000 fb-1 that will be recorded at the High-Luminosity LHC.

hep-ph↗

Coupled density-spin Bose-Einstein condensates dynamics and collapse in systems with quintic nonlinearity

We investigate the effects of spin-orbit coupling and Zeeman splitting on the coupled density-spin dynamics and collapse of the Bose-Einstein condensate driven by the quintic self-attraction in the same- and cross-spin channels. The characteristic feature of the collapse is the decrease in the width as given by the participation ratio of the density rather than by the expectation values of the coordinate. Qualitative arguments and numerical simulations reveal the existence of a critical spin-orbit coupling strength which either prohibits or leads to the collapse, and its dependence on other parameters, such as the condensates norm, spin-dependent nonlinear coupling, and the Zeeman splitting. The entire nonlinear dynamics critically depend on the initial spin sate.

cond-mat.quant-gas↗

Tracing Kinematic and Chemical Properties of Sagittarius Stream by K-Giants, M-Giants, and BHB stars

We characterize the kinematic and chemical properties of $\sim$3,000 Sagittarius (Sgr) stream stars, including K-giants, M-giants, and BHBs, select from SEGUE-2, LAMOST, and SDSS separately in Integrals-of-Motion space. The orbit of Sgr stream is quite clear from the velocity vector in $X$-$Z$ plane. Stars traced by K-giants and M-giants present the apogalacticon of trailing steam is $\sim$ 100 kpc. The metallicity distributions of Sgr K-, M-giants, and BHBs present that the M-giants are on average the most metal-rich population, followed by K-giants and BHBs. All of the K-, M-giants, and BHBs indicate that the trailing arm is on average more metal-rich than leading arm, and the K-giants show that the Sgr debris is the most metal-poor part. The $α$-abundance of Sgr stars exhibits a similar trend with the Galactic halo stars at lower metallicity ([Fe/H] $<\sim$ $-$1.0 dex), and then evolve down to lower [$α$/Fe] than disk stars at higher metallicity, which is close to the evolution pattern of $α$-element of Milky Way dwarf galaxies. We find $V_Y$ and metallicity of K-giants have gradients along the direction of line-of-sight from the Galactic center in $X$-$Z$ plane, and the K-giants show that $V_Y$ increases with metallicity at [Fe/H] $>\sim-$1.5 dex. After dividing the Sgr stream into bright and faint stream according to their locations in equatorial coordinate, the K-giants and BHBs show that the bright and faint stream present different $V_Y$ and metallicities, the bright stream is on average higher in $V_Y$ and metallicity than the faint stream.

astro-ph.GA↗

Global Temporal Representation based CNNs for Infrared Action Recognition

Infrared human action recognition has many advantages, i.e., it is insensitive to illumination change, appearance variability, and shadows. Existing methods for infrared action recognition are either based on spatial or local temporal information, however, the global temporal information, which can better describe the movements of body parts across the whole video, is not considered. In this letter, we propose a novel global temporal representation named optical-flow stacked difference image (OFSDI) and extract robust and discriminative feature from the infrared action data by considering the local, global, and spatial temporal information together. Due to the small size of the infrared action dataset, we first apply convolutional neural networks on local, spatial, and global temporal stream respectively to obtain efficient convolutional feature maps from the raw data rather than train a classifier directly. Then these convolutional feature maps are aggregated into effective descriptors named three-stream trajectory-pooled deep-convolutional descriptors by trajectory-constrained pooling. Furthermore, we improve the robustness of these features by using the locality-constrained linear coding (LLC) method. With these features, a linear support vector machine (SVM) is adopted to classify the action data in our scheme. We conduct the experiments on infrared action recognition datasets InfAR and NTU RGB+D. The experimental results show that the proposed approach outperforms the representative state-of-the-art handcrafted features and deep learning features based methods for the infrared action recognition.

cs.CV↗

Transferable Feature Representation for Visible-to-Infrared Cross-Dataset Human Action Recognition

Recently, infrared human action recognition has attracted increasing attention for it has many advantages over visible light, that is, being robust to illumination change and shadows. However, the infrared action data is limited until now, which degrades the performance of infrared action recognition. Motivated by the idea of transfer learning, an infrared human action recognition framework using auxiliary data from visible light is proposed to solve the problem of limited infrared action data. In the proposed framework, we first construct a novel Cross-Dataset Feature Alignment and Generalization (CDFAG) framework to map the infrared data and visible light data into a common feature space, where Kernel Manifold Alignment (KEMA) and a dual alignedto-generalized encoders (AGE) model are employed to represent the feature. Then, a support vector machine (SVM) is trained, using both the infrared data and visible light data, and can classify the features derived from infrared data. The proposed method is evaluated on InfAR, which is a publicly available infrared human action dataset. To build up auxiliary data, we set up a novel visible light action dataset XD145. Experimental results show that the proposed method can achieve state-of-the-art performance compared with several transfer learning and domain adaptation methods.

cs.CV↗

Hierarchically Learned View-Invariant Representations for Cross-View Action Recognition

Recognizing human actions from varied views is challenging due to huge appearance variations in different views. The key to this problem is to learn discriminant view-invariant representations generalizing well across views. In this paper, we address this problem by learning view-invariant representations hierarchically using a novel method, referred to as Joint Sparse Representation and Distribution Adaptation (JSRDA). To obtain robust and informative feature representations, we first incorporate a sample-affinity matrix into the marginalized stacked denoising Autoencoder (mSDA) to obtain shared features, which are then combined with the private features. In order to make the feature representations of videos across views transferable, we then learn a transferable dictionary pair simultaneously from pairs of videos taken at different views to encourage each action video across views to have the same sparse representation. However, the distribution difference across views still exists because a unified subspace where the sparse representations of one action across views are the same may not exist when the view difference is large. Therefore, we propose a novel unsupervised distribution adaptation method that learns a set of projections that project the source and target views data into respective low-dimensional subspaces where the marginal and conditional distribution differences are reduced simultaneously. Therefore, the finally learned feature representation is view-invariant and robust for substantial distribution difference across views even the view difference is large. Experimental results on four multiview datasets show that our approach outperforms the state-ofthe-art approaches.

cs.CV↗