In this paper we study the topology effects on diffusion process in signed networks. Considering a simple threshold model for diffusion process, it is extended to signed networks and some appropriate definitions are proposed. This model is a basic model that could be extended and applied in analyzing dynamics of many real phenomena such as opinion forming or innovation diffusion in social netwo...

Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance ...

Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance ...

In many applications of clustering, solutions that are balanced, i.e, where the clusters obtained are of comparable sizes, are preferred. This chapter describes several approaches to obtaining balanced clustering results that also scale well to large data sets. First, we describe a general scalable framework for obtaining balanced clustering which first clusters only a small subset of the data ...

Isosurface extraction is a common technique applied in scientific visualization. Increasing sizes of volumes over which isosurfacing is to be applied combined with increasingly hierarchical parallel architectures present challenges for efficiently distributing isosurfacing work loads. We propose a technique that, with a modest amount of preprocessing, efficiently distributes isosurfacing load t...

We represent a computer cluster as a multi-server queue with some arbitrary bipartite graph of compatibilities between jobs and servers. Each server processes its jobs sequentially in FCFS order. The service rate of a job at any given time is the sum of the service rates of all servers processing this job. We show that the corresponding queue is quasi-reversible and use this property to design ...