Searcharxiv⌕ Search

arXiv subjects

Xu Wang

Publications and source records attributed to Xu Wang.

At least 325 records · Page 18Linked to original sources
arXiv2023

Phase shift and magnetic anisotropy induced field splitting of impurity states in (Li1-xFex)OHFeSe superconductor

Revealing the energy and spatial characteristics of impurity induced states in superconductors is essential for understanding their mechanism and fabricating new quantum state by manipulating impurities. Here by using high-resolution scanning tunneling microscopy/spectroscopy, we investigated the spatial distribution and magnetic field response of the impurity states in (Li1-xFex)OHFeSe. We detected two pairs of strong in-gap states on the "dumbbell" shaped defects. They display clear damped oscillations with different phase shifts and a direct phase-energy correlation. These features have long been predicted for classical Yu-Shiba-Rusinov (YSR) state, which are demonstrated here with unprecedented resolution for the first time. Moreover, upon applying magnetic field, all the in-gap state peaks remarkably split into two rather than shift, and the splitting strength is field orientation dependent. Via detailed numerical model calculations, we found such anisotropic splitting behavior can be naturally induced by a high-spin impurity coupled to anisotropic environment, highlighting how magnetic anisotropy affects the behavior of YSR states.

cond-mat.supr-con↗
arXiv2023

Prospects for detection rate of very-high-energy γ-ray emissions from short γ-ray bursts with the HADAR experiment

The observation of short gamma ray bursts (SGRBs) in the TeV energy range plays an important role in understanding the radiation mechanism and probing new areas of physics such as Lorentz invariance violation. However, no SGRB has been observed in this energy range due to the short duration of SGRBs and the weakness of current experiments. New experiments with new technology are required to detect sub-TeV SGRBs. In this work, we observe the very high energy (VHE) $γ$-ray emissions from SGRBs and calculate the annual detection rate with the High Altitude Detection of Astronomical Radiation HADAR (HADAR) experiment. First, a set of pseudo-SGRB samples is generated and checked using the observations of Fermi-GBM, Fermi-LAT, and SWIFT measurements. The annual detection rate is calculated from these SGRB samples based on the performance of the HADAR instrument. As a result, the HADAR experiment can detect 0.5 SGRB per year if the spectral break-off of $γ$-rays caused by the internal absorption is larger than 100 GeV. For a GRB09010-like GRB in HADAR's view, it should be possible to detect approximately 2000 photons considering the internal absorption. With a time delay assumption due to the Lorentz invariance violation effects, a simulated light curve of GRB090510 has evident energy dependence. We hope that the HADAR experiment can perform the SGRB observations and test our calculations in the future.

astro-ph.HE↗
arXiv2023

A large area 100 channel Picosec Micromegas detector with sub 20 ps time resolution

The PICOSEC Micromegas precise timing detector is based on a Cherenkov radiator coupled to a semi-transparent photocathode and a Micromegas amplification structure. The first proof of concept single-channel small area prototype was able to achieve time resolution below 25 ps. One of the crucial aspects in the development of the precise timing gaseous detectors applicable in high-energy physics experiments is a modular design that enables large area coverage. The first 19-channel multi-pad prototype with an active area of approximately 10 cm$^2$ suffered from degraded timing resolution due to the non-uniformity of the preamplification gap. A new 100 cm$^2$ detector module with 100 channels based on a rigid hybrid ceramic/FR4 Micromegas board for improved drift gap uniformity was developed. Initial measurements with 80 GeV/c muons showed improvements in timing response over measured pads and a time resolution below 25 ps. More recent measurements with a new thinner drift gap detector module and newly developed RF pulse amplifiers show that the resolution can be enhanced to a level of 17~ps. This work will present the development of the detector from structural simulations, design, and beam test commissioning with a focus on the timing performance of a thinner drift gap detector module in combination with new electronics using an automated timing scan method.

physics.ins-det↗
arXiv2023

Towards robust PICOSEC Micromegas precise timing detectors

The PICOSEC Micromegas (MM) detector is a precise timing gaseous detector consisting of a Cherenkov radiator combined with a photocathode and a MM amplifying structure. A 100-channel non-resistive PICOSEC MM prototype with 10x10 cm^2 active area equipped with a Cesium Iodide (CsI) photocathode demonstrated a time resolution below 18 ps. The objective of this work is to improve the PICOSEC MM detector robustness aspects; i.e. integration of resistive MM and carbon-based photocathodes; while maintaining good time resolution. The PICOSEC MM prototypes have been tested in laboratory conditions and successfully characterised with 150 GeV/c muon beams at the CERN SPS H4 beam line. The excellent timing performance below 20 ps for an individual pad obtained with the 10x10 cm^2 area resistive PICOSEC MM of 20 MOhm/sq showed no significant time resolution degradation as a result of adding a resistive layer. A single-pad prototype equipped with a 12 nm thick Boron Carbide (B4C) photocathode presented a time resolution below 35 ps; opening up new possibilities for detectors with robust photocathodes. The results made the concept more suitable for the experiments in need of robust detectors with good time resolution.

physics.ins-det↗
arXiv2023

Correspondence-Free Domain Alignment for Unsupervised Cross-Domain Image Retrieval

Cross-domain image retrieval aims at retrieving images across different domains to excavate cross-domain classificatory or correspondence relationships. This paper studies a less-touched problem of cross-domain image retrieval, i.e., unsupervised cross-domain image retrieval, considering the following practical assumptions: (i) no correspondence relationship, and (ii) no category annotations. It is challenging to align and bridge distinct domains without cross-domain correspondence. To tackle the challenge, we present a novel Correspondence-free Domain Alignment (CoDA) method to effectively eliminate the cross-domain gap through In-domain Self-matching Supervision (ISS) and Cross-domain Classifier Alignment (CCA). To be specific, ISS is presented to encapsulate discriminative information into the latent common space by elaborating a novel self-matching supervision mechanism. To alleviate the cross-domain discrepancy, CCA is proposed to align distinct domain-specific classifiers. Thanks to the ISS and CCA, our method could encode the discrimination into the domain-invariant embedding space for unsupervised cross-domain image retrieval. To verify the effectiveness of the proposed method, extensive experiments are conducted on four benchmark datasets compared with six state-of-the-art methods.

cs.CV↗
arXiv2023

On the predictability in reversible steganography

Artificial neural networks have advanced the frontiers of reversible steganography. The core strength of neural networks is the ability to render accurate predictions for a bewildering variety of data. Residual modulation is recognised as the most advanced reversible steganographic algorithm for digital images. The pivot of this algorithm is predictive analytics in which pixel intensities are predicted given some pixel-wise contextual information. This task can be perceived as a low-level vision problem and hence neural networks for addressing a similar class of problems can be deployed. On top of the prior art, this paper investigates predictability of pixel intensities based on supervised and unsupervised learning frameworks. Predictability analysis enables adaptive data embedding, which in turn leads to a better trade-off between capacity and imperceptibility. While conventional methods estimate predictability by the statistics of local image patterns, learning-based frameworks consider further the degree to which correct predictions can be made by a designated predictor. Not only should the image patterns be taken into account but also the predictor in use. Experimental results show that steganographic performance can be significantly improved by incorporating the learning-based predictability analysers into a reversible steganographic system.

cs.CV↗
arXiv2023

Deep Learning for Predictive Analytics in Reversible Steganography

Deep learning is regarded as a promising solution for reversible steganography. There is an accelerating trend of representing a reversible steo-system by monolithic neural networks, which bypass intermediate operations in traditional pipelines of reversible steganography. This end-to-end paradigm, however, suffers from imperfect reversibility. By contrast, the modular paradigm that incorporates neural networks into modules of traditional pipelines can stably guarantee reversibility with mathematical explainability. Prediction-error modulation is a well-established reversible steganography pipeline for digital images. It consists of a predictive analytics module and a reversible coding module. Given that reversibility is governed independently by the coding module, we narrow our focus to the incorporation of neural networks into the analytics module, which serves the purpose of predicting pixel intensities and a pivotal role in determining capacity and imperceptibility. The objective of this study is to evaluate the impacts of different training configurations upon predictive accuracy of neural networks and provide practical insights. In particular, we investigate how different initialisation strategies for input images may affect the learning process and how different training strategies for dual-layer prediction respond to the problem of distributional shift. Furthermore, we compare steganographic performance of various model architectures with different loss functions.

cs.MM↗
arXiv2023

SwiftAvatar: Efficient Auto-Creation of Parameterized Stylized Character on Arbitrary Avatar Engines

The creation of a parameterized stylized character involves careful selection of numerous parameters, also known as the "avatar vectors" that can be interpreted by the avatar engine. Existing unsupervised avatar vector estimation methods that auto-create avatars for users, however, often fail to work because of the domain gap between realistic faces and stylized avatar images. To this end, we propose SwiftAvatar, a novel avatar auto-creation framework that is evidently superior to previous works. SwiftAvatar introduces dual-domain generators to create pairs of realistic faces and avatar images using shared latent codes. The latent codes can then be bridged with the avatar vectors as pairs, by performing GAN inversion on the avatar images rendered from the engine using avatar vectors. Through this way, we are able to synthesize paired data in high-quality as many as possible, consisting of avatar vectors and their corresponding realistic faces. We also propose semantic augmentation to improve the diversity of synthesis. Finally, a light-weight avatar vector estimator is trained on the synthetic pairs to implement efficient auto-creation. Our experiments demonstrate the effectiveness and efficiency of SwiftAvatar on two different avatar engines. The superiority and advantageous flexibility of SwiftAvatar are also verified in both subjective and objective evaluations.

cs.CV↗
arXiv2023

An inverse potential problem for the stochastic diffusion equation with a multiplicative white noise

This work concerns the direct and inverse potential problems for the stochastic diffusion equation driven by a multiplicative time-dependent white noise. The direct problem is to examine the well-posedness of the stochastic diffusion equation for a given potential, while the inverse problem is to determine the potential from the expectation of the solution at a fixed observation point inside the spatial domain. The direct problem is shown to admit a unique and positive mild solution if the initial value is nonnegative. Moreover, an explicit formula is deduced to reconstruct the square of the potential, which leads to the uniqueness of the inverse problem for nonnegative potential functions. Two regularization methods are utilized to overcome the instability of the numerical differentiation in the reconstruction formula. Numerical results show that the methods are effective to reconstruct both smooth and nonsmooth potential functions.

math.AP↗
arXiv2023

Graph-Free Learning in Graph-Structured Data: A More Efficient and Accurate Spatiotemporal Learning Perspective

Spatiotemporal learning, which aims at extracting spatiotemporal correlations from the collected spatiotemporal data, is a research hotspot in recent years. And considering the inherent graph structure of spatiotemporal data, recent works focus on capturing spatial dependencies by utilizing Graph Convolutional Networks (GCNs) to aggregate vertex features with the guidance of adjacency matrices. In this paper, with extensive and deep-going experiments, we comprehensively analyze existing spatiotemporal graph learning models and reveal that extracting adjacency matrices with carefully design strategies, which are viewed as the key of enhancing performance on graph learning, are largely ineffective. Meanwhile, based on these experiments, we also discover that the aggregation itself is more important than the way that how vertices are aggregated. With these preliminary, a novel efficient Graph-Free Spatial (GFS) learning module based on layer normalization for capturing spatial correlations in spatiotemporal graph learning. The proposed GFS module can be easily plugged into existing models for replacing all graph convolution components. Rigorous theoretical proof demonstrates that the time complexity of GFS is significantly better than that of graph convolution operation. Extensive experiments verify the superiority of GFS in both the perspectives of efficiency and learning effect in processing graph-structured data especially extreme large scale graph data.

cs.LG↗
arXiv2023

Value Cards: An Educational Toolkit for Teaching Social Impacts of Machine Learning through Deliberation

Recently, there have been increasing calls for computer science curricula to complement existing technical training with topics related to Fairness, Accountability, Transparency, and Ethics. In this paper, we present Value Card, an educational toolkit to inform students and practitioners of the social impacts of different machine learning models via deliberation. This paper presents an early use of our approach in a college-level computer science course. Through an in-class activity, we report empirical data for the initial effectiveness of our approach. Our results suggest that the use of the Value Cards toolkit can improve students' understanding of both the technical definitions and trade-offs of performance metrics and apply them in real-world contexts, help them recognize the significance of considering diverse social values in the development of deployment of algorithmic systems, and enable them to communicate, negotiate and synthesize the perspectives of diverse stakeholders. Our study also demonstrates a number of caveats we need to consider when using the different variants of the Value Cards toolkit. Finally, we discuss the challenges as well as future applications of our approach.

cs.CY↗
arXiv2023

IronForge: An Open, Secure, Fair, Decentralized Federated Learning

Federated learning (FL) provides an effective machine learning (ML) architecture to protect data privacy in a distributed manner. However, the inevitable network asynchrony, the over-dependence on a central coordinator, and the lack of an open and fair incentive mechanism collectively hinder its further development. We propose \textsc{IronForge}, a new generation of FL framework, that features a Directed Acyclic Graph (DAG)-based data structure and eliminates the need for central coordinators to achieve fully decentralized operations. \textsc{IronForge} runs in a public and open network, and launches a fair incentive mechanism by enabling state consistency in the DAG, so that the system fits in networks where training resources are unevenly distributed. In addition, dedicated defense strategies against prevalent FL attacks on incentive fairness and data privacy are presented to ensure the security of \textsc{IronForge}. Experimental results based on a newly developed testbed FLSim highlight the superiority of \textsc{IronForge} to the existing prevalent FL frameworks under various specifications in performance, fairness, and security. To the best of our knowledge, \textsc{IronForge} is the first secure and fully decentralized FL framework that can be applied in open networks with realistic network and training settings.

cs.LG↗
arXiv2022

DialogQAE: N-to-N Question Answer Pair Extraction from Customer Service Chatlog

Harvesting question-answer (QA) pairs from customer service chatlog in the wild is an efficient way to enrich the knowledge base for customer service chatbots in the cold start or continuous integration scenarios. Prior work attempts to obtain 1-to-1 QA pairs from growing customer service chatlog, which fails to integrate the incomplete utterances from the dialog context for composite QA retrieval. In this paper, we propose N-to-N QA extraction task in which the derived questions and corresponding answers might be separated across different utterances. We introduce a suite of generative/discriminative tagging based methods with end-to-end and two-stage variants that perform well on 5 customer service datasets and for the first time setup a benchmark for N-to-N DialogQAE with utterance and session level evaluation metrics. With a deep dive into extracted QA pairs, we find that the relations between and inside the QA pairs can be indicators to analyze the dialogue structure, e.g. information seeking, clarification, barge-in and elaboration. We also show that the proposed models can adapt to different domains and languages, and reduce the labor cost of knowledge accumulation in the real-world product dialogue platform.

cs.CL↗
arXiv2022

DualNER: A Dual-Teaching framework for Zero-shot Cross-lingual Named Entity Recognition

We present DualNER, a simple and effective framework to make full use of both annotated source language corpus and unlabeled target language text for zero-shot cross-lingual named entity recognition (NER). In particular, we combine two complementary learning paradigms of NER, i.e., sequence labeling and span prediction, into a unified multi-task framework. After obtaining a sufficient NER model trained on the source data, we further train it on the target data in a {\it dual-teaching} manner, in which the pseudo-labels for one task are constructed from the prediction of the other task. Moreover, based on the span prediction, an entity-aware regularization is proposed to enhance the intrinsic cross-lingual alignment between the same entities in different languages. Experiments and analysis demonstrate the effectiveness of our DualNER. Code is available at https://github.com/lemon0830/dualNER.

cs.CL↗
arXiv2022

A Complete Graphical Solution for Undrained Cylindrical Cavity Expansion in K_0-Consolidated Mohr-Coulomb Soil

This paper develops a general and complete solution for the undrained cylindrical cavity expansion problem in non-associated Mohr-Coulomb soil under non-hydrostatic initial stress field (i.e., arbitrary K_0 values of the earth pressure coefficient), by expanding a unique and efficient graphical solution procedure recently proposed by Chen & Wang in 2022 for the special in situ stress case with K_0 = 1. The new generalized, graph-based theoretical framework contains two essential components: the geometrical analysis to track the stress path trajectory/evolution in different sectors of the deviatoric plane; and a full Lagrangian formulation of both the constitutive relationship and radial equilibrium equation to analytically determine the representative soil particle responses at the cavity surface. It is interesting to find that the cavity expansion deviatoric stress path is always composed of a series of piecewise straight lines, for all different case scenarios of K_0 being involved. The salient advantage/feature of the present general graphical approach lies in that it can deduce the cavity expansion responses in full closed form, nevertheless being free of the limitation of the intermediacy assumption for the vertical stress and of the difficulty existing in the traditional zoning method that involves cumbersome, sequential determination of distinct Mohr-Coulomb plastic regions. The analytical closed-form solutions developed herein can be regarded as a definitive one for the undrained cavity expansion problem in classical Mohr-Coulomb materials without the approximations and simplifications in previous solutions, and will be of great value for the interpretation of pressuremeter tests in cohesive-frictional soils.

physics.geo-ph↗
arXiv2022

LAD-RCNN:A Powerful Tool for Livestock Face Detection and Normalization

With the demand for standardized large-scale livestock farming and the development of artificial intelligence technology, a lot of research in area of animal face recognition were carried on pigs, cattle, sheep and other livestock. Face recognition consists of three sub-task: face detection, face normalizing and face identification. Most of animal face recognition study focuses on face detection and face identification. Animals are often uncooperative when taking photos, so the collected animal face images are often in arbitrary directions. The use of non-standard images may significantly reduce the performance of face recognition system. However, there is no study on normalizing of the animal face image with arbitrary directions. In this study, we developed a light-weight angle detection and region-based convolutional network (LAD-RCNN) containing a new rotation angle coding method that can detect the rotation angle and the location of animal face in one-stage. LAD-RCNN has a frame rate of 72.74 FPS (including all steps) on a single GeForce RTX 2080 Ti GPU. LAD-RCNN has been evaluated on multiple dataset including goat dataset and gaot infrared image. Evaluation result show that the AP of face detection was more than 95% and the deviation between the detected rotation angle and the ground-truth rotation angle were less than 0.036 (i.e. 6.48°) on all the test dataset. This shows that LAD-RCNN has excellent performance on livestock face and its direction detection, and therefore it is very suitable for livestock face detection and Normalizing. Code is available at https://github.com/SheepBreedingLab-HZAU/LAD-RCNN/

cs.CV↗
arXiv2022

Inverse scattering for the biharmonic wave equation with a random potential

We consider the inverse random potential scattering problem for the two- and three-dimensional biharmonic wave equation in lossy media. The potential is assumed to be a microlocally isotropic Gaussian rough field. The main contributions of the work are twofold. First, the unique continuation principle is proved for the fourth order biharmonic wave equation with rough potentials and the well-posedness of the direct scattering problem is established in the distribution sense. Second, the correlation strength of the random potential is shown to be uniquely determined by the high frequency limit of the second moment of the scattered field averaged over the frequency band. Moreover, we demonstrate that the expectation in the data can be removed and the data of a single realization is sufficient for the uniqueness of the inverse problem with probability one when the medium is lossless.

math.AP↗
arXiv2022

Prospective Study on Observations of γ-Ray Sources in the Galaxy Using the HADAR Experiment

The High Altitude Detection of Astronomical Radiation (HADAR) experiment is a refracting terrestrial telescope array based on the atmospheric Cherenkov imaging technique. It focuses the Cherenkov light emitted by extensive air showers through a large aperture water-lens system for observing very-high-energy-rays and cosmic rays. With the advantages of a large field-of-view (FOV) and low energy threshold, the HADAR experiment operates in a large-scale sky scanning mode to observe galactic sources. This study presents the prospects of using the HADAR experiment for the sky survey of TeV γ-ray sources from TeVCat and provids a one-year survey of statistical significance. Results from the simulation show that a total of 23 galactic point sources, including five supernova remnant sources and superbubbles, four pulsar wind nebula sources, and 14 unidentified sources, were detected in the HADAR FOV with a significance greater than 5 standard deviations (σ). The statistical significance for the Crab Nebula during one year of operation reached 346.0 σ and the one-year integral sensitivity of HADAR above 1TeV was ~1.3%-2.4% of the flux from the Crab Nebula.

astro-ph.HE↗