نتایج جستجو برای: being strong

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

1992
András Sebö

We give various reformulations of the Strong Perfect Graph Conjecture, based on a study of forced coloring procedures, uniquely colorable subgraphs and ! ? 1-cliques in minimal imperfect graphs.

2007
BOHDAN MASLOWSKI JAN POSPÍŠIL

Parameter-dependent linear evolution equations with a fractional noise in the boundary conditions are studied. Ergodic-type theorems for stationary and non-stationary solutions are verified and used to prove the strong consistency of a suitably defined family of estimators.

2003
Kentaro Tanaka Akimichi Takemura

We consider maximum likelihood estimation of finite mixture of uniform distributions. We prove that the maximum likelihood estimator is strongly consistent, if the scale parameters of the component uniform distributions are restricted from below by exp(−nd), 0 < d < 1, where n is the sample size.

2007
Matthew Simon Jill Slay

The issues faced by law enforcement authorities concerning VoIP are very different from that of traditional telephony. VoIP provides strong encryption and a decentralised data­based network. Wiretapping is not applicable to VoIP calls and packet capturing is negated by encryption. New methods are required to collect evidence from systems running VoIP software. This paper ...

Journal: :Discrete Mathematics 1997
Stefan Hougardy

We will extend Reed's Semi-Strong Perfect Graph Theorem by proving that unbreakable C 5-free graphs diierent from a C 6 and its complement have unique P 4-structure.

2003

Paavolainen et. al. (1991) reported that national level cross-country skiers who engaged in explosive type strength training in addition to their normal training, were able improve their force-times i.e. improve their ability to produce a given amount of force in shorter time. This was also described by a significant improvement of jump heights in both static and counter movement jumps, whereas...

Journal: :Discrete Mathematics 2005
Khee Meng Koh K. L. Ng

For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number d (G) of G is defined by → d (G)=min{d(D) |D ∈ D(G)}. In this paper, we study the orientation numbers of a family of graphs, denoted by G(p, q;m), that are obtained from the disjoint union of two complete graphs Kp a...

2007
Lajos Kossuth MICHAEL VOIT

Suitable normalization of time{homogeneous rotation{invariant random walks on unit spheres S d R d+1 for d > 2 leads to a central limit theorem with a Gaussian limit measure. This paper is devoted to an associated Edgeworth expansion with respect to the total variation norm. This strong type of convergence is diierent from the classical case. The proof is performed in the more general setting o...

2013
Bruce Arroll Felicity Goodyear-Smith Simon Moyes Timothy Kenealy

Haniyeh Zarif Majid Moeenizadeh,

Objective Infertility is a major public health problem with physical, psychological and social dimensions. High prevalence of psychological problems has been reported in infertile women. The objective of this study was to examine the effectiveness of wellbeing therapy (WBT) for depression in infertile women who were referred to an infertility center in Mashhad, Iran. MaterialsAndMethods This pr...

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

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