arXiv subjects

Bin Li

Publications and source records attributed to Bin Li.

At least 631 records · Page 35Linked to original sources

arXiv2019

UAV Communications for 5G and Beyond: Recent Advances and Future Trends

Providing ubiquitous connectivity to diverse device types is the key challenge for 5G and beyond 5G (B5G). Unmanned aerial vehicles (UAVs) are expected to be an important component of the upcoming wireless networks that can potentially facilitate wireless broadcast and support high rate transmissions. Compared to the communications with fixed infrastructure, UAV has salient attributes, such as flexible deployment, strong line-of-sight (LoS) connection links, and additional design degrees of freedom with the controlled mobility. In this paper, a comprehensive survey on UAV communication towards 5G/B5G wireless networks is presented. We first briefly introduce essential background and the space-air-ground integrated networks, as well as discuss related research challenges faced by the emerging integrated network architecture. We then provide an exhaustive review of various 5G techniques based on UAV platforms, which we categorize by different domains including physical layer, network layer, and joint communication, computing and caching. In addition, a great number of open research problems are outlined and identified as possible future research directions.

cs.NI↗

arXiv2018

Predicting Lung Nodule Malignancies by Combining Deep Convolutional Neural Network and Handcrafted Features

To predict lung nodule malignancy with a high sensitivity and specificity, we propose a fusion algorithm that combines handcrafted features (HF) into the features learned at the output layer of a 3D deep convolutional neural network (CNN). First, we extracted twenty-nine handcrafted features, including nine intensity features, eight geometric features, and twelve texture features based on grey-level co-occurrence matrix (GLCM) averaged from thirteen directions. We then trained 3D CNNs modified from three state-of-the-art 2D CNN architectures (AlexNet, VGG-16 Net and Multi-crop Net) to extract the CNN features learned at the output layer. For each 3D CNN, the CNN features combined with the 29 handcrafted features were used as the input for the support vector machine (SVM) coupled with the sequential forward feature selection (SFS) method to select the optimal feature subset and construct the classifiers. The fusion algorithm takes full advantage of the handcrafted features and the highest level CNN features learned at the output layer. It can overcome the disadvantage of the handcrafted features that may not fully reflect the unique characteristics of a particular lesion by combining the intrinsic CNN features. Meanwhile, it also alleviates the requirement of a large scale annotated dataset for the CNNs based on the complementary of handcrafted features. The patient cohort includes 431 malignant nodules and 795 benign nodules extracted from the LIDC/IDRI database. For each investigated CNN architecture, the proposed fusion algorithm achieved the highest AUC, accuracy, sensitivity, and specificity scores among all competitive classification models.

cs.CV↗

arXiv2018

Affinity Derivation and Graph Merge for Instance Segmentation

We present an instance segmentation scheme based on pixel affinity information, which is the relationship of two pixels belonging to a same instance. In our scheme, we use two neural networks with similar structure. One is to predict pixel level semantic score and the other is designed to derive pixel affinities. Regarding pixels as the vertexes and affinities as edges, we then propose a simple yet effective graph merge algorithm to cluster pixels into instances. Experimental results show that our scheme can generate fine-grained instance mask. With Cityscapes training data, the proposed scheme achieves 27.3 AP on test set.

cs.CV↗

arXiv2018

A Review for Weighted MinHash Algorithms

Data similarity (or distance) computation is a fundamental research topic which underpins many high-level applications based on similarity measures in machine learning and data mining. However, in large-scale real-world scenarios, the exact similarity computation has become daunting due to "3V" nature (volume, velocity and variety) of big data. In such cases, the hashing techniques have been verified to efficiently conduct similarity estimation in terms of both theory and practice. Currently, MinHash is a popular technique for efficiently estimating the Jaccard similarity of binary sets and furthermore, weighted MinHash is generalized to estimate the generalized Jaccard similarity of weighted sets. This review focuses on categorizing and discussing the existing works of weighted MinHash algorithms. In this review, we mainly categorize the Weighted MinHash algorithms into quantization-based approaches, "active index"-based ones and others, and show the evolution and inherent connection of the weighted MinHash algorithms, from the integer weighted MinHash algorithms to real-valued weighted MinHash ones (particularly the Consistent Weighted Sampling scheme). Also, we have developed a python toolbox for the algorithms, and released it in our github. Based on the toolbox, we experimentally conduct a comprehensive comparative study of the standard MinHash algorithm and the weighted MinHash ones.

cs.DS↗

arXiv2018

General drawdown of general tax model in a time-homogeneous Markov framework

Drawdown/regret times feature prominently in optimal stopping problems, in statistics (CUSUM procedure) and in mathematical finance (Russian options). Recently it was discovered that a first passage theory with general drawdown times, which generalize classic ruin times, may be explicitly developed for spectrally negative Lévy processes -- see Avram, Vu, Zhou(2017), Li, Vu, Zhou(2017). In this paper, we further examine general drawdown related quantities for taxed time-homogeneous Markov processes, using the pathwise connection between general drawdown and tax.

math.PR↗

arXiv2018

A novel dynamic scheme to reconstruct sub-50 atto-second pulses

The attosecond streaking technique is normally utilized to characterize the attosecond pulses in extreme ultraviolet spectrum, while the pulse simulation and reconstruction schemes turn out to be unreliable for extremely short sub-100as pulses. Based on systematical analysis and subtle investigation, we developed a dynamic streaking model for ultrashort photoelectron pulses and demonstrated concretely how the temporal phase of attosecond pulses would influence the streaked spectrogram. Upon that, a novel numeric scheme is established to retrieve the pulse-lengths and chirps. Different with the traditional FROG-CRAB algorithm utilizing the central energy approximation, our approach concerns the actual time-energy distribution of an electron wave-packet within sub-100as time-scale, capable for retrieving the temporal profiles of the ultrashort pulse more accurately.

physics.optics↗

arXiv2018

Critical behavior of order parameter at the nonequilibrium phase transition of the Ising model

After a quench of transverse field, the asymptotic long-time state of Ising model displays a transition from a ferromagnetic phase to a paramagnetic phase as the post-quench field strength increases, which is revealed by the vanishing of the order parameter defined as the averaged magnetization over time. We estimate the critical behavior of the magnetization at this nonequilibrium phase transition by using mean-field approximation. In the vicinity of the critical field, the magnetization vanishes as the inverse of a logarithmic function, which is significantly distinguished from the critical behavior of order parameter at the corresponding equilibrium phase transition, i.e. a power-law function.

cond-mat.quant-gas↗

arXiv2018

Topological Type-II Dirac Fermions Approaching the Fermi Level in a Transition Metal Dichalcogenide NiTe2

Type-II Dirac/Weyl semimetals are characterized by strongly tilted Dirac cones such that the Dirac/Weyl node emerges at the boundary of electron and hole pockets as a new state of quantum matter, distinct from the standard Dirac/Weyl points with a point-like Fermi surface which are referred to as type-I nodes. The type-II Dirac fermions were recently predicted by theory and have since been confirmed in experiments in the PtSe2-class of transition metal dichal-cogenides. However, the Dirac nodes observed in PtSe2, PdTe2 and PtTe2 candidates are quite far away from the Fermi level, making the signature of topological fermions obscure as the physical properties are still dominated by the non-Dirac quasiparticles. Here we report the synthesis of a new type-II Dirac semimetal NiTe2 in which a pair of type-II Dirac nodes are located very close to the Fermi level. The quantum oscillations in this material reveal a nontrivial Berry's phase associated with these Dirac fermions. Our first principles calculations further unveil a topological Dirac cone in its surface states. Therefore, NiTe2 may not only represent an improved system to formulate the theoretical understanding of the exotic consequences of type-II Dirac fermions, it also facilitates possible applications based on these topological carriers.

cond-mat.str-el↗

arXiv2018

Towards extremely high-resolution broad-band flat-field spectrometer in 'water window'

The optical design of a novel spectrometer is present, combining a cylindrically convex pre-mirror with a cylindrically concave VLS grating (both in meridional) to deliver a resolving power of 100,000-200,000 in 'water window' (2-5nm). More remarkably, unlike a typical RIXS spectrometer to obtain such high resolution by tight focusing or tiny confinement slit (<1μm), here the resolution could be achieved for an effective meridional source size of 50μm (r.m.s.). The overall optical aberrations of the system are well analysed and compensated, providing an excellent flat field at the detector domain throughout the whole spectral range. And a machine learning scheme - SVM is introduced to explore and reconstruct the optimal system with pretty high efficiency.

physics.ins-det↗

arXiv2018

A Study of Deep Feature Fusion based Methods for Classifying Multi-lead ECG

An automatic classification method has been studied to effectively detect and recognize Electrocardiogram (ECG). Based on the synchronizing and orthogonal relationships of multiple leads, we propose a Multi-branch Convolution and Residual Network (MBCRNet) with three kinds of feature fusion methods for automatic detection of normal and abnormal ECG signals. Experiments are conducted on the Chinese Cardiovascular Disease Database (CCDD). Through 10-fold cross-validation, we achieve an average accuracy of 87.04% and a sensitivity of 89.93%, which outperforms previous methods under the same database. It is also shown that the multi-lead feature fusion network can improve the classification accuracy over the network only with the single lead features.

cs.CV↗

arXiv2018

Scene Learning: Deep Convolutional Networks For Wind Power Prediction by Embedding Turbines into Grid Space

Wind power prediction is of vital importance in wind power utilization. There have been a lot of researches based on the time series of the wind power or speed, but In fact, these time series cannot express the temporal and spatial changes of wind, which fundamentally hinders the advance of wind power prediction. In this paper, a new kind of feature that can describe the process of temporal and spatial variation is proposed, namely, Spatio-Temporal Features. We first map the data collected at each moment from the wind turbine to the plane to form the state map, namely, the scene, according to the relative positions. The scene time series over a period of time is a multi-channel image, i.e. the Spatio-Temporal Features. Based on the Spatio-Temporal Features, the deep convolutional network is applied to predict the wind power, achieving a far better accuracy than the existing methods. Compared with the starge-of-the-art method, the mean-square error (MSE) in our method is reduced by 49.83%, and the average time cost for training models can be shortened by a factor of more than 150.

cs.LG↗

arXiv2018

Customer Sharing in Economic Networks with Costs

In an economic market, sellers, infomediaries and customers constitute an economic network. Each seller has her own customer group and the seller's private customers are unobservable to other sellers. Therefore, a seller can only sell commodities among her own customers unless other sellers or infomediaries share her sale information to their customer groups. However, a seller is not incentivized to share others' sale information by default, which leads to inefficient resource allocation and limited revenue for the sale. To tackle this problem, we develop a novel mechanism called customer sharing mechanism (CSM) which incentivizes all sellers to share each other's sale information to their private customer groups. Furthermore, CSM also incentivizes all customers to truthfully participate in the sale. In the end, CSM not only allocates the commodities efficiently but also optimizes the seller's revenue.

cs.GT↗

arXiv2018

A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes

Due to their provably capacity-achieving performance, polar codes have attracted a lot of research interest recently. For a good error-correcting performance, list successive-cancellation decoding (LSCD) with large list size is used to decode polar codes. However, as the complexity and delay of the list management operation rapidly increase with the list size, the overall latency of LSCD becomes large and limits the applicability of polar codes in high-throughput and latency-sensitive applications. Therefore, in this work, the low-latency implementation for LSCD with large list size is studied. Specifically, at the system level, a selective expansion method is proposed such that some of the reliable bits are not expanded to reduce the computation and latency. At the algorithmic level, a double thresholding scheme is proposed as a fast approximate-sorting method for the list management operation to reduce the LSCD latency for large list size. A VLSI architecture of the LSCD implementing the selective expansion and double thresholding scheme is then developed, and implemented using a UMC 90 nm CMOS technology. Experimental results show that, even for a large list size of 16, the proposed LSCD achieves a decoding throughput of 460 Mbps at a clock frequency of 658 MHz.

cs.IT↗

arXiv2018

Robust Fuzzy-Learning For Partially Overlapping Channels Allocation In UAV Communication Networks

In this paper, we consider a mesh-structured unmanned aerial vehicle (UAV) networks exploiting partially overlapping channels (POCs). For general data-collection tasks in UAV networks, we aim to optimize the network throughput with constraints on transmission power and quality of service (QoS). As far as the highly mobile and constantly changing UAV networks are concerned, unfortunately, most existing methods rely on definite information which is vulnerable to the dynamic environment, rendering system performance to be less effective. In order to combat dynamic topology and varying interference of UAV networks, a robust and distributed learning scheme is proposed. Rather than the perfect channel state information (CSI), we introduce uncertainties to characterize the dynamic channel gains among UAV nodes, which are then interpreted with fuzzy numbers. Instead of the traditional observation space where the channel capacity is a crisp reward, we implement the learning and decision process in a mapped fuzzy space. This allows the system to achieve a smoother and more robust performance by optimizing in an alternate space. To this end, we design a fuzzy payoffs function (FPF) to describe the fluctuated utility, and the problem of POCs assignment is formulated as a fuzzy payoffs game (FPG). Assisted by an attractive property of fuzzy bi-matrix games, the existence of fuzzy Nash equilibrium (FNE) for our formulated FPG is proved. Our robust fuzzy-learning algorithm could reach the equilibrium solution via a least-deviation method. Finally, numerical simulations are provided to demonstrate the advantages of our new scheme over the existing scheme.

cs.NI↗

arXiv2018

Model-Free Information Extraction in Enriched Nonlinear Phase-Space

Detecting anomalies and discovering driving signals is an essential component of scientific research and industrial practice. Often the underlying mechanism is highly complex, involving hidden evolving nonlinear dynamics and noise contamination. When representative physical models and large labeled data sets are unavailable, as is the case with most real-world applications, model-dependent Bayesian approaches would yield misleading results, and most supervised learning machines would also fail to reliably resolve the intricately evolving systems. Here, we propose an unsupervised machine-learning approach that operates in a well-constructed function space, whereby the evolving nonlinear dynamics are captured through a linear functional representation determined by the Koopman operator. This breakthrough leverages on the time-feature embedding and the ensuing reconstruction of a phase-space representation of the dynamics, thereby permitting the reliable identification of critical global signatures from the whole trajectory. This dramatically improves over commonly used static local features, which are vulnerable to unknown transitions or noise. Thanks to its data-driven nature, our method excludes any prior models and training corpus. We benchmark the astonishing accuracy of our method on three diverse and challenging problems in: biology, medicine, and engineering. In all cases, it outperforms existing state-of-the-art methods. As a new unsupervised information processing paradigm, it is suitable for ubiquitous nonlinear dynamical systems or end-users with little expertise, which permits an unbiased excavation of underlying working principles or intrinsic correlations submerged in unlabeled data flows.

cs.LG↗

arXiv2018

A High-Throughput Architecture of List Successive Cancellation Polar Codes Decoder with Large List Size

As the first kind of forward error correction (FEC) codes that achieve channel capacity, polar codes have attracted much research interest recently. Compared with other popular FEC codes, polar codes decoded by list successive cancellation decoding (LSCD) with a large list size have better error correction performance. However, due to the serial decoding nature of LSCD and the high complexity of list management (LM), the decoding latency is high, which limits the usage of polar codes in practical applications that require low latency and high throughput. In this work, we study the high-throughput implementation of LSCD with a large list size. Specifically, at the algorithmic level, to achieve a low decoding latency with moderate hardware complexity, two decoding schemes, a multi-bit double thresholding scheme and a partial G-node look-ahead scheme, are proposed. Then, a high-throughput VLSI architecture implementing the proposed algorithms is developed with optimizations on different computation modules. From the implementation results on UMC 90 nm CMOS technology, the proposed architecture achieves decoding throughputs of 1.103 Gbps, 977 Mbps and 827 Mbps when the list sizes are 8, 16 and 32, respectively.

eess.SP↗

arXiv2018

An Implementation of List Successive Cancellation Decoder with Large List Size for Polar Codes

Polar codes are the first class of forward error correction (FEC) codes with a provably capacity-achieving capability. Using list successive cancellation decoding (LSCD) with a large list size, the error correction performance of polar codes exceeds other well-known FEC codes. However, the hardware complexity of LSCD rapidly increases with the list size, which incurs high usage of the resources on the field programmable gate array (FPGA) and significantly impedes the practical deployment of polar codes. To alleviate the high complexity, in this paper, two low-complexity decoding schemes and the corresponding architectures for LSCD targeting FPGA implementation are proposed. The architecture is implemented in an Altera Stratix V FPGA. Measurement results show that, even with a list size of 32, the architecture is able to decode a codeword of 4096-bit polar code within 150 us, achieving a throughput of 27Mbps

eess.SP↗

arXiv2018

Optimal Load-Balancing for High-Density Wireless Networks with Flow-Level Dynamics

We consider the load-balancing design for forwarding incoming flows to access points (APs) in high-density wireless networks with both channel fading and flow-level dynamics, where each incoming flow has a certain amount of service demand and leaves the system once its service request is complete (referred as flow-level dynamic model). The efficient load-balancing design is strongly needed for supporting high-quality wireless connections in high-density areas. Despite the presence of a variety of earlier works on the design and analysis of the load-balancing schemes in wireless networks, there does not exist a work on the load-balancing design in the realistic flow-level dynamic model. In this work, we propose a Join-the-Least-Workload (JLW) Algorithm that always forwards the incoming flows to the AP with the smallest workload in the presence of flow-level dynamics. However, our considered flow-level dynamic model differs from traditional queueing model for wireless networks in the following two aspects: (1) the dynamics of the flows is short-term and flows will leave the network once they received the desired amount of service; (2) each individual flow faces an independent channel fading. These differences pose significant challenges on the system performance analysis. To tackle these challenges, we perform Lyapunov-drift-based analysis of the stochastic network taking into account sharp flow-level dynamics. Our analysis reveals that our proposed JLW Algorithm not only achieves maximum system throughput, but also minimizes the total system workload in heavy-traffic regimes. Moreover, we observe from both our theoretical and simulation results that the mean total workload performance under the proposed JLW Algorithm does not degrade as the number of APs increases, which is strongly desirable in high-density wireless networks.

cs.NI↗