نتایج جستجو برای: capacity drop

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

Journal: :SIAM J. Discrete Math. 2008
Charles J. Colbourn Hung-Lin Fu Gennian Ge Alan C. H. Ling Hui-Chuan Lu

In order to reduce the number of add-drop multiplexers (ADMs) in SONET/WDM networks using wavelength add-drop multiplexing, certain graph decompositions can be used to form a “grooming” that specifies the assignment of traffic to wavelengths. When traffic among nodes is all-to-all and uniform, the drop cost of such a decomposition is the sum, over all graphs in the decomposition, of the number ...

One of the most critical and complex issues in long-term planning of distribution networks is the optimal placement of distribution transformers. In this paper, the optimal placement of distribution transformers was investigated based on a complete and multi-objective function. In the proposed method, location, optimal capacity, and the service area are determined by minimizing costs (investmen...

2009
Tushar Swamy E. C. Kumbur M. M. Mench

In this work, an analytical model of the microporous layer MPL and the catalyst layer CL interface under compression is developed to investigate the effects of the MPL|CL interfacial morphology on the ohmic and mass transport losses at the MPL|CL interface in a polymer electrolyte fuel cell PEFC . The model utilizes experimentally measured surface profile data as input. Results indicate that th...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1955
H E Rauch

Geometrically, the theorem states that if a variety U/k becomes birationally equivalent to an Abelian variety over the algebraic closure of k, then it is birationally equivalent to an Abelian variety over k. (If k is a field with a discrete valuation, and ir is a prime element, then the curve defined by the equation X" + 7rY" + 7r2Zn = 0, with n = 3, shows that the conclusion of the theorem doe...

2001
Charles J. Colbourn Peng-Jun Wan

SONET/WDM networks using wavelength add–drop multiplexing can be constructed using certain graph decompositions used to form a “grooming,” consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than 8 of the wavelength capacity is determined, with few possible exceptions, when the ring size is a multiple of four. The techni...

Journal: :Vision Research 2004
Talis Bachmann Endel Põder Iiris Luiga

When two objects are presented in rapid succession, observers find it difficult to discriminate their temporal order. Below certain limit (e.g., 20-70 ms), the rate of correct temporal order judgement is reported to be about 50% (i.e., close to chance level). However we have found stimulus conditions where order discrimination drops significantly below chance level: the stimulus that is present...

2007
Kazutaka Kurihara Takeo Igarashi

Display environments for presentations are becoming diverse, and it is common to have multiple displays in the same room. We present a system to edit and give presentations using multiple displays. The main idea is to separate the content from the views. The author prepares presentation visuals (text and images) on an infinitely zoomable canvas, and then specifies what is shown in each display ...

Journal: :International Journal of Kinesiology and Sports Science 2019

Journal: :Neurology: Clinical Practice 2017

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

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