Results 21 to 30 of about 876,573 (316)
A Theorem on Flows in Networks [PDF]
The theorem to be proved in this note is a generalization of a well-known combinatorial theorem of P. Hall, [4].
openaire +3 more sources
Laplacians for flow networks [PDF]
We define a class of Laplacians for multicommodity, undirected flow networks, and bound their smallest nonzero eigenvalues with a generalization of the sparsest cut.
Taylor, Joshua A., Hover, Franz S.
openaire +2 more sources
Towards Distributed Lexicographically Fair Resource Allocation with an Indivisible Constraint
In the cloud computing and big data era, data analysis jobs are usually executed over geo-distributed data centers to make use of data locality. When there are not enough resources to fully meet the demands of all the jobs, allocating resources fairly ...
Chuanyou Li +3 more
doaj +1 more source
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the transported quantity in the neighboring cells.
Pierre Degond +2 more
openaire +4 more sources
This paper introduces Bayesian Flow Networks (BFNs), a new class of generative model in which the parameters of a set of independent distributions are modified with Bayesian inference in the light of noisy data samples, then passed as input to a neural network that outputs a second, interdependent distribution.
Alex Graves +3 more
openaire +2 more sources
Emergency material vehicle dispatching and routing (EMVDR) is an important task in emergency relief after large-scale earthquake disasters. However, EMVDR is subject to dynamic disaster environment, with uncertainty surrounding elements such as the ...
Jincheng Jiang +3 more
doaj +1 more source
Mapping flows on bipartite networks [PDF]
Mapping network flows provides insight into the organization of networks, but even though many real-networks are bipartite, no method for mapping flows takes advantage of the bipartite structure. What do we miss by discarding this information and how can we use it to understand the structure of bipartite networks better? The map equation models network
Christopher Blöcker, Martin Rosvall
openaire +4 more sources
Network Anomaly Detection Using Machine Learning Techniques
While traditional network security methods have been proven useful until now, the flexibility of machine learning techniques makes them a solid candidate in the current scene of our networks.
Julio J. Estévez-Pereira +2 more
doaj +1 more source
Data flow dissemination in a network
We consider the following network model motivated, in particular, by blockchains and peer-to-peer live streaming. Data packet flows arrive at the network nodes and need to be disseminated to all other nodes. Packets are relayed through the network via links of finite capacity. A packet leaves the network when it is disseminated to all nodes.
Aditya Gopalan, Alexander L. Stolyar
openaire +2 more sources
Neutrosophic Network Flow with Truth, Indeterminacy, and Falsity Capacities: An Innovative Mathematical Framework for Efficiency Evaluation of Achievement Transformation of College Student Innovation and Entrepreneurship Training Programs [PDF]
This paper introduces a new mathematical framework that combines neutrosophic logic and network flow theory to improve the design of student innovation and entrepreneurship training programs.
Yingchun Gan
doaj +1 more source

