To address the problems of missing inside and incomplete edge contours in camouflaged target detection results, we propose a moving algorithm based on local minimum difference constraints (LMDC). The first uses mean to optimize initial background model, removes stable region by global comparison, extracts point set potential so that each boundary (seed) grows along center target. Finally, defin...

It is well known that small molecules (ligands) do not necessarily adopt their lowest potential energy conformations when binding to proteins. Analyses of protein-bound ligand crystal structures have reportedly shown that many of them do not even adopt the conformations at local minima of their potential energy surfaces (local minimum conformations). The results of these analyses raise a concer...

The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted to bipartite graphs. Regarding the upper bound, we show that for any graph of order n, its local minimum degree is at most 3 8 n + o(n) and n 4 + o(n) for bi...