Results 21 to 30 of about 2,565,628 (279)
Spatial variability of soil properties and soil erodibility in the Alqueva reservoir watershed [PDF]
The aim of this work is to investigate how the spatial variability of soil properties and soil erodibility (K factor) were affected by the changes in land use allowed by irrigation with water from a reservoir in a semiarid area.
Andrade, R. +4 more
core +3 more sources
Some Results on Path-Factor Critical Avoidable Graphs
A path factor is a spanning subgraph F of G such that every component of F is a path with at least two vertices. We write P≥k = {Pi : i ≥ k}. Then a P≥k-factor of G means a path factor in which every component admits at least k vertices, where k ≥ 2 is ...
Zhou Sizhong
doaj +1 more source
Precipitable water vapor can be estimated from the Global Navigation Satellite System (GNSS) signal’s zenith wet delay (ZWD) by multiplying a conversion factor, which is a function of weighted mean temperature (Tm) over the GNSS station.
Li Li, Yuan Li, Qimin He, Xiaoming Wang
doaj +1 more source
Suspected vitamin K-dependent coagulation factor deficiency in pregnancy: A case report
Hereditary combined vitamin K-dependent clotting factor deficiency (VKCFD) is a rare autosomal recessive congenital bleeding disorder. There are no established guidelines for the care for pregnant women and newborns within the context of VKCFD. A 39-year-
Mariam Ayyash +3 more
doaj +1 more source
An algorithm for computing simple k-factors [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meijer, Henk +2 more
openaire +2 more sources
The Existence of Path-Factor Covered Graphs
A spanning subgraph H of a graph G is called a P≥k-factor of G if every component of H is isomorphic to a path of order at least k, where k ≥ 2. A graph G is called a P≥k-factor covered graph if there is a P≥k-factor of G covering e for any e ∈ E(G).
Dai Guowei
doaj +1 more source
Amalgamations of connected k-factorizations
Let \(G\) be an edge-colored graph on the set of colors \(\{ 1,2,\ldots,n\}\), and let \(P\) be a partition of \(V(G)\). The \(P\)-amalgamation of \(G\) is the \(n\)-edge-colored graph with vertex set \(P\), in which \(p\in P\) is incident with \(y\) loops colored \(i\) if and only if there are \(y\) loops or edges in \(G\) that join vertices in \(p\),
Hilton, A. J. W. +3 more
openaire +2 more sources
Form Factors and QCD in Spacelike and Timelike Region [PDF]
We analyze the basic hard exclusive processes: \pi\gamma*\gamma - transition, pion and nucleon electromagnetic form factors, and discuss the analytic continuation of QCD formulas from the spacelike q^20 of the relevant momentum transfers. We describe the
A. A. Vladimirov +92 more
core +3 more sources
Neighborhood Conditions and $k$-Factors
A \(k\)-factor of a graph \(G\) is a spanning subgraph which is regular of degree \(k\). The authors give conditions involving a lower bound on the order \(n\) of \(G\), the parity of \(kn\), the minmum degree of \(G\), and the cardinalities of the unions of neighborhoods of non-adjacent vertices which guarantee that \(G\) has a \(k\)-factor.
IIDA, Tadashi, NISHIMURA, Tsuyoshi
openaire +3 more sources
Experimental investigation to assess the effects of trumpet hone on tool life and surface quality in milling of AISI4140 steel [PDF]
Cutting edge preparation is proven to improve the tool life by avoiding sudden failures. Honed edge is effective in stabilizing the tool but has an adverse effect on surface quality.
Shiva Pradeep N. +2 more
doaj

