41 resultados para Long distance communication
Resumo:
The capacity of species to track shifting climates into the future will strongly influence outcomes for biodiversity under a rapidly changing climate. However, we know remarkably little about the dispersal abilities of most species and how these may be influenced by climate change. Here we show that climate change is projected to substantially reduce the seed dispersal services provided by frugivorous vertebrates in rainforests across the Australian Wet Tropics. Our model projections show reductions in both median and long-distance seed dispersal, which may markedly reduce the capacity of many rainforest plant species to track shifts in suitable habitat under climate change. However, our analyses suggest that active management to maintain the abundances of a small set of important frugivores under climate change could markedly reduce the projected loss of seed dispersal services and facilitate shifting distributions of rainforest plant species.
Resumo:
In the present work, the spray structure of diesel from a 200-mu m, single-hole solenoid injector is studied using microscopic imaging at injection pressures of 700, 1000 and 1400 bar for various gas pressures. A long-distance microscope with a high resolution camera is used for spray visualization with a direct imaging technique. This study shows that even at very high injection pressures, the spray structure in an ambient environment of atmospheric pressure reveals presence of entangled ligaments and non-spherical droplets during the injection period. With increase in the injection pressure, the ligaments tend to get smaller and spread radially. The spray structure studies are also conducted at high gas pressures in a specially designed high pressure chamber with optical access. The near nozzle spray structure at the end of the injection shows that the liquid jet breakup is improved with increase in gas density. The droplet size measurement is possible only late in the injection duration when the breakup appears to be complete and mostly spherical droplets are observed. Hence, droplet size measurements are performed after 1.3 ms from start of the injection pulse. Spatial and temporal variation in Sauter Mean `Diameter (SMD) is observed and reported for the case corresponding to an injection pressure of 700 bar. Overall, this study has highlighted the importance of verifying the extentof atomization and droplet shape even in dense sprays before using conventional dropsizing methods such as PDPA.
Resumo:
Males that produce conspicuous mate attraction signals are often at high risk of predation from eavesdropping predators. Females of such species typically search for signalling males and their higher motility may also place them at risk. The relative predation risk faced by males and females in the context of mate-finding using long-distance signals has rarely been investigated. In this study, we show, using a combination of diet analysis and behavioural experiments, that katydid females, who do not produce acoustic signals, are at higher risk of predation from a major bat predator, Megaderma spasma, than calling males. Female katydids were represented in much higher numbers than males in the culled remains beneath roosts of M. spasma. Playback experiments using katydid calls revealed that male calls were approached in only about one-third of the trials overall, whereas tethered, flying katydids were always approached and attacked. Our results question the idea that necessary costs of mate-finding, including risk of predation, are higher in signalling males than in searching females.
Resumo:
To meet the growing demands of data traffic in long haul communication, it is necessary to efficiently use the low-loss region(C-band) of the optical spectrum, by increasing the no. of optical channels and increasing the bit rate on each channel But narrow pulses occupy higher spectral bandwidth. To circumvent this problem, higher order modulation schemes such as QPSK and QAM can be used to modulate the bits, which increases the spectral efficiency without demanding any extra spectral bandwidth. On the receiver side, to meet a satisfy, a given BER, the received optical signal requires to have minimum OSNR. In our study in this paper, we analyses for different modulation schemes, the OSNR required with and without preamplifier. The theoretical limit of OSNR requirement for a modulation scheme is compared for a given link length by varying the local oscillator (LO) power. Our analysis shows that as we increase the local oscillator (LO) power, the OSNR requirement decreases for a given BER. Also a combination of preamplifier and local oscillator (LO) gives the OSNR closest to theoretical limit.
Resumo:
As populations of the world's largest animal species decline, it is unclear how ecosystems will react to their local extirpation. Due to the unique ecological characteristics of megaherbivores such as elephants, seed dispersal is one ecosystem process that may be affected as populations of large animals are decimated. In typically disturbed South Asian ecosystems, domestic bovids (cattle, Bos primigenius, and buffalo, Bubalus bubalis) may often be the species most available to replace Asian elephants (Elephas maximus) as endozoochorous dispersers of large-fruited mammal-dispersed species. We use feeding trials, germination trials, and movement data from the tropical moist forests of Buxa Tiger Reserve (India) to examine whether domestic bovids are viable replacements for elephants in the dispersal of three largefruited species: Dillenia indica, Artocarpus chaplasha, and Careya arborea. We find that (1) once consumed, seeds are between 2.5 (C. arborea) and 26.5 (D. indica) times more likely to pass undigested into elephant dung than domestic bovid dung; and (2) seeds from elephant dung germinated as well as or better than seeds taken from bovid dung for all plant species, with D. indica seeds from elephant dung 1.5 times more likely to germinate. Furthermore, since wild elephants have less constrained movements than even free-roaming domestic bovids, we calculate that maximum dispersal by elephants is between 9.5 and 11.2 times farther than that of domestic bovids, with about 20% of elephant-dispersed seeds being moved farther than the maximum distance seeds are moved by bovids. Our findings suggest that, while bovids are able to disperse substantial numbers of seeds over moderate distances for two of the three study species, domestic bovids will be unable to routinely emulate the reliable, long-distance dispersal of seeds executed by elephants in this tropical moist forest. Thus while domestic bovids can attenuate the effects of losing elephants as dispersers, they may not be able to prevent the decline of various mammal-dispersed fruiting species in the face of overhunting, habitat fragmentation, and climate change.
Resumo:
Large animal species are prone to local extirpation, but ecologists cannot yet predict how the loss of megaherbivores affects ecosystem processes such as seed dispersal. Few studies have compared the quantity and quality of seed dispersal by megaherbivores versus alternative frugivores in the wild, particularly for plant species with fruit easily consumed by many frugivorous species. In a disturbed tropical moist forest in India, we examine whether megaherbivores are a major frugivore of two tree species with easily edible, mammal-dispersed fruit. We quantify the relative fruit removal rates of Artocarpus chaplasha and Careya arborea, by the Asian elephant (Elephas maximus) and alternative dispersers. Through focal watches and camera trapping, we found the elephant to be amongst the top three frugivores for each tree species. Furthermore, seed transects under A. chaplasha show that arboreal frugivores discard seeds only a short distance from the parental tree, underscoring the elephant's role as a long-distance disperser. Our data provide unprecedented support for an old notion: megaherbivores may be key dispersers for a broad set of mammal-dispersed fruiting species, and not just fruit inaccessible to smaller frugivores. As such, the elephant may be particularly important for the functional ecology of the disturbed forests it still inhabits across tropical Asia.
Resumo:
In our previous report on resonance energy transfer from a dye molecule to graphene [J. Chem. Phys.129, 054703 (2008)], we had derived an expression for the rate of energy transfer from a dye to graphene. An integral in the expression for the rate was evaluated approximately. We found a Yuwaka-type dependence of the rate on the distance. We now present an exact evaluation of the integral involved, leading to very interesting results. For short distances (z < 20 A), the present rate and the previous rate are in good agreement. For larger distances, the rate is found to have a z(-4) dependence on the distance, exactly. Thus we predict that for the case of pyrene on graphene, it is possible to observe fluorescence quenching up to a distance of 300 A. This is in sharp contrast to the traditional fluorescence resonance energy transfer where the quenching is observable only up to 100 A.
Resumo:
Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).
Resumo:
The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.
Resumo:
In this paper, we have studied electroencephalogram (EEG) activity of schizophrenia patients, in resting eyes closed condition, with detrended fluctuation analysis (DFA). The DFA gives information about scaling and long-range correlations in time series. We computed DFA exponents from 30 scalp locations of 18 male neuroleptic-naIve, recent-onset schizophrenia (NRS) subjects and 15 healthy male control subjects. Our results have shown two scaling regions in all the scalp locations in all the subjects, with different slopes, corresponding to two scaling exponents. No significant differences between the groups were found with first scaling exponent (short-range). However, the second scaling exponent (long-range) were significantly lower in control subjects at all scalp locations (p<0.05, Kruskal-Wallis test). These findings suggest that the long-range scaling behavior of EEG is sensitive to schizophrenia, and this may provide an additional insight into the brain dysfunction in schizophrenia.
Resumo:
Electron transfer is an essential activity in biological systems. The migrating electron originates from water-oxygen in photosynthesis and reverts to dioxygen in respiration. In this cycle two metal porphyrin complexes possessing circular conjugated system and macrocyclic pi-clouds, chlorophyll and hems, play a decisive role in mobilising electrons for travel over biological structures as extraneous electrons. Transport of electrons within proteins (as in cytochromes) and within DNA (during oxidative damage and repair) is known to occur. Initial evaluations did not favour formation of semiconducting pathways of delocalized electrons of the peptide bonds in proteins and of the bases in nucleic acids. Direct measurement of conductivity of bulk material and quantum chemical calculations of their polymeric structures also did not support electron transfer in both proteins and nucleic acids. New experimental approaches have revived interest in the process of charge transfer through DNA duplex. The fluorescence on photoexcitation of Ru-complex was found to be quenched by Rh-complex, when both were tethered to DNA and intercalated in the base stack. Similar experiments showed that damage to G-bases and repair of T-T dimers in DNA can occur by possible long range electron transfer through the base stack. The novelty of this phenomenon prompted the apt name, chemistry at a distance. Based on experiments with ruthenium modified proteins, intramolecular electron transfer in proteins is now proposed to use pathways that include C-C sigma-bonds and surprisingly hydrogen bonds which remained out of favour for a long time. In support of this, some experimental evidence is now available showing that hydrogen bond-bridges facilitate transfer of electrons between metal-porphyrin complexes. By molecular orbital calculations over 20 years ago. we found that "delocalization of an extraneous electron is pronounced when it enters low-lying virtual orbitals of the electronic structures of peptide units linked by hydrogen bonds". This review focuses on supramolecular electron transfer pathways that can emerge on interlinking by hydrogen bonds and metal coordination of some unnoticed structures with pi-clouds in proteins and nucleic acids, potentially useful in catalysis and energy missions.
Resumo:
A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.
Resumo:
In this paper, the performance of distance relays when applied to transmission system equipped with shunt FACTS device, Static Synchronous Compensator (STATCOM) is described. The aim of the proposed study is to evaluate the performance of distance relays when STATCOM is incorporated at the mid point of transmission lines for voltage control. A detailed model of STATCOM and its control strategy is presented. The presence of these devices significantly affects apparent impedance seen by the distance relays due to their rapid response to different power system configurations. The distance relay is evaluated for different loading conditions and for different fault locations. The faults are created during various pre-fault loading conditions. The studies are performed on 400KV and 132KV systems and the results are presented. Simulation studies are carried out using transient simulation software, PSCAD/EMTDC.
Resumo:
Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into a mesh topology. In a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.
Resumo:
In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a certain throughput measure in bit-metres/sec, subject to average network power constraints. The mobility of nodes is restricted to a circular periphery area centered at the nominal location of nodes. We incorporate only randomly varying path-loss characteristics of channel gain due to the random motion of nodes, excluding any multi-path fading or shadowing effects. Computation of the throughput metric in such a scenario leads us to compute the probability density function of random distance between points in two circles. Using numerical analysis we discover that choosing the nearest node as next hop is not always optimal. Optimal throughput performance is also attained at non-trivial hop distances depending on the available average network power.