Tootfinder

This https://arxiv.org/abs/2403.16301 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNI_…

Q-adaptive: A Multi-Agent Reinforcement Learning Based Routing on Dragonfly Network
on adaptive routing to balance network traffic for optimum performance. Ideally, adaptive routing attempts to forward packets between minimal and non-minimal paths with the least congestion. In practice, current adaptive routing algorithms estimate routing path congestion based on local information such as output queue occupancy. Using local information to estimate global path congestion is inevitably inaccurate because a router has no precise knowledge of link states a few hops away. This inac…

This https://arxiv.org/abs/2404.01001 has been replaced.
link: https://scholar.google.com/scholar?q=a

Resolution and Betti numbers of Vertex cover ideals
The vertex cover ideal $J(G)$ of a finite graph $G$ is studied. We characterize when a Cohen--Macaulay vertex cover ideal $J(G)$ has a Scarf minimal free resolution. Furthermore, by using both combinatorial and topological techniques, the graded Betti number $β_{i,i+j}(J(G))$, where $i$ and $j$ are the projective dimension and the regularity of $J(G)$, is computed, when $G$ is either a path or a cycle.

This https://arxiv.org/abs/2402.04242 has been replaced.
link: https://scholar.google.com/scholar?q=a

Exact weights and path metrics for triangulated categories and the derived category of persistence modules
We define exact weights on a triangulated category to be nonnegative functions on objects satisfying a subadditivity condition with respect to exact triangles. Such weights induce a metric on objects in the triangulated category, which we call a path metric. Our exact weights generalize the rank functions of J.\ Chuang and A.\ Lazarev and are analogous to the exact weights for an exact category given by the first author and J.\ Scott and D.\ Stanley. We show that cohomological functors from a t…

This https://arxiv.org/abs/2208.13044 has been replaced.
link: https://scholar.google.com/scholar?q=a

Addressing energy density functionals in the language of path-integrals I: Comparative study of diagrammatic techniques applied to the (0+0)-D $O(N)$-symmetric $φ^{4}$-theory
The energy density functional (EDF) method is currently the only microscopic theoretical approach able to tackle the entire nuclear chart. Nevertheless, it suffers from limitations resulting from its empirical character and deteriorating its reliability. This paper is part of a larger program that aims at formulating the EDF approach as an effective field theory (EFT) in order to overcome these limitations. A relevant framework to achieve this is the path-integral (PI) formulation of quantum fi…

This https://arxiv.org/abs/2106.13372 has been replaced.
link: https://scholar.google.com/scholar?q=a

Graphs with Many Hamiltonian Paths
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio of pairs of vertices connected by hamiltonian paths to all pairs of vertices approaches 1. We then consider minimal graphs that are hamiltonian-connected. It is known that any order-$n$ graph that is hamiltonian-connected must have $\geq 3n/2$ edges. We constr…

This https://arxiv.org/abs/2104.08864 has been replaced.
link: https://scholar.google.com/scholar?q=a

Second order trace formulae
Koplienko \cite{Ko} found a trace formula for perturbations of self-adjoint operators by operators of Hilbert-Schmidt class $\mathcal{B}_2(\mathcal{H})$. Later, Neidhardt introduced a similar formula in the case of pair of unitaries $(U,U_0)$ via multiplicative path in \cite{NH}. In 2012, Potapov and Sukochev \cite{PoSu} obtained a trace formula like the Koplienko trace formula for pairs of contractions by answering an open question posed by Gesztesy, Pushnitski, and Simon in \cite[Open Questio…

This https://arxiv.org/abs/2106.10362 has been replaced.
link: https://scholar.google.com/scholar?q=a

Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback
Existing committee-based Byzantine state machine replication (SMR) protocols, typically deployed in production blockchains, face a clear trade-off: (1) they either achieve linear communication cost in the happy path, but sacrifice liveness during periods of asynchrony, or (2) they are robust (progress with probability one) but pay quadratic communication cost. We believe this trade-off is unwarranted since existing linear protocols still have asymptotic quadratic cost in the worst case. We desi…

This https://arxiv.org/abs/2304.12046 has been replaced.
link: https://scholar.google.com/scholar?q=a

When to Replan? An Adaptive Replanning Strategy for Autonomous Navigation using Deep Reinforcement Learning
The hierarchy of global and local planners is one of the most commonly utilized system designs in autonomous robot navigation. While the global planner generates a reference path from the current to goal locations based on the pre-built map, the local planner produces a kinodynamic trajectory to follow the reference path while avoiding perceived obstacles. To account for unforeseen or dynamic obstacles not present on the pre-built map, ``when to replan'' the reference path is critical for the s…

This https://arxiv.org/abs/2403.08179 has been replaced.
link: https://scholar.google.com/scholar?q=a

Effects of wave damping and finite perpendicular scale on three-dimensional Alfven wave parametric decay in low-beta plasmas
Shear Alfven wave parametric decay instability (PDI) provides a potential path toward significant wave dissipation and plasma heating. However, fundamental questions regarding how PDI is excited in a realistic three-dimensional (3D) open system and how critically the finite perpendicular wave scale--as found in both laboratory and space plasmas--affects the excitation remain poorly understood. Here, we present the first 3D, open-boundary, hybrid kinetic-fluid simulations of kinetic Alfven wave …

This https://arxiv.org/abs/2011.01718 has been replaced.
link: https://scholar.google.com/scholar?q=a

Multi-Iteration Stochastic Optimizers
We here introduce Multi-Iteration Stochastic Optimizers, a novel class of first-order stochastic optimizers where the relative $L^2$ error is estimated and controlled using successive control variates along the path of iterations. By exploiting the correlation between iterates, control variates may reduce the estimator's variance so that an accurate estimation of the mean gradient becomes computationally affordable. We name the estimator of the mean gradient Multi-Iteration stochastiC Estimator…

This https://arxiv.org/abs/2404.15297 has been replaced.
link: https://scholar.google.com/scholar?q=a

Multi-stream Transmission for Directional Modulation Network via Distributed Multi-UAV-aided Multi-active-IRS
Active intelligent reflecting surface (IRS) is a revolutionary technique for the future 6G networks. The conventional far-field single-IRS-aided directional modulation(DM) networks have only one (no direct path) or two (existing direct path) degrees of freedom (DoFs). This means that there are only one or two streams transmitted simultaneously from base station to user and will seriously limit its rate gain achieved by IRS. How to create multiple DoFs more than two for DM? In this paper, single…

This https://arxiv.org/abs/2006.04681 has been replaced.
link: https://scholar.google.com/scholar?q=a

Exact results on generalized Erdős-Gallai problems
Generalized Turán problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem is maximizing the number of cliques of size $t$ in a graph of a fixed order that does not contain any path (or cycle) of length at least a given number. Both of the path-free and cycle-free extremal problems were recently considered and asymptotically solved by Luo. We fully resolve these problems by characterizing all possible extremal graphs. We further ex…

This https://arxiv.org/abs/2312.10797 has been replaced.
link: https://scholar.google.com/scholar?q=a

Large-Scale Multi-Robot Coverage Path Planning via Local Search
We study graph-based Multi-Robot Coverage Path Planning (MCPP) that aims to compute coverage paths for multiple robots to cover all vertices of a given 2D grid terrain graph $G$. Existing graph-based MCPP algorithms first compute a tree cover on $G$ -- a forest of multiple trees that cover all vertices -- and then employ the Spanning Tree Coverage (STC) paradigm to generate coverage paths on the decomposed graph $D$ of the terrain graph $G$ by circumnavigating the edges of the computed trees, a…

This https://arxiv.org/abs/2401.08019 has been replaced.
link: https://scholar.google.com/scholar?q=a

A polynomial algorithm for the most degree-central shortest path problem
The degree centrality of a node, defined as the number of nodes adjacent to it, is often used as a measure of importance of a node to the structure of a network. This metric can be extended to paths in a network, where the degree centrality of a path is defined as the number of nodes adjacent to it. In this paper, we reconsider the problem of finding the most degree-central shortest path in an unweighted network. We propose a polynomial algorithm with the worst-case running time of $O(|E&#…

This https://arxiv.org/abs/2306.02194 has been replaced.
link: https://scholar.google.com/scholar?q=a

PathFinder: A unified approach for handling paths in graph query languages
Path queries are a core feature of modern graph query languages such as Cypher, SQL/PGQ, and GQL. These languages provide a rich set of features for matching paths, such as restricting to certain path modes (shortest, simple, trail) and constraining the edge labels along the path by a regular expression. In this paper we present PathFinder, a unifying approach for dealing with path queries in all these query languages. PathFinder leverages a compact representation of the (potentially exponentia…

This https://arxiv.org/abs/2402.05866 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Groupoid Construction of Functional Integrals: Brownian Motion and Some TQFTs
We formalize Feynman's construction of the quantum mechanical path integral. To do this, we shift the emphasis in differential geometry from the tangent bundle onto the pair groupoid. This allows us to use the van Est map and the piecewise linear structure of manifolds to develop a coordinate-free, partition of unity-free approach to integration of differential forms, etc. This framework makes sense for any field theory valued in a Lie algebroid. We apply it to define the Wiener measure, stocha…

This https://arxiv.org/abs/2403.08678 has been replaced.
link: https://scholar.google.com/scholar?q=a

Path-dependency and leverage effect on capital return in periodic growth processes
Periodic growth processes are investigated. The expected value of the profit rate, on accrual basis, does not directly depend on divestments, neither on the capitalization path. The expected value of capitalization is path dependent. Because of the path-dependent capitalization, the return rate on capital is path-dependent, and the time-average return rate on capital differs from the expected value of return rate on capital for the growth cycle. In the absence of intermediate divestments, the i…

This https://arxiv.org/abs/2307.04440 has been replaced.
link: https://scholar.google.com/scholar?q=a

Time-Frequency-Space Transmit Design and Receiver Processing with Dynamic Subarray for Terahertz Integrated Sensing and Communication
Terahertz (THz) integrated sensing and communication (ISAC) enables simultaneous data transmission with Terabit-per-second (Tbps) rate and millimeter-level accurate sensing. To realize such a blueprint, ultra-massive antenna arrays with directional beamforming are used to compensate for severe path loss in the THz band. In this paper, the time-frequency-space transmit design is investigated for THz ISAC to generate time-varying scanning sensing beams and stable communication beams. Specifically…

This https://arxiv.org/abs/2103.05161 has been replaced.
link: https://scholar.google.com/scholar?q=a

The Efficient Shrinkage Path: Maximum Likelihood of Minimum MSE Risk
A new generalized ridge regression shrinkage path is proposed that is as short as possible under the restriction that it must pass through the vector of regression coefficient estimators that make the overall Optimal Variance-Bias Trade-Off under Normal distribution-theory. Five distinct types of ridge TRACE displays plus other graphics for this efficient path are motivated and illustrated here. These visualizations provide invaluable data-analytic insights and improved self-confidence to resea…

This https://arxiv.org/abs/2202.05340 has been replaced.
link: https://scholar.google.com/scholar?q=a

p-adic iterated integration on semistable curves
We reformulate the theory of p-adic iterated integrals on semistable curves using the unipotent log rigid fundamental group. This fundamental group carries Frobenius and monodromy operators whose basic properties are established. By identifying the Frobenius-invariant subgroup of the fundamental group with the fundamental group of the dual graph, we characterize Berkovich--Coleman integration, which is path-dependent, as integration along the Frobenius-invariant lift of a path in the dual graph…

This https://arxiv.org/abs/2205.05100 has been replaced.
link: https://scholar.google.com/scholar?q=a

Bounds on Path Energy of Graphs
Given a graph $M,$ path eigenvalues are eigenvalues of its path matrix. The path energy of a simple graph $M$ is equal to the sum of the absolute values of the path eigenvalues of the graph $M$ (Shikare et. al, 2018). We have discovered new upper constraints on path energy in this study, expressed in terms of a graph's maximum degree. Additionally, a relationship between a graph's energy and path energy is given.

My current take on the #xz situation, not having read the actual source backdoor commits yet (thanks a lot #Github for hiding the evidence at this point...) besides reading what others have written about it (cf. #rustlang for such central library dependencies would maybe (really big maybe) have made it a bit harder to push a backdoor like this because - if and only if the safety features are used idiomatically in an open source project - reasonably looking code is (a bit?) more limited in the sneaky behavior it could include. We should still very much use those languages over C/C for infrastructure code because the much larger class of unintentional bugs is significantly mitigated, but I believe (without data to back it up) that even such "bugdoor" type changes will be harder to execute. However, given the sophistication in this case, it may not have helped at all. The attacker(s) have shown to be clever enough.
6. Sandboxing library code may have helped - as the attacker(s) explicitly disabled e.g. landlock, that might already have had some impact. We should create better tooling to make it much easier to link to infrastructure libraries in a sandboxed way (although that will have performance implications in many cases).
7. Automatic reproducible builds verification would have mitigated this particular vector of backdoor distribution, and the Debian team seems to be using the reproducibility advances of the last decade to verify/rebuild the build servers. We should build library and infrastructure code in a fully reproducible manner *and* automatically verify it, e.g. with added transparency logs for both source and binary artefacts. In general, it does however not prevent this kind of supply chain attack that directly targets source code at the "leaf" projects in Git commits.
8. Verifying the real-life identity of contributors to open source projects is hard and a difficult trade-off. Something similar to the #Debian #OpenPGP #web-of-trust would potentially have mitigated this style of attack somewhat, but with a different trade-off. We might have to think much harder about trust in individual accounts, and for some projects requiring a link to a real-world country-issued ID document may be the right balance (for others it wouldn't work). That is neither an easy nor a quick path, though. Also note that sophisticated nation state attackers will probably not have a problem procuring "good" fake IDs. It might still raise the bar, though.
9. What happened here seems clearly criminal - at least under my IANAL naive understanding of EU criminal law. There was clear intent to cause harm, and that makes the specific method less important. The legal system should also be able to help in mitigating supply chain attacks; not in preventing them, but in making them more costly if attackers can be tracked down (this is difficult in itself, see point 8) and face risk of punishment after the fact.
H/T @… @… @… @… @…

This https://arxiv.org/abs/2403.13311 has been replaced.
link: https://scholar.google.com/scholar?q=a

Multi-Robot Connected Fermat Spiral Coverage
We introduce the Multi-Robot Connected Fermat Spiral (MCFS), a novel algorithmic framework for Multi-Robot Coverage Path Planning (MCPP) that adapts Connected Fermat Spiral (CFS) from the computer graphics community to multi-robot coordination for the first time. MCFS uniquely enables the orchestration of multiple robots to generate coverage paths that contour around arbitrarily shaped obstacles, a feature that is notably lacking in traditional methods. Our framework not only enhances area cove…

The Complexity of Geodesic Spanners using Steiner Points
Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms
https://arxiv.org/abs/2402.12110

The Complexity of Geodesic Spanners using Steiner Points
A geometric $t$-spanner $\mathcal{G}$ on a set $S$ of $n$ point sites in a metric space $P$ is a subgraph of the complete graph on $S$ such that for every pair of sites $p,q$ the distance in $\mathcal{G}$ is a most $t$ times the distance $d(p,q)$ in $P$. We call a connection between two sites in the spanner a link. In some settings, such as when $P$ is a simple polygon with $m$ vertices and a link is a shortest path in $P$, links can consist of $Θ(m)$ segments and thus have non-constant comple…

This https://arxiv.org/abs/2010.10751 has been replaced.
link: https://scholar.google.com/scholar?q=a

Sample-path large deviations for a class of heavy-tailed Markov additive processes
For a class of additive processes driven by the affine recursion $X_{n+1} = A_n X_n + B_n$, we develop a sample-path large deviations principle in the $M_1'$ topology on $D [0,1]$. We allow $B_n$ to have both signs and focus on the case where Kesten's condition holds on $A_1$, leading to heavy-tailed distributions. The most likely paths in our large deviations results are step functions with both positive and negative jumps.

This https://arxiv.org/abs/1409.4319 has been replaced.
link: https://scholar.google.com/scholar?q=a<…

Topological actions of wreath products
Let $G$ and $H$ be two groups acting on path connected topological spaces $X$ and $Y$ respectively. Assume that $H$ is finite of order $m$ and the quotient maps $p:X\to X/G$ and $q:Y\to Y/H$ are regular coverings. Then it is well-known that the wreath product $G\wr H$ naturally acts on $W = X^m\times Y$, so that the quotient map $r:W \to W/(G\wr H)$ is also a regular covering. We give an explicit description of $π_1(W/(G\wr H))$ as a certain wreath product $π_1(X/G)\,\wr_{\partial_Y}π_1(Y/H)…

This https://arxiv.org/abs/2311.17978 has been replaced.
link: https://scholar.google.com/scholar?q=a

AutArch: An AI-assisted workflow for object detection and automated recording in archaeological catalogues
The context of this paper is the creation of large uniform archaeological datasets from heterogeneous published resources, such as find catalogues - with the help of AI and Big Data. The paper is concerned with the challenge of consistent assemblages of archaeological data. We cannot simply combine existing records, as they differ in terms of quality and recording standards. Thus, records have to be recreated from published archaeological illustrations. This is only a viable path with the help …

This https://arxiv.org/abs/2402.16659 has been replaced.
link: https://scholar.google.com/scholar?q=a

Towards Efficient Quantum Computing for Quantum Chemistry: Reducing Circuit Complexity with Transcorrelated and Adaptive Ansatz Techniques
The near-term utility of quantum computers is hindered by hardware constraints in the form of noise. One path to achieving noise resilience in hybrid quantum algorithms is to decrease the required circuit depth -- the number of applied gates -- to solve a given problem. This work demonstrates how to reduce circuit depth by combining the transcorrelated (TC) approach with adaptive quantum ansätze and their implementations in the context of variational quantum imaginary time evolution (AVQITE). …

This https://arxiv.org/abs/2306.10707 has been replaced.
link: https://scholar.google.com/scholar?q=a

Partial-order Checking with Unfolding for Linear Temporal Properties
Unfolding can tackle the path-explosion problem caused by concurrency. Traditional unfolding generation faces an NP-complete problem when adding events to the unfolding structure, which also exists in the case of verifying linear temporal logic (LTL). The reason is that it is necessary to enumerate possible concurrent event combinations after adding an event. Many state-of-the-art methods optimally explore unfolding-based structure (called event structure) by a tree-like structure, which should…

This https://arxiv.org/abs/2306.06449 has been replaced.
link: https://scholar.google.com/scholar?q=a

List homomorphisms to separable signed graphs
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and reflexive signed graphs. Irreflexive signed graphs are in a certain sense the heart of the problem, as noted by a recent paper of Kim and Siggers. We focus on a special class of irreflexive signed graphs, namely those in which the unicoloured edges form a spanning path or cycle, which we call separable signed graphs. We cl…

This https://arxiv.org/abs/2203.08168 has been replaced.
link: https://scholar.google.com/scholar?q=a

Feynman rules for forced wave turbulence
It has long been known that weakly nonlinear field theories can have a late-time stationary state that is not the thermal state, but a wave turbulent state with a far-from-equilibrium cascade of energy. We go beyond the existence of the wave turbulent state, studying fluctuations about the wave turbulent state. Specifically, we take a classical field theory with an arbitrary quartic interaction and add dissipation and Gaussian-random forcing. Employing the path integral relation between stochas…

This https://arxiv.org/abs/2209.01426 has been replaced.
link: https://scholar.google.com/scholar?q=a

Space Filling Curves for Coverage Path Planning with Online Obstacle Avoidance
The paper presents a strategy for robotic exploration problem using Space-Filling curves (SFC). The strategy plans a path that avoids unknown obstacles while ensuring complete coverage of the free space in region of interest. The region of interest is first tessellated, and the tiles/cells are connected using a SFC pattern. A robot follows the SFC to explore the entire area. However, obstacles can block the systematic movement of the robot. We overcome this problem by determining an alternate p…

This https://arxiv.org/abs/2310.04532 has been replaced.
link: https://scholar.google.com/scholar?q=a

Thermodynamics of the near-extremal Kerr spacetime
We examine the thermodynamics of a near-extremal Kerr black hole, and demonstrate that the geometry behaves as an ordinary quantum system with a vanishingly small degeneracy at low temperatures. This is in contrast with the classical analysis, which instead predicts a macroscopic entropy for the extremal Kerr black hole. Our results follow from a careful analysis of the gravitational path integral. Specifically, the low temperature canonical partition function behaves as $Z \sim \, T^\frac{3}{2…

This https://arxiv.org/abs/2210.00838 has been replaced.
link: https://scholar.google.com/scholar?q=a

Analysis of the primal-dual central path for nonlinear semidefinite optimization without the nondegeneracy condition
We study properties of the central path underlying a nonlinear semidefinite optimization problem, called NSDP for short. The latest radical work on this topic was contributed by Yamashita and Yabe (2012): they proved that the Jacobian of a certain equation-system derived from the Karush-Kuhn-Tucker (KKT) conditions of the NSDP is nonsingular at a KKT point under the second-order sufficient condition (SOSC), the strict complementarity condition (SC), and the nondegeneracy condition (NC). This yi…

Q-adaptive: A Multi-Agent Reinforcement Learning Based Routing on Dragonfly Network
Yao Kang, Xin Wang, Zhiling Lan
https://arxiv.org/abs/2403.16301 https:…

Q-adaptive: A Multi-Agent Reinforcement Learning Based Routing on Dragonfly Network
on adaptive routing to balance network traffic for optimum performance. Ideally, adaptive routing attempts to forward packets between minimal and non-minimal paths with the least congestion. In practice, current adaptive routing algorithms estimate routing path congestion based on local information such as output queue occupancy. Using local information to estimate global path congestion is inevitably inaccurate because a router has no precise knowledge of link states a few hops away. This inac…

This https://arxiv.org/abs/2208.13276 has been replaced.
link: https://scholar.google.com/scholar?q=a

Mean viability theorems and second-order Hamilton-Jacobi equations
We introduce the notion of mean viability for controlled stochastic differential equations and establish counterparts of Nagumo's classical viability theorems (necessary and sufficient conditions for mean viability). As an application, we provide a purely probabilistic proof of a comparison principle and of existence for contingent and viscosity solutions of second-order fully nonlinear path-dependent Hamilton-Jacobi-Bellman equations. We do not use compactness and optimal stopping arguments, w…

This https://arxiv.org/abs/2107.09774 has been replaced.
link: https://scholar.google.com/scholar?q=a

Counting filter restricted paths in $\mathbb{Z}^2$ lattice
We derive a path counting formula for two-dimensional lattice path model on a plane with filter restrictions. A filter is a line that restricts the path passing it to one of possible directions. Moreover, each path that touches this line is assigned a special weight. The periodic filter restrictions are motivated by the problem of tensor power decomposition for representations of quantum $\mathfrak{sl}_2$ at roots of unity. Our main result is the explicit formula for the weighted number of path…

This https://arxiv.org/abs/2309.07359 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Fast WDM provisioning with minimal probing: the first field experiments for DC exchanges
We propose an approach to estimate the end-to-end GSNR accurately in a short time when a data center interconnect (DCI) network operator receives a service request from users, not by measuring the GSNR at the operational route and wavelength for the End-End optical path but by simply applying a QoT probe channel link by link, at a convenient wavelength/modulation-format for measurement. Assuming connections between coherent transceivers of various frequency ranges, modulators, and modulation fo…

This https://arxiv.org/abs/2403.08678 has been replaced.
link: https://scholar.google.com/scholar?q=a

Path-dependency and leverage effect on capital return in periodic growth processes
Periodic growth processes are investigated. The expected value of the profit rate, on accrual basis, does not directly depend on divestments, neither on the capitalization path. The expected value of capitalization is path dependent. Because of the path-dependent capitalization, the return rate on capital is path-dependent, and the time-average return rate on capital differs from the expected value of return rate on capital for the growth cycle. In the absence of intermediate divestments, the i…

This https://arxiv.org/abs/2310.15106 has been replaced.
link: https://scholar.google.com/scholar?q=a

Theoretical Analysis of the Radio Map Estimation Problem
Radio maps provide radio frequency metrics, such as the received signal strength, at every location of a geographic area. These maps, which are estimated using a set of measurements collected at multiple positions, find a wide range of applications in wireless communications, including the prediction of coverage holes, network planning, resource allocation, and path planning for mobile robots. Although a vast number of estimators have been proposed, the theoretical understanding of the radio ma…

This https://arxiv.org/abs/2211.14361 has been replaced.
link: https://scholar.google.com/scholar?q=a

gatekeeper: Online Safety Verification and Control for Nonlinear Systems in Dynamic Environments
This paper presents the gatekeeper algorithm, a real-time and computationally-lightweight method that ensures that trajectories of a nonlinear system satisfy safety constraints despite sensing limitations. gatekeeper integrates with existing path planners and feedback controllers by introducing an additional verification step to ensure that proposed trajectories can be executed safely, despite nonlinear dynamics subject to bounded disturbances, input constraints and partial knowledge of the env…

My current take on the #xz situation, not having read the actual source backdoor commits yet (thanks a lot #Github for hiding the evidence at this point...) besides reading what others have written about it (cf. #rustlang for such central library dependencies would maybe (really big maybe) have made it a bit harder to push a backdoor like this because - if and only if the safety features are used idiomatically in an open source project - reasonably looking code is (a bit?) more limited in the sneaky behavior it could include. We should still very much use those languages over C/C for infrastructure code because the much larger class of unintentional bugs is significantly mitigated, but I believe (without data to back it up) that even such "bugdoor" type changes will be harder to execute. However, given the sophistication in this case, it may not have helped at all. The attacker(s) have shown to be clever enough.
6. Sandboxing library code may have helped - as the attacker(s) explicitly disabled e.g. landlock, that might already have had some impact. We should create better tooling to make it much easier to link to infrastructure libraries in a sandboxed way (although that will have performance implications in many cases).
7. Automatic reproducible builds verification would have mitigated this particular vector of backdoor distribution, and the Debian team seems to be using the reproducibility advances of the last decade to verify/rebuild the build servers. We should build library and infrastructure code in a fully reproducible manner *and* automatically verify it, e.g. with added transparency logs for both source and binary artefacts. In general, it does however not prevent this kind of supply chain attack that directly targets source code at the "leaf" projects in Git commits.
8. Verifying the real-life identity of contributors to open source projects is hard and a difficult trade-off. Something similar to the #Debian #OpenPGP #web-of-trust would potentially have mitigated this style of attack somewhat, but with a different trade-off. We might have to think much harder about trust in individual accounts, and for some projects requiring a link to a real-world country-issued ID document may be the right balance (for others it wouldn't work). That is neither an easy nor a quick path, though. Also note that sophisticated nation state attackers will probably not have a problem procuring "good" fake IDs. It might still raise the bar, though.
9. What happened here seems clearly criminal - at least under my IANAL naive understanding of EU criminal law. There was clear intent to cause harm, and that makes the specific method less important. The legal system should also be able to help in mitigating supply chain attacks; not in preventing them, but in making them more costly if attackers can be tracked down (this is difficult in itself, see point 8) and face risk of punishment after the fact.
H/T @… @… @… @… @…

This https://arxiv.org/abs/2310.14821 has been replaced.
link: https://scholar.google.com/scholar?q=a

Mysticeti: Low-Latency DAG Consensus with Fast Commit Path
We introduce Mysticeti-C a byzantine consensus protocol with low-latency and high resource efficiency. It leverages a DAG based on Threshold Clocks and incorporates innovations in pipelining and multiple leaders to reduce latency in the steady state and under crash failures. Mysticeti-FPC incorporates a fast commit path that has even lower latency. We prove the safety and liveness of the protocols in a byzantine context. We evaluate Mysticeti and compare it with state-of-the-art consensus and f…

This https://arxiv.org/abs/2401.08158 has been replaced.
link: https://scholar.google.com/scholar?q=a

The central limit theorem for the free path length of the periodic Lorentz gas in the Boltzmann-Grad limit
We prove the central limit theorem for the free path length of the periodic Lorentz gas in the Boltzmann-Grad limit. Our proof relies on the connection between the distribution of the free path length of the periodic Lorentz gas and the expanding translates of a unipotent subgroup on the lattice space, which was described in the seminal works of Marklof-Strömbergsson. Moreover, we obtain the asymptotic formula of the distribution function of the free path length and also derive the central lim…

This https://arxiv.org/abs/2402.03041 has been replaced.
link: https://scholar.google.com/scholar?q=a

Demystifying Datapath Accelerator Enhanced Off-path SmartNIC
Network speeds grow quickly in the modern cloud, so SmartNICs are introduced to offload network processing tasks, even application logic. However, typical multicore SmartNICs such as BlueFiled-2 are only capable of processing control-plane tasks with their embedded CPU that has limited memory bandwidth and computing power. On the other hand, hot cloud applications evolve, such that a limited number of fixed hardware engines in a SmartNIC cannot satisfy the requirements of cloud applications. Th…

This https://arxiv.org/abs/2207.04507 has been replaced.
link: https://scholar.google.com/scholar?q=a

Closing the Gap Between Directed Hopsets and Shortcut Sets
For an n-vertex directed graph $G = (V,E)$, a $β$-\emph{shortcut set} $H$ is a set of additional edges $H \subseteq V \times V$ such that $G \cup H$ has the same transitive closure as $G$, and for every pair $u,v \in V$, there is a $uv$-path in $G \cup H$ with at most $β$ edges. A natural generalization of shortcut sets to distances is a $(β,ε)$-\emph{hopset} $H \subseteq V \times V$, where the requirement is that $H$ and $G \cup H$ have the same shortest-path distances, and for every $u,v …

This https://arxiv.org/abs/2402.04791 has been replaced.
link: https://scholar.google.com/scholar?q=a

Visibility in Hypercubes
A set $\mathcal{X}$ of vertices in a graph $G$ is a mutual-visibility set if any two vertices $u$ and $v$ in $\mathcal{X}$ "see" each other in $G$, that is, there exists a shortest $u$-$v$ path in $G$ that contains no elements of $\mathcal{X}$ as internal vertices. The mutual-visibility number of a graph $G$, denoted $μ(G)$, is the largest size of a mutual-visibility set in $G$. This notion was introduced by Di Stefano and studied for various product graphs, particularly hypercubes, motivated …

This https://arxiv.org/abs/2309.09882 has been replaced.
link: https://scholar.google.com/scholar?q=a

Differentiable Boustrophedon Paths That Enable Optimization Via Gradient Descent
This paper introduces a differentiable representation for the optimization of boustrophedon path plans in convex polygons, explores an additional parameter of these path plans that can be optimized, discusses the properties of this representation that can be leveraged during the optimization process and shows that the previously published attempt at optimization of these path plans was too coarse to be practically useful. Experiments were conducted to show that this differentiable representatio…

This https://arxiv.org/abs/1907.00092 has been replaced.
link: https://scholar.google.com/scholar?q=a

Neck-Pinching of $CP^1$-structures in the $PSL(2,C)$-character variety
We characterize a certain neck-pinching degeneration of (marked) $CP^1$- structures on a closed oriented surface S of genus at least two. Namely, we consider a path $C_t$ of $CP^1$-structures on S leaving every compact subset in the deformation space of (marked) $CP^1$-structures on S, such that its holonomy converges in the PSL(2, C)-character variety. In this setting, it is known that the complex structure $X_t$ of $C_t$ also leaves every compact subset in the Teichmüller space. In this pa…

This https://arxiv.org/abs/2210.05325 has been replaced.
link: https://scholar.google.com/scholar?q=a

Modeling and Performance Analysis for Movable Antenna Enabled Wireless Communications
In this paper, we propose a novel antenna architecture called movable antenna (MA) to improve the performance of wireless communication systems. Different from conventional fixed-position antennas (FPAs) that undergo random wireless channel variation, the MAs with the capability of flexible movement can be deployed at positions with more favorable channel conditions to achieve higher spatial diversity gains. To characterize the general multi-path channel in a given region or field where the MAs…

This https://arxiv.org/abs/2402.04791 has been replaced.
link: https://scholar.google.com/scholar?q=a

Visibility in Hypercubes
A set $\mathcal{X}$ of vertices in a graph $G$ is a mutual-visibility set if any two vertices $u$ and $v$ in $\mathcal{X}$ "see" each other in $G$, that is, there exists a shortest $u$-$v$ path in $G$ that contains no elements of $\mathcal{X}$ as internal vertices. The mutual-visibility number of a graph $G$, denoted $μ(G)$, is the largest size of a mutual-visibility set in $G$. This notion was introduced by Di Stefano and studied for various product graphs, particularly hypercubes, motivated …

This https://arxiv.org/abs/2210.12127 has been replaced.
link: https://scholar.google.com/scholar?q=a

CFT$_D$ from TQFT$_{D+1}$ via Holographic Tensor Network, and Precision Discretisation of CFT$_2$
We show that the path-integral of conformal field theories in $D$ dimensions (CFT$_D$) can be constructed by solving for eigenstates of an RG operator following from the Turaev-Viro formulation of a topological field theory in $D+1$ dimensions (TQFT$_{D+1}$), explicitly realising the holographic sandwich relation between a symmetric theory and a TQFT. Generically, exact eigenstates corresponding to symmetric-TQFT$_D$ follow from Frobenius algebra in the TQFT$_{D+1}$. For $D=2$, we constructed e…

This https://arxiv.org/abs/2309.01604 has been replaced.
link: https://scholar.google.com/scholar?q=a

Optimal Real Time Drone Path Planning for Harvesting Information from a Wireless Sensor Network
We consider a remote sensing system in which fixed sensors are placed in a region, and a drone flies over the region to collect information from cluster heads. We assume that the drone has a fixed maximum range, and that the energy consumption for information transmission from the cluster heads increases with distance according to a power law. Given these assumptions, we derive local optimum conditions for a drone path that either minimizes the total energy or the maximum energy required by the…

This https://arxiv.org/abs/2208.13276 has been replaced.
link: https://scholar.google.com/scholar?q=a

Mean viability theorems and second-order Hamilton-Jacobi equations
We introduce the notion of mean viability for controlled stochastic differential equations and establish counterparts of Nagumo's classical viability theorems (necessary and sufficient conditions for mean viability). As an application, we provide a purely probabilistic proof of a comparison principle and of existence for contingent and viscosity solutions of second-order fully nonlinear path-dependent Hamilton-Jacobi-Bellman equations. We do not use compactness and optimal stopping arguments, w…

This https://arxiv.org/abs/1611.09327 has been replaced.
link: https://scholar.google.com/scholar?q=a

The Grothendieck ring of varieties and algebraic K-theory of spaces
Waldhausen's algebraic K-theory machinery is applied to motivic homotopy theory, producing an interesting motivic homotopy type. Over a field F of characteristic zero, its path components receive a surjective ring homomorphism from the Grothendieck ring of varieties over F.

This https://arxiv.org/abs/2304.08146 has been replaced.
link: https://scholar.google.com/scholar?q=a

2D Forward Looking Sonar Simulation with Ground Echo Modeling
Imaging sonar produces clear images in underwater environments, independent of water turbidity and lighting conditions. The next generation 2D forward looking sonars are compact in size and able to generate high-resolution images which facilitate underwater robotics research. Considering the difficulties and expenses of implementing experiments in underwater environments, tremendous work has been focused on sonar image simulation. However, sonar artifacts like multi-path reflection were not suf…

This https://arxiv.org/abs/2203.14127 has been replaced.
link: https://scholar.google.com/scholar?q=a

Substitution-dynamics and invariant measures for infinite alphabet-path space
We study substitutions on countably infinite alphabet (without compactification) as Borel dynamical systems. We construct stationary and non-stationary generalized Bratteli-Vershik models for a class of such substitutions, known as left determined. In this setting of Borel dynamics, using a stationary generalized Bratteli-Vershik model, we provide a new and canonical construction of shift-invariant measures (both finite and infinite) for the associated class of subshifts.

This https://arxiv.org/abs/2402.05414 has been replaced.
link: https://scholar.google.com/scholar?q=a

Splitting probabilities as optimal controllers of rare reactive events
The committor constitutes the primary quantity of interest within chemical kinetics as it is understood to encode the ideal reaction coordinate for a rare reactive event. We show the generative utility of the committor, in that it can be used explicitly to produce a reactive trajectory ensemble that exhibits numerically exact statistics as that of the original transition path ensemble. This is done by relating a time-dependent analogue of the committor that solves a generalized bridge problem, …

This https://arxiv.org/abs/2011.11816 has been replaced.
link: https://scholar.google.com/scholar?q=a

Chain Conditions for Etale Groupoid Algebras
Let $R$ be a unital commutative ring with unit and $\mathscr{G}$ an ample groupoid. Using the topology of the groupoid $\mathscr{G}$, Steinberg defined an etale groupoid algebra $R\mathscr{G}$. These etale groupoid algebras generalize various algebras including group algebras, commutative algebras over a field generated by idempotents, traditional groupoid algebras, Leavitt path algebras, higher-rank graph algebras, and inverse semigroup algebras. Steinberg later characterized the classical cha…

This https://arxiv.org/abs/2401.03630 has been replaced.
link: https://scholar.google.com/scholar?q=a

Why Solving Multi-agent Path Finding with Large Language Model has not Succeeded Yet
With the explosive influence caused by the success of large language models (LLM) like ChatGPT and GPT-4, there has been an extensive amount of recent work showing that foundation models can be used to solve a large variety of tasks. However, there is very limited work that shares insights on multi-agent planning. Multi-agent planning is different from other domains by combining the difficulty of multi-agent coordination and planning, and making it hard to leverage external tools to facilitate …

This https://arxiv.org/abs/2211.11422 has been replaced.
link: https://scholar.google.com/scholar?q=a

Breakdown of the Meissner effect at the zero exceptional point in non-Hermitian two-band BCS model
The spontaneous symmetry breaking of a continuous symmetry in complex field theory at the exceptional point of the parameter space is known to exhibit interesting phenomena, such as the breakdown of a Higgs mechanism. In this work, we derive the complex Ginzburg-Landau model from a non-Hermitian two-band BCS model via path integral and investigate its spontaneous symmetry breaking. We find that analog to the Higgs mechanism, the Meissner effect of the complex Ginzburg-Landau model also breaks d…

This https://arxiv.org/abs/2403.02153 has been replaced.
link: https://scholar.google.com/scholar?q=a

Three-dimensional theory of superradiant free-electron lasers
The soliton-like superradiant regime of free-electron lasers (FEL) offers a promising path towards ultrashort pulses, beyond the natural limit dictated by the bandwidth of the high-gain FEL instability. In this work we present a three-dimensional theory of the superradiant regime. Our work takes advantage of recent developments in non-linear FEL theory to provide a fully analytical description of soliton-like superradiance. Our theory proves the existence of a diffraction-dominated steady-state…

This https://arxiv.org/abs/2310.14941 has been replaced.
link: https://scholar.google.com/scholar?q=a

Is dynamic dedicated path protection tractable?
Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networks, this limit can be introduced by the signal modulation reach. Even without this limit, the existing literature suggested the problem intractable because of the spectrum continuity and contiguity constraints, but we show that the problem can be solved exactly with the recently-proposed generic Dijkstra algorithm ove…

This https://arxiv.org/abs/2210.12127 has been replaced.
link: https://scholar.google.com/scholar?q=a

CFT$_D$ from TQFT$_{D+1}$ via Holographic Tensor Network, and Precision Discretisation of CFT$_2$
We show that the path-integral of conformal field theories in $D$ dimensions (CFT$_D$) can be constructed by solving for eigenstates of an RG operator following from the Turaev-Viro formulation of a topological field theory in $D+1$ dimensions (TQFT$_{D+1}$), explicitly realising the holographic sandwich relation between a symmetric theory and a TQFT. Generically, exact eigenstates corresponding to symmetric-TQFT$_D$ follow from Frobenius algebra in the TQFT$_{D+1}$. For $D=2$, we constructed e…

This https://arxiv.org/abs/2402.03499 has been replaced.
link: https://scholar.google.com/scholar?q=a

A quantitative assessment of Geant4 for predicting the yield and distribution of positron-emitting fragments in ion beam therapy
Purpose: To compare the accuracy with which different hadronic inelastic physics models across ten Geant4 Monte Carlo simulation toolkit versions can predict positron-emitting fragments produced along the beam path during carbon and oxygen ion therapy. Materials and Methods: Phantoms of polyethylene, gelatin or poly(methyl methacrylate) were irradiated with monoenergetic carbon and oxygen ion beams. Post-irradiation, 4D PET images were acquired and parent $^{11}$C, $^{10}$C and $^{15}$O radio…

Broadened-beam Uniform Rectangular Array Coefficient Design in LEO SatComs Under Quality of Service and Constant Modulus Constraints
Weiting Lin, Yuchieh Wu, Borching Su
https://arxiv.org/abs/2403.07435

Broadened-beam Uniform Rectangular Array Coefficient Design in LEO SatComs Under Quality of Service and Constant Modulus Constraints
Satellite communications (SatComs) are anticipated to provide global Internet access. Low Earth orbit (LEO) satellites (SATs) have the advantage of providing higher downlink capacity owing to their smaller link budget compared with medium Earth orbit (MEO) and geostationary Earth orbit (GEO) SATs. In this paper, beam-broadening algorithms for uniform rectangular arrays (URAs) in LEO SatComs were studied. The proposed method is the first of its kind that jointly considers the path loss variation…

This https://arxiv.org/abs/2207.04251 has been replaced.
link: https://scholar.google.com/scholar?q=a

Regularization by noise for rough differential equations driven by Gaussian rough paths
We consider the rough differential equation with drift driven by a Gaussian geometric rough path. Under natural conditions on the rough path, namely non-determinism, and uniform ellipticity conditions on the diffusion coefficient, we prove path-by-path well-posedness of the equation for poorly regular drifts. In the case of the fractional Brownian motion $B^H$ for $H>\frac14$, we prove that the drift may be taken to be $κ>0$ Hölder continuous and bounded for $κ>\frac32 - \frac1{2H}$. A flow …

This https://arxiv.org/abs/2102.07894 has been replaced.
link: https://scholar.google.com/scholar?q=a

The path-missing and path-free complexes of a directed graph
We study two simplicial complexes arising from a directed graph $G = (V, E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $F \subseteq E$ that contain no path from $s$ to $t$, and the *path-missing complex*, its Alexander dual. Using discrete Morse theory, we prove that both complexes have well-behaved homotopy types -- either contractible or homotopy-equivalent to spheres.

This https://arxiv.org/abs/2205.06011 has been replaced.
link: https://scholar.google.com/scholar?q=a

Mobility-Aware Resource Allocation for mmWave IAB Networks: A Multi-Agent Reinforcement Learning Approach
MmWaves have been envisioned as a promising direction to provide Gbps wireless access. However, they are susceptible to high path losses and blockages, which directional antennas can only partially mitigate. That makes mmWave networks coverage-limited, thus requiring dense deployments. Integrated access and backhaul (IAB) architectures have emerged as a cost-effective solution for network densification. Resource allocation in mmWave IAB networks must face big challenges to cope with heavy tempo…

This https://arxiv.org/abs/2304.00742 has been replaced.
link: https://scholar.google.com/scholar?q=a

Counting the minimum number of arcs in an oriented graph having weak diameter 2
An oriented graph has weak diameter at most $d$ if every non-adjacent pair of vertices are connected by a directed $d$-path. The function $f_d(n)$ denotes the minimum number of arcs in an oriented graph on $n$ vertices having weak diameter $d$. Finding the exact value of $f_d(n)$ is a challenging problem even for $d = 2$. This function was introduced by Katona and Szemeredi (1967), and after that several attempts were made to find its exact value by Znam (1970), Dawes and Meijer (1987), Furedi,…

This https://arxiv.org/abs/2309.13882 has been replaced.
link: https://scholar.google.com/scholar?q=a

FC-Planner: A Skeleton-guided Planning Framework for Fast Aerial Coverage of Complex 3D Scenes
3D coverage path planning for UAVs is a crucial problem in diverse practical applications. However, existing methods have shown unsatisfactory system simplicity, computation efficiency, and path quality in large and complex scenes. To address these challenges, we propose FC-Planner, a skeleton-guided planning framework that can achieve fast aerial coverage of complex 3D scenes without pre-processing. We decompose the scene into several simple subspaces by a skeleton-based space decomposition (S…

This https://arxiv.org/abs/2206.08810 has been replaced.
link: https://scholar.google.com/scholar?q=a

Interior point methods are not worse than Simplex
We develop a new `subspace layered least squares' interior point method (IPM) for solving linear programs. Applied to an $n$-variable linear program in standard form, the iteration complexity of our IPM is up to an $O(n^{1.5} \log n)$ factor upper bounded by the \emph{straight line complexity} (SLC) of the linear program. This term refers to the minimum number of segments of any piecewise linear curve that traverses the \emph{wide neighborhood} of the central path, a lower bound on the iteratio…

This https://arxiv.org/abs/2102.07894 has been replaced.
link: https://scholar.google.com/scholar?q=a

The path-missing and path-free complexes of a directed graph
We study two simplicial complexes arising from a directed graph $G = (V, E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $F \subseteq E$ that contain no path from $s$ to $t$, and the *path-missing complex*, its Alexander dual. Using discrete Morse theory, we prove that both complexes have well-behaved homotopy types -- either contractible or homotopy-equivalent to spheres.

This https://arxiv.org/abs/2210.07748 has been replaced.
link: https://scholar.google.com/scholar?q=a

Addressing energy density functionals in the language of path-integrals II: Comparative study of functional renormalization group techniques applied to the (0+0)-D $O(N)$-symmetric $φ^{4}$-theory
The present paper is the second of a series of publications that aim at investigating relevant directions to turn the nuclear energy density functional (EDF) method as an effective field theory (EFT). The EDF approach has known numerous successes in nuclear theory over the past decades and is currently the only microscopic technique that can be applied to all atomic nuclei. However, the phenomenological character of the EDF method also comes with important limitations, such as the lack of an ex…

This https://arxiv.org/abs/2311.11793 has been replaced.
link: https://scholar.google.com/scholar?q=a

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
This paper proves that Dijkstra's shortest-path algorithm is universally optimal in both its running time and number of comparisons when combined with a sufficiently efficient heap data structure. Universal optimality is a powerful beyond-worst-case performance guarantee for graph algorithms that informally states that a single algorithm performs as well as possible for every single graph topology. We give the first application of this notion to any sequential algorithm. We design a new hea…

This https://arxiv.org/abs/2207.04251 has been replaced.
link: https://scholar.google.com/scholar?q=a

Regularization by noise for rough differential equations driven by Gaussian rough paths
We consider the rough differential equation with drift driven by a Gaussian geometric rough path. Under natural conditions on the rough path, namely non-determinism, and uniform ellipticity conditions on the diffusion coefficient, we prove path-by-path well-posedness of the equation for poorly regular drifts. In the case of the fractional Brownian motion $B^H$ for $H>\frac14$, we prove that the drift may be taken to be $κ>0$ Hölder continuous and bounded for $κ>\frac32 - \frac1{2H}$. A flow …

This https://arxiv.org/abs/2312.10914 has been replaced.
link: https://scholar.google.com/scholar?q=a

A Note on Graph Burning of Path Forests
Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the burning number conjecture, which says that every connected graph of order $m^2$ has burning number at most $m$. Earlier, we showed that the conjecture also holds for a path forest, which is disconnected, provided each of its paths is sufficiently long. However, finding the least sufficient length for this to hold turn…

This https://arxiv.org/abs/2309.09101 has been replaced.
link: https://scholar.google.com/scholar?q=a

Behavioral-based circular formation control for robot swarms
This paper focuses on coordinating a robot swarm orbiting a convex path without collisions among the individuals. The individual robots lack braking capabilities and can only adjust their courses while maintaining their constant but different speeds. Instead of controlling the spatial relations between the robots, our formation control algorithm aims to deploy a dense robot swarm that mimics the behavior of tornado schooling fish. To achieve this objective safely, we employ a combination of a s…

This https://arxiv.org/abs/2205.06011 has been replaced.
link: https://scholar.google.com/scholar?q=a

Mobility-Aware Resource Allocation for mmWave IAB Networks: A Multi-Agent Reinforcement Learning Approach
MmWaves have been envisioned as a promising direction to provide Gbps wireless access. However, they are susceptible to high path losses and blockages, which directional antennas can only partially mitigate. That makes mmWave networks coverage-limited, thus requiring dense deployments. Integrated access and backhaul (IAB) architectures have emerged as a cost-effective solution for network densification. Resource allocation in mmWave IAB networks must face big challenges to cope with heavy tempo…

Unlocking Electro-optic Resonant Phase Shifting for Multi-dimensional, Ultra-dynamic Photonic Switches
Lingzhi Luo, Rui Ma, Richard V. Penty, Qixiang Cheng
https://arxiv.org/abs/2403.02866

Unlocking Electro-optic Resonant Phase Shifting for Multi-dimensional, Ultra-dynamic Photonic Switches
Optical circuit switching is connection-oriented, being deterministic through the reservation of a complete wavelength channel or spatial path for a certain period. However, this comes at a trade-off against link dynamics, and overall capacity can thus be constrained by the time slot reservations, especially for switches with microsecond- to millisecond-scale reconfiguration times. For data-intensive applications, the communication patterns associated with random data sets typically yield short…

This https://arxiv.org/abs/2309.09101 has been replaced.
link: https://scholar.google.com/scholar?q=a

Behavioral-based circular formation control for robot swarms
This paper focuses on coordinating a robot swarm orbiting a convex path without collisions among the individuals. The individual robots lack braking capabilities and can only adjust their courses while maintaining their constant but different speeds. Instead of controlling the spatial relations between the robots, our formation control algorithm aims to deploy a dense robot swarm that mimics the behavior of tornado schooling fish. To achieve this objective safely, we employ a combination of a s…

This https://arxiv.org/abs/2402.04913 has been replaced.
link: https://scholar.google.com/scholar?q=a

Hashing Beam Training for Near-Field Integrated Sensing and Communication Systems
In millimeter-wave (mmWave) integrated sensing and communication networks, users may be within the coverage of multiple access points (AP), which typically employ large-scale antenna arrays to mitigate obstacle occlusion and path loss. However, large-scale arrays generate pencil-shaped beams, which necessitate a higher number of training beams to cover the desired space. Furthermore, as the antenna aperture increases, users are more likely to be situated in the near-field region of the AP anten…

This https://arxiv.org/abs/2001.04447 has been replaced.
link: https://scholar.google.com/scholar?q=a

Scattering and Sparse Partitions, and their Applications
A partition $\mathcal{P}$ of a weighted graph $G$ is $(σ,τ,Δ)$-sparse if every cluster has diameter at most $Δ$, and every ball of radius $Δ/σ$ intersects at most $τ$ clusters. Similarly, $\mathcal{P}$ is $(σ,τ,Δ)$-scattering if instead for balls we require that every shortest path of length at most $Δ/σ$ intersects at most $τ$ clusters. Given a graph $G$ that admits a $(σ,τ,Δ)$-sparse partition for all $Δ>0$, Jia et al. [STOC05] constructed a solution for the Universal Steiner…

This https://arxiv.org/abs/2207.12128 has been replaced.
link: https://scholar.google.com/scholar?q=a

Some Extensions of Thomassen's Theorem to Longer Paths
Let $G$ be a planar embedding with list-assignment $L$ and outer cycle $C$, and let $P$ be a path of length at most four on $C$, where each vertex of $G\setminus C$ has a list of size at least five and each vertex of $C\setminus P$ has a list of size at least three. In this paper, we prove some results about partial $L$-colorings $ϕ$ of $C$ with the property that any extension of $ϕ$ to an $L$-coloring of $\textrm{dom}(ϕ)\cup V(P)$ extends to $L$-color all of $G$. We use these results in a l…

This https://arxiv.org/abs/2309.13720 has been replaced.
link: https://scholar.google.com/scholar?q=a

Design and Evaluation of Motion Planners for Quadrotors in Environments with Varying Complexities
Motion planning techniques for quadrotors have advanced significantly over the past decade. Most successful planners have two stages: a front-end that determines a path that incorporates geometric (or kinematic or input) constraints and specifies the homotopy class of the trajectory, and a back-end that optimizes this path to respect dynamics and input constraints. While there are many different choices for each stage, the eventual performance depends critically not only on these choices, but a…

This https://arxiv.org/abs/2304.08356 has been replaced.
link: https://scholar.google.com/scholar?q=a

MANTRA: Temporal Betweenness Centrality Approximation through Sampling
We present MANTRA, a framework for approximating the temporal betweenness centrality of all nodes in a temporal graph. Our method can compute probabilistically guaranteed high-quality temporal betweenness estimates (of nodes and temporal edges) under all the feasible temporal path optimalities, presented in the work of Buß et al. (KDD, 2020). We provide a sample-complexity analysis of our method and speed up the temporal betweenness computation using a state-of-the-art progressive sampling app…

This https://arxiv.org/abs/2310.07621 has been replaced.
link: https://scholar.google.com/scholar?q=a

AG-CVG: Coverage Planning with a Mobile Recharging UGV and an Energy-Constrained UAV
In this paper, we present an approach for coverage path planning for a team of an energy-constrained Unmanned Aerial Vehicle (UAV) and an Unmanned Ground Vehicle (UGV). Both the UAV and the UGV have predefined areas that they have to cover. The goal is to perform complete coverage by both robots while minimizing the coverage time. The UGV can also serve as a mobile recharging station. The UAV and UGV need to occasionally rendezvous for recharging. We propose a heuristic method to address this N…

This https://arxiv.org/abs/1906.04781 has been replaced.
link: https://scholar.google.com/scholar?q=a

Path Cohomology of Locally Finite Digraphs,Hodge's Theorem and the $p$-Lazy Random Walk
The study of Markov chains on discrete spaces, such as digraphs, has captivated mathematicians in recent decades due to its interconnectedness with topology, geometry, dynamics, spectral theory, and differential equations. Furthermore, extensive exploration of these multifaceted relationships has been pursued for their practical utility in diverse fields, including machine learning and image segmentation. In recent times, these interrelations have been generalized to higher dimensions within th…

This https://arxiv.org/abs/2310.00685 has been replaced.
link: https://scholar.google.com/scholar?q=a

Active Implicit Reconstruction Using One-Shot View Planning
Active object reconstruction using autonomous robots is gaining great interest. A primary goal in this task is to maximize the information of the object to be reconstructed, given limited on-board resources. Previous view planning methods exhibit inefficiency since they rely on an iterative paradigm based on explicit representations, consisting of (1) planning a path to the next-best view only; and (2) requiring a considerable number of less-gain views in terms of surface coverage. To address t…

This https://arxiv.org/abs/2310.00684 has been replaced.
link: https://scholar.google.com/scholar?q=a

How Many Views Are Needed to Reconstruct an Unknown Object Using NeRF?
Neural Radiance Fields (NeRFs) are gaining significant interest for online active object reconstruction due to their exceptional memory efficiency and requirement for only posed RGB inputs. Previous NeRF-based view planning methods exhibit computational inefficiency since they rely on an iterative paradigm, consisting of (1) retraining the NeRF when new images arrive; and (2) planning a path to the next best view only. To address these limitations, we propose a non-iterative pipeline based on t…

This https://arxiv.org/abs/2205.15096 has been replaced.
link: https://scholar.google.com/scholar?q=a

Linear versus centred chromatic numbers
$\DeclareMathOperator{\chicen}{χ_{\mathrm{cen}}}\DeclareMathOperator{\chilin}{χ_{\mathrm{lin}}}$ A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a \emph{linear colouring} is a vertex colouring in which every (not-necessarily induced) path contains a vertex whose colour is unique. For a graph $G$, the centred chromatic number $\chicen(G)$ and the linear chromatic number $\chilin(G)$ denote the minimum number of…

This https://arxiv.org/abs/2210.07592 has been replaced.
link: https://scholar.google.com/scholar?q=a

TSP-Bot: Robotic TSP Pen Art using High-DoF Manipulators
TSP art is an art form for drawing an image using piecewise-continuous line segments. We present TSP-Bot, a robotic pen drawing system capable of creating complicated TSP pen art on a planar surface using multiple colors. The system begins by converting a colored raster image into a set of points that represent the image's tone, which can be controlled by adjusting the point density. Next, the system finds a piecewise-continuous linear path that visits each point exactly once, which is equivale…

This https://arxiv.org/abs/2312.11180 has been replaced.
link: https://scholar.google.com/scholar?q=a

Massive SLE$_4$, massive CLE$_4$ and the massive planar GFF
We construct a coupling between a massive GFF and a random curve in which the curve can be interpreted as the level line of the field and has the law of massive SLE$_4$. This coupling is obtained by reweighting the law of the standard coupling GFF-SLE$_4$ and our result can be seen as a conditional version of the path-integral formulation of the massive GFF. We then show that by reweighting the law of the coupling GFF-CLE$_4$ in a similar way, one obtains a coupling between a massive GFF and a …