Post combustion in cupola for pollution control

Carbon monoxide, a major pollutant from the cupola, is poisonous and flammable. It can vary from 12 to 25% in cupola emissions. Carbon monoxide content in cupola emissions can be reduced by the post-combustion air input at the appropriate level into the stack. Scientific support to this has been provided by simulation of the combustion process in the cupola. Location and the extent of input of air for post combustion into the stack have been determined.

Dual-Stage Power Management Algorithms for Energy Harvesting Sensors

In this paper, we propose power management algorithms for maximizing the utility of energy harvesting sensors (EHS) that operate purely on the basis of energy harvested from the environment. In particular, we consider communication (i.e., transmission and reception) power management issues for EHS under an energy neutrality constraint. We also consider the fixed power loss effects of the circuitry, the battery inefficiency and its storage capacity, in the design of the algorithms. We propose a two-stage structure that exploits the inherent difference in the timescales at which the energy harvesting and channel fading processes evolve, without loss of optimality of the resulting solution. The outer stage schedules the power that can be used by an inner stage algorithm, so as to maximize the long term average utility and at the same time maintain energy neutrality. The inner stage optimizes the communication parameters to achieve maximum utility in the short-term, subject to the power constraint imposed by the outer stage. We optimize the algorithms for different transmission schemes such as the truncated channel inversion and retransmission strategies. The performance of the algorithms is illustrated via simulations using solar irradiance data, and for the case of Rayleigh fading channels. The results demonstrate the significant performance benefits that can be obtained using the proposed power management algorithms compared to the energy efficient (optimum when there is no storage) and the uniform power consumption (optimum when the battery has infinite capacity and is perfectly efficient) approaches.

Radial infall of two compact objects: 2.5-post-Newtonian linear momentum flux and associated recoil

The loss rate of linear momentum from a binary system composed of compact objects (radially falling towards each other under mutual gravitational influence) has been investigated using the multipolar post-Minkowskian approach. The 2.5PN accurate analytical formula for the linear momentum flux is provided, in terms of the separation of the two objects, in harmonic coordinates, both for a finite and an infinite initial separation. The 2.5PN formulas for the linear momentum flux are finally used to estimate the recoil velocity accumulated during a premerger phase of the binary evolution.

Defluoridation of Drinking Water and Rainwater Harvesting Using a Solar Still

When people drink water having a fluoride (F-) concentration >1-1.5 mg/L for a long period of time, various ailments that are collectively referred to as fluorosis occur. Based on the design of Thomas (http://www.planetkerala.org), an inclined basin-type solar still containing sand and water has been used at Bangalore for defluoridation. For water samples having a fluoride concentration in the range 5-20 mg/L, the fluoride concentration in the distillate was usually <1.5 mg/L. During the periods October 2006 May 2007 and October 2007 May 2008, the volume of distillate showed a significant diurnal variation, ranging from 0.3 to 4.0 L/m(2).day. Based on the figures for 2006, the cost of the still was about Rs. 850 (US$16) for collector areas in the range 0.50-0.57 m(2). The occurrence of F- in the distillate merits further investigation. Overall, the still effectively removes F-, but a large area of the collector, in the range 2.5-25 m(2), is needed to produce about 10 L of distilled water for cooking and drinking. Rainwater falling on the upper surface of the still was collected, and its fluoride concentration was found to be below the desirable limit of 1 mg/L. Hence it can also be used for cooking and drinking.

Climatic fluctuations during the LIA and post-LIA in the Kumaun Lesser Himalaya, India: Evidence from a 400 y old stalagmite record

This paper presents the first stable isotope (delta O-18 and delta C-13) data of a similar to 400 years (1590-2006 AD) long annual to decadal-resolution speleothem record collected from the Indian Lesser Himalaya. The data show a variation from -2.7 to -5.9 parts per thousand in delta O-18 and -5.3 to -8.8 parts per thousand in delta C-13. The isotopic analyses indicate that the climate during this period can be divided into two stages: a wet phase during the Little Ice Age (LIA) (1590-1850 AD) and comparatively dry phase during the post-LIA after 1850 AD. However, the record also documents the minor dry events during the LIA and a wet episode after the LIA. Within the age uncertainty, the dry spells during the LIA are linked with the historical drought events in the Indian subcontinent and similar latitudes. The isotopic record is consistent with a number of previous studies in the areas influenced by the Westerlies but appears to be conflicting to the regions, dominated by the Indian Summer Monsoon (ISM). This may be due to the possible changes in the strength of Westerlies in the study area and added by negative anomaly of North Atlantic Oscillation (NAO) during the LIA. (C) 2012 Elsevier Ltd and INQUA. All rights reserved.

Bond Graph Modeling for Energy-Harvesting Wireless Sensor Networks

Researchers can use bond graph modeling, a tool that takes into account the energy conservation principle, to accurately assess the dynamic behavior of wireless sensor networks on a continuous basis.

Capacity of fading gaussian channel with an energy harvesting sensor node

Network life time maximization is becoming an important design goal in wireless sensor networks. Energy harvesting has recently become a preferred choice for achieving this goal as it provides near perpetual operation. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over a fading AWGN channel with perfect/no channel state information provided at the transmitter. We obtain an achievable rate when there are inefficiencies in energy storage and the capacity when energy is spent in activities other than transmission.

Packet scheduling for priority based transmission in energy harvesting sensors

In this paper, we determine packet scheduling policies for efficient power management in Energy Harvesting Sensors (EHS) which have to transmit packets of high and low priorities over a fading channel. We assume that incoming packets are stored in a buffer and the quality of service for a particular type of message is determined by the expected waiting time of packets of that type of message. The sensors are constrained to work with the energy that they garner from the environment. We derive transmit policies which minimize the sum of expected waiting times of the two types of messages, weighted by penalties. First, we show that for schemes with a constant rate of transmission, under a decoupling approximation, a form of truncated channel inversion is optimal. Using this result, we derive optimal solutions that minimize the weighted sum of the waiting times in the different queues.

Duty cycling and power management with a network of energy harvesting sensors

In this paper, we study duty cycling and power management in a network of energy harvesting sensor (EHS) nodes. We consider a one-hop network, where K EHS nodes send data to a destination over a wireless fading channel. The goal is to find the optimum duty cycling and power scheduling across the nodes that maximizes the average sum data rate, subject to energy neutrality at each node. We adopt a two-stage approach to simplify the problem. In the inner stage, we solve the problem of optimal duty cycling of the nodes, subject to the short-term power constraint set by the outer stage. The outer stage sets the short-term power constraints on the inner stage to maximize the long-term expected sum data rate, subject to long-term energy neutrality at each node. Albeit suboptimal, our solutions turn out to have a surprisingly simple form: the duty cycle allotted to each node by the inner stage is simply the fractional allotted power of that node relative to the total allotted power. The sum power allotted is a clipped version of the sum harvested power across all the nodes. The average sum throughput thus ultimately depends only on the sum harvested power and its statistics. We illustrate the performance improvement offered by the proposed solution compared to other naive schemes via Monte-Carlo simulations.

Queuing theoretic and information theoretic capacity of energy harvesting sensor nodes

Energy harvesting sensor networks provide near perpetual operation and reduce carbon emissions thereby supporting `green communication'. We study such a sensor node powered with an energy harvesting source. We obtain energy management policies that are throughput optimal. We also obtain delay-optimal policies. Next we obtain the Shannon capacity of such a system. Further we combine the information theoretic and queuing theoretic approaches to obtain the Shannon capacity of an energy harvesting sensor node with a data queue. Then we generalize these results to models with fading and energy consumption in activities other than transmission.

Information capacity of energy harvesting sensor nodes

Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting `green communication'. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over an AWGN channel and show that the capacity achieving energy management policies are related to the throughput optimal policies. We also obtain the capacity when energy conserving sleep-wake modes are supported and an achievable rate for the system with inefficiencies in energy storage.

Efficient post-processing techniques for speech enhancement

We address the problem of speech enhancement in real-world noisy scenarios. We propose to solve the problem in two stages, the first comprising a generalized spectral subtraction technique, followed by a sequence of perceptually-motivated post-processing algorithms. The role of the post-processing algorithms is to compensate for the effects of noise as well as to suppress any artifacts created by the first-stage processing. The key post-processing mechanisms are aimed at suppressing musical noise and to enhance the formant structure of voiced speech as well as to denoise the linear-prediction residual. The parameter values in the techniques are fixed optimally by experimentally evaluating the enhancement performance as a function of the parameters. We used the Carnegie-Mellon university Arctic database for our experiments. We considered three real-world noise types: fan noise, car noise, and motorbike noise. The enhancement performance was evaluated by conducting listening experiments on 12 subjects. The listeners reported a clear improvement (MOS improvement of 0.5 on an average) over the noisy signal in the perceived quality (increase in the mean-opinion score (MOS)) for positive signal-to-noise-ratios (SNRs). For negative SNRs, however, the improvement was found to be marginal.

A post processing technique for improved harmonic/percussion separation in polyphonic speech

In this paper we propose a postprocessing technique for a spectrogram diffusion based harmonic/percussion decom- position algorithm. The proposed technique removes har- monic instrument leakages in the percussion enhanced out- puts of the baseline algorithm. The technique uses median filtering and an adaptive detection of percussive segments in subbands followed by piecewise signal reconstruction using envelope properties to ensure that percussion is enhanced while harmonic leakages are suppressed. A new binary mask is created for the percussion signal which upon applying on the original signal improves harmonic versus percussion separation. We compare our algorithm with two recent techniques and show that on a database of polyphonic Indian music, the postprocessing algorithm improves the harmonic versus percussion decomposition significantly.

Performance improvement of short-length regular low-density parity-check codes with low-complexity post-processing

It is well known that extremely long low-density parity-check (LDPC) codes perform exceptionally well for error correction applications, short-length codes are preferable in practical applications. However, short-length LDPC codes suffer from performance degradation owing to graph-based impairments such as short cycles, trapping sets and stopping sets and so on in the bipartite graph of the LDPC matrix. In particular, performance degradation at moderate to high E-b/N-0 is caused by the oscillations in bit node a posteriori probabilities induced by short cycles and trapping sets in bipartite graphs. In this study, a computationally efficient algorithm is proposed to improve the performance of short-length LDPC codes at moderate to high E-b/N-0. This algorithm makes use of the information generated by the belief propagation (BP) algorithm in previous iterations before a decoding failure occurs. Using this information, a reliability-based estimation is performed on each bit node to supplement the BP algorithm. The proposed algorithm gives an appreciable coding gain as compared with BP decoding for LDPC codes of a code rate equal to or less than 1/2 rate coding. The coding gains are modest to significant in the case of optimised (for bipartite graph conditioning) regular LDPC codes, whereas the coding gains are huge in the case of unoptimised codes. Hence, this algorithm is useful for relaxing some stringent constraints on the graphical structure of the LDPC code and for developing hardware-friendly designs.