Search results for "branch"
showing 10 items of 1278 documents
An algorithm for the solution of tree equations
1997
We consider the problem of solving equations over k-ary trees. Here an equation is a pair of labeled α-ary trees, where α is a function associating an arity to each label. A solution to an equation is a morphism from α-ary trees to k-ary trees that maps the left and right hand side of the equation to the same k-ary tree.
Measurement of Branching Fractions and Charge Asymmetries inB±→ρ±π0andB±→ρ0π±Decays, and Search forB0→ρ0π0
2004
We present measurements of branching fractions and charge asymmetries in $B$-meson decays to ${\ensuremath{\rho}}^{+}{\ensuremath{\pi}}^{0}$, ${\ensuremath{\rho}}^{0}{\ensuremath{\pi}}^{+}$, and ${\ensuremath{\rho}}^{0}{\ensuremath{\pi}}^{0}$. The data sample comprises $89\ifmmode\times\else\texttimes\fi{}{10}^{6}$ $\ensuremath{\Upsilon}(4S)\ensuremath{\rightarrow}B\overline{B}$ decays collected with the BABAR detector at the PEP-II asymmetric-energy $B$ Factory at SLAC. We find the charge-averaged branching fractions $\mathcal{B}({B}^{+}\ensuremath{\rightarrow}{\ensuremath{\rho}}^{+}{\ensuremath{\pi}}^{0})=[10.9\ifmmode\pm\else\textpm\fi{}1.9\mathrm{(}\mathrm{s}\mathrm{t}\mathrm{a}\mathrm{…
Measurement of the branching fraction forB±→χc0K±
2004
We present a measurement of the branching fraction of the decay ${B}^{\ifmmode\pm\else\textpm\fi{}}\ensuremath{\rightarrow}{\ensuremath{\chi}}_{c0}{K}^{\ifmmode\pm\else\textpm\fi{}}$ from a sample of $89\ifmmode\times\else\texttimes\fi{}{10}^{6}$ $B\overline{B}$ pairs collected by the BABAR detector at the SLAC PEP-II asymmetric-energy B factory. The ${\ensuremath{\chi}}_{c0}$ meson is reconstructed through its two-body decays to ${\ensuremath{\pi}}^{+}{\ensuremath{\pi}}^{\ensuremath{-}}$ and ${K}^{+}{K}^{\ensuremath{-}}.$ We measure $\mathcal{B}{(B}^{\ifmmode\pm\else\textpm\fi{}}\stackrel{\ensuremath{\rightarrow}}{}{\ensuremath{\chi}}_{c0}{K}^{\ifmmode\pm\else\textpm\fi{}})\ifmmode\times\e…
Evidence forB+→J/ψpΛ¯and Search forB0→J/ψpp¯
2003
We have performed a search for the decays ${B}^{+}\ensuremath{\rightarrow}J/\ensuremath{\psi}p\overline{\ensuremath{\Lambda}}$ and ${B}^{0}\ensuremath{\rightarrow}J/\ensuremath{\psi}p\overline{p}$ in a data set of $(88.9\ifmmode\pm\else\textpm\fi{}1.0)\ifmmode\times\else\texttimes\fi{}{10}^{6}$ $\ensuremath{\Upsilon}(4S)$ decays collected by the BABAR experiment at the PEP-II ${e}^{+}{e}^{\ensuremath{-}}$ storage ring at the Stanford Linear Accelerator Center. Four charged $B$ candidates have been observed with an expected background of $0.21\ifmmode\pm\else\textpm\fi{}0.14$ events. The corresponding branching fraction is $({12}_{\ensuremath{-}6}^{+9})\ifmmode\times\else\texttimes\fi{}{10}^…
A note on coverings with special fibres and monodromy group $ S_{d}$
2012
We consider branched coverings of degree over with monodromy group , points of simple branching, special points and fixed branching data at the special points, where is a smooth connected complex projective curve of genus , and , are integers with . We prove that the corresponding Hurwitz spaces are irreducible if .
An algorithm for the Rural Postman problem on a directed graph
1986
The Directed Rural Postman Problem (DRPP) is a general case of the Chinese Postman Problem where a subset of the set of arcs of a given directed graph is ‘required’ to be traversed at minimum cost. If this subset does not form a weakly connected graph but forms a number of disconnected components the problem is NP-Complete, and is also a generalization of the asymmetric Travelling Salesman Problem. In this paper we present a branch and bound algorithm for the exact solution of the DRPP based on bounds computed from Lagrangean Relaxation (with shortest spanning arborescence sub-problems) and on the fathoming of some of the tree nodes by the solution of minimum cost flow problems. Computation…
MINDO/3 Study of the Rearrangement of 1-Methylcyclohexyl Cation to 1,2-Dimethylcyclopentyl Cation
1986
The rearrangement of the 1-methylcyclohexyl cation to the 1,2-dimethylcyclopentyl cation has been studied by MINDO/3 calculations, as an application of the branching mechanism model for cycloalkanes. Possible intermediates and transition states have been characterized by diagonalization of their Hessian matrixes. Two nonequivalent pathways, α and β scissions, are relatively close in energy. The calculated transition states are almost equivalent in energy to those found for cyclohexyl cation. Hence, the energy barriers are higher for the rearrangement of the 1-methyl than for cyclohexyl cation, because the former is less stable than the latter.
Domain-Knowledge Optimized Simulated Annealing for Network-on-Chip Application Mapping
2013
Network-on-Chip architectures are scalable on-chip interconnection networks. They replace the inefficient shared buses and are suitable for multicore and manycore systems. This paper presents an Optimized Simulated Annealing (OSA) algorithm for the Network-on-Chip application mapping problem. With OSA, the cores are implicitly and dynamically clustered using knowledge about communication demands. We show that OSA is a more feasible Simulated Annealing approach to NoC application mapping by comparing it with a general Simulated Annealing algorithm and a Branch and Bound algorithm, too. Using real applications we show that OSA is significantly faster than a general Simulated Annealing, withou…
A Fast Algorithm Finding the Shortest Reset Words
2013
In this paper we present a new fast algorithm for finding minimal reset words for finite synchronizing automata, which is a problem appearing in many practical applications. The problem is known to be computationally hard, so our algorithm is exponential in the worst case, but it is faster than the algorithms used so far and it performs well on average. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare subsets. Also a number of heuristics are applied. We give both theoretical and practical arguments showing that the effective branching factor is considerably reduced. As a practical test we perform an experimental study of the length of the shortest …
Long-Chain Branched Poly(Lactide)s Based on Polycondensation of AB2 -type Macromonomers
2012
A series of long-chain branched poly(d-/l-lactide)s is synthesized in a two-step protocol by (1) ring-opening polymerization of lactide and (2) subsequent condensation of the preformed AB2 macromonomers promoted by different coupling reagents. The linear AB2 macromonomers are prepared by Sn(Oct)2-catalyzed ROP of D- and L-lactide with 2,2-bis(hydroxymethyl)butyric acid (BHB) as an initiator. Optimization of the polymerization conditions allows for the preparation of well-defined macromonomers (Mw/Mn = 1.09–1.30) with adjustable molecular weights (760–7200 g mol−1). The two-step approach of the synthesis comprises as well the coupling of these AB2 macromonomers and hence allows precise contr…