arXiv subjects

Wei Liang

Publications and source records attributed to Wei Liang.

108 records · Page 6Linked to original sources

arXiv2020

Strong decays of the newly observed narrow $Ω_b$ structures

Motivated by the newly observed narrow structures $Ω_b(6316)^-$, $Ω_b(6330)^-$, $Ω_b(6340)^-$, and $Ω_b(6350)^-$ in the $Ξ_b^0 K^-$ mass spectrum, we investigate the strong decays of the low-lying $Ω_b$ states within the $^3P_0$ model systematically. According to their masses and decay widths, the observed $Ω_b(6316)^-$, $Ω_b(6330)^-$, $Ω_b(6340)^-$, and $Ω_b(6350)^-$ resonances can be reasonably assigned as the $λ-$mode $Ω_b(1P)$ states with $J^P=1/2^-, 3/2^-, 3/2^-$, and $5/2^-$. Meanwhile, the remaining $P-$wave state with $J^P=1/2^-$ should have a rather broad width, which can hardly be observed by experiments. For the $Ω_b(2S)$ and $Ω_b(1D)$ states, our predictions show that these states have relatively narrow total widths and mainly decay into the $Ξ_b \bar K$, $Ξ_b^\prime \bar K$ and $Ξ_b^{\prime*} \bar K$ final states. These abundant theoretical predictions may be valuable for searching more excited $Ω_b$ states in future experiments.

hep-ph↗

arXiv2019

Canonical interpretation of the newly observed $Λ_b(6146)^0$ and $Λ_b(6152)^0$ via strong decay behaviors

Stimulated by the newly observed $Λ_b(6146)^0$ and $Λ_b(6152)^0$ resonances, we investigate the strong decays of the low-lying singly bottom baryons within the quark pair creation model. Considering their masses and decay modes, we tentatively assign these states as the $λ-$ mode $Λ_b(2S)$, $Λ_b(1D)$, $Σ_b(2S)$, and $Σ_b(1P)$ states, and then estimate their strong decay widths. Compared with the experimental total widths and decay modes measured by the LHCb Collaboration, the $Λ_b(6146)^0$ and $Λ_b(6152)^0$ can be reasonably clarified into the $J^P=5/2^+$ and $J^P=3/2^+$ $Λ_b(1D)$ sates respectively, while other canonical assignments are disfavored. Other low-lying bottom states are also presented, where various narrow states may have good potential to be observed in future LHCb experiments.

hep-ph↗

arXiv2019

MIN: Co-Governing Multi-Identifier Network Architecture and its Prototype on Operator's Network

IP protocol is the core of TCP/IP network layer. However, since IP address and its Domain Name are allocated and managed by a single agency, there are risks of centralization. The semantic overload of IP address also reduces its scalability and mobility, which further hinders the security. This paper proposes a co-governing Multi-Identifier Network (MIN) architecture that constructs a network layer with parallel coexistence of multiple identifiers, including identity, content, geographic information, and IP address. On the management plane, we develop an efficient management system using consortium blockchain with voting consensus, so the network can simultaneously manage and support by hundreds or thousands of nodes with high throughput. On the data plane, we propose an algorithm merging hash table and prefix tree (HTP) for FIB, which avoids the false-negative error and can inter-translate different identifiers with tens of billions of entries. Further, we propose a scheme to transport IP packets using CCN as a tunnel for supporting progressive deployment. We deployed the prototype of MIN to the largest operators' network in Mainland China, Hongkong and Macao, and demonstrated that the network can register identifier under co-governing consensus algorithm, support VoD service very well.

cs.NI↗

arXiv2019

The Prototype of Decentralized Multilateral Co-Governing Post-IP Internet Architecture and Its Testing on Operator Networks

The Internet has become the most important infrastructure of modern society, while the existing IP network is unable to provide high-quality service. The unilateralism IP network is unable to satisfy the Co-managing and Co-governing demands to Cyberspace for most Nations in the world as well. Facing this challenge, we propose a novel Decentralized Multilateral Co-Governing Post-IP Internet architecture. To verify its effectiveness, we develop the prototype on the operator's networks including China Mainland, Hong Kong, and Macao. The experiments and testing results show that this architecture is feasible for co-existing of Content-Centric Networking and IP network, and it might become a Chinese Solution to the world.

cs.NI↗

arXiv2019

Probing 10 μK stability and residual drifts in the cross-polarized dual-mode stabilization of single-crystal ultrahigh-Q optical resonators

The thermal stability of monolithic optical microresonators is essential for many mesoscopic photonic applications such as ultrastable laser oscillators, photonic microwave clocks, and precision navigation and sensing. Their fundamental performance is largely bounded by thermal instability. Sensitive thermal monitoring can be achieved by utilizing cross-polarized dual-mode beat frequency metrology, determined by the polarization-dependent thermorefractivity of a single-crystal microresonator, wherein the heterodyne radio-frequency beat pins down the optical mode volume temperature for precision stabilization. Here, we investigate the correlation between the dual-mode beat frequency and the resonator temperature with time and the associated spectral noise of the dual-mode beat frequency in a single-crystal ultrahigh-Q MgF2 resonator to illustrate that dual-mode frequency metrology can potentially be utilized for resonator temperature stabilization reaching the fundamental thermal noise limit in a realistic system. We show a resonator long-term temperature stability of 8.53 μK after stabilization and unveil various sources that hinder the stability from reaching sub-μK in the current system, an important step towards compact precision navigation, sensing and frequency reference architectures.

physics.ins-det↗

arXiv2018

3D Face Synthesis Driven by Personality Impression

Synthesizing 3D faces that give certain personality impressions is commonly needed in computer games, animations, and virtual world applications for producing realistic virtual characters. In this paper, we propose a novel approach to synthesize 3D faces based on personality impression for creating virtual characters. Our approach consists of two major steps. In the first step, we train classifiers using deep convolutional neural networks on a dataset of images with personality impression annotations, which are capable of predicting the personality impression of a face. In the second step, given a 3D face and a desired personality impression type as user inputs, our approach optimizes the facial details against the trained classifiers, so as to synthesize a face which gives the desired personality impression. We demonstrate our approach for synthesizing 3D faces giving desired personality impressions on a variety of 3D face models. Perceptual studies show that the perceived personality impressions of the synthesized faces agree with the target personality impressions specified for synthesizing the faces. Please refer to the supplementary materials for all results.

cs.GR↗

arXiv2018

Multi-beam RF accelerators for ion implantation

We report on the development of a radio frequency (RF) linear accelerator (linac) for multiple-ion beams that is made from stacks of low cost wafers. The accelerator lattice is comprised of RF-acceleration gaps and electrostatic quadrupole focusing elements that are fabricated on 10-cm wafers made from printed circuit board or silicon. We demonstrate ion acceleration with an effective gradient of about 0.5 MV per meter with an array of 3 by 3 beams. The total ion beam energies achieved to date are in the 10 keV range with total ion currents in tests with noble gases of ~0.1mA. We discuss scaling of the ion energy (by adding acceleration modules) and ion currents (with more beams) for applications of this multi-beam RF linac technology to ion implantation and surface modification of materials.

physics.acc-ph↗

arXiv2018

Deep Single-View 3D Object Reconstruction with Visual Hull Embedding

3D object reconstruction is a fundamental task of many robotics and AI problems. With the aid of deep convolutional neural networks (CNNs), 3D object reconstruction has witnessed a significant progress in recent years. However, possibly due to the prohibitively high dimension of the 3D object space, the results from deep CNNs are often prone to missing some shape details. In this paper, we present an approach which aims to preserve more shape details and improve the reconstruction quality. The key idea of our method is to leverage object mask and pose estimation from CNNs to assist the 3D shape learning by constructing a probabilistic single-view visual hull inside of the network. Our method works by first predicting a coarse shape as well as the object pose and silhouette using CNNs, followed by a novel 3D refinement CNN which refines the coarse shapes using the constructed probabilistic visual hulls. Experiment on both synthetic data and real images show that embedding a single-view visual hull for shape refinement can significantly improve the reconstruction quality by recovering more shapes details and improving shape consistency with the input image.

cs.CV↗

arXiv2018

Downlink Interference Management in Dense Interference-Aware Drone Small Cells Networks Using Mean-Field Game Theory

The use of drone small cells (DSCs) has recently drawn significant attentions as one key enabler for providing air-to-ground communication services in various situations. This paper investigates the co-channel deployment of dense DSCs, which are mounted on captive unmanned aerial vehicles (UAVs). As the altitude of a DSC has a huge impact on the performance of downlink, the downlink interference control problem is mapped to an altitude control problem in this paper. All DSCs adjust their altitude to improve the available signal-to-interference-plus-noise ratio (SINR). The control problem is modeled as a mean-field game (MFG), where the cost function is designed to combine the available SINR with the cost of altitude controling. The interference introduced from a big amount of DSCs is derived through a mean-field approximation approach. Within the proposed MFG framework, the related Hamilton-Jacobi-Bellman and Fokker-Planck-Kolmogorov equations are deduced to describe and explain the control policy. The optimal altitude control policy is obtained by solving the partial differential equations with a proposed finite difference algorithm based on the upwind scheme. The simulations illustrate the optimal power controls and corresponding mean field distribution of DSCs. The numerical results also validate that the proposed control policy achieves better SINR performance of DSCs compared to the uniform control scheme.

eess.SP↗

arXiv2018

Bayesian Detection of Abnormal ADS in Mutant Caenorhabditis elegans Embryos

Cell division timing is critical for cell fate specification and morphogenesis during embryogenesis. How division timings are regulated among cells during development is poorly understood. Here we focus on the comparison of asynchrony of division between sister cells (ADS) between wild-type and mutant individuals of Caenorhabditis elegans. Since the replicate number of mutant individuals of each mutated gene, usually one, is far smaller than that of wild-type, direct comparison of two distributions of ADS between wild-type and mutant type, such as Kolmogorov- Smirnov test, is not feasible. On the other hand, we find that sometimes ADS is correlated with the life span of corresponding mother cell in wild-type. Hence, we apply a semiparametric Bayesian quantile regression method to estimate the 95% confidence interval curve of ADS with respect to life span of mother cell of wild-type individuals. Then, mutant-type ADSs outside the corresponding confidence interval are selected out as abnormal one with a significance level of 0.05. Simulation study demonstrates the accuracy of our method and Gene Enrichment Analysis validates the results of real data sets.

q-bio.QM↗

arXiv2017

End-to-end Throughput Maximization for Underlay Multi-hop Cognitive Radio Networks with RF Energy Harvesting

This paper studies a green paradigm for the underlay coexistence of primary users (PUs) and secondary users (SUs) in energy harvesting cognitive radio networks (EH-CRNs), wherein battery-free SUs capture both the spectrum and the energy of PUs to enhance spectrum efficiency and green energy utilization. To lower the transmit powers of SUs, we employ multi-hop transmission with time division multiple access, by which SUs first harvest energy from the RF signals of PUs and then transmit data in the allocated time concurrently with PUs, all in the licensed spectrum. In this way, the available transmit energy of each SU mainly depends on the harvested energy before the turn to transmit, namely energy causality. Meanwhile, the transmit powers of SUs must be strictly controlled to protect PUs from harmful interference. Thus, subject to the energy causality constraint and the interference power constraint, we study the end-to-end throughput maximization problem for optimal time and power allocation. To solve this nonconvex problem, we first equivalently transform it into a convex optimization problem and then propose the joint optimal time and power allocation (JOTPA) algorithm that iteratively solves a series of feasibility problems until convergence. Extensive simulations evaluate the performance of EH-CRNs with JOTPA in three typical deployment scenarios and validate the superiority of JOTPA by making comparisons with two other resource allocation algorithms.

cs.IT↗

arXiv2017

Chasing the thermodynamical noise limit in whispering-gallery-mode resonators for ultrastable laser frequency stabilization

Ultrastable high-spectral-purity lasers have served as the cornerstone behind optical atomic clocks, quantum measurements, precision optical-microwave generation, high resolution optical spectroscopy and sensing. Hertz-level lasers stabilized to high finesse Fabry-Pérot mirror cavities are typically used for these studies but are large and fragile such that they have remained laboratory instruments. There is a clear demand in rugged miniaturized lasers operating potentially at comparable stabilities to those bulk lasers. Over the past decade, ultrahigh-Q optical whispering-gallery-mode (WGM) resonators have served as a platform for low-noise microlasers but have not yet reached the ultimate stabilities defined by their fundamental noise. Here, we show the noise characteristics of WGM resonators and demonstrate a resonator-stabilized laser at the fundamental limit by compensating the intrinsic thermal expansion of a WGM resonator, allowing a sub-25 Hz linewidth and a 32 Hz Allan deviation on the 191 THz carrier in 100 ms integration. We also reveal the environmental sensitivities of the resonator at the thermodynamical noise limit and long-term frequency drifts governed by random-walk-noise statistics.

physics.optics↗

arXiv2015

A Connectivity-Aware Approximation Algorithm for Relay Node Placement in Wireless Sensor Networks

In two-tiered Wireless Sensor Networks (WSNs) relay node placement is one of the key factors impacting the network energy consumption and the system overhead. In this paper, a novel connectivity-aware approximation algorithm for relay node placement in WSNs is proposed to offer a major step forward in saving system overhead. Specifically, a unique Local Search Approximation Algorithm (LSAA) is introduced to solve the Relay Node Single Cover (RNSC) problem. In this proposed LSAA approach, the sensor nodes are allocated into groups and then a local Set Cover (SC) for each group is achieved by a local search algorithm. The union set of all local SCs constitutes a SC of the RNSC problem. The approximation ratio and the time complexity of the LSAA are analyzed by rigorous proof. Additionally, the LSAA approach has been extended to solve the relay node double cover problem. Then, a Relay Location Selection Algorithm (RLSA) is proposed to utilize the resulting SC from LSAA in combining RLSA with the minimum spanning tree heuristic to build the high-tier connectivity. As the RLSA searches for a nearest location to the sink node for each relay node, the high-tier network built by RLSA becomes denser than that by existing works. As a result, the number of added relay nodes for building the connectivity of the high-tier WSN can be significantly saved. Simulation results clearly demonstrate that the proposed LSAA outperforms the approaches reported in literature and the RLSA-based algorithm can noticeably save relay nodes newly deployed for the high-tier connectivity.

cs.NI↗

arXiv2015

Set Covering-based Approximation Algorithm for Delay Constrained Relay Node Placement in Wireless Sensor Networks

The Delay Constrained Relay Node Placement (DCRNP) problem in Wireless Sensor Networks (WSNs) aims to deploy minimum relay nodes such that for each sensor node there is a path connecting this sensor node to the sink without violating delay constraint. As WSNs are gradually employed in time-critical applications, the importance of the DCRNP problem becomes noticeable. For the NP-hard nature of DCRNP problem, an approximation algorithm-Set-Covering-based Relay Node Placement (SCA) is proposed to solve the DCRNP problem in this paper. The proposed SCA algorithm deploys relay nodes iteratively from sink to the given sensor nodes in hops, i.e., in the $k$th iteration SCA deploys relay nodes at the locations that are $k$ hops apart from the sink. Specifically, in each iteration, SCA first finds the candidate deployment locations located within 1 hop to the relay nodes and sensor nodes, which have already been connected to the sink. Then, a subset of these candidate deployment locations, which can guarantee the existence of paths connecting unconnected sensor nodes to the sink within delay constraint, is selected to deploy relay nodes based on the set covering method. As the iteration of SCA algorithm, the sensor nodes are gradually connected to the sink with satisfying delay constraint. The elaborated analysis of the approximation ratio of SCA algorithm is given out, and we also prove that the SCA is a polynomial time algorithm through rigorous time complexity analysis. To evaluate the performance of the proposed SCA algorithm, extensive simulations are implemented, and the simulation results show that the SCA algorithm can significantly save the deployed relay nodes comparing to the existing algorithms, i.e., at most 31.48% deployed relay nodes can be saved due to SCA algorithm.

cs.NI↗

arXiv2014

Generation of a coherent near-infrared Kerr frequency comb in a monolithic microresonator with normal GVD

We demonstrate experimentally, and explain theoretically, generation of a wide, fundamentally phase locked Kerr frequency comb in a nonlinear resonator with a normal group velocity dispersion. A magnesium fluoride whispering gallery resonator characterized with 10 GHz free spectral range and pumped either at 780 nm or 795 nm is used in the experiment. The envelope of the observed frequency comb differs significantly from the Kerr frequency comb spectra reported previously. We show via numerical simulation that, while the frequency comb does not correspond to generation of short optical pulses, the relative phases of the generated harmonics are fixed.

physics.optics↗

arXiv2012

Chaotic dynamics of frequency combs generated with continuously pumped nonlinear microresonators

We theoretically and experimentally investigate the chaotic regime of optical frequency combs generated in nonlinear ring microresonators pumped with continuous wave light. We show that the chaotic regime reveals itself, in an apparently counter-intuitive way, by a flat top symmetric envelope of the frequency spectrum, when observed by means of an optical spectrum analyzer. The comb demodulated on a fast photodiode produces a noisy radio frequency signal with an spectral width significantly exceeding the linear bandwidth of the microresonator mode.

physics.optics↗

arXiv2012

Empirical Likelihood for Right Censored Lifetime Data

This paper considers the empirical likelihood (EL) construction of confidence intervals for a linear functional based on right censored lifetime data. Many of the results in literature show that log EL has a limiting scaled chi-square distribution, where the scale parameter is a function of the unknown asymptotic variance. The scale parameter has to be estimated for the construction. Additional estimation would reduce the coverage accuracy for the parameter. This diminishes a main advantage of the EL method for censored data. By utilizing certain influence functions in an estimating equation, it is shown that under very general conditions, log EL converges weakly to a standard chi-square distribution and thereby eliminates the need for estimating the scale parameter. Moreover, a special way of employing influence functions eases the otherwise very demanding computations of the EL method. Our approach yields smaller asymptotic variance of the influence function than those comparable ones considered by Wang and Jing (2001) and Qin and Zhao (2007). Thus it is not surprising that confidence intervals using influence functions give a better coverage accuracy as demonstrated by simulations.

math.ST↗

arXiv2011

Transient Regime of Kerr Frequency Comb Formation

Temporal growth of an optical Kerr frequency comb generated in a microresonator is studied both experimentally and numerically. We find that the comb emerges from vacuum fluctuations of the electromagnetic field on timescales significantly exceeding the ringdown time of the resonator modes. The frequency harmonics of the comb spread starting from the optically pumped mode if the microresonator is characterized with anomalous group velocity dispersion. The harmonics have different growth rates resulting from sequential four-wave mixing process that explains intrinsic modelocking of the comb.

physics.optics↗