Theory on single molecule-photon cryocooler

The micro mechanism of anti-Stokes fluorescent cooling was investigated on molecular or ionic scale. A new conception of single molecule-photon cryocooler (SMPC) was given, and the smallest cryocooler in the world was predicted. We described SMPC and its running principle in detail. The quantum transition processes of SMPC and the largest cooling coefficient that SMPC can get in an optical transition were given. Also we studied the random property of SMPC in cooling processes. The thermodynamic behavior of single Yb³⁺ ion as a photon cryocooler was imitated.     

Routing-efficient CDS construction in Disk-Containment Graphs

In wireless networks, Connected Dominating Sets (CDSs) are widely used as virtual backbones for communications. On one hand, reducing the backbone size will reduce the maintenance overhead. So how to minimize the CDS size is a critical issue. On the other hand, when evaluating the performance of a wireless network, the hop distance between two communication nodes, which reflect the energy consumption and response delay, is of great importance. Hence how to minimize the routing cost is also a key problem for constructing the network virtual backbone. In this paper, we study the problem of constructing applicable CDS in wireless networks in terms of size and routing cost. We formulate a wireless network as a Disk-Containment Graph (DCG), which is a generalization of the Unit-Disk Graph (UDG), and we develop an efficient algorithm to construct CDS in such kind of graphs. The algorithm contains two parts and is flexible to balance the performance between the two metrics. We also analyze the algorithm theoretically. It is shown that our algorithm has provable performance in minimizing the CDS size and reducing the communication distance for routing.     

Search strategies investigation in brain storm optimization

The canonical brain storm optimization (BSO) employs clustering, creating and selecting operators, which are all connected and have great impacts on the optimization performance. In this paper, the state-of-the-art search strategies are introduced and the potential strengths and weaknesses of these strategies in the BSO algorithm are analyzed and compared from the perspective of the analytical model rather than any metaphors. The numerical experiments are carried out to artificially amplify and highlight the performance of various strategies. Finally, the progressive directions of the BSO algorithm are discussed for further research.     

Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations

In this paper, we discuss the globalization of some kind of modified Levenberg-Marquardt methods for nonsmooth equations and their applications to nonlinear complementarity problems. In these modified Levenberg-Marquardt methods, only an approximate solution of a linear system at each iteration is required. Under some mild assumptions, the global convergence is shown. Finally, numerical results show that the present methods are promising.