arXiv subjects

Di Wu

Publications and source records attributed to Di Wu.

At least 469 records · Page 26Linked to original sources

arXiv2023

Perfect divisibility and coloring of some fork-free graphs

A $hole$ is an induced cycle of length at least four, and an odd hole is a hole of odd length. A {\em fork} is a graph obtained from $K_{1,3}$ by subdividing an edge once. An {\em odd balloon} is a graph obtained from an odd hole by identifying respectively two consecutive vertices with two leaves of $K_{1, 3}$. A {\em gem} is a graph that consists of a $P_4$ plus a vertex adjacent to all vertices of the $P_4$. A {\em butterfly} is a graph obtained from two traingles by sharing exactly one vertex. A graph $G$ is perfectly divisible if for each induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. In this paper, we show that (odd balloon, fork)-free graphs are perfectly divisible (this generalizes some results of Karthick {\em et al}). As an application, we show that $χ(G)\le\binom{ω(G)+1}{2}$ if $G$ is (fork, gem)-free or (fork, butterfly)-free.

math.CO↗

arXiv2023

On the chromatic number of some ($P_3\cup P_2$)-free graphs

A hereditary class $\cal G$ of graphs is {\em $χ$-bounded} if there is a {\em $χ$-binding function}, say $f$, such that $χ(G)\le f(ω(G))$ for every $G\in\cal G$, where $χ(G)(ω(G))$ denotes the chromatic (clique) number of $G$. It is known that for every $(P_3\cup P_2)$-free graph $G$, $χ(G)\le \frac{1}{6}ω(G)(ω(G)+1)(ω(G)+2)$ \cite{BA18}, and the class of $(2K_2, 3K_1)$-free graphs does not admit a linear $χ$-binding function\cite{BBS19}. In this paper, we prove that (\romannumeral 1) $χ(G)\le2ω(G)$ if $G$ is ($P_3\cup P_2$, kite)-free, (\romannumeral 2) $χ(G)\leω^2(G)$ if $G$ is ($P_3\cup P_2$, hammer)-free, (\romannumeral 3) $χ(G)\le\frac{3ω^2(G)+ω(G)}{2}$ if $G$ is ($P_3\cup P_2, C_5$)-free. Furthermore, we also discuss $χ$-binding functions for $(P_3\cup P_2, K_4)$-free graphs.

math.CO↗

arXiv2023

A tight linear chromatic bound for ($P_3\cup P_2, W_4$)-free graphs

For two vertex disjoint graphs $H$ and $F$, we use $H\cup F$ to denote the graph with vertex set $V(H)\cup V(F)$ and edge set $E(H)\cup E(F)$, and use $H+F$ to denote the graph with vertex set $V(H)\cup V(F)$ and edge set $E(H)\cup E(F)\cup\{xy\;|\; x\in V(H), y\in V(F)$$\}$. A $W_4$ is the graph $K_1+C_4$. In this paper, we prove that $χ(G)\le 2ω(G)$ if $G$ is a ($P_3\cup P_2, W_4$)-free graph. This bound is tight when $ω=2$ and $3$, and improves the main result of Wang and Zhang. Also, this bound partially generalizes some results of Prashant {\em et al.}.

math.CO↗

arXiv2023

Spatial Self-Distillation for Object Detection with Inaccurate Bounding Boxes

Object detection via inaccurate bounding boxes supervision has boosted a broad interest due to the expensive high-quality annotation data or the occasional inevitability of low annotation quality (\eg tiny objects). The previous works usually utilize multiple instance learning (MIL), which highly depends on category information, to select and refine a low-quality box. Those methods suffer from object drift, group prediction and part domination problems without exploring spatial information. In this paper, we heuristically propose a \textbf{Spatial Self-Distillation based Object Detector (SSD-Det)} to mine spatial information to refine the inaccurate box in a self-distillation fashion. SSD-Det utilizes a Spatial Position Self-Distillation \textbf{(SPSD)} module to exploit spatial information and an interactive structure to combine spatial information and category information, thus constructing a high-quality proposal bag. To further improve the selection procedure, a Spatial Identity Self-Distillation \textbf{(SISD)} module is introduced in SSD-Det to obtain spatial confidence to help select the best proposals. Experiments on MS-COCO and VOC datasets with noisy box annotation verify our method's effectiveness and achieve state-of-the-art performance. The code is available at https://github.com/ucas-vg/PointTinyBenchmark/tree/SSD-Det.

cs.CV↗

arXiv2023

Optimal chromatic bound for ($P_3\cup P_2$, house)-free graphs

Let $G$ and $H$ be two vertex disjoint graphs. The {\em union} $G\cup H$ is the graph with $V(G\cup H)=V(G)\cup V(H)$ and $E(G\cup H)=E(G)\cup E(H)$. We use $P_k$ to denote a {\em path} on $k$ vertices, use {\em house} to denote the complement of $P_5$. In this paper, we show that $χ(G)\le2ω(G)$ if $G$ is ($P_3\cup P_2$, house)-free. Moreover, this bound is optimal when $ω(G)\ge2$.

math.CO↗

arXiv2023

Virtual histological staining of unlabeled autopsy tissue

Histological examination is a crucial step in an autopsy; however, the traditional histochemical staining of post-mortem samples faces multiple challenges, including the inferior staining quality due to autolysis caused by delayed fixation of cadaver tissue, as well as the resource-intensive nature of chemical staining procedures covering large tissue areas, which demand substantial labor, cost, and time. These challenges can become more pronounced during global health crises when the availability of histopathology services is limited, resulting in further delays in tissue fixation and more severe staining artifacts. Here, we report the first demonstration of virtual staining of autopsy tissue and show that a trained neural network can rapidly transform autofluorescence images of label-free autopsy tissue sections into brightfield equivalent images that match hematoxylin and eosin (H&E) stained versions of the same samples, eliminating autolysis-induced severe staining artifacts inherent in traditional histochemical staining of autopsied tissue. Our virtual H&E model was trained using >0.7 TB of image data and a data-efficient collaboration scheme that integrates the virtual staining network with an image registration network. The trained model effectively accentuated nuclear, cytoplasmic and extracellular features in new autopsy tissue samples that experienced severe autolysis, such as COVID-19 samples never seen before, where the traditional histochemical staining failed to provide consistent staining quality. This virtual autopsy staining technique can also be extended to necrotic tissue, and can rapidly and cost-effectively generate artifact-free H&E stains despite severe autolysis and cell death, also reducing labor, cost and infrastructure requirements associated with the standard histochemical staining.

physics.med-ph↗

arXiv2023

Interfacial Resonance States-Induced Negative Tunneling Magneto-resistance in Orthogonally-Magnetized CoFeB/MgO/CoFeB

Magnetic tunneling junctions (MTJs) are essential for non-volatile magneto-resistive random access memory (MRAM) applications. Here, we report the observation of a large negative tunneling magneto-resistance (TMR) in the CoFeB/MgO/CoFeB system with an orthogonally-magnetized configuration. Through the thickness modulation of the MgO barrier, the negative TMR component can be enhanced up to 20% under a negative voltage bias. Moreover, the tunnel anisotropic magneto-resistance measurements unveil that the negative TMR component likely arises from the interfacial resonance states (IRS) in the minority band of the bottom ferromagnetic layer. Complementary first principle calculations further quantify the IRS location and strength with respect to the Fermi level position. Our work not only confirm the vital role of IRS in the electrical transport of MTJ, but also provide valuable insights for the design of new-generation voltage-controlled MRAM and related spintronic applications.

physics.app-ph↗

arXiv2023

Coloring_of_some_crown-free_graphs

Let $G$ and $H$ be two vertex disjoint graphs. The {\em union} $G\cup H$ is the graph with $V(G\cup H)=V(G)\cup (H)$ and $E(G\cup H)=E(G)\cup E(H)$. The {\em join} $G+H$ is the graph with $V(G+H)=V(G)+V(H)$ and $E(G+H)=E(G)\cup E(H)\cup\{xy\;|\; x\in V(G), y\in V(H)$$\}$. We use $P_k$ to denote a {\em path} on $k$ vertices, use {\em fork} to denote the graph obtained from $K_{1,3}$ by subdividing an edge once, and use {\em crown} to denote the graph $K_1+K_{1,3}$. In this paper, we show that (\romannumeral 1) $χ(G)\le\frac{3}{2}(ω^2(G)-ω(G))$ if $G$ is (crown, $P_5$)-free, (\romannumeral 2) $χ(G)\le\frac{1}{2}(ω^2(G)+ω(G))$ if $G$ is (crown, fork)-free, and (\romannumeral 3) $χ(G)\le\frac{1}{2}ω^2(G)+\frac{3}{2}ω(G)+1$ if $G$ is (crown, $P_3\cup P_2$)-free.

math.CO↗

arXiv2023

Unleashing the Potential of LLMs for Quantum Computing: A Study in Quantum Architecture Design

Large Language Models (LLMs) contribute significantly to the development of conversational AI and has great potentials to assist the scientific research in various areas. This paper attempts to address the following questions: What opportunities do the current generation of generative pre-trained transformers (GPTs) offer for the developments of noisy intermediate-scale quantum (NISQ) technologies? Additionally, what potentials does the forthcoming generation of GPTs possess to push the frontier of research in fault-tolerant quantum computing (FTQC)? In this paper, we implement a QGAS model, which can rapidly propose promising ansatz architectures and evaluate them with application benchmarks including quantum chemistry and quantum finance tasks. Our results demonstrate that after a limited number of prompt guidelines and iterations, we can obtain a high-performance ansatz which is able to produce comparable results that are achieved by state-of-the-art quantum architecture search methods. This study provides a simple overview of GPT's capabilities in supporting quantum computing research while highlighting the limitations of the current GPT at the same time. Additionally, we discuss futuristic applications for LLM in quantum research.

quant-ph↗

arXiv2023

DOA Estimation Using Massive Receive MIMO: Basic Principle and Key Techniques

As massive multiple-input multiple-output (MIMO) becomes popular, direction of arrival (DOA) measurement has been made a real renaissance due to the high-resolution achieved. Thus, there is no doubt about DOA estimation using massive MIMO. The purpose of this paper is to describe its basic principles and key techniques, to present the performance analysis, and to appreciate its engineering applications. It is anticipated that there are still many challenges in DOA estimation using massive receive MIMO, such as high circuit cost, high energy consumption and high complexity of the algorithm implementation. New researches and breakthroughs are illustrated to deal with those problems. Then, a new architecture, hybrid analog and digital (HAD) massive receive MIMO with low-resolution ADCs, is presented to strike a good balance among circuit cost, complexity and performance. Then, a novel three-dimensional (3D) angle of arrival (AOA) localization method based on geometrical center is proposed to compute the position of a passive emitter using single base station equipped with an ultra-massive MIMO system. And, it can achieve the Cramer-Rao low bound (CRLB). Here, the performance loss is also analyzed to quantify the minimum number of bits. DOA estimation will play a key role in lots of applications, such as directional modulation, beamforming tracking and alignment for 6G.

cs.IT↗

arXiv2023

FedDWA: Personalized Federated Learning with Dynamic Weight Adjustment

Different from conventional federated learning, personalized federated learning (PFL) is able to train a customized model for each individual client according to its unique requirement. The mainstream approach is to adopt a kind of weighted aggregation method to generate personalized models, in which weights are determined by the loss value or model parameters among different clients. However, such kinds of methods require clients to download others' models. It not only sheer increases communication traffic but also potentially infringes data privacy. In this paper, we propose a new PFL algorithm called \emph{FedDWA (Federated Learning with Dynamic Weight Adjustment)} to address the above problem, which leverages the parameter server (PS) to compute personalized aggregation weights based on collected models from clients. In this way, FedDWA can capture similarities between clients with much less communication overhead. More specifically, we formulate the PFL problem as an optimization problem by minimizing the distance between personalized models and guidance models, so as to customize aggregation weights for each client. Guidance models are obtained by the local one-step ahead adaptation on individual clients. Finally, we conduct extensive experiments using five real datasets and the results demonstrate that FedDWA can significantly reduce the communication traffic and achieve much higher model accuracy than the state-of-the-art approaches.

cs.LG↗

arXiv2023

Consistent thermodynamics and topological classes for the four-dimensional Lorentzian charged Taub-NUT spacetimes

In this paper, we derive the consistent thermodynamics of the four-dimensional Lorentzian charged Reissner-Nordström-NUT (RN-NUT), Kerr-Newman-NUT (KN-NUT), and RN-NUT-AdS spacetimes in the framework of the ($ψ-\mathcal{N}$)-pair formalism, and then investigate their topological numbers by using the uniformly modified form of the generalized off-shell Helmholtz free energy. We find that these solutions can be included into one of three categories of those well-known black hole solutions, which implies that these spacetimes should be viewed as generic black holes from the perspective of the topological thermodynamic defects. In addition, we demonstrate that although the existence of the NUT charge parameter seems to have no impact on the topological number of the charged asymptotically locally flat spacetimes, it has a remarkable effect on the topological number of the charged asymptotically locally AdS spacetime.

gr-qc↗

arXiv2023

Relightable Neural Human Assets from Multi-view Gradient Illuminations

Human modeling and relighting are two fundamental problems in computer vision and graphics, where high-quality datasets can largely facilitate related research. However, most existing human datasets only provide multi-view human images captured under the same illumination. Although valuable for modeling tasks, they are not readily used in relighting problems. To promote research in both fields, in this paper, we present UltraStage, a new 3D human dataset that contains more than 2,000 high-quality human assets captured under both multi-view and multi-illumination settings. Specifically, for each example, we provide 32 surrounding views illuminated with one white light and two gradient illuminations. In addition to regular multi-view images, gradient illuminations help recover detailed surface normal and spatially-varying material maps, enabling various relighting applications. Inspired by recent advances in neural representation, we further interpret each example into a neural human asset which allows novel view synthesis under arbitrary lighting conditions. We show our neural human assets can achieve extremely high capture performance and are capable of representing fine details such as facial wrinkles and cloth folds. We also validate UltraStage in single image relighting tasks, training neural networks with virtual relighted data from neural assets and demonstrating realistic rendering improvements over prior arts. UltraStage will be publicly available to the community to stimulate significant future developments in various human modeling and rendering tasks. The dataset is available at https://miaoing.github.io/RNHA.

cs.CV↗

arXiv2023

An Error Correction Mid-term Electricity Load Forecasting Model Based on Seasonal Decomposition

Mid-term electricity load forecasting (LF) plays a critical role in power system planning and operation. To address the issue of error accumulation and transfer during the operation of existing LF models, a novel model called error correction based LF (ECLF) is proposed in this paper, which is designed to provide more accurate and stable LF. Firstly, time series analysis and feature engineering act on the original data to decompose load data into three components and extract relevant features. Then, based on the idea of stacking ensemble, long short-term memory is employed as an error correction module to forecast the components separately, and the forecast results are treated as new features to be fed into extreme gradient boosting for the second-step forecasting. Finally, the component sub-series forecast results are reconstructed to obtain the final LF results. The proposed model is evaluated on real-world electricity load data from two cities in China, and the experimental results demonstrate its superior performance compared to the other benchmark models.

cs.LG↗

arXiv2023

Asymptotic Performance Analysis of Large-Scale Active IRS-Aided Wireless Network

In this paper, the dominant factor affecting the performance of active intelligent reflecting surface (IRS) aided wireless communication networks in Rayleigh fading channel, namely the average signal-to-noise ratio (SNR) $γ_0$ at IRS, is studied. Making use of the weak law of large numbers, its simple asymptotic expression is derived as the number $N$ of IRS elements goes to medium-scale and large-scale. When $N$ tends to large-scale, the asymptotic received SNR at user is proved to be a linear increasing function of a product of $γ_0$ and $N$. Subsequently, when the BS transmit power is fixed, there exists an optimal limited reflective power at IRS. At this point, more IRS reflect power will degrade the SNR performance. Additionally, under the total power sum constraint of the BS transmit power and the power reflected by the IRS, an optimal power allocation (PA) strategy is derived and shown to achieve 0.83 bit rate gain over equal PA. Finally, an IRS with finite phase shifters being taken into account, generates phase quantization errors, and further leads to a degradation of receive performance. The corresponding closed-form performance loss expressions for user's asymptotic SNR, achievable rate (AR), and bit error rate (BER) are derived for active IRS. Numerical simulation results show that a 3-bit discrete phase shifter is required to achieve a trivial performance loss for a large-scale active IRS.

eess.SP↗

arXiv2023

Architecture-Agnostic Masked Image Modeling -- From ViT back to CNN

Masked image modeling, an emerging self-supervised pre-training method, has shown impressive success across numerous downstream vision tasks with Vision transformers. Its underlying idea is simple: a portion of the input image is masked out and then reconstructed via a pre-text task. However, the working principle behind MIM is not well explained, and previous studies insist that MIM primarily works for the Transformer family but is incompatible with CNNs. In this work, we observe that MIM essentially teaches the model to learn better middle-order interactions among patches for more generalized feature extraction. We then propose an Architecture-Agnostic Masked Image Modeling framework (A$^2$MIM), which is compatible with both Transformers and CNNs in a unified way. Extensive experiments on popular benchmarks show that A$^2$MIM learns better representations without explicit design and endows the backbone model with the stronger capability to transfer to various downstream tasks.

cs.CV↗

arXiv2023

Lightweight Learner for Shared Knowledge Lifelong Learning

In Lifelong Learning (LL), agents continually learn as they encounter new conditions and tasks. Most current LL is limited to a single agent that learns tasks sequentially. Dedicated LL machinery is then deployed to mitigate the forgetting of old tasks as new tasks are learned. This is inherently slow. We propose a new Shared Knowledge Lifelong Learning (SKILL) challenge, which deploys a decentralized population of LL agents that each sequentially learn different tasks, with all agents operating independently and in parallel. After learning their respective tasks, agents share and consolidate their knowledge over a decentralized communication network, so that, in the end, all agents can master all tasks. We present one solution to SKILL which uses Lightweight Lifelong Learning (LLL) agents, where the goal is to facilitate efficient sharing by minimizing the fraction of the agent that is specialized for any given task. Each LLL agent thus consists of a common task-agnostic immutable part, where most parameters are, and individual task-specific modules that contain fewer parameters but are adapted to each task. Agents share their task-specific modules, plus summary information ("task anchors") representing their tasks in the common task-agnostic latent space of all agents. Receiving agents register each received task-specific module using the corresponding anchor. Thus, every agent improves its ability to solve new tasks each time new task-specific modules and anchors are received. On a new, very challenging SKILL-102 dataset with 102 image classification tasks (5,033 classes in total, 2,041,225 training, 243,464 validation, and 243,464 test images), we achieve much higher (and SOTA) accuracy over 8 LL baselines, while also achieving near perfect parallelization. Code and data can be found at https://github.com/gyhandy/Shared-Knowledge-Lifelong-Learning

cs.LG↗

arXiv2023

Boosting Discriminative Visual Representation Learning with Scenario-Agnostic Mixup

Mixup is a well-known data-dependent augmentation technique for DNNs, consisting of two sub-tasks: mixup generation and classification. However, the recent dominant online training method confines mixup to supervised learning (SL), and the objective of the generation sub-task is limited to selected sample pairs instead of the whole data manifold, which might cause trivial solutions. To overcome such limitations, we comprehensively study the objective of mixup generation and propose \textbf{S}cenario-\textbf{A}gnostic \textbf{Mix}up (SAMix) for both SL and Self-supervised Learning (SSL) scenarios. Specifically, we hypothesize and verify the objective function of mixup generation as optimizing local smoothness between two mixed classes subject to global discrimination from other classes. Accordingly, we propose $η$-balanced mixup loss for complementary learning of the two sub-objectives. Meanwhile, a label-free generation sub-network is designed, which effectively provides non-trivial mixup samples and improves transferable abilities. Moreover, to reduce the computational cost of online training, we further introduce a pre-trained version, SAMix$^\mathcal{P}$, achieving more favorable efficiency and generalizability. Extensive experiments on nine SL and SSL benchmarks demonstrate the consistent superiority and versatility of SAMix compared with existing methods.

cs.CV↗