Strategies for efficient start-up of continuous biooxidation process for refractory gold ores

Strategies for efficient start-up of a continuous process for biooxidation of refractory gold ore and concentrate obtained from Hutti, Gold Mines Limited (HGML), India are discussed in this work. The biooxidation of the concentrate at high pulp density (10%) with wild strain of Thiobacillus ferrooxidans isolated from HGML mines is characterized by significant lag phase (20 days) and incomplete oxidation (35%) even after prolonged operation (60 days). Two strategies, biooxidation with concentrate adapted cells and a step leaching strategy, in which the pulp density is progressively increased from 2% to 10% were considered and the latter resulted in efficient biooxidation of concentrate. Conversion of such a process from batch to continuous operation is shown to result in complete biooxidation of the concentrate and gold extraction efficiency in excess of 90%. (C) 2002 Elsevier Science Ltd. All rights reserved.

Strategies for Rescheduling Tightly-Coupled Parallel Applications in Multi-Cluster Grids

As computational Grids are increasingly used for executing long running multi-phase parallel applications, it is important to develop efficient rescheduling frameworks that adapt application execution in response to resource and application dynamics. In this paper, three strategies or algorithms have been developed for deciding when and where to reschedule parallel applications that execute on multi-cluster Grids. The algorithms derive rescheduling plans that consist of potential points in application execution for rescheduling and schedules of resources for application execution between two consecutive rescheduling points. Using large number of simulations, it is shown that the rescheduling plans developed by the algorithms can lead to large decrease in application execution times when compared to executions without rescheduling on dynamic Grid resources. The rescheduling plans generated by the algorithms are also shown to be competitive when compared to the near-optimal plans generated by brute-force methods. Of the algorithms, genetic algorithm yielded the most efficient rescheduling plans with 9-12% smaller average execution times than the other algorithms.

Incentive Compatible Mechanisms for Resource Procurement in Computational Grids with Rational resource Providers

In a computational grid, the presence of grid resource providers who are rational and intelligent could lead to an overall degradation in the efficiency of the grid. In this paper, we design incentive compatible grid resource procurement mechanisms which ensure that the efficiency of the grid is not affected by the rational behavior of resource providers.In particular, we offer three elegant incentive compatible mechanisms for this purpose: (1) G-DSIC (Grid-Dominant Strategy Incentive Compatible) mechanism (2) G-BIC (Grid-Bayesian Nash Incentive Compatible) mechanism (3) G-OPT(Grid-Optimal) mechanism which minimizes the cost to the grid user, satisfying at the same time, (a) Bayesian incentive compatibility and (b) individual rationality. We evaluate the relative merits and demerits of the above three mechanisms using game theoretical analysis and numerical experiments.

A Shapley Value Analysis to Coordinate the Formation of Procurement Networks

In this paper we address the problem of forming procurement networks for items with value adding stages that are linearly arranged. Formation of such procurement networks involves a bottom-up assembly of complex production, assembly, and exchange relationships through supplier selection and contracting decisions. Research in supply chain management has emphasized that such decisions need to take into account the fact that suppliers and buyers are intelligent and rational agents who act strategically. In this paper, we view the problem of procurement network formation (PNF) for multiple units of a single item as a cooperative game where agents cooperate to form a surplus maximizing procurement network and then share the surplus in a fair manner. We study the implications of using the Shapley value as a solution concept for forming such procurement networks. We also present a protocol, based on the extensive form game realization of the Shapley value, for forming these networks.

An intelligent procurement marketplace for web services composition

This paper presents an intelligent procurement marketplace for finding the best mix of web services to dynamically compose the business process desired by a web service requester. We develop a combinatorial auction approach that leads to an integer programming formulation for the web services composition problem. The model takes into account the Quality of Service (QoS) and Service Level Agreements (SLA) for differentiating among multiple service providers who are capable of fulfilling a functionality. An important feature of the model is interface aware composition.

Existing and emerging strategies for the synthesis of nanoscale heterostructures

Development of new multifunctional nanostructures relies on the ability to make new materials at the nanoscale with control over size, shape and composition. While this control is extremely important to tune several properties, an alternative strategy is to create active interfaces between two or more nanostructures to form nanoscale heterostructures. In these heterostructures, the interfaces play a key role in stabilizing and enhancing the efficiency of the individual components for various applications. In this article, we discuss synthesis methods of different types of nanoscale heterostructures and the role of interfaces in various applications. We present the current state-of-the-art in designing heterostructures and possible upcoming synthetic strategies with their advantages and disadvantages. We present how such heterostructures are highly efficient for catalytic, photovoltaic and nanoelectronic applications drawing several examples from our own studies and from the literature.

Bold strategies for Indian science

When an Indian prime minister publicly admits that India has fallen behind China, it is news. Manmohan Singh's statement last January at the Indian Science Congress in Bhubaneswar that this is so with respect to scientific research, and that “India's relative position in the world of science has been declining”, has rung alarm bells. Singh was not springing anything new on Indian scientists; many of us will admit that things are not well1. Recognizing the problem is the first step towards reversing this slide.

Progressive structure-based alignment of homologous proteins: Adopting sequence comparison strategies

Comparison of multiple protein structures has a broad range of applications in the analysis of protein structure, function and evolution. Multiple structure alignment tools (MSTAs) are necessary to obtain a simultaneous comparison of a family of related folds. In this study, we have developed a method for multiple structure comparison largely based on sequence alignment techniques. A widely used Structural Alphabet named Protein Blocks (PBs) was used to transform the information on 3D protein backbone conformation as a ID sequence string. A progressive alignment strategy similar to CLUSTALW was adopted for multiple PB sequence alignment (mulPBA). Highly similar stretches identified by the pairwise alignments are given higher weights during the alignment. The residue equivalences from PB based alignments are used to obtain a three dimensional fit of the structures followed by an iterative refinement of the structural superposition. Systematic comparisons using benchmark datasets of MSTAs underlines that the alignment quality is better than MULTIPROT, MUSTANG and the alignments in HOMSTRAD, in more than 85% of the cases. Comparison with other rigid-body and flexible MSTAs also indicate that mulPBA alignments are superior to most of the rigid-body MSTAs and highly comparable to the flexible alignment methods. (C) 2012 Elsevier Masson SAS. All rights reserved.

Decentralised carbon footprint analysis for opting climate change mitigation strategies in India

Carbon footprint (CF) refers to the total amount of carbon dioxide and its equivalents emitted due to various anthropogenic activities. Carbon emission and sequestration inventories have been reviewed sector-wise for all federal states in India to identify the sectors and regions responsible for carbon imbalances. This would help in implementing appropriate climate change mitigation and management strategies at disaggregated levels. Major sectors of carbon emissions in India are through electricity generation, transport, domestic energy consumption, industries and agriculture. A majority of carbon storage occurs in forest biomass and soil. This paper focuses on the statewise carbon emissions (CO2. CO and CH4), using region specific emission factors and statewise carbon sequestration capacity. The estimate shows that CO2, CO and CH4 emissions from India are 965.9, 22.5 and 16.9 Tg per year, respectively. Electricity generation contributes 35.5% of total CO2 emission, which is followed by the contribution from transport. Vehicular transport exclusively contributes 25.5% of total emission. The analysis shows that Maharashtra emits higher CO2, followed by Andhra Pradesh, Uttar Pradesh, Gujarat, Tamil Nadu and West Bengal. The carbon status, which is the ratio of annual carbon storage against carbon emission, for each federal state is computed. This shows that small states and union territories (UT) like Arunachal Pradesh, Mizoram and Andaman and Nicobar Islands, where carbon sequestration is higher due to good vegetation cover, have carbon status > 1. Annually, 7.35% of total carbon emissions get stored either in forest biomass or soil, out of which 34% is in Arunachal Pradesh, Madhya Pradesh, Chhattisgarh and Orissa. (C) 2012 Elsevier Ltd. All rights reserved.

Strategies for the Synthesis of Graphene, Graphene Nanoribbons, Nanoscrolls and Related Materials

Single-layer graphene (SLG), the 3.4 angstrom thick two-dimensional sheet of sp(2) carbon atoms, was first prepared in 2004 by mechanical exfoliation of graphite crystals using the scotch tape technique. Since then, SLG has been prepared by other physical methods such as laser irradiation or ultrasonication of graphite in liquid media. Chemical methods of synthesis of SLG are more commonly used; the most popular involves preparation of single-layer graphene oxide followed by reduction with a stable reagent, often assisted by microwave heating. This method yields single-layer reduced graphene oxide. Other methods for preparing SLG include chemical vapour deposition over surfaces of transition metals such as Ni and Cu. Large-area SLG has also been prepared by epitaxial growth over SIC. Few-layer graphene (FLG) is prepared by several methods; arc discharge of graphite in hydrogen atmosphere being the most convenient. Several other methods for preparing FLG include exfoliation of graphite oxide by rapid heating, ultrasonication or laser irradiation of graphite in liquid media, reduction of few-layer graphene oxide, alkali metal intercalation followed by exfoliation. Graphene nanoribbons, which are rectangular strips of graphene, are best prepared by the unzipping of carbon nanotubes by chemical oxidation or laser irradiation. Many graphene analogues of inorganic materials such as MoS2, MoSe2 and BN have been prepared by mechanical exfoliation, ultrasonication and by chemical methods involving high-temperature or hydrothermal reactions and intercalation of alkali metals followed by exfoliation. Scrolls of graphene are prepared by potassium intercalation in graphite or by microwave irradiation of graphite immersed in liquid nitrogen.