Characterization of a mercury-reducing Bacillus cereus strain isolated from the Pulicat Lake sediments, south east coast of India

Pulicat Lake sediments are often severely polluted with the toxic heavy metal mercury. Several mercury-resistant strains of Bacillus species were isolated from the sediments and all the isolates exhibited broad spectrum resistance (resistance to both organic and inorganic mercuric compounds). Plasmid curing assay showed that all the isolated Bacillus strains carry chromosomally borne mercury resistance. Polymerase chain reaction and southern hybridization analyses using merA and merB3 gene primers/probes showed that five of the isolated Bacillus strains carry sequences similar to known merA and merB3 genes. Results of multiple sequence alignment revealed 99% similarity with merA and merB3 of TnMERI1 (class II transposons). Other mercury resistant Bacillus species lacking homology to these genes were not able to volatilize mercuric chloride, indicating the presence of other modes of resistance to mercuric compounds.

Thermodynamics of lectin-sugar interaction: Binding of sugars to winged bean (Psophocarpus tetragonolobus) basic agglutinin (WBAI)

Combining site of WBAI is extended and encompasses all the residues of blood group A-reactive trisaccharide [GalNAcalpha3Galbeta4Glc]. Though both of the fucose residues of A-pentasaccharide [GalNAcalpha(Fucalpha2)3Galbeta(Fucalpha3)4Glc] do not directly interact, with the combining site they thermodynamically favour the interaction of GalNAcalpha3Galbeta4Glc part of the molecule by imposing a sterically favourable orientation of the binding epitope viz. GalNAcalpha3Galbeta4Glc of the saccharide. Binding of sugars is driven by enthalpy and is devoid of heat capacity changes. This together with enthalpy-entropy compensation observed for these processes underscore the importance of water reorganization as being one of the principal determinant of protein-sugar interactions.

Microwave assisted synthesis and UV-Vis spectroscopic studies of silver nanoparticles synthesized using vanillin as a reducing agent

The present investigation explores the adaptability of a microwave assisted route to obtain silver nanoparticles by the reduction of AgNO3 with vanillin, an environmentally benign material. Anionic surfactants such as AOT and SDS were used separately for encapsulating AgNPs and their role was compared. The UV-Visible absorption spectra present a broad SPR band consisting of two peaks suggesting the formation of silver nanoparticle with bimodal size distribution. The TEM image shows particles with spherical and hexagonal morphologies which confirms the results of UV-Vis studies. The anisotropy in the particle morphology can be attributed to the surface oxidation which in turn produces Ag@Ag2O core-shell nanostructures. Thus an intriguing feature of this system is that the obtained colloid is a mixture of AgNPs with and without Ag2O layers. Studies on the influence of pH on the stability of the synthesized nanoparticles revealed that the presence of excess Ag2O layers has a profound influence on it. Ag2O layers can be removed from AgNPs' surface by changing the solution pH to the acidic regime. The present study attests the enhanced ability of AOT in stabilizing the AgNPs in aqueous media. (C) 2011 Elsevier B.V. All rights reserved.

Explicit codes uniformly reducing repair bandwidth in distributed storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

The role of sustainable agriculture and renewable-resource management in reducing greenhouse-gas emissions and increasing sinks in China and India

This paper contains an analysis of the technical options in agriculture for reducing greenhouse-gas emissions and increasing sinks, arising from three distinct mechanisms: (i) increasing carbon sinks in soil organic matter and above-ground biomass; (ii) avoiding carbon emissions from farms by reducing direct and indirect energy use; and (iii) increasing renewable-energy production from biomass that either substitutes for consumption of fossil fuels or replaces inefficient burning of fuelwood or crop residues, and so avoids carbon emissions, together with use of biogas digesters and improved cookstoves. We then review best-practice sustainable agriculture and renewable-resource-management projects and initiatives in China and India, and analyse the annual net sinks being created by these projects, and the potential market value of the carbon sequestered. We conclude with a summary of the policy and institutional conditions and reforms required for adoption of best sustainability practice in the agricultural sector to achieve the desired reductions in emissions and increases in sinks. A review of 40 sustainable agriculture and renewable-resource-management projects in China and India under the three mechanisms estimated a carbon mitigation potential of 64.8 MtC yr(-1) from 5.5 Mha. The potential income for carbon mitigation is $324 million at $5 per tonne of carbon. The potential exists to increase this by orders of magnitude, and so contribute significantly to greenhouse-gas abatement. Most agricultural mitigation options also provide several ancillary benefits. However, there are many technical, financial, policy, legal and institutional barriers to overcome.

Explicit Codes Uniformly Reducing Repair Bandwidth in Distributed Storage

A distributed storage setting is considered where a file of size B is to be stored across n storage nodes. A data collector should be able to reconstruct the entire data by downloading the symbols stored in any k nodes. When a node fails, it is replaced by a new node by downloading data from some of the existing nodes. The amount of download is termed as repair bandwidth. One way to implement such a system is to store one fragment of an (n, k) MDS code in each node, in which case the repair bandwidth is B. Since repair of a failed node consumes network bandwidth, codes reducing repair bandwidth are of great interest. Most of the recent work in this area focuses on reducing the repair bandwidth of a set of k nodes which store the data in uncoded form, while the reduction in the repair bandwidth of the remaining nodes is only marginal. In this paper, we present an explicit code which reduces the repair bandwidth for all the nodes to approximately B/2. To the best of our knowledge, this is the first explicit code which reduces the repair bandwidth of all the nodes for all feasible values of the system parameters.

Reducing Buffer Requirements in Core Routers using Dynamic Buffering

Earlier studies have exploited statistical multiplexing of flows in the core of the Internet to reduce the buffer requirement in routers. Reducing the memory requirement of routers is important as it enables an improvement in performance and at the same time a decrease in the cost. In this paper, we observe that the links in the core of the Internet are typically over-provisioned and this can be exploited to reduce the buffering requirement in routers. The small on-chip memory of a network processor (NP) can be effectively used to buffer packets during most regimes of traffic. We propose a dynamic buffering strategy which buffers packets in the receive and transmit buffers of a NP when the memory requirement is low. When the buffer requirement increases due to bursts in the traffic, memory is allocated to packets in the off-chip DRAM. This scheme effectively mitigates the DRAM access bottleneck, as only a part of the traffic is stored in the DRAM. We build a Petri net model and evaluate the proposed scheme with core Internet like traffic. At 77% link utilization, the dynamic buffering scheme has a drop rate of just 0.65%, whereas the traditional DRAM buffering has 4.64% packet drop rate. Even with a high link utilization of 90%, which rarely happens in the core, our dynamic buffering results in a packet drop rate of only 2.17%, while supporting a throughput of 7.39 Gbps. We study the proposed scheme under different conditions to understand the provisioning of processing threads and to determine the queue length at which packets must be buffered in the DRAM. We show that the proposed dynamic buffering strategy drastically reduces the buffering requirement while still maintaining low packet drop rates.

On Reducing Dynamic Web Page Construction Times

Many web sites incorporate dynamic web pages to deliver customized contents to their users. However, dynamic pages result in increased user response times due to their construction overheads. In this paper, we consider mechanisms for reducing these overheads by utilizing the excess capacity with which web servers are typically provisioned. Specifically, we present a caching technique that integrates fragment caching with anticipatory page pre-generation in order to deliver dynamic pages faster during normal operating situations. A feedback mechanism is used to tune the page pre-generation process to match the current system load. The experimental results from a detailed simulation study of our technique indicate that, given a fixed cache budget, page construction speedups of more than fifty percent can be consistently achieved as compared to a pure fragment caching approach.

Reducing convergence times of self-propelled swarms via modified nearest neighbor rules

Vicsek et al. proposed a biologically inspired model of self-propelled particles, which is now commonly referred to as the Vicsek model. Recently, attention has been directed at modifying the Vicsek model so as to improve convergence properties. In this paper, we propose two modification of the Vicsek model which leads to significant improvements in convergence times. The modifications involve an additional term in the heading update rule which depends only on the current or the past states of the particle's neighbors. The variation in convergence properties as the parameters of these modified versions are changed are closely investigated. It is found that in both cases, there exists an optimal value of the parameter which reduces convergence times significantly and the system undergoes a phase transition as the value of the parameter is increased beyond this optimal value. (C) 2012 Elsevier B.V. All rights reserved.

Row-buffer reorganization: simultaneously improving performance and reducing energy in DRAMs

In this paper, based on the temporal and spatial locality characteristics of memory accesses in multicores, we propose a re-organization of the existing single large row buffer in a DRAM bank into multiple smaller row-buffers. The proposed configuration helps improve the row hit rates and also brings down the energy required for row-activations. The major contribution of this work is proposing such a reorganization without requiring any significant changes to the existing widely accepted DRAM specifications. Our proposed reorganization improves performance by 35.8%, 14.5% and 21.6% in quad, eight and sixteen core workloads along with a 42%, 28% and 31% reduction in DRAM energy. Additionally, we introduce a Need Based Allocation scheme for buffer management that shows additional performance improvement.

Time dependent superhydrophobicity of drag reducing surfaces

Air can be trapped on the crevices of specially textured hydrophobic surfaces immersed in water. This heterogenous state of wetting in which the water is in contact with both the solid surface and the entrapped air is not stable. Diffusion of air into the surrounding water leads to gradual reduction in the size and numbers of the air bubbles. The sustainability of the entrapped air on such surfaces is important for many underwater applications in which the surfaces have to remain submersed for longer time periods. In this paper we explore the suitability of different classes of surface textures towards the drag reduction application by evaluating the time required for the disappearance of the air bubbles under hydrostatic conditions. Different repetitive textures consisting of holes, pillars and ridges of different sizes have been generated in silicon, aluminium and brass by isotropic etching, wire EDM and chemical etching respectively. These surfaces were rendered hydrophobic with self-assembled layer of fluorooctyl trichlorosilane for silicon and aluminium surfaces and 1-dodecanethiol for brass surfaces. Using total internal reflection the air bubbles are visualized with the help of a microscope and time lapse photography. Irrespective of the texture, both the size and the number of air pockets were found to decrease with time gradually and eventually disappear. In an attempt to reverse the diffusion we explore the possibility of using electrolysis to generate gases at the textured surfaces. The gas bubbles are nucleated everywhere on the surface and as they grow they coalesce with each other and get pinned at the texture edges.

Bimetallic core-shell nanocomposites using weak reducing agent and their transformation to alloy nanostructures

An in situ seeding growth methodology towards the preparation of core-shell nanoparticles composed of noble metals has been developed by employing trimethylamine borane (TMAB) as the reducing agent. Being a weak reducing agent, TMAB is able to distinguish the smallest reduction potential window of any two metals which renders selective reduction of metal ions thus affording a core-shell architecture of the nanoparticles. A dramatic effect of solvent was noted during the reduction of Ag+ ions: an immediate reduction took place at room temperature when dry THF was used as solvent however, usage of wet THF (THF used directly from the bottle) brings out the reduction only at reflux conditions. In the case of Au and Pd nanoparticles, preparation was found to be independent of the quality of solvent used. Au nanoparticles are realized at room temperature whereas reflux conditions are required in the case of Pd nanoparticles. This difference in behavior of the monometallic nanoparticles was successfully exploited to construct different noble metal nanoparticles with core-shell architectures such as Au@Ag, Ag@Au, and Ag@Pd. Transformation of these core-shell nanoparticles to their thermodynamically stable alloy counterparts is also demonstrated under very mild conditions reported to date.

Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity

Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant decoding complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including the codes constructed in the paper by Ren et al. We show that codes formed as the sum of Clifford Unitary Weight Designs (CUWDs) or Coordinate Interleaved Orthogonal Designs (CIODs) exhibit block orthogonal structure. We also provide new construction of block orthogonal codes from Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs). In addition, we show how the block orthogonal property of the STBCs can be exploited to reduce the decoding complexity of a sphere decoder using a depth first search approach. Simulation results of the decoding complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.