@article{2699,
  abstract     = {We prove the universality of the β-ensembles with convex analytic potentials and for any β >
0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles.},
  author       = {Erdös, László and Bourgade, Paul and Yau, Horng},
  journal      = {Duke Mathematical Journal},
  number       = {6},
  pages        = {1127 -- 1190},
  publisher    = {Duke University Press},
  title        = {{Universality of general β-ensembles}},
  doi          = {10.1215/00127094-2649752},
  volume       = {163},
  year         = {2014},
}

@article{2716,
  abstract     = {Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.},
  author       = {Chatterjee, Krishnendu and Randour, Mickael and Raskin, Jean},
  journal      = {Acta Informatica},
  number       = {3-4},
  pages        = {129 -- 163},
  publisher    = {Springer},
  title        = {{Strategy synthesis for multi-dimensional quantitative objectives}},
  doi          = {10.1007/s00236-013-0182-6},
  volume       = {51},
  year         = {2014},
}

@inproceedings{2905,
  abstract     = {Persistent homology is a recent grandchild of homology that has found use in
science and engineering as well as in mathematics. This paper surveys the method as well
as the applications, neglecting completeness in favor of highlighting ideas and directions.},
  author       = {Edelsbrunner, Herbert and Morozovy, Dmitriy},
  location     = {Kraków, Poland},
  pages        = {31 -- 50},
  publisher    = {European Mathematical Society Publishing House},
  title        = {{Persistent homology: Theory and practice}},
  doi          = {10.4171/120-1/3},
  year         = {2014},
}

@article{3263,
  abstract     = {Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution.},
  author       = {Tkacik, Gasper and Ghosh, Anandamohan and Schneidman, Elad and Segev, Ronen},
  journal      = {PLoS One},
  number       = {1},
  publisher    = {Public Library of Science},
  title        = {{Adaptation to changes in higher-order stimulus statistics in the salamander retina}},
  doi          = {10.1371/journal.pone.0085841},
  volume       = {9},
  year         = {2014},
}

@inproceedings{10884,
  abstract     = {We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL  ∗ \X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL  ∗ \X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \X, provided processes cannot choose the directions for sending or receiving the token.
We unify and substantially extend these results by systematically exploring fragments of indexed CTL  ∗ \X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.},
  author       = {Aminof, Benjamin and Jacobs, Swen and Khalimov, Ayrat and Rubin, Sasha},
  booktitle    = {Verification, Model Checking, and Abstract Interpretation},
  isbn         = {9783642540127},
  issn         = {1611-3349},
  location     = {San Diego, CA, United States},
  pages        = {262--281},
  publisher    = {Springer Nature},
  title        = {{Parameterized model checking of token-passing systems}},
  doi          = {10.1007/978-3-642-54013-4_15},
  volume       = {8318},
  year         = {2014},
}

@article{11080,
  abstract     = {The spindle assembly checkpoint prevents separation of sister chromatids until each kinetochore is attached to the mitotic spindle. Rodriguez-Bravo et al. report that the nuclear pore complex scaffolds spindle assembly checkpoint signaling in interphase, providing a store of inhibitory signals that limits the speed of the subsequent mitosis.},
  author       = {Buchwalter, Abigail and HETZER, Martin W},
  issn         = {0092-8674},
  journal      = {Cell},
  keywords     = {General Biochemistry, Genetics and Molecular Biology},
  number       = {5},
  pages        = {868--869},
  publisher    = {Elsevier},
  title        = {{Nuclear pores set the speed limit for mitosis}},
  doi          = {10.1016/j.cell.2014.02.004},
  volume       = {156},
  year         = {2014},
}

@article{11081,
  abstract     = {In eukaryotic cells the nuclear genome is enclosed by the nuclear envelope (NE). In metazoans, the NE breaks down in mitosis and it has been assumed that the physical barrier separating nucleoplasm and cytoplasm remains intact during the rest of the cell cycle and cell differentiation. However, recent studies suggest that nonmitotic NE remodeling plays a critical role in development, virus infection, laminopathies, and cancer. Although the mechanisms underlying these NE restructuring events are currently being defined, one common theme is activation of protein kinase C family members in the interphase nucleus to disrupt the nuclear lamina, demonstrating the importance of the lamina in maintaining nuclear integrity.},
  author       = {Hatch, Emily and HETZER, Martin W},
  issn         = {1540-8140},
  journal      = {Journal of Cell Biology},
  keywords     = {Cell Biology},
  number       = {2},
  pages        = {133--141},
  publisher    = {Rockefeller University Press},
  title        = {{Breaching the nuclear envelope in development and disease}},
  doi          = {10.1083/jcb.201402003},
  volume       = {205},
  year         = {2014},
}

@article{11082,
  abstract     = {The nuclear pore complex (NPC) plays a critical role in gene expression by mediating import of transcription regulators into the nucleus and export of RNA transcripts to the cytoplasm. Emerging evidence suggests that in addition to mediating transport, a subset of nucleoporins (Nups) engage in transcriptional activation and elongation at genomic loci that are not associated with NPCs. The underlying mechanism and regulation of Nup mobility on and off nuclear pores remain unclear. Here we show that Nup50 is a mobile Nup with a pronounced presence both at the NPC and in the nucleoplasm that can move between these different localizations. Strikingly, the dynamic behavior of Nup50 in both locations is dependent on active transcription by RNA polymerase II and requires the N-terminal half of the protein, which contains importin α– and Nup153-binding domains. However, Nup50 dynamics are independent of importin α, Nup153, and Nup98, even though the latter two proteins also exhibit transcription-dependent mobility. Of interest, depletion of Nup50 from C2C12 myoblasts does not affect cell proliferation but inhibits differentiation into myotubes. Taken together, our results suggest a transport-independent role for Nup50 in chromatin biology that occurs away from the NPC.},
  author       = {Buchwalter, Abigail L. and Liang, Yun and HETZER, Martin W},
  issn         = {1059-1524},
  journal      = {Molecular Biology of the Cell},
  keywords     = {Cell Biology, Molecular Biology},
  number       = {16},
  pages        = {2472--2484},
  publisher    = {American Society for Cell Biology},
  title        = {{Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics}},
  doi          = {10.1091/mbc.e14-04-0865},
  volume       = {25},
  year         = {2014},
}

@article{11582,
  abstract     = {We have observed a sample of typical z ∼ 1 star-forming galaxies, selected from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared, multi-integral field unit instrument on the Very Large Telescope (VLT), in order to obtain their dynamics and metallicity gradients. The majority of our galaxies have a metallicity gradient consistent with being flat or negative (i.e. higher metallicity cores than outskirts). Intriguingly, we find a trend between metallicity gradient and specific star formation rate (sSFR), such that galaxies with a high sSFR tend to have relatively metal poor centres, a result which is strengthened when combined with data sets from the literature. This result appears to explain the discrepancies reported between different high-redshift studies and varying claims for evolution. From a galaxy evolution perspective, the trend we see would mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can be funnelled into its core, triggered either by merging or through efficient accretion. In fact, merging may play a significant role as it is the starburst galaxies at all epochs, which have the more positive metallicity gradients. Our results may help to explain the origin of the fundamental metallicity relation, in which galaxies at a fixed mass are observed to have lower metallicities at higher star formation rates, especially if the metallicity is measured in an aperture encompassing only the central regions of the galaxy. Finally, we note that this study demonstrates the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys.},
  author       = {Stott, John P. and Sobral, David and Swinbank, A. M. and Smail, Ian and Bower, Richard and Best, Philip N. and Sharples, Ray M. and Geach, James E. and Matthee, Jorryt J},
  issn         = {1365-2966},
  journal      = {Monthly Notices of the Royal Astronomical Society},
  keywords     = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: abundances, galaxies: evolution, galaxies: kinematics and dynamics},
  number       = {3},
  pages        = {2695--2704},
  publisher    = {Oxford University Press},
  title        = {{A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS}},
  doi          = {10.1093/mnras/stu1343},
  volume       = {443},
  year         = {2014},
}

@article{11583,
  abstract     = {Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely deep surveys, probing very small areas. As a consequence, candidates are very faint, making spectroscopic confirmation practically impossible. In order to overcome such limitations, we have undertaken the CF-HiZELS survey, which is a large-area, medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα) emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric redshifts and remove a significant amount of dusty lower redshift line-emitters at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked as strong candidates, but the majority have very weak constraints on their spectral energy distributions. Using follow-up observations with SINFONI/VLT, we are able to exclude the most robust candidates as LAEs. We put a strong constraint on the Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and future surveys. Our results show that surveys for the highest redshift LAEs are susceptible of multiple contaminations and that spectroscopic follow-up is absolutely necessary.},
  author       = {Matthee, Jorryt J and Sobral, David and Swinbank, A. M. and Smail, Ian and Best, P. N. and Kim, Jae-Woo and Franx, Marijn and Milvang-Jensen, Bo and Fynbo, Johan},
  issn         = {1365-2966},
  journal      = {Monthly Notices of the Royal Astronomical Society},
  keywords     = {Space and Planetary Science, Astronomy and Astrophysics, galaxies: evolution, galaxies: high-redshift, cosmology: observations, dark ages, reionization, first stars},
  number       = {3},
  pages        = {2375--2387},
  publisher    = {Oxford University Press},
  title        = {{A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys}},
  doi          = {10.1093/mnras/stu392},
  volume       = {440},
  year         = {2014},
}

@inproceedings{11789,
  abstract     = {We study a weighted online bipartite matching problem: G(V 1, V 2, E) is a weighted bipartite graph where V 1 is known beforehand and the vertices of V 2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices in V 1, so as to maximize the sum of weights of edges in the matching. If assignments to V 1 cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with free disposal, where vertices in V 1 can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over the course of the algorithm. For this problem, the greedy algorithm is 0.5-competitive and determining whether a better competitive ratio is achievable is a well known open problem.

We identify an interesting special case where the edge weights are decomposable as the product of two factors, one corresponding to each end point of the edge. This is analogous to the well studied related machines model in the scheduling literature, although the objective functions are different. For this case of decomposable edge weights, we design a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show that such instances with decomposable weights are non-trivial by establishing upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.

A tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1 case as well as the case where edge weights depend on the offline vertices only, but for these cases, reassignments cannot change the quality of the solution. Beating 0.5 for weighted matching where reassignments are necessary has been a significant challenge. We thus give the first online algorithm with competitive ratio strictly better than 0.5 for a non-trivial case of weighted matching with free disposal.},
  author       = {Charikar, Moses and Henzinger, Monika H and Nguyễn, Huy L.},
  booktitle    = {22nd Annual European Symposium on Algorithms},
  isbn         = {978-366244776-5},
  issn         = {0302-9743},
  location     = {Wroclaw, Poland},
  pages        = {260 -- 271},
  publisher    = {Springer Nature},
  title        = {{Online bipartite matching with decomposable weights}},
  doi          = {10.1007/978-3-662-44777-2_22},
  volume       = {8737},
  year         = {2014},
}

@inproceedings{11855,
  abstract     = {The decremental single-source shortest paths (SSSP) problem concerns maintaining the distances between a given source node s to every node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be easily solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach (JACM 1981) has been the fastest known algorithm for three decades. With the loss of a (1 + ε)-approximation factor, the running time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011), and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai (SODA 2014). In this paper, we finally bring the running time of this case down to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+o(1) log W) time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn log W) time is the O(mn 0.986 log W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works for the general weighted directed case. In contrast to the previous results which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature. A (d, ε)-hop set of a graph G = (V, E) is a set E' of weighted edges such that the distance between any pair of nodes in G can be (1 + ε)-approximated by their d-hop distance (given by a path containing at most d edges) on G'=(V, E∪E'). Our algorithm can maintain an (n o(1) , ε)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach tree. It results from extending and combining the monotone Even-Shiloach tree of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP technique of Bernstein (STOC 2013). These two new tools might be of independent interest.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  booktitle    = {55th Annual Symposium on Foundations of Computer Science},
  issn         = {0272-5428},
  location     = {Philadelphia, PA, United States},
  pages        = {146--155},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Decremental single-source shortest paths on undirected graphs in near-linear total update time}},
  doi          = {10.1109/focs.2014.24},
  year         = {2014},
}

@inproceedings{11870,
  abstract     = {We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it has O(1) query time and O(mn) total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long standing, open problem.

In this paper, we answer this question affirmatively. We obtain a randomized algorithm which, in a simplified form, achieves an Õ(mn0.984) expected total update time for SSR and (1 + ε)-approximate SSSP, where Õ(·) hides poly log n. We also extend our algorithm to achieve roughly the same running time for Strongly Connected Components (SCC), improving the algorithm of Roditty and Zwick (FOCS 2002), and an algorithm that improves the Õ (mn log W)-time algorithm of Bernstein (STOC 2013) for approximating SSSP on weighted directed graphs, where the edge weights are integers from 1 to W. All our algorithms have constant query time in the worst case.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  booktitle    = {46th Annual ACM Symposium on Theory of Computing},
  isbn         = {978-145032710-7},
  issn         = {0737-8017},
  location     = {New York, NY, United States},
  publisher    = {Association for Computing Machinery},
  title        = {{Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs}},
  doi          = {10.1145/2591796.2591869},
  year         = {2014},
}

@inproceedings{11875,
  abstract     = {We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph in  time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time per update. For maximum matching, we show how to maintain a (3 + e) approximation in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [13].},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Italiano, Giuseppe F.},
  booktitle    = {26th Annual ACM-SIAM Symposium on Discrete Algorithms},
  isbn         = {978-1-61197-374-7},
  location     = {San Diego, CA, United States},
  pages        = {785--804},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Deterministic fully dynamic data structures for vertex cover and matching}},
  doi          = {10.1137/1.9781611973730.54},
  year         = {2014},
}

@inproceedings{11876,
  abstract     = {We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier.

In obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than Õ(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  booktitle    = {25th Annual ACM-SIAM Symposium on Discrete Algorithms},
  isbn         = {978-1-61197-338-9},
  location     = {Portland, OR, United States},
  pages        = {1053--1072},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{A subquadratic-time algorithm for decremental single-source shortest paths}},
  doi          = {10.1137/1.9781611973402.79},
  year         = {2014},
}

@article{119,
  abstract     = {Observations of flowing granular matter have suggested that same-material tribocharging depends on particle size, typically rendering large grains positive and small ones negative. Models assuming the transfer of trapped electrons can account for this trend, but have not been validated. Tracking individual grains in an electric field, we show quantitatively that charge is transferred based on size between materially identical grains. However, the surface density of trapped electrons, measured independently by thermoluminescence techniques, is orders of magnitude too small to account for the scale of charge transferred. This reveals that trapped electrons are not a necessary ingredient for same-material tribocharging.},
  author       = {Waitukaitis, Scott R and Lee, Victor and Pierson, James and Forman, Steven and Jaeger, Heinrich},
  journal      = {APS Physics, Physical Review Letters},
  number       = {21},
  publisher    = {American Physical Society},
  title        = {{Size-dependent same-material tribocharging in insulating grains}},
  doi          = {10.1103/PhysRevLett.112.218001},
  volume       = {112},
  year         = {2014},
}

@article{11968,
  abstract     = {Membrane phospholipids typically contain fatty acids (FAs) of 16 and 18 carbon atoms. This particular chain length is evolutionarily highly conserved and presumably provides maximum stability and dynamic properties to biological membranes in response to nutritional or environmental cues. Here, we show that the relative proportion of C16 versus C18 FAs is regulated by the activity of acetyl-CoA carboxylase (Acc1), the first and rate-limiting enzyme of FA de novo synthesis. Acc1 activity is attenuated by AMPK/Snf1-dependent phosphorylation, which is required to maintain an appropriate acyl-chain length distribution. Moreover, we find that the transcriptional repressor Opi1 preferentially binds to C16 over C18 phosphatidic acid (PA) species: thus, C16-chain containing PA sequesters Opi1 more effectively to the ER, enabling AMPK/Snf1 control of PA acyl-chain length to determine the degree of derepression of Opi1 target genes. These findings reveal an unexpected regulatory link between the major energy-sensing kinase, membrane lipid composition, and transcription.},
  author       = {Hofbauer, Harald F. and Schopf, Florian H. and Schleifer, Hannes and Knittelfelder, Oskar L. and Pieber, Bartholomäus and Rechberger, Gerald N. and Wolinski, Heimo and Gaspar, Maria L. and Kappe, C. Oliver and Stadlmann, Johannes and Mechtler, Karl and Zenz, Alexandra and Lohner, Karl and Tehlivets, Oksana and Henry, Susan A. and Kohlwein, Sepp D.},
  issn         = {1878-1551},
  journal      = {Developmental Cell},
  number       = {6},
  pages        = {P729--739},
  publisher    = {Elsevier},
  title        = {{Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids}},
  doi          = {10.1016/j.devcel.2014.04.025},
  volume       = {29},
  year         = {2014},
}

@article{12638,
  abstract     = {Central Asian water resources largely depend on melt water generated in the Pamir and Tien Shan mountain ranges. To estimate future water availability in this region, it is necessary to use climate projections to estimate the future glacier extent and volume. In this study, we evaluate the impact of uncertainty in climate change projections on the future glacier extent in the Amu and Syr Darya river basins. To this end we use the latest climate change projections generated for the upcoming IPCC report (CMIP5) and, for comparison, projections used in the fourth IPCC assessment (CMIP3). With these projections we force a regionalized glacier mass balance model, and estimate changes in the basins' glacier extent as a function of the glacier size distribution in the basins and projected temperature and precipitation. This glacier mass balance model is specifically developed for implementation in large scale hydrological models, where the spatial resolution does not allow for simulating individual glaciers and data scarcity is an issue. Although the CMIP5 ensemble results in greater regional warming than the CMIP3 ensemble and the range in projections for temperature as well as precipitation is wider for the CMIP5 than for the CMIP3, the spread in projections of future glacier extent in Central Asia is similar for both ensembles. This is because differences in temperature rise are small during periods of maximum melt (July–September) while differences in precipitation change are small during the period of maximum accumulation (October–February). However, the model uncertainty due to parameter uncertainty is high, and has roughly the same importance as uncertainty in the climate projections. Uncertainty about the size of the decline in glacier extent remains large, making estimates of future Central Asian glacier evolution and downstream water availability uncertain.},
  author       = {Lutz, A. F. and Immerzeel, W. W. and Gobiet, A. and Pellicciotti, Francesca and Bierkens, M. F. P.},
  issn         = {1607-7938},
  journal      = {Hydrology and Earth System Sciences},
  keywords     = {General Earth and Planetary Sciences, General Engineering, General Environmental Science},
  number       = {9},
  pages        = {3661--3677},
  publisher    = {Copernicus GmbH},
  title        = {{Comparison of climate change signals in CMIP3 and CMIP5 multi-model ensembles and implications for Central Asian glaciers}},
  doi          = {10.5194/hess-17-3661-2013},
  volume       = {17},
  year         = {2013},
}

@article{12639,
  abstract     = {In the headwater catchments of the main Asian rivers, glaciohydrological models are a useful tool to anticipate impacts of climatic changes. However, the reliability of their projections strongly depends on the quality and quantity of data that are available for parameter estimation, model calibration and validation, as well as on the accuracy of climate change projections. In this study the physically oriented, glaciohydrological model TOPKAPI-ETH is used to simulate future changes in snow, glacier, and runoff from the Hunza River Basin in northern Pakistan. Three key sources of model uncertainty in future runoff projections are compared: model parameters, climate projections, and natural climate variability. A novel approach, applicable also to ungauged catchments, is used to determine which model parameters and model components significantly affect the overall model uncertainty. We show that the model is capable of reproducing streamflow and glacier mass balances, but that all analyzed sources of uncertainty significantly affect the reliability of future projections, and that their effect is variable in time and in space. The effect of parametric uncertainty often exceeds the impact of climate uncertainty and natural climate variability, especially in heavily glacierized subcatchments. The results of the uncertainty analysis allow detailed recommendations on network design and the timing and location of field measurements, which could efficiently help to reduce model uncertainty in the future.},
  author       = {Ragettli, S. and Pellicciotti, Francesca and Bordoy, R. and Immerzeel, W. W.},
  issn         = {0043-1397},
  journal      = {Water Resources Research},
  keywords     = {Water Science and Technology},
  number       = {9},
  pages        = {6048--6066},
  publisher    = {American Geophysical Union},
  title        = {{Sources of uncertainty in modeling the glaciohydrological response of a Karakoram watershed to climate change}},
  doi          = {10.1002/wrcr.20450},
  volume       = {49},
  year         = {2013},
}

@article{12641,
  abstract     = {We investigate the sensitivity of a distributed enhanced temperature-index (ETI) melt model, in order to understand which parameters have the largest influence on model outputs and thus need to be accurately known. We use melt and meteorological data from two Alpine glaciers and one glacier in the Andes of Chile. Sensitivity analysis is conducted in a systematic way in terms of parameters and the different conditions (day, night, clear-sky, overcast), melt seasons and glaciers examined. The sensitivity of total melt to changes in individual parameters is calculated using a local method around the optimal value of the parameters. We verify that the parameters are optimal at the distributed scale and assess the model uncertainty induced by uncertainty in the parameters using a Monte Carlo technique. Model sensitivity to parameters is consistent across melt seasons, glaciers, different conditions and the daily statistics examined. The parameters to which the model is most sensitive are the shortwave-radiation factor, the temperature lapse rate for extrapolation of air temperature, the albedo parameters, the temperature threshold and the cloud transmittance factor parameters. A parameter uncertainty of 5% results in a model uncertainty of 5.6% of mean melt on Haut Glacier d’Arolla, Switzerland.},
  author       = {Heynen, Martin and Pellicciotti, Francesca and Carenzo, Marco},
  issn         = {1727-5644},
  journal      = {Annals of Glaciology},
  number       = {63},
  pages        = {311--321},
  publisher    = {International Glaciological Society},
  title        = {{Parameter sensitivity of a distributed enhanced temperature-index melt model}},
  doi          = {10.3189/2013aog63a537},
  volume       = {54},
  year         = {2013},
}