نتایج جستجو برای: condence interval

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

Journal: :acta medica iranica 0
farhad najmeddin department of clinical pharmacy, faculty of pharmacy, tehran university of medical sciences, tehran, iran. arezoo ahmadi department of anesthesiology and critical care medicine, sina hospital, tehran university of medical sciences, tehran, iran. laleh mahmoudi department of clinical pharmacy, faculty of pharmacy, shiraz university of medical sciences, fars, iran. kourosh sadeghi department of clinical pharmacy, faculty of pharmacy, tehran university of medical sciences, tehran, iran. hossein khalili department of clinical pharmacy, faculty of pharmacy, tehran university of medical sciences, tehran, iran. alireza ahmadvand research center for rational use of drugs, tehran university of medical sciences, tehran, iran.

high-dose extended-interval dosage (hded) regimen of aminoglycosides is now considered as the standard dosage strategy in sepsis. although safety and efficacy of this dosing regimen is well studied, but new experiments show increased the risk of resistance development associated with %t>mic less than 60% of the dosing interval following extended interval dosing. moreover, limited information is...

2003
H. Maehara

A graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bijection f:V--*F such that uv ~ E if and only iff(u)Nf(v)q=~. It is proved that if G is a countable graph then G can be represented by open intervals on the real line if and only if G can be represented by closed intervals on the real line, however, this is no longer true when G is an uncountable graph. S...

This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...

Journal: :Reliable Computing 2011
M. H. van Emden

Two definitions of division by an interval containing zero are compared: a functional one and a relational one. We show that the relational definition also provides interval inverses for other functions that do not have point inverses, such as max and the absolute-value function. Applying the same approach to the ≤ relation introduces the “companion functions” of relations. By regarding the ari...

2000
Predrag Jelenković

Starting at time 0, unit-length intervals arrive and are placed on the positive real line by a unit-intensity Poisson process in two dimensions; the left endpoints of intervals appear at the rate of 1 per unit time per unit distance. An arrival is accepted if and only if, for some given x, the interval is contained in 0 x and overlaps no interval already accepted. This stochastic, on-line inter...

Journal: :Logic Journal of the IGPL 2001
Dimitar P. Guelev

This paper presents a new kind of interpolation theorems about Neighbourhood Logic (NL, [ZH96]) and Interval Temporal Logic (ITL, [Mos85, Dut95]). Unlike Craig interpolation, which holds for these logics too, the new theorems treat the existence of interpolants which specify properties of selected intervals in the models of NL and ITL.

Journal: :Mathematics and Computers in Simulation 2004
Boris T. Polyak Sergey A. Nazin

In the framework of interval uncertainty, a well-known classical problem in numerical analysis is considered, namely, to find “the best” interval solution for interval system of linear algebraic equations. This problem is known to be NP-hard and can be solved via multiple linear programming. In present paper, a simple approach is proposed for some particular models of interval uncertainty. This...

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

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