arXiv subjects
Publications and source records attributed to Feng Zhu.
Generally, Energy Recovery Linac (ERL) needs special designed high current superconducting RF cavities. In this paper, the threshold current of BBU for compact ERL facilities with 9-cell Tesla type cavities are investigated. The results show that it is feasible to adopt 9-cell Tesla cavity for compact ERL test facilities with just a few cavities and beam current around tens mA.
We report on a high-power mid-infrared frequency comb source based on a femtosecond Er:fiber oscillator with a stabilized repetition rate at 250 MHz. The mid-infrared frequency comb is produced through difference frequency generation in a periodically poled MgO-doped lithium niobate crystal. The output power is about 120 mW with a pulse duration of about 80 fs, and spectrum coverage from 2.9 to 3.6 um. The coherence properties of the produced high-power broadband mid-infrared frequency comb are maintained, which was verified by heterodyne measurements. As the first application, the spectrum of a ~200 ppm methane-air mixture in a short 20 cm glass cell at ambient atmospheric pressure and temperature was measured.
X-ray spectral imaging provides quantitative imaging of trace elements in biological sample with high sensitivity. We propose a novel algorithm to promote the signal-to-noise ratio (SNR) of X-ray spectral images that have low photon counts. Firstly, we estimate the image data area that belongs to the homogeneous parts through confidence interval testing. Then, we apply the Poisson regression through its maximum likelihood estimation on this area to estimate the true photon counts from the Poisson noise corrupted data. Unlike other denoising methods based on regression analysis, we use the bootstrap resampling method to ensure the accuracy of regression estimation. Finally, we use a robust local nonparametric regression method to estimate the baseline and subsequently subtract it from the X-ray spectral data to further improve the SNR of the data. Experiments on several real samples show that the proposed method performs better than some state-of-the-art approaches to ensure accuracy and precision for quantitative analysis of the different trace elements in standard reference biological sample.
We use two femtosecond Erbium-doped fiber lasers with slightly different repetition rates to perform a modern type of Fourier transform spectroscopy without moving parts. The measurements are done in real time, and it takes less than 50 microseconds. We work with somewhat different spectral outputs from two Erbium-doped fiber lasers and employ spectral filtering based on a 2f-2f grating setup to select the common spectral region of interest, thereby increasing the signal-to-noise ratio. The interferogram is taken with a 20 cm long gas cell, containing a mixture of acetylene and air at atmospheric pressure, and is fast-Fourier-transformed to obtain the broadband spectral fingerprint of the gas.
We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a printer. As far as we know, this is the first application of timed automata technology to an industrial scheduling problem with uncertainty in job arrivals.
We present a detailled timed automata model of the clock synchronization algorithm that is currently being used in a wireless sensor network (WSN) that has been developed by the Dutch company Chess. Using the Uppaal model checker, we establish that in certain cases a static, fully synchronized network may eventually become unsynchronized if the current algorithm is used, even in a setting with infinitesimal clock drifts.
Many data dissemination and publish-subscribe systems that guarantee the privacy and authenticity of the participants rely on symmetric key cryptography. An important problem in such a system is to maintain the shared group key as the group membership changes. We consider the problem of determining a key hierarchy that minimizes the average communication cost of an update, given update frequencies of the group members and an edge-weighted undirected graph that captures routing costs. We first present a polynomial-time approximation scheme for minimizing the average number of multicast messages needed for an update. We next show that when routing costs are considered, the problem is NP-hard even when the underlying routing network is a tree network or even when every group member has the same update frequency. Our main result is a polynomial time constant-factor approximation algorithm for the general case where the routing network is an arbitrary weighted graph and group members have nonuniform update frequencies.