957 resultados para conditional random field
Resumo:
We develop, implement and study a new Bayesian spatial mixture model (BSMM). The proposed BSMM allows for spatial structure in the binary activation indicators through a latent thresholded Gaussian Markov random field. We develop a Gibbs (MCMC) sampler to perform posterior inference on the model parameters, which then allows us to assess the posterior probabilities of activation for each voxel. One purpose of this article is to compare the HJ model and the BSMM in terms of receiver operating characteristics (ROC) curves. Also we consider the accuracy of the spatial mixture model and the BSMM for estimation of the size of the activation region in terms of bias, variance and mean squared error. We perform a simulation study to examine the aforementioned characteristics under a variety of configurations of spatial mixture model and BSMM both as the size of the region changes and as the magnitude of activation changes.
Resumo:
2000 Mathematics Subject Classification: 62P10, 92D10, 92D30, 62F03
Resumo:
The focus of this work is to develop and employ numerical methods that provide characterization of granular microstructures, dynamic fragmentation of brittle materials, and dynamic fracture of three-dimensional bodies.
We first propose the fabric tensor formalism to describe the structure and evolution of lithium-ion electrode microstructure during the calendaring process. Fabric tensors are directional measures of particulate assemblies based on inter-particle connectivity, relating to the structural and transport properties of the electrode. Applying this technique to X-ray computed tomography of cathode microstructure, we show that fabric tensors capture the evolution of the inter-particle contact distribution and are therefore good measures for the internal state of and electronic transport within the electrode.
We then shift focus to the development and analysis of fracture models within finite element simulations. A difficult problem to characterize in the realm of fracture modeling is that of fragmentation, wherein brittle materials subjected to a uniform tensile loading break apart into a large number of smaller pieces. We explore the effect of numerical precision in the results of dynamic fragmentation simulations using the cohesive element approach on a one-dimensional domain. By introducing random and non-random field variations, we discern that round-off error plays a significant role in establishing a mesh-convergent solution for uniform fragmentation problems. Further, by using differing magnitudes of randomized material properties and mesh discretizations, we find that employing randomness can improve convergence behavior and provide a computational savings.
The Thick Level-Set model is implemented to describe brittle media undergoing dynamic fragmentation as an alternative to the cohesive element approach. This non-local damage model features a level-set function that defines the extent and severity of degradation and uses a length scale to limit the damage gradient. In terms of energy dissipated by fracture and mean fragment size, we find that the proposed model reproduces the rate-dependent observations of analytical approaches, cohesive element simulations, and experimental studies.
Lastly, the Thick Level-Set model is implemented in three dimensions to describe the dynamic failure of brittle media, such as the active material particles in the battery cathode during manufacturing. The proposed model matches expected behavior from physical experiments, analytical approaches, and numerical models, and mesh convergence is established. We find that the use of an asymmetrical damage model to represent tensile damage is important to producing the expected results for brittle fracture problems.
The impact of this work is that designers of lithium-ion battery components can employ the numerical methods presented herein to analyze the evolving electrode microstructure during manufacturing, operational, and extraordinary loadings. This allows for enhanced designs and manufacturing methods that advance the state of battery technology. Further, these numerical tools have applicability in a broad range of fields, from geotechnical analysis to ice-sheet modeling to armor design to hydraulic fracturing.
Resumo:
In the past decade, systems that extract information from millions of Internet documents have become commonplace. Knowledge graphs -- structured knowledge bases that describe entities, their attributes and the relationships between them -- are a powerful tool for understanding and organizing this vast amount of information. However, a significant obstacle to knowledge graph construction is the unreliability of the extracted information, due to noise and ambiguity in the underlying data or errors made by the extraction system and the complexity of reasoning about the dependencies between these noisy extractions. My dissertation addresses these challenges by exploiting the interdependencies between facts to improve the quality of the knowledge graph in a scalable framework. I introduce a new approach called knowledge graph identification (KGI), which resolves the entities, attributes and relationships in the knowledge graph by incorporating uncertain extractions from multiple sources, entity co-references, and ontological constraints. I define a probability distribution over possible knowledge graphs and infer the most probable knowledge graph using a combination of probabilistic and logical reasoning. Such probabilistic models are frequently dismissed due to scalability concerns, but my implementation of KGI maintains tractable performance on large problems through the use of hinge-loss Markov random fields, which have a convex inference objective. This allows the inference of large knowledge graphs using 4M facts and 20M ground constraints in 2 hours. To further scale the solution, I develop a distributed approach to the KGI problem which runs in parallel across multiple machines, reducing inference time by 90%. Finally, I extend my model to the streaming setting, where a knowledge graph is continuously updated by incorporating newly extracted facts. I devise a general approach for approximately updating inference in convex probabilistic models, and quantify the approximation error by defining and bounding inference regret for online models. Together, my work retains the attractive features of probabilistic models while providing the scalability necessary for large-scale knowledge graph construction. These models have been applied on a number of real-world knowledge graph projects, including the NELL project at Carnegie Mellon and the Google Knowledge Graph.
Resumo:
Neste trabalho é estudado o modelo de Kuramoto num grafo completo, em redes scale-free com uma distribuição de ligações P(q) ~ q-Y e na presença de campos aleatórios com magnitude constante e gaussiana. Para tal, foi considerado o método Ott-Antonsen e uma aproximação "annealed network". Num grafo completo, na presença de campos aleatórios gaussianos, e em redes scale-free com 2 < y < 5 na presença de ambos os campos aleatórios referidos, foram encontradas transições de fase contínuas. Considerando a presença de campos aleatórios com magnitude constante num grafo completo e em redes scale-free com y > 5, encontraram-se transições de fase contínua (h < √2) e descontínua (h > √2). Para uma rede SF com y = 3, foi observada uma transição de fase de ordem infinita. Os resultados do modelo de Kuramoto num grafo completo e na presença de campos aleatórios com magnitude constante foram comparados aos de simulações, tendo-se verificado uma boa concordância. Verifica-se que, independentemente da topologia de rede, a constante de acoplamento crítico aumenta com a magnitude do campo considerado. Na topologia de rede scale-free, concluiu-se que o valor do acoplamento crítico diminui à medida que valor de y diminui e que o grau de sincronização aumenta com o aumento do número médio das ligações na rede. A presença de campos aleatórios com magnitude gaussiana num grafo completo e numa rede scale-free com y > 2 não destrói a transição de fase contínua e não altera o comportamento crítico do modelo de Kuramoto.
Resumo:
In this paper, an improved probabilistic linearization approach is developed to study the response of nonlinear single degree of freedom (SDOF) systems under narrow-band inputs. An integral equation for the probability density function (PDF) of the envelope is derived. This equation is solved using an iterative scheme. The technique is applied to study the hardening type Duffing's oscillator under narrow-band excitation. The results compare favorably with those obtained using numerical simulation. In particular, the bimodal nature of the PDF for the response envelope for certain parameter ranges is brought out.
Resumo:
Based on the rigorous formulation of integral equations for the propagations of light waves at the medium interface, we carry out the numerical solutions of the random light field scattered from self-affine fractal surface samples. The light intensities produced by the same surface samples are also calculated in Kirchhoff's approximation, and their comparisons with the corresponding rigorous results show directly the degree of the accuracy of the approximation. It is indicated that Kirchhoff's approximation is of good accuracy for random surfaces with small roughness value w and large roughness exponent alpha. For random surfaces with larger w and smaller alpha, the approximation results in considerable errors, and detailed calculations show that the inaccuracy comes from the simplification that the transmitted light field is proportional to the incident field and from the neglect of light field derivative at the interface.
Resumo:
We suggest a theoretical scheme for the simulation of quantum random walks on a line using beam splitters, phase shifters, and photodetectors. Our model enables us to simulate a quantum random walk using of the wave nature of classical light fields. Furthermore, the proposed setup allows the analysis of the effects of decoherence. The transition from a pure mean-photon-number distribution to a classical one is studied varying the decoherence parameters.
Resumo:
An analytical nonlinear description of field-line wandering in partially statistically magnetic systems was proposed recently. In this article the influence of the wave spectrum in the energy range onto field-line random walk is investigated by applying this formulation. It is demonstrated that in all considered cases we clearly obtain a superdiffusive behavior of the field-lines. If the energy range spectral index exceeds unity a free-streaming behavior of the field-lines can be found for all relevant length-scales of turbulence. Since the superdiffusive results obtained for the slab model are exact, it seems that superdiffusion is the normal behavior of field-line wandering.
Resumo:
The random displacement of magnetic field lines in the presence of magnetic turbulence in plasmas is investigated from first principles. A two-component (slab/two-dimensional composite) model for the turbulence spectrum is employes. An analytical investigation of the asymptotic behavior of the field-line mean square displacement (FL-MSD) is carried out. It is shown that the magnetic field lines behave superdifusively for every large values of the position variable z, since the FL-MSD sigma varies as sigma similar to z(4/3). An intermediate diffusive regime may also possible exist for finite values of z under conditions which are explicitly determined in terms of the intrinsic turbulent plasma parameters. The superdiffusie asymptotic result is confirmed numerically via an iterative algorithm. The relevance to previous resuslts is discussed.
Resumo:
The random walk of magnetic field lines in the presence of magnetic turbulence in plasmas is investigated from first principles. An isotropic model is employed for the magnetic turbulence spectrum. An analytical investigation of the asymptotic behavior of the field-line mean-square displacement is carried out. in terms of the position variable z. It is shown that varies as similar to z ln z for large distance z. This result corresponds to a superdiffusive behavior of field line wandering. This investigation complements previous work, which relied on a two-component model for the turbulence spectrum. Contrary to that model, quasilinear theory appears to provide an adequate description of the field line random walk for isotropic turbulence.
Resumo:
True random number generation is crucial in hardware security applications. Proposed is a voltage-controlled true random number generator that is inherently field-programmable. This facilitates increased entropy as a randomness source because there is more than one configuration state which lends itself to more compact and low-power architectures. It is evaluated through electrical characterisation and statistically through industry-standard randomness tests. To the best of the author's knowledge, it is one of the most efficient designs to date with respect to hardware design metrics.
Resumo:
A new nonlinear theory for the perpendicular transport of charged particles is presented. This approach is based on an improved nonlinear treatment of field line random walk in combination with a generalized compound diffusion model. The generalized compound diffusion model is much more systematic and reliable, in comparison to previous theories. Furthermore, the new theory shows remarkably good agreement with test-particle simulations and heliospheric observations.
Resumo:
In this article, we study reliability measures such as geometric vitality function and conditional Shannon’s measures of uncertainty proposed by Ebrahimi (1996) and Sankaran and Gupta (1999), respectively, for the doubly (interval) truncated random variables. In survival analysis and reliability engineering, these measures play a significant role in studying the various characteristics of a system/component when it fails between two time points. The interrelationships among these uncertainty measures for various distributions are derived and proved characterization theorems arising out of them