Searcharxiv⌕ Search

arXiv subjects

Yan Li

Publications and source records attributed to Yan Li.

At least 505 records · Page 28Linked to original sources
arXiv2020

GPU-Accelerated Compression and Visualization of Large-Scale Vessel Trajectories in Maritime IoT Industries

The automatic identification system (AIS), an automatic vessel-tracking system, has been widely adopted to perform intelligent traffic management and collision avoidance services in maritime Internet of Things (IoT) industries. With the rapid development of maritime transportation, tremendous numbers of AIS-based vessel trajectory data have been collected, which make trajectory data compression imperative and challenging. This paper mainly focuses on the compression and visualization of large-scale vessel trajectories and their Graphics Processing Unit (GPU)-accelerated implementations. The visualization was implemented to investigate the influence of compression on vessel trajectory data quality. In particular, the Douglas-Peucker (DP) and Kernel Density Estimation (KDE) algorithms, respectively utilized for trajectory compression and visualization, were significantly accelerated through the massively parallel computation capabilities of GPU architecture. Comprehensive experiments on trajectory compression and visualization have been conducted on large-scale AIS data of recording ship movements collected from 3 different water areas, i.e., the South Channel of Yangtze River Estuary, the Chengshan Jiao Promontory, and the Zhoushan Islands. Experimental results illustrated that (1) the proposed GPU-based parallel implementation frameworks could significantly reduce the computational time for both trajectory compression and visualization; (2) the influence of compressed vessel trajectories on trajectory visualization could be negligible if the compression threshold was selected suitably; (3) the Gaussian kernel was capable of generating more appropriate KDE-based visualization performance by comparing with other seven kernel functions.

eess.SP↗
arXiv2020

TEA: Temporal Excitation and Aggregation for Action Recognition

Temporal modeling is key for action recognition in videos. It normally considers both short-range motions and long-range aggregations. In this paper, we propose a Temporal Excitation and Aggregation (TEA) block, including a motion excitation (ME) module and a multiple temporal aggregation (MTA) module, specifically designed to capture both short- and long-range temporal evolution. In particular, for short-range motion modeling, the ME module calculates the feature-level temporal differences from spatiotemporal features. It then utilizes the differences to excite the motion-sensitive channels of the features. The long-range temporal aggregations in previous works are typically achieved by stacking a large number of local temporal convolutions. Each convolution processes a local temporal window at a time. In contrast, the MTA module proposes to deform the local convolution to a group of sub-convolutions, forming a hierarchical residual architecture. Without introducing additional parameters, the features will be processed with a series of sub-convolutions, and each frame could complete multiple temporal aggregations with neighborhoods. The final equivalent receptive field of temporal dimension is accordingly enlarged, which is capable of modeling the long-range temporal relationship over distant frames. The two components of the TEA block are complementary in temporal modeling. Finally, our approach achieves impressive results at low FLOPs on several action recognition benchmarks, such as Kinetics, Something-Something, HMDB51, and UCF101, which confirms its effectiveness and efficiency.

cs.CV↗
arXiv2020

Polar Coded Diversity on Block Fading Channels via Polar Spectrum

Due to the advantage of capacity-achieving, polar codes have been extended to the block fading channel whereas most constructions involve complex iterative-calculation. In this paper, we establish a systematic framework to analyze the error performance of polar codes in the case of block mapping and random mapping. For both the mappings, by introducing the new concept, named split polar spectrum, we derive the upper bound on the error probability of polarized channel which explicitly reveals the relationship between the diversity order L and the block-wise weight distribution of the codeword. For the special case L=2 in the block mapping, we design the enumeration algorithm to calculate the exact split polar spectrum based on the general MacWilliams identities. For arbitrary diversity order in the random mapping, with the help of uniform interleaving, we derive the approximate split polar spectrum by combining the polar spectrum and the probability of fading pattern for a specific weight. Furthermore, we propose the design criteria to construct polar codes over the block fading channel. The full diversity criterion is the primary target so as to achieve the diversity gain and the product distance criterion requires to maximize the product of the block-wise Hamming distance whereby obtain the coding gain. Guided by these design criteria, the construction metric, named polarized diversity weight (PDW) is proposed to design the polar codes in both mappings. Such a simple metric can construct polar codes with similar or better performance over those based on traditional methods in block fading channel.

cs.IT↗
arXiv2020

Edge Federation: Towards an Integrated Service Provisioning Model

Edge computing is a promising computing paradigm for pushing the cloud service to the network edge. To this end, edge infrastructure providers (EIPs) need to bring computation and storage resources to the network edge and allow edge service providers (ESPs) to provision latency-critical services to users. Currently, EIPs prefer to establish a series of private edge-computing environments to serve specific requirements of users. This kind of resource provisioning mechanism severely limits the development and spread of edge computing for serving diverse user requirements. To this end, we propose an integrated resource provisioning model, named edge federation, to seamlessly realize the resource cooperation and service provisioning across standalone edge computing providers and clouds. To efficiently schedule and utilize the resources across multiple EIPs, we systematically characterize the provisioning process as a large-scale linear programming (LP) problem and transform it into an easily solved form. Accordingly, we design a dynamic algorithm to tackle the varying service demands from users. We conduct extensive experiments over the base station networks in Toronto city. Compared with the existing fixed contract model and multihoming model, edge federation can reduce the overall cost of EIPs by 23.3% to 24.5%, and 15.5% to 16.3%, respectively.

cs.NI↗
arXiv2020

Extra-cavity-enhanced difference-frequency generation at 1.63 μm

A 1632-nm laser has highly important applications in interfacing the wavelength of rubidium-based quantum memories (795 nm) and the telecom band (typically 1550 nm) by frequency conversion in three-wave mixing processes. A 1632-nm laser source based on pump-enhanced difference frequency generation is demonstrated. It has 300 mW of output power, in agreement with simulations, and a 55% quantum efficiency. An average power fluctuation of 0.51% over one hour was observed, and 200-kHz linewidth was measured using a delayed self-heterodyne method.

physics.optics↗
arXiv2020

Ultra-slow sound in non-resonant meta-aerogel

The manipulation of sound with acoustic metamaterials is a field of intense research, where interaction via resonance is a common application despite the significant disadvantages. We propose a novel procedure for introducing well-designed coupling interfaces with a cell size of less than 10 nm into an ultra-soft porous medium, to prepare a meta-aerogel, where the sound propagation is significantly delayed in a non-resonant mode. The resultant sound velocity is shown as a scaling law with the mass density and the mass fraction ratio of the components, in accordance with our analytical model. We have prepared a meta-aerogel with the slowest sound velocity of 62 m/s. To the best of our knowledge, this is the lowest value in compact solid materials, with a prospect of further slowing down by our procedure. The development of such meta-aerogels can facilitate key applications in acoustic metamaterials intended to employ non-resonant type slow sound (or phase delay). Examples of the latter include deep subwavelength meta-surface and other focused imaging or transformation acoustics that require a high contrast of sound velocity.

physics.app-ph↗
arXiv2020

New hierarchy of multiple soliton solutions for the (2+1)-dimensional Sawada-Kotera equation

A new transformation $u=4 ({\rm ln}f)_x$ that can formulate a quintic linear equation and a pair of Hirota's bilinear equations for the (2+1)-dimensional Sawada-Kotera (2DSK) equation is reported firstly, which enables one to obtain a new hierarchy of multiple soliton solutions of the 2DSK equation. It tells a crucial fact that a nonlinear partial differential equation could possess two hierarchies of multiple soliton solutions and the 2DSK equation is the first and only one found in this paper. The quintic linear equation is solved by a pair of Hirota's bilinear equations, of which one is the (2+1)-dimensional bilinear SK equation obtained by $u=2 ({\rm ln}f)_{x}$, and the other is the bilinear KdV equation. The (1+1)-dimensional SK equation does not possess this property. As another example, a (3+1)-dimensional nonlinear partial differential equation possessing a pair of Hirota's bilinear equations, however only bearing one hierarchy of multiple soliton solutions is studied.

nlin.SI↗
arXiv2020

Review on Set-Theoretic Methods for Safety Verification and Control of Power System

Increasing penetration of renewable energy introduces significant uncertainty into power systems. Traditional simulation-based verification methods may not be applicable due to the unknown-but-bounded feature of the uncertainty sets. Emerging set-theoretic methods have been intensively investigated to tackle this challenge. The paper comprehensively reviews these methods categorized by underlying mathematical principles, that is, set operation-based methods and passivity-based methods. Set operation-based methods are more computationally efficient, while passivity-based methods provide semi-analytical expression of reachable sets, which can be readily employed for control. Other features between different methods are also discussed and illustrated by numerical examples. A benchmark example is presented and solved by different methods to verify consistency.

eess.SY↗
arXiv2020

The finite dimensional subalgebra classification of infinite dimensional symmetry algebra of two dimensional coupled nonlinear Schrödinger equations

The symmetry group structures of two dimensional coupled nonlinear Shrödinger equations are considered. We first show that the equations admit infinite dimensional symmetry algebra as well as the corresponding symmetry group depending on four arbitrary functions of one variable. Then we show some physical symmetries and an affine loop algebra contained in the symmetry algebra of the equations. Third, we give the complete classifications of finite dimension (less than four) subalgebras of the symmetry algebra under the adjoint group of the symmetry group. These results provide the theoretical and computational basis for the further study of the equations with symmetry methods.

math-ph↗
arXiv2020

Chip-to-chip quantum teleportation and multi-photon entanglement in silicon

Exploiting semiconductor fabrication techniques, natural carriers of quantum information such as atoms, electrons, and photons can be embedded in scalable integrated devices. Integrated optics provides a versatile platform for large-scale quantum information processing and transceiving with photons. Scaling up the integrated devices for quantum applications requires highperformance single-photon generation and photonic qubit-qubit entangling operations. However, previous demonstrations report major challenges in producing multiple bright, pure and identical single-photons, and entangling multiple photonic qubits with high fidelity. Another notable challenge is to noiselessly interface multiphoton sources and multiqubit operators in a single device. Here we demonstrate on-chip genuine multipartite entanglement and quantum teleportation in silicon, by coherently controlling an integrated network of microresonator nonlinear single-photon sources and linear-optic multiqubit entangling circuits. The microresonators are engineered to locally enhance the nonlinearity, producing multiple frequencyuncorrelated and indistinguishable single-photons, without requiring any spectral filtering. The multiqubit states are processed in a programmable linear circuit facilitating Bell-projection and fusion operation in a measurement-based manner. We benchmark key functionalities, such as intra-/inter-chip teleportation of quantum states, and generation of four-photon Greenberger-HorneZeilinger entangled states. The production, control, and transceiving of states are all achieved in micrometer-scale silicon chips, fabricated by complementary metal-oxide-semiconductor processes. Our work lays the groundwork for scalable on-chip multiphoton technologies for quantum computing and communication.

quant-ph↗
arXiv2020

Coordinated Multi-Point Transmission: A Poisson-Delaunay Triangulation Based Approach

Coordinated multi-point (CoMP) transmission is a cooperating technique among base stations (BSs) in a cellular network, with outstanding capability at inter-cell interference (ICI) mitigation. ICI is a dominant source of error, and has detrimental effects on system performance if not managed properly. Based on the theory of Poisson-Delaunay triangulation, this paper proposes a novel analytical model for CoMP operation in cellular networks. Unlike the conventional CoMP operation that is dynamic and needs on-line updating occasionally, the proposed approach enables the cooperating BS set of a user equipment (UE) to be fixed and off-line determined according to the location information of BSs. By using the theory of stochastic geometry, the coverage probability and spectral efficiency of a typical UE are analyzed, and simulation results corroborate the effectiveness of the proposed CoMP scheme and the developed performance analysis.

cs.IT↗
arXiv2020

Transductive Zero-Shot Learning with Visual Structure Constraint

To recognize objects of the unseen classes, most existing Zero-Shot Learning(ZSL) methods first learn a compatible projection function between the common semantic space and the visual space based on the data of source seen classes, then directly apply it to the target unseen classes. However, in real scenarios, the data distribution between the source and target domain might not match well, thus causing the well-known \textbf{domain shift} problem. Based on the observation that visual features of test instances can be separated into different clusters, we propose a new visual structure constraint on class centers for transductive ZSL, to improve the generality of the projection function (i.e. alleviate the above domain shift problem). Specifically, three different strategies (symmetric Chamfer-distance, Bipartite matching distance, and Wasserstein distance) are adopted to align the projected unseen semantic centers and visual cluster centers of test instances. We also propose a new training strategy to handle the real cases where many unrelated images exist in the test dataset, which is not considered in previous methods. Experiments on many widely used datasets demonstrate that the proposed visual structure constraint can bring substantial performance gain consistently and achieve state-of-the-art results. The source code is available at \url{https://github.com/raywzy/VSC}.

cs.CV↗
arXiv2019

Frequency up-conversion of an infrared image via a flat-top pump beam

The infrared imaging detection is an important and promising technology having wide applications. In this work, we report on the frequency up-conversion detection of an image based on sum frequency generation in a nonlinear crystal with a flat-top beam acting as the pump instead of a Gaussian beam, the up-converted image at 525 nm falls in the sensitive band of visible detectors and human eyes. Both theoretical simulations and the experimental results clearly demonstrate that using a flat-top beam as a pump can improve the fidelity of an image after the up-conversion compared with a Gaussian pump beam. Our scheme will be very promising for infrared image detection based on frequency up-conversion.

physics.optics↗
arXiv2019

Integrated pulse scope for tunable generation and intrinsic characterization of structured femtosecond laser

Numerous techniques have been demonstrated for effective generation of orbital angular momentum-carrying radiation, but intracavity generation of continuously tunable pulses in the femtosecond regime remains challenging. Even if such a creation was realized, the generated pulses, like all pulses in reality, are complex and transitory objects that can only be comprehensively characterized via multidimensional spaces. An integrated lasing system that generates pulses while simultaneously quantifies them can achieve adaptive pulse tailoring. Here, we report a femtosecond pulse scope that unifies vector vortex mode-locked lasing and vectorial quantification. With intracavity-controlled Pancharatnam-Berry phase modulation, continuous and ergodic generation of spirally polarized states along a broadband higher-order Poincare sphere was realized. By intrinsically coupling a two-dimensional polarization-sensitive time-scanning interferometer to the laser, multidimensional spatiotemporal features of the pulse were further visualized. The proposed methodology paves the way for design optimization of ultrafast optics by integrating complex femtosecond pulse generation and structural customization, facilitating its applications in optical physics research and laser-based manufacturing.

physics.optics↗
arXiv2019

A high-dimensional quantum frequency converter

In high dimensional quantum communication networks, quantum frequency convertor (QFC) is indispensable as an interface in the frequency domain. For example, many QFCs have been built to link atomic memories and fiber channels. However, almost all of QFCs work in a two-dimensional space. It is still a pivotal challenge to construct a high-quality QFC for some complex quantum states, e.g., a high dimensional single-photon state that refers to a qudit. Here, we firstly propose a high-dimensional QFC for an orbital angular momentum qudit via sum frequency conversion with a flat top beam pump. As a proof-of-principle demonstration, we realize quantum frequency conversions for a qudit from infrared to visible range. Based on the qudit quantum state tomography, the fidelities of converted state are 98.29(95.02)\%, 97.42(91.74)\%, and 86.75(67.04)\% for a qudit without (with) dark counts in 2,3, and 5 dimensions, respectively. The demonstration is very promising for constructing a high capacity quantum communication network.

quant-ph↗
arXiv2019

Polar Codes: Analysis and Construction Based on Polar Spectrum

Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the analysis and construction of polar codes involve the complex iterative-calculation. In this paper, by revisiting the error event of the polarized channel, a new concept, named polar spectrum, is introduced from the weight distribution of polar codes. Thus we establish a systematic framework in term of the polar spectrum to analyze and construct polar codes. By using polar spectrum, we derive the union bound and the union-Bhattacharyya (UB) bound of the error probability of polar codes and the upper/lower bound of the symmetric capacity of the polarized channel. The analysis based on the polar spectrum can intuitively interpret the performance of polar codes under successive cancellation (SC) decoding. Furthermore, we analyze the coding structure of polar codes and design an enumeration algorithm based on the MacWilliams identities to efficiently calculate the polar spectrum. In the end, two construction metrics named UB bound weight (UBW) and simplified UB bound weight (SUBW) respectively, are designed based on the UB bound and the polar spectrum. Not only are these two constructions simple and explicit for the practical polar coding, but they can also generate polar codes with similar (in SC decoding) or superior (in SC list decoding) performance over those based on the traditional methods.

cs.IT↗
arXiv2019

Examining the impact of data quality and completeness of electronic health records on predictions of patients risks of cardiovascular disease

The objective is to assess the extent of variation of data quality and completeness of electronic health records and impact on the robustness of risk predictions of incident cardiovascular disease (CVD) using a risk prediction tool that is based on routinely collected data (QRISK3). The study design is a longitudinal cohort study with a setting of 392 general practices (including 3.6 million patients) linked to hospital admission data. Variation in data quality was assessed using Saez stability metrics quantifying outlyingness of each practice. Statistical frailty models evaluated whether accuracy of QRISK3 predictions on individual predictions and effects of overall risk factors (linear predictor) varied between practices. There was substantial heterogeneity between practices in CVD incidence unaccounted for by QRISK3. In the lowest quintile of statistical frailty, a QRISK3 predicted risk of 10% for female was in a range between 7.1% and 9.0% when incorporating practice variability into the statistical frailty models; for the highest quintile, this was 10.9%-16.4%. Data quality (using Saez metrics) and completeness were comparable across different levels of statistical frailty. For example, recording of missing information on ethnicity was 55.7%, 62.7%, 57.8%, 64.8% and 62.1% for practices from lowest to highest quintiles of statistical frailty respectively. The effects of risk factors did not vary between practices with little statistical variation of beta coefficients. In conclusion, the considerable unmeasured heterogeneity in CVD incidence between practices was not explained by variations in data quality or effects of risk factors. QRISK3 risk prediction should be supplemented with clinical judgement and evidence of additional risk factors.

stat.AP↗