Results 1  10
of
4,226
Structure of the edge density pedestal in tokamaks
, 2004
"... A 'firstprinciples ' model for the structure of the edge density pedestal in tokamaks between or in the absence of edge localized magnetohyrodynamic instabilities is derived from ion momentum and particle conservation and from the transport theory of recycling neutral atoms. A calculation ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A 'firstprinciples ' model for the structure of the edge density pedestal in tokamaks between or in the absence of edge localized magnetohyrodynamic instabilities is derived from ion momentum and particle conservation and from the transport theory of recycling neutral atoms. A
On the edgedensity of 4critical graphs
"... Gallai conjectured that every 4critical graph on n vertices has at least 5 2 3n − 3 edges. We prove this conjecture for 4critical graphs in which the subgraph induced by vertices of degree 3 is connected. ..."
Abstract
 Add to MetaCart
Gallai conjectured that every 4critical graph on n vertices has at least 5 2 3n − 3 edges. We prove this conjecture for 4critical graphs in which the subgraph induced by vertices of degree 3 is connected.
edge density, 1013cm3
"... In order do trigger the transition to the high confinement mode (Hmode), the power lost through the separatrix into the scrapeoff layer (SOL), PL, estimated as the sum of the Ohmic and auxiliary heating power from which the time derivative of the plasma stored energy is substructed, should exceed ..."
Abstract
 Add to MetaCart
some threshold value Pth. A simple scaling for Pth has been deduced from the experimental data collected on several tokamaks with divertors [1], 94.078.064.0042.0 SBnP eth = , (1) where en is the line averaged electron density in 10 20m3, S is the plasma surface area in m2
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 502 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
of the algorithm running in O(nm log(n²/m)) time on an nvertex, medge graph. This is as fast as any known method for any graph density and faster on graphs of moderate density. The algorithm also admits efticient distributed and parallel implementations. A parallel implementation running in O(n²log n) time using
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 475 (67 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
Small Complete Minors Above the Extremal Edge Density
"... A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader’s result by replacing the notion of high connectivity by the notion of vertex expansio ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
expansion. Another well known result in graph theory states that for every integer t there is a smallest real c(t), such that every nvertex graph with c(t)n edges contains a Ktminor. Fiorini, Joret, Theis and Wood asked if an nvertex graph G has (c(t) + )n edges then G contains a Ktminor of order
The edgedensity for K 2,t minors
"... Abstract Let H be a graph. If G is an nvertex simple graph that does not contain H as a minor, what is the maximum number of edges that G can have? This is at most linear in n, but the exact expression is known only for very few graphs H. For instance, when H is a complete graph K t , the "na ..."
Abstract
 Add to MetaCart
Abstract Let H be a graph. If G is an nvertex simple graph that does not contain H as a minor, what is the maximum number of edges that G can have? This is at most linear in n, but the exact expression is known only for very few graphs H. For instance, when H is a complete graph K t , the "
Marginal Noise Removal from Document Images Using Edge Density
, 2004
"... Recently, libraries want to keep their book in a digital format, so they use an optical scanner to convert a book into an image. The marginal noise usually appears in a large and dark region around the margin of document images. In this paper, we propose a useful method to help librarians remove bot ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
both vertical and horizontal marginal noise that use different techniques. Our method was applied from image processing technique called Sobel edge detection by using the edge density property of the noise and text areas. This scheme consists of three steps as follows: Edge detection for creating
Results 1  10
of
4,226