arXiv subjects

Han Li

Publications and source records attributed to Han Li.

At least 325 records · Page 18Linked to original sources

arXiv2023

Near-Intrinsic Photo- and Electroluminescence from Single-Walled Carbon Nanotube Thin Films on BCB-Passivated Surfaces

Their outstanding electrical and optical properties make semiconducting single-walled carbon nanotubes (SWCNTs) highly suitable for charge transport and emissive layers in near-infrared optoelectronic devices. However, the luminescence spectra of SWCNT thin films on commonly used glass and Si/SiO2 substrates are often compromised by broadening of the main excitonic emission and unwanted low-energy sidebands. Surface passivation with a commercially available, low dielectric constant, cross-linked bis-benzocyclobutene-based polymer (BCB) enhances the emission properties of SWCNTs to the same level as hexagonal boron nitride (h-BN) flakes do. The presence of BCB suppresses sideband emission, especially from the Y1 band, which is attributed to defects introduced by the interaction of the nanotube lattice with oxygen-containing terminal groups of the substrate surface. The facile and reproducible deposition of homogeneous BCB films over large areas combined with their resistance against common solvents and chemicals employed during photolithography make them compatible with standard semiconductor device fabrication. Utilizing this approach, light-emitting (6,5) SWCNT network field-effect transistors are fabricated on BCB-treated glass substrates with excellent electrical characteristics and near-intrinsic electroluminescence. Hence, passivation with BCB is proposed as a standard treatment for substrates used for spectroscopic investigations of and optoelectronic devices with SWCNTs and other low-dimensional emitters.

physics.app-ph↗

arXiv2023

Hierarchical Graph Networks for 3D Human Pose Estimation

Recent 2D-to-3D human pose estimation works tend to utilize the graph structure formed by the topology of the human skeleton. However, we argue that this skeletal topology is too sparse to reflect the body structure and suffer from serious 2D-to-3D ambiguity problem. To overcome these weaknesses, we propose a novel graph convolution network architecture, Hierarchical Graph Networks (HGN). It is based on denser graph topology generated by our multi-scale graph structure building strategy, thus providing more delicate geometric information. The proposed architecture contains three sparse-to-fine representation subnetworks organized in parallel, in which multi-scale graph-structured features are processed and exchange information through a novel feature fusion strategy, leading to rich hierarchical representations. We also introduce a 3D coarse mesh constraint to further boost detail-related feature learning. Extensive experiments demonstrate that our HGN achieves the state-of-the art performance with reduced network parameters. Code is released at https://github.com/qingshi9974/BMVC2021-Hierarchical-Graph-Networks-for-3D-Human-Pose-Estimation.

cs.CV↗

arXiv2023

Nematic chiral spin liquid in a Kitaev magnet under external magnetic field

The possible existence of a quantum spin liquid (QSL) phase, an exotic state of matter with long-range quantum entanglement and fractionalized excitations, in $α$-RuCl$_3$ has sparked widespread interests in exploring QSLs in various Kitaev models under magnetic fields. Recently, a $K$-$J$-$Γ$-$Γ'$ model has been proposed to accurately describe the compound by fitting the measured thermodynamic data, where $J$ is Heisenberg interaction, and $Γ$, $Γ'$ are off-diagonal exchanges on top of the dominant Kitaev coupling $K$. Based on this effective model, an intermediate QSL phase in presence of an out-of-plane fields along the $[1 1 1]$ direction, between the low-field zigzag order and high-field polarized phase, has been predicted. By combining density matrix renormalization group (DMRG), exponential tensor renormalization group (XTRG), and variational Monte Carlo (VMC) calculations, we address the nature of this QSL phase in the honeycomb $K$-$J$-$Γ$-$Γ'$ model under the $[1 1 1]$-direction field. Our DMRG calculations find the algebraic-like decay of spin correlation function, the finite spin scalar chiral order, and lattice nematic order. Together with the XTRG results of power-law specific heat at low temperature, our findings naturally suggest a gapless nematic chiral spin liquid. On the other hand, our VMC study finds a gapped nematic chiral spin liquid with the variational energy very close to that obtained in DMRG. As VMC finds a very small gap that is beyond the current resolution of both ground-state DMRG and finite-temperature XTRG calculations on finite-width cylinders, we resort the full clarification for the nature of the intermediate QSL to future studies. Lastly, we discuss the implications of our results to the recent experiment on $α$-RuCl$_3$ and the QSL-like phase in a similar $K$-$Γ$-$Γ'$ model.

cond-mat.str-el↗

arXiv2023

DiffULD: Diffusive Universal Lesion Detection

Universal Lesion Detection (ULD) in computed tomography (CT) plays an essential role in computer-aided diagnosis. Promising ULD results have been reported by anchor-based detection designs, but they have inherent drawbacks due to the use of anchors: i) Insufficient training targets and ii) Difficulties in anchor design. Diffusion probability models (DPM) have demonstrated outstanding capabilities in many vision tasks. Many DPM-based approaches achieve great success in natural image object detection without using anchors. But they are still ineffective for ULD due to the insufficient training targets. In this paper, we propose a novel ULD method, DiffULD, which utilizes DPM for lesion detection. To tackle the negative effect triggered by insufficient targets, we introduce a novel center-aligned bounding box padding strategy that provides additional high-quality training targets yet avoids significant performance deterioration. DiffULD is inherently advanced in locating lesions with diverse sizes and shapes since it can predict with arbitrary boxes. Experiments on the benchmark dataset DeepLesion show the superiority of DiffULD when compared to state-of-the-art ULD approaches.

eess.IV↗

arXiv2023

Smaller Is Bigger: Rethinking the Embedding Rate of Deep Hiding

Deep hiding, concealing secret information using Deep Neural Networks (DNNs), can significantly increase the embedding rate and improve the efficiency of secret sharing. Existing works mainly force on designing DNNs with higher embedding rates or fancy functionalities. In this paper, we want to answer some fundamental questions: how to increase and what determines the embedding rate of deep hiding. To this end, we first propose a novel Local Deep Hiding (LDH) scheme that significantly increases the embedding rate by hiding large secret images into small local regions of cover images. Our scheme consists of three DNNs: hiding, locating, and revealing. We use the hiding network to convert a secret image in a small imperceptible compact secret code that is embedded into a random local region of a cover image. The locating network assists the revealing process by identifying the position of secret codes in the stego image, while the revealing network recovers all full-size secret images from these identified local regions. Our LDH achieves an extremely high embedding rate, i.e., $16\times24$ bpp and exhibits superior robustness to common image distortions. We also conduct comprehensive experiments to evaluate our scheme under various system settings. We further quantitatively analyze the trade-off between the embedding rate and image quality with different image restoration algorithms.

cs.MM↗

arXiv2023

Pose-Oriented Transformer with Uncertainty-Guided Refinement for 2D-to-3D Human Pose Estimation

There has been a recent surge of interest in introducing transformers to 3D human pose estimation (HPE) due to their powerful capabilities in modeling long-term dependencies. However, existing transformer-based methods treat body joints as equally important inputs and ignore the prior knowledge of human skeleton topology in the self-attention mechanism. To tackle this issue, in this paper, we propose a Pose-Oriented Transformer (POT) with uncertainty guided refinement for 3D HPE. Specifically, we first develop novel pose-oriented self-attention mechanism and distance-related position embedding for POT to explicitly exploit the human skeleton topology. The pose-oriented self-attention mechanism explicitly models the topological interactions between body joints, whereas the distance-related position embedding encodes the distance of joints to the root joint to distinguish groups of joints with different difficulties in regression. Furthermore, we present an Uncertainty-Guided Refinement Network (UGRN) to refine pose predictions from POT, especially for the difficult joints, by considering the estimated uncertainty of each joint with uncertainty-guided sampling strategy and self-attention mechanism. Extensive experiments demonstrate that our method significantly outperforms the state-of-the-art methods with reduced model parameters on 3D HPE benchmarks such as Human3.6M and MPI-INF-3DHP

cs.CV↗

arXiv2023

Mixed-order self-paced curriculum learning for universal lesion detection

Self-paced curriculum learning (SCL) has demonstrated its great potential in computer vision, natural language processing, etc. During training, it implements easy-to-hard sampling based on online estimation of data difficulty. Most SCL methods commonly adopt a loss-based strategy of estimating data difficulty and deweighting the `hard' samples in the early training stage. While achieving success in a variety of applications, SCL stills confront two challenges in a medical image analysis task, such as universal lesion detection, featuring insufficient and highly class-imbalanced data: (i) the loss-based difficulty measurer is inaccurate; ii) the hard samples are under-utilized from a deweighting mechanism. To overcome these challenges, in this paper we propose a novel mixed-order self-paced curriculum learning (Mo-SCL) method. We integrate both uncertainty and loss to better estimate difficulty online and mix both hard and easy samples in the same mini-batch to appropriately alleviate the problem of under-utilization of hard samples. We provide a theoretical investigation of our method in the context of stochastic gradient descent optimization and extensive experiments based on the DeepLesion benchmark dataset for universal lesion detection (ULD). When applied to two state-of-the-art ULD methods, the proposed mixed-order SCL method can provide a free boost to lesion detection accuracy without extra special network designs.

cs.CV↗

arXiv2022

High-field quantum spin liquid transitions and angle-field phase diagram of Kitaev magnet $α$-RuCl$_3$

The pursuit of quantum spin liquid (QSL) in the Kitaev honeycomb magnets has drawn intensive attention recently. In particular, $α$-RuCl$_3$ has been widely recognized as a promising candidate for the Kitaev QSL. Although the compound exhibits an antiferromagnetic order under zero field, it is believed to be endowed with fractionalized excitations, and can be driven to the QSL phase by magnetic fields. Here, based on a realistic $K$-$J$-$Γ$-$Γ'$ model for $α$-RuCl$_3$ [1], we exploit the exponential tensor renormalization group approach to explore the phase diagram of the compound under magnetic fields. We calculate the thermodynamic quantities, including the specific heat, Grüneisen parameter, magnetic torque, and the magnetotropic susceptibility, etc, under a magnetic field with a tilting angle $θ$ to the $c^*$-axis perpendicular to the honeycomb plane. We find an extended QSL in the angle-field phase diagram determined with thermodynamic responses. The gapless nature of such field-induced QSL is identified from the specific heat and entropy data computed down to very low temperatures. The present study provides guidance for future high-field experiments for the QSL in $α$-RuCl$_3$ and other candidate Kitaev magnets.

cond-mat.str-el↗

arXiv2022

Spin Supersolidity in Nearly Ideal Easy-axis Triangular Quantum Antiferromagnet Na$_2$BaCo(PO$_4$)$_2$

Prototypical models and their material incarnations are cornerstones to the understanding of quantum magnetism. Here we show theoretically that the recently synthesized magnetic compound Na$_2$BaCo(PO$_4$)$_2$ (NBCP) is a rare, nearly ideal material realization of the $S=1/2$ triangular-lattice antiferromagnet with significant easy-axis spin exchange anisotropy. By combining the automatic parameter searching and tensor-network simulations, we establish a microscopic model description of this material with realistic model parameters, which can not only fit well the experimental thermodynamic data but also reproduce the measured magnetization curves without further adjustment of parameters. According to the established model, the NBCP hosts a spin supersolid state that breaks both the lattice translation symmetry and the spin rotational symmetry. Such a state is a spin analogue of the long-sought supersolid state, thought to exist in solid Helium and optical lattice systems, and share similar traits. The NBCP therefore represents an ideal material-based platform to explore the physics of supersolidity as well as its quantum and thermal melting.

cond-mat.str-el↗

arXiv2022

Multi-node Acceleration for Large-scale GCNs

Limited by the memory capacity and compute power, singe-node graph convolutional neural network (GCN) accelerators cannot complete the execution of GCNs within a reasonable amount of time, due to the explosive size of graphs nowadays. Thus, large-scale GCNs call for a multi-node acceleration system (MultiAccSys) like TPU-Pod for large-scale neural networks. In this work, we aim to scale up single-node GCN accelerators to accelerate GCNs on large-scale graphs. We first identify the communication pattern and challenges of multi-node acceleration for GCNs on large-scale graphs. We observe that (1) coarse-grained communication patterns exist in the execution of GCNs in MultiAccSys, which introduces massive amount of redundant network transmissions and off-chip memory accesses; (2) overall, the acceleration of GCNs in MultiAccSys is bandwidth-bound and latency-tolerant. Guided by these two observations, we then propose MultiGCN, the first MultiAccSys for large-scale GCNs that trades network latency for network bandwidth. Specifically, by leveraging the network latency tolerance, we first propose a topology-aware multicast mechanism with a one put per multicast message-passing model to reduce transmissions and alleviate network bandwidth requirements. Second, we introduce a scatter-based round execution mechanism which cooperates with the multicast mechanism and reduces redundant off-chip memory accesses. Compared to the baseline MultiAccSys, MultiGCN achieves 4~12x speedup using only 28%~68% energy, while reducing 32% transmissions and 73% off-chip memory accesses on average. It not only achieves 2.5~8x speedup over the state-of-the-art multi-GPU solution, but also scales to large-scale graphs as opposed to single-node GCN accelerators.

cs.AR↗

arXiv2022

Real-space pairing through a confined local nematic state in cuprate superconductors

The pairing mechanism of high temperature superconductivity in cuprates is regarded as one of the most challenging issues that we are facing now. The core issue is about how the Cooper pairs are formed. There are plenty pictures concerning the pairing manner, and some of them postulate local pairing of charge freedom through the strong correlation effect. Here we report the spin resolved tunnelling measurements on extremely underdoped Bi2Sr2-xLaxCuO6-delta. Our data reveal that, when holes are doped into the system, the antiferromagnetic order is destroyed together with the filling up of the charge transfer gap by some density of states (DOS) with a maximum at about 200 meV. Consequently, an electronic structure with 4a0x4a0 basic plaquettes gradually emerges, and they become more populated versus further hole doping. In the central part of each plaquette, there are three unidirectional bars (along the Cu-O bond) enlightened by the enhanced peaks of coherence-like DOS at about +-25 meV, and the intensity is especially pronounced at oxygen sites. For the first time, we reveal an internal nematic pattern of these pairing related states which exhibit a feature of precursor gap for superconductivity. We argue that this confined nematic state within one 4a0x4a0 plaquette constitutes naturally the local pairing format. Our work shed new light in unraveling the longstanding puzzle of pairing mechanism in cuprate superconductors.

cond-mat.supr-con↗

arXiv2022

Accurate estimation of dynamical quantities for nonequilibrium nanoscale system

Fluctuations of dynamical quantities are fundamental and inevitable. For the booming research in nanotechnology, huge relative fluctuation comes with the reduction of system size, leading to large uncertainty for the estimates of dynamical quantities. Thus, increasing statistical efficiency, i.e., reducing the number of samples required to achieve a given accuracy, is of great significance for accurate estimation. Here we propose a theory as a fundamental solution for such problem by constructing auxiliary path for each real path. The states on auxiliary paths constitute canonical ensemble and share the same macroscopic properties with the initial states of the real path. By implementing the theory in molecular dynamics simulations, we obtain a nanoscale Couette flow field with an accuracy of 0.2 μm/s with relative standard error < 0.1. The required number of samples is reduced by 12 orders compared to conventional method. The predicted thermolubric behavior of water sliding on a self-assembled surface is directly validated by experiment under the same velocity. As the theory only assumes the system is initially in thermal equilibrium then driven from that equilibrium by an external perturbation, we believe it could serve as a general approach for extracting the accurate estimate of dynamical quantities from large fluctuations to provide insights on atomic level under experimental conditions, and benefit the studies on mass transport across (biological) nanochannels and fluid film lubrication of nanometer thickness.

stat.CO↗

arXiv2022

Translucency and negative temperature-dependence for the slip length of water on graphene

Carbonous materials, such as graphene and carbon nanotube, have attracted tremendous attention in the fields of nanofluidics due to the slip at the interface between solid and liquid. The dependence of slip length for water on the types of supporting substrates and thickness of carbonous layer, which is critical for applications such as sustainable cooling of electronic devices, remains unknown. In this paper, using colloidal probe atomic force microscope, we measured the slip length of water on graphene ls supported by hydrophilic and hydrophobic substrates, i.e., SiO2 and octadecyltrimethoxysilane (OTS). The ls on single-layer graphene supported by SiO2 is found to be 1.6~1.9 nm, and by OTS is 8.5~0.9 nm. With the thickness of few-layer graphene increases to 3~4 layers, both ls gradually converge to the value of graphite (4.3~3.5 nm). Such thickness dependence is termed slip length translucency. Further, ls is found to decrease by about 70% with the temperature increases from 300 K to 350 K for 2-layer graphene supported by SiO2. These observations are explained by analysis based on Green-Kubo relation and McLachlan theory. Our results provide the first set of reference values for the slip length of water on supported few-layer graphene. They can not only serve as a direct experimental reference for solid-liquid interaction, but also provide guideline for the design of nanofluidics-based devices, for example the thermo-mechanical nanofluidic devices.

physics.flu-dyn↗

arXiv2022

KPGT: Knowledge-Guided Pre-training of Graph Transformer for Molecular Property Prediction

Designing accurate deep learning models for molecular property prediction plays an increasingly essential role in drug and material discovery. Recently, due to the scarcity of labeled molecules, self-supervised learning methods for learning generalizable and transferable representations of molecular graphs have attracted lots of attention. In this paper, we argue that there exist two major issues hindering current self-supervised learning methods from obtaining desired performance on molecular property prediction, that is, the ill-defined pre-training tasks and the limited model capacity. To this end, we introduce Knowledge-guided Pre-training of Graph Transformer (KPGT), a novel self-supervised learning framework for molecular graph representation learning, to alleviate the aforementioned issues and improve the performance on the downstream molecular property prediction tasks. More specifically, we first introduce a high-capacity model, named Line Graph Transformer (LiGhT), which emphasizes the importance of chemical bonds and is mainly designed to model the structural information of molecular graphs. Then, a knowledge-guided pre-training strategy is proposed to exploit the additional knowledge of molecules to guide the model to capture the abundant structural and semantic information from large-scale unlabeled molecular graphs. Extensive computational tests demonstrated that KPGT can offer superior performance over current state-of-the-art methods on several molecular property prediction tasks.

q-bio.BM↗

arXiv2022

MVP-Net: Multiple View Pointwise Semantic Segmentation of Large-Scale Point Clouds

Semantic segmentation of 3D point cloud is an essential task for autonomous driving environment perception. The pipeline of most pointwise point cloud semantic segmentation methods includes points sampling, neighbor searching, feature aggregation, and classification. Neighbor searching method like K-nearest neighbors algorithm, KNN, has been widely applied. However, the complexity of KNN is always a bottleneck of efficiency. In this paper, we propose an end-to-end neural architecture, Multiple View Pointwise Net, MVP-Net, to efficiently and directly infer large-scale outdoor point cloud without KNN or any complex pre/postprocessing. Instead, assumption-based space filling curves and multi-rotation of point cloud methods are introduced to point feature aggregation and receptive field expanding. Numerical experiments show that the proposed MVP-Net is 11 times faster than the most efficient pointwise semantic segmentation method RandLA-Net and achieves the same accuracy on the large-scale benchmark SemanticKITTI dataset.

cs.CV↗

arXiv2022

Absolute Quantification of sp$^{3}$ Defects in Semiconducting Single-Wall Carbon Nanotubes by Raman Spectroscopy

The functionalization of semiconducting single-wall carbon nanotubes (SWCNTs) with luminescent sp$^{3}$ defects creates red-shifted emission features in the near-infrared and boosts their photoluminescence quantum yields (PLQYs). While multiple synthetic routes for the selective introduction of sp$^{3}$ defects have been developed, a convenient metric to precisely quantify the number of defects on a SWCNT lattice is not available. Here, we present a direct and simple quantification protocol based on a linear correlation of the integrated Raman D/G$^{+}$ signal ratios and defect densities as extracted from PLQY measurements. Corroborated by a statistical analysis of single-nanotube emission spectra at cryogenic temperature, this method enables the quantitative evaluation of sp$^{3}$ defect densities in (6,5) SWCNTs with an error of $\pm$ 3 defects per micrometer and the determination of oscillator strengths for different defect types. The developed protocol requires only standard Raman spectroscopy and is independent of the defect configuration, dispersion solvent and nanotube length.

cond-mat.mtrl-sci↗

arXiv2022

SATr: Slice Attention with Transformer for Universal Lesion Detection

Universal Lesion Detection (ULD) in computed tomography plays an essential role in computer-aided diagnosis. Promising ULD results have been reported by multi-slice-input detection approaches which model 3D context from multiple adjacent CT slices, but such methods still experience difficulty in obtaining a global representation among different slices and within each individual slice since they only use convolution-based fusion operations. In this paper, we propose a novel Slice Attention Transformer (SATr) block which can be easily plugged into convolution-based ULD backbones to form hybrid network structures. Such newly formed hybrid backbones can better model long-distance feature dependency via the cascaded self-attention modules in the Transformer block while still holding a strong power of modeling local features with the convolutional operations in the original backbone. Experiments with five state-of-the-art methods show that the proposed SATr block can provide an almost free boost to lesion detection accuracy without extra hyperparameters or special network designs.

eess.IV↗

arXiv2022

DNN Training Acceleration via Exploring GPGPU Friendly Sparsity

The training phases of Deep neural network~(DNN) consumes enormous processing time and energy. Compression techniques utilizing the sparsity of DNNs can effectively accelerate the inference phase of DNNs. However, it is hardly used in the training phase because the training phase involves dense matrix-multiplication using General-Purpose Computation on Graphics Processors (GPGPU), which endorse the regular and structural data layout. In this paper, we first propose the Approximate Random Dropout that replaces the conventional random dropout of neurons and synapses with a regular and online generated row-based or tile-based dropout patterns to eliminate the unnecessary computation and data access for the multilayer perceptron~(MLP) and long short-term memory~(LSTM). We then develop a SGD-based Search Algorithm that produces the distribution of row-based or tile-based dropout patterns to compensate for the potential accuracy loss. Moreover, aiming at the convolution neural network~(CNN) training acceleration, we first explore the importance and sensitivity of input feature maps; and then propose the sensitivity-aware dropout method to dynamically drop the input feature maps based on their sensitivity so as to achieve greater forward and backward training acceleration while reserving better NN accuracy. To facilitate DNN programming, we build a DNN training computation framework that unifies the proposed techniques in the software stack. As a result, the GPGPU only needs to support the basic operator -- matrix multiplication and can achieve significant performance improvement regardless of DNN model.

cs.LG↗