arXiv subjects

Fan Zhang

Publications and source records attributed to Fan Zhang.

At least 739 records · Page 41Linked to original sources

arXiv2021

Three-dimensional charge density wave and robust zero-bias conductance peak inside the superconducting vortex core of a kagome superconductor CsV$_3$Sb$_5$

The transition-metal-based kagome metals provide a versatile platform for correlated topological phases hosting various electronic instabilities. While superconductivity is rare in layered kagome compounds, its interplay with nontrivial topology could offer an engaging space to realize exotic excitations of quasiparticles. Here, we use scanning tunneling microscopy (STM) to study a newly discovered Z$_2$ topological kagome metal CsV$_3$Sb$_5$ with a superconducting ground state. We observe charge modulation associated with the opening of an energy gap near the Fermi level. When across single-unit-cell surface step edges, the intensity of this charge modulation exhibits a π-phase shift, suggesting a three-dimensional 2$\times$2$\times$2 charge density wave ordering. Interestingly, a robust zero-bias conductance peak is observed inside the superconducting vortex core on the Cs 2$\times$2 surfaces that does not split in a large distance when moving away from the vortex center, resembling the Majorana bound states arising from the superconducting Dirac surface states in Bi$_2$Te$_3$/NbSe$_2$ heterostructures. Our findings establish CsV$_3$Sb$_5$ as a promising candidate for realizing exotic excitations at the confluence of nontrivial lattice geometry, topology and multiple electronic orders.

cond-mat.supr-con↗

arXiv2021

Optimal Transport Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes

We consider optimal transport based distributionally robust optimization (DRO) problems with locally strongly convex transport cost functions and affine decision rules. Under conventional convexity assumptions on the underlying loss function, we obtain structural results about the value function, the optimal policy, and the worst-case optimal transport adversarial model. These results expose a rich structure embedded in the DRO problem (e.g. strong convexity even if the non-DRO problem was not strongly convex, a suitable scaling of the Lagrangian for the DRO constraint, etc. which are crucial for the design of efficient algorithms). As a consequence of these results, one can develop efficient optimization procedures which have the same sample and iteration complexity as a natural non-DRO benchmark algorithm such as stochastic gradient descent.

math.OC↗

arXiv2021

Quantitative mapping of the brain's structural connectivity using diffusion MRI tractography: a review

Diffusion magnetic resonance imaging (dMRI) tractography is an advanced imaging technique that enables in vivo mapping of the brain's white matter connections at macro scale. Over the last two decades, the study of brain connectivity using dMRI tractography has played a prominent role in the neuroimaging research landscape. In this paper, we provide a high-level overview of how tractography is used to enable quantitative analysis of the brain's structural connectivity in health and disease. We first provide a review of methodology involved in three main processing steps that are common across most approaches for quantitative analysis of tractography, including methods for tractography correction, segmentation and quantification. For each step, we aim to describe methodological choices, their popularity, and potential pros and cons. We then review studies that have used quantitative tractography approaches to study the brain's white matter, focusing on applications in neurodevelopment, aging, neurological disorders, mental disorders, and neurosurgery. We conclude that, while there have been considerable advancements in methodological technologies and breadth of applications, there nevertheless remains no consensus about the "best" methodology in quantitative analysis of tractography, and researchers should remain cautious when interpreting results in research and clinical applications.

q-bio.QM↗

arXiv2021

Two-fluid Modeling of Acoustic Wave Propagation in Gravitationally Stratified Isothermal Media

To study acoustic wave propagation and the corresponding energy deposition in partially ionized plasmas, we use a two-fluid computational model that treats neutrals and charged particles (electrons and ions) as two separate fluids. This two-fluid model takes into account the ion-neutral collisions, ionization, and recombination, allowing us to investigate both the collisional and reactive interactions between uncoupled ions and neutrals in the plasmas. In the present numerical simulations, the initial density is specified to reach hydrostatic equilibrium, and as a comparison, chemical equilibrium is also taken into account to provide a density profile that differs from typical hydrostatic equilibrium profiles. External velocity drivers are then imposed to generate monochromatic acoustic waves. As is well known, the upward propagating acoustic waves steepen in gravitationally stratified plasmas due to the exponentially decreasing density, and they heat the plasmas in the nonlinear regimes where kinetic energy is dissipated by shock waves and collisional interactions. In particular, the lower ionization fraction resulting from the present initial chemical equilibrium significantly enhances the heating efficiency. Moreover, the ionization process absorbs a significant amount of energy, and the decoupling between ions and neutrals is also enhanced while considering ionization and recombination. Therefore, simulations without considering ionization and recombination may overestimate the overall heating effects but also underestimate the energy dissipation. The results also suggest that a more accurate ionization and recombination model could be essential for improving the modeling of partially ionized plasmas.

physics.plasm-ph↗

arXiv2021

Transmit Correlation Diversity: Generalization, New Techniques, and Improved Bounds

When the users in a MIMO broadcast channel experience different spatial transmit correlation matrices, a class of gains is produced that is denoted transmit correlation diversity. This idea was conceived for channels in which transmit correlation matrices have mutually exclusive eigenspaces, allowing non-interfering training and transmission. This paper broadens the scope of transmit correlation diversity to the case of partially and fully overlapping eigenspaces and introduces techniques to harvest these generalized gains. For the two-user MIMO broadcast channel, we derive achievable degrees of freedom (DoF) and achievable rate regions with/without channel state information at the receiver (CSIR). When CSIR is available, the proposed achievable DoF region is tight in some configurations of the number of receive antennas and the channel correlation ranks. We then extend the DoF results to the $K$-user case by analyzing the interference graph that characterizes the overlapping structure of the eigenspaces. Our achievability results employ a combination of product superposition in the common part of the eigenspaces, and pre-beamforming (rate splitting) to create multiple data streams in non-overlapping parts of the eigenspaces. Massive MIMO is a natural example in which spatially correlated link gains are likely to occur. We study the achievable downlink sum rate for a frequency-division duplex massive MIMO system under transmit correlation diversity.

cs.IT↗

arXiv2021

GSI: GPU-friendly Subgraph Isomorphism

Subgraph isomorphism is a well-known NP-hard problem that is widely used in many applications, such as social network analysis and query over the knowledge graph. Due to the inherent hardness, its performance is often a bottleneck in various real-world applications. Therefore, we address this by designing an efficient subgraph isomorphism algorithm leveraging features of GPU architecture, such as massive parallelism and memory hierarchy. Existing GPU-based solutions adopt a two-step output scheme, performing the same join process twice in order to write intermediate results concurrently. They also lack GPU architecture-aware optimizations that allow scaling to large graphs. In this paper, we propose a GPU-friendly subgraph isomorphism algorithm, GSI. Different from existing edge join-based GPU solutions, we propose a Prealloc-Combine strategy based on the vertex-oriented framework, which avoids joining-twice in existing solutions. Also, a GPU-friendly data structure (called PCSR) is proposed to represent an edge-labeled graph. Extensive experiments on both synthetic and real graphs show that GSI outperforms the state-of-the-art algorithms by up to several orders of magnitude and has good scalability with graph size scaling to hundreds of millions of edges.

cs.DB↗

arXiv2021

Improving Faithfulness in Abstractive Summarization with Contrast Candidate Generation and Selection

Despite significant progress in neural abstractive summarization, recent studies have shown that the current models are prone to generating summaries that are unfaithful to the original context. To address the issue, we study contrast candidate generation and selection as a model-agnostic post-processing technique to correct the extrinsic hallucinations (i.e. information not present in the source text) in unfaithful summaries. We learn a discriminative correction model by generating alternative candidate summaries where named entities and quantities in the generated summary are replaced with ones with compatible semantic types from the source document. This model is then used to select the best candidate as the final output summary. Our experiments and analysis across a number of neural summarization systems show that our proposed method is effective in identifying and correcting extrinsic hallucinations. We analyze the typical hallucination phenomenon by different types of neural summarization systems, in hope to provide insights for future work on the direction.

cs.CL↗

arXiv2021

Individually Fair Gradient Boosting

We consider the task of enforcing individual fairness in gradient boosting. Gradient boosting is a popular method for machine learning from tabular data, which arise often in applications where algorithmic fairness is a concern. At a high level, our approach is a functional gradient descent on a (distributionally) robust loss function that encodes our intuition of algorithmic fairness for the ML task at hand. Unlike prior approaches to individual fairness that only work with smooth ML models, our approach also works with non-smooth models such as decision trees. We show that our algorithm converges globally and generalizes. We also demonstrate the efficacy of our algorithm on three ML problems susceptible to algorithmic bias.

cs.LG↗

arXiv2021

A Subjective Study on Videos at Various Bit Depths

Bit depth adaptation, where the bit depth of a video sequence is reduced before transmission and up-sampled during display, can potentially reduce data rates with limited impact on perceptual quality. In this context, we conducted a subjective study on a UHD video database, BVI-BD, to explore the relationship between bit depth and visual quality. In this work, three bit depth adaptation methods are investigated, including linear scaling, error diffusion, and a novel adaptive Gaussian filtering approach. The results from a subjective experiment indicate that above a critical bit depth, bit depth adaptation has no significant impact on perceptual quality, while reducing the amount information that is required to be transmitted. Below the critical bit depth, advanced adaptation methods can be used to retain `good' visual quality (on average) down to around 2 bits per color channel for the outlined experimental setup - a large reduction compared to the typically used 8 bits per color channel. A selection of image quality metrics were subsequently bench-marked on the subjective data, and analysis indicates that a bespoke quality metric is required for bit depth adaptation.

eess.IV↗

arXiv2021

VMAF-based Bitrate Ladder Estimation for Adaptive Streaming

In HTTP Adaptive Streaming, video content is conventionally encoded by adapting its spatial resolution and quantization level to best match the prevailing network state and display characteristics. It is well known that the traditional solution, of using a fixed bitrate ladder, does not result in the highest quality of experience for the user. Hence, in this paper, we consider a content-driven approach for estimating the bitrate ladder, based on spatio-temporal features extracted from the uncompressed content. The method implements a content-driven interpolation. It uses the extracted features to train a machine learning model to infer the curvature points of the Rate-VMAF curves in order to guide a set of initial encodings. We employ the VMAF quality metric as a means of perceptually conditioning the estimation. When compared to exhaustive encoding that produces the reference ladder, the estimated ladder is composed by 74.3% of identical Rate-VMAF points with the reference ladder. The proposed method offers a significant reduction of the number of encodes required, 77.4%, at a small average Bjøntegaard Delta Rate cost, 1.12%.

eess.IV↗

arXiv2021

AIBench Training: Balanced Industry-Standard AI Training Benchmarking

Earlier-stage evaluations of a new AI architecture/system need affordable benchmarks. Only using a few AI component benchmarks like MLPerfalone in the other stages may lead to misleading conclusions. Moreover, the learning dynamics are not well understood, and the benchmarks' shelf-life is short. This paper proposes a balanced benchmarking methodology. We use real-world benchmarks to cover the factors space that impacts the learning dynamics to the most considerable extent. After performing an exhaustive survey on Internet service AI domains, we identify and implement nineteen representative AI tasks with state-of-the-art models. For repeatable performance ranking (RPR subset) and workload characterization (WC subset), we keep two subsets to a minimum for affordability. We contribute by far the most comprehensive AI training benchmark suite. The evaluations show: (1) AIBench Training (v1.1) outperforms MLPerfTraining (v0.7) in terms of diversity and representativeness of model complexity, computational cost, convergent rate, computation, and memory access patterns, and hotspot functions; (2) Against the AIBench full benchmarks, its RPR subset shortens the benchmarking cost by 64%, while maintaining the primary workload characteristics; (3) The performance ranking shows the single-purpose AI accelerator like TPU with the optimized TensorFlowframework performs better than that of GPUs while losing the latter's general support for various AI models. The specification, source code, and performance numbers are available from the AIBench homepage https://www.benchcouncil.org/aibench-training/index.html.

cs.AI↗

arXiv2021

Enhancing VMAF through New Feature Integration and Model Combination

VMAF is a machine learning based video quality assessment method, originally designed for streaming applications, which combines multiple quality metrics and video features through SVM regression. It offers higher correlation with subjective opinions compared to many conventional quality assessment methods. In this paper we propose enhancements to VMAF through the integration of new video features and alternative quality metrics (selected from a diverse pool) alongside multiple model combination. The proposed combination approach enables training on multiple databases with varying content and distortion characteristics. Our enhanced VMAF method has been evaluated on eight HD video databases, and consistently outperforms the original VMAF model (0.6.1) and other benchmark quality metrics, exhibiting higher correlation with subjective ground truth data.

eess.IV↗

arXiv2021

Sensing population distribution from satellite imagery via deep learning: model selection, neighboring effect, and systematic biases

The rapid development of remote sensing techniques provides rich, large-coverage, and high-temporal information of the ground, which can be coupled with the emerging deep learning approaches that enable latent features and hidden geographical patterns to be extracted. This study marks the first attempt to cross-compare performances of popular state-of-the-art deep learning models in estimating population distribution from remote sensing images, investigate the contribution of neighboring effect, and explore the potential systematic population estimation biases. We conduct an end-to-end training of four popular deep learning architectures, i.e., VGG, ResNet, Xception, and DenseNet, by establishing a mapping between Sentinel-2 image patches and their corresponding population count from the LandScan population grid. The results reveal that DenseNet outperforms the other three models, while VGG has the worst performances in all evaluating metrics under all selected neighboring scenarios. As for the neighboring effect, contradicting existing studies, our results suggest that the increase of neighboring sizes leads to reduced population estimation performance, which is found universal for all four selected models in all evaluating metrics. In addition, there exists a notable, universal bias that all selected deep learning models tend to overestimate sparsely populated image patches and underestimate densely populated image patches, regardless of neighboring sizes. The methodological, experimental, and contextual knowledge this study provides is expected to benefit a wide range of future studies that estimate population distribution via remote sensing imagery.

cs.CV↗

arXiv2021

Towards Understanding and Demystifying Bitcoin Mixing Services

One reason for the popularity of Bitcoin is due to its anonymity. Although several heuristics have been used to break the anonymity, new approaches are proposed to enhance its anonymity at the same time. One of them is the mixing service. Unfortunately, mixing services have been abused to facilitate criminal activities, e.g., money laundering. As such, there is an urgent need to systematically understand Bitcoin mixing services. In this paper, we take the first step to understand state-of-the-art Bitcoin mixing services. Specifically, we propose a generic abstraction model for mixing services and observe that there are two mixing mechanisms in the wild, i.e. {swapping} and {obfuscating}. Based on this model, we conduct a transaction-based analysis and successfully reveal the mixing mechanisms of four representative services. Besides, we propose a method to identify mixing transactions that leverage the obfuscating mechanism. The proposed approach is able to identify over $92$\% of the mixing transactions. Based on identified transactions, we then estimate the profit of mixing services and provide a case study of tracing the money flow of stolen Bitcoins.

cs.CR↗

arXiv2021

Two-chip power-scalable THz-generating semiconductor disk laser

We demonstrate a compact two-chip terahertz-emitting vertical-external-cavity surface-emitting laser (TECSEL) source, which provides 1-THz output based on intracavity frequency conversion of dual-wavelength emission in a periodically-poled lithium niobate crystal. The type-I frequency conversion scheme at room temperature highly benefits from the power-scaling possibilities in a multichip cavity with intracavity powers in excess of 500 W.

physics.optics↗

arXiv2021

CellTrack R-CNN: A Novel End-To-End Deep Neural Network for Cell Segmentation and Tracking in Microscopy Images

Cell segmentation and tracking in microscopy images are of great significance to new discoveries in biology and medicine. In this study, we propose a novel approach to combine cell segmentation and cell tracking into a unified end-to-end deep learning based framework, where cell detection and segmentation are performed with a current instance segmentation pipeline and cell tracking is implemented by integrating Siamese Network with the pipeline. Besides, tracking performance is improved by incorporating spatial information into the network and fusing spatial and visual prediction. Our approach was evaluated on the DeepCell benchmark dataset. Despite being simple and efficient, our method outperforms state-of-the-art algorithms in terms of both cell segmentation and cell tracking accuracies.

cs.CV↗

arXiv2021

Speech Emotion Recognition with Multiscale Area Attention and Data Augmentation

In Speech Emotion Recognition (SER), emotional characteristics often appear in diverse forms of energy patterns in spectrograms. Typical attention neural network classifiers of SER are usually optimized on a fixed attention granularity. In this paper, we apply multiscale area attention in a deep convolutional neural network to attend emotional characteristics with varied granularities and therefore the classifier can benefit from an ensemble of attentions with different scales. To deal with data sparsity, we conduct data augmentation with vocal tract length perturbation (VTLP) to improve the generalization capability of the classifier. Experiments are carried out on the Interactive Emotional Dyadic Motion Capture (IEMOCAP) dataset. We achieved 79.34% weighted accuracy (WA) and 77.54% unweighted accuracy (UA), which, to the best of our knowledge, is the state of the art on this dataset.

cs.SD↗

arXiv2021

Full counting statistics of the currents through a Kitaev chain and the exchange fluctuation theorem

Exchange fluctuation theorems (XFTs) describe a fundamental symmetry relation for particle and energy exchange between several systems. Here we study the XFTs of a Kitaev chain connected to two reservoirs in the same temperature but different bias. By varying the parameters in the Kitaev chain model, we calculate analytically the full counting statistics of the transport current and formulate the corresponding XFTs for multiple current components. We also demonstrate the XFTs with numerical results. We find that due to the presence of the U(1) symmetry breaking terms in the Hamiltonian of the Kitaev chain, various forms of the XFTs emerge, and they can be interpreted in terms of various well-known transport processes.

quant-ph↗