Searcharxiv⌕ Search

arXiv subjects

Qiang Liu

Publications and source records attributed to Qiang Liu.

517 records · Page 29Linked to original sources

Planetary Transit Candidates in the CSTAR Field: Analysis of the 2008 Data

The Chinese Small Telescope ARray (CSTAR) is a group of four identical, fully automated, static 14.5 cm telescopes. CSTAR is located at Dome A, Antarctica and covers 20 square degree of sky around the South Celestial Pole. The installation is designed to provide high-cadence photometry for the purpose of monitoring the quality of the astronomical observing conditions at Dome A and detecting transiting exoplanets. CSTAR has been operational since 2008, and has taken a rich and high-precision photometric data set of 10,690 stars. In the first observing season, we obtained 291,911 qualified science frames with 20-second integrations in the i-band. Photometric precision reaches about 4 mmag at 20-second cadence at i=7.5, and is about 20 mmag at i=12. Using robust detection methods, ten promising exoplanet candidates were found. Four of these were found to be giants using spectroscopic follow-up. All of these transit candidates are presented here along with the discussion of their detailed properties as well as the follow-up observations.

astro-ph.EP↗

Photometry of Variable Stars from Dome A, Antarctica: Results from the 2010 Observing Season

We present results from a season of observations with the Chinese Small Telescope ARray (CSTAR), obtained over 183 days of the 2010 Antarctic winter. We carried out high-cadence time-series aperture photometry of 20,000 stars with i<15.3 mag located in a 23 square-degree region centered on the south celestial pole. We identified 188 variable stars, including 67 new objects relative to our 2008 observations, thanks to broader synoptic coverage, a deeper magnitude limit and a larger field of view. We used the photometric data set to derive site statistics from Dome A. Based on two years of observations, we find that extinction due to clouds at this site is less than 0.1 and 0.4 mag during 45% and 75% of the dark time, respectively.

astro-ph.SR↗

Variational Algorithms for Marginal MAP

The marginal maximum a posteriori probability (MAP) estimation problem, which calculates the mode of the marginal posterior distribution of a subset of variables with the remaining variables marginalized, is an important inference problem in many models, such as those with hidden variables or uncertain parameters. Unfortunately, marginal MAP can be NP-hard even on trees, and has attracted less attention in the literature compared to the joint MAP (maximization) and marginalization problems. We derive a general dual representation for marginal MAP that naturally integrates the marginalization and maximization operations into a joint variational optimization problem, making it possible to easily extend most or all variational-based algorithms to marginal MAP. In particular, we derive a set of "mixed-product" message passing algorithms for marginal MAP, whose form is a hybrid of max-product, sum-product and a novel "argmax-product" message updates. We also derive a class of convergent algorithms based on proximal point methods, including one that transforms the marginal MAP problem into a sequence of standard marginalization problems. Theoretically, we provide guarantees under which our algorithms give globally or locally optimal solutions, and provide novel upper bounds on the optimal objectives. Empirically, we demonstrate that our algorithms significantly outperform the existing approaches, including a state-of-the-art algorithm based on local search methods.

stat.ML↗

Belief Propagation for Structured Decision Making

Variational inference algorithms such as belief propagation have had tremendous impact on our ability to learn and use graphical models, and give many insights for developing or understanding exact and approximate inference. However, variational approaches have not been widely adoped for decision making in graphical models, often formulated through influence diagrams and including both centralized and decentralized (or multi-agent) decisions. In this work, we present a general variational framework for solving structured cooperative decision-making problems, use it to propose several belief propagation-like algorithms, and analyze them both theoretically and empirically.

cs.AI↗

Distributed Parameter Estimation via Pseudo-likelihood

Estimating statistical models within sensor networks requires distributed algorithms, in which both data and computation are distributed across the nodes of the network. We propose a general approach for distributed learning based on combining local estimators defined by pseudo-likelihood components, encompassing a number of combination methods, and provide both theoretical and experimental analysis. We show that simple linear combination or max-voting methods, when combined with second-order information, are statistically competitive with more advanced and costly joint optimization. Our algorithms have many attractive properties including low communication and computational cost and "any-time" behavior.

cs.LG↗

Negative Tree Reweighted Belief Propagation

We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear combination of spanning trees with negative weights. This technique is a lower-bound counterpart to the tree-reweighted belief propagation algorithm, which uses a convex combination of spanning trees with positive weights to provide corresponding upper bounds. We develop algorithms to optimize and tighten the lower bounds over the non-convex set of valid parameter values. Our algorithm generalizes mean field approaches (including naive and structured mean field approximations), which it includes as a limiting case.

cs.LG↗

Variational Algorithms for Marginal MAP

Marginal MAP problems are notoriously difficult tasks for graphical models. We derive a general variational framework for solving marginal MAP problems, in which we apply analogues of the Bethe, tree-reweighted, and mean field approximations. We then derive a "mixed" message passing algorithm and a convergent alternative using CCCP to solve the BP-type approximations. Theoretically, we give conditions under which the decoded solution is a global or local optimum, and obtain novel upper bounds on solutions. Experimentally we demonstrate that our algorithms outperform related approaches. We also show that EM and variational EM comprise a special case of our framework.

cs.LG↗

Photometry of Variable Stars from Dome A, Antarctica

Dome A on the Antarctic plateau is likely one of the best observing sites on Earth thanks to the excellent atmospheric conditions present at the site during the long polar winter night. We present high-cadence time-series aperture photometry of 10,000 stars with i<14.5 mag located in a 23 square-degree region centered on the south celestial pole. The photometry was obtained with one of the CSTAR telescopes during 128 days of the 2008 Antarctic winter. We used this photometric data set to derive site statistics for Dome A and to search for variable stars. Thanks to the nearly-uninterrupted synoptic coverage, we find 6 times as many variables as previous surveys with similar magnitude limits. We detected 157 variable stars, of which 55% are unclassified, 27% are likely binaries and 17% are likely pulsating stars. The latter category includes delta Scuti, gamma Doradus and RR Lyrae variables. One variable may be a transiting exoplanet.

astro-ph.SR↗

C2H, HC3N and HNC Observations in OMC-2/3

For the first time, the OMC-2/3 region was mapped in C2H(1-0), HC3N(10-9) and HNC(1-0) lines. In general, the emissions from all the three molecular species reveal an extended filamentary structure. The distribution of C2H cores almost follows that of the 1300 $μ$m condensations, which might suggest that C2H is a good tracer to study the core structure of molecular clouds. The core masses traced by HNC are rather flat, ranging from 18.8 to 49.5 $M_{\odot}$, while present a large span for those from C2H, ranging from 6.4 to 36.0 $M_{\odot}$. The line widths of both HNC and C2H look very similar, and both are wider than that of HC3N. The line widths of the three lines are all wider than those from dark clouds, implying that the former is more active than the latter, and has larger turbulence caused by winds and UV radiation from the surrounding massive stars.

astro-ph.SR↗

Data characterization using artificial-star tests: performance evaluation

Traditional artificial-star tests are widely applied to photometry in crowded stellar fields. However, to obtain reliable binary fractions (and their uncertainties) of remote, dense, and rich star clusters, one needs to recover huge numbers of artificial stars. Hence, this will consume much computation time for data reduction of the images to which the artificial stars must be added. In this paper, we present a new method applicable to data sets characterized by stable, well-defined point-spread functions, in which we add artificial stars to the retrieved-data catalog instead of the raw images. Taking the young Large Magellanic Cloud cluster NGC 1818 as an example, we compare results from both methods and show that they are equivalent, while our new method saves significant computational time.

astro-ph.IM↗

The binary fraction of the young cluster NGC 1818 in the Large Magellanic Cloud

We use high-resolution {\sl Hubble Space Telescope} imaging observations of the young ($\sim 15-25$ Myr-old) star cluster NGC 1818 in the Large Magellanic Cloud to derive an estimate for the binary fraction of F stars ($1.3 < M_\star/M_\odot < 1.6$). This study provides the strongest constraints yet on the binary fraction in a young star cluster in a low-metallicity environment (${[Fe/H]} \sim -0.4$ dex). Employing artificial-star tests, we develop a simple method that can efficiently measure the probabilities of stellar blends and superpositions from the observed stellar catalog. We create synthetic color-magnitude diagrams matching the fundamental parameters of NGC 1818, with different binary fractions and mass-ratio distributions. We find that this method is sensitive to binaries with mass ratios, $q \ga 0.4$. For binaries with F-star primaries and mass ratios $q > 0.4$, the binary fraction is $\sim 0.35$. This suggests a total binary fraction for F stars of 0.55 to unity, depending on assumptions about the form of the mass-ratio distribution at low $q$.

astro-ph↗

Dynamic interfaces in an organic thin film

Low-dimensional boundaries between phases and domains in organic thin films are important in charge transport and recombination. Here, fluctuations of interfacial boundaries in an organic thin film, acridine-9-carboxylic acid (ACA) on Ag(111), have been visualized in real time, and measured quantitatively, using Scanning Tunneling Microscopy. The boundaries fluctuate via molecular exchange with exchange time constants of 10-30 ms at room temperature, yielding length mode fluctuations that should yield characteristic f-1/2 signatures for frequencies less than ~100 Hz. Although ACA has highly anisotropic intermolecular interactions, it forms islands that are compact in shape with crystallographically distinct boundaries that have essentially identical thermodynamic and kinetic properties . The physical basis of the modified symmetry is shown to arise from significantly different substrate interactions induced by alternating orientations of successive molecules in the condensed phase. Incorporating this additional set of interactions in a lattice gas model leads to effective multi-component behavior, as in the Blume-Emery-Griffiths (BEG) model, and can straightforwardly reproduce the experimentally observed isotropic behavior. The general multi-component description allows the domain shapes and boundary fluctuations to be tuned from isotropic to highly anisotropic in terms of the balance between intermolecular interactions and molecule-substrate interactions. Key words: Organic thin film, fluctuations, STM, molecular interactions, diffusion kinetics, phase coexistence

cond-mat.mtrl-sci↗

A Revised Generalized Kolmogorov-Sinai-like Entropy and Markov Shifts

The Kolmogorov-Sinai entropy in the sense of Tsallis under Bernoulli shifts was obtained by Meson and Vericat [J. Math. Phys. 37, 4480(1996)]. In this paper, we propose a revised generalized Kolmogorov-Sinai-q entropy under Markov shifts. The form of this generalized entropy with factor q is nonextensive. The new generalized entropy contains the classical Kolmogorov-Sinai entropy and Renyi entropy as well as Bernoulli shifts as special cases. Applying the generalized entropy we discuss its approximate behavior qualitatively, the entropy rate and the sensitive value q^* of the nonextensive parameter q, which may exit in the interval (-2,2) nearby where the generalized entropy return to the classical K-S entropy.

nlin.CD↗