Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
55works
0followers
45topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

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

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

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.

Published work

55 published item(s)

preprint2026arXiv

UniPCB: A Generation-Assisted Detection Framework for PCB Defect Inspection

In the Industrial Internet of Things (IIoT), enabling intelligent, real-time Printed Circuit Board (PCB) defect inspection is critical for ensuring product reliability. However, existing IIoT-based visual inspection systems face two compounding challenges: scarce and imbalanced defect samples that limit model training, and insufficient feature representation under complex circuit backgrounds. Existing generation methods rely on single-modality conditions with coarse structural control, while detection methods improve architectures without addressing the data bottleneck. To resolve both challenges jointly, we propose a generation-assisted PCB defect inspection framework that integrates controlled defect synthesis with task-specific defect detection within an IIoT-enabled pipeline. On the generation side, a Multi-modal Condition Generator extracts complementary edge, depth, and text conditions in parallel. A ScaleEncoder then embeds these conditions into the diffusion U-Net at four resolutions, and a Condition Modulation applies FiLM-style spatially-adaptive modulation at each scale, enabling structurally aligned and defect-aware sample synthesis to augment the scarce IIoT dataset. On the detection side, an Inverted Residual Shift Attention couples self-attention with shift-wise convolution to jointly capture global context and local texture, and a Cross-level Complementary Fusion Block generates pixel-level gates for selective cross-level feature fusion. The synthesized samples directly enrich the detection training set, so that improvements in generation compound with improvements in detection. Extensive experiments on DsPCBSD+ demonstrate that UniPCB achieves mAP@0.5 of 98.0% and mAP@0.5:0.95 of 61.8% on defect detection, surpassing all compared methods, while the generation branch attains an FID of 129.61 and SSIM of 0.619, outperforming existing conditional generation approaches.

preprint2025arXiv

MobileWorld: Benchmarking Autonomous Mobile Agents in Agent-User Interactive and MCP-Augmented Environments

Among existing online mobile-use benchmarks, AndroidWorld has emerged as the dominant benchmark due to its reproducible environment and deterministic evaluation; however, recent agents achieving over 90% success rates indicate its saturation and motivate the need for a more challenging benchmark. In addition, its environment lacks key application categories, such as e-commerce and enterprise communication, and does not reflect realistic mobile-use scenarios characterized by vague user instructions and hybrid tool usage. We introduce MobileWorld, a substantially more challenging benchmark designed to reflect real-world usage through 201 tasks across 20 applications. MobileWorld derives its difficulty from an emphasis on long-horizon, cross-application workflows, requiring nearly twice as many completion steps on average (27.8 vs. 14.3) and featuring a significantly higher proportion of multi-app tasks (62.2% vs. 9.5%) than AndroidWorld. To overcome the limitations of existing environments, MobileWorld achieves a balance between production-grade utility and reproducible evaluation by utilizing open-source alternatives to industry standards (e.g., Mattermost for Slack). This approach enables a fully observable and controlled environment through source code modification and direct backend database access for precise verification. MobileWorld also introduces novel task categories, including agent-user interaction and Model Context Protocol (MCP)-augmented tasks, for evaluating agents in user-aware, hybrid-tool scenarios. To facilitate evaluation, we develop a planner-executor agentic framework with extended action spaces to support user interactions and MCP calls. Our results reveal a sharp performance drop compared to AndroidWorld, with the best agentic framework and end-to-end model achieving 51.7% and 20.9% success rates, respectively, highlighting ample headroom for future research.

preprint2025arXiv

Multi-bump solutions for sublinear elliptic equations with nonsymmetric coefficients

We investigate the existence of nonnegative bump solutions to the sublinear elliptic equation \[ \begin{cases} -Δv - K(x)v + |v|^{q-2}v = 0 & \text{in } \mathbb{R}^N, \\ v(x) \to 0 & \text{as } |x| \to \infty, \end{cases} \] where $q \in (1,2)$, $ N \geq 2$, and the potential $K \in L^p_{\mathrm{loc}}(\mathbb{R}^N)$ with $p > N/2$ is a function without any symmetry assumptions. Under the condition that $\|K - 1\|_{L^p_{\mathrm{loc}}}$ is sufficiently small, we construct infinitely many solutions with arbitrarily many bumps. The construction is challenged by the sensitive interaction between bumps, whose limiting profiles have compact support. The key to ensuring their effective separation lies in obtaining sharp estimates of the support sets. Our method, based on a truncated functional space, provides precisely such control. We derive qualitative local stability estimates in region-wise maximum norms that govern the size of each bump's essential support, confining its core to a designated region and minimizing overlap. Crucially, these estimates are uniform in the number of bumps, which is the pivotal step in establishing the existence of solutions with infinitely many bumps.

preprint2024arXiv

Learning Surface Scattering Parameters From SAR Images Using Differentiable Ray Tracing

Simulating high-resolution Synthetic Aperture Radar (SAR) images in complex scenes has consistently presented a significant research challenge. The development of a microwave-domain surface scattering model and its reversibility are poised to play a pivotal role in enhancing the authenticity of SAR image simulations and facilitating the reconstruction of target parameters. Drawing inspiration from the field of computer graphics, this paper proposes a surface microwave rendering model that comprehensively considers both Specular and Diffuse contributions. The model is analytically represented by the coherent spatially varying bidirectional scattering distribution function (CSVBSDF) based on the Kirchhoff approximation (KA) and the perturbation method (SPM). And SAR imaging is achieved through the synergistic combination of ray tracing and fast mapping projection techniques. Furthermore, a differentiable ray tracing (DRT) engine based on SAR images was constructed for CSVBSDF surface scattering parameter learning. Within this SAR image simulation engine, the use of differentiable reverse ray tracing enables the rapid estimation of parameter gradients from SAR images. The effectiveness of this approach has been validated through simulations and comparisons with real SAR images. By learning the surface scattering parameters, substantial enhancements in SAR image simulation performance under various observation conditions have been demonstrated.

preprint2024arXiv

Plug-in Diffusion Model for Sequential Recommendation

Pioneering efforts have verified the effectiveness of the diffusion models in exploring the informative uncertainty for recommendation. Considering the difference between recommendation and image synthesis tasks, existing methods have undertaken tailored refinements to the diffusion and reverse process. However, these approaches typically use the highest-score item in corpus for user interest prediction, leading to the ignorance of the user's generalized preference contained within other items, thereby remaining constrained by the data sparsity issue. To address this issue, this paper presents a novel Plug-in Diffusion Model for Recommendation (PDRec) framework, which employs the diffusion model as a flexible plugin to jointly take full advantage of the diffusion-generating user preferences on all items. Specifically, PDRec first infers the users' dynamic preferences on all items via a time-interval diffusion model and proposes a Historical Behavior Reweighting (HBR) mechanism to identify the high-quality behaviors and suppress noisy behaviors. In addition to the observed items, PDRec proposes a Diffusion-based Positive Augmentation (DPA) strategy to leverage the top-ranked unobserved items as the potential positive samples, bringing in informative and diverse soft signals to alleviate data sparsity. To alleviate the false negative sampling issue, PDRec employs Noise-free Negative Sampling (NNS) to select stable negative samples for ensuring effective model optimization. Extensive experiments and analyses on four datasets have verified the superiority of the proposed PDRec over the state-of-the-art baselines and showcased the universality of PDRec as a flexible plugin for commonly-used sequential encoders in different recommendation scenarios. The code is available in https://github.com/hulkima/PDRec.

preprint2024arXiv

The JCMT Transient Survey: Six-Year Summary of 450/850\,$μ$m Protostellar Variability and Calibration Pipeline Version 2.0

The JCMT Transient Survey has been monitoring eight Gould Belt low-mass star-forming regions since December 2015 and six somewhat more distant intermediate-mass star-forming regions since February 2020 with SCUBA-2 on the JCMT at \ShortS and \LongS and with an approximately monthly cadence. We introduce our Pipeline v2 relative calibration procedures for image alignment and flux calibration across epochs, improving on our previous Pipeline v1 by decreasing measurement uncertainties and providing additional robustness. These new techniques work at both \LongS and \ShortNS, where v1 only allowed investigation of the \LongS data. Pipeline v2 achieves better than $0.5^{\prime\prime}$ relative image alignment, less than a tenth of the submillimeter beam widths. The v2 relative flux calibration is found to be 1\% at \LongS and $<5$\% at \ShortNS. The improvement in the calibration is demonstrated by comparing the two pipelines over the first four years of the survey and recovering additional robust variables with v2. Using the full six years of the Gould Belt survey the number of robust variables increases by 50\,\%, and at \ShortS we identify four robust variables, all of which are also robust at \LongNS. The multi-wavelength light curves for these sources are investigated and found to be consistent with the variability being due to dust heating within the envelope in response to accretion luminosity changes from the central source.

preprint2024arXiv

Understanding LLMs: A Comprehensive Overview from Training to Inference

The introduction of ChatGPT has led to a significant increase in the utilization of Large Language Models (LLMs) for addressing downstream tasks. There&#39;s an increasing focus on cost-efficient training and deployment within this context. Low-cost training and deployment of LLMs represent the future development trend. This paper reviews the evolution of large language model training techniques and inference deployment technologies aligned with this emerging trend. The discussion on training includes various aspects, including data preprocessing, training architecture, pre-training tasks, parallel training, and relevant content related to model fine-tuning. On the inference side, the paper covers topics such as model compression, parallel computation, memory scheduling, and structural optimization. It also explores LLMs&#39; utilization and provides insights into their future development.

preprint2023arXiv

Evidence for gapless quantum spin liquid in a honeycomb lattice

One main theme in current condensed matter physics is the search of quantum spin liquid (QSL), an exotic magnetic state with strongly-fluctuating and highly-entangled spins down to zero temperature without static order. However, there is no consensus on the existence of a QSL ground state in any real material so far. The disorders and competing exchange interactions may prevent the formation of an ideal QSL state on frustrated spin lattices. Here we report systematic heat transport measurements on a honeycomb-lattice compound BaCo2(AsO4)2, which manifests magnetic order in zero field. In a narrow field range after the magnetic order is nearly suppressed by an in-plane field, in both perpendicular and parallel to the zigzag direction, a finite residual linear term of thermal conductivity is clearly observed, which is attributed to the mobile fractionalized spinon excitations. This provides smoking-gun evidence for a gapless QSL state in BaCo2(AsO4)2. We discuss the underlying physics to form this exotic gapless QSL state in Co2+ honeycomb lattice.

preprint2023arXiv

Online Decomposition of Surface Electromyogram into Individual Motor Unit Activities Using Progressive FastICA Peel-off

Surface electromyogram (SEMG) decomposition provides a promising tool for decoding and understanding neural drive information non-invasively. In contrast to previous SEMG decomposition methods mainly developed in offline conditions, there are few studies on online SEMG decomposition. A novel method for online decomposition of SEMG data is presented using the progressive FastICA peel-off (PFP) algorithm. The online method consists of an offline prework stage and an online decomposition stage. More specifically, a series of separation vectors are first initialized by the originally offline version of the PFP algorithm from SEMG data recorded in advance. Then they are applied to online SEMG data to extract motor unit spike trains precisely. The performance of the proposed online SEMG decomposition method was evaluated by both simulation and experimental approaches. It achieved an online decomposition accuracy of 98.53% when processing simulated SEMG data. For decomposing experimental SEMG data, the proposed online method was able to extract an average of 12.00 +- 3.46 MUs per trial, with a matching rate of 90.38% compared with results from the expert-guided offline decomposition. Our study provides a valuable way of online decomposition of SEMG data with advanced applications in movement control and health.

preprint2023arXiv

Surveillance Face Anti-spoofing

Face Anti-spoofing (FAS) is essential to secure face recognition systems from various physical attacks. However, recent research generally focuses on short-distance applications (i.e., phone unlocking) while lacking consideration of long-distance scenes (i.e., surveillance security checks). In order to promote relevant research and fill this gap in the community, we collect a large-scale Surveillance High-Fidelity Mask (SuHiFiMask) dataset captured under 40 surveillance scenes, which has 101 subjects from different age groups with 232 3D attacks (high-fidelity masks), 200 2D attacks (posters, portraits, and screens), and 2 adversarial attacks. In this scene, low image resolution and noise interference are new challenges faced in surveillance FAS. Together with the SuHiFiMask dataset, we propose a Contrastive Quality-Invariance Learning (CQIL) network to alleviate the performance degradation caused by image quality from three aspects: (1) An Image Quality Variable module (IQV) is introduced to recover image information associated with discrimination by combining the super-resolution network. (2) Using generated sample pairs to simulate quality variance distributions to help contrastive learning strategies obtain robust feature representation under quality variation. (3) A Separate Quality Network (SQN) is designed to learn discriminative features independent of image quality. Finally, a large number of experiments verify the quality of the SuHiFiMask dataset and the superiority of the proposed CQIL.

preprint2023arXiv

Surveys of clumps, cores, and condensations in Cygnus-X:Searching for circumstellar disks

To investigate whether disk-mediated accretion is the primary mechanism in high-mass star formation, we have established a survey of a large sample of massive dense cores within a giant molecular cloud. We used high angular resolution ($\sim 1.8&#39;&#39;$) observations with SMA to study the dust emission and molecular line emission of about 50 massive dense cores in Cygnus-X. At a typical distance of 1.4 kpc for Cygnus-X, these massive dense cores are resolved into $\sim 2000$ au condensations. We combined the CO outflow emission and gas kinematics traced by several high-density tracers to search for disk candidates. We extracted hundreds of dust condensations from the SMA 1.3 mm dust continuum emission. The CO data show bipolar or unipolar outflow signatures toward 49 dust condensations. Among them, only 27 sources are detected in dense gas tracers, which reveals the gas kinematics, and nine sources show evidence of rotating envelopes, suggesting the existence of embedded accretion disks. The position-velocity diagrams along the velocity gradient of all rotating condensations suggest that four condensations are possible to host Keplerian-like disks. A detailed investigation of the 27 sources detected in dense gas tracers suggests that the nine disk candidates are at earlier evolutionary stages compared to the remaining 18 sources. Non-detection of rotating disks in our sample may be due to several factors, including an unknown inclination angle of the rotation axis and an early evolutionary stage of the central source, and the latter could be important, considering that young and powerful outflows could confuse the observational evidence for rotation. The detection rate of disk candidates in our sample is 1/3, which confirms that disk accretion is a viable mechanism for high-mass star formation, although it may not be the only one.

preprint2022arXiv

A generalized family of transcendental functions with one dimensional Julia sets

A generalized family of transcendental (non-polynomial entire) functions is constructed, where the Hausdorff dimension and the packing dimension of the Julia sets are equal to one. Further, there exist multiply connected wandering domains, the dynamics can be completed described, and for any $s\in(0,+\infty]$, there is a function taken from this family with the order of growth $s$. Baker proved that the Hausdorff dimension of the transcendental function is no less than one in 1975, the minimum value was obtained via an elegant construction by Bishop in 2018. The order of growth is zero in Bishop&#39;s construction, the family of functions here have arbitrarily positive or even infinite order of growth.

preprint2022arXiv

A two-step backward compatible fullband speech enhancement system

Speech enhancement methods based on deep learning have surpassed traditional methods. While many of these new approaches are operating on the wideband (16kHz) sample rate, a new fullband (48kHz) speech enhancement system is proposed in this paper. Compared to the existing fullband systems that utilizes perceptually motivated features to train the fullband speech enhancement using a single network structure, the proposed system is a two-step system ensuring good fullband speech enhancement quality while backward compatible to the existing wideband systems.

preprint2022arXiv

Data-Time Tradeoffs for Optimal k-Thresholding Algorithms in Compressed Sensing

Optimal $k$-thresholding algorithms are a class of $k$-sparse signal recovery algorithms that overcome the shortcomings of traditional hard thresholding algorithms caused by the oscillation of the residual function. In this paper, a novel convergence analysis for optimal $k$-thresholding algorithms is established, which reveals the data-time tradeoffs of these algorithms. Both the analysis and numerical results demonstrate that when the number of measurements is small, the algorithms cannot converge; when the number of measurements is suitably large, the number of iterations required for successful recovery has a negative correlation with the number of measurements, and the algorithms can achieve linear convergence. Furthermore, the main theorems indicate that the number of measurements required for successful recovery is of the order of $k \log({n}/{k})$, where $n$ is the dimension of the target signal.

preprint2022arXiv

Dynamical properties of collective excitations in twisted bilayer Graphene

Employing the recently developed momentum-space quantum Monte Carlo scheme, we study the dynamic response of single-particle and collective excitations in realistic continuum models of twisted bilayer graphene. At charge neutrality, this unbiased numerical method reveals strong competition between different symmetry breaking channels with a leading instability towards the intervalley coherent state. Single-particle spectra indicate that repulsive interactions push the fermion spectral weight away from the Fermi energy and open up an insulating gap. The spectra of collective excitations suggest an approximate valley $SU(2)$ symmetry. At low-energy, long-lived valley waves are observed, which resemble spin waves of Heisenberg ferromagnetism. At high-energy, these sharp modes quickly become over-damped, when their energy reaches the fermion particle-hole continuum.

preprint2022arXiv

Fermion sign bounds theory in quantum Monte Carlo simulation

Sign problem in fermion quantum Monte Carlo (QMC) simulation appears to be an extremely hard problem. Traditional lore passing around for years tells people that when there is a sign problem, the average sign in QMC simulation approaches zero exponentially fast with the space-time volume of the configurational space. We, however, analytically show this is not always the case and manage to find physical bounds for the average sign. Our understanding is based on a direct connection between the sign bounds and a well-defined partition function of reference system and could distinguish when the bounds have the usual exponential scaling, and when they are bestowed on an algebraic scaling at low temperature limit. We analytically explain such algebraic sign problems found in flat band moiré lattice models at low temperature limit. At finite temperature, a domain size argument based on sign bounds also explains the connection between sign behavior and finite temperature phase transition. Sign bounds, as a well-defined observable, may have ability to ease or even make use of the sign problem.

preprint2022arXiv

In-situ probing and stabilizing the power ratio of electro-optic-modulated laser pairs based on VIPA etalon for quantum sensing

Monitoring and stabilizing the power ratio of laser pairs is significant to high-precision atom interferometers, especially as the compact electro-optic modulated all-fiber laser system prevails. In this Letter, we demonstrate a novel method to in-situ probe the relative power of laser pairs and to stabilize the power ratio of two Raman lasers using a high-dispersion virtually imaged phased array (VIPA) etalon. Sub-microsecond resolution on probing laser power transformation during atom interferometer sequence is achieved and the power ratio of two Raman lasers (PRTR) is tightly locked with high bandwidth despite of environmental disturbances, showing an Allan deviation of $4.39\times 10^{-5}$ at 1000 s averaging time. This method provides a novel way to stabilize the PRTR and diagnose the multi-frequency laser systems for atom interferometers and could find potential application in broad quantum sensing scenarios.

preprint2022arXiv

Multi-view Multi-behavior Contrastive Learning in Recommendation

Multi-behavior recommendation (MBR) aims to jointly consider multiple behaviors to improve the target behavior&#39;s performance. We argue that MBR models should: (1) model the coarse-grained commonalities between different behaviors of a user, (2) consider both individual sequence view and global graph view in multi-behavior modeling, and (3) capture the fine-grained differences between multiple behaviors of a user. In this work, we propose a novel Multi-behavior Multi-view Contrastive Learning Recommendation (MMCLR) framework, including three new CL tasks to solve the above challenges, respectively. The multi-behavior CL aims to make different user single-behavior representations of the same user in each view to be similar. The multi-view CL attempts to bridge the gap between a user&#39;s sequence-view and graph-view representations. The behavior distinction CL focuses on modeling fine-grained differences of different behaviors. In experiments, we conduct extensive evaluations and ablation tests to verify the effectiveness of MMCLR and various CL tasks on two real-world datasets, achieving SOTA performance over existing baselines. Our code will be available on \url{https://github.com/wyqing20/MMCLR}

preprint2022arXiv

Personalized Federated Learning via Variational Bayesian Inference

Federated learning faces huge challenges from model overfitting due to the lack of data and statistical diversity among clients. To address these challenges, this paper proposes a novel personalized federated learning method via Bayesian variational inference named pFedBayes. To alleviate the overfitting, weight uncertainty is introduced to neural networks for clients and the server. To achieve personalization, each client updates its local distribution parameters by balancing its construction error over private data and its KL divergence with global distribution from the server. Theoretical analysis gives an upper bound of averaged generalization error and illustrates that the convergence rate of the generalization error is minimax optimal up to a logarithmic factor. Experiments show that the proposed method outperforms other advanced personalized methods on personalized models, e.g., pFedBayes respectively outperforms other SOTA algorithms by 1.25%, 0.42% and 11.71% on MNIST, FMNIST and CIFAR-10 under non-i.i.d. limited data.

preprint2022arXiv

Rate-Distortion Theory for Strategic Semantic Communication

This paper analyzes the fundamental limit of the strategic semantic communication problem in which a transmitter obtains a limited number of indirect observation of an intrinsic semantic information source and can then influence the receiver&#39;s decoding by sending a limited number of messages to an imperfect channel. The transmitter and the receiver can have different distortion measures and can make rational decision about their encoding and decoding strategies, respectively. The decoder can also have some side information (e.g., background knowledge and/or information obtained from previous communications) about the semantic source to assist its interpretation of the semantic information. We focus particularly on the case that the transmitter can commit to an encoding strategy and study the impact of the strategic decision making on the rate distortion of semantic communication. Three equilibrium solutions including the strong Stackelberg equilibrium, weak Stackelberg equilibrium, as well as Nash equilibrium have been studied and compared. The optimal encoding and decoding strategy profiles under various equilibrium solutions have been derived. We prove that committing to an encoding strategy cannot always bring benefit to the encoder. We therefore propose a feasible condition under which committing to an encoding strategy can always reduce the distortion performance of semantic communication.

preprint2022arXiv

Robust remote estimation over the collision channel in the presence of an intelligent jammer

We consider a sensor-receiver pair communicating over a wireless channel in the presence of a jammer who may launch a denial-of-service attack. We formulate a zero-sum game between a coordinator that jointly designs the transmission and estimation policies, and the jammer. We consider two cases depending on whether the jammer can sense the channel or not. We characterize a saddle-point equilibrium for the class of symmetric and unimodal probability density functions when the jammer cannot sense the channel. If the jammer can sense if the channel is being used, we provide an efficient algorithm that alternates between iterations of Projected Gradient Ascent and the Convex-Concave Procedure to find approximate First-order Nash-Equilibria. Our numerical results show that in certain cases the jammer may decide to launch a denial-of-service attack with the goal of deceiving the receiver even when the sensor decides not to transmit.

preprint2022arXiv

Robust single-sideband-modulated Raman light generation for atom interferometry by FBG-based optical rectangular filtration

Low-phase-noise and pure-spectrum Raman light is vital for high-precision atom interferometry by two-photon Raman transition. A preferred and prevalent solution for Raman light generation is electro-optic phase modulation. However, phase modulation inherently brings in double sidebands, resulting in residual sideband effects of multiple laser pairs beside Raman light in atom interferometry. Based on a well-designed rectangular fiber Bragg grating and an electro-optic modulator, optical single-sideband modulation has been realized at 1560 nm with a stable suppression ratio better than -25 dB despite of intense temperature variations. After optical filtration and frequency doubling, a robust phase-coherent Raman light at 780 nm is generated with a stable SNR of better than -19 dB and facilitates measuring the local gravity successfully. This proposed all-fiber single-sideband-modulated Raman light source, characterized as robust, compact and low-priced, is practical and potential for field applications of portable atom interferometry.

preprint2022arXiv

Selective Fairness in Recommendation via Prompts

Recommendation fairness has attracted great attention recently. In real-world systems, users usually have multiple sensitive attributes (e.g. age, gender, and occupation), and users may not want their recommendation results influenced by those attributes. Moreover, which of and when these user attributes should be considered in fairness-aware modeling should depend on users&#39; specific demands. In this work, we define the selective fairness task, where users can flexibly choose which sensitive attributes should the recommendation model be bias-free. We propose a novel parameter-efficient prompt-based fairness-aware recommendation (PFRec) framework, which relies on attribute-specific prompt-based bias eliminators with adversarial training, enabling selective fairness with different attribute combinations on sequential recommendation. Both task-specific and user-specific prompts are considered. We conduct extensive evaluations to verify PFRec&#39;s superiority in selective fairness. The source codes are released in \url{https://github.com/wyqing20/PFRec}.

preprint2022arXiv

SMDT: Selective Memory-Augmented Neural Document Translation

Existing document-level neural machine translation (NMT) models have sufficiently explored different context settings to provide guidance for target generation. However, little attention is paid to inaugurate more diverse context for abundant context information. In this paper, we propose a Selective Memory-augmented Neural Document Translation model to deal with documents containing large hypothesis space of the context. Specifically, we retrieve similar bilingual sentence pairs from the training corpus to augment global context and then extend the two-stream attention model with selective mechanism to capture local context and diverse global contexts. This unified approach allows our model to be trained elegantly on three publicly document-level machine translation datasets and significantly outperforms previous document-level NMT models.

preprint2022arXiv

Submanifolds of some Hartogs domain and the complex Euclidean space

Two Kahler manifolds are called relatives if they admit a common Kahler submanifold with the same induced metrics. In this paper, we show that a Hartogs domain over an irreducible bounded symmetric domain equipped with the Bergman metric is not a relative to the complex Euclidean space. This generalizes the results in [5, 4] and the novelty here is that the Bergman kernel of the Hartogs domain is not necessarily Nash algebraic.

preprint2022arXiv

Thermodynamic characteristic for correlated flat-band system with quantum anomalous Hall ground state

While the ground state phase diagram of the correlated flat-band systems have been intensively investigated, the dynamic and thermodynamic properties of such lattice models are less explored, but it is the latter which is most relevant to the experimental probes (transport, quantum capacitance and spectroscopy) of the quantum moiré materials such as twisted bilayer graphene and transition metal dichalcogenides. Here we show, by means of momentum-space quantum Monte Carlo and exact diagonalization, there exists a unique thermodynamic characteristic for the correlated flat-band models with interaction-driven quantum anomalous Hall (QAH) ground state, namely, the transition from the QAH insulator to the metallic state takes place at a much lower temperature compared with the zero-temperature single-particle gap generated by the long-range Coulomb interaction. Such low transition temperature comes from the proliferation of excitonic particle-hole excitations, which &#34;quantum teleport&#34; the electrons across the gap between different topological bands to restore the broken time-reversal symmetry and give rise to a pronounced enhancement in the charge compressibility. Future experiments, to verify such generic thermodynamic characteristics, are proposed.

preprint2022arXiv

Topological and Algebraic Structures of Atanassov&#39;s Intuitionistic Fuzzy-Values Space

We prove that the space of intuitionistic fuzzy values (IFVs) with a linear order based on a score function and an accuracy function has the same algebraic structure as the one induced by a linear order based on a similarity function and an accuracy function. By introducing a new operator for IFVs via the linear order based on a score function and an accuracy function, we show that such an operator is a strong negation on IFVs. Moreover, we observe that the space of IFVs is a complete lattice and a Kleene algebra with the new operator. We also demonstrate that the topological space of IFVs with the order topology induced by the above two linear orders is not separable and metrizable but compact and connected. From some new perspectives,our results partially answer three open problems posed by Atanassov [Intuitionistic Fuzzy Sets: Theory and Applications, Springer, 1999] and [On Intuitionistic Fuzzy Sets Theory, Springer, 2012]. Furthermore, we construct an isomorphism between the spaces of IFVs and q-rung orthopedic fuzzy values (q-ROFVs) under the corresponding linear orders. To this end, we introduce the concept of admissible similarity measures with particular orders for IFSs, extending the existing definition of the similarity measure for IFSs, and construct an admissible similarity measure with a linear order based on a score function and an accuracy function, which is effectively applied to a pattern recognition problem about the classification of building materials.

preprint2022arXiv

UniParser: A Unified Log Parser for Heterogeneous Log Data

Logs provide first-hand information for engineers to diagnose failures in large-scale online service systems. Log parsing, which transforms semi-structured raw log messages into structured data, is a prerequisite of automated log analysis such as log-based anomaly detection and diagnosis. Almost all existing log parsers follow the general idea of extracting the common part as templates and the dynamic part as parameters. However, these log parsing methods, often neglect the semantic meaning of log messages. Furthermore, high diversity among various log sources also poses an obstacle in the generalization of log parsing across different systems. In this paper, we propose UniParser to capture the common logging behaviours from heterogeneous log data. UniParser utilizes a Token Encoder module and a Context Encoder module to learn the patterns from the log token and its neighbouring context. A Context Similarity module is specially designed to model the commonalities of learned patterns. We have performed extensive experiments on 16 public log datasets and our results show that UniParser outperperforms state-of-the-art log parsers by a large margin.

preprint2021arXiv

A Concise Introduction to Control Theory for Stochastic Partial Differential Equations

The aim of this notes is to give a concise introduction to control theory for systems governed by stochastic partial differential equations. We shall mainly focus on controllability and optimal control problems for these systems. For the first one, we present results for the exact controllability of stochastic transport equations, null and approximate controllability of stochastic parabolic equations and lack of exact controllability of stochastic hyperbolic equations. For the second one, we first introduce the stochastic linear quadratic optimal control problems and then the Pontryagin type maximum principle for general optimal control problems. It deserves mentioning that, in order to solve some difficult problems in this field, one has to develop new tools, say, the stochastic transposition method introduced in our previous works.

preprint2021arXiv

Fast Outage Analysis of Large-scale Production Clouds with Service Correlation Mining

Cloud-based services are surging into popularity in recent years. However, outages, i.e., severe incidents that always impact multiple services, can dramatically affect user experience and incur severe economic losses. Locating the root-cause service, i.e., the service that contains the root cause of the outage, is a crucial step to mitigate the impact of the outage. In current industrial practice, this is generally performed in a bootstrap manner and largely depends on human efforts: the service that directly causes the outage is identified first, and the suspected root cause is traced back manually from service to service during diagnosis until the actual root cause is found. Unfortunately, production cloud systems typically contain a large number of interdependent services. Such a manual root cause analysis is often time-consuming and labor-intensive. In this work, we propose COT, the first outage triage approach that considers the global view of service correlations. COT mines the correlations among services from outage diagnosis data. After learning from historical outages, COT can infer the root cause of emerging ones accurately. We implement COT and evaluate it on a real-world dataset containing one year of data collected from Microsoft Azure, one of the representative cloud computing platforms in the world. Our experimental results show that COT can reach a triage accuracy of 82.1%~83.5%, which outperforms the state-of-the-art triage approach by 28.0%~29.7%.

preprint2021arXiv

Magnetic field-tuned quantum criticality in optimally electron-doped cuprate thin films

Antiferromagnetic (AF) spin fluctuations are commonly believed to play a key role in electron pairing of cuprate superconductors. In electron-doped cuprates, it is still in paradox about the interplay among different electronic states in quantum perturbations, especially between superconducting and magnetic states. Here, we report a systematic transport study on cation-optimized La2-xCexCuO4 (x = 0.10) thin films in high magnetic fields. We find an AF quantum phase transition near 60 T, where the Hall number jumps from nH =-x to nH = 1-x, resembling the change of nH at the AF boundary (xAF = 0.14) tuned by Ce doping. In the AF region a spin dependent state manifesting anomalous positive magnetoresistance is observed, which is closely related to superconductivity. Once the AF state is suppressed by magnetic field, a polarized ferromagnetic state is predicted, reminiscent of the recently reported ferromagnetic state at the quantum endpoint of the superconducting dome by Ce doping. The magnetic field that drives phase transitions in a similar but distinct manner to doping thereby provides a unique perspective to understand the quantum criticality of electron-doped cuprates.

preprint2021arXiv

Observation of a symmetry-protected topological time crystal with superconducting qubits

We report the observation of a symmetry-protected topological time crystal, which is implemented with an array of programmable superconducting qubits. Unlike the time crystals reported in previous experiments, where spontaneous breaking of the discrete time translational symmetry occurs for local observables throughout the whole system, the topological time crystal observed in our experiment breaks the time translational symmetry only at the boundaries and has trivial dynamics in the bulk. More concretely, we observe robust long-lived temporal correlations and sub-harmonic temporal response for the edge spins up to 40 driving cycles. We demonstrate that the sub-harmonic response is independent of whether the initial states are random product states or symmetry-protected topological states, and experimentally map out the phase boundary between the time crystalline and thermal phases. Our work paves the way to exploring peculiar non-equilibrium phases of matter emerged from the interplay between topology and localization as well as periodic driving, with current noisy intermediate-scale quantum processors.

preprint2021arXiv

Ordinal sum of two binary operations being a t-norm on bounded lattice

The ordinal sum of t-norms on a bounded lattice has been used to construct other t-norms. However, an ordinal sum of binary operations (not necessarily t-norms) defined on the fixed subintervals of a bounded lattice may not be a t-norm. Some necessary and sufficient conditions are presented in this paper for ensuring that an ordinal sum on a bounded lattice of two binary operations is, in fact, a t-norm. In particular, the results presented here provide an answer to an open problem put forward by Ertuğrul and Yeşilyurt [Ordinal sums of triangular norms on bounded lattices, Inf. Sci., 517 (2020) 198-216].

preprint2021arXiv

Remarks on non-perturbative three--body dynamics and its application to the $KK\bar K$ system

A formalism is discussed that allows for a straightforward treatment of the relativistic three-body problem while keeping the correct analytic structure. In particular it is demonstrated that sacrificing covariance for analyticity can be justified by the hierarchy of different contributions in the spirit of an effective field theory. For definiteness the formalism is applied to the $KK\bar K$ system allowing for the emergence of the $a_0(980)$ and the $f_0(980)$ as hadronic molecules. For simplicity all inelastic channels are switched off.

preprint2021arXiv

Understanding WeChat User Preferences and &#34;Wow&#34; Diffusion

WeChat is the largest social instant messaging platform in China, with 1.1 billion monthly active users. &#34;Top Stories&#34; is a novel friend-enhanced recommendation engine in WeChat, in which users can read articles based on preferences of both their own and their friends. Specifically, when a user reads an article by opening it, the &#34;click&#34; behavior is private. Moreover, if the user clicks the &#34;wow&#34; button, (only) her/his direct connections will be aware of this action/preference. Based on the unique WeChat data, we aim to understand user preferences and &#34;wow&#34; diffusion in Top Stories at different levels. We have made some interesting discoveries. For instance, the &#34;wow&#34; probability of one user is negatively correlated with the number of connected components that are formed by her/his active friends, but the click probability is the opposite. We further study to what extent users&#39; &#34;wow&#34; and click behavior can be predicted from their social connections. To address this problem, we present a hierarchical graph representation learning based model DiffuseGNN, which is capable of capturing the structure-based social observations discovered above. Our experiments show that the proposed method can significantly improve the prediction performance compared with alternative methods.

preprint2021arXiv

Universal scaling of the critical temperature and the strange-metal scattering rate in unconventional superconductors

Dramatic evolution of properties with minute change in the doping level is a hallmark of the complex chemistry which governs cuprate superconductivity as manifested in the celebrated superconducting domes as well as quantum criticality taking place at precise compositions. The strange metal state, where the resistivity varies linearly with temperature, has emerged as a central feature in the normal state of cuprate superconductors. The ubiquity of this behavior signals an intimate link between the scattering mechanism and superconductivity. However, a clear quantitative picture of the correlation has been lacking. Here, we report observation of quantitative scaling laws between the superconducting transition temperature $T_{\rm c}$ and the scattering rate associated with the strange metal state in electron-doped cuprate $\rm La_{2-x}Ce_xCuO_4$ (LCCO) as a precise function of the doping level. High-resolution characterization of epitaxial composition-spread films, which encompass the entire overdoped range of LCCO has allowed us to systematically map its structural and transport properties with unprecedented accuracy and increment of $Δx = 0.0015$. We have uncovered the relations $T_{\rm c}\sim(x_{\rm c}-x)^{0.5}\sim(A_1^\square)^{0.5}$, where $x_c$ is the critical doping where superconductivity disappears on the overdoped side and $A_1^\square$ is the scattering rate of perfect $T$-linear resistivity per CuO$_2$ plane. We argue that the striking similarity of the $T_{\rm c}$ vs $A_1^\square$ relation among cuprates, iron-based and organic superconductors is an indication of a common mechanism of the strange metal behavior and unconventional superconductivity in these systems.

preprint2021arXiv

UPRec: User-Aware Pre-training for Recommender Systems

Existing sequential recommendation methods rely on large amounts of training data and usually suffer from the data sparsity problem. To tackle this, the pre-training mechanism has been widely adopted, which attempts to leverage large-scale data to perform self-supervised learning and transfer the pre-trained parameters to downstream tasks. However, previous pre-trained models for recommendation focus on leverage universal sequence patterns from user behaviour sequences and item information, whereas ignore capturing personalized interests with the heterogeneous user information, which has been shown effective in contributing to personalized recommendation. In this paper, we propose a method to enhance pre-trained models with heterogeneous user information, called User-aware Pre-training for Recommendation (UPRec). Specifically, UPRec leverages the user attributes andstructured social graphs to construct self-supervised objectives in the pre-training stage and proposes two user-aware pre-training tasks. Comprehensive experimental results on several real-world large-scale recommendation datasets demonstrate that UPRec can effectively integrate user information into pre-trained models and thus provide more appropriate recommendations for users.

preprint2020arXiv

$L^2$ estimates and existence theorems for the $\bar{\partial}$ operators in infinite dimensions, I

The classical $L^2$ estimate for the $\overline{\partial}$ operators is a basic tool in complex analysis of several variables. Naturally, it is expected to extend this estimate to infinite dimensional complex analysis, but this is a longstanding unsolved problem, due to the essential difficulty that there exists no nontrivial translation invariance measure in the setting of infinite dimensions. The main purpose in this series of work is to give an affirmative solution to the above problem, and apply the estimates to the solvability of the infinite dimensional $\overline{\partial}$ equations. In this first part, we focus on the simplest case, i.e., $L^2$ estimates and existence theorems for the $\overline{\partial}$ equations on the whole space of $\ell^p$ for $p\in [1,\infty)$. The key of our approach is to introduce a suitable working space, i.e., a Hilbert space for $(s,t)$-forms on $\ell^p$ (for each nonnegative integers $s$ and $t$), and via which we define the $\overline{\partial}$ operator from $(s,t)$-forms to $(s,t+1)$-forms and establish the exactness of these operators, and therefore in this case we solve a problem which has been open for nearly forty years.

preprint2020arXiv

A Bilinear Partially Penalized Immersed Finite Element Method for Elliptic Interface Problems with Multi-Domains and Triple-Junction Points

In this article, we introduce a new partially penalized immersed finite element method (IFEM) for solving elliptic interface problems with multi-domains and triple-junction points. We construct new IFE functions on elements intersected with multiple interfaces or with triple-junction points to accommodate interface jump conditions. For non-homogeneous flux jump, we enrich the local approximating spaces by adding up to three local flux basis functions. Numerical experiments are carried out to show that both the Lagrange interpolations and the partial penalized IFEM solutions converge optimally in L2 and H1 norms.

preprint2020arXiv

Constitutive modeling of the tension-compression behavior of gradient structured materials

Gradient structured (GS) metals processed by severe plastic deformation techniques can be designed to achieve simultaneously high strength and high ductility. Significant kinematic hardening is key to their excellent strain hardening capacity which results in a favorable strength-ductility combination. Unfortunately, no constitutive model has been established to simulate and analyze the characteristic kinematic hardening behavior of GS metal to understand the relationship between their microstructure and macroscopic response. In this work, we developed a deformation-mechanismbased strain gradient plasticity model considering the plasticity heterogeneities from the grain to the sample scale. A back stress model, which accounts for the dependency of dislocation pile-ups on grain size, is established to describe the cyclic deformation properties of GS materials. The established model unified the geometrically necessary dislocations accommodating internal plasticity heterogeneities, the resulting back stress and reversible dislocations during reverse loading into a strain gradient plasticity framework, without introducing excessive numbers of independent material parameters. A finite element implementation of the model quantitatively predicts the uniaxial tensile and tensile-compressive responses of a GS copper bar as well as of a reference sample with homogeneous grain size. It is found that GS copper exhibits enhanced kinematic hardening which results mainly from fine grains in the GS layer and contributes to the considerable ductility of the GS material. The model allows to investigate the mechanical response and optimize the properties of materials with various types of spatially heterogeneous grain microstructures.

preprint2020arXiv

Deep Learning Guided Building Reconstruction from Satellite Imagery-derived Point Clouds

3D urban reconstruction of buildings from remotely sensed imagery has drawn significant attention during the past two decades. While aerial imagery and LiDAR provide higher resolution, satellite imagery is cheaper and more efficient to acquire for large scale need. However, the high, orbital altitude of satellite observation brings intrinsic challenges, like unpredictable atmospheric effect, multi view angles, significant radiometric differences due to the necessary multiple views, diverse land covers and urban structures in a scene, small base-height ratio or narrow field of view, all of which may degrade 3D reconstruction quality. To address these major challenges, we present a reliable and effective approach for building model reconstruction from the point clouds generated from multi-view satellite images. We utilize multiple types of primitive shapes to fit the input point cloud. Specifically, a deep-learning approach is adopted to distinguish the shape of building roofs in complex and yet noisy scenes. For points that belong to the same roof shape, a multi-cue, hierarchical RANSAC approach is proposed for efficient and reliable segmenting and reconstructing the building point cloud. Experimental results over four selected urban areas (0.34 to 2.04 sq km in size) demonstrate the proposed method can generate detailed roof structures under noisy data environments. The average successful rate for building shape recognition is 83.0%, while the overall completeness and correctness are over 70% with reference to ground truth created from airborne lidar. As the first effort to address the public need of large scale city model generation, the development is deployed as open source software.

preprint2020arXiv

Distributed remote estimation over the collision channel with and without local communication

The emergence of the Internet-of-Things and cyber-physical systems necessitates the coordination of access to limited communication resources in an autonomous and distributed fashion. Herein, the optimal design of a wireless sensing system with n sensors communicating with a fusion center via a collision channel of limited capacity k (k < n) is considered. In particular, it is shown that the problem of minimizing the mean-squared error subject to a threshold-based strategy at the transmitters is quasi-convex. As such, low complexity, numerical optimization methods can be applied. When coordination among sensors is not possible, the performance of the optimal threshold strategy is close to that of a centralized lower bound. The loss due to decentralization is thoroughly characterized. Local communication among sensors (using a sparsely connected graph), enables the on-line learning of unknown parameters of the statistical model. These learned parameters are employed to compute the desired thresholds locally and autonomously. Consensus-based strategies are investigated and analyzed for parameter estimation. One strategy approaches the performance of the decentralized approach with fast convergence and a second strategy approaches the performance of the centralized approach, albeit with slower convergence. A hybrid scheme that combines the best of both approaches is proposed offering a fast convergence and excellent convergent performance.

preprint2020arXiv

Learning Contextualized Sentence Representations for Document-Level Neural Machine Translation

Document-level machine translation incorporates inter-sentential dependencies into the translation of a source sentence. In this paper, we propose a new framework to model cross-sentence dependencies by training neural machine translation (NMT) to predict both the target translation and surrounding sentences of a source sentence. By enforcing the NMT model to predict source context, we want the model to learn &#34;contextualized&#34; source sentence representations that capture document-level dependencies on the source side. We further propose two different methods to learn and integrate such contextualized sentence embeddings into NMT: a joint training method that jointly trains an NMT model with the source context prediction model and a pre-training & fine-tuning method that pretrains the source context prediction model on a large-scale monolingual document corpus and then fine-tunes it with the NMT model. Experiments on Chinese-English and English-German translation show that both methods can substantially improve the translation quality over a strong document-level Transformer baseline.

preprint2020arXiv

Matrix Completion with Prior Subspace Information via Maximizing Correlation

This paper studies the problem of completing a low-rank matrix from a few of its random entries with the aid of prior information. We suggest a strategy to incorporate prior information into the standard matrix completion procedure by maximizing the correlation between the original signal and the prior information. We also establish performance guarantees for the proposed method, which show that with suitable prior information, the proposed procedure can reduce the sample complexity of the standard matrix completion by a logarithmic factor. To illustrate the theory, we further analyze an important practical application where the prior subspace information is available. Both synthetic and real-world experiments are provided to verify the validity of the theory.

preprint2020arXiv

MLBF-Net: A Multi-Lead-Branch Fusion Network for Multi-Class Arrhythmia Classification Using 12-Lead ECG

Automatic arrhythmia detection using 12-lead electrocardiogram (ECG) signal plays a critical role in early prevention and diagnosis of cardiovascular diseases. In the previous studies on automatic arrhythmia detection, most methods concatenated 12 leads of ECG into a matrix, and then input the matrix to a variety of feature extractors or deep neural networks for extracting useful information. Under such frameworks, these methods had the ability to extract comprehensive features (known as integrity) of 12-lead ECG since the information of each lead interacts with each other during training. However, the diverse lead-specific features (known as diversity) among 12 leads were neglected, causing inadequate information learning for 12-lead ECG. To maximize the information learning of multi-lead ECG, the information fusion of comprehensive features with integrity and lead-specific features with diversity should be taken into account. In this paper, we propose a novel Multi-Lead-Branch Fusion Network (MLBF-Net) architecture for arrhythmia classification by integrating multi-loss optimization to jointly learning diversity and integrity of multi-lead ECG. MLBF-Net is composed of three components: 1) multiple lead-specific branches for learning the diversity of multi-lead ECG; 2) cross-lead features fusion by concatenating the output feature maps of all branches for learning the integrity of multi-lead ECG; 3) multi-loss co-optimization for all the individual branches and the concatenated network. We demonstrate our MLBF-Net on China Physiological Signal Challenge 2018 which is an open 12-lead ECG dataset. The experimental results show that MLBF-Net obtains an average $F_1$ score of 0.855, reaching the highest arrhythmia classification performance. The proposed method provides a promising solution for multi-lead ECG analysis from an information fusion perspective.

preprint2020arXiv

Prediction of possible exotic states in the $η\bar{K}K^*$ system

We investigate the $η\bar{K}K^*$ three body system in order to look for possible $I^G(J^{PC})=0^+(1^{-+})$ exotic states in the framework of the fixed center approximation to the Faddeev equation. We assume the scattering of $η$ on a clusterized system $\bar{K}K^*$, which is known to generate the $f_1(1285)$, or a $\bar{K}$ on a clusterized system $ηK^*$, which is shown to generate the $K_1(1270)$. In the case of the $η$-$(\bar{K}K^*)_{f_1(1285)}$ scattering, we find evidence of a bound state $I^G(J^{PC})=0^+(1^{-+})$ below the $η{f_1(1285)}$ threshold with mass around 1700 MeV and width about 180 MeV. Considering the $\bar{K}$-$(ηK^*)_{K_1(1270)}$ scattering, we obtain a bound state $I(J^{P})=0(1^{-})$ just below the $\bar{K}{K_1(1270)}$ threshold with a mass around 1680 MeV and a width about 160 MeV.

preprint2020arXiv

Second Order Necessary Conditions for Endpoints-Constrained Optimal Control Problems on Riemannian manifolds

In this paper, we are concerned with optimal control problems evolved on Riemannian manifolds, where the initial and final states satisfy some inequality and equality type constraints, and the control set is a separable metric space. We obtain the second order necessary conditions of integral and quasi-pointwise forms, both of which work for Pontryagin type critical controls and involve the curvature tensor. Also, we apply the condition of integral form to the Bolza problem, where the initial and final states are subject to equality&#39;s type constraint.

preprint2020arXiv

SENSEI: Aligning Video Streaming Quality with Dynamic User Sensitivity

This paper aims to improve video streaming by leveraging a simple observation: users are more sensitive to low quality in certain parts of a video than in others. For instance, rebuffering during key moments of a sports video (e.g., before a goal is scored) is more annoying than rebuffering during normal gameplay. Such dynamic quality sensitivity, however, is rarely captured by current approaches, which predict QoE (quality-of-experience) using one-size-fits-all heuristics that are too simplistic to understand the nuances of video content. Instead of proposing yet another heuristic, we take a different approach: we run a separate crowdsourcing experiment for each video to derive users&#39; quality sensitivity at different parts of the video. Of course, the cost of doing this at scale can be prohibitive, but we show that careful experiment design combined with a suite of pruning techniques can make the cost negligible compared to how much content providers invest in content generation and distribution. Our ability to accurately profile time-varying user sensitivity inspires a new approach: dynamically aligning higher (lower) quality with higher (lower) sensitivity periods. We present a new video streaming system called SENSEI that incorporates dynamic quality sensitivity into existing quality adaptation algorithms. We apply SENSEI to two state-of-the-art adaptation algorithms. SENSEI can take seemingly unusual actions: e.g., lowering bitrate (or initiating a rebuffering event) even when bandwidth is sufficient so that it can maintain a higher bitrate without rebuffering when quality sensitivity becomes higher in the near future. Compared to state-of-the-art approaches, SENSEI improves QoE by 15.1% or achieves the same QoE with 26.8% less bandwidth on average.

preprint2020arXiv

Sensitivity analysis and incompressible Navier-Stokes-Poisson limit of Vlasov-Poisson-Boltzmann equations with uncertainty

For the Vlasov-Poisson-Boltzmann equations with random uncertainties from the initial data or collision kernels, we proved the sensitivity analysis and energy estimates uniformly with respect to the Knudsen number in the diffusive scaling using hypocoercivity method. As a consequence, we also justified the incompressible Navier-Stokes-Poisson limit with random inputs. In particular, for the first time, we obtain the precise convergence rate {\em without} employing any results based on Hilbert expansion. We not only generalized the previous deterministic Navier-Stokes-Poisson limits to random initial data case, also improve the previous uncertainty quantification results to the case where the initial data include both kinetic and fluid parts.

preprint2020arXiv

Shedding Light on Moire Excitons: A First-Principles Perspective

Moire superlattices in van der Waals (vdW) heterostructures could trap strongly bonded and long lived interlayer excitons. Assumed to be localized, these moire excitons could form ordered quantum dot arrays, paving the way for novel optoelectronic and quantum information applications. Here we perform first principles simulations to shed light on moire excitons in twisted MoS2/WS2 heterostructures. We provide the direct evidence of localized interlayer moire excitons in vdW heterostructures. The moire potentials are mapped out based on spatial modulations of energy gaps. Nearly flat valence bands are observed in the heterostructures without magic angles. The dependence of spatial localization and binding energy of the moire excitons on the twist angle of the heterostructures is examined. We explore how electric field can be tuned to control the position, polarity, emission energy, and hybridization strength of the moire excitons. We predict that alternating electric fields could modulate the dipole moments of hybridized moire excitons and suppress their diffusion in Moire lattices.

preprint2020arXiv

UAV Secure Downlink NOMA Transmissions: A Secure Users Oriented Perspective

This paper proposes a secure downlink multi-user transmission scheme enabled by a flexible unmanned aerial vehicle base station (UAV-BS) and non-orthogonal multiple access (NOMA). According to their heterogeneous service requirements, multiple legitimate users are categorized as security-required users (SUs) and quality of service (QoS)-required users (QUs), while these QUs can potentially act as internal eavesdroppers which are curious about the secrecy transmissions of SUs. In such a context, our goal is to maximize the achievable minimum secrecy rate among SUs through the joint optimization of user scheduling, power allocation, and trajectory design, subject to the QoS requirements of QUs and the mobility constraint of UAV-BS. Due to the non-convexity of the problem, an efficient iterative algorithm is firstly proposed, based on the alternative optimization (AO) and successive convex approximation (SCA) methods and along with a penalty-based algorithm to deal with the introduced binary integer variables, to obtain a sub-optimal solution. Then, we propose an SUs-oriented low-complexity algorithm by taking advantage of the inherent characteristics of the optimization problem, which can efficiently reduce the computational complexity and can act as a reasonable initial solution for the previous iterative algorithm to achieve better performance. Finally, the superiority of our proposed scheme compared with the conventional orthogonal multiple access (OMA) one is validated by numerical simulation results.

preprint2020arXiv

Unifying Specialist Image Embedding into Universal Image Embedding

Deep image embedding provides a way to measure the semantic similarity of two images. It plays a central role in many applications such as image search, face verification, and zero-shot learning. It is desirable to have a universal deep embedding model applicable to various domains of images. However, existing methods mainly rely on training specialist embedding models each of which is applicable to images from a single domain. In this paper, we study an important but unexplored task: how to train a single universal image embedding model to match the performance of several specialists on each specialist&#39;s domain. Simply fusing the training data from multiple domains cannot solve this problem because some domains become overfitted sooner when trained together using existing methods. Therefore, we propose to distill the knowledge in multiple specialists into a universal embedding to solve this problem. In contrast to existing embedding distillation methods that distill the absolute distances between images, we transform the absolute distances between images into a probabilistic distribution and minimize the KL-divergence between the distributions of the specialists and the universal embedding. Using several public datasets, we validate that our proposed method accomplishes the goal of universal image embedding.

preprint2019arXiv

A geometric criterion for the existence of chaos based on periodic orbits in continuous-time autonomous systems

A new geometric criterion is derived for the existence of chaos in continuous-time autonomous systems in three-dimensional Euclidean spaces, where a type of Smale horseshoe in a subshift of finite type exists, but the intersection of stable and unstable manifolds of two points on a hyperbolic periodic orbit does not imply the existence of a Smale horseshoe of the same type on cross-sections of these two points. This criterion is based on the existence of a hyperbolic periodic orbit, differing from the classical equilibrium-based Shilnikov criterion and the condition of transversal homoclinic or heteroclinic orbits of Poincaré maps.

preprint2019arXiv

Generation and controllable switching of superradiant and subradiant states in a 10-qubit superconducting circuit

Superradiance and subradiance concerning enhanced and inhibited collective radiation of an ensemble of atoms have been a central topic in quantum optics. However, precise generation and control of these states remain challenging. Here we deterministically generate up to 10-qubit superradiant and 8-qubit subradiant states, each containing a single excitation, in a superconducting quantum circuit with multiple qubits interconnected by a cavity resonator. The $\sqrt{N}$-scaling enhancement of the coupling strength between the superradiant states and the cavity is validated. By applying appropriate phase gate on each qubit, we are able to switch the single collective excitation between superradiant and subradiant states. While the subradiant states containing a single excitation are forbidden from emitting photons, we demonstrate that they can still absorb photons from the resonator. However, for even number of qubits, a singlet state with half of the qubits being excited can neither emit nor absorb photons, which is verified with 4 qubits. This study is a step forward in coherent control of collective radiation and has promising applications in quantum information processing.

preprint2019arXiv

SCMA based resource management of D2D communications for maximum sum-revenue

The device-to-device (D2D) communication is one of the promising technologies of the future Internet of Things (IoT), but its security-related issues remain challenging. The block-chain is considered to be a secure and reliable distributed ledger, so we can treat the device user equipment (D-UE) request for the reusing resources of cellular user equipment (C-UE) as a transaction and put it into a transaction pool, then package the record into the block-chain. In this paper, we study the D2D communication resource allocation scheme based on sparse code multiple access (SCMA). Firstly, the system&#39;s interference model and block-chain-based transaction flow are analyzed. Then we propose the optimization problem so that C-UE can get the maximum revenue by sharing its resources to D-UE. This problem is NP-hard, so we propose a heuristic algorithm based on semi-definite relaxation (SDR) programming to solve it. Finally, the performance of the proposed algorithm is verified by simulation of different system parameters.