Fast versus slow response in climate change: implications for the global hydrological cycle

Recent studies have shown that changes in global mean precipitation are larger for solar forcing than for CO2 forcing of similar magnitude.In this paper, we use an atmospheric general circulation model to show that the differences originate from differing fast responses of the climate system. We estimate the adjusted radiative forcing and fast response using Hansen's ``fixed-SST forcing'' method.Total climate system response is calculated using mixed layer simulations using the same model. Our analysis shows that the fast response is almost 40% of the total response for few key variables like precipitation and evaporation. We further demonstrate that the hydrologic sensitivity, defined as the change in global mean precipitation per unit warming, is the same for the two forcings when the fast responses are excluded from the definition of hydrologic sensitivity, suggesting that the slow response (feedback) of the hydrological cycle is independent of the forcing mechanism. Based on our results, we recommend that the fast and slow response be compared separately in multi-model intercomparisons to discover and understand robust responses in hydrologic cycle. The significance of this study to geoengineering is discussed.

High-Resolution Magic Angle Spinning Nmr-Studies Of P-31 And B-11 In Fast Ion Conducting Agi-Ag2o-P2o5 And Agi-Ag2o-B2o3 Glasses

Silver iodide-based fast ion conducting glasses containing silver phosphate and silver borate have been studied. An attempt is made to identify the interaction between anions by studying the chemical shifts of31P and11B atoms in high resolution (HR) magic angle spinning (MAS) NMR spectra. Variation in the chemical shifts of31P or11B has been observed which is attributed to the change in the partial charge on the31P or11B. This is indicative of the change in the electronegativity of the anion matrix as a whole. This in turn is interpreted as due to significant interaction among anions. The significance of such interaction to the concept of structural unpinning of silver ions in fast ion conducting glasses is discussed.

Energy dispersive backscattering of electrons from surface resonances of a disordered medium and 1/f noise

Anderson localised states in the bulk of a disordered medium appear as sharp resonances near the surface. The resonant backscattering leads to an energy-dependent random time delay for an incident electron. We derive an analytic expression for the delay-time probability distribution at a given energy. This is shown to give a 1/f noise for the surface currents in general.

Analysis,Insights and Generalization of a Fast Decentralized Relay Selection Mechanism

Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays and analyzed, mechanisms that perform the selection in a distributed manner have received relatively less attention. In this paper, we analyze a splitting algorithm for selecting the single best relay amongst a known number of active nodes in a cooperative network. We develop new and exact asymptotic analysis for computing the average number of slots required to resolve the best relay. We then propose and analyze a new algorithm that addresses the general problem of selecting the best Q >= 1 relays. Regardless of the number of relays, the algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. Our analysis also brings out an intimate relationship between multiple access selection and multiple access control algorithms.

A kinetic Ising model study of dynamical correlations in confined fluids: Emergence of both fast and slow time scales

Experiments and computer simulation studies have revealed existence of rich dynamics in the orientational relaxation of molecules in confined systems such as water in reverse micelles, cyclodextrin cavities, and nanotubes. Here we introduce a novel finite length one dimensional Ising model to investigate the propagation and the annihilation of dynamical correlations in finite systems and to understand the intriguing shortening of the orientational relaxation time that has been reported for small sized reverse micelles. In our finite sized model, the two spins at the two end cells are oriented in the opposite directions to mimic the effects of surface that in real system fixes water orientation in the opposite directions. This produces opposite polarizations to propagate inside from the surface and to produce bulklike condition at the center. This model can be solved analytically for short chains. For long chains, we solve the model numerically with Glauber spin flip dynamics (and also with Metropolis single-spin flip Monte Carlo algorithm). We show that model nicely reproduces many of the features observed in experiments. Due to the destructive interference among correlations that propagate from the surface to the core, one of the rotational relaxation time components decays faster than the bulk. In general, the relaxation of spins is nonexponential due to the interplay between various interactions. In the limit of strong coupling between the spins or in the limit of low temperature, the nature of relaxation of the spins undergoes a qualitative change with the emergence of a homogeneous dynamics where decay is predominantly exponential, again in agreement with experiments. (C) 2010 American Institute of Physics. doi: 10.1063/1.3474948]

Performance of a pipelined ring algorithm for Fast Fourier Transform on transputer arrays

In this paper a pipelined ring algorithm is presented for efficient computation of one and two dimensional Fast Fourier Transform (FFT) on a message passing multiprocessor. The algorithm has been implemented on a transputer based system and experiments reveal that the algorithm is very efficient. A model for analysing the performance of the algorithm is developed from its computation-communication characteristics. Expressions for execution time, speedup and efficiency are obtained and these expressions are validated with experimental results obtained on a four transputer system. The analytical model is then used to estimate the performance of the algorithm for different number of processors, and for different sizes of the input data.

Fast algorithm for data exchange in reconfigurable tree structures

This paper presents a fast algorithm for data exchange in a network of processors organized as a reconfigurable tree structure. For a given data exchange table, the algorithm generates a sequence of tree configurations in which the data exchanges are to be executed. A significant feature of the algorithm is that each exchange is executed in a tree configuration in which the source and destination nodes are adjacent to each other. It has been proved in a theorem that for every pair of nodes in the reconfigurable tree structure, there always exists two and only two configurations in which these two nodes are adjacent to each other. The algorithm utilizes this fact and determines the solution so as to optimize both the number of configurations required and the time to perform the data exchanges. Analysis of the algorithm shows that it has linear time complexity, and provides a large reduction in run-time as compared to a previously proposed algorithm. This is well-confirmed from the experimental results obtained by executing a large number of randomly-generated data exchange tables. Another significant feature of the algorithm is that the bit-size of the routing information code is always two bits, irrespective of the number of nodes in the tree. This not only increases the speed of the algorithm but also results in simpler hardware inside each node.

Fast computation of Legendre and Zernike moments

This paper presents recursive algorithms for fast computation of Legendre and Zernike moments of a grey-level image intensity distribution. For a binary image, a contour integration method is developed for the evaluation of Legendre moments using only the boundary information. A method for recursive calculation of Zernike polynomial coefficients is also given. A square-to-circular image transformation scheme is introduced to minimize the computation involved in Zernike moment functions. The recursive formulae can also be used in inverse moment transforms to reconstruct the original image from moments. The mathematical framework of the algorithms is given in detail, and illustrated with binary and grey-level images.

(PEG)(x)NH4ClO4: A new polymeric fast proton conductor

A new polymer electrolyte (PEG)(x) NH4ClO4(x = 5, 10, 15, 20) has been prepared that shows protonic conduction. The room temperature conductivities are of the order of 10(-7) S/cm, and increase with decrease in salt concentration. NMR line width studies indicate fairly low glass transition temperatures of the polymer salt complexes.

How fast is ultrafast chemistry

The field of ultrafast chemistry has seen a string of remarkable discoveries in the recent years. In this article we briefly discuss some of the problems solved recently. The understanding that has emerged from these studies has important consequences non only in chemistry but also in diverse biological processes.

Fast-Group-Decodable STBCs via Codes over GF(4)

In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.