نتایج جستجو برای: mstp

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

Journal: :Computing and Informatics 2012
Domen Marincic Tomaz Sef Matjaz Gams

We present a new dependency parsing algorithm based on the decomposition of large sentences into smaller units such as clauses and intraclausal coordinations. For the identification of these units, new methods combining machine learning techniques and heuristic rules were developed. The algorithm was evaluated on the Slovene dependency treebank text corpus. Compared to the MSTP parser, currentl...

Journal: :Investigative ophthalmology & visual science 2014
David C Beebe

In this issue of IOVS, Ambati and Cahoon 1 provide thoughtful suggestions for increasing the number and success of medical doctors (MDs) who run active research programs. My own observations over the past 2 decades concur with those of Ambati and Cahoon: our current Medical Scientist Training Program (MSTP) has failed to provide sufficient numbers of physician/scientists to assure that importan...

Journal: :Computer Networks 2012
Antonio Capone Daniele Corti Luca G. Gianoli Brunilde Sansò

We propose an energy management framework to optimize the energy consumption of networks using the Multiple Spanning Tree Protocol such as Carrier Grade Ethernet networks. The objective is to minimize the energy consumption of nodes and links while considering QoS constraints. The energy management is done through the Multiple Spanning Tree Protocol (MSTP) by choosing from a given set the most ...

ژورنال: :مطالعات مدیریت صنعتی 0
رضا برادران کاظم زاده استادیار دانشکده فنی و مهندسی دانشگاه تربیت مدرس سید حبیب الله طباطباییان استادیار دانشکده مدیریت دانشگاه علامه طباطبایی مجید حسنی پارسا کارشناس ارشد مهندسی صنایع و کارشناس شبکه تحلیلگران تکنولوژی ایران

tna ابزاری است که توسط unido برای اطمینان از انتقال موفقیت آمیز تکنولوژی ابداع شده است. از آنجا که این ابزار در مورد نقاط قوت و ضعف زیرساختهای تکنولوژی در چهار زمینه سیاست گذاری، دستگاه های سیاست گذاری، عملکرد سیاسی و قابلیت سیاست گذاری بحث می کند لذا می تواند به عنوان ابزاری برای سیاست گذاری نیز بکار رود. روش stip نیز روشی برای ارزیابی تکنولوژی می باشد که با اندکی تغییرات و افزودن گامهایی به آ...

2016
Dorothy A. Andriole Donna B. Jeffe

Purpose The authors sought to identify variables associated with MD-PhD program graduates' academic medicine careers. Methods We analyzed data for a national cohort of MD-PhD program graduates from 2000 to 2005, using multivariable logistic regression to identify independent predictors of full-time academic medicine faculty appointment through 2013. Results Of 1,860 MD-PhD program graduates in ...

2007
Prasant Mohapatra

The economics and familiarity of Ethernet technology is motivating the vision of wide-scale adoption of Metro Ethernet Networks (MEN). Despite the progress made by the community on additional Ethernet standardization and commercialization of the first generation of MEN, the fundamental technology does not meet the expectations that carriers have traditionally held in terms of network resiliency...

2006
Amaro de Sousa Gil Soares

With IEEE 802.1S Multiple Spanning Tree Protocol, an Ethernet operator can define different network regions. A Common Spanning Tree (CST) is defined in such a way that a link failure inside a region does not affect the CST outside the region and additional Spanning Trees inside each region can be configured to achieve better load balance. We propose a procedure to determine the MSTP parameters ...

Journal: :RFC 2013
Florin Balus Ali Sajassi Nabil Bitar

The IEEE 802.1 Provider Backbone Bridges (PBBs) specification defines an architecture and bridge protocols for interconnection of multiple Provider Bridged Networks (PBNs). Provider backbone bridging was defined by IEEE as a connectionless technology based on multipoint VLAN tunnels. PBB can be used to attain better scalability than Provider Bridges (PBs) in terms of the number of customer Medi...

Journal: :Oper. Res. Lett. 1993
Patrick Jaillet

The minimum spanning tree problem (MSTP) in the plane requires finding the length of the shortest tree spanning n points of R 2. We are concerned here with stochastic versions of the problem. First let Xi, 1 _ i < o0, be uniformly and independently distributed random variables in [0,1] 2 and let LMsT(n) be the length of the shortest tree spanning {X 1, X 2 . . . . . Xn}. Steele [9] proved that ...

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

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