نتایج جستجو برای: versus
تعداد نتایج: 299536 فیلتر نتایج به سال:
objectives: graft versus host disease (gvhd) is a life threatening reaction in the stem cell transplantation process. nowadays cyclosporine is the most commonly utilized agent for gvhd prophylaxis and it has a major role in successful transplantation. cyclosporine has been applied for many years in this field but it could be stated that currently no general consensus is available for its optima...
The lack of standardized criteria for quantitative measurement of therapeutic response in clinical trials poses a major obstacle for the development of new agents in chronic graft-versus-host disease (GVHD). This consensus document was developed to address several objectives for response criteria to be used in chronic GVHD-related clinical trials. The proposed measures should be practical for u...
اثر فعالیت ورزش کوتاه مدت بر سطح آدیپونکتین و حساسیت انسولین در بیماران دیابتی نوع 2: یک گزارش کوتاه
Background and Objective: The accumulating evidence indicates that systemic inflammation is related with obesity and type II diabetes. In the present study, serum adiponectin and insulin sensitivity responses to a short-time exercise test were investigated in type II diabetic patients. Materials and Methods: In this semi-experimental study, fasting level of serum adiponectin, glucose, insul...
avo analysis is a technique which is widely used in industry and is applied on seismic prestack data. results from changes in seismic wave reflection amplitude versus offset can be used in extracting elastic properties and hence lithology and reservoirs pore fluid identification. before performing avo analysis studies, processing steps should be ensured that changes in reflection amplitude are ...
* We're greatly indebted to Michael Zenzen for many valuable discussions about the P=?NP problem and digital physics. Though the two arguments herein establishing P=NP are for weal or woe Bringsjord's, Taylor's astute objections catalyzed crucial refinements.
We use a recent recycling construction of Samorodnitsky and Trevisan combined with the techniques of H̊astad to show that the kCSP problem over an Abelian group G cannot be approximated within |G|k−O( √ k) − , for any constant > 0, unless P = NP. This lower bound matches well with the best known upper bound, |G|k−1, of Serna, Trevisan and Xhafa.
We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move (set of rules) to play at each turn in order to prove (disprove) a given thesis. We show that this is an NP-complete problem.
We consider the NP-complete problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. We present two different constraintsatisfaction formulations of this problem. The first searches a space of absolute placements of rectangles in the enclosing rectangle, while the other searches a space of relative placements between pairs of rectangles. Both appr...
We study the complexity of the Strategic Argumentation Problem for 2-player dialogue games where a player should decide what move to play at each turn in order to prove (disprove) a given claim. We shall prove that this is an NP-complete problem. The result covers one the most popular argumentation semantics proposed by Dung [4]: the grounded semantics.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید