نتایج جستجو برای: shrink paths are s

تعداد نتایج: 5494643  

2007
Harald Schwalbe Paul Wrede Michael Schmuker

Michael Schmuker " All models are wrong, but some models are useful. " – George E. P. Box (1979)

Background: Organizational cynicism is one of the important behavioral issues affecting employee performance, thereby reducing organizational efficiency. This study aims to design and evaluate a model for antecedents and consequences of organizational cynicism in employees of an industrial company in Iran. Materials and Methods: In this applied descriptive-correlational study, the statistical ...

2001
Yamin Li Shietung Peng

In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2r nodes. In contrast, a dual-cube with r links for...

2016
Justin Curry Amit Patel

Informally speaking, a map is stratified if it is proper and there is a partition S of X into manifolds so that over each manifold S ∈ S the map f(S)→ S is a fiber bundle. One perspective on this question uses the open sets of X to define a functor F̂ : Open(X)→ Set that assigns to each open U the set π0(f (U)) of path components. This functor satisfies a gluing axiom reminiscent of the usual va...

2006
Man-Wai Ho

A class of random hazard rates, which is defined as a mixture of an indicator kernel convolved with a completely random measure, is of interest. We provide an explicit characterization of the posterior distribution of this mixture hazard rate model via a finite mixture of S-paths. A closed and tractable Bayes estimator for the hazard rate is derived to be a finite sum over S-paths. The path cha...

Journal: :Electr. J. Comb. 2017
Suhyung An JiYoon Jung Sangwook Kim

In this paper we enumerate the number of (k, r)-Fuss-Schröder paths of type λ. Y. Park and S. Kim studied small Schröder paths with type λ. Generalizing the results to small (k, r)-Fuss-Schröder paths with type λ, we give a combinatorial interpretation for the number of small (k, r)-Fuss-Schröder paths of type λ by using Chung-Feller style. We also give two sets of sparse noncrossing partitions...

2016
Ben Short

In response to an infection, proinfl ammatory cytokines stimulate lymphocytes to take up nutrients so that they can proliferate and mount an immune response. Once the infection is cleared, however, cytokine levels decline and the lymphocytes’ nutrient supply is abruptly cut off. Most of the cells quickly die by apoptosis, but a small fraction survive and differentiate into longlived memory cell...

1997
Monika Rauch Henzinger Jon Kleinberg Satish Rao

We give short and simple proofs of the following two theorems by Galil and Yu [3]. Let s and t be two vertices in an n-node graph G. (1) There exist k edge-disjoint s-t paths of total length O(n √ k). (2) If we additionally assume that the minimum degree of G is at least k, then there exist k edge-disjoint s-t paths, each of length O(n/k). Let G = (V , E) be an undirected n-node graph, with no ...

Journal: :Combinatorics, Probability & Computing 2006
Paul Wollan

Let P1, . . . , Pk be k vertex disjoint paths in a graph G where the ends of Pi are xi, and yi. Let H be the subgraph induced by the vertex sets of the paths. We find edge bounds E1(n), E2(n) such that, 1. If e(H) ≥ E1(|V (H)|), then there exist disjoint paths P ′ 1, . . . , P ′ k where the ends of P ′ i are xi and yi such that | S

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید