The effects of KSEA interaction on the ground-state properties of spin chains in a transverse field

The effects of symmetric helical interaction which is called the Kaplan, Shekhtman, Entin-Wohlman, and Aharony (KSEA) interaction on the ground-state properties of three kinds of spin chains in a transverse field have been studied by means of correlation functions and chiral order parameter. We find that the anisotropic transition of $XY$ chain in a transverse field ($XY$TF) disappears because of the KSEA interaction. For the other two chains, we find that the regions of gapless chiral phases in the parameter space induced by the DM or $XZY-YZX$ type of three-site interaction are decreased gradually with increase of the strength of KSEA interaction. When it is larger than the coefficient of DM or $XZY-YZX$ type of three-site interaction, the gapless chiral phases also disappear.Comment: 7 pages, 3 figure

Proposed data compression schemes for the Galileo S-band contingency mission

The Galileo spacecraft is currently on its way to Jupiter and its moons. In April 1991, the high gain antenna (HGA) failed to deploy as commanded. In case the current efforts to deploy the HGA fails, communications during the Jupiter encounters will be through one of two low gain antenna (LGA) on an S-band (2.3 GHz) carrier. A lot of effort has been and will be conducted to attempt to open the HGA. Also various options for improving Galileo's telemetry downlink performance are being evaluated in the event that the HGA will not open at Jupiter arrival. Among all viable options the most promising and powerful one is to perform image and non-image data compression in software onboard the spacecraft. This involves in-flight re-programming of the existing flight software of Galileo's Command and Data Subsystem processors and Attitude and Articulation Control System (AACS) processor, which have very limited computational and memory resources. In this article we describe the proposed data compression algorithms and give their respective compression performance. The planned image compression algorithm is a 4 x 4 or an 8 x 8 multiplication-free integer cosine transform (ICT) scheme, which can be viewed as an integer approximation of the popular discrete cosine transform (DCT) scheme. The implementation complexity of the ICT schemes is much lower than the DCT-based schemes, yet the performances of the two algorithms are indistinguishable. The proposed non-image compression algorith is a Lempel-Ziv-Welch (LZW) variant, which is a lossless universal compression algorithm based on a dynamic dictionary lookup table. We developed a simple and efficient hashing function to perform the string search