The spatially homogeneous Boltzmann equation without angular cutoff is discussed on the regularity of solutions for the modified hard potential and Debye-Yukawa potential. When the angular singularity of the cross section is moderate, any weak solution having the finite mass, energy and entropy lies in the Sobolev space of infinite order for any positive time, while for the general potentials, it lies in the Schwartz space if it has moments of arbitrary order. The main ingredients of the proof are the suitable choice of the mollifiers composed of pseudo-differential operators and the sharp estimates of the commutators of the Boltzmann collision operator and pseudo-differential operators. The method developed here also provides some new estimates on the collision operator.

No abstract uploaded!

Computational techniques derived from digital signal processing are playing a significant role in the security and digital copyrights of audio, video, and visual arts. In light of the quantum computing, the corresponding algorithms are becoming a new research direction in today’s high-technology world. The nature of quantum computer guarantees the security of quantum data, so a safe and effective quantum watermarking algorithm is in demand. Quantum watermarking is the technique that embeds the invisible quantum signal into quantum multimedia data for copyright protection. This research presents a quantum watermarking algorithm in discrete M-band wavelet domain. Different from most traditional algorithms, we propose a new algorithm which applies quantum watermarking in M-band wavelet domain. Assured by the Heisenberg uncertainty principle and quantum no-cloning theorem, the security of quantum watermark can reach a very high-level standard. In other words, this watermarking algorithm can defeat nearly all attackers, no matter using classical computer or quantum computer.

In this paper we analyze an algorithm which solves the point projection and the “inversion” problems for parametric curves and surfaces. It consists of a geometric second order iteration which converges faster than existing first order methods, and whose sensitivity to the choice of initial values is small. Applications include the ICP algorithm for shape registration.

We show that the scaling limit exists and is invariant under dilations and rotations. We give some tools that might be useful to show universality.