Combined large-N_c and heavy-quark operator analysis for the chiral Lagrangian with charmed baryons

The chiral $SU(3)$ Lagrangian with charmed baryons of spin $J^P=1/2^+$ and $J^P=3/2^+$ is analyzed. We consider all counter terms that are relevant at next-to-next-to-next-to-leading order (N$^3$LO) in a chiral extrapolation of the charmed baryon masses. At N$^2$LO we find 16 low-energy parameters. There are 3 mass parameters for the anti-triplet and the two sextet baryons, 6 parameters describing the meson-baryon vertices and 7 symmetry breaking parameters. The heavy-quark spin symmetry predicts four sum rules for the meson-baryon vertices and degenerate masses for the two baryon sextet fields. Here a large-$N_c$ operator analysis at NLO suggests the relevance of one further spin-symmetry breaking parameter. Going from N$^2$LO to N$^3$LO adds 17 chiral symmetry breaking parameters and 24 symmetry preserving parameters. For the leading symmetry conserving two-body counter terms involving two baryon fields and two Goldstone boson fields we find 36 terms. While the heavy-quark spin symmetry leads to $36-16=20$ sum rules, an expansion in $1/N_c$ at next-to-leading order (NLO) generates $36-7= 29$ parameter relations. A combined expansion leaves 3 unknown parameters only. For the symmetry breaking counter terms we find 17 terms, for which there are $17-9=8$ sum rules from the heavy-quark spin symmetry and $17-5=12$ sum rules from a $1/N_c$ expansion at NLO.Comment: 34 pages - one table - corrections applie

Palgol: A High-Level DSL for Vertex-Centric Graph Processing with Remote Data Access

Pregel is a popular distributed computing model for dealing with large-scale graphs. However, it can be tricky to implement graph algorithms correctly and efficiently in Pregel's vertex-centric model, especially when the algorithm has multiple computation stages, complicated data dependencies, or even communication over dynamic internal data structures. Some domain-specific languages (DSLs) have been proposed to provide more intuitive ways to implement graph algorithms, but due to the lack of support for remote access --- reading or writing attributes of other vertices through references --- they cannot handle the above mentioned dynamic communication, causing a class of Pregel algorithms with fast convergence impossible to implement. To address this problem, we design and implement Palgol, a more declarative and powerful DSL which supports remote access. In particular, programmers can use a more declarative syntax called chain access to naturally specify dynamic communication as if directly reading data on arbitrary remote vertices. By analyzing the logic patterns of chain access, we provide a novel algorithm for compiling Palgol programs to efficient Pregel code. We demonstrate the power of Palgol by using it to implement several practical Pregel algorithms, and the evaluation result shows that the efficiency of Palgol is comparable with that of hand-written code.Comment: 12 pages, 10 figures, extended version of APLAS 2017 pape

Multipartite entanglement in four-qubit cluster-class states

Based on quantitative complementarity relations (QCRs), we analyze the multipartite correlations in four-qubit cluster-class states. It is proven analytically that the average multipartite correlation $E_{ms}$ is entanglement monotone. Moreover, it is also shown that the mixed three-tangle is a correlation measure compatible with the QCRs in this kind of quantum states. More arrestingly, with the aid of the QCRs, a set of hierarchy entanglement measures is obtained rigorously in the present system.Comment: 7 pages, 3 figs, version 3, some refs. are adde

6 Batch Injection and Slipped Beam Tune Measurements in Fermilab's Main Injector

During Nova operations it is planned to run the Fermilab Recycler in a 12 batch slip stacking mode. In preparation for this, measurements of the tune during a six batch injection and then as the beam is slipped by changing the RF frequency, but without a 7th injection, have been carried out in the Main Injector. The coherent tune shifts due to the changing beam intensity were measured and compared well with the theoretically expected tune shift. The tune shifts due to changing RF frequency, required for slip stacking, also compare well with the linear theory, although some nonlinear affects are apparent at large frequency changes. These results give us confidence that the expected tunes shifts during 12 batch slip stacking Recycler operations can be accommodated.Comment: 3 pp. 3rd International Particle Accelerator Conference (IPAC 2012) 20-25 May 2012, New Orleans, Louisian

Bayesian model comparison for compartmental models with applications in positron emission tomography

We develop strategies for Bayesian modelling as well as model comparison, averaging and selection for compartmental models with particular emphasis on those that occur in the analysis of positron emission tomography (PET) data. Both modelling and computational issues are considered. Biophysically inspired informative priors are developed for the problem at hand, and by comparison with default vague priors it is shown that the proposed modelling is not overly sensitive to prior specification. It is also shown that an additive normal error structure does not describe measured PET data well, despite being very widely used, and that within a simple Bayesian framework simultaneous parameter estimation and model comparison can be performed with a more general noise model. The proposed approach is compared with standard techniques using both simulated and real data. In addition to good, robust estimation performance, the proposed technique provides, automatically, a characterisation of the uncertainty in the resulting estimates which can be considerable in applications such as PET