No abstract uploaded!

Using the complex coloring method, we present the graphs of the quantum dilogarithm function Gb(z) and visualize its analytic and asymptotic behaviours. In particular we demonstrate the limiting process when the modified Gb(z)→Γ(z) as b→0. We also survey the relations of Gb(z) with different variants of the quantum dilogarithm function.

We adopt a recent work in Chung, Qian, Uhlmann and Zhao (Inverse Problems, 23 (2007) 309-329) to develop a phase space method for reconstructing pressure wave speed and shear wave speed of an elastic medium from travel time measurements. The method is based on the so-called Stefanov-Uhlmann identity which links two Riemannian metrics with their travel time information. We design a numerical algorithm to solve the resulting inverse problem. The algorithm is a hybrid approach that combines both Lagrangian and Eulerian formulations. In particular the Lagrangian formulation in phase space can take into account multiple arrival times naturally, while the Eulerian formulation for wave speeds allows us to compute the solution in physical space. Numerical examples are shown to validate the method.

Designing an unsupervised image denoising approach in practical applications is a challenging task due to the complicated data acquisition process. In the realworld case, the noise distribution is so complex that the simplified additive white Gaussian (AWGN) assumption rarely holds, which significantly deteriorates the Gaussian denoisers’ performance. To address this problem, we apply a deep neural network that maps the noisy image into a latent space in which the AWGN assumption holds, and thus any existing Gaussian denoiser is applicable. More specifically, the proposed neural network consists of the encoder-decoder structure and approximates the likelihood term in the Bayesian framework. Together with a Gaussian denoiser, the neural network can be trained with the input image itself and does not require any pre-training in other datasets. Extensive experiments on real-world noisy image datasets have shown that the combination of neural networks and Gaussian denoisers improves the performance of the original Gaussian denoisers by a large margin. In particular, the neural network+BM3D method significantly outperforms other unsupervised denoising approaches and is competitive with supervised networks such as DnCNN, FFDNet, and CBDNet.

In this paper, we show the claims in the original Kipnis-Shamir attack on the HFE cryptosystems and the improved attack by Courtois that the complexity of the attacks is polynomial in terms of the number of variables are invalid. We present computer experiments and a theoretical argument using basic algebraic geometry to explain why it is so. Furthermore we show that even with the help of the powerful new Gröbner basis algorithm like F_4, the Kipnis-Shamir attack still should be exponential but not polynomial. This again is supported by our theoretical argument.