An End-Use Oriented Global Energy Strategy

Abstract is not available.

A strategy-proof and budget-balanced mechanism for carbon footprint reduction by global companies

The problem addressed in this paper is concerned with an important issue faced by any green aware global company to keep its emissions within a prescribed cap. The specific problem is to allocate carbon reductions to its different divisions and supply chain partners in achieving a required target of reductions in its carbon reduction program. The problem becomes a challenging one since the divisions and supply chain partners, being autonomous, may exhibit strategic behavior. We use a standard mechanism design approach to solve this problem. While designing a mechanism for the emission reduction allocation problem, the key properties that need to be satisfied are dominant strategy incentive compatibility (DSIC) (also called strategy-proofness), strict budget balance (SBB), and allocative efficiency (AE). Mechanism design theory has shown that it is not possible to achieve the above three properties simultaneously. In the literature, a mechanism that satisfies DSIC and AE has recently been proposed in this context, keeping the budget imbalance minimal. Motivated by the observation that SBB is an important requirement, in this paper, we propose a mechanism that satisfies DSIC and SBB with slight compromise in allocative efficiency. Our experimentation with a stylized case study shows that the proposed mechanism performs satisfactorily and provides an attractive alternative mechanism for carbon footprint reduction by global companies.

Immune responses against hepatitis C virus genotype 3a virus-like particles in mice: A novel VLP prime-adenovirus boost strategy

Chronic hepatitis C virus (HCV) infection represents a major health threat to global population. In India, approximately 15-20% of cases of chronic liver diseases are caused by HCV infection. Although, new drug treatments hold great promise for HCV eradication in infected individuals, the treatments are highly expensive. A vaccine for preventing or treating HCV infection would be of great value, particularly in developing countries. Several preclinical trials of virus-like particle (VLP) based vaccine strategies are in progress throughout the world. Previously, using baculovirus based system, we have reported the production of hepatitis C virus-like particles (HCV-LPs) encoding structural proteins for genotype 3a, which is prevalent in India. In the present study, we have generated HCV-LPs using adenovirus based system and tried different immunization strategies by using combinations of both kinds of HCV-LPs with other genotype 3a-based immunogens. HCV-LPs and peptides based ELISAs were used to evaluate antibody responses generated by these combinations. Cell-mediated immune responses were measured by using T-cell proliferation assay and intracellular cytokine staining. We observed that administration of recombinant adenoviruses expressing HCV structural proteins as final booster enhances both antibody as well as T-cell responses. Additionally, reduction of binding of VLP and JFH1 virus to human hepatocellular carcinoma cells demonstrated the presence of neutralizing antibodies in immunized sera. Taken together, our results suggest that the combined regimen of VLP followed by recombinant adenovirus could more effectively inhibit HCV infection, endorsing the novel vaccine strategy. (C) 2015 Elsevier Ltd. All rights reserved.

A new load distribution strategy for linear network with communication delays

In this paper, we propose a new load distribution strategy called `send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of `digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.

An Efficient Load Distribution Strategy for a Distributed Linear Network of Processors with Communication Delays

In this paper, we present an improved load distribution strategy, for arbitrarily divisible processing loads, to minimize the processing time in a distributed linear network of communicating processors by an efficient utilization of their front-ends. Closed-form solutions are derived, with the processing load originating at the boundary and at the interior of the network, under some important conditions on the arrangement of processors and links in the network. Asymptotic analysis is carried out to explore the ultimate performance limits of such networks. Two important theorems are stated regarding the optimal load sequence and the optimal load origination point. Comparative study of this new strategy with an earlier strategy is also presented.