arXiv subjects

Yan Liu

Publications and source records attributed to Yan Liu.

At least 415 records · Page 23Linked to original sources

arXiv2019

Robust reconstruction of fluorescence molecular tomography with an optimized illumination pattern

Fluorescence molecular tomography (FMT) is an emerging powerful tool for biomedical research. There are two factors that influence FMT reconstruction most effectively. The first one is the regularization techniques. Traditional methods such as Tikhonov regularization suffer from low resolution and poor signal to noise ratio. Therefore sparse regularization techniques have been introduced to improve the reconstruction quality. The second factor is the illumination pattern. A better illumination pattern ensures the quantity and quality of the information content of the data set thus leading to better reconstructions. In this work, we take advantage of the discrete formulation of the forward problem to give a rigorous definition of an illumination pattern as well as the admissible set of patterns. We add restrictions in the admissible set as different types of regularizers to a discrepancy functional, generating another inverse problem with the illumination pattern as unknown. Both inverse problems of reconstructing the fluorescence distribution and finding the optimal illumination pattern are solved by fast efficient iterative algorithms. Numerical experiments have shown that with a suitable choice of the regularization parameters the two-step approach converges to an optimal illumination pattern quickly and the reconstruction result is improved significantly, regardless of the initial illumination setting.

eess.IV↗

arXiv2019

GumDrop at the DISRPT2019 Shared Task: A Model Stacking Approach to Discourse Unit Segmentation and Connective Detection

In this paper we present GumDrop, Georgetown University's entry at the DISRPT 2019 Shared Task on automatic discourse unit segmentation and connective detection. Our approach relies on model stacking, creating a heterogeneous ensemble of classifiers, which feed into a metalearner for each final task. The system encompasses three trainable component stacks: one for sentence splitting, one for discourse unit segmentation and one for connective detection. The flexibility of each ensemble allows the system to generalize well to datasets of different sizes and with varying levels of homogeneity.

cs.CL↗

arXiv2019

Optimal p-ary cyclic codes with two zeros

As a subclass of linear codes, cyclic codes have efficient encoding and decoding algorithms, so they are widely used in many areas such as consumer electronics, data storage systems and communication systems. In this paper, we give a general construction of optimal p-ary cyclic codes which leads to three explicit constructions. In addition, another class of p-ary optimal cyclic codes are presented.

cs.IT↗

arXiv2019

From Crowdsourcing to Crowdmining: Using Implicit Human Intelligence for Better Understanding of Crowdsourced Data

With the development of mobile social networks, more and more crowdsourced data are generated on the Web or collected from real-world sensing. The fragment, heterogeneous, and noisy nature of online/offline crowdsourced data, however, makes it difficult to be understood. Traditional content-based analyzing methods suffer from potential issues such as computational intensiveness and poor performance. To address them, this paper presents CrowdMining. In particular, we observe that the knowledge hidden in the process of data generation, regarding individual/crowd behavior patterns (e.g., mobility patterns, community contexts such as social ties and structure) and crowd-object interaction patterns (flickering or tweeting patterns) are neglected in crowdsourced data mining. Therefore, a novel approach that leverages implicit human intelligence (implicit HI) for crowdsourced data mining and understanding is proposed. Two studies titled CrowdEvent and CrowdRoute are presented to showcase its usage, where implicit HIs are extracted either from online or offline crowdsourced data. A generic model for CrowdMining is further proposed based on a set of existing studies. Experiments based on real-world datasets demonstrate the effectiveness of CrowdMining.

cs.HC↗

arXiv2019

Hybrid Low-order and Higher-order Graph Convolutional Networks

With higher-order neighborhood information of graph network, the accuracy of graph representation learning classification can be significantly improved. However, the current higher order graph convolutional network has a large number of parameters and high computational complexity. Therefore, we propose a Hybrid Lower order and Higher order Graph convolutional networks (HLHG) learning model, which uses weight sharing mechanism to reduce the number of network parameters. To reduce computational complexity, we propose a novel fusion pooling layer to combine the neighborhood information of high order and low order. Theoretically, we compare the model complexity of the proposed model with the other state-of-the-art model. Experimentally, we verify the proposed model on the large-scale text network datasets by supervised learning, and on the citation network datasets by semi-supervised learning. The experimental results show that the proposed model achieves highest classification accuracy with a small set of trainable weight parameters.

cs.LG↗

arXiv2019

Asymptotic profiles of solutions for regularity-loss type generalized thermoelastic plate equations and their applications

In this paper, we consider generalized thermoelastic plate equations with Fourier's law of heat conduction. By introducing a threshold for decay properties of regularity-loss, we investigate decay estimates of solutions with/without regularity-loss in a framework of weighted $L^1$ spaces. Furthermore, asymptotic profiles of solutions are obtained by using representations of solutions in the Fourier space, which are derived by employing WKB analysis. Next, we study generalized thermoelastic plate equations with additional structural damping, and analysis the influence of structural damping on decay properties and asymptotic profiles of solutions. We find that the regularity-loss structure is destroyed by structural damping. Finally, we give some applications of our results on thermoelastic plate equations and damped Moore-Gibson-Thompson equation.

math.AP↗

arXiv2019

Evaluating bird collision risk of a high-speed railway crossing the habitat of the crested ibis (Nipponia nippon) in Qinling Mountains, China

Bird collisions with high-speed transport modes is a vital topic on vehicle safety and wildlife protection, especially when high-speed trains, with an average speed of 250km/h, have to run across the habitat of an endangered bird species. This paper evaluates the bird-train collision risk associated with a recent high-speed railway project in Qinling Mountains, China, for the crested ibis (Nipponia nippon) and other local bird species. Using line transect surveys and walking monitoring techniques, we surveyed the population abundance, spatial-temporal distributions, and bridge-crossing behaviors of the birds in the study area. The results show that: (1) The crested ibis and the egret were the two most abundant waterfowl species in the study area. The RAI of these two species were about 43.69% and 42.91%, respectively; (2) Crested ibises overall habitat closer to the railway bridge. 91.63% of them were firstly detected within the range of 0m to 25m of the vicinity of the bridge; (3) the ratio between crossing over and under the railway bridge was about 7:3. Crested ibises were found to prefer to fly over the railway bridge (89.29% of the total crossing activities observed for this species). Egrets were more likely to cross the railway below the bridge, and they accounted for 60.27% of the total observations of crossing under the bridge. We recommend that, while the collision risk of crested ibises could be low, barrier-like structures, such as fences, should still be considered to promote the conservation of multiple bird species in the area. This paper provides a practical case for railway ecology studies in China. To our best knowledge, this is the first high-speed railway project that takes protecting crested ibises as one of the top priorities, and exemplifies the recent nationwide initiative towards the construction of "eco-civilization" in the country.

q-bio.PE↗

arXiv2019

Near 100% CO Selectivity in Nanoscaled Iron-Based Oxygen Carriers for Chemical Looping Methane Partial Oxidation

Chemical looping methane partial oxidation provides an energy and cost effective route for methane utilization. However, there is considerable CO2 co-production in state-of-the-art chemical looping systems, rendering a decreased productivity in value-added fuels or chemicals. In this work, we show that the co-production of CO2 can be dramatically suppressed in methane partial oxidation reactions using iron oxide nanoparticles, with a size of 2~8 nm, as the oxygen carrier. To stabilize these nanoparticles at high temperatures, they are embedded in an ordered, gas-permeable mesoporous silica matrix. We experimentally obtained near 100% CO selectivity in a cyclic redox system at 750°C to 935°C, which is a significantly lower temperature range than in conventional oxygen carrier systems. Density functional theory calculations elucidate the origins for such selectivity and reveal that CH4 adsorption energies decrease with increasing nanoparticle size. These calculations also show that low-coordinated lattice oxygen atoms on the surface of nanoparticles significantly promote Fe-O bond cleavage and CO formation. We envision that embedded nanostructured oxygen carriers have the potential to serve as a general materials platform for achieving 100% selectivity in redox reactions at high temperatures.

physics.chem-ph↗

arXiv2019

A simple and effective postprocessing method for image classification

Whether it is computer vision, natural language processing or speech recognition, the essence of these applications is to obtain powerful feature representations that make downstream applications completion more efficient. Taking image recognition as an example, whether it is hand-crafted low-level feature representation or feature representation extracted by a convolutional neural networks(CNNs), the goal is to extract features that better represent image features, thereby improving classification accuracy. However, we observed that image feature representations share a large common vector and a few top dominating directions. To address this problems, we propose a simple but effective postprocessing method to render off-the-shelf feature representations even stronger by eliminating the common mean vector from off-the-shelf feature representations. The postprocessing is empirically validated on a variety of datasets and feature extraction methods.such as VGG, LBP, and HOG. Some experiments show that the features that have been post-processed by postprocessing algorithm can get better results than original ones.

cs.CV↗

arXiv2019

Extracting Interpretable Concept-Based Decision Trees from CNNs

In an attempt to gather a deeper understanding of how convolutional neural networks (CNNs) reason about human-understandable concepts, we present a method to infer labeled concept data from hidden layer activations and interpret the concepts through a shallow decision tree. The decision tree can provide information about which concepts a model deems important, as well as provide an understanding of how the concepts interact with each other. Experiments demonstrate that the extracted decision tree is capable of accurately representing the original CNN's classifications at low tree depths, thus encouraging human-in-the-loop understanding of discriminative concepts.

cs.LG↗

arXiv2019

Community Detection Based on the $L_\infty$ convergence of eigenvectors in DCBM

Spectral clustering is one of the most popular algorithms for community detection in network analysis. Based on this rationale, in this paper we give the convergence rate of eigenvectors for the adjacency matrix in the $l_\infty$ norm, under the stochastic block model (BM) and degree corrected stochastic block model (DCBM), adding some mild and rational conditions. We also extend this result to a more general model, presented based on the DCBM such that the value of random variables in the adjacency matrix is not 0 or 1, but an arbitrary real number. During the process of proving the above conclusion, we obtain the relationship of the eigenvalues in the adjacency matrix and the corresponding `population' matrix, which vary in dimension from the community-wise edge probability matrix. Using that result, we can give an estimate of the number of the communities in a known set of network data. Meanwhile we proved the consistency of the estimator. Furthermore, according to the derivation of proof for the convergence of eigenvectors, we propose a new approach to community detection -- Spectral Clustering based on Difference of Ratios of Eigenvectors (SCDRE). Our simulation experiments demonstrate the superiority of our method in community detection.

math.ST↗

arXiv2019

D$^2$-City: A Large-Scale Dashcam Video Dataset of Diverse Traffic Scenarios

Driving datasets accelerate the development of intelligent driving and related computer vision technologies, while substantial and detailed annotations serve as fuels and powers to boost the efficacy of such datasets to improve learning-based models. We propose D$^2$-City, a large-scale comprehensive collection of dashcam videos collected by vehicles on DiDi's platform. D$^2$-City contains more than 10000 video clips which deeply reflect the diversity and complexity of real-world traffic scenarios in China. We also provide bounding boxes and tracking annotations of 12 classes of objects in all frames of 1000 videos and detection annotations on keyframes for the remainder of the videos. Compared with existing datasets, D$^2$-City features data in varying weather, road, and traffic conditions and a huge amount of elaborate detection and tracking annotations. By bringing a diverse set of challenging cases to the community, we expect the D$^2$-City dataset will advance the perception and related areas of intelligent driving.

cs.LG↗

arXiv2019

On the stability of self-adjointness of linear relations

This paper focuses on the stability of self-adjointness of linear relations under perturbations in Hilbert spaces. It is shown that a self-adjoint relation is still self-adjoint under bounded and relatively bounded perturbations. The results obtained in the present paper generalize the corresponding results for linear operators to linear relations, and some weaken the conditions of the related existing results.

math.SP↗

arXiv2019

A penalized likelihood approach for efficiently estimating a partially linear additive transformation model with current status data

Current status data are commonly encountered in medical and epidemiological studies in which the failure time for study units is the outcome variable of interest. Data of this form are characterized by the fact that the failure time is not directly observed but rather is known relative to an observation time; i.e., the failure times are either left- or right-censored. Due to its structure, the analysis of such data can be challenging. To circumvent these challenges and to provide for a flexible modeling construct which can be used to analyze current status data, herein, a partially linear additive transformation model is proposed. In the formulation of this model, constrained $B$-splines are employed to model the monotone transformation function and nonlinear covariate effects. To provide for more efficient estimates, a penalization technique is used to regularize the estimation of all unknown functions. An easy to implement hybrid algorithm is developed for model fitting and a simple estimator of the large-sample variance-covariance matrix is proposed. It is shown theoretically that the proposed estimators of the finite-dimensional regression coefficients are root-$n$ consistent, asymptotically normal, and achieve the semi-parametric information bound while the estimators of the nonparametric components attain the optimal rate of convergence. The finite-sample performance of the proposed methodology is evaluated through extensive numerical studies and is further demonstrated through the analysis of uterine leiomyomata data.

stat.ME↗

arXiv2019

Instance-Based Classification through Hypothesis Testing

Classification is a fundamental problem in machine learning and data mining. During the past decades, numerous classification methods have been presented based on different principles. However, most existing classifiers cast the classification problem as an optimization problem and do not address the issue of statistical significance. In this paper, we formulate the binary classification problem as a two-sample testing problem. More precisely, our classification model is a generic framework that is composed of two steps. In the first step, the distance between the test instance and each training instance is calculated to derive two distance sets. In the second step, the two-sample test is performed under the null hypothesis that the two sets of distances are drawn from the same cumulative distribution. After these two steps, we have two p-values for each test instance and the test instance is assigned to the class associated with the smaller p-value. Essentially, the presented classification method can be regarded as an instance-based classifier based on hypothesis testing. The experimental results on 40 real data sets show that our method is able to achieve the same level performance as the state-of-the-art classifiers and has significantly better performance than existing testing-based classifiers. Furthermore, we can handle outlying instances and control the false discovery rate of test instances assigned to each class under the same framework.

cs.LG↗

arXiv2019

Revisit of constraints on dark energy with Hubble parameter measurements including future redshift drift observations

We investigate whether the current Hubble parameter $H(z)$ measurements could help improve the constraints on dark energy on the basis of the mainstream cosmological probes including the type Ia supernovae (SN) observation, the cosmic microwave background anisotropies (CMB) observation, and the baryon acoustic oscillations (BAO) observation. For the current $H(z)$ data, we use 30 data points measured by using a differential age method. Furthermore, we also consider the future $H(z)$ measurements based on the Sandage-Loeb (SL) test by means of the E-ELT in construction, and thus we also use 30 simulated $H(z)$ data according to a 10-year SL test observation. In this work, we choose four typical dark energy models as examples, i.e., the $Λ$CDM model, the $w$CDM model, the $α$DE model, and the GCG model, to complete the analysis. We find that, when only the current $H(z)$ data are added, the constraints on these models are not improved compared to the cases using the SN+CMB+BAO data; but when further adding the 10-year SL test data, the constraint results are tremendously improved for all the four models. Therefore, we conclude that, although the current $H(z)$ measurements could not provide an evident improvement on the basis of the current mainstream cosmological probes, the future $H(z)$ measurements from the SL test would have enormous potential to change the status of the Hubble parameter measurements in constraining dark energy.

astro-ph.CO↗

arXiv2019

Invariance of deficiency indices of Hermitian subspaces under relatively bounded perturbations

This paper is concerned with the stability of deficiency indices of Hermitian subspaces (i.e., linear relations) under relatively bounded perturbations in Hilbert spaces. Several results about invariance of deficiency indices of Hermitian subspaces under relatively bounded perturbations are established. As a consequence, invariance of self-adjointness of Hermitian subspaces under relatively bounded perturbations is obtained. In addition, it is shown that the deficiency indices may shrink in the special case that the relative bound is equal to 1. The results obtained in the present paper generalize the corresponding results for symmetric operators to more general Hermitian subspaces.

math.SP↗

arXiv2019

Correlation-Based Community Detection

Mining community structures from the complex network is an important problem across a variety of fields. Many existing community detection methods detect communities through optimizing a community evaluation function. However, most of these functions even have high values on random graphs and may fail to detect small communities in the large-scale network (the so-called resolution limit problem). In this paper, we introduce two novel node-centric community evaluation functions by connecting correlation analysis with community detection. We will further show that the correlation analysis can provide a novel theoretical framework which unifies some existing evaluation functions in the context of a correlation-based optimization problem. In this framework, we can mitigate the resolution limit problem and eliminate the influence of random fluctuations by selecting the right correlation function. Furthermore, we introduce three key properties used in mining association rule into the context of community detection to help us choose the appropriate correlation function. Based on our introduced correlation functions, we propose a community detection algorithm called CBCD. Our proposed algorithm outperforms existing state-of-the-art algorithms on both synthetic benchmark networks and real-world networks.

cs.SI↗