arXiv subjects

Liang Zhang

Publications and source records attributed to Liang Zhang.

At least 379 records · Page 21Linked to original sources

arXiv2020

Time lags of the type-B QPO in MAXI J1348-630

The fast variability observed in the X-ray emission from black-hole binaries has a very complex phenomenology, but offers the possibility to investigate directly the properties of the inner accretion flow. In particular, type-B oscillations in the 2-8 Hz range, observed in the Soft-Intermediate state, have been associated to the emission from a relativistic jet. We present the results of the timing and spectral analysis of a set of observations of the bright transient MAXI J1348-630 made with the NICER telescope. The observations are in the brightest part of the outburst and all feature a strong type-B QPO at ~4.5 Hz. We compute the energy dependence of the fractional rms and the phase lags at the QPO frequency, obtaining high signal-to-noise data and sampling for the first time at energies below 2 keV. The fractional rms decreases from more than 10% at 9 keV to 0.6% at 1.5 keV, and is constant below that energy. Taking the 2-3 keV band as reference, photons at all energies show a hard lag, increasing with the distance from the reference band. The behaviour below 2 keV has never been observed before, due to the higher energy bandpass of previous timing instruments. The energy spectrum can be fitted with a standard model for this state, consisting of a thin disc component and a harder power law, plus an emission line between 6 and 7 keV. We discuss the results, concentrating on the phase lags, and show that they can be interpreted within a Comptonization model.

astro-ph.HE↗

arXiv2020

On Vocabulary Reliance in Scene Text Recognition

The pursuit of high performance on public benchmarks has been the driving force for research in scene text recognition, and notable progress has been achieved. However, a close investigation reveals a startling fact that the state-of-the-art methods perform well on images with words within vocabulary but generalize poorly to images with words outside vocabulary. We call this phenomenon "vocabulary reliance". In this paper, we establish an analytical framework to conduct an in-depth study on the problem of vocabulary reliance in scene text recognition. Key findings include: (1) Vocabulary reliance is ubiquitous, i.e., all existing algorithms more or less exhibit such characteristic; (2) Attention-based decoders prove weak in generalizing to words outside vocabulary and segmentation-based decoders perform well in utilizing visual features; (3) Context modeling is highly coupled with the prediction layers. These findings provide new insights and can benefit future research in scene text recognition. Furthermore, we propose a simple yet effective mutual learning strategy to allow models of two families (attention-based and segmentation-based) to learn collaboratively. This remedy alleviates the problem of vocabulary reliance and improves the overall scene text recognition performance.

cs.CV↗

arXiv2020

Structures and Properties of $β$-Titanium Doping Trace Transition Metal Elements: a Density Functional Theory Study

We systematically calculate the structure, formation enthalpy, formation free energy, elastic constants and electronic structure of Ti$_{0.98}$X$_{0.02}$ system by density functional theory (DFT) simulations to explore the effect of transition metal X (X=Ag, Cd, Co, Cr, Cu, Fe, Mn, Mo, Nb, Ni, Pd, Rh, Ru, Tc, and Zn) on the stability mechanism of $β$-titanium. Based on our calculations, the results of formation enthalpy and free energy show that adding trace X is beneficial to the thermodynamic stability of $β$-titanium. This behavior is well explained by the density of state (DOS). However, the tetragonal shear moduli of Ti$_{0.98}$X$_{0.02}$ systems are negative, indicating that $β$-titanium doping with a low concentration of X is still elastically unstable at 0 K. Therefore, we theoretically explain that $β$-titanium doping with trace transition metal X is unstable in the ground state.

cond-mat.mtrl-sci↗

arXiv2020

COVID-19 Chest CT Image Segmentation -- A Deep Convolutional Neural Network Solution

A novel coronavirus disease 2019 (COVID-19) was detected and has spread rapidly across various countries around the world since the end of the year 2019, Computed Tomography (CT) images have been used as a crucial alternative to the time-consuming RT-PCR test. However, pure manual segmentation of CT images faces a serious challenge with the increase of suspected cases, resulting in urgent requirements for accurate and automatic segmentation of COVID-19 infections. Unfortunately, since the imaging characteristics of the COVID-19 infection are diverse and similar to the backgrounds, existing medical image segmentation methods cannot achieve satisfactory performance. In this work, we try to establish a new deep convolutional neural network tailored for segmenting the chest CT images with COVID-19 infections. We firstly maintain a large and new chest CT image dataset consisting of 165,667 annotated chest CT images from 861 patients with confirmed COVID-19. Inspired by the observation that the boundary of the infected lung can be enhanced by adjusting the global intensity, in the proposed deep CNN, we introduce a feature variation block which adaptively adjusts the global properties of the features for segmenting COVID-19 infection. The proposed FV block can enhance the capability of feature representation effectively and adaptively for diverse cases. We fuse features at different scales by proposing Progressive Atrous Spatial Pyramid Pooling to handle the sophisticated infection areas with diverse appearance and shapes. We conducted experiments on the data collected in China and Germany and show that the proposed deep CNN can produce impressive performance effectively.

eess.IV↗

arXiv2020

Prediction of mechanical properties of non-equiatomic high-entropy alloy by atomistic simulation and machine learning

High-entropy alloys (HEAs) with multiple constituent elements have been extensively studied in the past 20 years due to their promising engineering application. Previous experimental and computational studies of HEAs focused mainly on equiatomic or near equiatomic HEAs. However, there is probably far more treasure in those non-equiatomic HEAs with carefully designed composition. In this study, molecular dynamics (MD) simulation combined with machine learning (ML) methods were used to predict the mechanical properties of non-equiatomic CuFeNiCrCo HEAs. A database was established based on a tensile test of 900 HEA single-crystal samples by MD simulation. We investigated and compared eight ML models for the learning tasks, ranging from shallow models to deep models. It was found that the kernel-based extreme learning machine (KELM) model outperformed others for the prediction of yield stress and Young's modulus. The accuracy of the KELM model was further verified by the large-sized polycrystal HEA samples.

cond-mat.mtrl-sci↗

arXiv2020

A Systematic Analysis of the Phase Lags Associated with the Type-C Quasi-periodic Oscillation in GRS 1915+105

We present a systematic analysis of the phase lags associated with the type-C QPOs in GRS 1915+105 using RXTE data. Our sample comprises of 620 RXTE observations with type-C QPOs ranging from ~0.4 Hz to ~6.3 Hz. Based on our analysis, we confirm that the QPO phase lags decrease with QPO frequency, and change sign from positive to negative at a QPO frequency of ~2 Hz. In addition, we find that the slope of this relation is significantly different between QPOs below and above 2 Hz. The relation between the QPO lags and QPO rms can be well fitted with a broken line: as the QPO lags go from negative to positive, the QPO rms first increases, reaching its maximum at around zero lag, and then decreases. The phase-lag behaviour of the subharmonic of the QPO is similar to that of the QPO fundamental, where the subharmonic lags decrease with subharmonic frequency and change sign from positive to negative at a subharmonic frequency of ~1 Hz; on the contrary, the second harmonic of the QPO shows a quite different phase-lag behaviour, where all the second harmonics show hard lags that remain more or less constant. For both the QPO and its (sub)harmonics, the slope of the lag-energy spectra shows a similar evolution with frequency as the average phase lags. This suggests that the lag-energy spectra drives the average phase lags. We discuss the possibility for the change in lag sign, and the physical origin of the QPO lags.

astro-ph.HE↗

arXiv2020

Towards Label-Free 3D Segmentation of Optical Coherence Tomography Images of the Optic Nerve Head Using Deep Learning

Since the introduction of optical coherence tomography (OCT), it has been possible to study the complex 3D morphological changes of the optic nerve head (ONH) tissues that occur along with the progression of glaucoma. Although several deep learning (DL) techniques have been recently proposed for the automated extraction (segmentation) and quantification of these morphological changes, the device specific nature and the difficulty in preparing manual segmentations (training data) limit their clinical adoption. With several new manufacturers and next-generation OCT devices entering the market, the complexity in deploying DL algorithms clinically is only increasing. To address this, we propose a DL based 3D segmentation framework that is easily translatable across OCT devices in a label-free manner (i.e. without the need to manually re-segment data for each device). Specifically, we developed 2 sets of DL networks. The first (referred to as the enhancer) was able to enhance OCT image quality from 3 OCT devices, and harmonized image-characteristics across these devices. The second performed 3D segmentation of 6 important ONH tissue layers. We found that the use of the enhancer was critical for our segmentation network to achieve device independency. In other words, our 3D segmentation network trained on any of 3 devices successfully segmented ONH tissue layers from the other two devices with high performance (Dice coefficients > 0.92). With such an approach, we could automatically segment images from new OCT devices without ever needing manual segmentation data from such devices.

eess.IV↗

arXiv2020

Adversarial Data Encryption

In the big data era, many organizations face the dilemma of data sharing. Regular data sharing is often necessary for human-centered discussion and communication, especially in medical scenarios. However, unprotected data sharing may also lead to data leakage. Inspired by adversarial attack, we propose a method for data encryption, so that for human beings the encrypted data look identical to the original version, but for machine learning methods they are misleading. To show the effectiveness of our method, we collaborate with the Beijing Tiantan Hospital, which has a world leading neurological center. We invite $3$ doctors to manually inspect our encryption method based on real world medical images. The results show that the encrypted images can be used for diagnosis by the doctors, but not by machine learning methods.

cs.LG↗

arXiv2020

LinearPartition: Linear-Time Approximation of RNA Folding Partition Function and Base Pairing Probabilities

RNA secondary structure prediction is widely used to understand RNA function. Recently, there has been a shift away from the classical minimum free energy (MFE) methods to partition function-based methods that account for folding ensembles and can therefore estimate structure and base pair probabilities. However, the classical partition function algorithm scales cubically with sequence length, and is therefore a slow calculation for long sequences. This slowness is even more severe than cubic-time MFE-based methods due to a larger constant factor in runtime. Inspired by the success of our recently proposed LinearFold algorithm that predicts the approximate MFE structure in linear time, we design a similar linear-time heuristic algorithm, LinearPartition, to approximate the partition function and base pairing probabilities, which is shown to be orders of magnitude faster than Vienna RNAfold and CONTRAfold (e.g., 2.5 days vs. 1.3 minutes on a sequence with length 32,753 nt). More interestingly, the resulting base pairing probabilities are even better correlated with the ground truth structures. LinearPartition also leads to a small accuracy improvement when used for downstream structure prediction on families with the longest length sequences (16S and 23S rRNA), as well as a substantial improvement on long-distance base pairs (500+ nt apart).

q-bio.BM↗

arXiv2020

Efficient Scene Text Detection with Textual Attention Tower

Scene text detection has received attention for years and achieved an impressive performance across various benchmarks. In this work, we propose an efficient and accurate approach to detect multioriented text in scene images. The proposed feature fusion mechanism allows us to use a shallower network to reduce the computational complexity. A self-attention mechanism is adopted to suppress false positive detections. Experiments on public benchmarks including ICDAR 2013, ICDAR 2015 and MSRA-TD500 show that our proposed approach can achieve better or comparable performances with fewer parameters and less computational cost.

cs.CV↗

arXiv2020

Structure-Feature based Graph Self-adaptive Pooling

Various methods to deal with graph data have been proposed in recent years. However, most of these methods focus on graph feature aggregation rather than graph pooling. Besides, the existing top-k selection graph pooling methods have a few problems. First, to construct the pooled graph topology, current top-k selection methods evaluate the importance of the node from a single perspective only, which is simplistic and unobjective. Second, the feature information of unselected nodes is directly lost during the pooling process, which inevitably leads to a massive loss of graph feature information. To solve these problems mentioned above, we propose a novel graph self-adaptive pooling method with the following objectives: (1) to construct a reasonable pooled graph topology, structure and feature information of the graph are considered simultaneously, which provide additional veracity and objectivity in node selection; and (2) to make the pooled nodes contain sufficiently effective graph information, node feature information is aggregated before discarding the unimportant nodes; thus, the selected nodes contain information from neighbor nodes, which can enhance the use of features of the unselected nodes. Experimental results on four different datasets demonstrate that our method is effective in graph classification and outperforms state-of-the-art graph pooling methods.

cs.SI↗

arXiv2020

ThreshKnot: Thresholded ProbKnot for Improved RNA Secondary Structure Prediction

RNA structure prediction is a challenging problem, especially with pseudoknots. Recently, there has been a shift from the classical minimum free energy-based methods (MFE) to partition function-based ones that assemble structures using base-pairing probabilities. Two examples of the latter group are the popular maximum expected accuracy (MEA) method and the ProbKnot method. ProbKnot is a fast heuristic that pairs nucleotides that are reciprocally most probable pairing partners, and unlike MEA, can also predict structures with pseudoknots. However, ProbKnot's full potential has been largely overlooked. In particular, when introduced, it did not have an MEA-like hyperparameter that can balance between positive predictive value (PPV) and sensitivity. We show that a simple thresholded version of ProbKnot, which we call ThreshKnot, leads to more accurate overall predictions by filtering out unlikely pairs whose probabilities fall under a given threshold. We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm in (1) its higher structure prediction accuracy, (2) its capability to predict pseudoknots, and (3) its faster runtime and easier implementation. This suggests that ThreshKnot should replace MEA as the default partition function-based structure prediction algorithm. ThreshKnot is already available in the widely used RNAstructure software package version 6.2 (released November 27, 2019): https://rna.urmc.rochester.edu/RNAstructure.html

q-bio.BM↗

arXiv2019

Ring Polymer Molecular Dynamics in Gas-Surface Reactions: Inclusion of Quantum Effects Made Simple

Accurately modeling gas-surface collision dynamics presents a great challenge for theory, especially in the low energy (or temperature) regime where quantum effects are important. Here, a path integral based non-equilibrium ring polymer molecular dynamics (NE-RPMD) approach is adapted to calculate dissociative initial sticking probabilities (S0) of H2 on Cu(111) and D2O on Ni(111), revealing distinct quantum nature in the two benchmark surface reactions. NE-RPMD successfully captures quantum tunneling in H2 dissociation at very low energies, where the quasi-classical trajectory (QCT) method suddenly fails. Additionally, QCT substantially overestimates S0 of D2O due to severe zero point energy (ZPE) leakage, even at collision energies higher than the ZPE-corrected barrier. Immune to such a problem, NE-RPMD predicts S0 values of D2O in much improved agreement with the benchmark results obtained by the accurate but expensive quantum wavepacket method. Our results suggest NE-RPMD as a promising approach to model quantum effects in gas-surface reactions.

physics.chem-ph↗

arXiv2019

Relation Graph Network for 3D Object Detection in Point Clouds

Convolutional Neural Networks (CNNs) have emerged as a powerful strategy for most object detection tasks on 2D images. However, their power has not been fully realised for detecting 3D objects in point clouds directly without converting them to regular grids. Existing state-of-art 3D object detection methods aim to recognize 3D objects individually without exploiting their relationships during learning or inference. In this paper, we first propose a strategy that associates the predictions of direction vectors and pseudo geometric centers together leading to a win-win solution for 3D bounding box candidates regression. Secondly, we propose point attention pooling to extract uniform appearance features for each 3D object proposal, benefiting from the learned direction features, semantic features and spatial coordinates of the object points. Finally, the appearance features are used together with the position features to build 3D object-object relationship graphs for all proposals to model their co-existence. We explore the effect of relation graphs on proposals' appearance features enhancement under supervised and unsupervised settings. The proposed relation graph network consists of a 3D object proposal generation module and a 3D relation module, makes it an end-to-end trainable network for detecting 3D object in point clouds. Experiments on challenging benchmarks ( SunRGB-Dand ScanNet datasets ) of 3D point clouds show that our algorithm can perform better than the existing state-of-the-art methods.

cs.CV↗

arXiv2019

Beyond 100 THz-spanning ultraviolet frequency combs in a non-centrosymmetric crystalline waveguide

Ultraviolet frequency combs enable applications ranging from precision spectroscopy to atomic clocks by addressing the electronic transitions of atoms and molecules. Access to ultraviolet light via integrated nonlinear optics is usually hampered by the strong material dispersion and large waveguide attention in the ultraviolet region. Here we demonstrate a simple route to chip-scale ultraviolet comb generators, simultaneously showing a gap-free frequency span of ~128 terahertz and supercontinuum sourced by an ultrafast fiber laser. The simultaneous cubic and quadratic nonlinear processes are implemented in single-crystalline aluminum nitride thin films, where a chirp-modulated taper waveguide is patterned to ensure a broad phase matching. The heterodyne beatnote characterization suggests that both the near-visible and ultraviolet supercontinuum combs maintain a high degree of coherence. Our approach is also adaptable to other non-centrosymmetric photonic platforms for ultrafast nonlinear optics with scalable bandwidth.

physics.optics↗

arXiv2019

Beyond Similarity: Relation Embedding with Dual Attentions for Item-based Recommendation

Given the effectiveness and ease of use, Item-based Collaborative Filtering (ICF) methods have been broadly used in industry in recent years. The key of ICF lies in the similarity measurement between items, which however is a coarse-grained numerical value that can hardly capture users' fine-grained preferences toward different latent aspects of items from a representation learning perspective. In this paper, we propose a model called REDA (latent Relation Embedding with Dual Attentions) to address this challenge. REDA is essentially a deep learning based recommendation method that employs an item relation embedding scheme through a neural network structure for inter-item relations representation. A relational user embedding is then proposed by aggregating the relation embeddings between all purchased items of a user, which not only better characterizes user preferences but also alleviates the data sparsity problem. Moreover, to capture valid meta-knowledge that reflects users' desired latent aspects and meanwhile suppress their explosive growth towards overfitting, we further propose a dual attentions mechanism, including a memory attention and a weight attention. A relation-wise optimization method is finally developed for model inference by constructing a personalized ranking loss for item relations. Extensive experiments are implemented on real-world datasets and the proposed model is shown to greatly outperform state-of-the-art methods, especially when the data is sparse.

cs.IR↗

arXiv2019

Regularized Adversarial Sampling and Deep Time-aware Attention for Click-Through Rate Prediction

Improving the performance of click-through rate (CTR) prediction remains one of the core tasks in online advertising systems. With the rise of deep learning, CTR prediction models with deep networks remarkably enhance model capacities. In deep CTR models, exploiting users' historical data is essential for learning users' behaviors and interests. As existing CTR prediction works neglect the importance of the temporal signals when embed users' historical clicking records, we propose a time-aware attention model which explicitly uses absolute temporal signals for expressing the users' periodic behaviors and relative temporal signals for expressing the temporal relation between items. Besides, we propose a regularized adversarial sampling strategy for negative sampling which eases the classification imbalance of CTR data and can make use of the strong guidance provided by the observed negative CTR samples. The adversarial sampling strategy significantly improves the training efficiency, and can be co-trained with the time-aware attention model seamlessly. Experiments are conducted on real-world CTR datasets from both in-station and out-station advertising places.

cs.LG↗

arXiv2019

Backhaul-aware Uplink Communications in Full-Duplex DBS-aided HetNets

Drone-mounted base stations (DBSs) are promising solutions to provide ubiquitous connections to users and support many applications in the fifth generation of mobile networks while full duplex communications has the potential to improve the spectrum efficiency. In this paper, we have investigated the backhaul-aware uplink communications in a full-duplex DBS-aided HetNet (BUD) problem with the objective to maximize the total throughput of the network, and this problem is decomposed into two sub-problems: the DBS Placement problem (including the vertical dimension and horizontal dimensions) and the joint UE association, power and bandwidth assignment (Joint-UPB) problem. Since the BUD problem is NP-hard, we propose approximation algorithms to solve the sub-problems and another, named the AA-BUD algorithm, to solve the BUD problem with guaranteed performance. The performance of the AA-BUD algorithm has been demonstrated via extensive simulations, and it is superior to two benchmark algorithms with up to 45.8% throughput improvement.

cs.NI↗