Social Life of Captive Asian Elephants (Elephas maximus) in Southern India: Implications for Elephant Welfare

Asian elephants in the wild live in complex social societies; in captivity, however, management often occurs in solitary conditions, especially at the temples and private places of India. To investigate the effect of social isolation, this study assessed the social group sizes and the presence of stereotypies among 140 captive Asian elephants managed in 3 captive systems (private, temple, and forest department) in Tamil Nadu, India, between 2003 and 2005. The majority of the facilities in the private (82%) and temple (95%) systems held a single elephant without opportunity for social interaction. The forest department managed the elephants in significantly larger groups than the private and temple systems. Among the 3 systems, the proportion of elephants with stereotypies was the highest in temple (49%) followed by private system (26%) and the forest department facility (6%); this correlates with the social isolation trend observed in the 3 systems and suggests a possible link between social isolation and abnormal elephant behavior separate from other environmental factors. The results of this study indicate it would be of greater benefit to elephant well being to keep the patchily distributed solitary temple and private elephants who are socially compatible and free from contagious diseases in small social groups at ocommon elephant houseso for socialization.

Social optimum in social groups with give-and-take criterion

We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.