One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node...

В работе рассматриваются проблемы обеспечения устойчивого развития социо-эколого-экономической системы. В качестве инструмента исследования нестабильной...

This article proposes a theoretical and practical extension of the IoT, taking in all "things" that can be sensed by sensors, without requiring them to be fitted with a tag or a digital network interface. These physical entities, whatever they may be (legacy appliances, passive items, subsets of...