932 resultados para Information dispersal algorithm


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Stage-structured models that integrate demography and dispersal can be used to identify points in the life cycle with large effects on rates of population spatial spread, information that is vital in the development of containment strategies for invasive species. Current challenges in the application of these tools include: (1) accounting for large uncertainty in model parameters, which may violate assumptions of ‘‘local’’ perturbation metrics such as sensitivities and elasticities, and (2) forecasting not only asymptotic rates of spatial spread, as is usually done, but also transient spatial dynamics in the early stages of invasion. We developed an invasion model for the Diaprepes root weevil (DRW; Diaprepes abbreviatus [Coleoptera: Curculionidae]), a generalist herbivore that has invaded citrus-growing regions of the United States. We synthesized data on DRW demography and dispersal and generated predictions for asymptotic and transient peak invasion speeds, accounting for parameter uncertainty. We quantified the contributions of each parameter toward invasion speed using a ‘‘global’’ perturbation analysis, and we contrasted parameter contributions during the transient and asymptotic phases. We found that the asymptotic invasion speed was 0.02–0.028 km/week, although the transient peak invasion speed (0.03– 0.045 km/week) was significantly greater. Both asymptotic and transient invasions speeds were most responsive to weevil dispersal distances. However, demographic parameters that had large effects on asymptotic speed (e.g., survival of early-instar larvae) had little effect on transient speed. Comparison of the global analysis with lower-level elasticities indicated that local perturbation analysis would have generated unreliable predictions for the responsiveness of invasion speed to underlying parameters. Observed range expansion in southern Florida (1992–2006) was significantly lower than the invasion speed predicted by the model. Possible causes of this mismatch include overestimation of dispersal distances, demographic rates, and spatiotemporal variation in parameter values. This study demonstrates that, when parameter uncertainty is large, as is often the case, global perturbation analyses are needed to identify which points in the life cycle should be targets of management. Our results also suggest that effective strategies for reducing spread during the asymptotic phase may have little effect during the transient phase. Includes Appendix.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Walking on irregular surfaces and in the presence of unexpected events is a challenging problem for bipedal machines. Up to date, their ability to cope with gait disturbances is far less successful than humans': Neither trajectory controlled robots, nor dynamic walking machines (Limit CycleWalkers) are able to handle them satisfactorily. On the contrary, humans reject gait perturbations naturally and efficiently relying on their sensory organs that, if needed, elicit a recovery action. A similar approach may be envisioned for bipedal robots and exoskeletons: An algorithm continuously observes the state of the walker and, if an unexpected event happens, triggers an adequate reaction. This paper presents a monitoring algorithm that provides immediate detection of any type of perturbation based solely on a phase representation of the normal walking of the robot. The proposed method was evaluated in a Limit Cycle Walker prototype that suffered push and trip perturbations at different moments of the gait cycle, providing 100% successful detections for the current experimental apparatus and adequately tuned parameters, with no false positives when the robot is walking unperturbed.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Questions What are the main features of the seed rain in a fragmented Atlantic forest landscape? Can seed rain species attributes (life form, dispersal mode, successional status) relate to the spatial arrangement (size and number of fragments, edge density and presence of corridor) of forest fragments in the landscape? How does the rain forest landscape structure affect the seed rain? Location Atlantic rainforest, Sao Paulo State, Southeastern Brazil. Methods Seed rain samples were collected monthly throughout 1yr, counted, identified and classified according to species dispersal mode, successional status and life form. Seed rain composition was compared with woody species near the seed traps. Relationships between seed rain composition and landscape spatial arrangement (fragment area, presence of corridor, number of fragments in the surroundings, proximity of fragments, and edge density) were tested using canonical correspondence analysis (CCA). Results We collected 20142 seeds belonging to 115 taxa, most of them early successional and anemochorous trees. In general, the seed rain had a species composition distinct from that of the nearby forest tree community. Small isolated fragments contained more seeds, mainly of anemochorous, epiphytic and early-successional species; large fragments showed higher association with zoochorous and late-successional species compared to small fragments. The CCA significantly distinguished the species dispersal mode according to fragment size and isolation, anemochorous species being associated to small and isolated fragments, and zoochorous species to larger areas and fragment aggregation. Nevertheless, a gradient driven by proximity (PROX) and edge density (ED) segregated lianas (in the positive extremity), early successional and epiphyte species (in the negative end); large fragments were positively associated to PROX and ED. Conclusions The results highlight the importance of the size and spatial arrangement of forest patches to promote habitat connectivity and improve the flux of animal-dispersed seeds. Landscape structure controls seed fluxes and affects plant dispersal capacity, potentially influencing the composition and structure of forest fragments. The seed rain composition may be used to assess the effects of landscape spatial structure on plant assemblages, and provide relevant information for biodiversity conservation.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Abstract Background Once multi-relational approach has emerged as an alternative for analyzing structured data such as relational databases, since they allow applying data mining in multiple tables directly, thus avoiding expensive joining operations and semantic losses, this work proposes an algorithm with multi-relational approach. Methods Aiming to compare traditional approach performance and multi-relational for mining association rules, this paper discusses an empirical study between PatriciaMine - an traditional algorithm - and its corresponding multi-relational proposed, MR-Radix. Results This work showed advantages of the multi-relational approach in performance over several tables, which avoids the high cost for joining operations from multiple tables and semantic losses. The performance provided by the algorithm MR-Radix shows faster than PatriciaMine, despite handling complex multi-relational patterns. The utilized memory indicates a more conservative growth curve for MR-Radix than PatriciaMine, which shows the increase in demand of frequent items in MR-Radix does not result in a significant growth of utilized memory like in PatriciaMine. Conclusion The comparative study between PatriciaMine and MR-Radix confirmed efficacy of the multi-relational approach in data mining process both in terms of execution time and in relation to memory usage. Besides that, the multi-relational proposed algorithm, unlike other algorithms of this approach, is efficient for use in large relational databases.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This thesis presents some different techniques designed to drive a swarm of robots in an a-priori unknown environment in order to move the group from a starting area to a final one avoiding obstacles. The presented techniques are based on two different theories used alone or in combination: Swarm Intelligence (SI) and Graph Theory. Both theories are based on the study of interactions between different entities (also called agents or units) in Multi- Agent Systems (MAS). The first one belongs to the Artificial Intelligence context and the second one to the Distributed Systems context. These theories, each one from its own point of view, exploit the emergent behaviour that comes from the interactive work of the entities, in order to achieve a common goal. The features of flexibility and adaptability of the swarm have been exploited with the aim to overcome and to minimize difficulties and problems that can affect one or more units of the group, having minimal impact to the whole group and to the common main target. Another aim of this work is to show the importance of the information shared between the units of the group, such as the communication topology, because it helps to maintain the environmental information, detected by each single agent, updated among the swarm. Swarm Intelligence has been applied to the presented technique, through the Particle Swarm Optimization algorithm (PSO), taking advantage of its features as a navigation system. The Graph Theory has been applied by exploiting Consensus and the application of the agreement protocol with the aim to maintain the units in a desired and controlled formation. This approach has been followed in order to conserve the power of PSO and to control part of its random behaviour with a distributed control algorithm like Consensus.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In this paper we propose a variational approach for multimodal image registration based on the diffeomorphic demons algorithm. Diffeomorphic demons has proven to be a robust and efficient way for intensity-based image registration. However, the main drawback is that it cannot deal with multiple modalities. We propose to replace the standard demons similarity metric (image intensity differences) by point-wise mutual information (PMI) in the energy function. By comparing the accuracy between our PMI based diffeomorphic demons and the B-Spline based free-form deformation approach (FFD) on simulated deformations, we show the proposed algorithm performs significantly better.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

INTRODUCTION: Guidelines for the treatment of patients in severe hypothermia and mainly in hypothermic cardiac arrest recommend the rewarming using the extracorporeal circulation (ECC). However,guidelines for the further in-hospital diagnostic and therapeutic approach of these patients, who often suffer from additional injuries—especially in avalanche casualties, are lacking. Lack of such algorithms may relevantly delay treatment and put patients at further risk. Together with a multidisciplinary team, the Emergency Department at the University Hospital in Bern, a level I trauma centre, created an algorithm for the in-hospital treatment of patients with hypothermic cardiac arrest. This algorithm primarily focuses on the decision-making process for the administration of ECC. THE BERNESE HYPOTHERMIA ALGORITHM: The major difference between the traditional approach, where all hypothermic patients are primarily admitted to the emergency centre, and our new algorithm is that hypothermic cardiac arrest patients without obvious signs of severe trauma are taken to the operating theatre without delay. Subsequently, the interdisciplinary team decides whether to rewarm the patient using ECC based on a standard clinical trauma assessment, serum potassium levels, core body temperature, sonographic examinations of the abdomen, pleural space, and pericardium, as well as a pelvic X-ray, if needed. During ECC, sonography is repeated and haemodynamic function as well as haemoglobin levels are regularly monitored. Standard radiological investigations according to the local multiple trauma protocol are performed only after ECC. Transfer to the intensive care unit, where mild therapeutic hypothermia is maintained for another 12 h, should not be delayed by additional X-rays for minor injuries. DISCUSSION: The presented algorithm is intended to facilitate in-hospital decision-making and shorten the door-to-reperfusion time for patients with hypothermic cardiac arrest. It was the result of intensive collaboration between different specialties and highlights the importance of high-quality teamwork for rare cases of severe accidental hypothermia. Information derived from the new International Hypothermia Registry will help to answer open questions and further optimize the algorithm.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Successful software systems cope with complexity by organizing classes into packages. However, a particular organization may be neither straightforward nor obvious for a given developer. As a consequence, classes can be misplaced, leading to duplicated code and ripple effects with minor changes effecting multiple packages. We claim that contextual information is the key to rearchitecture a system. Exploiting contextual information, we propose a technique to detect misplaced classes by analyzing how client packages access the classes of a given provider package. We define locality as a measure of the degree to which classes reused by common clients appear in the same package. We then use locality to guide a simulated annealing algorithm to obtain optimal placements of classes in packages. The result is the identification of classes that are candidates for relocation. We apply the technique to three applications and validate the usefulness of our approach via developer interviews.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

This paper presents a fully Bayesian approach that simultaneously combines basic event and statistically independent higher event-level failure data in fault tree quantification. Such higher-level data could correspond to train, sub-system or system failure events. The full Bayesian approach also allows the highest-level data that are usually available for existing facilities to be automatically propagated to lower levels. A simple example illustrates the proposed approach. The optimal allocation of resources for collecting additional data from a choice of different level events is also presented. The optimization is achieved using a genetic algorithm.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Abstract  Xyleborini are a species-rich tribe of ambrosia beetles, which are haplodiploid and typically mate among siblings within their natal brood chamber. Several characteristics of this tribe would predict the evolution of higher levels of sociality: high genetic relatedness within galleries due to inbreeding, high costs of dispersal and the potential benefit of cooperation in brood care within the natal gallery (e.g. by fungus gardening, gallery extension, offspring feeding and cleaning). However, information on the social system of these beetles is very limited. We examined the potential for cooperative breeding in Xyleborinus saxeseni by monitoring dispersal in relation to brood size and composition. Results show that adult female offspring delay dispersal despite dispersal opportunities, and apparently some females never disperse. The femalesâ?? decision to stay seems to depend on the presence of eggs and dependent siblings. We found no indication that female offspring reproduce in their natal gallery, as colonies with many mature daughters do not contain more eggs than those with few or no daughters. There is a significant positive relationship between the number of females present and the number of dependent siblings (but not eggs), which suggests that cooperative brood care of female offspring raises colony productivity by improving survival rates of immatures. Our results suggest that cooperative breeding is likely to occur in X. saxeseni and possibly other xyleborine species. We argue that a closer look at sociality within this tribe may yield important information on the factors determining the evolution of cooperative breeding and advanced social organization.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Three-dimensional flow visualization plays an essential role in many areas of science and engineering, such as aero- and hydro-dynamical systems which dominate various physical and natural phenomena. For popular methods such as the streamline visualization to be effective, they should capture the underlying flow features while facilitating user observation and understanding of the flow field in a clear manner. My research mainly focuses on the analysis and visualization of flow fields using various techniques, e.g. information-theoretic techniques and graph-based representations. Since the streamline visualization is a popular technique in flow field visualization, how to select good streamlines to capture flow patterns and how to pick good viewpoints to observe flow fields become critical. We treat streamline selection and viewpoint selection as symmetric problems and solve them simultaneously using the dual information channel [81]. To the best of my knowledge, this is the first attempt in flow visualization to combine these two selection problems in a unified approach. This work selects streamline in a view-independent manner and the selected streamlines will not change for all viewpoints. My another work [56] uses an information-theoretic approach to evaluate the importance of each streamline under various sample viewpoints and presents a solution for view-dependent streamline selection that guarantees coherent streamline update when the view changes gradually. When projecting 3D streamlines to 2D images for viewing, occlusion and clutter become inevitable. To address this challenge, we design FlowGraph [57, 58], a novel compound graph representation that organizes field line clusters and spatiotemporal regions hierarchically for occlusion-free and controllable visual exploration. We enable observation and exploration of the relationships among field line clusters, spatiotemporal regions and their interconnection in the transformed space. Most viewpoint selection methods only consider the external viewpoints outside of the flow field. This will not convey a clear observation when the flow field is clutter on the boundary side. Therefore, we propose a new way to explore flow fields by selecting several internal viewpoints around the flow features inside of the flow field and then generating a B-Spline curve path traversing these viewpoints to provide users with closeup views of the flow field for detailed observation of hidden or occluded internal flow features [54]. This work is also extended to deal with unsteady flow fields. Besides flow field visualization, some other topics relevant to visualization also attract my attention. In iGraph [31], we leverage a distributed system along with a tiled display wall to provide users with high-resolution visual analytics of big image and text collections in real time. Developing pedagogical visualization tools forms my other research focus. Since most cryptography algorithms use sophisticated mathematics, it is difficult for beginners to understand both what the algorithm does and how the algorithm does that. Therefore, we develop a set of visualization tools to provide users with an intuitive way to learn and understand these algorithms.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

An algorithm, based on ‘vertex priority values’ has been proposed to uniquely sequence and represent connectivity matrix of chemical structures of cyclic/ acyclic functionalized achiral hydrocarbons and their derivatives. In this method ‘vertex priority values’ have been assigned in terms of atomic weights, subgraph lengths, loops, and heteroatom contents. Subsequently the terminal vertices have been considered upon completing the sequencing of the core vertices. This approach provides a multilayered connectivity graph, which can be put to use in comparing two or more structures or parts thereof for any given purpose. Furthermore the basic vertex connection tables generated here are useful in the computation of characteristic matrices/ topological indices, automorphism groups, and in storing, sorting and retrieving of chemical structures from databases.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

PURPOSE To extend the capabilities of the Cone Location and Magnitude Index algorithm to include a combination of topographic information from the anterior and posterior corneal surfaces and corneal thickness measurements to further improve our ability to correctly identify keratoconus using this new index: ConeLocationMagnitudeIndex_X. DESIGN Retrospective case-control study. METHODS Three independent data sets were analyzed: 1 development and 2 validation. The AnteriorCornealPower index was calculated to stratify the keratoconus data from mild to severe. The ConeLocationMagnitudeIndex algorithm was applied to all tomography data collected using a dual Scheimpflug-Placido-based tomographer. The ConeLocationMagnitudeIndex_X formula, resulting from analysis of the Development set, was used to determine the logistic regression model that best separates keratoconus from normal and was applied to all data sets to calculate PercentProbabilityKeratoconus_X. The sensitivity/specificity of PercentProbabilityKeratoconus_X was compared with the original PercentProbabilityKeratoconus, which only uses anterior axial data. RESULTS The AnteriorCornealPower severity distribution for the combined data sets are 136 mild, 12 moderate, and 7 severe. The logistic regression model generated for ConeLocationMagnitudeIndex_X produces complete separation for the Development set. Validation Set 1 has 1 false-negative and Validation Set 2 has 1 false-positive. The overall sensitivity/specificity results for the logistic model produced using the ConeLocationMagnitudeIndex_X algorithm are 99.4% and 99.6%, respectively. The overall sensitivity/specificity results for using the original ConeLocationMagnitudeIndex algorithm are 89.2% and 98.8%, respectively. CONCLUSIONS ConeLocationMagnitudeIndex_X provides a robust index that can detect the presence or absence of a keratoconic pattern in corneal tomography maps with improved sensitivity/specificity from the original anterior surface-only ConeLocationMagnitudeIndex algorithm.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A nonlinear viscoelastic image registration algorithm based on the demons paradigm and incorporating inverse consistent constraint (ICC) is implemented. An inverse consistent and symmetric cost function using mutual information (MI) as a similarity measure is employed. The cost function also includes regularization of transformation and inverse consistent error (ICE). The uncertainties in balancing various terms in the cost function are avoided by alternatively minimizing the similarity measure, the regularization of the transformation, and the ICE terms. The diffeomorphism of registration for preventing folding and/or tearing in the deformation is achieved by the composition scheme. The quality of image registration is first demonstrated by constructing brain atlas from 20 adult brains (age range 30-60). It is shown that with this registration technique: (1) the Jacobian determinant is positive for all voxels and (2) the average ICE is around 0.004 voxels with a maximum value below 0.1 voxels. Further, the deformation-based segmentation on Internet Brain Segmentation Repository, a publicly available dataset, has yielded high Dice similarity index (DSI) of 94.7% for the cerebellum and 74.7% for the hippocampus, attesting to the quality of our registration method.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Upon leaving their natal area, dispersers are confronted with unknown terrains. Species-specific perceptual ranges (i.e. the maximum distance from which an individual can perceive landscape features) play a crucial role in spatial movement decisions during such wanderings. In nocturnal animals that rely on vision, perceptual range is dramatically enhanced during moonlight, compared to moonless conditions. This increase of the perceptual range is an overlooked element that may be responsible for the successful crossing of unfamiliar areas during dispersal. The information gathered from 143 radio-tagged eagle owl Bubo bubo juveniles in Spain, Finland and Switzerland shows that, although the decision to initiate dispersal is mainly an endogenous phenomenon determined by the attainment of a given age (∼6 months), dispersers leave their birthplace primarily under the best light conditions at night, i.e. when most of the lunar disc is illuminated. This sheds new light into the mechanisms that may trigger dispersal from parental territory.