5 resultados para data movement problem

em DigitalCommons@University of Nebraska - Lincoln


Relevância:

30.00% 30.00%

Publicador:

Resumo:

The recent likely extinction of the baiji (Chinese river dolphin [Lipotes vexillifer]) (Turvey et al. 2007) makes the vaquita (Gulf of California porpoise [Phocoena sinus]) the most endangered cetacean. The vaquita has the smallest range of any porpoise, dolphin, or whale and, like the baiji, has long been threatened primarily by accidental deaths in fishing gear (bycatch) (Rojas-Bracho et al. 2006). Despite repeated recommendations from scientific bodies and conservation organizations, no effective actions have been taken to remove nets from the vaquita’s environment. Here, we address three questions that are important to vaquita conservation: (1) How many vaquitas remain? (2) How much time is left to find a solution to the bycatch problem? and (3) Are further abundance surveys or bycatch estimates needed to justify the immediate removal of all entangling nets from the range of the vaquita? Our answers are, in short: (1) there are about 150 vaquitas left, (2) there are at most 2 years within which to find a solution, and (3) further abundance surveys or bycatch estimates are not needed. The answers to the first two questions make clear that action is needed now, whereas the answer to the last question removes the excuse of uncertainty as a delay tactic. Herein we explain our reasoning.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this action research study of my classroom of 8th grade mathematics, I investigated the use of daily warm-ups written in problem-solving format. Data was collected to determine if use of such warm-ups would have an effect on students’ abilities to problem solve, their overall attitudes regarding problem solving and whether such an activity could also enhance their readiness each day to learn new mathematics concepts. It was also my hope that this practice would have some positive impact on maximizing the amount of time I have with my students for math instruction. I discovered that daily exposure to problem-solving practices did impact the students’ overall abilities and achievement (though sometimes not positively) and similarly the students’ attitudes showed slight changes as well. It certainly seemed to improve their readiness for the day’s lesson as class started in a more timely manner and students were more actively involved in learning mathematics (or perhaps working on mathematics) than other classes not involved in the research. As a result of this study, I plan to continue using daily warm-ups and problem-solving (perhaps on a less formal or regimented level) and continue gathering data to further determine if this methodology can be useful in improving students’ overall mathematical skills, abilities and achievement.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Wildlife biologists are often interested in how an animal uses space and the habitat resources within that space. We propose a single model that estimates an animal’s home range and habitat selection parameters within that range while accounting for the inherent autocorrelation in frequently sampled telemetry data. The model is applied to brown bear telemetry data in southeast Alaska.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We propose a general framework for the analysis of animal telemetry data through the use of weighted distributions. It is shown that several interpretations of resource selection functions arise when constructed from the ratio of a use and availability distribution. Through the proposed general framework, several popular resource selection models are shown to be special cases of the general model by making assumptions about animal movement and behavior. The weighted distribution framework is shown to be easily extended to readily account for telemetry data that are highly auto-correlated; as is typical with use of new technology such as global positioning systems animal relocations. An analysis of simulated data using several models constructed within the proposed framework is also presented to illustrate the possible gains from the flexible modeling framework. The proposed model is applied to a brown bear data set from southeast Alaska.