arXiv subjects

Jie Wang

Publications and source records attributed to Jie Wang.

At least 541 records · Page 30Linked to original sources

arXiv2020

On Radically Expanding the Landscape of Potential Applications for Automated Proof Methods

In this paper we examine the potential of computer-assisted proof methods to be applied much more broadly than commonly recognized. More specifically, we contend that there are vast opportunities to derive useful mathematical results and properties that are extremely narrow in scope, and of practical relevance only to highly-specialized engineering applications, that are presently overlooked because they have characteristics atypical of those that are conventionally pursued in the areas of pure and applied mathematics. As a concrete example, we demonstrate use of automated methods for certifying polynomial nonnegativity as a part of a dimension-pinning strategy to prove that the inverse of the relative gain array (RGA) of a d-dimensional positive-definite matrix is doubly-stochastic for $d\leq 4$.

cs.LO↗

arXiv2020

Baryon acoustic oscillations reconstruction using convolutional neural networks

We propose a new scheme to reconstruct the baryon acoustic oscillations (BAO) signal, which contains key cosmological information, based on deep convolutional neural networks (CNN). Trained with almost no fine-tuning, the network can recover large-scale modes accurately in the test set: the correlation coefficient between the true and reconstructed initial conditions reaches $90\%$ at $k\leq 0.2 h\mathrm{Mpc}^{-1}$, which can lead to significant improvements of the BAO signal-to-noise ratio down to $k\simeq0.4h\mathrm{Mpc}^{-1}$. Since this new scheme is based on the configuration-space density field in sub-boxes, it is local and less affected by survey boundaries than the standard reconstruction method, as our tests confirm. We find that the network trained in one cosmology is able to reconstruct BAO peaks in the others, i.e. recovering information lost to non-linearity independent of cosmology. The accuracy of recovered BAO peak positions is far less than that caused by the difference in the cosmology models for training and testing, suggesting that different models can be distinguished efficiently in our scheme. It is very promising that Our scheme provides a different new way to extract the cosmological information from the ongoing and future large galaxy surveys.

astro-ph.CO↗

arXiv2020

Optimal Power Control for DoS Attack over Fading Channel: A Game-Theoretic Approach

In this paper, we investigate remote state estimation against an intelligent denial-of-service (DoS) attack over a vulnerable wireless network whose channel undergoes attenuation and distortion caused by fading. We use the sensor to observe system states and transmit its local state estimates to the remote center. Meanwhile, the attacker injects a jamming signal to destroy the packet accepted by the remote center and causes the performance degradation. Most of the existing works are built on a time-invariant channel state information (CSI) model in which the channel fading is stationary. However, the wireless communication channels are more prone to dynamic changes. To capture this time-variant property in the channel quality of the real-world networks, we study the fading channel network whose channel model is characterized by a generalized finite-state Markov chain. With the goals of two players in infinite-time horizon, we describe the conflicting characteristic between the attacker and the sensor with a general-sum stochastic game. Moreover, the Q-learning techniques are applied to obtain an optimal strategy pair at a Nash equilibrium. Also the monotone structure of the optimal stationary strategy is constructed under a sufficient condition. Besides, when channel gain is known a priori, except for the full Channel State Information (CSI), we also investigate the partial CSI, where Bayesian games are employed. Based on the player's own channel information and the belief on the channel distribution of other players, the energy strategy at a Nash equilibrium is obtained.

eess.SY↗

arXiv2020

Extracting Body Text from Academic PDF Documents for Text Mining

Accurate extraction of body text from PDF-formatted academic documents is essential in text-mining applications for deeper semantic understandings. The objective is to extract complete sentences in the body text into a txt file with the original sentence flow and paragraph boundaries. Existing tools for extracting text from PDF documents would often mix body and nonbody texts. We devise and implement a system called PDFBoT to detect multiple-column layouts using a line-sweeping technique, remove nonbody text using computed text features and syntactic tagging in backward traversal, and align the remaining text back to sentences and paragraphs. We show that PDFBoT is highly accurate with average F1 scores of, respectively, 0.99 on extracting sentences, 0.96 on extracting paragraphs, and 0.98 on removing text on tables, figures, and charts over a corpus of PDF documents randomly selected from arXiv.org across multiple academic disciplines.

cs.IR↗

arXiv2020

Generating Adequate Distractors for Multiple-Choice Questions

This paper presents a novel approach to automatic generation of adequate distractors for a given question-answer pair (QAP) generated from a given article to form an adequate multiple-choice question (MCQ). Our method is a combination of part-of-speech tagging, named-entity tagging, semantic-role labeling, regular expressions, domain knowledge bases, word embeddings, word edit distance, WordNet, and other algorithms. We use the US SAT (Scholastic Assessment Test) practice reading tests as a dataset to produce QAPs and generate three distractors for each QAP to form an MCQ. We show that, via experiments and evaluations by human judges, each MCQ has at least one adequate distractor and 84\% of MCQs have three adequate distractors.

cs.CL↗

arXiv2020

Line Graph Neural Networks for Link Prediction

We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. With the advances of deep learning, current link prediction methods commonly compute features from subgraphs centered at two neighboring nodes and use the features to predict the label of the link between these two nodes. In this formalism, a link prediction problem is converted to a graph classification task. In order to extract fixed-size features for classification, graph pooling layers are necessary in the deep learning model, thereby incurring information loss. To overcome this key limitation, we propose to seek a radically different and novel path by making use of the line graphs in graph theory. In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task. Experimental results on fourteen datasets from different applications demonstrate that our proposed method consistently outperforms the state-of-the-art methods, while it has fewer parameters and high training efficiency.

cs.LG↗

arXiv2020

Gradient estimates for a class of elliptic and parabolic equations on Riemannian manifolds

Let $(N, g)$ be a complete noncompact Riemannian manifold with Ricci curvature bounded from below. In this paper, we study the gradient estimates of positive solutions to a class of nonlinear elliptic equations $$Δu(x)+a(x)u(x)\log u(x)+b(x)u(x)=0$$ on $N$ where $a(x)$ is $C^{2}$-smooth while $b(x)$ is $C^{1}$ and its parabolic counterparts $$(Δ-\frac{\partial}{\partial t})u(x,t)+a(x,t)u(x,t)\log u(x,t) + b(x,t)u(x,t)=0$$ on $N\times[0, \infty)$ where $a(x,t)$ and $b(x,t)$ are $C^{2} $ with respect to $x\in N$ while are $C^{1}$ with respect to the time $t$. In contrast with lots of similar results, here we do not assume the coefficients of equations are constant, so our results can be viewed as extensions to several classical estimates.

math.DG↗

arXiv2020

Exploiting term sparsity in Noncommutative Polynomial Optimization

We provide a new hierarchy of semidefinite programming relaxations, called NCTSSOS, to solve large-scale sparse noncommutative polynomial optimization problems. This hierarchy features the exploitation of term sparsity hidden in the input data for eigenvalue and trace optimization problems. NCTSSOS complements the recent work that exploits correlative sparsity for noncommutative optimization problems by Klep, Magron and Povh in arXiv:1909.00569, and is the noncommutative analogue of the TSSOS framework by Wang, Magron and Lasserre in arXiv:1912.08899. We also propose an extension exploiting simultaneously correlative and term sparsity, as done previously in the commutative case arXiv:2005.02828. Under certain conditions, we prove that the optimums of the NCTSSOS hierarchy converge to the optimum of the corresponding dense SDP relaxation. We illustrate the efficiency and scalability of NCTSSOS by solving eigenvalue/trace optimization problems from the literature as well as randomly generated examples involving up to several thousands of variables.

math.OC↗

arXiv2020

When HLS Meets FPGA HBM: Benchmarking and Bandwidth Optimization

With the recent release of High Bandwidth Memory (HBM) based FPGA boards, developers can now exploit unprecedented external memory bandwidth. This allows more memory-bounded applications to benefit from FPGA acceleration. However, we found that it is not easy to fully utilize the available bandwidth when developing some applications with high-level synthesis (HLS) tools. This is due to the limitation of existing HLS tools when accessing HBM board's large number of independent external memory channels. In this paper, we measure the performance of three recent representative HBM FPGA boards (Intel's Stratix 10 MX and Xilinx's Alveo U50/U280 boards) with microbenchmarks and analyze the HLS overhead. Next, we propose HLS-based optimization techniques to improve the effective bandwidth when a PE accesses multiple HBM channels or multiple PEs access an HBM channel. Our experiment demonstrates that the effective bandwidth improves by 2.4X-3.8X. We also provide a list of insights for future improvement of the HBM FPGA HLS design flow.

cs.AR↗

arXiv2020

DcardNet: Diabetic Retinopathy Classification at Multiple Levels Based on Structural and Angiographic Optical Coherence Tomography

Objective: Optical coherence tomography (OCT) and its angiography (OCTA) have several advantages for the early detection and diagnosis of diabetic retinopathy (DR). However, automated, complete DR classification frameworks based on both OCT and OCTA data have not been proposed. In this study, a convolutional neural network (CNN) based method is proposed to fulfill a DR classification framework using en face OCT and OCTA. Methods: A densely and continuously connected neural network with adaptive rate dropout (DcardNet) is designed for the DR classification. In addition, adaptive label smoothing was proposed and used to suppress overfitting. Three separate classification levels are generated for each case based on the International Clinical Diabetic Retinopathy scale. At the highest level the network classifies scans as referable or non-referable for DR. The second level classifies the eye as non-DR, non-proliferative DR (NPDR), or proliferative DR (PDR). The last level classifies the case as no DR, mild and moderate NPDR, severe NPDR, and PDR. Results: We used 10-fold cross-validation with 10% of the data to assess the networks performance. The overall classification accuracies of the three levels were 95.7%, 85.0%, and 71.0% respectively. Conclusion/Significance: A reliable, sensitive and specific automated classification framework for referral to an ophthalmologist can be a key technology for reducing vision loss related to DR.

eess.IV↗

arXiv2020

Universal structure of dark matter haloes over a mass range of 20 orders of magnitude

Cosmological models in which dark matter consists of cold elementary particles predict that the dark halo population should extend to masses many orders of magnitude below those at which galaxies can form. Here we report a cosmological simulation of the formation of present-day haloes over the full range of observed halo masses (20 orders of magnitude) when dark matter is assumed to be in the form of weakly interacting massive particles of mass approximately 100 gigaelectronvolts. The simulation has a full dynamic range of 30 orders of magnitude in mass and resolves the internal structure of hundreds of Earth-mass haloes in as much detail as it does for hundreds of rich galaxy clusters. We find that halo density profiles are universal over the entire mass range and are well described by simple two-parameter fitting formulae. Halo mass and concentration are tightly related in a way that depends on cosmology and on the nature of the dark matter. For a fixed mass, the concentration is independent of the local environment for haloes less massive than those of typical galaxies. Haloes over the mass range of 10^3 to 10^11 solar masses contribute about equally (per logarithmic interval) to the luminosity produced by dark matter annihilation, which we find to be smaller than all previous estimates by factors ranging up to one thousand.

astro-ph.CO↗

arXiv2020

The conformity of HI galaxies in ALFALFA-SDSS sample

The conformity effect, indicating the evolution of a galaxy is related to its surrounding neighbour galaxies as far as a few Mpc, is an interesting phenomenon in the modeling of galaxy and evolution. Here we study the conformity effect of HI galaxies in a matched galaxy sample between SDSS DR7 and ALFALFA surveys. By checking the probability difference for the detected HI galaxies as a function of distance around a normal or an HI galaxy, we find that this effect is significant out to 5 Mpc. It also shows a dependence on the stellar mass of galaxies, with the strength the strongest in the stellar mass range of 10^10~10^10.5. However, when the sample is confined to central galaxies in groups with virial radii smaller than 1 Mpc, the 1-halo conformity signal is still evident, while the 2-halo conformity signal is reduced to a very weak amplitude. Our results confirm the previous study in the optical band that the 2-halo term is possibly caused by the bias effect in the sample selection. Furthermore, we confirm the existence of the 1-halo conformity discovered in the optical and radio band in previous lectures. Our results provide another viewpoint of the conformity effect and hope to shed the light on the co-evolution of the galaxies and their neighbours in the current galaxy formation models.

astro-ph.GA↗

arXiv2020

Creating topological polar structure in a nonpolar matter

Nontrivial topological structures offer rich playground in condensed matter physics including fluid dynamics, superconductivity, and ferromagnetism, and they promise alternative device configurations for post-Moore spintronics and electronics. Indeed, magnetic skyrmions are actively pursued for high-density data storage, while polar vortices with exotic negative capacitance may enable ultralow power consumption in microelectronics. Following extensive investigations on a variety of magnetic textures including vortices, domain walls and skyrmions in the past decades, studies on polar topologies have taken off in recent years, resulting in discoveries of closure domains, vortices, and skyrmions in ferroelectric materials. Nevertheless, the atomic-scale creation of topological polar structures is largely confined in a single ferroelectric system, PbTiO3 (PTO) with large polarization, casting doubt on the generality of polar topologies and limiting their potential applications. In this work, we successfully create previously unrealized atomic-scale polar antivortices in the nominally nonpolar SrTiO3 (STO), expanding the reaches of topological structures and completing an important missing link in polar topologies. The work shed considerable new insight into the formation of topological polar structures, and offers guidance in searching for new polar textures.

cond-mat.mtrl-sci↗

arXiv2020

Focal Loss Analysis of Nerve Fiber Layer Reflectance for Glaucoma Diagnosis

Purpose: To evaluate nerve fiber layer (NFL) reflectance for glaucoma diagnosis. Methods: Participants were imaged with 4.5X4.5-mm volumetric disc scans using spectral-domain optical coherence tomography (OCT). The normalized NFL reflectance map was processed by an azimuthal filter to reduce directional reflectance bias due to variation of beam incidence angle. The peripapillary area of the map was divided into 160 superpixels. Average reflectance was the mean of superpixel reflectance. Low-reflectance superpixels were identified as those with NFL reflectance below the 5 percentile normative cutoff. Focal reflectance loss was measure by summing loss in low-reflectance superpixels. Results: Thirty-five normal, 30 pre-perimetric and 35 perimetric glaucoma participants were enrolled. Azimuthal filtering improved the repeatability of the normalized NFL reflectance, as measured by the pooled superpixel standard deviation (SD), from 0.73 to 0.57 dB (p<0.001, paired t-test) and reduced the population SD from 2.14 to 1.78 dB (p<0.001, t-test). Most glaucomatous reflectance maps showed characteristic patterns of contiguous wedge or diffuse defects. Focal NFL reflectance loss had significantly higher diagnostic sensitivity than the best NFL thickness parameter (overall, inferior, or focal loss volume): 53% v. 23% (p=0.027) in PPG eyes and 100% v. 80% (p=0.023) in PG eyes, with the specificity fixed at 99%. Conclusions: Azimuthal filtering reduces the variability of NFL reflectance measurements. Focal NFL reflectance loss has excellent glaucoma diagnostic accuracy compared to the standard NFL thickness parameters. The reflectance map may be useful for localizing NFL defects.

eess.IV↗

arXiv2020

Automated segmentation of retinal fluid volumes from structural and angiographic optical coherence tomography using deep learning

Purpose: We proposed a deep convolutional neural network (CNN), named Retinal Fluid Segmentation Network (ReF-Net) to segment volumetric retinal fluid on optical coherence tomography (OCT) volume. Methods: 3 x 3-mm OCT scans were acquired on one eye by a 70-kHz OCT commercial AngioVue system (RTVue-XR; Optovue, Inc.) from 51 participants in a clinical diabetic retinopathy (DR) study (45 with retinal edema and 6 healthy controls). A CNN with U-Net-like architecture was constructed to detect and segment the retinal fluid. Cross-sectional OCT and angiography (OCTA) scans were used for training and testing ReF-Net. The effect of including OCTA data for retinal fluid segmentation was investigated in this study. Volumetric retinal fluid can be constructed using the output of ReF-Net. Area-under-Receiver-Operating-Characteristic-curve (AROC), intersection-over-union (IoU), and F1-score were calculated to evaluate the performance of ReF-Net. Results: ReF-Net shows high accuracy (F1 = 0.864 +/- 0.084) in retinal fluid segmentation. The performance can be further improved (F1 = 0.892 +/- 0.038) by including information from both OCTA and structural OCT. ReF-Net also shows strong robustness to shadow artifacts. Volumetric retinal fluid can provide more comprehensive information than the 2D area, whether cross-sectional or en face projections. Conclusions: A deep-learning-based method can accurately segment retinal fluid volumetrically on OCT/OCTA scans with strong robustness to shadow artifacts. OCTA data can improve retinal fluid segmentation. Volumetric representations of retinal fluid are superior to 2D projections. Translational Relevance: Using a deep learning method to segment retinal fluid volumetrically has the potential to improve the diagnostic accuracy of diabetic macular edema by OCT systems.

eess.IV↗

arXiv2020

Spectral Dynamic Causal Modelling of Resting-State fMRI: Relating Effective Brain Connectivity in the Default Mode Network to Genetics

We conduct an imaging genetics study to explore how effective brain connectivity in the default mode network (DMN) may be related to genetics within the context of Alzheimer's disease and mild cognitive impairment. We develop an analysis of longitudinal resting-state functional magnetic resonance imaging (rs-fMRI) and genetic data obtained from a sample of 111 subjects with a total of 319 rs-fMRI scans from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database. A Dynamic Causal Model (DCM) is fit to the rs-fMRI scans to estimate effective brain connectivity within the DMN and related to a set of single nucleotide polymorphisms (SNPs) contained in an empirical disease-constrained set which is obtained out-of-sample from 663 ADNI subjects having only genome-wide data. We examine longitudinal data in both a 4-region and an 6-region network and relate longitudinal effective brain connectivity networks estimated using spectral DCM to SNPs using both linear mixed effect (LME) models as well as function-on-scalar regression (FSR). In the former case we implement a parametric bootstrap for testing SNP coefficients and make comparisons with p-values obtained from the chi-squared null distribution. We also implement a parametric bootstrap approach for testing regression functions in FSR and we make comparisons between p-values obtained from the parametric bootstrap to p-values obtained using the F-distribution with degrees-of-freedom based on Satterthwaite's approximation. In both networks we report on exploratory patterns of associations with relatively high ranks that exhibit stability to the differing assumptions made by both FSR and LME.

q-bio.NC↗

arXiv2020

TSSOS: A Moment-SOS hierarchy that exploits term sparsity

This paper is concerned with polynomial optimization problems. We show how to exploit term (or monomial) sparsity of the input polynomials to obtain a new converging hierarchy of semidefinite programming relaxations. The novelty (and distinguishing feature) of such relaxations is to involve block-diagonal matrices obtained in an iterative procedure performing completion of the connected components of certain adjacency graphs. The graphs are related to the terms arising in the original data and not to the links between variables. Our theoretical framework is then applied to compute lower bounds for polynomial optimization problems either randomly generated or coming from the networked systems literature.

math.OC↗

arXiv2020

An Unsupervised Semantic Sentence Ranking Scheme for Text Documents

This paper presents Semantic SentenceRank (SSR), an unsupervised scheme for automatically ranking sentences in a single document according to their relative importance. In particular, SSR extracts essential words and phrases from a text document, and uses semantic measures to construct, respectively, a semantic phrase graph over phrases and words, and a semantic sentence graph over sentences. It applies two variants of article-structure-biased PageRank to score phrases and words on the first graph and sentences on the second graph. It then combines these scores to generate the final score for each sentence. Finally, SSR solves a multi-objective optimization problem for ranking sentences based on their final scores and topic diversity through semantic subtopic clustering. An implementation of SSR that runs in quadratic time is presented, and it outperforms, on the SummBank benchmarks, each individual judge's ranking and compares favorably with the combined ranking of all judges.

cs.IR↗