SearcharxivSearch

arXiv subjects

Ping Dong

Publications and source records attributed to Ping Dong.

18 recordsLinked to original sources

Data-Driven Reconstruction of Significant Wave Heights from Sparse Observations

Reconstructing high-resolution regional significant wave height fields from sparse and uneven buoy observations remains a core challenge for ocean monitoring and risk-aware operations. We introduce AUWave, a hybrid deep learning framework that fuses a station-wise sequence encoder (MLP) with a multi-scale U-Net enhanced by a bottleneck self-attention layer to recover 32$\times$32 regional SWH fields. A systematic Bayesian hyperparameter search with Optuna identifies the learning rate as the dominant driver of generalization, followed by the scheduler decay and the latent dimension. Using NDBC buoy observations and ERA5 reanalysis over the Hawaii region, AUWave attains a minimum validation loss of 0.043285 and a slightly right-skewed RMSE distribution. Spatial errors are lowest near observation sites and increase with distance, reflecting identifiability limits under sparse sampling. Sensitivity experiments show that AUWave consistently outperforms a representative baseline in data-richer configurations, while the baseline is only marginally competitive in the most underdetermined single-buoy cases. The architecture's multi-scale and attention components translate into accuracy gains when minimal but non-trivial spatial anchoring is available. Error maps and buoy ablations reveal key anchor stations whose removal disproportionately degrades performance, offering actionable guidance for network design. AUWave provides a scalable pathway for gap filling, high-resolution priors for data assimilation, and contingency reconstruction.

eess.SP

Formal degrees of genuine Iwahori-spherical representations

For square-integrable genuine Iwahori-spherical representations of central covers, we verify the Hiraga--Ichino--Ikeda formula for their formal degrees. We also compute the Whittaker dimensions of these representations, when their associated modules over the genuine Iwahori--Hecke algebra are one-dimensional.

math.RT

NIMSA: Non-Interactive Multihoming Security Authentication Scheme for vehicular communications in Mobile Heterogeneous Networks

In vehicular communications, in-vehicle devices' mobile and multihoming characteristics bring new requirements for devicevsecurity authentication. On the one hand, the existing network layer authentication methods rely on the PKI system; on the other hand, key negotiation needs interaction. These two points determine that the traditional security authentication method requires bandwidth consumption and additional delay. It is unsuitable for heterogeneous wireless scenarios with a high packet loss rate and limited bandwidth resources. In addition, the establishment of a security association state is contrary to the original design that the network layer only provides a forwarding function. We proposed a non-interactive multihoming security authentication (NIMSA) scheme, a stateless network layer security authentication scheme triggered by data forwarding. Our scheme adopts an identity-based non-interactive key agreement strategy to avoid the interaction of signaling information, which is lightweight and has good support for mobile and multipath parallel transmission scenarios. The comparison with IKEv2 and its mobility and multihoming extension scheme (MOBIKE) shows that the proposed scheme has shorter authentication and handover delay and data transmission delay and can bring better bandwidth aggregation effect in the scenario of multipath parallel transmission.

cs.CR

Interquantile Shrinkage in Spatial Quantile Autoregressive Regression models

Spatial dependent data frequently occur in many fields such as spatial econometrics and epidemiology. To deal with the dependence of variables and estimate quantile-specific effects by covariates, spatial quantile autoregressive models (SQAR models) are introduced. Conventional quantile regression only focuses on the fitting models but ignores the examination of multiple conditional quantile functions, which provides a comprehensive view of the relationship between the response and covariates. Thus, it is necessary to study the different regression slopes at different quantiles, especially in situations where the quantile coefficients share some common feature. However, traditional Wald multiple tests not only increase the burden of computation but also bring greater FDR. In this paper, we transform the estimation and examination problem into a penalization problem, which estimates the parameters at different quantiles and identifies the interquantile commonality at the same time. To avoid the endogeneity caused by the spatial lag variables in SQAR models, we also introduce instrumental variables before estimation and propose two-stage estimation methods based on fused adaptive LASSO and fused adaptive sup-norm penalty approaches. The oracle properties of the proposed estimation methods are established. Through numerical investigations, it is demonstrated that the proposed methods lead to higher estimation efficiency than the traditional quantile regression.

stat.ME

A Performance Analysis Model of TCP over Multiple Heterogeneous Paths for 5G Mobile Services

Driven by the primary requirement of emerging 5G mobile services, the demand for concurrent multipath transfer (CMT) is still prominent. Yet, multipath transport protocols are not widely adopted and TCP-based CMT schemes will still be in dominant position in 5G. However, the performance of TCP flow transferred over multiple heterogeneous paths is prone to the link quality asymmetry, the extent of which was revealed to be significant by our field investigation. In this paper, we present a performance analysis model for TCP over multiple heterogeneous paths in 5G scenarios, where both bandwidth and delay asymmetry are taken into consideration. The evaluation adopting parameters from field investigation shows that the proposed model can achieve high accuracy in practical environments. Some interesting inferences can be drawn from the proposed model, such as the dominant factor that affect the performance of TCP over heterogeneous networks, and the criteria of determining the appropriate number of links to be used under different circumstances of path heterogeneity. Thus, the proposed model can provide a guidance to the design of TCP-based CMT solutions for 5G mobile services.

cs.NI

Upper expectation parametric regression

Every observation may follow a distribution that is randomly selected in a class of distributions. It is called the distribution uncertainty. This is a fact acknowledged in some research fields such as financial risk measure. Thus, the classical expectation is not identifiable in general.In this paper, a distribution uncertainty is defined, and then an upper expectation regression is proposed, which can describe the relationship between extreme events and relevant covariates under the framework of distribution uncertainty. As there are no classical methods available to estimate the parameters in the upper expectation regression, a two-step penalized maximum least squares procedure is proposed to estimate the mean function and the upper expectation of the error. The resulting estimators are consistent and asymptotically normal in a certain sense.Simulation studies and a real data example are conducted to show that the classical least squares estimation does not work and the penalized maximum least squares performs well.

stat.ME

Geometric measure of quantum discord and the geometry of a class of two-qubit states

We investigate the geometric picture of the level surfaces of quantum entanglement and geometric measure of quantum discord (GMQD) of a class of X-states, respectively. This pictorial approach provides us a direct understanding of the structure of entanglement and GMQD. The dynamic evolution of GMQD under two typical kinds of quantum decoherence channels is also investigated. It is shown that there exists a class of initial states for which the GMQD is not destroyed by decoherence in a finite time interval. Furthermore, we establish a factorization law between the initial and final GMQD, which allows us to infer the evolution of entanglement under the influences of the environment.

quant-ph

Discrete quantum Fourier transform in coupled semiconductor double quantum dot molecules

In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible unitary transformations. The current scheme would be a useful step towards the realization of complex quantum algorithms in the quantum dot system.

quant-ph

Quantum computation with quantum-dot spin qubits inside a cavity

Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states, \emph{i.e.}, insensitive to the thermal cavity field. Individual addressing and effective switch of the cavity mediated interaction are directly possible here. Meanwhile, gate operations also can be carried out in parallel. The simple realization of needed interaction for selective qubits makes current scenario more suitable for scalable quantum computation.

quant-ph

General quantum phase estimation and calibration of a timepiece in a quantum dot system

We present a physical scheme for implementing quantum phase estimation via weakly coupled double quantum-dot molecules embedded in a microcavity. During the same process of implementation, we can also realize the calibration of a timepiece based on the estimated phase. We use the electron-hole pair states in coupled double quantum-dot molecules to encode quantum information, where the requirement that two quantum dots are exactly identical is not necessary. Our idea can also be generalized to other systems, such as atomic, trapped ion and linear optics system.

quant-ph

Implementation of Grover search algorithm with Josephson charge qubits

A scheme of implementing the Grover search algorithm based on Josephson charge qubits has been proposed, which would be a key step to scale more complex quantum algorithms and very important for constructing a real quantum computer via Josephson charge qubits. The present scheme is simple but fairly efficient, and easily manipulated because any two-charge-qubit can be selectively and effectively coupled by a common inductance. More manipulations can be carried out before decoherence sets in. Our scheme can be realized within the current technology.

cond-mat.supr-con

Quantum controlled phase gate and cluster states generation via two superconducting quantum interference devices in a cavity

A scheme for implementing 2-qubit quantum controlled phase gate (QCPG) is proposed with two superconducting quantum interference devices (SQUIDs) in a cavity. The gate operations are realized within the two lower flux states of the SQUIDs by using a quantized cavity field and classical microwave pulses. Our scheme is achieved without any type of measurement, does not use the cavity mode as the data bus and only requires a very short resonant interaction of the SQUID-cavity system. As an application of the QCPG operation, we also propose a scheme for generating the cluster states of many SQUIDs.

quant-ph

Quantum dense coding via atomic ensembles without prior distributed entangled state

We investigate a scheme for implementing quantum dense coding via atomic ensembles, where prior distribution of the quantum entangled state is not needed. Our scheme also combines another two distinct advantages: atomic ensembles qubits with long coherent time serve as memory qubits and phtonic qubit as flying qubit. Thus our suggestion may offer a simple and easy way of demonstrating quantum dense coding experimentally via atomic ensembles.

quant-ph

Generation of cluster states with Josephson charge qubits

A scheme for the generation of the cluster states based on the Josephson charge qubit is proposed. The two-qubit generating case is first introduced, and then generalized to multi-qubit case. The scheme is simple and easily manipulated, because any two charge qubits can be selectively and effectively coupled by a common inductance. More manipulations can be realized before decoherence sets in. All the devices in the scheme are well within the current technology.

quant-ph

Generation of cluster states

We propose two schemes for the generation of the cluster states. One is based on cavity quantum electrodynamics (QED) techniques. The scheme only requires resonant interactions between two atoms and a single-mode cavity. The interaction time is very short, which is important in view of decoherence. Furthermore, we also discuss the cavity decay and atomic spontaneous emission case. The other is based on atomic ensembles. The scheme has inherent fault tolerance function and is robust to realistic noise and imperfections. All the facilities used in our schemes are well within the current technology.

quant-ph

Implementation of quantum algorithms with resonant interactions

We propose a scheme for implementing quantum algorithms with resonant interactions. Our scheme only requires resonant interactions between two atoms and a cavity mode, which is simple and feasible. Moreover, the implementation would be an important step towards the fabrication of quantum computers in cavity QED system.

quant-ph

Scheme for generating the cluster states via atomic ensembles

A scheme for generating the cluster states via atomic ensembles is proposed. The scheme has inherent fault tolerance function and is robust to realistic noise and imperfections. All the facilities used in our scheme are well within the current technology.

quant-ph

Scheme for implementing the Deutsch-Jozsa algorithm via atomic ensembles

We propose a physical scheme for implementing the Deutsch-Jozsa algorithm using atomic ensembles and optical devices. The scheme has inherent fault tolerance to the realistic noise and efficient scaling with the number of ensembles for some entangled states within the reach of current technology. It would be an important step toward more complex quantum computation via atomic ensembles.

quant-ph