Indian Institute of Technology Bombay

About: Indian Institute of Technology Bombay is a education organization based out in Mumbai, India. It is known for research contribution in the topics: Catalysis & Computer science. The organization has 16756 authors who have published 33588 publications receiving 570559 citations.

Identified baryon and meson distributions at large transverse momenta from Au plus Au collisions at root(S)(NN)=200 GeV

Abstract: Transverse momentum spectra of pi(+/-), p, and (p) over bar p up to 12 GeV/c at midrapidity in centrality selected Au + Au collisions at root s(NN) = 200 GeV are presented. In central Au + Au collisions, both pi(+/-) and p((p) over bar) show significant suppression with respect to binary scaling at p(T) greater than or similar to 4 GeV/c. Protons and antiprotons are less suppressed than pi(+/-), in the range 1.5 less than or similar to p(T) less than or similar to 6 GeV/c. The pi(-)/pi(+) and (p) over bar /p ratios show at most a weak pT dependence and no significant centrality dependence. The p/pi ratios in central Au + Au collisions approach the values in p + p and d + Au collisions at p(T) greater than or similar to 5 GeV/c. The results at high p(T) indicate that the partonic sources of pi(+/-), p, and (p) over bar have similar energy loss when traversing the nuclear medium

Minimization of tree pattern queries

Abstract: Tree patterns forms a natural basis to query tree-structured data such as XML and LDAP. Since the efficiency of tree pattern matching against a tree-structured database depends on the size of the pattern, it is essential to identify and eliminate redundant nodes in the pattern and do so as quickly as possible. In this paper, we study tree pattern minimization both in the absence and in the presence of integrity constraints (ICs) on the underlying tree-structured database.When no ICs are considered, we call the process of minimizing a tree pattern, constraint-independent minimization. We develop a polynomial time algorithm called CIM for this purpose. CIM's efficiency stems from two key properties: (i) a node cannot be redundant unless its children are, and (ii) the order of elimination of redundant nodes is immaterial. When ICs are considered for minimization, we refer to it as constraint-dependent minimization. For tree-structured databases, required child/descendant and type co-occurrence ICs are very natural. Under such ICs, we show that the minimal equivalent query is unique. We show the surprising result that the algorithm obtained by first augmenting the tree pattern using ICS, and then applying CIM, always finds the unique minimal equivalent query; we refer to this algorithm as ACIM. While ACIM is also polynomial time, it can be expensive in practice because of its inherent non-locality. We then present a fast algorithm, CDM, that identifies and eliminates local redundancies due to ICs, based on propagating “information labels” up the tree pattern. CDM can be applied prior to ACIM for improving the minimization efficiency. We complement our analytical results with an experimental study that shows the effectiveness of our tree pattern minimization techniques.

Decarboxylation as the Key Step in C−C Bond‐Forming Reactions

Abstract: C−C bond forming reactions incarnate the core of organic synthesis because of their fundamental applications to molecular diversity and complexity. In recent years, use of carboxylic acid as one of the coupling partners in place of conventional organometallic reagents has seen an upsurge due to its potency to generate similar organometallic intermediates after decarboxylation. This Review provides an overview on the most recent progress in the field of C−C bond formation involving decarboxylation as a key step. Different important developments, which are not included in earlier Reviews in this area, have been summarized with representative examples and discussions on their reaction mechanisms.