arXiv subjects

Hao Yu

Publications and source records attributed to Hao Yu.

At least 289 records · Page 16Linked to original sources

arXiv2017

Online Convex Optimization with Time-Varying Constraints

This paper considers online convex optimization with time-varying constraint functions. Specifically, we have a sequence of convex objective functions $\{f_t(x)\}_{t=0}^{\infty}$ and convex constraint functions $\{g_{t,i}(x)\}_{t=0}^{\infty}$ for $i \in \{1, ..., k\}$. The functions are gradually revealed over time. For a given $ε>0$, the goal is to choose points $x_t$ every step $t$, without knowing the $f_t$ and $g_{t,i}$ functions on that step, to achieve a time average at most $ε$ worse than the best fixed-decision that could be chosen with hindsight, subject to the time average of the constraint functions being nonpositive. It is known that this goal is generally impossible. This paper develops an online algorithm that solves the problem with $O(1/ε^2)$ convergence time in the special case when all constraint functions are nonpositive over a common subset of $\mathbb{R}^n$. Similar performance is shown in an expected sense when the common subset assumption is removed but the constraint functions are assumed to vary according to a random process that is independent and identically distributed (i.i.d.) over time slots $t \in \{0, 1, 2, \ldots\}$. Finally, in the special case when both the constraint and objective functions are i.i.d. over time slots $t$, the algorithm is shown to come within $ε$ of optimality with respect to the best (possibly time-varying) causal policy that knows the full probability distribution.

math.OC↗

arXiv2017

Probing extra dimension through gravitational wave observations of compact binaries and their electromagnetic counterparts

The future gravitational wave (GW) observations of compact binaries and their possible electromagnetic counterparts may be used to probe the nature of the extra dimension. It is widely accepted that gravitons and photons are the only two completely confirmed objects that can travel along null geodesics in our four-dimensional space-time. However, if there exist extra dimensions and only GWs can propagate freely in the bulk, the causal propagations of GWs and electromagnetic waves (EMWs) are in general different. In this paper, we study null geodesics of GWs and EMWs in a five-dimensional anti-de Sitter space-time in the presence of the curvature of the universe. We show that for general cases the horizon radius of GW is longer than EMW within equal time. Taking the GW150914 event detected by the Advanced Laser Interferometer Gravitational-Wave Observatory and the X-ray event detected by the Fermi Gamma-ray Burst Monitor as an example, we study how the curvature $k$ and the constant curvature radius $l$ affect the horizon radii of GW and EMW in the de Sitter and Einstein-de Sitter models of the universe. This provides an alternative method for probing extra dimension through future GW observations of compact binaries and their electromagnetic counterparts.

gr-qc↗

arXiv2017

A New Backpressure Algorithm for Joint Rate Control and Routing with Vanishing Utility Optimality Gaps and Finite Queue Lengths

The backpressure algorithm has been widely used as a distributed solution to the problem of joint rate control and routing in multi-hop data networks. By controlling a parameter $V$ in the algorithm, the backpressure algorithm can achieve an arbitrarily small utility optimality gap. However, this in turn brings in a large queue length at each node and hence causes large network delay. This phenomenon is known as the fundamental utility-delay tradeoff. The best known utility-delay tradeoff for general networks is $[O(1/V), O(V)]$ and is attained by a backpressure algorithm based on a drift-plus-penalty technique. This may suggest that to achieve an arbitrarily small utility optimality gap, the existing backpressure algorithms necessarily yield an arbitrarily large queue length. However, this paper proposes a new backpressure algorithm that has a vanishing utility optimality gap, so utility converges to exact optimality as the algorithm keeps running, while queue lengths are bounded throughout by a finite constant. The technique uses backpressure and drift concepts with a new method for convex programming.

cs.NI↗

arXiv2017

Full linear perturbations and localization of gravity on $f(R,T)$ brane

We study the thick brane world system constructed in the recently proposed $f(R,T)$ theories of gravity, with $R$ the Ricci scalar and $T$ the trace of the energy-momentum tensor. We try to get the analytic background solutions and discuss the full linear perturbations, especially the scalar perturbations. We compare how the brane world model is modified with that of general relativity coupled to a canonical scalar field. It is found that some more interesting background solutions are allowed, and only the scalar perturbation mode is modified. There is no tachyon state exists in this model and only the massless tensor mode can be localized on the brane, which recovers the effective four-dimensional gravity. These conclusions hold provided that two constraints on the original formalism of the action are satisfied.

hep-th↗

arXiv2016

A Probabilistic Sample Path Convergence Time Analysis of Drift-Plus-Penalty Algorithm for Stochastic Optimization

This paper considers the problem of minimizing the time average of a controlled stochastic process subject to multiple time average constraints on other related processes. The probability distribution of the random events in the system is unknown to the controller. A typical application is time average power minimization subject to network throughput constraints for different users in a network with time varying channel conditions. We show that with probability at least $1-2δ$, the classical drift-plus-penalty algorithm provides a sample path $\mathcal{O}(\varepsilon)$ approximation to optimality with a convergence time $\mathcal{O}(\frac{1}{\varepsilon^2}\max\left\{\log^2\frac1\varepsilon\log\frac2δ,~\log^3\frac2δ\right\})$, where $\varepsilon>0$ is a parameter related to the algorithm. When there is only one constraint, we further show that the convergence time can be improved to $\mathcal{O}\left(\frac{1}{\varepsilon^2}\log^2\frac1δ\right)$.

math.OC↗

arXiv2016

A Binary Convolutional Encoder-decoder Network for Real-time Natural Scene Text Processing

In this paper, we develop a binary convolutional encoder-decoder network (B-CEDNet) for natural scene text processing (NSTP). It converts a text image to a class-distinguished salience map that reveals the categorical, spatial and morphological information of characters. The existing solutions are either memory consuming or run-time consuming that cannot be applied to real-time applications on resource-constrained devices such as advanced driver assistance systems. The developed network can process multiple regions containing characters by one-off forward operation, and is trained to have binary weights and binary feature maps, which lead to both remarkable inference run-time speedup and memory usage reduction. By training with over 200, 000 synthesis scene text images (size of $32\times128$), it can achieve $90\%$ and $91\%$ pixel-wise accuracy on ICDAR-03 and ICDAR-13 datasets. It only consumes $4.59\ ms$ inference run-time realized on GPU with a small network size of 2.14 MB, which is up to $8\times$ faster and $96\%$ smaller than it full-precision version.

cs.CV↗

arXiv2016

Gravitational resonances on $f(R)$-brane

In this paper, we investigate various $f(R)$-brane models and compare their gravitational resonance structures with the corresponding general relativity (GR)-branes. {Starting from some known GR-brane solutions}, we derive thick $f(R)$-brane solutions such that the metric, scalar field, and scalar potential coincide with those of the corresponding GR-branes. {We find that for branes generated by a single or several canonical scalar fields, there is no obvious distinction between the GR-branes and corresponding $f(R)$-branes in terms of gravitational resonance structure.} Then we discuss the branes generated by K-fields. In this case, there could exist huge differences between GR-branes and $f(R)$-branes.

gr-qc↗

arXiv2016

A Primal-Dual Type Algorithm with the $O(1/t)$ Convergence Rate for Large Scale Constrained Convex Programs

This paper considers large scale constrained convex programs, which are usually not solvable by interior point methods or other Newton-type methods due to the prohibitive computation and storage complexity for Hessians and matrix inversions. Instead, large scale constrained convex programs are often solved by gradient based methods or decomposition based methods. The conventional primal-dual subgradient method, aka, Arrow-Hurwicz-Uzawa subgradient method, is a low complexity algorithm with the $O(1/\sqrt{t})$ convergence rate, where $t$ is the number of iterations. If the objective and constraint functions are separable, the Lagrangian dual type method can decompose a large scale convex program into multiple parallel small scale convex programs. The classical dual gradient algorithm is an example of Lagrangian dual type methods and has convergence rate $O(1/\sqrt{t})$. Recently, a new Lagrangian dual type algorithm with faster $O(1/t)$ convergence is proposed in Yu and Neely (2015). However, if the objective or constraint functions are not separable, each iteration of the Lagrangian dual type method in Yu and Neely (2015) requires to solve a large scale unconstrained convex program, which can have huge complexity. This paper proposes a new primal-dual type algorithm, which only involves simple gradient updates at each iteration and has the $O(1/t)$ convergence rate.

math.OC↗

arXiv2016

Dual flows in hyperbolic space and de Sitter space

We consider contracting flows in $(n+1)$-dimensional hyperbolic space and expanding flows in $(n+1)$-dimensional de Sitter space. When the flow hypersurfaces are strictly convex we relate the contracting hypersurfaces and the expanding hypersurfaces by the Gauss map. The contracting hypersurfaces shrink to a point $x_0$ in finite time while the expanding hypersurfaces converge to the maximal slice $\{ τ=0\}$. After rescaling, by the same scale factor, the resclaed contracting hypersurfaces converge to a unit geodesic sphere, while the rescaled expanding hypersufaces converge to slice $\{ τ= -1\}$ exponential fast in $C^\infty(\mathbb{S}^n)$.

math.DG↗

arXiv2016

Dispersion and Scaling Law of Dynamic Hysteresis Based on the Landau-Lifshitz-Gilbert Model

Hysteresis dispersion under a varying external field Hex is investigated through numerical simulations based on the Landau-Lifshitz-Gilbert (LLG) equation, indicating the energy dissipation can be determined by W(η) = A (f, H0). A linear relation between area of hysteresis and magnitude of external field is discovered. Evolution of hysteresis is also investigated under oscillating external field.

cond-mat.mtrl-sci↗

arXiv2016

A Chessboard Model of Human Brain and One Application on Memory Capacity

The famous claim that we only use about 10% of the brain capacity has recently been challenged. Researchers argue that we are likely to use the whole brain, against the 10% claim. Some evidence and results from relevant studies and experiments related to memory in the field of neuroscience leads to the conclusion that if the rest 90% of the brain is not used, then many neural pathways would degenerate. What is memory? How does the brain function? What would be the limit of memory capacity? This article provides a model established upon the physiological and neurological characteristics of the human brain, which could give some theoretical support and scientific explanation to explain some phenomena. It may not only have theoretically significance in neuroscience, but could also be practically useful to fill in the gap between the natural and machine intelligence.

q-bio.NC↗

arXiv2016

Current-Driven Domain Wall Motion: Velocity, Current and Phase Transition

The relation between domain wall motion and intensity of driven current is examined in a phenomenological theory where the kinetic energy is expanded as a series of polynomial function of current density just as the Landau phase transition theory. The dependency of velocity on current density is root square which degenerates into linear if the current is much higher than the critical value. The theory result is consistent with several previous experiments and also can explain the change of critical current in the presence of temperature. The role of temperature plays in the dynamics of domain wall motion is also discussed. The phase transition theory in terms of current density is employed to explain the critical behavior of domain wall motion.

cond-mat.mes-hall↗

arXiv2015

The structure of $f(R)$-brane model

Recently, a family of interesting analytical brane solutions were found in $f(R)$ gravity with $f(R)=R+αR^2$ in Ref. [Phys. Lett. B 729, 127 (2014)]. In these solutions, inner brane structure can be turned on by tuning the value of the parameter $α$. In this paper, we investigate how the parameter $α$ affects the localization and the quasilocalization of the tensorial gravitons around these solutions. It is found that, in a range of $α$, despite the brane has an inner structure, there is no graviton resonance. However, in some other regions of the parameter space, although the brane has no internal structure, the effective potential for the graviton KK modes has a singular structure, and there exists a series of graviton resonant modes. The contribution of the massive graviton KK modes to the Newton's law of gravity is discussed shortly.

hep-th↗

arXiv2015

Mid-infrared ultra-short mode-locked fiber laser utilizing topological insulator Bi2Te3 nano-sheets as the saturable absorber

The newly-emergent two-dimensional topological insulators (TIs) have shown their unique electronic and optical properties, such as good thermal management, high nonlinear refraction index and ultrafast relaxation time. Their narrow energy band gaps predict their optical absorption ability further into the mid-infrared region and their possibility to be very broadband light modulators ranging from the visible to the mid-infrared region. In this paper, a mid-infrared mode-locked fluoride fiber laser with TI Bi2Te3 nano-sheets as the saturable absorber is presented. Continuous wave lasing, Q-switched and continuous-wave mode-locking (CW-ML) operations of the laser are observed sequentially by increasing the pump power. The observed CW-ML pulse train has a pulse repetition rate of 10.4 MHz, a pulse width of ~6 ps, and a center wavelength of 2830 nm. The maximum achievable pulse energy is 8.6 nJ with average power up to 90 mW. This work forcefully demonstrates the promising applications of two-dimensional TIs for ultra-short laser operation and nonlinear optics in the mid-infrared region.

physics.optics↗

arXiv2015

Black phosphorus as a new broadband saturable absorber for infrared passively Q-switched fiber lasers

Black phosphorus (BP) with its enticing electric and optical properties is intensely researched in the field of optoelectronics. In this paper, Q-switched pulses at 1550 nm and 2 um wavelengths are obtained by inserting bulk-structured BP based saturable absorber (SA) into an erbium-doped fiber laser (EDFL) and an thulium/holmium-doped fiber laser (THDFL), respectively. The BP-SA was prepared by depositing powered BP material on to the flat side of a side-polished single mode fiber. Q-switched 1550 nm pulses with width tuned from 9.35 to 31 us were obtained for the EDFL. For the THDFL, over 100 nm wavelength range could be achieved from 1832 to 1935 nm by adjusting the pump power. To the best of our knowledge, these results demonstrated the broadband saturable absorption property of BP and for the first time verified that BP as a new two-dimensional material for applications in saturable absorption devices.

physics.optics↗

arXiv2015

Tensor perturbations of Palatini $f(\mathcal{R})$-branes

We investigate the thick brane model in Palatini $f(\mathcal{R})$ gravity. The brane is generated by a real scalar field with a scalar potential. We solve the system analytically and obtain a series of thick brane solutions for the $f(\mathcal{R})=\mathcal{R}+α\mathcal{R}^2$-brane model. It is shown that tensor perturbations of the metric are stable for $df({\mathcal{R}})/d{\mathcal{R}}>0$. For nonconstant curvature solutions, the graviton zero mode can be localized on the brane, which indicates that the four-dimensional gravity can be recovered on the brane. Mass spectrum of graviton KK modes and their corrections to the Newtonian potential are also discussed.

hep-th↗

arXiv2014

Study of the material photon and electron background and the liquid argon detector veto efficiency of the CDEX-10 experiment

The China Dark Matter Experiment (CDEX) is located at the China Jinping underground laboratory (CJPL) and aims to directly detect the WIMP flux with high sensitivity in the low mass region. Here we present a study of the predicted photon and electron backgrounds including the background contribution of the structure materials of the germanium detector, the passive shielding materials, and the intrinsic radioactivity of the liquid argon that serves as an anti-Compton active shielding detector. A detailed geometry is modeled and the background contribution has been simulated based on the measured radioactivities of all possible components within the GEANT4 program. Then the photon and electron background level in the energy region of interest (<10^-2 events kg-1 day-1 keV-1 (cpkkd)) is predicted based on Monte Carlo simulations. The simulated result is consistent with the design goal of CDEX-10 experiment, 0.1 cpkkd, which shows that the active and passive shield design of CDEX-10 is effective and feasible.

physics.ins-det↗

arXiv2013

Duality Codes and the Integrality Gap Bound for Index Coding

This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side information, and requests another subset of the packets. This problem is known as the index coding problem and can be represented by a bipartite digraph. An integer linear program is developed that provides a lower bound on the minimum number of transmissions required for any coding algorithm. Conversely, its linear programming relaxation is shown to provide an upper bound that is achievable by a simple form of vector linear coding. Thus, the information theoretic optimum is bounded by the integrality gap between the integer program and its linear relaxation. In the special case when the digraph has a planar structure, the integrality gap is shown to be zero, so that exact optimality is achieved. Finally, for non-planar problems, an enhanced integer program is constructed that provides a smaller integrality gap. The dual of this problem corresponds to a more sophisticated partial clique coding strategy that time-shares between Reed-Solomon erasure codes. This work illuminates the relationship between index coding, duality, and integrality gaps between integer programs and their linear relaxations.

cs.IT↗