相关论文: Irrigable Measures for Weighted Irrigation Plans

We introduce the notions of over- and under-independence for weakly mixing and (free) ergodic measure preserving actions and establish new results which complement and extend the theorems obtained in [BoFW] and [A]. Here is a sample of…

The IoT vision of ubiquitous and pervasive computing gives rise to future smart irrigation systems comprising physical and digital world. Smart irrigation ecosystem combined with Machine Learning can provide solutions that successfully…

We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted…

Climate change has caused reductions in river runoffs and aquifer recharge resulting in an increasingly unsustainable crop water demand from reduced freshwater availability. Achieving food security while deploying water in a sustainable…

We introduce a flow-dependent version of the quadratic Steiner tree problem in the plane. An instance of the problem on a set of embedded sources and a sink asks for a directed tree $T$ spanning these nodes and a bounded number of Steiner…

An adjoint-based procedure to determine weaknesses, or, more generally the material properties of structures is developed and tested. Given a series of force and deformation/strain measurements, the material properties are obtained by…

This paper studies reduced-order modeling of dynamic networks with strongly connected topology. Given a graph clustering of an original complex network, we construct a quotient graph with less number of vertices, where the edge weights are…

The Edge Multicut problem is a classical cut problem where given an undirected graph $G$, a set of pairs of vertices $\mathcal{P}$, and a budget $k$, the goal is to determine if there is a set $S$ of at most $k$ edges such that for each…

The integration of more renewable energy sources into the power system is presenting system operators with various challenges. At the distribution system level, voltage magnitudes that violate operating limits near large photovoltaic…

A weighted directed network (WDN) is a directed graph in which each edge is associated to a unique value called weight. These networks are very suitable for modeling real-world social networks in which there is an assessment of one vertex…

In this article, we give a full description of the Wadge degrees of Borel functions from $\omega^\omega$ to a better quasi ordering $\mathcal{Q}$. More precisely, for any countable ordinal $\xi$, we show that the Wadge degrees of…

Criteria for subnormality of unbounded injective weighted shifts on leafless directed trees with one branching vertex are proposed. The case of classical weighted shifts is discussed. The relevance of an inductive limit approach to…

The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such…

We study the task of selecting $k$ nodes, in a social network of size $n$, to seed a diffusion with maximum expected spread size, under the independent cascade model with cascade probability $p$. Most of the previous work on this problem…

Given an edge-weighted tree $T$ with $n$ leaves, sample the leaves uniformly at random without replacement and let $W_k$, $2 \le k \le n$, be the length of the subtree spanned by the first $k$ leaves. We consider the question, "Can $T$ be…

Using the requisition papers of Chinese Nature Science Basic Research in management and information department, we construct the weighted network of research areas({\bf WRAN}) represented by the subject codes. In WRAN, two research areas…

Nowadays new technologies, and especially artificial intelligence, are more and more established in our society. Big data analysis and machine learning, two sub-fields of artificial intelligence, are at the core of many recent breakthroughs…

We study the complexity of cutting planes and branching schemes from a theoretical point of view. We give some rigorous underpinnings to the empirically observed phenomenon that combining cutting planes and branching into a branch-and-cut…

This paper presents a new approach for optimising the design of tidal stream turbine farms. In this approach, the turbine farm is represented by a turbine density function that specifies the number of turbines per unit area and an…

Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees, for example regarding the required work to balance annotated trees. While usual weight-balanced trees perform…