3 resultados para Challenging problems
em BORIS: Bern Open Repository and Information System - Berna - Suiça
Resumo:
Tooth resorption is among the most common and most challenging problems in feline dentistry It is a progressive disease eventually leading to tooth loss and often root replacement. The etiology of moth resorption remains obscure and to date no effective therapeutic approach is known. The present study is aimed at assessing the reliability of radiographic imaging and addressing the possible involvement of receptor activator of NF kappa B (RANK), its ligand (RANKL), and osteoprotegerin (OPG) in the process of tooth resorption. Teeth from 8 cats were investigated by means of radiographs and paraffin sections followed by immunolabeling. Six cats were diagnosed with tooth resorption based on histopathologic and radiographic findings. Samples were classified according to a four-stage diagnostic system. Radiologic assessment of tooth resorption correlated very strongly with histopathologic findings. Tooth resorption was accompanied by a strong staining with all three antibodies used, especially with anti-RANK and anti-RANKL antibodies. The presence of OPG and RANKL at the resorption site is indicative of repair attempts by fibroblasts and stromal cells. These findings should be extended by further investigations in order to elucidate the pathophysiologic processes underlying tooth resorption that might lead to prophylactic and/or therapeutic measures. J Vet Dent 27(2); 75 - 83, 2010
Resumo:
Abelian and non-Abelian gauge theories are of central importance in many areas of physics. In condensed matter physics, AbelianU(1) lattice gauge theories arise in the description of certain quantum spin liquids. In quantum information theory, Kitaev’s toric code is a Z(2) lattice gauge theory. In particle physics, Quantum Chromodynamics (QCD), the non-Abelian SU(3) gauge theory of the strong interactions between quarks and gluons, is nonperturbatively regularized on a lattice. Quantum link models extend the concept of lattice gauge theories beyond the Wilson formulation, and are well suited for both digital and analog quantum simulation using ultracold atomic gases in optical lattices. Since quantum simulators do not suffer from the notorious sign problem, they open the door to studies of the real-time evolution of strongly coupled quantum systems, which are impossible with classical simulation methods. A plethora of interesting lattice gauge theories suggests itself for quantum simulation, which should allow us to address very challenging problems, ranging from confinement and deconfinement, or chiral symmetry breaking and its restoration at finite baryon density, to color superconductivity and the real-time evolution of heavy-ion collisions, first in simpler model gauge theories and ultimately in QCD.
Resumo:
Multi-objective optimization algorithms aim at finding Pareto-optimal solutions. Recovering Pareto fronts or Pareto sets from a limited number of function evaluations are challenging problems. A popular approach in the case of expensive-to-evaluate functions is to appeal to metamodels. Kriging has been shown efficient as a base for sequential multi-objective optimization, notably through infill sampling criteria balancing exploitation and exploration such as the Expected Hypervolume Improvement. Here we consider Kriging metamodels not only for selecting new points, but as a tool for estimating the whole Pareto front and quantifying how much uncertainty remains on it at any stage of Kriging-based multi-objective optimization algorithms. Our approach relies on the Gaussian process interpretation of Kriging, and bases upon conditional simulations. Using concepts from random set theory, we propose to adapt the Vorob’ev expectation and deviation to capture the variability of the set of non-dominated points. Numerical experiments illustrate the potential of the proposed workflow, and it is shown on examples how Gaussian process simulations and the estimated Vorob’ev deviation can be used to monitor the ability of Kriging-based multi-objective optimization algorithms to accurately learn the Pareto front.