16,724+ open-access research outputs.
We present FlexiTac, a low-cost, open-source, and scalable piezoresistive tactile sensing solution designed for robotic end-effectors. FlexiTac is a practical "plug-in" module consisting of (i) thin, …
In this paper, we study the $L^p$-boundedness of Stein's square function $\mathfrak{S}^{\alpha}(\mathcal{L})$ associated with the sub-Laplacian $\mathcal{L}$ on M\'etivier group $G$. A key aspect of o…
The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$…
To enhance LLMs' impact on math education, we need data on their mathematical prowess and biases across prompts. To fill this gap, we introduce MEDS (Math Education Digital Shadows) as a dataset mappi…
In this paper we study when the origin $(0,0)$ is a regular (or irregular) boundary point for the so-called soda can domains of the type \[ \Theta_{l,\theta}:= \{(x,t) \in \mathbf{R}^{n+1}: 0<-t < \th…
Perturbation probing generates task-specific causal hypotheses for FFN neurons in large language models using two forward passes per prompt and no backpropagation, followed by a one-time intervention …
Parameter-efficient fine-tuning (PEFT) methods face a tradeoff between adapter size and expressivity: ultra-low-parameter adapters are confined to fixed low-rank subspaces, capping performance even wi…
Hybrid-thinking language models expose explicit think and no-think modes, but current designs do not separate them cleanly. Even in no-think mode, models often emit long and self-reflective responses,…
Differential-difference matrix Lax representations (Lax pairs), gauge transformations, and discrete Miura-type transformations (MTs) belong to the main tools in the theory of (nonlinear) integrable di…
The Running Average Power Limit (RAPL) interface is widely used to estimate software energy consumption via CPU and DRAM counters, but tool design differences and high-frequency polling can introduce …
Improving large language model (LLM) reasoning requires supervision that is both aligned with the model's own test-time states and informative at the token level. Reinforcement learning with verifiabl…
In this work we investigate the phenomenon of pathwise non-uniqueness for the stochastic incompressible Euler equations with a passive tracer on the whole Euclidean space. The stochastic perturbations…
In the previous work [Interfaces Free Bound., 19, 351--369, 2017], de Queiroz and Shahgholian established the optimal $C^{1,\log}_{\mathrm{loc}}$ regularity of solutions for the obstacle problem with …
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 study the coupon collector with deterministic expiration: one coupon is drawn at each time, and each coupon remains active for exactly $M$ draws. Completion occurs when all $n$ coupon types are sim…
The essence of good creative writing is calibrated surprise: when constraints from all relevant dimensions act together, the feasible solution space collapses into a narrow region, and the surviving c…
Black Sigatoka disease (BSD), also known as black leaf streak disease, is an airborne fungal infection caused by \textit{Pseudocercospora fijiensis} that severely impacts global banana and plantain pr…
We construct an analytical black hole solution in the Einstein-Maxwell-Yang-Mills theory with a conformally coupled scalar field in four dimensions, which generalizes the charged Mart\'inez-Troncoso-Z…
In 1978, A. C. Newell [SIAM J. Appl. Math. 35(4) (1978) 650-664] proposed an exactly solvable model called Newell equation, which simulates the investigation of significant interaction mechanism betwe…
We show that finite-energy weak solutions to the incompressible Navier--Stokes equations on a three-dimensional bounded smooth domain are regular up to the boundary, provided that the $L^4_tL^4_x$-nor…
Free open-access publishing with Google Scholar indexing.
Submission Guide →