3 resultados para Information dispersal algorithm

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


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.