Search

Consequences of social trust are comparatively well studied, while its societal determinants are often subject to debate. This paper studies both in the context of Catalan attempts to secede from Spain: First, we test whether Catalonia enjoys higher levels of social capital that it is prevented from capi-talizing on. Second, the paper examines whether secessionist movements create animosity and political divisions within society that undermine trust. Employing the nine available waves of the European Social Survey for Spain, we only find weak indications that social trust levels are higher in Catalonia than in the rest of the country. Interestingly, we further find testimony of a purely transient “exuberance ef-fect” after secession became a real option, indicating that the long- run evolution of social trust may best be thought of as a stable punctuated equilibrium.

Ever since the spectacular boom and bust cycle of the Spanish real estate industry, endemic corruption at the local level has become a widely recognized problem in the national public discourse. In an effort to expose an under-explored political determinant, this paper investigates the effect of local and regional alignment in fomenting corruption at the Spanish municipal level. To do so, we construct an ample panel dataset on the prevalence of corrupt practices by local politicians, which is employed to test the possible impact of partisan alignment in three consecutive joint municipal and regional elections. Findings show aligned municipalities to be more corrupt than non-aligned ones, an effect that is further associated with absolute majorities at both levels of government and higher capital transfers. By contrast, we also show that ¿throwing the rascals out¿ could be an effective strategy for curbing the corrupt practices of aligned municipalities. This indicates that the democratic political process may be effective in corruption control if agreements can be reached to remove corrupt politicians or parties from power.

This Ph.D. dissertation consists of three self-contained chapters on New Institutional Economics (NIE). Ever since the expansion of neoclassical economics during the three decades following World War II, economists have realized that their theoretical approach can be applied to analyze a broader set of topics, including politics and law.

River networks exhibit a globally important capacity to retain and process nitrogen. However direct measurement of in‐stream removal in higher order streams and rivers has been extremely limited. The recent advent of automated sensors has allowed high frequency measurements, and the development of new passive methods of quantifying nitrogen uptake which are scalable across river size. Here we extend these methods to higher order streams with anthropogenically elevated nitrogen levels, substantial tributaries, complex input signals, and multiple N species. We use a combination of two station time‐series and longitudinal profiling of nitrate to assess differences in nitrogen processing dynamics in a natural versus a channelized impounded reach with WWTP effluent impacted water chemistry. Our results suggest that net mass removal rates of nitrate were markedly higher in the unmodified reach. Additionally, seasonal variations in temperature and insolation affected the relative contribution of assimilatory versus dissimilatory uptake processes, with the latter exhibiting a stronger positive dependence on temperature. From a methodological perspective, we demonstrate that a mass balance approach based on high frequency data can be useful in deriving quantitative uptake estimates, even under dynamic inputs and lateral tributary inflow. However, uncertainty in diffuse groundwater inputs and more importantly the effects of alternative nitrogen species, in this case ammonium, pose considerable challenges to this method.

New scientific understanding is catalysed by novel technologies that enhance measurement precision, resolution or type, and that provide new tools to test and develop theory. Over the last 50 years, technology has transformed the hydrologic sciences by enabling direct measurements of watershed fluxes (evapotranspiration, streamflow) at time scales and spatial extents aligned with variation in physical drivers. High frequency water quality measurements, increasingly obtained by in-situ water quality sensors, are extending that transformation. Widely available sensors for some physical (temperature) and chemical (conductivity, dissolved oxygen) attributes have become integral to aquatic science, and emerging sensors for nutrients, dissolved CO2, turbidity, algal pigments, and dissolved organic matter are now enabling observations of watersheds and streams at timescales commensurate with their fundamental hydrological, energetic, elemental, and biological drivers. Here we synthesize insights from emerging technologies across a suite of applications, and envision future advances, enabled by sensors, in our ability to understand, predict, and restore watershed and stream systems.

Simply Mycoplasma The bacterium Mycoplasma pneumoniae , a human pathogen, has a genome of reduced size and is one of the simplest organisms that can reproduce outside of host cells. As such, it represents an excellent model organism in which to attempt a systems-level understanding of its biological organization. Now three papers provide a comprehensive and quantitative analysis of the proteome, the metabolic network, and the transcriptome of M. pneumoniae (see the Perspective by Ochman and Raghavan ). Anticipating what might be possible in the future for more complex organisms, Kühner et al. (p. 1235 ) combine analysis of protein interactions by mass spectrometry with extensive structural information on M. pneumoniae proteins to reveal how proteins work together as molecular machines and map their organization within the cell by electron tomography. The manageable genome size of M. pneumoniae allowed Yus et al. (p. 1263 ) to map the metabolic network of the organism manually and validate it experimentally. Analysis of the network aided development of a minimal medium in which the bacterium could be cultured. Finally, G‡ell et al. (p. 1268 ) applied state-of-the-art sequencing techniques to reveal that this “simple” organism makes extensive use of noncoding RNAs and has exon- and intron-like structure within transcriptional operons that allows complex gene regulation resembling that of eukaryotes.

Simply Mycoplasma The bacterium Mycoplasma pneumoniae , a human pathogen, has a genome of reduced size and is one of the simplest organisms that can reproduce outside of host cells. As such, it represents an excellent model organism in which to attempt a systems-level understanding of its biological organization. Now three papers provide a comprehensive and quantitative analysis of the proteome, the metabolic network, and the transcriptome of M. pneumoniae (see the Perspective by Ochman and Raghavan ). Anticipating what might be possible in the future for more complex organisms, Kühner et al. (p. 1235 ) combine analysis of protein interactions by mass spectrometry with extensive structural information on M. pneumoniae proteins to reveal how proteins work together as molecular machines and map their organization within the cell by electron tomography. The manageable genome size of M. pneumoniae allowed Yus et al. (p. 1263 ) to map the metabolic network of the organism manually and validate it experimentally. Analysis of the network aided development of a minimal medium in which the bacterium could be cultured. Finally, G‡ell et al. (p. 1268 ) applied state-of-the-art sequencing techniques to reveal that this “simple” organism makes extensive use of noncoding RNAs and has exon- and intron-like structure within transcriptional operons that allows complex gene regulation resembling that of eukaryotes.

Simply Mycoplasma The bacterium Mycoplasma pneumoniae , a human pathogen, has a genome of reduced size and is one of the simplest organisms that can reproduce outside of host cells. As such, it represents an excellent model organism in which to attempt a systems-level understanding of its biological organization. Now three papers provide a comprehensive and quantitative analysis of the proteome, the metabolic network, and the transcriptome of M. pneumoniae (see the Perspective by Ochman and Raghavan ). Anticipating what might be possible in the future for more complex organisms, Kühner et al. (p. 1235 ) combine analysis of protein interactions by mass spectrometry with extensive structural information on M. pneumoniae proteins to reveal how proteins work together as molecular machines and map their organization within the cell by electron tomography. The manageable genome size of M. pneumoniae allowed Yus et al. (p. 1263 ) to map the metabolic network of the organism manually and validate it experimentally. Analysis of the network aided development of a minimal medium in which the bacterium could be cultured. Finally, G‡ell et al. (p. 1268 ) applied state-of-the-art sequencing techniques to reveal that this “simple” organism makes extensive use of noncoding RNAs and has exon- and intron-like structure within transcriptional operons that allows complex gene regulation resembling that of eukaryotes.

In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary non-decreasing, non-constant and convex latency function φ{symbol}. In a Nash equilibrium, each user alone is minimizing her (Expected) Individual Cost, which is the (expected) latency on the link she chooses. To evaluate Nash equilibria, we formulate Social Cost as the sum of the users' (Expected) Individual Costs. The Price of Anarchy is the worst-case ratio of Social Cost for a Nash equilibrium over the least possible Social Cost. A Nash equilibrium is pure if each user deterministically chooses a single link a Nash equilibrium is fully mixed if each user chooses each link with non-zero probability. We obtain:. For the case of identical users, the Social Cost of any Nash equilibrium is no more than the Social Cost of the fully mixed Nash equilibrium, which may exist only uniquely. Moreover, instances admitting a fully mixed Nash equilibrium enjoy an efficient characterization. For the case of identical users, we derive two upper bounds on the Price of Anarchy: For the case of identical links with a monomial latency function φ{symbol} (x) = xd, the Price of Anarchy is the Bell number of orderd + 1 . For pure Nash equilibria, a generic upper bound from the Wardrop model can be transfered to discrete routing games. For polynomial latency functions with non-negative coefficients and degree d, this yields an upper bound of d + 1. For the case of identical users, a pure Nash equilibrium (and thereby an optimum pure assignment) can be computed in time O (m log m log n). For the general case, computing the best or the worst pure Nash equilibrium is NP-complete, even for identical links with an identity latency function. © 2008 Elsevier Inc. All rights reserved. 74 7 1199 1225 Cited By :15

In this work, we introduce and study a new, potentially rich model for selfish routing over non-cooperative networks, as an interesting hybridization of the two prevailing such models, namely the KPmodel [E. Koutsoupias, C.H. Papadimitriou, Worst-case equilibria, in: G. Meinel, S. Tison (Eds.), Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, in: Lecture Notes in Computer Science, vol. 1563, Springer-Verlag, 1999, pp. 404-413] and the Wmodel [J.G. Wardrop, Some theoretical aspects of road traffic research, Proceedings of the of the Institute of Civil Engineers 1 (Pt. II) (1952) 325-378]. In the hybrid model, each of n users is using a mixed strategy to ship its unsplittable traffic over a network consisting of m parallel links. In a Nash equilibrium, no user can unilaterally improve its Expected Individual Cost. To evaluate Nash equilibria, we introduce Quadratic Social Cost as the sum of the expectations of the latencies, incurred by the squares of the accumulated traffic. This modeling is unlike the KP model, where Social Cost [E. Koutsoupias, C.H. Papadimitriou, Worst-case equilibria, in: G. Meinel, S. Tison (Eds.), Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, in: Lecture Notes in Computer Science, vol. 1563, Springer-Verlag, 1999, pp. 404-413] is the expectation of the maximum latency incurred by the accumulated traffic but it is like the W model since the Quadratic Social Cost can be expressed as a weighted sum of Expected Individual Costs. We use the Quadratic Social Cost to define Quadratic Coordination Ratio. Here are our main findings: •Quadratic Social Cost can be computed in polynomial time. This is unlike the # P-completeness [D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. Spirakis, The structure and complexity of Nash equilibria for a selfish routing game, in: P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, R. Conejo (Eds.), Proceedings of the 29th International Colloquium on Automata, Languages and Programming, in: Lecture Notes in Computer Science, vol. 2380, Springer-Verlag, 2002, pp. 123-134] of computing Social Cost for the KP model.•For the case of identical users and identical links, the fully mixed Nash equilibrium [M. Mavronicolas, P. Spirakis, The price of selfish routing, Algorithmica 48 (1) (2007) 91-126], where each user assigns positive probability to every link, maximizes Quadratic Social Cost.•As our main result, we present a comprehensive collection of tight, constant (that is, independent of m and n), strictly less than 2, lower and upper bounds on the Quadratic Coordination Ratio for several, interesting special cases. Some of the bounds stand in contrast to corresponding super-constant bounds on the Coordination Ratio previously shown in [A. Czumaj, B. Vöcking, Tight bounds for worst-case equilibria, ACM Transactions on Algorithms 3 (1) (2007) E. Koutsoupias, M. Mavronicolas, P. Spirakis, Approximate equilibria and ball fusion, Theory of Computing Systems 36 (6) (2003) 683-693 E. Koutsoupias, C.H. Papadimitriou, Worst-case equilibria, in: G. Meinel, S. Tison (Eds.), Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, in: Lecture Notes in Computer Science, vol. 1563, Springer-Verlag, 1999, pp. 404-413 M. Mavronicolas, P. Spirakis, The price of selfish routing, Algorithmica 48 (1) (2007) 91-126] for the KP model. © 2008 Elsevier B.V. All rights reserved. 406 3 187 206 Cited By :24

Ill., graph. Darst., Kt.

A Nash equilibrium of a routing network represents a stable state of the network where no user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we investigate the structure of such equilibria within the context of a certain game that models selfish routing for a set of n users each shipping its traffic over a network consisting of m parallel links. In particular, we are interested in identifying the worst-case Nash equilibrium - the one that maximizes social cost. Worst-case Nash equilibria were first introduced and studied in the pioneering work of Koutsoupias and Papadimitriou [9]. More specifically, we continue the study of the Conjecture of the Fully Mixed Nash Equilibrium, henceforth abbreviated as FMNE Conjecture, which asserts that the fully mixed Nash equilibrium, when existing, is the worst-case Nash equilibrium. (In the fully mixed Nash equilibrium, the mixed strategy of each user assigns (strictly) positive probability to every link.) We report substantial progress towards identifying the validity, methodologies to establish, and limitations of, the FMNE Conjecture. © Springer-Verlag Berlin Heidelberg 2003. 2747 551 561 Cited By :28

Contains fulltext : 14150.pdf (Publisher’s version ) (Closed access)

Background. The fixation of facial epitheses represents a serious problem, as usual procedures are deficient and inaccurate. Enoseal implants may improve the fixation quality. Methods. The eye epithesis, needed by a patient for the rehabilitation after a surgical removal of an eye, was fixed by the authors with the aid of enoseal implants, inserted into the frontal and zygomatic bone. Retentive elements were fixed into the implants. Conclusions. The fixation of facial epitheses method represents an efficient way of the epitheses fixation which has got a great advantage over the usual fixation. Izhodišča. Fiksacija obraznih epitez predstavlja resen problem, saj so običajni postopki pomanjkljivi in nenatančni. Enosealni vsadki lahko izboljšajo kakovost pritrditve. Metode. Očesno epitezo, ki jo je bolnik potreboval za rehabilitacijo po kirurški odstranitvi očesa, so avtorji pritrdili s pomočjo enosealnih vsadkov, ki so jih vstavili v frontalno in zogimatično kost. Na vsadke so pritrdili retencijske elemente. Zaključki. Metoda fiksacije obraznih epitez predstavlja učinkovit način pritrditve epitez, ki ima veliko prednosti pred običajno pritrditvijo.