We present a deterministic distributed 2-approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGESTmodel whose round complexity isO(log n log∆/ log log∆). This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the (2 + ǫ)-approximation algorithm of [BCS17], improving the dependency on ǫ from linear to logari...

We show the boundedness of B-pluricanonical representations lc log Calabi-Yau pairs in dimension $2$. As applications, we prove indices slc up to $3$ and that non-klt $4$.

System logs are almost the only data that records system operation information, so they play an important role in anomaly analysis, intrusion detection, and situational awareness. However, it is still a challenge to obtain effective from massive logs. On one hand, unstructured data, and, on other log cannot be directly analyzed calculated by computers. In order deal with these problems, current...

In this short note, we present a construction for the log–log blow up solutions to focusing mass-critical stochastic nonlinear Schrödinger equations with multiplicative noises. The solution is understood in sense of controlled rough path as Su and Zhang (Minimal mass blow-up equations, arXiv:2002.09659 , 2020).