نتایج جستجو برای: kadivar m
تعداد نتایج: 538850 فیلتر نتایج به سال:
Z. Li, A. Kadivar, J. Pluta, H. D. Soares, M. Grossman, J. Detre, and Z. Wang Dept. of Biomedical Engineering, Shanghai Jiao Tong University, China, People's Republic of, Dept of Psychiatry, University of Pennsylvania, United States, Dept of Neurology, University of Pennsylvania, United States, Pfizer Inc, United States, Dept of Psychiatry, University of Pennsylvania, Philadelphia, PA, United S...
this study was designed to determine if body mass index was predictive of mortality in a sample of seriously ill hospitalized patients in intensive care unit (icu) of children's hospital medical center. there were 160 children from 1 month to 14 years in this prospective study for a period of 3 months in 1377. for all of the patients after calculation of bmi, the relation between age, sex,...
This article examines a specific line of thinking shared by several contemporary reformist Iranian religious scholars who present arguments in favor freedom religion. Focusing on the ideas five prominent scholars—Abdolkarim Soroush (b.1945), Muhammad Mujtahed Shabestari (b.1936), Hasan Yousefi Eshkevari (b.1950), Mohsen Kadivar (b.1959), and Ahmad Qabel (d.2012)—the argues that these thinkers’ ...
Predicting Student Performance in Verbal Math Problems Based on Cognitive, Metacognitive, and Affective Factors F. Karimi, Ph.D. A.R. Moraadi, Ph.D. P. Kadivar, Ph.D. R. Kormi Noori, Ph.D. To determine the predictive role of metacognitive, cognitive, and affective factors in solving verbal math problems, a cluster sample of 450 junior high school students was given ...
مساله مکان?یابی ماکزیمم پوشش از جمله پرکاربردترین مسائل مکان?یابی محسوب می شود. در این مساله هدف تعیین مکان p مرکز سرویس و تخصیص نقاط تقاضا به آنها به گونه ای است که جمعیت سرویس داده شده ماکزیمم شود. یک از معیارهایی که موجب افزایش کیفیت خدمات رسانی توسط مراکز سرویس می شود، توجه به میانگین زمان انتظار در مراکز سرویس می باشد. در این رساله سه مساله مکان یابی ماکزیمم پوشش مورد بررسی قرار می گیرد....
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
The object of the investigation is to study reducible $M$-ideals in Banach spaces. It is shown that if the number of $M$-ideals in a Banach space $X$ is $n(<infty)$, then the number of reducible $M$-ideals does not exceed of $frac{(n-2)(n-3)}{2}$. Moreover, given a compact metric space $X$, we obtain a general form of a reducible $M$-ideal in the space $C(X)$ of continuous functions on $X$. The...
Given a model M and a temporal logic formula φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M |= φ[? ← f ]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید