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.

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.

Scalable non-linear Support Vector Machine using hierarchical clustering

This paper discusses a method for scaling SVM with Gaussian kernel function to handle large data sets by using a selective sampling strategy for the training set. It employs a scalable hierarchical clustering algorithm to construct cluster indexing structures of the training data in the kernel induced feature space. These are then used for selective sampling of the training data for SVM to impart scalability to the training process. Empirical studies made on real world data sets show that the proposed strategy performs well on large data sets.

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).

Memory-based reasoning approach for pattern recognition of binary images

Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a memory-based reasoning approach for pattern recognition of binary images with a large template set. It seems that memory-based reasoning intrinsically requires a large database. Moreover, some binary image recognition problems inherently need large template sets, such as the recognition of Chinese characters which needs thousands of templates. The proposed algorithm is based on the Connection Machine, which is the most massively parallel machine to date, using a multiresolution method to search for the matching template. The approach uses the pyramid data structure for the multiresolution representation of templates and the input image pattern. For a given binary image it scans the template pyramid searching the match. A binary image of N × N pixels can be matched in O(log N) time complexity by our algorithm and is independent of the number of templates. Implementation of the proposed scheme is described in detail.

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.

Evil Gods and Reckless Saviours : Adaptation and Appropriation in Late Twentieth Century Jesus-Novels

Late twentieth century Jesus-novels search after a completely new picture of Jesus. Novels written for instance by Norman Mailer, José Saramago, Michèle Roberts, Marianne Fredriksson, and Ki Longfellow provide an inversive revision of the canonic Gospels. They read the New Testament in terms of the present age. In their adaptation the story turns often into a critique of the whole Christian history. The investigated contrast-novels end up with an appropriation that is based on prototypical rewriting. They aim at the rehabilitation of Judas, and some of them make Mary Magdalane the key figure of Christianity. Saramago describes God as a blood thirsty tyrant, and Mailer makes God combat with the Devil in a manichean sense as with an equal. Such ideas are familiar both from poststructuralist philosophy and post-metaphysical death-of-God theology. The main result of the intertextual analysis is that these scholars have adopted Nietzschean ideas in their writing. Quite unlike earlier Jesus-novels, these more recent novels present a revision that produces discontinuity with the original source text, the New Testament. The intertextual strategy is based on contradiction. The reader wittnesses contesting and challenging, the authors attack Biblical beliefs and attempt to dissolve Christian doctrines. An attack on Biblical slave morality and violent concept of God deprives Jesus of his Jewish Messianic identity, makes Old Testament law a contradiction of life, calls sacrificial soteriology a violent pattern supporting oppression, and presents God as a cruel monster who enslaves people under his commandments and wishes their death. The new Jesus-figure contests Mosaic Law, despises orthodox Judaism, abandons Jewish customs and even questions Old Testament monotheism. In result, the novels intentionally transfer Jesus out of Judaism. Furthermore, Jewish faith appears in a negative light. Such an intertextual move is not open anti-Semitism but it cannot avoid attacking Jewish worship. Why? One reason that explains these attitudes is that Western culture still carries anti-Judaic attitudes beneath the surface covered with sentiments of equality and tolerance. Despite the evident post-holocaust consciousness present in the novels, they actually adopt an arrogant and ironical refutation of Jewish beliefs and Old Testament faith. In these novels, Jesus is made a complete opposite and antithesis to Judaism. Key words: Jesus-novel, intertextuality, adaptation, slave morality, Nietzsche, theodicy, patriarchy.