Taste symmetry breaking with HYP-smeared staggered fermions

We study the impact of hypercubic (HYP) smearing on the size of taste breaking for staggered fermions, comparing to unimproved and to asqtad-improved staggered fermions. As in previous studies, we find a substantial reduction in taste-breaking compared to unimproved staggered fermions (by a factor of 4-7 on lattices with spacing $a\approx 0.1$fm). In addition, we observe that discretization effects of next-to-leading order in the chiral expansion (${\cal O}(a^2 p^2)$) are markedly reduced by HYP smearing. Compared to asqtad valence fermions, we find that taste-breaking in the pion spectrum is reduced by a factor of 2.5-3, down to a level comparable to the expected size of generic ${\cal O}(a^2)$ effects. Our results suggest that, once one reaches a lattice spacing of $a\approx 0.09$fm, taste-breaking will be small enough after HYP smearing that one can use a modified power counting in which ${\cal O}(a^2) \ll {\cal O}(p^2)$, simplify fitting to phenomenologically interesting quantities.Comment: 14 pages, 13 figures, references updated, minor change

Four-point functions and kaon decays in a minimal AdS/QCD model

We study the predictions of holographic QCD for various observable four-point quark flavour current-current correlators. The dual 5-dimensional bulk theory we consider is a $SU(3)_L \times SU(3)_R$ Yang Mills theory in a slice of $AdS_5$ spacetime with boundaries. Particular UV and IR boundary conditions encode the spontaneous breaking of the dual 4D global chiral symmetry down to the $SU(3)_V$ subgroup. We explain in detail how to calculate the 4D four-point quark flavour current-current correlators using the 5D holographic theory, including interactions. We use these results to investigate predictions of holographic QCD for the $\Delta I = 1/2$ rule for kaon decays and the $B_K$ parameter. The results agree well in comparison with experimental data, with an accuracy of 25% or better. The holographic theory automatically includes the contributions of the meson resonances to the four-point correlators. The correlators agree well in the low-momentum and high-momentum limit, in comparison with chiral perturbation theory and perturbative QCD results, respectively.Comment: Published version, title changed to conform with Journal format, references and clarifying remarks added, 40 pages, 5 figure

High Energy Physics from High Performance Computing

We discuss Quantum Chromodynamics calculations using the lattice regulator. The theory of the strong force is a cornerstone of the Standard Model of particle physics. We present USQCD collaboration results obtained on Argonne National Lab's Intrepid supercomputer that deepen our understanding of these fundamental theories of Nature and provide critical support to frontier particle physics experiments and phenomenology.Comment: Proceedings of invited plenary talk given at SciDAC 2009, San Diego, June 14-18, 2009, on behalf of the USQCD collaboratio

Using Hierarchical Data Mining to Characterize Performance of Wireless System Configurations

This paper presents a statistical framework for assessing wireless systems performance using hierarchical data mining techniques. We consider WCDMA (wideband code division multiple access) systems with two-branch STTD (space time transmit diversity) and 1/2 rate convolutional coding (forward error correction codes). Monte Carlo simulation estimates the bit error probability (BEP) of the system across a wide range of signal-to-noise ratios (SNRs). A performance database of simulation runs is collected over a targeted space of system configurations. This database is then mined to obtain regions of the configuration space that exhibit acceptable average performance. The shape of the mined regions illustrates the joint influence of configuration parameters on system performance. The role of data mining in this application is to provide explainable and statistically valid design conclusions. The research issue is to define statistically meaningful aggregation of data in a manner that permits efficient and effective data mining algorithms. We achieve a good compromise between these goals and help establish the applicability of data mining for characterizing wireless systems performance

EFFECT OF LUMBAR LORDOTIC ANGLE ON LUMBOSACRAL JOINT DURING ISOKINETIC EXCERCISE

The purpose of this study was to to analyze the biomechanical impact of the level of lumbar lordosis angle during isokinetic exercise through dynamic analysis using a 3-dimensional musculoskeletal model. We made each models for normal lordosis, excessive lordosis, lumbar kyphosis, and hypo-lordosis according to lordotic angle and inputted experimental data as initial values to perform inverse dynamic analysis. Comparing the joint torques, the largest torque of EL was 16.6% larger than that of NL, and LK was 11.7% less than NL. There existed no significant difference in the compressive intervertebral forces of each lumbar joint (p>0.05), but statistically significant difference in the anterioposterior shear force (LK>HL>EL>NL,

Distributed Graph Clustering using Modularity and Map Equation

We study large-scale, distributed graph clustering. Given an undirected graph, our objective is to partition the nodes into disjoint sets called clusters. A cluster should contain many internal edges while being sparsely connected to other clusters. In the context of a social network, a cluster could be a group of friends. Modularity and map equation are established formalizations of this internally-dense-externally-sparse principle. We present two versions of a simple distributed algorithm to optimize both measures. They are based on Thrill, a distributed big data processing framework that implements an extended MapReduce model. The algorithms for the two measures, DSLM-Mod and DSLM-Map, differ only slightly. Adapting them for similar quality measures is straight-forward. We conduct an extensive experimental study on real-world graphs and on synthetic benchmark graphs with up to 68 billion edges. Our algorithms are fast while detecting clusterings similar to those detected by other sequential, parallel and distributed clustering algorithms. Compared to the distributed GossipMap algorithm, DSLM-Map needs less memory, is up to an order of magnitude faster and achieves better quality.Comment: 14 pages, 3 figures; v3: Camera ready for Euro-Par 2018, more details, more results; v2: extended experiments to include comparison with competing algorithms, shortened for submission to Euro-Par 201

BSML: A Binding Schema Markup Language for Data Interchange in Problem Solving Environments (PSEs)

We describe a binding schema markup language (BSML) for describing data interchange between scientific codes. Such a facility is an important constituent of scientific problem solving environments (PSEs). BSML is designed to integrate with a PSE or application composition system that views model specification and execution as a problem of managing semistructured data. The data interchange problem is addressed by three techniques for processing semistructured data: validation, binding, and conversion. We present BSML and describe its application to a PSE for wireless communications system design

Stability Of contact discontinuity for steady Euler System in infinite duct

In this paper, we prove structural stability of contact discontinuities for full Euler system