arXiv subjects

Feng Shi

Publications and source records attributed to Feng Shi.

At least 73 records · Page 4Linked to original sources

arXiv2021

Two-Grid Domain Decomposition Methods for the Coupled Stokes-Darcy System

In this paper, we propose two novel Robin-type domain decomposition methods based on the two-grid techniques for the coupled Stokes-Darcy system. Our schemes firstly adopt the existing Robin-type domain decomposition algorithm to obtain the coarse grid approximate solutions. Then two modified domain decomposition methods are further constructed on the fine grid by utilizing the framework of two-grid methods to enhance computational efficiency, via replacing some interface terms by the coarse grid information. The natural idea of using the two-grid frame to optimize the domain decomposition method inherits the best features of both methods and can overcome some of the domain decomposition deficits. The resulting schemes can be implemented easily using many existing mature solvers or codes in a flexible way, which are much effective under smaller mesh sizes or some realistic physical parameters. Moreover, several error estimates are carried out to show the stability and convergence of the schemes. Finally, three numerical experiments are performed and compared with the classical two-grid method, which verifies the validation and efficiency of the proposed algorithms.

math.NA↗

arXiv2021

Emergent gravity fails to explain color-dependent galaxy-galaxy lensing signals from SDSS Dr7

We test the Emergent Gravity(EG) theory using the galaxy-galaxy lensing technique based on SDSS DR7 data. In the EG scenario, we do not expect color dependence of the galaxy sample in the 'apparent dark matter' predicted by EG, which is exerted only by the baryonic mass. If the baryonic mass is similar, then the predicted lensing profiles from the baryonic mass should be similar according to the EG, regardless of the color of the galaxy sample. We use the stellar mass of the galaxy as a proxy of its baryonic mass. We divide our galaxy sample into 5 stellar mass bins, and further classify them as red and blue subsamples in each stellar mass bin. If we set halo mass and concentration as free parameters, $Λ$CDM is favored by our data in terms of the reduced $χ^2$ while EG fails to explain the color dependence of ESDs from the galaxy-galaxy lensing measurement.

astro-ph.GA↗

arXiv2021

Rigidity percolation in random 3D rod systems

In composite materials composed of soft polymer matrix and stiff, high-aspect-ratio particles, the composite undergoes a transition in mechanical strength when the inclusion phase surpasses a critical density. This phenomenon (rheological or mechanical percolation) is well-known to occur in many composites at a critical density that exceeds the conductivity percolation threshold. Conductivity percolation occurs as a consequence of contact percolation, which refers to the conducting particles' formation of a connected component that spans the composite. Rheological percolation, however, has evaded a complete theoretical explanation and predictive description. A natural hypothesis is that rheological percolation arises due to rigidity percolation, whereby a rigid component of inclusions spans the composite. We model composites as random isotropic dispersions of soft-core rods, and study rigidity percolation in such systems. Building on previous results for two-dimensional systems, we develop an approximate algorithm that identifies spanning rigid components through iteratively identifying and compressing provably rigid motifs -- equivalently, decomposing giant rigid components into rigid assemblies of successively smaller rigid components. We apply this algorithm to random rod systems to estimate a rigidity percolation threshold and explore its dependence on rod aspect ratio. We show that this transition point, like the contact percolation transition point, scales inversely with the average (aspect ratio-dependent) rod excluded volume. However, the scaling of the rigidity percolation threshold, unlike the contact percolation scaling, is valid for relatively low aspect ratio. Moreover, the critical rod contact number is constant for aspect ratio above some relatively low value; and lies below the prediction from Maxwell's isostatic condition.

cond-mat.soft↗

arXiv2021

A novel multiple instance learning framework for COVID-19 severity assessment via data augmentation and self-supervised learning

How to fast and accurately assess the severity level of COVID-19 is an essential problem, when millions of people are suffering from the pandemic around the world. Currently, the chest CT is regarded as a popular and informative imaging tool for COVID-19 diagnosis. However, we observe that there are two issues -- weak annotation and insufficient data that may obstruct automatic COVID-19 severity assessment with CT images. To address these challenges, we propose a novel three-component method, i.e., 1) a deep multiple instance learning component with instance-level attention to jointly classify the bag and also weigh the instances, 2) a bag-level data augmentation component to generate virtual bags by reorganizing high confidential instances, and 3) a self-supervised pretext component to aid the learning process. We have systematically evaluated our method on the CT images of 229 COVID-19 cases, including 50 severe and 179 non-severe cases. Our method could obtain an average accuracy of 95.8%, with 93.6% sensitivity and 96.4% specificity, which outperformed previous works.

eess.IV↗

arXiv2020

Semantic Networks for Engineering Design: A Survey

There have been growing uses of semantic networks in the past decade, such as leveraging large-scale pre-trained graph knowledge databases for various natural language processing (NLP) tasks in engineering design research. Therefore, the paper provides a survey of the research that has employed semantic networks in the engineering design research community. The survey reveals that engineering design researchers have primarily relied on WordNet, ConceptNet, and other common-sense semantic network databases trained on non-engineering data sources to develop methods or tools for engineering design. Meanwhile, there are emerging efforts to mine large scale technical publication and patent databases to construct engineering-contextualized semantic network databases, e.g., B-Link and TechNet, to support NLP in engineering design. On this basis, we recommend future research directions for the construction and applications of engineering-related semantic networks in engineering design research and practice.

cs.DL↗

arXiv2020

Expandable Local and Parallel Two-Grid Finite Element Scheme for the Stokes Equations

In this paper, we present a novel local and parallel two-grid finite element scheme for solving the Stokes equations, and rigorously establish its a priori error estimates. The scheme admits simultaneously small scales of subproblems and distances between subdomains and its expansions, and hence can be expandable. Based on the a priori error estimates, we provide a corresponding iterative scheme with suitable iteration number. The resulting iterative scheme can reach the optimal convergence orders within specific two-grid iterations ($O(|\ln H|^2)$ in 2-D and $O(|\ln H|)$ in 3-D) if the coarse mesh size $H$ and the fine mesh size $h$ are properly chosen. Finally, some numerical tests including 2-D and 3-D cases are carried out to verify our theoretical results.

math.NA↗

arXiv2020

Vertical-Horizontal Structured Attention for Generating Music with Chords

In this paper, we propose a lightweight music-generating model based on variational autoencoder (VAE) with structured attention. Generating music is different from generating text because the melodies with chords give listeners distinguished polyphonic feelings. In a piece of music, a chord consisting of multiple notes comes from either the mixture of multiple instruments or the combination of multiple keys of a single instrument. We focus our study on the latter. Our model captures not only the temporal relations along time but the structure relations between keys. Experimental results show that our model has a better performance than baseline MusicVAE in capturing notes in a chord. Besides, our method accords with music theory since it maintains the configuration of the circle of fifths, distinguishes major and minor keys from interval vectors, and manifests meaningful structures between music phrases.

cs.SD↗

arXiv2020

HIR4: Cosmological signatures imprinted on the cross correlation between 21-cm map and galaxy clustering

We explore the cosmological multitracer synergies between an emission line galaxy distribution from the Dark Energy Spectroscopic Instrument and a Tianlai Project 21-cm intensity map. We use simulated maps generated from a particle simulation in the light-cone volume (Horizon Run 4), sky-trimmed and including the effects of foreground contamination, its removal and instrument noise. We first validate how the foreground residual affects the recovered 21-cm signal by putting different levels of foreground contamination into the 21-cm maps. We find that the contamination cannot be ignored in the angular autocorrelation power spectra of HI even when it is small, but has no influence on the accuracy of the angular cross-power spectra between HI and galaxies. In the foreground-cleaned map case, as information is lost in the cleaning procedure, there is also a bias in the cross-correlation power spectrum. However, we found that the bias from the cross-correlation power spectrum is scale-independent, which is easily parameterized as part of the model, while the offset in the HI autocorrelation power spectrum is non-linear. In particular, we tested that the cross-correlation power also benefits from the cancellation of the bias in the power spectrum measurement that is induced by the instrument noise, which changes the shape of the autocorrelation power spectra but leaves the cross-correlation power unaffected. We then modelled the angular cross-correlation power spectra to fit the baryon acoustic oscillation feature in the broad-band shape of the angular cross-correlation power spectrum, including contamination from the residual foreground and the effect of instrument noise. We forecast a constraint on the angular diameter distance $D_\mathrm{A}$ for the Tianlai Pathfinder redshift $0.775<z<1.03$, giving a distance measurement with a precision of 2.7\% at that redshift.

astro-ph.CO↗

arXiv2020

Assessing Road Traffic Safety During COVID-19: Inequality, Irregularity, and Severity

COVID-19 is affecting every social sector significantly, including human mobility and subsequently road traffic safety. In this study, we analyze the impact of the pandemic on traffic accidents using two cities, namely Los Angeles and New York City in the U.S., as examples. Specifically, we have analyzed traffic accidents associated with various demographic groups, how traffic accidents are distributed in time and space, and the severity level of traffic accidents that both involve and do not involve other transportation modes (e.g., pedestrians and motorists). We have made the following observations: 1) the pandemic has disproportionately affected certain age groups, races, and genders; 2) the "hotspots" of traffic accidents have been shifted in both time and space compared to time periods that are prior to the pandemic, demonstrating irregularity; and 3) the number of non-fatal accident cases has decreased but the number of severe and fatal cases of traffic accidents remains the same under the pandemic.

physics.soc-ph↗

arXiv2020

Structured Attention for Unsupervised Dialogue Structure Induction

Inducing a meaningful structural representation from one or a set of dialogues is a crucial but challenging task in computational linguistics. Advancement made in this area is critical for dialogue system design and discourse analysis. It can also be extended to solve grammatical inference. In this work, we propose to incorporate structured attention layers into a Variational Recurrent Neural Network (VRNN) model with discrete latent states to learn dialogue structure in an unsupervised fashion. Compared to a vanilla VRNN, structured attention enables a model to focus on different parts of the source sentence embeddings while enforcing a structural inductive bias. Experiments show that on two-party dialogue datasets, VRNN with structured attention learns semantic structures that are similar to templates used to generate this dialogue corpus. While on multi-party dialogue datasets, our model learns an interactive structure demonstrating its capability of distinguishing speakers or addresses, automatically disentangling dialogues without explicit human annotation.

cs.CL↗

arXiv2020

HIR4: cosmology from a simulated neutral hydrogen full sky using Horizon Run 4

The distribution of cosmological neutral hydrogen will provide a new window into the large-scale structure of the Universe with the next generation of radio telescopes and surveys. The observation of this material, through 21cm line emission, will be confused by foreground emission in the same frequencies. Even after these foregrounds are removed, the reconstructed map may not exactly match the original cosmological signal, which will introduce systematic errors and offset into the measured correlations. In this paper, we simulate future surveys of neutral hydrogen using the Horizon Run 4 (HR4) cosmological N-body simulation. We generate HI intensity maps from the HR4 halo catalogue, and combine with foreground radio emission maps from the Global Sky Model, to create accurate simulations over the entire sky. We simulate the HI sky for the frequency range 700-800 MHz, matching the sensitivity of the Tianlai pathfinder. We test the accuracy of the fastICA, PCA and log-polynomial fitting foreground removal methods to recover the input cosmological angular power spectrum and measure the parameters. We show the effect of survey noise levels and beam sizes on the recovered the cosmological constraints. We find that while the reconstruction removes power from the cosmological 21cm distribution on large-scales, we can correct for this and recover the input parameters in the noise-free case. However, the effect of noise and beam size of the Tianlai pathfinder prevents accurate recovery of the cosmological parameters when using only intensity mapping information.

astro-ph.CO↗

arXiv2020

Synergistic Learning of Lung Lobe Segmentation and Hierarchical Multi-Instance Classification for Automated Severity Assessment of COVID-19 in CT Images

Understanding chest CT imaging of the coronavirus disease 2019 (COVID-19) will help detect infections early and assess the disease progression. Especially, automated severity assessment of COVID-19 in CT images plays an essential role in identifying cases that are in great need of intensive clinical care. However, it is often challenging to accurately assess the severity of this disease in CT images, due to variable infection regions in the lungs, similar imaging biomarkers, and large inter-case variations. To this end, we propose a synergistic learning framework for automated severity assessment of COVID-19 in 3D CT images, by jointly performing lung lobe segmentation and multi-instance classification. Considering that only a few infection regions in a CT image are related to the severity assessment, we first represent each input image by a bag that contains a set of 2D image patches (with each cropped from a specific slice). A multi-task multi-instance deep network (called M$^2$UNet) is then developed to assess the severity of COVID-19 patients and also segment the lung lobe simultaneously. Our M$^2$UNet consists of a patch-level encoder, a segmentation sub-network for lung lobe segmentation, and a classification sub-network for severity assessment (with a unique hierarchical multi-instance learning strategy). Here, the context information provided by segmentation can be implicitly employed to improve the performance of severity assessment. Extensive experiments were performed on a real COVID-19 CT image dataset consisting of 666 chest CT images, with results suggesting the effectiveness of our proposed method compared to several state-of-the-art methods.

eess.IV↗

arXiv2020

Dual-Sampling Attention Network for Diagnosis of COVID-19 from Community Acquired Pneumonia

The coronavirus disease (COVID-19) is rapidly spreading all over the world, and has infected more than 1,436,000 people in more than 200 countries and territories as of April 9, 2020. Detecting COVID-19 at early stage is essential to deliver proper healthcare to the patients and also to protect the uninfected population. To this end, we develop a dual-sampling attention network to automatically diagnose COVID- 19 from the community acquired pneumonia (CAP) in chest computed tomography (CT). In particular, we propose a novel online attention module with a 3D convolutional network (CNN) to focus on the infection regions in lungs when making decisions of diagnoses. Note that there exists imbalanced distribution of the sizes of the infection regions between COVID-19 and CAP, partially due to fast progress of COVID-19 after symptom onset. Therefore, we develop a dual-sampling strategy to mitigate the imbalanced learning. Our method is evaluated (to our best knowledge) upon the largest multi-center CT data for COVID-19 from 8 hospitals. In the training-validation stage, we collect 2186 CT scans from 1588 patients for a 5-fold cross-validation. In the testing stage, we employ another independent large-scale testing dataset including 2796 CT scans from 2057 patients. Results show that our algorithm can identify the COVID-19 images with the area under the receiver operating characteristic curve (AUC) value of 0.944, accuracy of 87.5%, sensitivity of 86.9%, specificity of 90.1%, and F1-score of 82.0%. With this performance, the proposed algorithm could potentially aid radiologists with COVID-19 diagnosis from CAP, especially in the early stage of the COVID-19 outbreak.

cs.CV↗

arXiv2020

Adaptive Feature Selection Guided Deep Forest for COVID-19 Classification with Chest CT

Chest computed tomography (CT) becomes an effective tool to assist the diagnosis of coronavirus disease-19 (COVID-19). Due to the outbreak of COVID-19 worldwide, using the computed-aided diagnosis technique for COVID-19 classification based on CT images could largely alleviate the burden of clinicians. In this paper, we propose an Adaptive Feature Selection guided Deep Forest (AFS-DF) for COVID-19 classification based on chest CT images. Specifically, we first extract location-specific features from CT images. Then, in order to capture the high-level representation of these features with the relatively small-scale data, we leverage a deep forest model to learn high-level representation of the features. Moreover, we propose a feature selection method based on the trained deep forest model to reduce the redundancy of features, where the feature selection could be adaptively incorporated with the COVID-19 classification model. We evaluated our proposed AFS-DF on COVID-19 dataset with 1495 patients of COVID-19 and 1027 patients of community acquired pneumonia (CAP). The accuracy (ACC), sensitivity (SEN), specificity (SPE) and AUC achieved by our method are 91.79%, 93.05%, 89.95% and 96.35%, respectively. Experimental results on the COVID-19 dataset suggest that the proposed AFS-DF achieves superior performance in COVID-19 vs. CAP classification, compared with 4 widely used machine learning methods.

eess.IV↗

arXiv2020

Hypergraph Learning for Identification of COVID-19 with CT Imaging

The coronavirus disease, named COVID-19, has become the largest global public health crisis since it started in early 2020. CT imaging has been used as a complementary tool to assist early screening, especially for the rapid identification of COVID-19 cases from community acquired pneumonia (CAP) cases. The main challenge in early screening is how to model the confusing cases in the COVID-19 and CAP groups, with very similar clinical manifestations and imaging features. To tackle this challenge, we propose an Uncertainty Vertex-weighted Hypergraph Learning (UVHL) method to identify COVID-19 from CAP using CT images. In particular, multiple types of features (including regional features and radiomics features) are first extracted from CT image for each case. Then, the relationship among different cases is formulated by a hypergraph structure, with each case represented as a vertex in the hypergraph. The uncertainty of each vertex is further computed with an uncertainty score measurement and used as a weight in the hypergraph. Finally, a learning process of the vertex-weighted hypergraph is used to predict whether a new testing case belongs to COVID-19 or not. Experiments on a large multi-center pneumonia dataset, consisting of 2,148 COVID-19 cases and 1,182 CAP cases from five hospitals, are conducted to evaluate the performance of the proposed method. Results demonstrate the effectiveness and robustness of our proposed method on the identification of COVID-19 in comparison to state-of-the-art methods.

eess.IV↗

arXiv2020

Joint Prediction and Time Estimation of COVID-19 Developing Severe Symptoms using Chest CT Scan

With the rapidly worldwide spread of Coronavirus disease (COVID-19), it is of great importance to conduct early diagnosis of COVID-19 and predict the time that patients might convert to the severe stage, for designing effective treatment plan and reducing the clinicians' workloads. In this study, we propose a joint classification and regression method to determine whether the patient would develop severe symptoms in the later time, and if yes, predict the possible conversion time that the patient would spend to convert to the severe stage. To do this, the proposed method takes into account 1) the weight for each sample to reduce the outliers' influence and explore the problem of imbalance classification, and 2) the weight for each feature via a sparsity regularization term to remove the redundant features of high-dimensional data and learn the shared information across the classification task and the regression task. To our knowledge, this study is the first work to predict the disease progression and the conversion time, which could help clinicians to deal with the potential severe cases in time or even save the patients' lives. Experimental analysis was conducted on a real data set from two hospitals with 422 chest computed tomography (CT) scans, where 52 cases were converted to severe on average 5.64 days and 34 cases were severe at admission. Results show that our method achieves the best classification (e.g., 85.91% of accuracy) and regression (e.g., 0.462 of the correlation coefficient) performance, compared to all comparison methods. Moreover, our proposed method yields 76.97% of accuracy for predicting the severe cases, 0.524 of the correlation coefficient, and 0.55 days difference for the converted time.

eess.IV↗

arXiv2020

Diagnosis of Coronavirus Disease 2019 (COVID-19) with Structured Latent Multi-View Representation Learning

Recently, the outbreak of Coronavirus Disease 2019 (COVID-19) has spread rapidly across the world. Due to the large number of affected patients and heavy labor for doctors, computer-aided diagnosis with machine learning algorithm is urgently needed, and could largely reduce the efforts of clinicians and accelerate the diagnosis process. Chest computed tomography (CT) has been recognized as an informative tool for diagnosis of the disease. In this study, we propose to conduct the diagnosis of COVID-19 with a series of features extracted from CT images. To fully explore multiple features describing CT images from different views, a unified latent representation is learned which can completely encode information from different aspects of features and is endowed with promising class structure for separability. Specifically, the completeness is guaranteed with a group of backward neural networks (each for one type of features), while by using class labels the representation is enforced to be compact within COVID-19/community-acquired pneumonia (CAP) and also a large margin is guaranteed between different types of pneumonia. In this way, our model can well avoid overfitting compared to the case of directly projecting highdimensional features into classes. Extensive experimental results show that the proposed method outperforms all comparison methods, and rather stable performances are observed when varying the numbers of training data.

eess.IV↗

arXiv2020

MixPUL: Consistency-based Augmentation for Positive and Unlabeled Learning

Learning from positive and unlabeled data (PU learning) is prevalent in practical applications where only a couple of examples are positively labeled. Previous PU learning studies typically rely on existing samples such that the data distribution is not extensively explored. In this work, we propose a simple yet effective data augmentation method, coined~\algo, based on \emph{consistency regularization} which provides a new perspective of using PU data. In particular, the proposed~\algo~incorporates supervised and unsupervised consistency training to generate augmented data. To facilitate supervised consistency, reliable negative examples are mined from unlabeled data due to the absence of negative samples. Unsupervised consistency is further encouraged between unlabeled datapoints. In addition,~\algo~reduces margin loss between positive and unlabeled pairs, which explicitly optimizes AUC and yields faster convergence. Finally, we conduct a series of studies to demonstrate the effectiveness of consistency regularization. We examined three kinds of reliable negative mining methods. We show that~\algo~achieves an averaged improvement of classification error from 16.49 to 13.09 on the CIFAR-10 dataset across different positive data amount.

cs.LG↗