arXiv subjects

Bin Li

Publications and source records attributed to Bin Li.

At least 613 records · Page 34Linked to original sources

arXiv2020

How Molecular Chiralities of Bis(mandelato)borate Anions affect Their Binding Structures with Alkali Metal Ions and Microstructural Properties in Tetraalkylphosphonium Ionic Liquids

Spiroborate anions based inorganic electrolytes and ionic liquids (ILs) have fascinating electrochemical and tribological properties, and have received widespread attention in industrial applications. Molecular chiralities of spiroborate anions have a significant effect on microstructures and macroscopic functionalities of these ionic materials in applications, and thus deserve a fundamental understanding. In current work, we performed quantum chemistry calculations to address binding strength and coordination structures of chiral bis(mandelato)borate ([BMB]) anions with representative alkali metal ions, as well as electronic properties of alkali metal ion-[BMB] ion pair complexes. The optimized [BMB] conformers are categorized into V-shaped, bent, and twisted structures with varied electrostatic potential contours, conformational energies, and distinct alkali metal ion-[BMB] binding structures. Alkali metal ions have additional associations with phenyl groups in V-shaped [BMB] conformers owing to preferential cation-$π$ interactions. Furthermore, effects of molecular chiralities of [BMB] anions on thermodynamics and microstructural properties of tetraalkylphosphonium [BMB] ILs were studied by performing extensive atomistic interactions. Oxygen atoms in [BMB] anions have competitive hydrogen bonding interactions with hydrogen atoms in cations depending on molecular chiralities and steric hindrance effects of [BMB] anions. However, molecular chiralities of [BMB] anions have negligible effect on liquid densities of tetraalkylphosphonium [BMB] ILs and spatial distributions of boron atoms in anions around phosphorous atoms in cations. Enlarging tetraalkylphosphonium cation sizes leads to enhanced cation-anion hydrogen bonding and Coulombic interactions due to enhanced segregation of polar groups in apolar networks in heterogeneous IL matrices.

physics.chem-ph↗

arXiv2020

Outlier Detection Ensemble with Embedded Feature Selection

Feature selection places an important role in improving the performance of outlier detection, especially for noisy data. Existing methods usually perform feature selection and outlier scoring separately, which would select feature subsets that may not optimally serve for outlier detection, leading to unsatisfying performance. In this paper, we propose an outlier detection ensemble framework with embedded feature selection (ODEFS), to address this issue. Specifically, for each random sub-sampling based learning component, ODEFS unifies feature selection and outlier detection into a pairwise ranking formulation to learn feature subsets that are tailored for the outlier detection method. Moreover, we adopt the thresholded self-paced learning to simultaneously optimize feature selection and example selection, which is helpful to improve the reliability of the training set. After that, we design an alternate algorithm with proved convergence to solve the resultant optimization problem. In addition, we analyze the generalization error bound of the proposed framework, which provides theoretical guarantee on the method and insightful practical guidance. Comprehensive experimental results on 12 real-world datasets from diverse domains validate the superiority of the proposed ODEFS.

cs.LG↗

arXiv2019

On Pre-transformed Polar Codes

In this paper, we prove that any pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and convolution code (CC) matrix) does not reduce the code minimum distance and an properly designed pre-transformation can reduce the number of codewords with the minimum distance. This explains that the pre-transformed polar codes can perform better than the Polar/RM codes.

cs.IT↗

arXiv2019

Reinforcement learning for bandwidth estimation and congestion control in real-time communications

Bandwidth estimation and congestion control for real-time communications (i.e., audio and video conferencing) remains a difficult problem, despite many years of research. Achieving high quality of experience (QoE) for end users requires continual updates due to changing network architectures and technologies. In this paper, we apply reinforcement learning for the first time to the problem of real-time communications (RTC), where we seek to optimize user-perceived quality. We present initial proof-of-concept results, where we learn an agent to control sending rate in an RTC system, evaluating using both network simulation and real Internet video calls. We discuss the challenges we observed, particularly in designing realistic reward functions that reflect QoE, and in bridging the gap between the training environment and real-world networks.

cs.NI↗

arXiv2019

Bulk Fermi surface of the layered superconductor TaSe3 with three-dimensional strong topological insulator state

High magnetic field transport measurements and ab initio calculations on the layered superconductor TaSe3 have provided compelling evidences for the existence of a three-dimensional strong topological insulator state. Longitudinal magnetotransport measurements up to ~ 33 T unveiled striking Shubnikov-de Hass oscillations with two fundamental frequencies at 100 T and 175 T corresponding to a nontrivial electron Fermi pocket at the B point and a nontrivial hole Fermi pocket at the Γ point respectively in the Brillouin zone. However, calculations revealed one more electron pocket at the B point, which was not detected by the magnetotransport measurements, presumably due to the limited carrier momentum relaxation time. Angle dependent quantum oscillations by rotating the sample with respect to the magnetic field revealed clear changes in the two fundamental frequencies, indicating anisotropic electronic Fermi pockets. The ab initio calculations gave the topological Z2 invariants of (1; 100) and revealed a single Dirac cone on the (1 0 -1) surface at the X point with helical spin texture at a constant-energy contour, suggesting a strong topological insulator state. The results demonstrate TaSe3 an excellent platform to study the interplay between topological phase and superconductivity and a promising system for the exploration of topological superconductivity.

cond-mat.supr-con↗

arXiv2019

Scalable Deep Generative Relational Models with High-Order Node Dependence

We propose a probabilistic framework for modelling and exploring the latent structure of relational data. Given feature information for the nodes in a network, the scalable deep generative relational model (SDREM) builds a deep network architecture that can approximate potential nonlinear mappings between nodes' feature information and the nodes' latent representations. Our contribution is two-fold: (1) We incorporate high-order neighbourhood structure information to generate the latent representations at each node, which vary smoothly over the network. (2) Due to the Dirichlet random variable structure of the latent representations, we introduce a novel data augmentation trick which permits efficient Gibbs sampling. The SDREM can be used for large sparse networks as its computational cost scales with the number of positive links. We demonstrate its competitive performance through improved link prediction performance on a range of real-world datasets.

stat.ML↗

arXiv2019

Dispersion independent long-haul photon counting OTDR

Photon counting optical time-domain reflectometry (PC-OTDR) based on the single photon detection is an effective scheme to attain the high spatial resolution for optical fiber fault monitoring. Currently, due to the spatial resolution of PC-OTDR is proportional to the pulse width of a laser beam, short laser pulses are essential for the high spatial resolution. However, short laser pulses have a large bandwidth, which would be widened by the dispersion of fiber, thereby causing inevitable deterioration in spatial resolution, especially for long-haul fiber links. In this letter, we propose a scheme of dispersion independent PC-OTDR based on an infinite backscatter technique. Our experimental results -with more than 50 km long fiber - show that the spatial resolution of the PC-OTDR system is independent with the total dispersion of the fiber under test. Our method provides an avenue for developing the long-haul PC-OTDR with high performance.

quant-ph↗

arXiv2019

On occupation times in the red of Lévy risk models

In this paper, we obtain analytical expression for the distribution of the occupation time in the red (below level $0$) up to an (independent) exponential horizon for spectrally negative Lévy risk processes and refracted spectrally negative Lévy risk processes. This result improves the existing literature in which only the Laplace transforms are known. Due to the close connection between occupation time and many other quantities, we provide a few applications of our results including future drawdown, inverse occupation time, Parisian ruin with exponential delay, and the last time at running maximum. By a further Laplace inversion to our results, we obtain the distribution of the occupation time up to a finite time horizon for refracted Brownian motion risk process and refracted Cramér-Lundberg risk model with exponential claims.

q-fin.RM↗

arXiv2019

Weak ferromagnetic insulator with huge coercivity in monoclinic double perovskite La2CuIrO6

Insulating ferromagnets with high TC are required for many new magnetic devices. More complexity arises when strongly correlated 3d ions coexist with strongly spin-orbit coupled 5d ones in a double perovskite. Here, we perform the structural, magnetic, and density functional theory study of such double perovskite La2CuIrO6. A new P21/n polymorph is found according to the comprehensive analysis of x-ray, Raman scattering and phonon spectrum. The magnetization reveals a weak ferromagnetic (FM) transition at TC = 62 K and short range FM order in higher temperature range. A huge coercivity is found as high as HC~11.96 kOe at 10K, which in combination with the negative trapped field results in the magnetization reversal in the zero field cooling measurement. The first principle calculations confirm the observed FM state and suggest La2CuIrO6 of this polymorph is a Mott insulating ferromagnet assisted by the spin-orbit coupling.

cond-mat.str-el↗

arXiv2019

Task Allocation and Mobile Base Station Deployment in Wireless Powered Spatial Crowdsourcing

Wireless power transfer (WPT) is a promising technology to prolong the lifetime of sensor and communication devices, i.e., workers, in completing crowdsourcing tasks by providing continuous and cost-effective energy supplies. In this paper, we propose a wireless powered spatial crowdsourcing (SC) framework which consists of two mutual dependent phases: task allocation phase and data crowdsourcing phase. In the task allocation phase, we propose a Stackelberg game based mechanism for the SC platform to efficiently allocate spatial tasks and wireless charging power to each worker. In the data crowdsourcing phase, the workers may have an incentive to misreport its real working location to improve its own utility, which manipulates the SC platform. To address this issue, we present a strategyproof deployment mechanism for the SC platform to deploy its mobile base station. We apply the Moulin's generalized median mechanism and analyze the worst-case performance in maximizing the SC platform's utility. Finally, numerical experiments reveal the effectiveness of the proposed framework in allocating tasks and charging power to workers while avoiding the dishonest worker's manipulation.

cs.GT↗

arXiv2019

High Dynamic Range Externally Time-gated Photon Counting Optical Time-domain Reflectometry

Single photon detector (SPD) has a maximum count rate due to its dead time, which results in that the dynamic range of photon counting optical time-domain reflectometry (PC-OTDR) de-creases with the length of monitored fiber. To further improve the dynamic range of PC-OTDR, we propose and demonstrate an externally time-gated scheme. The externally time-gated scheme is realized by using a high-speed optical switch, i.e. a Mach-Zehnder interferometer, to modulate the back-propagation optical signal, and to allow that only a certain segment of the fiber is monitored by the SPD. The feasibility of proposed scheme is first examined with theoretical analysis and simulation; then we experimentally demonstrate it with our experimental PC-OTDR testbed operating at 800 nm wavelength band. In our studies, a dynamic range of 30.0 dB is achieved in a 70 meters long PC-OTDR system with 50 ns external gates, corresponding to an improvement of 11.0 dB in dynamic range comparing with no gating operation. Furthermore, with the improved dynamic range, a successful identification of a 0.37 dB loss event is detected with 30-seconds accumulation, which could not be identified without gating operation. Our scheme paves an avenue for developing PC-OTDR systems with high dynamic range.

physics.ins-det↗

arXiv2019

CNN-based Steganalysis and Parametric Adversarial Embedding: a Game-Theoretic Framework

CNN-based steganalysis has recently achieved very good performance in detecting content-adaptive steganography. At the same time, recent works have shown that, by adopting an approach similar to that used to build adversarial examples, a steganographer can adopt an adversarial embedding strategy to effectively counter a target CNN steganalyzer. In turn, the good performance of the steganalyzer can be restored by retraining the CNN with adversarial stego images. A problem with this model is that, arguably, at training time the steganalizer is not aware of the exact parameters used by the steganograher for adversarial embedding and, vice versa, the steganographer does not know how the images that will be used to train the steganalyzer are generated. In order to exit this apparent deadlock, we introduce a game theoretic framework wherein the problem of setting the parameters of the steganalyzer and the steganographer is solved in a strategic way. More specifically, a non-zero sum game is first formulated to model the problem, and then instantiated by considering a specific adversarial embedding scheme setting its operating parameters in a game-theoretic fashion. Our analysis shows that the equilibrium solution of the non zero-sum game can be conveniently found by solving an associated zero-sum game, thus reducing greatly the complexity of the problem. Then we run several experiments to derive the optimum strategies for the steganographer and the staganalyst in a game-theoretic sense, and to evaluate the performance of the game at the equilibrium, characterizing the loss with respect to the conventional non-adversarial case. Eventually, by leveraging on the analysis of the equilibrium point of the game, we introduce a new strategy to improve the reliability of the steganalysis, which shows the benefits of addressing the security issue in a game-theoretic perspective.

cs.MM↗

arXiv2019

Diffusion and Auction on Graphs

Auction is the common paradigm for resource allocation which is a fundamental problem in human society. Existing research indicates that the two primary objectives, the seller's revenue and the allocation efficiency, are generally conflicting in auction design. For the first time, we expand the domain of the classic auction to a social graph and formally identify a new class of auction mechanisms on graphs. All mechanisms in this class are incentive-compatible and also promote all buyers to diffuse the auction information to others, whereby both the seller's revenue and the allocation efficiency are significantly improved comparing with the Vickrey auction. It is found that the recently proposed information diffusion mechanism is an extreme case with the lowest revenue in this new class. Our work could potentially inspire a new perspective for the efficient and optimal auction design and could be applied into the prevalent online social and economic networks.

cs.GT↗

arXiv2019

Spatial Mixture Models with Learnable Deep Priors for Perceptual Grouping

Humans perceive the seemingly chaotic world in a structured and compositional way with the prerequisite of being able to segregate conceptual entities from the complex visual scenes. The mechanism of grouping basic visual elements of scenes into conceptual entities is termed as perceptual grouping. In this work, we propose a new type of spatial mixture models with learnable priors for perceptual grouping. Different from existing methods, the proposed method disentangles the attributes of an object into ``shape'' and ``appearance'' which are modeled separately by the mixture weights and the mixture components. More specifically, each object in the visual scene is fully characterized by one latent representation, which is in turn transformed into parameters of the mixture weight and the mixture component by two neural networks. The mixture weights focus on modeling spatial dependencies (i.e., shape) and the mixture components deal with intra-object variations (i.e., appearance). In addition, the background is separately modeled as a special component complementary to the foreground objects. Our extensive empirical tests on two perceptual grouping datasets demonstrate that the proposed method outperforms the state-of-the-art methods under most experimental configurations. The learned conceptual entities are generalizable to novel visual scenes and insensitive to the diversity of objects. Code is available at https://github.com/jinyangyuan/learnable-deep-priors.

cs.LG↗

arXiv2019

Optimal Sampling for Dynamic Complex Networks with Graph-Bandlimited Initialization

Many engineering, social, and biological complex systems consist of dynamical elements connected via a large-scale network. Monitoring the network's dynamics is essential for a variety of maintenance and scientific purposes. Whilst we understand how to optimally sample a single dynamic element or a non-dynamic graph, we do not possess a theory on how to optimally sample networked dynamical elements. Here, we study nonlinear dynamic graph signals on a fixed complex network. We define the necessary conditions for optimal sampling in the combining time- and graph-domain to fully recover the networked dynamics. We firstly interpret the networked dynamics into a linearized matrix. Then, we prove that the dynamic signals can be sampled and fully recovered if the networked dynamics is stable and their initialization is bandlimited in the graph spectral domain. This new theory directly maps optimal sampling locations and rates to the graph properties and governing nonlinear dynamics. This can inform the optimal placement of experimental probes and sensors on dynamical networks as well as inform the design of each sensor's optimal sampling rate. We motivate the reader with two examples of recovering the networked dynamics for: social population growth and networked protein biochemical interactions with both bandlimited and arbitrary initialization.

eess.SP↗

arXiv2019

In Search of a Key Value Store with High Performance and High Availability

In recent year, the write-heavy applications is more and more prevalent. How to efficiently handle this sort of workload is one of intensive research direction in the field of database system. The overhead caused by write operation is mainly issued by two reasons: 1) the hardware level, i.e., the IO cost caused by logging. We can't remove this cost in short period 2) the dual-copy software architecture and serial replay. The born of log as database architecture is originated to overcome the software defect. But existing systems treating log as database either are built on top of special infrastructure such as infiniband or NVRam (Non-Volatile Random access memory) which is far from widely available or are constructed with the help of other system such as Dynamo which is lack of flexibility. In this paper we build only write-once key-value system called LogStore from scratch to support our instant messenger business. The key features of LogStore include: 1) a single thread per partition executing mode, which eliminates the concurrency overhead; 2) log as database to enable write-once feature and freshness on the standby. We achieve high availability by embedding replication protocol other than dependent on other infrastructure; 3) fine-grained and low overhead data buffer pool management to effectively minimize IO cost. According to our empirical evaluations LogStore has good performance in write operation, recovery and replication

cs.DB↗

arXiv2019

Text Guided Person Image Synthesis

This paper presents a novel method to manipulate the visual appearance (pose and attribute) of a person image according to natural language descriptions. Our method can be boiled down to two stages: 1) text guided pose generation and 2) visual appearance transferred image synthesis. In the first stage, our method infers a reasonable target human pose based on the text. In the second stage, our method synthesizes a realistic and appearance transferred person image according to the text in conjunction with the target pose. Our method extracts sufficient information from the text and establishes a mapping between the image space and the language space, making generating and editing images corresponding to the description possible. We conduct extensive experiments to reveal the effectiveness of our method, as well as using the VQA Perceptual Score as a metric for evaluating the method. It shows for the first time that we can automatically edit the person image from the natural language descriptions.

cs.CV↗

arXiv2019

Dynamics of quasi-static collapse process of a binary granular column

The dynamical behavior of the column that made up binary granular beads is investigated systematically by tracking the displacement of particles in the collapse process. An experimental setup is first devised to control the quasi-static collapse of a granular column, and then observe the trajectories of tracer particles by using an industrial camera controlled by the image acquisition program. It is found that there exist two zones in column: a sliding region in which particles are moving in a layered structure; a static region within which particles are stationary. According to this analytical result, a dynamical model is developed to predict the trajectory evolution of particles in the space-time. The calculating result for the trajectories of particles on the selected layers is well consistent with the experimental observation.

cond-mat.soft↗