Related papers: A Study of End-Fed Arrays with Application to Sing…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
In this paper we propose Fed-ensemble: a simple approach that bringsmodel ensembling to federated learning (FL). Instead of aggregating localmodels to update a single global model, Fed-ensemble uses random permutations to update a group of…
We introduce the study of frames and equiangular lines in classical geometries over finite fields. After developing the basic theory, we give several examples and demonstrate finite field analogs of equiangular tight frames (ETFs) produced…
In this study, we investigate and fabricate a superdirective antenna array composed of strip dipole elements operating at a frequency of 3.5 GHz. The spacing, dimensions, and phase difference of the elements are optimized to achieve a super…
A large part of modern machine learning theory often involves computing the high-dimensional expected trace of a rational expression of large rectangular random matrices. To symbolically compute such quantities using free probability…
Trajectory sampling in the Frenet(road-aligned) frame, is one of the most popular methods for motion planning of autonomous vehicles. It operates by sampling a set of behavioural inputs, such as lane offset and forward speed, before solving…
We consider families of geometries of D--dimensional space, described by a finite number of parameters. Starting from the De Witt metric we extract a unique integration measure which turns out to be a geometric invariant, i.e. independent…
This paper presents a product to sum approach for a fast and efficient matrix filling in a hierarchical finite-element method (FEM). Due to the existence of a coupling factor arising from the material and Jacobian inhomogeneities in curved…
In this paper we will introduce the methodology of analysis of the convex hull of the attractors of iterated functional systems (IFS) - compact fixed sets of self-similarity mapping. The method is based on a function which for a direction,…
Solving linear systems is a ubiquitous task in science and engineering. Because directly inverting a large-scale linear system can be computationally expensive, iterative algorithms are often used to numerically find the inverse. To…
Edge bundling is an important concept heavily used for graph visualization purposes. To enable the comparison with other established near-planarity models in graph drawing, we formulate a new edge-bundling model which is inspired by the…
We present a general framework for studying harmonic analysis of functions in the settings of various emerging problems in the theory of diffusion geometry. The starting point of the now classical diffusion geometry approach is the…
Geometric properties of the fixed point set $Fix(f)$ of a self-mapping $f$ on a metric or a generalized metric space is an attractive issue. The set $Fix(f)$ can contain a geometric figure (a circle, an ellipse, etc.) or it can be a…
We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as "the first array cell contains the array length,"…
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…
We study monotone simultaneous embeddings of upward planar digraphs, which are simultaneous embeddings where the drawing of each digraph is upward planar, and the directions of the upwardness of different graphs can differ. We first…
We analyze the correlation between randomly chosen edge weights on neighboring edges in a directed graph. This shared-endpoint correlation controls the expected organization of randomly drawn edge flows when the flow on each edge is…
This work presents a highly optimized computational framework for the Discrete Dipole Approximation, a numerical method for calculating the optical properties associated with a target of arbitrary geometry that is widely used in…
For computing efficient approximate designs of multifactor experiments, we propose a simple algorithm based on adaptive exploration of the grid of all combinations of factor levels. We demonstrate that the algorithm significantly…
End-to-end diffusion planning has shown strong potential for autonomous driving, but the physical feasibility of generated trajectories remains insufficiently addressed. In particular, generated trajectories may exhibit local geometric…