arXiv subjects

Hui Liu

Publications and source records attributed to Hui Liu.

At least 577 records · Page 32Linked to original sources

arXiv2017

Load Balancing using Hilbert Space-filling Curves for Parallel Reservoir Simulations

The goal of load balancing (grid partitioning) is to minimize overall computations and communications, and to make sure that all processors have a similar workload. Geometric methods divide a grid by using a location of a cell while topological methods work with connectivity of cells, which is generally described as a graph. This paper introduces a Hilbert space-filling curve method. A space-filling curve is a continuous curve and defines a map between a one-dimensional space and a multi-dimensional space. A Hilbert space-filling curve is one special space-filling curve discovered by Hilbert and has many useful characteristics, such as good locality, which means that two objects that are close to each other in a multi-dimensional space are also close to each other in a one dimensional space. This property can model communications in grid-based parallel applications. The idea of the Hilbert space-filling curve method is to map a computational domain into a one-dimensional space, partition the one-dimensional space to certain intervals, and assign all cells in a same interval to a MPI. To implement a load balancing method, a mapping kernel is required to convert high-dimensional coordinates to a scalar value and an efficient one-dimensional partitioning module that divides a one-dimensional space and makes sure that all intervals have a similar workload. The Hilbert space-filling curve method is compared with ParMETIS, a famous graph partitioning package. The results show that our Hilbert space-filling curve method has good partition quality. It has been applied to grids with billions of cells, and linear scalability has been obtained on IBM Blue Gene/Q.

cs.DC↗

arXiv2017

The existence of two non-contractible closed geodesics on every bumpy Finsler compact space form

Let $M=S^n/ Γ$ and $h$ be a nontrivial element of finite order $p$ in $π_1(M)$, where the integer $n\geq2$, $Γ$ is a finite group which acts freely and isometrically on the $n$-sphere and therefore $M$ is diffeomorphic to a compact space form. In this paper, we establish first the resonance identity for non-contractible homologically visible minimal closed geodesics of the class $[h]$ on every Finsler compact space form $(M, F)$ when there exist only finitely many distinct non-contractible closed geodesics of the class $[h]$ on $(M, F)$. Then as an application of this resonance identity, we prove the existence of at least two distinct non-contractible closed geodesics of the class $[h]$ on $(M, F)$ with a bumpy Finsler metric, which improves a result of Taimanov in [Taimanov 2016] by removing some additional conditions. Also our results extend the resonance identity and multiplicity results on $\mathcal{R}P^n$ in [arXiv:1607.02746] to general compact space forms.

math.DS↗

arXiv2017

Resonance identity and multiplicity of non-contractible closed geodesics on Finsler $\mathbb{R}P^{n}$

In this paper, we establish first the resonance identity for non-contractible homologically visible prime closed geodesics on Finsler $n$-dimensional real projective space $(\mathbb{R}P^n,F)$ when there exist only finitely many distinct non-contractible closed geodesics on $(\mathbb{R}P^n,F)$, where the integer $n\geq2$. Then as an application of this resonance identity, we prove the existence of at least two distinct non-contractible closed geodesics on $\mathbb{R}P^{n}$ with a bumpy and irreversible Finsler metric. Together with two previous results on bumpy and reversible Finsler metrics in \cite{DLX2015} and \cite{Tai2016}, it yields that every $\mathbb{R}P^{n}$ with a bumpy Finsler metric possesses at least two distinct non-contractible closed geodesics.

math.DS↗

arXiv2017

Structural Properties of Uncoded Placement Optimization for Coded Delivery

A centralized coded caching scheme has been proposed by Maddah-Ali and Niesen to reduce the worst-case load of a network consisting of a server with access to N files and connected through a shared link to K users, each equipped with a cache of size M. However, this centralized coded caching scheme is not able to take advantage of a non-uniform, possibly very skewed, file popularity distribution. In this work, we consider the same network setting but aim to reduce the average load under an arbitrary (known) file popularity distribution. First, we consider a class of centralized coded caching schemes utilizing general uncoded placement and a specific coded delivery strategy, which are specified by a general file partition parameter. Then, we formulate the coded caching design optimization problem over the considered class of schemes with 2^K2^N variables to minimize the average load by optimizing the file partition parameter under an arbitrary file popularity. Furthermore, we show that the optimization problem is convex, and the resulting optimal solution generally improves upon known schemes. Next, we analyze structural properties of the optimization problem to obtain design insights and reduce the complexity. Specifically, we obtain an equivalent linear optimization problem with (K+1)N variables under an arbitrary file popularity and an equivalent linear optimization problem with K+1 variables under the uniform file popularity. Under the uniform file popularity, we also obtain the closed form optimal solution, which corresponds to Maddah-Ali-Niesen's centralized coded caching scheme. Finally, we present an information-theoretic converse bound on the average load under an arbitrary file popularity.

cs.IT↗

arXiv2017

Self-focusing and the Talbot effect in conformal transformation optics

Transformation optics (TO) has been used to propose various novel optical devices. With the help of metamaterials, several intriguing designs, such as invisibility cloaks, have been implemented. However, as the basic units should be much smaller than the working wavelengths to achieve the effective material parameters, and the sizes of devices should be much larger than the wavelengths of illumination to work within the light-ray approximation, it is a big challenge to implement an experimental system that works simultaneously for both geometric optics and wave optics. In this letter, by using a gradient-index micro-structured optical waveguide, we realize a device of conformal transformation optics (CTO) and demonstrate its self-focusing property for geometry optics and Talbot effect for wave optics. In addition, the Talbot effect in such a system has a potential application to transfer digital information without diffraction. Our findings demonstrate the photon controlling ability of CTO in a feasible experiment system.

physics.optics↗

arXiv2017

Joint Pushing and Caching for Bandwidth Utilization Maximization in Wireless Networks

Joint pushing and caching is recognized as an efficient remedy to the problem of spectrum scarcity incurred by tremendous mobile data traffic. In this paper, by exploiting storage resources at end users and predictability of user demand processes, we design the optimal joint pushing and caching policy to maximize bandwidth utilization, which is of fundamental importance to mobile telecom carriers. In particular, we formulate the stochastic optimization problem as an infinite horizon average cost Markov Decision Process (MDP), for which there generally exist only numerical solutions without many insights. By structural analysis, we show how the optimal policy achieves a balance between the current transmission cost and the future average transmission cost. In addition, we show that the optimal average transmission cost decreases with the cache size, revealing a tradeoff between the cache size and the bandwidth utilization. Then, due to the fact that obtaining a numerical optimal solution suffers the curse of dimensionality and implementing it requires a centralized controller and global system information, we develop a decentralized policy with polynomial complexity w.r.t. the numbers of users and files as well as cache size, by a linear approximation of the value function and optimization relaxation techniques. Next, we propose an online decentralized algorithm to implement the proposed low-complexity decentralized policy using the technique of Q-learning, when priori knowledge of user demand processes is not available. Finally, using numerical results, we demonstrate the advantage of the proposed solutions over some existing designs. The results in this paper offer useful guidelines for designing practical cache-enabled content-centric wireless networks.

cs.IT↗

arXiv2017

Spectrum and electromagnetic transitions of bottomonium

Stimulated by the exciting progress in the observation of new bottomonium states, we study the bottomonium spectrum. To calculate the mass spectrum, we adopt a nonrelativistic screened potential model. The radial Schrödinger equation is solved with the three-point difference central method, where the spin-dependent potentials are dealt with non-perturbatively. With this treatment, the corrections of the spin-dependent potentials to the wave functions can be included successfully. Furthermore, we calculate the electromagnetic transitions of the $nS$ ($n\leq 4$), $nP$ ($n\leq 3$), and $nD$ ($n\leq 2$) bottomonium states with a nonrelativistic electromagnetic transition operator widely applied to meson photoproduction reactions. Our predicted masses, hyperfine and fine splittings, electromagnetic transition widths and branching ratios of the bottomonium states are in good agreement with the available experimental data. Especially, the EM transitions of $Υ(3S)\to χ_{b1,2}(1P)γ$, which were not well understood in previous studies, can be reasonably explained by considering the corrections of the spin-dependent interactions to the wave functions. We also discuss the observations of the missing bottomonium states by using radiative transitions. Some important radiative decay chains involving the missing bottomonium states are suggested to be observed. We hope our study can provide some useful references to observe and measure the properties of bottomonium mesons in forthcoming experiments.

hep-ph↗

arXiv2017

A Framework for Dynamic Stability Analysis of Power Systems with Volatile Wind Power

We propose a framework employing stochastic differential equations to facilitate the long-term stability analysis of power grids with intermittent wind power generations. This framework takes into account the discrete dynamics which play a critical role in the long-term stability analysis, incorporates the model of wind speed with different probability distributions, and also develops an approximation methodology (by a deterministic hybrid model) for the stochastic hybrid model to reduce the computational burden brought about by the uncertainty of wind power. The theoretical and numerical studies show that a deterministic hybrid model can provide an accurate trajectory approximation and stability assessments for the stochastic hybrid model under mild conditions. In addition, we discuss the critical cases that the deterministic hybrid model fails and discover that these cases are caused by a violation of the proposed sufficient conditions. Such discussion complements the proposed framework and methodology and also reaffirms the importance of the stochastic hybrid model when the system operates close to its stability limit.

eess.SY↗

arXiv2017

Experimental measurement-device-independent quantum digital signatures over a metropolitan network

Quantum digital signatures (QDS) provide a means for signing electronic communications with informationtheoretic security. However, all previous demonstrations of quantum digital signatures assume trusted measurement devices. This renders them vulnerable against detector side-channel attacks, just like quantum key distribution. Here, we exploit a measurement-device-independent (MDI) quantum network, over a 200-square-kilometer metropolitan area, to perform a field test of a three-party measurement-device-independent quantum digital signature (MDI-QDS) scheme that is secure against any detector side-channel attack. In so doing, we are able to successfully sign a binary message with a security level of about 1E-7. Remarkably, our work demonstrates the feasibility of MDI-QDS for practical applications.

quant-ph↗

arXiv2017

Decoupled Block-Wise ILU(k) Preconditioner on GPU

This research investigates the implementation mechanism of block-wise ILU(k) preconditioner on GPU. The block-wise ILU(k) algorithm requires both the level k and the block size to be designed as variables. A decoupled ILU(k) algorithm consists of a symbolic phase and a factorization phase. In the symbolic phase, a ILU(k) nonzero pattern is established from the point-wise structure extracted from a block-wise matrix. In the factorization phase, the block-wise matrix with a variable block size is factorized into a block lower triangular matrix and a block upper triangular matrix. And a further diagonal factorization is required to perform on the block upper triangular matrix for adapting a parallel triangular solver on GPU.We also present the numerical experiments to study the preconditioner actions on different k levels and block sizes.

math.NA↗

arXiv2017

Chiral Magnetic Effect in a Lattice Model

We study analytically the one-loop contribution to the Chiral Magnetic Effect(CME) using lattice regularization with a Wilson fermion field. In the continuum limit, we find that the chiral magnetic current vanishes at nonzero temperature but emerges at zero temperature consistent with that found by Pauli-Villas regularization. For finite lattice size, however, the chiral magnetic current is nonvanishing at nonzero temperature. But the numerical vaule of the coefficient of CME current is very small compared with that extracted from the full QCD simulation for the same lattice parameters. The possibility of higher order corrections from QCD dynamics is also assessed.

hep-ph↗

arXiv2017

Signal Shaping for Two-User Gaussian Multiple Access Channels with Computation: Beyond the Cut-Set Bound

In this paper, we investigate the signal shaping in a two-user discrete time memoryless Gaussian multiple-access channel (MAC) with computation. It is shown that by optimizing input probability distribution, the transmission rate per transmitter is beyond the cut-set bound. In contrast with the single-user discrete memoryless channel, the Maxwell-Boltzmann distribution is no longer a good approximation to the optimal input probability distribution for this discrete-time Gaussian MAC with computation. Specifically, we derive and analyze the mutual information for this channel. Because of the computation in the destination, the mutual information is not concave in general on the input probability distribution, and then primal-dual interior-point method is used to solve this non-convex problem. Finally, some good input probability distributions for 16-ary pulse amplitude modulation (PAM) constellation are obtained and achieve $4.0349$ dB gain over the cut-set bound for the target transmission rate $3.0067$ bits/(channel use).

cs.IT↗

arXiv2017

A Parallel Simulator for Massive Reservoir Models Utilizing Distributed-Memory Parallel Systems

This paper presents our work on developing parallel computational methods for two-phase flow on modern parallel computers, where techniques for linear solvers and nonlinear methods are studied and the standard and inexact Newton methods are investigated. A multi-stage preconditioner for two-phase flow is applied and advanced matrix processing strategies are studied. A local reordering method is developed to speed the solution of linear systems. Numerical experiments show that these computational methods are effective and scalable, and are capable of computing large-scale reservoir simulation problems using thousands of CPU cores on parallel computers. The nonlinear techniques, preconditioner and matrix processing strategies can also be applied to three-phase black oil, compositional and thermal models.

cs.CE↗

arXiv2017

An hp-adaptive strategy for elliptic problems

In this paper a new hp-adaptive strategy for elliptic problems based on refinement history is proposed, which chooses h-, p- or hp-refinement on individual elements according to a posteriori error estimate, as well as smoothness estimate of the solution obtained by comparing the actual and expected error reduction rate. Numerical experiments show that exponential convergence can be achieved with this strategy.

math.NA↗

arXiv2017

Dynamic load balancing for large-scale adaptive finite element computation

For the parallel computation of partial differential equations, one key is the grid partitioning. It requires that each process owns the same amount of computations, and also, the partitioning quality should be proper to reduce the communications among processes. When calculating the partial differential equations using adaptive finite element methods, the grid and the basis functions adjust in each iteration, which introduce load balancing issues. The grid should be redistributed dynamically. This paper studies dynamic load balancing algorithms and the implementation on the adaptive finite element platform PHG. The numerical experiments show that algorithms studied in this paper have good partitioning quality, and they are efficient.

cs.DC↗

arXiv2017

Scalable linear solvers for sparse linear systems from large-scale numerical simulations

This paper presents our work on designing scalable linear solvers for large-scale reservoir simulations. The main objective is to support implementation of parallel reservoir simulators on distributed-memory parallel systems, where MPI (Message Passing Interface) is employed for communications among computation nodes. Distributed matrix and vector modules are designed, which are the base of our parallel linear systems. Commonly-used Krylov subspace linear solvers are implemented, including the restarted GMRES method, the LGMRES method, and the BiCGSTAB method. It also has an interface to a parallel algebraic multigrid solver, BoomerAMG from HYPRE. Parallel general-purpose preconditioners and special preconditioners for reservoir simulations are also developed. The numerical experiments show that our linear solvers have excellent scalability using thousands of CPU cores.

cs.MS↗

arXiv2017

New Order-Optimal Decentralized Coded Caching Schemes with Good Performance in the Finite File Size Regime

A decentralized coded caching scheme based on independent random content placement has been proposed by Maddah-Ali and Niesen, and has been shown to achieve an order-optimal memory-load tradeoff when the file size goes to infinity. It was then successively shown by Shanmugam et al. that in the practical operating regime where the file size is limited such scheme yields much less attractive load gain. In this paper, we propose a decentralized random coded caching scheme and a partially decentralized sequential coded caching scheme with different coordination requirements in the content placement phase. The proposed content placement and delivery methods aim at ensuring abundant coded-multicasting opportunities in the content delivery phase when the file size is finite. We first analyze the loads of the two proposed schemes and show that the sequential scheme outperforms the random scheme in the finite file size regime. We also show that both our proposed schemes outperform Maddah-Ali--Niesen's and Shanmugam et al.'s decentralized schemes for finite file size, when the number of users is sufficiently large. Then, we show that our schemes achieve the same memory-load tradeoff as Maddah-Ali--Niesen's decentralized scheme when the file size goes to infinity, and hence are also order optimal. Finally, we analyze the load gains of the two proposed schemes and characterize the corresponding required file sizes.

cs.IT↗

arXiv2016

Charmonium spectrum and their electromagnetic transitions with higher multipole contributions

The charmonium spectrum is calculated with two nonrelativistic quark models, the linear potential model and the screened potential model. Using the obtained wavefunctions, we evaluate the electromagnetic transitions of charmonium states up to $4S$ multiplet. The higher multipole contributions are included by a multipole expansion of the electromagnetic interactions. Our results are in reasonable agreement with the measurements. As conventional charmonium states, the radiative decay properties of the newly observed charmonium-like states, such as $X(3823)$, $X(3872)$, $X(4140/4274)$, are discussed. The $X(3823)$ as $ψ_2(1D)$, its radiative decay properties well agree with the observations. From the radiative decay properties of $X(3872)$, one can not exclude it as a $χ_{c1}(2P)$ dominant state. We also give discussions of possibly observing the missing charmonium states in radiative transitions, which might provide some useful references to look for them in forthcoming experiments. The higher multipole contributions to the electromagnetic transitions are analyzed as well. It is found that the higher contribution from the magnetic part could give notable corrections to some E1 dominant processes by interfering with the E1 amplitudes. Our predictions for the normalized magnetic quadrupole amplitudes $M_2$ of the $χ_{c1,2}(1P)\to J/ψγ$ processes are in good agreement with the recent CLEO measurements.

hep-ph↗