A Reactive Tabu Search Based Equalizer for Severely Delay-Spread UWB MIMO-ISI Channels

We propose a novel equalizer for ultrawideband (UWB) multiple-input multiple-output (MIMO) channels characterized by severe delay spreads. The proposed equalizer is based on reactive tabu search (RTS), which is a heuristic originally designed to obtain approximate solutions to combinatorial optimization problems. The proposed RTS equalizer is shown to perform increasingly better for increasing number of multipath components (MPC), and achieve near maximum likelihood (ML) performance for large number of MPCs at a much less complexity than that of the ML detector. The proposed RTS equalizer is shown to perform close to within 0.4 dB of single-input multiple-output AWGN performance at 10(-3) uncoded BER on a severely delay-spread UWB MIMO channel with 48 equal-energy MPCs.

A Training-Based Iterative Detection/Channel Estimation Scheme for Large Non-Orthogonal STBC MIMO Systems

In this paper, we propose a training-based channel estimation scheme for large non-orthogonal space-time block coded (STBC) MIMO systems.The proposed scheme employs a block transmission strategy where an N-t x N-t pilot matrix is sent (for training purposes) followed by several N-t x N-t square data STBC matrices, where Nt is the number of transmit antennas. At the receiver, we iterate between channel estimation (using an MMSE estimator) and detection (using a low-complexity likelihood ascent search (LAS) detector) till convergence or for a fixed number of iterations. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed scheme at low complexities. The fact that we could show such good results for large STBCs (e.g., 16 x 16 STBC from cyclic division algebras) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot-based channel estimation and turbo coding) establishes the effectiveness of the proposed scheme.

Search for new transparent conductors: Effect of Ge doping on the conductivity of Ga2O3, In2O3 and Ga1.4In0.6O3

Only a small amount (<= 3.5 mol%) of Ge can be doped in Ga2O3, Ga1.4In0.6O3 and In2O3 by means of solid state reactions at 1400 degrees C. All these samples are optically transparent in the visible range, but Ge-doped Ga2O3 and Ga1.4In0.6O3 are insulating. Only Ge-doped In2O3 exhibits a significant decrease in resistivity, the resistivity decreasing further on thermal quenching and H-2 reduction.The resistivity of 2.7% Ge-doped In2O3 after H-2 reduction shows a metallic behavior, and a resistivity of similar to 1 m Omega cm at room temperature, comparable to that of Sn-doped In2O3. (C) 2010 Elsevier Ltd. All rights reserved.

Search on a hypercubic lattice using a quantum random walk. I. d > 2

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighboring locations. We construct a quantum random walk algorithm, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice. The restriction on movement hardly matters for d > 2, and scaling behavior close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimize the proportionality constants of the scaling behavior, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean-field theory or the d -> infinity limit). In particular, the scaling behavior for d = 3 is only about 25% higher than the optimal d -> infinity value.

Search on a hypercubic lattice using a quantum random walk. II. d = 2

We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretized according to the staggered lattice fermion formalism. d = 2 is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behavior. As a result, the construction used in our accompanying article A. Patel and M. A. Rahaman, Phys. Rev. A 82, 032330 (2010)] provides an O(root N ln N) algorithm, which is not optimal. The scaling behavior can be improved to O(root N ln N) by cleverly controlling the massless Dirac evolution operator by an ancilla qubit, as proposed by Tulsi Phys. Rev. A 78, 012310 (2008)]. We reinterpret the ancilla control as introduction of an effective mass at the marked vertex, and optimize the proportionality constants of the scaling behavior of the algorithm by numerically tuning the parameters.

PeptideMine - A webserver for the design of peptides for protein-peptide binding studies derived from protein-protein interactomes

Background: Signal transduction events often involve transient, yet specific, interactions between structurally conserved protein domains and polypeptide sequences in target proteins. The identification and validation of these associating domains is crucial to understand signal transduction pathways that modulate different cellular or developmental processes. Bioinformatics strategies to extract and integrate information from diverse sources have been shown to facilitate the experimental design to understand complex biological events. These methods, primarily based on information from high-throughput experiments, have also led to the identification of new connections thus providing hypothetical models for cellular events. Such models, in turn, provide a framework for directing experimental efforts for validating the predicted molecular rationale for complex cellular processes. In this context, it is envisaged that the rational design of peptides for protein-peptide binding studies could substantially facilitate the experimental strategies to evaluate a predicted interaction. This rational design procedure involves the integration of protein-protein interaction data, gene ontology, physico-chemical calculations, domain-domain interaction data and information on functional sites or critical residues. Results: Here we describe an integrated approach called ``PeptideMine'' for the identification of peptides based on specific functional patterns present in the sequence of an interacting protein. This approach based on sequence searches in the interacting sequence space has been developed into a webserver, which can be used for the identification and analysis of peptides, peptide homologues or functional patterns from the interacting sequence space of a protein. To further facilitate experimental validation, the PeptideMine webserver also provides a list of physico-chemical parameters corresponding to the peptide to determine the feasibility of using the peptide for in vitro biochemical or biophysical studies. Conclusions: The strategy described here involves the integration of data and tools to identify potential interacting partners for a protein and design criteria for peptides based on desired biochemical properties. Alongside the search for interacting protein sequences using three different search programs, the server also provides the biochemical characteristics of candidate peptides to prune peptide sequences based on features that are most suited for a given experiment. The PeptideMine server is available at the URL: http://caps.ncbs.res.in/peptidemine

Energy efficient asymmetric binary search switching technique for SAR ADC

An asymmetric binary search switching technique for a successive approximation register (SAR) ADC is presented, and trade-off between switching energy and conversion cycles is discussed. Without using any additional switches, the proposed technique consumes 46% less switching energy, for a small input swing (0.5 V-ref (P-P)), as compared to the last reported efficient switching technique in literature for an 8-bit SAR ADC. For a full input swing (2 V-ref (P-P)), the proposed technique consumes 16.5% less switching energy.

A radical cyclisation based strategy to cuparenoids; synthesis of (±)-α-cuparenone, (±)-epilaurene and laurenes

Mercuric acetate catalysed one pot Claisen rearrangement of the cinnamyl alcohol Image , generated the pent-4-enal Image , which on homologation resulted the hex-5-enal Image . Radical cyclisation of the radical anion derived from Image , followed by oxidation provided the ketone mixture Image , a known precursor to the sesquiterpenes (Image )-α-cuparenone (Image ), (Image )-epilaurene (Image ) and laurene (Image )

Random-Restart Reactive Tabu Search Algorithm for Detection in Large-MIMO Systems

We present a low-complexity algorithm based on reactive tabu search (RTS) for near maximum likelihood (ML) detection in large-MIMO systems. The conventional RTS algorithm achieves near-ML performance for 4-QAM in large-MIMO systems. But its performance for higher-order QAM is far from ML performance. Here, we propose a random-restart RTS (R3TS) algorithm which achieves significantly better bit error rate (BER) performance compared to that of the conventional RTS algorithm in higher-order QAM. The key idea is to run multiple tabu searches, each search starting with a random initial vector and choosing the best among the resulting solution vectors. A criterion to limit the number of searches is also proposed. Computer simulations show that the R3TS algorithm achieves almost the ML performance in 16 x 16 V-BLAST MIMO system with 16-QAM and 64-QAM at significantly less complexities than the sphere decoder. Also, in a 32 x 32 V-BLAST MIMO system, the R3TS performs close to ML lower bound within 1.6 dB for 16-QAM (128 bps/Hz), and within 2.4 dB for 64-QAM (192 bps/Hz) at 10(-3) BER.

A Strategy for Conserving the Biodiversity of the Uttara Kannada District in South India

Taking the various values ascribed to biodiversity as its point of departure rather many years ago, the present study aims at deriving a conservation strategy for Uttara Kannada. This hilly district, with the highest proportion of its area under forests in South India, is divided into five ecological zones: coastal, northern evergreen, southern evergreen, moist deciduous, and dry deciduous. The heavily-populated coastal zone includes mangrove forests and estuarine wetlands. The evergreen forests are particularly rich in the diversity of plant species which they support - including wild relatives of a number of cultivated plants. They also serve a vital function in watershed conservation. The moist deciduous forests are rich in bird species; both moist and dry deciduous forests include a number of freshwater ponds and lakes that support a high diversity of aquatic birds.Reviewing the overall distribution of biodiversity, we identify specific localities - including estuaries, evergreen forests, and moist deciduous forests - which should be set aside as Nature reserves. These larger reserves must be complemented by a network of traditionally-protected sacred groves and sacred trees that are distributed throughout the district and that protect today, for instance, the finest surviving stand of dipterocarp trees.We also spell out the necessary policy-changes in overall development strategy that should stem the ongoing decimation of biodiversity. These include (1) revitalizing community-based systems of sustainable management of village forests and protection of sacred groves and trees; (2) reorienting the usage-pattern of reserve forests from production of a limited variety of timber and softwood species for industrial consumers, to production of a larger diversity of non-wood forest produce of commercial value to support the rural economy; (3) utilizing marginal lands under private ownership for generating industrial wood supplies; and (4) provision of incentives for in situ maintenance of land-races of cultivated plants - especially evergreen, fruit-yielding trees - by the local people.It is proposed that this broad framework be now taken to the local communities, and that an action-plan be developed on the basis of inputs provided - and initiatives taken - by them.

A monolithic strategy for fluid-structure interaction problems

In this work, we present a new monolithic strategy for solving fluid-structure interaction problems involving incompressible fluids, within the context of the finite element method. This strategy, similar to the continuum dynamics, conserves certain properties, and thus provides a rational basis for the design of the time-stepping strategy; detailed proofs of the conservation of these properties are provided. The proposed algorithm works with displacement and velocity variables for the structure and fluid, respectively, and introduces no new variables to enforce velocity or traction continuity. Any existing structural dynamics algorithm can be used without change in the proposed method. Use of the exact tangent stiffness matrix ensures that the algorithm converges quadratically within each time step. An analytical solution is presented for one of the benchmark problems used in the literature, namely, the piston problem. A number of benchmark problems including problems involving free surfaces such as sloshing and the breaking dam problem are used to demonstrate the good performance of the proposed method. Copyright (C) 2010 John Wiley & Sons, Ltd.

Radical Annulation Strategy to Chiral Pupukeanones: Total Synthesis of (+)-10-ex&l(- Naphthyl)pupukean-9-onea nd (+)-lO-exo-l(- Naphthyl)-5-epipupukean-9-ones1

Intramolecular alkylation reaction of the bromoenone 12, obtained from S-carvone in three steps, furnished the bicyclo[2.2.2]octenone 13. Contrary to the anticipated radical annulation reaction, the bicyclic bromides 14 and 15, obtained from the enone 13, generated exclusively the cyclopropane product 18 via a 3-exo-trig radical cyclization on reaction with nBu3SnH and AIBN, even in the presence of a large excess of a radicophile. On the other hand, bromoenone 24, synthesized from R-carvone via S-naphthylcarvone 21, underwent radical annulation reaction in the presence of radicophiles to furnish the isotwistanes 25-28 in a regio- and stereospecific manner. Hydrogenation of the olefin 34, obtained from the diketone 27 via a regiospecific Wittig reaction, furnished the naphthyl-5-epipupukean-9-one 33, whereas stereoselective hydrogenation of the enone 36, prepared from the keto ester 25 via a Grignard reaction and dehydration sequence, generated the naphthylpupukeanone 32.

A regiospecific radical annulation strategy to functionalised chiral bicyclo[3.3.l]nonanes

A radical annulation, i.e. an intermolecular radical Michael addition followed by an intramolecular Michael addition of the resultant radical (radical cyclisation) has been employed for the construction of chiral functionalised bicyclo[3.3,1]-nonanes. Thus reaction of carvone hydrohalides 7 with (n)Bu(3)SnH and AIBN in the presence of excess of radicophiles 4 furnished, regiospecifically bicyclo[3.3.1]nonanes 8-14, introducing three new chiral centres in a stereoselective manner. Analogously the bromide 18 generated the bridgehead substituted bicyclo[3.3.1]-nonanes 19-21.

An Efficient Random Walk Strategy for Sampling Based Robot Motion Planners

Sampling based planners have been successful in path planning of robots with many degrees of freedom, but still remains ineffective when the configuration space has a narrow passage. We present a new technique based on a random walk strategy to generate samples in narrow regions quickly, thus improving efficiency of Probabilistic Roadmap Planners. The algorithm substantially reduces instances of collision checking and thereby decreases computational time. The method is powerful even for cases where the structure of the narrow passage is not known, thus giving significant improvement over other known methods.

Frontier Based Multiple Goal Search in Unknown Environments

We present a frontier based algorithm for searching multiple goals in a fully unknown environment, with only information about the regions where the goals are most likely to be located. Our algorithm chooses an ``active goal'' from the ``active goal list'' generated by running a Traveling Salesman Problem (Tsp) routine with the given centroid locations of the goal regions. We use the concept of ``goal switching'' which helps not only in reaching more number of goals in given time, but also prevents unnecessary search around the goals that are not accessible (surrounded by walls). The simulation study shows that our algorithm outperforms Multi-Heuristic LRTA* (MELRTA*) which is a significant representative of multiple goal search approaches in an unknown environment, especially in environments with wall like obstacles.