نتایج جستجو برای: mixed g
تعداد نتایج: 651452 فیلتر نتایج به سال:
This paper deals with the transient analysis of K-out-of-N: G system consisting of Noperatingmachines. To improve system reliability, Y cold standby and S warm standbys spares areprovided to replace the failed machines. The machines are assumed to fail in multiple modes. At leastK-out-of-N machines for smooth functioning of the system. Reliability and mean time to failure areestablished in term...
The classical Menger’s theorem states that in any undirected (or directed) graph G, given a pair of vertices s and t, the maximum number of vertex (edge) disjoint paths is equal to the minimum number of vertices (edges) needed to disconnect s from t. This min-max result can be turned into a polynomial time algorithm to find the maximum number of vertex (edge) disjoint paths as well as the minim...
In this paper we show how to use a Tug-of-War game to obtain existence of a viscosity solution to the infinity laplacian with nonhomogeneous mixed boundary conditions. For a Lipschitz and positive function g there exists a viscosity solution of the mixed boundary value problem,
In this paper, we prove existence of a coupled coincidence point theorem and coupled common fixed point theorem for φ-contractive mappings in partially ordered complete metric space without the mixed g-monotone property by using the concept of an (F, g)-invariant set. We prove some coupled fixed point theorems for such nonlinear contractive mappings in a complete metric space.Our results are ge...
Decision making whenever and wherever it is happened is key to organizations success. In order to make correct decision, individuals, teams and organizations need both knowledge management (to manage content) and collaboration (to manage group processes) to make that more effective and efficient. In this paper, we explain the knowledge management and collaboration convergence. Then, we propose ...
The DMU-package for Analyzing Multivariate Mixed Models has been developed over a period of more than 25 years. This paper gives an overview of new features and the recent developments around the DMU-package, including: Genomic prediction (SNPBLUP, G-BLUP and “One-Step”), Genome-wide association studies, Survival models and double hierarchical generalized linear mixed models.
Interest in culturing the Pacific white shrimp Litopenaeus vannamei in low-salinity and brackish-well waters has led to questions about the ability of this species to osmo- and ionoregulate in environments containing low concentrations of ions and in environments with ionic ratios that differ from those found in sea water. After seven days, hemolymph osmolality and potassium, sodium and calcium...
A graph G = (V,E) is called l-mixed p-connected if G−S−L is connected for all pairs S, L with S ⊆ V , L ⊆ E, and l|S|+ |L| < p. This notion is a common generalisation of m-vertex-connectivity (l = 1, p = m) and m-edge-connectivity (l ≥ m, p = m). If p = kl then we obtain (k, l)-connectivity, introduced earlier by Kaneko and Ota, as a special case. We show that by using maximum adjacency orderin...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید