58 research outputs found

    Charmless Two-body Baryonic B Decays

    Full text link
    We study charmless two-body baryonic B decays in a diagramatic approach. Relations on decay amplitudes are obtained. In general there are more than one tree and more than one penguin amplitudes. The number of independent amplitudes can be reduced in the large m_B limit. It leads to more predictive results. Some prominent modes for experimental searches are pointed out.Comment: 15 pages, 2 figures. To appear in Phys. Rev.

    Nonleptonic Weak Decays of Bottom Baryons

    Full text link
    Cabibbo-allowed two-body hadronic weak decays of bottom baryons are analyzed. Contrary to the charmed baryon sector, many channels of bottom baryon decays proceed only through the external or internal W-emission diagrams. Moreover, W-exchange is likely to be suppressed in the bottom baryon sector. Consequently, the factorization approach suffices to describe most of the Cabibbo-allowed bottom baryon decays. We use the nonrelativistic quark model to evaluate heavy-to-heavy and heavy-to-light baryon form factors at zero recoil. When applied to the heavy quark limit, the quark model results do satisfy all the constraints imposed by heavy quark symmetry. The decay rates and up-down asymmetries for bottom baryons decaying into (1/2)++P(V)(1/2)^++P(V) and (3/2)++P(V)(3/2)^++P(V) are calculated. It is found that the up-down asymmetry is negative except for Ωb(1/2)++P(V)\Omega_b \to (1/2)^++P(V) decay and for decay modes with ψ\psi' in the final state. The prediction B(ΛbJ/ψΛ)=1.6×104B(\Lambda_b \to J/\psi\Lambda)=1.6 \times 10^{-4} for Vcb=0.038|V_{cb}|=0.038 is consistent with the recent CDF measurement. We also present estimates for Ωc(3/2)++P(V)\Omega_c \to (3/2)^++P(V) decays and compare with various model calculations.Comment: 24 pages, to appear in Phys. Rev. Uncertainties with form factor q^2 dependence are discusse

    Elastic and inelastic SU(3)-breaking final-state interactions in B decays to pseudoscalar mesons

    Full text link
    We discuss all contributions from Zweig-rule-satisfying SU(3)-breaking final state interactions (FSIs)in the B -> PP decays (neglecting charmed intermediate states), where PP=pi pi, pi K, KK, pi eta (eta'), and K eta (eta'). First, effects of SU(3) breaking in rescattering through Pomeron exchange are studied. Then, after making a plausible assumption concerning the pattern of SU(3) breaking in non-Pomeron FSIs, we give general formulas for how the latter modify short-distance (SD) amplitudes. In the SU(3) limit, these formulas depend on three effective parameters characterizing the strength of all non-Pomeron rescattering effects. We point out that the experimental bounds on the B -> K^+K^- branching ratio may limit the value of only one of these FSI parameters. Thus, the smallness of the B -> K^+K^- decay rate does not imply negligible rescattering effects in other decays. Assuming a vanishing value of this parameter, we perform various fits to the available B -> PP branching ratios. The fits determine the quark-diagram SD amplitudes, the two remaining FSI parameters and the weak angle gamma. While the set of all B -> PP branching ratios is well described with gamma around its expected SM value, the fits permit other values of gamma as well. For a couple of such good fits, we predict asymmetries for the B -> K pi, pi^+ eta (eta'), K^+ eta (eta') decays as well as the values of the CP-violating parameters S_{pi pi} and C_{pi pi} for the time-dependent rate of B^0(t) -> pi^+ pi^-. Apart from a problem with the recent B^+ -> pi^+ eta asymmetry measurement, comparison with the data seems to favour the values of gamma in accordance with SM expectations.Comment: 27 pages, 5 figure

    An Empirical Comparison of Consumer Innovation Adoption Models: Implications for Subsistence Marketplaces

    Get PDF
    So called “pro-poor” innovations may improve consumer wellbeing in subsistence marketplaces. However, there is little research that integrates the area with the vast literature on innovation adoption. Using a questionnaire where respondents were asked to provide their evaluations about a mobile banking innovation, this research fills this gap by providing empirical evidence of the applicability of existing innovation adoption models in subsistence marketplaces. The study was conducted in Bangladesh among a geographically dispersed sample. The data collected allowed an empirical comparison of models in a subsistence context. The research reveals the most useful models in this context to be the Value Based Adoption Model and the Consumer Acceptance of Technology model. In light of these findings and further examination of the model comparison results the research also shows that consumers in subsistence marketplaces are not just motivated by functionality and economic needs. If organizations cannot enhance the hedonic attributes of a pro-poor innovation, and reduce the internal/external constraints related to adoption of that pro-poor innovation, then adoption intention by consumers will be lower

    BOOK REVIEW: "Working with Youth-At-Risk in Hong Kong", Lee, Francis Wing-lin

    No full text

    Multi-Stage Facility Location Problems with Transient Agents

    No full text
    We study various models for the one-dimensional multi-stage facility location problems with transient agents, where a transient agent arrives in some stage and stays for a number of consecutive stages. In the problems, we need to serve each agent in one of their stages by determining the location of the facility at each stage. In the first model, we assume there is no cost for moving the facility across the stages. We focus on optimal algorithms to minimize both the social cost objective, defined as the total distance of all agents to the facility over all stages, and the maximum cost objective, defined as the max distance of any agent to the facility over all stages. For each objective, we give a slice-wise polynomial (XP) algorithm (i.e., solvable in m^f(k) for some fixed parameter k and computable function f, where m is the input size) and show that there is a polynomial-time algorithm when a natural first-come-first-serve (FCFS) order of agent serving is enforced. We then consider the mechanism design problem, where the agents' locations and arrival stages are private, and design a group strategy-proof mechanism that achieves good approximation ratios for both objectives and settings with and without FCFS ordering. In the second model, we consider the facility's moving cost between adjacent stages under the social cost objective, which accounts for the total moving distance of the facility. Correspondingly, we design XP (and polynomial time) algorithms and a group strategy-proof mechanism for settings with or without the FCFS ordering
    corecore