Hongwu Zhang

Learn More
In order to maximize the network lifetime for target coverage, we propose a distributed optimum coverage algorithm for point target in wireless sensor networks. In this paper, we first present a 1-hop local target coverage problem, next analyze the critical restraint of this problem and introduced the definition of key target, then designed an energy(More)
In order to reduce the algorithm complexity of the target coverage problem which is a NP-complete problem, we design three approaches to shorten the network scale. We firstly delete redundant sensor nodes, secondly remove the redundant targets, and thirdly divide the target-coverage graph into independent sub-graphs, and present the construct independent(More)
Non-Markovian effect is found to be able to decrease the quantum speed limit (QSL) time, and hence to enhance the intrinsic speed of quantum evolution. Although a reservoir with larger degree of non-Markovianity may seem like it should cause smaller QSL times, this seemingly intuitive thinking may not always be true. We illustrate this by investigating the(More)
This paper proposes an adaptive genetic algorithm for automated annotation of point elements in numerical map. Firstly, analyze the automatic annotation problem for point elements in numerical map, present an adaptive genetic algorithm for automated annotation of point elements (AGAAA), and analyze its methods and steps of the algorithm. Experiments show(More)
In this paper, we propose an improved non-local boundary value problem method to solve a Cauchy problem for the Laplace equation. It is known that the Cauchy problem for the Laplace equation is severely ill-posed, i.e., the solution does not depend continuously on the given Cauchy data. Convergence estimates for the regularized solutions are obtained under(More)
  • 1