Related papers: The Space of Interaction (long version)
Understanding frictional phenomena is a fascinating fundamental problem with huge potential impact on energy saving. Such an understanding requires monitoring what happens at the sliding buried interface, which is almost inaccessible by…
Numerical solutions for flows in partially saturated porous media pose challenges related to the non-linearity and elliptic-parabolic degeneracy of the governing Richards' equation. Iterative methods are therefore required to manage the…
A numerical tool relying on sharp Immersed Boundary Method (IBM) is developed for the analysis of aerospace applications. The method, which is conceived for application using segregated solvers relying on implicit time discretization, uses…
Autonomous agents rely on sensor data to construct representations of their environments, essential for predicting future events and planning their actions. However, sensor measurements suffer from limited range, occlusions, and sensor…
Methods based on Riemannian geometry have proven themselves to be good models for decoding in brain-computer interfacing (BCI). However, one major drawback of these methods is that it is not possible to determine what aspect of the signal…
A dynamical system with discrete time is studied by means of algebraic geometry. The system admits a reduction that is interpreted as a classical field theory in 2+1-dimensional wholly discrete space-time. The integrals of motion of a…
We propose a space mapping-based optimization algorithm for microscopic interacting particle dynamics which are inappropriate for direct optimization. This is of relevance for example in applications with bounded domains such that the…
Mixture-of-Agents (MoA) inference can suffer from dense inter-agent communication and low hardware utilization, which jointly inflate serving latency. We present a serving design that targets these bottlenecks through an algorithm-system…
The previously described methodology for hierarchical grouping of objects through iterative averaging has been used for simulation of cooperative interactions between objects of a system with the purpose of investigation of the…
The Generalized Integral Representation Method (GIRM) for Space-Time-Separated Method (STSM) and Space-Time-Unified Method (STUM) are discussed. STSM and STUM give explicit and implicit time evolutions, respectively. The algorithm of STSM…
In the field of algorithms and data structures analysis and design, most of the researchers focus only on the space/time trade-off, and little attention has been paid to energy consumption. Moreover, most of the efforts in the field of…
Interactions in complex systems are widely observed across various fields, drawing increased attention from researchers. In mathematics, efforts are made to develop various theories and methods for studying the interactions between spaces.…
The rise of Generative AI, and Large Language Models (LLMs) in particular, is fundamentally changing cognitive processes in knowledge work, raising critical questions about their impact on human reasoning and problem-solving capabilities.…
Scientific fields such as insider-threat detection and highway-safety planning often lack sufficient amounts of time-series data to estimate statistical models for the purpose of scientific discovery. Moreover, the available limited data…
The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape matching, only a limited number of works have explored the…
We develop a new interior-point method (IPM) for symmetric-cone optimization, a common generalization of linear, second-order-cone, and semidefinite programming. In contrast to classical IPMs, we update iterates with a geodesic of the cone…
The ability to accurately quantify the performance an additively manufactured (AM) product is important for a widespread industry adoption of AM as the design is required to: (1) satisfy geometrical constraints, (2) satisfy structural…
Several novel mixed-integer linear and bilinear formulations are proposed for the optimum communication spanning tree problem. They implement the distance-based approach: graph distances are directly modeled by continuous, integral, or…
A novel iterative algorithm for the efficient computation of the intersection areas of an arbitrary number of circles is presented. The algorithm, based on a trellis-structure, hinges on two geometric results which allow the existence-check…
The problem of counting collisions or interactions is common in areas as computer graphics and scientific simulations. Since it is a major bottleneck in applications of these areas, a lot of research has been carried out on such subject,…