Results 31 to 40 of about 275,010 (282)

Structure of laminar flows with oppositely-rotating coaxial layers

open access: yesMATEC Web of Conferences, 2018
The article is devoted to the theoretical study of laminar flows with the coaxial layers rotating in opposite directions moving along the pipe. These flows have a wide practical application potential in technologies of mixing multiphase and heterogeneous
Zuikov Andrey   +2 more
doaj   +1 more source

The role of colour flows in matrix element computations and Monte Carlo simulations

open access: yesJournal of High Energy Physics, 2021
We discuss how colour flows can be used to simplify the computation of matrix elements, and in the context of parton shower Monte Carlos with accuracy beyond leading-colour.
Stefano Frixione, Bryan R. Webber
doaj   +1 more source

Maximum st-flow in directed planar graphs via shortest paths

open access: yes, 2013
Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on ...
C. Ford   +6 more
core   +1 more source

Sub-Riemannian heat kernels and mean curvature flow of graphs [PDF]

open access: yes, 2013
We introduce a sub-Riemannian analogue of the Bence-Merriman-Osher diffusion driven algorithm and show that it leads to weak solutions of the horizontal mean curvature flow of graphs over sub-Riemannian Carnot groups. The proof follows the nonlinear semi-
Cosimo   +3 more
core   +3 more sources

Cubic Graphs and Their Application to a Traffic Flow Problem

open access: yesInternational Journal of Computational Intelligence Systems, 2020
A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems.
G. Muhiuddin   +3 more
doaj   +1 more source

Towards a better approximation for sparsest cut? [PDF]

open access: yes, 2013
We give a new $(1+\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\sqrt{\log n\log r}$ bigger, for some small $r$; this condition holds ...
Arora, Sanjeev   +2 more
core   +2 more sources

Some analytical solutions for flows of Casson fluid with slip boundary conditions

open access: yesAin Shams Engineering Journal, 2015
In the present paper, we have studied three fundamental flows namely Couette, Poiseuille and generalized Couette flows of an incompressible Casson fluid between parallel plates using slip boundary conditions.
K. Ramesh, M. Devakar
doaj   +1 more source

Flow polynomials of a Signed Graph [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2019
 For a signed graph $G$ and non-negative integer $d$, it was shown by DeVos et al. that there exists a polynomial $F_d(G,x)$ such that the number of the nowhere-zero $\Gamma$-flows in $G$ equals $F_d(G,x)$ evaluated at $k$ for every Abelian group $\Gamma$ of order $k$ with $\epsilon(\Gamma)=d$, where $\epsilon(\Gamma)$ is the largest integer $d$ for ...
Xiangyu Ren, Jianguo Qian
openaire   +3 more sources

Calculation of Technological Consumption (Loss) of Electricity in Modern 0.38–10 kV Electrical Distribution Networks

open access: yesИзвестия высших учебных заведений и энергетических объединенний СНГ: Энергетика, 2018
. New conditions of functioning of electric power industry, tougher of requirements to technological condition of the industry predetermined transition to restructuring of electric networks on the basis of innovative structure of SMART GRID.
M. I. Fursanov   +2 more
doaj   +1 more source

Markov Chain Methods For Analyzing Complex Transport Networks

open access: yes, 2007
We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph representations of transport
A. Bjöner   +35 more
core   +2 more sources

Home - About - Disclaimer - Privacy