Research
Research
Research
Research
67,236+ open-access research outputs.
We introduce a refined immersed boundary (IB) methodology that is better-than-first-order accurate in practice, while preserving key properties of "continuous-forcing" IB approaches that retain a sing…
Viscoelastic rate-type fluid models constitute a fundamental framework for the mathematical description of complex materials exhibiting coupled elastic and viscous effects, with a wide range of applic…
This paper studies data-driven approaches to the continuous-time linear quadratic regulator (LQR) problem based on two existing parameterizations, namely a closed-loop (CL) parameterization from behav…
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$…
In modern parametric model training, full-batch gradient descent (and its variants) suffers due to progressively stronger biasing towards the exact realization of training data; this drives the system…
We consider the problem of finding the (unique) minimal Walrasian equilibrium price in multi-item, multi-unit auction models: there are multiple indivisible items for sale, with several units of each …
Partially ordered patterns (POPs) generalize classical permutation patterns and have been extensively studied in the contexts of permutations, words, compositions, and partitions. Burstein, Han, Kitae…
In this paper, we aim at estimating the quarticity of continuous It\^{o} semimartingales. Instead of using some classical estimators, we introduce a more intuitive one and establish a central limit th…
We establish an It\^o-type formula for finite $p$-variation paths with jumps for arbitrary $p\geq 1$. The formula is stated in a fully pathwise form and separates the reduced rough integral from expli…
Order picking travel dominates much of warehouse effort, and exact routing is especially valuable when storage is scattered so pick locations are not fixed in advance. We address the single picker rou…
This paper develops a sliding mode control based frame work for equality constrained optimization by reformulation the first order Karush Kuhn Tucker conditions as control affine dynamical system. The…
We present two complementary proofs that, if the lengths of $n$ sticks are sampled at random, then the probability that no $p+1$ sticks can form a $(p+1)$-sided polygon can be expressed as the product…
Body-fitted arbitrary Lagrangian-Eulerian (ALE) methods provide a sharp representation of the fluid-structure interface but rely on mesh-update strategies that incrementally deform a reference configu…
We introduce the notions of $\mathbb{K}$-framings, based $\mathbb{K}$-framings and relative $\mathbb{K}$-framings of a compact connected oriented surface $\Sigma$ for any commutative ring $\mathbb{K}$…
We give a unified proof of property $R_\infty$ for the Higman groups $H_n$ ($n\ge 4$) and for their generalizations studied by Martin and Horbez--Huang. As a key step, we prove that the automorphism g…
Based on a discontinuous Galerkin method in the spatial directions and an improved implicit-explicit pressure-correction scheme in the temporal direction, this paper discusses a fully discrete scheme …
A Berge $k$-factor in a hypergraph is a generalization of a $k$-factor in a graph. In this paper, we study the problem of determining the values $k$ such that every $\lambda$-edge-connected $r$-regula…
The primary goal of this paper is to give a precise definition and prove existence and uniqueness of multiphase quadrature domains for subharmonic functions, ensuring that the prescribed measures are …
In this letter, we study a model-based inverse problem for infinite-horizon linear-quadratic differential games with descriptor dynamics. Specifically, we seek to identify the set of all cost function…
We introduce an entropy-compatible neural network method for scalar hyperbolic conservation laws based on a computable surrogate of the Kru\v{z}kov entropy residual. The proposed loss is designed to e…
Free open-access publishing with Google Scholar indexing.
Submission Guide →