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....
Because, from an architectural point of view, it has some problems caused by mixing the user interface definition with its actual data. It is much more desirable to keep the document separate from its interface. Mixing the reader with the document is a little like creating a SQL Server™ ...
Data structure and graph flow200 XP 17 minutes 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 represen...
But many real-world taint-analysis problems comprise a sequence of multiple events. For example, consider the NoSQL injection vulnerability in Listing 2 and its data-flow graph in Fig. 1(b). The NoSQLi vulnerability occurs in line 20 when the method updateOne is called under the condition ...
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,...
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...
It becomes clear that the neutrosophic connectivity index (CIN) is an essential tool for solving practical problems, especially those involving traffic network flow. To capture uncertainties, neutrosophic graphs are used to represent knowledge at different membership levels. Two types of \(CIN_s,\) ...
We study the maximum integral multicommodity flow problem and the minimum multicut problem restricted to trees. This restriction is quite rich and contains as special cases classical optimization problems such as matching and vertex cover for general graphs. It is shown that both the maximum integral...
It is noteworthy that the unsteady nature of many liquid movements plays a more practical role and has gained considerable attention in recent years. In several applications, the ideal liquid flow problems around the instrument is not usually steady, but the undesirable volatile effects are either ...
Shah and Ali20 discussed the problems and limitations of using hybrid nanofluids in solar systems. Eid and Nafe21 provided several graphs to dissect the consequences of heat injection and thermal properties variation. In this work, the examined hybrid nanofluid contains ethylene glycol, copper, and ...