arXiv subjects

Yang Wang

Publications and source records attributed to Yang Wang.

At least 901 records · Page 50Linked to original sources

arXiv2013

Phase Retrieval for Sparse Signals

The aim of this paper is to build up the theoretical framework for the recovery of sparse signals from the magnitude of the measurement. We first investigate the minimal number of measurements for the success of the recovery of sparse signals without the phase information. We completely settle the minimality question for the real case and give a lower bound for the complex case. We then study the recovery performance of the $\ell_1$ minimization. In particular, we present the null space property which, to our knowledge, is the first sufficient and necessary condition for the success of $\ell_1$ minimization for $k$-sparse phase retrievable.

cs.IT↗

arXiv2013

Global Climate network evolves with North Atlantic Oscillation phases: Coupling to Southern Pacific Ocean

We construct a network from climate records of atmospheric temperature at surface level, at different geographical sites in the globe, using reanalysis data from years 1948-2010. We find that the network correlates with the North Atlantic Oscillation (NAO), both locally in the north Atlantic, and through coupling to the southern Pacific Ocean. The existence of tele-connection links between those areas and their stability over time allows us to suggest a possible physical explanation for this phenomenon.

physics.ao-ph↗

arXiv2013

A Multiscale Sub-linear Time Fourier Algorithm for Noisy Data

We extend the recent sparse Fourier transform algorithm of (Lawlor, Christlieb, and Wang, 2013) to the noisy setting, in which a signal of bandwidth N is given as a superposition of k << N frequencies and additive noise. We present two such extensions, the second of which exhibits a novel form of error-correction in its frequency estimation not unlike that of the beta-encoders in analog-to-digital conversion (Daubechies et al, 2006). The algorithm runs in time O(k log(k) log(N/k)) on average, provided the noise is not overwhelming. The error-correction property allows the algorithm to outperform FFTW, a highly optimized software package for computing the full discrete Fourier transform, over a wide range of sparsity and noise values, and is to the best of our knowledge novel in the sparse Fourier transform context.

math.NA↗

arXiv2013

Invertibility and Robustness of Phaseless Reconstruction

This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz bounds of the nonlinear analysis map and we establish theoretical performance bounds of any reconstruction algorithm. We show that robust and stable reconstruction requires additional redundancy than the critical threshold.

math.FA↗

arXiv2013

Phase retrieval from very few measurements

In many applications, signals are measured according to a linear process, but the phases of these measurements are often unreliable or not available. To reconstruct the signal, one must perform a process known as phase retrieval. This paper focuses on completely determining signals with as few intensity measurements as possible, and on efficient phase retrieval algorithms from such measurements. For the case of complex M-dimensional signals, we construct a measurement ensemble of size 4M-4 which yields injective intensity measurements; this is conjectured to be the smallest such ensemble. For the case of real signals, we devise a theory of "almost" injective intensity measurements, and we characterize such ensembles. Later, we show that phase retrieval from M+1 almost injective intensity measurements is NP-hard, indicating that computationally efficient phase retrieval must come at the price of measurement redundancy.

math.FA↗

arXiv2013

Solving the minimum sum coloring problem via binary quadratic programming

In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using the BQP model to solve the minimum sum coloring problem (MSCP). For this purpose, we recast the MSCP with a quadratic model which is then solved via a recently proposed Path Relinking (PR) algorithm designed for the general BQP. Based on a set of MSCP benchmark instances, we investigate the performance of this solution approach compared with existing methods.

cs.DS↗

arXiv2013

A hierarchical time-splitting approach for solving finite-time optimal control problems

We present a hierarchical computation approach for solving finite-time optimal control problems using operator splitting methods. The first split is performed over the time index and leads to as many subproblems as the length of the prediction horizon. Each subproblem is solved in parallel and further split into three by separating the objective from the equality and inequality constraints respectively, such that an analytic solution can be achieved for each subproblem. The proposed solution approach leads to a nested decomposition scheme, which is highly parallelizable. We present a numerical comparison with standard state-of-the-art solvers, and provide analytic solutions to several elements of the algorithm, which enhances its applicability in fast large-scale applications.

math.OC↗

arXiv2013

The dominant imprint of Rossby waves in the climate network

The connectivity pattern of networks, which are based on a correlation between ground level temperature time series, shows a dominant dense stripe of links in the southern ocean. We show that statistical categorization of these links yields a clear association with the pattern of an atmospheric Rossby wave, one of the major mechanisms associated with the weather system and with planetary scale energy transport. It is shown that alternating densities of negative and positive links (correlations) are arranged in half Rossby wave distances around 3,500 km, 7,000 km and 10,000 km and are aligned with the expected direction of energy flow, distribution of time delays and the seasonality of these waves. It is also shown that long distance links (i.e., of distances larger than 2,000 km) that are associated with Rossby waves are the most dominant in the climate network. Climate networks may thus be used as an efficient new way to detect and analyze Rossby waves, based on reliable and available ground level measurements, in addition to the frequently used 300 hPa reanalysis meridional wind data.

physics.ao-ph↗

arXiv2013

Lipschitz Equivalence of Self-Similar Sets: Algebraic and Geometric Properties

In this paper we provide an up-to-date survey on the study of Lipschitz equivalence of self-similar sets. Lipschitz equivalence is an important property in fractal geometry because it preserves many key properties of fractal sets. A fundamental result by Falconer and Marsh [On the Lipschitz equivalence of Cantor sets, \textit{Mathematika}, \textbf{39} (1992), 223--233] establishes conditions for Lipschitz equivalence based on the algebraic properties of the contraction ratios of the self-similar sets. Recently there has been other substantial progress in the field. This paper is a comprehensive survey of the field. It provides a summary of the important and interesting results in the field. In addition we provide detailed discussions on several important techniques that have been used to prove some of the key results. It is our hope that the paper will provide a good overview of major results and techniques, and a friendly entry point for anyone who is interested in studying problems in this field.

math.MG↗

arXiv2013

Bounds of Efficiency at Maximum Power for Normal-, Sub- and Super-Dissipative Carnot-Like Heat Engines

The Carnot-like heat engines are classified into three types (normal-, sub- and super-dissipative) according to relations between the minimum irreversible entropy production in the "isothermal" processes and the time for completing those processes. The efficiencies at maximum power of normal-, sub- and super-dissipative Carnot-like heat engines are proved to be bounded between $η_C/2$ and $η_C/(2-η_C)$, $η_C /2$ and $η_C$, 0 and $η_C/(2-η_C)$, respectively. These bounds are also shared by linear, sub- and super-linear irreversible Carnot-like engines [Tu and Wang, Europhys. Lett. 98, 40001 (2012)] although the dissipative engines and the irreversible ones are inequivalent to each other.

cond-mat.stat-mech↗

arXiv2012

Adaptive Foreground and Shadow Detection inImage Sequences

This paper presents a novel method of foreground segmentation that distinguishes moving objects from their moving cast shadows in monocular image sequences. The models of background, edge information, and shadow are set up and adaptively updated. A Bayesian belief network is proposed to describe the relationships among the segmentation label, background, intensity, and edge information. The notion of Markov random field is used to encourage the spatial connectivity of the segmented regions. The solution is obtained by maximizing the posterior possibility density of the segmentation field.

cs.CV↗

arXiv2012

Spectral coarse graining for random walk in bipartite networks

Many real-world networks display a natural bipartite structure, while analyzing or visualizing large bipartite networks is one of the most challenges. As a result, it is necessary to reduce the complexity of large bipartite systems and preserve the functionality at the same time. We observe, however, the existing coarse graining methods for binary networks fail to work in the bipartite networks. In this paper, we use the spectral analysis to design a coarse graining scheme specifically for bipartite networks and keep their random walk properties unchanged. Numerical analysis on artificial and real-world bipartite networks indicates that our coarse graining scheme could obtain much smaller networks from large ones, keeping most of the relevant spectral properties. Finally, we further validate the coarse graining method by directly comparing the mean first passage time between the original network and the reduced one.

physics.soc-ph↗

arXiv2012

Lipschitz equivalence of self-similar sets with touching structures

Lipschitz equivalence of self-similar sets is an important area in the study of fractal geometry. It is known that two dust-like self-similar sets with the same contraction ratios are always Lipschitz equivalent. However, when self-similar sets have touching structures the problem of Lipschitz equivalence becomes much more challenging and intriguing at the same time. So far the only known results only cover self-similar sets in $\bR$ with no more than 3 branches. In this study we establish results for the Lipschitz equivalence of self-similar sets with touching structures in $\bR$ with arbitrarily many branches. Key to our study is the introduction of a geometric condition for self-similar sets called {\em substitutable}.

math.MG↗

arXiv2012

Adaptive sub-linear Fourier algorithms

We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k << N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic runtime scaling, while our algorithm scales linearly with k in the average case. Underlying our algorithm are a few simple observations relating the Fourier coefficients of time-shifted samples to unshifted samples of the input function. This allows us to detect when aliasing between two or more frequencies has occurred, as well as to determine the value of unaliased frequencies. We show that empirically our algorithm is orders of magnitude faster than competing algorithms.

math.NA↗

arXiv2012

Coefficient of performance at maximum figure of merit and its bounds for low-dissipation Carnot-like refrigerators

The figure of merit for refrigerators performing finite-time Carnot-like cycles between two reservoirs at temperature $T_h$ and $T_c$ ($<T_h$) is optimized. It is found that the coefficient of performance at maximum figure of merit is bounded between 0 and $(\sqrt{9+8\varepsilon_c}-3)/2$ for the low-dissipation refrigerators, where $\varepsilon_c =T_c/(T_h-T_c)$ is the Carnot coefficient of performance for reversible refrigerators. These bounds can be reached for extremely asymmetric low-dissipation cases when the ratio between the dissipation constants of the processes in contact with the cold and hot reservoirs approaches to zero or infinity, respectively. The observed coefficients of performance for real refrigerators are located in the region between the lower and upper bounds, which is in good agreement with our theoretical estimation.

cond-mat.stat-mech↗

arXiv2012

Mapping Dirac Quasiparticles near a Single Coulomb Impurity on Graphene

The response of Dirac fermions to a Coulomb potential is predicted to differ significantly from the behavior of non-relativistic electrons seen in traditional atomic and impurity systems. Surprisingly, many key theoretical predictions for this ultra-relativistic regime have yet to be tested in a laboratory. Graphene, a 2D material in which electrons behave like massless Dirac fermions, provides a unique opportunity to experimentally test such predictions. The response of Dirac fermions to a Coulomb potential in graphene is central to a wide range of electronic phenomena and can serve as a sensitive probe of graphene's intrinsic dielectric constant, the primary factor determining the strength of electron-electron interactions in this material. Here we present a direct measurement of the nanoscale response of Dirac fermions to a single Coulomb potential placed on a gated graphene device. Scanning tunneling microscopy and spectroscopy were used to fabricate tunable charge impurities on graphene and to measure how they are screened by Dirac fermions for a Q = +1|e| impurity charge state. Electron-like and hole-like Dirac fermions were observed to respond very differently to tunable Coulomb potentials. Comparison of this electron-hole asymmetry to theoretical simulations has allowed us to test basic predictions for the behavior of Dirac fermions near a Coulomb potential and to extract the intrinsic dielectric constant of graphene: ε_g= 3.0 \pm 1.0. This small value of ε_g indicates that microscopic electron-electron interactions can contribute significantly to graphene properties.

cond-mat.mes-hall↗

arXiv2012

Bounds of efficiency at maximum power for linear, superlinear and sublinear irreversible Carnot-like heat engines

The efficiency at maximum power (EMP) of irreversible Carnot-like heat engines is investigated based on the weak endoreversible assumption and the phenomenologically irreversible thermodynamics. It is found that the weak endoreversible assumption can reduce to the conventional one for the heat engines working at maximum power. Carnot-like heat engines are classified into three types (linear, superlinear, and sublinear) according to different characteristics of constitutive relations between the heat transfer rate and the thermodynamic force. The EMPs of Carnot-like heat engines are proved to be bounded between $η_C/2$ and $η_C/(2-η_C)$ for the linear type, 0 and $η_C/(2-η_C)$ for the superlinear type, and $η_C/2$ and $η_C$ for the sublinear type, respectively, where $η_C$ is the Carnot efficiency.

cond-mat.stat-mech↗

arXiv2012

Necessary and sufficient conditions to perform Spectral Tetris

Spectral Tetris has proved to be a powerful tool for constructing sparse equal norm Hilbert space frames. We introduce a new form of Spectral Tetris which works for non-equal norm frames. It is known that this method cannot construct all frames --- even in the new case introduced here. Until now, it has been a mystery as to why Spectral Tetris sometimes works and sometimes fails. We will give a complete answer to this mystery by giving necessary and sufficient conditions for Spectral Tetris to construct frames in all cases including equal norm frames, prescribed norm frames, frames with constant spectrum of the frame operator, and frames with prescribed spectrum for the frame operator. We present a variety of examples as well as special cases where Spectral Tetris always works.

math.FA↗