Search arXiv⌕ Search

arXiv subjects

Cheng Wang

Publications and source records attributed to Cheng Wang.

At least 487 records · Page 27Linked to original sources
arXiv2016

Convergence Analysis for Second Order Accurate Convex Splitting Schemes for the Periodic Nonlocal Allen-Cahn and Cahn-Hilliard Equations

In this paper we provide a detailed convergence analysis for fully discrete second order (in both time and space) numerical schemes for nonlocal Allen-Cahn (nAC) and nonlocal Cahn-Hilliard (nCH) equations. The unconditional unique solvability and energy stability ensures $\ell^4$ stability. The convergence analysis for the nAC equation follows the standard procedure of consistency and stability estimate for the numerical error function. For the nCH equation, due to the complicated form of the nonlinear term, a careful expansion of its discrete gradient is undertaken and an $H^{-1}$ inner product estimate of this nonlinear numerical error is derived to establish convergence. In addition, an a-priori $W^{1,\infty}$ bound of the numerical solution at the discrete level is needed in the error estimate. Such a bound can be obtained by performing a higher order consistency analysis by using asymptotic expansions for the numerical solution. Following the technique originally proposed by Strang (e.g., 1964), instead of the standard comparison between the exact and numerical solutions, an error estimate between the numerical solution and the constructed approximate solution yields an $O( s^3 + h^4)$ convergence in $\ell^\infty (0, T; \ell^2)$ norm, which leads to the necessary bound under a standard constraint $s \le C h$. Here, we also prove convergence of the scheme in the maximum norm under the same constraint.

math.NA↗
arXiv2016

Partial Procedural Geometric Model Fitting for Point Clouds

Geometric model fitting is a fundamental task in computer graphics and computer vision. However, most geometric model fitting methods are unable to fit an arbitrary geometric model (e.g. a surface with holes) to incomplete data, due to that the similarity metrics used in these methods are unable to measure the rigid partial similarity between arbitrary models. This paper hence proposes a novel rigid geometric similarity metric, which is able to measure both the full similarity and the partial similarity between arbitrary geometric models. The proposed metric enables us to perform partial procedural geometric model fitting (PPGMF). The task of PPGMF is to search a procedural geometric model space for the model rigidly similar to a query of non-complete point set. Models in the procedural model space are generated according to a set of parametric modeling rules. A typical query is a point cloud. PPGMF is very useful as it can be used to fit arbitrary geometric models to non-complete (incomplete, over-complete or hybrid-complete) point cloud data. For example, most laser scanning data is non-complete due to occlusion. Our PPGMF method uses Markov chain Monte Carlo technique to optimize the proposed similarity metric over the model space. To accelerate the optimization process, the method also employs a novel coarse-to-fine model dividing strategy to reject dissimilar models in advance. Our method has been demonstrated on a variety of geometric models and non-complete data. Experimental results show that the PPGMF method based on the proposed metric is able to fit non-complete data, while the method based on other metrics is unable. It is also shown that our method can be accelerated by several times via early rejection.

cs.GR↗
arXiv2016

Distributed Optimal Gas-Power Flow Using Convex Optimization and ADMM

This paper proposes a convex optimization based distributed algorithm to solve multi-period optimal gas-power flow (OGPF) in coupled energy distribution systems. At the gas distribution system side, the non-convex Weymouth gas flow equations is convexified as quadratic constraints. The optimal gas flow (OGF) subproblem is solved by an iterative second-order cone programming procedure, whose efficiency is two orders of magnitudes higher than traditional nonlinear methods. A convex quadratic program based initiation scheme is suggested, which helps to find a high-quality starting point. At the power distribution system side, convex relaxation is performed on the non-convex branch flow equations, and the optimal power flow (OPF) subproblem gives rise to a second order cone program. Tightness is guaranteed by the radial topology. In the proposed distributed algorithm, OGF and OPF are solved independently, and coordinated by the alternating direction multiplier method (ADMM). Numerical results corroborate significant enhancements on computational robustness and efficiency compared with existing centralized OGPF methods.

math.OC↗
arXiv2016

An Energy Stable Finite-Difference Scheme for Functionalized Cahn-Hilliard Equation and its Convergence Analysis

We present and analyze an unconditionally energy stable and convergent finite difference scheme for the Functionalized Cahn-Hilliard equation. One key difficulty associated with the energy stability is based on the fact that one nonlinear energy functional term in the expansion appears as non-convex, non-concave. To overcome this subtle difficulty, we add two auxiliary terms to make the combined term convex, which in turns yields a convex-concave decomposition of the physical energy. As a result, an application of the convex splitting methodology assures both the unique solvability and the unconditional energy stability of the proposed numerical scheme. To deal with a 4-Laplacian solver in an $H^{-1}$ gradient flow at each time step, we apply an efficient preconditioned steepest descent algorithm to solve the corresponding nonlinear systems. In addition, a global in time $H_{\rm per}^2$ stability of the numerical scheme is established at a theoretical level, which in turn ensures the full order convergence analysis of the scheme. A few numerical results are presented, which confirm the stability and accuracy of the proposed numerical scheme.

math.NA↗
arXiv2016

Darwini: Generating realistic large-scale social graphs

Synthetic graph generators facilitate research in graph algorithms and processing systems by providing access to data, for instance, graphs resembling social networks, while circumventing privacy and security concerns. Nevertheless, their practical value lies in their ability to capture important metrics of real graphs, such as degree distribution and clustering properties. Graph generators must also be able to produce such graphs at the scale of real-world industry graphs, that is, hundreds of billions or trillions of edges. In this paper, we propose Darwini, a graph generator that captures a number of core characteristics of real graphs. Importantly, given a source graph, it can reproduce the degree distribution and, unlike existing approaches, the local clustering coefficient and joint-degree distributions. Furthermore, Darwini maintains metrics such node PageRank, eigenvalues and the K-core decomposition of a source graph. Comparing Darwini with state-of-the-art generative models, we show that it can reproduce these characteristics more accurately. Finally, we provide an open source implementation of our approach on the vertex-centric Apache Giraph model that allows us to create synthetic graphs with one trillion edges.

cs.SI↗
arXiv2016

Image Captioning with Deep Bidirectional LSTMs

This work presents an end-to-end trainable deep bidirectional LSTM (Long-Short Term Memory) model for image captioning. Our model builds on a deep convolutional neural network (CNN) and two separate LSTM networks. It is capable of learning long term visual-language interactions by making use of history and future context information at high level semantic space. Two novel deep bidirectional variant models, in which we increase the depth of nonlinearity transition in different way, are proposed to learn hierarchical visual-language embeddings. Data augmentation techniques such as multi-crop, multi-scale and vertical mirror are proposed to prevent overfitting in training deep models. We visualize the evolution of bidirectional LSTM internal states over time and qualitatively analyze how our models "translate" image to sentence. Our proposed models are evaluated on caption generation and image-sentence retrieval tasks with three benchmark datasets: Flickr8K, Flickr30K and MSCOCO datasets. We demonstrate that bidirectional LSTM models achieve highly competitive performance to the state-of-the-art results on caption generation even without integrating additional mechanism (e.g. object detection, attention model etc.) and significantly outperform recent methods on retrieval task.

cs.CV↗
arXiv2016

Strategic Bidding and Equilibria in Coupled Gas and Electricity Markets

The wide adoption of gas fired units and power-to-gas technology brings remarkable interdependency between natural gas and electricity infrastructures. This paper studies the equilibria of coupled gas and electricity energy markets driven by the strategic bidding behavior: each producer endeavours to maximizes its own profit subjecting to the market clearing outcome. The market equilibria is formulated as an equilibrium problem with equilibrium constraints (EPEC). A special diagonalization algorithm (DA) is devised, in which the unilateral equilibria of the gas or electricity market is found in the inner loop given the rival's strategy; the interaction of the two markets are tackled in the outer loop. Case studies on two test systems validates the proposed methodology.

math.OC↗
arXiv2016

Snowfall induced by corona discharge

We demonstrated for the first time the condensation and precipitation (or snowfall) induced by a corona discharge inside a cloud chamber. Ionic wind was found to have played a more significant role than ions as extra Cloud Condensation Nuclei (CCN). 2.25 g of net snow enhancement was measured after applying a 30 kV corona discharge for 25 min. In comparison with another newly emerging femtosecond laser filamentation method, the snow precipitation induced by the corona discharge has about 4 orders of magnitude higher wall-plug efficiency under similar conditions.

physics.gen-ph↗
arXiv2016

Convergence Analysis and Error Estimates for a Second Order Accurate Finite Element Method for the Cahn-Hilliard-Navier-Stokes System

In this paper, we present a novel second order in time mixed finite element scheme for the Cahn-Hilliard-Navier-Stokes equations with matched densities. The scheme combines a standard second order Crank-Nicholson method for the Navier-Stokes equations and a modification to the Crank-Nicholson method for the Cahn-Hilliard equation. In particular, a second order Adams-Bashforth extrapolation and a trapezoidal rule are included to help preserve the energy stability natural to the Cahn-Hilliard equation. We show that our scheme is unconditionally energy stable with respect to a modification of the continuous free energy of the PDE system. Specifically, the discrete phase variable is shown to be bounded in $\ell^\infty \left(0,T;L^\infty\right)$ and the discrete chemical potential bounded in $\ell^\infty \left(0,T;L^2\right)$, for any time and space step sizes, in two and three dimensions, and for any finite final time $T$. We subsequently prove that these variables along with the fluid velocity converge with optimal rates in the appropriate energy norms in both two and three dimensions.

math.NA↗
arXiv2016

Measuring Transport Difficulty of Data Dissemination in Large-Scale Online Social Networks: An Interest-Driven Case

In this paper, we aim to model the formation of data dissemination in online social networks (OSNs), and measure the transport difficulty of generated data traffic. We focus on a usual type of interest-driven social sessions in OSNs, called \emph{Social-InterestCast}, under which a user will autonomously determine whether to view the content from his followees depending on his interest. It is challenging to figure out the formation mechanism of such a Social-InterestCast, since it involves multiple interrelated factors such as users' social relationships, users' interests, and content semantics. We propose a four-layered system model, consisting of physical layer, social layer, content layer, and session layer. By this model we successfully obtain the geographical distribution of Social-InterestCast sessions, serving as the precondition for quantifying data transport difficulty. We define the fundamental limit of \emph{transport load} as a new metric, called \emph{transport complexity}, i.e., the \emph{minimum required} transport load for an OSN over a given carrier network. Specifically, we derive the transport complexity for Social-InterestCast sessions in a large-scale OSN over the carrier network with optimal communication architecture. The results can act as the common lower bounds on transport load for Social-InterestCast over any carrier networks. To the best of our knowledge, this is the first work to measure the transport difficulty for data dissemination in OSNs by modeling session patterns with the interest-driven characteristics.

cs.SI↗
arXiv2016

The Binding Energy Parameter for Common Envelope Evolution

The binding energy parameter $λ$ plays a vital role in common envelope evolution. Though it is well known that $λ$ takes different values for stars with different masses and varies during stellar evolution, it has been erroneously adopted as a constant in most of the population synthesis calculations. We have systematically calculated the values of $λ$ for stars of masses $1-60\,M_{\odot}$ by use of an updated stellar evolution code, taking into account contribution from both gravitational energy and internal energy to the binding energy of the envelope. We adopt the criterion for the core-envelope boundary advocated by \citet{Ivanova2011}. A new kind of $λ$ with the enthalpy prescription is also investigated. We present fitting formulae for the calculated values of various kinds of $λ$, which can be used in future population synthesis studies.

astro-ph.SR↗
arXiv2016

Robust Defense Strategy for Gas-Electric Systems Against Malicious Attacks

This paper proposes a methodology to identify and protect vulnerable components of connected gas and electric infrastructures from malicious attacks, and to guarantee a resilient operation by deploying valid corrective actions (while accounting for the interdependency of gas pipeline network and power transmission network). The proposed mathematical formulation reduces to a tri-level optimization problem, where the lower level is a multiperiod economic dispatch of the gas-electric system, the middle level distinguishes the most threatening attack on the coupled physical infrastructures, and the upper level provides optimal preventive decisions to reinforce the vulnerable components and increase the system resilience. By reformulating the lower level problem as a mixed integer linear programming (MILP), a nested column-and-constraint generation (C\&CG) algorithm is developed to solve the min-max-min model. Case studies on two test systems demonstrate the effectiveness and efficiency of the proposed methodology.

math.OC↗
arXiv2016

Robust Risk-Constrained Unit Commitment with Large-scale Wind Generation: An Adjustable Uncertainty Set Approach

This paper addresses two vital issues which are barely discussed in the literature on robust unit commitment (RUC): 1) how much the potential operational loss could be if the realization of uncertainty is beyond the prescribed uncertainty set; 2) how large the prescribed uncertainty set should be when it is used for RUC decision making. In this regard, a robust risk-constrained unit commitment (RRUC) formulation is proposed to cope with large-scale volatile and uncertain wind generation. Differing from existing RUC formulations, the wind generation uncertainty set in RRUC is adjustable via choosing diverse levels of operational risk. By optimizing the uncertainty set, RRUC can allocate operational flexibility of power systems over spatial and temporal domains optimally, reducing operational cost in a risk-constrained manner. Moreover, since impact of wind generation realization out of the prescribed uncertainty set on operational risk is taken into account, RRUC outperforms RUC in the case of rare events. Three algorithms based on column and constraint generation (C&CG) are derived to solve the RRUC. As the proposed algorithms are quite general, they can also apply to other RUC models to improve their computational efficiency. Simulations on a modified IEEE 118-bus system demonstrate the effectiveness and efficiency of the proposed methodology

math.OC↗
arXiv2016

A discrete-ordinate discontinuous-streamline diffusion method for the radiative transfer equation

The radiative transfer equation (RTE) arises in many different areas of science and engineering. In this paper, we propose and investigate a discrete-ordinate discontinuous-streamline diffusion (DODSD) method for solving the RTE, which is a combination of the discrete-ordinate technique and the discontinuous-streamline diffusion method. Different from the discrete-ordinate discontinuous Galerkin (DODG) method for the RTE, an artificial diffusion parameter is added to the test functions in the spatial discretization. Stability and error estimates in certain norms are proved. Numerical results show that the proposed method can lead to a more accurate approximation in comparison with the DODG method.

math.NA↗
arXiv2016

MeV Argon ion beam generation with narrow energy spread

Laser driven particle acceleration has shown remarkable progresses in generating multi-GeV electron bunches and 10s of MeV ion beams based on high-power laser facilities. Intense laser pulse offers the acceleration field of 1012 Volt per meter, several orders of magnitude larger than that in conventional accelerators, enabling compact devices. Here we report that a highly-collimated argon ion beam with narrow energy spread is produced by irradiating a 45-fs fully-relativistic laser pulse onto an argon cluster target. The highly-charged (Argon ion with charge state of 16+) heavy ion beam has a minimum absolute energy spread of 0.19 MeV per nucleon at the energy peak of 0.39 MeV per nucleon. we identify a novel scheme from particle-in-cell simulations that greatly reduces the beam energy spread. The laser-driven intense plasma wakefield has a strong modulation on the ion beam in a way that the low energy part is cut off. The pre-accelerated argon ion beam from Coulomb explosion thus becomes more mono-energetic and collimated.

physics.plasm-ph↗
arXiv2016

Complex fields in heterogeneous materials under shock: modeling, simulation and analysis

In this mini-review we summarize the progress of modeling, simulation and analysis of shock responses of heterogeneous materials in our group in recent years. The basic methodology is as below. We first decompose the problem into different scales. Construct/Choose a model according to the scale and main mechanisms working at that scale. Perform numerical simulations using the relatively mature schemes. The physical information is transferred between neighboring scales in such a way: The statistical information of results in smaller scale contributes to establishing the constitutive equation in larger one. Except for the microscopic Molecular Dynamics (MD) model, both the mesoscopic and macroscopic models can be further classified into two categories, solidic and fluidic models, respectively. The basic ideas and key techniques of the MD, material point method and discrete Boltzmann method are briefly reviewed. Among various schemes used in analyzing the complex fields and structures, the morphological analysis and the home-built software, GISO, are briefly introduced. New observations are summarized for scales from the larger to the smaller.

cond-mat.soft↗
arXiv2016

Resonant carbon K-edge soft x-ray scattering from lattice-free heliconical molecular ordering: soft dilative elasticity of the twist-bend liquid crystal phase

Resonant x-ray scattering shows that the bulk structure of the twist-bend liquid crystal phase, recently discovered in bent molecular dimers, has spatial periodicity without electron density modulation, indicating a lattice-free heliconical nematic precession of orientation that has helical glide symmetry. In situ study of the bulk helix texture for the dimer CB7CB shows an elastically-confined temperature-dependent minimum helix pitch, but a remarkable elastic softness of pitch in response to dilative stresses. Scattering from the helix is not detectable in the higher temperature nematic phase.

cond-mat.soft↗