نتایج جستجو برای: water filling algorithm

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

Journal: :Critical care medicine 2012
Jurjan Aman A B Johan Groeneveld Geerten P van Nieuw Amerongen

OBJECTIVES It is largely unknown why extravascular lung water may increase during fluid loading in the critically ill with presumed hypovolemia. In this study we evaluated the hemodynamic predictors of such an increase. DESIGN A prospective observational study. PATIENTS Sixty-three presumed hypovolemic mechanically ventilated patients (22 septic and 41 nonseptic patients). INTERVENTION Fl...

2008
N. Kämpfer

The Lomb-Scargle periodogram is widely used for the estimation of the power spectral density of unevenly sampled data. A small extension of the algorithm of the Lomb-Scargle periodogram permits the estimation of the phases of the spectral components. The amplitude and phase information is sufficient for the construction of a complex Fourier spectrum. The inverse Fourier transform can be applied...

2015

In this paper subcarrier and power allocation to each user at base-station maximize the user data rates, subject to constraints on total power and bit error rate. First, each sub-channel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The proposed genetic search helps fast convergence and can handle large alloca...

2012
E. Del Re P. Piunti R. Pucci

The Cognitive Radio paradigm is aimed to optimize the utilization of licensed spectrum bands thanks to coexistence within the same network of licensed (primary) and cognitive (secondary) users. In this context, one of the most important key aspects is represented by an efficient resource allocation between secondary and primary users. Modeling it as an optimization problem, this paper provides ...

Journal: :CoRR 2011
Dong-Min Kim Seong-Lyun Kim

We investigate a scheduling scheme incorporating network coding and channel varying information for the twoway relay networks. Our scheduler aims at minimizing the time span needed to send all the data of each source of the network. We consider three channel models, time invariant channels, time varying channels with finite states and time varying Rayleigh fading channels. We formulate the prob...

2010
Wonjong Rhee John M. Cioffi

This paper investigates the problem of dynamic multiuser subchannel allocation in the downlink of OFDM systems. The assumptions are that the channel model is quasi-static and that the base station has perfect channel information. In traditional TDMA or FDMA systems, resource allocation for each user is nonadaptively fixed, and the water-filling power spectrum is known to be optimal. Since the s...

2015

In this paper subcarrier and power allocation to each user at base-station maximize the user data rates, subject to constraints on total power and bit error rate. First, each sub-channel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The proposed genetic search helps fast convergence and can handle large alloca...

2015

In this paper subcarrier and power allocation to each user at base-station maximize the user data rates, subject to constraints on total power and bit error rate. First, each sub-channel is assigned to the user with best channel-to-noise ratio for the channel, with random power distributed by water filling algorithm. The proposed genetic search helps fast convergence and can handle large alloca...

2016
Jianjun Shi Thierry Barriere Zhiqiang Cheng Baosheng Liu Hugo F. Lopez

As Eulerian description is generally used for the simulation of filling flow problems in the powder injection molding process, and the governing equation of the filling state takes the form of an advection equation, the distortion can be easily produced when dealing with the filling process in complex cavities, such as the similar channels in shapes of K and L, inside which the phenomena of opp...

Journal: :IEICE Transactions 2009
Daewoong Kim Kilhyung Cha Soo-Ik Chae

We propose an optimized scanline filling algorithm for OpenVG two-dimensional vector graphics. For each scanline of a path, it adaptively selects a left or right scanning direction that minimizes the number of pixels visited during scanning. According to the experimental results, the proposed algorithm reduces the number of pixels visited by 6 to 37% relative to that with a constant scanning di...

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

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