相关论文: Irrigable Measures for Weighted Irrigation Plans

We investigate the following question: what is the set of unit volume which can be best irrigated starting from a single source at the origin, in the sense of branched transport? We may formulate this question as a shape optimization…

A number of recent works have employed decision trees for the construction of explainable partitions that aim to minimize the $k$-means cost function. These works, however, largely ignore metrics related to the depths of the leaves in the…

In this paper we develop a reliable system for smart irrigation of greenhouses using artificial neural networks, and an IoT architecture. Our solution uses four sensors in different layers of soil to predict future moisture. Using a dataset…

For an increasing weighted tree $G_\omega$, we obtain an asymptotic value and a sharp bound on the index stability of the depth function of its edge ideal $I(G_\omega)$. Moreover, if $G_\omega$ is a strictly increasing weighted tree, we…

Over the past decade, the use of machine learning has increased exponentially. Models are far more complex than ever before, growing to gargantuan sizes and housing millions of weights. Unfortunately, the fact that large models have become…

We present an analytical-numerical method providing robust upper estimates for the topological entropy or, more generally, uniform volume growth exponents of differentiable mappings. By introducing varying metrics, we simplify the analysis…

Water governing systems are twisted with complex interplays among levels and scales which embody their structures. Typically, the mismatch between human-generated and natural systems produces externalities and inefficiencies reflectable in…

The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring…

Measure of the weighted cumulative entropy about the predictability of failure time of a system have been introduced in [3]. Referring properties of doubly truncated (interval) cumulative residual and past entropy, several bounds and…

Large bibliographic networks are sparse -- the average node degree is small. This is not necessarily true for their product -- in some cases, it can ``explode'' (it is not sparse, increases in time and space complexity). An approach in such…

This paper deals with the multiobjective version of the optimal spanning tree problem. More precisely, we are interested in determining the optimal spanning tree according to an Ordered Weighted Average (OWA) of its objective values. We…

We introduce a new measure for the stability of structures, such as the cross-section of the deck of a suspension bridge, subject to a 2D fluid force, such as the lift exerted by a laminar wind. We consider a wide class of possible flows,…

Hex-trees are identified as a particular instance of weighted unary-binary trees. The Horton-Strahler numbers of these objects are revisited, and, thanks to a substitution that is not immediately intuitive, explicit results are possible.…

Lower bounds are given for the depths of R/I^t for t at least one when I is the edge ideal of a tree or forest. The bounds are given in terms of the diameter of the tree, or in case of a forest, the largest diameter of a connected component…

A model is presented for the gravity-driven flow of rainwater descending through the soil layer of a green roof, treated as a porous medium on a flat permeable surface representing an efficient drainage layer. A fully saturated zone is…

We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has been observed that the vertices which are separated from the…

Inspired by studies on airline networks we propose a general model for weighted networks in which topological growth and weight dynamics are both determined by cost adversarial mechanism. Since transportation networks are designed and…

In this article, we discuss sixth-order and seventh-order iterative methods for nonlinear equations. Derivative-based and derivative-free, both categories are presented for said iterative methods. Especially sixth-order derivative-based and…

We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minimize the sum of the colors' weights. We present a…

We provide attainable analytical tools to estimate the error of flow-based generative models under the Wasserstein metric and to establish the optimal sampling iteration complexity bound with respect to dimension as $O(\sqrt{d})$. We show…