arXiv subjects

Guoliang Li

Publications and source records attributed to Guoliang Li.

At least 181 records · Page 10Linked to original sources

arXiv2018

ELUCID V. Lighting dark matter halos with galaxies

In a recent study, using the distribution of galaxies in the north galactic pole of SDSS DR7 region enclosed in a 500$\mpch$ box, we carried out our ELUCID simulation (Wang et al. 2016, ELUCID III). Here we {\it light} the dark matter halos and subhalos in the reconstructed region in the simulation with galaxies in the SDSS observations using a novel {\it neighborhood} abundance matching method. Before we make use of thus established galaxy-subhalo connections in the ELUCID simulation to evaluate galaxy formation models, we set out to explore the reliability of such a link. For this purpose, we focus on the following a few aspects of galaxies: (1) the central-subhalo luminosity and mass relations; (2) the satellite fraction of galaxies; (3) the conditional luminosity function (CLF) and conditional stellar mass function (CSMF) of galaxies; and (4) the cross correlation functions between galaxies and the dark matter particles, most of which are measured separately for all, red and blue galaxy populations. We find that our neighborhood abundance matching method accurately reproduces the central-subhalo relations, satellite fraction, the CLFs and CSMFs and the biases of galaxies. These features ensure that thus established galaxy-subhalo connections will be very useful in constraining galaxy formation processes. And we provide some suggestions on the three levels of using the galaxy-subhalo pairs for galaxy formation constraints. The galaxy-subhalo links and the subhalo merger trees in the SDSS DR7 region extracted from our ELUCID simulation are available upon request.

astro-ph.GA↗

arXiv2018

PANDA: Facilitating Usable AI Development

Recent advances in artificial intelligence (AI) and machine learning have created a general perception that AI could be used to solve complex problems, and in some situations over-hyped as a tool that can be so easily used. Unfortunately, the barrier to realization of mass adoption of AI on various business domains is too high because most domain experts have no background in AI. Developing AI applications involves multiple phases, namely data preparation, application modeling, and product deployment. The effort of AI research has been spent mostly on new AI models (in the model training stage) to improve the performance of benchmark tasks such as image recognition. Many other factors such as usability, efficiency and security of AI have not been well addressed, and therefore form a barrier to democratizing AI. Further, for many real world applications such as healthcare and autonomous driving, learning via huge amounts of possibility exploration is not feasible since humans are involved. In many complex applications such as healthcare, subject matter experts (e.g. Clinicians) are the ones who appreciate the importance of features that affect health, and their knowledge together with existing knowledge bases are critical to the end results. In this paper, we take a new perspective on developing AI solutions, and present a solution for making AI usable. We hope that this resolution will enable all subject matter experts (eg. Clinicians) to exploit AI like data scientists.

cs.AI↗

arXiv2017

Removing the Impact of Correlated PSF Uncertainties in Weak Lensing

Accurate reconstruction of the spatial distributions of the Point Spread Function (PSF) is crucial for high precision cosmic shear measurements. Nevertheless, current methods are not good at recovering the PSF fluctuations of high spatial frequencies. In general, the residual PSF fluctuations are spatially correlated, therefore can significantly contaminate the correlation functions of the weak lensing signals. We propose a method to correct for this contamination statistically, without any assumptions on the PSF and galaxy morphologies or their spatial distribution. We demonstrate our idea with the data from the W2 field of CFHTLenS.

astro-ph.CO↗

arXiv2017

An accurate centroid algorithm for PSF reconstruction

In this work, we present a novel centroiding method based on Fourier space Phase Fitting(FPF) for Point Spread Function(PSF) reconstruction. We generate two sets of simulations to test our method. The first set is generated by GalSim with elliptical Moffat profile and strong anisotropy which shifts the center of the PSF. The second set of simulation is drawn from CFHT i band stellar imaging data. We find non-negligible anisotropy from CFHT stellar images, which leads to $\sim$0.08 scatter in unit of pixels using polynomial fitting method Vakili and Hogg (2016). And we apply FPF method to estimate the centroid in real space, this scatter reduces to $\sim$0.04 in SNR=200 CFHT like sample. In low SNR (50 and 100) CFHT like samples, the background noise dominates the shifting of the centroid, therefore the scatter estimated from different methods are similar. We compare polynomial fitting and FPF using GalSim simulation with optical anisotropy. We find that in all SNR$\sim$50, 100 and 200) samples, FPF performs better than polynomial fitting by a factor of $\sim$3. In general, we suggest that in real observations there are anisotropy which shift the centroid, and FPF method is a better way to accurately locate it.

astro-ph.IM↗

arXiv2017

ELUCID IV: Galaxy Quenching and its Relation to Halo Mass, Environment, and Assembly Bias

We examine the quenched fraction of central and satellite galaxies as a function of galaxy stellar mass, halo mass, and the matter density of their large scale environment. Matter densities are inferred from our ELUCID simulation, a constrained simulation of local Universe sampled by SDSS, while halo masses and central/satellite classification are taken from the galaxy group catalog of Yang et al. The quenched fraction for the total population increases systematically with the three quantities. We find that the `environmental quenching efficiency', which quantifies the quenched fraction as function of halo mass, is independent of stellar mass. And this independence is the origin of the stellar mass-independence of density-based quenching efficiency, found in previous studies. Considering centrals and satellites separately, we find that the two populations follow similar correlations of quenching efficiency with halo mass and stellar mass, suggesting that they have experienced similar quenching processes in their host halo. We demonstrate that satellite quenching alone cannot account for the environmental quenching efficiency of the total galaxy population and the difference between the two populations found previously mainly arises from the fact that centrals and satellites of the same stellar mass reside, on average, in halos of different mass. After removing these halo-mass and stellar-mass effects, there remains a weak, but significant, residual dependence on environmental density, which is eliminated when halo assembly bias is taken into account. Our results therefore indicate that halo mass is the prime environmental parameter that regulates the quenching of both centrals and satellites.

astro-ph.GA↗

arXiv2017

T-Crowd: Effective Crowdsourcing for Tabular Data

Crowdsourcing employs human workers to solve computer-hard problems, such as data cleaning, entity resolution, and sentiment analysis. When crowdsourcing tabular data, e.g., the attribute values of an entity set, a worker's answers on the different attributes (e.g., the nationality and age of a celebrity star) are often treated independently. This assumption is not always true and can lead to suboptimal crowdsourcing performance. In this paper, we present the T-Crowd system, which takes into consideration the intricate relationships among tasks, in order to converge faster to their true values. Particularly, T-Crowd integrates each worker's answers on different attributes to effectively learn his/her trustworthiness and the true data values. The attribute relationship information is also used to guide task allocation to workers. Finally, T-Crowd seamlessly supports categorical and continuous attributes, which are the two main datatypes found in typical databases. Our extensive experiments on real and synthetic datasets show that T-Crowd outperforms state-of-the-art methods in terms of truth inference and reducing the cost of crowdsourcing.

cs.DB↗

arXiv2017

Testing PSF Interpolation In Weak Lensing With Real Data

Reconstruction of the point spread function (PSF) is a critical process in weak lensing measurement. We develop a real-data based and galaxy-oriented pipeline to compare the performances of various PSF reconstruction schemes. Making use of a large amount of the CFHTLenS data, the performances of three classes of interpolating schemes - polynomial, Kriging, and Shepard - are evaluated. We find that polynomial interpolations with optimal orders and domains perform the best. We quantify the effect of the residual PSF reconstruction error on shear recovery in terms of the multiplicative and additive biases, and their spatial correlations using the shear measurement method of Zhang et al. (2015). We find that the impact of PSF reconstruction uncertainty on the shear-shear correlation can be significantly reduced by cross correlating the shear estimators from different exposures. It takes only 0.2 stars (SNR > 100) per square arcmin on each exposure to reach the best performance of PSF interpolation, a requirement that is generally satisfied in the CFHTlenS data.

astro-ph.CO↗

arXiv2016

The Point Spread Function Reconstruction by Using Moffatlets - I

The shear measurement is a crucial task in the current and the future weak lensing survey projects. And the reconstruction of the point spread function(PSF) is one of the essential steps. In this work, we present three different methods, including Gaussianlets, Moffatlets and EMPCA to quantify their efficiency on PSF reconstruction using four sets of simulated LSST star images. Gaussianlets and Moffatlets are two different sets of basis functions whose profiles are based on Gaussian and Moffat functions respectively. Expectation Maximization(EM) PCA is a statistical method performing iterative procedure to find principal components of an ensemble of star images. Our tests show that: 1) Moffatlets always perform better than Gaussianlets. 2) EMPCA is more compact and flexible, but the noise existing in the Principal Components (PCs) will contaminate the size and ellipticity of PSF while Moffatlets keeps them very well.

astro-ph.IM↗

arXiv2015

RFP: A Remote Fetching Paradigm for RDMA-Accelerated Systems

Remote Direct Memory Access (RDMA) is an efficient way to improve the performance of traditional client-server systems. Currently, there are two main design paradigms for RDMA-accelerated systems. The first allows the clients to directly operate the server's memory and totally bypasses the CPUs at server side. The second follows the traditional server-reply paradigm, which asks the server to write results back to the clients. However, the first method has to expose server's memory and needs tremendous re-design of upper-layer software, which is complex, unsafe, error-prone, and inefficient. The second cannot achieve high input/output operations per second (IOPS), because it employs out-bound RDMA-write at server side which is not efficient. We find that the performance of out-bound RDMA-write and in-bound RDMA-read is asymmetric and the latter is 5 times faster than the former. Based on this observation, we propose a novel design paradigm named Remote Fetching Paradigm (RFP). In RFP, the server is still responsible for processing requests from the clients. However, counter-intuitively, instead of sending results back to the clients through out-bound RDMA-write, the server only writes the results in local memory buffers, and the clients use in-bound RDMA-read to remotely fetch these results. Since in-bound RDMA-read achieves much higher IOPS than out-bound RDMA-write, our model is able to bring higher performance than the traditional models. In order to prove the effectiveness of RFP, we design and implement an RDMA-accelerated in-memory key-value store following the RFP model. To further improve the IOPS, we propose an optimization mechanism that combines status checking and result fetching. Experiment results show that RFP can improve the IOPS by 160%~310% against state-of-the-art models for in-memory key-value stores.

cs.DC↗

arXiv2015

NXgraph: An Efficient Graph Processing System on a Single Machine

Recent studies show that graph processing systems on a single machine can achieve competitive performance compared with cluster-based graph processing systems. In this paper, we present NXgraph, an efficient graph processing system on a single machine. With the abstraction of vertex intervals and edge sub-shards, we propose the Destination-Sorted Sub-Shard (DSSS) structure to store a graph. By dividing vertices and edges into intervals and sub-shards, NXgraph ensures graph data access locality and enables fine-grained scheduling. By sorting edges within each sub-shard according to their destination vertices, NXgraph reduces write conflicts among different threads and achieves a high degree of parallelism. Then, three updating strategies, i.e., Single-Phase Update (SPU), Double-Phase Update (DPU), and Mixed-Phase Update (MPU), are proposed in this paper. NXgraph can adaptively choose the fastest strategy for different graph problems according to the graph size and the available memory resources to fully utilize the memory space and reduce the amount of data transfer. All these three strategies exploit streamlined disk access pattern. Extensive experiments on three real-world graphs and five synthetic graphs show that NXgraph can outperform GraphChi, TurboGraph, VENUS, and GridGraph in various situations. Moreover, NXgraph, running on a single commodity PC, can finish an iteration of PageRank on the Twitter graph with 1.5 billion edges in 2.05 seconds; while PowerGraph, a distributed graph processing system, needs 3.6s to finish the same task.

cs.DB↗

arXiv2015

Characterizing localized surface plasmons using electron energy-loss spectroscopy

Electron energy-loss spectroscopy (EELS) offers a window to view nanoscale properties and processes. When performed in a scanning transmission electron microscope, EELS can simultaneously render images of nanoscale objects with sub-nanometer spatial resolution and correlate them with spectroscopic information of $\sim10 - 100$ meV spectral resolution. Consequently, EELS is a near-perfect tool for understanding the optical and electronic properties of individual and few-particle plasmonic metal nanoparticles assemblies, which are significant in a wide range of fields. This review presents an overview of basic plasmonics and EELS theory and highlights several recent noteworthy experiments involving the electron-beam interrogation of plasmonic metal nanoparticle systems.

cond-mat.mes-hall↗

arXiv2014

Leveraging Transitive Relations for Crowdsourced Joins

The development of crowdsourced query processing systems has recently attracted a significant attention in the database community. A variety of crowdsourced queries have been investigated. In this paper, we focus on the crowdsourced join query which aims to utilize humans to find all pairs of matching objects from two collections. As a human-only solution is expensive, we adopt a hybrid human-machine approach which first uses machines to generate a candidate set of matching pairs, and then asks humans to label the pairs in the candidate set as either matching or non-matching. Given the candidate pairs, existing approaches will publish all pairs for verification to a crowdsourcing platform. However, they neglect the fact that the pairs satisfy transitive relations. As an example, if $o_1$ matches with $o_2$, and $o_2$ matches with $o_3$, then we can deduce that $o_1$ matches with $o_3$ without needing to crowdsource $(o_1, o_3)$. To this end, we study how to leverage transitive relations for crowdsourced joins. We propose a hybrid transitive-relations and crowdsourcing labeling framework which aims to crowdsource the minimum number of pairs to label all the candidate pairs. We prove the optimal labeling order in an ideal setting and propose a heuristic labeling order in practice. We devise a parallel labeling algorithm to efficiently crowdsource the pairs following the order. We evaluate our approaches in both simulated environment and a real crowdsourcing platform. Experimental results show that our approaches with transitive relations can save much more money and time than existing methods, with a little loss in the result quality.

cs.DB↗

arXiv2014

The Expected Optimal Labeling Order Problem for Crowdsourced Joins and Entity Resolution

In the SIGMOD 2013 conference, we published a paper extending our earlier work on crowdsourced entity resolution to improve crowdsourced join processing by exploiting transitive relationships [Wang et al. 2013]. The VLDB 2014 conference has a paper that follows up on our previous work [Vesdapunt et al., 2014], which points out and corrects a mistake we made in our SIGMOD paper. Specifically, in Section 4.2 of our SIGMOD paper, we defined the "Expected Optimal Labeling Order" (EOLO) problem, and proposed an algorithm for solving it. We incorrectly claimed that our algorithm is optimal. In their paper, Vesdapunt et al. show that the problem is actually NP-Hard, and based on that observation, propose a new algorithm to solve it. In this note, we would like to put the Vesdapunt et al. results in context, something we believe that their paper does not adequately do.

cs.DB↗

arXiv2013

Gravitational lensing effects on sub-millimetre galaxy counts

We study the effects on the number counts of sub-millimetre galaxies due to gravitational lensing. We explore the effects on the magnification cross section due to halo density profiles, ellipticity and cosmological parameter (the power-spectrum normalisation $σ_8$). We show that the ellipticity does not strongly affect the magnification cross section in gravitational lensing while the halo radial profiles do. Since the baryonic cooling effect is stronger in galaxies than clusters, galactic haloes are more concentrated. In light of this, a new scenario of two halo population model is explored where galaxies are modeled as a singular isothermal sphere profile and clusters as a Navarro, Frenk and White (NFW) profile. We find the transition mass between the two has modest effects on the lensing probability. The cosmological parameter $σ_8$ alters the abundance of haloes and therefore affects our results. Compared with other methods, our model is simpler and more realistic. The conclusions of previous works is confirm that gravitational lensing is a natural explanation for the number count excess at the bright end.

astro-ph.CO↗

arXiv2012

Breaking Out The XML MisMatch Trap

In keyword search, when user cannot get what she wants, query refinement is needed and reason can be various. We first give a thorough categorization of the reason, then focus on solving one category of query refinement problem in the context of XML keyword search, where what user searches for does not exist in the data. We refer to it as the MisMatch problem in this paper. Then we propose a practical way to detect the MisMatch problem and generate helpful suggestions to users. Our approach can be viewed as a post-processing job of query evaluation, and has three main features: (1) it adopts both the suggested queries and their sample results as the output to user, helping user judge whether the MisMatch problem is solved without consuming all query results; (2) it is portable in the sense that it can work with any LCA-based matching semantics and orthogonal to the choice of result retrieval method adopted; (3) it is lightweight in the way that it occupies a very small proportion of the whole query evaluation time. Extensive experiments on three real datasets verify the effectiveness, efficiency and scalability of our approach. An online XML keyword search engine called XClear that embeds the MisMatch problem detector and suggester has been built.

cs.DB↗

arXiv2012

Fast Shape Estimation for Galaxies and Stars

Model fitting is frequently used to determine the shape of galaxies and the point spread function, for examples, in weak lensing analyses or morphology studies aiming at probing the evolution of galaxies. However, the number of parameters in the model, as well as the number of objects, are often so large as to limit the use of model fitting for future large surveys. In this article, we propose a set of algorithms to speed up the fitting process. Our approach is divided into three distinctive steps: centroiding, ellipticity measurement, and profile fitting. We demonstrate that we can derive the position and ellipticity of an object analytically in the first two steps and thus leave only a small number of parameters to be derived through model fitting. The position, ellipticity, and shape parameters can then used in constructing orthonomal basis functions such as sérsiclets for better galaxy image reconstruction. We assess the efficiency and accuracy of the algorithms with simulated images. We have not taken into account the deconvolution of the point spread function, which most weak lensing analyses do.

astro-ph.CO↗

arXiv2012

SEAL: Spatio-Textual Similarity Search

Location-based services (LBS) have become more and more ubiquitous recently. Existing methods focus on finding relevant points-of-interest (POIs) based on users' locations and query keywords. Nowadays, modern LBS applications generate a new kind of spatio-textual data, regions-of-interest (ROIs), containing region-based spatial information and textual description, e.g., mobile user profiles with active regions and interest tags. To satisfy search requirements on ROIs, we study a new research problem, called spatio-textual similarity search: Given a set of ROIs and a query ROI, we find the similar ROIs by considering spatial overlap and textual similarity. Spatio-textual similarity search has many important applications, e.g., social marketing in location-aware social networks. It calls for an efficient search method to support large scales of spatio-textual data in LBS systems. To this end, we introduce a filter-and-verification framework to compute the answers. In the filter step, we generate signatures for the ROIs and the query, and utilize the signatures to generate candidates whose signatures are similar to that of the query. In the verification step, we verify the candidates and identify the final answers. To achieve high performance, we generate effective high-quality signatures, and devise efficient filtering algorithms as well as pruning techniques. Experimental results on real and synthetic datasets show that our method achieves high performance.

cs.DB↗

arXiv2011

PASS-JOIN: A Partition-based Method for Similarity Joins

As an essential operation in data cleaning, the similarity join has attracted considerable attention from the database community. In this paper, we study string similarity joins with edit-distance constraints, which find similar string pairs from two large sets of strings whose edit distance is within a given threshold. Existing algorithms are efficient either for short strings or for long strings, and there is no algorithm that can efficiently and adaptively support both short strings and long strings. To address this problem, we propose a partition-based method called Pass-Join. Pass-Join partitions a string into a set of segments and creates inverted indices for the segments. Then for each string, Pass-Join selects some of its substrings and uses the selected substrings to find candidate pairs using the inverted indices. We devise efficient techniques to select the substrings and prove that our method can minimize the number of selected substrings. We develop novel pruning techniques to efficiently verify the candidate pairs. Experimental results show that our algorithms are efficient for both short strings and long strings, and outperform state-of-the-art methods on real datasets.

cs.DB↗