Abstract: The existence of many biological systems,
especially human societies, is based on cooperative behavior
[1, 2]. If natural selection favors selfish individuals, then what
mechanism is at work that we see so many cooperative
behaviors? One answer is the effect of network structure. On a
graph, cooperators can evolve by forming network bunches
[2, 3, 4]. In a research, Ohtsuki et al used the idea of iterated
prisoners- dilemma on a graph to model an evolutionary
game. They showed that the average number of neighbors
plays an important role in determining whether cooperation is
the ESS of the system or not [3]. In this paper, we are going to
study the dynamics of evolution of cooperation in a social
network. We show that during evolution, the ratio of
cooperators among individuals with fewer neighbors to
cooperators among other individuals is greater than unity. The
extent to which the fitness function depends on the payoff of
the game determines this ratio.
Abstract: Duplicated region detection is a technical method to
expose copy-paste forgeries on digital images. Copy-paste is one
of the common types of forgeries to clone portion of an image
in order to conceal or duplicate special object. In this type of
forgery detection, extracting robust block feature and also high
time complexity of matching step are two main open problems.
This paper concentrates on computational time and proposes a local
block matching algorithm based on block clustering to enhance time
complexity. Time complexity of the proposed algorithm is formulated
and effects of two parameter, block size and number of cluster, on
efficiency of this algorithm are considered. The experimental results
and mathematical analysis demonstrate this algorithm is more costeffective
than lexicographically algorithms in time complexity issue
when the image is complex.