نتایج جستجو برای: dynamic operation

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

2004
Jan van Eijck

The paper fixes a formalization of dynamic epistemic logic, loosely based on Baltag, Moss, Solecki [1], and proves a number of useful facts about epistemic update logic. In particular, the notion of an action emulation is proposed as a notion of equivalence more appropriate for action models than bisimulation. It is proved that every bisimulation is an action emulation, but not vice versa, and ...

1997
Madhukar R. Korupolu Vijaya Ramachandran

In this paper we introduce a new class of dynamic graph algorithms called quasi-fully dynamic algorithms, which are much more general than the backtracking algorithms and are much simpler than the fully dynamic algorithms. These algorithms are especially suitable for applications in which a certain core connected portion of the graph remains xed, and fully dynamic updates occur on the remaining...

2009
Azah Mohamed

This paper presents dynamic models of distributed generators (DG) and investigates dynamic behaviour of the DG units within a microgrid system. The DG units include micro turbine, fuel cell and the electronically interfaced sources. The voltage source converter is adopted as the electronic interface which is equipped with its controller to maintain stability of the microgrid during small signal...

Jafar Towfighi Darian Mir Esmaeil Masoumi Mohammad Shahrokhi, Mojtaba Sadrameli

In thermal cracking plants, it is desired to apply an optimal temperature profile along the reactor to minimize the operation cost. In this article a simulator is developed by the use of a mathematical model, which describes the static operation of a naphtha thermal cracking pilot plant. The model is used to predict the steady state profiles of the gas temperature and product yields. Using ...

B. Shoushtarian

In many computer vision applications, segmenting and extraction of moving objects in video sequences is an essential task. Background subtraction, by which each input image is subtracted from the reference image, has often been used for this purpose. In this paper, we offer a novel background-subtraction technique for real-time dynamic background generation using color images that are taken fro...

In this paper presents a Maximum Power Point Tracking (MPPT) technique based on the Hill Climbing Search (HCS) method and fuzzy logic system for Wind Turbines (WTs) including of Permanent Magnet Synchronous Generator (PMSG) as generator. In the conventional HCS method the step size is constant, therefor both steady-state response and dynamic response of method cannot provide at the same time an...

2001
Ju Won Baek Dong-Wook Yoo

For high-voltage applications, the series operation of devices is necessary to handle high voltage with limited voltage rating devices. In the case of self turn-off devices, however, the series operation of devices is very difficult. The main problem associated with series-connected devices is how to guarantee the voltage balance among the devices both at the static and the dynamic transient st...

2012
Arash Azizi Mazreah Mohammad T. Manzuri Shalmani Hamid Barati Ali Barati

This paper presents a novel CMOS four-transistor SRAM cell for very high density and low power embedded SRAM applications as well as for stand-alone SRAM applications. This cell retains its data with leakage current and positive feedback without refresh cycle. The new cell size is 20% smaller than a conventional six-transistor cell using same design rules. Also proposed cell uses two word-lines...

Journal: :آب و خاک 0
علیرضا عمادی معصومه خادمی

abstract regarding temporal variation of rivers discharge and demands, for suitable use of dam reservoirs stored water, application of operation rule curves is necessary. operation rules are expressed with rule curves. application of yield model is one of the methods of operation curve preparation, which correlates reservoir operation with reservoir storage volume in first period. in this study...

Journal: :SIAM J. Comput. 2001
Monika Henzinger Valerie King

We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time o( √ n) per operation. To be precise, the algorithm uses O(n1/3 logn) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1...

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

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