clustering is an effective approach for managing nodes in wireless sensor network (wsn). a new method of clustering mechanism with using binary gravitational search algorithm (bgsa) in wsn, is proposed in this paper to improve the energy consumption of the sensor nodes.reducing the energy consumption of sensors in wsnsis the objective of this paper that is through selecting thesub optimum senso...

The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.

Traditional network embedding primarily focuses on learning a continuous vector representation for each node, preserving structure and/or node content information, such that off-the-shelf machine algorithms can be easily applied to the vector-format representations analysis. However, learned are inefficient large-scale similarity search, which often involves finding nearest neighbors measured b...

The binary computer-generated hologram (BCGH) has attracted much attention recently because it can address the high-speed spatial light modulator (SLM), such as a digital micromirror device (DMD) SLM. In this paper, our concern is development of an algorithm to produce high-quality BCGHs. particular, simulated annealing (SA) efficient used phase-only hologram. study SA for production BCGH, we f...

Limit laws for several quantities in random binary search trees that are related to the local shape of a tree around each node can be obtained very simply by applying central limit theorems for rn-dependent random variables . Examples include : the number of leaves (La ), the number of nodes with k descendants (k fixed), the number of nodes with no left child, the number of nodes with k left de...