نتایج جستجو برای: s t tests

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

2009
Olga Brukman Shlomi Dolev Yinnon Haviv Limor Lahiani Ronen Kat Elad M. Schiller Nir Tzachar Reuven Yagel

This paper advocates the use of self-stabilization as a provable property to achieve the goals of the self-* paradigms for systems, including availability, reliability, serviceability, disaster recovery and autonomic computing. Several recent results starting from hardware concerns, through the operating system, and ending in the applications are integrated: the selfstabilizing microprocessor [...

2007
Shelby Funk

This paper presents feasibility tests for scheduling instances of real-time jobs on uniform multiprocessor platforms. In a uniform multiprocessor, each processor has an associated speed – a job executing on a processor of speed s for t time units performs s × t units of work. Two feasibility tests are presented. First, a sufficient condition is presented – whenever this condition holds the jobs...

Journal: :Experimental neurology 1968
M H Bagshaw H W Coppock

Amygdalecto~nizctl mc~~~ltegs I~a\.c tlel)ressetl galv;l~~ic sliil~ responses during tests of the n r i c ~ ~ t i ~ ~ ~ rc:~ctioli to reljc;~trtl ~ ~ r c s r ~ ~ t a t i o ~ ~ of sill~l)lc to~lcs. AII effort to contlitio~~ the g;~lvn~~ic skin resljonsc ((IiSR) wit11 electric stimulation of skin \\:as institutctl. No evitlc~~rc trf colltlition:~~g of a \\:ealc colltlitional stitncllus (ligl~t ol...

2016
Rebecca Willett

We have discussed how to handle this test when σ is known. But how should we proceed if it is unknown? One option is the GLRT, discussed above. However, (a) we must estimate μ and (b) Wilk’s theorem only tells us that the test statistic corresponding to maximum likelihood estimates of σ and μ is asymptotically chi-squared. For small n, then, it can be difficult to set a threshold to achieve a d...

2006
Jay Bartroff J. Bartroff

Three-stage t-tests of separated one-sided hypotheses are derived, extending Lorden’s optimal three-stage tests for the one-dimensional exponential family by using Lai and Zhang’s generalization of Schwarz’s optimal fully-sequential tests to the multiparameter exponential family. The resulting three-stage t-tests are shown to be asymptotically optimal, achieving the same average sample size as ...

Journal: :Differential and Integral Equations 2022

New explicit exponential stability conditions are presented for the non-autonomous scalar linear functional differential equation $$ \dot{x}(t) + \sum_{k=1}^m a_k(t)x(h_k(t)) \int_{g(t)}^t K(t,s) x(s)ds=0, where $h_k(t)\leq t$, $g(t)\leq $a_k(\cdot)$ and kernel $K(\cdot,\cdot)$ oscillatory and, generally, discontinuous functions. The proofs based on establishing boundedness of solutions later u...

Journal: :archives of razi institute 2016
h. dastmalchi saei m. ahmadi s. farahmand-azar e. anassori

staphylococcus aureus is a major causative pathogen of clinical and subclinical mastitis of dairy domestic ruminants. this agent produces a variety of extracellular toxins and virulence factors including toxic shock syndrome toxin-1 (tsst-1) which is the major cause of toxic shock syndrome (tss). in this study 58 s. aureus isolates obtained from 9 dairy herds in east and west azerbaijan prov...

Journal: :CoRR 2016
Arkady G. D'yachkov Ilya Vorobyev Nikita Polyanskii Vladislav Shchukin

Let 1 ≤ s < t, N ≥ 1 be integers and a complex electronic circuit of size t is said to be an s-active, s ≪ t, and can work as a system block if not more than s elements of the circuit are defective. Otherwise, the circuit is said to be an s-defective and should be substituted for the s-active circuit. Suppose that there exists a possibility to check the s-activity of the circuit using N non-ada...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی شاهرود - دانشکده علوم پایه 1392

در این پایان نامه مفاهیم کد شناسایی و احاطه گرمکانی در گراف را ارائه می دهیم و به بررسی کوچکترین اندازه این مفاهیم در گراف های همبند و بدون جهت، و به طور خاص در درخت می پردازیم. نشان می دهیم کد شناسایی در درخت از مرتبه ی n>=3 شامل حداقل 3/7(n+1) رأس و کد شناسایی در یک درخت از مرتبه ی n>=4، با l برگ s رأس پشتیبان شامل حداقل 3/7(n+l-s+1) رأس می باشد. نشان می دهیم برای درخت t از مرتبه ی n>=3، n+...

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

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