arXiv subjects

Hui Liu

Publications and source records attributed to Hui Liu.

At least 559 records · Page 31Linked to original sources

arXiv2018

A New In-Situ Combustion Simulator for Parallel Computers

As a competitive recovery method for heavy oil, In-Situ Combustion (ISC) shows its great potential accompanied by technological advances in recent years. Reservoir simulation will play an indispensable role in the prediction of the implementation of ISC projects. With the computational complexity, it is imperative to develop an effective and robust parallel in-situ combustion simulator. In this paper, a mathematical model for In Situ Combustion is proposed, which takes full consideration for related physical phenomena, including multi-dimensional multi-component three-phase flow, heat convection and conduction, chemical reactions, and mass transfer between phases. In the mathematical model, different governing equations and constraints are involved, forming a complicated PDE (partial differential equation) system. For physical and chemical behaviors, some special treatments for the ISC simulator are discussed and applied. Also, a modified PER (Pseudo-Equilibrium Ratio) method is proposed in the thesis. A fully implicit scheme is applied, and discretization is implemented with the FDM (Finite Difference Method). In solving nonlinear systems, the Newton Method is introduced, and both numerical and analytical Jacobian matrices are applied. Due to the complexity of an ISC problem, an appropriate decoupling method must be considered. Thus the Gauss-Jordan transformation is raised. Then, with certain preconditioners and iterative solvers, a numerical solution can be obtained. The results of different models are given, which are validated with the results from CMG STARS. Also, the scalability of parallelization is proved, indicating the excellent performance of parallel computing. This accurate, efficient, parallel ISC simulator applies to complex reservoir models.

cs.CE↗

arXiv2018

Optimal Hybrid Beamforming for Multiuser Massive MIMO Systems With Individual SINR Constraints

In this letter, we consider optimal hybrid beamforming design to minimize the transmission power under individual signal-to-interference-plus-noise ratio (SINR) constraints in a multiuser massive multiple-input-multiple-output (MIMO) system. This results in a challenging non-convex optimization problem. We consider two cases. In the case where the number of users is smaller than or equal to that of radio frequency (RF) chains, we propose a low-complexity method to obtain a globally optimal solution and show that it achieves the same transmission power as an optimal fully-digital beamformer. In the case where the number of users is larger than that of RF chains, we propose a low-complexity globally convergent alternating algorithm to obtain a stationary point.

eess.SP↗

arXiv2018

Numerical Simulation of Two-phase Flow in Natural Fractured Reservoirs Using Dual Porosity Method on Parallel Computers

The two-phase oil-water flow in natural fractured reservoirs and its numerical methods are introduced in this paper, where the fracture is modeled by the dual porosity method. Efficient numerical method, including the finite difference method, CPR-FPF preconditioners for linear systems and effective decoupling method, are presented. Parallel computing techniques employed in simulation are also presented. Using those numerical methods and parallel techniques, a parallel reservoir simulator is developed, which is capable of simulating large-scale reservoir models. The numerical results show that our simulator is accurate and scalable compared to the commercial software, and the numerical methods are also effective.

cs.CE↗

arXiv2018

Definite photon deflections of topological defects in metasurfaces and symmetry-breaking phase transitions with material loss

Combination of topology and general relativity can lead to some profound and farsighted predictions. It is well known that symmetry breaking of the Higgs vacuum field in the early universe possibly induced topological defects in spacetime, whose nontrivial effects can provide some clues about the universe's origin. Here, by using an artificial waveguide bounded with rotational metasurface, the nontrivial effects of a topological defect of spacetime are experimentally emulated. The photon deflection in the topological waveguide has a robust definite angle that does not depend on the location and momentum of incident photons. This is remarkably different from the random optical scattering in trivial space. By including material loss such a topological effect can be well understood from the symmetry breaking of photonic modes. Our technique provides a platform to investigate topological gravity in optical systems. This method can also be extended to obtain many other novel topological photonic devices.

physics.optics↗

arXiv2018

Controlling Surface Plasmons Through Covariant Transformation of the Spin-Dependent Geometric Phase Between Curved Metamaterials

General relativity uses curved space-time to describe accelerating frames. The movement of particles in different curved space-times can be regarded as equivalent physical processes based on the covariant transformation between different frames. In this work, we use one-dimensional curved metamaterials to mimic accelerating particles in curved space-times. The different curved shapes of structures are used to mimic different accelerating frames. The different geometric phases along the structure are used to mimic different movements in the frame. Using the covariant principle of general relativity, we can obtain equivalent nanostructures based on space-time transformations, such as the Lorentz transformation and conformal transformation. In this way, many covariant structures can be found which produce the same surface plasmon fields when excited by spin photons. A new kind of accelerating beam, the Rindler beam, is obtained based on the Rindler metric in gravity. Very large effective indexes can be obtained in such systems based on geometric phase gradient. This general covariant design method can be extended to many other optical media.

physics.optics↗

arXiv2018

Development of A Scalable Platform for Large-scale Reservoir Simulations on Parallel computers

This paper presents our work on designing a parallel platform for large-scale reservoir simulations. Detailed components, such as grid and linear solver, and data structures are introduced, which can serve as a guide to parallel reservoir simulations and other parallel applications. The main objective of platform is to support implementation of various parallel reservoir simulators on distributed-memory parallel systems, where MPI (Message Passing Interface) is employed for communications among computation nodes. It provides structured grid due to its simplicity and cell-centered data is applied for each cell. The platform has a distributed matrix and vector module and a map module. The matrix and vector module is the base of our parallel linear systems. The map connects grid and linear system modules, which defines various mappings between grid and linear systems. Commonly-used Krylov subspace linear solvers are implemented, including the restarted GMRES 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. Various data structures are designed, such as grid, cell, data, linear solver and preconditioner, and some key default parameters are presented in this paper. The numerical experiments show that our platform has excellent scalability and it can simulate giant reservoir models with hundreds of millions of grid cells using thousands of CPU cores.

cs.CE↗

arXiv2018

Pseudo-magnetic field and effective spin-orbit interaction for a spin-1/2 particle confined to a curved surface

By considering the spin connection, we deduce the effective equation for a spin-1/2 particle confined to a curved surface with the non-relativistic limit and in the thin-layer quantization formalism. We obtain a pseudo-magnetic field and an effective spin-orbit interaction generated by the spin connection. Geometrically, the pseudo-magnetic field is proportional to the Gaussian curvature and the effective spin-orbit interaction is determined by the Weingarten curvature tensor. Particularly, we find that the pseudo-magnetic field and the effective spin-orbit interaction can be employed to separate the electrons with different spin orientations. All these results are demonstrated in two examples, a straight cylindrical surface and a bent one.

quant-ph↗

arXiv2018

Modeling and Trade-off for Mobile Communication, Computing and Caching Networks

Computation task service delivery in a computing-enabled and caching-aided multi-user mobile edge computing (MEC) system is studied in this paper, where a MEC server can deliver the input or output datas of tasks to mobile devices over a wireless multicast channel. The computing-enabled and caching-aided mobile devices are able to store the input or output datas of some tasks, and also compute some tasks locally, reducing the wireless bandwidth consumption. The corresponding framework of this system is established, and under the latency constraint, we jointly optimize the caching and computing policy at mobile devices to minimize the required transmission bandwidth. The joint policy optimization problem is shown to be NP-hard, and based on equivalent transformation and exact penalization of the problem, a stationary point is obtained via concave convex procedure (CCCP). Moreover, in a symmetric scenario, gains offered by this approach are derived to analytically understand the influences of caching and computing resources at mobile devices, multicast transmission, the number of mobile devices, as well as the number of tasks on the transmission bandwidth. Our results indicate that exploiting the computing and caching resources at mobile devices can provide significant bandwidth savings.

cs.IT↗

arXiv2018

Uncoded Placement Optimization for Coded Delivery

We consider the classical coded caching problem as defined by Maddah-Ali and Niesen, where a server with a library of $N$ files of equal size is connected to $K$ users via a shared error-free link. Each user is equipped with a cache with capacity of $M$ files. The goal is to design a static content placement and delivery scheme such that the average load over the shared link is minimized. We first present a class of centralized coded caching schemes consisting of a general content placement strategy specified by a file partition parameter, enabling efficient and flexible content placement, and a specific content delivery strategy, enabling load reduction by exploiting common requests of different users. For the proposed class of schemes, we consider two cases for the optimization of the file partition parameter, depending on whether a large subpacketization level is allowed or not. In the case of an unrestricted subpacketization level, we formulate the coded caching optimization in order to minimize the average load under an arbitrary file popularity. A direct formulation of the problem involves $N2^K$ variables. By imposing some additional conditions, the problem is reduced to a linear program with $N(K+1)$ variables under an arbitrary file popularity and with $K+1$ variables under the uniform file popularity. We can recover Yu {\em et al.}'s optimal scheme for the uniform file popularity as an optimal solution of our problem. When a low subpacketization level is desired, we introduce a subpacketization level constraint involving the $\ell_0$ norm for each file. Again, by imposing the same additional conditions, we can simplify the problem to a difference of two convex functions (DC) problem with $N(K+1)$ variables that can be efficiently solved.

cs.IT↗

arXiv2018

Communications, Caching and Computing for Mobile Virtual Reality: Modeling and Tradeoff

Virtual reality (VR) over wireless is emerging as an important use case of 5G networks. Immersive VR experience requires the delivery of huge data at ultra-low latency, thus demanding ultra-high transmission rate. This challenge can be largely addressed by the recent network architecture known as mobile edge computing (MEC), which enables caching and computing capabilities at the edge of wireless networks. This paper presents a novel MEC-based mobile VR delivery framework that is able to cache parts of the field of views (FOVs) in advance and run certain post-processing procedures at the mobile VR device. To optimize resource allocation at the mobile VR device, we formulate a joint caching and computing decision problem to minimize the average required transmission rate while meeting a given latency constraint. When FOVs are homogeneous, we obtain a closed-form expression for the optimal joint policy which reveals interesting communications-caching-computing tradeoffs. When FOVs are heterogeneous, we obtain a local optima of the problem by transforming it into a linearly constrained indefinite quadratic problem then applying concave convex procedure. Numerical results demonstrate great promises of the proposed mobile VR delivery framework in saving communication bandwidth while meeting low latency requirement.

cs.IT↗

arXiv2018

Communication, Computing and Caching for Mobile VR Delivery: Modeling and Trade-off

Mobile virtual reality (VR) delivery is gaining increasing attention from both industry and academia due to its ability to provide an immersive experience. However, achieving mobile VR delivery requires ultra-high transmission rate, deemed as a first killer application for 5G wireless networks. In this paper, in order to alleviate the traffic burden over wireless networks, we develop an implementation framework for mobile VR delivery by utilizing caching and computing capabilities of mobile VR device. We then jointly optimize the caching and computation offloading policy for minimizing the required average transmission rate under the latency and local average energy consumption constraints. In a symmetric scenario, we obtain the optimal joint policy and the closed-form expression of the minimum average transmission rate. Accordingly, we analyze the tradeoff among communication, computing and caching, and then reveal analytically the fact that the communication overhead can be traded by the computing and caching capabilities of mobile VR device, and also what conditions must be met for it to happen. Finally, we discuss the optimization problem in a heterogeneous scenario, and propose an efficient suboptimal algorithm with low computation complexity, which is shown to achieve good performance in the numerical results.

cs.IT↗

arXiv2018

Weakly nonlinear analysis for car-following model with consideration of cooperation and time delays

In traffic systems, cooperative driving has attracted the researchers attentions. A lot of works attempt to understand the effects of cooperative driving behavior and/or time delays on traffic flow dynamics for specific traffic flow model. This paper is a new attempt to investigate analyses of linear stability and weak nonlinear for the general car-following model with consideration of cooperation and time delays. We derive linear stability condition and study that how the combinations of cooperation and time delays affect the stability of traffic flow. Burgers equation and Korteweg de Vries (KdV) equation for car-following model considering cooperation and time delays are derived. Their solitary wave solutions and constraint conditions are concluded. We investigate the property of cooperative optimal velocity(OV) model which estimates the combinations of cooperation and time delays about the evolution of traffic waves using both analytic and numerical methods. The results indicate that delays and cooperation are model-dependent, and cooperative behavior could inhibit the stabilization of traffic flow. Moreover, delays of sensing to relative motion are easy to trigger the traffic waves; delays of sensing to host vehicle are beneficial to relieve the instability effect a certain extent.

nlin.PS↗

arXiv2018

Explicit calculation on two-loop correction to the chiral magnetic effect with NJL model

Chiral Magnetic Effect(CME) is usually believed not receiving higher order corrections due to the non-renormalization of AVV triangle diagram in the framework of quantum field theory. However, the CME-relevant triangle, which is obtained by expanding the current-current correlation requires zero momentum on the axial vertex, is not equivalent to the general AVV triangle when taking the zero-momentum limit owing to the infrared problem on the axial vertex. Therefore, it is still significant to check if there exists perturbative higher order corrections to the current-current correlation. In this paper, we explicitly calculate the two-loop corrections of CME within NJL model with Chern-Simons term which ensures a consistent $μ_5$. The result shows the two-loop corrections to the CME conductivity are zero, which confirms the non-renomalization of CME conductivity.

hep-ph↗

arXiv2018

GPU Accelerated Finite Element Assembly with Runtime Compilation

In recent years, high performance scientific computing on graphics processing units (GPUs) have gained widespread acceptance. These devices are designed to offer massively parallel threads for running code with general purpose. There are many researches focus on finite element method with GPUs. However, most of the works are specific to certain problems and applications. Some works propose methods for finite element assembly that is general for a wide range of finite element models. But the development of finite element code is dependent on the hardware architectures. It is usually complicated and error prone using the libraries provided by the hardware vendors. In this paper, we present architecture and implementation of finite element assembly for partial differential equations (PDEs) based on symbolic computation and runtime compilation technique on GPU. User friendly programming interface with symbolic computation is provided. At the same time, high computational efficiency is achieved by using runtime compilation technique. As far as we know, it is the first work using this technique to accelerate finite element assembly for solving PDEs. Experiments show that a one to two orders of speedup is achieved for the problems studied in the paper.

cs.MS↗

arXiv2018

Light rays and waves on geodesic lenses

Starting from well-known absolute instruments for perfect imaging, we introduce a type of rotational-symmetrical compact closed manifolds, namely geodesic lenses. We demonstrate that light rays confined on geodesic lenses are closed trajectories. While for optical waves, the spectrum of geodesic lens is (at least approximately) degenerate and equidistant with numerical methods. Based on this property, we show a periodical evolution of optical waves and quantum waves on geodesic lenses. Moreover, we fabricate two geodesic lenses in sub-micrometer scale, where curved light rays are observed with high accurate precision. Our results may offer a new platform to investigate light propagation on curved surfaces.

physics.optics↗

arXiv2018

Reversible Wavefront Shaping Between Gaussian and Airy Beams By Mimicking Gravitational Field

In this paper, we experimentally demonstrate reversible wavefront shaping through mimicking gravitational field. A gradient-index micro-structured optical waveguide with special refractive index profile was constructed whose effective index satisfying a gravitational field profile. Inside the waveguide, an incident broad Gaussian beam is firstly transformed into an accelerating beam, and the generated accelerating beam is gradually changed back to a Gaussian beam afterwards. To validate our experiment, we performed full-wave continuum simulations that agree with the experimental results. Furthermore, a theoretical model was established to describe the evolution of the laser beam based on Landau's method, showing that the accelerating beam behaves like the Airy beam in the small range in which the linear potential approaches zero. To our knowledge, such a reversible wavefront shaping technique has not been reported before.

physics.optics↗

arXiv2017

Optical interface states protected by synthetic Weyl points

Weyl fermions have not been found in nature as elementary particles, but they emerge as nodal points in the band structure of electronic and classical wave crystals. Novel phenomena such as Fermi arcs and chiral anomaly have fueled the interest in these topological points which are frequently perceived as monopoles in momentum space. Here we report the experimental observation of generalized optical Weyl points inside the parameter space of a photonic crystal with a specially designed four-layer unit cell. The reflection at the surface of a truncated photonic crystal exhibits phase vortexes due to the synthetic Weyl points, which in turn guarantees the existence of interface states between photonic crystals and any reflecting substrates. The reflection phase vortexes have been confirmed for the first time in our experiments which serve as an experimental signature of the generalized Weyl points. The existence of these interface states is protected by the topological properties of the Weyl points and the trajectories of these states in the parameter space resembles those of Weyl semimetal "Fermi arcs surface states" in momentum space. Tracing the origin of interface states to the topological character of the parameter space paves the way for a rational design of strongly localized states with enhanced local field.

physics.optics↗

arXiv2017

Design and Optimization of VoD schemes with Client Caching in Wireless Multicast Networks

Due to the explosive growth in multimedia traffic, the scalability of video-on-demand (VoD) services becomes increasingly important. By exploiting the potential cache ability at the client side, the performance of VoD multicast delivery can be improved through video segment pre-caching. In this paper, we address the performance limits of client caching enabled VoD schemes in wireless multicast networks with asynchronous requests. Both reactive and proactive systems are investigated. Specifically, for the reactive system where videos are transmitted on demand, we propose a joint cache allocation and multicast delivery scheme to minimize the average bandwidth consumption under the zero-delay constraint. For the proactive system where videos are periodically broadcasted, a joint design of the cache-bandwidth allocation algorithm and the delivery mechanism is developed to minimize the average waiting time under the total bandwidth constraint. In addition to the full access pattern where clients view videos in their entirety, we further consider the access patterns with random endpoints, fixed-size intervals and downloading demand, respectively. The impacts of different access patterns on the resource-allocation algorithm and the delivery mechanism are elaborated. Simulation results validate the accuracy of the analytical results and also provide useful insights in designing VoD networks with client caching.

cs.IT↗