Computationally Efficient Sub-optimal Mid Course Guidance Using Model Predictive Static Programming (MPSP)

For a homing interceptor, suitable initial condition must be achieved by mid course guidance scheme for its maximum effectiveness. To achieve desired end goal of any mid course guidance scheme, two point boundary value problem must be solved online with all realistic constrain. A Newly developed computationally efficient technique named as MPSP (Model Predictive Static Programming) is utilized in this paper for obtaining suboptimal solution of optimal mid course guidance. Time to go uncertainty is avoided in this formulation by making use of desired position where midcourse guidance terminate and terminal guidance takes over. A suitable approach angle towards desired point also can be specified in this guidance law formulation. This feature makes this law particularly attractive because warhead effectiveness issue can be indirectly solved in mid course phase.

Power Efficient Redundant Execution for Chip Multiprocessor

This paper describes the design of a power efficient microarchitecture for transient fault detection in chip multiprocessors (CMPs) We introduce a new per-core dynamic voltage and frequency scaling (DVFS) algorithm for our architecture that significantly reduces power dissipation for redundant execution with a minimal performance overhead. Using cycle accurate simulation combined with a simple first order power model, we estimate that our architecture reduces dynamic power dissipation in the redundant core by an mean value of 79% and a maximum of 85% with an associated mean performance overhead of only 1:2%

STEM+: A Fair and Efficient Algorithm for Scheduling on the DSCH in UMTS Networks

In Universal Mobile Telecommunication Systems (UMTS), the Downlink Shared Channel (DSCH) can be used for providing streaming services. The traffic model for streaming services is different from the commonly used continuously- backlogged model. Each connection specifies a required service rate over an interval of time, k, called the "control horizon". In this paper, our objective is to determine how k DSCH frames should be shared among a set of I connections. We need a scheduler that is efficient and fair and introduce the notion of discrepancy to balance the conflicting requirements of aggregate throughput and fairness. Our motive is to schedule the mobiles in such a way that the schedule minimizes the discrepancy over the k frames. We propose an optimal and computationally efficient algorithm, called STEM+. The proof of the optimality of STEM+, when applied to the UMTS rate sets is the major contribution of this paper. We also show that STEM+ performs better in terms of both fairness and aggregate throughput compared to other scheduling algorithms. Thus, STEM+ achieves both fairness and efficiency and is therefore an appealing algorithm for scheduling streaming connections.

An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks

This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxy-based scheme in the work of Ling and Znati (2005) and Li et al. (2005), we introduce a friend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friend-based scheme performs better than the proxy-based scheme both in terms of resilience against node capture as well as in energy consumption for pairwise key establishment, making our scheme more feasible.

Perfluoroalkyl bile esters: a new class of efficient gelators of organic and aqueous-organic media

A new class of fluorinated gelators derived from bile acids is reported. Perfluoroalkyl chains were attached to the bile acids through two different ester linkages and were synthesized following simple transformations. The gelation property of these derivatives is a function of the bile acid moiety, the spacer and the fluoroalkyl chain length. By varying these parameters, gels were obtained in aromatic hydrocarbons, DMSO and DMSO/DMF-H(2)O mixtures of different proportions. Several derivatives of deoxycholic and lithocholic acids were found to be efficient organogelators, while the reported bile-acid based organogelators are mostly derived from the cholic acid moiety. The efficient gelators among these compounds formed gels well below 1.0% (w/v) and hence they can be termed as supergelators. The mechanical properties of these gels could be modulated by changing either the bile acid moiety or by varying the length of the fluoroalkyl segment. The presence of CO(2)-philic perfluoroalkyl groups is also expected to enhance their solubility in supercritical CO(2) and hence these compounds are promising candidates for making aerogels.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

An Efficient MPI_Allgather for Grids

Allgather is an important MPI collective communication. Most of the algorithms for allgather have been designed for homogeneous and tightly coupled systems. The existing algorithms for allgather on Gridsystems do not efficiently utilize the bandwidths available on slow wide-area links of the grid. In this paper, we present an algorithm for allgather on grids that efficiently utilizes wide-area bandwidths and is also wide-area optimal. Our algorithm is also adaptive to gridload dynamics since it considers transient network characteristics for dividing the nodes into clusters. Our experiments on a real-grid setup consisting of 3 sites show that our algorithm gives an average performance improvement of 52% over existing strategies.

Perfluoroalkyl bile esters: a new class of efficient gelators of organic and aqueous-organic media

A new class of fluorinated gelators derived from bile acids is reported. Perfluoroalkyl chains were attached to the bile acids through two different ester linkages and were synthesized following simple transformations. The gelation property of these derivatives is a function of the bile acid moiety, the spacer and the fluoroalkyl chain length. By varying these parameters, gels were obtained in aromatic hydrocarbons, DMSO and DMSO/DMF-H(2)O mixtures of different proportions. Several derivatives of deoxycholic and lithocholic acids were found to be efficient organogelators, while the reported bile-acid based organogelators are mostly derived from the cholic acid moiety. The efficient gelators among these compounds formed gels well below 1.0% (w/v) and hence they can be termed as supergelators. The mechanical properties of these gels could be modulated by changing either the bile acid moiety or by varying the length of the fluoroalkyl segment. The presence of CO(2)-philic perfluoroalkyl groups is also expected to enhance their solubility in supercritical CO(2) and hence these compounds are promising candidates for making aerogels.

Explorations en route to synthesis of tashironins: singlet oxygen cycloaddition to 1,3-cyclopentadienes embedded within allo-cedrane framework

In an approach directed toward a tashironin based complex natural product, efficacy of the singlet oxygen mediated [4+2]-cycloaddition to a tetracyclic cyclopentadiene has been evaluated to install the key cis-1,4-dihydroxy functionality. (C) 2011 Elsevier Ltd. All rights reserved.

Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.

Iodine-Catalyzed Amination of Benzoxazoles: A Metal-Free Route to 2-Aminobenzoxazoles under Mild Conditions

A facile metal-free route of oxidative amination of benzoxazole by activation of C-H bonds with secondary or primary amines in the presence of catalytic iodine in aqueous tert-butyl hydroperoxide proceeds smoothly at ambient temperature under neat reaction condition to furnish the high yield of the aminated product. This user-friendly method to form C-N bonds produces tertiary butanol and water as the byproduct, which are environmentally benign. The application of the methodology is demonsrated by synthesizing therapeutically active benzoxazoles.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Efficient space-time codes from cyclic division algebras

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

Efficient synthesis of carbonyl compounds: oxidation of azides and alcohols catalyzed by vanadium pentoxide in water using tert-butylhydroperoxide

Catalytic amount of vanadium reagent with tert-butylhydroperoxide as the oxidant was found to be an excellent oxidizing agent in aqueous medium. Vanadium pentoxide with aq tert-butylhydroperoxide readily oxidizes primary benzylic azides to the corresponding acids and secondary benzylic azides to the corresponding ketones in excellent yields. Further, vanadium pentoxide and aq tert-butylhydroperoxide combination turned out to be an effective catalyst for the oxidation of alcohols. Using vanadium pentoxide and aq tert-butylhydroperoxide primary alcohols were oxidized to the corresponding acids, whereas secondary alcohols underwent a smooth transformation to furnish corresponding ketones in excellent yields. All the oxidations are performed in water. (C) 2011 Elsevier Ltd. All rights reserved.