Search

The High Energy Photon Source (HEPS), is the first fourth-generation storage ring light source being built in the suburb of Beijing, China. The storage ring was designed with the emittance lower than 60 pm.rad with a circumference of 1.36 km and beam energy of 6 GeV. Its injector contains a 500 MeV S-band Linac and a 454 m booster which was designed as an accumulator at the extraction energy. In the energy ramping control design of HEPS booster, the ramping process was programed to be able to stop and stay at any energy between the injection energy and the extraction energy. This feature enables us to conduct energy-dependent machine studies and ramping curve optimization. The beam commissioning of HEPS Linac finished in June, 2023. And the beam commissioning of booster started in the end of July, 2023. In November 17, main target values proposed in the preliminary design report has been reached. The high-level applications (HLAs) are essential tools for beam commissioning. The development of HLAs, which are based on the framework named Python accelerator physics application set (Pyapas), started in the end of 2021. The HEPS physics team spent more than one year to develop and test the HLAs to meet the requirements of beam commissioning of the booster. Thanks to the modular design, the principle based on physical quantities, and the ability of running simulation models online from the Pyapas, the development efficiency and reliability of the HLAs have been greatly improved. In particular, the principle based on physical quantities allows us to control the beam more intuitively.

The widespread use of face retouching filters on short-video platforms has raised concerns about the authenticity of digital appearances and the impact of deceptive advertising. To address these issues, there is a pressing need to develop advanced face retouching techniques. However, the lack of large-scale and fine-grained face retouching datasets has been a major obstacle to progress in this field. In this paper, we introduce RetouchingFFHQ, a large-scale and fine-grained face retouching dataset that contains over half a million conditionally-retouched images. RetouchingFFHQ stands out from previous datasets due to its large scale, high quality, fine-grainedness, and customization. By including four typical types of face retouching operations and different retouching levels, we extend the binary face retouching detection into a fine-grained, multi-retouching type, and multi-retouching level estimation problem. Additionally, we propose a Multi-granularity Attention Module (MAM) as a plugin for CNN backbones for enhanced cross-scale representation learning. Extensive experiments using different baselines as well as our proposed method on RetouchingFFHQ show decent performance on face retouching detection. With the proposed new dataset, we believe there is great potential for future work to tackle the challenging problem of real-world fine-grained face retouching detection., Comment: Under review

We introduce Imuge, an image tamper resilient generative scheme for image self-recovery. The traditional manner of concealing image content within the image are inflexible and fragile to diverse digital attack, i.e. image cropping and JPEG compression. To address this issue, we jointly train a U-Net backboned encoder, a tamper localization network and a decoder for image recovery. Given an original image, the encoder produces a visually indistinguishable immunized image. At the recipient's side, the verifying network localizes the malicious modifications, and the original content can be approximately recovered by the decoder, despite the presence of the attacks. Several strategies are proposed to boost the training efficiency. We demonstrate that our method can recover the details of the tampered regions with a high quality despite the presence of various kinds of attacks. Comprehensive ablation studies are conducted to validate our network designs., Comment: Accepted as Poster at ACMMM 2021. Authors are from Fudan University, Simon Fraser University and NVIDIA, China

The existing image embedding networks are basically vulnerable to malicious attacks such as JPEG compression and noise adding, not applicable for real-world copyright protection tasks. To solve this problem, we introduce a generative deep network based method for hiding images into images while assuring high-quality extraction from the destructive synthesized images. An embedding network is sequentially concatenated with an attack layer, a decoupling network and an image extraction network. The addition of decoupling network learns to extract the embedded watermark from the attacked image. We also pinpoint the weaknesses of the adversarial training for robustness in previous works and build our improved real-world attack simulator. Experimental results demonstrate the superiority of the proposed method against typical digital attacks by a large margin, as well as the performance boost of the recovered images with the aid of progressive recovery strategy. Besides, we are the first to robustly hide three secret images., Comment: A modified version is submitted to IEEE ICASSP 2021. Authors are from Fudan University, Simon Fraser University and NVIDIA

The beam-ion interaction is a potential limitation of beam performance in electron accelerators, especially where the beam emittance is of a great concern in future ultra-low emittance light source. "Conventionally", the beam instability due to beam-ion interaction is attributed to two types of effects: ion trapping effect and fast ion effect, which emphasize the beam-ion dynamics in different time scales. Whereas, in accelerators, the beam suffers from a mixture of ion trapping effect and fast ion effect, leading to a more complicated process and requiring a self-consistent treatment. To evaluate the beam characteristics, as emittance growth under the influence from beam-ion effect, a new numerical simulation code based on the "quasi-strong-strong" model has been developed, including modules of ionization, beam-ion interaction, synchrotron radiation damping, quantum excitation, bunch-by-bunch feedback, etc. In the study, we do not regularly distinguish the ion trapping effect and the fast ion effect, but treat beam-ion interaction more generally and consistently. The lattice of High Energy Photon Source, a diffraction limit ring under construction in Beijing, is used as an example to show the beam-ion effect. It is found that in this low emittance ring, the beam-ion instability is not a dominant mechanism in operation mode with a high beam current, but seriously occurs in a lower beam current region. When the beam-ion instability were significantly driven and can not be damped by the synchrotron radiation damping, the simulations show the bunch-by-bunch feedback system based on the Finite Impulse Response filter technique can be adopted to mitigate it effectively.

Macro-particle tracking is a prominent method to study the collective beam instabilities in accelerators. However, the heavy computation load often limits the capability of the tracking codes. One widely used macro-particle tracking code to simulate collective instabilities in storage rings is mbtrack. The Message Passing Interface (MPI) is already implemented in the original mbtrack to accelerate the simulations. However, many CPU threads are requested in mbtrack for the analysis of the coupled-bunch instabilities. Therefore, computer clusters or desktops with many CPU cores are needed. Since these are not always available, we employ as alternative a Graphics Processing Unit (GPU) with CUDA programming interface to run such simulations in a stand-alone workstation. All the heavy computations have been moved to the GPU. The benchmarks confirm that mbtrack-cuda can be used to analyze coupled bunch instabilities up to at least 484 bunches. Compared to mbtrack on an 8-core CPU, 36-core CPU and a cluster, mbtrack-cuda is faster for simulations of up to 3 bunches. For 363 bunches, mbtrack-cuda needs about six times the execution time of the cluster and twice of the 36-core CPU. The multi-bunch instability analysis shows that the length of the ion-cleaning gap has no big influence, at least at filling to 3/4., Comment: submitted to NIM-A

In this paper, a joint beamforming design for max-min fair simultaneous wireless information and power transfer (SWIPT) is investigated in a green cloud radio access network (Cloud-RAN) with millimeter wave (mmWave) wireless fronthaul. To achieve a balanced user experience for separately located data receivers (DRs) and energy receivers (ERs) in the network, joint transmit beamforming vectors are optimized to maximize the minimum data rate among all the DRs, while satisfying each ER with sufficient RF energy at the same time. Then, a two-step iterative algorithm is proposed to solve the original non-convex optimization problem with the fronthaul capacity constraint in an $l_0$-norm form. Specifically, the $l_0$-norm constraint can be approximated by the reweighted $l_1$-norm, from which the optimal max-min data rate and the corresponding joint beamforming vector can be derived via semidefinite relaxation (SDR) and bi-section search. Finally, extensive numerical simulations are performed to verify the superiority of the proposed joint beamforming design to other separate beamforming strategies., Comment: Submitted to Globecom 2018

We consider a centralized caching network, where a server serves several groups of users, each having a common shared homogeneous fixed-size cache and requesting arbitrary multiple files. An existing coded prefetching scheme is employed where each file is broken into multiple fragments and each cache stores multiple coded packets each formed by XORing fragments from different files. For such a system, we propose an efficient file delivery scheme with explicit constructions by the server to meet the arbitrary multi-requests of all user-groups. Specifically, the stored coded packets of each cache are classified into four types based on the composition of the file fragments encoded. A delivery strategy is developed, which separately delivers part of each packet type first and then combinatorially delivers the remaining different packet types in the last stage. The rate as well as the worst rate of the proposed delivery scheme are analyzed. We show that our caching model and delivery scheme can incorporate some existing coded caching schemes as special cases. Moreover, for the special case of uniform requests and uncoded prefetching, we make a comparison with existing results, and show that our approach can achieve a lower delivery rate. We also provide numerical results on the delivery rate for the proposed scheme.

We consider a space communication network consisting of Geosynchronous Earth Orbit satellites (GEOSs) and Low Earth Orbit satellites (LEOSs). In case of no direct communication link between two GEOSs, the data exchange between them is through relay by the LEOSs. In particular, the source GEOS sends coded data to multiple LEOSs based on the distributed storage framework. The destination GEOS then retrieves certain amount of data from each LEOS for data reconstruction. For the GEOS-LEOS downlink, a regenerating-code-based transmission scheme is optimized to guarantee data reconstructability, where the transmission power allocation to the LEOSs is proposed to minimize the total transmission energy. We also consider the power allocation to minimize the total transmission time given the total transmission energy. For the LEOS-GEOS uplink, a flexible partial-downloading coding transmission scheme is proposed to guarantee data reconstructability, where the joint uploaded-data size and power allocations are proposed to minimize the total transmission energy or the total transmission time. Extensive simulation results are presented to evaluate the proposed algorithms and show that regenerating code can achieve lower transmission energy and shorter transmission time for data regeneration than conventional maximum-distance separable (MDS) code.

In this paper, colocated MIMO radar waveform design is considered by minimizing the integrated side-lobe level to obtain beam patterns with lower side-lobe levels than competing methods. First, a quadratic programming problem is formulated to design beam patterns by using the criteria for a minimal integrated side-lobe level. A theorem is derived that provides a closed-form analytical optimal solution that appears to be an extension of the Rayleigh quotient minimization for a possibly singular matrix in quadratic form. Such singularities are shown to occur in the problem of interest, but proofs for the optimum solution in these singular matrix cases could not be found in the literature. Next, an additional constraint is added to obtain beam patterns with desired 3 dB beamwidths, resulting in a nonconvex quadratically constrained quadratic program which is NP-hard. A semidefinite program and a Gaussian randomized semidefinite relaxation are used to determine feasible solutions arbitrarily close to the solution to the original problem. Theoretical and numerical analyses illustrate the impacts of changing the number of transmitters and orthogonal waveforms employed in the designs. Numerical comparisons are conducted to evaluate the proposed design approaches., Comment: 22 pages, 6 figures, Accepted by IEEE Transactions on Aerospace and Electronic Systems