نتایج جستجو برای: super decision

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

ژورنال: مدیریت سلامت 2018

Introduction: Effective knowledge-sharing among faculty members is one of the requirements for scientific competence and improvement of research quality in universities. This study aimed to identify and rank the key factors influencing knowledge sharing in order to help managers and policy makers take corrective actions. Methods: The instrument used for data collection in this descriptive-appl...

اصغری سرسکانرود, صیاد, بلواسی, مهدی, زینالی, بتول, صاحبی وایقان, سعیده,

     Main part of Iran is in arid and semi-arid region and water is a limiting factor of human activities in this area. One of the ways to overcome seasonal shortages of water is using groundwater. Underground dam is a storage methods and use of groundwater that it can be used to improve water resources management and increase utilities of these resources. In this study, It has been tried to id...

2013
Prashant B. Swadas Mahasweta Joshi

In this paper we study and represent various techniques of image super resolution (SR), it is also called as super resolution reconstruction. Super resolution reconstruction produces high resolution image from sequence of low resolution images. The main aim of super resolution is to improve visual quality of available low resolution image. Also existing Low Resolution (LR) imaging can be utiliz...

2011
Manuel Luque Francisco J. Díez Carlos Disdier

Lung cancer is a very frequent tumor in the developed world and the leading cause of cancer death, with non-small cell lung cancer being the most prevalent type and with most difficult prognosis. In this paper we present a decision support system built for finding the optimal selection of tests and therapy for each patient. The system basically consists of an influence diagram with super value ...

2003
Jin-Yi Cai Osamu Watanabe

We consider the problem of proving circuit lower bounds against the polynomial-time hierarchy. We give both positive and negative results. For the positive side, for any fixed integer k > 0, we give an explicit Σp2 language, acceptable by a Σ p 2-machine with running time O(n k2+k), that requires circuit size > nk. This provides a constructive version of an existence theorem of Kannan [Kan82]. ...

2007
Jin-Yi Cai Osamu Watanabe

We consider the problem of proving circuit lower bounds against the polynomialtime hierarchy. We give both positive and negative results. For the positive side, for any fixed integer k > 0, we give an explicit Σp2 language, acceptable by a Σ p 2-machine with running time O(nk 2+k), that requires circuit size > nk. This provides a constructive version of an existence theorem of Kannan [Kan82]. O...

Journal: :بوم شناسی کشاورزی 0
محسن جهان نفیسه کمایستانی فاطمه رنجبر

in order to investigate the effects of super absorbent polymer application on reduction of drought stress to corn, a split plot arrangement based on randomized complete block design with three replications was conducted at research field of agriculture faculty of ferdowsi university of mashhad during growing season of 2010-11. the main plot treatments were 1) application of 40 kg.ha-1 super abs...

2006
Jin-Ho Cho

We construct various new BPS states of D-branes preserving 8 supersymmetries. These include super Jackstraws (a bunch of scattered Dor (p, q)-strings preserving supersymmetries), and super waterwheels (a number of D2-branes intersecting at generic angles on parallel lines while preserving supersymmetries). Super D-Jackstraws are scattered in various dimensions but are dynamical with all their i...

2005
Kenji Nakano Takao Terano

This paper reports on a research project we have been conducting for two years since 2003, which aims at “integrating Case Method and Business Gaming.” This research proposes a new gaming structure model. In this model, we structuralize the decision-making area of corporate managers and build a framework to implement it as a business game. The model also contains a method to quantitatively expr...

2003
CRAIG ALAN FEINSTEIN

The question of whether the class of decision problems that can be solved by deterministic polynomial-time algorithms (P ) is equal to the class of decision problems that can be solved by nondeterministic polynomial-time algorithms (NP) has been open since it was first formulated by Cook, Karp, and Levin in 1971. In this paper, we prove that they are not equal by showing that any algorithm that...

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

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