نتایج جستجو برای: continuous g
تعداد نتایج: 690110 فیلتر نتایج به سال:
background: surgical site infection is known as a common complication after cardiac surgery, and cefazolin is the best prophylactic antibiotic to prevent this complication. the goal of this study was to evaluate the effect of continuous and intermittent cefazolin for the prevention of superficial surgical site infection following off-pump coronary artery bypass (opcab). methods: this prospectiv...
Background: Pain control after posterolateral thoracotomy is very important for adequate respiration and to reduce pulmonary complications. Narcotic-induced respiratory depression requires different intercostal nerve block procedures with local anesthesia, such as bupivacaine, through an extrapleural catheter, paravertebral catheter and intrapleural injection in order to control pain and reduce...
In this note, we consider the concentration function problem for a continuous action of a locally compact group $G$ on a locally compact Hausdorff space $X$. We prove a necessary and sufficient condition for the concentration functions of a spread-out irreducible probability measure $mu$ on $G$ to converge to zero.
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of G is the maximum integer χb(G) for which G has a b-coloring with χb(G) colors. A graph G is b-continuous if G has a b-coloring with k colors, for every integer k in the interval [χ(G), χb(G)]. It is known that not all graphs...
in this article, we prove the existence of extremal positive solution for the distributed order fractional hybrid differential equation$$int_{0}^{1}b(q)d^{q}[frac{x(t)}{f(t,x(t))}]dq=g(t,x(t)),$$using a fixed point theorem in the banach algebras. this proof is given in two cases of the continuous and discontinuous function $g$, under the generalized lipschitz and caratheodory conditions.
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of G is the maximum integer b(G) for which G has a b-coloring with b(G) colors. A graph G is b-continuous if G has a b-coloring with k colors, for every integer k in the interval [χ(G), b(G)]. It is known that not all graphs ar...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید