arXiv subjects

Yan Huang

Publications and source records attributed to Yan Huang.

At least 217 records · Page 12Linked to original sources

arXiv2022

Scaling Bockchain with Adaptivity

This paper presents Balloon, a scalable blockchain consensus protocol which could dynamically adapt its performance to the overall computation power change. Balloon is based on a parallel chain architecture combined with a greedy heaviest sub-chain selection strategy. It adopts an inovative block sampling approach to assess the change of block generation rate in the network. By introducing view change mechanism, Balllon is able to dynamically adjust the number of parallel sub-chains. Balloon redefines the concept of block subtree weight with view change in consideration, so that a total order of blocks could be obtained safely. To deal with rapidly increasing block generation rate in the blockchain network, participants of previous Nakamoto-style protocols are required to continuously increase their mining difficulty so as to maintain an expected security gurantee. Balloon, however, could accomadate a fixed difficulty setup and assign superfluous block processing capability to new sub-chains, which makes it more open and also economical.

cs.DC↗

arXiv2022

Generalizable Person Re-Identification via Self-Supervised Batch Norm Test-Time Adaption

In this paper, we investigate the generalization problem of person re-identification (re-id), whose major challenge is the distribution shift on an unseen domain. As an important tool of regularizing the distribution, batch normalization (BN) has been widely used in existing methods. However, they neglect that BN is severely biased to the training domain and inevitably suffers the performance drop if directly generalized without being updated. To tackle this issue, we propose Batch Norm Test-time Adaption (BNTA), a novel re-id framework that applies the self-supervised strategy to update BN parameters adaptively. Specifically, BNTA quickly explores the domain-aware information within unlabeled target data before inference, and accordingly modulates the feature distribution normalized by BN to adapt to the target domain. This is accomplished by two designed self-supervised auxiliary tasks, namely part positioning and part nearest neighbor matching, which help the model mine the domain-aware information with respect to the structure and identity of body parts, respectively. To demonstrate the effectiveness of our method, we conduct extensive experiments on three re-id datasets and confirm the superior performance to the state-of-the-art methods.

cs.CV↗

arXiv2022

Intersections of middle-$α$ Cantor sets with a fixed translation

For $λ\in(0,1/3]$ let $C_λ$ be the middle-$(1-2λ)$ Cantor set in $\mathbb R$. Given $t\in[-1,1]$, excluding the trivial case we show that \[ Λ(t):=\left\{λ\in(0,1/3]: C_λ\cap(C_λ+t)\ne\emptyset\right\} \] is a topological Cantor set with zero Lebesgue measure and full Hausdorff dimension. In particular, we calculate the local dimension of $Λ(t)$, which reveals a dimensional variation principle. Furthermore, for any $β\in[0,1]$ we show that the level set \[ Λ_β(t):=\left\{λ\inΛ(t): \dim_H(C_λ\cap(C_λ+t))=\dim_P(C_λ\cap(C_λ+t))=β\frac{\log 2}{-\log λ}\right\} \] has equal Hausdorff and packing dimension $(-β\logβ-(1-β)\log\frac{1-β}{2})/\log 3$. We also show that the set of $λ\inΛ(t)$ for which $\dim_H(C_λ\cap(C_λ+t))\ne\dim_P(C_λ\cap(C_λ+t))$ has full Hausdorff dimension.

math.DS↗

arXiv2022

Uncovering the Source of Machine Bias

We develop a structural econometric model to capture the decision dynamics of human evaluators on an online micro-lending platform, and estimate the model parameters using a real-world dataset. We find two types of biases in gender, preference-based bias and belief-based bias, are present in human evaluators' decisions. Both types of biases are in favor of female applicants. Through counterfactual simulations, we quantify the effect of gender bias on loan granting outcomes and the welfare of the company and the borrowers. Our results imply that both the existence of the preference-based bias and that of the belief-based bias reduce the company's profits. When the preference-based bias is removed, the company earns more profits. When the belief-based bias is removed, the company's profits also increase. Both increases result from raising the approval probability for borrowers, especially male borrowers, who eventually pay back loans. For borrowers, the elimination of either bias decreases the gender gap of the true positive rates in the credit risk evaluation. We also train machine learning algorithms on both the real-world data and the data from the counterfactual simulations. We compare the decisions made by those algorithms to see how evaluators' biases are inherited by the algorithms and reflected in machine-based decisions. We find that machine learning algorithms can mitigate both the preference-based bias and the belief-based bias.

cs.LG↗

arXiv2021

The Emission Order of Hydrogen Isotopes via Correlation Functions in 30 MeV/u Ar+Au Reactions

The intensity interferometry is applied as a chronometer of the particle emission of hydrogen isotopes from the intermediate velocity source formed in $^{40}$Ar+$^{197}$Au reactions at 30 MeV/u. The dynamic emission order of $τ_{\rm p}>τ_{\rm d}>τ_{\rm t}$ is evidenced via the correlation functions of nonidentical particle pairs. Assuming the similar source size, the same emission order is inferred from the correlation functions of identical particle pairs, where $τ_{\rm p} \approx 100 {\rm ~fm/c}$ is extracted by the fit of Koonin-Pratt equation to p-p correlation function. Transport model simulations demonstrate that the dynamic emission order of light charged particles depends on the stiffness of the nuclear symmetry energy.

nucl-ex↗

arXiv2021

A search for solar axions and anomalous neutrino magnetic moment with the complete PandaX-II data

We report a search for new physics signals using the low energy electron recoil events in the complete data set from PandaX-II, in light of the recent event excess reported by XENON1T. The data correspond to a total exposure of 100.7 ton-day with liquid xenon. With robust estimates of the dominant background spectra, we perform sensitive searches on solar axions and neutrinos with enhanced magnetic moment. We find that the axion-electron coupling $g_{Ae}<4.6\times 10^{-12}$ for an axion mass less than $\rm 0.1~keV/c^2$ and the neutrino magnetic moment $μ_ν<4.9\times 10^{-11}μ_{B}$ at 90% confidence level. The observed excess from XENON1T is within our experimental constraints.

hep-ex↗

arXiv2021

Constraining self-interacting dark matter with the full dataset of PandaX-II

Self-interacting Dark Matter (SIDM) is a leading candidate proposed to solve discrepancies between predictions of the prevailing cold dark matter theory and observations of galaxies. Many SIDM models predict the existence of a light force carrier that mediate strong dark matter self-interactions. If the mediator couples to the standard model particles, it could produce characteristic signals in dark matter direct detection experiments. We report searches for SIDM models with a light mediator using the full dataset of the PandaX-II experiment, based on a total exposure of 132 tonne-days. No significant excess over background is found, and our likelihood analysis leads to a strong upper limit on the dark matter-nucleon coupling strength. We further combine the PandaX-II constraints and those from observations of the light element abundances in the early universe, and show that direct detection and cosmological probes can provide complementary constraints on dark matter models with a light mediator.

hep-ex↗

arXiv2021

SIN:Superpixel Interpolation Network

Superpixels have been widely used in computer vision tasks due to their representational and computational efficiency. Meanwhile, deep learning and end-to-end framework have made great progress in various fields including computer vision. However, existing superpixel algorithms cannot be integrated into subsequent tasks in an end-to-end way. Traditional algorithms and deep learning-based algorithms are two main streams in superpixel segmentation. The former is non-differentiable and the latter needs a non-differentiable post-processing step to enforce connectivity, which constraints the integration of superpixels and downstream tasks. In this paper, we propose a deep learning-based superpixel segmentation algorithm SIN which can be integrated with downstream tasks in an end-to-end way. Owing to some downstream tasks such as visual tracking require real-time speed, the speed of generating superpixels is also important. To remove the post-processing step, our algorithm enforces spatial connectivity from the start. Superpixels are initialized by sampled pixels and other pixels are assigned to superpixels through multiple updating steps. Each step consists of a horizontal and a vertical interpolation, which is the key to enforcing spatial connectivity. Multi-layer outputs of a fully convolutional network are utilized to predict association scores for interpolations. Experimental results show that our approach runs at about 80fps and performs favorably against state-of-the-art methods. Furthermore, we design a simple but effective loss function which reduces much training time. The improvements of superpixel-based tasks demonstrate the effectiveness of our algorithm. We hope SIN will be integrated into downstream tasks in an end-to-end way and benefit the superpixel-based community. Code is available at: \href{https://github.com/yuanqqq/SIN}{https://github.com/yuanqqq/SIN}.

cs.CV↗

arXiv2021

Horizontal Position Reconstruction in PandaX-II

Dual-phase noble-gas time projection chambers (TPCs) have improved the sensitivities for dark matter direct search in past decades. The capability of TPCs to reconstruct 3-D vertexes of keV scale recoilings is one of the most advantageous features. In this work, we develop two horizontal position reconstruction algorithms for the PandaX-II dark matter search experiment using the dual-phase liquid xenon TPC. Both algorithms are optimized by the $^{83m}$Kr calibration events and use photon distribution of ionization signals among photomultiplier tubes to infer the positions. According to the events coming from the gate electrode, the uncertainties in the horizontal positions are 3.4 mm (3.9 mm) in the analytical (simulation-based) algorithm for an ionization signal with several thousand photon electrons in the center of the TPC

physics.ins-det↗

arXiv2021

Properties of the fast fission and the coincident emissions of light charged particles in $^{40}$Ar + $^{197}$Au reactions at 30 MeV/u

The experiment of Ar+Au reactions at 30 MeV/u have been performed using the Compact Spectrometer for Heavy IoN Experiments (CSHINE) in phase I. The light-charged particles are measured by the silicon stripe telescopes in coincidence with the fission fragments recorded by the parallel plate avalanche counters. The distribution properties of the azimuth difference $Δϕ$ and the time-of-flight difference $ΔTOF$ of the fission fragments are presented varying the folding angles which represents the linear momentum transfer from the projectile to the reaction system. The relative abundance of the light charged particles in the fission events to the inclusive events is compared as a function of the laboratory angle $θ_{\rm lab}$ ranging from $18^\circ$ to $60^\circ$ in various folding angle windows. The angular evolution of the yield ratios of p/d and t/d in coincidence with fission fragments is investigated. In a relative comparison, tritons are more abundantly emitted at small angles, while protons are more abundant at large angles. The angular evolution of the neutron richness of the light-charged particles is consistent with the results obtained in previous inclusive experiments.

nucl-ex↗

arXiv2021

Fully Non-Homogeneous Atmospheric Scattering Modeling with Convolutional Neural Networks for Single Image Dehazing

In recent years, single image dehazing models (SIDM) based on atmospheric scattering model (ASM) have achieved remarkable results. However, it is noted that ASM-based SIDM degrades its performance in dehazing real world hazy images due to the limited modelling ability of ASM where the atmospheric light factor (ALF) and the angular scattering coefficient (ASC) are assumed as constants for one image. Obviously, the hazy images taken in real world cannot always satisfy this assumption. Such generating modelling mismatch between the real-world images and ASM sets up the upper bound of trained ASM-based SIDM for dehazing. Bearing this in mind, in this study, a new fully non-homogeneous atmospheric scattering model (FNH-ASM) is proposed for well modeling the hazy images under complex conditions where ALF and ASC are pixel dependent. However, FNH-ASM brings difficulty in practical application. In FNH-ASM based SIDM, the estimation bias of parameters at different positions lead to different distortion of dehazing result. Hence, in order to reduce the influence of parameter estimation bias on dehazing results, two new cost sensitive loss functions, beta-Loss and D-Loss, are innovatively developed for limiting the parameter bias of sensitive positions that have a greater impact on the dehazing result. In the end, based on FNH-ASM, an end-to-end CNN-based dehazing network, FNHD-Net, is developed, which applies beta-Loss and D-Loss. Experimental results demonstrate the effectiveness and superiority of our proposed FNHD-Net for dehazing on both synthetic and real-world images. And the performance improvement of our method increases more obviously in dense and heterogeneous haze scenes.

cs.CV↗

arXiv2021

Neighbor-view Enhanced Model for Vision and Language Navigation

Vision and Language Navigation (VLN) requires an agent to navigate to a target location by following natural language instructions. Most of existing works represent a navigation candidate by the feature of the corresponding single view where the candidate lies in. However, an instruction may mention landmarks out of the single view as references, which might lead to failures of textual-visual matching of existing methods. In this work, we propose a multi-module Neighbor-View Enhanced Model (NvEM) to adaptively incorporate visual contexts from neighbor views for better textual-visual matching. Specifically, our NvEM utilizes a subject module and a reference module to collect contexts from neighbor views. The subject module fuses neighbor views at a global level, and the reference module fuses neighbor objects at a local level. Subjects and references are adaptively determined via attention me'chanisms. Our model also includes an action module to utilize the strong orientation guidance (e.g., "turn left") in instructions. Each module predicts navigation action separately and their weighted sum is used for predicting the final action. Extensive experimental results demonstrate the effectiveness of the proposed method on the R2R and R4R benchmarks against several state-of-the-art navigators, and NvEM even beats some pre-training ones. Our code is available at https://github.com/MarSaKi/NvEM.

cs.CV↗

arXiv2021

Adaptive Dilated Convolution For Human Pose Estimation

Most existing human pose estimation (HPE) methods exploit multi-scale information by fusing feature maps of four different spatial sizes, \ie $1/4$, $1/8$, $1/16$, and $1/32$ of the input image. There are two drawbacks of this strategy: 1) feature maps of different spatial sizes may be not well aligned spatially, which potentially hurts the accuracy of keypoint location; 2) these scales are fixed and inflexible, which may restrict the generalization ability over various human sizes. Towards these issues, we propose an adaptive dilated convolution (ADC). It can generate and fuse multi-scale features of the same spatial sizes by setting different dilation rates for different channels. More importantly, these dilation rates are generated by a regression module. It enables ADC to adaptively adjust the fused scales and thus ADC may generalize better to various human sizes. ADC can be end-to-end trained and easily plugged into existing methods. Extensive experiments show that ADC can bring consistent improvements to various HPE methods. The source codes will be released for further research.

cs.CV↗

arXiv2021

Hate Speech Detection in Clubhouse

With the rise of voice chat rooms, a gigantic resource of data can be exposed to the research community for natural language processing tasks. Moderators in voice chat rooms actively monitor the discussions and remove the participants with offensive language. However, it makes the hate speech detection even more difficult since some participants try to find creative ways to articulate hate speech. This makes the hate speech detection challenging in new social media like Clubhouse. To the best of our knowledge all the hate speech datasets have been collected from text resources like Twitter. In this paper, we take the first step to collect a significant dataset from Clubhouse as the rising star in social media industry. We analyze the collected instances from statistical point of view using the Google Perspective Scores. Our experiments show that, the Perspective Scores can outperform Bag of Words and Word2Vec as high level text features.

cs.LG↗

arXiv2021

Statistical Analysis of Perspective Scores on Hate Speech Detection

Hate speech detection has become a hot topic in recent years due to the exponential growth of offensive language in social media. It has proven that, state-of-the-art hate speech classifiers are efficient only when tested on the data with the same feature distribution as training data. As a consequence, model architecture plays the second role to improve the current results. In such a diverse data distribution relying on low level features is the main cause of deficiency due to natural bias in data. That's why we need to use high level features to avoid a biased judgement. In this paper, we statistically analyze the Perspective Scores and their impact on hate speech detection. We show that, different hate speech datasets are very similar when it comes to extract their Perspective Scores. Eventually, we prove that, over-sampling the Perspective Scores of a hate speech dataset can significantly improve the generalization performance when it comes to be tested on other hate speech datasets.

cs.CL↗

arXiv2021

CMF: Cascaded Multi-model Fusion for Referring Image Segmentation

In this work, we address the task of referring image segmentation (RIS), which aims at predicting a segmentation mask for the object described by a natural language expression. Most existing methods focus on establishing unidirectional or directional relationships between visual and linguistic features to associate two modalities together, while the multi-scale context is ignored or insufficiently modeled. Multi-scale context is crucial to localize and segment those objects that have large scale variations during the multi-modal fusion process. To solve this problem, we propose a simple yet effective Cascaded Multi-modal Fusion (CMF) module, which stacks multiple atrous convolutional layers in parallel and further introduces a cascaded branch to fuse visual and linguistic features. The cascaded branch can progressively integrate multi-scale contextual information and facilitate the alignment of two modalities during the multi-modal fusion process. Experimental results on four benchmark datasets demonstrate that our method outperforms most state-of-the-art methods. Code is available at https://github.com/jianhua2022/CMF-Refseg.

cs.CV↗

arXiv2021

External Calibrator in Global Signal Experiment for Detection of the Epoch of Reionization

We present a conceptual design study of external calibrators in the 21 cm experiment towards detecting the globally averaged radiation of the epoch of reionization (EoR). Employment of external calibrator instead of internal calibrator commonly used in current EoR experiments allows to remove instrumental effects such as beam pattern, receiver gain and instability of the system if the conventional three-position switch measurements are implemented in a short time interval. Furthermore, in the new design the antenna system is placed in an underground anechoic chamber with an open/closing ceiling to maximally reduce the environmental effect such as RFI and ground radiation/reflection. It appears that three of the four external calibrators proposed in this paper, including two indoor artificial transmitters and one outdoor celestial radiation (the Galactic polarization), fail to meet our purpose. Diurnal motion of the Galactic diffuse emission turns to be the most possible source as an external calibrator, for which we have discussed the observational strategy and the algorithm of extracting the EoR signal.

astro-ph.IM↗

arXiv2021

End-to-end Alternating Optimization for Blind Super Resolution

Previous methods decompose the blind super-resolution (SR) problem into two sequential steps: \textit{i}) estimating the blur kernel from given low-resolution (LR) image and \textit{ii}) restoring the SR image based on the estimated kernel. This two-step solution involves two independently trained models, which may not be well compatible with each other. A small estimation error of the first step could cause a severe performance drop of the second one. While on the other hand, the first step can only utilize limited information from the LR image, which makes it difficult to predict a highly accurate blur kernel. Towards these issues, instead of considering these two steps separately, we adopt an alternating optimization algorithm, which can estimate the blur kernel and restore the SR image in a single model. Specifically, we design two convolutional neural modules, namely \textit{Restorer} and \textit{Estimator}. \textit{Restorer} restores the SR image based on the predicted kernel, and \textit{Estimator} estimates the blur kernel with the help of the restored SR image. We alternate these two modules repeatedly and unfold this process to form an end-to-end trainable network. In this way, \textit{Estimator} utilizes information from both LR and SR images, which makes the estimation of the blur kernel easier. More importantly, \textit{Restorer} is trained with the kernel estimated by \textit{Estimator}, instead of the ground-truth kernel, thus \textit{Restorer} could be more tolerant to the estimation error of \textit{Estimator}. Extensive experiments on synthetic datasets and real-world images show that our model can largely outperform state-of-the-art methods and produce more visually favorable results at a much higher speed. The source code is available at \url{https://github.com/greatlog/DAN.git}.

cs.CV↗