Related papers: A new provably stable weighted state redistributio…
We consider the numerical solution of coupled volume-surface reaction-diffusion systems having a detailed balance equilibrium. Based on the conservation of mass, an appropriate quadratic entropy functional is identified and an…
An implicit scheme for steady state solutions of diatomic gas flow is presented. The method solves the Rykov model equation in the finite volume discrete velocity method (DVM) framework, in which the translational and rotational degrees of…
Efficient state preparation is a challenging and important problem in quantum computing. In this work, we present a recursive state preparation algorithm that combines logarithmic-depth Dicke state circuits with Hamming weight encoders for…
Existing computationally efficient methods for penalized likelihood GAM fitting employ iterative smoothness selection on working linear models (or working mixed models). Such schemes fail to converge for a non-negligible proportion of…
Over the past few years, the federated learning ($\texttt{FL}$) community has witnessed a proliferation of new $\texttt{FL}$ algorithms. However, our understating of the theory of $\texttt{FL}$ is still fragmented, and a thorough, formal…
This paper deals with the trade-off between time, workload, and versatility in self-stabilization, a general and lightweight fault-tolerant concept in distributed computing.In this context, we propose a transformer that provides an…
The discrete unified gas kinetic scheme (DUGKS) is a new finite volume (FV) scheme for continuum and rarefied flows which combines the benefits of both Lattice Boltzmann Method (LBM) and unified gas kinetic scheme (UGKS). By reconstruction…
In many signal processing applications it is required to estimate the unobservable state of a dynamic system from its noisy measurements. For linear dynamic systems with Gaussian Mixture (GM) noise distributions, Gaussian Sum Filters (GSF)…
So called cartesian cut cell meshes provide efficient ways to generate meshes but do require tailored numerical methods to not suffer from stabilization issues, especially in the hyperbolic regime where the application of explicit time…
This paper presents an implicit method for the discrete unified gas-kinetic scheme (DUGKS) to speed up the simulations of the steady flows in all flow regimes. The DUGKS is a multi-scale scheme finite volume method (FVM) for all flow…
In this paper we describe a perfect simulation algorithm for the stable $M/G/c$ queue. Sigman (2011: Exact Simulation of the Stationary Distribution of the FIFO M/G/c Queue. Journal of Applied Probability, 48A, 209--213) showed how to build…
We present a protocol that allows the estimation of any density matrix element for continuous-variable quantum states, without resorting to the complete reconstruction of the full density matrix. The algorithm adaptatively discretizes the…
An implicit multiscale method with multiple macroscopic prediction for steady state solutions of gas flow in all flow regimes is presented. The method is based on the finite volume discrete velocity method (DVM) framework. At the cell…
This paper studies the distributed state estimation problem for a class of discrete time-varying systems over sensor networks. Firstly, it is shown that a networked Kalman filter with optimal gain parameter is actually a centralized filter,…
Given a marked renewal point process (assuming that the marks are i.i.d.) we say that an unbounded region is stable if it contains finitely many points of the point process with probability one. In this paper we provide algorithms that…
Motivated by the scalability problem in large networks, we study stability of a network of infinitely many finite-dimensional subsystems. We develop a so-called relaxed small-gain theorem for input-to-state stability (ISS) with respect to a…
Fast and accurate optimization and simulation is widely becoming a necessity for large scale transmission resiliency and planning studies such as N-1 SCOPF, batch contingency solvers, and stochastic power flow. Current commercial tools,…
Balanced partitioning is often a crucial first step in solving large-scale graph optimization problems, e.g., in some cases, a big graph can be chopped into pieces that fit on one machine to be processed independently before stitching the…
We consider a discrete-time linear quadratic Gaussian networked control setting where the (full information) observer and controller are separated by a fixed-rate noiseless channel. The minimal rate required to stabilize such a system has…
Time distributed optimization is an implementation strategy that can significantly reduce the computational burden of model predictive control by exploiting its robustness to incomplete optimization. When using this strategy, optimization…