Statefinder Parameters for Five-Dimensional Cosmology

We study the statefinder parameter in the five-dimensional big bounce model, and apply it to differentiate the attractor solutions of quintessence and phantom field. It is found that the evolving trajectories of these two attractor solutions in the statefinder parameters plane are quite different, and that are different from the statefinder trajectories of other dark energy models.Comment: 8 pages, 12 figures. accepted by MPL

Single-Shot Visualization Of Evolving Laser- Or Beam-Driven Plasma Wakefield Accelerators

We introduce Frequency-Domain Tomography (FDT) for visualizing sub-ps evolution of light-speed refractive index structures in a single shot. As a prototype demonstration, we produce single-shot tomographic movies of self-focusing, filamenting laser pulses propagating in a transparent Kerr medium. We then discuss how to adapt FDT to visualize evolving laser-or beam-driven plasma wakefields of current interest to the advanced accelerator community. For short (L similar to 1 cm), dense (n(e) similar to 10(19) cm(-3)) plasmas, the key challenge is broadening probe bandwidth sufficiently to resolve plasma-wavelength-size structures. For long (L similar to 10 to 100 cm), tenuous (n(e) similar to 10(17) cm(-3)) plasmas, probe diffraction from the evolving wake becomes the key challenge. We propose and analyze solutions to these challenges.Physic

Interpretable and Generalizable Person Re-Identification with Query-Adaptive Convolution and Temporal Lifting

For person re-identification, existing deep networks often focus on representation learning. However, without transfer learning, the learned model is fixed as is, which is not adaptable for handling various unseen scenarios. In this paper, beyond representation learning, we consider how to formulate person image matching directly in deep feature maps. We treat image matching as finding local correspondences in feature maps, and construct query-adaptive convolution kernels on the fly to achieve local matching. In this way, the matching process and results are interpretable, and this explicit matching is more generalizable than representation features to unseen scenarios, such as unknown misalignments, pose or viewpoint changes. To facilitate end-to-end training of this architecture, we further build a class memory module to cache feature maps of the most recent samples of each class, so as to compute image matching losses for metric learning. Through direct cross-dataset evaluation, the proposed Query-Adaptive Convolution (QAConv) method gains large improvements over popular learning methods (about 10%+ mAP), and achieves comparable results to many transfer learning methods. Besides, a model-free temporal cooccurrence based score weighting method called TLift is proposed, which improves the performance to a further extent, achieving state-of-the-art results in cross-dataset person re-identification. Code is available at https://github.com/ShengcaiLiao/QAConv.Comment: This is the ECCV 2020 version, including the appendi