308 resultados para Jurisdiction over aircraft.


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The influences of the springtime northern Indian biomass burning are shown for the first time over the central Himalayas by using three years (2007-2009) of surface and space based observations along with a radiative transfer model. Near-surface ozone, black carbon (BC), spectral aerosol optical depths (AODs) and the meteorological parameters are measured at a high altitude site Nainital (29.37 degrees N, 79.45 degrees E, 1958 m amsl) located in the central Himalayas. The satellite observations include the MODIS derived fire counts and AOD (0.55 mu m), and OMI derived tropospheric column NO(2), ultraviolet aerosol index and single scattering albedo. MODIS fire counts and BC observations are used to identify the fire-impacted periods (372 h during 2007-2009) and hence the induced enhancements in surface BC, AOD (0.5 mu m) and ozone are estimated to be 1802 ng m(-3) (similar to 145%), 0.3 (similar to 150%) and 19 ppbv (similar to 34%) respectively. Large enhancements (53-100%) are also seen in the satellite derived parameters over a 2 degrees x 2 degrees region around Nainital. The present analysis highlights the northern Indian biomass burning induced cooling at the surface (-27 W m(-2)) and top of the atmosphere (-8 W m(-2)) in the lesser polluted high altitude regions of the central Himalayas. This cooling leads to an additional atmospheric warming of 19 W m(-2) and increases the lower atmospheric heating rate by 0.8 K day(-1). These biomass burning induced changes over the central Himalayan atmosphere during spring may also lead to enhanced short-wave absorption above clouds and might have an impact on the monsoonal rainfall.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms of current interest. Since its inception in the mid 1990s, DE has been finding many successful applications in real-world optimization problems from diverse domains of science and engineering. This paper takes a first significant step toward the convergence analysis of a canonical DE (DE/rand/1/bin) algorithm. It first deduces a time-recursive relationship for the probability density function (PDF) of the trial solutions, taking into consideration the DE-type mutation, crossover, and selection mechanisms. Then, by applying the concepts of Lyapunov stability theorems, it shows that as time approaches infinity, the PDF of the trial solutions concentrates narrowly around the global optimum of the objective function, assuming the shape of a Dirac delta distribution. Asymptotic convergence behavior of the population PDF is established by constructing a Lyapunov functional based on the PDF and showing that it monotonically decreases with time. The analysis is applicable to a class of continuous and real-valued objective functions that possesses a unique global optimum (but may have multiple local optima). Theoretical results have been substantiated with relevant computer simulations.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Video streaming applications have hitherto been supported by single server systems. A major drawback of such a solution is that it increases the server load. The server restricts the number of clients that can be simultaneously supported due to limitation in bandwidth. The constraints of a single server system can be overcome in video streaming if we exploit the endless resources available in a distributed and networked system. We explore a P2P system for streaming video applications. In this paper we build a P2P streaming video (SVP2P) service in which multiple peers co-operate to serve video segments for new requests, thereby reducing server load and bandwidth used. Our simulation shows the playback latency using SVP2P is roughly 1/4th of the latency incurred when the server directly streams the video. Bandwidth consumed for control messages (overhead) is as low as 1.5% of the total data transfered. The most important observation is that the capacity of the SVP2P grows dynamically.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The pursuit-evasion problem of two aircraft in a horizontal plane is modelled as a zerosum differential game with capture time as payoff. The aircraft are modelled as point masses with thrust and bank angle controls. The games of kind and degree for this differential game are solved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Optimal control laws are obtained for the elevator and the ailerons for a modern fighter aircraft in a rolling pullout maneuver. The problem is solved for three flight conditions using the conjugate gradient method.