Search arXiv⌕ Search

arXiv subjects

Bin Li

Publications and source records attributed to Bin Li.

At least 649 records · Page 36Linked to original sources
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↗
arXiv2018

CNN Based Adversarial Embedding with Minimum Alteration for Image Steganography

Historically, steganographic schemes were designed in a way to preserve image statistics or steganalytic features. Since most of the state-of-the-art steganalytic methods employ a machine learning (ML) based classifier, it is reasonable to consider countering steganalysis by trying to fool the ML classifiers. However, simply applying perturbations on stego images as adversarial examples may lead to the failure of data extraction and introduce unexpected artefacts detectable by other classifiers. In this paper, we present a steganographic scheme with a novel operation called adversarial embedding, which achieves the goal of hiding a stego message while at the same time fooling a convolutional neural network (CNN) based steganalyzer. The proposed method works under the conventional framework of distortion minimization. Adversarial embedding is achieved by adjusting the costs of image element modifications according to the gradients backpropagated from the CNN classifier targeted by the attack. Therefore, modification direction has a higher probability to be the same as the sign of the gradient. In this way, the so called adversarial stego images are generated. Experiments demonstrate that the proposed steganographic scheme is secure against the targeted adversary-unaware steganalyzer. In addition, it deteriorates the performance of other adversary-aware steganalyzers opening the way to a new class of modern steganographic schemes capable to overcome powerful CNN-based steganalysis.

cs.MM↗
arXiv2018

Higgs production at future $e^+e^-$ colliders in the Georgi-Machacek model

We study how the dominant single and double SM-like Higgs ($h$) production at future $e^+e^-$ colliders is modified in the Georgi-Machacek (GM) model. On imposing theoretical, indirect and direct constraints, significant deviations of $h$-couplings from their SM values are still possible; for instance, the Higgs-gauge coupling coupling can be corrected by a factor $κ_{hVV}\in[0.93,1.15]$ in the allowed parameter space. For the Higgs-strahlung $e^+e^-\to hZ$ and vector boson fusion processes $e^+e^-\to hν\barν,~he^+e^-$, the cross section could increase by $32\%$ or decrease by $13\%$. In the case of associated production with a top quark pair $e^+e^-\to ht\bar{t}$, the cross section can be enhanced up to several times when the custodial triplet scalar $H_3^0$ is resonantly produced. In the meanwhile, the double Higgs production $e^+e^-\to hhZ~(hhν\barν)$ can be maximally enhanced by one order of magnitude at the resonant $H_{1,3}^0$ production. We also include exclusion limits expected from future LHC runs at higher energy and luminosity and discuss their further constraints on the relevant model parameters. We find that the GM model can result in likely measurable deviations of Higgs production from the SM at future $e^+e^-$ colliders.

hep-ph↗
arXiv2018

Interpreting the $R_{K^{(*)}}$ Anomaly in the Colored Zee-Babu Model

We consider the feasibility of interpreting the $R_{K^{(*)}}$ anomaly in the colored Zee-Babu model. The model generates neutrino masses at two loops with the help of a scalar leptoquark $S\sim(3,3,-\frac{1}{3})$ and a scalar diquark $ω\sim(6,1,-\frac{2}{3})$, and contributes to the transition $b\to s\ell\ell$ via the exchange of a leptoquark $S$ at tree level. Under constraints from lepton flavor violating (LFV) and flavor changing neutral current (FCNC) processes, and direct collider searches for heavy particles, we acquire certain parameter space that can accommodate the $R_{K^{(*)}}$ anomaly for both normal (NH) and inverted (IH) hierarchies of neutrino masses. We further examine the LFV decays of the $B$ meson, and find its strong correlation with the neutrino mass hierarchy, i.e., $\text{Br}(B^+ \to K^+ μ^\pmτ^\mp)\gtrsim\text{Br}(B^+ \to K^+ μ^\pm e^\mp)\approx\text{Br}(B^+ \to K^+ τ^\pm e^\mp)$ for NH, while $\text{Br}(B^+ \to K^+ μ^\pm τ^\mp)\ll\text{Br}(B^+ \to K^+ μ^\pm e^\mp)\approx\text{Br}(B^+ \to K^+ τ^\pm e^\mp)$ for IH. Among these decays, only $B^+ \to K^+ μ^\pm e^\mp$ in the case of NH is promising at the LHCb RUN II, while for IH all LFV decays are hard to detect in the near future.

hep-ph↗
arXiv2018

Shortest Path and Maximum Flow Problems Under Service Function Chaining Constraints

With the advent of Network Function Virtualization (NFV), Physical Network Functions (PNFs) are gradually being replaced by Virtual Network Functions (VNFs) that are hosted on general purpose servers. Depending on the call flows for specific services, the packets need to pass through an ordered set of network functions (physical or virtual) called Service Function Chains (SFC) before reaching the destination. Conceivably for the next few years during this transition, these networks would have a mix of PNFs and VNFs, which brings an interesting mix of network problems that are studied in this paper: (1) How to find an SFC-constrained shortest path between any pair of nodes? (2) What is the achievable SFC-constrained maximum flow? (3) How to place the VNFs such that the cost (the number of nodes to be virtualized) is minimized, while the maximum flow of the original network can still be achieved even under the SFC constraint? In this work, we will try to address such emerging questions. First, for the SFC-constrained shortest path problem, we propose a transformation of the network graph to minimize the computational complexity of subsequent applications of any shortest path algorithm. Second, we formulate the SFC-constrained maximum flow problem as a fractional multicommodity flow problem, and develop a combinatorial algorithm for a special case of practical interest. Third, we prove that the VNFs placement problem is NP-hard and present an alternative Integer Linear Programming (ILP) formulation. Finally, we conduct simulations to elucidate our theoretical results.

cs.NI↗
arXiv2018

How Market Structure Drives Commodity Prices

We introduce an agent-based model, in which agents set their prices to maximize profit. At steady state the market self-organizes into three groups: excess producers, consumers and balanced agents, with prices determined by their own resource level and a couple of macroscopic parameters that emerge naturally from the analysis, akin to mean-field parameters in statistical mechanics. When resources are scarce prices rise sharply below a turning point that marks the disappearance of excess producers. To compare the model with real empirical data, we study the relations between commodity prices and stock-to-use ratios of a range of commodities such as agricultural products and metals. By introducing an elasticity parameter to mitigate noise and long-term changes in commodities data, we confirm the trend of rising prices, provide evidence for turning points, and indicate yield points for less essential commodities.

q-fin.GN↗
arXiv2017

Transiting Exoplanet Monitoring Project (TEMP). III. On the Relocation of the Kepler-9~b Transit

The Kepler-9 system harbors three known transiting planets. The system holds significant interest for several reasons. First, the outer two planets exhibit a period ratio that is close to a 2:1 orbital commensurability, with attendant dynamical consequences. Second, both planets lie in the planetary mass "desert" that is generally associated with the rapid gas agglomeration phase of the core accretion process. Third, there exist attractive prospects for accurately measuring both the sky-projected stellar spin-orbit angles as well as the mutual orbital inclination between the planets in the system. Following the original \textit{Kepler} detection announcement in 2010, the initially reported orbital ephemerides for Kepler-9~b and c have degraded significantly, due to the limited time base-line of observations on which the discovery of the system rested. Here, we report new ground-based photometric observations and extensive dynamical modeling of the system. These efforts allow us to photometrically recover the transit of Kepler-9~b, and thereby greatly improve the predictions for upcoming transit mid-times. Accurate ephemerides of this system are important in order to confidently schedule follow-up observations of this system, for both in-transit Doppler measurements as well as for atmospheric transmission spectra taken during transit.

astro-ph.EP↗
arXiv2017

Searching for the Transit of the Earth--mass exoplanet Proxima~Centauri~b in Antarctica: Preliminary Result

Proxima Centauri is known as the closest star from the Sun. Recently, radial velocity observations revealed the existence of an Earth-mass planet around it. With an orbital period of ~11 days, the surface of Proxima Centauri b is temperate and might be habitable. We took a photometric monitoring campaign to search for its transit, using the Bright Star Survey Telescope at the Zhongshan Station in Antarctica. A transit-like signal appearing on 2016 September 8th, is identified tentatively. Its midtime, $T_{C}=2,457,640.1990\pm0.0017$ HJD, is consistent with the predicted ephemeris based on RV orbit in a 1$σ$ confidence interval. Time-correlated noise is pronounced in the light curve of Proxima Centauri, affecting detection of transits. We develop a technique, in a Gaussian process framework, to gauge the statistical significance of potential transit detection. The tentative transit signal reported here, has a confidence level of $2.5σ$. Further detection of its periodic signals is necessary to confirm the planetary transit of Proxima Centauri b. We plan to monitor Proxima Centauri in next Polar night at Dome A in Antarctica, taking the advantage of continuous darkness. \citet{Kipping17} reported two tentative transit-like signals of Proxima Centauri b, observed by the Microvariability and Oscillation of Stars space Telescope in 2014 and 2015, respectively. The midtransit time of our detection is 138 minutes later than that predicted by their transit ephemeris. If all the signals are real transits, the misalignment of the epochs plausibly suggests transit timing variations of Proxima Centauri b induced by an outer planet in this system.

astro-ph.EP↗
arXiv2017

Large-scale JPEG steganalysis using hybrid deep-learning framework

Adoption of deep learning in image steganalysis is still in its initial stage. In this paper we propose a generic hybrid deep-learning framework for JPEG steganalysis incorporating the domain knowledge behind rich steganalytic models. Our proposed framework involves two main stages. The first stage is hand-crafted, corresponding to the convolution phase and the quantization & truncation phase of the rich models. The second stage is a compound deep neural network containing multiple deep subnets in which the model parameters are learned in the training procedure. We provided experimental evidences and theoretical reflections to argue that the introduction of threshold quantizers, though disable the gradient-descent-based learning of the bottom convolution phase, is indeed cost-effective. We have conducted extensive experiments on a large-scale dataset extracted from ImageNet. The primary dataset used in our experiments contains 500,000 cover images, while our largest dataset contains five million cover images. Our experiments show that the integration of quantization and truncation into deep-learning steganalyzers do boost the detection performance by a clear margin. Furthermore, we demonstrate that our framework is insensitive to JPEG blocking artifact alterations, and the learned model can be easily transferred to a different attacking target and even a different dataset. These properties are of critical importance in practical applications.

cs.MM↗