arXiv subjects

Yongjun Wang

Publications and source records attributed to Yongjun Wang.

33 records · Page 2Linked to original sources

arXiv2024

Intuitionistic Quantum Logic Perspective: Static and Dynamic Revision Operators

The classical belief revision framework, as proposed by Alchourron, Gardenfors, and Makinson, involves the revision of a theory based on eight postulates. In this paper, we focus on the exploration of a revision theory grounded in quantum mechanics, referred to as the natural revision theory. There are two reasoning modes in quantum systems: static intuitionistic reasoning, which incorporates contextuality, and dynamic reasoning, which is achieved through projection measurement. We combine the advantages of two intuitionistic quantum logic frameworks, as proposed by D{ö}ring and Coecke, respectively. Our goal is to establish a truth-value assignment for intuitionistic quantum logic that not only aligns with the inherent characteristics of quantum mechanics but also supports truth-value reasoning. The natural revision theory is then investigated based on this approach. We introduce two types of revision operators that correspond to the two reasoning modes in quantum systems: static and dynamic revision. Furthermore, we highlight the distinctions between these two operators. Shifting away from classical revision paradigms, we consider the revision of consequence relations in intuitionistic quantum logic. We demonstrate how, within the natural revision theory framework, both revision operators collectively influence the consequence relations. Notably, the outcomes of revision process are impacted by the sequence in which these interweaved operators are deployed.

quant-ph↗

arXiv2024

Calibrated One-class Classification for Unsupervised Time Series Anomaly Detection

Time series anomaly detection is instrumental in maintaining system availability in various domains. Current work in this research line mainly focuses on learning data normality deeply and comprehensively by devising advanced neural network structures and new reconstruction/prediction learning objectives. However, their one-class learning process can be misled by latent anomalies in training data (i.e., anomaly contamination) under the unsupervised paradigm. Their learning process also lacks knowledge about the anomalies. Consequently, they often learn a biased, inaccurate normality boundary. To tackle these problems, this paper proposes calibrated one-class classification for anomaly detection, realizing contamination-tolerant, anomaly-informed learning of data normality via uncertainty modeling-based calibration and native anomaly-based calibration. Specifically, our approach adaptively penalizes uncertain predictions to restrain irregular samples in anomaly contamination during optimization, while simultaneously encouraging confident predictions on regular samples to ensure effective normality learning. This largely alleviates the negative impact of anomaly contamination. Our approach also creates native anomaly examples via perturbation to simulate time series abnormal behaviors. Through discriminating these dummy anomalies, our one-class learning is further calibrated to form a more precise normality boundary. Extensive experiments on ten real-world datasets show that our model achieves substantial improvement over sixteen state-of-the-art contenders.

cs.LG↗

arXiv2024

Learning Dual-arm Object Rearrangement for Cartesian Robots

This work focuses on the dual-arm object rearrangement problem abstracted from a realistic industrial scenario of Cartesian robots. The goal of this problem is to transfer all the objects from sources to targets with the minimum total completion time. To achieve the goal, the core idea is to develop an effective object-to-arm task assignment strategy for minimizing the cumulative task execution time and maximizing the dual-arm cooperation efficiency. One of the difficulties in the task assignment is the scalability problem. As the number of objects increases, the computation time of traditional offline-search-based methods grows strongly for computational complexity. Encouraged by the adaptability of reinforcement learning (RL) in long-sequence task decisions, we propose an online task assignment decision method based on RL, and the computation time of our method only increases linearly with the number of objects. Further, we design an attention-based network to model the dependencies between the input states during the whole task execution process to help find the most reasonable object-to-arm correspondence in each task assignment round. In the experimental part, we adapt some search-based methods to this specific setting and compare our method with them. Experimental result shows that our approach achieves outperformance over search-based methods in total execution time and computational efficiency, and also verifies the generalization of our method to different numbers of objects. In addition, we show the effectiveness of our method deployed on the real robot in the supplementary video.

cs.RO↗

arXiv2023

RoSAS: Deep Semi-Supervised Anomaly Detection with Contamination-Resilient Continuous Supervision

Semi-supervised anomaly detection methods leverage a few anomaly examples to yield drastically improved performance compared to unsupervised models. However, they still suffer from two limitations: 1) unlabeled anomalies (i.e., anomaly contamination) may mislead the learning process when all the unlabeled data are employed as inliers for model training; 2) only discrete supervision information (such as binary or ordinal data labels) is exploited, which leads to suboptimal learning of anomaly scores that essentially take on a continuous distribution. Therefore, this paper proposes a novel semi-supervised anomaly detection method, which devises \textit{contamination-resilient continuous supervisory signals}. Specifically, we propose a mass interpolation method to diffuse the abnormality of labeled anomalies, thereby creating new data samples labeled with continuous abnormal degrees. Meanwhile, the contaminated area can be covered by new data samples generated via combinations of data with correct labels. A feature learning-based objective is added to serve as an optimization constraint to regularize the network and further enhance the robustness w.r.t. anomaly contamination. Extensive experiments on 11 real-world datasets show that our approach significantly outperforms state-of-the-art competitors by 20%-30% in AUC-PR and obtains more robust and superior performance in settings with different anomaly contamination levels and varying numbers of labeled anomalies. The source code is available at https://github.com/xuhongzuo/rosas/.

cs.LG↗

arXiv2023

Microwave conductivity due to impurity scattering in cuprate superconductors

The microwave surface impedance measurements on cuprate superconductors provide the crucial information of the effect of the impurity scattering on the quasiparticle transport, however, the full understanding of the effect of the impurity scattering on the quasiparticle transport is still a challenging issue. Here based on the microscopic octet scattering model, the effect of the impurity scattering on the low-temperature microwave conductivity in cuprate superconductors is investigated in the self-consistent $T$-matrix approach. The impurity-dressed electron propagator obtained in the Fermi-arc-tip approximation of the quasiparticle excitations and scattering processes is employed to derive the electron current-current correlation function by taking into account the impurity-induced vertex correction. It is shown that the microwave conductivity spectrum is a non-Drude-like, with a sharp cusp-like peak extending to zero-energy and a high-energy tail falling slowly with energy. Moreover, the microwave conductivity decreases with the increase of the impurity concentration or with the increase of the strength of the impurity scattering potential. In a striking contrast to the dome-like shape of the doping dependence of the superconducting transition temperature, the microwave conductivity exhibits a reverse dome-like shape of the doping dependence. The theory also show that the highly unconventional features of the microwave conductivity are generated by both the strong electron correlation and impurity-scattering effects.

cond-mat.supr-con↗

arXiv2023

Deep Isolation Forest for Anomaly Detection

Isolation forest (iForest) has been emerging as arguably the most popular anomaly detector in recent years due to its general effectiveness across different benchmarks and strong scalability. Nevertheless, its linear axis-parallel isolation method often leads to (i) failure in detecting hard anomalies that are difficult to isolate in high-dimensional/non-linear-separable data space, and (ii) notorious algorithmic bias that assigns unexpectedly lower anomaly scores to artefact regions. These issues contribute to high false negative errors. Several iForest extensions are introduced, but they essentially still employ shallow, linear data partition, restricting their power in isolating true anomalies. Therefore, this paper proposes deep isolation forest. We introduce a new representation scheme that utilises casually initialised neural networks to map original data into random representation ensembles, where random axis-parallel cuts are subsequently applied to perform the data partition. This representation scheme facilitates high freedom of the partition in the original data space (equivalent to non-linear partition on subspaces of varying sizes), encouraging a unique synergy between random representations and random partition-based isolation. Extensive experiments show that our model achieves significant improvement over state-of-the-art isolation-based methods and deep detectors on tabular, graph and time series datasets; our model also inherits desired scalability from iForest.

cs.LG↗

arXiv2022

Electric-field control of the nucleation and motion of isolated three-fold polar vertices

Recently various topological polar structures have been discovered in oxide thin films. Despite the increasing evidence of their switchability under electrical and/or mechanical fields, the dynamic property of isolated ones, which is usually required for applications such as data storage, is still absent. Here, we show the controlled nucleation and motion of isolated three-fold vertices under an applied electric field. At the PbTiO3/SrRuO3 interface, a two-unit-cell thick SrTiO3 layer provides electrical boundary conditions for the formation of three-fold vertices. Utilizing the SrTiO3 layer and in situ electrical testing system, we find that isolated three-fold vertices can move in a controllable and reversible manner with a velocity up to ~629 nm s-1. Microstructural evolution of the nucleation and propagation of isolated three-fold vertices is further revealed by phase-field simulations. This work demonstrates the ability to electrically manipulate isolated three-fold vertices, shedding light on the dynamic property of isolated topological polar structures.

cond-mat.mtrl-sci↗

arXiv2022

Influence of impurities on electronic structure in cuprate superconductors

The impurity is inherently manifest in cuprate superconductors, as cation substitution or intercalation is necessary for the introduction of charge carriers, and its influence on the electronic state is at the heart of a great debate in physics. Here based on the microscopic octet scattering model, the influence of the impurity scattering on the electronic structure of cuprate superconductors is investigated in terms of the self-consistent T-matrix approach. The impurity scattering self-energy is evaluated firstly in the Fermi-arc-tip approximation of the quasiparticle excitations and scattering processes, and the obtained results show that the decisive role played by the impurity scattering self-energy in the particle-hole channel is the further renormalization of the quasiparticle band structure with a reduced quasiparticle lifetime, while the impurity scattering self-energy in the particle-particle channel induces a strong deviation from the d-wave behaviour of the superconducting gap, leading to the existence of a finite gap over the entire electron Fermi surface. Moreover, these impurity scattering self-energies are employed to study the exotic features of the line-shape in the quasiparticle excitation spectrum and the autocorrelation of the quasiparticle excitation spectra, and the obtained results are then compared with the corresponding experimental data. The theory therefore also indicates that the unconventional features of the electronic structure in cuprate superconductors is generated by both the strong electron correlation and impurity scattering.

cond-mat.supr-con↗

arXiv2022

End-to-End Multi-Tab Website Fingerprinting Attack: A Detection Perspective

Website fingerprinting attack (WFA) aims to deanonymize the website a user is visiting through anonymous networks channels (e.g., Tor). Despite of remarkable progress in the past years, most existing methods make implicitly a couple of artificial assumptions that (1) only a single website (i.e., single-tab) is visited each time, and (2) website fingerprinting data are pre-trimmed into a single trace per website manually. In reality, a user often open multiple tabs for multiple websites spontaneously. Indeed, this multi-tab WFA (MT-WFA) setting has been studied in a few recent works, but all of them still fail to fully respect the real-world situations. In particular, the overlapping challenge between website fingerprinting has never been investigated in depth. In this work, we redefine the problem of MT-WFA as detecting multiple monitored traces, given a natural untrimmed traffic data including monitored traces, unmonitored traces, and potentially unconstrained overlapping between them. This eliminates the above assumptions, going beyond the conventional single website fingerprint classification perspective taken by all previous WFA methods. To tackle this realistic MT-WFA problem, we formulate a novel Website Fingerprint Detection (WFD) model capable of detecting accurately the start and end points of all the monitored traces and classifying them jointly, given long, untrimmed raw traffic data. WFD is end-to-end, with the trace localization and website classification integrated in a single unified pipeline. To enable quantitative evaluation in our MT-WFA setting, we introduce new performance metrics. Extensive experiments on several newly constructed benchmarks show that our WFD outperforms the state-of-the-art alternative methods in both accuracy and efficiency by a large margin, even with a very small training set. Code is available at https://github.com/WFDetector/WFDetection

cs.CR↗

arXiv2022

Network resilience in the aging brain

Degeneration and adaptation are two competing sides of the same coin called resilience in the progressive processes of brain aging or diseases. Degeneration accumulates during brain aging and other cerebral activities, causing structural atrophy and dysfunction. At the same time, adaptation allows brain network reorganize to compensate for structural loss to maintain cognition function. Although hidden resilience mechanism is critical and fundamental to uncover the brain aging law, due to the lack of datasets and appropriate methodology, it remains essentially unknown how these two processes interact dynamically across brain networks. To quantitatively investigate this complex process, we analyze aging brains based on 6-year follow-up multimodal neuroimaging database from 63 persons. We reveal the critical mechanism of network resilience that various perturbation may cause fast brain structural atrophy, and then brain can reorganize its functional layout to lower its operational efficiency, which helps to slow down the structural atrophy and finally recover its functional efficiency equilibrium. This empirical finding could be explained by our theoretical model, suggesting one universal resilience dynamical function. This resilience is achieved in the brain functional network with evolving percolation and rich-club features. Our findings can help to understand the brain aging process and design possible mitigation methods to adjust interaction between degeneration and adaptation from resilience viewpoint.

q-bio.NC↗

arXiv2021

DRAM Failure Prediction in AIOps: Empirical Evaluation, Challenges and Opportunities

DRAM failure prediction is a vital task in AIOps, which is crucial to maintain the reliability and sustainable service of large-scale data centers. However, limited work has been done on DRAM failure prediction mainly due to the lack of public available datasets. This paper presents a comprehensive empirical evaluation of diverse machine learning techniques for DRAM failure prediction using a large-scale multi-source dataset, including more than three millions of records of kernel, address, and mcelog data, provided by Alibaba Cloud through PAKDD 2021 competition. Particularly, we first formulate the problem as a multi-class classification task and exhaustively evaluate seven popular/state-of-the-art classifiers on both the individual and multiple data sources. We then formulate the problem as an unsupervised anomaly detection task and evaluate three state-of-the-art anomaly detectors. Further, based on the empirical results and our experience of attending this competition, we discuss major challenges and present future research opportunities in this task.

cs.LG↗

arXiv2021

Few-Shot Website Fingerprinting Attack

This work introduces a novel data augmentation method for few-shot website fingerprinting (WF) attack where only a handful of training samples per website are available for deep learning model optimization. Moving beyond earlier WF methods relying on manually-engineered feature representations, more advanced deep learning alternatives demonstrate that learning feature representations automatically from training data is superior. Nonetheless, this advantage is subject to an unrealistic assumption that there exist many training samples per website, which otherwise will disappear. To address this, we introduce a model-agnostic, efficient, and Harmonious Data Augmentation (HDA) method that can improve deep WF attacking methods significantly. HDA involves both intra-sample and inter-sample data transformations that can be used in harmonious manner to expand a tiny training dataset to an arbitrarily large collection, therefore effectively and explicitly addressing the intrinsic data scarcity problem. We conducted expensive experiments to validate our HDA for boosting state-of-the-art deep learning WF attack models in both closed-world and open-world attacking scenarios, at absence and presence of strong defense. {For instance, in the more challenging and realistic evaluation scenario with WTF-PAD based defense, our HDA method surpasses the previous state-of-the-art results by more than 4% in absolute classification accuracy in the 20-shot learning case.

cs.CR↗

arXiv2018

Asymmetric doping dependence of superconductivity between hole- and electron-doped triangular-lattice superconductors

Within the framework of kinetic-energy-driven superconductivity, the asymmetric doping dependence of superconductivity between the hole- and electron-doped triangular-lattice superconductors has been studied. It is shown that although the superconducting transition temperature has a dome-shaped doping dependence for both the hole- and electron-doped triangular-lattice superconductors, superconductivity appears over a wide doping of range in the hole-doped case, while it only exists in a narrow range of the doping in the electron-doped side. Moreover, the maximum superconducting transition temperature around the optimal doping in the electron-doped triangular-lattice superconductors is lower than that of the hole-doped counterparts. The theory also shows that the asymmetric doping dependence of superconductivity between the hole- and electron-doped cases may be a common feature for a doped Mott insulator.

cond-mat.supr-con↗

arXiv2015

SDSS/SEGUE Spectral Feature Analysis For Stellar Atmospheric Parameter Estimation

Large-scale and deep sky survey missions are rapidly collecting a large amount of stellar spectra, which necessitate the estimation of atmospheric parameters directly from spectra and makes it feasible to statistically investigate latent principles in a large dataset. We present a technique for estimating parameters $T_{eff}$, log$~g$ and [Fe/H] from stellar spectra. With this technique, we first extract features from stellar spectra using the LASSO algorithm; then, the parameters are estimated from the extracted features using the SVR. On a subsample of 20~000 stellar spectra from SDSS with reference parameters provided by SDSS/SEGUE Pipeline SSPP, estimation consistency are 0.007458 dex for log$~T_{eff}$ (101.609921 K for $T_{eff}$), 0.189557 dex for log$~g$ and 0.182060 for [Fe/H], where the consistency is evaluated by mean absolute error. Prominent characteristics of the proposed scheme are sparseness, locality, and physical interpretability. In this work, every spectrum consists of 3821 fluxes, and 10, 19, and 14 typical wavelength positions are detected respectively for estimating $T_{eff}$, log$~g$ and [Fe/H]. It is shown that the positions are related to typical lines of stellar spectra. This characteristic is important in investigating physical indications from analysis results. Then, stellar spectra can be described by the individual fluxes on the detected positions (PD) or local integration of fluxes near them (LI). The abovementioned consistency is the result based on features described by LI. If features are described by PD, consistency are 0.009092 dex for log$~T_{eff}$ (124.545075 K for $T_{eff}$), 0.198928 dex for log$~g$, and 0.206814 dex for [Fe/H].

astro-ph.SR↗

arXiv2015

Linearly Supporting Feature Extraction For Automated Estimation Of Stellar Atmospheric Parameters

We describe a scheme to extract linearly supporting (LSU) features from stellar spectra to automatically estimate the atmospheric parameters $T_{eff}$, log$~g$, and [Fe/H]. "Linearly supporting" means that the atmospheric parameters can be accurately estimated from the extracted features through a linear model. The successive steps of the process are as follow: first, decompose the spectrum using a wavelet packet (WP) and represent it by the derived decomposition coefficients; second, detect representative spectral features from the decomposition coefficients using the proposed method Least Absolute Shrinkage and Selection Operator (LARS)$_{bs}$; third, estimate the atmospheric parameters $T_{eff}$, log$~g$, and [Fe/H] from the detected features using a linear regression method. One prominent characteristic of this scheme is its ability to evaluate quantitatively the contribution of each detected feature to the atmospheric parameter estimate and also to trace back the physical significance of that feature. This work also shows that the usefulness of a component depends on both wavelength and frequency. The proposed scheme has been evaluated on both real spectra from the Sloan Digital Sky Survey (SDSS)/SEGUE and synthetic spectra calculated from Kurucz's NEWODF models. On real spectra, we extracted 23 features to estimate $T_{eff}$, 62 features for log$~g$, and 68 features for [Fe/H]. Test consistencies between our estimates and those provided by the Spectroscopic Sarameter Pipeline of SDSS show that the mean absolute errors (MAEs) are 0.0062 dex for log$~T_{eff}$ (83 K for $T_{eff}$), 0.2345 dex for log$~g$, and 0.1564 dex for [Fe/H]. For the synthetic spectra, the MAE test accuracies are 0.0022 dex for log$~T_{eff}$ (32 K for $T_{eff}$), 0.0337 dex for log$~g$, and 0.0268 dex for [Fe/H].

astro-ph.SR↗