A gure-ground segregation network is proposed based on a novel boundary pair representation. Nodes in the network are boundary segments obtained through local grouping. Each node is excitatorily coupled with the neighboring nodes that belong to the same region, and inhibitorily coupled with the corresponding paired node. Gestalt grouping rules are incorporated by modulating connections. The sta...

The positioning of wireless nodes in indoor Wireless Local Area Network (WLAN) using Received Signal Strength Indication (RSSI) has become an attractive low cost localization solution. The location accuracy of RSSI based algorithms is dependent on node placement topology. The localization performance analysis reported for nodes arranged in V-shaped linear configuration. The uniqueness of this w...

Taking advantage of the parallelism and programmability of GPU, we solve the fluid dynamics problem completely on GPU. Different from previous methods, the whole computation is accelerated in our method by packing the scalar and vector variables into four channels of texels. In order to be adaptive to the arbitrary boundary conditions, we group the grid nodes into different types according to t...

Wepropose two novel algorithms for distributed and locationfree boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information of a small neighborhood. This makes our algorithms highly applicable for dynamic networks where nodes can move or become inoperative. We compare our algorithm...

A patch representation differing from the traditional treatments in the boundary element method (BEM) is presented, which we call the constant "node patch" method. Its application to solving the Poisson-Boltzmann equation (PBE) demonstrates considerable improvement in speed compared with the constant element and linear element methods. In addition, for the node-based BEMs, we propose an efficie...

Node scheduling scheme of sensor nodes is one of the most important method to solve the energy-constrained wireless sensor networks. Traditional methods of node scheduling that without location information leads to a node in the border of monitored region first death due to no more chance enter into sleep state, and then the death spread to the central region. This phenomenon is called as inequ...

Wireless Sensor Networks (WSN) consists of distributed low-cost sensing nodes with autonomous network. Several anomalies can occur in wireless sensor networks that may form various coverage holes. These holes may disturb the existing coverage or connectivity, and impair desired functionalities of networks. Hence, it is essential to detect and recovery coverage holes in order to ensure the full ...