Search arXiv⌕ Search

arXiv subjects

Tao Jiang

Publications and source records attributed to Tao Jiang.

At least 181 records · Page 10Linked to original sources

Thickness dependence of superconductivity in FeSe films

The films of FeSe on substrates have attracted attention because of their unusually high-temperature (Tc) superconducting properties whose origins continue to be debated. To disentangle the competing effects of the substrate and interlayer and intralayer processes, we present here results of density functional theory (DFT)-based analysis of the electronic structure of unsupported FeSe films consisting of 1 to 5 layers (1L-5L). Furthermore, by solving the Bardeen-Schrieffer-Cooper (BCS) equation with spin-wave exchange attraction derived from the Hubbard model, we find the superconducting critical temperature Tc for 1L-5L and bulk FeSe systems in reasonable agreement with experimental data. Our results point to the importance of correlation effects in superconducting properties of single- and multi-layer FeSe films, independently of the role of substrate.

cond-mat.supr-con↗

Negligible obstructions and Turán exponents

We show that for every rational number $r \in (1,2)$ of the form $2 - a/b$, where $a, b \in \mathbb{N}^+$ satisfy $\lfloor b/a \rfloor^3 \le a \le b / (\lfloor b/a \rfloor +1) + 1$, there exists a graph $F_r$ such that the Turán number $\operatorname{ex}(n, F_r) = Θ(n^r)$. Our result in particular generates infinitely many new Turán exponents. As a byproduct, we formulate a framework that is taking shape in recent work on the Bukh--Conlon conjecture.

math.CO↗

Re-embedding data to strengthen recovery guarantees of clustering

We propose a clustering method that involves chaining four known techniques into a pipeline yielding an algorithm with stronger recovery guarantees than any of the four components separately. Given $n$ points in $\mathbb R^d$, the first component of our pipeline, which we call leapfrog distances, is reminiscent of density-based clustering, yielding an $n\times n$ distance matrix. The leapfrog distances are then translated to new embeddings using multidimensional scaling and spectral methods, two other known techniques, yielding new embeddings of the $n$ points in $\mathbb R^{d'}$, where $d'$ satisfies $d'\ll d$ in general. Finally, sum-of-norms (SON) clustering is applied to the re-embedded points. Although the fourth step (SON clustering) can in principle be replaced by any other clustering method, our focus is on provable guarantees of recovery of underlying structure. Therefore, we establish that the re-embedding improves recovery SON clustering, since SON clustering is a well-studied method that already has provable guarantees.

cs.LG↗

Towards A Unified Conformer Structure: from ASR to ASV Task

Transformer has achieved extraordinary performance in Natural Language Processing and Computer Vision tasks thanks to its powerful self-attention mechanism, and its variant Conformer has become a state-of-the-art architecture in the field of Automatic Speech Recognition (ASR). However, the main-stream architecture for Automatic Speaker Verification (ASV) is convolutional Neural Networks, and there is still much room for research on the Conformer based ASV. In this paper, firstly, we modify the Conformer architecture from ASR to ASV with very minor changes. Length-Scaled Attention (LSA) method and Sharpness-Aware Minimizationis (SAM) are adopted to improve model generalization. Experiments conducted on VoxCeleb and CN-Celeb show that our Conformer based ASV achieves competitive performance compared with the popular ECAPA-TDNN. Secondly, inspired by the transfer learning strategy, ASV Conformer is natural to be initialized from the pretrained ASR model. Via parameter transferring, self-attention mechanism could better focus on the relationship between sequence features, brings about 11% relative improvement in EER on test set of VoxCeleb and CN-Celeb, which reveals the potential of Conformer to unify ASV and ASR task. Finally, we provide a runtime in ASV-Subtools to evaluate its inference speed in production scenario. Our code is released at https://github.com/Snowdar/asv-subtools/tree/master/doc/papers/conformer.md.

eess.AS↗

Bipartite-ness under smooth conditions

Given a family $\mathcal{F}$ of bipartite graphs, the {\it Zarankiewicz number} $z(m,n,\mathcal{F})$ is the maximum number of edges in an $m$ by $n$ bipartite graph $G$ that does not contain any member of $\mathcal{F}$ as a subgraph (such $G$ is called {\it $\mathcal{F}$-free}). For $1\leq β<α<2$, a family $\mathcal{F}$ of bipartite graphs is $(α,β)$-{\it smooth} if for some $ρ>0$ and every $m\leq n$, $z(m,n,\mathcal{F})=ρm n^{α-1}+O(n^β)$. Motivated by their work on a conjecture of Erdős and Simonovits on compactness and a classic result of Andrásfai, Erdős and Sós, in \cite{AKSV} Allen, Keevash, Sudakov and Verstraëte proved that for any $(α,β)$-smooth family $\mathcal{F}$, there exists $k_0$ such that for all odd $k\geq k_0$ and sufficiently large $n$, any $n$-vertex $\mathcal{F}\cup\{C_k\}$-free graph with minimum degree at least $ρ(\frac{2n}{5}+o(n))^{α-1}$ is bipartite. In this paper, we strengthen their result by showing that for every real $δ>0$, there exists $k_0$ such that for all odd $k\geq k_0$ and sufficiently large $n$, any $n$-vertex $\mathcal{F}\cup\{C_k\}$-free graph with minimum degree at least $δn^{α-1}$ is bipartite. Furthermore, our result holds under a more relaxed notion of smoothness, which include the families $\mathcal{F}$ consisting of the single graph $K_{s,t}$ when $t\gg s$. We also prove an analogous result for $C_{2\ell}$-free graphs for every $\ell\geq 2$, which complements a result of Keevash, Sudakov and Verstraëte in \cite{KSV}.

math.CO↗

Rainbow Turán number of clique subdivisions

We show that for any integer $t\geq 2$, every properly edge-coloured graph on $n$ vertices with more than $n^{1+o(1)}$ edges contains a rainbow subdivision of $K_t$. Note that this bound on the number of edges is sharp up to the $o(1)$ error term. This is a rainbow analogue of some classical results on clique subdivisions and extends some results on rainbow Turán numbers. Our method relies on the framework introduced by Sudakov and Tomon[2020] which we adapt to find robust expanders in the coloured setting.

math.CO↗

A linearly convergent Gauss-Newton subgradient method for ill-conditioned problems

We analyze a preconditioned subgradient method for optimizing composite functions $h \circ c$, where $h$ is a locally Lipschitz function and $c$ is a smooth nonlinear mapping. We prove that when $c$ satisfies a constant rank property and $h$ is semismooth and sharp on the image of $c$, the method converges linearly. In contrast to standard subgradient methods, its oracle complexity is invariant under reparameterizations of $c$.

math.OC↗

Ultrafast formation of topological defects in a 2D charge density wave

Topological defects play a key role in nonequilibrium phase transitions, ranging from birth of the early universe to quantum critical behavior of ultracold atoms. In solids, transient defects are known to generate a variety of hidden orders not accessible in equilibrium, but how defects are formed at the nanometer lengthscale and femtosecond timescale remains unknown. Here, we employ an intense laser pulse to create topological defects in a 2D charge density wave, and track their morphology and dynamics with ultrafast electron diffraction. Leveraging its high temporal resolution and sensitivity in detecting weak diffuse signals, we discover a dual-stage growth of 1D domain walls within 1 ps, a process not dictated by the order parameter amplitude but instead mediated by a nonthermal population of longitudinal optical phonons. Our work provides a framework for ultrafast engineering of topological defects based on selective excitation of collective modes, opening new avenues for dynamical control of nonequilibrium phases in correlated materials.

cond-mat.mtrl-sci↗

Stacking order and interlayer coupling tuning the properties of charge density waves in layered 1T-NbSe_2

Layered transition metal dichalcogenide 1T-NbSe_2 is a good candidate to explore the charge density wave (CDW) and Mott physics. However, the effects of stacking orders and interlayer coupling in CDW 1T-NbSe_2 are still less explored and understood. Using density functional theory calculations, we present a systematic study of the electronic and magnetic properties of monolayer and layered CDW 1T-NbSe_2. Our results indicate that monolayer CDW 1T-NbSe_2 is a magnetic insulator with \sqrt13\times\sqrt13 periodic lattice modulation. Nevertheless, the magnetic properties of bilayer CDWs 1T-NbSe_2 are found stacking orders dependence. The mechanism is understood by the changes of local magnetic moments in each layer due to spin charge transfer between interlayers. Furthermore, the bulk CDW 1T-NbSe_2 opens a band gap with 0.02 eV in 1\times 1 \times 2 supercell due to the interlayer spin coupling. We also discover that the electronic structures of layered 1T-NbSe_2 show a strong dependence on stacking configurations and dimensionality.

cond-mat.str-el↗

Role of Deep Learning in Wireless Communications

Traditional communication system design has always been based on the paradigm of first establishing a mathematical model of the communication channel, then designing and optimizing the system according to the model. The advent of modern machine learning techniques, specifically deep neural networks, has opened up opportunities for data-driven system design and optimization. This article draws examples from the optimization of reconfigurable intelligent surface, distributed channel estimation and feedback for multiuser beamforming, and active sensing for millimeter wave (mmWave) initial alignment to illustrate that a data-driven design that bypasses explicit channel modelling can often discover excellent solutions to communication system design and optimization problems that are otherwise computationally difficult to solve. We show that by performing an end-to-end training of a deep neural network using a large number of channel samples, a machine learning based approach can potentially provide significant system-level improvements as compared to the traditional model-based approach for solving optimization problems. The key to the successful applications of machine learning techniques is in choosing the appropriate neural network architecture to match the underlying problem structure.

cs.IT↗

An application of Pixel Interval Down-sampling (PID) for dense tiny microorganism counting on environmental microorganism images

This paper proposes a novel pixel interval down-sampling network (PID-Net) for dense tiny object (yeast cells) counting tasks with higher accuracy. The PID-Net is an end-to-end convolutional neural network (CNN) model with an encoder--decoder architecture. The pixel interval down-sampling operations are concatenated with max-pooling operations to combine the sparse and dense features. This addresses the limitation of contour conglutination of dense objects while counting. The evaluation was conducted using classical segmentation metrics (the Dice, Jaccard and Hausdorff distance) as well as counting metrics. The experimental results show that the proposed PID-Net had the best performance and potential for dense tiny object counting tasks, which achieved 96.97\% counting accuracy on the dataset with 2448 yeast cell images. By comparing with the state-of-the-art approaches, such as Attention U-Net, Swin U-Net and Trans U-Net, the proposed PID-Net can segment dense tiny objects with clearer boundaries and fewer incorrect debris, which shows the great potential of PID-Net in the task of accurate counting.

cs.CV↗

Stochastic Variational Methods in Generalized Hidden Semi-Markov Models to Characterize Functionality in Random Heteropolymers

Recent years have seen substantial advances in the development of biofunctional materials using synthetic polymers. The growing problem of elusive sequence-functionality relations for most biomaterials has driven researchers to seek more effective tools and analysis methods. In this study, statistical models are used to study sequence features of the recently reported random heteropolymers (RHP), which transport protons across lipid bilayers selectively and rapidly like natural proton channels. We utilized the probabilistic graphical model framework and developed a generalized hidden semi-Markov model (GHSMM-RHP) to extract the function-determining sequence features, including the transmembrane segments within a chain and the sequence heterogeneity among different chains. We developed stochastic variational methods for efficient inference on parameter estimation and predictions, and empirically studied their computational performance from a comparative perspective on Bayesian (i.e., stochastic variational Bayes) versus frequentist (i.e., stochastic variational expectation-maximization) frameworks that have been studied separately before. The real data results agree well with the laboratory experiments, and suggest GHSMM-RHP's potential in predicting protein-like behavior at the polymer-chain level.

q-bio.QM↗

KaraTuner: Towards end to end natural pitch correction for singing voice in karaoke

An automatic pitch correction system typically includes several stages, such as pitch extraction, deviation estimation, pitch shift processing, and cross-fade smoothing. However, designing these components with strategies often requires domain expertise and they are likely to fail on corner cases. In this paper, we present KaraTuner, an end-to-end neural architecture that predicts pitch curve and resynthesizes the singing voice directly from the tuned pitch and vocal spectrum extracted from the original recordings. Several vital technical points have been introduced in KaraTuner to ensure pitch accuracy, pitch naturalness, timbre consistency, and sound quality. A feed-forward Transformer is employed in the pitch predictor to capture longterm dependencies in the vocal spectrum and musical note. We also develop a pitch-controllable vocoder based on a novel source-filter block and the Fre-GAN architecture. KaraTuner obtains a higher preference than the rule-based pitch correction approach through A/B tests, and perceptual experiments show that the proposed vocoder achieves significant advantages in timbre consistency and sound quality compared with the parametric WORLD vocoder, phase vocoder and CLPC vocoder.

cs.SD↗

Sensor-Assisted Rate Adaptation for UAV MU-MIMO Networks

Propelled by multi-user MIMO (MU-MIMO) technology, unmanned aerial vehicles (UAVs) as mobile hotspots have recently emerged as an attractive wireless communication paradigm. Rate adaptation (RA) becomes indispensable to enhance UAV communication robustness against UAV mobility-induced channel variances. However, existing MU-MIMO RA algorithms are mainly designed for ground communications with relatively stable channel coherence time, which incurs channel measurement staleness and sub-optimal rate selections when coping with highly dynamic air-to-ground links. In this paper, we propose SensRate, a new uplink MU-MIMO RA algorithm dedicated for low-altitude UAVs, which exploits inherent onboard sensors used for flight control with no extra cost. We propose a novel channel prediction algorithm that utilizes sensor-estimated flight states to assist channel direction prediction for each client and estimate inter-user interference for optimal rates. We provide an implementation of our design using a commercial UAV and show that it achieves an average throughput gain of 1.24\times and 1.28\times compared with the bestknown RA algorithm for 2- and 3-antenna APs, respectively

cs.NI↗

CVM-Cervix: A Hybrid Cervical Pap-Smear Image Classification Framework Using CNN, Visual Transformer and Multilayer Perceptron

Cervical cancer is the seventh most common cancer among all the cancers worldwide and the fourth most common cancer among women. Cervical cytopathology image classification is an important method to diagnose cervical cancer. Manual screening of cytopathology images is time-consuming and error-prone. The emergence of the automatic computer-aided diagnosis system solves this problem. This paper proposes a framework called CVM-Cervix based on deep learning to perform cervical cell classification tasks. It can analyze pap slides quickly and accurately. CVM-Cervix first proposes a Convolutional Neural Network module and a Visual Transformer module for local and global feature extraction respectively, then a Multilayer Perceptron module is designed to fuse the local and global features for the final classification. Experimental results show the effectiveness and potential of the proposed CVM-Cervix in the field of cervical Pap smear image classification. In addition, according to the practical needs of clinical work, we perform a lightweight post-processing to compress the model.

cs.CV↗

Calibration Strategy of the JUNO-TAO Experiment

The Taishan Antineutrino Observatory (JUNO-TAO, or TAO) is a satellite detector for the Jiangmen Underground Neutrino Observatory (JUNO). Located near the Taishan reactor, TAO independently measures the reactor's antineutrino energy spectrum with unprecedented energy resolution. To achieve this goal, energy response must be well calibrated. Using the Automated Calibration Unit (ACU) and the Cable Loop System (CLS) of TAO, multiple radioactive sources are deployed to various positions in the detector to perform a precise calibration of energy response. The non-linear energy response can be controlled within 0.6% with different energy points of these radioactive sources. It can be further improved by using $^{12}\rm B$ decay signals produced by cosmic muons. Through the energy non-uniformity calibration, residual non-uniformity is less than 0.2%. The energy resolution degradation and energy bias caused by the residual non-uniformity can be controlled within 0.05% and 0.3%, respectively. In addition, the stability of other detector parameters, such as the gain of each silicon photo-multiplier, can be monitored with a special ultraviolet LED calibration system.

physics.ins-det↗

Learning Based User Scheduling in Reconfigurable Intelligent Surface Assisted Multiuser Downlink

Reconfigurable intelligent surface (RIS) is capable of intelligently manipulating the phases of the incident electromagnetic wave to improve the wireless propagation environment between the base-station (BS) and the users. This paper addresses the joint user scheduling, RIS configuration, and BS beamforming problem in an RIS-assisted downlink network with limited pilot overhead. We show that graph neural networks (GNN) with permutation invariant and equivariant properties can be used to appropriately schedule users and to design RIS configurations to achieve high overall throughput while accounting for fairness among the users. As compared to the conventional methodology of first estimating the channels then optimizing the user schedule, RIS configuration and the beamformers, this paper shows that an optimized user schedule can be obtained directly from a very short set of pilots using a GNN, then the RIS configuration can be optimized using a second GNN, and finally the BS beamformers can be designed based on the overall effective channel. Numerical results show that the proposed approach can utilize the received pilots more efficiently than the conventional channel estimation based approach, and can generalize to systems with an arbitrary number of users.

eess.SP↗

A Comprehensive Survey with Quantitative Comparison of Image Analysis Methods for Microorganism Biovolume Measurements

With the acceleration of urbanization and living standards, microorganisms play increasingly important roles in industrial production, bio-technique, and food safety testing. Microorganism biovolume measurements are one of the essential parts of microbial analysis. However, traditional manual measurement methods are time-consuming and challenging to measure the characteristics precisely. With the development of digital image processing techniques, the characteristics of the microbial population can be detected and quantified. The changing trend can be adjusted in time and provided a basis for the improvement. The applications of the microorganism biovolume measurement method have developed since the 1980s. More than 62 articles are reviewed in this study, and the articles are grouped by digital image segmentation methods with periods. This study has high research significance and application value, which can be referred to microbial researchers to have a comprehensive understanding of microorganism biovolume measurements using digital image analysis methods and potential applications.

cs.CV↗