@article{3257,
  abstract     = {Consider a convex relaxation f̂ of a pseudo-Boolean function f. We say that the relaxation is totally half-integral if f̂(x) is a polyhedral function with half-integral extreme points x, and this property is preserved after adding an arbitrary combination of constraints of the form x i=x j, x i=1-x j, and x i=γ where γ∈{0,1,1/2} is a constant. A well-known example is the roof duality relaxation for quadratic pseudo-Boolean functions f. We argue that total half-integrality is a natural requirement for generalizations of roof duality to arbitrary pseudo-Boolean functions. Our contributions are as follows. First, we provide a complete characterization of totally half-integral relaxations f̂ by establishing a one-to-one correspondence with bisubmodular functions. Second, we give a new characterization of bisubmodular functions. Finally, we show some relationships between general totally half-integral relaxations and relaxations based on the roof duality. On the conceptual level, our results show that bisubmodular functions provide a natural generalization of the roof duality approach to higher-order terms. This can be viewed as a non-submodular analogue of the fact that submodular functions generalize the s-t minimum cut problem with non-negative weights to higher-order terms.},
  author       = {Kolmogorov, Vladimir},
  journal      = {Discrete Applied Mathematics},
  number       = {4-5},
  pages        = {416 -- 426},
  publisher    = {Elsevier},
  title        = {{Generalized roof duality and bisubmodular functions}},
  doi          = {10.1016/j.dam.2011.10.026},
  volume       = {160},
  year         = {2012},
}

@article{3258,
  abstract     = {CA3 pyramidal neurons are important for memory formation and pattern completion in the hippocampal network. It is generally thought that proximal synapses from the mossy fibers activate these neurons most efficiently, whereas distal inputs from the perforant path have a weaker modulatory influence. We used confocally targeted patch-clamp recording from dendrites and axons to map the activation of rat CA3 pyramidal neurons at the subcellular level. Our results reveal two distinct dendritic domains. In the proximal domain, action potentials initiated in the axon backpropagate actively with large amplitude and fast time course. In the distal domain, Na+ channel–mediated dendritic spikes are efficiently initiated by waveforms mimicking synaptic events. CA3 pyramidal neuron dendrites showed a high Na+-to-K+ conductance density ratio, providing ideal conditions for active backpropagation and dendritic spike initiation. Dendritic spikes may enhance the computational power of CA3 pyramidal neurons in the hippocampal network.},
  author       = {Kim, Sooyun and Guzmán, José and Hu, Hua and Jonas, Peter M},
  issn         = {1546-1726},
  journal      = {Nature Neuroscience},
  number       = {4},
  pages        = {600 -- 606},
  publisher    = {Nature Publishing Group},
  title        = {{Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons}},
  doi          = {10.1038/nn.3060},
  volume       = {15},
  year         = {2012},
}

@article{3260,
  abstract     = {Many scenarios in the living world, where individual organisms compete for winning positions (or resources), have properties of auctions. Here we study the evolution of bids in biological auctions. For each auction, n individuals are drawn at random from a population of size N. Each individual makes a bid which entails a cost. The winner obtains a benefit of a certain value. Costs and benefits are translated into reproductive success (fitness). Therefore, successful bidding strategies spread in the population. We compare two types of auctions. In “biological all-pay auctions”, the costs are the bid for every participating individual. In “biological second price all-pay auctions”, the cost for everyone other than the winner is the bid, but the cost for the winner is the second highest bid. Second price all-pay auctions are generalizations of the “war of attrition” introduced by Maynard Smith. We study evolutionary dynamics in both types of auctions. We calculate pairwise invasion plots and evolutionarily stable distributions over the continuous strategy space. We find that the average bid in second price all-pay auctions is higher than in all-pay auctions, but the average cost for the winner is similar in both auctions. In both cases, the average bid is a declining function of the number of participants, n. The more individuals participate in an auction the smaller is the chance of winning, and thus expensive bids must be avoided.
},
  author       = {Chatterjee, Krishnendu and Reiter, Johannes and Nowak, Martin},
  journal      = {Theoretical Population Biology},
  number       = {1},
  pages        = {69 -- 80},
  publisher    = {Academic Press},
  title        = {{Evolutionary dynamics of biological auctions}},
  doi          = {10.1016/j.tpb.2011.11.003},
  volume       = {81},
  year         = {2012},
}

@article{3262,
  abstract     = {Living cells must control the reading out or "expression" of information encoded in their genomes, and this regulation often is mediated by transcription factors--proteins that bind to DNA and either enhance or repress the expression of nearby genes. But the expression of transcription factor proteins is itself regulated, and many transcription factors regulate their own expression in addition to responding to other input signals. Here we analyze the simplest of such self-regulatory circuits, asking how parameters can be chosen to optimize information transmission from inputs to outputs in the steady state. Some nonzero level of self-regulation is almost always optimal, with self-activation dominant when transcription factor concentrations are low and self-repression dominant when concentrations are high. In steady state the optimal self-activation is never strong enough to induce bistability, although there is a limit in which the optimal parameters are very close to the critical point.},
  author       = {Tkacik, Gasper and Walczak, Aleksandra and Bialek, William},
  journal      = { Physical Review E statistical nonlinear and soft matter physics },
  number       = {4},
  publisher    = {American Institute of Physics},
  title        = {{Optimizing information flow in small genetic networks. III. A self-interacting gene}},
  doi          = {10.1103/PhysRevE.85.041903},
  volume       = {85},
  year         = {2012},
}

@inproceedings{3280,
  abstract     = {The (decisional) learning with errors problem (LWE) asks to distinguish "noisy" inner products of a secret vector with random vectors from uniform. The learning parities with noise problem (LPN) is the special case where the elements of the vectors are bits. In recent years, the LWE and LPN problems have found many applications in cryptography. In this paper we introduce a (seemingly) much stronger adaptive assumption, called "subspace LWE" (SLWE), where the adversary can learn the inner product of the secret and random vectors after they were projected into an adaptively and adversarially chosen subspace. We prove that, surprisingly, the SLWE problem mapping into subspaces of dimension d is almost as hard as LWE using secrets of length d (the other direction is trivial.) This result immediately implies that several existing cryptosystems whose security is based on the hardness of the LWE/LPN problems are provably secure in a much stronger sense than anticipated. As an illustrative example we show that the standard way of using LPN for symmetric CPA secure encryption is even secure against a very powerful class of related key attacks. },
  author       = {Pietrzak, Krzysztof Z},
  location     = {Taormina, Sicily, Italy},
  pages        = {548 -- 563},
  publisher    = {Springer},
  title        = {{Subspace LWE}},
  doi          = {10.1007/978-3-642-28914-9_31},
  volume       = {7194},
  year         = {2012},
}

@inproceedings{3282,
  abstract     = {Traditionally, symmetric-key message authentication codes (MACs) are easily built from pseudorandom functions (PRFs). In this work we propose a wide variety of other approaches to building efficient MACs, without going through a PRF first. In particular, unlike deterministic PRF-based MACs, where each message has a unique valid tag, we give a number of probabilistic MAC constructions from various other primitives/assumptions. Our main results are summarized as follows: We show several new probabilistic MAC constructions from a variety of general assumptions, including CCA-secure encryption, Hash Proof Systems and key-homomorphic weak PRFs. By instantiating these frameworks under concrete number theoretic assumptions, we get several schemes which are more efficient than just using a state-of-the-art PRF instantiation under the corresponding assumption. For probabilistic MACs, unlike deterministic ones, unforgeability against a chosen message attack (uf-cma ) alone does not imply security if the adversary can additionally make verification queries (uf-cmva ). We give an efficient generic transformation from any uf-cma secure MAC which is "message-hiding" into a uf-cmva secure MAC. This resolves the main open problem of Kiltz et al. from Eurocrypt'11; By using our transformation on their constructions, we get the first efficient MACs from the LPN assumption. While all our new MAC constructions immediately give efficient actively secure, two-round symmetric-key identification schemes, we also show a very simple, three-round actively secure identification protocol from any weak PRF. In particular, the resulting protocol is much more efficient than the trivial approach of building a regular PRF from a weak PRF. © 2012 International Association for Cryptologic Research.},
  author       = {Dodis, Yevgeniy and Pietrzak, Krzysztof Z and Kiltz, Eike and Wichs, Daniel},
  location     = {Cambridge, UK},
  pages        = {355 -- 374},
  publisher    = {Springer},
  title        = {{Message authentication, revisited}},
  doi          = {10.1007/978-3-642-29011-4_22},
  volume       = {7237},
  year         = {2012},
}

@inproceedings{3284,
  abstract     = {We study the complexity of valued constraint satisfaction problems (VCSP). A problem from VCSP is characterised by a constraint language, a fixed set of cost functions over a finite domain. An instance of the problem is specified by a sum of cost functions from the language and the goal is to minimise the sum. Under the unique games conjecture, the approximability of finite-valued VCSPs is well-understood, see Raghavendra [FOCS’08]. However, there is no characterisation of finite-valued VCSPs, let alone general-valued VCSPs, that can be solved exactly in polynomial time, thus giving insights from a combinatorial optimisation perspective.
We consider the case of languages containing all possible unary cost functions. In the case of languages consisting of only {0, ∞}-valued cost functions (i.e. relations), such languages have been called conservative and studied by Bulatov [LICS’03] and recently by Barto [LICS’11]. Since we study valued languages, we call a language conservative if it contains all finite-valued unary cost functions. The computational complexity of conservative valued languages has been studied by Cohen et al. [AIJ’06] for languages over Boolean domains, by Deineko et al. [JACM’08] for {0,1}-valued languages (a.k.a Max-CSP), and by Takhanov [STACS’10] for {0,∞}-valued languages containing all finite- valued unary cost functions (a.k.a. Min-Cost-Hom).
We prove a Schaefer-like dichotomy theorem for conservative valued languages: if all cost functions in the language satisfy a certain condition (specified by a complementary combination of STP and MJN multimorphisms), then any instance can be solved in polynomial time (via a new algorithm developed in this paper), otherwise the language is NP-hard. This is the first complete complexity classification of general-valued constraint languages over non-Boolean domains. It is a common phenomenon that complexity classifications of problems over non-Boolean domains is significantly harder than the Boolean case. The polynomial-time algorithm we present for the tractable cases is a generalisation of the submodular minimisation problem and a result of Cohen et al. [TCS’08].
Our results generalise previous results by Takhanov [STACS’10] and (a subset of results) by Cohen et al. [AIJ’06] and Deineko et al. [JACM’08]. Moreover, our results do not rely on any computer-assisted search as in Deineko et al. [JACM’08], and provide a powerful tool for proving hardness of finite-valued and general-valued languages.},
  author       = {Vladimir Kolmogorov and Živný, Stanislav},
  pages        = {750 -- 759},
  publisher    = {SIAM},
  title        = {{The complexity of conservative valued CSPs}},
  year         = {2012},
}

@article{3289,
  abstract     = {Viral manipulation of transduction pathways associated with key cellular functions such as survival, response to microbial infection, and cytoskeleton reorganization can provide the supportive milieu for a productive infection. Here, we demonstrate that vaccinia virus (VACV) infection leads to activation of the stress-activated protein kinase (SAPK)/extracellular signal-regulated kinase (ERK) 4/7 (MKK4/7)-c-Jun N-terminal protein kinase 1/2 (JNK1/2) pathway; further, the stimulation of this pathway requires postpenetration, prereplicative events in the viral replication cycle. Although the formation of intracellular mature virus (IMV) was not affected in MKK4/7- or JNK1/2-knockout (KO) cells, we did note an accentuated deregulation of microtubule and actin network organization in infected JNK1/2-KO cells. This was followed by deregulated viral trafficking to the periphery and enhanced enveloped particle release. Furthermore, VACV infection induced alterations in the cell contractility and morphology, and cell migration was reduced in the JNK-KO cells. In addition, phosphorylation of proteins implicated with early cell contractility and cell migration, such as microtubule-associated protein 1B and paxillin, respectively, was not detected in the VACV-infected KO cells. In sum, our findings uncover a regulatory role played by the MKK4/7-JNK1/2 pathway in cytoskeleton reorganization during VACV infection.
},
  author       = {Pereira, Anna and Leite, Flávia and Brasil, Bruno and Soares Martins, Jamaria and Torres, Alice and Pimenta, Paulo and Souto Padrón, Thais and Tranktman, Paula and Ferreira, Paulo and Kroon, Erna and Bonjardim, Cláudio},
  journal      = {Journal of Virology},
  number       = {1},
  pages        = {172 -- 184},
  publisher    = {ASM},
  title        = {{A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization}},
  doi          = {10.1128/JVI.05638-11},
  volume       = {86},
  year         = {2012},
}

@article{3310,
  abstract     = {The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs, and written for non-experts in algebraic topology.},
  author       = {Bendich, Paul and Cabello, Sergio and Edelsbrunner, Herbert},
  journal      = {Pattern Recognition Letters},
  number       = {11},
  pages        = {1436 -- 1444},
  publisher    = {Elsevier},
  title        = {{A point calculus for interlevel set homology}},
  doi          = {10.1016/j.patrec.2011.10.007},
  volume       = {33},
  year         = {2012},
}

@inproceedings{10905,
  abstract     = {Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.
In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help.},
  author       = {Chatterjee, Krishnendu and Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  booktitle    = {Algorithms – ESA 2012},
  isbn         = {9783642330896},
  issn         = {1611-3349},
  location     = {Ljubljana, Slovenia},
  pages        = {301--312},
  publisher    = {Springer},
  title        = {{Polynomial-time algorithms for energy games with special weight structures}},
  doi          = {10.1007/978-3-642-33090-2_27},
  volume       = {7501},
  year         = {2012},
}

@inproceedings{10906,
  abstract     = {HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool.},
  author       = {Grebenshchikov, Sergey and Gupta, Ashutosh and Lopes, Nuno P. and Popeea, Corneliu and Rybalchenko, Andrey},
  booktitle    = {Tools and Algorithms for the Construction and Analysis of Systems},
  editor       = {Flanagan, Cormac and König, Barbara},
  isbn         = {9783642287558},
  issn         = {1611-3349},
  location     = {Tallinn, Estonia},
  pages        = {549--551},
  publisher    = {Springer},
  title        = {{HSF(C): A software verifier based on Horn clauses}},
  doi          = {10.1007/978-3-642-28756-5_46},
  volume       = {7214},
  year         = {2012},
}

@article{11090,
  abstract     = {Nuclear export of mRNAs is thought to occur exclusively through nuclear pore complexes. In this issue of Cell, Speese et al. identify an alternate pathway for mRNA export in muscle cells where ribonucleoprotein complexes involved in forming neuromuscular junctions transit the nuclear envelope by fusing with and budding through the nuclear membrane.},
  author       = {Hatch, Emily M. and HETZER, Martin W},
  issn         = {0092-8674},
  journal      = {Cell},
  keywords     = {General Biochemistry, Genetics and Molecular Biology},
  number       = {4},
  pages        = {733--735},
  publisher    = {Elsevier},
  title        = {{RNP export by nuclear envelope budding}},
  doi          = {10.1016/j.cell.2012.04.018},
  volume       = {149},
  year         = {2012},
}

@article{11093,
  abstract     = {Nuclear pore complexes (NPCs) are built from ∼30 different proteins called nucleoporins or Nups. Previous studies have shown that several Nups exhibit cell-type-specific expression and that mutations in NPC components result in tissue-specific diseases. Here we show that a specific change in NPC composition is required for both myogenic and neuronal differentiation. The transmembrane nucleoporin Nup210 is absent in proliferating myoblasts and embryonic stem cells (ESCs) but becomes expressed and incorporated into NPCs during cell differentiation. Preventing Nup210 production by RNAi blocks myogenesis and the differentiation of ESCs into neuroprogenitors. We found that the addition of Nup210 to NPCs does not affect nuclear transport but is required for the induction of genes that are essential for cell differentiation. Our results identify a single change in NPC composition as an essential step in cell differentiation and establish a role for Nup210 in gene expression regulation and cell fate determination.},
  author       = {D'Angelo, Maximiliano A. and Gomez-Cavazos, J. Sebastian and Mei, Arianna and Lackner, Daniel H. and HETZER, Martin W},
  issn         = {1534-5807},
  journal      = {Developmental Cell},
  keywords     = {Developmental Biology, Cell Biology, General Biochemistry, Genetics and Molecular Biology, Molecular Biology},
  number       = {2},
  pages        = {446--458},
  publisher    = {Elsevier},
  title        = {{A change in nuclear pore complex composition regulates cell differentiation}},
  doi          = {10.1016/j.devcel.2011.11.021},
  volume       = {22},
  year         = {2012},
}

@article{114,
  abstract     = {We report on an investigation of the solidification of a cornstarch and water suspension during normal impact on its surface. We find that a finite time after impact, the suspension displays characteristics reminiscent of a solid, including localized stress transmission, the development of a yield stress, and some elastic energy storage. The time dependence of these characteristics depends on the thickness of the cornstarch layer, showing that the solidification is a dynamic process driven by the impacting object. These findings confirm previous speculations that rapidly applied normal stress transforms the normally fluid-like suspension into a temporarily jammed solid and draw a clear distinction between the effects of normal stress and shear stress in dense suspensions.},
  author       = {Waitukaitis, Scott R and Jaeger, Heinrich},
  journal      = {Revista Cubana de Fisica},
  number       = {1E},
  pages        = {1E31 -- 1E33},
  publisher    = {Universidad de La Habana},
  title        = {{Solidification of a cornstarch and water suspension}},
  volume       = {29},
  year         = {2012},
}

@inproceedings{11794,
  abstract     = {We study individual rational, Pareto optimal, and incentive compatible mechanisms for auctions with heterogeneous items and budget limits. For multi-dimensional valuations we show that there can be no deterministic mechanism with these properties for divisible items. We use this to show that there can also be no randomized mechanism that achieves this for either divisible or indivisible items. For single-dimensional valuations we show that there can be no deterministic mechanism with these properties for indivisible items, but that there is a randomized mechanism that achieves this for either divisible or indivisible items. The impossibility results hold for public budgets, while the mechanism allows private budgets, which is in both cases the harder variant to show. While all positive results are polynomial-time algorithms, all negative results hold independent of complexity considerations.},
  author       = {Dütting, Paul and Henzinger, Monika H and Starnberger, Martin},
  booktitle    = {8th International Workshop on Internet and Network Economics},
  isbn         = {9783642353109},
  issn         = {1611-3349},
  location     = {Liverpool, United Kingdom},
  pages        = {44–57},
  publisher    = {Springer Nature},
  title        = {{Auctions with heterogeneous items and budget limits}},
  doi          = {10.1007/978-3-642-35311-6_4},
  volume       = {7695},
  year         = {2012},
}

@article{12649,
  abstract     = {Physically based hydrological models describe natural processes more accurately than conceptual models but require extensive data sets to produce accurate results. To identify the value of different data sets for improving the performance of the distributed hydrological model TOPKAPI we combine a multivariable validation technique with Monte Carlo simulations. The study is carried out in the snow and ice-dominated Rhonegletscher basin, as these types of mountainous basins are generally the most critical with respect to data availability and sensitivity to climate fluctuations. Each observational data set is used individually and in combination with the other data sets to determine a subset of best parameter combinations out of 10,000 Monte Carlos runs performed with randomly generated parameter sets. We validate model results against discharge, glacier mass balance, and satellite snow cover images for a 14 year time period (1994–2007). While the use of all data sets combined provides the best overall model performance (defined by the concurrent best agreement of simulated discharge, snow cover and mass balance with their respective measurements), the use of one or two variables for constraining the model results in poorer performance. Using only one data set for constraining the model glacier mass balance proved to be the most efficient observation leading to the best overall model performance. Our main result is that a combination of discharge and satellite snow cover images is best for improving model performance, since the volumetric information of discharge data and the spatial information of snow cover images are complementary.},
  author       = {Finger, David and Pellicciotti, Francesca and Konz, Markus and Rimkus, Stefan and Burlando, Paolo},
  issn         = {0043-1397},
  journal      = {Water Resources Research},
  number       = {7},
  publisher    = {American Geophysical Union},
  title        = {{The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model}},
  doi          = {10.1029/2010wr009824},
  volume       = {47},
  year         = {2011},
}

@article{12651,
  abstract     = {Temperature data from three Automatic Weather Stations and twelve Temperature Loggers are used to investigate the spatiotemporal variability of temperature over a glacier, its main atmospheric controls, the suitability of extrapolation techniques and their effect on melt modeling. We use data collected on Juncal Norte Glacier, central Chile, during one ablation season. We examine temporal and spatial variability in lapse rates (LRs), together with alternative statistical interpolation methods. The main control over the glacier thermal regime is the development of a katabatic boundary layer (KBL). Katabatic wind occurs at night and in the morning and is eroded in the afternoon. LRs reveal strong diurnal variability, with steeper LRs during the day when the katabatic wind weakens and shallower LRs during the night and morning. We suggest that temporally variable LRs should be used to account for the observed change. They tend to be steeper than equivalent constant LRs, and therefore result in a reduction in simulated melt compared to use of constant LRs when extrapolating from lower to higher elevations. In addition to the temporal variability, the temperature-elevation relationship varies also in space. Differences are evident between local LRs and including such variability in melt modeling affects melt simulations. Extrapolation methods based on the spatial variability of the observations after removal of the elevation trend, such as Inverse Distance Weighting or Kriging, do not seem necessary for simulations of gridded temperature data over a glacier.},
  author       = {Petersen, L. and Pellicciotti, Francesca},
  issn         = {0148-0227},
  journal      = {Journal of Geophysical Research: Atmospheres},
  keywords     = {Paleontology, Space and Planetary Science, Earth and Planetary Sciences (miscellaneous), Atmospheric Science, Earth-Surface Processes, Geochemistry and Petrology, Soil Science, Water Science and Technology, Ecology, Aquatic Science, Forestry, Oceanography, Geophysics},
  number       = {D23},
  publisher    = {American Geophysical Union},
  title        = {{Spatial and temporal variability of air temperature on a melting glacier: Atmospheric controls, extrapolation methods and their effect on melt modeling, Juncal Norte Glacier, Chile}},
  doi          = {10.1029/2011jd015842},
  volume       = {116},
  year         = {2011},
}

@article{12652,
  abstract     = {We explore the robustness and transferability of parameterizations of cloud radiative forcing used in glacier melt models at two sites in the Swiss Alps. We also look at the rationale behind some of the most commonly used approaches, and explore the relationship between cloud transmittance and several standard meteorological variables. The 2 m air-temperature diurnal range is the best predictor of variations in cloud transmittance. However, linear and exponential parameterizations can only explain 30–50% of the observed variance in computed cloud transmittance factors. We examine the impact of modelled cloud transmittance factors on both solar radiation and ablation rates computed with an enhanced temperature-index model. The melt model performance decreases when modelled radiation is used, the reduction being due to an underestimation of incoming solar radiation on clear-sky days. The model works well under overcast conditions. We also seek alternatives to the use of in situ ground data. However, outputs from an atmospheric model (2.2 km horizontal resolution) do not seem to provide an alternative to the parameterizations of cloud radiative forcing based on observations of air temperature at glacier automatic weather stations. Conversely, the correct definition of overcast conditions is important.},
  author       = {Pellicciotti, Francesca and Raschle, Thomas and Huerlimann, Thomas and Carenzo, Marco and Burlando, Paolo},
  issn         = {1727-5652},
  journal      = {Journal of Glaciology},
  number       = {202},
  pages        = {367--381},
  publisher    = {Cambridge University Press},
  title        = {{Transmission of solar radiation through clouds on melting glaciers: A comparison of parameterizations and their impact on melt modelling}},
  doi          = {10.3189/002214311796406013},
  volume       = {57},
  year         = {2011},
}

@article{9144,
  abstract     = {A cloud-resolving model is used to investigate the effect of warming on high percentiles of precipitation (precipitation extremes) in the idealized setting of radiative-convective equilibrium. While this idealized setting does not allow for several factors that influence precipitation in the tropics, it does allow for an evaluation of the response of precipitation extremes to warming in simulations with resolved rather than parameterized convection. The methodology developed should also be applicable to less idealized simulations.

Modeled precipitation extremes are found to increase in magnitude in response to an increase in sea surface temperature. A dry static energy budget is used to relate the changes in precipitation extremes to changes in atmospheric temperature, vertical velocity, and precipitation efficiency. To first order, the changes in precipitation extremes are captured by changes in the mean temperature structure of the atmosphere. Changes in vertical velocities play a secondary role and tend to weaken the strength of precipitation extremes, despite an intensification of updraft velocities in the upper troposphere. The influence of changes in condensate transports on precipitation extremes is quantified in terms of a precipitation efficiency; it does not change greatly with warming.

Tropical precipitation extremes have previously been found to increase at a greater fractional rate than the amount of atmospheric water vapor in observations of present-day variability and in some climate model simulations with parameterized convection. But the fractional increases in precipitation extremes in the cloud-resolving simulations are comparable in magnitude to those in surface water vapor concentrations (owing to a partial cancellation between dynamical and thermodynamical changes), and are substantially less than the fractional increases in column water vapor.},
  author       = {Muller, Caroline J and O’Gorman, Paul A. and Back, Larissa E.},
  issn         = {1520-0442},
  journal      = {Journal of Climate},
  keywords     = {Atmospheric Science},
  number       = {11},
  pages        = {2784--2800},
  publisher    = {American Meteorological Society},
  title        = {{Intensification of precipitation extremes with warming in a cloud-resolving model}},
  doi          = {10.1175/2011jcli3876.1},
  volume       = {24},
  year         = {2011},
}

@article{923,
  abstract     = {The conserved role of Notch signaling in controlling intestinal cell fate specification and homeostasis has been extensively studied. Nevertheless, the precise identity of the cells in which Notch signaling is active and the role of different Notch receptor paralogues in the intestine remain ambiguous, due to the lack of reliable tools to investigate Notch expression and function in vivo. We generated a new series of transgenic mice that allowed us, by lineage analysis, to formally prove that Notch1 and Notch2 are specifically expressed in crypt stem cells. In addition, a novel Notch reporter mouse, Hes1-EmGFP SAT, demonstrated exclusive Notch activity in crypt stem cells and absorptive progenitors. This roster of knock-in and reporter mice represents a valuable resource to functionally explore the Notch pathway in vivo in virtually all tissues.},
  author       = {Fré, Silvia and Hannezo, Edouard B and Šale, Sanja and Huyghe, Mathilde and Lafkas, Daniel and Kissel, Holger and Louvi, Angeliki and Greve, Jeffrey and Louvard, Daniel and Artavanis Tsakonas, Spyros},
  journal      = {PLoS One},
  number       = {10},
  publisher    = {Public Library of Science},
  title        = {{Notch lineages and activity in intestinal stem cells determined by a new set of knock in mice}},
  doi          = {10.1371/journal.pone.0025785},
  volume       = {6},
  year         = {2011},
}