23 resultados para maximum de vraisemblance


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The degree to which Southern Hemisphere climatic changes during the end of the last glacial period and early Holocene (30-8 ka) were influenced or initiated by events occurring in the high latitudes of the Northern Hemisphere is a complex issue. There is conflicting evidence for the degree of hemispheric 'teleconnection' and an unresolved debate as to the principle forcing mechanism(s). The available hypotheses are difficult to test robustly, however, because the few detailed palaeoclimatic records in the Southern Hemisphere are widely dispersed and lack duplication. Here we present climatic and environmental reconstructions from across Australia, a key region of the Southern Hemisphere because of the range of environments it covers and the potentially important role regional atmospheric and oceanic controls play in global climate change. We identify a general scheme of events for the end of the last glacial period and early Holocene but a detailed reconstruction proved problematic. Significant progress in climate quantification and geochronological control is now urgently required to robustly investigate change through this period. Copyright (c) 2006 John Wiley & Sons, Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Very little information or research is available about the operation of Maximum Security Units (MSUs) in Queensland prisons. These units were developed within existing prisons in the early 1980s to deal with the incarceration of prisoners considered to be the worst and highest risk. Drawing on a number of interviews with prison visitors and on published documents and cases, this article examines the purpose and possible shortcomings of MSUs in Queensland in light of the Standard Guidelines for Corrections in Australia (1996).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a novel, maximum-likelihood (ML), lattice-decoding algorithm for noncoherent block detection of QAM signals. The computational complexity is polynomial in the block length; making it feasible for implementation compared with the exhaustive search ML detector. The algorithm works by enumerating the nearest neighbor regions for a plane defined by the received vector; in a conceptually similar manner to sphere decoding. Simulations show that the new algorithm significantly outperforms existing approaches