Abstract-Recent research in sensor networks, wireless location systems, and power-saving in ad hoc networks suggests that some applications' wireless traffic be modeled as an event-driven workload: a workload where many nodes send traffic at the time of an event, not all reports of the event are needed by higher level protocols and applications, and events occur infrequently relative to the time needed to deliver all required event reports. We identify several applications that motivate the event-driven workload and propose a protocol that is optimal for this workload.Our proposed protocol, named CSMA , is nonpersistent carrier sense multiple access (CSMA) with a carefully chosen nonuniform probability distribution that nodes use to randomly select contention slots. We show that CSMA is optimal in the sense that is the unique probability distribution that minimizes collisions between contending stations. CSMA has knowledge of . We conclude with an exploration of how could be used to build a more practical medium access control protocol via a probability distribution with no knowledge of that approximates .Index Terms-Carrier sense multiple access (CSMA), medium access control (MAC), nonpersistent, performance, poisson process, sensor networks.
In any caching system, the admission and eviction policies determine which contents are added and removed from a cache when a miss occurs. Usually, these policies are devised so as to mitigate staleness and increase the hit probability. Nonetheless, the utility of having a high hit probability can vary across contents. This occurs, for instance, when service level agreements must be met, or if certain contents are more difficult to obtain than others. In this paper, we propose utility-driven caching, where we associate with each content a utility, which is a function of the corresponding content hit probability. We formulate optimization problems where the objectives are to maximize the sum of utilities over all contents. These problems differ according to the stringency of the cache capacity constraint. Our framework enables us to reverse engineer classical replacement policies such as LRU and FIFO, by computing the utility functions that they maximize. We also develop online algorithms that can be used by service providers to implement various caching policies based on arbitrary utility functions.
Macroinvertebrates that are collected in large numbers pose major problems in basic and applied biodiversity research: identification to species via morphology is often difficult, slow and/or expensive. DNA barcodes are an attractive alternative or complementary source of information. Unfortunately, obtaining DNA barcodes from specimens requires many steps and thus time and money. Here, we promote a short cut to DNA barcoding, that is, a nondestructive PCR method that skips DNA extraction ('direct PCR') and that can be used for a broad range of invertebrate taxa. We demonstrate how direct PCR can be optimized for the larvae and adults of nonbiting midges (Diptera: Chironomidae), a typical invertebrate group that is abundant, contains important bioindicator species, but is difficult to identify based on morphological features. After optimization, direct PCR yields high PCR success rates (>90%), preserves delicate morphological features (e.g. details of genitalia, and larval head capsules) while allowing for the recovery of genomic DNA. We also document that direct PCR can be successfully optimized for a wide range of other invertebrate taxa that need routine barcoding (flies: Culicidae, Drosophilidae, Dolichopodidae, Sepsidae; sea stars: Oreasteridae). Key for obtaining high PCR success rates is optimizing (i) tissue quantity, (ii) body part, (iii) primer pair and (iv) type of Taq polymerase. Unfortunately, not all invertebrates appear suitable because direct PCR has low success rates for other taxa that were tested (e.g. Coleoptera: Dytiscidae, Copepoda, Hymenoptera: Formicidae and Odonata). It appears that the technique is less successful for heavily sclerotized insects and/or those with many exocrine glands.
An analytic model is used to study the performance of dynamic locking. The analysis uses only the steady-state average values of the variables. The solution to the model is given by a cubic, which has exactly one valid root for the range of parametric values that is of interest. The model's predictions agree well with simulation results for transactions that require up to twenty locks. The model separates data contention from resource contention, thus facilitating an analysis of their separate effects and their interaction. It shows that systems with a particular form of nonuniform access, or with shared locks, are equivalent to systems with uniform access and only exclusive locks. Blocking due to conflicts is found to impose an upper bound on transaction throughput; this fact leads to a rule of thumb on how much data contention should be permitted in a system. Throughput can exceed this bound if a transaction is restarted whenever it encounters a conflict, provided restart costs and resource contention are low. It can also be exceeded by making transactions predeclare their locks. Raising the multiprogramming level to increase throughput also raises the number of restarts per completion. Transactions should minimize their lock requests, because data contention is proportional to the square of the number of requests. The choice of how much data to lock at a time depends on which part of a general granularity curve the system sees.
No abstract
Freshwater habitats are of high conservation value and provide a wide range of ecosystem services. Effective management requires regular monitoring. However, conventional methods based on direct observation or specimen collection are so invasive, expensive and labour-intensive that frequent monitoring is uncommon. Here, we test whether the evaluation of environmental DNA (eDNA) from water based on a simple protocol can be used for assessing biodiversity. We use universal metazoan primers for characterizing water eDNA across horizontal and vertical spatial dimensions in two reservoirs with known species diversity for two key taxa. eDNA obtained directly from 42 samples × 15 ml water (total = 630 ml) per reservoir yielded DNA signatures for more than 500 metazoan species, of which 105 could be identified to species/genus based on DNA barcodes. We show that eDNA can be used to assign each water sample to its reservoir of origin, and that eDNA outperforms conventional survey methods in single-sample richness comparisons, while revealing evidence for hundreds of unknown species that are undetected by conventional bioassessment methods. eDNA also confirms the presence of a recently discovered invasive snail species and provides evidence for the continued survival of a rare native species of goby not sighted in that habitat since 2007. eDNA thus promises to be a useful addition to the bioassessment toolbox for freshwater systems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.