8 resultados para Lehtinen, Eero
em BORIS: Bern Open Repository and Information System - Berna - Suiça
VEGF-B-induced vascular growth leads to metabolic reprogramming and ischemia resistance in the heart
Resumo:
Angiogenic growth factors have recently been linked to tissue metabolism. We have used genetic gain- and loss-of function models to elucidate the effects and mechanisms of action of vascular endothelial growth factor-B (VEGF-B) in the heart. A cardiomyocyte-specific VEGF-B transgene induced an expanded coronary arterial tree and reprogramming of cardiomyocyte metabolism. This was associated with protection against myocardial infarction and preservation of mitochondrial complex I function upon ischemia-reperfusion. VEGF-B increased VEGF signals via VEGF receptor-2 to activate Erk1/2, which resulted in vascular growth. Akt and mTORC1 pathways were upregulated and AMPK downregulated, readjusting cardiomyocyte metabolic pathways to favor glucose oxidation and macromolecular biosynthesis. However, contrasting with a previous theory, there was no difference in fatty acid uptake by the heart between the VEGF-B transgenic, gene-targeted or wildtype rats. Importantly, we also show that VEGF-B expression is reduced in human heart disease. Our data indicate that VEGF-B could be used to increase the coronary vasculature and to reprogram myocardial metabolism to improve cardiac function in ischemic heart disease.
Resumo:
We present a generalized framework for gradient-domain Metropolis rendering, and introduce three techniques to reduce sampling artifacts and variance. The first one is a heuristic weighting strategy that combines several sampling techniques to avoid outliers. The second one is an improved mapping to generate offset paths required for computing gradients. Here we leverage the properties of manifold walks in path space to cancel out singularities. Finally, the third technique introduces generalized screen space gradient kernels. This approach aligns the gradient kernels with image structures such as texture edges and geometric discontinuities to obtain sparser gradients than with the conventional gradient kernel. We implement our framework on top of an existing Metropolis sampler, and we demonstrate significant improvements in visual and numerical quality of our results compared to previous work.
Resumo:
There has been increasing interest in the discursive aspects of strategy over the last two decades. In this editorial we review the existing literature, focusing on six major bodies of discursive scholarship: post-structural, critical discourse analysis, narrative, rhetoric, conversation analysis and metaphor. Our review reveals the significant contributions of research on strategy and discourse, but also the potential to advance research in this area by bringing together research on discursive practices and research on other practices we know to be important in strategy work. We explore the potential of discursive scholarship in integrating between significant theoretical domains (sensemaking, power and sociomateriality), and realms of analysis (institutional, organizational and the episodic), relevant to strategy scholarship. This allows us to place the papers published in the special issue Strategy as Discourse: Its Significance, Challenges and Future Directions among the body of knowledge accumulated thus far, and to suggest a way forward for future scholarship.
Resumo:
We introduce gradient-domain rendering for Monte Carlo image synthesis.While previous gradient-domain Metropolis Light Transport sought to distribute more samples in areas of high gradients, we show, in contrast, that estimating image gradients is also possible using standard (non-Metropolis) Monte Carlo algorithms, and furthermore, that even without changing the sample distribution, this often leads to significant error reduction. This broadens the applicability of gradient rendering considerably. To gain insight into the conditions under which gradient-domain sampling is beneficial, we present a frequency analysis that compares Monte Carlo sampling of gradients followed by Poisson reconstruction to traditional Monte Carlo sampling. Finally, we describe Gradient-Domain Path Tracing (G-PT), a relatively simple modification of the standard path tracing algorithm that can yield far superior results.
Resumo:
Monte Carlo integration is firmly established as the basis for most practical realistic image synthesis algorithms because of its flexibility and generality. However, the visual quality of rendered images often suffers from estimator variance, which appears as visually distracting noise. Adaptive sampling and reconstruction algorithms reduce variance by controlling the sampling density and aggregating samples in a reconstruction step, possibly over large image regions. In this paper we survey recent advances in this area. We distinguish between “a priori” methods that analyze the light transport equations and derive sampling rates and reconstruction filters from this analysis, and “a posteriori” methods that apply statistical techniques to sets of samples to drive the adaptive sampling and reconstruction process. They typically estimate the errors of several reconstruction filters, and select the best filter locally to minimize error. We discuss advantages and disadvantages of recent state-of-the-art techniques, and provide visual and quantitative comparisons. Some of these techniques are proving useful in real-world applications, and we aim to provide an overview for practitioners and researchers to assess these approaches. In addition, we discuss directions for potential further improvements.
Resumo:
Gradient-domain path tracing has recently been introduced as an efficient realistic image synthesis algorithm. This paper introduces a bidirectional gradient-domain sampler that outperforms traditional bidirectional path tracing often by a factor of two to five in terms of squared error at equal render time. It also improves over unidirectional gradient-domain path tracing in challenging visibility conditions, similarly as conventional bidirectional path tracing improves over its unidirectional counterpart. Our algorithm leverages a novel multiple importance sampling technique and an efficient implementation of a high-quality shift mapping suitable for bidirectional path tracing. We demonstrate the versatility of our approach in several challenging light transport scenarios.