相关论文: Irrigable Measures for Weighted Irrigation Plans

Climate change is amplifying extreme precipitation events in many regions and imposes substantial challenges for the resilience of road drainage infrastructure. Conventional design storm methodologies, which rely on historical trends of…

Tree-based networks are a class of phylogenetic networks that attempt to formally capture what is meant by "tree-like" evolution. A given non-tree-based phylogenetic network, however, might appear to be very close to being tree-based, or…

This paper introduces \textit{measurement trees}, a novel class of metrics designed to combine various constructs into an interpretable multi-level representation of a measurand. Unlike conventional metrics that yield single values,…

The unsupervised task of aligning two or more distributions in a shared latent space has many applications including fair representations, batch effect mitigation, and unsupervised domain adaptation. Existing flow-based approaches estimate…

Inspired by the infinite families of finite and affine root systems, we consider a "stretching" operation on general crystallographic root systems which, on the level of Coxeter diagrams, replaces a vertex with a path of unlabeled edges. We…

The hillslope hydrological processes are very important in watershed hydrology research. In this paper we focus on the water flow over the soil surface with vegetation in a hydrographic basin. We introduce a PDE model based on general…

A $t$-spanner of a weighted undirected graph $G=(V,E)$, is a subgraph $H$ such that $d_H(u,v)\le t\cdot d_G(u,v)$ for all $u,v\in V$. The sparseness of the spanner can be measured by its size (the number of edges) and weight (the sum of all…

High-dimensional longitudinal data have become increasingly prevalent in recent studies, and penalized generalized estimating equations (GEEs) are often used to model such data. However, the desirable properties of the GEE method can break…

In [Aldous,Pitman,1998] a tree-valued Markov chain is derived by pruning off more and more subtrees along the edges of a Galton-Watson tree. More recently, in [Abraham,Delmas,2012], a continuous analogue of the tree-valued pruning dynamics…

In classification and forecasting with tabular data, one often utilizes tree-based models. Those can be competitive with deep neural networks on tabular data and, under some conditions, explainable. The explainability depends on the depth…

Precision agriculture increasingly integrates artificial intelligence to enhance crop monitoring, irrigation management, and resource efficiency. Nevertheless, the vast majority of the current systems are still mostly cloud-based and…

We experimentally examined the amount of water retention in a model soil composed of aggregated glass beads. The model soil was characterized by two size parameters: size of aggregates $D$ and size of monomer particles (composing…

In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…

A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…

On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…

A subset of leaves of a rooted tree induces a new tree in a natural way. The density of a tree $D$ inside a larger tree $T$ is the proportion of such leaf-induced subtrees in $T$ that are isomorphic to $D$ among all those with the same…

In this note, we revisit the problem of flow approximation properties of neural ordinary differential equations (NODEs). The approximation properties have been considered as a flow controllability problem in recent literature. The neural…

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

This paper presents the design and implementation of an automated water irrigation system aimed at optimizing plant care through precision moisture monitoring and controlled water delivery. The system uses a capacitive soil moisture sensor,…

We study the computation of the flow of water on imprecise terrains. We consider two approaches to modeling flow on a terrain: one where water flows across the surface of a polyhedral terrain in the direction of steepest descent, and one…