82 resultados para Agriculture, Cooperative
Resumo:
In social selection the phenotype of an individual depends on its own genotype as well as on the phenotypes, and so genotypes, of other individuals. This makes it impossible to associate an invariant phenotype with a genotype: the social context is crucial. Descriptions of metazoan development, which often is viewed as the acme of cooperative social behaviour, ignore or downplay this fact. The implicit justification for doing so is based on a group-selectionist point of view. Namely, embryos are clones, therefore all cells have the same evolutionary interest, and the visible differences between cells result from a common strategy. The reasoning is flawed, because phenotypic heterogeneity within groups can result from contingent choices made by cells from a flexible repertoire as in multicellular development. What makes that possible is phenotypic plasticity, namely the ability of a genotype to exhibit different phenotypes. However, co-operative social behaviour with division of labour requires that different phenotypes interact appropriately, not that they belong to the same genotype, or have overlapping genetic interests. We sketch a possible route to the evolution of social groups that involves many steps: (a) individuals that happen to be in spatial proximity benefit simply by virtue of their number; (b) traits that are already present act as preadaptations and improve the efficiency of the group; and (c) new adaptations evolve under selection in the social context-that is, via interactions between individuals-and further strengthen group behaviour. The Dictyostelid or cellular slime mould amoebae (CSMs) become multicellular in an unusual way, by the aggregation of free-living cells. In nature the resulting group can be genetically homogeneous (clonal) or heterogeneous (polyclonal); in either case its development, which displays strong cooperation between cells (to the extent of so-called altruism) is not affected. This makes the CSMs exemplars for the study of social behaviour.
Resumo:
We combine multiple scattering and renormalization group methods to calculate the leading order dimensionless virial coefficient k(s) for the friction coefficient of dilute polymer solutions under conditions where the osmotic second virial coefficient vanishes (i.e., at the theta point T-theta). Our calculations are formulated in terms of coupled kinetic equations for the polymer and solvent, in which the polymers are modeled as continuous chains whose configurations evolve under the action of random forces in, the velocity field of the solvent. To lowest order in epsilon=4-d, we find that k(s) = 1.06. This result compares satisfactorily with existing experimental estimates of k(s), which are in the range 0.7-0.8. It is also in good agreement with other theoretical results on chains and suspensions at T-theta. Our calculated k(s) is also found to be identical to the leading order virial coefficient of the tracer friction coefficient at the theta point. We discuss possible reasons for the difficulties encountered when attempting to evaluate k(s) by extrapolating prior renormalization group calculations from semidilute concentrations to the infinitely dilute limit. (C) 1996 American Institute of Physics.
Resumo:
Two free-ranging packs of dholes (Asiatic wild dog, Cuon alpinus) were monitored for a period of 6 yr (Sep. 1990-Sep. 1996) in the Mudumalai sanctuary, southern India. Demographic data on age structure, litter-size, sex ratio and age and sex specific dispersal were collected. Behavioural data on social interactions and reproductive behaviour among pack members were obtained to determine the frequencies of dominant and subordinate behaviours shown by malt: and female pack members and a measure of each male's reproductive access to females. Behaviours displayed by pack members at dens were recorded to determine whether any age- or sex-specific role specialization existed during pup care. Tenures for dominant males and females within the pack were calculated to ascertain the rate of breeding vacancies occurring within packs. Approximate levels of genetic relatedness within packs were determined by studying pedigrees. In most years one study pack had a male-biased adult sex ratio. This was caused by almost twofold higher dispersal of adult females over adult males. A considerable variance existed in the percentage of sub-adults dispersing from the two packs. Differences existed in the frequencies of dominant and subordinate behaviours shown by males. For males, dominance ranks and ranks based on submissive behaviours were not correlated with frequencies of reproductive behaviours. Subordinate males also displayed reproductive behaviours. In packs, dominant males had lower tenures than dominant females indicating that among males breeding vacancies arose more quickly. The litter size was found to be negatively correlated with the age of the breeding female. There were no significant differences across individuals of varying age or sex classes in the display of pup care behaviours. Significant differences did exist among individual adults. Genetic relatedness among packs tended to vary temporally as a consequence of possible mating by subordinate animals and immigration of new males into the pack. In conclusion, it appears that males delay dispersal and cooperate within their natal packs because of the variety of reproductive strategies they could pursue within. A combination of ecological constraints and the difficulties of achieving breeding status within non-natal packs may make early dispersal and independent breeding less beneficial.
Resumo:
This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user is using Orthogonal Frequency Division Multiplexing (OFDM). For this we develop cooperative sequential detection algorithms that use the autocorrelation property of cyclic prefix (CP) used in OFDM systems. We study the effect of timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. We also modify the detector to mitigate the effects of these impairments. The performance of the proposed algorithms is studied via simulations. We show that sequential detection can significantly improve the performance over a fixed sample size detector.
Resumo:
Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.
Resumo:
Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K-parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.
Resumo:
This paper contains an analysis of the technical options in agriculture for reducing greenhouse-gas emissions and increasing sinks, arising from three distinct mechanisms: (i) increasing carbon sinks in soil organic matter and above-ground biomass; (ii) avoiding carbon emissions from farms by reducing direct and indirect energy use; and (iii) increasing renewable-energy production from biomass that either substitutes for consumption of fossil fuels or replaces inefficient burning of fuelwood or crop residues, and so avoids carbon emissions, together with use of biogas digesters and improved cookstoves. We then review best-practice sustainable agriculture and renewable-resource-management projects and initiatives in China and India, and analyse the annual net sinks being created by these projects, and the potential market value of the carbon sequestered. We conclude with a summary of the policy and institutional conditions and reforms required for adoption of best sustainability practice in the agricultural sector to achieve the desired reductions in emissions and increases in sinks. A review of 40 sustainable agriculture and renewable-resource-management projects in China and India under the three mechanisms estimated a carbon mitigation potential of 64.8 MtC yr(-1) from 5.5 Mha. The potential income for carbon mitigation is $324 million at $5 per tonne of carbon. The potential exists to increase this by orders of magnitude, and so contribute significantly to greenhouse-gas abatement. Most agricultural mitigation options also provide several ancillary benefits. However, there are many technical, financial, policy, legal and institutional barriers to overcome.
Resumo:
Dendritic cells (DCs) as sentinels of the immune system are important for eliciting both primary and secondary immune responses to a plethora of microbial pathogens. Cooperative stimulation of a complex set of pattern-recognition receptors, including TLR2 and nucleotide-binding oligomerization domain (NOD)-like receptors on DCs, acts as a rate-limiting factor in determining the initiation and mounting of the robust immune response. It underscores the need for ``decoding'' these multiple receptor interactions. In this study, we demonstrate that TLR2 and NOD receptors cooperatively regulate functional maturation of human DCs. Intriguingly, synergistic stimulation of TLR2 and NOD receptors renders enhanced refractoriness to TGF-beta- or CTLA-4-mediated impairment of human DC maturation. Signaling perturbation data suggest that NOTCH1-PI3K signaling dynamics assume critical importance in TLR2- and NOD receptor-mediated surmounting of CTLA-4- and TGF-beta -suppressed maturation of human DCs. Interestingly, the NOTCH1-PI3K signaling axis holds the capacity to regulate DC functions by virtue of PKC delta-MAPK-dependent activation of NF-kappa B. This study provides mechanistic and functional insights into TLR2-and NOD receptor-mediated regulation of DC functions and unravels NOTCH1-PI3K as a signaling cohort for TLR2 and NOD receptors. These findings serve in building a conceptual foundation for the design of improved strategies for adjuvants and immunotherapies against infectious diseases.
Resumo:
We consider a framework in which several service providers offer downlink wireless data access service in a certain area. Each provider serves its end-users through opportunistic secondary spectrum access of licensed spectrum, and needs to pay primary license holders of the spectrum usage based and membership based charges for such secondary spectrum access. In these circumstances, if providers pool their resources and allow end-users to be served by any of the cooperating providers, the total user satisfaction as well as the aggregate revenue earned by providers may increase. We use coalitional game theory to investigate such cooperation among providers, and show that the optimal cooperation schemes can be obtained as solutions of convex optimizations. We next show that under usage based charging scheme, if all providers cooperate, there always exists an operating point that maximizes the aggregate revenue of providers, while presenting each provider a share of the revenue such that no subset of providers has an incentive to leave the coalition. Furthermore, such an operating point can be computed in polynomial time. Finally, we show that when the charging scheme involves membership based charges, the above result holds in important special cases.
Resumo:
We consider single-source single-sink (ss-ss) multi-hop relay networks, with slow-fading links and single-antenna half-duplex relay nodes. While two-hop cooperative relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this paper, we identify two families of networks that are multi-hop generalizations of the two-hop network: K-Parallel-Path (KPP)networks and layered networks.KPP networks, can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of layers of relays with edges existing only between adjacent layers, with more than one relay in each layer. We prove that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for single-antenna fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of relaying layers is less than 4.For multiple-antenna KPP and layered networks, we provide an achievable DMT, which is significantly better than known lower bounds for half duplex networks.For arbitrary multi-terminal wireless networks with multiple source-sink pairs, the maximum achievable diversity is shown to be equal to the min-cut between the corresponding source and the sink, irrespective of whether the network has half-duplex or full-duplex relays. For arbitrary ss-ss single-antenna directed acyclic networks with full-duplex relays, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable.Along the way, we derive the optimal DMT of a generalized parallel channel and derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. We also give alternative and often simpler proofs of several existing results and show that codes achieving full diversity on a MIMO Rayleigh fading channel achieve full diversity on arbitrary fading channels. All protocols in this paper are explicit and use only amplify-and-forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes.Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple AF protocols are often sufficient to attain the optimal DMT