[{"publist_id":"7938","date_updated":"2021-01-12T06:48:44Z","publisher":"Elsevier","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"05","date_published":"2013-05-24T00:00:00Z","abstract":[{"lang":"eng","text":"We describe a model experiment for dynamic jamming: a two-dimensional collection of initially unjammed disks that are forced into the jammed state by uniaxial compression via a rake. This leads to a stable densification front that travels ahead of the rake, leaving regions behind it jammed. Using disk conservation in conjunction with an upper limit to the packing fraction at jamming onset, we predict the front speed as a function of packing fraction and rake speed. However, we find that the jamming front has a finite width, a feature that cannot be explained by disk conservation alone. This width appears to diverge on approach to jamming, which suggests that it may be related to growing lengthscales encountered in other jamming studies."}],"status":"public","intvolume":"       102","article_number":"44001","title":"Dynamic jamming fronts","volume":102,"language":[{"iso":"eng"}],"day":"24","year":"2013","acknowledgement":"This work was supported by the National Science Foundation (NSF) through its Materials Research Science and Engineering program (DMR-0820054). SRW was supported by the U.S. Department of Energy, Office of Basic Energy Sciences, Division of Materials Sciences and Engineering under Award DE-FG02-03ER46088. LKR acknowledges support through the NSF Research Experience for Undergraduates program.","author":[{"first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R"},{"first_name":"Leah","last_name":"Roth","full_name":"Roth, Leah"},{"first_name":"Vincenzo","last_name":"Vitelli","full_name":"Vitelli, Vincenzo"},{"first_name":"Heinrich","last_name":"Jaeger","full_name":"Jaeger, Heinrich"}],"publication":"EPL","extern":"1","type":"journal_article","_id":"116","issue":"4","date_created":"2018-12-11T11:44:43Z","quality_controlled":"1","oa_version":"None","doi":"10.1209/0295-5075/102/44001","citation":{"short":"S.R. Waitukaitis, L. Roth, V. Vitelli, H. Jaeger, EPL 102 (2013).","chicago":"Waitukaitis, Scott R, Leah Roth, Vincenzo Vitelli, and Heinrich Jaeger. “Dynamic Jamming Fronts.” <i>EPL</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1209/0295-5075/102/44001\">https://doi.org/10.1209/0295-5075/102/44001</a>.","apa":"Waitukaitis, S. R., Roth, L., Vitelli, V., &#38; Jaeger, H. (2013). Dynamic jamming fronts. <i>EPL</i>. Elsevier. <a href=\"https://doi.org/10.1209/0295-5075/102/44001\">https://doi.org/10.1209/0295-5075/102/44001</a>","mla":"Waitukaitis, Scott R., et al. “Dynamic Jamming Fronts.” <i>EPL</i>, vol. 102, no. 4, 44001, Elsevier, 2013, doi:<a href=\"https://doi.org/10.1209/0295-5075/102/44001\">10.1209/0295-5075/102/44001</a>.","ista":"Waitukaitis SR, Roth L, Vitelli V, Jaeger H. 2013. Dynamic jamming fronts. EPL. 102(4), 44001.","ieee":"S. R. Waitukaitis, L. Roth, V. Vitelli, and H. Jaeger, “Dynamic jamming fronts,” <i>EPL</i>, vol. 102, no. 4. Elsevier, 2013.","ama":"Waitukaitis SR, Roth L, Vitelli V, Jaeger H. Dynamic jamming fronts. <i>EPL</i>. 2013;102(4). doi:<a href=\"https://doi.org/10.1209/0295-5075/102/44001\">10.1209/0295-5075/102/44001</a>"}},{"extern":"1","quality_controlled":"1","doi":"10.1145/2435215.2435218","citation":{"chicago":"Baykan, Eda, Ingmar Weber, and Monika H Henzinger. “A Comprehensive Study of Techniques for URL-Based Web Page Language Classification.” <i>ACM Transactions on the Web</i>. Association for Computing Machinery, 2013. <a href=\"https://doi.org/10.1145/2435215.2435218\">https://doi.org/10.1145/2435215.2435218</a>.","short":"E. Baykan, I. Weber, M.H. Henzinger, ACM Transactions on the Web 7 (2013).","apa":"Baykan, E., Weber, I., &#38; Henzinger, M. H. (2013). A comprehensive study of techniques for URL-based web page language classification. <i>ACM Transactions on the Web</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/2435215.2435218\">https://doi.org/10.1145/2435215.2435218</a>","mla":"Baykan, Eda, et al. “A Comprehensive Study of Techniques for URL-Based Web Page Language Classification.” <i>ACM Transactions on the Web</i>, vol. 7, no. 1, 3, Association for Computing Machinery, 2013, doi:<a href=\"https://doi.org/10.1145/2435215.2435218\">10.1145/2435215.2435218</a>.","ista":"Baykan E, Weber I, Henzinger MH. 2013. A comprehensive study of techniques for URL-based web page language classification. ACM Transactions on the Web. 7(1), 3.","ieee":"E. Baykan, I. Weber, and M. H. Henzinger, “A comprehensive study of techniques for URL-based web page language classification,” <i>ACM Transactions on the Web</i>, vol. 7, no. 1. Association for Computing Machinery, 2013.","ama":"Baykan E, Weber I, Henzinger MH. A comprehensive study of techniques for URL-based web page language classification. <i>ACM Transactions on the Web</i>. 2013;7(1). doi:<a href=\"https://doi.org/10.1145/2435215.2435218\">10.1145/2435215.2435218</a>"},"intvolume":"         7","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1559-114X"],"issn":["1559-1131"]},"year":"2013","abstract":[{"text":"Given only the URL of a Web page, can we identify its language? In this article we examine this question. URL-based language classification is useful when the content of the Web page is not available or downloading the content is a waste of bandwidth and time.\r\nWe built URL-based language classifiers for English, German, French, Spanish, and Italian by applying a variety of algorithms and features. As algorithms we used machine learning algorithms which are widely applied for text classification and state-of-art algorithms for language identification of text. As features we used words, various sized n-grams, and custom-made features (our novel feature set). We compared our approaches with two baseline methods, namely classification by country code top-level domains and classification by IP addresses of the hosting Web servers.\r\n\r\nWe trained and tested our classifiers in a 10-fold cross-validation setup on a dataset obtained from the Open Directory Project and from querying a commercial search engine. We obtained the lowest F1-measure for English (94) and the highest F1-measure for German (98) with the best performing classifiers.\r\n\r\nWe also evaluated the performance of our methods: (i) on a set of Web pages written in Adobe Flash and (ii) as part of a language-focused crawler. In the first case, the content of the Web page is hard to extract and in the second page downloading pages of the “wrong” language constitutes a waste of bandwidth. In both settings the best classifiers have a high accuracy with an F1-measure between 95 (for English) and 98 (for Italian) for the Adobe Flash pages and a precision between 90 (for Italian) and 97 (for French) for the language-focused crawler.","lang":"eng"}],"keyword":["Computer Networks and Communications"],"author":[{"full_name":"Baykan, Eda","first_name":"Eda","last_name":"Baykan"},{"full_name":"Weber, Ingmar","first_name":"Ingmar","last_name":"Weber"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"publication":"ACM Transactions on the Web","article_processing_charge":"No","_id":"11671","issue":"1","type":"journal_article","date_created":"2022-07-27T12:50:18Z","oa_version":"None","status":"public","article_number":"3","title":"A comprehensive study of techniques for URL-based web page language classification","volume":7,"day":"01","scopus_import":"1","date_updated":"2022-09-12T08:51:57Z","publisher":"Association for Computing Machinery","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","month":"03","date_published":"2013-03-01T00:00:00Z"},{"author":[{"full_name":"Jaeger, Heinrich","first_name":"Heinrich","last_name":"Jaeger"},{"last_name":"Miskin","first_name":"Marc","full_name":"Miskin, Marc"},{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"}],"conference":{"start_date":"2013-07-08","end_date":"2013-07-12","location":"Sydney, Australia","name":"Powders and Grains"},"acknowledgement":"This work was supported by the NSF MRSEC program under DMR-0820054. Additional support came from the US Army Research Office through W911NF-12-1-0182.","citation":{"mla":"Jaeger, Heinrich, et al. “From Nanoscale Cohesion to Macroscale Entanglement: Opportunities for Designing Granular Aggregate Behaviour by Tailoring Grain Shape and Interactions.” <i> AIP Conference Proceedings</i>, vol. 1542, AIP, 2013, pp. 3–6, doi:<a href=\"https://doi.org/10.1063/1.4811858\">10.1063/1.4811858</a>.","ista":"Jaeger H, Miskin M, Waitukaitis SR. 2013. From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions.  AIP Conference Proceedings. Powders and Grains vol. 1542, 3–6.","ieee":"H. Jaeger, M. Miskin, and S. R. Waitukaitis, “From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions,” in <i> AIP Conference Proceedings</i>, Sydney, Australia, 2013, vol. 1542, pp. 3–6.","chicago":"Jaeger, Heinrich, Marc Miskin, and Scott R Waitukaitis. “From Nanoscale Cohesion to Macroscale Entanglement: Opportunities for Designing Granular Aggregate Behaviour by Tailoring Grain Shape and Interactions.” In <i> AIP Conference Proceedings</i>, 1542:3–6. AIP, 2013. <a href=\"https://doi.org/10.1063/1.4811858\">https://doi.org/10.1063/1.4811858</a>.","short":"H. Jaeger, M. Miskin, S.R. Waitukaitis, in:,  AIP Conference Proceedings, AIP, 2013, pp. 3–6.","apa":"Jaeger, H., Miskin, M., &#38; Waitukaitis, S. R. (2013). From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions. In <i> AIP Conference Proceedings</i> (Vol. 1542, pp. 3–6). Sydney, Australia: AIP. <a href=\"https://doi.org/10.1063/1.4811858\">https://doi.org/10.1063/1.4811858</a>","ama":"Jaeger H, Miskin M, Waitukaitis SR. From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions. In: <i> AIP Conference Proceedings</i>. Vol 1542. AIP; 2013:3-6. doi:<a href=\"https://doi.org/10.1063/1.4811858\">10.1063/1.4811858</a>"},"doi":"10.1063/1.4811858","quality_controlled":"1","oa_version":"None","date_created":"2018-12-11T11:44:43Z","type":"conference","_id":"117","publication":" AIP Conference Proceedings","extern":"1","title":"From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions","volume":1542,"intvolume":"      1542","status":"public","year":"2013","day":"01","language":[{"iso":"eng"}],"page":"3 - 6","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"AIP","date_updated":"2021-01-12T06:48:49Z","publist_id":"7937","abstract":[{"text":"The packing arrangement of individual particles inside a granular material and the resulting response to applied stresses depend critically on particle-particle interactions. One aspect that recently received attention are nanoscale surface features of particles, which play an important role in determining the strength of cohesive van der Waals and capillary interactions and also affect tribo-charging of grains. We describe experiments on freely falling granular streams that can detect the contributions from all three of these forces. We show that it is possible to measure the charge of individual grains and build up distributions that are detailed enough to provide stringent tests of tribo-charging models currently available. A second aspect concerns particle shape. In this case steric interactions become important and new types of aggregate behavior can be expected when non-convex particle shapes are considered that can interlock or entangle. However, a general connection between the mechanical response of a granular material and the constituents\\' shape remains unknown. This has made it infeasible to tackle the &quot;inverse packing problem&quot;, namely to start from a given, desired behavior for the aggregate as a whole and then find the particle shape the produces it. We discuss a new approach, using concepts rooted in artificial evolution that provides a way to solve this inverse problem. This approach facilitates exploring the role of arbitrary particle geometry in jammed systems and invites the discovery and design of granular matter with optimized properties.","lang":"eng"}],"date_published":"2013-06-01T00:00:00Z","month":"06"},{"scopus_import":"1","page":"1","publisher":"Elsevier","date_updated":"2023-02-23T10:09:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","month":"01","date_published":"2013-01-01T00:00:00Z","article_type":"letter_note","author":[{"full_name":"Aceto, Luca","first_name":"Luca","last_name":"Aceto"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Sgall","first_name":"Jiří","full_name":"Sgall, Jiří"}],"type":"journal_article","_id":"11758","issue":"1","article_processing_charge":"No","extern":"1","publication":"Information and Computation","citation":{"ama":"Aceto L, Henzinger MH, Sgall J. 38th International Colloquium on Automata, Languages and Programming. <i>Information and Computation</i>. 2013;222(1):1. doi:<a href=\"https://doi.org/10.1016/j.ic.2012.11.002\">10.1016/j.ic.2012.11.002</a>","chicago":"Aceto, Luca, Monika H Henzinger, and Jiří Sgall. “38th International Colloquium on Automata, Languages and Programming.” <i>Information and Computation</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.ic.2012.11.002\">https://doi.org/10.1016/j.ic.2012.11.002</a>.","short":"L. Aceto, M.H. Henzinger, J. Sgall, Information and Computation 222 (2013) 1.","apa":"Aceto, L., Henzinger, M. H., &#38; Sgall, J. (2013). 38th International Colloquium on Automata, Languages and Programming. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2012.11.002\">https://doi.org/10.1016/j.ic.2012.11.002</a>","mla":"Aceto, Luca, et al. “38th International Colloquium on Automata, Languages and Programming.” <i>Information and Computation</i>, vol. 222, no. 1, Elsevier, 2013, p. 1, doi:<a href=\"https://doi.org/10.1016/j.ic.2012.11.002\">10.1016/j.ic.2012.11.002</a>.","ista":"Aceto L, Henzinger MH, Sgall J. 2013. 38th International Colloquium on Automata, Languages and Programming. Information and Computation. 222(1), 1.","ieee":"L. Aceto, M. H. Henzinger, and J. Sgall, “38th International Colloquium on Automata, Languages and Programming,” <i>Information and Computation</i>, vol. 222, no. 1. Elsevier, p. 1, 2013."},"doi":"10.1016/j.ic.2012.11.002","date_created":"2022-08-08T11:25:34Z","oa_version":"None","quality_controlled":"1","intvolume":"       222","status":"public","title":"38th International Colloquium on Automata, Languages and Programming","volume":222,"publication_identifier":{"issn":["0890-5401"]},"language":[{"iso":"eng"}],"day":"01","year":"2013"},{"extern":"1","citation":{"chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Sponsored Search, Market Equilibria, and the Hungarian Method.” <i>Information Processing Letters</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.ipl.2012.11.006\">https://doi.org/10.1016/j.ipl.2012.11.006</a>.","short":"P. Dütting, M.H. Henzinger, I. Weber, Information Processing Letters 113 (2013) 67–73.","apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2013). Sponsored search, market equilibria, and the Hungarian Method. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2012.11.006\">https://doi.org/10.1016/j.ipl.2012.11.006</a>","mla":"Dütting, Paul, et al. “Sponsored Search, Market Equilibria, and the Hungarian Method.” <i>Information Processing Letters</i>, vol. 113, no. 3, Elsevier, 2013, pp. 67–73, doi:<a href=\"https://doi.org/10.1016/j.ipl.2012.11.006\">10.1016/j.ipl.2012.11.006</a>.","ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Sponsored search, market equilibria, and the Hungarian Method,” <i>Information Processing Letters</i>, vol. 113, no. 3. Elsevier, pp. 67–73, 2013.","ista":"Dütting P, Henzinger MH, Weber I. 2013. Sponsored search, market equilibria, and the Hungarian Method. Information Processing Letters. 113(3), 67–73.","ama":"Dütting P, Henzinger MH, Weber I. Sponsored search, market equilibria, and the Hungarian Method. <i>Information Processing Letters</i>. 2013;113(3):67-73. doi:<a href=\"https://doi.org/10.1016/j.ipl.2012.11.006\">10.1016/j.ipl.2012.11.006</a>"},"doi":"10.1016/j.ipl.2012.11.006","quality_controlled":"1","arxiv":1,"intvolume":"       113","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0020-0190"]},"year":"2013","external_id":{"arxiv":["0912.1934"]},"page":"67-73","oa":1,"abstract":[{"lang":"eng","text":"Matching markets play a prominent role in economic theory. A prime example of such a market is the sponsored search market. Here, as in other markets of that kind, market equilibria correspond to feasible, envy free, and bidder optimal outcomes. For settings without budgets such an outcome always exists and can be computed in polynomial-time by the so-called Hungarian Method. Moreover, every mechanism that computes such an outcome is incentive compatible. We show that the Hungarian Method can be modified so that it finds a feasible, envy free, and bidder optimal outcome for settings with budgets. We also show that in settings with budgets no mechanism that computes such an outcome can be incentive compatible for all inputs. For inputs in general position, however, the presented mechanism—as any other mechanism that computes such an outcome for settings with budgets—is incentive compatible."}],"author":[{"full_name":"Dütting, Paul","last_name":"Dütting","first_name":"Paul"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Weber","first_name":"Ingmar","full_name":"Weber, Ingmar"}],"type":"journal_article","_id":"11759","issue":"3","article_processing_charge":"No","publication":"Information Processing Letters","oa_version":"Preprint","date_created":"2022-08-08T11:29:08Z","status":"public","volume":113,"title":"Sponsored search, market equilibria, and the Hungarian Method","day":"15","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/0912.1934","open_access":"1"}],"publisher":"Elsevier","date_updated":"2022-09-12T09:36:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","month":"02","date_published":"2013-02-15T00:00:00Z","article_type":"original"},{"abstract":[{"text":"The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many valuation spaces computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that the welfare loss increases in expressiveness. All our bounds apply to equilibrium concepts that can be computed in polynomial time as well as to learning outcomes.","lang":"eng"}],"oa":1,"external_id":{"arxiv":["1310.3153"]},"alternative_title":["LNCS"],"page":"146–159","publication_identifier":{"issn":["1611-3349"],"isbn":["9783642450457"]},"language":[{"iso":"eng"}],"year":"2013","intvolume":"      8289","arxiv":1,"extern":"1","quality_controlled":"1","doi":"10.1007/978-3-642-45046-4_13","citation":{"mla":"Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” <i>9th International Conference on Web and Internet Economics</i>, vol. 8289, Springer Nature, 2013, pp. 146–159, doi:<a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">10.1007/978-3-642-45046-4_13</a>.","ista":"Dütting P, Henzinger MH, Starnberger M. 2013. Valuation compressions in VCG-based combinatorial auctions. 9th International Conference on Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8289, 146–159.","ieee":"P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” in <i>9th International Conference on Web and Internet Economics</i>, Cambridge, MA, USA, 2013, vol. 8289, pp. 146–159.","short":"P. Dütting, M.H. Henzinger, M. Starnberger, in:, 9th International Conference on Web and Internet Economics, Springer Nature, 2013, pp. 146–159.","chicago":"Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions in VCG-Based Combinatorial Auctions.” In <i>9th International Conference on Web and Internet Economics</i>, 8289:146–159. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">https://doi.org/10.1007/978-3-642-45046-4_13</a>.","apa":"Dütting, P., Henzinger, M. H., &#38; Starnberger, M. (2013). Valuation compressions in VCG-based combinatorial auctions. In <i>9th International Conference on Web and Internet Economics</i> (Vol. 8289, pp. 146–159). Cambridge, MA, USA: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">https://doi.org/10.1007/978-3-642-45046-4_13</a>","ama":"Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. In: <i>9th International Conference on Web and Internet Economics</i>. Vol 8289. Springer Nature; 2013:146–159. doi:<a href=\"https://doi.org/10.1007/978-3-642-45046-4_13\">10.1007/978-3-642-45046-4_13</a>"},"conference":{"name":"WINE: International Conference on Web and Internet Economics","location":"Cambridge, MA, USA","end_date":"2013-12-14","start_date":"2013-12-01"},"date_published":"2013-12-01T00:00:00Z","month":"12","date_updated":"2023-02-13T11:20:42Z","publisher":"Springer Nature","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://arxiv.org/abs/1310.3153","open_access":"1"}],"scopus_import":"1","day":"01","status":"public","volume":8289,"title":"Valuation compressions in VCG-based combinatorial auctions","publication":"9th International Conference on Web and Internet Economics","_id":"11791","article_processing_charge":"No","type":"conference","oa_version":"Preprint","date_created":"2022-08-11T11:05:14Z","author":[{"last_name":"Dütting","first_name":"Paul","full_name":"Dütting, Paul"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Starnberger","first_name":"Martin","full_name":"Starnberger, Martin"}]},{"main_file_link":[{"url":"https://arxiv.org/abs/1611.05753","open_access":"1"}],"scopus_import":"1","month":"09","date_published":"2013-09-01T00:00:00Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T16:28:24Z","publisher":"Springer Nature","oa_version":"Preprint","date_created":"2022-08-11T11:18:19Z","publication":"21st Annual European Symposium on Algorithms","article_processing_charge":"No","_id":"11792","type":"conference","author":[{"full_name":"Dvořák, Wolfgang","first_name":"Wolfgang","last_name":"Dvořák"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"full_name":"Williamson, David P.","last_name":"Williamson","first_name":"David P."}],"day":"01","title":"Maximizing a submodular function with viability constraints","volume":8125,"status":"public","page":"409 - 420","alternative_title":["LNCS"],"external_id":{"arxiv":["1611.05753"]},"abstract":[{"lang":"eng","text":"We study the problem of maximizing a monotone submodular function with viability constraints. This problem originates from computational biology, where we are given a phylogenetic tree over a set of species and a directed graph, the so-called food web, encoding viability constraints between these species. These food webs usually have constant depth. The goal is to select a subset of k species that satisfies the viability constraints and has maximal phylogenetic diversity. As this problem is known to be NP-hard, we investigate approximation algorithm. We present the first constant factor approximation algorithm if the depth is constant. Its approximation ratio is (1−1𝑒√). This algorithm not only applies to phylogenetic trees with viability constraints but for arbitrary monotone submodular set functions with viability constraints. Second, we show that there is no (1 − 1/e + ε)-approximation algorithm for our problem setting (even for additive functions) and that there is no approximation algorithm for a slight extension of this setting."}],"oa":1,"quality_controlled":"1","doi":"10.1007/978-3-642-40450-4_35","citation":{"chicago":"Dvořák, Wolfgang, Monika H Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” In <i>21st Annual European Symposium on Algorithms</i>, 8125:409–20. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">https://doi.org/10.1007/978-3-642-40450-4_35</a>.","short":"W. Dvořák, M.H. Henzinger, D.P. Williamson, in:, 21st Annual European Symposium on Algorithms, Springer Nature, 2013, pp. 409–420.","apa":"Dvořák, W., Henzinger, M. H., &#38; Williamson, D. P. (2013). Maximizing a submodular function with viability constraints. In <i>21st Annual European Symposium on Algorithms</i> (Vol. 8125, pp. 409–420). Sophia Antipolis, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">https://doi.org/10.1007/978-3-642-40450-4_35</a>","mla":"Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” <i>21st Annual European Symposium on Algorithms</i>, vol. 8125, Springer Nature, 2013, pp. 409–20, doi:<a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">10.1007/978-3-642-40450-4_35</a>.","ieee":"W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” in <i>21st Annual European Symposium on Algorithms</i>, Sophia Antipolis, France, 2013, vol. 8125, pp. 409–420.","ista":"Dvořák W, Henzinger MH, Williamson DP. 2013. Maximizing a submodular function with viability constraints. 21st Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 8125, 409–420.","ama":"Dvořák W, Henzinger MH, Williamson DP. Maximizing a submodular function with viability constraints. In: <i>21st Annual European Symposium on Algorithms</i>. Vol 8125. Springer Nature; 2013:409-420. doi:<a href=\"https://doi.org/10.1007/978-3-642-40450-4_35\">10.1007/978-3-642-40450-4_35</a>"},"extern":"1","related_material":{"record":[{"relation":"later_version","status":"public","id":"11792"}]},"conference":{"name":"ESA: European Symposium on Algorithms","end_date":"2013-09-04","start_date":"2013-09-02","location":"Sophia Antipolis, France"},"year":"2013","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1611-3349"],"isbn":["9783642404498"]},"arxiv":1,"intvolume":"      8125"},{"external_id":{"arxiv":["1512.08147"]},"page":"607–619","alternative_title":["LNCS"],"oa":1,"abstract":[{"lang":"eng","text":"We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We show (1 + ε)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D, the maximum diameter of the network. This breaks the Θ(D) time bound of recomputing “from scratch”.\r\n\r\nOur technique also leads to a (1 + ε)-approximate incremental algorithm for single-source shortest paths (SSSP) in the sequential (usual RAM) model. Prior to our work, the state of the art was the classic exact algorithm of [9] that is optimal under some assumptions [27]. Our result is the first to show that, in the incremental setting, this bound can be beaten in certain cases if a small approximation is allowed."}],"conference":{"start_date":"2013-07-08","end_date":"2013-07-12","location":"Riga, Latvia","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"related_material":{"record":[{"id":"11793","status":"public","relation":"later_version"}]},"extern":"1","citation":{"short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 40th International Colloquium on Automata, Languages, and Programming, Springer Nature, 2013, pp. 607–619.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” In <i>40th International Colloquium on Automata, Languages, and Programming</i>, 7966:607–619. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">https://doi.org/10.1007/978-3-642-39212-2_53</a>.","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2013). Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In <i>40th International Colloquium on Automata, Languages, and Programming</i> (Vol. 7966, pp. 607–619). Riga, Latvia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">https://doi.org/10.1007/978-3-642-39212-2_53</a>","mla":"Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” <i>40th International Colloquium on Automata, Languages, and Programming</i>, vol. 7966, Springer Nature, 2013, pp. 607–619, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">10.1007/978-3-642-39212-2_53</a>.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks,” in <i>40th International Colloquium on Automata, Languages, and Programming</i>, Riga, Latvia, 2013, vol. 7966, pp. 607–619.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2013. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. 40th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7966, 607–619.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In: <i>40th International Colloquium on Automata, Languages, and Programming</i>. Vol 7966. Springer Nature; 2013:607–619. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">10.1007/978-3-642-39212-2_53</a>"},"doi":"10.1007/978-3-642-39212-2_53","quality_controlled":"1","arxiv":1,"intvolume":"      7966","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1611-3349"],"isbn":["9783642392115"]},"year":"2013","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1512.08147"}],"publisher":"Springer Nature","date_updated":"2023-02-21T16:28:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","month":"07","date_published":"2013-07-01T00:00:00Z","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"type":"conference","_id":"11793","article_processing_charge":"No","publication":"40th International Colloquium on Automata, Languages, and Programming","oa_version":"Preprint","date_created":"2022-08-11T11:25:13Z","status":"public","title":"Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks","volume":7966,"day":"01"},{"title":"Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization","status":"public","day":"01","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"oa_version":"Preprint","date_created":"2022-08-16T08:22:37Z","publication":"54th Annual Symposium on Foundations of Computer Science","type":"conference","article_processing_charge":"No","_id":"11856","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-17T09:56:04Z","publisher":"Institute of Electrical and Electronics Engineers","date_published":"2013-10-01T00:00:00Z","month":"10","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1308.0776","open_access":"1"}],"arxiv":1,"year":"2013","publication_identifier":{"eisbn":["978-0-7695-5135-7"],"issn":["0272-5428"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2013-10-26","end_date":"2013-10-29","location":"Berkeley, CA, United States","name":"FOCS: Symposium on Foundations of Computer Science"},"quality_controlled":"1","citation":{"ama":"Henzinger MH, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In: <i>54th Annual Symposium on Foundations of Computer Science</i>. Institute of Electrical and Electronics Engineers; 2013:538-547. doi:<a href=\"https://doi.org/10.1109/focs.2013.64\">10.1109/focs.2013.64</a>","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 54th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2013, pp. 538–547.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” In <i>54th Annual Symposium on Foundations of Computer Science</i>, 538–47. Institute of Electrical and Electronics Engineers, 2013. <a href=\"https://doi.org/10.1109/focs.2013.64\">https://doi.org/10.1109/focs.2013.64</a>.","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2013). Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In <i>54th Annual Symposium on Foundations of Computer Science</i> (pp. 538–547). Berkeley, CA, United States: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/focs.2013.64\">https://doi.org/10.1109/focs.2013.64</a>","mla":"Henzinger, Monika H., et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” <i>54th Annual Symposium on Foundations of Computer Science</i>, Institute of Electrical and Electronics Engineers, 2013, pp. 538–47, doi:<a href=\"https://doi.org/10.1109/focs.2013.64\">10.1109/focs.2013.64</a>.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2013. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. 54th Annual Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science, 538–547.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” in <i>54th Annual Symposium on Foundations of Computer Science</i>, Berkeley, CA, United States, 2013, pp. 538–547."},"doi":"10.1109/focs.2013.64","extern":"1","abstract":[{"lang":"eng","text":"We study dynamic (1 + ϵ)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected n-node m-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of Ȏ(mn) and constant query time by Roditty and Zwick (FOCS 2004). The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach (JACM 1981); it has a total update time of O(mn 2 ) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of Ȏ(n 5/2 ) and constant query time that has an additive error of two in addition to the 1 + ϵ multiplicative error. This beats the previous Ȏ(mn) time when m = Ω(n 3/2 ). Note that the additive error is unavoidable since, even in the static case, an O(n 3-δ )-time (a so-called truly sub cubic) combinatorial algorithm with 1 + ϵ multiplicative error cannot have an additive error less than 2 - ϵ, unless we make a major breakthrough for Boolean matrix multiplication (Dor, Halperin and Zwick FOCS 1996) and many other long-standing problems (Vassilevska Williams and Williams FOCS 2010). The algorithm can also be turned into a (2 + ϵ)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3 + ϵ)-approximation algorithm with Ȏ(n 5/2+O(1√(log n)) ) running time of Bernstein and Roditty (SODA 2011) in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of Ȏ(mn) and a query time of O(log log n). The algorithm has a multiplicative error of 1 + ϵ and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in his STOC 2013 paper. In order to achieve our results, we introduce two new techniques: (1) A lazy Even-Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called locally persevering emulator. (2) A derandomization technique based on moving Even-Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest."}],"oa":1,"page":"538-547","external_id":{"arxiv":["1308.0776"]}},{"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"11799"}]},"citation":{"ieee":"P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” <i>Theoretical Computer Science</i>, vol. 478, no. 3. Elsevier, pp. 22–32, 2013.","ista":"Dütting P, Henzinger MH, Weber I. 2013. Bidder optimal assignments for general utilities. Theoretical Computer Science. 478(3), 22–32.","mla":"Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.” <i>Theoretical Computer Science</i>, vol. 478, no. 3, Elsevier, 2013, pp. 22–32, doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">10.1016/j.tcs.2013.01.030</a>.","apa":"Dütting, P., Henzinger, M. H., &#38; Weber, I. (2013). Bidder optimal assignments for general utilities. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">https://doi.org/10.1016/j.tcs.2013.01.030</a>","short":"P. Dütting, M.H. Henzinger, I. Weber, Theoretical Computer Science 478 (2013) 22–32.","chicago":"Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Bidder Optimal Assignments for General Utilities.” <i>Theoretical Computer Science</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">https://doi.org/10.1016/j.tcs.2013.01.030</a>.","ama":"Dütting P, Henzinger MH, Weber I. Bidder optimal assignments for general utilities. <i>Theoretical Computer Science</i>. 2013;478(3):22-32. doi:<a href=\"https://doi.org/10.1016/j.tcs.2013.01.030\">10.1016/j.tcs.2013.01.030</a>"},"doi":"10.1016/j.tcs.2013.01.030","quality_controlled":"1","extern":"1","intvolume":"       478","year":"2013","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0304-3975"]},"page":"22-32","abstract":[{"lang":"eng","text":"We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing his utility of being matched to item j at price pj. For this setting we prove that a bidder optimal outcome always exists, even when the utility functions are non-linear and non-continuous. We give sufficient conditions under\r\nwhich every mechanism that finds a bidder optimal outcome is incentive compatible. We also give a mechanism that finds a bidder optimal outcome if the conditions for incentive compatibility are satisfied. The running time of this mechanism is exponential in the number of items, but polynomial in the number of bidders."}],"author":[{"full_name":"Dütting, Paul","last_name":"Dütting","first_name":"Paul"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Ingmar","last_name":"Weber","full_name":"Weber, Ingmar"}],"date_created":"2022-08-17T11:11:04Z","oa_version":"None","issue":"3","_id":"11902","type":"journal_article","article_processing_charge":"No","publication":"Theoretical Computer Science","title":"Bidder optimal assignments for general utilities","volume":478,"status":"public","day":"25","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Elsevier","date_updated":"2023-02-21T16:28:41Z","month":"03","date_published":"2013-03-25T00:00:00Z","article_type":"original"},{"author":[{"first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"first_name":"Sabrina Teixeira","last_name":"Martinez","full_name":"Martinez, Sabrina Teixeira"},{"last_name":"Cantillo","first_name":"David","full_name":"Cantillo, David"},{"full_name":"Kappe, C. Oliver","first_name":"C. Oliver","last_name":"Kappe"}],"_id":"11959","article_processing_charge":"No","type":"journal_article","issue":"39","publication":"Angewandte Chemie International Edition","extern":"1","citation":{"ista":"Pieber B, Martinez ST, Cantillo D, Kappe CO. 2013. In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. Angewandte Chemie International Edition. 52(39), 10241–10244.","ieee":"B. Pieber, S. T. Martinez, D. Cantillo, and C. O. Kappe, “In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins,” <i>Angewandte Chemie International Edition</i>, vol. 52, no. 39. Wiley, pp. 10241–10244, 2013.","mla":"Pieber, Bartholomäus, et al. “In Situ Generation of Diimide from Hydrazine and Oxygen: Continuous-Flow Transfer Hydrogenation of Olefins.” <i>Angewandte Chemie International Edition</i>, vol. 52, no. 39, Wiley, 2013, pp. 10241–44, doi:<a href=\"https://doi.org/10.1002/anie.201303528\">10.1002/anie.201303528</a>.","apa":"Pieber, B., Martinez, S. T., Cantillo, D., &#38; Kappe, C. O. (2013). In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201303528\">https://doi.org/10.1002/anie.201303528</a>","short":"B. Pieber, S.T. Martinez, D. Cantillo, C.O. Kappe, Angewandte Chemie International Edition 52 (2013) 10241–10244.","chicago":"Pieber, Bartholomäus, Sabrina Teixeira Martinez, David Cantillo, and C. Oliver Kappe. “In Situ Generation of Diimide from Hydrazine and Oxygen: Continuous-Flow Transfer Hydrogenation of Olefins.” <i>Angewandte Chemie International Edition</i>. Wiley, 2013. <a href=\"https://doi.org/10.1002/anie.201303528\">https://doi.org/10.1002/anie.201303528</a>.","ama":"Pieber B, Martinez ST, Cantillo D, Kappe CO. In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins. <i>Angewandte Chemie International Edition</i>. 2013;52(39):10241-10244. doi:<a href=\"https://doi.org/10.1002/anie.201303528\">10.1002/anie.201303528</a>"},"doi":"10.1002/anie.201303528","oa_version":"None","quality_controlled":"1","date_created":"2022-08-24T11:01:47Z","intvolume":"        52","status":"public","volume":52,"title":"In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"language":[{"iso":"eng"}],"day":"23","year":"2013","page":"10241-10244","scopus_import":"1","publisher":"Wiley","date_updated":"2023-02-21T10:09:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2013-09-23T00:00:00Z","month":"09","article_type":"letter_note","abstract":[{"lang":"eng","text":"No catalyst required! A highly efficient, catalyst-free process to generate diimide in situ from hydrazine monohydrate and molecular oxygen for the selective reduction of alkenes has been developed. The use of a gas–liquid segmented flow system allowed safe operating conditions and dramatically enhanced this atom-economical reaction, resulting in short processing times."}]},{"scopus_import":"1","page":"1088-1094","publisher":"Wiley","date_updated":"2023-02-21T10:09:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","month":"01","date_published":"2013-01-21T00:00:00Z","article_type":"letter_note","abstract":[{"lang":"eng","text":"It's not magic! The effects observed in microwave-irradiated chemical transformations can in most cases be rationalized by purely bulk thermal phenomena associated with rapid heating to elevated temperatures. As discussed in this Essay, the existence of so-called nonthermal or specific microwave effects is highly doubtful."}],"author":[{"last_name":"Kappe","first_name":"C. Oliver","full_name":"Kappe, C. Oliver"},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","first_name":"Bartholomäus","last_name":"Pieber","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X"},{"full_name":"Dallinger, Doris","last_name":"Dallinger","first_name":"Doris"}],"_id":"11960","article_processing_charge":"No","issue":"4","type":"journal_article","extern":"1","publication":"Angewandte Chemie International Edition","doi":"10.1002/anie.201204103","citation":{"chicago":"Kappe, C. Oliver, Bartholomäus Pieber, and Doris Dallinger. “Microwave Effects in Organic Synthesis: Myth or Reality?” <i>Angewandte Chemie International Edition</i>. Wiley, 2013. <a href=\"https://doi.org/10.1002/anie.201204103\">https://doi.org/10.1002/anie.201204103</a>.","short":"C.O. Kappe, B. Pieber, D. Dallinger, Angewandte Chemie International Edition 52 (2013) 1088–1094.","apa":"Kappe, C. O., Pieber, B., &#38; Dallinger, D. (2013). Microwave effects in organic synthesis: Myth or reality? <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201204103\">https://doi.org/10.1002/anie.201204103</a>","mla":"Kappe, C. Oliver, et al. “Microwave Effects in Organic Synthesis: Myth or Reality?” <i>Angewandte Chemie International Edition</i>, vol. 52, no. 4, Wiley, 2013, pp. 1088–94, doi:<a href=\"https://doi.org/10.1002/anie.201204103\">10.1002/anie.201204103</a>.","ieee":"C. O. Kappe, B. Pieber, and D. Dallinger, “Microwave effects in organic synthesis: Myth or reality?,” <i>Angewandte Chemie International Edition</i>, vol. 52, no. 4. Wiley, pp. 1088–1094, 2013.","ista":"Kappe CO, Pieber B, Dallinger D. 2013. Microwave effects in organic synthesis: Myth or reality? Angewandte Chemie International Edition. 52(4), 1088–1094.","ama":"Kappe CO, Pieber B, Dallinger D. Microwave effects in organic synthesis: Myth or reality? <i>Angewandte Chemie International Edition</i>. 2013;52(4):1088-1094. doi:<a href=\"https://doi.org/10.1002/anie.201204103\">10.1002/anie.201204103</a>"},"date_created":"2022-08-24T11:05:04Z","quality_controlled":"1","oa_version":"None","intvolume":"        52","status":"public","volume":52,"title":"Microwave effects in organic synthesis: Myth or reality?","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"day":"21","year":"2013"},{"scopus_import":"1","page":"320-324","month":"02","date_published":"2013-02-01T00:00:00Z","article_type":"letter_note","abstract":[{"text":"The use of high-temperature/pressure gas–liquid continuous flow conditions dramatically enhances the iron-catalyzed aerobic oxidation of 2-benzylpyridines to their corresponding ketones. Pressurized air serves as a readily available oxygen source and propylene carbonate as a green solvent in this radically intensified preparation of synthetically valuable 2-aroylpyridines.","lang":"eng"}],"publisher":"Royal Society of Chemistry","date_updated":"2023-02-21T10:09:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","type":"journal_article","_id":"11973","issue":"2","article_processing_charge":"No","extern":"1","publication":"Green Chemistry","doi":"10.1039/c2gc36896j","citation":{"ama":"Pieber B, Kappe CO. Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent. <i>Green Chemistry</i>. 2013;15(2):320-324. doi:<a href=\"https://doi.org/10.1039/c2gc36896j\">10.1039/c2gc36896j</a>","mla":"Pieber, Bartholomäus, and C. Oliver Kappe. “Direct Aerobic Oxidation of 2-Benzylpyridines in a Gas-Liquid Continuous-Flow Regime Using Propylene Carbonate as a Solvent.” <i>Green Chemistry</i>, vol. 15, no. 2, Royal Society of Chemistry, 2013, pp. 320–24, doi:<a href=\"https://doi.org/10.1039/c2gc36896j\">10.1039/c2gc36896j</a>.","ieee":"B. Pieber and C. O. Kappe, “Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent,” <i>Green Chemistry</i>, vol. 15, no. 2. Royal Society of Chemistry, pp. 320–324, 2013.","ista":"Pieber B, Kappe CO. 2013. Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent. Green Chemistry. 15(2), 320–324.","chicago":"Pieber, Bartholomäus, and C. Oliver Kappe. “Direct Aerobic Oxidation of 2-Benzylpyridines in a Gas-Liquid Continuous-Flow Regime Using Propylene Carbonate as a Solvent.” <i>Green Chemistry</i>. Royal Society of Chemistry, 2013. <a href=\"https://doi.org/10.1039/c2gc36896j\">https://doi.org/10.1039/c2gc36896j</a>.","short":"B. Pieber, C.O. Kappe, Green Chemistry 15 (2013) 320–324.","apa":"Pieber, B., &#38; Kappe, C. O. (2013). Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent. <i>Green Chemistry</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c2gc36896j\">https://doi.org/10.1039/c2gc36896j</a>"},"oa_version":"None","quality_controlled":"1","date_created":"2022-08-25T10:29:21Z","author":[{"last_name":"Pieber","first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","full_name":"Pieber, Bartholomäus"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"publication_identifier":{"issn":["1463-9262"],"eissn":["1463-9270"]},"language":[{"iso":"eng"}],"year":"2013","day":"01","status":"public","intvolume":"        15","title":"Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent","volume":15},{"quality_controlled":"1","citation":{"mla":"Lampert, Christoph, et al. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 36, no. 3, IEEE, 2013, pp. 453–65, doi:<a href=\"https://doi.org/10.1109/TPAMI.2013.140\">10.1109/TPAMI.2013.140</a>.","ieee":"C. Lampert, H. Nickisch, and S. Harmeling, “Attribute-based classification for zero-shot learning of object categories,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 36, no. 3. IEEE, pp. 453–465, 2013.","ista":"Lampert C, Nickisch H, Harmeling S. 2013. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 36(3), 453–465.","chicago":"Lampert, Christoph, Hannes Nickisch, and Stefan Harmeling. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/TPAMI.2013.140\">https://doi.org/10.1109/TPAMI.2013.140</a>.","short":"C. Lampert, H. Nickisch, S. Harmeling, IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (2013) 453–465.","apa":"Lampert, C., Nickisch, H., &#38; Harmeling, S. (2013). Attribute-based classification for zero-shot learning of object categories. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2013.140\">https://doi.org/10.1109/TPAMI.2013.140</a>","ama":"Lampert C, Nickisch H, Harmeling S. Attribute-based classification for zero-shot learning of object categories. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2013;36(3):453-465. doi:<a href=\"https://doi.org/10.1109/TPAMI.2013.140\">10.1109/TPAMI.2013.140</a>"},"doi":"10.1109/TPAMI.2013.140","language":[{"iso":"eng"}],"year":"2013","intvolume":"        36","page":"453 - 465","abstract":[{"lang":"eng","text":"We study the problem of object recognition for categories for which we have no training examples, a task also called zero-data or zero-shot learning. This situation has hardly been studied in computer vision research, even though it occurs frequently: the world contains tens of thousands of different object classes and for only few of them image collections have been formed and suitably annotated. To tackle the problem we introduce attribute-based classification: objects are identified based on a high-level description that is phrased in terms of semantic attributes, such as the object's color or shape. Because the identification of each such property transcends the specific learning task at hand, the attribute classifiers can be pre-learned independently, e.g. from existing image datasets unrelated to the current task. Afterwards, new classes can be detected based on their attribute representation, without the need for a new training phase. In this paper we also introduce a new dataset, Animals with Attributes, of over 30,000 images of 50 animal classes, annotated with 85 semantic attributes. Extensive experiments on this and two more datasets show that attribute-based classification indeed is able to categorize images without access to any training images of the target classes."}],"ddc":["000"],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","issue":"3","article_processing_charge":"No","type":"journal_article","_id":"2516","date_created":"2018-12-11T11:58:08Z","oa_version":"None","department":[{"_id":"ChLa"}],"author":[{"last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887"},{"first_name":"Hannes","last_name":"Nickisch","full_name":"Nickisch, Hannes"},{"full_name":"Harmeling, Stefan","last_name":"Harmeling","first_name":"Stefan"}],"day":"30","status":"public","volume":36,"title":"Attribute-based classification for zero-shot learning of object categories","das_tickbox":"1","scopus_import":"1","month":"07","date_published":"2013-07-30T00:00:00Z","publist_id":"4385","date_updated":"2026-06-18T07:51:30Z","publisher":"IEEE","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"doi":"10.1126/science.1224839","citation":{"ama":"Ibarra CA, Feng X, Schoft VK, et al. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. <i>Science</i>. 2012;337(6100):1360-1364. doi:<a href=\"https://doi.org/10.1126/science.1224839\">10.1126/science.1224839</a>","apa":"Ibarra, C. A., Feng, X., Schoft, V. K., Hsieh, T.-F., Uzawa, R., Rodrigues, J. A., … Zilberman, D. (2012). Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1224839\">https://doi.org/10.1126/science.1224839</a>","short":"C.A. Ibarra, X. Feng, V.K. Schoft, T.-F. Hsieh, R. Uzawa, J.A. Rodrigues, A. Zemach, N. Chumak, A. Machlicova, T. Nishimura, D. Rojas, R.L. Fischer, H. Tamaru, D. Zilberman, Science 337 (2012) 1360–1364.","chicago":"Ibarra, Christian A., Xiaoqi Feng, Vera K. Schoft, Tzung-Fu Hsieh, Rie Uzawa, Jessica A. Rodrigues, Assaf Zemach, et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1224839\">https://doi.org/10.1126/science.1224839</a>.","ista":"Ibarra CA, Feng X, Schoft VK, Hsieh T-F, Uzawa R, Rodrigues JA, Zemach A, Chumak N, Machlicova A, Nishimura T, Rojas D, Fischer RL, Tamaru H, Zilberman D. 2012. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. Science. 337(6100), 1360–1364.","ieee":"C. A. Ibarra <i>et al.</i>, “Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes,” <i>Science</i>, vol. 337, no. 6100. American Association for the Advancement of Science, pp. 1360–1364, 2012.","mla":"Ibarra, Christian A., et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” <i>Science</i>, vol. 337, no. 6100, American Association for the Advancement of Science, 2012, pp. 1360–64, doi:<a href=\"https://doi.org/10.1126/science.1224839\">10.1126/science.1224839</a>."},"quality_controlled":"1","acknowledgement":"We thank S. Harmer for assistance with the analysis of histone modifications, the BioOptics team at the Vienna Biocenter Campus for sorting sperm and vegetative cell nuclei, K. Slotkin for the LAT52p-amiRNA=GFP plasmid, and G. Drews for the DD45p-GFP transgenic line. This work was partially funded by an NIH grant (GM69415) to R.L.F., NSF grants (MCB-0918821 and IOS-1025890) to R.L.F. and D.Z., a Young Investigator Grant from the Arnold and Mabel Beckman Foundation to D.Z., an Austrian Science Fund (FWF) grant P21389-B03 to H.T., a Ruth L. Kirschstein NIH Predoctoral Fellowship (GM093633) to C.A.I., a Fulbright Scholarship to J.A.R., a fellowship from the Jane Coffin Childs Memorial Fund to A.Z., and a Robert and Colleen Haas Scholarship to D.R. Sequencing data are deposited in GEO (GSE38935).","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"year":"2012","pmid":1,"intvolume":"       337","external_id":{"pmid":["22984074"]},"page":"1360-1364","oa":1,"abstract":[{"lang":"eng","text":"The Arabidopsis thaliana central cell, the companion cell of the egg, undergoes DNA demethylation before fertilization, but the targeting preferences, mechanism, and biological significance of this process remain unclear. Here, we show that active DNA demethylation mediated by the DEMETER DNA glycosylase accounts for all of the demethylation in the central cell and preferentially targets small, AT-rich, and nucleosome-depleted euchromatic transposable elements. The vegetative cell, the companion cell of sperm, also undergoes DEMETER-dependent demethylation of similar sequences, and lack of DEMETER in vegetative cells causes reduced small RNA–directed DNA methylation of transposons in sperm. Our results demonstrate that demethylation in companion cells reinforces transposon methylation in plant gametes and likely contributes to stable silencing of transposable elements across generations."}],"keyword":["Multidisciplinary"],"_id":"12198","issue":"6100","article_processing_charge":"No","type":"journal_article","publication":"Science","date_created":"2023-01-16T09:21:24Z","oa_version":"Published Version","department":[{"_id":"XiFe"}],"author":[{"last_name":"Ibarra","first_name":"Christian A.","full_name":"Ibarra, Christian A."},{"orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","first_name":"Xiaoqi"},{"last_name":"Schoft","first_name":"Vera K.","full_name":"Schoft, Vera K."},{"full_name":"Hsieh, Tzung-Fu","first_name":"Tzung-Fu","last_name":"Hsieh"},{"last_name":"Uzawa","first_name":"Rie","full_name":"Uzawa, Rie"},{"full_name":"Rodrigues, Jessica A.","last_name":"Rodrigues","first_name":"Jessica A."},{"full_name":"Zemach, Assaf","last_name":"Zemach","first_name":"Assaf"},{"first_name":"Nina","last_name":"Chumak","full_name":"Chumak, Nina"},{"last_name":"Machlicova","first_name":"Adriana","full_name":"Machlicova, Adriana"},{"first_name":"Toshiro","last_name":"Nishimura","full_name":"Nishimura, Toshiro"},{"full_name":"Rojas, Denisse","last_name":"Rojas","first_name":"Denisse"},{"full_name":"Fischer, Robert L.","last_name":"Fischer","first_name":"Robert L."},{"full_name":"Tamaru, Hisashi","first_name":"Hisashi","last_name":"Tamaru"},{"last_name":"Zilberman","first_name":"Daniel","full_name":"Zilberman, Daniel"}],"day":"14","status":"public","title":"Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes","volume":337,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4034762/"}],"scopus_import":"1","date_published":"2012-09-14T00:00:00Z","month":"09","article_type":"original","publisher":"American Association for the Advancement of Science","date_updated":"2023-10-16T09:27:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published"},{"article_type":"original","month":"03","date_published":"2012-03-01T00:00:00Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-21T09:38:36Z","publisher":"American Geophysical Union","main_file_link":[{"url":"https://doi.org/10.1029/2011WR010559","open_access":"1"}],"scopus_import":"1","day":"01","volume":48,"title":"Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters","status":"public","article_number":"W03509","oa_version":"Published Version","date_created":"2023-02-20T08:17:39Z","publication":"Water Resources Research","article_processing_charge":"No","_id":"12644","issue":"3","type":"journal_article","author":[{"full_name":"Ragettli, S.","first_name":"S.","last_name":"Ragettli"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"}],"abstract":[{"lang":"eng","text":"In the Dry Andes of central Chile, summer water resources originate mostly from snowmelt and ice melt. We use the physically based, spatially distributed hydrological model TOPKAPI to study the exchange between glaciers and climate in the upper Aconcagua River Basin during the summer season and identify the model parameters that are robust and transferable and those that are more dependent on calibration. TOPKAPI has recently been adapted to incorporate an enhanced temperature index approach for snow and ice melting. We suggest a calibration procedure that allows calibration of parameters in three steps by separating parameters governing distinct processes. We evaluate the parameters' transferability in time and in space by applying the model at two spatial scales. TOPKAPI's ability to simulate the relevant processes is tested against meteorological, ablation, and glacier runoff data measured on Juncal Norte Glacier during two glacier ablation seasons. The model was applied successfully to the climatic setting of the Dry Andes once its parameters were recalibrated. We found a clear distinction between parameters that are stable in time and those that need recalibration. The parameters of the melt model are transferable from one season to the other, while the parameters governing the extrapolation of meteorological input data and the routing of glacier meltwater need recalibration from one season to the other. Sensitivity analysis revealed that the model is most sensitive to the temperature lapse rate governing the extrapolation of air temperature from point measurements to the glacier scale and to the melt parameter that multiplies the shortwave radiation balance."}],"oa":1,"year":"2012","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0043-1397"]},"intvolume":"        48","quality_controlled":"1","citation":{"ama":"Ragettli S, Pellicciotti F. Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters. <i>Water Resources Research</i>. 2012;48(3). doi:<a href=\"https://doi.org/10.1029/2011wr010559\">10.1029/2011wr010559</a>","short":"S. Ragettli, F. Pellicciotti, Water Resources Research 48 (2012).","chicago":"Ragettli, S., and Francesca Pellicciotti. “Calibration of a Physically Based, Spatially Distributed Hydrological Model in a Glacierized Basin: On the Use of Knowledge from Glaciometeorological Processes to Constrain Model Parameters.” <i>Water Resources Research</i>. American Geophysical Union, 2012. <a href=\"https://doi.org/10.1029/2011wr010559\">https://doi.org/10.1029/2011wr010559</a>.","apa":"Ragettli, S., &#38; Pellicciotti, F. (2012). Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters. <i>Water Resources Research</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2011wr010559\">https://doi.org/10.1029/2011wr010559</a>","mla":"Ragettli, S., and Francesca Pellicciotti. “Calibration of a Physically Based, Spatially Distributed Hydrological Model in a Glacierized Basin: On the Use of Knowledge from Glaciometeorological Processes to Constrain Model Parameters.” <i>Water Resources Research</i>, vol. 48, no. 3, W03509, American Geophysical Union, 2012, doi:<a href=\"https://doi.org/10.1029/2011wr010559\">10.1029/2011wr010559</a>.","ista":"Ragettli S, Pellicciotti F. 2012. Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters. Water Resources Research. 48(3), W03509.","ieee":"S. Ragettli and F. Pellicciotti, “Calibration of a physically based, spatially distributed hydrological model in a glacierized basin: On the use of knowledge from glaciometeorological processes to constrain model parameters,” <i>Water Resources Research</i>, vol. 48, no. 3. American Geophysical Union, 2012."},"doi":"10.1029/2011wr010559","extern":"1"},{"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1659/MRD-JOURNAL-D-11-00092.1"}],"publisher":"International Mountain Society","date_updated":"2023-02-21T09:31:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","month":"02","date_published":"2012-02-01T00:00:00Z","article_type":"original","author":[{"last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","full_name":"Pellicciotti, Francesca"},{"first_name":"Cyrill","last_name":"Buergi","full_name":"Buergi, Cyrill"},{"full_name":"Immerzeel, Walter Willem","first_name":"Walter Willem","last_name":"Immerzeel"},{"first_name":"Markus","last_name":"Konz","full_name":"Konz, Markus"},{"first_name":"Arun B.","last_name":"Shrestha","full_name":"Shrestha, Arun B."}],"type":"journal_article","_id":"12646","article_processing_charge":"No","issue":"1","publication":"Mountain Research and Development","date_created":"2023-02-20T08:17:47Z","oa_version":"Published Version","status":"public","volume":32,"title":"Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies","day":"01","page":"39-50","oa":1,"abstract":[{"lang":"eng","text":"Assessment of water resources from remote mountainous catchments plays a crucial role for the development of rural areas in or in the vicinity of mountain ranges. The scarcity of data, however, prevents the application of standard approaches that are based on data-driven models. The Hindu Kush–Karakoram–Himalaya mountain range is a crucial area in terms of water resources, but our understanding of the response of its high-elevation catchments to a changing climate is hindered by lack of hydro-meteorological and cryospheric data. Hydrological modeling is challenging here because internal inconsistencies—such as an underestimation of precipitation input that can be compensated for by an overestimation of meltwater—might be hidden due to the complexity of feedback mechanisms that govern melt and runoff generation in such basins. Data scarcity adds to this difficulty by preventing the application of systematic calibration procedures that would allow identification of the parameter set that could guarantee internal consistency in the simulation of the single hydrological components. In this work, we use simulations from the Hunza River Basin in the Karakoram region obtained with the hydrological model TOPKAPI to quantify the predictive power of discharge and snow-cover data sets, as well as the combination of both. We also show that short-term measurements of meteorological variables such as radiative fluxes, wind speed, relative humidity, and air temperature from glacio-meteorological experiments are crucial for a correct parameterization of surface melt processes. They enable detailed simulations of the energy fluxes governing glacier–atmosphere interaction and the resulting ablation through energy-balance modeling. These simulations are used to derive calibrated parameters for the simplified snow and glacier routines in TOPKAPI. We demonstrate that such parameters are stable in space and time in similar climatic regions, thus reducing the number of parameters requiring calibration."}],"extern":"1","citation":{"short":"F. Pellicciotti, C. Buergi, W.W. Immerzeel, M. Konz, A.B. Shrestha, Mountain Research and Development 32 (2012) 39–50.","chicago":"Pellicciotti, Francesca, Cyrill Buergi, Walter Willem Immerzeel, Markus Konz, and Arun B. Shrestha. “Challenges and Uncertainties in Hydrological Modeling of Remote Hindu Kush–Karakoram–Himalayan (HKH) Basins: Suggestions for Calibration Strategies.” <i>Mountain Research and Development</i>. International Mountain Society, 2012. <a href=\"https://doi.org/10.1659/mrd-journal-d-11-00092.1\">https://doi.org/10.1659/mrd-journal-d-11-00092.1</a>.","apa":"Pellicciotti, F., Buergi, C., Immerzeel, W. W., Konz, M., &#38; Shrestha, A. B. (2012). Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies. <i>Mountain Research and Development</i>. International Mountain Society. <a href=\"https://doi.org/10.1659/mrd-journal-d-11-00092.1\">https://doi.org/10.1659/mrd-journal-d-11-00092.1</a>","mla":"Pellicciotti, Francesca, et al. “Challenges and Uncertainties in Hydrological Modeling of Remote Hindu Kush–Karakoram–Himalayan (HKH) Basins: Suggestions for Calibration Strategies.” <i>Mountain Research and Development</i>, vol. 32, no. 1, International Mountain Society, 2012, pp. 39–50, doi:<a href=\"https://doi.org/10.1659/mrd-journal-d-11-00092.1\">10.1659/mrd-journal-d-11-00092.1</a>.","ieee":"F. Pellicciotti, C. Buergi, W. W. Immerzeel, M. Konz, and A. B. Shrestha, “Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies,” <i>Mountain Research and Development</i>, vol. 32, no. 1. International Mountain Society, pp. 39–50, 2012.","ista":"Pellicciotti F, Buergi C, Immerzeel WW, Konz M, Shrestha AB. 2012. Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies. Mountain Research and Development. 32(1), 39–50.","ama":"Pellicciotti F, Buergi C, Immerzeel WW, Konz M, Shrestha AB. Challenges and uncertainties in hydrological modeling of remote Hindu Kush–Karakoram–Himalayan (HKH) basins: Suggestions for calibration strategies. <i>Mountain Research and Development</i>. 2012;32(1):39-50. doi:<a href=\"https://doi.org/10.1659/mrd-journal-d-11-00092.1\">10.1659/mrd-journal-d-11-00092.1</a>"},"doi":"10.1659/mrd-journal-d-11-00092.1","quality_controlled":"1","intvolume":"        32","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1994-7151"],"issn":["0276-4741"]},"year":"2012"},{"main_file_link":[{"url":"https://doi.org/10.1659/MRD-JOURNAL-D-11-00097.1","open_access":"1"}],"scopus_import":"1","month":"02","date_published":"2012-02-01T00:00:00Z","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"International Mountain Society","date_updated":"2023-02-21T08:56:29Z","oa_version":"Published Version","date_created":"2023-02-20T08:17:52Z","_id":"12647","article_processing_charge":"No","issue":"1","type":"journal_article","publication":"Mountain Research and Development","author":[{"last_name":"Immerzeel","first_name":"Walter Willem","full_name":"Immerzeel, Walter Willem"},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"},{"first_name":"Arun B.","last_name":"Shrestha","full_name":"Shrestha, Arun B."}],"day":"01","title":"Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin","volume":32,"status":"public","page":"30-38","oa":1,"keyword":["General Environmental Science","Development","Environmental Chemistry"],"abstract":[{"lang":"eng","text":"Accurate quantification of the spatial distribution of precipitation in mountain regions is crucial for assessments of water resources and for the understanding of high-altitude hydrology, yet it is one of the largest unknowns due to the lack of high-altitude observations. The Hunza basin in Pakistan contains very large glacier systems, which, given the melt, cannot persist unless precipitation (snow input) is much higher than what is observed at the meteorological stations, mostly located in mountain valleys. Several studies, therefore, suggest strong positive vertical precipitation lapse rates; in the present study, we quantify this lapse rate by using glaciers as a proxy. We assume a neutral mass balance for the glaciers for the period from 2001 to 2003, and we inversely model the precipitation lapse by balancing the total accumulation in the catchment area and the ablation over the glacier area for the 50 largest glacier systems in the Hunza basin in the Karakoram. Our results reveal a vertical precipitation lapse rate that equals 0.21 ± 0.12% m−1, with a maximum precipitation at an elevation of 5500 masl. We showed that the total annual basin precipitation (828 mm) is 260% higher than what is estimated based on interpolated observations (319 mm); this has major consequences for hydrological modeling and water resource assessments in general. Our results were validated by using previously published studies on individual glaciers as well as the water balance of the Hunza basin. The approach is more widely applicable in mountain ranges where precipitation measurements at high altitude are lacking."}],"doi":"10.1659/mrd-journal-d-11-00097.1","citation":{"ama":"Immerzeel WW, Pellicciotti F, Shrestha AB. Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin. <i>Mountain Research and Development</i>. 2012;32(1):30-38. doi:<a href=\"https://doi.org/10.1659/mrd-journal-d-11-00097.1\">10.1659/mrd-journal-d-11-00097.1</a>","ista":"Immerzeel WW, Pellicciotti F, Shrestha AB. 2012. Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin. Mountain Research and Development. 32(1), 30–38.","ieee":"W. W. Immerzeel, F. Pellicciotti, and A. B. Shrestha, “Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin,” <i>Mountain Research and Development</i>, vol. 32, no. 1. International Mountain Society, pp. 30–38, 2012.","mla":"Immerzeel, Walter Willem, et al. “Glaciers as a Proxy to Quantify the Spatial Distribution of Precipitation in the Hunza Basin.” <i>Mountain Research and Development</i>, vol. 32, no. 1, International Mountain Society, 2012, pp. 30–38, doi:<a href=\"https://doi.org/10.1659/mrd-journal-d-11-00097.1\">10.1659/mrd-journal-d-11-00097.1</a>.","apa":"Immerzeel, W. W., Pellicciotti, F., &#38; Shrestha, A. B. (2012). Glaciers as a proxy to quantify the spatial distribution of precipitation in the Hunza basin. <i>Mountain Research and Development</i>. International Mountain Society. <a href=\"https://doi.org/10.1659/mrd-journal-d-11-00097.1\">https://doi.org/10.1659/mrd-journal-d-11-00097.1</a>","short":"W.W. Immerzeel, F. Pellicciotti, A.B. Shrestha, Mountain Research and Development 32 (2012) 30–38.","chicago":"Immerzeel, Walter Willem, Francesca Pellicciotti, and Arun B. Shrestha. “Glaciers as a Proxy to Quantify the Spatial Distribution of Precipitation in the Hunza Basin.” <i>Mountain Research and Development</i>. International Mountain Society, 2012. <a href=\"https://doi.org/10.1659/mrd-journal-d-11-00097.1\">https://doi.org/10.1659/mrd-journal-d-11-00097.1</a>."},"quality_controlled":"1","extern":"1","year":"2012","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0276-4741"],"eissn":["1994-7151"]},"intvolume":"        32"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2012JD017795"}],"scopus_import":"1","date_published":"2012-09-27T00:00:00Z","month":"09","article_type":"original","publisher":"American Geophysical Union","date_updated":"2023-02-20T10:57:31Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","_id":"12648","type":"journal_article","issue":"D18","article_processing_charge":"No","publication":"Journal of Geophysical Research: Atmospheres","date_created":"2023-02-20T08:17:57Z","oa_version":"Published Version","author":[{"full_name":"Reid, T. D.","first_name":"T. D.","last_name":"Reid"},{"full_name":"Carenzo, M.","last_name":"Carenzo","first_name":"M."},{"full_name":"Pellicciotti, Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"},{"full_name":"Brock, B. W.","last_name":"Brock","first_name":"B. W."}],"day":"27","article_number":"D18105","status":"public","volume":117,"title":"Including debris cover effects in a distributed model of glacier ablation","oa":1,"abstract":[{"text":"Distributed glacier melt models generally assume that the glacier surface consists of bare exposed ice and snow. In reality, many glaciers are wholly or partially covered in layers of debris that tend to suppress ablation rates. In this paper, an existing physically based point model for the ablation of debris-covered ice is incorporated in a distributed melt model and applied to Haut Glacier d'Arolla, Switzerland, which has three large patches of debris cover on its surface. The model is based on a 10 m resolution digital elevation model (DEM) of the area; each glacier pixel in the DEM is defined as either bare or debris-covered ice, and may be covered in snow that must be melted off before ice ablation is assumed to occur. Each debris-covered pixel is assigned a debris thickness value using probability distributions based on over 1000 manual thickness measurements. Locally observed meteorological data are used to run energy balance calculations in every pixel, using an approach suitable for snow, bare ice or debris-covered ice as appropriate. The use of the debris model significantly reduces the total ablation in the debris-covered areas, however the precise reduction is sensitive to the temperature extrapolation used in the model distribution because air near the debris surface tends to be slightly warmer than over bare ice. Overall results suggest that the debris patches, which cover 10% of the glacierized area, reduce total runoff from the glacierized part of the basin by up to 7%.","lang":"eng"}],"keyword":["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"],"extern":"1","citation":{"ieee":"T. D. Reid, M. Carenzo, F. Pellicciotti, and B. W. Brock, “Including debris cover effects in a distributed model of glacier ablation,” <i>Journal of Geophysical Research: Atmospheres</i>, vol. 117, no. D18. American Geophysical Union, 2012.","ista":"Reid TD, Carenzo M, Pellicciotti F, Brock BW. 2012. Including debris cover effects in a distributed model of glacier ablation. Journal of Geophysical Research: Atmospheres. 117(D18), D18105.","mla":"Reid, T. D., et al. “Including Debris Cover Effects in a Distributed Model of Glacier Ablation.” <i>Journal of Geophysical Research: Atmospheres</i>, vol. 117, no. D18, D18105, American Geophysical Union, 2012, doi:<a href=\"https://doi.org/10.1029/2012jd017795\">10.1029/2012jd017795</a>.","apa":"Reid, T. D., Carenzo, M., Pellicciotti, F., &#38; Brock, B. W. (2012). Including debris cover effects in a distributed model of glacier ablation. <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2012jd017795\">https://doi.org/10.1029/2012jd017795</a>","chicago":"Reid, T. D., M. Carenzo, Francesca Pellicciotti, and B. W. Brock. “Including Debris Cover Effects in a Distributed Model of Glacier Ablation.” <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union, 2012. <a href=\"https://doi.org/10.1029/2012jd017795\">https://doi.org/10.1029/2012jd017795</a>.","short":"T.D. Reid, M. Carenzo, F. Pellicciotti, B.W. Brock, Journal of Geophysical Research: Atmospheres 117 (2012).","ama":"Reid TD, Carenzo M, Pellicciotti F, Brock BW. Including debris cover effects in a distributed model of glacier ablation. <i>Journal of Geophysical Research: Atmospheres</i>. 2012;117(D18). doi:<a href=\"https://doi.org/10.1029/2012jd017795\">10.1029/2012jd017795</a>"},"doi":"10.1029/2012jd017795","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0148-0227"]},"year":"2012","intvolume":"       117"},{"type":"research_data_reference","_id":"13075","article_processing_charge":"No","oa_version":"Published Version","date_created":"2023-05-23T17:01:02Z","citation":{"apa":"Lohse, K., Barton, N. H., Stone, G., &#38; Melika, G. (2012). Data from: A likelihood-based comparison of population histories in a parasitoid guild. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>","chicago":"Lohse, Konrad, Nicholas H Barton, Graham Stone, and George Melika. “Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild.” Dryad, 2012. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>.","short":"K. Lohse, N.H. Barton, G. Stone, G. Melika, (2012).","ieee":"K. Lohse, N. H. Barton, G. Stone, and G. Melika, “Data from: A likelihood-based comparison of population histories in a parasitoid guild.” Dryad, 2012.","ista":"Lohse K, Barton NH, Stone G, Melika G. 2012. Data from: A likelihood-based comparison of population histories in a parasitoid guild, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","mla":"Lohse, Konrad, et al. <i>Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","ama":"Lohse K, Barton NH, Stone G, Melika G. Data from: A likelihood-based comparison of population histories in a parasitoid guild. 2012. doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>"},"doi":"10.5061/DRYAD.0G0FS","department":[{"_id":"NiBa"}],"author":[{"first_name":"Konrad","last_name":"Lohse","full_name":"Lohse, Konrad"},{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"last_name":"Stone","first_name":"Graham","full_name":"Stone, Graham"},{"full_name":"Melika, George","first_name":"George","last_name":"Melika"}],"related_material":{"record":[{"relation":"used_in_publication","id":"2968","status":"public"}]},"year":"2012","day":"08","status":"public","tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"title":"Data from: A likelihood-based comparison of population histories in a parasitoid guild","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.0g0fs"}],"date_published":"2012-06-08T00:00:00Z","month":"06","abstract":[{"lang":"eng","text":"Little is known about the stability of trophic relationships in complex natural communities over evolutionary timescales. Here, we use sequence data from 18 nuclear loci to reconstruct and compare the intraspecific histories of major Pleistocene refugial populations in the Middle East, the Balkans and Iberia in a guild of four Chalcid parasitoids (Cecidostiba fungosa, C. semifascia, Hobbya stenonota and Mesopolobus amaenus) all attacking Cynipid oak galls. We develop a likelihood method to numerically estimate models of divergence between three populations from multilocus data. We investigate the power of this framework on simulated data, and - using triplet alignments of intronic loci - quantify the support for all possible divergence relationships between refugial populations in the four parasitoids. Although an East to West order of population divergence has highest support in all but one species, we cannot rule out alternative population tree topologies. Comparing the estimated times of population splits between species, we find that one species, M. amaenus, has a significantly older history than the rest of the guild and must have arrived in central Europe at least one glacial cycle prior to other guild members. This suggests that although all four species may share a common origin in the East, they expanded westwards into Europe at different times."}],"ddc":["570"],"oa":1,"date_updated":"2025-05-28T11:56:58Z","publisher":"Dryad","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]