Going Multinational under Exchange Rate Uncertainty

Published as an article in: Journal of International Money and Finance, 2010, vol. 29, issue 6, pages 1171-1191.

Model of sources: a proposal for the hierarchy, merging strategy and representation of the information sources in virtual models of historical buildings

Contributed to: Fusion of Cultures: XXXVIII Annual Conference on Computer Applications and Quantitative Methods in Archaeology – CAA2010 (Granada, Spain, Apr 6-9, 2010)

El problema de la causalidad en las ciencias económicas

[ES] En el presente artículo se aborda el problema de la causalidad en las Ciencias Económicas. Partiendo de la diferenciación entre ciencias duras y blandas, y de la supuesta clasificicación de la economía en este segundo grupo, se realiza un análisis de los diferentes paradigmas ontológicos que soportan la investigación científica, para a continuación trasladar la causalidad desde el ámbito ontológico al gnoseológico. Posteriormente se profundiza en la conjunción de la metodología hipotético-deductiva con el método correlacional, generando una causalidad probabilística. Dicha causalidad, contextualizada de forma científica, permite la realización y contrastación de inferencias predictivas, a través de las cuales las Ciencias Ecnómicas pueden encontrar su ubicación en los niveles mas extrictos de la investigación científica.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Expected Fair Allocation in Farsighted Network Formation

I consider cooperation situations where players have network relations. Networks evolve according to a stationary transition probability matrix and at each moment in time players receive payoffs from a stationary allocation rule. Players discount the future by a common factor. The pair formed by an allocation rule and a transition probability matrix is called expected fair if for every link in the network both participants gain, marginally, and in discounted, expected terms, the same from it; and it is called a pairwise network formation procedure if the probability that a link is created (or eliminated) is positive if the discounted, expected gains to its two participants are positive too. The main result is the existence, for the discount factor small enough, of an expected fair and pairwise network formation procedure where the allocation rule is component balanced, meaning it distributes the total value of any maximal connected subnetwork among its participants. This existence result holds for all discount factors when the pairwise network formation procedure is restricted. I finally provide some comparison with previous models of farsighted network formation.

Role of G protein coupled inwardly rectifier K+ channels (GIRK) on the neurobiology depression

353 págs.

Características antropométricas, condición física y velocidad de lanzamiento en balonmano de élite y amateur

166 p.

Efficient learning of decomposable models with a bounded clique size

The learning of probability distributions from data is a ubiquitous problem in the fields of Statistics and Artificial Intelligence. During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models due to their advantageous theoretical properties. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k, which controls the complexity of the model. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In this work, we propose a family of algorithms which approximates this problem with a computational complexity of O(k · n^2 log n) in the worst case, where n is the number of implied random variables. The structures of the decomposable models that solve the maximum likelihood problem are called maximal k-order decomposable graphs. Our proposals, called fractal trees, construct a sequence of maximal i-order decomposable graphs, for i = 2, ..., k, in k − 1 steps. At each step, the algorithms follow a divide-and-conquer strategy based on the particular features of this type of structures. Additionally, we propose a prune-and-graft procedure which transforms a maximal k-order decomposable graph into another one, increasing its likelihood. We have implemented two particular fractal tree algorithms called parallel fractal tree and sequential fractal tree. These algorithms can be considered a natural extension of Chow and Liu’s algorithm, from k = 2 to arbitrary values of k. Both algorithms have been compared against other efficient approaches in artificial and real domains, and they have shown a competitive behavior to deal with the maximum likelihood problem. Due to their low computational complexity they are especially recommended to deal with high dimensional domains.

Unilateral vs. Bilateral link-formation: Bridging the gap

We provide a model that bridges the gap between two benchmark models of strategic network formation: Jackson and Wolinsky' s model based on bilateral formation of links, and Bala and Goyal's two-way fl ow model, where links can be unilaterally formed. In the model introduced and studied here a link can be created unilaterally. When it is only supported by one of the two players the fl ow through the link suffers a certain decay, but when it is supported by both the fl ow runs without friction. When the decay in links supported by only one player is maximal (i.e. there is no flow) we have Jackson and Wolinsky 's connections model without decay, while when flow in such links is perfect we have Bala and Goyal' s two-way flow model. We study Nash, strict Nash and pairwise stability for the intermediate models. Efficiency and dynamics are also examined.

From bilateral two-way to unilateral one-way flow link-formation

Documento de trabajo

Estudio del comportamiento aerodinámico de un alerón trasero de un monoplaza tipo Formula Student

[ES]El proyecto investigador tiene el objeto el estudio del comportamiento de un perfil aerodinámico frente a un flujo turbulento, en este caso el aire. Se trata de evaluar las presiones que se ejercen sobre dicho perfil, que será un alerón de monoplaza tipo Formula Student, para comprobar si aporta alguna mejora en el comportamiento del monoplaza la introducción de este paquete aerodinámico. Con la introducción de este perfil en el monoplaza se pretende ganar un mayor agarre en el paso por curva siendo la resistencia al avance en recta la mínima posible, ya que lo que se pretende es hacer el recorrido del circuito en el menor tiempo posible. Por tanto hay dos variables a tener en cuenta a la hora de diseñar el alerón, por un lado esta mejorar el agarre de los neumáticos sobre el asfalto al tomar una curva, lo que nos permitirá tomar la curva a mayor velocidad y por tanto en menos tiempo, y por otro lado, la oposición que el alerón ejerce en el avance en recta disminuyendo su velocidad máxima. En resumen, se trata de comparar la fuerza horizontal y la fuerza vertical que el aire ejerce sobre el perfil aerodinámico a introducir en el monoplaza y evaluar si es beneficioso para este, es decir, si añadiendo dicho perfil se realiza el trazado del circuito en menor tiempo que sin él. Para ello se realizarán simulaciones con un software de modelado físico de flujos y turbulencias sobre un diseño de un alerón dado, con diferentes tipos de flujo, de forma que se asemeje de mejor forma a las condiciones de la pista y se obtendrán los resultados de las presiones que el flujo de aire ejerce sobre las superficies del perfil. Después se obtendrán las fuerzas puntuales vertical y horizontal y se analizaran los datos obtenidos. Deberán tenerse en cuenta, además de los resultados obtenidos, los materiales a emplear a la hora de su fabricación, el proceso de dicha fabricación y el coste que supone tanto el proceso como los materiales empleados.

A Unifying model of strategic network formation

Documento de trabajo

The promoter of cell growth- and RNA protection-associated SND1 gene is activated by endoplasmic reticulum stress in human hepatoma cells

Background: Staphyloccocal nuclease domain-containing protein 1 (SND1) is involved in the regulation of gene expression and RNA protection. While numerous studies have established that SND1 protein expression is modulated by cellular stresses associated with tumor growth, hypoxia, inflammation, heat- shock and oxidative conditions, little is known about the factors responsible for SND1 expression. Here, we have approached this question by analyzing the transcriptional response of human SND1 gene to pharmacological endoplasmic reticulum (ER) stress in liver cancer cells. Results: We provide first evidence that SND1 promoter activity is increased in human liver cancer cells upon exposure to thapsigargin or tunicamycin or by ectopic expression of ATF6, a crucial transcription factor in the unfolded protein response triggered by ER stress. Deletion analysis of the 5'-flanking region of SND1 promoter identified maximal activation in fragment (-934, +221), which contains most of the predicted ER stress response elements in proximal promoter. Quantitative real- time PCR revealed a near 3 fold increase in SND1 mRNA expression by either of the stress- inducers; whereas SND1 protein was maximally upregulated (3.4-fold) in cells exposed to tunicamycin, a protein glycosylation inhibitor. Conclusion: Promoter activity of the cell growth- and RNA-protection associated SND1 gene is up-regulated by ER stress in human hepatoma cells.

The E2F2 Transcription Factor Sustains Hepatic Glycerophospholipid Homeostasis in Mice

Increasing evidence links metabolic signals to cell proliferation, but the molecular wiring that connects the two core machineries remains largely unknown. E2Fs are master regulators of cellular proliferation. We have recently shown that E2F2 activity facilitates the completion of liver regeneration after partial hepatectomy (PH) by regulating the expression of genes required for S-phase entry. Our study also revealed that E2F2 determines the duration of hepatectomy-induced hepatic steatosis. A transcriptomic analysis of normal adult liver identified "lipid metabolism regulation" as a major E2F2 functional target, suggesting that E2F2 has a role in lipid homeostasis. Here we use wild-type (E2F2(+/+)) and E2F2 deficient (E2F2(-/-)) mice to investigate the in vivo role of E2F2 in the composition of liver lipids and fatty acids in two metabolically different contexts: quiescence and 48-h post-PH, when cellular proliferation and anabolic demands are maximal. We show that liver regeneration is accompanied by large triglyceride and protein increases without changes in total phospholipids both in E2F2(+/+) and E2F2(-/-) mice. Remarkably, we found that the phenotype of quiescent liver tissue from E2F2(-/-) mice resembles the phenotype of proliferating E2F2(+/+) liver tissue, characterized by a decreased phosphatidylcholine to phosphatidylethanolamine ratio and a reprogramming of genes involved in generation of choline and ethanolamine derivatives. The diversity of fatty acids in total lipid, triglycerides and phospholipids was essentially preserved on E2F2 loss both in proliferating and non-proliferating liver tissue, although notable exceptions in inflammation-related fatty acids of defined phospholipid classes were detected. Overall, our results indicate that E2F2 activity sustains the hepatic homeostasis of major membrane glycerolipid components while it is dispensable for storage glycerolipid balance.

Cerebral hemodynamics during graded Valsalva maneuvers

The Valsalva maneuver (VM) produces large and abrupt changes in mean arterial pressure (MAP) that challenge cerebral blood flow and oxygenation. We examined the effect of VM intensity on middle cerebral artery blood velocity (MCAv) and cortical oxygenation responses during (phases I-III) and following (phase IV) a VM. Healthy participants (n = 20 mean +/- SD: 27 +/- 7 years) completed 30 and 90% of their maximal VM mouth pressure for 10 s (order randomized) whilst standing. Beat-to-beat MCAv, cerebral oxygenation (NIRS) and MAP across the different phases of the VM are reported as the difference from standing baseline. There were significant interaction (phase * intensity) effects for MCAv, total oxygenation index (TOI) and MAP (all P < 0.01). MCAv decreased during phases II and III (P < 0.01), with the greatest decrease during phase III (-5 +/- 8 and -19 +/- 15 cm.s(-1) for 30 and 90% VM, respectively). This pattern was also evident in TOI (phase III: -1 +/- 1 and -5 +/- 4%, both P < 0.05). Phase IV increased MCAv (22 +/- 15 and 34 +/- 23 cm.s(-1)), MAP (15 +/- 14 and 24 +/- 17 mm Hg) and TOI (5 +/- 6 and 7 +/- 5%) relative to baseline (all P < 0.05). Cerebral autoregulation, indexed, as the % MCAv/%MAP ratio, showed a phase effect only (P < 0.001), with the least regulation during phase IV (2.4 +/- 3.0 and 3.2 +/- 2.9). These data illustrate that an intense VM profoundly affects cerebral hemodynamics, with a reactive hyperemia occurring during phase IV following modest ischemia during phases II and III.