@article{346, abstract = {Arrays of vertically aligned ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires (NWs) were prepared by means of the combination of two solution-growth processes. First, single-crystal ZnO NWs with controlled n-type doping were grown on conducting substrates by a low-cost, high-yield and seed-free electrochemical route. These NWs were covered by a titanium oxide shell of tunable thickness mediating successive adsorption-hydrolysis-condensation steps. Using this atomic-layer growth procedure, titania shells with controlled thickness and the anatase TiO2 phase were obtained after sintering at 450 °C. Higher sintering temperatures resulted in the formation of ZnO : Cl/ZnxTiOy/TiO2 core–shell NWs by the interdiffusion of Zn and Ti ions at the ZnO–TiO2 interface. The performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell NWs towards photoelectrochemical (PEC) water splitting was investigated as a function of the titania shell thickness. Furthermore, the performance of such core–shell NWs as photoelectrodes in dye-sensitized solar cells was also characterized. The TiO2 presence at the ZnO : Cl surface promoted a two-fold increase on the produced photocurrent densities, probing their potential for PEC and optoelectronic applications. Electrochemical impedance spectroscopy was used to corroborate the lower resistance for charge transfer between the NWs and the electrolyte in the presence of the TiO2 shell.}, author = {Fan, Jiandong and Zamani, Reza and Fábrega, Cristina and Shavel, Alexey and Flox, Cristina and Ibáñez, Maria and Andreu, Teresa and López, Amtonio and Arbiol, Jordi and Morante, Joan and Cabot, Andreu}, journal = {Journal of Physics D: Applied Physics}, number = {41}, publisher = {IOP Publishing Ltd.}, title = {{Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness}}, doi = {10.1088/0022-3727/45/41/415301}, volume = {45}, year = {2012}, } @article{347, abstract = {A synthetic route for producing Cu 2ZnGeSe 4 nanocrystals with narrow size distributions and controlled composition is presented. These nanocrystals were used to produce densely packed nanomaterials by hot-pressing. From the characterization of the thermoelectric properties of these nanomaterials, Cu 2ZnGeSe 4 is demonstrated to show excellent thermoelectric properties. A very preliminary adjustment of the nanocrystal composition has already resulted in a figure of merit of up to 0.55 at 450°C. }, author = {Ibáñez, Maria and Zamani, Reza and Lalonde, Aaron and Cadavid, Doris and Li, Wenhua and Shavel, Alexey and Arbiol, Jordi and Morante, Joan and Gorsse, Stéphane and Snyder, G Jeffrey and Cabot, Andreu}, journal = {Journal of the American Chemical Society}, number = {9}, pages = {4060 -- 4063}, publisher = {ACS}, title = {{Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties}}, doi = {10.1021/ja211952z}, volume = {134}, year = {2012}, } @article{377, abstract = {The potential to control the composition and crystal phase at the nanometer scale enable the production of nanocrystalline materials with enhanced functionalities and new applications. In the present work, we detail a novel colloidal synthesis route to prepare nanoparticles of the ternary semiconductor Cu2GeSe3 (CGSe) with nanometer-scale control over their crystal phases. We also demonstrate the structural effect on the thermoelectric properties of bottom-up-prepared CGSe nanomaterials. By careful adjustment of the nucleation and growth temperatures, pure orthorhombic CGSe nanoparticles with cationic order or polytypic CGSe nanoparticles with disordered cation positions can be produced. In this second type of nanoparticle, a high density of twins can be created to periodically change the atomic plane stacking, forming a hexagonal wurtzite CGSe phase. The high yield of the synthetic routes reported here allows the production of single-phase and multiphase CGSe nanoparticles in the gram scale, which permits characterization of the thermoelectric properties of these materials. Reduced thermal conductivities and a related 2.5-fold increase of the thermoelectric figure of merit for multiphase nanomaterials compared to pure-phase CGSe are systematically obtained. These results are discussed in terms of the density and efficiency of phonon scattering centers in both types of materials.}, author = {Ibáñez, Maria and Zamani, Reza and Li, Wenhua and Cadavid, Doris and Gorse, Stéphane and Katchoi, Nebll and Shavel, Alexey and López, Antonioo and Morante, Joan and Arbiol, Jordi and Cabot, Andreu}, journal = {Chemistry of Materials}, number = {23}, pages = {4615 -- 4622}, publisher = {American Chemical Society}, title = {{Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials}}, doi = {10.1021/cm303252q}, volume = {24}, year = {2012}, } @article{3836, abstract = {Hierarchical Timing Language (HTL) is a coordination language for distributed, hard real-time applications. HTL is a hierarchical extension of Giotto and, like its predecessor, based on the logical execution time (LET) paradigm of real-time programming. Giotto is compiled into code for a virtual machine, called the EmbeddedMachine (or E machine). If HTL is targeted to the E machine, then the hierarchicalprogram structure needs to be flattened; the flattening makes separatecompilation difficult, and may result in E machinecode of exponential size. In this paper, we propose a generalization of the E machine, which supports a hierarchicalprogram structure at runtime through real-time trigger mechanisms that are arranged in a tree. We present the generalized E machine, and a modular compiler for HTL that generates code of linear size. The compiler may generate code for any part of a given HTL program separately in any order.}, author = {Ghosal, Arkadeb and Iercan, Daniel and Kirsch, Christoph and Henzinger, Thomas A and Sangiovanni Vincentelli, Alberto}, journal = {Science of Computer Programming}, number = {2}, pages = {96 -- 112}, publisher = {Elsevier}, title = {{Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code}}, doi = {10.1016/j.scico.2010.06.004}, volume = {77}, year = {2012}, } @article{3846, abstract = {We summarize classical and recent results about two-player games played on graphs with ω-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications.}, author = {Chatterjee, Krishnendu and Henzinger, Thomas A}, journal = {Journal of Computer and System Sciences}, number = {2}, pages = {394 -- 413}, publisher = {Elsevier}, title = {{A survey of stochastic ω regular games}}, doi = {10.1016/j.jcss.2011.05.002}, volume = {78}, year = {2012}, } @article{387, abstract = {In this Letter we present detailed study of the density of states near defects in Bi 2Se 3. In particular, we present data on the commonly found triangular defects in this system. While we do not find any measurable quasiparticle scattering interference effects, we do find localized resonances, which can be well fitted by theory once the potential is taken to be extended to properly account for the observed defects. The data together with the fits confirm that while the local density of states around the Dirac point of the electronic spectrum at the surface is significantly disrupted near the impurity by the creation of low-energy resonance state, the Dirac point is not locally destroyed. We discuss our results in terms of the expected protected surface state of topological insulators. © 2012 American Physical Society.}, author = {Alpichshev, Zhanybek and Biswas, Rudro and Balatsky, Alexander and Analytis, James and Chu, Jiunhaw and Fisher, Ian and Kapitulnik, Aharon}, journal = {Physical Review Letters}, number = {20}, publisher = {American Physical Society}, title = {{STM imaging of impurity resonances on Bi 2Se 3}}, doi = {10.1103/PhysRevLett.108.206402}, volume = {108}, year = {2012}, } @article{492, abstract = {Background: Characterizing root system architecture (RSA) is essential to understanding the development and function of vascular plants. Identifying RSA-associated genes also represents an underexplored opportunity for crop improvement. Software tools are needed to accelerate the pace at which quantitative traits of RSA are estimated from images of root networks.Results: We have developed GiA Roots (General Image Analysis of Roots), a semi-automated software tool designed specifically for the high-throughput analysis of root system images. GiA Roots includes user-assisted algorithms to distinguish root from background and a fully automated pipeline that extracts dozens of root system phenotypes. Quantitative information on each phenotype, along with intermediate steps for full reproducibility, is returned to the end-user for downstream analysis. GiA Roots has a GUI front end and a command-line interface for interweaving the software into large-scale workflows. GiA Roots can also be extended to estimate novel phenotypes specified by the end-user.Conclusions: We demonstrate the use of GiA Roots on a set of 2393 images of rice roots representing 12 genotypes from the species Oryza sativa. We validate trait measurements against prior analyses of this image set that demonstrated that RSA traits are likely heritable and associated with genotypic differences. Moreover, we demonstrate that GiA Roots is extensible and an end-user can add functionality so that GiA Roots can estimate novel RSA traits. In summary, we show that the software can function as an efficient tool as part of a workflow to move from large numbers of root images to downstream analysis.}, author = {Galkovskyi, Taras and Mileyko, Yuriy and Bucksch, Alexander and Moore, Brad and Symonova, Olga and Price, Charles and Topp, Chrostopher and Iyer Pascuzzi, Anjali and Zurek, Paul and Fang, Suqin and Harer, John and Benfey, Philip and Weitz, Joshua}, journal = {BMC Plant Biology}, publisher = {BioMed Central}, title = {{GiA Roots: Software for the high throughput analysis of plant root system architecture}}, doi = {10.1186/1471-2229-12-116}, volume = {12}, year = {2012}, } @article{493, abstract = {The BCI competition IV stands in the tradition of prior BCI competitions that aim to provide high quality neuroscientific data for open access to the scientific community. As experienced already in prior competitions not only scientists from the narrow field of BCI compete, but scholars with a broad variety of backgrounds and nationalities. They include high specialists as well as students.The goals of all BCI competitions have always been to challenge with respect to novel paradigms and complex data. We report on the following challenges: (1) asynchronous data, (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer, (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after past competitions, our hope is that winning entries may enhance the analysis methods of future BCIs.}, author = {Tangermann, Michael and Müller, Klaus and Aertsen, Ad and Birbaumer, Niels and Braun, Christoph and Brunner, Clemens and Leeb, Robert and Mehring, Carsten and Miller, Kai and Müller Putz, Gernot and Nolte, Guido and Pfurtscheller, Gert and Preissl, Hubert and Schalk, Gerwin and Schlögl, Alois and Vidaurre, Carmen and Waldert, Stephan and Blankertz, Benjamin}, journal = {Frontiers in Neuroscience}, publisher = {Frontiers Research Foundation}, title = {{Review of the BCI competition IV}}, doi = {10.3389/fnins.2012.00055}, volume = {6}, year = {2012}, } @article{494, abstract = {We solve the longstanding open problems of the blow-up involved in the translations, when possible, of a nondeterministic Büchi word automaton (NBW) to a nondeterministic co-Büchi word automaton (NCW) and to a deterministic co-Büchi word automaton (DCW). For the NBW to NCW translation, the currently known upper bound is 2o(nlog n) and the lower bound is 1.5n. We improve the upper bound to n2n and describe a matching lower bound of 2ω(n). For the NBW to DCW translation, the currently known upper bound is 2o(nlog n). We improve it to 2 o(n), which is asymptotically tight. Both of our upper-bound constructions are based on a simple subset construction, do not involve intermediate automata with richer acceptance conditions, and can be implemented symbolically. We continue and solve the open problems of translating nondeterministic Streett, Rabin, Muller, and parity word automata to NCW and to DCW. Going via an intermediate NBW is not optimal and we describe direct, simple, and asymptotically tight constructions, involving a 2o(n) blow-up. The constructions are variants of the subset construction, providing a unified approach for translating all common classes of automata to NCW and DCW. Beyond the theoretical importance of the results, we point to numerous applications of the new constructions. In particular, they imply a simple subset-construction based translation, when possible, of LTL to deterministic Büchi word automata.}, author = {Boker, Udi and Kupferman, Orna}, journal = {ACM Transactions on Computational Logic (TOCL)}, number = {4}, publisher = {ACM}, title = {{Translating to Co-Büchi made tight, unified, and useful}}, doi = {10.1145/2362355.2362357}, volume = {13}, year = {2012}, } @inproceedings{495, abstract = {An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice.}, author = {Kruckman, Alex and Rubin, Sasha and Sheridan, John and Zax, Ben}, booktitle = {Proceedings GandALF 2012}, location = {Napoli, Italy}, pages = {238 -- 246}, publisher = {Open Publishing Association}, title = {{A Myhill Nerode theorem for automata with advice}}, doi = {10.4204/EPTCS.96.18}, volume = {96}, year = {2012}, } @inproceedings{496, abstract = {We study the expressive power of logical interpretations on the class of scattered trees, namely those with countably many infinite branches. Scattered trees can be thought of as the tree analogue of scattered linear orders. Every scattered tree has an ordinal rank that reflects the structure of its infinite branches. We prove, roughly, that trees and orders of large rank cannot be interpreted in scattered trees of small rank. We consider a quite general notion of interpretation: each element of the interpreted structure is represented by a set of tuples of subsets of the interpreting tree. Our trees are countable, not necessarily finitely branching, and may have finitely many unary predicates as labellings. We also show how to replace injective set-interpretations in (not necessarily scattered) trees by 'finitary' set-interpretations.}, author = {Rabinovich, Alexander and Rubin, Sasha}, location = {Dubrovnik, Croatia}, publisher = {IEEE}, title = {{Interpretations in trees with countably many branches}}, doi = {10.1109/LICS.2012.65}, year = {2012}, } @inproceedings{497, abstract = {One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm. © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath.}, author = {Chatterjee, Krishnendu and Chaubal, Siddhesh and Kamath, Pritish}, location = {Fontainebleau, France}, pages = {167 -- 182}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Faster algorithms for alternating refinement relations}}, doi = {10.4230/LIPIcs.CSL.2012.167}, volume = {16}, year = {2012}, } @article{498, abstract = {Understanding patterns and correlates of local adaptation in heterogeneous landscapes can provide important information in the selection of appropriate seed sources for restoration. We assessed the extent of local adaptation of fitness components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance, quantitative (QST) and neutral (FST) genetic differentiation, and size of the local and foreign populations could predict patterns of adaptive differentiation. Local adaptation varied among populations and fitness components. Including all population pairs, local adaptation was observed for seedling survival, but not for biomass, while foreign genotype advantage was observed for reproduction (number of inflorescences). Among population pairs, local adaptation increased with QST and local population size for biomass. QST was associated with environmental distance, suggesting ecological selection for phenotypic divergence. However, low FST and variation in population structure in small populations demonstrates the interaction of gene flow and drift in constraining local adaptation in R. leptorrhynchoides. Our study indicates that for species in heterogeneous landscapes, collecting seed from large populations from similar environments to candidate sites is likely to provide the most appropriate seed sources for restoration.}, author = {Pickup, Melinda and Field, David and Rowell, David and Young, Andrew}, journal = {Evolutionary Applications}, number = {8}, pages = {913 -- 924}, publisher = {Wiley-Blackwell}, title = {{Predicting local adaptation in fragmented plant populations: Implications for restoration genetics}}, doi = {10.1111/j.1752-4571.2012.00284.x}, volume = {5}, year = {2012}, } @article{506, author = {Sixt, Michael K}, journal = {Journal of Cell Biology}, number = {3}, pages = {347 -- 349}, publisher = {Rockefeller University Press}, title = {{Cell migration: Fibroblasts find a new way to get ahead}}, doi = {10.1083/jcb.201204039}, volume = {197}, year = {2012}, } @misc{5377, abstract = {Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean-payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two- player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP- hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two- player pushdown games. Finally we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.}, author = {Chatterjee, Krishnendu and Velner, Yaron}, issn = {2664-1690}, pages = {33}, publisher = {IST Austria}, title = {{Mean-payoff pushdown games}}, doi = {10.15479/AT:IST-2012-0002}, year = {2012}, } @misc{5378, abstract = {One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.}, author = {Chatterjee, Krishnendu and Chaubal, Siddhesh and Kamath, Pritish}, issn = {2664-1690}, pages = {21}, publisher = {IST Austria}, title = {{Faster algorithms for alternating refinement relations}}, doi = {10.15479/AT:IST-2012-0001}, 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}, } @inbook{12650, abstract = {Streamflow is a hydrological variable measured at a defined river cross-section; it spatially integrates the runoff generating processes in the contributing watershed, including precipitation and air temperature. Trends in streamflow are progressive changes in the time series of streamflow that can be detected with statistical methods and their statistical significance can be assessed. Mountainous regions are particularly vulnerable to streamflow change because of their high specific runoff and the sensitivity to the distribution of precipitation and air temperature, and the processes of snow accumulation and melt.}, author = {Molnar, Peter and Burlando, Paolo and Pellicciotti, Francesca}, booktitle = {Encyclopedia of Snow, Ice and Glaciers}, editor = {Singh, Vijay and Singh, Pratap and Haritashya, Umesh}, isbn = {978-90-481-2641-5}, issn = {1871-756X}, pages = {1084--1089}, publisher = {Springer Nature}, title = {{Streamflow Trends in Mountainous Regions}}, doi = {10.1007/978-90-481-2642-2_543}, 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}, }