Engineering Papers⌕ Search

Engineering topics

Li, X M

Publications and source records attributed to Li, X M.

Transverse spin structure of the nucleon through target single-spin asymmetry in semi-inclusive deep-inelastic (e, e’ $ \pi^{\pm}_{}$ ) reaction at Jefferson Lab

Jefferson Lab (JLab) 12 GeV energy upgrade provides a golden opportunity to perform precision studies of the transverse spin and transverse-momentum-dependent structure in the valence quark region for both the proton and the neutron. In this paper, we focus our discussion on a recently approved experiment on the neutron as an example of the precision studies planned at JLab. The new experiment will perform precision measurements of target Single Spin Asymmetries (SSA) from semi-inclusive electro-production of charged pions from a 40-cm long transversely polarized 3 He target in Deep-Inelastic-Scattering kinematics using 11 and 8.8 GeV electron beams. This new coincidence experiment in Hall A will employ a newly proposed solenoid spectrometer (SoLID). The large acceptance spectrometer and the high polarized luminosity will provide precise 4-D (x, z, P T ​ and Q 2 ) data on the Collins, Sivers, and pretzelocity asymmetries for the neutron through the azimuthal angular dependence. The full 2ππ azimuthal angular coverage in the lab is essential in controlling the systematic uncertainties. The results from this experiment, when combined with the proton Collins asymmetry measurement and the Collins fragmentation function determined from the e + e − collision data, will allow for a quark flavor separation in order to achieve a determination of the tensor charge of the d quark to a 10% accuracy. As a result, the extracted Sivers and pretzelocity asymmetries will provide important information to understand the correlations between the quark orbital angular momentum and the nucleon spin and between the quark spin and nucleon spin.

Parton Distribution Function↗

Geometry-Based Edge Clustering for Graph Visualization

Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings will make the display visually cluttered and thus difficult to explore. In this paper, we propose a novel geometry-based edge-clustering framework which can group edges into bundles to reduce the overall edge crossings. Our method uses a control mesh to guide the edge-clustering process; edge bundles can be formed by forcing all edges to pass through some control points on the mesh. The control mesh can be generated at different levels of detail either manually or automatically based on underlying graph patterns. Users can further interact with the edge-clustering results through several advanced visualization techniques such as color and opacity enhancement. Compared with other edge-clustering methods, our approach is intuitive, flexible, and efficient. The experiments on some large graphs demonstrate the effectiveness of our method.

97 MATHEMATICS AND COMPUTING↗