نتایج جستجو برای: bj t
تعداد نتایج: 704575 فیلتر نتایج به سال:
We compared the DNA-binding activity of transcription factors and gene expression patterns in BJ human diploid fibroblasts (HDFs) expressing or not telomerase (hTERT) in stress-induced premature senescence (SIPS). Senescent BJ cells were also studied. Hydrogen peroxide (H2O2)-induced SIPS modulated gene expression in both BJ and hTERT-BJ1 cells. Increased p21(WAF-1) mRNA level was amongst the c...
Based on the growing deal of data concerning the biological activity of flavonoid-rich natural products, the aim of the present study was to explore in vitro the potential anti-tumoral activity of Citrus Bergamia (bergamot) juice (BJ), determining its molecular interaction with cancer cells. Here we show that BJ reduced growth rate of different cancer cell lines, with the maximal growth inhibit...
BACKGROUND Helicobacter pylori infection has been associated with chronic gastritis, peptic ulcer and gastric carcinoma as over half of the world's population is colonized with this gram-negative bacterium. Due to the increasing antibiotic resistance, its eradication rates fails in a great portion of patients. A number of studies showed that molecules largely distributed in commonly consumed fr...
A total of ninety seven pre-pubertal Bunaji (BJ) and Friesian-Bunaji (FR x BJ) heifers were allotted randomly to two treatments groups for a period of 15 months. The treatment groups consisted of the followings: Mature Bull Exposure (MBE) and No Bull Exposure (NBE). Heifers were body condition scored and their live weights recorded on 28 days consecutive intervals. A heifer tactile stimulation ...
A tree functional is called additive if it satisfies a recursion of the form F (T ) = ∑k j=1 F (Bj)+f(T ), where B1, . . . , Bk are the branches of the tree T and f(T ) is a toll function. We prove a general central limit theorem for additive functionals of d-ary increasing trees under suitable assumptions on the toll function. The same method also applies to generalised planeoriented increasin...
Cj(S): The total completion time of schedule S. Finally, for convenience, for each order constructed from aj (bj , cj), we simply call it order aj (respectively, bj , cj). Also, we assume that the subscripts of the orders in a schedule are labelled in such a way that, aj (bj , or cj) (j = 1, 2, . . . , n): means that there are (j − 1) orders of type a scheduled before aj (respectively, bj , or ...
We study the system consisting of a linear matrix inequality (LMI) constraint and linear constraints of the form: A(x) := A0 + n ∑ i=1 xiAi 0, bj + a T j x ≥ 0 (j = 1, 2, . . . , q) where Ai are m×m symmetric matrices, aj and x ∈ IR , and bj ∈ IR. A(x) 0 means that A(x) is positive semidefinite. A constraint in the above system is redundant if eliminating it from the system does not change the ...
1. Neumann TS, Hallenbeck JM. Barotraumatic cerebral air embolism and mental status examination. A report of four cases. Ann Emerg Med 1987;16:220–223. 2. Tommasino C, Rissardi R, Baretta L. Cerebral ischemia after venous air embolism in absence of intracardiac defects. J Neurosurg Anesth 1996;1: 30–34. 3. Muth CM, Shank ES. Gas embolism. N Engl J Med 2000;342:476–482. 4. Dalsgaard S, Varmerkan...
We first characterize a two-person, zero-sum game. 1. There are two players, P1 and P2. 2. P1 has a set A = {a1, a2, . . . , am} of m pure strategies (actions). 3. P2 has a set B = {b1, b2, . . . , bn} of n pure strategies (actions). 4. Each player has a utility for each (ai, bj) pair of actions. The utility for P1 is denoted U1(ai, bj) and the utility for P2 is denoted U2(ai, bj). Since this i...
The Distributed Constraint Optimization Problem (DCOP) is a powerful framework for modeling and solving applications in multi-agent coordination. Asynchronous Forward Bounding (AFB BJ) is one of the best algorithms to solve DCOPs. We propose AFB BJ, a revisited version of AFB BJ in which we refine the lower bound computations. We also propose to compute lower bounds for the whole domain of the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید