SearcharxivSearch

arXiv subjects

Wei Yan

Publications and source records attributed to Wei Yan.

At least 19 recordsLinked to original sources

TDDM-Melatt: A Decoupled Memory and Diffusion Framework for Generalizable Encrypted Traffic Classification

The widespread adoption of encrypted traffic poses severe challenges to current security situational awareness systems based on network traffic monitoring. In existing dataset-driven training and testing studies, limitations such as shortcut learning induced by spurious feature correlations and sample imbalance caused by the long-tail distribution of real-world traffic result in weak generalization of traffic identification performance to real-world network traffic. To address these limitations, we propose TDDM-Melatt, a disentangled memory-based traffic classification framework with diffusion-based data augmentation. First, we design Melatt, a memory-decoupled traffic representation model, which employs Competitive Gating Long Short-Term Memory (CG-LSTM) to construct the encoder and decoder. We design a spurious-correlation-free pre-training and inference paradigm, employing strict topology anonymization and a frozen pre-trained encoder strategy to cut off the model's learning pathways for spurious features. During inference, classification is performed efficiently by a downstream classifier on the frozen representations. Second, we propose a Traffic Denoising Diffusion Model (TDDM) tailored to the characteristics of traffic data. Extensive experiments are conducted on 4 representative public benchmark datasets. Under strict flow-level splitting and anonymization, TDDM-Melatt outperforms 6 basic classification models and 6 SOTA representation learning models. The proposed method provides a new and effective technical pathway for encrypted traffic classification in real-world network environments.

cs.LG

Almost sure spatial decay and almost sure nonlinear smoothing of some stochastic dispersive equations

In this paper, we consider the almost sure nonlinear smoothing, the almost sure spatial decay and the almost sure uniform convergence of the stochastic mKdV equation and the stochastic cubic KdV-Benjamin-Ono equation. Firstly, for initial data $g\in H^{s}(\mathbb{R})(s\geq\frac{1}{4})$ and $\Phi_{2}\in L_{2}^{0,s}$, we prove the local well-posedness for the stochastic cubic KdV-Benjamin-Ono equation. Secondly, we establish the almost sure nonlinear smoothing of the stochastic mKdV equation and the stochastic cubic KdV-Benjamin-Ono equation. Finally, by using the almost sure nonlinear smoothing, we obtain the almost sure spatial decay and the almost sure uniform convergence of the integral term in the pathwise solutions to the stochastic mKdV equation and the stochastic cubic KdV-Benjamin-Ono equation. More precisely, we have the following results: for the stochastic mKdV equation, let $s>\frac{1}{3}$, $f\in H^{s}(\mathbb{R})$ and $\Phi_{1}\in L_{2}^{0,s}$. Then, the local pathwise solution $u$ satisfies \begin{eqnarray*} &&\mathbb{P}\Big(\Big\{\omega: \lim_{t\rightarrow0}\Big\|u-U(t)f-\int_{0}^{t}U(t-s)\Phi_{1}dW(s)\Big\|_{L_{x}^{\infty}}=0\Big\}\Big)=1,\\ &&\mathbb{P}\Big(\Big\{\omega: \forall t\in[0,T_{\omega}], \lim_{|x|\rightarrow\infty}\Big(u-U(t)f-\int_{0}^{t}U(t-s)\Phi_{1}dW(s)\Big)=0\Big\}\Big)=1. \end{eqnarray*} For the stochastic cubic KdV-Benjamin-Ono equation, let $s>\frac{1}{3}$, $g\in H^{s}(\mathbb{R})$ and $\Phi_{2}\in L_{2}^{0,s}$. Then, the local pathwise solution $v$ satisfies \begin{eqnarray*} &&\mathbb{P}\Big(\Big\{\omega: \lim_{t\rightarrow0}\Big\|v-V(t)g-\int_{0}^{t}V(t-s)\Phi_{2}dW(s)\Big\|_{L_{x}^{\infty}}=0\Big\}\Big)=1,\\ &&\mathbb{P}\Big(\Big\{\omega: \forall t\in[0,T_{\omega}],\lim_{|x|\rightarrow\infty}\Big(v-V(t)g-\int_{0}^{t}V(t-s)\Phi_{2}dW(s)\Big)=0\Big\}\Big)=1. \end{eqnarray*}

math.AP

Spatial decay and nonlinear smoothing of the sixth-order Boussinesq equation

In this paper, we study the initial value problem of the sixth-order Boussinesq equation with quadratic and cubic nonlinearities in arbitrary spatial dimensions. First, by using the Fourier restriction norm method and a high-low frequency decomposition, we establish the nonlinear smoothing for this equation, namely, the integral form of the solution to the Duhamel formulation enjoys higher regularity than its linear counterpart. Finally, by using the nonlinear smoothing, we establish the uniform convergence of the integral term and its spatial decay for each fixed $t$.

math.AP

MatPhaseBench: A Semantics-Guided Benchmark for Materials Phase Diagrams Understanding

Materials phase diagrams are a core knowledge representation in materials science, encoding temperature,composition, phase stability, and phase transformation pathways, with their full understanding requiring thermodynamic mechanism analysis and scientific reasoning. Although VLMs have shown promise in scientific image understanding, their systematic evaluation on such logically complex images demanding deep mechanistic interpretation remains limited, and phase diagrams provide a challenging testbed for this purpose. We introduce MatPhaseBench, a high-quality, high-reliability benchmark for complex scientific image understanding, focused on materials phase diagrams. MatPhaseBench is constructed from 3681 papers in classical materials science journals, from which 200 high-quality diagram-text pairs were selected, covering 189 material systems and 70 elements. The benchmark has three key features: (1)targeting complex scientific image understanding-it moves beyond simple objective tests to open-ended tasks requiring deep comprehension; (2)comprehensive image-text alignment-semantic information associated with images is fully preserved during literature mining and matching; (3) high-quality human-supervised text acquisition-all descriptions undergo strict manual validation. Experimental results show that current VLMs remain substantially behind expert-level understanding: they are largely limited to surface visual perception, lack deep reasoning grounded in thermodynamic mechanisms, have limited domain awareness and expert analytical experience, and perform poorly in distinguishing fine-grained differences in composite or multi-diagram settings. Overall, MatPhaseBench constitutes a challenging research-grade benchmark, providing a foundational platform for complex scientific image understanding, phase diagram analysis, and trustworthy multi-modal AI in science.

cs.CV

Manifold partitioning induced sequential optical reasoning and decision framework for photonic computing

Real-world data are intrinsically embedded in highly entangled manifolds, making the extraction of separable representations a central challenge for artificial intelligent (AI) systems. While optical neural networks (ONNs) offer ultrafast and energy-efficient data processing, their capacity is constrained by limited physical depth. Here, we introduce a sequential optical reasoning and decision (SORD) framework, an architecture that performs time-sequenced hierarchical inference by decomposing global tasks into coarse-to-fine steps via geometry-guided data partitioning. At each step, SORD executes small reasoning via dynamic operator selection, effectively reducing the overall task complexity without scaling up physical architecture. Experimentally, SORD enables a single-layer diffractive ONN to achieve otherwise intractable 100-class optical fiber speckle classification with 94% accuracy and a system energy efficiency of 23.3 TOPS/W. This high-fidelity recognition is further examined in a human-machine interface, featuring real-time interactive all-optical sensing. Overall, our work establishes a scalable and hardware-efficient approach to expanding the effective expressivity of compact photonic AI systems, and may advance their deployment in applications requiring real-time sensing, inference, and control.

physics.optics

Spatial decay and nonlinear smoothing of the generalized Ostrovsky equation

This paper is devoted to studying the generalized Ostrovsky equation \begin{eqnarray*} u_{t}-\beta\partial_{x}^{3}u-\gamma\partial_{x}^{-1}u+\frac{1}{k+1}(u^{k+1})_{x}=0,k\geq5 \end{eqnarray*} with $\beta<0,\gamma>0$. Firstly, by using the density theorem in the mixed Lebesgue spaces, we prove that $X_{s,b}\hookrightarrow C(\mathbb{R};H^{s}(\mathbb{R})) \hookrightarrow C(\mathbb{R};L_{x}^{\infty})$ with $s>1/2,b>1/2.$ Secondly, we present a new proof of the convergence problem of linear Ostrovsky equation, which is slightly different from the proof of Theorem 1.1 (Convergence problem of Ostrovsky equation with rough data and random data, Indiana Univ. Math. J. 71(2022), 1897-1921.) Thirdly, we investigate the pointwise convergence problem of the generalized Ostrovsky equation. Fourthly, for the solution $u$ to the Cauchy problem for the generalized Ostrovsky equation, we prove that $u=u_{1}+u_{2},t\in[-\delta,\delta]$, and $u_{2}$ possesses better regularity than $u$, where $u_{1}$ is the linear part of $u$ and $u_{2}$ is the nonlinear integral part. Fifthly, we investigate the nonlinear smoothing and the uniform convergence problem of the generalized Ostrovsky equation. Finally, when data $f$ belongs to $H^{s}(\mathbb{R})(s>\frac{1}{2}-\frac{2}{k+1},k\geq6)$ and $\lim\limits_{|x|\rightarrow{\infty}}f=0$ and $\mathscr{F}_{x}(U(t)f)\in L^{1}(\mathbb{R}),$ for $t\in [-\delta,\delta],$ we prove that $\lim\limits_{|x|\rightarrow{\infty}}u=0$. The key ingredients are high-low frequency technique, maximal function estimates related to low frequency and some Strichartz estimates which can be proved with the aid of the Stein complex interpolation Theorem.

math.AP

About Optimal Prefix Codes over Countably Infinite Alphabets: Probabilistic Intervals for the Codeword Lengths Assignment

For the discrete memoryless sources with a countably infinite alphabet, we prove that for any positive integer $k$, there exists a corresponding probability interval such that if the largest symbol probability $p_{1}$ falls in this interval, the optimal code length for the symbol equals $k$. Furthermore, for infinite sources, we provide a criterion to determine probability distributions whose optimal code length assignment follows the pattern $l^{best}_{i}=i$, for $i\ge 1$. Compared with the existing conclusion for anti-uniform sources, the proposed criterion requires less information for verification.

cs.IT

Interstellar Object 3I/ATLAS Observed from Mars by China's Tianwen-1 Spacecraft

China's Tianwen-1 Mars orbiter successfully imaged the third interstellar object, 3I/ATLAS, during its close encounter with Mars using the onboard HiRIC CMOS camera. This is China's first deep-space observation of an astronomical object. These observations constitute the first imaging of this object from a vantage point significantly out of its orbital plane, providing a unique constraint on dust dynamics. Three observing epochs between 2025 September 30 and October 3 reveal clear changes in coma and tail morphology driven by the rapidly evolving viewing geometry. Comparison with Finson-Probstein dust dynamical models indicates that the coma is dominated by large grains with solar radiation pressure parameter $\beta \approx 10^{-3} $ - $10^{-2}$, corresponding to grain sizes of a few 100s $\mu$m. The extent of the sunward coma implies dust ejection velocities of $3$ - $10$ m s$^{-1}$. Despite the morphological evolution, the azimuthally averaged surface brightness profile remains nearly unchanged through the three epochs, transitioning from a radial slope near -1 close to the nucleus to slightly steeper than -1.5 at larger cometocentric distances, consistent with steady-state dust outflow accelerated by solar radiation pressure. Photometry yields an average $Af\rho \sim (2.0\pm0.2)\times10^4$ cm and a corresponding dust mass loss rate of $\dot{M} \sim 10^3$ kg s$^{-1}$.

astro-ph.EP

The Cauchy problem for the generalized KdV equation in the Sobolev space $H^{s}(\mathbf{R})$

In this paper, we are concerned with the Cauchy problem for the generalized KdV equation with random data and rough data. Firstly, when $s\in\mathbf{R}$, by using the initial value randomization technique introduced by Shen et al. (arXiv:2111.11935) and the construction of appropriate auxiliary spaces, we establish the almost sure local well-posedness of the generalized KdV equation in $H^{s}(\mathbf{R})$, which improves Theorem 1.3 of Hwang and Kwak (Proc. Amer. Math. Soc. 146(2018), 267-280.) and Theorem 1.5 of Yan et al.(arXiv:2011.07128.). Secondly, by using the well-posedness results proved in Theorem 1.1, for $f\in H^{s}(\mathbf{R}),\, s\in\mathbf{R}$, we obtain \begin{eqnarray*} &&\mathbb{P}\left(\left\{\omega:\lim_{t\rightarrow0}\|u(t,x)-U(t)f^{\omega}(x)\|_{L_{x}^{\infty}}=0\right\}\right)=1, \end{eqnarray*} which improves Theorem 1.6 of Yan et al.(arXiv:2011.07128.). Thirdly, by using the dyadic decomposition and constructing appropriate function spaces, we establish nonlinear smoothing for the generalized KdV equation with rough data. Furthermore, by using this estimate, when data $f\in H^{s}(\mathbf{R})\cap\hat{L}^{\infty}(\mathbf{R}),\, s>\frac{1}{2}-\frac{2}{k+1},\, k\geq4$, we obtain \begin{eqnarray*} &&\lim_{|x|\rightarrow \infty}u(t,x)=0,\quad t\in[0, T]. \end{eqnarray*} In particular, for $f(x)\in H^{s}(\mathbf{R}),\,s>\frac{1}{2}-\frac{2}{k+1},\,k\geq4$, we prove \begin{eqnarray*} &&\lim_{|x|\rightarrow \infty}(u(t,x)-U(t)f(x))=0. \end{eqnarray*} Finally, by using Theorem 1.1, when $f\in H^{s}(\mathbf{R}),\, s\in\mathbf{R}$, we obtain \begin{eqnarray*} &&\mathbb{P}\left(\left\{\omega: \forall t\in I_{\omega}, \lim_{|x|\rightarrow \infty}\left(u(t,x)-U(t)f^{\omega}(x)\right)=0\right\}\right)=1. \end{eqnarray*}

math.AP

WaveFormer: Frequency-Time Decoupled Vision Modeling with Wave Equation

Vision modeling has advanced rapidly with Transformers, whose attention mechanisms capture visual dependencies but lack a principled account of how semantic information propagates spatially. We revisit this problem from a wave-based perspective: feature maps are treated as spatial signals whose evolution over an internal propagation time (aligned with network depth) is governed by an underdamped wave equation. In this formulation, spatial frequency-from low-frequency global layout to high-frequency edges and textures-is modeled explicitly, and its interaction with propagation time is controlled rather than implicitly fixed. We derive a closed-form, frequency-time decoupled solution and implement it as the Wave Propagation Operator (WPO), a lightweight module that models global interactions in O(N log N) time-far lower than attention. Building on WPO, we propose a family of WaveFormer models as drop-in replacements for standard ViTs and CNNs, achieving competitive accuracy across image classification, object detection, and semantic segmentation, while delivering up to 1.6x higher throughput and 30% fewer FLOPs than attention-based alternatives. Furthermore, our results demonstrate that wave propagation introduces a complementary modeling bias to heat-based methods, effectively capturing both global coherence and high-frequency details essential for rich visual semantics. Codes are available at: https://github.com/ZishanShu/WaveFormer.

cs.CV

Evolving k-Threshold Visual Cryptography Schemes

In evolving access structures, the number of participants is countably infinite with no predetermined upper bound. While such structures have been realized in secret sharing, research in secret image sharing has primarily focused on visual cryptography schemes (VCS). However, there exists no construction for $(k,\infty)$ VCS that applies to arbitrary $k$ values without pixel expansion currently, and the contrast requires enhancement. In this paper, we first present a formal mathematical definition of $(k,\infty)$ VCS. Then, propose a $(k,\infty)$ VCS based on random grids that works for arbitrary $k$. In addition, to further improve contrast, we develop optimized $(k,\infty)$ VCS for $k=2$ and $3$, along with contrast enhancement strategies for $k\geq 4$. Theoretical analysis and experimental results demonstrate the superiority of our proposed schemes.

cs.CR

Grouped k-threshold random grid-based visual cryptography scheme

Visual cryptography schemes (VCSs) belong to a category of secret image sharing schemes that do not require cryptographic knowledge for decryption, instead relying directly on the human visual system. Among VCSs, random grid-based VCS (RGVCS) has garnered widespread attention as it avoids pixel expansion while requiring no basic matrices design. Contrast, a core metric for RGVCS, directly determines the visual quality of recovered images, rendering its optimization a critical research objective. However, existing $(k,n)$ RGVCSs still fail to attain theoretical upper bounds on contrast, highlighting the urgent need for higher-contrast constructions. In this paper, we propose a novel sharing paradigm for RGVCS that constructs $(k,n)$-threshold schemes from arbitrary $(k,n')$-threshold schemes $(k \leq n'\leq n)$, termed \emph{$n'$-grouped $(k,n)$ RGVCS}. This paradigm establishes hierarchical contrast characteristics: participants within the same group achieve optimal recovery quality, while inter-group recovery shows a hierarchical contrast. We further introduce a new contrast calculation formula tailored to the new paradigm. Then, we propose a contrast-enhanced $(k,n)$ RGVCS by setting $n'= k$, achieving the highest contrast value documented in the existing literature. Theoretical analysis and experimental results demonstrate the superiority of our proposed scheme in terms of contrast.

cs.CR

The Construction of Near-optimal Universal Coding of Integers

The Universal Coding of Integers~(UCI) is suitable for discrete memoryless sources with unknown probability distributions and infinitely countable alphabet sizes. A UCI is a class of prefix codes for which the ratio of the average codeword length to $\max\{1,H(P)\}$ is within a constant expansion factor \textcolor{red}{$C_{\mathcal{C}}$} for any decreasing probability distribution $P$, where $H(P)$ is the entropy of $P$. For any UCI code $\mathcal{C}$, \emph{the minimum expansion factor} \textcolor{red}{$C_{\mathcal{C}}^{*}$} is defined to represent the infimum of the set of extension factors of $\mathcal{C}$. Each $\mathcal{C}$ has a unique corresponding \textcolor{red}{$C_{\mathcal{C}}^{*}$}, and the smaller \textcolor{red}{$C_{\mathcal{C}}^{*}$} is, the better the compression performance of $\mathcal{C}$ is. The class of UCIs $\mathcal{C}$ (or a family $\{\mathcal{C}_i\}_{i=1}^{\infty}$) that achieves the smallest \textcolor{red}{$C_{\mathcal{C}}^{*}$} is defined as the \emph{optimal UCI}. The best current result is that the range of $C_{\mathcal{C}}^{*}$ for the optimal UCI is $2\leq C_{\mathcal{C}}^{*}\leq 2.5$. In this paper, we prove a tighter probability inequality for decreasing distributions, which serves as a new tool for studying the properties of UCIs. On the basis of this inequality, we prove that there exists a class of near-optimal UCIs, called the $\nu$ code, achieving \textcolor{red}{$C_\nu=2.0386$}. This narrows the range of the minimum expansion factor for the optimal UCI to $2\leq C_{\mathcal{C}}^{*}\leq 2.0386$. We show that the $\nu$ code is currently optimal in terms of the minimum expansion factor. In addition, we propose a new proof showing that the minimum expansion factor of the optimal UCI is lower bounded by $2$.

cs.IT

Modeling Parkinson's Disease Progression Using Longitudinal Voice Biomarkers: A Comparative Study of Statistical and Neural Mixed-Effects Models

Longitudinal voice biomarkers provide a non-invasive source of information for monitoring Parkinson's disease progression, but their statistical analysis is difficult because repeated measurements from the same subject are correlated, clinical cohorts are often small, and disease trajectories can vary substantially across individuals. This study evaluates statistical and neural mixed-effects approaches for modeling Parkinson's disease progression from telemonitoring voice data. Using the Oxford Parkinson's telemonitoring dataset (N=42), we compare Neural Mixed Effects (NME) models, Generalized Neural Network Mixed Models (GNMMs), and semi-parametric Generalized Additive Mixed Models (GAMMs) under the same longitudinal prediction setting. The results show that neural mixed-effects models provide flexible nonlinear representations but can overfit severely in this small-sample setting, whereas GAMMs achieve stronger predictive performance and retain interpretable smooth effects and subject-level structure. In particular, the GAMM-based approach attains the lowest prediction error (MSE 6.56), while the neural baselines have substantially larger errors (MSE > 90). These findings support the use of interpretable statistical mixed-effects models for small longitudinal telemonitoring studies and suggest that larger and more diverse cohorts are needed before highly flexible neural mixed-effects models can be reliably assessed in this application.

stat.ML

Three-Dimensional Isotropic STED Nanoscopy using a Single Objective

Accurate three-dimensional (3D) imaging requires an isotropic point spread function (PSF). However, the inherent missing aperture of a single objective lens results in an elongated, cigar-like PSF, which has rendered isotropic resolution in fluorescence microscopy seemingly insurmountable without a 4{\pi} configuration for decades. To address this long-standing challenge, we introduce ISO-STED (Isotropic Single-Objective STED) Nanoscopy, a novel approach that employs a single objective lens and a single depletion beam. By utilizing a hollow depletion focus, ISO-STED achieves an isotropic PSF without relying on a 4{\pi} configuration. This innovative design enables uniform fluorescence suppression in all directions, thereby yielding an isotropic 3D resolution of approximately 70 nm. Our work not only demonstrates the potential of ISO-STED Nanoscopy to provide a compact and versatile solution for isotropic 3D imaging in complex specimens but also paves the way for more accessible and practical applications in various research fields, including biomedical research and neuroscience.

physics.optics

An obscured quasar census with the 4MOST IR AGN survey: design, predicted properties, and scientific goals

We present the 4MOST IR AGN survey, the first large-scale optical spectroscopic survey characterizing mid-infrared (MIR) selected obscured active galactic nuclei (AGN). The survey targets $\approx 212,000$ obscured infrared (IR) AGN candidates over $\approx 10,000 \rm \: deg^2$ down to a magnitude limit of $r_{\rm AB}=22.8 \, \rm mag$ and will be $\approx 100 \times$ larger than any existing obscured IR AGN spectroscopic sample. We select the targets using a MIR colour criterion applied to the unWISE catalogue from the WISE all-sky survey, and then apply a $r-W2\geq 5.9 \rm \: mag$ cut; we demonstrate that this selection will mostly identify sources obscured by $N_{\rm H}>10^{22} \rm \: cm^{-2}$. The survey complements the 4MOST X-ray survey, which will follow up $\sim 1\rm M$ eROSITA-selected (typically unobscured) AGN. We perform simulations to predict the quality of the spectra that we will obtain and validate our MIR-optical colour-selection method using X-ray spectral constraints and UV-to-far IR spectral energy distribution (SED) modelling in four well-observed deep-sky fields. We find that: (1) $\approx 80-87\%$ of the WISE-selected targets are AGN down to $r_{\rm AB}=22.1-22.8 \: \rm mag$ of which $\approx 70\%$ are obscured by $N_{\rm H}>10^{22} \: \rm cm^{-2}$, and (2) $\approx 80\%$ of the 4MOST IR AGN sample will remain undetected by the deepest eROSITA observations due to extreme absorption. Our SED fitting results show that the 4MOST IR AGN survey will primarily identify obscured AGN and quasars ($\approx 55\%$ of the sample is expected to have $L_{\rm AGN,IR}>10^{45} \rm \: erg \: s^{-1}$) residing in massive galaxies ($M_{\star}\approx 10^{10}-10^{12} \rm \: M_{\odot}$) at $z\approx 0.5-3.5$ with $ \approx 33\%$ expected to be hosted by starburst galaxies.

astro-ph.GA

A Case Study on Evaluating Genetic Algorithms for Early Building Design Optimization: Comparison with Random and Grid Searches

In early-stage architectural design, optimization algorithms are essential for efficiently exploring large and complex design spaces under tight computational constraints. While prior research has benchmarked various optimization methods, their findings often lack generalizability to real-world, domain-specific problems, particularly in early building design optimization for energy performance. This study evaluates the effectiveness of Genetic Algorithms (GAs) for early design optimization, focusing on their ability to find near-optimal solutions within limited timeframes. Using a constrained case study, we compare a simple GA to two baseline methods, Random Search (RS) and Grid Search (GS), with each algorithm tested 10 times to enhance the reliability of the conclusions. Our findings show that while RS may miss optimal solutions due to its stochastic nature, it was unexpectedly effective under tight computational limits. Despite being more systematic, GS was outperformed by RS, likely due to the irregular design search space. This suggests that, under strict computational constraints, lightweight methods like RS can sometimes outperform more complex approaches like GA. As this study is limited to a single case under specific constraints, future research should investigate a broader range of design scenarios and computational settings to validate and generalize the findings. Additionally, the potential of Random Search or hybrid optimization methods should be further investigated, particularly in contexts with strict computational limitations.

cs.NE

Performance optimization of Nernst-based thermionic engines

In this paper, we examine the power and efficiency of the thermionic device utilizing the Nernst effect, with a specific focus on its potential application as an engine. The device operates by utilizing the vertical heat current to generate a horizontal particle current against the chemical potential. By considering the influence of a strong magnetic field, we derive analytical expressions for the current and heat flux. These expressions are dependent on the temperature and chemical potential of heat reservoirs, providing valuable insights into the device performance. The impact of driving temperatures on the performance of the thermionic engine has been assessed through numerical analysis. The research findings will guide the experimental design of Nernst-based thermionic engines.

cond-mat.stat-mech