Potential and economics of forestry options for carbon sequestration in India

There is a need to understand the carbon (C) sequestration potential of the forestry option and its financial implications for each country.In India the C emissions from deforestation are estimated to be nearly offset by C sequestration in forests under succession and tree plantations. India has nearly succeeded in stabilizing the area under forests and has adequate forest conservation strategies. Biomass demands for softwood, hardwood and firewood are estimated to double or treble by the year 2020. A set of forestry options were developed to meet the projected biomass needs, and keeping in mind the features of land categories available, three scenarios were developed: potential; demand-driven; and programme-driven scenarios. Adoption of the demand-driven scenario, targeted at meeting the projected biomass needs, is estimated to sequester 78 Mt of C annually after accounting for all emissions resulting from clearfelling and end use of biomass. The demand-driven scenario is estimated to offset 50% of national C emission at 1990 level. The cost per t of C sequestered for forestry options is lower than the energy options considered. The annual investment required for implementing the demand-driven scenario is estimated to be US$ 2.1 billion for six years and is shown to be feasible. Among forestry options, the ranking based on investment cost per t of C sequestered from least cost to highest cost is; natural regeneration-agro-forestry-enhanced natural regeneration (< US$ 2.5/t C)-timber-community-softwood forestry (US$ 3.3 to 7.3 per t of C).

Milling maps and amorphization during mechanical alloying

The effect of various milling parameters such as, milling intensity, ball:powder weight ratio and number of balls on the glass forming ability of an elemental blend of composition Ti50Ni50 has been studied by mechanical alloying. In order to understand the results, all the milling parameters have been converted into two energy parameters, namely, impact energy of the ball and the total energy of milling. In a milling map of these two parameters, the conditions for amorphous phase formation have been isolated. A similar exercise has been carried out for Ti50Cu50 as a function of milling time at two milling intensities. The results indicate that a minimum impact energy of the ball and a minimum total energy are essential for amorphization by mechanical alloying.

Enhancing the mesoporosity of pillared clay catalyst - a study of pillar aggregates and deactivation in alkylation reaction

A sample of montmorillonite was pillared with aluminium polyoxycations in presence of different amounts of tween-80, a nonionic surfactant, ranging from 0.01 to 0.20 mmol/meq of clay. The amount of aluminium sorbed was found to vary with the amount of surfactant added during pillaring. Vapour phase catalytic activity of the samples for alkylation of toluene with methanol in a fixed bed down flow reactor showed that the rate of deactivation, in general, increased with decrease in the pillar density. The samples treated with 0.06 to 0.08 mmol/meq of surfactant showed the lowest deactivation and also an enhancement in the mesopores which did not change on calcining to 540°C. Suppression of deactivation is attributed to the distribution of pillars by the surfactant in such a way as to decrease the coke formation.

Novel materials synthesis by mechanical alloying/milling

An account is given of the research that has been carried out on mechanical alloying/milling (MA/MM) during the past 25 years. Mechanical alloying, a high energy ball milling process, has established itself as a viable solid state processing route for the synthesis of a variety of equilibrium and non-equilibrium phases and phase mixtures. The process was initially invented for the production of oxide dispersion strengthened (ODS) Ni-base superalloys and later extended to other ODS alloys. The success of MA in producing ODS alloys with better high temperature capabilities in comparison with other processing routes is highlighted. Mechanical alloying has also been successfully used for extending terminal solid solubilities in many commercially important metallic systems. Many high melting intermetallics that are difficult to prepare by conventional processing techniques could be easily synthesised with homogeneous structure and composition by MA. It has also, over the years, proved itself to be superior to rapid solidification processing as a non-equilibrium processing tool. The considerable literature on the synthesis of amorphous, quasicrystalline, and nanocrystalline materials by MA is critically reviewed. The possibility of achieving solid solubility in liquid immiscible systems has made MA a unique process. Reactive milling has opened new avenues for the solid state metallothermic reduction and for the synthesis of nanocrystalline intermetallics and intermetallic matrix composites. Despite numerous efforts, understanding of the process of MA, being far from equilibrium, is far from complete, leaving large scope for further research in this exciting field.

Punching shear strength of flat slab corner column connections .1. Reinforced concrete connections

This paper presents the details of an experimental study on punching shear strength and behaviour of reinforced concrete corner column connections in flat slabs; a quasi-empirical method is proposed for computing the punching shear strength. The method has also been extended for punching shear strength prediction at interior and edge column connections. The test results compare better with the strengths predicted by the proposed method than those by Ingvarson, Zaglool and Pollet available in the literature. Further, the experimental strengths of interior, edge and corner column connections have been compared with the strengths predicted by the proposed method and the two codes of practice, viz. ACI and BS code, to demonstrate the usefulness of the method.

Ising pyrochlore magnets: Low-temperature properties, "ice rules," and beyond

Pyrochlore magnets are candidates for what Harris et al. [Phys. Rev. Lett. 79, 2554 (1997)] call "spin-ice" behavior. We present theoretical simulations of relevance for the pyrochlore family R2Ti2O7 (R = rare earth) supported by magnetothermal measurements on selected systems. Ey considering long-ranged dipole-dipole as well as short-ranged superexchange interactions, we get three distinct behaviors: (i) an ordered doubly degenerate state, (ii) a highly disordered state with a broad transition to paramagnetism, and (iii) a partially ordered state with a sharp transition to paramagnetism. Closely corresponding behavior is seen in the real compounds.

Zero-point entropy in 'spin ice'

Common water ice (ice I-h) is an unusual solid-the oxygen atoms form a periodic structure but the hydrogen atoms are highly disordered due to there being two inequivalent O-H bond lengths'. Pauling showed that the presence of these two bond lengths leads to a macroscopic degeneracy of possible ground states(2,3), such that the system has finite entropy as the temperature tends towards zero. The dynamics associated with this degeneracy are experimentally inaccessible, however, as ice melts and the hydrogen dynamics cannot be studied independently of oxygen motion(4). An analogous system(5) in which this degeneracy can be studied is a magnet with the pyrochlore structure-termed 'spin ice'-where spin orientation plays a similar role to that of the hydrogen position in ice I-h. Here we present specific-heat data for one such system, Dy2Ti2O7, from which we infer a total spin entropy of 0.67Rln2. This is similar to the value, 0.71Rln2, determined for ice I-h, SO confirming the validity of the correspondence. We also find, through application of a magnetic field, behaviour not accessible in water ice-restoration of much of the ground-state entropy and new transitions involving transverse spin degrees of freedom.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

Single-Generation Network Coding for Networks with Delay

A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding are forced to do inter-generation network coding, as a result of which the problem of some or all sinks requiring a large amount of memory for decoding is faced. In this work, we address this problem by utilizing memory elements at the internal nodes of the network also, which results in the reduction of the number of memory elements used at the sinks. We give an algorithm which employs memory at all the nodes of the network to achieve single- generation network coding. For fixed latency, our algorithm reduces the total number of memory elements used in the network to achieve single- generation network coding. We also discuss the advantages of employing single-generation network coding together with convolutional network-error correction codes (CNECCs) for networks with unit- delay and illustrate the performance gain of CNECCs by using memory at the intermediate nodes using simulations on an example network under a probabilistic network error model.

Training-Embedded, Single-Symbol ML-Decodable, Distributed STBCs for Relay Networks

Recently, a special class of complex designs called Training-Embedded Complex Orthogonal Designs (TE-CODs) has been introduced to construct single-symbol Maximum Likelihood decodable (SSD) distributed space-time block codes (DSTBCs) for two-hop wireless relay networks using the amplify and forward protocol. However, to implement DSTBCs from square TE-CODs, the overhead due to the transmission of training symbols becomes prohibitively large as the number of relays increase. In this paper, we propose TE-Coordinate Interleaved Orthogonal Designs (TE-CIODs) to construct SSD DSTBCs. Exploiting the block diagonal structure of TE-CIODs, we show that the overhead due to the transmission of training symbols to implement DSTBCs from TE-CIODs is smaller than that for TE-CODs. We also show that DSTBCs from TE-CIODs offer higher rate than those from TE-CODs for identical number of relays while maintaining the SSD and full-diversity properties.

Performance analysis of single-symbol maximum likelihood decodable linear STBCs

Performance of space-time block codes can be improved using the coordinate interleaving of the input symbols from rotated M-ary phase shift keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) constellations. This paper is on the performance analysis of coordinate-interleaved space-time codes, which are a subset of single-symbol maximum likelihood decodable linear space-time block codes, for wireless multiple antenna terminals. The analytical and simulation results show that full diversity is achievable. Using the equivalent single-input single-output model, simple expressions for the average bit error rates are derived over flat uncorrelated Rayleigh fading channels. Optimum rotation angles are found by finding the minimum of the average bit error rate curves.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Single real-symbol decodable, high-rate, distributed space-time block codes

A scheme to apply the rate-1 real orthogonal designs (RODs) in relay networks with single real-symbol decodability of the symbols at the destination for any arbitrary number of relays is proposed. In the case where the relays do not have any information about the channel gains from the source to themselves, the best known distributed space time block codes (DSTBCs) for k relays with single real-symbol decodability offer an overall rate of complex symbols per channel use. The scheme proposed in this paper offers an overall rate of 2/2+k complex symbol per channel use, which is independent of the number of relays. Furthermore, in the scenario where the relays have partial channel information in the form of channel phase knowledge, the best known DSTBCs with single real-symbol decodability offer an overall rate of 1/3 complex symbols per channel use. In this paper, making use of RODs, a scheme which achieves the same overall rate of 1/3 complex symbols per channel use but with a decoding delay that is 50 percent of that of the best known DSTBCs, is presented. Simulation results of the symbol error rate performance for 10 relays, which show the superiority of the proposed scheme over the best known DSTBC for 10 relays with single real-symbol decodability, are provided.