Search for Bs0→μ+μ- and B0→μ+μ- Decays with 2 fb-1 of pp̅ Collisions

We have performed a search for Bs0→μ+μ- and B0→μ+μ- decays in pp̅ collisions at √s=1.96  TeV using 2  fb-1 of integrated luminosity collected by the CDF II detector at the Fermilab Tevatron Collider. The observed number of Bs0 and B0 candidates is consistent with background expectations. The resulting upper limits on the branching fractions are B(Bs0→μ+μ-)<5.8×10-8 and B(B0→μ+μ-)<1.8×10-8 at 95% C.L.

Search for Exclusive Z-Boson Production and Observation of High-Mass pp̅ →pγγp̅ →pl+l-p̅ Events in pp̅ Collisions at √s=1.96 TeV

We present a search for exclusive Z boson production in proton-antiproton collisions at sqrt(s) = 1.96 TeV, using the CDF II detector at Fermilab. We observe no exclusive Z->ll candidates and place the first upper limit on the exclusive Z cross section in hadron collisions, sigma(exclu) gammagamma->p+ll+pbar, and measure the cross section for M(ll) > 40 GeV/c2 and |eta(l)|

Search for new particles decaying into dijets in proton-antiproton collisions at √s=1.96 TeV

We present a search for new particles whose decays produce two jets (dijets) using proton-antiproton collision data corresponding to an integrated luminosity of 1.13 fb-1 collected with the CDF II detector. The measured dijet mass spectrum is found to be consistent with next-to-leading-order perturbative QCD predictions, and no significant evidence of new particles is found. We set upper limits at the 95% confidence level on cross sections times the branching fraction for the production of new particles decaying into dijets with both jets having a rapidity magnitude |y|

Search for Bs0→μ+μ- and B0→μ+μ- Decays with 2 fb-1 of pp̅ Collisions

We have performed a search for Bs-->mu+mu- and Bd-->mu+mu- decays in ppbar collisions at sqrt(s) = 1.96TeV using 2fb-1 of integrated luminosity collected by the CDF II detector at the Fermilab Tevatron Collider. The observed number of Bs and Bd candidates is consistent with background expectations. The resulting upper limits on the branching fractions are B(Bs-->mu+mu-) mu+mu-)

Search for new color-octet vector particle decaying to t tbar in p pbar collisions at sqrt{s} = 1.96 TeV

We present the result of a search for a massive color-octet vector particle, (e.g. a massive gluon) decaying to a pair of top quarks in proton-antiproton collisions with a center-of-mass energy of 1.96 TeV. This search is based on 1.9 fb$^{-1}$ of data collected using the CDF detector during Run II of the Tevatron at Fermilab. We study $t\bar{t}$ events in the lepton+jets channel with at least one $b$-tagged jet. A massive gluon is characterized by its mass, decay width, and the strength of its coupling to quarks. These parameters are determined according to the observed invariant mass distribution of top quark pairs. We set limits on the massive gluon coupling strength for masses between 400 and 800 GeV$/c^2$ and width-to-mass ratios between 0.05 and 0.50. The coupling strength of the hypothetical massive gluon to quarks is consistent with zero within the explored parameter space.

Search for the Decays B(s)0→e+μ- and B(s)0→e+e- in CDF Run II

We report results from a search for the lepton flavor violating decays $B^0_{(s)}\to e^+\mu^-$, and the flavor-changing neutral-current decays $B^0_{(s)} \to e^+ e^-$. The analysis uses data corresponding to ${\rm 2 fb^{-1}}$ of integrated luminosity of $p \bar{p}$ collisions at $\sqrt{s}=1.96 {\rm TeV}$ collected with the upgraded Collider Detector (CDF II) at the Fermilab Tevatron. The observed number of $B^0_{(s)}$ candidates is consistent with background expectations. The resulting Bayesian upper limits on the branching ratios at 90% credibility level are $\mathcal{B}(B^0_s \to e^{+}\mu^{-}) e^{+}\mu^{-})e^{+}\mu^{-}) 47.8 {\rm TeV/c^2}$, and ${M_{LQ}}(B^0\to e^+ \mu^-) > 59.3 {\rm TeV/c^2}$, at 90% credibility level.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Wave algorithms:Optimal database search and catalysis

Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.

Cascade PSI-BLAST web server: a remote homology search tool for relating protein domains

Owing to high evolutionary divergence, it is not always possible to identify distantly related protein domains by sequence search techniques. Intermediate sequences possess sequence features of more than one protein and facilitate detection of remotely related proteins. We have demonstrated recently the employment of Cascade PSI-BLAST where we perform PSI-BLAST for many 'generations', initiating searches from new homologues as well. Such a rigorous propagation through generations of PSI-BLAST employs effectively the role of intermediates in detecting distant similarities between proteins. This approach has been tested on a large number of folds and its performance in detecting superfamily level relationships is similar to 35% better than simple PSI-BLAST searches. We present a web server for this search method that permits users to perform Cascade PSI-BLAST searches against the Pfam, SCOP and SwissProt databases. The URL for this server is http://crick.mbu.iisc.ernet.in/similar to CASCADE/CascadeBlast.html.

Self assessment schemes for multi-agent cooperative search

In this paper, we present self assessment schemes (SAS) for multiple agents performing a search mission on an unknown terrain. The agents are subjected to limited communication and sensor ranges. The agents communicate and coordinate with their neighbours to arrive at route decisions. The self assessment schemes proposed here have very low communication and computational overhead. The SAS also has attractive features like scalability to large number of agents and fast decision-making capability. SAS can be used with partial or complete information sharing schemes during the search mission. We validate the performance of SAS using simulation on a large search space consisting of 100 agents with different information structures and self assessment schemes. We also compare the results obtained using SAS with that of a previously proposed negotiation scheme. The simulation results show that the SAS is scalable to large number of agents and can perform as good as the negotiation schemes with reduced communication requirement (almost 20% of that required for negotiation).

Low-Complexity Near-ML Decoding of Large Non-Orthogonal STBCs using Reactive Tabu Search

Non-orthogonal space-time block codes (STBC) with large dimensions are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a given number of transmit antennas) as well as full transmit diversity. Decoding of non-orthogonal STBCs with large dimensions has been a challenge. In this paper, we present a reactive tabu search (RTS) based algorithm for decoding non-orthogonal STBCs from cyclic division algebras (CDA) having largedimensions. Under i.i.d fading and perfect channel state information at the receiver (CSIR), our simulation results show that RTS based decoding of 12 X 12 STBC from CDA and 4-QAM with 288 real dimensions achieves i) 10(-3) uncoded BER at an SNR of just 0.5 dB away from SISO AWGN performance, and ii) a coded BER performance close to within about 5 dB of the theoretical MIMO capacity, using rate-3/4 turbo code at a spectral efficiency of 18 bps/Hz. RTS is shown to achieve near SISO AWGN performance with less number of dimensions than with LAS algorithm (which we reported recently) at some extra complexity than LAS. We also report good BER performance of RTS when i.i.d fading and perfect CSIR assumptions are relaxed by considering a spatially correlated MIMO channel model, and by using a training based iterative RTS decoding/channel estimation scheme.

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.

Search for High-Mass e+e- Resonances in pp̅ Collisions at √s=1.96 TeV

A search for high-mass resonances in the $e^+e^-$ final state is presented based on 2.5 fb$^{-1}$ of $\sqrt{s}=$1.96 TeV $p\bar{p}$ collision data from the CDF II detector at the Fermilab Tevatron. The largest excess over the standard model prediction is at an $e^+e^-$ invariant mass of 240 GeV/$c^2$. The probability of observing such an excess arising from fluctuations in the standard model anywhere in the mass range of 150--1,000 GeV/$c^2$ is 0.6% (equivalent to 2.5 $\sigma$). We exclude the standard model coupling $Z'$ and the Randall-Sundrum graviton for $k/\overline{M}_{Pl}=0.1$ with masses below 963 and 848 GeV/$c^2$ at the 95% credibility level, respectively.

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.