arXiv subjects

Yang Li

Publications and source records attributed to Yang Li.

At least 1,117 records · Page 62Linked to original sources

arXiv2022

Lorentz transformation in Maxwell equations for slowly moving media

We use the method of field decomposition, a technique widely used in relativistic magnetohydrodynamics, to study the small velocity approximation (SVA) of the Lorentz transformation in Maxwell equations for slowly moving media. The "deformed" Maxwell equations derived under the SVA in the lab frame can be put into the conventional form of Maxwell equations in the medium's comoving frame. Our results show that the Lorentz transformation in the SVA up to $O(v/c)$ ($v$ is the speed of the medium and $c$ is the speed of light in vacuum) is essential to derive these equations: the time and charge density must also change when transforming to a different frame even in the SVA, not just the position and current density as in the Galilean transformation. This marks the essential difference of the Lorentz transformation from the Galilean one. We show that the integral forms of Faraday and Ampere equations for slowly moving surfaces are consistent with Maxwell equations. We also present Faraday equation the covariant integral form in which the electromotive force can be defined as a Lorentz scalar independent of the observer's frame. No evidences exist to support an extension or modification of Maxwell equations.

physics.class-ph↗

arXiv2022

Snowmass2021 Whitepaper: Muonium to antimuonium conversion

The spontaneous muonium to antimuonium conversion is one of the interesting charged lepton flavor violation processes. It serves as a clear indication of new physics and plays an important role in constraining the parameter space beyond Standard Model. MACE is a proposed experiment to probe such a phenomenon and expected to enhance the sensitivity to the conversion probability by more than two orders of magnitude from the current best upper constraint obtained by the PSI experiment two decades ago. Recent developments in the theoretical and experimental aspects to search for such a rare process are summarized.

hep-ph↗

arXiv2022

Complete Calabi-Yau metrics in the complement of two divisors

We construct new complete Calabi-Yau metrics on the complement of an anticanonical divisors $D$ in a Fano manifold of dimension at least three, when $D$ consists of two transversely intersecting smooth divisors. The asymptotic geometry is modeled on a generalization of the Calabi ansatz, related to the non-archimedean Monge-Ampère equation.

math.DG↗

arXiv2022

Bridging Pre-trained Language Models and Hand-crafted Features for Unsupervised POS Tagging

In recent years, large-scale pre-trained language models (PLMs) have made extraordinary progress in most NLP tasks. But, in the unsupervised POS tagging task, works utilizing PLMs are few and fail to achieve state-of-the-art (SOTA) performance. The recent SOTA performance is yielded by a Guassian HMM variant proposed by He et al. (2018). However, as a generative model, HMM makes very strong independence assumptions, making it very challenging to incorporate contexualized word representations from PLMs. In this work, we for the first time propose a neural conditional random field autoencoder (CRF-AE) model for unsupervised POS tagging. The discriminative encoder of CRF-AE can straightforwardly incorporate ELMo word representations. Moreover, inspired by feature-rich HMM, we reintroduce hand-crafted features into the decoder of CRF-AE. Finally, experiments clearly show that our model outperforms previous state-of-the-art models by a large margin on Penn Treebank and multilingual Universal Dependencies treebank v2.0.

cs.CL↗

arXiv2022

Experimental Demonstration of High-Rate Discrete-Modulated Continuous-Variable Quantum Key Distribution System

A high-rate continuous-variable quantum key distribution (CV-QKD) system based on high-order discrete modulation is experimentally investigated. With the help of the novel system scheme, effective digital signal processing algorithms and advanced analytical security proof method, the transmission results of 5 km, 10 km, 25 km, and 50 km are achieved for the 1 GBaud optimized quantum signals. Correspondingly, the asymptotic secret key rate (SKR) is 288.421 Mbps, 159.395 Mbps, 50.004 Mbps and 7.579 Mbps for discrete Gaussian (DG) 64QAM, and 326.708 Mbps, 179.348 Mbps, 50.623 Mbps and 9.212 Mbps for DG 256QAM. Under the same parameters, the achieved SKRs of DG 256QAM is almost same to ideal Gaussian modulation. In this case, the demonstrated high-rate discrete modulated CV-QKD system has the application potential for high speed security communication under tens of kilometers.

quant-ph↗

arXiv2022

Efficient Training of the Memristive Deep Belief Net Immune to Non-Idealities of the Synaptic Devices

The tunability of conductance states of various emerging non-volatile memristive devices emulates the plasticity of biological synapses, making it promising in the hardware realization of large-scale neuromorphic systems. The inference of the neural network can be greatly accelerated by the vector-matrix multiplication (VMM) performed within a crossbar array of memristive devices in one step. Nevertheless, the implementation of the VMM needs complex peripheral circuits and the complexity further increases since non-idealities of memristive devices prevent precise conductance tuning (especially for the online training) and largely degrade the performance of the deep neural networks (DNNs). Here, we present an efficient online training method of the memristive deep belief net (DBN). The proposed memristive DBN uses stochastically binarized activations, reducing the complexity of peripheral circuits, and uses the contrastive divergence (CD) based gradient descent learning algorithm. The analog VMM and digital CD are performed separately in a mixed-signal hardware arrangement, making the memristive DBN high immune to non-idealities of synaptic devices. The number of write operations on memristive devices is reduced by two orders of magnitude. The recognition accuracy of 95%~97% can be achieved for the MNIST dataset using pulsed synaptic behaviors of various memristive synaptic devices.

eess.SP↗

arXiv2022

Facilitating Database Tuning with Hyper-Parameter Optimization: A Comprehensive Experimental Evaluation

Recently, using automatic configuration tuning to improve the performance of modern database management systems (DBMSs) has attracted increasing interest from the database community. This is embodied with a number of systems featuring advanced tuning capabilities being developed. However, it remains a challenge to select the best solution for database configuration tuning, considering the large body of algorithm choices. In addition, beyond the applications on database systems, we could find more potential algorithms designed for configuration tuning. To this end, this paper provides a comprehensive evaluation of configuration tuning techniques from a broader perspective, hoping to better benefit the database community. In particular, we summarize three key modules of database configuration tuning systems and conduct extensive ablation studies using various challenging cases. Our evaluation demonstrates that the hyper-parameter optimization algorithms can be borrowed to further enhance the database configuration tuning. Moreover, we identify the best algorithm choices for different modules. Beyond the comprehensive evaluations, we offer an efficient and unified database configuration tuning benchmark via surrogates that reduces the evaluation cost to a minimum, allowing for extensive runs and analysis of new techniques.

cs.DB↗

arXiv2022

A Robust Approach for the Decomposition of High-Energy-Consuming Industrial Loads with Deep Learning

The knowledge of the users' electricity consumption pattern is an important coordinating mechanism between the utility company and the electricity consumers in terms of key decision makings. The load decomposition is therefore crucial to reveal the underlying relationship between the load consumption and its characteristics. However, load decomposition is conventionally performed on the residential and commercial loads, and adequate consideration has not been given to the high-energy-consuming industrial loads leading to inefficient results. This paper thus focuses on the load decomposition of the industrial park loads (IPL). The commonly used parameters in a conventional method are however inapplicable in high-energy-consuming industrial loads. Therefore, a more robust approach is developed comprising a three-algorithm model to achieve this goal on the IPL. First, the improved variational mode decomposition (IVMD) algorithm is introduced to denoise the training data of the IPL and improve its stability. Secondly, the convolutional neural network (CNN) and simple recurrent units (SRU) joint algorithms are used to achieve a non-intrusive and non-invasive decomposition process of the IPL using a double-layer deep learning network based on the IPL characteristics. Specifically, CNN is used to extract the IPL data characteristics while the improved long and short-term memory (LSTM) network, SRU, is adopted to develop the decomposition model and further train the load data. Through the robust decomposition process, the underlying relationship in the load consumption is extracted. The results obtained from the numerical examples show that this approach outperforms the state-of-the-art in the conventional decomposition process.

cs.LG↗

arXiv2022

HDL: Hybrid Deep Learning for the Synthesis of Myocardial Velocity Maps in Digital Twins for Cardiac Analysis

Synthetic digital twins based on medical data accelerate the acquisition, labelling and decision making procedure in digital healthcare. A core part of digital healthcare twins is model-based data synthesis, which permits the generation of realistic medical signals without requiring to cope with the modelling complexity of anatomical and biochemical phenomena producing them in reality. Unfortunately, algorithms for cardiac data synthesis have been so far scarcely studied in the literature. An important imaging modality in the cardiac examination is three-directional CINE multi-slice myocardial velocity mapping (3Dir MVM), which provides a quantitative assessment of cardiac motion in three orthogonal directions of the left ventricle. The long acquisition time and complex acquisition produce make it more urgent to produce synthetic digital twins of this imaging modality. In this study, we propose a hybrid deep learning (HDL) network, especially for synthetic 3Dir MVM data. Our algorithm is featured by a hybrid UNet and a Generative Adversarial Network with a foreground-background generation scheme. The experimental results show that from temporally down-sampled magnitude CINE images (six times), our proposed algorithm can still successfully synthesise high temporal resolution 3Dir MVM CMR data (PSNR=42.32) with precise left ventricle segmentation (DICE=0.92). These performance scores indicate that our proposed HDL algorithm can be implemented in real-world digital twins for myocardial velocity mapping data simulation. To the best of our knowledge, this work is the first one in the literature investigating digital twins of the 3Dir MVM CMR, which has shown great potential for improving the efficiency of clinical studies via synthesised cardiac data.

eess.IV↗

arXiv2022

Secure two-way fiber-optic time transfer against sub-ns asymmetric delay attack

Two-way fiber-optic time transfer is a promising precise time synchronization technique with sub-nanosecond accuracy. However, asymmetric delay attack is a serious threat which cannot be prevent by any encryption method. In this paper, a dynamic model based scheme is proposed to defense the sub-nanosecond asymmetric delay attack. A threshold is set according to the estimated time difference by a two-state clock model where the fixed frequency difference is excluded from the time difference to detect the asymmetric delay attack which is smaller than the time difference induced by the fixed frequency difference. Theoretical simulation and experimental demonstration are implemented to prove the feasibility of the scheme. A two-way fiber-optic time transfer system with time stability with 24.5ps, 3.98ps, and 2.95ps at 1s, 10s, and 100s averaging time is shown under sub-ns asymmetric time delay attack experimentally. The proposed method provides a promising secure sub-ns precise time synchronization technique against asymmetric delay attack.

quant-ph↗

arXiv2022

Lepard: Learning partial point cloud matching in rigid and deformable scenes

We present Lepard, a Learning based approach for partial point cloud matching in rigid and deformable scenes. The key characteristics are the following techniques that exploit 3D positional knowledge for point cloud matching: 1) An architecture that disentangles point cloud representation into feature space and 3D position space. 2) A position encoding method that explicitly reveals 3D relative distance information through the dot product of vectors. 3) A repositioning technique that modifies the crosspoint-cloud relative positions. Ablation studies demonstrate the effectiveness of the above techniques. In rigid cases, Lepard combined with RANSAC and ICP demonstrates state-of-the-art registration recall of 93.9% / 71.3% on the 3DMatch / 3DLoMatch. In deformable cases, Lepard achieves +27.1% / +34.8% higher non-rigid feature matching recall than the prior art on our newly constructed 4DMatch / 4DLoMatch benchmark.

cs.CV↗

arXiv2022

Thomas-Yau conjecture and holomorphic curves

The main theme of this paper is the Thomas-Yau conjecture, primarily in the setting of exact, (quantitatively) almost calibrated, unobstructed Lagrangian branes inside Calabi-Yau Stein manifolds. In our interpretation, the conjecture is that Thomas-Yau semistability is equivalent to the existence of special Lagrangian representatives. We clarify how holomorphic curves enter this conjectural picture, through the construction of bordism currents between Lagrangians, and in the definition of the Solomon functional. Under some extra hypothesis, we shall prove Floer theoretic obstructions to the existence of special Lagrangians, using the technique of integration over moduli spaces. In the converse direction, we set up a variational framework with the goal of finding special Lagrangians under the Thomas-Yau semistability asumption, and we shall make sufficient progress to pinpoint the outstanding technical difficulties, both in Floer theory and in geometric measure theory.

math.SG↗

arXiv2022

Smart Tracking Tray System for A Smart and Sustainable Wet Lab Community

The laboratories and research institutes are the major places for cutting-edge scientific exploration. Hundreds of millions of research papers were formed from front-line labs. Behind this glorious achievement were unsustainable facts. More and more human investment is required in innovative experimental design and analysis of results. However, the laboratory operating environment has not been subversively transformed for centuries. This abstract proposed a smart tracking system, consisting of IoT and Data Visualization technologies, to track the chemicals in an automatic and timely approach. Positive feedback has been collected from pilot tests in several labs. The system benefits various lab users in their daily work and improves their working efficiency. In the long run, it will play an essential role in promoting the efficient use of lab resources and achieving the goal of sustainable labs.

eess.SP↗

arXiv2022

Bridge the Gap between Supervised and Unsupervised Learning for Fine-Grained Classification

Unsupervised learning technology has caught up with or even surpassed supervised learning technology in general object classification (GOC) and person re-identification (re-ID). However, it is found that the unsupervised learning of fine-grained visual classification (FGVC) is more challenging than GOC and person re-ID. In order to bridge the gap between unsupervised and supervised learning for FGVC, we investigate the essential factors (including feature extraction, clustering, and contrastive learning) for the performance gap between supervised and unsupervised FGVC. Furthermore, we propose a simple, effective, and practical method, termed as UFCL, to alleviate the gap. Three key issues are concerned and improved: First, we introduce a robust and powerful backbone, ResNet50-IBN, which has an ability of domain adaptation when we transfer ImageNet pre-trained models to FGVC tasks. Next, we propose to introduce HDBSCAN instead of DBSCAN to do clustering, which can generate better clusters for adjacent categories with fewer hyper-parameters. Finally, we propose a weighted feature agent and its updating mechanism to do contrastive learning by using the pseudo labels with inevitable noise, which can improve the optimization process of learning the parameters of the network. The effectiveness of our UFCL is verified on CUB-200-2011, Oxford-Flowers, Oxford-Pets, Stanford-Dogs, Stanford-Cars and FGVC-Aircraft datasets. Under the unsupervised FGVC setting, we achieve state-of-the-art results, and analyze the key factors and the important parameters to provide a practical guidance.

cs.CV↗

arXiv2022

PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm

Graph neural networks (GNNs) have achieved state-of-the-art performance in various graph-based tasks. However, as mainstream GNNs are designed based on the neural message passing mechanism, they do not scale well to data size and message passing steps. Although there has been an emerging interest in the design of scalable GNNs, current researches focus on specific GNN design, rather than the general design space, limiting the discovery of potential scalable GNN models. This paper proposes PasCa, a new paradigm and system that offers a principled approach to systemically construct and explore the design space for scalable GNNs, rather than studying individual designs. Through deconstructing the message passing mechanism, PasCa presents a novel Scalable Graph Neural Architecture Paradigm (SGAP), together with a general architecture design space consisting of 150k different designs. Following the paradigm, we implement an auto-search engine that can automatically search well-performing and scalable GNN architectures to balance the trade-off between multiple criteria (e.g., accuracy and efficiency) via multi-objective optimization. Empirical studies on ten benchmark datasets demonstrate that the representative instances (i.e., PasCa-V1, V2, and V3) discovered by our system achieve consistent performance among competitive baselines. Concretely, PasCa-V3 outperforms the state-of-the-art GNN method JK-Net by 0.4\% in terms of predictive accuracy on our large industry dataset while achieving up to $28.3\times$ training speedups.

cs.LG↗

arXiv2022

Homography Decomposition Networks for Planar Object Tracking

Planar object tracking plays an important role in AI applications, such as robotics, visual servoing, and visual SLAM. Although the previous planar trackers work well in most scenarios, it is still a challenging task due to the rapid motion and large transformation between two consecutive frames. The essential reason behind this problem is that the condition number of such a non-linear system changes unstably when the searching range of the homography parameter space becomes larger. To this end, we propose a novel Homography Decomposition Networks(HDN) approach that drastically reduces and stabilizes the condition number by decomposing the homography transformation into two groups. Specifically, a similarity transformation estimator is designed to predict the first group robustly by a deep convolution equivariant network. By taking advantage of the scale and rotation estimation with high confidence, a residual transformation is estimated by a simple regression model. Furthermore, the proposed end-to-end network is trained in a semi-supervised fashion. Extensive experiments show that our proposed approach outperforms the state-of-the-art planar tracking methods at a large margin on the challenging POT, UCSB and POIC datasets.

cs.CV↗

arXiv2022

Probabilistic load flow calculation of AC/DC hybrid system based on cumulant method

The operating conditions of the power system have become more complex and changeable. This paper proposes a probabilistic load flow based on the cumulant method (PLF-CM) for the voltage sourced converter high voltage direct current (VSC-HVDC) hybrid system containing photovoltaic grid-connected systems. Firstly, the corresponding control mode is set for the converter, including droop control and master-slave control. The unified iterative method is used to calculate the conventional AC/DC flow. Secondly, on the basis of the probability model of load and photovoltaic output, based on the aforementioned flow results, use correlation coefficient matrix of this paper will change the relevant sample into independent sample, the cumulants of the load and photovoltaic output are obtained; then, the probability density function (PDF) and cumulative distribution function (CDF) of state variables are obtained by using Gram-Charlie series expansion method. Finally, the mean value and standard deviation of node voltage and line power are calculated on the modified IEEE 34-bus and IEEE 57-bus transmission systems. The algorithm can reflect the inherent uncertainty of new energy sources, and replace the complex convolution operation, greatly improving the calculation speed and the convergence.

eess.SY↗

arXiv2022

Active and Passive Hybrid Detection Method for Power CPS False Data Injection Attacks with Improved AKF and GRU-CNN

Influenced by deep penetration of the new generation of information technology, power systems have gradually evolved into highly coupled cyber-physical systems (CPS). Among many possible power CPS network attacks, a false data injection attacks (FDIAs) is the most serious. Taking account of the fact that the existing knowledge-driven detection process for FDIAs has been in a passive detection state for a long time and ignores the advantages of data-driven active capture of features, an active and passive hybrid detection method for power CPS FDIAs with improved adaptive Kalman filter (AKF) and convolutional neural networks (CNN) is proposed in this paper. First, we analyze the shortcomings of the traditional AKF algorithm in terms of filtering divergence and calculation speed. The state estimation algorithm based on non-negative positive-definite adaptive Kalman filter (NDAKF) is improved, and a passive detection method of FDIAs is constructed, with similarity Euclidean distance detection and residual detection at its core. Then, combined with the advantages of gate recurrent unit (GRU) and CNN in terms of temporal memory and feature-expression ability, an active detection method of FDIAs based on a GRU-CNN hybrid neural network is proposed. Finally, the results of joint knowledge-driven and data-driven parallel detection are used to define a mixed fixed-calculation formula, and an active and passive hybrid detection method of FDIAs is established, considering the characteristic constraints of the parallel mode. A simulation system example of power CPS FDIAs verifies the effectiveness and accuracy of the method proposed in this paper.

eess.SY↗