and ScienceWe propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would increase the maximal flow. Initial computation results for some publicly available connectome graphs are described....
The maximum flow problem is one of the most studied optimization problems in the last decades. Besides its many practical applications, it also arises as a subproblem of several other complex problems (e.g., min cost flow, matching, covering on bipartite graphs). Subsequently, the chapter ...
And for the minimum cost flow problems, we characterize reduced Grobner bases in terms of graphs, and give bounds for the number of dual (resp. primal) feasible bases of the primal (resp. dual) problems: for the primal problems the minimum and the maximum are shown to be 1 and the ...
Computer science Exploiting planarity for network flow and connectivity problems BROWN UNIVERSITY Philip Klein BorradaileGlencoraBy restricting the input to a problem, it often becomes possible to design more accurate or more efficient algorithms to solve that problem. In this thesis we restrict our ...
This paper addresses these problems and introduces a unified formulation for robustly detecting activities in videos. Ourfirst contributionis the formulation of the detection task as an undirected node- and edge-weighted graphical structure calledPart Bricolage (PB), where the node weights represent the...
Flask: We are using Flask as the back-bone of our web UI and API. We know major version of Flask are very likely to introduce breaking changes across those so limiting it to MAJOR version makes sense werkzeug: the library is known to cause problems in new versions. It is tightly coupled...
Rough Set Flow Graphs and Max * Fuzzy Relation Equations in State Prediction Problems The paper makes the first attempt to combine two methodologies concerning uncertainty and fuzzy reasoning, namely rough set flow graphs and fuzzy relation ... Z Matusiewicz,K Pancerz - Rough Sets & Current Tre...
GraphLab was developed by Carnegie Mellon University and provides an example of graph-parallel distributed analytics engines for the cloud. As with any graph-parallel engine, GraphLab assumes input problems modeled as graphs, in which vertices represent computations and edges encode data dependencies o...
Therefore, to solve the above problems, this paper adopts a gated recurrent unit to extract the time feature. The gated recurrent unit (GRU)29 is similar to the long and short-term memory Networks (LSTM) in that both use a gating mechanism to control input and memory. Compared with LSTM,...
We present a set of stochastic optimization strategies and we discuss their applications to fluid mechanics problems. The optimization strategies are based on state-of-the-art stochastic algorithms and are extended for the application on fluid dynamics problems. The extensions address the question of ...