Do institutions matter for economic fluctuations? Weak property rights in a business cycle model for Mexico

This paper shows that introducing weak property rights in the standard real business cycle (RBC) model can help to explain economic fluctuations. This is motivated by the empirical observation that changes in institutions in emerging markets are related to the evolution of the main macroeconomic variables. In particular, in Mexico, the movements in productivity in the data are associated with changes in institutions, so that we can explain productivity shocks to a large extent as shocks to the quality of institutions. We find that the model with shocks to the degree of protection of property rights only - without technology shocks - can match the second moments in the data for Mexico well. In particular, the fit is better than that of the standard neoclassical model with full protection of property rights regarding the auto-correlations and cross-correlations in the data, especially those related to labor. Viewing productivity shocks as shocks to institutions is also consistent with the stylized fact of falling productivity and non-decreasing labor hours in Mexico over 1980-1994, which is a feature that the neoclassical model cannot match.

Tumor necrosis factor (TNF) signaling, but not TWEAK (TNF-like weak inducer of apoptosis)-triggered cIAP1 (cellular inhibitor of apoptosis protein 1) degradation, requires cIAP1 RING dimerization and E2 binding.

Cellular inhibitor of apoptosis (cIAP) proteins, cIAP1 and cIAP2, are important regulators of tumor necrosis factor (TNF) superfamily (SF) signaling and are amplified in a number of tumor types. They are targeted by IAP antagonist compounds that are undergoing clinical trials. IAP antagonist compounds trigger cIAP autoubiquitylation and degradation. The TNFSF member TWEAK induces lysosomal degradation of TRAF2 and cIAPs, leading to elevated NIK levels and activation of non-canonical NF-kappaB. To investigate the role of the ubiquitin ligase RING domain of cIAP1 in these pathways, we used cIAP-deleted cells reconstituted with cIAP1 point mutants designed to interfere with the ability of the RING to dimerize or to interact with E2 enzymes. We show that RING dimerization and E2 binding are required for IAP antagonists to induce cIAP1 degradation and protect cells from TNF-induced cell death. The RING functions of cIAP1 are required for full TNF-induced activation of NF-kappaB, however, delayed activation of NF-kappaB still occurs in cIAP1 and -2 double knock-out cells. The RING functions of cIAP1 are also required to prevent constitutive activation of non-canonical NF-kappaB by targeting NIK for proteasomal degradation. However, in cIAP double knock-out cells TWEAK was still able to increase NIK levels demonstrating that NIK can be regulated by cIAP-independent pathways. Finally we show that, unlike IAP antagonists, TWEAK was able to induce degradation of cIAP1 RING mutants. These results emphasize the critical importance of the RING of cIAP1 in many signaling scenarios, but also demonstrate that in some pathways RING functions are not required.

Fast numerical algorithms for the computation of invariant tori in Hamiltonian systems

In this paper, we develop numerical algorithms that use small requirements of storage and operations for the computation of invariant tori in Hamiltonian systems (exact symplectic maps and Hamiltonian vector fields). The algorithms are based on the parameterization method and follow closely the proof of the KAM theorem given in [LGJV05] and [FLS07]. They essentially consist in solving a functional equation satisfied by the invariant tori by using a Newton method. Using some geometric identities, it is possible to perform a Newton step using little storage and few operations. In this paper we focus on the numerical issues of the algorithms (speed, storage and stability) and we refer to the mentioned papers for the rigorous results. We show how to compute efficiently both maximal invariant tori and whiskered tori, together with the associated invariant stable and unstable manifolds of whiskered tori. Moreover, we present fast algorithms for the iteration of the quasi-periodic cocycles and the computation of the invariant bundles, which is a preliminary step for the computation of invariant whiskered tori. Since quasi-periodic cocycles appear in other contexts, this section may be of independent interest. The numerical methods presented here allow to compute in a unified way primary and secondary invariant KAM tori. Secondary tori are invariant tori which can be contracted to a periodic orbit. We present some preliminary results that ensure that the methods are indeed implementable and fast. We postpone to a future paper optimized implementations and results on the breakdown of invariant tori.

Empirical testing of genuine savings as an indicator of weak sustainability: a three-country analysis of long run trends

Genuine Savings has emerged as a widely-used indicator of sustainable development. In this paper, we use long-term data stretching back to 1870 to undertake empirical tests of the relationship between Genuine Savings (GS) and future well-being for three countries: Britain, the USA and Germany. Our tests are based on an underlying theoretical relationship between GS and changes in the present value of future consumption. Based on both single country and panel results, we find evidence supporting the existence of a cointegrating (long run equilibrium) relationship between GS and future well-being, and fail to reject the basic theoretical result on the relationship between these two macroeconomic variables. This provides some support for the GS measure of weak sustainability. We also show the effects of modelling shocks, such as World War Two and the Great Depression.

Weak-type estimates for Haar shift operators: Sharp power on the A(p) characteristic

"Vegeu el resum a l'inici del document del fitxer adjunt."

A Survey of Active Learning Algorithms for Supervised Remote Sensing Image Classification

Defining an efficient training set is one of the most delicate phases for the success of remote sensing image classification routines. The complexity of the problem, the limited temporal and financial resources, as well as the high intraclass variance can make an algorithm fail if it is trained with a suboptimal dataset. Active learning aims at building efficient training sets by iteratively improving the model performance through sampling. A user-defined heuristic ranks the unlabeled pixels according to a function of the uncertainty of their class membership and then the user is asked to provide labels for the most uncertain pixels. This paper reviews and tests the main families of active learning algorithms: committee, large margin, and posterior probability-based. For each of them, the most recent advances in the remote sensing community are discussed and some heuristics are detailed and tested. Several challenging remote sensing scenarios are considered, including very high spatial resolution and hyperspectral image classification. Finally, guidelines for choosing the good architecture are provided for new and/or unexperienced user.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Hard instances of algorithms and proof systems

"Vegeu el resum a l'inici del document del fitxer adjunt."

Intraobserver and interobserver variability of ascending aorta diameter as assessed with ECG-gated MDCT: automatic versus manual measurements

Purpose: Recently morphometric measurements of the ascending aorta have been done with ECG-gated MDCT to help the development of future endovascular therapies (TCT) [1]. However, the variability of these measurements remains unknown. It will be interesting to know the impact of CAD (computer aided diagnosis) with automated segmentation of the vessel and automatic measurements of diameter on the management of ascending aorta aneurysms. Methods and Materials: Thirty patients referred for ECG-gated CT thoracic angiography (64-row CT scanner) were evaluated. Measurements of the maximum and minimum ascending aorta diameters were obtained automatically with a commercially available CAD and semi-manually by two observers separately. The CAD algorithms segment the iv-enhanced lumen of the ascending aorta into perpendicular planes along the centreline. The CAD then determines the largest and the smallest diameters. Both observers repeated the automatic measurements and the semimanual measurements during a different session at least one month after the first measurements. The Bland and Altman method was used to study the inter/intraobserver variability. A Wilcoxon signed-rank test was also used to analyse differences between observers. Results: Interobserver variability for semi-manual measurements between the first and second observers was between 1.2 to 1.0 mm for maximal and minimal diameter, respectively. Intraobserver variability of each observer ranged from 0.8 to 1.2 mm, the lowest variability being produced by the more experienced observer. CAD variability could be as low as 0.3 mm, showing that it can perform better than human observers. However, when used in nonoptimal conditions (streak artefacts from contrast in the superior vena cava or weak lumen enhancement), CAD has a variability that can be as high as 0.9 mm, reaching variability of semi-manual measurements. Furthermore, there were significant differences between both observers for maximal and minimal diameter measurements (p<0.001). There was also a significant difference between the first observer and CAD for maximal diameter measurements with the former underestimating the diameter compared to the latter (p<0.001). As for minimal diameters, they were higher when measured by the second observer than when measured by CAD (p<0.001). Neither the difference of mean minimal diameter between the first observer and CAD nor the difference of mean maximal diameter between the second observer and CAD was significant (p=0.20 and 0.06, respectively). Conclusion: CAD algorithms can lessen the variability of diameter measurements in the follow-up of ascending aorta aneurysms. Nevertheless, in non-optimal conditions, it may be necessary to correct manually the measurements. Improvements of the algorithms will help to avoid such a situation.

Extreme Precipitation Modelling Using Geostatistics and Machine Learning Algorithms

The paper presents an approach for mapping of precipitation data. The main goal is to perform spatial predictions and simulations of precipitation fields using geostatistical methods (ordinary kriging, kriging with external drift) as well as machine learning algorithms (neural networks). More practically, the objective is to reproduce simultaneously both the spatial patterns and the extreme values. This objective is best reached by models integrating geostatistics and machine learning algorithms. To demonstrate how such models work, two case studies have been considered: first, a 2-day accumulation of heavy precipitation and second, a 6-day accumulation of extreme orographic precipitation. The first example is used to compare the performance of two optimization algorithms (conjugate gradients and Levenberg-Marquardt) of a neural network for the reproduction of extreme values. Hybrid models, which combine geostatistical and machine learning algorithms, are also treated in this context. The second dataset is used to analyze the contribution of radar Doppler imagery when used as external drift or as input in the models (kriging with external drift and neural networks). Model assessment is carried out by comparing independent validation errors as well as analyzing data patterns.