Random walk forecast of urban water in Iran under uncertainty

There are two significant reasons for the uncertainties of water demand. On one hand, an evolving technological world is plagued with accelerated change in lifestyles and consumption patterns; and on the other hand, intensifying climate change. Therefore, with an uncertain future, what enables policymakers to define the state of water resources, which are affected by withdrawals and demands? Through a case study based on thirteen years of observation data in the Zayandeh Rud River basin in Isfahan province located in Iran, this paper forecasts a wide range of urban water demand possibilities in order to create a portfolio of plans which could be utilized by different water managers. A comparison and contrast of two existing methods are discussed, demonstrating the Random Walk Methodology, which will be referred to as the â On uncertainty pathâ , because it takes the uncertainties into account and can be recommended to managers. This On Uncertainty Path is composed of both dynamic forecasting method and system simulation. The outcomes show the advantage of such methods particularly for places that climate change will aggravate their water scarcity, such as Iran.

Optimal design in the presence of random or fixed block effects

Magdeburg, Univ., Fak. für Mathematik, Diss., 2014

Approximations and asymptotic expansions for sums of heavy-tailed random variables

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

Optimal designs for the prediction in hierarchical random coefficient regression models

Magdeburg, Univ., Fak. für Mathematik, Diss., 2015

The complexity of random ordered structures

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

Optimal monitoring to implement clean technologies when pollution is random

We analyze a model where firms chose a production technology which, together with some random event, determines the final emission level. We consider the coexistence of two alternative technologies: a "clean" technology, and a "dirty" technology. The environmental regulation is based on taxes over reported emissions, and on penalties over unreported emissions. We show that the optimal inspection policy is a cut-off strategy, for several scenarios concerning the observability of the adoption of the clean technology and the cost of adopting it. We also show that the optimal inspection policy induces the firm to adopt the clean technology if the adoption cost is not too high, but the cost levels for which the firm adopts it depend on the scenario.

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

Mutagenesis and modelling of the alpha(1b)-adrenergic receptor highlight the role of the helix 3/helix 6 interface in receptor activation.

Computer simulations on a new model of the alpha1b-adrenergic receptor based on the crystal structure of rhodopsin have been combined with experimental mutagenesis to investigate the role of residues in the cytosolic half of helix 6 in receptor activation. Our results support the hypothesis that a salt bridge between the highly conserved arginine (R143(3.50)) of the E/DRY motif of helix 3 and a conserved glutamate (E289(6.30)) on helix 6 constrains the alpha1b-AR in the inactive state. In fact, mutations of E289(6.30) that weakened the R143(3.50)-E289(6.30) interaction constitutively activated the receptor. The functional effect of mutating other amino acids on helix 6 (F286(6.27), A292(6.33), L296(6.37), V299(6.40,) V300(6.41), and F303(6.44)) correlates with the extent of their interaction with helix 3 and in particular with R143(3.50) of the E/DRY sequence.

The fourth transmembrane segment of the Na,K-ATPase alpha subunit: a systematic mutagenesis study.

The Na,K-ATPase is a major ion-motive ATPase of the P-type family responsible for many aspects of cellular homeostasis. To determine the structure of the pathway for cations across the transmembrane portion of the Na,K-ATPase, we mutated 24 residues of the fourth transmembrane segment into cysteine and studied their function and accessibility by exposure to the sulfhydryl reagent 2-aminoethyl-methanethiosulfonate. Accessibility was also examined after treatment with palytoxin, which transforms the Na,K-pump into a cation channel. Of the 24 tested cysteine mutants, seven had no or a much reduced transport function. In particular cysteine mutants of the highly conserved "PEG" motif had a strongly reduced activity. However, most of the non-functional mutants could still be transformed by palytoxin as well as all of the functional mutants. Accessibility, determined as a 2-aminoethyl-methanethiosulfonate-induced reduction of the transport activity or as inhibition of the membrane conductance after palytoxin treatment, was observed for the following positions: Phe(323), Ile(322), Gly(326), Ala(330), Pro(333), Glu(334), and Gly(335). In accordance with a structural model of the Na,K-ATPase obtained by homology modeling with the two published structures of sarcoplasmic and endoplasmic reticulum calcium ATPase (Protein Data Bank codes 1EUL and 1IWO), the results suggest the presence of a cation pathway along the side of the fourth transmembrane segment that faces the space between transmembrane segments 5 and 6. The phenylalanine residue in position 323 has a critical position at the outer mouth of the cation pathway. The residues thought to form the cation binding site II ((333)PEGL) are also part of the accessible wall of the cation pathway opened by palytoxin through the Na,K-pump.

Spectral analysis of random sparse matrices

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

Propagation connectivity of random hypergraphs

We study the concept of propagation connectivity on random 3-uniform hypergraphs. This concept is inspired by a simple linear time algorithm for solving instances of certain constraint satisfaction problems. We derive upper and lower bounds for the propagation connectivity threshold, and point out some algorithmic implications.