Constraints on the infrared behavior of the ghost propagator in Yang-Mills theories

We present rigorous upper and lower bounds for the momentum-space ghost propagator G(p) of Yang-Mills theories in terms of the smallest nonzero eigenvalue (and of the corresponding eigenvector) of the Faddeev-Popov matrix. We apply our analysis to data from simulations of SU(2) lattice gauge theory in Landau gauge, using the largest lattice sizes to date. Our results suggest that, in three and in four space-time dimensions, the Landau gauge ghost propagator is not enhanced as compared to its tree-level behavior. This is also seen in plots and fits of the ghost dressing function. In the two-dimensional case, on the other hand, we find that G(p) diverges as p(-2-2 kappa) with kappa approximate to 0.15, in agreement with A. Maas, Phys. Rev. D 75, 116004 (2007). We note that our discussion is general, although we make an application only to pure gauge theory in Landau gauge. Our simulations have been performed on the IBM supercomputer at the University of Sao Paulo.

Constraints on the infrared behavior of the gluon propagator in Yang-Mills theories

We present rigorous upper and lower bounds for the zero-momentum gluon propagator D(0) of Yang-Mills theories in terms of the average value of the gluon field. This allows us to perform a controlled extrapolation of lattice data to infinite volume, showing that the infrared limit of the Landau-gauge gluon propagator in SU(2) gauge theory is finite and nonzero in three and in four space-time dimensions. In the two-dimensional case, we find D(0)=0, in agreement with Maas. We suggest an explanation for these results. We note that our discussion is general, although we apply our analysis only to pure gauge theory in the Landau gauge. Simulations have been performed on the IBM supercomputer at the University of Sao Paulo.

Resistance Training with Vascular Occlusion in Inclusion Body Myositis: A Case Study

GUALANO, B., M. NEVES JR, F. R. LIMA, A. L. PINTO, G. LAURENTINO, C. BORGES, L. BAPTISTA, G. G. ARTIOLI, M. S. AOKI, A. MORISCOT, A. H. LANCHA JR, E. BONFA, and C. UGRINOWITSCH. Resistance Training with Vascular Occlusion in Inclusion Body Myositis: A Case Study. Med Sci. Spot-is Exerc., Vol. 42, No. 2, pp. 250-254, 2010. Inclusion body myositis (IBM) is a rare idiopathic inflammatory myopathy that produces remarkable muscle weakness. Resistance training with vascular occlusion has been shown to improve muscle strength and cross-sectional area in other muscle wasting conditions. Purpose: We evaluated the efficacy of a moderate-intensity resistance training program combined with vascular occlusion by examining functional capacity, muscle morphology, and changes in the expression of genes related to muscle protein synthesis and proteolysis in a patient with IBM. Methods: A 65-yr-old man with IBM resistant to all proposed treatments underwent resistance training with vascular occlusion for 12 wk. Leg press one-repetition maximum; thigh cross-sectional area; balance, mobility, and muscle function; quality of life; and blood markers of inflammation and muscle damage were assessed at baseline and after the 12-wk program. The messenger RNA (mRNA) expression levels of mechanogrowth factor, mammalian target of rapamycin, atrogin-1, and muscle RING finger-1 were also quantified. Results: After the 12-wk training program, the patient`s leg press one-repetition maximum, balance and mobility function, and thigh cross-sectional area increased 15.9%, 60%, and 4.7%, respectively. All Short Form-36 Health Survey Questionnaire subscales demonstrated improvements as well, varying from 18% to 600%. mRNA expression of mechanogrowth factor increased 3.97-fold, whereas that of atrogin-1 decreased 0.62-fold. Muscle RING finger-1 and mammalian target of rapamycin mRNA levels were only slightly altered, 1.18- and 1.28-fold, respectively. Importantly, the exercise did not induce disease flare. Conclusions: We describe a novel, and likely the first, nonpharmacological therapeutic tool that might be able to counteract the muscle atrophy and the declining strength that usually occur in IBM.

Template-based quadrilateral meshing

Generating quadrilateral meshes is a highly non-trivial task, as design decisions are frequently driven by specific application demands. Automatic techniques can optimize objective quality metrics, such as mesh regularity, orthogonality, alignment and adaptivity; however, they cannot make subjective design decisions. There are a few quad meshing approaches that offer some mechanisms to include the user in the mesh generation process; however, these techniques either require a large amount of user interaction or do not provide necessary or easy to use inputs. Here, we propose a template-based approach for generating quad-only meshes from triangle surfaces. Our approach offers a flexible mechanism to allow external input, through the definition of alignment features that are respected during the mesh generation process. While allowing user inputs to support subjective design decisions, our approach also takes into account objective quality metrics to produce semi-regular, quad-only meshes that align well to desired surface features. Published by Elsevier Ltd.

PedVis: A Structured, Space-Efficient Technique for Pedigree Visualization

Public genealogical databases are becoming increasingly populated with historical data and records of the current population`s ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree`s structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user`s ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout.

Two-Phase Mapping for Projecting Massive Data Sets

Most multidimensional projection techniques rely on distance (dissimilarity) information between data instances to embed high-dimensional data into a visual space. When data are endowed with Cartesian coordinates, an extra computational effort is necessary to compute the needed distances, making multidimensional projection prohibitive in applications dealing with interactivity and massive data. The novel multidimensional projection technique proposed in this work, called Part-Linear Multidimensional Projection (PLMP), has been tailored to handle multivariate data represented in Cartesian high-dimensional spaces, requiring only distance information between pairs of representative samples. This characteristic renders PLMP faster than previous methods when processing large data sets while still being competitive in terms of precision. Moreover, knowing the range of variation for data instances in the high-dimensional space, we can make PLMP a truly streaming data projection technique, a trait absent in previous methods.

Interactive Vector Field Feature Identification

We introduce a flexible technique for interactive exploration of vector field data through classification derived from user-specified feature templates. Our method is founded on the observation that, while similar features within the vector field may be spatially disparate, they share similar neighborhood characteristics. Users generate feature-based visualizations by interactively highlighting well-accepted and domain specific representative feature points. Feature exploration begins with the computation of attributes that describe the neighborhood of each sample within the input vector field. Compilation of these attributes forms a representation of the vector field samples in the attribute space. We project the attribute points onto the canonical 2D plane to enable interactive exploration of the vector field using a painting interface. The projection encodes the similarities between vector field points within the distances computed between their associated attribute points. The proposed method is performed at interactive rates for enhanced user experience and is completely flexible as showcased by the simultaneous identification of diverse feature types.