** The geometrically rigorous nonlinear analysis of elastic shells is considered in the context of finite, but small, strain theory. The research is focused on the introduction of the full shell metric and examination of its influence on the nonlinear structural response. The exact relation between the reference and equidistant strains is employed and the complete analytic elastic constitutive relation between energetically conjugated forces and strains is derived via the reciprocal shift tensor. Utilizing these strict relations, the geometric stiffness matrix is derived explicitly by the variation of the unknown metric. Moreover, a compact form of this matrix is presented. Despite the linear displacement distribution due to the Kirchhoff-Love hypothesis, a nonlinear strain distribution arises along the shell thickness. This fact is sometimes disregarded for the nonlinear analysis of thin shells based on the initial geometry, thereby ignoring the strong curviness of a shell at some subsequent configuration. We show that the curviness of a shell at each configuration determines the appropriate shell formulation. For shells that become strongly curved at some configurations during deformation, the nonlinear distribution of strain throughout the thickness must be considered in order to obtain accurate results. We investigate four computational models: one based on the full analytical constitutive relation, and three simplified ones. Robustness, efficiency and accuracy of the presented formulation are examined via selected numerical experiments. Our main finding is that the employment of the full metric is often required when the complete response of the shells is sought, even for the initially thin shells. Finally, the simplified model that provided the best balance between efficiency and accuracy is suggested for the nonlinear analysis of strongly curved shells. **

** Given an optimization problem, the Hessian matrix and its eigenspectrum can be used in many ways, ranging from designing more efficient second-order algorithms to performing model analysis and regression diagnostics. When nonlinear models and non-convex problems are considered, strong simplifying assumptions are often made to make Hessian spectral analysis more tractable. This leads to the question of how relevant the conclusions of such analyses are for more realistic nonlinear models. In this paper, we exploit deterministic equivalent techniques from random matrix theory to make a \emph{precise} characterization of the Hessian eigenspectra for a broad family of nonlinear models, including models that generalize the classical generalized linear models, without relying on strong simplifying assumptions used previously. We show that, depending on the data properties, the nonlinear response model, and the loss function, the Hessian can have \emph{qualitatively} different spectral behaviors: of bounded or unbounded support, with single- or multi-bulk, and with isolated eigenvalues on the left- or right-hand side of the bulk. By focusing on such a simple but nontrivial nonlinear model, our analysis takes a step forward to unveil the theoretical origin of many visually striking features observed in more complex machine learning models. **

** Finite Sample Smeariness (FSS) has been recently discovered. It means that the distribution of sample Fr\'echet means of underlying rather unsuspicious random variables can behave as if it were smeary for quite large regimes of finite sample sizes. In effect classical quantile-based statistical testing procedures do not preserve nominal size, they reject too often under the null hypothesis. Suitably designed bootstrap tests, however, amend for FSS. On the circle it has been known that arbitrarily sized FSS is possible, and that all distributions with a nonvanishing density feature FSS. These results are extended to spheres of arbitrary dimension. In particular all rotationally symmetric distributions, not necessarily supported on the entire sphere feature FSS of Type I. While on the circle there is also FSS of Type II it is conjectured that this is not possible on higher-dimensional spheres. **

** In this paper, distributed dynamics are deployed to solve resource allocation over time-varying multi-agent networks. The state of each agent represents the amount of resources used/produced at that agent while the total amount of resources is fixed. The idea is to optimally allocate the resources among the group of agents by reducing the total cost functions subject to fixed amount of total resources. The information of each agent is restricted to its own state and cost function and those of its immediate neighbors. This is motivated by distributed applications such as in mobile edge-computing, economic dispatch over smart grids, and multi-agent coverage control. The non-Lipschitz dynamics proposed in this work shows fast convergence as compared to the linear and some nonlinear solutions in the literature. Further, the multi-agent network connectivity is more relaxed in this paper. To be more specific, the proposed dynamics even reaches optimal solution over time-varying disconnected undirected networks as far as the union of these networks over some bounded non-overlapping time-intervals includes a spanning-tree. The proposed convergence analysis can be applied for similar 1st-order resource allocation nonlinear dynamics. We provide simulations to verify our results. **

** Locimetric authentication is a form of graphical authentication where users validate their identity by selecting predetermined points on a predetermined image. Its primary advantage over the ubiquitous text-based approach stems from users' superior ability to remember visual information over textual information, coupled with the authentication process being transformed to one requiring recognition (instead of recall). Ideally, these differentiations enable users to create more complex passwords, which theoretically are more secure. Yet, locimetric authentication has one significant weakness, hot-spots, that is, areas in an image that users gravitate towards and consequently have a higher probability of being selected. This paper investigates whether the hot-spot problem persists with high-resolution images, as well as whether user characteristics and password length play a role. Our findings confirm the presence of hot-spots in high-resolution images, thus influencing the locimetric authentication scheme's effectiveness. Furthermore, we find that neither user characteristics (such as age, gender, and income) nor password length radically influence their extent. We conclude by proposing strategies to mitigate the hot-spot phenomenon. **

** Methods that align distributions by minimizing an adversarial distance between them have recently achieved impressive results. However, these approaches are difficult to optimize with gradient descent and they often do not converge well without careful hyperparameter tuning and proper initialization. We investigate whether turning the adversarial min-max problem into an optimization problem by replacing the maximization part with its dual improves the quality of the resulting alignment and explore its connections to Maximum Mean Discrepancy. Our empirical results suggest that using the dual formulation for the restricted family of linear discriminators results in a more stable convergence to a desirable solution when compared with the performance of a primal min-max GAN-like objective and an MMD objective under the same restrictions. We test our hypothesis on the problem of aligning two synthetic point clouds on a plane and on a real-image domain adaptation problem on digits. In both cases, the dual formulation yields an iterative procedure that gives more stable and monotonic improvement over time. **