Searcharxiv⌕ Search

arXiv subjects

Hao Xu

Publications and source records attributed to Hao Xu.

At least 325 records · Page 18Linked to original sources

Coexistence of superconductivity with partially filled stripes in the Hubbard model

Combining the complementary capabilities of two of the most powerful modern computational methods, we find superconductivity in both the electron- and hole-doped regimes of the two-dimensional Hubbard model (with next nearest neighbor hopping). In the electron-doped regime, superconductivity is weaker and is accompanied by antiferromagnetic Néel correlations at low doping. The strong superconductivity on the hole-doped side coexists with stripe order, which persists into the overdoped region with weaker hole density modulation. These stripe orders, neither filled as in the pure Hubbard model (no next nearest neighbor hopping) nor half-filled as seen in previous state-of-the-art calculations, vary in fillings between 0.6 and 0.8. The resolution of the tiny energy scales separating competing orders requires exceedingly high accuracy combined with averaging and extrapolating with a wide range of system sizes and boundary conditions. These results validate the applicability of this iconic model for describing cuprate high-$T_c$ superconductivity.

cond-mat.supr-con↗

Decoherence and Landauer's Principle in Qubit-Cavity Quantum-Field-Theory Interaction

We consider quantum decoherence and Landauer's principle in qubit-cavity quantum field theory (QFT) interaction, treating the qubit as the system and cavity QFT as the environment. In particular, we investigate the changes that occur in the system with a pure initial state and environment during the decoherence process, with or without energy dissipation, and compare the results with the case in which the initial state of the system is a mixed state and thus decoherence is absent. When we choose an interaction Hamiltonian such that the energy and coherence of the system change simultaneously, the population change of the system and the energy change are the same when the initial state is mixed. However, the decoherence terms increase the von Neumann entropy of the system. In this case the energy change and decoherence of the system are not independent physical processes. The decoherence process maintains unitarity. On the other hand, if the interaction Hamiltonian does not change the energy of the system, there is only the decoherence effect. The environment will be a distribution in the basis of the displaced number state and always increases the energy. Landauer's principle is satisfied in both cases.

quant-ph↗

Decoherence and thermalization of Unruh-DeWitt detector in arbitrary dimensions

We study the decoherence and thermalization of an Unruh-DeWitt detector linearly coupled to the free massless scalar field in flat spacetime of arbitrary dimensions ($d\geq 2$). The initial state of the detector is chosen to be a pure state consisting of a linear superposition of ground and excited states, and we calculate the time evolution of reduced density matrix of the detector. Using perturbation method, we analytically derive the transition rate of the detector (the rate of change of the diagonal elements in the density matrix) and the decoherence rate (the rate of change of the off-diagonal elements in the density matrix). We find that the results are not the same in odd and even dimensional spacetimes, but the unitarity of the qubit is preserved in both cases. The real part of the decoherence rate is related to the transition rate, while the imaginary part may contain different forms of divergence terms in different dimensions due to the temporal order product operator and the singularities of the Wightman function for quantum field theory. We derive the recurrence formula to obtain the divergence terms in each dimension and analyze the renormalization problem.

hep-th↗

$Λ_c(2910)$ and $Λ_c(2940)$ as the conventional baryons dressed with the $D^*N$ channel

In this work, we treat $Λ_c(2910)^+$ and $Λ_c(2940)^+$ as the conventional $udc$ cores dressed with the $D^*N$ channel. We provide a possible interpretation to both $Λ_c(2910)^+$ and $Λ_c(2940)^+$ within the same framework. In the study, we consider not only the effects between the conventional triquark core and the $D^*N$ channel but also the $D^*N$-$D^*N$ interactions. The mass of $Λ_c$ state with $J^P=1/2^-$ is larger than that with $J^P=3/2^-$ in this unquenched picture, which is very different from the prediction of the conventional quenched quark model. Based on the mass spectrum, the spin-parity of $Λ_c(2940)^+$ is more likely to be $1/2^-$ while $Λ_c(2910)^+$ prefers $3/2^-$. We look forward to the future experiments can test our results with more precise experimental data.

hep-ph↗

Representing Interlingual Meaning in Lexical Databases

In today's multilingual lexical databases, the majority of the world's languages are under-represented. Beyond a mere issue of resource incompleteness, we show that existing lexical databases have structural limitations that result in a reduced expressivity on culturally-specific words and in mapping them across languages. In particular, the lexical meaning space of dominant languages, such as English, is represented more accurately while linguistically or culturally diverse languages are mapped in an approximate manner. Our paper assesses state-of-the-art multilingual lexical databases and evaluates their strengths and limitations with respect to their expressivity on lexical phenomena of linguistic diversity.

cs.CL↗

A novel dataset and a two-stage mitosis nuclei detection method based on hybrid anchor branch

Mitosis detection is one of the challenging problems in computational pathology, and mitotic count is an important index of cancer grading for pathologists. However, current counts of mitotic nuclei rely on pathologists looking microscopically at the number of mitotic nuclei in hot spots, which is subjective and time-consuming. In this paper, we propose a two-stage cascaded network, named FoCasNet, for mitosis detection. In the first stage, a detection network named M_det is proposed to detect as many mitoses as possible. In the second stage, a classification network M_class is proposed to refine the results of the first stage. In addition, the attention mechanism, normalization method, and hybrid anchor branch classification subnet are introduced to improve the overall detection performance. Our method achieves the current highest F1-score of 0.888 on the public dataset ICPR 2012. We also evaluated our method on the GZMH dataset released by our research team for the first time and reached the highest F1-score of 0.563, which is also better than multiple classic detection networks widely used at present. It confirmed the effectiveness and generalization of our method. The code will be available at: https://github.com/antifen/mitosis-nuclei-detection.

cs.CV↗

Semi-Supervised Learning with Pseudo-Negative Labels for Image Classification

Semi-supervised learning frameworks usually adopt mutual learning approaches with multiple submodels to learn from different perspectives. To avoid transferring erroneous pseudo labels between these submodels, a high threshold is usually used to filter out a large number of low-confidence predictions for unlabeled data. However, such filtering can not fully exploit unlabeled data with low prediction confidence. To overcome this problem, in this work, we propose a mutual learning framework based on pseudo-negative labels. Negative labels are those that a corresponding data item does not belong. In each iteration, one submodel generates pseudo-negative labels for each data item, and the other submodel learns from these labels. The role of the two submodels exchanges after each iteration until convergence. By reducing the prediction probability on pseudo-negative labels, the dual model can improve its prediction ability. We also propose a mechanism to select a few pseudo-negative labels to feed into submodels. In the experiments, our framework achieves state-of-the-art results on several main benchmarks. Specifically, with our framework, the error rates of the 13-layer CNN model are 9.35% and 7.94% for CIFAR-10 with 1000 and 4000 labels, respectively. In addition, for the non-augmented MNIST with only 20 labels, the error rate is 0.81% by our framework, which is much smaller than that of other approaches. Our approach also demonstrates a significant performance improvement in domain adaptation.

cs.CV↗

Light-YOLOv5: A Lightweight Algorithm for Improved YOLOv5 in Complex Fire Scenarios

Fire-detection technology is of great importance for successful fire-prevention measures. Image-based fire detection is one effective method. At present, object-detection algorithms are deficient in performing detection speed and accuracy tasks when they are applied in complex fire scenarios. In this study, a lightweight fire-detection algorithm, Light-YOLOv5 (You Only Look Once version five), is presented. First, a separable vision transformer (SepViT) block is used to replace several C3 modules in the final layer of a backbone network to enhance both the contact of the backbone network to global in-formation and the extraction of flame and smoke features; second, a light bidirectional feature pyramid network (Light-BiFPN) is designed to lighten the model while improving the feature extraction and balancing speed and accuracy features during a fire-detection procedure; third, a global attention mechanism (GAM) is fused into the network to cause the model to focus more on the global dimensional features and further improve the detection accuracy of the model; and finally, the Mish activation function and SIoU loss are utilized to simultaneously increase the convergence speed and enhance the accuracy. The experimental results show that compared to the original algorithm, the mean average accuracy (mAP) of Light-YOLOv5 increases by 3.3%, the number of parameters decreases by 27.1%, and the floating point operations (FLOPs) decrease by 19.1%. The detection speed reaches 91.1 FPS, which can detect targets in complex fire scenarios in real time.

cs.CV↗

Differentiable Meta Multigraph Search with Partial Message Propagation on Heterogeneous Information Networks

Heterogeneous information networks (HINs) are widely employed for describing real-world data with intricate entities and relationships. To automatically utilize their semantic information, graph neural architecture search has recently been developed on various tasks of HINs. Existing works, on the other hand, show weaknesses in instability and inflexibility. To address these issues, we propose a novel method called Partial Message Meta Multigraph search (PMMM) to automatically optimize the neural architecture design on HINs. Specifically, to learn how graph neural networks (GNNs) propagate messages along various types of edges, PMMM adopts an efficient differentiable framework to search for a meaningful meta multigraph, which can capture more flexible and complex semantic relations than a meta graph. The differentiable search typically suffers from performance instability, so we further propose a stable algorithm called partial message search to ensure that the searched meta multigraph consistently surpasses the manually designed meta-structures, i.e., meta-paths. Extensive experiments on six benchmark datasets over two representative tasks, including node classification and recommendation, demonstrate the effectiveness of the proposed method. Our approach outperforms the state-of-the-art heterogeneous GNNs, finds out meaningful meta multigraphs, and is significantly more stable.

cs.LG↗

Hawking evaporation of Einstein-Gauss-Bonnet AdS black holes in $D\geqslant 4$ dimensions

Einstein-Gauss-Bonnet theory is a string-generated gravity theory when approaching the low energy limit. By introducing the higher order curvature terms, this theory is supposed to help to solve the black hole singularity problem. In this work, we investigate the evaporation of the static spherically symmetric neutral AdS black holes in Einstein-Gauss-Bonnet gravity in various spacetime dimensions with both positive and negative couping constant $α$. By summarizing the asymptotic behavior of the evaporation process, we find the lifetime of the black holes is dimensional dependent. For $α>0$, in $D\geqslant6$ cases, the black holes will be completely evaporated in a finite time, which resembles the Schwarzschild-AdS case in Einstein gravity. While in $D=4,5$ cases, the black hole lifetime is always infinite, which means the black hole becomes a remnant in the late time. Remarkably, the cases of $α>0, D=4,5$ will solve the terminal temperature divergent problem of the Schwarzschild-AdS case. For $α<0$, in all dimensions, the black hole will always spend a finite time to a minimal mass corresponding to the smallest horizon radius $r_{min}=\sqrt{2|α|}$ which coincide with an additional singularity. This implies that there may exist constraint conditions to the choice of coupling constant.

hep-th↗

Retention Time Prediction for Chromatographic Enantioseparation by Quantile Geometry-enhanced Graph Neural Network

A new research framework is proposed to incorporate machine learning techniques into the field of experimental chemistry to facilitate chromatographic enantioseparation. A documentary dataset of chiral molecular retention times (CMRT dataset) in high-performance liquid chromatography is established to handle the challenge of data acquisition. Based on the CMRT dataset, a quantile geometry-enhanced graph neural network is proposed to learn the molecular structure-retention time relationship, which shows a satisfactory predictive ability for enantiomers. The domain knowledge of chromatography is incorporated into the machine learning model to achieve multi-column prediction, which paves the way for chromatographic enantioseparation prediction by calculating the separation probability. Experiments confirm that the proposed research framework works well in retention time prediction and chromatographic enantioseparation facilitation, which sheds light on the application of machine learning techniques to the experimental scene and improves the efficiency of experimenters to speed up scientific discovery.

physics.data-an↗

How Barrow Entropy Modifies Gravity: With Comments on Tsallis Entropy

Barrow proposed that the area law of the horizon entropy might receive a "fractal correction" $S\propto A^{1+Δ/2}$ due to quantum gravitational effects, with $0\leqslant Δ\leqslant 1$ measures the deviation from the standard area law. While such a modification has been widely studied in the literature, its corresponding theory of gravity has not been discussed. We follow Jacobson's approach to derive the modified gravity theory (interpreted as an effective theory), and find that in the stationary case the resulting theory only differs from general relativity by a re-scaled cosmological constant. Consequently in asymptotically flat stationary spacetimes the theory is identical to general relativity. The theory is not applicable when there is no horizon; the multi-horizon case is complicated. We emphasize on the importance of identifying the correct thermodynamic mass in a theory with modified thermodynamics to avoid inconsistencies. We also comment on the Hawking evaporation rate beyond the effective theory. In addition, we show that the Bekenstein bound is satisfied if the thermodynamic mass is used as the energy, up to a constant prefactor. We briefly comment on the Tsallis entropy case as well. Interestingly, for the latter, the requirement that Bekenstein bound holds imposes a lower bound on the non-extensive parameter: $δ> 1/2$, which unfortunately rules out the previously suggested possibility that the expansion of the universe can accelerate with normal matter field alone.

gr-qc↗

Hand gesture recognition using 802.11ad mmWave sensor in the mobile device

We explore the feasibility of AI assisted hand-gesture recognition using 802.11ad 60GHz (mmWave) technology in smartphones. Range-Doppler information (RDI) is obtained by using pulse Doppler radar for gesture recognition. We built a prototype system, where radar sensing and WLAN communication waveform can coexist by time-division duplex (TDD), to demonstrate the real-time hand-gesture inference. It can gather sensing data and predict gestures within 100 milliseconds. First, we build the pipeline for the real-time feature processing, which is robust to occasional frame drops in the data stream. RDI sequence restoration is implemented to handle the frame dropping in the continuous data stream, and also applied to data augmentation. Second, different gestures RDI are analyzed, where finger and hand motions can clearly show distinctive features. Third, five typical gestures (swipe, palm-holding, pull-push, finger-sliding and noise) are experimented with, and a classification framework is explored to segment the different gestures in the continuous gesture sequence with arbitrary inputs. We evaluate our architecture on a large multi-person dataset and report > 95% accuracy with one CNN + LSTM model. Further, a pure CNN model is developed to fit to on-device implementation, which minimizes the inference latency, power consumption and computation cost. And the accuracy of this CNN model is more than 93% with only 2.29K parameters.

cs.IT↗

Generalization and Personalization of Mobile Sensing-Based Mood Inference Models: An Analysis of College Students in Eight Countries

Mood inference with mobile sensing data has been studied in ubicomp literature over the last decade. This inference enables context-aware and personalized user experiences in general mobile apps and valuable feedback and interventions in mobile health apps. However, even though model generalization issues have been highlighted in many studies, the focus has always been on improving the accuracies of models using different sensing modalities and machine learning techniques, with datasets collected in homogeneous populations. In contrast, less attention has been given to studying the performance of mood inference models to assess whether models generalize to new countries. In this study, we collected a mobile sensing dataset with 329K self-reports from 678 participants in eight countries (China, Denmark, India, Italy, Mexico, Mongolia, Paraguay, UK) to assess the effect of geographical diversity on mood inference models. We define and evaluate country-specific (trained and tested within a country), continent-specific (trained and tested within a continent), country-agnostic (tested on a country not seen on training data), and multi-country (trained and tested with multiple countries) approaches trained on sensor data for two mood inference tasks with population-level (non-personalized) and hybrid (partially personalized) models. We show that partially personalized country-specific models perform the best yielding area under the receiver operating characteristic curve (AUROC) scores of the range 0.78-0.98 for two-class (negative vs. positive valence) and 0.76-0.94 for three-class (negative vs. neutral vs. positive valence) inference. Overall, we uncover generalization issues of mood inference models to new countries and how the geographical similarity of countries might impact mood inference.

cs.HC↗

Span-based joint entity and relation extraction augmented with sequence tagging mechanism

Span-based joint extraction simultaneously conducts named entity recognition (NER) and relation extraction (RE) in text span form. However, since previous span-based models rely on span-level classifications, they cannot benefit from token-level label information, which has been proven advantageous for the task. In this paper, we propose a Sequence Tagging augmented Span-based Network (STSN), a span-based joint model that can make use of token-level label information. In STSN, we construct a core neural architecture by deep stacking multiple attention layers, each of which consists of three basic attention units. On the one hand, the core architecture enables our model to learn token-level label information via the sequence tagging mechanism and then uses the information in the span-based joint extraction; on the other hand, it establishes a bi-directional information interaction between NER and RE. Experimental results on three benchmark datasets show that STSN consistently outperforms the strongest baselines in terms of F1, creating new state-of-the-art results.

cs.CL↗

Planning Assembly Sequence with Graph Transformer

Assembly sequence planning (ASP) is the essential process for modern manufacturing, proven to be NP-complete thus its effective and efficient solution has been a challenge for researchers in the field. In this paper, we present a graph-transformer based framework for the ASP problem which is trained and demonstrated on a self-collected ASP database. The ASP database contains a self-collected set of LEGO models. The LEGO model is abstracted to a heterogeneous graph structure after a thorough analysis of the original structure and feature extraction. The ground truth assembly sequence is first generated by brute-force search and then adjusted manually to in line with human rational habits. Based on this self-collected ASP dataset, we propose a heterogeneous graph-transformer framework to learn the latent rules for assembly planning. We evaluated the proposed framework in a series of experiment. The results show that the similarity of the predicted and ground truth sequences can reach 0.44, a medium correlation measured by Kendall's $τ$. Meanwhile, we compared the different effects of node features and edge features and generated a feasible and reasonable assembly sequence as a benchmark for further research. Our data set and code is available on https://github.com/AIR-DISCOVER/ICRA\_ASP.

cs.AI↗

Design of Automatic Driving Safety Level and Positioning Accuracy

Autonomous driving is a hot research topic in the frontier of science and technology. Technology companies and traditional car companies are developing and designing autonomous driving technology from two different directions. Based on the automatic driving classification standard and ISO safety level, combined with the number of traffic accidents and death data in China, and referring to the risk allocation method of the automated driving virtual drive system in the United States, the risk allocation of China's virtual drive system will be carried out. In addition, combined with the vehicle "positioning box" model, the theoretical calculation of the alarm limit of positioning accuracy in China will be carried out and the positioning accuracy requirements of related vehicles will be designed.

eess.SY↗

SD-Based Low-Complexity Precoder Design for Gaussian MIMO Wiretap Channels

This paper considers a Gaussian multi-input multi-output (MIMO) multiple access wiretap (MAC-WT) channel, where an eavesdropper (Eve) wants to extract the confidential information of all users. Assuming that both the legitimate receiver and Eve jointly decode their interested messages, we aim to maximize the sum secrecy rate of the system by precoder design. Although this problem could be solved by first using the iterative majorization minimization (MM) based algorithm to get a sequence of convex log-determinant optimization subproblems and then using some general tools, e.g., the interior point method, to deal with each subproblem, this strategy involves quite high computational complexity. Therefore, we propose a simultaneous diagonalization based low-complexity (SDLC) method to maximize the secrecy rate of a simple one-user wiretap channel, and then use this method to iteratively optimize the covariance matrix of each user. Simulation results show that in contrast to the existing approaches, the SDLC scheme achieves similar secrecy performance but requires much lower complexity.

cs.IT↗