The probability of detecting technosignatures (i.e., evidence of technological activity beyond Earth) increases with their longevity, or the time interval over which they manifest. Therefore, the assumed distribution of longevities has some bearing on the ...
Euclidean lattices are mathematical objects of increasing interest in the fields of cryptography and error-correcting codes. This doctoral thesis is a study on high-dimensional lattices with the motivation to understand how efficient they are in terms of b ...
Thin-laminate composites with thicknesses below 200 mu m hold significant promise for future, larger, and lighter deployable structures. This paper presents a study of the time-dependent failure behavior of thin carbon-fiber laminates under bending, focusi ...
In various robotics applications, the selection of function approximation methods greatly influences the feasibility and computational efficiency of algorithms. Tensor Networks (TNs), also referred to as tensor decomposition techniques, present a versatile ...
Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...
One major challenge in distributed learning is to efficiently learn for each client when the data across clients is heterogeneous or non iid (not independent or identically distributed). This provides a significant challenge as the data of the other client ...
Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...
In 2019, Eliud Kipchoge ran a sub-two hour marathon wearing Nike's Alphafly shoes. Despite being the fastest marathon time ever recorded, it wasn't officially recognized as race conditions were tightly controlled to maximize his success. Besides, Kipchoge' ...
The discretization of robust quadratic optimal control problems under uncertainty using the finite element method and the stochastic collocation method leads to large saddle-point systems, which are fully coupled across the random realizations. Despite its ...
In this manuscript, we present a collective multigrid algorithm to solve efficiently the large saddle-point systems of equations that typically arise in PDE-constrained optimization under uncertainty, and develop a novel convergence analysis of collective ...
