Biblio

Traditional magnetic mirrors are appealing because of their comparably simple geometry which lends itself to cost-effective construction. However, magnetic mirrors suffer from several inherent problems that make them poor choices for confining and heating plasmas. The chief concerns are the loss-cone instability which continuously saps hot particles from the trap and the interchange instability which effectively transports hot plasma from the core of the trap to the edges where it is lost to the walls. Centrifugal confinement schemes address these concerns with the addition of supersonic poloidal rotation which can effectively shut off the loss-cone. In addition, velocity shear in the flow may mitigate or even turn off the interchange instability if high enough rotation speeds can be achieved. Previous experiments have verified the efficacy of centrifugal confinement but have been unable to achieve sufficient rotation velocities to entirely shut down the interchange modes. [1] The rotation velocity in these experiments was limited by the Critical-Ionization-Velocity (CIV) instability. [3] We plan an experiment to verify that the CIV is the limiting factor in supersonic plasma centrifuges and to explore strategies for avoiding the CIV limit and achieving sufficient rotation speeds to enable stable plasma confinement.

In recent years, binary coding techniques are becoming increasingly popular because of their high efficiency in handling large-scale computer vision applications. It has been demonstrated that supervised binary coding techniques that leverage supervised information can significantly enhance the coding quality, and hence greatly benefit visual search tasks. Typically, a modern binary coding method seeks to learn a group of coding functions which compress data samples into binary codes. However, few methods pursued the coding functions such that the precision at the top of a ranking list according to Hamming distances of the generated binary codes is optimized. In this paper, we propose a novel supervised binary coding approach, namely Top Rank Supervised Binary Coding (Top-RSBC), which explicitly focuses on optimizing the precision of top positions in a Hamming-distance ranking list towards preserving the supervision information. The core idea is to train the disciplined coding functions, by which the mistakes at the top of a Hamming-distance ranking list are penalized more than those at the bottom. To solve such coding functions, we relax the original discrete optimization objective with a continuous surrogate, and derive a stochastic gradient descent to optimize the surrogate objective. To further reduce the training time cost, we also design an online learning algorithm to optimize the surrogate objective more efficiently. Empirical studies based upon three benchmark image datasets demonstrate that the proposed binary coding approach achieves superior image search accuracy over the state-of-the-arts.