Researcher profile

Ying Wang

Ying Wang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author

73works

0followers

46topics

4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

preprint2026arXiv

A Hybrid Tucker-LSTM Tensor Network Model for SOC Prediction in Electric Vehicles

Accurate state of charge estimation is critical for the success of electric vehicle battery management strategies, but it is well known that conventional estimators suffer from two fundamental shortcomings: cumulative errors that grow over time and reliance on simplified battery models that do not reflect real world dynamics. Therefore, this paper presents a novel hybrid approach combining Tucker tensor decomposition with LSTM networks, using full - lifecycle EV field data for SOC prediction. The inputs are charge status, mileage, voltage, current, cell differentials, and temporal features. Tucker decomposition is skillfully used to reduce dimensionality while maintaining the temporal structure, hence allowing a direct, fair comparison with standard LSTM. The result is unequivocal: Tucker - LSTM outperforms the baseline on all metrics, with MSE dropping 70.5\% (from 21.07 to 6.22 ), MAE improving 48.7\% (from 3.37\% to 1.73\%), RMSE falling from 4.59\% to 2.49\%, and $R^2$ rising from 0.918 to 0.976. Since the experimental results demonstrably demonstrate that tensor decomposition compresses high-dimensional battery data very well without loss of predictive fidelity, this paper naturally opens up a new direction for tensor-based analytics in electric vehicle battery management.

preprint2026arXiv

A System Architecture for Low Latency Multiprogramming Quantum Computing

As quantum systems scale, Multiprogramming Quantum Computing (MPQC) becomes essential to improve device utilization and throughput. However, current MPQC pipelines rely on expensive online compilation to co-optimize concurrently running programs, because quantum executables are device-dependent, non-portable across qubit regions, and highly susceptible to noise and crosstalk. This online step dominates runtime and impedes low-latency deployments for practical, real-world workloads in the future, such as repeatedly invoked Quantum Neural Network (QNN) services. We present FLAMENCO, a fidelity-aware multi-version compilation system that enables independent offline compilation and low-latency, high-fidelity multiprogramming at runtime. At the architecture level, FLAMENCO abstracts devices into compute units to drastically shrink the search space of region allocation. At compile time, it generates diverse executable versions for each program -- each bound to a distinct qubit region -- allowing dynamic region selection at runtime and overcoming non-portability. At runtime, FLAMENCO employs a streamlined orchestrator that leverages post-compilation fidelity metrics to avoid conflicts and mitigate crosstalk, achieving reliable co-execution without online co-optimization. Comprehensive evaluations against state-of-the-art MPQC baselines show that FLAMENCO removes online compilation overhead, achieves over 5$\times$ runtime speedup, improves execution fidelity, and maintains high utilization as concurrency increases.

preprint2026arXiv

Compact Latent Manifold Translation: A Parameter-Efficient Foundation Model for Cross-Modal and Cross-Frequency Physiological Signal Synthesis

The analysis of physiological time series, such as electrocardiograms (ECG) and photoplethysmograms (PPG), is persistently hindered by modality and frequency gaps stemming from heterogeneous recording devices. Existing foundation models typically rely on continuous latent spaces, which frequently suffer from severe modality entanglement, lack high-fidelity cross-frequency generative capacity, and impose high computational costs that prohibit edge-device deployment. In this paper, we propose Compact Latent Manifold Translation (CLMT), a highly parameter-efficient (0.09B) unified framework that bridges these gaps through a novel two-stage discrete translation paradigm. First, we introduce a Universal Tokenizer utilizing Hierarchical Residual Vector Quantization (RVQ) to decouple heterogeneous signals into isolated, well-structured discrete latent manifolds, effectively preventing inter-modality interference. Second, a Context-Prompted Latent Translator maps these discrete tokens across modalities by integrating static physiological priors, reframing complex signal synthesis as a pure latent sequence translation task. Extensive evaluations demonstrate that our 0.09B model significantly outperforms massive baselines. In cross-modal PPG-to-ECG synthesis, it resolves temporal phase drift and dramatically improves the clinical R-peak detection F1-score from 0.37 (baseline) to 0.83. Furthermore, in extreme cross-frequency super-resolution (25Hz to 100Hz), it successfully recovers high-frequency diagnostic landmarks, achieving an unprecedented Pearson correlation of 0.9956. By learning a universal discrete language for biological signals with a fraction of the computational footprint, our approach sets a new trajectory for edge-deployable, multi-modal medical foundation models.

preprint2026arXiv

Cross-View Attention Fusion Net: A Prior-Guided Dual-View Representation Learning for Cardiac Output Estimation from Short-Term PPG Signals

Accurate cardiac output (CO) estimation from photoplethysmography (PPG) is promising for unobtrusive hemodynamic monitoring, but remains difficult since CO is jointly determined by cardiac function and vascular tone. Conventional feature-based models use physiologically meaningful PPG descriptors, yet depend on accurate pulse detection and may miss latent temporal relationships. In contrast, fully end-to-end deep learning models learn directly from raw PPG but often underuse established PPG-derived prior information. Here, we introduce the Cross-View Attention Fusion Network (CVAF-Net), a prior-guided dual-view deep learning model for CO estimation from short, fixed-length PPG segments. CVAF-Net processes raw PPG as a temporal view and a feature sequence map (FSM) as a structured prior-guided view, and fuses the two representations through cross-view attention. The model was independently evaluated using 5-, 15-, and 30-s segments from three datasets: simulated pulse waves (3323 subjects), vasoconstriction provocation (79 subjects), and resting/cycling activities (10 subjects), and was compared with multiple machine learning and deep learning benchmarks. CVAF-Net outperformed most benchmark methods and achieved performance comparable to a state-of-the-art Transformer-based model, with a mean absolute error (MAE) of 0.19 L/min (MAPE: 3.95%) on simulated data and high accuracy in real-world settings (minimum MAE: 1.20 L/min). Importantly, CVAF-Net reduced FLOPs by twelvefold compared with the leading Transformer-based model. Plausibility analysis showed physiologically consistent CO estimates, with expected correlations with age ($ρ= -0.274$), heart rate ($ρ= 0.894$), and systemic vascular resistance ($ρ= -0.740$). These findings indicate that CVAF-Net provides an accurate, computationally efficient, and generalizable approach for continuous wearable-based CO monitoring.

preprint2026arXiv

Evolutionary vaccination dynamics under higher-order reinforcement pressure

Vaccination games in higher-order settings remain underexplored, despite their importance in shaping opinions and collective decisions. Here, we introduce a parsimonious behavioral-epidemiological model to evaluate how peer reinforcement pressure influences vaccination uptake. The framework consists of a two-layer multiplex: an epidemic layer governed by the SIR process on a square lattice, and a behavioral layer represented by a hypergraph of triadic interactions. Individuals update their vaccination strategy via imitation, modulated by a reinforcement parameter $α$ when peer support is present. We find that higher-order structure alone induces clusters of vaccinated individuals that act as protective barriers. Low but nonzero reinforcement ($α\approx 0.5$) maximizes coverage and suppresses outbreaks, while both negligible ($α\approx 0$) and moderate ($α> 0.1$) reinforcement reduce uptake, as excessive confirmation lowers adaptability and enables non-vaccinators to re-emerge. Our work bridges complex contagion theory with evolutionary game dynamics, offering insights into how contact structure and peer reinforcement jointly shape vaccination behavior.

preprint2026arXiv

KernelEvolve: Scaling Agentic Kernel Coding for Heterogeneous AI Accelerators at Meta

Making deep learning recommendation model (DLRM) training and inference fast and efficient is important. However, this presents three key system challenges - model architecture diversity, kernel primitive diversity, and hardware generation and architecture heterogeneity. This paper presents KernelEvolve-an agentic kernel coding framework-to tackle heterogeneity at-scale for DLRM. KernelEvolve is designed to take kernel specifications as input and automate the process of kernel generation and optimization for recommendation model across heterogeneous hardware architectures. KernelEvolve does so by operating at multiple programming abstractions, from Triton and CuTe DSL to low-level hardware agnostic languages, spanning the full hardware-software optimization stack. The kernel optimization process is described as graph-based search with selection policy, universal operator, fitness function, and termination rule, dynamically adapts to runtime execution context through retrieval-augmented prompt synthesis. We designed, implemented, and deployed KernelEvolve to optimize a wide variety of production recommendation models across generations of NVIDIA and AMD GPUs, as well as Meta's AI accelerators. We validate KernelEvolve on the publicly-available KernelBench suite, achieving 100% pass rate on all 250 problems across three difficulty levels, and 160 PyTorch ATen operators across three heterogeneous hardware platforms, demonstrating 100% correctness. KernelEvolve reduces development time from weeks to hours and achieves substantial performance improvements over PyTorch baselines across diverse production use cases and for heterogeneous AI systems at-scale. Beyond performance efficiency improvements, KernelEvolve significantly mitigates the programmability barrier for new AI hardware by enabling automated kernel generation for in-house developed AI hardware.

preprint2026arXiv

Physiological-model-based neural network for modeling the metabolic-heart rate relationship during physical activities

Heart failure (HF) poses a significant global health challenge, with early detection offering opportunities for improved outcomes. Abnormalities in heart rate (HR), particularly during daily activities, may serve as early indicators of HF risk. However, existing HR monitoring tools for HF detection are limited by their reliability on population-based averages. The estimation of individualized HR serves as a dynamic digital twin, enabling precise tracking of cardiac health biomarkers. Current HR estimation methods, categorized into physiologically-driven and purely data-driven models, struggle with efficiency and interpretability. This study introduces a novel physiological-model-based neural network (PMB-NN) framework for HR estimation based on oxygen uptake (VO2) data during daily physical activities. The framework was trained and tested on individual datasets from 12 participants engaged in activities including resting, cycling, and running. By embedding physiological constraints, which were derived from our proposed simplified human movement physiological model (PM), into the neural network training process, the PMB-NN model adheres to human physiological principles while achieving high estimation accuracy, with a median R$^2$ score of 0.8 and an RMSE of 8.3 bpm. Comparative statistical analysis demonstrates that the PMB-NN achieves performance on par with the benchmark neural network model while significantly outperforming traditional physiological model (p=0.002). In addition, our PMB-NN is adept at identifying personalized parameters of the PM, enabling the PM to generate reasonable HR estimation. The proposed framework with a precise VO2 estimation system derived from body movements enables the future possibilities of personalized and real-time cardiac monitoring during daily life physical activities.

preprint2026arXiv

Realtime-VLA FLASH: Speculative Inference Framework for Diffusion-based VLAs

Diffusion-based vision-language-action models (dVLAs) are promising for embodied intelligence but are fundamentally limited in real-time deployment by the high latency of full inference. We propose Realtime-VLA FLASH, a speculative inference framework that eliminates most full inference calls during replanning by introducing a lightweight draft model with parallel verification via the main model's Action Expert and a phase-aware fallback mechanism that reverts to the full inference pipeline when needed. This design enables low-latency, high-frequency replanning without sacrificing reliability. Experiments show that on LIBERO, FLASH largely preserves task performance by replacing many 58.0 ms full-inference rounds with speculative rounds as fast as 7.8 ms, lowering task-level average inference latency to 19.1 ms (3.04x speedup). We additionally demonstrate effectiveness on real-world conveyor-belt sorting, highlighting its practical impact for latency-critical embodied tasks.

preprint2025arXiv

Dual-IRS Aided Near-/Hybrid-Field SWIPT: Passive Beamforming and Independent Antenna Power Splitting Design

This paper proposes a novel dual-intelligent reflecting surface (IRS) aided interference-limited simultaneous wireless information and power transfer (SWIPT) system with independent power splitting (PS), where each receiving antenna applies different PS factors to offer an advantageous trade-off between the useful information and harvested energy. We separately establish the near- and hybrid-field channel models for IRS-reflected links to evaluate the performance gain more precisely and practically. Specifically, we formulate an optimization problem of maximizing the harvested power by jointly optimizing dual-IRS phase shifts, independent PS ratio, and receive beamforming vector in both near- and hybrid-field cases. In the near-field case, the alternating optimization algorithm is proposed to solve the non-convex problem by applying the Lagrange duality method and the difference-of-convex (DC) programming. In the hybrid-field case, we first present an interesting result that the AP-IRS-user channel gains are invariant to the phase shifts of dual-IRS, which allows the optimization problem to be transformed into a convex one. Then, we derive the asymptotic performance of the combined channel gains in closed-form and analyze the characteristics of the dual-IRS. Numerical results validate our analysis and indicate the performance gains of the proposed scheme that dual-IRS-aided SWIPT with independent PS over other benchmark schemes.

preprint2024arXiv

SNS Junctions along the BCS-BEC Crossover

We present a theory of SNS junctions, a normal metal sandwiched between two superconductors, along the crossover from the BCS to the BEC regime. We calculate the Josephson current as a function of the chemical potential relative to the band edge in the superconducting region, $μ_S$, where the BEC phase is indicated by $μ_S <0$. The chemical potential relative to the band edge in the normal metal, $μ_N$, allows us to tune the junction between the SNS case ($μ_N>0$) and the SIS case, where the superconductors are separated by a tunneling barrier. We find that there are Andreev levels in the BEC regime, as long as there is sufficient density of states in the normal region, i.e. when $μ_N>Δ$, where $Δ$ is the amplitude of the superconducting order parameter. For 1D SNS junctions, we find the Josephson current $I_S$ carried by these Andreev levels to be a function of the ratio $Δ/Δ_d$, where $Δ_d$ is the Andreev level spacing. At zero temperature, the Josephson current has a maximum on the BCS side of the transition where $Δ$ is maximal. At finite temperature, however, we find that the maximum moves to the BEC side of the crossover. We identify the mechanism for this phenomenon to be the decrease in the number of Andreev levels at the BCS-BEC crossover, accompanied by an increase in excitation energy to the unoccupied levels, making it less likely that these states are thermally occupied. Thereby, at finite temperature, the Josephson current is more strongly reduced on the BCS side of the crossover, resulting in a maximal Josephson current at the BCS-BEC crossover.

preprint2024arXiv

Systematic Meets Unintended: Prior Knowledge Adaptive 5G Vulnerability Detection via Multi-Fuzzing

The virtualization and softwarization of 5G and NextG are critical enablers of the shift to flexibility, but they also present a potential attack surface for threats. However, current security research in communication systems focuses on specific aspects of security challenges and lacks a holistic perspective. To address this challenge, a novel systematic fuzzing approach is proposed to reveal, detect, and predict vulnerabilities with and without prior knowledge assumptions from attackers. It also serves as a digital twin platform for system testing and defense simulation pipeline. Three fuzzing strategies are proposed: Listen-and-Learn (LAL), Synchronize-and-Learn (SyAL), and Source-and-Learn (SoAL). The LAL strategy is a black-box fuzzing strategy used to discover vulnerabilities without prior protocol knowledge, while the SyAL strategy, also a black-box fuzzing method, targets vulnerabilities more accurately with attacker-accessible user information and a novel probability-based fuzzing approach. The white-box fuzzing strategy, SoAL, is then employed to identify and explain vulnerabilities through fuzzing of significant bits. Using the srsRAN 5G platform, the LAL strategy identifies 129 RRC connection vulnerabilities with an average detection duration of 0.072s. Leveraging the probability-based fuzzing algorithm, the SyAL strategy outperforms existing models in precision and recall, using significantly fewer fuzzing cases. SoAL detects three man-in-the-middle vulnerabilities stemming from 5G protocol vulnerabilities. The proposed solution is scalable to other open-source and commercial 5G platforms and protocols beyond RRC. Extensive experimental results demonstrate that the proposed solution is an effective and efficient approach to validate 5G security; meanwhile, it serves as real-time vulnerability detection and proactive defense.

preprint2024arXiv

TBDD: A New Trust-based, DRL-driven Framework for Blockchain Sharding in IoT

Integrating sharded blockchain with IoT presents a solution for trust issues and optimized data flow. Sharding boosts blockchain scalability by dividing its nodes into parallel shards, yet it's vulnerable to the $1\%$ attacks where dishonest nodes target a shard to corrupt the entire blockchain. Balancing security with scalability is pivotal for such systems. Deep Reinforcement Learning (DRL) adeptly handles dynamic, complex systems and multi-dimensional optimization. This paper introduces a Trust-based and DRL-driven (\textsc{TbDd}) framework, crafted to counter shard collusion risks and dynamically adjust node allocation, enhancing throughput while maintaining network security. With a comprehensive trust evaluation mechanism, \textsc{TbDd} discerns node types and performs targeted resharding against potential threats. The model maximizes tolerance for dishonest nodes, optimizes node movement frequency, ensures even node distribution in shards, and balances sharding risks. Rigorous evaluations prove \textsc{TbDd}'s superiority over conventional random-, community-, and trust-based sharding methods in shard risk equilibrium and reducing cross-shard transactions.

preprint2024arXiv

Towards Auto-Modeling of Formal Verification for NextG Protocols: A Multimodal cross- and self-attention Large Language Model Approach

This paper introduces Auto-modeling of Formal Verification with Real-world Prompting for 5G and NextG protocols (AVRE), a novel system designed for the formal verification of Next Generation (NextG) communication protocols, addressing the increasing complexity and scalability challenges in network protocol design and verification. Utilizing Large Language Models (LLMs), AVRE transforms protocol descriptions into dependency graphs and formal models, efficiently resolving ambiguities and capturing design intent. The system integrates a transformer model with LLMs to autonomously establish quantifiable dependency relationships through cross- and self-attention mechanisms. Enhanced by iterative feedback from the HyFuzz experimental platform, AVRE significantly advances the accuracy and relevance of formal verification in complex communication protocols, offering a groundbreaking approach to validating sophisticated communication systems. We compare CAL's performance with state-of-the-art LLM-based models and traditional time sequence models, demonstrating its superiority in accuracy and robustness, achieving an accuracy of 95.94\% and an AUC of 0.98. This NLP-based approach enables, for the first time, the creation of exploits directly from design documents, making remarkable progress in scalable system verification and validation.

preprint2022arXiv

A Mikhlin--Hörmander multiplier theorem for the partial harmonic oscillator

We prove a Mikhlin--Hörmander multiplier theorem for the partial harmonic oscillator $H_{\textup{par}}=-\pa_ρ^2-Δ_x+|x|^2$ for $(ρ, x)\in\R\times\R^d$ by using the Littlewood--Paley $g$ and $g^\ast$ functions and the associated heat kernel estimate. The multiplier we have investigated is defined on $\mathbb R \times \mathbb N$.

preprint2022arXiv

ACDNet: Adaptively Combined Dilated Convolution for Monocular Panorama Depth Estimation

Depth estimation is a crucial step for 3D reconstruction with panorama images in recent years. Panorama images maintain the complete spatial information but introduce distortion with equirectangular projection. In this paper, we propose an ACDNet based on the adaptively combined dilated convolution to predict the dense depth map for a monocular panoramic image. Specifically, we combine the convolution kernels with different dilations to extend the receptive field in the equirectangular projection. Meanwhile, we introduce an adaptive channel-wise fusion module to summarize the feature maps and get diverse attention areas in the receptive field along the channels. Due to the utilization of channel-wise attention in constructing the adaptive channel-wise fusion module, the network can capture and leverage the cross-channel contextual information efficiently. Finally, we conduct depth estimation experiments on three datasets (both virtual and real-world) and the experimental results demonstrate that our proposed ACDNet substantially outperforms the current state-of-the-art (SOTA) methods. Our codes and model parameters are accessed in https://github.com/zcq15/ACDNet.

preprint2022arXiv

Aper: Evolution-Aware Runtime Permission Misuse Detection for Android Apps

The Android platform introduces the runtime permission model in version 6.0. The new model greatly improves data privacy and user experience, but brings new challenges for app developers. First, it allows users to freely revoke granted permissions. Hence, developers cannot assume that the permissions granted to an app would keep being granted. Instead, they should make their apps carefully check the permission status before invoking dangerous APIs. Second, the permission specification keeps evolving, bringing new types of compatibility issues into the ecosystem. To understand the impact of the challenges, we conducted an empirical study on 13,352 popular Google Play apps. We found that 86.0% apps used dangerous APIs asynchronously after permission management and 61.2% apps used evolving dangerous APIs. If an app does not properly handle permission revocations or platform differences, unexpected runtime issues may happen and even cause app crashes. We call such Android Runtime Permission issues as ARP bugs. Unfortunately, existing runtime permission issue detection tools cannot effectively deal with the ARP bugs induced by asynchronous permission management and permission specification evolution. To fill the gap, we designed a static analyzer, Aper, that performs reaching definition and dominator analysis on Android apps to detect the two types of ARP bugs. To compare Aper with existing tools, we built a benchmark, ARPfix, from 60 real ARP bugs. Our experiment results show that Aper significantly outperforms two academic tools, ARPDroid and RevDroid, and an industrial tool, Lint, on ARPfix, with an average improvement of 46.3% on F1-score. In addition, Aper successfully found 34 ARP bugs in 214 opensource Android apps, most of which can result in abnormal app behaviors (such as app crashes) according to our manual validation.

preprint2022arXiv

Computation over Tensor Stiefel Manifold: A Preliminary Study

Let $*$ denote the t-product between two third-order tensors. The purpose of this work is to study fundamental computation over the set $St(n,p,l):= \{\mathcal Q\in \mathbb R^{n\times p\times l} \mid \mathcal Q^{\top}* \mathcal Q = \mathcal I \}$, where $\mathcal Q$ is a third-order tensor of size $n\times p \times l$ and $\mathcal I$ ($n\geq p$) is the identity tensor. It is first verified that $St(n,p,l)$ endowed with the usual Frobenius norm forms a Riemannian manifold, which is termed as the (third-order) \emph{tensor Stiefel manifold} in this work. We then derive the tangent space, Riemannian gradient, and Riemannian Hessian on $St(n,p,l)$. In addition, formulas of various retractions based on t-QR, t-polar decomposition, Cayley transform, and t-exponential, as well as vector transports, are presented. It is expected that analogous to their matrix counterparts, the formulas derived in this study may serve as building blocks for analyzing optimization problems over the tensor Stiefel manifold and designing Riemannian algorithms for them.

preprint2022arXiv

DS-MVSNet: Unsupervised Multi-view Stereo via Depth Synthesis

In recent years, supervised or unsupervised learning-based MVS methods achieved excellent performance compared with traditional methods. However, these methods only use the probability volume computed by cost volume regularization to predict reference depths and this manner cannot mine enough information from the probability volume. Furthermore, the unsupervised methods usually try to use two-step or additional inputs for training which make the procedure more complicated. In this paper, we propose the DS-MVSNet, an end-to-end unsupervised MVS structure with the source depths synthesis. To mine the information in probability volume, we creatively synthesize the source depths by splattering the probability volume and depth hypotheses to source views. Meanwhile, we propose the adaptive Gaussian sampling and improved adaptive bins sampling approach that improve the depths hypotheses accuracy. On the other hand, we utilize the source depths to render the reference images and propose depth consistency loss and depth smoothness loss. These can provide additional guidance according to photometric and geometric consistency in different views without additional inputs. Finally, we conduct a series of experiments on the DTU dataset and Tanks & Temples dataset that demonstrate the efficiency and robustness of our DS-MVSNet compared with the state-of-the-art methods.

preprint2022arXiv

Dual-Flattening Transformers through Decomposed Row and Column Queries for Semantic Segmentation

It is critical to obtain high resolution features with long range dependency for dense prediction tasks such as semantic segmentation. To generate high-resolution output of size $H\times W$ from a low-resolution feature map of size $h\times w$ ($hw\ll HW$), a naive dense transformer incurs an intractable complexity of $\mathcal{O}(hwHW)$, limiting its application on high-resolution dense prediction. We propose a Dual-Flattening Transformer (DFlatFormer) to enable high-resolution output by reducing complexity to $\mathcal{O}(hw(H+W))$ that is multiple orders of magnitude smaller than the naive dense transformer. Decomposed queries are presented to retrieve row and column attentions tractably through separate transformers, and their outputs are combined to form a dense feature map at high resolution. To this end, the input sequence fed from an encoder is row-wise and column-wise flattened to align with decomposed queries by preserving their row and column structures, respectively. Row and column transformers also interact with each other to capture their mutual attentions with the spatial crossings between rows and columns. We also propose to perform attentions through efficient grouping and pooling to further reduce the model complexity. Extensive experiments on ADE20K and Cityscapes datasets demonstrate the superiority of the proposed dual-flattening transformer architecture with higher mIoUs.

preprint2022arXiv

Entangling a Hole Spin with a Time-Bin Photon: A Waveguide Approach for Quantum Dot Sources of Multi-Photon Entanglement

Deterministic sources of multi-photon entanglement are highly attractive for quantum information processing but are challenging to realize experimentally. In this paper, we demonstrate a route towards a scaleable source of time-bin encoded Greenberger-Horne-Zeilinger and linear cluster states from a solid-state quantum dot embedded in a nanophotonic crystal waveguide. By utilizing a self-stabilizing double-pass interferometer, we measure a spin-photon Bell state with $(67.8\pm0.4)\%$ fidelity and devise steps for significant further improvements. By employing strict resonant excitation, we demonstrate a photon indistinguishability of $(95.7\pm0.8)\%$, which is conducive to fusion of multiple cluster states for scaling up the technology and producing more general graph states.

preprint2022arXiv

FKreg: A MATLAB toolbox for fast Multivariate Kernel Regression

Kernel smooth is the most fundamental technique for data density and regression estimation. However, time-consuming is the biggest obstacle for the application that the direct evaluation of kernel smooth for $N$ samples needs ${O}\left( {{N}^{2}} \right)$ operations. People have developed fast smooth algorithms using the idea of binning with FFT. Unfortunately, the accuracy is not controllable, and the implementation for multivariable and its bandwidth selection for the fast method is not available. Hence, we introduce a new MATLAB toolbox for fast multivariate kernel regression with the idea of non-uniform FFT (NUFFT), which implemented the algorithm for $M$ gridding points with ${O}\left( N+M\log M \right)$ complexity and accuracy controllability. The bandwidth selection problem utilizes the Fast Monte-Carlo algorithm to estimate the degree of freedom (DF), saving enormous cross-validation time even better when data share the same grid space for multiple regression. Up to now, this is the first toolbox for fast-binning high-dimensional kernel regression. Moreover, the estimation for local polynomial regression, the conditional variance for the heteroscedastic model, and the complex-valued datasets are also implemented in this toolbox. The performance is demonstrated with simulations and an application on the quantitive EEG.

preprint2022arXiv

Hot-SVD: Higher-Order t-Singular Value Decomposition for Tensors based on Tensor-Tensor Product

This paper considers a way of generalizing the t-SVD of third-order tensors (regarded as tubal matrices) to tensors of arbitrary order N (which can be similarly regarded as tubal tensors of order (N-1)). \color{black}Such a generalization is different from the t-SVD for tensors of order greater than three [Martin, Shafer, Larue, SIAM J. Sci. Comput., 35 (2013), A474--A490]. The decomposition is called Hot-SVD since it can be recognized as a tensor-tensor product version of HOSVD. The existence of Hot-SVD is proved. To this end, a new transpose for third-order tensors is introduced. This transpose is crucial in the verification of Hot-SVD, since it serves as a bridge between tubal tensors and their unfoldings. We establish some properties of Hot-SVD, analogous to those of HOSVD, and in doing so we emphasize the perspective of tubal tensors. The truncated and sequentially truncated Hot-SVD are then introduced, whose error bounds are $\sqrt{N}$ for an $(N+1)$-th order tensor. We provide numerical examples to validate Hot-SVD, truncated Hot-SVD, and sequentially truncated Hot-SVD.

preprint2022arXiv

HoVer-Trans: Anatomy-aware HoVer-Transformer for ROI-free Breast Cancer Diagnosis in Ultrasound Images

Ultrasonography is an important routine examination for breast cancer diagnosis, due to its non-invasive, radiation-free and low-cost properties. However, the diagnostic accuracy of breast cancer is still limited due to its inherent limitations. It would be a tremendous success if we can precisely diagnose breast cancer by breast ultrasound images (BUS). Many learning-based computer-aided diagnostic methods have been proposed to achieve breast cancer diagnosis/lesion classification. However, most of them require a pre-define ROI and then classify the lesion inside the ROI. Conventional classification backbones, such as VGG16 and ResNet50, can achieve promising classification results with no ROI requirement. But these models lack interpretability, thus restricting their use in clinical practice. In this study, we propose a novel ROI-free model for breast cancer diagnosis in ultrasound images with interpretable feature representations. We leverage the anatomical prior knowledge that malignant and benign tumors have different spatial relationships between different tissue layers, and propose a HoVer-Transformer to formulate this prior knowledge. The proposed HoVer-Trans block extracts the inter- and intra-layer spatial information horizontally and vertically. We conduct and release an open dataset GDPH&SYSUCC for breast cancer diagnosis in BUS. The proposed model is evaluated in three datasets by comparing with four CNN-based models and two vision transformer models via five-fold cross validation. It achieves state-of-the-art classification performance with the best model interpretability. In the meanwhile, our proposed model outperforms two senior sonographers on the breast cancer diagnosis when only one BUS image is given.

preprint2022arXiv

Inverted Semantic-Index for Image Retrieval

This paper addresses the construction of inverted index for large-scale image retrieval. The inverted index proposed by J. Sivic brings a significant acceleration by reducing distance computations with only a small fraction of the database. The state-of-the-art inverted indices aim to build finer partitions that produce a concise and accurate candidate list. However, partitioning in these frameworks is generally achieved by unsupervised clustering methods which ignore the semantic information of images. In this paper, we replace the clustering method with image classification, during the construction of codebook. We then propose a merging and splitting method to solve the problem that the number of partitions is unchangeable in the inverted semantic-index. Next, we combine our semantic-index with the product quantization (PQ) so as to alleviate the accuracy loss caused by PQ compression. Finally, we evaluate our model on large-scale image retrieval benchmarks. Experiment results demonstrate that our model can significantly improve the retrieval accuracy by generating high-quality candidate lists.

preprint2022arXiv

Measurement of $Λ$ baryon polarization in $e^+e^-\rightarrowΛ\barΛ$ at $\sqrt{s} = 3.773$ GeV

Using a data sample of $ψ(3770)$ events collected with the BESIII detector at BEPCII corresponding to an integrated luminosity of 2.9 fb$^{-1}$, we report a measurement of $Λ$ spin polarization in $e^+e^-\rightarrowΛ\barΛ$ at $\sqrt{s} = 3.773$ GeV. The significance of polarization is found to be 2$σ$ including the systematic uncertainty, which implies a zero phase between the transition amplitudes of the $Λ\barΛ$ helicity states. This phase can be interpreted in terms of psionic form factors, and is determined to be $ΔΦ^Ψ$ = $Φ^Ψ_{E} - Φ^Ψ_{M}$ = $(71^{+66}_{-46}$ $\pm$ 5)$^{\circ}$. Similarly, the ratio between the form factors is found to be $R^ψ$ = $|G^Ψ_{E}/G^Ψ_{M}|$ = $0.48^{+0.12}_{-0.07}$ $\pm$ 0.04. The first uncertainties are statistical and the second systematic.

preprint2022arXiv

Measurement of the branching fraction for $ψ(3686)\to ωK^0_SK^0_S$

Analyzing $(448.1\pm2.9)\times10^6$ $ψ(3686)$ events collected with the BESIII detector at the BEPCII collider, the $ψ(3686)\to ωK_{S}^{0}K_{S}^{0}$ decay is observed for the first time. The branching fraction for this decay is determined to be $\mathcal{B}_{ψ(3686)\to ωK_{S}^{0}K^{0}_{S}}$=$(7.04\pm0.39\pm0.36)$$\times10^{-5}$, where the first uncertainty is statistical and the second is systematic.

preprint2022arXiv

Measurement of the Cross Section for $e^{+}e^{-}\to$ hadrons at Energies from 2.2324 to 3.6710 GeV

Based on electron-positron collision data collected with the BESIII detector operating at the Beijing Electron Positron Collider II storage rings, the value of $R\equivσ(e^{+}e^{-}\to$hadrons)/$σ(e^{+}e^{-}\toμ^{+}μ^{-})$ is measured at 14 center-of-mass energies from 2.2324 to 3.6710 GeV. The resulting uncertainties are less than $3.0\%$, and are dominated by systematic uncertainties.

preprint2022arXiv

Observation of the electromagnetic Dalitz decay $D^{\ast 0}\to D^{0}e^{+}e^{-}$

Based on 3.19 fb$^{-1}$ of $e^+e^-$ collision data accumulated at the center-of-mass energy 4.178 GeV with the BESIII detector operating at the BEPCII collider, the electromagnetic Dalitz decay $D^{\ast 0}\to D^{0}e^{+}e^{-}$ is observed for the first time with a statistical significance of $13.2σ$. The ratio of the branching fraction of $D^{\ast 0}\to D^{0}e^{+}e^{-}$ to that of $D^{\ast 0}\to D^{0} γ$ is measured to be $(11.08\pm0.76\pm0.49)\times 10^{-3}$. By using the world average value of the branching fraction of $D^{\ast 0}\to D^{0} γ$, the branching fraction of $D^{\ast 0}\to D^{0}e^{+}e^{-}$ is determined to be $(3.91\pm0.27\pm0.17\pm0.10)\times 10^{-3}$, where the first uncertainty is statistical, the second systematic and the third external branching fractions.

preprint2022arXiv

Observation of the Singly Cabibbo-Suppressed Decay $Λ_{c}^{+} \to nπ^{+}$

The singly Cabibbo-suppressed decay $Λ_{c}^{+} \to nπ^{+}$ is observed for the first time with a statistical significance of $7.3σ$ by using 3.9 $\mathrm{fb}^{-1}$ of $e^{+}e^{-}$ collision data collected at center-of-mass energies between 4.612 and 4.699 GeV with the BESIII detector at BEPCII. The branching fraction of $Λ_{c}^{+} \to nπ^{+}$ is measured to be $(6.6\pm1.2_{\rm stat}\pm0.4_{\rm syst})\times 10^{-4}$. By taking the upper limit of branching fractions of $Λ_{c}^{+} \to pπ^0$ from the Belle experiment, the ratio of branching fractions between $Λ_{c}^{+} \to nπ^{+}$ and $Λ_{c}^{+} \to pπ^0$ is calculated to be larger than 7.2 at the 90% confidence level, which disagrees with the current predictions of available phenomenological models. In addition, the branching fractions of the Cabibbo-favored decays $Λ_{c}^{+} \to Λπ^{+}$ and $Λ_{c}^{+} \to Σ^{0}π^{+}$ are measured to be $(1.31\pm0.08_{\rm stat}\pm0.05_{\rm syst})\times 10^{-2}$ and $(1.22\pm0.08_{\rm stat}\pm0.07_{\rm syst})\times 10^{-2}$, respectively, which are consistent with previous results.

preprint2022arXiv

On fractional harmonic functions

Our concern in this paper is to study the qualitative properties for harmonic functions related to the fractional Laplacian. Firstly we classify the polynomials in the whole space and in the half space for the fractional Laplacian defined in a principle value sense at infinity. Secondly, we study the fractional harmonic functions in half space with singularities on the boundary and the related distributional identities.

preprint2022arXiv

On-demand source of dual-rail photon pairs based on chiral interaction in a nanophotonic waveguide

Entanglement is the fuel of advanced quantum technology. It is for instance consumed in measurement-based quantum computing and allows loss-tolerant encoding of quantum information. In photonics, entanglement has traditionally been generated probabilistically, requiring massive multiplexing for scaling up to many photons. An alternative approach utilizes quantum emitters in nanophotonic devices for deterministic generation of single photons, which an be extended to two- and multi-photon generation on demand. The proposed polarization-entanglement sources are, however, incompatible with spatial dual-rail qubit encoding, which is preferred in photonic quantum computing realized in scalable integrated photonic circuits. Here we propose and experimentally realize an on-demand source of dual-rail photon pairs using a quantum dot in a planar nanophotonic waveguide. The source exploits the cascaded decay of a biexciton state and chiral light-matter coupling to achieve deterministic generation of spatial dual-rail Bell pairs with the amount of entanglement determined by the chirality. The operational principle can readily be extended to multi-photon entanglement generation, and such sources may be interfaced with advanced photonic-integrated circuits, e.g., for efficient preparation of entanglement resource states for photonic quantum computing.

preprint2022arXiv

Partial wave analysis of $J/ψ\to γη^{\prime} η^{\prime}$

Using a sample of $(10.09~\pm~0.04)\times10^{9} ~J/ψ$ events collected with the BESIII detector, a partial wave analysis of $J/ψ\toγη^{\prime}η^{\prime}$ is performed. The masses and widths of the observed resonances and their branching fractions are reported. The main contribution is from $J/ψ\rightarrowγf_0(2020)$ with $f_0(2020)\rightarrowη^{\prime}η^{\prime}$, which is found with a significance of greater than 25$σ$. The product branching fraction ${\cal B}\left(J/ψ\rightarrowγf_0(2020)\right)\cdot{\cal B}\left(f_0(2020)\rightarrowη^{\prime}η^{\prime}\right)$ is measured to be $(2.63\pm0.06({\rm stat.})^{+0.31}_{-0.46}({\rm syst.}))\times10^{-4}$.

preprint2022arXiv

Predicting Axillary Lymph Node Metastasis in Early Breast Cancer Using Deep Learning on Primary Tumor Biopsy Slides

Objectives: To develop and validate a deep learning (DL)-based primary tumor biopsy signature for predicting axillary lymph node (ALN) metastasis preoperatively in early breast cancer (EBC) patients with clinically negative ALN. Methods: A total of 1,058 EBC patients with pathologically confirmed ALN status were enrolled from May 2010 to August 2020. A DL core-needle biopsy (DL-CNB) model was built on the attention-based multiple instance-learning (AMIL) framework to predict ALN status utilizing the DL features, which were extracted from the cancer areas of digitized whole-slide images (WSIs) of breast CNB specimens annotated by two pathologists. Accuracy, sensitivity, specificity, receiver operating characteristic (ROC) curves, and areas under the ROC curve (AUCs) were analyzed to evaluate our model. Results: The best-performing DL-CNB model with VGG16_BN as the feature extractor achieved an AUC of 0.816 (95% confidence interval (CI): 0.758, 0.865) in predicting positive ALN metastasis in the independent test cohort. Furthermore, our model incorporating the clinical data, which was called DL-CNB+C, yielded the best accuracy of 0.831 (95%CI: 0.775, 0.878), especially for patients younger than 50 years (AUC: 0.918, 95%CI: 0.825, 0.971). The interpretation of DL-CNB model showed that the top signatures most predictive of ALN metastasis were characterized by the nucleus features including density ($p$ = 0.015), circumference ($p$ = 0.009), circularity ($p$ = 0.010), and orientation ($p$ = 0.012). Conclusion: Our study provides a novel DL-based biomarker on primary tumor CNB slides to predict the metastatic status of ALN preoperatively for patients with EBC. The codes and dataset are available at https://github.com/bupt-ai-cz/BALNMP

preprint2022arXiv

Quantum phase transition in magnetic nanographenes on a lead superconductor

Quantum spins, referred to the spin operator preserved by full SU(2) symmetry in the absence of the magnetic anistropy, have been proposed to host exotic interactions with superconductivity4. However, spin orbit coupling and crystal field splitting normally cause a significant magnetic anisotropy for d/f-shell spins on surfaces6,9, breaking SU(2) symmetry and fabricating the spins with Ising properties10. Recently, magnetic nanographenes have been proven to host intrinsic quantum magnetism due to their negligible spin orbital coupling and crystal field splitting. Here, we fabricate three atomically precise nanographenes with the same magnetic ground state of spin S=1/2 on Pb(111) through engineering sublattice imbalance in graphene honeycomb lattice. Scanning tunneling spectroscopy reveals the coexistence of magnetic bound states and Kondo screening in such hybridized system. Through engineering the magnetic exchange strength between the unpaired spin in nanographenes and cooper pairs, quantum phase transition from the singlet to the doublet state has been observed, in consistent with quantum models of spins on superconductors. Our work demonstrates delocalized graphene magnetism host highly tunable magnetic bound states with cooper pairs, which can be further developed to study the Majorana bound states and other rich quantum physics of low-dimensional quantum spins on superconductors.

preprint2022arXiv

Real-Time Robust Video Object Detection System Against Physical-World Adversarial Attacks

DNN-based video object detection (VOD) powers autonomous driving and video surveillance industries with rising importance and promising opportunities. However, adversarial patch attack yields huge concern in live vision tasks because of its practicality, feasibility, and powerful attack effectiveness. This work proposes Themis, a software/hardware system to defend against adversarial patches for real-time robust video object detection. We observe that adversarial patches exhibit extremely localized superficial feature importance in a small region with non-robust predictions, and thus propose the adversarial region detection algorithm for adversarial effect elimination. Themis also proposes a systematic design to efficiently support the algorithm by eliminating redundant computations and memory traffics. Experimental results show that the proposed methodology can effectively recover the system from the adversarial attack with negligible hardware overhead.

preprint2022arXiv

Reconfigurable Intelligent Surface (RIS)-aided Vehicular Networks: Their Protocols, Resource Allocation, and Performance

Reconfigurable intelligent surfaces (RISs) assist in paving the way for the evolution of conventional vehicular networks to autonomous driving. Having said that, the 3rd Generation Partnership Project (3GPP) faces numerous open challenges concerning the RIS-aided vehicle-to-everything (V2X) solutions of the near future. To tackle these challenges and to stimulate future research, this article focuses on the prospective transmission design of RIS-aided V2X communications. In particular, two V2X sidelink modes are enhanced by exploiting RISs and their variants, followed by a customized transmission frame structure that partitions the transmission efforts into different phases. Next, effective channel tracking and resource allocation techniques are developed for attaining a high beamforming gain at low overhead and complexity. Finally, promising research topics are highlighted and future 3GPP standardization items are proposed for RISaided V2X systems.

preprint2022arXiv

Resilience-Motivated Distribution System Restoration Considering Electricity-Water-Gas Interdependency

A major outage in the electricity distribution system may affect the operation of water and natural gas supply systems, leading to an interruption of multiple services to critical customers. Therefore, enhancing resilience of critical infrastructures requires joint efforts of multiple sectors. In this paper, a distribution system service restoration method considering the electricity-water-gas interdependency is proposed. The objective is to provide electricity, water, and natural gas supplies to critical customers in the desired ratio according to their needs after an extreme event. The operational constraints of electricity, water, and natural gas networks are considered. The characteristics of electricity-driven coupling components, including water pumps and gas compressors, are also modeled. Relaxation techniques are applied to nonconvex constraints posed by physical laws of those networks. Consequently, the restoration problem is formulated as a mixed-integer second-order cone program, which can readily be solved by the off-the-shelf solvers. The proposed method is validated by numerical simulations on electricity-water-gas integrated systems, developed based on benchmark models of the subsystems. The results indicate that considering the interdependency refines the allocation of limited generation resources and demonstrate the exactness of the proposed convex relaxation.

preprint2022arXiv

Schwarz boundary value problems for polyanalytic equation in a sector ring

In this article,we first give a modified Schwarz-Pompeiu formula in a general sector ring by proper conformal mappings, and obtain the solution of the Schwarz problem for the Cauchy-Riemann equation in explicit forms. Furthermore, a class of integral operators is introduced together with their properties. Finally, by virtue of these operators, Schwarz problems for a inhomogeneous polyanalytic equation and for a generalized polyanalytic equation are investigated, respectively.

preprint2022arXiv

Search for baryon and lepton number violating decays $D^{0}\to \bar{p}e^{+}$ and $D^{0}\to pe^{-}$

Using an electron-positron collision data sample corresponding to an integrated luminosity of 2.93~fb$^{-1}$ collected with the BESIII detector at a center-of-mass energy of 3.773 GeV, we search for the baryon and lepton number violating decays $D^{0}\to \bar{p}e^{+}$ and $D^{0}\to pe^{-}$. No obvious signals are found with the current statistics. The upper limits on the branching fractions for $D^{0}\to \bar{p}e^{+}$ and $D^{0}\to pe^{-}$ are set to be $1.2\times 10^{-6}$ and $2.2\times 10^{-6}$ at 90\% confidence level, respectively.

preprint2022arXiv

Search for invisible decays of the $Λ$ baryon

A search for invisible decays of the $Λ$ baryon is carried out in the process $J/ψ\toΛ\barΛ$ based on $(1.0087\pm0.0044)\times10^{10}$ $J/ψ$ events collected with the BESIII detector located at the BEPCII storage ring. No signals are found for the invisible decays of $Λ$ baryon, and the upper limit of the branching fraction is determined to be $7.4 \times 10^{-5}$ at the 90% confidence level. This is the first search for invisible decays of baryons; such searches will play an important role in constraining dark sector models related to the baryon asymmetry.

preprint2022arXiv

Search for the decay $D^{0} \to π^{0} ν\barν$

We present the first experimental search for the rare charm decay $D^{0} \to π^{0} ν\barν$. It is based on an $e^+e^-$ collision sample consisting of $10.6\times10^{6}$ pairs of $D^0\bar{D}^0$ mesons collected by the BESIII detector at $\sqrt{s}$=3.773 GeV, corresponding to an integrated luminosity of 2.93~fb$^{-1}$. A data-driven method is used to ensure the reliability of the background modeling. No significant $D^{0} \to π^{0} ν\barν$ signal is observed in data and an upper limit of the branching fraction is set to be $2.1\times 10^{-4}$ at the 90$\%$ confidence level. This is the first experimental constraint on charmed-hadron decays into dineutrino final states.

preprint2022arXiv

Traffic Analytics Development Kits (TADK): Enable Real-Time AI Inference in Networking Apps

Sophisticated traffic analytics, such as the encrypted traffic analytics and unknown malware detection, emphasizes the need for advanced methods to analyze the network traffic. Traditional methods of using fixed patterns, signature matching, and rules to detect known patterns in network traffic are being replaced with AI (Artificial Intelligence) driven algorithms. However, the absence of a high-performance AI networking-specific framework makes deploying real-time AI-based processing within networking workloads impossible. In this paper, we describe the design of Traffic Analytics Development Kits (TADK), an industry-standard framework specific for AI-based networking workloads processing. TADK can provide real-time AI-based networking workload processing in networking equipment from the data center out to the edge without the need for specialized hardware (e.g., GPUs, Neural Processing Unit, and so on). We have deployed TADK in commodity WAF and 5G UPF, and the evaluation result shows that TADK can achieve a throughput up to 35.3Gbps per core on traffic feature extraction, 6.5Gbps per core on traffic classification, and can decrease SQLi/XSS detection down to 4.5us per request with higher accuracy than fixed pattern solution.

preprint2022arXiv

Winograd Convolution: A Perspective from Fault Tolerance

Winograd convolution is originally proposed to reduce the computing overhead by converting multiplication in neural network (NN) with addition via linear transformation. Other than the computing efficiency, we observe its great potential in improving NN fault tolerance and evaluate its fault tolerance comprehensively for the first time. Then, we explore the use of fault tolerance of winograd convolution for either fault-tolerant or energy-efficient NN processing. According to our experiments, winograd convolution can be utilized to reduce fault-tolerant design overhead by 27.49\% or energy consumption by 7.19\% without any accuracy loss compared to that without being aware of the fault tolerance

preprint2021arXiv

Construction of Explicit Symplectic Integrators in General Relativity. I. Schwarzschild Black Holes

Symplectic integrators that preserve the geometric structure of Hamiltonian flows and do not exhibit secular growth in energy errors are suitable for the long-term integration of N-body Hamiltonian systems in the solar system. However, the construction of explicit symplectic integrators is frequently difficult in general relativity because all variables are inseparable. Moreover, even if two analytically integrable splitting parts exist in a relativistic Hamiltonian, all analytical solutions are not explicit functions of proper time. Naturally, implicit symplectic integrators, such as the midpoint rule, are applicable to this case. In general, these integrators are numerically more expensive to solve than same-order explicit symplectic algorithms. To address this issue, we split the Hamiltonian of Schwarzschild spacetime geometry into four integrable parts with analytical solutions as explicit functions of proper time. In this manner, second- and fourth-order explicit symplectic integrators can be easily made available. The new algorithms are also useful for modeling the chaotic motion of charged particles around a black hole with an external magnetic field. They demonstrate excellent long-term performance in maintaining bounded Hamiltonian errors and saving computational cost when appropriate proper time steps are adopted.

preprint2021arXiv

Construction of explicit symplectic integrators in general relativity. II. Reissner-Nordstrom black holes

In a previous paper, second- and fourth-order explicit symplectic integrators were designed for a Hamiltonian of the Schwarzschild black hole. Following this work, we continue to trace the possibility of the construction of explicit symplectic integrators for a Hamiltonian of charged particles moving around a Reissner-Nordstrom black hole with an external magnetic field. Such explicit symplectic methods are still available when the Hamiltonian is separated into five independently integrable parts with analytical solutions as explicit functions of proper time. Numerical tests show that the proposed algorithms share the desirable properties in their long-term stability, precision and efficiency for appropriate choices of step sizes. For the applicability of one of the new algorithms, the effects of the black hole's charge, the Coulomb part of the electromagnetic potential and the magnetic parameter on the dynamical behavior are surveyed. Under some circumstances, the extent of chaos gets strong with an increase of the magnetic parameter from a global phase-space structure. No the variation of the black hole's charge but the variation of the Coulomb part is considerably sensitive to affect the regular and chaotic dynamics of particles' orbits. A positive Coulomb part is easier to induce chaos than a negative one.

preprint2021arXiv

Cross section measurements of the $e^+e^-\to D^{+}D^{-}$ and $e^+e^-\to D^{*+}D^{-}$ processes at center-of-mass energies from 4.085 to 4.600 GeV

The Born cross sections of the $e^+e^-\to D^{*+}D^{*-}$ and $e^+e^-\to D^{*+}D^{-}$ processes are measured using $e^+e^-$ collision data collected with the BESIII experiment at center-of-mass energies from 4.085 to 4.600 GeV, corresponding to an integrated luminosity of $15.7~{\rm fb}^{-1}$. The results are consistent with and more precise than the previous measurements by the Belle, Babar and CLEO collaborations. The measurements are essential for understanding the nature of vector charmonium and charmonium-like states.

preprint2021arXiv

Damage accumulation during high temperature fatigue of Ti/SiC$_f$ metal matrix composites under different stress amplitudes

The damage mechanisms and load redistribution of high strength TC17 titanium alloy/unidirectional SiC fibre composite (fibre diameter = 100 $μ$m) under high temperature (350 °C) fatigue cycling have been investigated in situ using synchrotron X-ray computed tomography (CT) and X-ray diffraction (XRD) for high cycle fatigue (HCF) under different stress amplitudes. The three-dimensional morphology of the crack and fibre fractures has been mapped by CT. During stable growth, matrix cracking dominates with the crack deflecting (by 50-100 $μ$m in height) when bypassing bridging fibres. A small number of bridging fibres have fractured close to the matrix crack plane especially under relatively high stress amplitude cycling. Loading to the peak stress led to rapid crack growth accompanied by a burst of fibre fractures. Many of the fibre fractures occurred 50-300 $μ$m from the matrix crack plane during rapid growth, in contrast to that in the stable growth stage, leading to extensive fibre pull-out on the fracture surface. The changes in fibre loading, interfacial stress, and the extent of fibre-matrix debonding in the vicinity of the crack have been mapped for the fatigue cycle and after the rapid growth by high spatial resolution XRD. The fibre/matrix interfacial sliding extends up to 600 $μ$m (in the stable growth zone) or 700 $μ$m (in the rapid growth zone) either side of the crack plane. The direction of interfacial shear stress reverses with the loading cycle, with the maximum frictional sliding stress reaching ~55 MPa in both the stable growth and rapid growth regimes.

preprint2021arXiv

Delving into Sample Loss Curve to Embrace Noisy and Imbalanced Data

Corrupted labels and class imbalance are commonly encountered in practically collected training data, which easily leads to over-fitting of deep neural networks (DNNs). Existing approaches alleviate these issues by adopting a sample re-weighting strategy, which is to re-weight sample by designing weighting function. However, it is only applicable for training data containing only either one type of data biases. In practice, however, biased samples with corrupted labels and of tailed classes commonly co-exist in training data. How to handle them simultaneously is a key but under-explored problem. In this paper, we find that these two types of biased samples, though have similar transient loss, have distinguishable trend and characteristics in loss curves, which could provide valuable priors for sample weight assignment. Motivated by this, we delve into the loss curves and propose a novel probe-and-allocate training strategy: In the probing stage, we train the network on the whole biased training data without intervention, and record the loss curve of each sample as an additional attribute; In the allocating stage, we feed the resulting attribute to a newly designed curve-perception network, named CurveNet, to learn to identify the bias type of each sample and assign proper weights through meta-learning adaptively. The training speed of meta learning also blocks its application. To solve it, we propose a method named skip layer meta optimization (SLMO) to accelerate training speed by skipping the bottom layers. Extensive synthetic and real experiments well validate the proposed method, which achieves state-of-the-art performance on multiple challenging benchmarks.

preprint2021arXiv

Epitaxial growth and magnetic characterization of EuSe thin films with various crystalline orientations

We report different growth modes and corresponding magnetic properties of thin EuSe films grown by molecular beam epitaxy on BaF2, Pb1-xEuxSe, GaAs, and Bi2Se3 substrates. We show that EuSe growth predominantly in (001) orientation on GaAs(111) and Bi2Se3, but along (111) crystallographic direction on BaF2 (111) and Pb1-xEuxSe (111). High-resolution transmission electron microscopy measurements reveal an abrupt and highly crystalline interface for both (001) and (111) EuSe films. In agreement with previous studies, ordered magnetic phases include antiferromagnetic, ferrimagnetic, and ferromagnetic phases. In contrast to previous studies, we found strong hysteresis for the antiferromagnetic-ferrimagnetic transition. An ability to grow epitaxial films of EuSe on Bi2Se3 and of Bi2Se3 on EuSe enables further investigation of interfacial exchange interactions between various phases of an insulating metamagnetic material and a topological insulator.

preprint2021arXiv

Growth of Outward Propagating Fast-Magnetosonic/Whistler Waves in the Inner Heliosphere Observed by Parker Solar Probe

The solar wind in the inner heliosphere has been observed by Parker Solar Probe (PSP) to exhibit abundant wave activities. The cyclotron wave modes in the sense of ions or electrons are among the most crucial wave components. However, their origin and evolution in the inner heliosphere close to the Sun remain mysteries. Specifically, it remains unknown whether it is an emitted signal from the solar atmosphere or an eigenmode growing locally in the heliosphere due to plasma instability. To address and resolve this controversy, we must investigate the key quantity of the energy change rate of the wave mode. We develop a new technique to measure the energy change rate of plasma waves, and apply this technique to the wave electromagnetic fields measured by PSP. We provide the wave Poynting flux in the solar wind frame, identify the wave nature to be the outward propagating fast-magnetosonic/whistler wave mode instead of the sunward propagating waves. We provide the first evidence for growth of the fast-magnetosonic/whistler wave mode in the inner heliosphere based on the derived spectra of the real and imaginary parts of the wave frequencies. The energy change rate rises and stays at a positive level in the same wavenumber range as the bumps of the electromagnetic field power spectral densities, clearly manifesting that the observed fast-magnetosonic/whistler waves are locally growing to a large amplitude.

preprint2021arXiv

Hero: On the Chaos When PATH Meets Modules

Ever since its first release in 2009, the Go programming language (Golang) has been well received by software communities. A major reason for its success is the powerful support of library-based development, where a Golang project can be conveniently built on top of other projects by referencing them as libraries. As Golang evolves, it recommends the use of a new library-referencing mode to overcome the limitations of the original one. While these two library modes are incompatible, both are supported by the Golang ecosystem. The heterogeneous use of library-referencing modes across Golang projects has caused numerous dependency management (DM) issues, incurring reference inconsistencies and even build failures. Motivated by the problem, we conducted an empirical study to characterize the DM issues, understand their root causes, and examine their fixing solutions. Based on our findings, we developed \textsc{Hero}, an automated technique to detect DM issues and suggest proper fixing solutions. We applied \textsc{Hero} to 19,000 popular Golang projects. The results showed that \textsc{Hero} achieved a high detection rate of 98.5\% on a DM issue benchmark and found 2,422 new DM issues in 2,356 popular Golang projects. We reported 280 issues, among which 181 (64.6\%) issues have been confirmed, and 160 of them (88.4\%) have been fixed or are under fixing. Almost all the fixes have adopted our fixing suggestions.

preprint2021arXiv

MPC-CSAS: Multi-Party Computation for Real-time Privacy-preserving Speed Advisory Systems

As a part of Advanced Driver Assistance Systems (ADASs), Consensus-based Speed Advisory Systems (CSAS) have been proposed to recommend a common speed to a group of vehicles for specific application purposes, such as emission control and energy management. With Vehicle-to-Vehicle (V2V), Vehicle-to-Infrastructure (V2I) technologies and advanced control theories in place, state-of-the-art CSAS can be designed to get an optimal speed in a privacy-preserving and decentralized manner. However, the current method only works for specific cost functions of vehicles, and its execution usually involves many algorithm iterations leading long convergence time. Therefore, the state-of-the-art design method is not applicable to a CSAS design which requires real-time decision making. In this paper, we address the problem by introducing MPC-CSAS, a Multi-Party Computation (MPC) based design approach for privacy-preserving CSAS. Our proposed method is simple to implement and applicable to all types of cost functions of vehicles. Moreover, our simulation results show that the proposed MPC-CSAS can achieve very promising system performance in just one algorithm iteration without using extra infrastructure for a typical CSAS.

preprint2021arXiv

Possible Generation Mechanism for Compressional Alfvénic Spikes as Observed by Parker Solar Probe

The solar wind is found by Parker Solar Probe (PSP) to be abundant with Alfvénic velocity spikes and magnetic field kinks. Temperature enhancement is another remarkable feature associated with the Alfvénic spikes. How the prototype of these coincident phenomena is generated intermittently in the source region becomes a hot topic of wide concerns. Here we propose a new model introducing guide-field discontinuity into the interchange magnetic reconnection between open funnels and closed loops with different magnetic helicities. The modified interchange reconnection model not only can accelerate jet flows from the newly opening closed loop but also excite and launch Alfvénic wave pulses along the newly-reconnected and post-reconnected open flux tubes. We find that the modeling results can reproduce the following observational features: (1) Alfvén disturbance is pulsive in time and asymmetric in space; (2) Alfvénic pulse is compressible with temperature enhancement and density variation inside the pulse. We point out that three physical processes co-happening with Alfvén wave propagation can be responsible for the temperature enhancement: (a) convection of heated jet flow plasmas (decrease in density), (b) propagation of compressed slow-mode waves (increase in density), and (c) conduction of heat flux (weak change in density). We also suggest that the radial nonlinear evolution of the Alfvénic pulses should be taken into account to explain the formation of magnetic switchback geometry.

preprint2021arXiv

VarifocalNet: An IoU-aware Dense Object Detector

Accurately ranking the vast number of candidate detections is crucial for dense object detectors to achieve high performance. Prior work uses the classification score or a combination of classification and predicted localization scores to rank candidates. However, neither option results in a reliable ranking, thus degrading detection performance. In this paper, we propose to learn an Iou-aware Classification Score (IACS) as a joint representation of object presence confidence and localization accuracy. We show that dense object detectors can achieve a more accurate ranking of candidate detections based on the IACS. We design a new loss function, named Varifocal Loss, to train a dense object detector to predict the IACS, and propose a new star-shaped bounding box feature representation for IACS prediction and bounding box refinement. Combining these two new components and a bounding box refinement branch, we build an IoU-aware dense object detector based on the FCOS+ATSS architecture, that we call VarifocalNet or VFNet for short. Extensive experiments on MS COCO show that our VFNet consistently surpasses the strong baseline by $\sim$2.0 AP with different backbones. Our best model VFNet-X-1200 with Res2Net-101-DCN achieves a single-model single-scale AP of 55.1 on COCO test-dev, which is state-of-the-art among various object detectors.Code is available at https://github.com/hyz-xmaster/VarifocalNet .

preprint2020arXiv

A coherent spin-photon interface with waveguide induced cycling transitions

Solid-state quantum dots are promising candidates for efficient light-matter interfaces connecting internal spin degrees of freedom to the states of emitted photons. However, selection rules prevent the combination of efficient spin control and optical cyclicity in this platform. By utilizing a photonic crystal waveguide we here experimentally demonstrate optical cyclicity up to $\approx15$ through photonic state engineering while achieving high fidelity spin initialization and coherent optical spin control. These capabilities pave the way towards scalable multi-photon entanglement generation and on-chip spin-photon gates.

preprint2020arXiv

Accelerating Generative Neural Networks on Unmodified Deep Learning Processors -- A Software Approach

Generative neural network is a new category of neural networks and it has been widely utilized in applications such as content generation, unsupervised learning, segmentation and pose estimation. It typically involves massive computing-intensive deconvolution operations that cannot be fitted to conventional neural network processors directly. However, prior works mainly investigated specialized hardware architectures through intensive hardware modifications to the existing deep learning processors to accelerate deconvolution together with the convolution. In contrast, this work proposes a novel deconvolution implementation with a software approach and enables fast and efficient deconvolution execution on the legacy deep learning processors. Our proposed method reorganizes the computation of deconvolution and allows the deep learning processors to treat it as the standard convolution by splitting the original deconvolution filters into multiple small filters. Compared to prior acceleration schemes, the implemented acceleration scheme achieves 2.41x - 4.34x performance speedup and reduces the energy consumption by 27.7% - 54.5% on a set of realistic benchmarks. In addition, we also applied the deconvolution computing approach to the off-the-shelf commodity deep learning processors. The performance of deconvolution also exhibits significant performance speedup over prior deconvolution implementations.

preprint2020arXiv

An Empirical Study of Usages, Updates and Risks of Third-Party Libraries in Java Projects

Third-party libraries are a central building block to develop software systems. However, outdated third-party libraries are commonly used, and developers are usually less aware of the potential risks. Therefore, a quantitative and holistic study on usages, updates and risks of third-party libraries can provide practical insights to improve the ecosystem sustainably. In this paper, we conduct such a study in the Java ecosystem. Specifically, we conduct a library usage analysis (e.g., usage intensity and outdatedness) and a library update analysis (e.g., update intensity and delay) using 806 open-source projects. The two analyses aim to quantify usage and update practices holistically from the perspective of both open-source projects and third-party libraries. Then, we conduct a library risk analysis (e.g., potential risk and developer response) in terms of bugs with 15 popularly-used third-party libraries. This analysis aims to quantify the potential risk of using outdated libraries and the developer response to the risk. Our findings from the three analyses provide practical insights to developers and researchers on problems and potential solutions in maintaining third-party libraries (e.g., smart alerting and automated updating of outdated libraries). To demonstrate the usefulness of our findings, we propose a bug-driven alerting system for assisting developers to make confident decisions in updating third-party library versions. We have released our dataset to foster valuable applications and improve the ecosystem.

preprint2020arXiv

Automatic Speech Summarisation: A Scoping Review

Speech summarisation techniques take human speech as input and then output an abridged version as text or speech. Speech summarisation has applications in many domains from information technology to health care, for example improving speech archives or reducing clinical documentation burden. This scoping review maps the speech summarisation literature, with no restrictions on time frame, language summarised, research method, or paper type. We reviewed a total of 110 papers out of a set of 153 found through a literature search and extracted speech features used, methods, scope, and training corpora. Most studies employ one of four speech summarisation architectures: (1) Sentence extraction and compaction; (2) Feature extraction and classification or rank-based sentence selection; (3) Sentence compression and compression summarisation; and (4) Language modelling. We also discuss the strengths and weaknesses of these different methods and speech features. Overall, supervised methods (e.g. Hidden Markov support vector machines, Ranking support vector machines, Conditional random fields) performed better than unsupervised methods. As supervised methods require manually annotated training data which can be costly, there was more interest in unsupervised methods. Recent research into unsupervised methods focusses on extending language modelling, for example by combining Uni-gram modelling with deep neural networks. Protocol registration: The protocol for this scoping review is registered at https://osf.io.

preprint2020arXiv

Berry curvature memory through electrically driven stacking transitions

In two-dimensional layered quantum materials, the stacking order of the layers determines both the crystalline symmetry and electronic properties such as the Berry curvature, topology and electron correlation. Electrical stimuli can influence quasiparticle interactions and the free-energy landscape, making it possible to dynamically modify the stacking order and reveal hidden structures that host different quantum properties. Here we demonstrate electrically driven stacking transitions that can be applied to design nonvolatile memory based on Berry curvature in few-layer WTe$_2$. The interplay of out-of-plane electric fields and electrostatic doping controls in-plane interlayer sliding and creates multiple polar and centrosymmetric stacking orders. In situ nonlinear Hall transport reveals such stacking rearrangements result in a layer-parity-selective Berry curvature memory in momentum space, where the sign reversal of the Berry curvature and its dipole only occurs in odd-layer crystals. Our findings open an avenue towards exploring coupling between topology, electron correlations, and ferroelectricity in hidden stacking orders and demonstrate a new low-energy-cost, electrically controlled topological memory in the atomically thin limit.

preprint2020arXiv

Combining GHOST and Casper

We present "Gasper," a proof-of-stake-based consensus protocol, which is an idealized version of the proposed Ethereum 2.0 beacon chain. The protocol combines Casper FFG, a finality tool, with LMD GHOST, a fork-choice rule. We prove safety, plausible liveness, and probabilistic liveness under different sets of assumptions.

preprint2020arXiv

Contribution of Magnetic Reconnection Events to Energy Dissipation in Magnetosheath Turbulence

By analyzing the magnetosheath measurements from MMS, we obtain the statistical results for the contribution of magnetic reconnection (MR) events at electron scales to the energy dissipation of coherent structures. The Partial Variance of Increments (PVI) method is employed to find coherent structures in the magnetic field data. The current sheet structures with reversal of magnetic field components are further selected. We consider the following criteria to identify the MR events, such as current sheet with magnetic field reversal, significant energy dissipation, and evident electron outflow velocity. Statistically, for most MR events, their PVI values are larger than that of other types of coherent structures, and their energy dissipations are also stronger than that of others. However, due to the relatively small proportion of MR events, their contribution to coherent structures' energy dissipation is relatively trivial. If taken into account the dissipation of non-coherent structures, the MR's contribution to energy dissipation would be less. Hence, we suggest that MR events, though have strong dissipation locally, are not the major contributor to the energy dissipation in the magnetosheath. After analyzing the features of non-MR current sheets, we propose that non-MR current sheets are mainly coherent structures inherent to kinetic Alfvén fluctuations.

preprint2020arXiv

Interactive, Effort-Aware Library Version Harmonization

As a mixed result of intensive dependency on third-party libraries, flexible mechanism to declare dependencies, and increased number of modules in a project, multiple versions of the same third-party library are directly depended in different modules of a project. Such library version inconsistencies can increase dependency maintenance cost, or even lead to dependency conflicts when modules are inter-dependent. Although automated build tools (e.g., Maven's enforcer plugin) provide partial support to detect library version inconsistencies, they do not provide any support to harmonize inconsistent library versions. We first conduct a survey with 131 Java developers from GitHub to retrieve first-hand information about the root causes, detection methods, reasons for fixing or not fixing, fixing strategies, fixing efforts, and tool expectations on library version inconsistencies. Then, based on the insights from our survey, we propose LibHarmo, an interactive, effort-aware library version harmonization technique, to detect library version inconsistencies, interactively suggest a harmonized version with the least harmonization efforts based on library API usage analysis, and refactor build configuration files. LibHarmo is currently developed for Java Maven projects. Our experimental study on 443 highly-starred Java Maven projects from GitHub indicates that i) LibHarmo identifies 621 library version inconsistencies covering 152 (34.3%) of projects, and ii) the average harmonization efforts are that 1 and 12 library API calls are affected, respectively due to the deleted and changed library APIs in the harmonized version. 5 library version inconsistencies have been confirmed, and 1 of them has been already harmonized by developers.

preprint2020arXiv

LiDAR Iris for Loop-Closure Detection

In this paper, a global descriptor for a LiDAR point cloud, called LiDAR Iris, is proposed for fast and accurate loop-closure detection. A binary signature image can be obtained for each point cloud after several LoG-Gabor filtering and thresholding operations on the LiDAR-Iris image representation. Given two point clouds, their similarities can be calculated as the Hamming distance of two corresponding binary signature images extracted from the two point clouds, respectively. Our LiDAR-Iris method can achieve a pose-invariant loop-closure detection at a descriptor level with the Fourier transform of the LiDAR-Iris representation if assuming a 3D (x,y,yaw) pose space, although our method can generally be applied to a 6D pose space by re-aligning point clouds with an additional IMU sensor. Experimental results on five road-scene sequences demonstrate its excellent performance in loop-closure detection.

preprint2020arXiv

Multi-level colonoscopy malignant tissue detection with adversarial CAC-UNet

The automatic and objective medical diagnostic model can be valuable to achieve early cancer detection, and thus reducing the mortality rate. In this paper, we propose a highly efficient multi-level malignant tissue detection through the designed adversarial CAC-UNet. A patch-level model with a pre-prediction strategy and a malignancy area guided label smoothing is adopted to remove the negative WSIs, with which to lower the risk of false positive detection. For the selected key patches by multi-model ensemble, an adversarial context-aware and appearance consistency UNet (CAC-UNet) is designed to achieve robust segmentation. In CAC-UNet, mirror designed discriminators are able to seamlessly fuse the whole feature maps of the skillfully designed powerful backbone network without any information loss. Besides, a mask prior is further added to guide the accurate segmentation mask prediction through an extra mask-domain discriminator. The proposed scheme achieves the best results in MICCAI DigestPath2019 challenge on colonoscopy tissue segmentation and classification task. The full implementation details and the trained models are available at https://github.com/Raykoooo/CAC-UNet.

preprint2020arXiv

Near Transform-limited Quantum Dot Linewidths in a Broadband Photonic Crystal Waveguide

Planar nanophotonic structures enable broadband, near-unity coupling of emission from quantum dots embedded within, thereby realizing ideal singe-photon sources. The efficiency and coherence of the single-photon source is limited by charge noise, which results in the broadening of the emission spectrum.We report suppression of the noise by fabricating photonic crystal waveguides in a gallium arsenide membrane containing quantum dots embedded in a $p$-$i$-$n$ diode. Local electrical contacts in the vicinity of the waveguides minimize the leakage current and allow fast electrical control ($\approx$4 MHz bandwidth) of the quantum dot resonances. Resonant linewidth measurements of $79$ quantum dots coupled to the photonic crystal waveguides exhibit near transform-limited emission over a 6 nm wide range of emission wavelengths. Importantly, the local electrical contacts allow independent tuning of multiple quantum dots on the same chip, which together with the transform-limited emission are key components in realizing multiemitter-based quantum information processing.

preprint2020arXiv

On the Radiality Constraints for Distribution System Restoration and Reconfiguration Problems

Radiality constraints are involved in both distribution system restoration and reconfiguration problems. However, a set of widely used radiality constraints, i.e., the spanning tree (ST) constraints, has its limitations which have not been well recognized. In this letter, the limitation of the ST constraints is analyzed and an effective set of constraints, referred to as the single-commodity flow constraints, is presented. Furthermore, a combined set of constraints is proposed and case studies indicate that the combined constraints can gain computational efficiency in the reconfiguration problem. Recommendations on the use of radiality constraints are also provided.

preprint2020arXiv

On-chip deterministic operation of quantum dots in dual-mode waveguides for a plug-and-play single-photon source

A deterministic source of coherent single photons is an enabling device of quantum-information processing for quantum simulators, and ultimately a full-fledged quantum internet. Quantum dots (QDs) in nanophotonic structures have been employed as excellent sources of single photons, and planar waveguides are well suited for scaling up to multiple photons and emitters exploring near-unity photon-emitter coupling and advanced active on-chip functionalities. An ideal single-photon source requires suppressing noise and decoherence, which notably has been demonstrated in electrically-contacted heterostructures. It remains a challenge to implement deterministic resonant excitation of the QD required for generating coherent single photons, since residual light from the excitation laser should be suppressed without compromising source efficiency and scalability. Here, we present the design and realization of a novel planar nanophotonic device that enables deterministic pulsed resonant excitation of QDs through the waveguide. Through nanostructure engineering, the excitation light and collected photons are guided in two orthogonal waveguide modes enabling deterministic operation. We demonstrate a coherent single-photon source that simultaneously achieves high-purity ($g^{(2)}(0)$ = 0.020 $\pm$ 0.005), high-indistinguishability ($V$ = 96 $\pm$ 2 %), and $>$80 % coupling efficiency into the waveguide. The novel `plug-and-play' coherent single-photon source could be operated unmanned for several days and will find immediate applications, e.g., for constructing heralded multi-photon entanglement sources for photonic quantum computing or sensing.

preprint2020arXiv

VC-Net: Deep Volume-Composition Networks for Segmentation and Visualization of Highly Sparse and Noisy Image Data

The motivation of our work is to present a new visualization-guided computing paradigm to combine direct 3D volume processing and volume rendered clues for effective 3D exploration such as extracting and visualizing microstructures in-vivo. However, it is still challenging to extract and visualize high fidelity 3D vessel structure due to its high sparseness, noisiness, and complex topology variations. In this paper, we present an end-to-end deep learning method, VC-Net, for robust extraction of 3D microvasculature through embedding the image composition, generated by maximum intensity projection (MIP), into 3D volume image learning to enhance the performance. The core novelty is to automatically leverage the volume visualization technique (MIP) to enhance the 3D data exploration at deep learning level. The MIP embedding features can enhance the local vessel signal and are adaptive to the geometric variability and scalability of vessels, which is crucial in microvascular tracking. A multi-stream convolutional neural network is proposed to learn the 3D volume and 2D MIP features respectively and then explore their inter-dependencies in a joint volume-composition embedding space by unprojecting the MIP features into 3D volume embedding space. The proposed framework can better capture small / micro vessels and improve vessel connectivity. To our knowledge, this is the first deep learning framework to construct a joint convolutional embedding space, where the computed vessel probabilities from volume rendering based 2D projection and 3D volume can be explored and integrated synergistically. Experimental results are compared with the traditional 3D vessel segmentation methods and the deep learning state-of-the-art on public and real patient (micro-)cerebrovascular image datasets. Our method demonstrates the potential in a powerful MR arteriogram and venogram diagnosis of vascular diseases.

preprint2020arXiv

Will Dependency Conflicts Affect My Program's Semantics?

Java projects are often built on top of various third-party libraries. If multiple versions of a library exist on the classpath, JVM will only load one version and shadow the others, which we refer to as dependency conflicts. This would give rise to semantic conflict (SC) issues, if the library APIs referenced by a project have identical method signatures but inconsistent semantics across the loaded and shadowed versions of libraries. SC issues are difficult for developers to diagnose in practice, since understanding them typically requires domain knowledge. Although adapting the existing test generation technique for dependency conflict issues, Riddle, to detect SC issues is feasible, its effectiveness is greatly compromised. This is mainly because Riddle randomly generates test inputs, while the SC issues typically require specific arguments in the tests to be exposed. To address that, we conducted an empirical study of 75 real SC issues to understand the characteristics of such specific arguments in the test cases that can capture the SC issues. Inspired by our empirical findings, we propose an automated testing technique Sensor, which synthesizes test cases using ingredients from the project under test to trigger inconsistent behaviors of the APIs with the same signatures in conflicting library versions. Our evaluation results show that \textsc{Sensor} is effective and useful: it achieved a $Precision$ of 0.803 and a $Recall$ of 0.760 on open-source projects and a $Precision$ of 0.821 on industrial projects; it detected 150 semantic conflict issues in 29 projects, 81.8\% of which had been confirmed as real bugs.

preprint2020arXiv

You Only Search Once: A Fast Automation Framework for Single-Stage DNN/Accelerator Co-design

DNN/Accelerator co-design has shown great potential in improving QoR and performance. Typical approaches separate the design flow into two-stage: (1) designing an application-specific DNN model with high accuracy; (2) building an accelerator considering the DNN specific characteristics. However, it may fail in promising the highest composite score which combines the goals of accuracy and other hardware-related constraints (e.g., latency, energy efficiency) when building a specific neural-network-based system. In this work, we present a single-stage automated framework, YOSO, aiming to generate the optimal solution of software-and-hardware that flexibly balances between the goal of accuracy, power, and QoS. Compared with the two-stage method on the baseline systolic array accelerator and Cifar10 dataset, we achieve 1.42x~2.29x energy or 1.79x~3.07x latency reduction at the same level of precision, for different user-specified energy and latency optimization constraints, respectively.

preprint2019arXiv

Observation of Rydberg exciton polaritons and their condensate in a perovskite cavity

The condensation of half-light half-matter exciton polaritons in semiconductor optical cavities is a striking example of macroscopic quantum coherence in a solid state platform. Quantum coherence is possible only when there are strong interactions between the exciton polaritons provided by their excitonic constituents. Rydberg excitons with high principle value exhibit strong dipole-dipole interactions in cold atoms. However, polaritons with the excitonic constituent that is an excited state, namely Rydberg exciton polaritons (REPs), have not yet been experimentally observed. Here, for the first time, we observe the formation of REPs in a single crystal CsPbBr3 perovskite cavity without any external fields. These polaritons exhibit strong nonlinear behavior that leads to a coherent polariton condensate with a prominent blue shift. Furthermore, the REPs in CsPbBr3 are highly anisotropic and have a large extinction ratio, arising from the perovskite's orthorhombic crystal structure. Our observation not only sheds light on the importance of many-body physics in coherent polariton systems involving higher-order excited states, but also paves the way for exploring these coherent interactions for solid state quantum optical information processing.

preprint2019arXiv

Optical needles with arbitrary homogeneous three-dimensional polarization

We propose a new method to generate optical needles by focusing vector beams comprised of radially polarized component and azimuthally polarized vortex components. The radial part can generate longitudinal polarization, while the azimuthal parts can generate left- and right-handed polarization. Hence, an arbitrary 3D polarization can be obtained. To our knoeledge, it may be the first time that arbitrarily polarized optical needles whose transverse sizes are under 0.5$λ$ have been achieved. And their polarized homogeneity is beyond 0.97.

preprint2016arXiv

Joint Source-Channel Decoding of Polar Codes for Language-Based Source

We exploit the redundancy of the language-based source to help polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after every few bits are decoded. This path-pruning technique based on joint decoding has advantages over stand-alone polar list decoding in that most decoding errors in early stages are corrected. In order to facilitate the joint decoding, we first propose a construction of dynamic dictionary using a trie and show an efficient way to trace the dictionary during decoding. Then we propose a joint decoding scheme of polar codes taking into account both information from the channel and the source. The proposed scheme has the same decoding complexity as the list decoding of polar codes. A list-size adaptive joint decoding is further implemented to largely reduce the decoding complexity. We conclude by simulation that the joint decoding schemes outperform stand-alone polar codes with CRC-aided successive cancellation list decoding by over 0.6 dB.

Ying Wang

Quick read

Decide how to stay connected

How to connect with this researcher

Open a focused conversation when the fit is right

See the researcher in context

Building this graph slice

73 published item(s)

A Hybrid Tucker-LSTM Tensor Network Model for SOC Prediction in Electric Vehicles

A System Architecture for Low Latency Multiprogramming Quantum Computing

Compact Latent Manifold Translation: A Parameter-Efficient Foundation Model for Cross-Modal and Cross-Frequency Physiological Signal Synthesis

Cross-View Attention Fusion Net: A Prior-Guided Dual-View Representation Learning for Cardiac Output Estimation from Short-Term PPG Signals

Evolutionary vaccination dynamics under higher-order reinforcement pressure

KernelEvolve: Scaling Agentic Kernel Coding for Heterogeneous AI Accelerators at Meta

Physiological-model-based neural network for modeling the metabolic-heart rate relationship during physical activities

Realtime-VLA FLASH: Speculative Inference Framework for Diffusion-based VLAs

Dual-IRS Aided Near-/Hybrid-Field SWIPT: Passive Beamforming and Independent Antenna Power Splitting Design

SNS Junctions along the BCS-BEC Crossover

Systematic Meets Unintended: Prior Knowledge Adaptive 5G Vulnerability Detection via Multi-Fuzzing

TBDD: A New Trust-based, DRL-driven Framework for Blockchain Sharding in IoT

Towards Auto-Modeling of Formal Verification for NextG Protocols: A Multimodal cross- and self-attention Large Language Model Approach

A Mikhlin--Hörmander multiplier theorem for the partial harmonic oscillator

ACDNet: Adaptively Combined Dilated Convolution for Monocular Panorama Depth Estimation

Aper: Evolution-Aware Runtime Permission Misuse Detection for Android Apps

Computation over Tensor Stiefel Manifold: A Preliminary Study

DS-MVSNet: Unsupervised Multi-view Stereo via Depth Synthesis

Dual-Flattening Transformers through Decomposed Row and Column Queries for Semantic Segmentation

Entangling a Hole Spin with a Time-Bin Photon: A Waveguide Approach for Quantum Dot Sources of Multi-Photon Entanglement

FKreg: A MATLAB toolbox for fast Multivariate Kernel Regression

Hot-SVD: Higher-Order t-Singular Value Decomposition for Tensors based on Tensor-Tensor Product

HoVer-Trans: Anatomy-aware HoVer-Transformer for ROI-free Breast Cancer Diagnosis in Ultrasound Images

Inverted Semantic-Index for Image Retrieval

Measurement of $Λ$ baryon polarization in $e^+e^-\rightarrowΛ\barΛ$ at $\sqrt{s} = 3.773$ GeV

Measurement of the branching fraction for $ψ(3686)\to ωK^0_SK^0_S$

Measurement of the Cross Section for $e^{+}e^{-}\to$ hadrons at Energies from 2.2324 to 3.6710 GeV

Observation of the electromagnetic Dalitz decay $D^{\ast 0}\to D^{0}e^{+}e^{-}$

Observation of the Singly Cabibbo-Suppressed Decay $Λ_{c}^{+} \to nπ^{+}$

On fractional harmonic functions

On-demand source of dual-rail photon pairs based on chiral interaction in a nanophotonic waveguide

Partial wave analysis of $J/ψ\to γη^{\prime} η^{\prime}$

Predicting Axillary Lymph Node Metastasis in Early Breast Cancer Using Deep Learning on Primary Tumor Biopsy Slides

Quantum phase transition in magnetic nanographenes on a lead superconductor

Real-Time Robust Video Object Detection System Against Physical-World Adversarial Attacks

Reconfigurable Intelligent Surface (RIS)-aided Vehicular Networks: Their Protocols, Resource Allocation, and Performance

Resilience-Motivated Distribution System Restoration Considering Electricity-Water-Gas Interdependency

Schwarz boundary value problems for polyanalytic equation in a sector ring

Search for baryon and lepton number violating decays $D^{0}\to \bar{p}e^{+}$ and $D^{0}\to pe^{-}$

Search for invisible decays of the $Λ$ baryon

Search for the decay $D^{0} \to π^{0} ν\barν$

Traffic Analytics Development Kits (TADK): Enable Real-Time AI Inference in Networking Apps

Winograd Convolution: A Perspective from Fault Tolerance

Construction of Explicit Symplectic Integrators in General Relativity. I. Schwarzschild Black Holes

Construction of explicit symplectic integrators in general relativity. II. Reissner-Nordstrom black holes

Cross section measurements of the $e^+e^-\to D^{*+}D^{*-}$ and $e^+e^-\to D^{*+}D^{-}$ processes at center-of-mass energies from 4.085 to 4.600 GeV

Damage accumulation during high temperature fatigue of Ti/SiC$_f$ metal matrix composites under different stress amplitudes

Delving into Sample Loss Curve to Embrace Noisy and Imbalanced Data

Epitaxial growth and magnetic characterization of EuSe thin films with various crystalline orientations

Growth of Outward Propagating Fast-Magnetosonic/Whistler Waves in the Inner Heliosphere Observed by Parker Solar Probe

Hero: On the Chaos When PATH Meets Modules

MPC-CSAS: Multi-Party Computation for Real-time Privacy-preserving Speed Advisory Systems

Possible Generation Mechanism for Compressional Alfvénic Spikes as Observed by Parker Solar Probe

VarifocalNet: An IoU-aware Dense Object Detector

A coherent spin-photon interface with waveguide induced cycling transitions

Accelerating Generative Neural Networks on Unmodified Deep Learning Processors -- A Software Approach

An Empirical Study of Usages, Updates and Risks of Third-Party Libraries in Java Projects

Automatic Speech Summarisation: A Scoping Review

Berry curvature memory through electrically driven stacking transitions

Combining GHOST and Casper

Contribution of Magnetic Reconnection Events to Energy Dissipation in Magnetosheath Turbulence

Interactive, Effort-Aware Library Version Harmonization

LiDAR Iris for Loop-Closure Detection

Multi-level colonoscopy malignant tissue detection with adversarial CAC-UNet

Near Transform-limited Quantum Dot Linewidths in a Broadband Photonic Crystal Waveguide

On the Radiality Constraints for Distribution System Restoration and Reconfiguration Problems

On-chip deterministic operation of quantum dots in dual-mode waveguides for a plug-and-play single-photon source

VC-Net: Deep Volume-Composition Networks for Segmentation and Visualization of Highly Sparse and Noisy Image Data

Will Dependency Conflicts Affect My Program&#39;s Semantics?

You Only Search Once: A Fast Automation Framework for Single-Stage DNN/Accelerator Co-design

Observation of Rydberg exciton polaritons and their condensate in a perovskite cavity

Optical needles with arbitrary homogeneous three-dimensional polarization

Cross section measurements of the $e^+e^-\to D^{+}D^{-}$ and $e^+e^-\to D^{*+}D^{-}$ processes at center-of-mass energies from 4.085 to 4.600 GeV

Will Dependency Conflicts Affect My Program's Semantics?