Research
Research
Research
Research
19,019+ open-access research outputs.
Identity verification is a critical gateway to accessing government services and public benefits, yet contemporary systems are typically designed around visual interaction, leaving blind and low visio…
We study the melting of a domain wall in the quantum simple exclusion process with all-to-all hoppings (a.k.a. the charged SYK$_2$ model). We show that the real-time dynamics of physical quantities of…
In this paper, we study an inverse boundary value problem for the Jordan--Moore--Gibson--Thompson equation on a simple Riemannian manifold. We consider an all boundary measurement map that maps Dirich…
This paper addresses the problem of finding the densest $k$-vertex subgraph in an arbitrary graph. This problem is NP-hard and has important applications in social network analysis, fraud detection, r…
\indent In this paper, we study a class of parabolic-elliptic Keller-Segel systems with diffusion sensitivity dependent on spatial position, given by type \begin{equation} \left\{ \begin{array}{ll…
Android residential proxy applications represent a growing class of potentially-unwanted programs (PUPs) that covertly route third-party traffic through end-user devices, enabling ad fraud, credential…
In this work, we derive the Lipschitz stability for conductivities of unknown constants as well as unknown polygonal inclusions from the Dirichlet-to-Neumann map.…
This paper considers the homogeneous Neumann initial-boundary value problem for Alopecia Areata chemotaxis model with weakly singular sensitivity. For any appropriately regular initial conditions,it i…
The exact-sequence structure behind the Arnold--Douglas--Gupta family of higher-order mixed finite elements for plane elasticity on barycentric refinements is made explicit. On each macro triangle, th…
We address Calder\'on's problem of stably determining the anisotropic complex admittivity $\sigma$ in a domain $\Omega\subset\mathbb{R}^n$, with $n\geq3$, representing a conducting medium, in terms of…
We prove that any continuous function f from [0,1]^n to R representable by a finite computation tree with N internal nodes and compositional sparsity s = O(1) admits a deep Kolmogorov-Arnold Network (…
Brualdi and Hoffman proposed a well-known problem of determining the graph with maximum adjacency spectral radius among all graphs with given size $m$. Early work by Friedland and Stanley addressed so…
We extend the established Galilean/relativistic structural divider in algebraic quantum field theory, namely, the absence of Reeh-Schlieder and of Tomita-Takesaki modular flow on local algebras of any…
For the boundary value problem $$\left\{ \begin{array}{rcll} -\Delta_p u+u^{p-1}&=&|x|^{\alpha}u^{q-1}&\mbox{in }\Omega,\\ \frac{\displaystyle\partial u}{\displaystyle\partial{\bf n}}&=&0&\mbox{on }\p…
We prove that the standard Galilean Haag--Kastler axioms, augmented by Bargmann mass superselection, are inconsistent with the Reeh--Schlieder property: no such net admits a vacuum that is cyclic and …
In this article, we study the bilaterally almost uniform (b.a.u.) convergence of weighted averages of a positive Dunford-Schwartz operator on the noncommutative $L_p$-spaces associated to a semifinite…
We prove that the unit group of a non-discrete irreducible, continuous ring, in the sense of John von Neumann, does not admit any non-trivial unitary representation continuous with respect to the stro…
We present a variational algorithm for fault tolerant quantum computing to solve a system of linear equations which directly maximises the parameters of the target fidelity. This so-called measurement…
This paper presents a high-order bound-preserving oscillation-eliminating discontinuous Galerkin (BP-OEDG) scheme for simulating gas-gas and gas-liquid two-phase flows governed by the Kapila five-equa…
We maintain a $(1+\varepsilon)$-spanner over the disk intersection graph of a dynamic set of disks. We restrict all disks to have their diameter in $[4,\Psi]$ for some fixed and known $\Psi$. The resu…
Free open-access publishing with Google Scholar indexing.
Submission Guide →