Related papers: A Study of End-Fed Arrays with Application to Sing…
We consider the question of existence of a unique invariant probability distribution which satisfies some evolutionary property. The problem arises from the random graph theory but to answer it we treat it as a dynamical system in the…
This paper revisits the robustness analysis and distributed ${ H}_\infty$ controller design for the platooning of connected vehicles. Recently, the relevant result subjected to the undirected topology has been studied, in the light of the…
In this paper, we study a nonconvex, nonsmooth, and non-Lipschitz generalized symmetric matrix factorization model that unifies a broad class of matrix factorization formulations arising in machine learning, image science, engineering, and…
Linear complexity is an important parameter for arrays that are used in applications related to information security. In this work we survey constructions of two and three dimensional arrays, and present new results on the multidimensional…
We analyze the transition between pulled and pushed fronts both analytically and numerically from a model-independent perspective. Based on minimal conceptual assumptions, we show that pushed fronts bifurcate from a branch of pulled fronts…
A new algorithm developed to perform autonomous fitting of gravitational microlensing lightcurves is presented. The new algorithm is conceptually simple, versatile and robust, and parallelises trivially; it combines features of extant…
Standard statistical techniques often require transforming data to have mean $0$ and standard deviation $1$. Typically, this process of "standardization" or "normalization" is applied across subjects when each subject produces a single…
In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…
Planar Embedding is a drawing of a graph on the plane such that the edges do not intersect each other except at the vertices. We know that testing the planarity of a graph and computing its embedding (if it exists), can efficiently be…
This work proposes a novel procedure to test for common structures across two high-dimensional factor models. The introduced test allows to uncover whether two factor models are driven by the same loading matrix up to some linear…
Sparse arrays with $N$-sensors can provide up to $O(N^2)$ degrees of freedom (DOF) by second-order cumulants. However, these sparse arrays like minimum-/low-redundancy arrays (MRAs/LRAs), nested arrays and coprime arrays can only provide…
The problem of multi-objective design of sparse MIMO arrays for better multitarget detection capabilities is considered. A novel approach for efficient utilization of the antenna design resources; namely, the number of available array…
We consider the problem of predicting an outcome variable using $p$ covariates that are measured on $n$ independent observations, in the setting in which flexible and interpretable fits are desirable. We propose the fused lasso additive…
This paper studies path synthesis for nonholonomic mobile robots moving in two-dimensional space. We first address the problem of interpolating paths expressed as sequences of straight line segments, such as those produced by some planning…
This work studies a variational formulation and numerical solution of a regularized morphoelasticity problem of shape evolution. The foundation of our analysis is based on the governing equations of linear elasticity, extended to account…
In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. We show that these graph grammars can be embedded in a graph rewriting characterization of distributed systems that was…
End-to-end autonomous driving has emerged as a promising paradigm for achieving robust and intelligent driving policies. However, existing end-to-end methods still face significant challenges, such as suboptimal decision-making in complex…
A large intelligent surface (LIS) is a promising approach to enhancing 6G performance in sub-10 GHz frequency bands. An analysis of the horizontal dipole linear array reveals that when the array size is sufficiently large, employing the…
We devise a constant-factor approximation algorithm for the maximization version of the edge-disjoint paths problem if the supply graph together with the demand edges form a planar graph. By planar duality this is equivalent to packing cuts…
Phased arrays have enabled advances in communications, sensing, imaging, and wireless power transfer. In all these applications, large apertures enable higher power, higher data rates, higher resolution, and complex functionalities, but are…