Searcharxiv⌕ Search

arXiv subjects

Jing Yang

Publications and source records attributed to Jing Yang.

At least 343 records · Page 19Linked to original sources

An Irreversible Synthetic Route to an Ultra-Strong Two-Dimensional Polymer

Polymers that extend covalently in two dimensions have attracted recent attention as a means of combining the mechanical strength and in-plane energy conduction of conventional two-dimensional (2D) materials with the low densities, synthetic processability, and organic composition of their one-dimensional counterparts. Efforts to date have proven successful in forms that do not allow full realization of these properties, such as polymerization at flat interfaces or fixation of monomers in immobilized lattices. A frequently employed synthetic approach is to introduce microscopic reversibility, at the cost of bond stability, to achieve 2D crystals after extensive error correction. Herein we demonstrate a synthetic route to 2D irreversible polycondensation directly in the solution phase, resulting in covalently bonded 2D polymer platelets that are chemically stable and highly processable. Further fabrication offers highly oriented, free-standing films which exhibit exceptional 2D elastic modulus and yield strength at 50.9 +- 15.0 GPa and 0.976 +- 0.113 GPa, respectively. Platelet alignment is evidenced by polarized photoluminescence centered at 580 and 680 nm from different dipole transitions. This new synthetic route provides opportunities for 2D polymers in applications ranging from composite structures to molecular sieving membranes.

cond-mat.soft↗

Experimental demonstration of superresolution of partially coherent light sources using parity sorting

Analyses based on quantum metrology have shown that the ability to localize the positions of two incoherent point sources can be significantly enhanced through the use of mode sorting. Here we theoretically and experimentally investigate the effect of partial coherence on the sub-diffraction limit localization of two sources based on parity sorting. With the prior information of a negative and real-valued degree of coherence, higher Fisher information is obtained than that for the incoherent case. Our results pave the way to clarifying the role of coherence in quantum limited metrology.

physics.optics↗

Some results about double cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^2\mathbb{F}_{q}$

Let $\mathbb{F}_{q}$ be the finite field with $q$ elements. This paper mainly researches the polynomial representation of double cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^2\mathbb{F}_{q}$ with $v^3=v$. Firstly, we give the generating polynomials of these double cyclic codes. Secondly, we show the generating matrices of them. Meanwhile, we get quantitative information related to them by the matrix forms. Finally, we investigate the relationship between the generators of double cyclic codes and their duals.

cs.IT↗

Revisiting the Concrete Security of Goldreich's Pseudorandom Generator

Local pseudorandom generators are a class of fundamental cryptographic primitives having very broad applications in theoretical cryptography. Following Couteau et al.'s work in ASIACRYPT 2018, this paper further studies the concrete security of one important class of local pseudorandom generators, i.e., Goldreich's pseudorandom generators. Our first attack is of the guess-and-determine type. Our result significantly improves the state-of-the-art algorithm proposed by Couteau et al., in terms of both asymptotic and concrete complexity, and breaks all the challenge parameters they proposed. For instance, for a parameter set suggested for 128 bits of security, we could solve the instance faster by a factor of about $2^{61}$, thereby destroying the claimed security completely. Our second attack further exploits the extremely sparse structure of the predicate $P_5$ and combines ideas from iterative decoding. This novel attack, named guess-and-decode, substantially improves the guess-and-determine approaches for cryptographic-relevant parameters. All the challenge parameter sets proposed in Couteau et al.'s work in ASIACRYPT 2018 aiming for 80-bit (128-bit) security levels can be solved in about $2^{58}$ ($2^{78}$) operations. We suggest new parameters for achieving 80-bit (128-bit) security with respect to our attacks. We also extend the attack to other promising predicates and investigate their resistance.

cs.CR↗

Robust Kalman filter-based dynamic state estimation of natural gas pipeline networks

To obtain the accurate transient states of the big scale natural gas pipeline networks under the bad data and non-zero mean noises conditions, a robust Kalman filter-based dynamic state estimation method is proposed using the linearized gas pipeline transient flow equations in this paper. Firstly, the dynamic state estimation model is built. Since the gas pipeline transient flow equations are less than the states, the boundary conditions are used as supplementary constraints to predict the transient states. To increase the measurement redundancy, the zero mass flow rate constraints at the sink nodes are taken as virtual measurements. Secondly, to ensure the stability under bad data condition, the robust Kalman filter algorithm is proposed by introducing a time-varying scalar matrix to regulate the measurement error variances correctly according to the innovation vector at every time step. At last, the proposed method is applied to a 30-node gas pipeline networks in several kinds of measurement conditions. The simulation shows that the proposed robust dynamic state estimation can decrease the effects of bad data and achieve better estimating results.

eess.SP↗

Federated Multi-armed Bandits with Personalization

A general framework of personalized federated multi-armed bandits (PF-MAB) is proposed, which is a new bandit paradigm analogous to the federated learning (FL) framework in supervised learning and enjoys the features of FL with personalization. Under the PF-MAB framework, a mixed bandit learning problem that flexibly balances generalization and personalization is studied. A lower bound analysis for the mixed model is presented. We then propose the Personalized Federated Upper Confidence Bound (PF-UCB) algorithm, where the exploration length is chosen carefully to achieve the desired balance of learning the local model and supplying global information for the mixed learning objective. Theoretical analysis proves that PF-UCB achieves an $O(\log(T))$ regret regardless of the degree of personalization, and has a similar instance dependency as the lower bound. Experiments using both synthetic and real-world datasets corroborate the theoretical analysis and demonstrate the effectiveness of the proposed algorithm.

cs.LG↗

Quantum system dynamics with a weakly nonlinear Josephson junction bath

We investigate the influence of a weakly nonlinear Josephson bath consisting of a chain of Josephson junctions on the dynamics of a small quantum system (LC oscillator). Focusing on the regime where the charging energy is the largest energy scale, we perturbatively calculate the correlation function of the Josephson bath to the leading order in the Josephson energy divided by the charging energy while keeping the cosine potential exactly. When the variation of the charging energy along the chain ensures fast decay of the bath correlation function, the dynamics of the LC oscillator that is weakly and capacitively coupled to the Josephson bath can be solved through the Markovian master equation. We establish a duality relation for the Josephson bath between the regimes of large charging and Josephson energies respectively. The results can be applied to cases where the charging energy either is nonuniformly engineered or disordered in the chain. Furthermore, we find that the Josephson bath may become non-Markovian when the temperature is increased beyond the zero-temperature limit in that the bath correlation function gets shifted by a constant and does not decay with time.

quant-ph↗

Magnetic field generation from bubble collisions during first-order phase transition

We study the magnetic fields generation from the cosmological first-order electroweak phase transition. We calculate the magnetic field induced by the variation of the Higgs phase for two bubbles and three bubbles collisions. Our study shows that electromagnetic currents in the collision direction produce the ring-like magnetic field in the intersect regions of colliding bubbles, which may seed the primordial magnetic field that are constrained by intergalatic field observations.

astro-ph.CO↗

Heavy dark matter and Gravitational waves

Domain walls can form after breakdown of a discrete symmetry induced by first-order phase transition, we study the heavy dark matter produced around the temperature of the phase transition that yields the breakdown of a $\mathbb{Z}_{3}$ symmetry. The generated gravitational waves by domain walls decay is found to be able to probed by the Pulsar Timing Arrays, and the future Square Kilometer Array.

hep-ph↗

OrgMining 2.0: A Novel Framework for Organizational Model Mining from Event Logs

Providing appropriate structures around human resources can streamline operations and thus facilitate the competitiveness of an organization. To achieve this goal, modern organizations need to acquire an accurate and timely understanding of human resource grouping while faced with an ever-changing environment. The use of process mining offers a promising way to help address the need through utilizing event log data stored in information systems. By extracting knowledge about the actual behavior of resources participating in business processes from event logs, organizational models can be constructed, which facilitate the analysis of the de facto grouping of human resources relevant to process execution. Nevertheless, open research gaps remain to be addressed when applying the state-of-the-art process mining to analyze resource grouping. For one, the discovery of organizational models has only limited connections with the context of process execution. For another, a rigorous solution that evaluates organizational models against event log data is yet to be proposed. In this paper, we aim to tackle these research challenges by developing a novel framework built upon a richer definition of organizational models coupling resource grouping with process execution knowledge. By introducing notions of conformance checking for organizational models, the framework allows effective evaluation of organizational models, and therefore provides a foundation for analyzing and improving resource grouping based on event logs. We demonstrate the feasibility of this framework by proposing an approach underpinned by the framework for organizational model discovery, and also conduct experiments on real-life event logs to discover and evaluate organizational models.

cs.DB↗

New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system

Secret sharing was proposed primarily in 1979 to solve the problem of key distribution. In recent decades, researchers have proposed many improvement schemes. Among all these schemes, the verifiable multi-secret sharing (VMSS) schemes are studied sufficiently, which share multiple secrets simultaneously and perceive malicious dealer as well as participants. By pointing out that the schemes presented by Dehkordi and Mashhadi in 2008 cannot detect some vicious behaviors of the dealer, we propose two new VMSS schemes by adding validity check in the verification phase to overcome this drawback. Our new schemes are based on XTR public key system, and can realize $GF(p^{6})$ security by computations in $GF(p^{2})$ without explicit constructions of $GF(p^{6})$, where $p$ is a prime. Compared with the VMSS schemes using RSA and linear feedback shift register (LFSR) public key cryptosystems, our schemes can achieve the same security level with shorter parameters by using trace function. What's more, our schemes are much simpler to operate than those schemes based on Elliptic Curve Cryptography (ECC). In addition, our schemes are dynamic and threshold changeable, which means that it is efficient to implement our schemes according to the actual situation when participants, secrets or the threshold needs to be changed.

cs.CR↗

DARE: AI-based Diver Action Recognition System using Multi-Channel CNNs for AUV Supervision

With the growth of sensing, control and robotic technologies, autonomous underwater vehicles (AUVs) have become useful assistants to human divers for performing various underwater operations. In the current practice, the divers are required to carry expensive, bulky, and waterproof keyboards or joystick-based controllers for supervision and control of AUVs. Therefore, diver action-based supervision is becoming increasingly popular because it is convenient, easier to use, faster, and cost effective. However, the various environmental, diver and sensing uncertainties present underwater makes it challenging to train a robust and reliable diver action recognition system. In this regard, this paper presents DARE, a diver action recognition system, that is trained based on Cognitive Autonomous Driving Buddy (CADDY) dataset, which is a rich set of data containing images of different diver gestures and poses in several different and realistic underwater environments. DARE is based on fusion of stereo-pairs of camera images using a multi-channel convolutional neural network supported with a systematically trained tree-topological deep neural network classifier to enhance the classification performance. DARE is fast and requires only a few milliseconds to classify one stereo-pair, thus making it suitable for real-time underwater implementation. DARE is comparatively evaluated against several existing classifier architectures and the results show that DARE supersedes the performance of all classifiers for diver action recognition in terms of overall as well as individual class accuracies and F1-scores.

cs.CV↗

Always-On Quantum Error Tracking with Continuous Parity Measurements

We investigate quantum error correction using continuous parity measurements to correct bit-flip errors with the three-qubit code. Continuous monitoring of errors brings the benefit of a continuous stream of information, which facilitates passive error tracking in real time. It reduces overhead from the standard gate-based approach that periodically entangles and measures additional ancilla qubits. However, the noisy analog signals from continuous parity measurements mandate more complicated signal processing to interpret syndromes accurately. We analyze the performance of several practical filtering methods for continuous error correction and demonstrate that they are viable alternatives to the standard ancilla-based approach. As an optimal filter, we discuss an unnormalized (linear) Bayesian filter, with improved computational efficiency compared to the related Wonham filter introduced by Mabuchi [New J. Phys. 11, 105044 (2009)]. We compare this optimal continuous filter to two practical variations of the simplest periodic boxcar-averaging-and-thresholding filter, targeting real-time hardware implementations with low-latency circuitry. As variations, we introduce a non-Markovian ``half-boxcar'' filter and a Markovian filter with a second adjustable threshold; these filters eliminate the dominant source of error in the boxcar filter, and compare favorably to the optimal filter. For each filter, we derive analytic results for the decay in average fidelity and verify them with numerical simulations.

quant-ph↗

Analyses of multi-pion Bose-Einstein correlations for granular sources with coherent pion-emission droplets

The ALICE Collaboration measure the three- and four-pion Bose-Einstein correlations (BECs) in Pb-Pb collisions at the Large Hadron Collider (LHC). It is speculated that the significant suppressions of multi-pion BECs are due to a considerable degree of coherent pion emission in the collisions. In this paper, we study the multi-pion BEC functions in a granular source model with coherent pion-emission droplets. We find that the intercepts of multi-pion correlation functions at the relative momenta near zero are sensitive to droplet number in the granular source. They decrease with decreasing droplet number. The three-pion correlation functions for the evolving granular sources with momentum-dependent partially coherent pion-emission droplets are in basic agreement with the experimental data in Pb-Pb collisions at $\sqrt{s_{NN}}=2.76$ TeV at the LHC. However, the model results of four-pion correlation function are inconsistent with the experimental data. The investigations of the normalized multi-pion correlation functions of the granular sources indicate that there is an interesting enhancement of the normalized four-pion correlation function in moderate relative-momentum region.

nucl-th↗

$θ$-Congruent Numbers, Tiling Numbers and the Selmer Rank of Related Elliptic Curves: odd n

Several discrete geometry problems are closely related to the arithmetic theory of elliptic curves defined on the rational fields $\mathbb{Q}$. In this paper we consider the $θ$-congruent number for $θ=\fracπ{3}$ and $\frac{2π}{3}$ and tiling number n. For the case that $n\geqslant 2$ is square-free odd integer, we determine all $n$ such that the Selmer rank of elliptic curve $E_{n,\fracπ{3}}:\ y^2=x(x-n)(x+3n)$ or/and $E_{n,\frac{2π}{3}}:\ y^2=x(x+n)(x-3n)$ is zero. From this, we provide several series of non $θ$-congruent numbers for $θ=\fracπ{3}$ and $\frac{2π}{3}$, and non tiling numbers n with arbitrary many of prime divisors.

math.NT↗

Adaptive 3D Face Reconstruction from a Single Image

3D face reconstruction from a single image is a challenging problem, especially under partial occlusions and extreme poses. This is because the uncertainty of the estimated 2D landmarks will affect the quality of face reconstruction. In this paper, we propose a novel joint 2D and 3D optimization method to adaptively reconstruct 3D face shapes from a single image, which combines the depths of 3D landmarks to solve the uncertain detections of invisible landmarks. The strategy of our method involves two aspects: a coarse-to-fine pose estimation using both 2D and 3D landmarks, and an adaptive 2D and 3D re-weighting based on the refined pose parameter to recover accurate 3D faces. Experimental results on multiple datasets demonstrate that our method can generate high-quality reconstruction from a single color image and is robust for self-occlusion and large poses.

cs.CV↗

Nonequilibrium Steady State and Heat Transport in Nonlinear Open Quantum Systems: Stochastic Influence Action and Functional Perturbative Analysis

In this paper, we show that a nonequilibrium steady state (NESS) exists at late times in open quantum systems with weak nonlinearity by following its nonequilibrium dynamics with a perturbative analysis. Here we consider an oscillator chain containing three-types of anharmonicity in the Fermi-Pasta-Ulam-Tsingou (FPUT) model: cubic $α$- and quartic $β$-type nearest-oscillator interactions and the on-site (pinned) Klein-Gordon (KG) quartic self-interaction. Assuming weak nonlinearity, we introduce a stochastic influence action approach to the problem and obtain the energy flow in different junctures of the chain. The formal results obtained here can be used for quantum transport problems in weakly nonlinear quantum systems. For $α$-type anharmonicity, we observe that the first-order corrections do not play any role in the thermal transport in the NESS of the configuration we considered. For KG and $β$-types anharmonicity, we work out explicitly the case of two weakly nonlinearly coupled oscillators, with results scalable to any number of oscillators. We examine the late-time energy flows from one thermal bath to the other via the coupled oscillators, and show that both the zeroth- and the first-order contributions of the energy flow become constant in time at late times, signaling the existence of a late-time NESS to first order in nonlinearity. Our perturbative calculations provide a measure of the strength of nonlinearity for nonlinear open quantum systems, which may help control the mesoscopic heat transport distinct from or close to linear transport. Furthermore, our results also give a benchmark for the numerical challenge of simulating heat transport. Our setup and predictions can be implemented and verified by investigating heat flow in an array of Josephson junctions in the limit of large Josephson energy with the platform of circuit QED.

quant-ph↗

A Condition for Multiplicity Structure of Univariate Polynomials

We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several polynomial equations and one inequation in the coefficients, by using repeated parametric gcd's. In this paper, we give a novel condition which is not based on repeated gcd's. Furthermore, it is shown that the number of polynomials in the condition is optimal and the degree of polynomials is smaller than that in the previous condition based on repeated gcd's.

cs.SC↗