3 resultados para Violence, War and Conflict

em Indian Institute of Science - Bangalore - Índia


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Many large mammals such as elephant, rhino and tiger often come into conflict with people by destroying agricultural crops and even killing people, thus providing a deterrent to conservation efforts. The males of these polygynous species have a greater variance in reproductive success than females, leading to selection pressures favouring a ‘high risk-high gain’ strategy for promoting reproductive success. This brings them into greater conflict with people. For instance, adult male elephants are far more prone than a member of a female-led family herd to raid agricultural crops and to kill people. In polygynous species, the removal of a certain proportion of ‘surplus’ adult males is not likely to affect the fertility and growth rate of the population. Hence, this could be a management tool which would effectively reduce animal-human conflict, and at the same time maintain the viability of the population. Selective removal of males would result in a skewed sex ratio. This would reduce the ‘effective population size’ (as opposed to the total population or census number), increase the rate of genetic drift and, in small populations, lead to inbreeding depression. Plans for managing destructive mammals through the culling of males will have to ensure that the appropriate minimum size in the populations is being maintained.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Sets of multivalued dependencies (MVDs) having conflict-free covers are important to the theory and design of relational databases [2,12,15,16]. Their desirable properties motivate the problem of testing a set M of MVDs for the existence of a confiict-free cover. In [8] Goodman and Tay have proposed an approach based on the possible equivalence of M to a single (acyclic) join dependency (JD). We remark that their characterization does not lend an insight into the nature of such sets of MVDs. Here, we use notions that are intrinsic to MVDs to develop a new characterization. Our approach proceeds in two stages. In the first stage, we use the notion of “split-free” sets of MVDs and obtain a characterization of sets M of MVDs having split-free covers. In the second, we use the notion of “intersection” of MVDs to arrive at a necessary and sufficient condition for a split-free set of MVDs to be conflict-free. Based on our characterizations, we also give polynomial-time algorithms for testing whether M has split-free and conflict-free covers. The highlight of our approach is the clear insight it provides into the nature of sets of MVDs having conflict-free covers. Less emphasis is given in this paper to the actual efficiency of the algorthms. Finally, as a bonus, we derive a desirable property of split-free sets of MVDs,thereby showing that they are interesting in their own right.