arXiv subjects

Jun Yan

Publications and source records attributed to Jun Yan.

At least 181 records · Page 10Linked to original sources

arXiv2022

Regression Modeling for Recurrent Events Using R Package reReg

Recurrent event analyses have found a wide range of applications in biomedicine, public health, and engineering, among others, where study subjects may experience a sequence of event of interest during follow-up. The R package reReg (Chiou and Huang 2021) offers a comprehensive collection of practical and easy-to-use tools for regression analysis of recurrent events, possibly with the presence of an informative terminal event. The regression framework is a general scale-change model which encompasses the popular Cox-type model, the accelerated rate model, and the accelerated mean model as special cases. Informative censoring is accommodated through a subject-specific frailty without no need for parametric specification. Different regression models are allowed for the recurrent event process and the terminal event. Also included are visualization and simulation tools.

stat.CO↗

arXiv2022

Improving Tese Case Generation for Python Native Libraries Through Constraints on Input Data Structures

Modern Python projects execute computational functions using native libraries and give Python interfaces to boost execution speed; hence, testing these libraries becomes critical to the project's robustness. One challenge is that existing approaches use coverage to guide generation, but native libraries run as black boxes to Python code with no execution information. Another is that dynamic binary instrumentation reduces testing performance as it needs to monitor both native libraries and the Python virtual machine. To address these challenges, in this paper, we propose an automated test case generation approach that works at the Python code layer. Our insight is that many path conditions in native libraries are for processing input data structures through interacting with the VM. In our approach, we instrument the Python Interpreter to monitor the interactions between native libraries and VM, derive constraints on the structures, and then use the constraints to guide test case generation. We implement our approach in a tool named PyCing and apply it to six widely-used Python projects. The experimental results reveal that with the structure constraint guidance, PyCing can cover more execution paths than existing test cases and state-of-the-art tools. Also, with the checkers in the testing framework Pytest, PyCing can identify segmentation faults in 10 Python interfaces and memory leaks in 9. Our instrumentation strategy also has an acceptable influence on testing efficiency.

cs.SE↗

arXiv2022

Wavelet Regularization Benefits Adversarial Training

Adversarial training methods are state-of-the-art (SOTA) empirical defense methods against adversarial examples. Many regularization methods have been proven to be effective with the combination of adversarial training. Nevertheless, such regularization methods are implemented in the time domain. Since adversarial vulnerability can be regarded as a high-frequency phenomenon, it is essential to regulate the adversarially-trained neural network models in the frequency domain. Faced with these challenges, we make a theoretical analysis on the regularization property of wavelets which can enhance adversarial training. We propose a wavelet regularization method based on the Haar wavelet decomposition which is named Wavelet Average Pooling. This wavelet regularization module is integrated into the wide residual neural network so that a new WideWaveletResNet model is formed. On the datasets of CIFAR-10 and CIFAR-100, our proposed Adversarial Wavelet Training method realizes considerable robustness under different types of attacks. It verifies the assumption that our wavelet regularization method can enhance adversarial robustness especially in the deep wide neural networks. The visualization experiments of the Frequency Principle (F-Principle) and interpretability are implemented to show the effectiveness of our method. A detailed comparison based on different wavelet base functions is presented. The code is available at the repository: \url{https://github.com/momo1986/AdversarialWaveletTraining}.

cs.CV↗

arXiv2022

On the Robustness of Reading Comprehension Models to Entity Renaming

We study the robustness of machine reading comprehension (MRC) models to entity renaming -- do models make more wrong predictions when the same questions are asked about an entity whose name has been changed? Such failures imply that models overly rely on entity information to answer questions, and thus may generalize poorly when facts about the world change or questions are asked about novel entities. To systematically audit this issue, we present a pipeline to automatically generate test examples at scale, by replacing entity names in the original test sample with names from a variety of sources, ranging from names in the same test set, to common names in life, to arbitrary strings. Across five datasets and three pretrained model architectures, MRC models consistently perform worse when entities are renamed, with particularly large accuracy drops on datasets constructed via distant supervision. We also find large differences between models: SpanBERT, which is pretrained with span-level masking, is more robust than RoBERTa, despite having similar accuracy on unperturbed test data. We further experiment with different masking strategies as the continual pretraining objective and find that entity-based masking can improve the robustness of MRC models.

cs.CL↗

arXiv2022

Identifying structure-absorption relationships and predicting absorption strength of non-fullerene acceptors for organic photovoltaics

Non-fullerene acceptors (NFAs) are excellent light harvesters, yet the origin of such high optical extinction is not well understood. In this work, we investigate the absorption strength of NFAs by building a database of time-dependent density functional theory (TDDFT) calculations of ~500 pi-conjugated molecules. The calculations are first validated by comparison with experimental measurements on liquid and solid state using common fullerene and non-fullerene acceptors. We find that the molar extinction coefficient (ε_(d,max)) shows reasonable agreement between calculation in vacuum and experiment for molecules in solution, highlighting the effectiveness of TDDFT for predicting optical properties of organic pi-conjugated molecules. We then perform a statistical analysis based on molecular descriptors to identify which features are important in defining the absorption strength. This allows us to identify structural features that are correlated with high absorption strength in NFAs and could be used to guide molecular design: highly absorbing NFAs should possess a planar, linear, and fully conjugated molecular backbone with highly polarisable heteroatoms. We then exploit a random decision forest to draw predictions for ε_(d,max) using a computational framework based on extended tight-binding Hamiltonians, which shows reasonable predicting accuracy with lower computational cost than TDDFT. This work provides a general understanding of the relationship between molecular structure and absorption strength in pi-conjugated organic molecules, including NFAs, while introducing predictive machine-learning models of low computational cost.

physics.app-ph↗

arXiv2022

On the Minimax Spherical Designs

Distributing points on a (possibly high-dimensional) sphere with minimal energy is a long-standing problem in and outside the field of mathematics. This paper considers a novel energy function that arises naturally from statistics and combinatorial optimization, and studies its theoretical properties. Our result solves both the exact optimal spherical point configurations in certain cases and the minimal energy asymptotics under general assumptions. Connections between our results and the L1-Principal Component analysis and Quasi-Monte Carlo methods are also discussed.

math.CO↗

arXiv2022

CBLUE: A Chinese Biomedical Language Understanding Evaluation Benchmark

Artificial Intelligence (AI), along with the recent progress in biomedical language understanding, is gradually changing medical practice. With the development of biomedical language understanding benchmarks, AI applications are widely used in the medical field. However, most benchmarks are limited to English, which makes it challenging to replicate many of the successes in English for other languages. To facilitate research in this direction, we collect real-world biomedical data and present the first Chinese Biomedical Language Understanding Evaluation (CBLUE) benchmark: a collection of natural language understanding tasks including named entity recognition, information extraction, clinical diagnosis normalization, single-sentence/sentence-pair classification, and an associated online platform for model evaluation, comparison, and analysis. To establish evaluation on these tasks, we report empirical results with the current 11 pre-trained Chinese models, and experimental results show that state-of-the-art neural models perform by far worse than the human ceiling. Our benchmark is released at \url{https://tianchi.aliyun.com/dataset/dataDetail?dataId=95414&lang=en-us}.

cs.CL↗

arXiv2022

Knowledge Management for Cloud Computing Field

Migration legacy systems to cloud platforms is a knowledge intensive process. There is an ever increasing body of knowledge reporting empirical scenarios of successful and problematic cloud migration. Reusing this body of knowledge, dispersed and fragmented over the academic/multi-vocal literature, has practical values to mitigate costly risks and pitfalls in further projects of legacy to-cloud and cloud-to-cloud migration. In line with this, knowledge management systems/platforms pertinent to cloud migration are a prime prerequisite and a strategic imperative for an organization. We have conducted a qualitative exploratory study to understand the benefits and challenges of developing Knowledge Management Systems (KMS) for cloud migration in real trials. Whilst our prototype system demonstration supported the importance and bene-fits of developing Cloud Migration KMS (CM-KMS), our semi-structured industry interview study with 11 participants highlighted challenging impediments against developing this class of KMS. As a result, this study proposes nine significant challenges that cause the abandon of the design and maintenance of CM-KMS, including continuous changes and updates, integration of knowledge, knowledge granularity, preservation of context, automation, deconstruction of traditional knowledge, dependency on experts, hybrid knowledge of both vendor-specific and vendor-neutral cloud platforms, and parsimony. Our results inform cloud architects to pay attention to adopt CM-KMS for the legacy-to-cloud migration in their organizations.

cs.SE↗

arXiv2022

Nonlinear semigroup approach to Hamilton-Jacobi equations -- A toy model

In this paper, we discuss the existence and multiplicity problem of viscosity solution to the Hamilton-Jacobi equation $$h(x,d_x u)+λ(x)u=c,\quad x\in M,$$ where $M$ is a closed manifold and $λ:M\rightarrow\mathbb{R}$ changes signs on $M$, via nonlinear semigroup method. It turns out that a bifurcation phenomenon occurs when parameter $c$ strides over the critical value. As an application of the main result, we analyse the structure of the set of viscosity solutions of an one-dimensional example in detail.

math.AP↗

arXiv2022

Density-Aware Hyper-Graph Neural Networks for Graph-based Semi-supervised Node Classification

Graph-based semi-supervised learning, which can exploit the connectivity relationship between labeled and unlabeled data, has been shown to outperform the state-of-the-art in many artificial intelligence applications. One of the most challenging problems for graph-based semi-supervised node classification is how to use the implicit information among various data to improve the performance of classifying. Traditional studies on graph-based semi-supervised learning have focused on the pairwise connections among data. However, the data correlation in real applications could be beyond pairwise and more complicated. The density information has been demonstrated to be an important clue, but it is rarely explored in depth among existing graph-based semi-supervised node classification methods. To develop a flexible and effective model for graph-based semi-supervised node classification, we propose a novel Density-Aware Hyper-Graph Neural Networks (DA-HGNN). In our proposed approach, hyper-graph is provided to explore the high-order semantic correlation among data, and a density-aware hyper-graph attention network is presented to explore the high-order connection relationship. Extensive experiments are conducted in various benchmark datasets, and the results demonstrate the effectiveness of the proposed approach.

cs.LG↗

arXiv2022

An Efficient Algorithm for Generating Directed Networks with Predetermined Assortativity Measures

Assortativity coefficients are important metrics to analyze both directed and undirected networks. In general, it is not guaranteed that the fitted model will always agree with the assortativity coefficients in the given network, and the structure of directed networks is more complicated than the undirected ones. Therefore, we provide a remedy by proposing a degree-preserving rewiring algorithm, called DiDPR, for generating directed networks with given directed assortativity coefficients. We construct the joint edge distribution of the target network by accounting for the four directed assortativity coefficients simultaneously, provided that they are attainable, and obtain the desired network by solving a convex optimization problem.Our algorithm also helps check the attainability of the given assortativity coefficients. We assess the performance of the proposed algorithm by simulation studies with focus on two different network models, namely Erdös--Rényi and preferential attachment random networks. We then apply the algorithm to a Facebook wall post network as a real data example. The codes for implementing our algorithm are publicly available in R package wdnet.

stat.CO↗

arXiv2021

Time-periodic solutions of contact Hamilton-Jacobi equations on the circle

We are concerned with the existence and multiplicity of nontrivial time-periodic viscosity solutions to \[ \partial_t w(x,t) + H( x,\partial_x w(x,t),w(x,t) )=0,\quad (x,t)\in \mathbb{S} \times [0,+\infty). \] We find that there are infinitely many nontrivial time-periodic viscosity solutions with different periods when $\frac{\partial H}{\partial u}(x,p,u)\leqslant-δ<0$ by analyzing the asymptotic behavior of the dynamical system $(C(\mathbb{S} ,\mathbb{R}),\{T_t\}_{t\geqslant 0})$, where $\{T_t\}_{t\geqslant 0}$ was introduced in \cite{WWY1}. Moreover, in view of the convergence of $T_{t_n}φ$, we get the existence of nontrivial periodic points of $T_t$, where $φ$ are initial data satisfying certain properties. This is a long-time behavior result for the solution to the above equation with initial data $φ$. At last, as an application, we describe to readers a bifurcation phenomenon for \[ \partial_t w(x,t) + H( x,\partial_x w(x,t),λw(x,t) )=0,\quad (x,t)\in \mathbb{S} \times [0,+\infty), \] when the sign of the parameter $λ$ varies. The structure of the unit circle $\mathbb{S}$ plays an essential role here. The most important novelty is the discovery of the nontrivial recurrence of $(C(\mathbb{S} ,\mathbb{R}),\{T_t\}_{t\geqslant 0})$.

math.AP↗

arXiv2021

On the negative limit of viscosity solutions for discounted Hamilton-Jacobi equations

Suppose $M$ is a closed Riemannian manifold. For a $C^2$ generic (in the sense of Mañé) Tonelli Hamiltonian $H: T^*M\rightarrow\mathbb{R}$, the minimal viscosity solution $u_λ^-:M\rightarrow \mathbb{R}$ of the negative discounted equation \[-λu+H(x,d_xu)=c(H),\quad x\in M,\ λ>0 \] with the Mañé's critical value $c(H)$ converges to a uniquely established viscosity solution $u_0^-$ of the critical Hamilton-Jacobi equation \[ H(x,d_x u)=c(H),\quad x\in M \] as $λ\rightarrow 0_+$. We also propose a dynamical interpretation of $u_0^-$.

math.AP↗

arXiv2021

Axial Higgs Mode Detected by Quantum Pathway Interference in RTe3

The observation of the Higgs boson solidified the standard model of particle physics. However, explanations of anomalies (e.g. dark matter) rely on further symmetry breaking calling for an undiscovered axial Higgs mode. In condensed matter the Higgs was seen in magnetic, superconducting and charge density wave(CDW) systems. Uncovering a low energy mode's vector properties is challenging, requiring going beyond typical spectroscopic or scattering techniques. Here, we discover an axial Higgs mode in the CDW system RTe3 using the interference of quantum pathways. In RTe3 (R=La,Gd), the electronic ordering couples bands of equal or different angular momenta. As such, the Raman scattering tensor associated to the Higgs mode contains both symmetric and antisymmetric components, which can be excited via two distinct, but degenerate pathways. This leads to constructive or destructive interference of these pathways, depending on the choice of the incident and Raman scattered light polarization. The qualitative behavior of the Raman spectra is well-captured by an appropriate tight-binding model including an axial Higgs mode. The elucidation of the antisymmetric component provides direct evidence that the Higgs mode contains an axial vector representation (i.e. a pseudo-angular momentum) and hints the CDW in RTe3 is unconventional. Thus we provide a means for measuring collective modes quantum properties without resorting to extreme experimental conditions.

physics.optics↗

arXiv2021

RockNER: A Simple Method to Create Adversarial Examples for Evaluating the Robustness of Named Entity Recognition Models

To audit the robustness of named entity recognition (NER) models, we propose RockNER, a simple yet effective method to create natural adversarial examples. Specifically, at the entity level, we replace target entities with other entities of the same semantic class in Wikidata; at the context level, we use pre-trained language models (e.g., BERT) to generate word substitutions. Together, the two levels of attack produce natural adversarial examples that result in a shifted distribution from the training data on which our target models have been trained. We apply the proposed method to the OntoNotes dataset and create a new benchmark named OntoRock for evaluating the robustness of existing NER models via a systematic evaluation protocol. Our experiments and analysis reveal that even the best model has a significant performance drop, and these models seem to memorize in-domain entity patterns instead of reasoning from the context. Our work also studies the effects of a few simple data augmentation methods to improve the robustness of NER models.

cs.CL↗

arXiv2021

Enhancement of Exciton Valley Polarization in Monolayer MoS2 Induced by Scattering

We report on scattering induced valley polarization enhancement in monolayer molybdenum disulfide. With thermally activated and charge doping introduced scattering, our sample exhibits seven? and twelve-folds of improvements respectively. This counter-intuitive effect is attributed to disruptions to valley pseudospin precession caused by rapid modulation of exciton momentum and concomitant local exchange interaction field, at time scales much shorter than the precession period. In contrast, the valley coherence is improved by thermally activated scattering, but not by charge doping induced scattering. We propose that this is due to anisotropic pseudospin scattering and generalize the Maialle-Silva-Sham model to quantitatively explain our experimental results. Our work illustrates that cleaner samples with minimal scattering, such as those carefully suspended or protected by hexagonal boron nitride, do not necessarily lead to good valley polarization. Well-controlled scattering can in fact provide an interesting approach for improving valleytronic devices.

physics.optics↗

arXiv2021

FAST discovery of an extremely radio-faint millisecond pulsar from the Fermi-LAT unassociated source 3FGL J0318.1+0252

High sensitivity radio searches of unassociated $γ$-ray sources have proven to be an effective way of finding new pulsars. Using the Five-hundred-meter Aperture Spherical radio Telescope (FAST) during its commissioning phase, we have carried out a number of targeted deep searches of \textit{Fermi} Large Area Telescope (LAT) $γ$-ray sources. On Feb. 27$^{th}$, 2018 we discovered an isolated millisecond pulsar (MSP), PSR J0318+0253, coincident with the unassociated $γ$-ray source 3FGL J0318.1+0252. PSR J0318+0253 has a spin period of $5.19$ milliseconds, a dispersion measure (DM) of $26$ pc cm$^{-3}$ corresponding to a DM distance of about $1.3$ kpc, and a period-averaged flux density of $\sim$11 $\pm$ 2 $μ$Jy at L-band (1.05-1.45 GHz). Among all high energy MSPs, PSR J0318+0253 is the faintest ever detected in radio bands, by a factor of at least $\sim$4 in terms of L-band fluxes. With the aid of the radio ephemeris, an analysis of 9.6 years of \textit{Fermi}-LAT data revealed that PSR J0318+0253 also displays strong $γ$-ray pulsations. Follow-up observations carried out by both Arecibo and FAST suggest a likely spectral turn-over around 350 MHz. This is the first result from the collaboration between FAST and the \textit{Fermi}-LAT teams as well as the first confirmed new MSP discovery by FAST, raising hopes for the detection of many more MSPs. Such discoveries will make a significant contribution to our understanding of the neutron star zoo while potentially contributing to the future detection of gravitational waves, via pulsar timing array (PTA) experiments.

astro-ph.HE↗

arXiv2021

On Procedural Adversarial Noise Attack And Defense

Deep Neural Networks (DNNs) are vulnerable to adversarial examples which would inveigle neural networks to make prediction errors with small perturbations on the input images. Researchers have been devoted to promoting the research on the universal adversarial perturbations (UAPs) which are gradient-free and have little prior knowledge on data distributions. Procedural adversarial noise attack is a data-free universal perturbation generation method. In this paper, we propose two universal adversarial perturbation (UAP) generation methods based on procedural noise functions: Simplex noise and Worley noise. In our framework, the shading which disturbs visual classification is generated with rendering technology. Without changing the semantic representations, the adversarial examples generated via our methods show superior performance on the attack.

cs.LG↗