Hadronic Decays Involving Heavy Pentaquarks

Recently several experiments have reported evidences for pentaquark $\Theta^+$. H1 experiment at HERA-B has also reported evidence for $\Theta_c$. $\Theta^+$ is interpreted as a bound state of an $\bar s$ with other four light quarks $udud$ which is a member of the anti-decuplet under flavor $SU(3)_f$. While $\Theta_c$ is a state by replacing the $\bar s$ in $\Theta^+$ by a $\bar c$. One can also form $\Theta_b$ by replacing the $\bar s$ by a $\bar b$. The charmed and bottomed heavy pentaquarks form triplets and anti-sixtets under $SU(3)_f$. We study decay processes involving at least one heavy pentaquark using $SU(3)_f$ and estimate the decay widths for some decay modes. We find several relations for heavy pentaquarks decay into another heavy pentaquark and a $B (B^*)$ or a $D(D^*)$ which can be tested in the future. $B$ can decay through weak interaction to charmed heavy pentaquarks. We also study some $B$ decay modes with a heavy pebtaquark in the final states. Experiments at the current $B$ factories can provide important information about the heavy pentaquark properties.Comment: RevTex 20 pages. Revised version. Discussions on the recent H1 data and new references adde

Monetary Policy and Exchange Rate Regime: Proposal for a Small and Less Developed Economy

We investigate monetary policy under the assumption that a country’s capital market is “open” under the WTO framework while the exchange rate is fixed. Our purpose is to determine if it is possible in this case for the economy to maintain an effective monetary policy for stabilizing the domestic economy. For this, we suggest two institutional restrictions. Given the restrictions, we demonstrate within a macro-dynamic model that monetary policy can still be effective. The implication of such an institutional design for an exchange rate regime is also discussed with special reference to small and less development economies.open economy trilemma; macroeconomic stability; exchange rate regime

Iterative Object and Part Transfer for Fine-Grained Recognition

The aim of fine-grained recognition is to identify sub-ordinate categories in images like different species of birds. Existing works have confirmed that, in order to capture the subtle differences across the categories, automatic localization of objects and parts is critical. Most approaches for object and part localization relied on the bottom-up pipeline, where thousands of region proposals are generated and then filtered by pre-trained object/part models. This is computationally expensive and not scalable once the number of objects/parts becomes large. In this paper, we propose a nonparametric data-driven method for object and part localization. Given an unlabeled test image, our approach transfers annotations from a few similar images retrieved in the training set. In particular, we propose an iterative transfer strategy that gradually refine the predicted bounding boxes. Based on the located objects and parts, deep convolutional features are extracted for recognition. We evaluate our approach on the widely-used CUB200-2011 dataset and a new and large dataset called Birdsnap. On both datasets, we achieve better results than many state-of-the-art approaches, including a few using oracle (manually annotated) bounding boxes in the test images.Comment: To appear in ICME 2017 as an oral pape

A note on the double Roman domination number of graphs

summary:For a graph $G=(V,E)$, a double Roman dominating function is a function $f\colon V\rightarrow \{0,1,2,3\}$ having the property that if $f(v)=0$, then the vertex $v$ must have at least two neighbors assigned $2$ under $f$ or one neighbor with $f(w)=3$, and if $f(v)=1$, then the vertex $v$ must have at least one neighbor with $f(w)\geq 2$. The weight of a double Roman dominating function $f$ is the sum $f(V)=\sum \nolimits _{v\in V}f(v)$. The minimum weight of a double Roman dominating function on $G$ is called the double Roman domination number of $G$ and is denoted by $\gamma _{\rm dR}(G)$. In this paper, we establish a new upper bound on the double Roman domination number of graphs. We prove that every connected graph $G$ with minimum degree at least two and $G\neq C_{5}$ satisfies the inequality $\gamma _{\rm dR}(G)\leq \lfloor \frac {13}{11}n\rfloor$. One open question posed by R. A. Beeler et al. has been settled