某类沿曲面的强奇异积分算子在调幅函数空间上的有界性

假设β1α1 0,β2α2 0。文章对如下定义的强奇异积分算子Q乙2f(x-t, y-s, z-γ(t)h(s))t1e+α1,γ(t), h(s)满足某些适当的条件。利用振荡积分估计,得到当β1 3α1 0且β2

Boundedness of Certain Hyper Singular Integral Operator Along Surface on Modulation Space

In order to improve the global search power of the K-means algorithm and the clustering effect, the K-means method based on the approximate backbone and the shuffled frog leaping algorithm is proposed. Firstly, in this method, the classic iterative formula of the K-means algorithm is replaced by the classic shuffled frog leaping algorithm to obtain multiple sets of better clustering results. Then, the K-means algorithm based on the approximate backbone and the shuffled frog leaping algorithm is used for the obtained clustering results. Instead of searching for cluster centers, the cluster division is directly modified. The experimental results of the UCI dataset reveal that the clustering results obtained by the improved algorithm are better than those of other algorithms. Finally, this study applies the improved clustering algorithm to the medical fundus medical records images, which has a better effect on the vascular cutting.