996 resultados para comemmorative’s dates


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A granodiorite from Akilia, southwest Greenland, previously suggested to date putative life-bearing rocks to greater than or equal to3.84 Ga, is re-investigated using whole-rock major and trace-element geochemistry, and detailed cathodoluminescence image-guided secondary ion mass spectrometer analyses of zircon U-Th-Pb and rare earth elements. Complex zircon internal structure reveals three episodes of zircon growth and/or recrystallization dated to c. 3.84 Ga, 3.62 Ga and 2.71 Ga. Rare earth element abundances imply a significant role for garnet in zircon generation at 3.62 Ga and 2.71 Ga. The 3.62 Ga event is interpreted as partial melting of a c. 3.84 Ga grey gneiss precursor at granulite facies with residual garnet. Migration of this 3.62 Ga magma (or melt-crystal mush) away from the melt source places a maximum age limit on any intrusive relationship. These early Archaean relationships have been complicated further by isotopic reworking in the 2.71 Ga event, which could have included a further episode of partial melting. This study highlights a general problem associated with dating thin gneissic veins in polyphase metamorphic terranes, where field relationships may be ambiguous and zircon inheritance can be expected.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A heuristic for batching orders in a manual order-picking warehouse has been developed. It prioritizes orders based on due time to prevent mixing of orders of different priority levels. The order density of aisles criterion is used to form batches. It also determines the number of pickers required and assigns batches to pickers such that there is a uniform workload per unit of time. The effectiveness of the heuristic was studied by observing computational time and aisle congestion for various numbers of total orders and number of orders that form a batch. An initial heuristic performed well for small number of orders, but for larger number of orders, a partitioning technique is computationally more efficient, needing only minutes to solve for thousands of orders, while preserving 90% of the batch quality obtained with the original heuristic. Comparative studies between the heuristic and other published heuristics are needed. ^