نتایج جستجو برای: k stage network

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

A. Amirteimoori A. Toloie-Eshlaghi M. Homayoonfar

Since data envelopment analysis (DEA) introduced in 1970s, it has been widely applied to measure the efficiency of a wide variety of production and operation systems. Recently DEA has been extended to examine the efficiency of decision making units (DMUs) with two-stage network structures or processes, where the outputs from the first stage are intermediate measures that make up the inputs of t...

Journal: :JIPS 2013
Kancherla Jonah Nishanth Vadlamani Ravi

All the imputation techniques proposed so far in literature for data imputation are offline techniques as they require a number of iterations to learn the characteristics of data during training and they also consume a lot of computational time. Hence, these techniques are not suitable for applications that require the imputation to be performed on demand and near real-time. The paper proposes ...

پایان نامه :دانشگاه آزاد اسلامی واحد علوم پزشکی تهران - دانشکده پزشکی 1390

هدف: در این مطالعه به بررسی ارتباط ki-67 با stage سرطان سینه در بیمارستان بوعلی طی سالهای 90-1389 پرداختیم. روش مطالعه: در این مطالعه توصیفی – تحلیلی مقطعی، 144 نفر از مراجعین به بیمارستان بوعلی از سال 89 تا 90 مورد بررسی قرار گرفتند که به صورت در دسترس انتخاب و وارد مطالعه شدند. یافته ها: ki-67 در 9/81 درصد از بیماران مثبت بود. stageتومور در 4/26 درصد یک، در 2/47 درصد دو و در 4/26 درصد سه بو...

Journal: :Micro and nano engineering 2022

We present a cryogenic system design and development for ice lithography. The cryo-stage is designed with embedded channels to allow direct liquid nitrogen flow, enabling fast cooling, low sample temperature. stage cools down 78.8 K in 20 min heats up room temperature 15 min, which increases throughput significantly. Compared the previous designs, new reduces cooling time by 85%, it 50 colder. ...

M. ‎Rostamy-‎Malkhalifeh‎‎, Z. ‎Aghababazadeh‎‎

It is well known that in operations research‎, ‎degeneracy can cause a cycle in a network‎ ‎simplex algorithm which can be prevented by maintaining strong‎ ‎feasible bases in each pivot‎. ‎Also‎, ‎in a network consists of n arcs‎ ‎and m nodes‎, ‎not considering any new conditions on the entering‎ ‎variable‎, ‎the upper bound of consecutive degenerate pivots is equal‎ $left( ‎begin{array}{c}‎ ‎n...

Behrooz Karimi, Mohammad Fattahi Mohsen Akbarpour Shirazi Nima Hamta,

In today’s competitive business environment, the design and management of supply chainnetwork is one of the most important challenges that managers encounter. The supply chain network shouldbe designed for satisfying of customer demands as well as minizing the total system costs. This paper presentsa multi-period multi-stage supply chain network design problem under demand uncertainty. The prob...

Mei-Shiang Chang, W. C. Yang,

Facing supply uncertainty of bulky wastes, the capacitated multi-product stochastic network design model for bulky waste recycling is proposed in this paper. The objective of this model is to minimize the first-stage total fixed costs and the expected value of the second-stage variable costs. The possibility of operation costs and transportation costs for bulky waste recycling is considered ...

A.r. Amirteimoori R. Ahmadzadeh S. Kordrostami,

Data Envelopment Analysis (DEA) as a non–parametric method is used to measure relative performance of organizational units. The aim of this paper is to develop a new model to evaluate the efficiency of a general two-stage network structures proposed by Li et al.  (2012) for measuring the performance of Decision Making Units (DMUs). In addition, this paper expands the work of Li et al. (2012) an...

It is essential for most organizations and financial institutes to be able to evaluate their decision-making units (DMUs), when there is only a ratio of inputs to outputs (or vice versa) available. In this paper, we will propose our two-stage DEA-R models, which are a combination of data envelopment analysis and ratio data, based on value efficiency. Integrating value efficiency into data envel...

2008
R. Kevin Wood

Let GK denote a graph G whose edges can fail and with a set K C V specified. Edge failures are independent and have known probabilities. The K-terminal reliability of GK, R(GK), is the probability that all vertices in K are connected by working edges. A factoring algorithm for computing network reliability recursively applies the formula R(GK) = piR(GK * eC) + qiR(GK e) where GK * ec is GK, wit...

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

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