arXiv subjects

Ziyuan Zhu

Publications and source records attributed to Ziyuan Zhu.

15 recordsLinked to original sources

arXiv2026

GRB 260310A/SN 2026fgk: Photometric and Spectroscopic Evolution of a Nearby GRB-Supernova and an Exceptionally Bright Afterglow at z=0.153

The association of broad-lined Type Ic supernovae with long-duration gamma-ray bursts (GRBs) has been known for 28 years. However, only about seventy gamma-ray burst supernovae (GRB-SNe) have been identified, of which only half have spectroscopic classifications. At $z=0.153$, GRB 260310A is the 12th spectroscopically confirmed GRB-SN discovered within 1 Gpc, offering a critical opportunity to follow one of these rare supernovae in detail. We present optical to near-infrared imaging and spectroscopy of GRB 260310A and SN 2026fgk out to 65 d after discovery. The optical afterglow is among the brightest ever observed from a GRB. Spectra obtained more than two weeks after the explosion reveal broad absorption features that securely identify SN 2026fgk as a Type Ic-BL supernova. Modeling of the multi-wavelength ($grizJK_s$) lightcurve shows that the supernova is approximately half the luminosity ($k_\textrm{98bw}=0.4-0.6$) of the canonical GRB-SN 1998bw. We derive a nickel mass of $M_\textrm{Ni}=0.4-0.5$ $M_\odot$ with a total ejected mass of $M_\textrm{ej}\approx4-6 $ $M_\odot$ and kinetic energy $E_\textrm{K}=(3-8)\times10^{51}$ erg. The GRB exploded at an extremely large offset of 15 kpc from its host galaxy. Long-slit spectra reveal a ``bridge'' of nebular emission extending along the galaxy's disk to the GRB location, which has a sub-solar metallicity ($\sim$\,$0.4Z_\odot$), compared to a near solar metallicity for the host galaxy. This indicates that the large offset arises from the galaxy's extended light profile rather than an isolated environment.

astro-ph.HE↗

arXiv2026

EP260321a/SN 2026gzf: The Faintest Shock Breakout Associated with a Broad-Lined Supernova

The explosion of a star is first marked by the shock wave breaking out of the stellar surface, producing a burst of ultraviolet and X-ray radiation. These events are observationally rare, despite likely accompanying the majority of supernovae. Here, we report on our multi-wavelength observing campaign of the closest Einstein Probe fast X-ray transient EP260321a at $z=0.0344$. The thermal ($kT=130$ eV) X-ray emission with peak luminosity $1.0\times10^{45}$ erg s$^{-1}$ points to a shock breakout origin. We demonstrate that EP260321a is accompanied by a broad-lined Type Ic supernova, SN 2026gzf. The supernova properties, including its spectral evolution, lightcurve evolution, and expansion velocities, are all typical of the energetic stripped-envelope supernovae associated with gamma-ray bursts. However, deep X-ray upper limits obtained with the \textit{Chandra X-ray Observatory} do not detect an X-ray afterglow, and instead exclude the afterglow of known gamma-ray bursts or fast X-ray transients. If the stellar explosion launched a successful relativistic jet, we require that it had both a low Lorentz factor $Γ_0$\,$<$\,$30$ and a kinetic energy $E_\textrm{kin}$\,$<$\,$10^{49}$ erg for a stellar wind density of $A_*$\,$\gtrsim$\,$1$. We propose that EP260321a originated from a mildly relativistic, weak outflow that was choked by the progenitor star. This scenario is capable of naturally explaining its low X-ray luminosity and lack of prompt gamma-ray emission. EP260321a bridges the gap between SN 2008D and low-luminosity GRBs, suggesting a greater diversity in the physical parameters of stripped stars as they undergo terminal collapse.

astro-ph.HE↗

arXiv2026

A New Class of Geometric Analog Error Correction Codes for Crossbar Based In-Memory Computing

Analog error correction codes have been proposed for analog in-memory computing on resistive crossbars, which can accelerate vector-matrix multiplication for machine learning. Unlike traditional communication or storage channels, this setting involves a mixed noise model with small perturbations and outlier errors. A number of analog codes have been proposed for handling a single outlier, and several constructions have also been developed to address multiple outliers. However, the set of available code families remains limited, covering only a narrow range of code lengths and dimensions. In this paper, we study a recently proposed family of geometric codes capable of handling multiple outliers, and develop a geometric analysis that characterizes their m-height profiles.

cs.IT↗

arXiv2026

Physics-Informed Generative Solver: Bridging Data-Driven Priors and Conservation Laws for Stable Spatiotemporal Field Reconstruction

Reconstructing continuous physical fields from sparse measurements is a central inverse problem, but data-driven generative models can produce states that violate governing dynamics. We introduce a physics-informed generative solver that separates stable prior learning from inference-time enforcement of conservation laws. Martingale-Regularized Score Matching regularizes score pretraining with a Score Fokker-Planck constraint, yielding a dynamically stable prior. Physics-Informed Implicit Score Sampling then guides denoising trajectories by gradients of physical residuals, projecting samples toward admissible manifolds without retraining. In acoustics, the method co-generates pressure and particle velocity from sparse sensors, enabling dense virtual arrays that suppress spatial aliasing. The same framework generalizes to real-world ERA5 meteorological fields under extreme sparsity. Together, this work establishes a rigorous and generalizable paradigm for solving high-dimensional inverse problems, bridging the gap between generative artificial intelligence and first-principles science.

cs.LG↗

arXiv2026

On the Height Profile of Analog Error-Correcting Codes

In recent work, it has been shown that maintaining reliability in analog vector--matrix multipliers can be modeled as the following coding problem. Vectors in $\mathbb{R}^k$ are encoded into codewords of a linear $[n,k,d]$ code $C$ over $\mathbb{R}$. For prescribed positive reals $δ< Δ$, additive errors of magnitude at most $δ$ are tolerable and need no handling, yet outlying errors of magnitude greater than $Δ$ are to be located or detected. The trade-off between the ratio $Δ/δ$ and the number of outlying errors that can be handled is determined by the height profile of $C$; as such, the height profile provides a finer description of the error handling capability of $C$, compared to the minimum distance $d$, which only determines the number of correctable errors. This work contains a further study of the notion of the height profile. Several characterizations of the height profile are presented, thereby yielding methods for computing it. The starting point is formulating this computation as an optimization problem that is solved by a set of linear programs. This, in turn, leads to a combinatorial characterization of the height profile as a maximum (or max--min) over a certain finite set of codewords of $C$. Moreover, this characterization is shown to have a simple geometric interpretation when the columns of the generator matrix of $C$ all have the same $L_2$ norm. Through examples of several code families, it is demonstrated how the results herein can be used to compute the height profile explicitly.

cs.IT↗

arXiv2026

Partially Polarized Polar Codes: A New Design for 6G Control Channels

We introduce a new family of polar-like codes, called Partially Polarized Polar (PPP) codes. PPP codes are constructed from conventional polar codes by selectively pruning polarization kernels, thereby modifying the synthesized bit-channel capacities to ensure a guaranteed number of non-frozen bits available early in decoding. These early-access information bits enable more effective early termination, which is particularly valuable for blind decoding in downlink control channels, where user equipment (UE) must process multiple candidates, many of which carry no valid control information. Our results show that PPP codes offer substantial performance gains over conventional polar codes, particularly at larger block lengths where hardware limitations restrict straightforward scaling. Compared with existing methods such as aggregation or segmentation, PPP codes achieve higher efficiency without the need for additional hardware support. Finally, we propose several frozen-bitmap design strategies tailored to PPP codes.

cs.IT↗

arXiv2025

EPSO: A Caching-Based Efficient Superoptimizer for BPF Bytecode

Extended Berkeley Packet Filter (eBPF) allows developers to extend Linux kernel functionality without modifying its source code. To ensure system safety, an in-kernel safety checker, the verifier, enforces strict safety constraints (for example, a limited program size) on eBPF programs loaded into the kernel. These constraints, combined with eBPF's performance-critical use cases, make effective optimization essential. However, existing compilers (such as Clang) offer limited optimization support, and many semantics-preserving transformations are rejected by the verifier, which makes handcrafted optimization rule design both challenging and limited in effectiveness. Superoptimization overcomes the limitations of rule-based methods by automatically discovering optimal transformations, but its high computational cost limits scalability. To address this, we propose EPSO, a caching-based superoptimizer that discovers rewrite rules via offline superoptimization and reuses them to achieve high-quality optimizations with minimal runtime overhead. We evaluate EPSO on benchmarks from the Linux kernel and several eBPF-based projects, including Cilium, Katran, hXDP, Sysdig, Tetragon, and Tracee. EPSO discovers 795 rewrite rules and achieves up to 68.87 percent (average 24.37 percent) reduction in program size compared to Clang's output, outperforming the state-of-the-art BPF optimizer K2 on all benchmarks and Merlin on 92.68 percent of them. Additionally, EPSO reduces program runtime by an average of 6.60 percent, improving throughput and lowering latency in network applications.

cs.SE↗

arXiv2024

Stopping Set Analysis for Concatenated Polar Code Architectures

This paper investigates properties of concatenated polar codes and their potential applications. We start with reviewing previous work on stopping set analysis for conventional polar codes, which we extend in this paper to concatenated architectures. Specifically, we present a stopping set analysis for the factor graph of concatenated polar codes, deriving an upper bound on the size of the minimum stopping set. To achieve this bound, we propose new bounds on the size of the minimum stopping set for conventional polar code factor graphs. The tightness of these proposed bounds is investigated empirically and analytically. We show that, in some special cases, the exact value of the minimum stopping set can be determined with a time complexity of $O(N)$, where $N$ is the codeword length. The stopping set analysis motivates a novel construction method for concatenated polar codes. This method is used to design outer polar codes for two previously proposed concatenated polar code architectures: augmented polar codes and local-global polar codes. Simulation results demonstrate the advantage of the proposed codes over previously proposed constructions based on density evolution (DE).

cs.IT↗

arXiv2024

Dust-Obscured Galaxies in the XMM-SERVS Fields: Selection, Multiwavelength Characterization, and Physical Nature

Dust-obscured galaxies (DOGs) are enshrouded by dust, and many are believed to host accreting supermassive black holes (SMBHs), which makes them unique objects for probing the coevolution of galaxies and SMBHs. We select and characterize DOGs in the $13\,deg^2$ XMM-Spitzer Extragalactic Representative Volume Survey (XMM-SERVS), leveraging the superb multiwavelength data from X-rays to radio. We select 3738 DOGs at $z\approx1.6-2.1$ in XMM-SERVS, while maintaining good data quality without introducing significant bias. This represents the largest DOG sample with thorough multiwavelength source characterization. Spectral energy distribution (SED) modeling shows DOGs are a heterogeneous population consisting of both normal galaxies and active galactic nuclei (AGNs). Our DOGs are massive ($\log M_\bigstar/M_\odot\approx10.7-11.3$), 174 are detected in X-rays, and they are generally radio-quiet systems. X-ray detected DOGs are luminous and are moderately to heavily obscured in X-rays. Stacking analyses for the X-ray undetected DOGs show highly significant average detections. Critically, we compare DOGs with matched galaxy populations. DOGs have similar AGN fractions compared with typical galaxy populations. X-ray detected DOGs have higher $M_\bigstar$ and higher X-ray obscuration, but they are not more star-forming than typical X-ray AGNs. The results potentially challenge the relevance of the merger-driven galaxy-SMBH coevolution framework for X-ray detected DOGs.

astro-ph.GA↗

arXiv2024

The bicoherence analysis of type C quasi-periodic oscillations in Swift J1727.8-1613

We present the results of bicoherence analysis for Swift J1727.8-1613 during its 2023 outburst, using data from Insight-HXMT. Our analysis focused on observations with quasi-periodic oscillations (QPOs) of frequencies greater than 1 Hz, revealing that all of them belong to type C QPOs. We found a strong correlation between the QPO frequency and the hardness ratio, as well as a linear relationship between the QPO RMS and the hardness ratio. The bicoherence analysis revealed a transition from a "web" pattern to a "hypotenuse" pattern in the LE and HE energy bands. In the bicoherence patterns, there are correlations between horizontal and vertical bicoherence at $f_1=f_2=f_{\rm QPO}$ with count rates. The diagonal structure at $f_1+f_2=f_{\rm QPO}$ becomes more prominent with increasing energy. Additionally, we discovered a new bicoherence pattern in the medium energy band from 10 -- 20 keV, the diagonal structure at $f_1+f_2=f_{\rm har}$ is prominent only in this energy band, which we refer to as the "parallel" pattern. The bicoherence analysis indicates that the source is likely a low-inclination source.

astro-ph.HE↗

arXiv2024

Outer Code Designs for Augmented and Local-Global Polar Code Architectures

In this paper, we introduce two novel methods to design outer polar codes for two previously proposed concatenated polar code architectures: augmented polar codes and local-global polar codes. These methods include a stopping set (SS) construction and a nonstationary density evolution (NDE) construction. Simulation results demonstrate the advantage of these methods over previously proposed constructions based on density evolution (DE) and LLR evolution.

cs.IT↗

arXiv2024

The bicoherence study of quasi-periodic oscillations in MAXI J1535-571

Bicoherence is a way to measure the phase coupling of triplets of Fourier frequencies. We use this method to analyze quasi-periodic oscillations (QPOs) in the black hole X-ray binary MAXI J1535$-$571 during its 2017 September-October outburst. The bicoherence provides an interesting new diagnostic to uncover QPO behaviour and the relationships between QPO harmonics and broadband noise. The bicoherence pattern of type-C QPOs starts as a 'web' pattern and changes to a 'hypotenuse' pattern after the presence of type-B QPOs, indicating that MAXI J1535$-$571 is a low-inclination source. The intensity of bicoherence also exhibits variations across different energy bands. We try to explain the bicoherence results in the scenario of a dual-corona geometry.

astro-ph.HE↗

arXiv2023

Polar Codes with Local-Global Decoding

In this paper, we investigate a coupled polar code architecture that supports both local and global decoding. This local-global construction is motivated by practical applications in data storage and transmission where reduced-latency recovery of sub-blocks of the coded information is required. Local decoding allows random access to sub-blocks of the full code block. When local decoding performance is insufficient, global decoding provides improved data reliability. The coupling scheme incorporates a systematic outer polar code and a partitioned mapping of the outer codeword to semipolarized bit-channels of the inner polar codes. Error rate simulation results are presented for 2 and 4 sub-blocks. Design issues affecting the trade-off between local and global decoding performance are also discussed.

cs.IT↗

arXiv2022

Attack detection based on machine learning algorithms for different variants of Spectre attacks and different Meltdown attack implementations

To improve the overall performance of processors, computer architects use various performance optimization techniques in modern processors, such as speculative execution, branch prediction, and chaotic execution. Both now and in the future, these optimization techniques are critical for improving the execution speed of processor instructions. However, researchers have discovered that these techniques introduce hidden inherent security flaws, such as meltdown and ghost attacks in recent years. They exploit techniques such as chaotic execution or speculative execution combined with cache-based side-channel attacks to leak protected data. The impact of these vulnerabilities is enormous because they are prevalent in existing or future processors. However, until today, meltdown and ghost have not been effectively addressed, but instead, multiple attack variants and different attack implementations have evolved from them. This paper proposes to optimize four different hardware performance events through feature selection and use machine learning algorithms to build a real-time detection mechanism for Spectre v1,v2,v4, and different implementations of meltdown attacks, ultimately achieving an accuracy rate of over 99\%. In order to verify the practicality of the attack detection model, this paper is tested with a variety of benign programs and different implementations of Spectre attacks different from the modeling process, and the absolute accuracy also exceeds 99\%, showing that this paper can cope with different attack variants and different implementations of the same attack that may occur daily.

cs.CR↗

arXiv2019

DDM: A Demand-based Dynamic Mitigation for SMT Transient Channels

Different from the traditional software vulnerability, the microarchitecture side channel has three characteristics: extensive influence, potent threat, and tough defense. The main reason for the micro-architecture side channel is resource sharing. There are many reasons for resource sharing, one of which is SMT (Simultaneous Multi-Threading) technology. In this paper, we define the SMT Transient Channel, which uses the transient state of shared resources between threads to steal information. To mitigate it, we designed a security demand-based dynamic mitigation (DDM) to Mitigate the SMT transient channels. The DDM writes the processes' security requirements to the CPU register sets, and the operating system calls the HLT instruction to dynamically turn on and off the hyper-threading according to the register values to avoid the side channels caused by execution resource sharing. During the implementation of the scheme, we modified the Linux kernel and used the MSR register groups of Intel processor. The evaluation results show that DDM can effectively protect against the transient side-channel attacks such as PortsMash that rely on SMT, and the performance loss of DDM is less than 8%.

cs.CR↗