An Algorithm to Generate Deep-Layer Temperatures from Microwave Satellite Observations for the Purpose of Monitoring Climate Change

An algorithm for generating deep-layer mean temperatures from satellite-observed microwave observations is presented. Unlike traditional temperature retrieval methods, this algorithm does not require a first guess temperature of the ambient atmosphere. By eliminating the first guess a potentially systematic source of error has been removed. The algorithm is expected to yield long-term records that are suitable for detecting small changes in climate. The atmospheric contribution to the deep-layer mean temperature is given by the averaging kernel. The algorithm computes the coefficients that will best approximate a desired averaging kernel from a linear combination of the satellite radiometer's weighting functions. The coefficients are then applied to the measurements to yield the deep-layer mean temperature. Three constraints were used in deriving the algorithm: (1) the sum of the coefficients must be one, (2) the noise of the product is minimized, and (3) the shape of the approximated averaging kernel is well-behaved. Note that a trade-off between constraints 2 and 3 is unavoidable. The algorithm can also be used to combine measurements from a future sensor (i.e., the 20-channel Advanced Microwave Sounding Unit (AMSU)) to yield the same averaging kernel as that based on an earlier sensor (i.e., the 4-channel Microwave Sounding Unit (MSU)). This will allow a time series of deep-layer mean temperatures based on MSU measurements to be continued with AMSU measurements. The AMSU is expected to replace the MSU in 1996

Comparisons of IASI-A and AATSR measurements of top-of-atmosphere radiance over an extended period

This study examines the trustworthiness of the Advanced Along-Track Scanning Radiometer (AATSR) and the Infrared Atmospheric Sounding Interferometer (IASI-A), as on-orbit reference instruments that are useful in re-calibrating the Advanced Very High Resolution Radiometer (AVHRR) series (Mittaz and Harris, 2011). To do this, a 39-month period (1 January 2008 to 31 March 2011) of AATSR and IASI-A inter-comparisons of top-of-atmosphere (TOA) radiance measurements is examined. Our inter-comparison reveals features of the AATSR and IASI-A bias with respect to scan angle, scene temperature, time and orbital maneuvers, and gives insight into their trustworthiness as an in-orbit reference instruments. The first feature that our study reveals is that the AATSR (nadir view) and IASI-A are both stable (have no perceptible trends in the period of study). The second feature is that IASI-A is perhaps more accurate ( ∼  0.05 K) than its stated accuracy (0.5 K). In fact the AATSR and IASI-A bias is close to the AATSR pre-launch bias (plus a small offset of +0.07 K) implying that IASI-A can get close to pre-launch levels of accuracy. Third, a very small scan angular dependence of AATSR and IASI-A bias indicates that the IASI-A response vs. scan angle algorithm is robust, while the instrument is in orbit. Inter-comparisons of AATSR with IASI-A further reveal the impact of orbital maneuvers of the ENVISAT, the platform carrying AATSR, done in October 2011 and not anticipated previously. Our study reveals that this maneuver introduced a temperature-dependent bias in the AATSR measurements for low temperatures (< 240 K) in the period following this maneuver (Cocevar et al., 2011). Our study also shows that the known AATSR 12 µm channel offset is in fact temperature dependent, grows up to 0.4 K, varies seasonally and is correlated with instrument temperature and cannot be corrected by shifting the spectral response function (SRF) of AATSR. We also present a set of recommendations to help identify the parameters under which these instruments can provide the most trustworthy observations for the AVHRR re-calibration

Evolution of constrained layer damping using a cellular automaton algorithm

Constrained layer damping (CLD) is a highly effective passive vibration control strategy if optimized adequately. Factors controlling CLD performance are well documented for the flexural modes of beams but not for more complicated mode shapes or structures. The current paper introduces an approach that is suitable for locating CLD on any type of structure. It follows the cellular automaton (CA) principle and relies on the use of finite element models to describe the vibration properties of the structure. The ability of the algorithm to reach the best solution is demonstrated by applying it to the bending and torsion modes of a plate. Configurations that give the most weight-efficient coverage for each type of mode are first obtained by adapting the existing 'optimum length' principle used for treated beams. Next, a CA algorithm is developed, which grows CLD patches one at a time on the surface of the plate according to a simple set of rules. The effectiveness of the algorithm is then assessed by comparing the generated configurations with the known optimum ones

A simple two-module problem to exemplify building-block assembly under crossover

Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa in other landscapes. Despite an extensive literature on the subject, and recent proofs of a principled distinction in the abilities of crossover and non-crossover algorithms for a particular theoretical landscape, building general intuitions about when and why crossover performs well when it does is a different matter. In particular, the proposal that crossover might enable the assembly of good building-blocks has been difficult to verify despite many attempts at idealized building-block landscapes. Here we show the first example of a two-module problem that shows a principled advantage for cross-over. This allows us to understand building-block assembly under crossover quite straightforwardly and build intuition about more general landscape classes favoring crossover or disfavoring it

Adaptive mutation using statistics mechanism for genetic algorithms

Copyright @ 2004 Springer-Verla

The Peculiar Phase Structure of Random Graph Bisection

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over sparse random graphs, the phase structure of the graph bisection problem displays certain familiar properties, but also some surprises. It is known that when the mean degree is below the critical value of 2 log 2, the cutsize is zero with high probability. We study how the minimum cutsize increases with mean degree above this critical threshold, finding a new analytical upper bound that improves considerably upon previous bounds. Combined with recent results on expander graphs, our bound suggests the unusual scenario that random graph bisection is replica symmetric up to and beyond the critical threshold, with a replica symmetry breaking transition possibly taking place above the threshold. An intriguing algorithmic consequence is that although the problem is NP-hard, we can find near-optimal cutsizes (whose ratio to the optimal value approaches 1 asymptotically) in polynomial time for typical instances near the phase transition.Comment: substantially revised section 2, changed figures 3, 4 and 6, made minor stylistic changes and added reference

A quantum genetic algorithm with quantum crossover and mutation operations

In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.Comment: 21 pages, 1 table, v2: typos corrected, minor modifications in sections 3.5 and 4, v3: minor revision, title changed (original title: Semiclassical genetic algorithm with quantum crossover and mutation operations), v4: minor revision, v5: minor grammatical corrections, to appear in QI

Propagation of short-period gravity waves at high-latitudes during the MaCWAVE winter campaign

As part of the MaCWAVE (Mountain and Convective Waves Ascending Vertically) winter campaign an all-sky monochromatic CCD imager has been used to investigate the properties of short-period mesospheric gravity waves at high northern latitudes. Sequential measurements of several nightglow emissions were made from Esrange, Sweden, during a limited period from 27–31 January 2003. Coincident wind measurements over the altitude range (~80–100 km) using two meteor radar systems located at Esrange and Andenes have been used to perform a novel investigation of the intrinsic properties of five distinct wave events observed during this period. Additional lidar and MSIS model temperature data have been used to investigate their nature (i.e. freely propagating or ducted). Four of these extensive wave events were found to be freely propagating with potential source regions to the north of Scandinavia. No evidence was found for strong orographic forcing by short-period waves in the airglow emission layers. The fifth event was most unusual exhibiting an extensive, but much smaller and variable wavelength pattern that appeared to be embedded in the background wind field. Coincident wind measurements indicated the presence of a strong shear suggesting this event was probably due to a large-scale Kelvin-Helmholtz instability