Searcharxiv⌕ Search

arXiv subjects

Xiaodong Wang

Publications and source records attributed to Xiaodong Wang.

At least 127 records · Page 7Linked to original sources
arXiv2022

Scaling Blockchains with Error Correction Codes: A Survey on Coded Blockchains

This paper reviews and highlights how coding schemes have been used to solve various problems in blockchain systems. Specifically, these problems relate to scaling blockchains in terms of their data storage, computation and communication cost, as well as security. To this end, this paper considers the use of coded blocks or shards that allows participants to store only a fraction of the total blockchain, protect against malicious nodes or erasures due to nodes leaving a blockchain system, ensure data availability in order to promote transparency, and scale the security of sharded blockchains. Further, it helps reduce communication cost when disseminating blocks, which is critical to bootstrapping new nodes and helps speed up consensus of blocks. For each category of solutions, we highlight problems and issues that motivated their designs and use of coding. Moreover, we provide a qualitative analysis of their storage, communication and computation cost.

cs.DC↗
arXiv2022

Hybrid Mechanical and Electronic Beam Steering for Maximizing OAM Channel Capacity

Radio frequency-orbital angular momentum (RF-OAM) is a novel approach of multiplexing a set of orthogonal modes on the same frequency channel to achieve high spectrum efficiencies. Since OAM requires precise alignment of the transmit and the receive antennas, the electronic beam steering approach has been proposed for the uniform circular array (UCA)-based OAM communication system to circumvent large performance degradation induced by small antenna misalignment in practical environment. However, in the case of large-angle misalignment, the OAM channel capacity can not be effectively compensated only by the electronic beam steering. To solve this problem, we propose a hybrid mechanical and electronic beam steering scheme, in which mechanical rotating devices controlled by pulse width modulation (PWM) signals as the execution unit are utilized to eliminate the large misalignment angle, while electronic beam steering is in charge of the remaining small misalignment angle caused by perturbations. Furthermore, due to the interferometry, the receive signal-to-noise ratios (SNRs) are not uniform at the elements of the receive UCA. Therefore, a rotatable UCA structure is proposed for the OAM receiver to maximize the channel capacity, in which the simulated annealing algorithm is adopted to obtain the optimal rotation angle at first, then the servo system performs mechanical rotation, at last the electronic beam steering is adjusted accordingly. Both mathematical analysis and simulation results validate that the proposed hybrid mechanical and electronic beam steering scheme can effectively eliminate the effect of diverse misalignment errors of any practical OAM channel and maximize the OAM channel capacity.

cs.IT↗
arXiv2022

Distributed and Distribution-Robust Meta Reinforcement Learning (D2-RMRL) for Data Pre-storing and Routing in Cube Satellite Networks

In this paper, the problem of data pre-storing and routing in dynamic, resource-constrained cube satellite networks is studied. In such a network, each cube satellite delivers requested data to user clusters under its coverage. A group of ground gateways will route and pre-store certain data to the satellites, such that the ground users can be directly served with the pre-stored data. This pre-storing and routing design problem is formulated as a decentralized Markov decision process (Dec-MDP) in which we seek to find the optimal strategy that maximizes the pre-store hit rate, i.e., the fraction of users being directly served with the pre-stored data. To obtain the optimal strategy, a distributed distribution-robust meta reinforcement learning (D2-RMRL) algorithm is proposed that consists of three key ingredients: value-decomposition for achieving the global optimum in distributed setting with minimum communication overhead, meta learning to obtain the optimal initial to reduce the training time under dynamic conditions, and pre-training to further speed up the meta training procedure. Simulation results show that, using the proposed value decomposition and meta training techniques, the satellite networks can achieve a 31.8% improvement of the pre-store hits and a 40.7% improvement of the convergence speed, compared to a baseline reinforcement learning algorithm. Moreover, the use of the proposed pre-training mechanism helps to shorten the meta-learning procedure by up to 43.7%.

cs.IT↗
arXiv2022

A Novel Algorithm to Solve for an Underwater Line Source Sound Field Based on Coupled Modes and a Spectral Method

A high-precision numerical sound field is the basis of underwater target detection, positioning and communication. A line source in a plane is a common type of sound source in computational ocean acoustics. The exciting waveguide in a range-dependent ocean environment is often structurally complicated; however, traditional algorithms often assume that the waveguide has a simple seabed boundary and that the line source is located at a horizontal range of 0 m, although this ideal situation is rarely encountered in the actual ocean. In this paper, a novel algorithm is designed that can solve for the sound field excited by a line source at any position in a range-dependent ocean environment. The proposed algorithm uses the classic stepwise approximation approach to address the range dependence of the environment and uses the Chebyshev--Tau spectral method to solve for the horizontal wavenumbers and modes of approximately range-independent segments. Once the modal information of these flat segments has been obtained, a global matrix is constructed to solve for the coupling coefficients of all segments, and finally, the complete sound field is synthesized. Numerical experiments using a robust numerical program developed based on this algorithm verify the correctness and usability of our novel algorithm and software. Furthermore, a detailed analysis and test of the computational cost of this algorithm show that it is efficient.

physics.comp-ph↗
arXiv2022

Two stages for visual object tracking

Siamese-based trackers have achived promising performance on visual object tracking tasks. Most existing Siamese-based trackers contain two separate branches for tracking, including classification branch and bounding box regression branch. In addition, image segmentation provides an alternative way to obetain the more accurate target region. In this paper, we propose a novel tracker with two-stages: detection and segmentation. The detection stage is capable of locating the target by Siamese networks. Then more accurate tracking results are obtained by segmentation module given the coarse state estimation in the first stage. We conduct experiments on four benchmarks. Our approach achieves state-of-the-art results, with the EAO of 52.6$\%$ on VOT2016, 51.3$\%$ on VOT2018, and 39.0$\%$ on VOT2019 datasets, respectively.

cs.CV↗
arXiv2021

MIMO OFDM Dual-Function Radar-Communication Under Error Rate and Beampattern Constraints

In this work we consider a multiple-input multiple-output (MIMO) dual-function radar-communication (DFRC) system, which senses multiple spatial directions and serves multiple users. Upon resorting to an orthogonal frequency division multiplexing (OFDM) transmission format and a differential phase shift keying (DPSK) modulation, we study the design of the radiated waveforms and of the receive filters employed by the radar and the users. The approach is communication-centric, in the sense that a radar-oriented objective is optimized under constraints on the average transmit power, the power leakage towards specific directions, and the error rate of each user, thus safeguarding the communication quality of service (QoS). We adopt a unified design approach allowing a broad family of radar objectives, including both estimation- and detection-oriented merit functions. We devise a suboptimal solution based on alternating optimization of the involved variables, a convex restriction of the feasible search set, and minorization-maximization, offering a single algorithm for all of the radar merit functions in the considered family. Finally, the performance is inspected through numerical examples.

eess.SP↗
arXiv2021

Unraveling S&P500 stock volatility and networks -- An encoding-and-decoding approach

Volatility of financial stock is referring to the degree of uncertainty or risk embedded within a stock's dynamics. Such risk has been received huge amounts of attention from diverse financial researchers. By following the concept of regime-switching model, we proposed a non-parametric approach, named encoding-and-decoding, to discover multiple volatility states embedded within a discrete time series of stock returns. The encoding is performed across the entire span of temporal time points for relatively extreme events with respect to a chosen quantile-based threshold. As such the return time series is transformed into Bernoulli-variable processes. In the decoding phase, we computationally seek for locations of change points via estimations based on a new searching algorithm in conjunction with the information criterion applied on the observed collection of recurrence times upon the binary process. Besides the independence required for building the Geometric distributional likelihood function, the proposed approach can functionally partition the entire return time series into a collection of homogeneous segments without any assumptions of dynamic structure and underlying distributions. In the numerical experiments, our approach is found favorably compared with parametric models like Hidden Markov Model. In the real data applications, we introduce the application of our approach in forecasting stock returns. Finally, volatility dynamic of every single stock of S&P500 is revealed, and a stock network is consequently established to represent dependency relations derived through concurrent volatility states among S&P500.

q-fin.ST↗
arXiv2021

Learning Invariant Representation with Consistency and Diversity for Semi-supervised Source Hypothesis Transfer

Semi-supervised domain adaptation (SSDA) aims to solve tasks in target domain by utilizing transferable information learned from the available source domain and a few labeled target data. However, source data is not always accessible in practical scenarios, which restricts the application of SSDA in real world circumstances. In this paper, we propose a novel task named Semi-supervised Source Hypothesis Transfer (SSHT), which performs domain adaptation based on source trained model, to generalize well in target domain with a few supervisions. In SSHT, we are facing two challenges: (1) The insufficient labeled target data may result in target features near the decision boundary, with the increased risk of mis-classification; (2) The data are usually imbalanced in source domain, so the model trained with these data is biased. The biased model is prone to categorize samples of minority categories into majority ones, resulting in low prediction diversity. To tackle the above issues, we propose Consistency and Diversity Learning (CDL), a simple but effective framework for SSHT by facilitating prediction consistency between two randomly augmented unlabeled data and maintaining the prediction diversity when adapting model to target domain. Encouraging consistency regularization brings difficulty to memorize the few labeled target data and thus enhances the generalization ability of the learned model. We further integrate Batch Nuclear-norm Maximization into our method to enhance the discriminability and diversity. Experimental results show that our method outperforms existing SSDA methods and unsupervised model adaptation methods on DomainNet, Office-Home and Office-31 datasets. The code is available at https://github.com/Wang-xd1899/SSHT.

cs.CV↗
arXiv2021

Uniqueness Results on a geometric PDE in Riemannian and CR Geoemetry Revisited

We revisit some uniqueness results for a geometric nonlinear PDE related to the scalar curvature in Riemannian geometry and CR geometry. In the Riemannian case we give a new proof of the uniqueness result assuming only a positive lower bound for Ricci curvature. We apply the same principle in the CR case and reconstruct the Jerison-Lee identity in a more general setting. As a consequence we prove a stronger uniqueness result in the CR case. We also discuss some open problems for further study.

math.DG↗
arXiv2021

An Encoding Approach for Stable Change Point Detection

Without imposing prior distributional knowledge underlying multivariate time series of interest, we propose a nonparametric change-point detection approach to estimate the number of change points and their locations along the temporal axis. We develop a structural subsampling procedure such that the observations are encoded into multiple sequences of Bernoulli variables. A maximum likelihood approach in conjunction with a newly developed searching algorithm is implemented to detect change points on each Bernoulli process separately. Then, aggregation statistics are proposed to collectively synthesize change-point results from all individual univariate time series into consistent and stable location estimations. We also study a weighting strategy to measure the degree of relevance for different subsampled groups. Simulation studies are conducted and shown that the proposed change-point methodology for multivariate time series has favorable performance comparing with currently popular nonparametric methods under various settings with different degrees of complexity. Real data analyses are finally performed on categorical, ordinal, and continuous time series taken from fields of genetics, climate, and finance.

stat.ME↗
arXiv2021

Towards Extremely Compact RNNs for Video Recognition with Fully Decomposed Hierarchical Tucker Structure

Recurrent Neural Networks (RNNs) have been widely used in sequence analysis and modeling. However, when processing high-dimensional data, RNNs typically require very large model sizes, thereby bringing a series of deployment challenges. Although various prior works have been proposed to reduce the RNN model sizes, executing RNN models in resource-restricted environments is still a very challenging problem. In this paper, we propose to develop extremely compact RNN models with fully decomposed hierarchical Tucker (FDHT) structure. The HT decomposition does not only provide much higher storage cost reduction than the other tensor decomposition approaches but also brings better accuracy performance improvement for the compact RNN models. Meanwhile, unlike the existing tensor decomposition-based methods that can only decompose the input-to-hidden layer of RNNs, our proposed fully decomposition approach enables the comprehensive compression for the entire RNN models with maintaining very high accuracy. Our experimental results on several popular video recognition datasets show that our proposed fully decomposed hierarchical tucker-based LSTM (FDHT-LSTM) is extremely compact and highly efficient. To the best of our knowledge, FDHT-LSTM, for the first time, consistently achieves very high accuracy with only few thousand parameters (3,132 to 8,808) on different datasets. Compared with the state-of-the-art compressed RNN models, such as TT-LSTM, TR-LSTM and BT-LSTM, our FDHT-LSTM simultaneously enjoys both order-of-magnitude (3,985x to 10,711x) fewer parameters and significant accuracy improvement (0.6% to 12.7%).

cs.CV↗
arXiv2021

Coarse- and fine-scale geometric information content of Multiclass Classification and implied Data-driven Intelligence

Under any Multiclass Classification (MCC) setting defined by a collection of labeled point-cloud specified by a feature-set, we extract only stochastic partial orderings from all possible triplets of point-cloud without explicitly measuring the three cloud-to-cloud distances. We demonstrate that such a collective of partial ordering can efficiently compute a label embedding tree geometry on the Label-space. This tree in turn gives rise to a predictive graph, or a network with precisely weighted linkages. Such two multiscale geometries are taken as the coarse scale information content of MCC. They indeed jointly shed lights on explainable knowledge on why and how labeling comes about and facilitates error-free prediction with potential multiple candidate labels supported by data. For revealing within-label heterogeneity, we further undergo labeling naturally found clusters within each point-cloud, and likewise derive multiscale geometry as its fine-scale information content contained in data. This fine-scale endeavor shows that our computational proposal is indeed scalable to a MCC setting having a large label-space. Overall the computed multiscale collective of data-driven patterns and knowledge will serve as a basis for constructing visible and explainable subject matter intelligence regarding the system of interest.

stat.ML↗
arXiv2021

Discovering Multiple Phases of Dynamics by Dissecting Multivariate Time Series

We proposed a data-driven approach to dissect multivariate time series in order to discover multiple phases underlying dynamics of complex systems. This computing approach is developed as a multiple-dimension version of Hierarchical Factor Segmentation(HFS) technique. This expanded approach proposes a systematic protocol of choosing various extreme events in multi-dimensional space. Upon each chosen event, an empirical distribution of event-recurrence, or waiting time between the excursions, is fitted by a geometric distribution with time-varying parameters. Iterative fittings are performed across all chosen events. We then collect and summarize the local recurrent patterns into a global dynamic mechanism. Clustering is applied for partitioning the whole time period into alternating segments, in which variables are identically distributed. Feature weighting techniques are also considered to compensate for some drawbacks of clustering. Our simulation results show that this expanded approach can even detect systematic differences when the joint distribution varies. In real data experiments, we analyze the relationship from returns, trading volume, and transaction number of a single, as well as of multiple stocks in S&P500. We can successfully not only map out volatile periods but also provide potential associative links between stocks.

stat.ME↗
arXiv2021

Laser Compression via fast-extending plasma gratings

It is proposed a new method of compressing laser pulse by fast extending plasma gratings(FEPG), which is created by ionizing the hypersound wave generated by stimulated Brillouin scattering(SBS) in the background gas. Ionized by a short laser pulse, the phonon forms a light-velocity FEPG to fully reflect a resonant pump laser. As the reflecting surface moves with a light velocity, the reflected pulse is temporally overlapped and compressed. This regime is supported by the simulation results of a fully kinetic particle-in-cell(PIC) code Opic with a laser wavelength of 1um, displaying a pump pulse is compressed from 13ps to a few cycles(7.2fs), with an efficiency close to 80%. It is a promising method to produce critical laser powers due to several features: high efficiency without a linear stage, robustness to plasma instabilities, no seed and a wide range of pump intensity.

physics.plasm-ph↗
arXiv2021

Self-compression of stimulated Raman backscattering by flying focus

A novel regime of self-compression is proposed for plasma-based backward Raman amplification(BRA) upon flying focus. By using a pumping focus moving with a speed equal to the group velocity of stimulated Raman backscattering(SRBS), only a short part of SRBS which does always synchronize with the flying focus can be amplified. Due to the asymmetrical amplification, the pulse can be directly compressed in the linear stage of BRA. Therefore, instead of a short pulse, the Raman spontaneous or a long pulse can seed the BRA amplifiers. The regime is supported by the 2D particle-in-cell(PIC) simulation without a seed, presenting that the pump pulse is compressed from 26ps to 116fs, with an output amplitude comparable with the case of a well-synchronized short seed. This method provides a significant way to simplify the Raman amplifiers and overcome the issue of synchronization jitter between the pump and the seed.

physics.plasm-ph↗
arXiv2021

Improved Sobolev inequality under constraints

We give a new proof of Aubin's improvement of the Sobolev inequality on $\mathbb{S}^{n}$ under the vanishing of first order moments of the area element and generalize it to higher order moments case. By careful study of an extremal problem on $\mathbb{S}^{n}$, we determine the constant explicitly in the second order moments case.

math.CA↗