954 resultados para decomposition rank


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The manner in which remains decompose has been and is currently being researched around the world, yet little is still known about the generated scent of death. In fact, it was not until the Casey Anthony trial that research on the odor released from decomposing remains, and the compounds that it is comprised of, was brought to light. The Anthony trial marked the first admission of human decomposition odor as forensic evidence into the court of law; however, it was not "ready for prime time" as the scientific research on the scent of death is still in its infancy. This research employed the use of solid-phase microextraction (SPME) with gas chromatography-mass spectrometry (GC-MS) to identify the volatile organic compounds (VOCs) released from decomposing remains and to assess the impact that different environmental conditions had on the scent of death. Using human cadaver analogues, it was discovered that the environment in which the remains were exposed to dramatically affected the odors released by either modifying the compounds that it was comprised of or by enhancing/hindering the amount that was liberated. In addition, the VOCs released during the different stages of the decomposition process for both human remains and analogues were evaluated. Statistical analysis showed correlations between the stage of decay and the VOCs generated, such that each phase of decomposition was distinguishable based upon the type and abundance of compounds that comprised the odor. This study has provided new insight into the scent of death and the factors that can dramatically affect it, specifically, frozen, aquatic, and soil environments. Moreover, the results revealed that different stages of decomposition were distinguishable based upon the type and total mass of each compound present. Thus, based upon these findings, it is suggested that the training aids that are employed for human remains detection (HRD) canines should 1) be characteristic of remains that have undergone decomposition in different environmental settings, and 2) represent each stage of decay, to ensure that the HRD canines have been trained to the various odors that they are likely to encounter in an operational situation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dimethyl methyl phosphonate (DMMP), diethyl methyl phosphonate (DEMP), and fluorophenols undergo rapid decomposition upon TiO2 catalyzed photooxidation in air saturated aqueous solution. The degradation rates of DMMP were determined over a range of temperatures, under solar and artificial irradiation with and without simultaneous sonication. Solar illumination is effective for the degradation and the use of low energy of sonication increases the rate of mineralization. The surface area and the type of TiO2 dramatically affect the photoactivity of the catalyst. A number of intermediate products are formed and ultimately oxidized to phosphate and carbon dioxide. Possible reaction mechanisms and pathways for DMMP and DEMP are proposed. The Langmuir- Hinshelwood kinetic parameters for the photocatalysis of fluorophenols suggest modestly different reactivity for each isomer. The adsorption constant is largest for the ortho isomer consistent with the adsorption onto TiO2 through both hydroxyl and fluoride groups to form a chelated type structure.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The RANK / RANKL / OPG sy stem plays an important role in bone formation and resorption . This finding has been regarded as one of the m ost important advances in the understanding of bone biology with respect to osteoclastogenesis. The aim of this study was to investigate the expression of RANKL / RANK / OPG markers in reimplanted t eeth of rats, and to observe the relationship between the expression of these markers and to oth and bone resorption. Thirty male Wistar rats (Rattus norvegicus albinos) had their maxillary right incisors extrac ted , and were divided into 2 groups according to the period that the extracted teeth were kept in dry air before reimplantation : G1 (n = 15) - 5 minutes , and G2 (n = 15) - 60 minutes . After reimplantation, teeth were analyzed at intervals of 1, 3 and 7 da ys. After these experimental periods, the animals were euthanized. Longitudinal sections with 5μm thick were obtained and stained with Hematoxylin and Eosin for histological analysis , while 3μm thick sections were subjected to immunohistochemical analysis of OPG , RANK and RANKL. The results showed that the RANK / RANKL / OPG system actively participates in both the repair process, as well as tooth and bone resorption . Extr a - alveolar time of 60 minutes before replantation caused minor expressions of RANKL a nd OPG, not influencing the expression of RANK; RANKL immunostaining showed higher in both groups when compared to other biomarkers, participating in all phases of bone and tooth resorption; RANKL was associated to both osteoclastogenesis and c ell ular proliferation , and was expressed in both groups.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Globally, consumers affect ecosystem processes including nutrient dynamics. Herbivores have been known to slow nutrient flow in boreal forest ecosystems. I examined the effects of introduced moose on disturbed forests of Newfoundland, Canada by conducting a field experiment during August - November 2014 in 20 paired moose exclosure-control plots. I tested whether moose browsing directly and indirectly affected forests by measuring plant species composition, litter quality and quantity, soil quality, and decomposition rates in areas moose exclosure-control plots. I analyzed moose effects using linear mixed effects models and found evidence indicating that moose reduce plant height and litter biomass affecting the availability of carbon, nitrogen, and phosphorus. However, plant diversity, soil quality, and litter decomposition did not differ between moose exclosures and controls. Moose in Newfoundland directly influence plant regeneration and litter biomass while indirect effects on soil ecosystems may be limited by time, disturbance, and climate.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Many modern applications fall into the category of "large-scale" statistical problems, in which both the number of observations n and the number of features or parameters p may be large. Many existing methods focus on point estimation, despite the continued relevance of uncertainty quantification in the sciences, where the number of parameters to estimate often exceeds the sample size, despite huge increases in the value of n typically seen in many fields. Thus, the tendency in some areas of industry to dispense with traditional statistical analysis on the basis that "n=all" is of little relevance outside of certain narrow applications. The main result of the Big Data revolution in most fields has instead been to make computation much harder without reducing the importance of uncertainty quantification. Bayesian methods excel at uncertainty quantification, but often scale poorly relative to alternatives. This conflict between the statistical advantages of Bayesian procedures and their substantial computational disadvantages is perhaps the greatest challenge facing modern Bayesian statistics, and is the primary motivation for the work presented here.

Two general strategies for scaling Bayesian inference are considered. The first is the development of methods that lend themselves to faster computation, and the second is design and characterization of computational algorithms that scale better in n or p. In the first instance, the focus is on joint inference outside of the standard problem of multivariate continuous data that has been a major focus of previous theoretical work in this area. In the second area, we pursue strategies for improving the speed of Markov chain Monte Carlo algorithms, and characterizing their performance in large-scale settings. Throughout, the focus is on rigorous theoretical evaluation combined with empirical demonstrations of performance and concordance with the theory.

One topic we consider is modeling the joint distribution of multivariate categorical data, often summarized in a contingency table. Contingency table analysis routinely relies on log-linear models, with latent structure analysis providing a common alternative. Latent structure models lead to a reduced rank tensor factorization of the probability mass function for multivariate categorical data, while log-linear models achieve dimensionality reduction through sparsity. Little is known about the relationship between these notions of dimensionality reduction in the two paradigms. In Chapter 2, we derive several results relating the support of a log-linear model to nonnegative ranks of the associated probability tensor. Motivated by these findings, we propose a new collapsed Tucker class of tensor decompositions, which bridge existing PARAFAC and Tucker decompositions, providing a more flexible framework for parsimoniously characterizing multivariate categorical data. Taking a Bayesian approach to inference, we illustrate empirical advantages of the new decompositions.

Latent class models for the joint distribution of multivariate categorical, such as the PARAFAC decomposition, data play an important role in the analysis of population structure. In this context, the number of latent classes is interpreted as the number of genetically distinct subpopulations of an organism, an important factor in the analysis of evolutionary processes and conservation status. Existing methods focus on point estimates of the number of subpopulations, and lack robust uncertainty quantification. Moreover, whether the number of latent classes in these models is even an identified parameter is an open question. In Chapter 3, we show that when the model is properly specified, the correct number of subpopulations can be recovered almost surely. We then propose an alternative method for estimating the number of latent subpopulations that provides good quantification of uncertainty, and provide a simple procedure for verifying that the proposed method is consistent for the number of subpopulations. The performance of the model in estimating the number of subpopulations and other common population structure inference problems is assessed in simulations and a real data application.

In contingency table analysis, sparse data is frequently encountered for even modest numbers of variables, resulting in non-existence of maximum likelihood estimates. A common solution is to obtain regularized estimates of the parameters of a log-linear model. Bayesian methods provide a coherent approach to regularization, but are often computationally intensive. Conjugate priors ease computational demands, but the conjugate Diaconis--Ylvisaker priors for the parameters of log-linear models do not give rise to closed form credible regions, complicating posterior inference. In Chapter 4 we derive the optimal Gaussian approximation to the posterior for log-linear models with Diaconis--Ylvisaker priors, and provide convergence rate and finite-sample bounds for the Kullback-Leibler divergence between the exact posterior and the optimal Gaussian approximation. We demonstrate empirically in simulations and a real data application that the approximation is highly accurate, even in relatively small samples. The proposed approximation provides a computationally scalable and principled approach to regularized estimation and approximate Bayesian inference for log-linear models.

Another challenging and somewhat non-standard joint modeling problem is inference on tail dependence in stochastic processes. In applications where extreme dependence is of interest, data are almost always time-indexed. Existing methods for inference and modeling in this setting often cluster extreme events or choose window sizes with the goal of preserving temporal information. In Chapter 5, we propose an alternative paradigm for inference on tail dependence in stochastic processes with arbitrary temporal dependence structure in the extremes, based on the idea that the information on strength of tail dependence and the temporal structure in this dependence are both encoded in waiting times between exceedances of high thresholds. We construct a class of time-indexed stochastic processes with tail dependence obtained by endowing the support points in de Haan's spectral representation of max-stable processes with velocities and lifetimes. We extend Smith's model to these max-stable velocity processes and obtain the distribution of waiting times between extreme events at multiple locations. Motivated by this result, a new definition of tail dependence is proposed that is a function of the distribution of waiting times between threshold exceedances, and an inferential framework is constructed for estimating the strength of extremal dependence and quantifying uncertainty in this paradigm. The method is applied to climatological, financial, and electrophysiology data.

The remainder of this thesis focuses on posterior computation by Markov chain Monte Carlo. The Markov Chain Monte Carlo method is the dominant paradigm for posterior computation in Bayesian analysis. It has long been common to control computation time by making approximations to the Markov transition kernel. Comparatively little attention has been paid to convergence and estimation error in these approximating Markov Chains. In Chapter 6, we propose a framework for assessing when to use approximations in MCMC algorithms, and how much error in the transition kernel should be tolerated to obtain optimal estimation performance with respect to a specified loss function and computational budget. The results require only ergodicity of the exact kernel and control of the kernel approximation accuracy. The theoretical framework is applied to approximations based on random subsets of data, low-rank approximations of Gaussian processes, and a novel approximating Markov chain for discrete mixture models.

Data augmentation Gibbs samplers are arguably the most popular class of algorithm for approximately sampling from the posterior distribution for the parameters of generalized linear models. The truncated Normal and Polya-Gamma data augmentation samplers are standard examples for probit and logit links, respectively. Motivated by an important problem in quantitative advertising, in Chapter 7 we consider the application of these algorithms to modeling rare events. We show that when the sample size is large but the observed number of successes is small, these data augmentation samplers mix very slowly, with a spectral gap that converges to zero at a rate at least proportional to the reciprocal of the square root of the sample size up to a log factor. In simulation studies, moderate sample sizes result in high autocorrelations and small effective sample sizes. Similar empirical results are observed for related data augmentation samplers for multinomial logit and probit models. When applied to a real quantitative advertising dataset, the data augmentation samplers mix very poorly. Conversely, Hamiltonian Monte Carlo and a type of independence chain Metropolis algorithm show good mixing on the same dataset.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The national shortage of helium-3 has made it critical to develop an alternative to helium-3 neutron detectors. Boron-10, if it could be produced in macroscopic alpha-rhombohedral crystalline form, would be a viable alternative to helium-3. This work has determined the critical parameters needed for the preparation of alpha-rhombohedral boron by the pyrolytic decomposition of boron tribromide on tantalum wire. The primary parameters that must be met are wire temperature and feedstock purity. The minimum purity level for boron tribromide was determined to be 99.999% and it has been found that alpha-rhombohedral boron cannot be produced using 99.99% boron tribromide. The decomposition temperature was experimentally tested between 830°C and 1000°C. Alpha-rhombohedral boron was found at temperatures between 950°C and 1000°C using 99.999% pure boron tribromide.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This material is based upon work supported by the National Science Foundation through the Florida Coastal Everglades Long-Term Ecological Research program under Cooperative Agreements #DBI-0620409 and #DEB-9910514. This image is made available for non-commercial or educational use only.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This material is based upon work supported by the National Science Foundation through the Florida Coastal Everglades Long-Term Ecological Research program under Cooperative Agreements #DBI-0620409 and #DEB-9910514. This image is made available for non-commercial or educational use only.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This material is based upon work supported by the National Science Foundation through the Florida Coastal Everglades Long-Term Ecological Research program under Cooperative Agreements #DBI-0620409 and #DEB-9910514. This image is made available for non-commercial or educational use only.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This material is based upon work supported by the National Science Foundation through the Florida Coastal Everglades Long-Term Ecological Research program under Cooperative Agreements #DBI-0620409 and #DEB-9910514. This image is made available for non-commercial or educational use only.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A scenario-based two-stage stochastic programming model for gas production network planning under uncertainty is usually a large-scale nonconvex mixed-integer nonlinear programme (MINLP), which can be efficiently solved to global optimality with nonconvex generalized Benders decomposition (NGBD). This paper is concerned with the parallelization of NGBD to exploit multiple available computing resources. Three parallelization strategies are proposed, namely, naive scenario parallelization, adaptive scenario parallelization, and adaptive scenario and bounding parallelization. Case study of two industrial natural gas production network planning problems shows that, while the NGBD without parallelization is already faster than a state-of-the-art global optimization solver by an order of magnitude, the parallelization can improve the efficiency by several times on computers with multicore processors. The adaptive scenario and bounding parallelization achieves the best overall performance among the three proposed parallelization strategies.