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.

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]

Fast- and drift-ice communities in the Bothnian Bay and the impact of UVA radiation on the Baltic Sea ice ecology

The aim of this thesis was to study ecology of Baltic Sea ice from two perspectives. In the first two studies, sea-ice ecology from riverine-influenced fast ice to drift ice in the Bothnian Bay was investigated, whereas the last two studies focus on the sensitivity of sea-ice bacteria and algae to UVA examined in situ. The seasonal sea ice cover is one of the main characteristics of the Baltic Sea, and despite the brackish parental water, the ice structure is similar to polar ice with saline brine inclusions, the sea ice habitat. The decreasing seawater salinity from the northern Baltic Sea to the Bothnian Bay translates to decreasing brine volumes along the gradient, governing the size and community structure of the food webs in ice. However, the drift and fast ice in the Bothnian Bay may differ greatly in this sense, as drift ice may have been formed at more southern locations. Rafting and the formation of snow ice are common processes in the ice field of the Bothnian Bay. As evidenced in this thesis, rafting altered the vertical distribution of organisms and snow-ice formation provided habitable space in the better-illuminated, nitrogen-rich surface layer. The divergence between fast and drift ice became apparent at the more advanced stages, and chlorophyte biomass decreased from fast to drift ice, while the opposite held true for protozoan and metazoan biomass. The brine volumes affected the communities somewhat, and a higher percentage of flagellate species was generally linked to lower brine volumes, whereas chain-forming diatoms were mostly concentrated in layers with larger brine volumes. These results add to knowledge of the ecological significance of the ice cover lasting up to 7 months per year in this area. Sea-ice food webs are generally light-limited, but while increasing light irradiances typically enhance the primary production and further, the secondary production in sea ice, any increase in solar radiation also includes an increase in harmful UVA radiation. The Baltic Sea ice microbial communities were clearly sensitive to UVA and the responses were strongly linked to the earlier light history, as well as to the solar irradiances they were exposed to. The increased biomass of chlorophytes and pennate diatoms, when UVA was excluded, indicates that their normally minor contribution to the biomass in the upper layers of sea ice might be partly dictated by UVA. The effects of UVA on bacterial production in Baltic Sea ice mostly followed the responses in algal growth, but occasionally the exposure to UVA even enhanced the bacterial production. The dominant bacterial class, Flavobacteria, seemed to be UVA-tolerant, whereas all the Alpha-, Beta- and Gammaproteobacteria present in the surface layer showed UVA sensitivity. These results indicate that changes in the light field of ice may alter the community structure and affect the functioning of ice food webs, and are of importance when the effects of thinning of the ice cover are assessed.

Evaluation of the profitability of fast-growing tropical trees.

The profitability of fast-growing trees was investigated in the northeastern and eastern provinces of Thailand. The financial, economic, and tentative environmental-economic profitability was determined separately for three fast-growing plantation tree species and for three categories of plantation managers: the private industry, the state (the Royal Forest Department) and the farmers. Fast-growing tree crops were also compared with teak (Tectona grandis), a traditional medium or long rotation species, and Para rubber (Hevea brasiliensis) which presently is the most common cultivated tree in Thailand. The optimal rotation for Eucalyptus camaldulensis pulpwood production was eight years. This was the most profitable species in pulpwood production. In sawlog production Acacia mangium and Melia azedarach showed a better financial profitability. Para rubber was more profitable and teak less profitable than the three fast-growing species. The economic profitability was higher than the financial one, and the tentative environmental-economic profitability was slightly higher than the economic profitability. The profitability of tree growing is sensitive to plantation yields and labour cost changes and especially to wood prices. Management options which aim at pulpwood production are more sensitive to input or output changes than those options which include sawlog production. There is an urgent need to improve the growth and yield data and to study the environmental impacts of tree plantations for all species and plantation types.

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

We present a distributed algorithm that finds a maximal edge packing in O(Δ + log* W) synchronous communication rounds in a weighted graph, independent of the number of nodes in the network; here Δ is the maximum degree of the graph and W is the maximum weight. As a direct application, we have a distributed 2-approximation algorithm for minimum-weight vertex cover, with the same running time. We also show how to find an f-approximation of minimum-weight set cover in O(f2k2 + fk log* W) rounds; here k is the maximum size of a subset in the set cover instance, f is the maximum frequency of an element, and W is the maximum weight of a subset. The algorithms are deterministic, and they can be applied in anonymous networks.

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.