18 resultados para BGP
Resumo:
Many public health agencies and researchers are interested in comparing hospital outcomes, for example, morbidity, mortality, and hospitalization across areas and hospitals. However, since there is variation of rates in clinical trials among hospitals because of several biases, we are interested in controlling for the bias and assessing real differences in clinical practices. In this study, we compared the variations between hospitals in rates of severe Intraventricular Haemorrhage (IVH) infant using Frequentist statistical approach vs. Bayesian hierarchical model through simulation study. The template data set for simulation study was included the number of severe IVH infants of 24 intensive care units in Australian and New Zealand Neonatal Network from 1995 to 1997 in severe IVH rate in preterm babies. We evaluated the rates of severe IVH for 24 hospitals with two hierarchical models in Bayesian approach comparing their performances with the shrunken rates in Frequentist method. Gamma-Poisson (BGP) and Beta-Binomial (BBB) were introduced into Bayesian model and the shrunken estimator of Gamma-Poisson (FGP) hierarchical model using maximum likelihood method were calculated as Frequentist approach. To simulate data, the total number of infants in each hospital was kept and we analyzed the simulated data for both Bayesian and Frequentist models with two true parameters for severe IVH rate. One was the observed rate and the other was the expected severe IVH rate by adjusting for five predictors variables for the template data. The bias in the rate of severe IVH infant estimated by both models showed that Bayesian models gave less variable estimates than Frequentist model. We also discussed and compared the results from three models to examine the variation in rate of severe IVH by 20th centile rates and avoidable number of severe IVH cases. ^
Resumo:
The Dissertation aimed to advance the geological knowledge of the Barcelona Granitic Pluton (BGP). This body is located in the eastern portion of the Rio Grande do Norte Domain (RND), within the São José do Campestre subdomain (SJC), NE of the Borborema Province. The main goal was to understand the geological evolution of the rocks of the pluton and the tectonic setting of magma generation and its emplacement. The BGP has an assumed Ediacaran age and outcropping area of approximately 260 km2, being composed of three varied petrographic/textural facies: (a) porphyritic biotite monzogranite; (b) dykes and sheets of biotite microgranite; (c) dioritic to quartz-dioritic enclaves. The rocks of the BGP have the following structures: (i) a NE-SW and NW-SE directed magmatic fabric (Sγ), accompanied by a magmatic lineation (Lγ) with gentle dip to NE-SW and NW-SE. In the southern portion, there is the concentric pattern of this foliation with medium to high dip, and (ii) a solid state foliation, in part mylonitic (S3+), mainly on the eastern edge with slightly plunging to west. The integration of structural and gravity data permitted to interpret the emplacement of the BGP as controlled by the transcurrent shear zones systems Lajes Pintadas (LPSZ) and Sítio Novo (SNSZ), both of dextral strike-slip kinematics. Mineral chemistry data show that the amphibole form the porphyritic biotite monzogranite facies is hastingsite with moderate Mg / (Mg + Fe) ratios, indicating crystallization under moderate to high ƒO2 and cristallization pressure of around 5.0-6.0 kbar. The biotite tends to be slightly richer in annite molecule and plots in the transitional field from primary biotite to reequilibrated biotite. In discriminant diagrams of magmatic series, the biotite behave like those of subalkaline affinity, consistent with the potassium calc-alkaline / sub-alkaline geochemical affinity of the hosting rock. The opaque minerals are primarily magnetite, with some crystals martitized to hematite indicating relatively oxidizing conditions during magma evolution that originated the BGP. Zoning in plagioclase, K-feldspar and allanite crystals suggest fractional crystallization process. Lithogeochemical data suggest that the facies described for the BGP have similar magma source, usually plotting in the fields and trends of the subalkaline / high potassium calc-alkaline series.
Resumo:
The Internet has grown in size at rapid rates since BGP records began, and continues to do so. This has raised concerns about the scalability of the current BGP routing system, as the routing state at each router in a shortest-path routing protocol will grow at a supra-linearly rate as the network grows. The concerns are that the memory capacity of routers will not be able to keep up with demands, and that the growth of the Internet will become ever more cramped as more and more of the world seeks the benefits of being connected. Compact routing schemes, where the routing state grows only sub-linearly relative to the growth of the network, could solve this problem and ensure that router memory would not be a bottleneck to Internet growth. These schemes trade away shortest-path routing for scalable memory state, by allowing some paths to have a certain amount of bounded “stretch”. The most promising such scheme is Cowen Routing, which can provide scalable, compact routing state for Internet routing, while still providing shortest-path routing to nearly all other nodes, with only slightly stretched paths to a very small subset of the network. Currently, there is no fully distributed form of Cowen Routing that would be practical for the Internet. This dissertation describes a fully distributed and compact protocol for Cowen routing, using the k-core graph decomposition. Previous compact routing work showed the k-core graph decomposition is useful for Cowen Routing on the Internet, but no distributed form existed. This dissertation gives a distributed k-core algorithm optimised to be efficient on dynamic graphs, along with with proofs of its correctness. The performance and efficiency of this distributed k-core algorithm is evaluated on large, Internet AS graphs, with excellent results. This dissertation then goes on to describe a fully distributed and compact Cowen Routing protocol. This protocol being comprised of a landmark selection process for Cowen Routing using the k-core algorithm, with mechanisms to ensure compact state at all times, including at bootstrap; a local cluster routing process, with mechanisms for policy application and control of cluster sizes, ensuring again that state can remain compact at all times; and a landmark routing process is described with a prioritisation mechanism for announcements that ensures compact state at all times.