[{"_id":"3317","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses","ddc":["570"],"status":"public","intvolume":" 13","pubrep_id":"820","oa_version":"Submitted Version","file":[{"file_size":314246,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf","access_level":"open_access","date_created":"2018-12-12T10:12:13Z","date_updated":"2020-07-14T12:46:07Z","checksum":"4c1c86b2f6e4e1562f5bb800b457ea9f","relation":"main_file","file_id":"4931"},{"relation":"main_file","file_id":"4932","checksum":"bceb2efdd49d115f4dde8486bc1be3f2","date_created":"2018-12-12T10:12:14Z","date_updated":"2020-07-14T12:46:07Z","access_level":"open_access","file_name":"IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf","content_type":"application/pdf","file_size":1840216,"creator":"system"}],"type":"journal_article","abstract":[{"lang":"eng","text":"The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant of the signalling properties of synapses in the nervous system. Recent functional analysis indicates that in some fast central synapses, transmitter release is triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors at the nanometre scale. Molecular analysis suggests that this tight coupling is generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors and various other synaptic proteins. Nanodomain coupling has several functional advantages, as it increases the efficacy, speed and energy efficiency of synaptic transmission."}],"issue":"1","publication":"Nature Reviews Neuroscience","citation":{"apa":"Eggermann, E., Bucurenciu, I., Goswami, S., & Jonas, P. M. (2012). Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nrn3125","ieee":"E. Eggermann, I. Bucurenciu, S. Goswami, and P. M. Jonas, “Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses,” Nature Reviews Neuroscience, vol. 13, no. 1. Nature Publishing Group, pp. 7–21, 2012.","ista":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 13(1), 7–21.","ama":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature Reviews Neuroscience. 2012;13(1):7-21. doi:10.1038/nrn3125","chicago":"Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” Nature Reviews Neuroscience. Nature Publishing Group, 2012. https://doi.org/10.1038/nrn3125.","short":"E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience 13 (2012) 7–21.","mla":"Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” Nature Reviews Neuroscience, vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:10.1038/nrn3125."},"page":"7 - 21","date_published":"2012-01-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","acknowledgement":"Work of the authors was funded by grants of the Deutsche Forschungsgemeinschaft to P.J. (grants SFB 780/A5, TR 3/B10 and the Leibniz programme), a European Research Council Advanced grant to P.J. and a Swiss National Foundation fellowship to E.E.\r\nWe thank D. Tsien and E. Neher for their comments on this Review, J. Guzmán and A. Pernía-Andrade for reading earlier versions and E. Kramberger for perfect editorial support. We apologize that owing to space constraints, not all relevant papers could be cited.\r\n","year":"2012","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"PeJo"}],"author":[{"full_name":"Eggermann, Emmanuel","first_name":"Emmanuel","last_name":"Eggermann","id":"34DACA34-E9AE-11E9-849C-D35BD8ADC20C"},{"last_name":"Bucurenciu","first_name":"Iancu","id":"4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A","full_name":"Bucurenciu, Iancu"},{"full_name":"Goswami, Sarit","last_name":"Goswami","first_name":"Sarit","id":"3A578F32-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M"}],"date_updated":"2021-01-12T07:42:36Z","date_created":"2018-12-11T12:02:38Z","volume":13,"file_date_updated":"2020-07-14T12:46:07Z","publist_id":"3322","oa":1,"quality_controlled":"1","project":[{"name":"Synaptic Mechanisms of Neuronal Network Function","_id":"25BC64A8-B435-11E9-9278-68D0E5697425","grant_number":"JO_780/A5"},{"grant_number":"SFB-TR3-TP10B","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen"}],"doi":"10.1038/nrn3125","language":[{"iso":"eng"}],"month":"01"},{"page":"609 - 625","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","citation":{"ama":"Chatterjee K, Majumdar R. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 2012;23(3):609-625. doi:10.1142/S0129054112400308","ieee":"K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” International Journal of Foundations of Computer Science, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.","apa":"Chatterjee, K., & Majumdar, R. (2012). Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054112400308","ista":"Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625.","short":"K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:10.1142/S0129054112400308.","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science. World Scientific Publishing, 2012. https://doi.org/10.1142/S0129054112400308."},"publication":"International Journal of Foundations of Computer Science","language":[{"iso":"eng"}],"doi":"10.1142/S0129054112400308","date_published":"2012-04-01T00:00:00Z","scopus_import":1,"day":"01","month":"04","publisher":"World Scientific Publishing","intvolume":" 23","department":[{"_id":"KrCh"}],"publication_status":"published","status":"public","title":"Discounting and averaging in games across time scales","_id":"3314","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012","oa_version":"None","volume":23,"date_created":"2018-12-11T12:02:37Z","date_updated":"2021-01-12T07:42:35Z","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"type":"journal_article","publist_id":"3326","issue":"3","abstract":[{"text":"We introduce two-level discounted and mean-payoff games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted or mean-payoff game and the lower level game is a (undiscounted) reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. For both discounted and mean-payoff two-level games, we show the existence of pure memoryless optimal strategies for both players and an ordered field property. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted or mean-payoff games can be decided in NP ∩ coNP. We also give an alternate strategy improvement algorithm to compute the value. © 2012 World Scientific Publishing Company.","lang":"eng"}]},{"type":"journal_article","abstract":[{"text":"We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If it does, we also seek a preferably simple-looking solution P; then, P's offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give an O(nlogn)-time exact decision algorithm that handles any polygonal shape, assuming the real-RAM model of computation. A variant of the algorithm, which we have implemented using the cgal library, is based on rational arithmetic and answers the same deconstruction problem up to an uncertainty parameter δ its running time additionally depends on δ. If the input shape is found to be approximable, this algorithm also computes an approximate solution for the problem. It also allows us to solve parameter-optimization problems induced by the offset-deconstruction problem. For convex shapes, the complexity of the exact decision algorithm drops to O(n), which is also the time required to compute a solution P with at most one more vertex than a vertex-minimal one.","lang":"eng"}],"issue":"4","_id":"3115","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Deconstructing approximate offsets","intvolume":" 48","oa_version":"Preprint","scopus_import":1,"day":"01","publication":"Discrete & Computational Geometry","citation":{"ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. Discrete & Computational Geometry. 2012;48(4):964-989. doi:10.1007/s00454-012-9441-5","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate offsets. Discrete & Computational Geometry. 48(4), 964–989.","ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” Discrete & Computational Geometry, vol. 48, no. 4. Springer, pp. 964–989, 2012.","apa":"Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2012). Deconstructing approximate offsets. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-012-9441-5","mla":"Berberich, Eric, et al. “Deconstructing Approximate Offsets.” Discrete & Computational Geometry, vol. 48, no. 4, Springer, 2012, pp. 964–89, doi:10.1007/s00454-012-9441-5.","short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete & Computational Geometry 48 (2012) 964–989.","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” Discrete & Computational Geometry. Springer, 2012. https://doi.org/10.1007/s00454-012-9441-5."},"page":"964 - 989","date_published":"2012-12-01T00:00:00Z","publist_id":"3584","year":"2012","acknowledgement":"We thank Eyal Flato (Plataine Ltd.) for raising the offset-deconstruction problem in connection with wood cutting. We also thank Tim Bretl (UIUC) for suggesting the digital-pen offset-deconstruction problem. This work has been supported in part by the Israel Science Foundation (grant no. 1102/11), by the German–Israeli Foundation (grant no. 969/07), by the Hermann Minkowski–Minerva Center for Geometry at Tel Aviv University, and by the EU Project under Contract No. 255827 (CGL—Computational Geometry Learning).\r\n","publication_status":"published","publisher":"Springer","department":[{"_id":"HeEd"}],"author":[{"full_name":"Berberich, Eric","last_name":"Berberich","first_name":"Eric"},{"full_name":"Halperin, Dan","first_name":"Dan","last_name":"Halperin"},{"full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8030-9299","first_name":"Michael","last_name":"Kerber"},{"full_name":"Pogalnikova, Roza","first_name":"Roza","last_name":"Pogalnikova"}],"related_material":{"record":[{"id":"3329","relation":"earlier_version","status":"public"}]},"date_updated":"2023-02-23T11:22:30Z","date_created":"2018-12-11T12:01:28Z","volume":48,"month":"12","external_id":{"arxiv":["1109.2158"]},"main_file_link":[{"url":"http://arxiv.org/abs/1109.2158","open_access":"1"}],"oa":1,"quality_controlled":"1","doi":"10.1007/s00454-012-9441-5","language":[{"iso":"eng"}]},{"scopus_import":1,"day":"01","month":"03","quality_controlled":"1","page":"239 - 258","publication":" Journal of Symbolic Computation","citation":{"chicago":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” Journal of Symbolic Computation. Elsevier, 2012. https://doi.org/10.1016/j.jsc.2011.11.001.","mla":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” Journal of Symbolic Computation, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:10.1016/j.jsc.2011.11.001.","short":"M. Kerber, M. Sagraloff, Journal of Symbolic Computation 47 (2012) 239–258.","ista":"Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.","apa":"Kerber, M., & Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/j.jsc.2011.11.001","ieee":"M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” Journal of Symbolic Computation, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.","ama":"Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 2012;47(3):239-258. doi:10.1016/j.jsc.2011.11.001"},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1104.1510","open_access":"1"}],"language":[{"iso":"eng"}],"date_published":"2012-03-01T00:00:00Z","doi":"10.1016/j.jsc.2011.11.001","type":"journal_article","abstract":[{"text":"Computing the topology of an algebraic plane curve C means computing a combinatorial graph that is isotopic to C and thus represents its topology in R2. We prove that, for a polynomial of degree n with integer coefficients bounded by 2ρ, the topology of the induced curve can be computed with bit operations ( indicates that we omit logarithmic factors). Our analysis improves the previous best known complexity bounds by a factor of n2. The improvement is based on new techniques to compute and refine isolating intervals for the real roots of polynomials, and on the consequent amortized analysis of the critical fibers of the algebraic curve.","lang":"eng"}],"publist_id":"3303","issue":"3","title":"A worst case bound for topology computation of algebraic curves","publication_status":"published","status":"public","publisher":"Elsevier","intvolume":" 47","department":[{"_id":"HeEd"}],"_id":"3331","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012","date_created":"2018-12-11T12:02:43Z","date_updated":"2021-01-12T07:42:43Z","oa_version":"Preprint","volume":47,"author":[{"full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber","first_name":"Michael"},{"full_name":"Sagraloff, Michael","last_name":"Sagraloff","first_name":"Michael"}]},{"date_updated":"2021-01-12T07:43:36Z","date_created":"2018-12-11T11:45:56Z","volume":45,"oa_version":"None","author":[{"full_name":"Fan, Jiandong","first_name":"Jiandong","last_name":"Fan"},{"last_name":"Zamani","first_name":"Reza","full_name":"Zamani, Reza"},{"first_name":"Cristina","last_name":"Fábrega","full_name":"Fábrega, Cristina"},{"first_name":"Alexey","last_name":"Shavel","full_name":"Shavel, Alexey"},{"last_name":"Flox","first_name":"Cristina","full_name":"Flox, Cristina"},{"orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria","full_name":"Ibáñez, Maria"},{"full_name":"Andreu, Teresa","last_name":"Andreu","first_name":"Teresa"},{"full_name":"López, Amtonio","first_name":"Amtonio","last_name":"López"},{"full_name":"Arbiol, Jordi","first_name":"Jordi","last_name":"Arbiol"},{"full_name":"Morante, Joan","last_name":"Morante","first_name":"Joan"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"status":"public","publication_status":"published","title":"Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness","intvolume":" 45","publisher":"IOP Publishing Ltd.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"346","acknowledgement":"The research was supported by the European Regional Development Funds and the Spanish MICINN projects MAT2010-15138, MAT2010-21510 and CSD2009-00050. JF and AS thank the FI-DGR and BP grants from the Agència de Gestió d'Ajuts Universitaris i de Recerca (AGAUR) from the Catalan Government. MI and AC thank the Spanish MICINN for the PhD grant and the financial support through the Ramóny Cajal program.","year":"2012","extern":"1","abstract":[{"lang":"eng","text":"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."}],"publist_id":"7486","issue":"41","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1088/0022-3727/45/41/415301","date_published":"2012-10-17T00:00:00Z","quality_controlled":"1","article_type":"original","publication":"Journal of Physics D: Applied Physics","citation":{"chicago":"Fan, Jiandong, Reza Zamani, Cristina Fábrega, Alexey Shavel, Cristina Flox, Maria Ibáñez, Teresa Andreu, et al. “Solution-Growth and Optoelectronic Performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 Core–Shell Nanowires with Tunable Shell Thickness.” Journal of Physics D: Applied Physics. IOP Publishing Ltd., 2012. https://doi.org/10.1088/0022-3727/45/41/415301.","short":"J. Fan, R. Zamani, C. Fábrega, A. Shavel, C. Flox, M. Ibáñez, T. Andreu, A. López, J. Arbiol, J. Morante, A. Cabot, Journal of Physics D: Applied Physics 45 (2012).","mla":"Fan, Jiandong, et al. “Solution-Growth and Optoelectronic Performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 Core–Shell Nanowires with Tunable Shell Thickness.” Journal of Physics D: Applied Physics, vol. 45, no. 41, IOP Publishing Ltd., 2012, doi:10.1088/0022-3727/45/41/415301.","ieee":"J. Fan et al., “Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness,” Journal of Physics D: Applied Physics, vol. 45, no. 41. IOP Publishing Ltd., 2012.","apa":"Fan, J., Zamani, R., Fábrega, C., Shavel, A., Flox, C., Ibáñez, M., … Cabot, A. (2012). Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. IOP Publishing Ltd. https://doi.org/10.1088/0022-3727/45/41/415301","ista":"Fan J, Zamani R, Fábrega C, Shavel A, Flox C, Ibáñez M, Andreu T, López A, Arbiol J, Morante J, Cabot A. 2012. Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. 45(41).","ama":"Fan J, Zamani R, Fábrega C, et al. Solution-growth and optoelectronic performance of ZnO : Cl/TiO2 and ZnO : Cl/ZnxTiOy/TiO2 core–shell nanowires with tunable shell thickness. Journal of Physics D: Applied Physics. 2012;45(41). doi:10.1088/0022-3727/45/41/415301"},"day":"17","month":"10","article_processing_charge":"No"},{"month":"05","day":"04","scopus_import":1,"doi":"10.1016/j.tcs.2011.12.059","date_published":"2012-05-04T00:00:00Z","language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","citation":{"ieee":"J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule based systems,” Theoretical Computer Science, vol. 431. Elsevier, pp. 137–164, 2012.","apa":"Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2012). Lumpability abstractions of rule based systems. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.12.059","ista":"Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions of rule based systems. Theoretical Computer Science. 431, 137–164.","ama":"Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule based systems. Theoretical Computer Science. 2012;431:137-164. doi:10.1016/j.tcs.2011.12.059","chicago":"Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2011.12.059.","short":"J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science 431 (2012) 137–164.","mla":"Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science, vol. 431, Elsevier, 2012, pp. 137–64, doi:10.1016/j.tcs.2011.12.059."},"quality_controlled":"1","page":"137 - 164","abstract":[{"text":"The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a mathematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the combinatorial complexity by quotienting the reachable set of molecular species into species aggregates while preserving the deterministic semantics of the thermodynamic limit. Recently, we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper, we prove that this quotienting yields a sufficient condition for weak lumpability (that is to say that the quotient system is still Markovian for a given set of initial distributions) and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system (which means that the conditional probability of being in a given state in the original system knowing that we are in its equivalence class is an invariant of the system). We illustrate the framework on a case study of the epidermal growth factor (EGF)/insulin receptor crosstalk.","lang":"eng"}],"publist_id":"3515","type":"journal_article","author":[{"full_name":"Feret, Jérôme","last_name":"Feret","first_name":"Jérôme"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Heinz","last_name":"Koeppl","full_name":"Koeppl, Heinz"},{"orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","first_name":"Tatjana","full_name":"Petrov, Tatjana"}],"related_material":{"record":[{"id":"3719","status":"public","relation":"earlier_version"}]},"pubrep_id":"73","date_created":"2018-12-11T12:01:47Z","date_updated":"2023-02-23T11:39:40Z","volume":431,"oa_version":"None","acknowledgement":"We would like to thank the anonymous reviewers for their comments on the different versions of the paper. We would also like to thank Ferdinanda Camporesi for her careful reading and the useful insights that she gave us about the paper.\r\nJérôme Feret’s contribution was partially supported by the AbstractCell ANR-Chair of Excellence. Heinz Koeppl’s research is supported by the Swiss National Science Foundation, grant no. 200020-117975/1. Tatjana Petrov’s research is supported by SystemsX.ch (the Swiss Initiative in Systems Biology).","_id":"3168","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012","title":"Lumpability abstractions of rule based systems","publication_status":"published","status":"public","intvolume":" 431","department":[{"_id":"ToHe"}],"publisher":"Elsevier"},{"_id":"377","year":"2012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials","publication_status":"published","intvolume":" 24","publisher":"American Chemical Society","author":[{"first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"full_name":"Zamani, Reza","first_name":"Reza","last_name":"Zamani"},{"full_name":"Li, Wenhua","last_name":"Li","first_name":"Wenhua"},{"last_name":"Cadavid","first_name":"Doris","full_name":"Cadavid, Doris"},{"full_name":"Gorse, Stéphane","last_name":"Gorse","first_name":"Stéphane"},{"first_name":"Nebll","last_name":"Katchoi","full_name":"Katchoi, Nebll"},{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"full_name":"López, Antonioo","last_name":"López","first_name":"Antonioo"},{"full_name":"Morante, Joan","first_name":"Joan","last_name":"Morante"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"date_updated":"2021-01-12T07:52:04Z","date_created":"2018-12-11T11:46:07Z","oa_version":"None","volume":24,"type":"journal_article","abstract":[{"lang":"eng","text":"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."}],"publist_id":"7452","issue":"23","extern":"1","publication":"Chemistry of Materials","citation":{"ama":"Ibáñez M, Zamani R, Li W, et al. Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. 2012;24(23):4615-4622. doi:10.1021/cm303252q","ista":"Ibáñez M, Zamani R, Li W, Cadavid D, Gorse S, Katchoi N, Shavel A, López A, Morante J, Arbiol J, Cabot A. 2012. Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. 24(23), 4615–4622.","ieee":"M. Ibáñez et al., “Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials,” Chemistry of Materials, vol. 24, no. 23. American Chemical Society, pp. 4615–4622, 2012.","apa":"Ibáñez, M., Zamani, R., Li, W., Cadavid, D., Gorse, S., Katchoi, N., … Cabot, A. (2012). Crystallographic control at the nanoscale to enhance functionality: Polytypic Cu2GeSe3 nanoparticles as thermoelectric materials. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/cm303252q","mla":"Ibáñez, Maria, et al. “Crystallographic Control at the Nanoscale to Enhance Functionality: Polytypic Cu2GeSe3 Nanoparticles as Thermoelectric Materials.” Chemistry of Materials, vol. 24, no. 23, American Chemical Society, 2012, pp. 4615–22, doi:10.1021/cm303252q.","short":"M. Ibáñez, R. Zamani, W. Li, D. Cadavid, S. Gorse, N. Katchoi, A. Shavel, A. López, J. Morante, J. Arbiol, A. Cabot, Chemistry of Materials 24 (2012) 4615–4622.","chicago":"Ibáñez, Maria, Reza Zamani, Wenhua Li, Doris Cadavid, Stéphane Gorse, Nebll Katchoi, Alexey Shavel, et al. “Crystallographic Control at the Nanoscale to Enhance Functionality: Polytypic Cu2GeSe3 Nanoparticles as Thermoelectric Materials.” Chemistry of Materials. American Chemical Society, 2012. https://doi.org/10.1021/cm303252q."},"page":"4615 - 4622","doi":"10.1021/cm303252q","date_published":"2012-11-14T00:00:00Z","language":[{"iso":"eng"}],"day":"14","month":"11","article_processing_charge":"No"},{"file":[{"access_level":"open_access","file_name":"a_survey_of_stochastic_omega-regular_games.pdf","creator":"kschuh","file_size":336450,"content_type":"application/pdf","file_id":"5897","relation":"main_file","checksum":"241b939deb4517cdd4426d49c67e3fa2","date_created":"2019-01-29T10:54:28Z","date_updated":"2020-07-14T12:46:17Z"}],"oa_version":"Submitted Version","_id":"3846","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 78","ddc":["000"],"status":"public","title":"A survey of stochastic ω regular games","issue":"2","abstract":[{"lang":"eng","text":"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."}],"type":"journal_article","date_published":"2012-03-02T00:00:00Z","citation":{"ama":"Chatterjee K, Henzinger TA. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 2012;78(2):394-413. doi:10.1016/j.jcss.2011.05.002","apa":"Chatterjee, K., & Henzinger, T. A. (2012). A survey of stochastic ω regular games. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/j.jcss.2011.05.002","ieee":"K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” Journal of Computer and System Sciences, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.","ista":"Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.","short":"K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences. Elsevier, 2012. https://doi.org/10.1016/j.jcss.2011.05.002."},"publication":"Journal of Computer and System Sciences","page":"394 - 413","article_type":"original","has_accepted_license":"1","article_processing_charge":"No","day":"02","scopus_import":"1","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"volume":78,"date_created":"2018-12-11T12:05:29Z","date_updated":"2022-05-24T08:00:54Z","acknowledgement":"This research was supported in part by the ONR grant N00014-02-1-0671, by the AFOSR MURI grant F49620-00-1-0327, and by the NSF grants CCR-9988172, CCR-0085949, and CCR-0225610.","year":"2012","publisher":"Elsevier","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","publist_id":"2341","file_date_updated":"2020-07-14T12:46:17Z","doi":"10.1016/j.jcss.2011.05.002","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1016/j.jcss.2011.05.002","open_access":"1"}],"oa":1,"quality_controlled":"1","month":"03"},{"publication_status":"published","title":"STM imaging of impurity resonances on Bi 2Se 3","status":"public","intvolume":" 108","publisher":"American Physical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"387","year":"2012","date_updated":"2021-01-12T07:52:49Z","date_created":"2018-12-11T11:46:11Z","volume":108,"oa_version":"None","author":[{"full_name":"Alpichshev, Zhanybek","orcid":"0000-0002-7183-5203","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","last_name":"Alpichshev","first_name":"Zhanybek"},{"last_name":"Biswas","first_name":"Rudro","full_name":"Biswas, Rudro"},{"full_name":"Balatsky, Alexander","first_name":"Alexander","last_name":"Balatsky"},{"full_name":"Analytis, James","last_name":"Analytis","first_name":"James"},{"full_name":"Chu, Jiunhaw","first_name":"Jiunhaw","last_name":"Chu"},{"last_name":"Fisher","first_name":"Ian","full_name":"Fisher, Ian"},{"first_name":"Aharon","last_name":"Kapitulnik","full_name":"Kapitulnik, Aharon"}],"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"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."}],"issue":"20","publist_id":"7442","publication":"Physical Review Letters","main_file_link":[{"url":"https://arxiv.org/abs/1108.0022","open_access":"1"}],"citation":{"mla":"Alpichshev, Zhanybek, et al. “STM Imaging of Impurity Resonances on Bi 2Se 3.” Physical Review Letters, vol. 108, no. 20, American Physical Society, 2012, doi:10.1103/PhysRevLett.108.206402.","short":"Z. Alpichshev, R. Biswas, A. Balatsky, J. Analytis, J. Chu, I. Fisher, A. Kapitulnik, Physical Review Letters 108 (2012).","chicago":"Alpichshev, Zhanybek, Rudro Biswas, Alexander Balatsky, James Analytis, Jiunhaw Chu, Ian Fisher, and Aharon Kapitulnik. “STM Imaging of Impurity Resonances on Bi 2Se 3.” Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/PhysRevLett.108.206402.","ama":"Alpichshev Z, Biswas R, Balatsky A, et al. STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. 2012;108(20). doi:10.1103/PhysRevLett.108.206402","ista":"Alpichshev Z, Biswas R, Balatsky A, Analytis J, Chu J, Fisher I, Kapitulnik A. 2012. STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. 108(20).","apa":"Alpichshev, Z., Biswas, R., Balatsky, A., Analytis, J., Chu, J., Fisher, I., & Kapitulnik, A. (2012). STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.108.206402","ieee":"Z. Alpichshev et al., “STM imaging of impurity resonances on Bi 2Se 3,” Physical Review Letters, vol. 108, no. 20. American Physical Society, 2012."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2012-01-01T00:00:00Z","doi":"10.1103/PhysRevLett.108.206402","month":"01","day":"01"},{"doi":"10.1105/tpc.112.098905","date_published":"2012-06-01T00:00:00Z","publication":"Plant Cell","citation":{"short":"M. Dai, C. Zhang, U. Kania, F. Chen, Q. Xue, T. Mccray, G. Li, G. Qin, M. Wakeley, W. Terzaghi, J. Wan, Y. Zhao, J. Xu, J. Friml, X. Deng, H. Wang, Plant Cell 24 (2012) 2497–2514.","mla":"Dai, Mingqiu, et al. “A PP6 Type Phosphatase Holoenzyme Directly Regulates PIN Phosphorylation and Auxin Efflux in Arabidopsis.” Plant Cell, vol. 24, no. 6, American Society of Plant Biologists, 2012, pp. 2497–514, doi:10.1105/tpc.112.098905.","chicago":"Dai, Mingqiu, Chen Zhang, Urszula Kania, Fang Chen, Qin Xue, Tyra Mccray, Gang Li, et al. “A PP6 Type Phosphatase Holoenzyme Directly Regulates PIN Phosphorylation and Auxin Efflux in Arabidopsis.” Plant Cell. American Society of Plant Biologists, 2012. https://doi.org/10.1105/tpc.112.098905.","ama":"Dai M, Zhang C, Kania U, et al. A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. 2012;24(6):2497-2514. doi:10.1105/tpc.112.098905","apa":"Dai, M., Zhang, C., Kania, U., Chen, F., Xue, Q., Mccray, T., … Wang, H. (2012). A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.112.098905","ieee":"M. Dai et al., “A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis,” Plant Cell, vol. 24, no. 6. American Society of Plant Biologists, pp. 2497–2514, 2012.","ista":"Dai M, Zhang C, Kania U, Chen F, Xue Q, Mccray T, Li G, Qin G, Wakeley M, Terzaghi W, Wan J, Zhao Y, Xu J, Friml J, Deng X, Wang H. 2012. A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis. Plant Cell. 24(6), 2497–2514."},"quality_controlled":0,"page":"2497 - 2514","month":"06","day":"01","author":[{"full_name":"Dai, Mingqiu","first_name":"Mingqiu","last_name":"Dai"},{"first_name":"Chen","last_name":"Zhang","full_name":"Zhang, Chen"},{"full_name":"Urszula Kania","first_name":"Urszula","last_name":"Kania","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chen, Fang","first_name":"Fang","last_name":"Chen"},{"last_name":"Xue","first_name":"Qin","full_name":"Xue, Qin"},{"first_name":"Tyra","last_name":"Mccray","full_name":"McCray, Tyra"},{"full_name":"Li, Gang","last_name":"Li","first_name":"Gang"},{"first_name":"Genji","last_name":"Qin","full_name":"Qin, Genji"},{"last_name":"Wakeley","first_name":"Michelle","full_name":"Wakeley, Michelle"},{"full_name":"Terzaghi, William","last_name":"Terzaghi","first_name":"William"},{"full_name":"Wan, Jianmin","last_name":"Wan","first_name":"Jianmin"},{"last_name":"Zhao","first_name":"Yunde","full_name":"Zhao, Yunde"},{"full_name":"Xu, Jian","last_name":"Xu","first_name":"Jian"},{"full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml"},{"full_name":"Deng, Xing W","last_name":"Deng","first_name":"Xing"},{"first_name":"Haiyang","last_name":"Wang","full_name":"Wang, Haiyang"}],"date_updated":"2021-01-12T07:41:08Z","date_created":"2018-12-11T12:01:27Z","volume":24,"year":"2012","_id":"3110","title":"A PP6 type phosphatase holoenzyme directly regulates PIN phosphorylation and auxin efflux in Arabidopsis","publication_status":"published","status":"public","publisher":"American Society of Plant Biologists","intvolume":" 24","abstract":[{"lang":"eng","text":"The directional transport of the phytohormone auxin depends on the phosphorylation status and polar localization of PIN-FORMED (PIN) auxin efflux proteins. While PINIOD (PID) kinase is directly involved in the phosphorylation of PIN proteins, the phosphatase holoenzyme complexes that dephosphorylate PIN proteins remain elusive. Here, we demonstrate that mutations simultaneously disrupting the function of Arabidopsis thaliana FyPP1 (for Phytochrome-associated serine/threonine protein phosphatase1) and FyPP3, two homologous genes encoding the catalytic subunits of protein phosphatase6 (PP6), cause elevated accumulation of phosphorylated PIN proteins, correlating with a basal-to-apical shift in subcellular PIN localization. The changes in PIN polarity result in increased root basipetal auxin transport and severe defects, including shorter roots, fewer lateral roots, defective columella cells, root meristem collapse, abnormal cotyledons (small, cup-shaped, or fused cotyledons), and altered leaf venation. Our molecular, biochemical, and genetic data support the notion that FyPP1/3, SAL (for SAPS DOMAIN-LIKE), and PP2AA proteins (RCN1 [for ROOTS CURL IN NAPHTHYLPHTHALAMIC ACID1] or PP2AA1, PP2AA2, and PP2AA3) physically interact to form a novel PP6-type heterotrimeric holoenzyme complex. We also show that FyPP1/3, SAL, and PP2AA interact with a subset of PIN proteins and that for SAL the strength of the interaction depends on the PIN phosphorylation status. Thus, an Arabidopsis PP6-type phosphatase holoenzyme acts antagonistically with PID to direct auxin transport polarity and plant development by directly regulating PIN phosphorylation. "}],"issue":"6","publist_id":"3589","extern":1,"type":"journal_article"},{"year":"2012","_id":"3113","publisher":"National Academy of Sciences","intvolume":" 109","title":"Cell wall constrains lateral diffusion of plant plasma membrane proteins","publication_status":"published","status":"public","author":[{"last_name":"Martinière","first_name":"Alexandre","full_name":"Martinière, Alexandre"},{"first_name":"Irene","last_name":"Lavagi","full_name":"Lavagi, Irene"},{"last_name":"Nageswaran","first_name":"Gayathri","full_name":"Nageswaran, Gayathri"},{"full_name":"Rolfe, Daniel J","first_name":"Daniel","last_name":"Rolfe"},{"full_name":"Maneta-Peyret, Lilly","first_name":"Lilly","last_name":"Maneta Peyret"},{"full_name":"Luu, Doan-Trung","first_name":"Doan","last_name":"Luu"},{"full_name":"Botchway, Stanley W","last_name":"Botchway","first_name":"Stanley"},{"last_name":"Webb","first_name":"Stephen","full_name":"Webb, Stephen E"},{"last_name":"Mongrand","first_name":"Sebastien","full_name":"Mongrand, Sebastien"},{"first_name":"Christophe","last_name":"Maurel","full_name":"Maurel, Christophe"},{"last_name":"Martin Fernandez","first_name":"Marisa","full_name":"Martin-Fernandez, Marisa L"},{"first_name":"Jürgen","last_name":"Kleine Vehn","full_name":"Kleine-Vehn, Jürgen"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml","full_name":"Jirí Friml"},{"full_name":"Moreau, Patrick","last_name":"Moreau","first_name":"Patrick"},{"full_name":"Runions, John","first_name":"John","last_name":"Runions"}],"volume":109,"date_created":"2018-12-11T12:01:28Z","date_updated":"2021-01-12T07:41:09Z","type":"journal_article","issue":"31","publist_id":"3586","abstract":[{"text":"A cell membrane can be considered a liquid-phase plane in which lipids and proteins theoretically are free to diffuse. Numerous reports,however, describe retarded diffusion ofmembrane proteins in animal cells. This anomalous diffusion results from a combination of structuring factors including protein-protein interactions, cytoskeleton corralling, and lipid organization into microdomains. In plant cells, plasma-membrane (PM) proteins have been described as relatively immobile, but the control mechanisms that structure the PM have not been studied. Here, we use fluorescence recovery after photobleaching to estimate mobility of a set of minimal PM proteins. These proteins consist only of a PM-anchoring domain fused to a fluorescent protein, but their mobilities remained limited, as is the case for many full-length proteins. Neither the cytoskeleton nor membrane microdomain structure was involved in constraining the diffusion of these proteins. The cell wall, however, was shown to have a crucial role in immobilizing PM proteins. In addition, by single-molecule fluorescence imaging we confirmed that the pattern of cellulose deposition in the cell wall affects the trajectory and speed ofPMprotein diffusion. Regulation ofPMprotein dynamics by the plant cell wall can be interpreted as a mechanism for regulating protein interactions in processes such as trafficking and signal transduction.","lang":"eng"}],"extern":1,"citation":{"ama":"Martinière A, Lavagi I, Nageswaran G, et al. Cell wall constrains lateral diffusion of plant plasma membrane proteins. PNAS. 2012;109(31):12805-12810. doi:10.1073/pnas.1202040109","ieee":"A. Martinière et al., “Cell wall constrains lateral diffusion of plant plasma membrane proteins,” PNAS, vol. 109, no. 31. National Academy of Sciences, pp. 12805–12810, 2012.","apa":"Martinière, A., Lavagi, I., Nageswaran, G., Rolfe, D., Maneta Peyret, L., Luu, D., … Runions, J. (2012). Cell wall constrains lateral diffusion of plant plasma membrane proteins. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1202040109","ista":"Martinière A, Lavagi I, Nageswaran G, Rolfe D, Maneta Peyret L, Luu D, Botchway S, Webb S, Mongrand S, Maurel C, Martin Fernandez M, Kleine Vehn J, Friml J, Moreau P, Runions J. 2012. Cell wall constrains lateral diffusion of plant plasma membrane proteins. PNAS. 109(31), 12805–12810.","short":"A. Martinière, I. Lavagi, G. Nageswaran, D. Rolfe, L. Maneta Peyret, D. Luu, S. Botchway, S. Webb, S. Mongrand, C. Maurel, M. Martin Fernandez, J. Kleine Vehn, J. Friml, P. Moreau, J. Runions, PNAS 109 (2012) 12805–12810.","mla":"Martinière, Alexandre, et al. “Cell Wall Constrains Lateral Diffusion of Plant Plasma Membrane Proteins.” PNAS, vol. 109, no. 31, National Academy of Sciences, 2012, pp. 12805–10, doi:10.1073/pnas.1202040109.","chicago":"Martinière, Alexandre, Irene Lavagi, Gayathri Nageswaran, Daniel Rolfe, Lilly Maneta Peyret, Doan Luu, Stanley Botchway, et al. “Cell Wall Constrains Lateral Diffusion of Plant Plasma Membrane Proteins.” PNAS. National Academy of Sciences, 2012. https://doi.org/10.1073/pnas.1202040109."},"publication":"PNAS","page":"12805 - 12810","quality_controlled":0,"date_published":"2012-07-31T00:00:00Z","doi":"10.1073/pnas.1202040109","day":"31","month":"07"},{"date_published":"2012-07-03T00:00:00Z","doi":"10.1038/ncomms1941","publication":"Nature Communications","citation":{"chicago":"Ding, Zhaojun, Bangjun Wang, Ignacio Moreno, Nikoleta Dupláková, Sibu Simon, Nicola Carraro, Jesica Reemmer, et al. “ER-Localized Auxin Transporter PIN8 Regulates Auxin Homeostasis and Male Gametophyte Development in Arabidopsis.” Nature Communications. Nature Publishing Group, 2012. https://doi.org/10.1038/ncomms1941.","mla":"Ding, Zhaojun, et al. “ER-Localized Auxin Transporter PIN8 Regulates Auxin Homeostasis and Male Gametophyte Development in Arabidopsis.” Nature Communications, vol. 3, no. AN 941, Nature Publishing Group, 2012, doi:10.1038/ncomms1941.","short":"Z. Ding, B. Wang, I. Moreno, N. Dupláková, S. Simon, N. Carraro, J. Reemmer, A. Pěnčík, X. Chen, R. Tejos, P. Skůpa, S. Pollmann, J. Mravec, J. Petrášek, E. Zažímalová, D. Honys, J. Rolčík, A. Murphy, A. Orellana, M. Geisler, J. Friml, Nature Communications 3 (2012).","ista":"Ding Z, Wang B, Moreno I, Dupláková N, Simon S, Carraro N, Reemmer J, Pěnčík A, Chen X, Tejos R, Skůpa P, Pollmann S, Mravec J, Petrášek J, Zažímalová E, Honys D, Rolčík J, Murphy A, Orellana A, Geisler M, Friml J. 2012. ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis. Nature Communications. 3(AN 941).","apa":"Ding, Z., Wang, B., Moreno, I., Dupláková, N., Simon, S., Carraro, N., … Friml, J. (2012). ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms1941","ieee":"Z. Ding et al., “ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis,” Nature Communications, vol. 3, no. AN 941. Nature Publishing Group, 2012.","ama":"Ding Z, Wang B, Moreno I, et al. ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis. Nature Communications. 2012;3(AN 941). doi:10.1038/ncomms1941"},"quality_controlled":0,"month":"07","day":"03","author":[{"first_name":"Zhaojun","last_name":"Ding","full_name":"Ding, Zhaojun"},{"first_name":"Bangjun","last_name":"Wang","full_name":"Wang, Bangjun"},{"first_name":"Ignacio","last_name":"Moreno","full_name":"Moreno, Ignacio"},{"full_name":"Dupláková, Nikoleta","last_name":"Dupláková","first_name":"Nikoleta"},{"id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1998-6741","first_name":"Sibu","last_name":"Simon","full_name":"Sibu Simon"},{"last_name":"Carraro","first_name":"Nicola","full_name":"Carraro, Nicola"},{"full_name":"Reemmer, Jesica","first_name":"Jesica","last_name":"Reemmer"},{"full_name":"Pěnčík, Aleš","first_name":"Aleš","last_name":"Pěnčík"},{"id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","first_name":"Xu","last_name":"Chen","full_name":"Xu Chen"},{"full_name":"Tejos, Ricardo I","last_name":"Tejos","first_name":"Ricardo"},{"full_name":"Skůpa, Petr","last_name":"Skůpa","first_name":"Petr"},{"last_name":"Pollmann","first_name":"Stephan","full_name":"Pollmann, Stephan"},{"full_name":"Mravec, Jozef","last_name":"Mravec","first_name":"Jozef"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"full_name":"Zažímalová, Eva","last_name":"Zažímalová","first_name":"Eva"},{"first_name":"David","last_name":"Honys","full_name":"Honys, David"},{"full_name":"Rolčík, Jakub","last_name":"Rolčík","first_name":"Jakub"},{"first_name":"Angus","last_name":"Murphy","full_name":"Murphy, Angus S"},{"first_name":"Ariel","last_name":"Orellana","full_name":"Orellana, Ariel"},{"first_name":"Markus","last_name":"Geisler","full_name":"Geisler, Markus"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Jirí Friml"}],"date_created":"2018-12-11T12:01:28Z","date_updated":"2021-01-12T07:41:09Z","volume":3,"year":"2012","_id":"3114","status":"public","publication_status":"published","title":"ER-localized auxin transporter PIN8 regulates auxin homeostasis and male gametophyte development in Arabidopsis","intvolume":" 3","publisher":"Nature Publishing Group","abstract":[{"text":"Auxin is a key coordinative signal required for many aspects of plant development and its levels are controlled by auxin metabolism and intercellular auxin transport. Here we find that a member of PIN auxin transporter family, PIN8 is expressed in male gametophyte of Arabidopsis thaliana and has a crucial role in pollen development and functionality. Ectopic expression in sporophytic tissues establishes a role of PIN8 in regulating auxin homoeostasis and metabolism. PIN8 co-localizes with PIN5 to the endoplasmic reticulum (ER) where it acts as an auxin transporter. Genetic analyses reveal an antagonistic action of PIN5 and PIN8 in the regulation of intracellular auxin homoeostasis and gametophyte as well as sporophyte development. Our results reveal a role of the auxin transport in male gametophyte development in which the distinct actions of ER-localized PIN transporters regulate cellular auxin homoeostasis and maintain the auxin levels optimal for pollen development and pollen tube growth.","lang":"eng"}],"issue":"AN 941","publist_id":"3585","extern":1,"type":"journal_article"},{"type":"journal_article","extern":1,"publist_id":"3588","issue":"14","abstract":[{"lang":"eng","text":"PIN-FORMED (PIN) protein-mediated auxin polar transport is critically important for development, pattern formation, and morphogenesis in plants. Auxin has been implicated in the regulation of polar auxin transport by inhibiting PIN endocytosis [1, 2], but how auxin regulates this process is poorly understood. Our genetic screen identified the Arabidopsis SPIKE1 (SPK1) gene whose loss-of-function mutations increased lateral root density and retarded gravitropic responses, as do pin2 knockout mutations [3]. SPK1 belongs to the conserved DHR2-Dock family of Rho guanine nucleotide exchange factors [4-6]. The spk1 mutations induced PIN2 internalization that was not suppressed by auxin, as did the loss-of-function mutations for Rho-like GTPase from Plants 6 (ROP6)-GTPase or its effector RIC1. Furthermore, SPK1 was required for auxin induction of ROP6 activation. Our results have established a Rho GTPase-based auxin signaling pathway that maintains PIN2 polar distribution to the plasma membrane via inhibition of its internalization in Arabidopsis roots. Our findings provide new insights into signaling mechanisms that underlie the regulation of the dynamic trafficking of PINs required for long-distance auxin transport and that link auxin signaling to PIN-mediated pattern formation and morphogenesis."}],"intvolume":" 22","publisher":"Cell Press","title":"A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots","status":"public","publication_status":"published","_id":"3111","year":"2012","volume":22,"date_updated":"2021-01-12T07:41:08Z","date_created":"2018-12-11T12:01:27Z","author":[{"last_name":"Lin","first_name":"Deshu","full_name":"Lin, Deshu"},{"first_name":"Shingo","last_name":"Nagawa","full_name":"Nagawa, Shingo"},{"full_name":"Chen, Jisheng","first_name":"Jisheng","last_name":"Chen"},{"full_name":"Cao, Lingyan","first_name":"Lingyan","last_name":"Cao"},{"full_name":"Xu Chen","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","first_name":"Xu","last_name":"Chen"},{"first_name":"Tongda","last_name":"Xu","full_name":"Xu, Tongda"},{"full_name":"Hongjiang Li","first_name":"Hongjiang","last_name":"Li","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5039-9660"},{"last_name":"Dhonukshe","first_name":"Pankaj","full_name":"Dhonukshe, Pankaj"},{"first_name":"Chizuko","last_name":"Yamamuro","full_name":"Yamamuro, Chizuko"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Jirí Friml"},{"full_name":"Scheres, Ben","first_name":"Ben","last_name":"Scheres"},{"full_name":"Fu, Ying","first_name":"Ying","last_name":"Fu"},{"full_name":"Yang, Zhenbiao","last_name":"Yang","first_name":"Zhenbiao"}],"day":"24","month":"07","page":"1319 - 1325","quality_controlled":0,"citation":{"ista":"Lin D, Nagawa S, Chen J, Cao L, Chen X, Xu T, Li H, Dhonukshe P, Yamamuro C, Friml J, Scheres B, Fu Y, Yang Z. 2012. A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current Biology. 22(14), 1319–1325.","apa":"Lin, D., Nagawa, S., Chen, J., Cao, L., Chen, X., Xu, T., … Yang, Z. (2012). A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2012.05.019","ieee":"D. Lin et al., “A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots,” Current Biology, vol. 22, no. 14. Cell Press, pp. 1319–1325, 2012.","ama":"Lin D, Nagawa S, Chen J, et al. A ROP GTPase dependent auxin signaling pathway regulates the subcellular distribution of PIN2 in Arabidopsis roots. Current Biology. 2012;22(14):1319-1325. doi:10.1016/j.cub.2012.05.019","chicago":"Lin, Deshu, Shingo Nagawa, Jisheng Chen, Lingyan Cao, Xu Chen, Tongda Xu, Hongjiang Li, et al. “A ROP GTPase Dependent Auxin Signaling Pathway Regulates the Subcellular Distribution of PIN2 in Arabidopsis Roots.” Current Biology. Cell Press, 2012. https://doi.org/10.1016/j.cub.2012.05.019.","mla":"Lin, Deshu, et al. “A ROP GTPase Dependent Auxin Signaling Pathway Regulates the Subcellular Distribution of PIN2 in Arabidopsis Roots.” Current Biology, vol. 22, no. 14, Cell Press, 2012, pp. 1319–25, doi:10.1016/j.cub.2012.05.019.","short":"D. Lin, S. Nagawa, J. Chen, L. Cao, X. Chen, T. Xu, H. Li, P. Dhonukshe, C. Yamamuro, J. Friml, B. Scheres, Y. Fu, Z. Yang, Current Biology 22 (2012) 1319–1325."},"publication":"Current Biology","doi":"10.1016/j.cub.2012.05.019","date_published":"2012-07-24T00:00:00Z"},{"doi":"10.1016/j.cub.2012.05.020","date_published":"2012-07-24T00:00:00Z","quality_controlled":0,"page":"1326 - 1332","publication":"Current Biology","citation":{"ieee":"X. Chen et al., “ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots,” Current Biology, vol. 22, no. 14. Cell Press, pp. 1326–1332, 2012.","apa":"Chen, X., Naramoto, S., Robert, S., Tejos, R., Löfke, C., Lin, D., … Friml, J. (2012). ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2012.05.020","ista":"Chen X, Naramoto S, Robert S, Tejos R, Löfke C, Lin D, Yang Z, Friml J. 2012. ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. Current Biology. 22(14), 1326–1332.","ama":"Chen X, Naramoto S, Robert S, et al. ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots. Current Biology. 2012;22(14):1326-1332. doi:10.1016/j.cub.2012.05.020","chicago":"Chen, Xu, Satoshi Naramoto, Stéphanie Robert, Ricardo Tejos, Christian Löfke, Deshu Lin, Zhenbiao Yang, and Jiří Friml. “ABP1 and ROP6 GTPase Signaling Regulate Clathrin Mediated Endocytosis in Arabidopsis Roots.” Current Biology. Cell Press, 2012. https://doi.org/10.1016/j.cub.2012.05.020.","short":"X. Chen, S. Naramoto, S. Robert, R. Tejos, C. Löfke, D. Lin, Z. Yang, J. Friml, Current Biology 22 (2012) 1326–1332.","mla":"Chen, Xu, et al. “ABP1 and ROP6 GTPase Signaling Regulate Clathrin Mediated Endocytosis in Arabidopsis Roots.” Current Biology, vol. 22, no. 14, Cell Press, 2012, pp. 1326–32, doi:10.1016/j.cub.2012.05.020."},"month":"07","day":"24","date_created":"2018-12-11T12:01:27Z","date_updated":"2021-01-12T07:41:08Z","volume":22,"author":[{"full_name":"Xu Chen","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Xu"},{"full_name":"Naramoto, Satoshi","first_name":"Satoshi","last_name":"Naramoto"},{"full_name":"Robert, Stéphanie","first_name":"Stéphanie","last_name":"Robert"},{"full_name":"Tejos, Ricardo","first_name":"Ricardo","last_name":"Tejos"},{"full_name":"Löfke, Christian","last_name":"Löfke","first_name":"Christian"},{"full_name":"Lin, Deshu","first_name":"Deshu","last_name":"Lin"},{"first_name":"Zhenbiao","last_name":"Yang","full_name":"Yang, Zhenbiao"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí","full_name":"Jirí Friml"}],"title":"ABP1 and ROP6 GTPase signaling regulate clathrin mediated endocytosis in Arabidopsis roots","publication_status":"published","status":"public","intvolume":" 22","publisher":"Cell Press","year":"2012","_id":"3112","extern":1,"abstract":[{"text":"The dynamic spatial and temporal distribution of the crucial plant signaling molecule auxin is achieved by feedback coordination of auxin signaling and intercellular auxin transport pathways [1, 2]. Developmental roles of auxin have been attributed predominantly to its effect on transcription; however, an alternative pathway involving AUXIN BINDING PROTEIN1 (ABP1) has been proposed to regulate clathrin-mediated endocytosis in roots and Rho-like GTPase (ROP)-dependent pavement cell interdigitation in leaves [3, 4]. In this study, we show that ROP6 and its downstream effector RIC1 regulate clathrin association with the plasma membrane for clathrin-mediated endocytosis, as well as for its feedback regulation by auxin. Genetic analysis revealed that ROP6/RIC1 acts downstream of ABP1 to regulate endocytosis. This signaling circuit is also involved in the feedback regulation of PIN-FORMED 1 (PIN1) and PIN2 auxin transporters activity (via its constitutive endocytosis) and corresponding auxin transport-mediated processes, including root gravitropism and leave vascular tissue patterning. Our findings suggest that the signaling module auxin-ABP1-ROP6/RIC1-clathrin-PIN1/PIN2 is a shared component of the feedback regulation of auxin transport during both root and aerial development.","lang":"eng"}],"publist_id":"3587","issue":"14","type":"journal_article"},{"scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"ama":"Chatterjee K, Doyen L, Henzinger TA. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 2012;43(2):268-284. doi:10.1007/s10703-012-0164-2","ista":"Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2. Springer, pp. 268–284, 2012.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-012-0164-2","mla":"Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design, vol. 43, no. 2, Springer, 2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design. Springer, 2012. https://doi.org/10.1007/s10703-012-0164-2."},"publication":"Formal Methods in System Design","page":"268 - 284","date_published":"2012-10-01T00:00:00Z","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"We consider two-player zero-sum stochastic games on graphs with ω-regular winning conditions specified as parity objectives. These games have applications in the design and control of reactive systems. We survey the complexity results for the problem of deciding the winner in such games, and in classes of interest obtained as special cases, based on the information and the power of randomization available to the players, on the class of objectives and on the winning mode. On the basis of information, these games can be classified as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided partial-observation (one player has partial-observation and the other player has complete-observation); and (c) complete-observation (both players have complete view of the game). The one-sided partial-observation games have two important subclasses: the one-player games, known as partial-observation Markov decision processes (POMDPs), and the blind one-player games, known as probabilistic automata. On the basis of randomization, (a) the players may not be allowed to use randomization (pure strategies), or (b) they may choose a probability distribution over actions but the actual random choice is external and not visible to the player (actions invisible), or (c) they may use full randomization. Finally, various classes of games are obtained by restricting the parity objective to a reachability, safety, Büchi, or coBüchi condition. We also consider several winning modes, such as sure-winning (i.e., all outcomes of a strategy have to satisfy the winning condition), almost-sure winning (i.e., winning with probability 1), limit-sure winning (i.e., winning with probability arbitrarily close to 1), and value-threshold winning (i.e., winning with probability at least ν, where ν is a given rational). "}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3128","intvolume":" 43","title":"A survey of partial-observation stochastic parity games","status":"public","ddc":["005"],"pubrep_id":"303","file":[{"date_updated":"2020-07-14T12:46:00Z","date_created":"2018-12-12T10:11:27Z","checksum":"dd3d590f383bb2ac6cfda1489ac1c42a","relation":"main_file","file_id":"4882","content_type":"application/pdf","file_size":163983,"creator":"system","file_name":"IST-2014-303-v1+1_Survey_Partial-Observation_Stochastic_Parity_Games.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","month":"10","oa":1,"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","doi":"10.1007/s10703-012-0164-2","language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"3570","file_date_updated":"2020-07-14T12:46:00Z","year":"2012","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF NFN Grant No. S11407-N23(RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, ERC Advanced grant QUAREM, and FWF Grant No. S11403-N23 (RiSE).","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"volume":43,"date_updated":"2021-01-12T07:41:15Z","date_created":"2018-12-11T12:01:33Z"},{"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"date_published":"2012-10-01T00:00:00Z","citation":{"apa":"Sharmanska, V., Quadrianto, N., & Lampert, C. (2012). Augmented attribute representations (Vol. 7576, pp. 242–255). Presented at the ECCV: European Conference on Computer Vision, Florence, Italy: Springer. https://doi.org/10.1007/978-3-642-33715-4_18","ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Augmented attribute representations,” presented at the ECCV: European Conference on Computer Vision, Florence, Italy, 2012, vol. 7576, no. PART 5, pp. 242–255.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2012. Augmented attribute representations. ECCV: European Conference on Computer Vision, LNCS, vol. 7576, 242–255.","ama":"Sharmanska V, Quadrianto N, Lampert C. Augmented attribute representations. In: Vol 7576. Springer; 2012:242-255. doi:10.1007/978-3-642-33715-4_18","chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Augmented Attribute Representations,” 7576:242–55. Springer, 2012. https://doi.org/10.1007/978-3-642-33715-4_18.","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, Springer, 2012, pp. 242–255.","mla":"Sharmanska, Viktoriia, et al. Augmented Attribute Representations. Vol. 7576, no. PART 5, Springer, 2012, pp. 242–55, doi:10.1007/978-3-642-33715-4_18."},"page":"242 - 255","abstract":[{"lang":"eng","text":"We propose a new learning method to infer a mid-level feature representation that combines the advantage of semantic attribute representations with the higher expressive power of non-semantic features. The idea lies in augmenting an existing attribute-based representation with additional dimensions for which an autoencoder model is coupled with a large-margin principle. This construction allows a smooth transition between the zero-shot regime with no training example, the unsupervised regime with training examples but without class labels, and the supervised regime with training examples and with class labels. The resulting optimization problem can be solved efficiently, because several of the necessity steps have closed-form solutions. Through extensive experiments we show that the augmented representation achieves better results in terms of object categorization accuracy than the semantic representation alone."}],"issue":"PART 5","type":"conference","alternative_title":["LNCS"],"file":[{"access_level":"open_access","file_name":"2012_ECCV_Sharmanska.pdf","content_type":"application/pdf","file_size":6073897,"creator":"dernst","relation":"main_file","file_id":"7861","checksum":"bccdbe0663780d25a1e0524002b2d896","date_created":"2020-05-15T12:29:04Z","date_updated":"2020-07-14T12:46:00Z"}],"oa_version":"Submitted Version","_id":"3125","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"status":"public","title":"Augmented attribute representations","intvolume":" 7576","month":"10","conference":{"start_date":"2012-10-07","location":"Florence, Italy","end_date":"2012-10-13","name":"ECCV: European Conference on Computer Vision"},"doi":"10.1007/978-3-642-33715-4_18","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","file_date_updated":"2020-07-14T12:46:00Z","publist_id":"3574","author":[{"full_name":"Sharmanska, Viktoriia","orcid":"0000-0003-0192-9308","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","last_name":"Sharmanska","first_name":"Viktoriia"},{"full_name":"Quadrianto, Novi","first_name":"Novi","last_name":"Quadrianto"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"date_created":"2018-12-11T12:01:32Z","date_updated":"2023-02-23T11:13:25Z","volume":7576,"year":"2012","publication_status":"published","publisher":"Springer","department":[{"_id":"ChLa"}]},{"quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1107.3793","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1107.3793"]},"language":[{"iso":"eng"}],"conference":{"location":"Helsinki, Finland","start_date":"2012-07-04","end_date":"2012-07-06","name":"SWAT: Symposium and Workshops on Algorithm Theory"},"doi":"10.1007/978-3-642-31155-0_17","month":"06","publication_status":"published","publisher":"Springer","department":[{"_id":"HeEd"}],"year":"2012","date_created":"2018-12-11T12:01:33Z","date_updated":"2021-01-12T07:41:15Z","volume":7357,"author":[{"full_name":"Busaryev, Oleksiy","last_name":"Busaryev","first_name":"Oleksiy"},{"full_name":"Cabello, Sergio","last_name":"Cabello","first_name":"Sergio"},{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","first_name":"Chao"},{"full_name":"Dey, Tamal","last_name":"Dey","first_name":"Tamal"},{"last_name":"Wang","first_name":"Yusu","full_name":"Wang, Yusu"}],"publist_id":"3569","page":"189 - 200","citation":{"chicago":"Busaryev, Oleksiy, Sergio Cabello, Chao Chen, Tamal Dey, and Yusu Wang. “Annotating Simplices with a Homology Basis and Its Applications,” 7357:189–200. Springer, 2012. https://doi.org/10.1007/978-3-642-31155-0_17.","short":"O. Busaryev, S. Cabello, C. Chen, T. Dey, Y. Wang, in:, Springer, 2012, pp. 189–200.","mla":"Busaryev, Oleksiy, et al. Annotating Simplices with a Homology Basis and Its Applications. Vol. 7357, Springer, 2012, pp. 189–200, doi:10.1007/978-3-642-31155-0_17.","ieee":"O. Busaryev, S. Cabello, C. Chen, T. Dey, and Y. Wang, “Annotating simplices with a homology basis and its applications,” presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland, 2012, vol. 7357, pp. 189–200.","apa":"Busaryev, O., Cabello, S., Chen, C., Dey, T., & Wang, Y. (2012). Annotating simplices with a homology basis and its applications (Vol. 7357, pp. 189–200). Presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland: Springer. https://doi.org/10.1007/978-3-642-31155-0_17","ista":"Busaryev O, Cabello S, Chen C, Dey T, Wang Y. 2012. Annotating simplices with a homology basis and its applications. SWAT: Symposium and Workshops on Algorithm Theory, LNCS, vol. 7357, 189–200.","ama":"Busaryev O, Cabello S, Chen C, Dey T, Wang Y. Annotating simplices with a homology basis and its applications. In: Vol 7357. Springer; 2012:189-200. doi:10.1007/978-3-642-31155-0_17"},"date_published":"2012-06-19T00:00:00Z","scopus_import":1,"day":"19","status":"public","title":"Annotating simplices with a homology basis and its applications","intvolume":" 7357","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3129","oa_version":"Preprint","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Let K be a simplicial complex and g the rank of its p-th homology group Hp(K) defined with ℤ2 coefficients. We show that we can compute a basis H of Hp(K) and annotate each p-simplex of K with a binary vector of length g with the following property: the annotations, summed over all p-simplices in any p-cycle z, provide the coordinate vector of the homology class [z] in the basis H. The basis and the annotations for all simplices can be computed in O(n ω ) time, where n is the size of K and ω < 2.376 is a quantity so that two n×n matrices can be multiplied in O(n ω ) time. The precomputed annotations permit answering queries about the independence or the triviality of p-cycles efficiently.\r\n\r\nUsing annotations of edges in 2-complexes, we derive better algorithms for computing optimal basis and optimal homologous cycles in 1 - dimensional homology. Specifically, for computing an optimal basis of H1(K) , we improve the previously known time complexity from O(n 4) to O(n ω + n 2 g ω − 1). Here n denotes the size of the 2-skeleton of K and g the rank of H1(K) . Computing an optimal cycle homologous to a given 1-cycle is NP-hard even for surfaces and an algorithm taking 2 O(g) nlogn time is known for surfaces. We extend this algorithm to work with arbitrary 2-complexes in O(n ω ) + 2 O(g) n 2logn time using annotations.\r\n"}]},{"month":"08","day":"14","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2012-08-14T00:00:00Z","doi":"10.1007/978-3-642-32717-9_21","conference":{"name":"DAGM: German Association For Pattern Recognition","end_date":"2012-08-31","location":"Graz, Austria","start_date":"2012-08-28"},"page":"205 - 215","quality_controlled":"1","citation":{"ista":"Müller A, Nowozin S, Lampert C. 2012. Information theoretic clustering using minimal spanning trees. DAGM: German Association For Pattern Recognition, LNCS, vol. 7476, 205–215.","ieee":"A. Müller, S. Nowozin, and C. Lampert, “Information theoretic clustering using minimal spanning trees,” presented at the DAGM: German Association For Pattern Recognition, Graz, Austria, 2012, vol. 7476, pp. 205–215.","apa":"Müller, A., Nowozin, S., & Lampert, C. (2012). Information theoretic clustering using minimal spanning trees (Vol. 7476, pp. 205–215). Presented at the DAGM: German Association For Pattern Recognition, Graz, Austria: Springer. https://doi.org/10.1007/978-3-642-32717-9_21","ama":"Müller A, Nowozin S, Lampert C. Information theoretic clustering using minimal spanning trees. In: Vol 7476. Springer; 2012:205-215. doi:10.1007/978-3-642-32717-9_21","chicago":"Müller, Andreas, Sebastian Nowozin, and Christoph Lampert. “Information Theoretic Clustering Using Minimal Spanning Trees,” 7476:205–15. Springer, 2012. https://doi.org/10.1007/978-3-642-32717-9_21.","mla":"Müller, Andreas, et al. Information Theoretic Clustering Using Minimal Spanning Trees. Vol. 7476, Springer, 2012, pp. 205–15, doi:10.1007/978-3-642-32717-9_21.","short":"A. Müller, S. Nowozin, C. Lampert, in:, Springer, 2012, pp. 205–215."},"publist_id":"3573","abstract":[{"text":"In this work we propose a new information-theoretic clustering algorithm that infers cluster memberships by direct optimization of a non-parametric mutual information estimate between data distribution and cluster assignment. Although the optimization objective has a solid theoretical foundation it is hard to optimize. We propose an approximate optimization formulation that leads to an efficient algorithm with low runtime complexity. The algorithm has a single free parameter, the number of clusters to find. We demonstrate superior performance on several synthetic and real datasets.\r\n","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"None","volume":7476,"date_created":"2018-12-11T12:01:32Z","date_updated":"2021-01-12T07:41:14Z","author":[{"full_name":"Müller, Andreas","last_name":"Müller","first_name":"Andreas"},{"full_name":"Nowozin, Sebastian","first_name":"Sebastian","last_name":"Nowozin"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"intvolume":" 7476","department":[{"_id":"ChLa"}],"publisher":"Springer","title":"Information theoretic clustering using minimal spanning trees","publication_status":"published","status":"public","year":"2012","_id":"3126","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We propose synchronous interfaces, a new interface theory for discrete-time systems. We use an application to time-triggered scheduling to drive the design choices for our formalism; in particular, additionally to deriving useful mathematical properties, we focus on providing a syntax which is adapted to natural high-level system modeling. As a result, we develop an interface model that relies on a guarded-command based language and is equipped with shared variables and explicit discrete-time clocks. We define all standard interface operations: compatibility checking, composition, refinement, and shared refinement. Apart from the synchronous interface model, the contribution of this paper is the establishment of a formal relation between interface theories and real-time scheduling, where we demonstrate a fully automatic framework for the incremental computation of time-triggered schedules."}],"_id":"3155","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 7273","status":"public","title":"Synchronous interface theories and time triggered scheduling","ddc":["004"],"pubrep_id":"88","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:11:25Z","date_updated":"2020-07-14T12:46:01Z","checksum":"feae2e07f2d9a59843f8ddabf25d179f","file_id":"4879","relation":"main_file","creator":"system","file_size":493198,"content_type":"application/pdf","file_name":"IST-2012-88-v1+1_Synchronous_interface_theories_and_time_triggered_scheduling.pdf","access_level":"open_access"}],"scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"ieee":"B. Delahaye, U. Fahrenberg, T. A. Henzinger, A. Legay, and D. Nickovic, “Synchronous interface theories and time triggered scheduling,” presented at the FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden, 2012, vol. 7273, pp. 203–218.","apa":"Delahaye, B., Fahrenberg, U., Henzinger, T. A., Legay, A., & Nickovic, D. (2012). Synchronous interface theories and time triggered scheduling (Vol. 7273, pp. 203–218). Presented at the FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , Stockholm, Sweden: Springer. https://doi.org/10.1007/978-3-642-30793-5_13","ista":"Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. 2012. Synchronous interface theories and time triggered scheduling. FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , LNCS, vol. 7273, 203–218.","ama":"Delahaye B, Fahrenberg U, Henzinger TA, Legay A, Nickovic D. Synchronous interface theories and time triggered scheduling. In: Vol 7273. Springer; 2012:203-218. doi:10.1007/978-3-642-30793-5_13","chicago":"Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,” 7273:203–18. Springer, 2012. https://doi.org/10.1007/978-3-642-30793-5_13.","short":"B. Delahaye, U. Fahrenberg, T.A. Henzinger, A. Legay, D. Nickovic, in:, Springer, 2012, pp. 203–218.","mla":"Delahaye, Benoît, et al. Synchronous Interface Theories and Time Triggered Scheduling. Vol. 7273, Springer, 2012, pp. 203–18, doi:10.1007/978-3-642-30793-5_13."},"page":"203 - 218","date_published":"2012-06-01T00:00:00Z","publist_id":"3539","file_date_updated":"2020-07-14T12:46:01Z","year":"2012","acknowledgement":"Research partially supported by the Danish-Chinese Center for Cyber Physical Systems (Grant No.61061130541) and VKR Center of Excellence MT-LAB.","department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","author":[{"full_name":"Delahaye, Benoît","first_name":"Benoît","last_name":"Delahaye"},{"full_name":"Fahrenberg, Uli","last_name":"Fahrenberg","first_name":"Uli"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Legay, Axel","last_name":"Legay","first_name":"Axel"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan"}],"volume":7273,"date_created":"2018-12-11T12:01:43Z","date_updated":"2021-01-12T07:41:26Z","month":"06","oa":1,"quality_controlled":"1","doi":"10.1007/978-3-642-30793-5_13","conference":{"start_date":"2012-06-13","location":"Stockholm, Sweden","end_date":"2012-06-16","name":"FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems "},"language":[{"iso":"eng"}]},{"acknowledgement":"his work was supported by the National Science Foundation Plant Genome Research Program (grant 0820624 to H.E. and J.S.W.), the Defense Advanced Projects Research Agency (grant HR0011-09-1-0055 to H.E. and J.S.W.), and the European Science Foundation (under the Research Networking Programme on “Applied and Computational Algebraic Topology” run by H.E.). Joshua S. Weitz, Ph.D., holds a Career Award at the Scientific Interface from the Burroughs Wellcome Fund.\r\n\r\n\r\n\r\nDuring preparation of this manuscript the authors became aware of a related work by Katifori and Magnasco (arXiv:1110.1412v1), concurrently submitted and accepted for publication in PLoS ONE.","year":"2012","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Public Library of Science","author":[{"first_name":"Yuriy","last_name":"Mileyko","full_name":"Mileyko, Yuriy"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Price, Charles","first_name":"Charles","last_name":"Price"},{"last_name":"Weitz","first_name":"Joshua","full_name":"Weitz, Joshua"}],"date_created":"2018-12-11T12:01:44Z","date_updated":"2021-01-12T07:41:28Z","volume":7,"article_number":"e36715","file_date_updated":"2020-07-14T12:46:01Z","publist_id":"3530","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","doi":"10.1371/journal.pone.0036715","language":[{"iso":"eng"}],"month":"06","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3159","status":"public","title":"Hierarchical ordering of reticular networks","ddc":["510"],"intvolume":" 7","pubrep_id":"385","file":[{"file_name":"2012_PLoS_Mileyko.PDF","access_level":"open_access","content_type":"application/pdf","file_size":541583,"creator":"kschuh","relation":"main_file","file_id":"5922","date_created":"2019-02-05T12:38:43Z","date_updated":"2020-07-14T12:46:01Z","checksum":"515a98ad72e470752f03f13663dcaff8"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"The structure of hierarchical networks in biological and physical systems has long been characterized using the Horton-Strahler ordering scheme. The scheme assigns an integer order to each edge in the network based on the topology of branching such that the order increases from distal parts of the network (e.g., mountain streams or capillaries) to the "root" of the network (e.g., the river outlet or the aorta). However, Horton-Strahler ordering cannot be applied to networks with loops because they they create a contradiction in the edge ordering in terms of which edge precedes another in the hierarchy. Here, we present a generalization of the Horton-Strahler order to weighted planar reticular networks, where weights are assumed to correlate with the importance of network edges, e.g., weights estimated from edge widths may correlate to flow capacity. Our method assigns hierarchical levels not only to edges of the network, but also to its loops, and classifies the edges into reticular edges, which are responsible for loop formation, and tree edges. In addition, we perform a detailed and rigorous theoretical analysis of the sensitivity of the hierarchical levels to weight perturbations. In doing so, we show that the ordering of the reticular edges is more robust to noise in weight estimation than is the ordering of the tree edges. We discuss applications of this generalized Horton-Strahler ordering to the study of leaf venation and other biological networks."}],"issue":"6","publication":"PLoS One","citation":{"chicago":"Mileyko, Yuriy, Herbert Edelsbrunner, Charles Price, and Joshua Weitz. “Hierarchical Ordering of Reticular Networks.” PLoS One. Public Library of Science, 2012. https://doi.org/10.1371/journal.pone.0036715.","mla":"Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.” PLoS One, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:10.1371/journal.pone.0036715.","short":"Y. Mileyko, H. Edelsbrunner, C. Price, J. Weitz, PLoS One 7 (2012).","ista":"Mileyko Y, Edelsbrunner H, Price C, Weitz J. 2012. Hierarchical ordering of reticular networks. PLoS One. 7(6), e36715.","apa":"Mileyko, Y., Edelsbrunner, H., Price, C., & Weitz, J. (2012). Hierarchical ordering of reticular networks. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0036715","ieee":"Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering of reticular networks,” PLoS One, vol. 7, no. 6. Public Library of Science, 2012.","ama":"Mileyko Y, Edelsbrunner H, Price C, Weitz J. Hierarchical ordering of reticular networks. PLoS One. 2012;7(6). doi:10.1371/journal.pone.0036715"},"date_published":"2012-06-06T00:00:00Z","scopus_import":1,"day":"06","has_accepted_license":"1"},{"abstract":[{"text":"Dispersal is crucial for gene flow and often determines the long-term stability of meta-populations, particularly in rare species with specialized life cycles. Such species are often foci of conservation efforts because they suffer disproportionally from degradation and fragmentation of their habitat. However, detailed knowledge of effective gene flow through dispersal is often missing, so that conservation strategies have to be based on mark-recapture observations that are suspected to be poor predictors of long-distance dispersal. These constraints have been especially severe in the study of butterfly populations, where microsatellite markers have been difficult to develop. We used eight microsatellite markers to analyse genetic population structure of the Large Blue butterfly Maculinea arion in Sweden. During recent decades, this species has become an icon of insect conservation after massive decline throughout Europe and extinction in Britain followed by reintroduction of a seed population from the Swedish island of Öland. We find that populations are highly structured genetically, but that gene flow occurs over distances 15 times longer than the maximum distance recorded from mark-recapture studies, which can only be explained by maximum dispersal distances at least twice as large as previously accepted. However, we also find evidence that gaps between sites with suitable habitat exceeding ∼ 20 km induce genetic erosion that can be detected from bottleneck analyses. Although further work is needed, our results suggest that M. arion can maintain fully functional metapopulations when they consist of optimal habitat patches that are no further apart than ∼10 km.","lang":"eng"}],"issue":"13","publist_id":"3538","type":"journal_article","date_updated":"2021-01-12T07:41:27Z","date_created":"2018-12-11T12:01:43Z","volume":21,"oa_version":"None","author":[{"last_name":"Ugelvig","first_name":"Line V","orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","full_name":"Ugelvig, Line V"},{"full_name":"Andersen, Anne","first_name":"Anne","last_name":"Andersen"},{"full_name":"Boomsma, Jacobus","last_name":"Boomsma","first_name":"Jacobus"},{"first_name":"David","last_name":"Nash","full_name":"Nash, David"}],"publication_status":"published","status":"public","title":"Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion","department":[{"_id":"SyCr"}],"intvolume":" 21","publisher":"Wiley-Blackwell","year":"2012","_id":"3156","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The work was financed by the Danish National Science Research Foundation via a grant to the Centre for Social Evolution.\r\nWe thank four anonymous reviewers for useful comments on the manuscript, J. Bergsten, P. Bina, B. Carlsson, M. Johannesson and A.E. Lomborg for providing additional wingtip samples, A. Illum for assistance in the field, and in particular P.S. Nielsen for mediating the contact to the collectors and the Swedish authorities. Collection was made possible through a permit by the Åtgärdsprogrammet, supported by the Swedish Environmental Protection Agency.","day":"01","month":"07","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2012-07-01T00:00:00Z","doi":"10.1111/j.1365-294X.2012.05592.x","quality_controlled":"1","page":"3224 - 3236","publication":"Molecular Ecology","citation":{"chicago":"Ugelvig, Line V, Anne Andersen, Jacobus Boomsma, and David Nash. “Dispersal and Gene Flow in the Rare Parasitic Large Blue Butterfly Maculinea Arion.” Molecular Ecology. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1365-294X.2012.05592.x.","short":"L.V. Ugelvig, A. Andersen, J. Boomsma, D. Nash, Molecular Ecology 21 (2012) 3224–3236.","mla":"Ugelvig, Line V., et al. “Dispersal and Gene Flow in the Rare Parasitic Large Blue Butterfly Maculinea Arion.” Molecular Ecology, vol. 21, no. 13, Wiley-Blackwell, 2012, pp. 3224–36, doi:10.1111/j.1365-294X.2012.05592.x.","apa":"Ugelvig, L. V., Andersen, A., Boomsma, J., & Nash, D. (2012). Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1111/j.1365-294X.2012.05592.x","ieee":"L. V. Ugelvig, A. Andersen, J. Boomsma, and D. Nash, “Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion,” Molecular Ecology, vol. 21, no. 13. Wiley-Blackwell, pp. 3224–3236, 2012.","ista":"Ugelvig LV, Andersen A, Boomsma J, Nash D. 2012. Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. 21(13), 3224–3236.","ama":"Ugelvig LV, Andersen A, Boomsma J, Nash D. Dispersal and gene flow in the rare parasitic Large Blue butterfly Maculinea arion. Molecular Ecology. 2012;21(13):3224-3236. doi:10.1111/j.1365-294X.2012.05592.x"}},{"author":[{"last_name":"Schachtner","first_name":"Hannah","full_name":"Schachtner, Hannah"},{"last_name":"Li","first_name":"Ang","full_name":"Li, Ang"},{"full_name":"Stevenson, David","last_name":"Stevenson","first_name":"David"},{"full_name":"Calaminus, Simon","first_name":"Simon","last_name":"Calaminus"},{"first_name":"Steven","last_name":"Thomas","full_name":"Thomas, Steven"},{"full_name":"Watson, Steve","first_name":"Steve","last_name":"Watson"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K"},{"last_name":"Wedlich Söldner","first_name":"Roland","full_name":"Wedlich Söldner, Roland"},{"last_name":"Strathdee","first_name":"Douglas","full_name":"Strathdee, Douglas"},{"last_name":"Machesky","first_name":"Laura","full_name":"Machesky, Laura"}],"volume":91,"date_updated":"2021-01-12T07:41:27Z","date_created":"2018-12-11T12:01:44Z","pmid":1,"year":"2012","department":[{"_id":"MiSi"}],"publisher":"Elsevier","publication_status":"published","publist_id":"3534","doi":"10.1016/j.ejcb.2012.04.002","language":[{"iso":"eng"}],"external_id":{"pmid":["22658956"]},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3930012/","open_access":"1"}],"oa":1,"quality_controlled":"1","month":"11","oa_version":"Submitted Version","_id":"3158","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 91","status":"public","title":"Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo","issue":"11-12","abstract":[{"text":"We describe here the development and characterization of a conditionally inducible mouse model expressing Lifeact-GFP, a peptide that reports the dynamics of filamentous actin. We have used this model to study platelets, megakaryocytes and melanoblasts and we provide evidence that Lifeact-GFP is a useful reporter in these cell types ex vivo. In the case of platelets and megakaryocytes, these cells are not transfectable by traditional methods, so conditional activation of Lifeact allows the study of actin dynamics in these cells live. We studied melanoblasts in native skin explants from embryos, allowing the visualization of live actin dynamics during cytokinesis and migration. Our study revealed that melanoblasts lacking the small GTPase Rac1 show a delay in the formation of new pseudopodia following cytokinesis that accounts for the previously reported cytokinesis delay in these cells. Thus, through use of this mouse model, we were able to gain insights into the actin dynamics of cells that could only previously be studied using fixed specimens or following isolation from their native tissue environment.","lang":"eng"}],"type":"journal_article","date_published":"2012-11-01T00:00:00Z","citation":{"ista":"Schachtner H, Li A, Stevenson D, Calaminus S, Thomas S, Watson S, Sixt MK, Wedlich Söldner R, Strathdee D, Machesky L. 2012. Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. European Journal of Cell Biology. 91(11–12), 923–929.","apa":"Schachtner, H., Li, A., Stevenson, D., Calaminus, S., Thomas, S., Watson, S., … Machesky, L. (2012). Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. European Journal of Cell Biology. Elsevier. https://doi.org/10.1016/j.ejcb.2012.04.002","ieee":"H. Schachtner et al., “Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo,” European Journal of Cell Biology, vol. 91, no. 11–12. Elsevier, pp. 923–929, 2012.","ama":"Schachtner H, Li A, Stevenson D, et al. Tissue inducible Lifeact expression allows visualization of actin dynamics in vivo and ex vivo. European Journal of Cell Biology. 2012;91(11-12):923-929. doi:10.1016/j.ejcb.2012.04.002","chicago":"Schachtner, Hannah, Ang Li, David Stevenson, Simon Calaminus, Steven Thomas, Steve Watson, Michael K Sixt, Roland Wedlich Söldner, Douglas Strathdee, and Laura Machesky. “Tissue Inducible Lifeact Expression Allows Visualization of Actin Dynamics in Vivo and Ex Vivo.” European Journal of Cell Biology. Elsevier, 2012. https://doi.org/10.1016/j.ejcb.2012.04.002.","mla":"Schachtner, Hannah, et al. “Tissue Inducible Lifeact Expression Allows Visualization of Actin Dynamics in Vivo and Ex Vivo.” European Journal of Cell Biology, vol. 91, no. 11–12, Elsevier, 2012, pp. 923–29, doi:10.1016/j.ejcb.2012.04.002.","short":"H. Schachtner, A. Li, D. Stevenson, S. Calaminus, S. Thomas, S. Watson, M.K. Sixt, R. Wedlich Söldner, D. Strathdee, L. Machesky, European Journal of Cell Biology 91 (2012) 923–929."},"publication":"European Journal of Cell Biology","page":"923 - 929","day":"01","scopus_import":1},{"issue":"1","abstract":[{"lang":"eng","text":"We describe RTblob, a high speed vision system that detects objects in cluttered scenes based on their color and shape at a speed of over 800 frames/s. Because the system is available as open-source software and relies only on off-the-shelf PC hardware components, it can provide the basis for multiple application scenarios. As an illustrative example, we show how RTblob can be used in a robotic table tennis scenario to estimate ball trajectories through 3D space simultaneously from four cameras images at a speed of 200 Hz."}],"type":"journal_article","file":[{"access_level":"open_access","file_name":"2012_Springer_Lampert.pdf","creator":"kschuh","file_size":2933187,"content_type":"application/pdf","file_id":"5958","relation":"main_file","checksum":"241be47ea50e81a283bcf4c45b07e8cc","date_updated":"2020-07-14T12:46:04Z","date_created":"2019-02-12T10:52:25Z"}],"oa_version":"Submitted Version","intvolume":" 7","status":"public","title":"Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3248","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2012-03-01T00:00:00Z","page":"31 - 41","article_type":"original","citation":{"ama":"Lampert C, Peters J. Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. Journal of Real-Time Image Processing. 2012;7(1):31-41. doi:10.1007/s11554-010-0168-3","ieee":"C. Lampert and J. Peters, “Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components,” Journal of Real-Time Image Processing, vol. 7, no. 1. Springer, pp. 31–41, 2012.","apa":"Lampert, C., & Peters, J. (2012). Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. Journal of Real-Time Image Processing. Springer. https://doi.org/10.1007/s11554-010-0168-3","ista":"Lampert C, Peters J. 2012. Real-time detection of colored objects in multiple camera streams with off-the-shelf hardware components. Journal of Real-Time Image Processing. 7(1), 31–41.","short":"C. Lampert, J. Peters, Journal of Real-Time Image Processing 7 (2012) 31–41.","mla":"Lampert, Christoph, and Jan Peters. “Real-Time Detection of Colored Objects in Multiple Camera Streams with off-the-Shelf Hardware Components.” Journal of Real-Time Image Processing, vol. 7, no. 1, Springer, 2012, pp. 31–41, doi:10.1007/s11554-010-0168-3.","chicago":"Lampert, Christoph, and Jan Peters. “Real-Time Detection of Colored Objects in Multiple Camera Streams with off-the-Shelf Hardware Components.” Journal of Real-Time Image Processing. Springer, 2012. https://doi.org/10.1007/s11554-010-0168-3."},"publication":"Journal of Real-Time Image Processing","publist_id":"3417","file_date_updated":"2020-07-14T12:46:04Z","volume":7,"date_updated":"2022-05-24T08:05:40Z","date_created":"2018-12-11T12:02:15Z","author":[{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Peters, Jan","last_name":"Peters","first_name":"Jan"}],"department":[{"_id":"ChLa"}],"publisher":"Springer","publication_status":"published","year":"2012","publication_identifier":{"issn":["1861-8200"],"eissn":["1861-8219"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.1007/s11554-010-0168-3","quality_controlled":"1","oa":1},{"scopus_import":1,"month":"02","day":"01","citation":{"ama":"Vilaça S, Fernandes Redondo RA, Lins L, Santos F. Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). Conservation Genetics. 2012;13(1):293-298. doi:10.1007/s10592-011-0262-5","ista":"Vilaça S, Fernandes Redondo RA, Lins L, Santos F. 2012. Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). Conservation Genetics. 13(1), 293–298.","ieee":"S. Vilaça, R. A. Fernandes Redondo, L. Lins, and F. Santos, “Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus),” Conservation Genetics, vol. 13, no. 1. Springer, pp. 293–298, 2012.","apa":"Vilaça, S., Fernandes Redondo, R. A., Lins, L., & Santos, F. (2012). Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus). Conservation Genetics. Springer. https://doi.org/10.1007/s10592-011-0262-5","mla":"Vilaça, Sibelle, et al. “Remaining Genetic Diversity in Brazilian Merganser (Mergus Octosetaceus).” Conservation Genetics, vol. 13, no. 1, Springer, 2012, pp. 293–98, doi:10.1007/s10592-011-0262-5.","short":"S. Vilaça, R.A. Fernandes Redondo, L. Lins, F. Santos, Conservation Genetics 13 (2012) 293–298.","chicago":"Vilaça, Sibelle, Rodrigo A Fernandes Redondo, Lívia Lins, and Fabrício Santos. “Remaining Genetic Diversity in Brazilian Merganser (Mergus Octosetaceus).” Conservation Genetics. Springer, 2012. https://doi.org/10.1007/s10592-011-0262-5."},"publication":"Conservation Genetics","page":"293 - 298","quality_controlled":"1","date_published":"2012-02-01T00:00:00Z","doi":"10.1007/s10592-011-0262-5","language":[{"iso":"eng"}],"type":"journal_article","publist_id":"3420","issue":"1","abstract":[{"text":"The Brazilian Merganser is a very rare and threatened species that nowadays inhabits only a few protected areas and their surroundings in the Brazilian territory. In order to estimate the remaining genetic diversity and population structure in this species, two mitochondrial genes were sequenced in 39 individuals belonging to two populations and in one individual collected in Argentina in 1950. We found a highly significant divergence between two major remaining populations of Mergus octosetaceus, which suggests a historical population structure in this species. Furthermore, two deeply divergent lineages were found in a single location, which could due to current or historical secondary contact. Based on the available genetic data, we point out future directions which would contribute to design strategies for conservation and management of this threatened species.","lang":"eng"}],"year":"2012","_id":"3247","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The present study received grants from FAPEMIG, CNPq, Petrobras Ambiental and Fundação O Boticário de Conservação da Natureza, and followed all ethical guidelines and legal requirements of Brazil for sampling and studying an endangered species.\r\nWe thank the Specialist Work Group for the Conservation of Brazilian Merganser for valuable discussions and opinions on this manuscript. We also thank all the staff from Instituto Terra Brasilis and Funatura (Vivian S. Braz and Gislaine Disconzi) for collecting the samples at Serra da Canastra and Chapada dos Veadeiros, respectively; Dario A. Lijtmaerand and Pablo Tubaro for providing the samples from Argentina, Bradley C. Livezey for sending copies of his papers, and Geoff M. Hilton and Paulo de Tarso Z. Antas for useful suggestions that greatly improved this manuscript.","department":[{"_id":"JoBo"}],"publisher":"Springer","intvolume":" 13","publication_status":"published","title":"Remaining genetic diversity in Brazilian Merganser (Mergus octosetaceus)","status":"public","author":[{"full_name":"Vilaça, Sibelle","last_name":"Vilaça","first_name":"Sibelle"},{"last_name":"Fernandes Redondo","first_name":"Rodrigo A","orcid":"0000-0002-5837-2793","id":"409D5C96-F248-11E8-B48F-1D18A9856A87","full_name":"Fernandes Redondo, Rodrigo A"},{"full_name":"Lins, Lívia","first_name":"Lívia","last_name":"Lins"},{"full_name":"Santos, Fabrício","last_name":"Santos","first_name":"Fabrício"}],"volume":13,"oa_version":"None","date_created":"2018-12-11T12:02:15Z","date_updated":"2021-01-12T07:42:05Z"},{"day":"17","month":"01","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2012-01-17T00:00:00Z","doi":"10.1016/j.devcel.2011.12.018","page":"3 - 4","quality_controlled":"1","citation":{"ama":"Behrndt M, Heisenberg C-PJ. Spurred by resistance mechanosensation in collective migration. Developmental Cell. 2012;22(1):3-4. doi:10.1016/j.devcel.2011.12.018","ista":"Behrndt M, Heisenberg C-PJ. 2012. Spurred by resistance mechanosensation in collective migration. Developmental Cell. 22(1), 3–4.","apa":"Behrndt, M., & Heisenberg, C.-P. J. (2012). Spurred by resistance mechanosensation in collective migration. Developmental Cell. Cell Press. https://doi.org/10.1016/j.devcel.2011.12.018","ieee":"M. Behrndt and C.-P. J. Heisenberg, “Spurred by resistance mechanosensation in collective migration,” Developmental Cell, vol. 22, no. 1. Cell Press, pp. 3–4, 2012.","mla":"Behrndt, Martin, and Carl-Philipp J. Heisenberg. “Spurred by Resistance Mechanosensation in Collective Migration.” Developmental Cell, vol. 22, no. 1, Cell Press, 2012, pp. 3–4, doi:10.1016/j.devcel.2011.12.018.","short":"M. Behrndt, C.-P.J. Heisenberg, Developmental Cell 22 (2012) 3–4.","chicago":"Behrndt, Martin, and Carl-Philipp J Heisenberg. “Spurred by Resistance Mechanosensation in Collective Migration.” Developmental Cell. Cell Press, 2012. https://doi.org/10.1016/j.devcel.2011.12.018."},"publication":"Developmental Cell","issue":"1","publist_id":"3426","abstract":[{"text":"How cells orchestrate their behavior during collective migration is a long-standing question. Using magnetic tweezers to apply mechanical stimuli to Xenopus mesendoderm cells, Weber etal. (2012) now reveal, in this issue of Developmental Cell, a cadherin-mediated mechanosensitive response that promotes cell polarization and movement persistence during the collective mesendoderm migration in gastrulation.","lang":"eng"}],"type":"journal_article","oa_version":"None","volume":22,"date_updated":"2021-01-12T07:42:05Z","date_created":"2018-12-11T12:02:14Z","author":[{"full_name":"Behrndt, Martin","first_name":"Martin","last_name":"Behrndt","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"publisher":"Cell Press","department":[{"_id":"CaHe"}],"intvolume":" 22","publication_status":"published","title":"Spurred by resistance mechanosensation in collective migration","status":"public","_id":"3245","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012"},{"month":"04","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1112.5026"}],"quality_controlled":"1","doi":"10.1103/PhysRevE.85.041903","language":[{"iso":"eng"}],"article_number":"041903","publist_id":"3386","acknowledgement":"We thank T. Gregor, E. F. Wieschaus, and, especially, C. G. Callan for helpful discussions.\r\nWork at Princeton was supported in part by NSF Grants No. PHY–0957573 and No. CCF–0939370, by NIH Grant No. R01 GM077599, and by the W. M. Keck Foundation. For part of this work, G.T. was supported in part by NSF Grant No. EF–0928048 and by the Vice Provost for Research at the University of Pennsylvania.","year":"2012","publication_status":"published","publisher":"American Institute of Physics","department":[{"_id":"GaTk"}],"author":[{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gasper","last_name":"Tkacik","full_name":"Tkacik, Gasper"},{"first_name":"Aleksandra","last_name":"Walczak","full_name":"Walczak, Aleksandra"},{"last_name":"Bialek","first_name":"William","full_name":"Bialek, William"}],"date_updated":"2021-01-12T07:42:14Z","date_created":"2018-12-11T12:02:20Z","volume":85,"scopus_import":1,"day":"01","publication":" Physical Review E statistical nonlinear and soft matter physics ","citation":{"chicago":"Tkačik, Gašper, Aleksandra Walczak, and William Bialek. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” Physical Review E Statistical Nonlinear and Soft Matter Physics . American Institute of Physics, 2012. https://doi.org/10.1103/PhysRevE.85.041903.","short":"G. Tkačik, A. Walczak, W. Bialek, Physical Review E Statistical Nonlinear and Soft Matter Physics 85 (2012).","mla":"Tkačik, Gašper, et al. “Optimizing Information Flow in Small Genetic Networks. III. A Self-Interacting Gene.” Physical Review E Statistical Nonlinear and Soft Matter Physics , vol. 85, no. 4, 041903, American Institute of Physics, 2012, doi:10.1103/PhysRevE.85.041903.","ieee":"G. Tkačik, A. Walczak, and W. Bialek, “Optimizing information flow in small genetic networks. III. A self-interacting gene,” Physical Review E statistical nonlinear and soft matter physics , vol. 85, no. 4. American Institute of Physics, 2012.","apa":"Tkačik, G., Walczak, A., & Bialek, W. (2012). Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E Statistical Nonlinear and Soft Matter Physics . American Institute of Physics. https://doi.org/10.1103/PhysRevE.85.041903","ista":"Tkačik G, Walczak A, Bialek W. 2012. Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E statistical nonlinear and soft matter physics . 85(4), 041903.","ama":"Tkačik G, Walczak A, Bialek W. Optimizing information flow in small genetic networks. III. A self-interacting gene. Physical Review E statistical nonlinear and soft matter physics . 2012;85(4). doi:10.1103/PhysRevE.85.041903"},"date_published":"2012-04-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Living cells must control the reading out or "expression" of information encoded in their genomes, and this regulation often is mediated by transcription factors--proteins that bind to DNA and either enhance or repress the expression of nearby genes. But the expression of transcription factor proteins is itself regulated, and many transcription factors regulate their own expression in addition to responding to other input signals. Here we analyze the simplest of such self-regulatory circuits, asking how parameters can be chosen to optimize information transmission from inputs to outputs in the steady state. Some nonzero level of self-regulation is almost always optimal, with self-activation dominant when transcription factor concentrations are low and self-repression dominant when concentrations are high. In steady state the optimal self-activation is never strong enough to induce bistability, although there is a limit in which the optimal parameters are very close to the critical point.","lang":"eng"}],"issue":"4","_id":"3262","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Optimizing information flow in small genetic networks. III. A self-interacting gene","status":"public","intvolume":" 85","oa_version":"Preprint"},{"day":"01","scopus_import":1,"date_published":"2012-03-01T00:00:00Z","publication":"Discrete Applied Mathematics","citation":{"ama":"Kolmogorov V. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 2012;160(4-5):416-426. doi:10.1016/j.dam.2011.10.026","ista":"Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 160(4–5), 416–426.","apa":"Kolmogorov, V. (2012). Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2011.10.026","ieee":"V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” Discrete Applied Mathematics, vol. 160, no. 4–5. Elsevier, pp. 416–426, 2012.","mla":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:10.1016/j.dam.2011.10.026.","short":"V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.","chicago":"Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics. Elsevier, 2012. https://doi.org/10.1016/j.dam.2011.10.026."},"page":"416 - 426","abstract":[{"lang":"eng","text":"Consider a convex relaxation f̂ of a pseudo-Boolean function f. We say that the relaxation is totally half-integral if f̂(x) is a polyhedral function with half-integral extreme points x, and this property is preserved after adding an arbitrary combination of constraints of the form x i=x j, x i=1-x j, and x i=γ where γ∈{0,1,1/2} is a constant. A well-known example is the roof duality relaxation for quadratic pseudo-Boolean functions f. We argue that total half-integrality is a natural requirement for generalizations of roof duality to arbitrary pseudo-Boolean functions. Our contributions are as follows. First, we provide a complete characterization of totally half-integral relaxations f̂ by establishing a one-to-one correspondence with bisubmodular functions. Second, we give a new characterization of bisubmodular functions. Finally, we show some relationships between general totally half-integral relaxations and relaxations based on the roof duality. On the conceptual level, our results show that bisubmodular functions provide a natural generalization of the roof duality approach to higher-order terms. This can be viewed as a non-submodular analogue of the fact that submodular functions generalize the s-t minimum cut problem with non-negative weights to higher-order terms."}],"issue":"4-5","type":"journal_article","oa_version":"Preprint","_id":"3257","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Generalized roof duality and bisubmodular functions","intvolume":" 160","month":"03","doi":"10.1016/j.dam.2011.10.026","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1005.2305"}],"external_id":{"arxiv":["1005.2305"]},"oa":1,"quality_controlled":"1","publist_id":"3397","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2934"}]},"date_updated":"2023-02-23T11:04:49Z","date_created":"2018-12-11T12:02:18Z","volume":160,"year":"2012","publication_status":"published","publisher":"Elsevier","department":[{"_id":"VlKo"}]},{"day":"01","month":"01","language":[{"iso":"eng"}],"date_published":"2012-01-01T00:00:00Z","doi":"10.1007/978-94-007-4966-5_22","page":"387 - 405","quality_controlled":"1","citation":{"apa":"de Vladar, H., & Chela Flores, J. (2012). Can the evolution of multicellularity be anticipated in the exploration of the solar system? In Life on Earth and other planetary bodies (Vol. 24, pp. 387–405). Springer. https://doi.org/10.1007/978-94-007-4966-5_22","ieee":"H. de Vladar and J. Chela Flores, “Can the evolution of multicellularity be anticipated in the exploration of the solar system?,” in Life on Earth and other planetary bodies, vol. 24, Springer, 2012, pp. 387–405.","ista":"de Vladar H, Chela Flores J. 2012.Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: Life on Earth and other planetary bodies. Cellular Origin, Life in Extreme Habitats and Astrobiology, vol. 24, 387–405.","ama":"de Vladar H, Chela Flores J. Can the evolution of multicellularity be anticipated in the exploration of the solar system? In: Life on Earth and Other Planetary Bodies. Vol 24. Springer; 2012:387-405. doi:10.1007/978-94-007-4966-5_22","chicago":"Vladar, Harold de, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” In Life on Earth and Other Planetary Bodies, 24:387–405. Springer, 2012. https://doi.org/10.1007/978-94-007-4966-5_22.","short":"H. de Vladar, J. Chela Flores, in:, Life on Earth and Other Planetary Bodies, Springer, 2012, pp. 387–405.","mla":"de Vladar, Harold, and Julian Chela Flores. “Can the Evolution of Multicellularity Be Anticipated in the Exploration of the Solar System?” Life on Earth and Other Planetary Bodies, vol. 24, Springer, 2012, pp. 387–405, doi:10.1007/978-94-007-4966-5_22."},"publication":"Life on Earth and other planetary bodies","publist_id":"3369","abstract":[{"lang":"eng","text":"The problem of the origin of metazoa is becoming more urgent in the context of astrobiology. By now it is clear that clues to the understanding of this crucial transition in the evolution of life can arise in a fourth pathway besides the three possibilities in the quest for simplicity outlined by Bonner in his classical book. In other words, solar system exploration seems to be one way in the long-term to elucidate the simplicity of evolutionary development. We place these ideas in the context of different inheritance systems, namely the genotypic and phenotypic replicators with limited or unlimited heredity, and ask which of these can support multicellular development, and to which degree of complexity. However, the quest for evidence on the evolution of biotas from planets around other stars does not seem to be feasible with present technology with direct visualization of living organisms on exoplanets. But this may be attempted on the Galilean moons of Jupiter where there is a possibility of detecting reliable biomarkers in the next decade with the Europa Jupiter System Mission, in view of recent progress by landing micropenetrators on planetary, or satellite surfaces. Mars is a second possibility in the inner Solar System, in spite of the multiple difficulties faced by the fleet of past, present and future missions. We discuss a series of preliminary ideas for elucidating the origin of metazoan analogues with available instrumentation in potential payloads of feasible space missions to the Galilean moons."}],"alternative_title":["Cellular Origin, Life in Extreme Habitats and Astrobiology"],"type":"book_chapter","oa_version":"None","volume":24,"date_created":"2018-12-11T12:02:25Z","date_updated":"2021-01-12T07:42:20Z","author":[{"full_name":"de Vladar, Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5985-7653","first_name":"Harold","last_name":"de Vladar"},{"full_name":"Chela Flores, Julian","last_name":"Chela Flores","first_name":"Julian"}],"department":[{"_id":"NiBa"}],"publisher":"Springer","intvolume":" 24","status":"public","title":"Can the evolution of multicellularity be anticipated in the exploration of the solar system?","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3277","year":"2012"},{"page":"369 - 382","citation":{"chicago":"Jain, Abhishek, Krzysztof Z Pietrzak, and Aris Tentes. “Hardness Preserving Constructions of Pseudorandom Functions,” 7194:369–82. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_21.","mla":"Jain, Abhishek, et al. Hardness Preserving Constructions of Pseudorandom Functions. Vol. 7194, Springer, 2012, pp. 369–82, doi:10.1007/978-3-642-28914-9_21.","short":"A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382.","ista":"Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 369–382.","apa":"Jain, A., Pietrzak, K. Z., & Tentes, A. (2012). Hardness preserving constructions of pseudorandom functions (Vol. 7194, pp. 369–382). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_21","ieee":"A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.","ama":"Jain A, Pietrzak KZ, Tentes A. Hardness preserving constructions of pseudorandom functions. In: Vol 7194. Springer; 2012:369-382. doi:10.1007/978-3-642-28914-9_21"},"date_published":"2012-05-04T00:00:00Z","scopus_import":1,"day":"04","title":"Hardness preserving constructions of pseudorandom functions","status":"public","intvolume":" 7194","_id":"3279","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We show a hardness-preserving construction of a PRF from any length doubling PRG which improves upon known constructions whenever we can put a non-trivial upper bound q on the number of queries to the PRF. Our construction requires only O(logq) invocations to the underlying PRG with each query. In comparison, the number of invocations by the best previous hardness-preserving construction (GGM using Levin's trick) is logarithmic in the hardness of the PRG. For example, starting from an exponentially secure PRG {0,1} n → {0,1} 2n, we get a PRF which is exponentially secure if queried at most q = exp(√n)times and where each invocation of the PRF requires Θ(√n) queries to the underlying PRG. This is much less than the Θ(n) required by known constructions. \r\n"}],"quality_controlled":"1","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"main_file_link":[{"url":"http://www.iacr.org/archive/tcc2012/tcc2012-index.html"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2012-03-21","start_date":"2012-03-19","location":"Taormina, Sicily, Italy","name":"TCC: Theory of Cryptography Conference"},"doi":"10.1007/978-3-642-28914-9_21","month":"05","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"year":"2012","acknowledgement":"Supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)","date_created":"2018-12-11T12:02:25Z","date_updated":"2021-01-12T07:42:21Z","volume":7194,"author":[{"first_name":"Abhishek","last_name":"Jain","full_name":"Jain, Abhishek"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Tentes, Aris","last_name":"Tentes","first_name":"Aris"}],"publist_id":"3367","ec_funded":1},{"type":"journal_article","issue":"6","publist_id":"3372","abstract":[{"text":"A boundary element model of a tunnel running through horizontally layered soil with anisotropic material properties is presented. Since there is no analytical fundamental solution for wave propagation inside a layered orthotropic medium in 3D, the fundamental displacements and stresses have to be calculated numerically. In our model this is done in the Fourier domain with respect to space and time. The assumption of a straight tunnel with infinite extension in the x direction makes it possible to decouple the system for every wave number kx, leading to a 2.5D-problem, which is suited for parallel computation. The special form of the fundamental solution, resulting from our Fourier ansatz, and the fact, that the calculation of the boundary integral equation is performed in the Fourier domain, enhances the stability and efficiency of the numerical calculations.","lang":"eng"}],"intvolume":" 36","publisher":"Elsevier","department":[{"_id":"GaTk"}],"title":"A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil","status":"public","publication_status":"published","acknowledgement":"This work was supported by the Austrian Federal Ministry of Transport, Innovation and Technology under the Grant Bmvit-isb2 and the FFG under the project Pr. Nr. 809089.","_id":"3274","year":"2012","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":36,"date_created":"2018-12-11T12:02:24Z","date_updated":"2021-01-12T07:42:19Z","author":[{"full_name":"Rieckh, Georg","first_name":"Georg","last_name":"Rieckh","id":"34DA8BD6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Wolfgang","last_name":"Kreuzer","full_name":"Kreuzer, Wolfgang"},{"full_name":"Waubke, Holger","last_name":"Waubke","first_name":"Holger"},{"first_name":"Peter","last_name":"Balazs","full_name":"Balazs, Peter"}],"scopus_import":1,"month":"06","day":"01","page":"960 - 967","quality_controlled":"1","citation":{"mla":"Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” Engineering Analysis with Boundary Elements, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:10.1016/j.enganabound.2011.12.014.","short":"G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary Elements 36 (2012) 960–967.","chicago":"Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.” Engineering Analysis with Boundary Elements. Elsevier, 2012. https://doi.org/10.1016/j.enganabound.2011.12.014.","ama":"Rieckh G, Kreuzer W, Waubke H, Balazs P. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. 2012;36(6):960-967. doi:10.1016/j.enganabound.2011.12.014","ista":"Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. 36(6), 960–967.","ieee":"G. Rieckh, W. Kreuzer, H. Waubke, and P. Balazs, “A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil,” Engineering Analysis with Boundary Elements, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.","apa":"Rieckh, G., Kreuzer, W., Waubke, H., & Balazs, P. (2012). A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered anisotropic soil. Engineering Analysis with Boundary Elements. Elsevier. https://doi.org/10.1016/j.enganabound.2011.12.014"},"publication":" Engineering Analysis with Boundary Elements","language":[{"iso":"eng"}],"doi":"10.1016/j.enganabound.2011.12.014","date_published":"2012-06-01T00:00:00Z"},{"abstract":[{"lang":"eng","text":"Viral manipulation of transduction pathways associated with key cellular functions such as survival, response to microbial infection, and cytoskeleton reorganization can provide the supportive milieu for a productive infection. Here, we demonstrate that vaccinia virus (VACV) infection leads to activation of the stress-activated protein kinase (SAPK)/extracellular signal-regulated kinase (ERK) 4/7 (MKK4/7)-c-Jun N-terminal protein kinase 1/2 (JNK1/2) pathway; further, the stimulation of this pathway requires postpenetration, prereplicative events in the viral replication cycle. Although the formation of intracellular mature virus (IMV) was not affected in MKK4/7- or JNK1/2-knockout (KO) cells, we did note an accentuated deregulation of microtubule and actin network organization in infected JNK1/2-KO cells. This was followed by deregulated viral trafficking to the periphery and enhanced enveloped particle release. Furthermore, VACV infection induced alterations in the cell contractility and morphology, and cell migration was reduced in the JNK-KO cells. In addition, phosphorylation of proteins implicated with early cell contractility and cell migration, such as microtubule-associated protein 1B and paxillin, respectively, was not detected in the VACV-infected KO cells. In sum, our findings uncover a regulatory role played by the MKK4/7-JNK1/2 pathway in cytoskeleton reorganization during VACV infection.\r\n"}],"issue":"1","type":"journal_article","oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3289","title":"A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization","status":"public","intvolume":" 86","day":"01","scopus_import":1,"date_published":"2012-01-01T00:00:00Z","publication":"Journal of Virology","citation":{"ama":"Pereira A, Leite F, Brasil B, et al. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. 2012;86(1):172-184. doi:10.1128/JVI.05638-11","apa":"Pereira, A., Leite, F., Brasil, B., Soares Martins, J., Torres, A., Pimenta, P., … Bonjardim, C. (2012). A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. ASM. https://doi.org/10.1128/JVI.05638-11","ieee":"A. Pereira et al., “A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization,” Journal of Virology, vol. 86, no. 1. ASM, pp. 172–184, 2012.","ista":"Pereira A, Leite F, Brasil B, Soares Martins J, Torres A, Pimenta P, Souto Padrón T, Tranktman P, Ferreira P, Kroon E, Bonjardim C. 2012. A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology. 86(1), 172–184.","short":"A. Pereira, F. Leite, B. Brasil, J. Soares Martins, A. Torres, P. Pimenta, T. Souto Padrón, P. Tranktman, P. Ferreira, E. Kroon, C. Bonjardim, Journal of Virology 86 (2012) 172–184.","mla":"Pereira, Anna, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” Journal of Virology, vol. 86, no. 1, ASM, 2012, pp. 172–84, doi:10.1128/JVI.05638-11.","chicago":"Pereira, Anna, Flávia Leite, Bruno Brasil, Jamaria Soares Martins, Alice Torres, Paulo Pimenta, Thais Souto Padrón, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” Journal of Virology. ASM, 2012. https://doi.org/10.1128/JVI.05638-11."},"page":"172 - 184","publist_id":"3356","author":[{"first_name":"Anna","last_name":"Pereira","full_name":"Pereira, Anna"},{"id":"36705F98-F248-11E8-B48F-1D18A9856A87","last_name":"Leite","first_name":"Flávia","full_name":"Leite, Flávia"},{"full_name":"Brasil, Bruno","first_name":"Bruno","last_name":"Brasil"},{"first_name":"Jamaria","last_name":"Soares Martins","full_name":"Soares Martins, Jamaria"},{"full_name":"Torres, Alice","first_name":"Alice","last_name":"Torres"},{"last_name":"Pimenta","first_name":"Paulo","full_name":"Pimenta, Paulo"},{"last_name":"Souto Padrón","first_name":"Thais","full_name":"Souto Padrón, Thais"},{"full_name":"Tranktman, Paula","last_name":"Tranktman","first_name":"Paula"},{"last_name":"Ferreira","first_name":"Paulo","full_name":"Ferreira, Paulo"},{"full_name":"Kroon, Erna","last_name":"Kroon","first_name":"Erna"},{"last_name":"Bonjardim","first_name":"Cláudio","full_name":"Bonjardim, Cláudio"}],"date_updated":"2021-01-12T07:42:25Z","date_created":"2018-12-11T12:02:29Z","volume":86,"year":"2012","acknowledgement":"This work was supported by grants from Fundação de Amparo a Pesquisa do Estado de Minas Gerais (FAPEMIG), the Brazilian Federal Agency for Support and Evaluation of Graduate Education (CAPES), and the National Council for Scientific and Technological Development (CNPq). A.C.T.C.P., B.S.A.F.B., F.G.G.L., and J.A.P.S.-M. were recipients of predoctoral fellowships from CNPq. C.A.B., E.G.K., T.S.-P., P.F.P.P., and P.C.P.F. are recipients of research fellowships from CNPq. \r\n\r\n\r\nWe are grateful to Angela S. Lopes, Ilda M. V. Gama, João R. dos Santos, and Andreza A. Carvalho for their secretarial/technical assistance and to Fernanda Gambogi for help with immunofluorescence microscopy. We also thank M. C. Sogayar (Department of Biochemistry, University of São Paulo, São Paulo, Brazil), who kindly provided us with the A31 cell line, and R. Davis (Howard Hughes Medical Institute, University of Massachusetts Medical School, Worcester, MA) for the WT and JNK1/2-, MKK4-, MKK7-, and MKK4/7-KO cells. VACV WR was from C. Jungwirth (Universität Würzburg, Würzburg, Germany). The recombinant VACV vF13L-GFP and the rabbit polyclonal antibodies against viral proteins, B5R, D8L, L1R, and A36R, were from B. Moss (NIAID, Bethesda, MD). The pcDNA3-Myc-JNK2-MKK7 WT plasmid was from Eugen Kerkhoff (Universität Würzburg, Würzburg, Germany). We also thank Flávio G. da Fonseca (UFMG, Belo Horizonte, MG, Brazil) and Kathleen A. Boyle (Medical College of Wisconsin, Milwaukee, WI) for critically reading the manuscript.","pmid":1,"publication_status":"published","publisher":"ASM","department":[{"_id":"JoBo"}],"month":"01","doi":"10.1128/JVI.05638-11","language":[{"iso":"eng"}],"external_id":{"pmid":["22031940"]},"oa":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/","open_access":"1"}],"quality_controlled":"1"},{"scopus_import":1,"has_accepted_license":"1","day":"01","page":"1436 - 1444","citation":{"ieee":"P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” Pattern Recognition Letters, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.","apa":"Bendich, P., Cabello, S., & Edelsbrunner, H. (2012). A point calculus for interlevel set homology. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2011.10.007","ista":"Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.","ama":"Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology. Pattern Recognition Letters. 2012;33(11):1436-1444. doi:10.1016/j.patrec.2011.10.007","chicago":"Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters. Elsevier, 2012. https://doi.org/10.1016/j.patrec.2011.10.007.","short":"P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.","mla":"Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” Pattern Recognition Letters, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:10.1016/j.patrec.2011.10.007."},"publication":"Pattern Recognition Letters","date_published":"2012-08-01T00:00:00Z","type":"journal_article","issue":"11","abstract":[{"text":"The theory of persistent homology opens up the possibility to reason about topological features of a space or a function quantitatively and in combinatorial terms. We refer to this new angle at a classical subject within algebraic topology as a point calculus, which we present for the family of interlevel sets of a real-valued function. Our account of the subject is expository, devoid of proofs, and written for non-experts in algebraic topology.","lang":"eng"}],"intvolume":" 33","title":"A point calculus for interlevel set homology","ddc":["000"],"status":"public","_id":"3310","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":280280,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2016-542-v1+1_2012-J-01-Poinculus.pdf","checksum":"d65f79775b51258a604ca5ec741297cc","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-12T10:15:00Z","relation":"main_file","file_id":"5116"}],"oa_version":"Submitted Version","pubrep_id":"542","month":"08","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.patrec.2011.10.007","publist_id":"3330","file_date_updated":"2020-07-14T12:46:06Z","publisher":"Elsevier","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2012","acknowledgement":"Research by the third author is partially supported by the National Science Foundation (NSF) under grant DBI-0820624.","volume":33,"date_created":"2018-12-11T12:02:36Z","date_updated":"2021-01-12T07:42:34Z","author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","last_name":"Bendich","first_name":"Paul","full_name":"Bendich, Paul"},{"first_name":"Sergio","last_name":"Cabello","full_name":"Cabello, Sergio"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}]},{"language":[{"iso":"eng"}],"date_published":"2012-01-01T00:00:00Z","doi":"10.1021/cg201709c","quality_controlled":"1","article_type":"original","page":"1085 - 1090","publication":"Crystal Growth and Design ","citation":{"short":"M. Ibáñez, R. Zamani, W. Li, A. Shavel, J. Arbiol, J. Morante, A. Cabot, Crystal Growth and Design 12 (2012) 1085–1090.","mla":"Ibáñez, Maria, et al. “Extending the Nanocrystal Synthesis Control to Quaternary Compositions.” Crystal Growth and Design , vol. 12, no. 3, American Chemical Society (ACS), 2012, pp. 1085–90, doi:10.1021/cg201709c.","chicago":"Ibáñez, Maria, Reza Zamani, Wenhua Li, Alexey Shavel, Jordi Arbiol, Joan Morante, and Andreu Cabot. “Extending the Nanocrystal Synthesis Control to Quaternary Compositions.” Crystal Growth and Design . American Chemical Society (ACS), 2012. https://doi.org/10.1021/cg201709c.","ama":"Ibáñez M, Zamani R, Li W, et al. Extending the nanocrystal synthesis control to quaternary compositions. Crystal Growth and Design . 2012;12(3):1085-1090. doi:10.1021/cg201709c","ieee":"M. Ibáñez et al., “Extending the nanocrystal synthesis control to quaternary compositions,” Crystal Growth and Design , vol. 12, no. 3. American Chemical Society (ACS), pp. 1085–1090, 2012.","apa":"Ibáñez, M., Zamani, R., Li, W., Shavel, A., Arbiol, J., Morante, J., & Cabot, A. (2012). Extending the nanocrystal synthesis control to quaternary compositions. Crystal Growth and Design . American Chemical Society (ACS). https://doi.org/10.1021/cg201709c","ista":"Ibáñez M, Zamani R, Li W, Shavel A, Arbiol J, Morante J, Cabot A. 2012. Extending the nanocrystal synthesis control to quaternary compositions. Crystal Growth and Design . 12(3), 1085–1090."},"day":"01","month":"01","article_processing_charge":"No","date_updated":"2021-01-12T07:43:05Z","date_created":"2018-12-11T11:45:54Z","oa_version":"None","volume":12,"author":[{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez"},{"first_name":"Reza","last_name":"Zamani","full_name":"Zamani, Reza"},{"full_name":"Li, Wenhua","last_name":"Li","first_name":"Wenhua"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"first_name":"Joan","last_name":"Morante","full_name":"Morante, Joan"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"publication_status":"published","status":"public","title":"Extending the nanocrystal synthesis control to quaternary compositions","intvolume":" 12","publisher":"American Chemical Society (ACS)","_id":"338","acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, ENE2008-03277-E/CON, CSD2009-00050, and CSD2009-00013. M.I. thanks the Spanish MICINN for her Ph.D. grant. J.A. and R.Z. also acknowledge Generalitat de Catalunya 2009-SGR-770 and XaRMAE. A.C. is grateful for financial support through the Ramon y Cajal program of the Spanish MICINN.\r\n\r\n","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2012","extern":"1","abstract":[{"lang":"eng","text":"The ample chemical and structural freedom of quaternary compounds permits engineering materials that fulfill the requirements of a wide variety of applications. In this work, the mechanisms to achieve unprecedented size, shape, and composition control in quaternary nanocrystals are detailed. The described procedure allows obtaining tetrahedral and penta-tetrahedral quaternary nanocrystals with tuned size distributions and controlled compositions from a plethora of I 2-II-IV-VI 4 semiconductors."}],"issue":"3","publist_id":"7488","type":"journal_article"},{"year":"2012","_id":"339","acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, ENE2008-03277-E/CON, CSD2009-00050. and CSD2009-00013. M.I. and N.G.-C. thank the Spanish MICINN for the PhD grant. J.A. and R.Z. also acknowledge Generalitat de Catalunya 2009-SGR-770 and XaRMAE. A.C. is thankful for financial support through the Ramon y Cajal program of the Spanish MICINN. N.G.-C. and J.D.P. are thankful for the computer resources, technical expertise and assistance provided by the Barcelona Supercomputing Center - Centro Nacional de Supercomputación.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4","intvolume":" 24","publisher":"American Chemical Society","author":[{"first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"last_name":"García Castelló","first_name":"Nuria","full_name":"García Castelló, Nuria"},{"last_name":"Izquierdo Roca","first_name":"Victora","full_name":"Izquierdo Roca, Victora"},{"last_name":"Li","first_name":"Wenhua","full_name":"Li, Wenhua"},{"full_name":"Fairbrother, Andrew","last_name":"Fairbrother","first_name":"Andrew"},{"full_name":"Prades, Joan","first_name":"Joan","last_name":"Prades"},{"full_name":"Shavel, Alexey","last_name":"Shavel","first_name":"Alexey"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"first_name":"Alejandro","last_name":"Pérez Rodríguez","full_name":"Pérez Rodríguez, Alejandro"},{"last_name":"Morante","first_name":"Joan","full_name":"Morante, Joan"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"date_updated":"2021-01-12T07:43:09Z","date_created":"2018-12-11T11:45:54Z","oa_version":"None","volume":24,"type":"journal_article","abstract":[{"lang":"eng","text":"A high-yield and upscalable colloidal synthesis route for the production of quaternary I 2-II-IV-VI 4 nanocrystals, particularly stannite Cu 2+xCd 1-xSnSe 4, with narrow size distribution and precisely controlled composition is presented. It is also shown here how the diversity of valences in the constituent elements allows an effective control of their electrical conductivity through the adjustment of the cation ratios. At the same time, while the crystallographic complexity of quaternary chalcogenides is associated with intrinsically low thermal conductivities, the reduction of the lattice dimensions to the nanoscale further reduces the materials thermal conductivity. In the specific case of the stannite crystal structure, a convenient slab distribution of the valence band maximum states permits a partial decoupling of the p-type electrical conductivity from both the Seebeck coefficient and the thermal conductivity. Combining these features, we demonstrate how an initial optimization of the nanocrystals Cd/Cu ratio allowed us to obtain low-temperature solution-processed materials with ZT values up to 0.71 at 685 K."}],"issue":"3","publist_id":"7489","extern":"1","publication":"Chemistry of Materials","citation":{"ista":"Ibáñez M, Cadavid D, Zamani R, García Castelló N, Izquierdo Roca V, Li W, Fairbrother A, Prades J, Shavel A, Arbiol J, Pérez Rodríguez A, Morante J, Cabot A. 2012. Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4. Chemistry of Materials. 24(3), 562–570.","apa":"Ibáñez, M., Cadavid, D., Zamani, R., García Castelló, N., Izquierdo Roca, V., Li, W., … Cabot, A. (2012). Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4. Chemistry of Materials. American Chemical Society. https://doi.org/10.1021/cm2031812","ieee":"M. Ibáñez et al., “Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4,” Chemistry of Materials, vol. 24, no. 3. American Chemical Society, pp. 562–570, 2012.","ama":"Ibáñez M, Cadavid D, Zamani R, et al. Composition control and thermoelectric properties of quaternary chalcogenide nanocrystals: The case of stannite Cu2CdSnSe4. Chemistry of Materials. 2012;24(3):562-570. doi:10.1021/cm2031812","chicago":"Ibáñez, Maria, Doris Cadavid, Reza Zamani, Nuria García Castelló, Victora Izquierdo Roca, Wenhua Li, Andrew Fairbrother, et al. “Composition Control and Thermoelectric Properties of Quaternary Chalcogenide Nanocrystals: The Case of Stannite Cu2CdSnSe4.” Chemistry of Materials. American Chemical Society, 2012. https://doi.org/10.1021/cm2031812.","mla":"Ibáñez, Maria, et al. “Composition Control and Thermoelectric Properties of Quaternary Chalcogenide Nanocrystals: The Case of Stannite Cu2CdSnSe4.” Chemistry of Materials, vol. 24, no. 3, American Chemical Society, 2012, pp. 562–70, doi:10.1021/cm2031812.","short":"M. Ibáñez, D. Cadavid, R. Zamani, N. García Castelló, V. Izquierdo Roca, W. Li, A. Fairbrother, J. Prades, A. Shavel, J. Arbiol, A. Pérez Rodríguez, J. Morante, A. Cabot, Chemistry of Materials 24 (2012) 562–570."},"article_type":"original","quality_controlled":"1","page":"562 - 570","date_published":"2012-01-31T00:00:00Z","doi":"10.1021/cm2031812","language":[{"iso":"eng"}],"month":"01","day":"31","article_processing_charge":"No"},{"type":"journal_article","publist_id":"7490","issue":"3","abstract":[{"lang":"eng","text":"A procedure for the continuous production of Cu 2ZnSnS 4 (CZTS) nanoparticles with controlled composition is presented. CZTS nanoparticles were prepared through the reaction of the metals' amino complexes with elemental sulfur in a continuous-flow reactor at moderate temperatures (300-330 °C). High-resolution transmission electron microscopy and X-ray diffraction analysis showed the nanocrystals to have a crystallographic structure compatible with that of the kesterite. Chemical characterization of the materials showed the presence of the four elements in each individual nanocrystal. Composition control was achieved by adjusting the solution flow rate through the reactor and the proper choice of the nominal precursor concentration within the flowing solution. Single-particle analysis revealed a composition distribution within each sample, which was optimized at the highest synthesis temperatures used. "}],"extern":"1","_id":"340","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, CDS2009-00050, CSD2009-00013, and ENE2008-03277-E/CON. M.I. thanks the Spanish MICINN for her Ph.D. grant. A.C. is thankful for financial support through the Ramón y Cajal Program.","year":"2012","publisher":"ACS","intvolume":" 134","publication_status":"published","status":"public","title":"Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor","author":[{"full_name":"Shavel, Alexey","first_name":"Alexey","last_name":"Shavel"},{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez"},{"first_name":"Alex","last_name":"Carrete","full_name":"Carrete, Alex"},{"full_name":"Cabot, Andreu","first_name":"Andreu","last_name":"Cabot"}],"volume":134,"oa_version":"None","date_created":"2018-12-11T11:45:54Z","date_updated":"2021-01-12T07:43:13Z","article_processing_charge":"No","day":"02","month":"01","citation":{"mla":"Shavel, Alexey, et al. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” Journal of the American Chemical Society, vol. 134, no. 3, ACS, 2012, pp. 1438–41, doi:10.1021/ja209688a.","short":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, A. Cabot, Journal of the American Chemical Society 134 (2012) 1438–1441.","chicago":"Shavel, Alexey, Doris Cadavid, Maria Ibáñez, Alex Carrete, and Andreu Cabot. “Continuous Production of Cu Inf 2 Inf ZnSnS Inf 4 Inf Nanocrystals in a Flow Reactor.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja209688a.","ama":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. 2012;134(3):1438-1441. doi:10.1021/ja209688a","ista":"Shavel A, Cadavid D, Ibáñez M, Carrete A, Cabot A. 2012. Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. 134(3), 1438–1441.","ieee":"A. Shavel, D. Cadavid, M. Ibáñez, A. Carrete, and A. Cabot, “Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor,” Journal of the American Chemical Society, vol. 134, no. 3. ACS, pp. 1438–1441, 2012.","apa":"Shavel, A., Cadavid, D., Ibáñez, M., Carrete, A., & Cabot, A. (2012). Continuous production of Cu inf 2 inf ZnSnS inf 4 inf nanocrystals in a flow reactor. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja209688a"},"publication":"Journal of the American Chemical Society","page":"1438 - 1441","article_type":"original","quality_controlled":"1","doi":"10.1021/ja209688a","date_published":"2012-01-02T00:00:00Z","language":[{"iso":"eng"}]},{"publication":"Journal of Nanoparticle Research","citation":{"ama":"Cadavid D, Ibáñez M, Gorsse S, et al. Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe. Journal of Nanoparticle Research. 2012;14(12). doi:10.1007/s11051-012-1328-0","apa":"Cadavid, D., Ibáñez, M., Gorsse, S., López, A., Cirera, A., Morante, J., & Cabot, A. (2012). Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe. Journal of Nanoparticle Research. Kluwer. https://doi.org/10.1007/s11051-012-1328-0","ieee":"D. Cadavid et al., “Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe,” Journal of Nanoparticle Research, vol. 14, no. 12. Kluwer, 2012.","ista":"Cadavid D, Ibáñez M, Gorsse S, López A, Cirera A, Morante J, Cabot A. 2012. Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe. Journal of Nanoparticle Research. 14(12).","short":"D. Cadavid, M. Ibáñez, S. Gorsse, A. López, A. Cirera, J. Morante, A. Cabot, Journal of Nanoparticle Research 14 (2012).","mla":"Cadavid, Doris, et al. “Bottom-up Processing of Thermoelectric Nanocomposites from Colloidal Nanocrystal Building Blocks: The Case of Ag2Te–PbTe.” Journal of Nanoparticle Research, vol. 14, no. 12, Kluwer, 2012, doi:10.1007/s11051-012-1328-0.","chicago":"Cadavid, Doris, Maria Ibáñez, Stéphane Gorsse, Antonio López, Albert Cirera, Joan Morante, and Andreu Cabot. “Bottom-up Processing of Thermoelectric Nanocomposites from Colloidal Nanocrystal Building Blocks: The Case of Ag2Te–PbTe.” Journal of Nanoparticle Research. Kluwer, 2012. https://doi.org/10.1007/s11051-012-1328-0."},"quality_controlled":"1","article_type":"original","doi":"10.1007/s11051-012-1328-0","date_published":"2012-12-01T00:00:00Z","language":[{"iso":"eng"}],"month":"12","day":"01","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"345","acknowledgement":"Acknowledgments The research was supported by the European Regional Development Funds and the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, MAT2010-21510, CSD2009-00050, and ENE2008-03277-E/CON. M.I. is grateful to the Spanish MIC-INN for her PhD grant. A. Cirera acknowledges support from ICREA Academia program. A. Cabot is grateful to the Spanish MICINN for financial support through the Ramón y Cajal program.","year":"2012","publication_status":"published","title":"Bottom-up processing of thermoelectric nanocomposites from colloidal nanocrystal building blocks: The case of Ag2Te–PbTe","status":"public","publisher":"Kluwer","intvolume":" 14","author":[{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez"},{"first_name":"Stéphane","last_name":"Gorsse","full_name":"Gorsse, Stéphane"},{"first_name":"Antonio","last_name":"López","full_name":"López, Antonio"},{"first_name":"Albert","last_name":"Cirera","full_name":"Cirera, Albert"},{"full_name":"Morante, Joan","last_name":"Morante","first_name":"Joan"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"date_created":"2018-12-11T11:45:56Z","date_updated":"2021-01-12T07:43:32Z","volume":14,"oa_version":"None","type":"journal_article","abstract":[{"text":"Nanocomposites are highly promising materials to enhance the efficiency of current thermoelectric devices. A straightforward and at the same time highly versatile and controllable approach to produce nanocomposites is the assembly of solution-processed nanocrystal building blocks. The convenience of this bottom-up approach to produce nanocomposites with homogeneous phase distributions and adjustable composition is demonstrated here by blending Ag2Te and PbTe colloidal nanocrystals to form Ag2Te–PbTe bulk nanocomposites. The thermoelectric properties of these nanocomposites are analyzed in the temperature range from 300 to 700 K. The evolution of their electrical conductivity and Seebeck coefficient is discussed in terms of the blend composition and the characteristics of the constituent materials. ","lang":"eng"}],"publist_id":"7485","issue":"12","extern":"1"},{"month":"03","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://authors.library.caltech.edu/30261/","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1021/ja211952z","extern":"1","publist_id":"7487","publisher":"ACS","publication_status":"published","year":"2012","acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, ENE2008-03277-E/CON, CSD2009-00050, and CSD2009-00013. M.I. thanks the Spanish MICINN for her Ph.D. Grant. J.A. and R.Z. also acknowledge Generalitat de Catalunya 2009-SGR-770 and XaRMAE. A.C. is thankful for financial support through the Ramon y Cajal Program of the Spanish MICINN.","volume":134,"date_updated":"2021-01-12T07:43:40Z","date_created":"2018-12-11T11:45:57Z","author":[{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"},{"full_name":"Zamani, Reza","first_name":"Reza","last_name":"Zamani"},{"full_name":"Lalonde, Aaron","first_name":"Aaron","last_name":"Lalonde"},{"full_name":"Cadavid, Doris","first_name":"Doris","last_name":"Cadavid"},{"full_name":"Li, Wenhua","first_name":"Wenhua","last_name":"Li"},{"last_name":"Shavel","first_name":"Alexey","full_name":"Shavel, Alexey"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"last_name":"Morante","first_name":"Joan","full_name":"Morante, Joan"},{"last_name":"Gorsse","first_name":"Stéphane","full_name":"Gorsse, Stéphane"},{"first_name":"G Jeffrey","last_name":"Snyder","full_name":"Snyder, G Jeffrey"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"article_processing_charge":"No","day":"07","page":"4060 - 4063","article_type":"original","citation":{"chicago":"Ibáñez, Maria, Reza Zamani, Aaron Lalonde, Doris Cadavid, Wenhua Li, Alexey Shavel, Jordi Arbiol, et al. “Cu 2ZnGeSe 4 Nanocrystals: Synthesis and Thermoelectric Properties.” Journal of the American Chemical Society. ACS, 2012. https://doi.org/10.1021/ja211952z.","mla":"Ibáñez, Maria, et al. “Cu 2ZnGeSe 4 Nanocrystals: Synthesis and Thermoelectric Properties.” Journal of the American Chemical Society, vol. 134, no. 9, ACS, 2012, pp. 4060–63, doi:10.1021/ja211952z.","short":"M. Ibáñez, R. Zamani, A. Lalonde, D. Cadavid, W. Li, A. Shavel, J. Arbiol, J. Morante, S. Gorsse, G.J. Snyder, A. Cabot, Journal of the American Chemical Society 134 (2012) 4060–4063.","ista":"Ibáñez M, Zamani R, Lalonde A, Cadavid D, Li W, Shavel A, Arbiol J, Morante J, Gorsse S, Snyder GJ, Cabot A. 2012. Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. Journal of the American Chemical Society. 134(9), 4060–4063.","ieee":"M. Ibáñez et al., “Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties,” Journal of the American Chemical Society, vol. 134, no. 9. ACS, pp. 4060–4063, 2012.","apa":"Ibáñez, M., Zamani, R., Lalonde, A., Cadavid, D., Li, W., Shavel, A., … Cabot, A. (2012). Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. Journal of the American Chemical Society. ACS. https://doi.org/10.1021/ja211952z","ama":"Ibáñez M, Zamani R, Lalonde A, et al. Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. Journal of the American Chemical Society. 2012;134(9):4060-4063. doi:10.1021/ja211952z"},"publication":"Journal of the American Chemical Society","date_published":"2012-03-07T00:00:00Z","type":"journal_article","issue":"9","abstract":[{"lang":"eng","text":"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. "}],"intvolume":" 134","status":"public","title":"Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties","_id":"347","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None"},{"scopus_import":1,"month":"02","day":"01","publication":"Science of Computer Programming","citation":{"chicago":"Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” Science of Computer Programming. Elsevier, 2012. https://doi.org/10.1016/j.scico.2010.06.004.","short":"A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112.","mla":"Ghosal, Arkadeb, et al. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” Science of Computer Programming, vol. 77, no. 2, Elsevier, 2012, pp. 96–112, doi:10.1016/j.scico.2010.06.004.","apa":"Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., & Sangiovanni Vincentelli, A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. Elsevier. https://doi.org/10.1016/j.scico.2010.06.004","ieee":"A. Ghosal, D. Iercan, C. Kirsch, T. A. Henzinger, and A. Sangiovanni Vincentelli, “Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code,” Science of Computer Programming, vol. 77, no. 2. Elsevier, pp. 96–112, 2012.","ista":"Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. 2012. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 77(2), 96–112.","ama":"Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 2012;77(2):96-112. doi:10.1016/j.scico.2010.06.004"},"quality_controlled":"1","page":"96 - 112","date_published":"2012-02-01T00:00:00Z","doi":"10.1016/j.scico.2010.06.004","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"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.","lang":"eng"}],"publist_id":"2370","issue":"2","_id":"3836","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012","publication_status":"published","title":"Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code","status":"public","publisher":"Elsevier","department":[{"_id":"ToHe"}],"intvolume":" 77","author":[{"full_name":"Ghosal, Arkadeb","first_name":"Arkadeb","last_name":"Ghosal"},{"first_name":"Daniel","last_name":"Iercan","full_name":"Iercan, Daniel"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sangiovanni Vincentelli, Alberto","last_name":"Sangiovanni Vincentelli","first_name":"Alberto"}],"date_created":"2018-12-11T12:05:26Z","date_updated":"2021-01-12T07:52:32Z","volume":77,"oa_version":"None"},{"intvolume":" 458","ddc":["004"],"title":"Energy parity games","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2972","file":[{"file_name":"2012_Elsevier_Chatterjee.pdf","access_level":"open_access","content_type":"application/pdf","file_size":351271,"creator":"kschuh","relation":"main_file","file_id":"5935","date_created":"2019-02-06T11:56:22Z","date_updated":"2020-07-14T12:45:57Z","checksum":"719e4a5af5a01ad3f2f7f7f05b3c2b09"}],"oa_version":"Published Version","pubrep_id":"935","type":"journal_article","abstract":[{"text":"Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objectives. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games.","lang":"eng"}],"page":"49 - 60","citation":{"ama":"Chatterjee K, Doyen L. Energy parity games. Theoretical Computer Science. 2012;458:49-60. doi:10.1016/j.tcs.2012.07.038","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer Science, vol. 458. Elsevier, pp. 49–60, 2012.","apa":"Chatterjee, K., & Doyen, L. (2012). Energy parity games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2012.07.038","ista":"Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.","short":"K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science, vol. 458, Elsevier, 2012, pp. 49–60, doi:10.1016/j.tcs.2012.07.038.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2012.07.038."},"publication":"Theoretical Computer Science","date_published":"2012-11-02T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"02","publisher":"Elsevier","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2012","volume":458,"date_updated":"2023-02-23T11:45:29Z","date_created":"2018-12-11T12:00:37Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3851"}]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","publist_id":"3736","ec_funded":1,"file_date_updated":"2020-07-14T12:45:57Z","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"external_id":{"arxiv":["1001.5183"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2012.07.038","month":"11"},{"title":"Algorithmic analysis of array-accessing programs","status":"public","intvolume":" 13","_id":"2967","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","type":"journal_article","abstract":[{"lang":"eng","text":"For programs whose data variables range over Boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. In this article, we consider algorithmic verification of programs that use Boolean variables, and in addition, access a single read-only array whose length is potentially unbounded, and whose elements range over an unbounded data domain. We show that the reachability problem, while undecidable in general, is (1) PSPACE-complete for programs in which the array-accessing for-loops are not nested, (2) decidable for a restricted class of programs with doubly nested loops. The second result establishes connections to automata and logics defining languages over data words."}],"issue":"3","publication":"ACM Transactions on Computational Logic (TOCL)","citation":{"ista":"Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.","ieee":"R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3. ACM, 2012.","apa":"Alur, R., Cerny, P., & Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2287718.2287727","ama":"Alur R, Cerny P, Weinstein S. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 2012;13(3). doi:10.1145/2287718.2287727","chicago":"Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” ACM Transactions on Computational Logic (TOCL). ACM, 2012. https://doi.org/10.1145/2287718.2287727.","mla":"Alur, Rajeev, et al. “Algorithmic Analysis of Array-Accessing Programs.” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3, 27, ACM, 2012, doi:10.1145/2287718.2287727.","short":"R. Alur, P. Cerny, S. Weinstein, ACM Transactions on Computational Logic (TOCL) 13 (2012)."},"date_published":"2012-08-01T00:00:00Z","scopus_import":1,"day":"01","publication_status":"published","publisher":"ACM","department":[{"_id":"ToHe"}],"year":"2012","acknowledgement":"This research was supported in part by the NSF Cybertrust award CNS 0524059, by the European Research Council (ERC) Advanced Investigator Grant QUAREM, and by the Austrian Science Fund (FWF) project S11402-N23.","date_created":"2018-12-11T12:00:36Z","date_updated":"2023-02-23T12:09:43Z","volume":13,"author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"last_name":"Weinstein","first_name":"Scott","full_name":"Weinstein, Scott"}],"related_material":{"record":[{"id":"4403","relation":"earlier_version","status":"public"}]},"article_number":"27","publist_id":"3748","ec_funded":1,"quality_controlled":"1","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"doi":"10.1145/2287718.2287727","month":"08"},{"year":"2012","publisher":"BioMed Central","publication_status":"published","author":[{"first_name":"Taras","last_name":"Galkovskyi","full_name":"Galkovskyi, Taras"},{"full_name":"Mileyko, Yuriy","first_name":"Yuriy","last_name":"Mileyko"},{"last_name":"Bucksch","first_name":"Alexander","full_name":"Bucksch, Alexander"},{"first_name":"Brad","last_name":"Moore","full_name":"Moore, Brad"},{"id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","last_name":"Symonova","first_name":"Olga","full_name":"Symonova, Olga"},{"last_name":"Price","first_name":"Charles","full_name":"Price, Charles"},{"full_name":"Topp, Chrostopher","first_name":"Chrostopher","last_name":"Topp"},{"first_name":"Anjali","last_name":"Iyer Pascuzzi","full_name":"Iyer Pascuzzi, Anjali"},{"full_name":"Zurek, Paul","last_name":"Zurek","first_name":"Paul"},{"first_name":"Suqin","last_name":"Fang","full_name":"Fang, Suqin"},{"last_name":"Harer","first_name":"John","full_name":"Harer, John"},{"full_name":"Benfey, Philip","first_name":"Philip","last_name":"Benfey"},{"first_name":"Joshua","last_name":"Weitz","full_name":"Weitz, Joshua"}],"volume":12,"date_created":"2018-12-11T11:46:46Z","date_updated":"2022-08-25T14:59:17Z","article_number":"116","publist_id":"7328","file_date_updated":"2020-07-14T12:46:35Z","extern":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","doi":"10.1186/1471-2229-12-116","language":[{"iso":"eng"}],"month":"07","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"492","intvolume":" 12","title":"GiA Roots: Software for the high throughput analysis of plant root system architecture","status":"public","ddc":["005","514","516"],"pubrep_id":"946","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"IST-2018-946-v1+1_2012_Symonova_GiA_Roots.pdf","creator":"system","file_size":1691436,"content_type":"application/pdf","file_id":"4953","relation":"main_file","checksum":"0c629e36acd5f2878ff7dd088d67d494","date_created":"2018-12-12T10:12:35Z","date_updated":"2020-07-14T12:46:35Z"}],"type":"journal_article","abstract":[{"lang":"eng","text":"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."}],"citation":{"ama":"Galkovskyi T, Mileyko Y, Bucksch A, et al. GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. 2012;12. doi:10.1186/1471-2229-12-116","ista":"Galkovskyi T, Mileyko Y, Bucksch A, Moore B, Symonova O, Price C, Topp C, Iyer Pascuzzi A, Zurek P, Fang S, Harer J, Benfey P, Weitz J. 2012. GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. 12, 116.","ieee":"T. Galkovskyi et al., “GiA Roots: Software for the high throughput analysis of plant root system architecture,” BMC Plant Biology, vol. 12. BioMed Central, 2012.","apa":"Galkovskyi, T., Mileyko, Y., Bucksch, A., Moore, B., Symonova, O., Price, C., … Weitz, J. (2012). GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. BioMed Central. https://doi.org/10.1186/1471-2229-12-116","mla":"Galkovskyi, Taras, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” BMC Plant Biology, vol. 12, 116, BioMed Central, 2012, doi:10.1186/1471-2229-12-116.","short":"T. Galkovskyi, Y. Mileyko, A. Bucksch, B. Moore, O. Symonova, C. Price, C. Topp, A. Iyer Pascuzzi, P. Zurek, S. Fang, J. Harer, P. Benfey, J. Weitz, BMC Plant Biology 12 (2012).","chicago":"Galkovskyi, Taras, Yuriy Mileyko, Alexander Bucksch, Brad Moore, Olga Symonova, Charles Price, Chrostopher Topp, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” BMC Plant Biology. BioMed Central, 2012. https://doi.org/10.1186/1471-2229-12-116."},"publication":"BMC Plant Biology","date_published":"2012-07-26T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"26"},{"day":"13","has_accepted_license":"1","scopus_import":1,"date_published":"2012-07-13T00:00:00Z","publication":"Frontiers in Neuroscience","citation":{"mla":"Tangermann, Michael, et al. “Review of the BCI Competition IV.” Frontiers in Neuroscience, vol. 6, 55, Frontiers Research Foundation, 2012, doi:10.3389/fnins.2012.00055.","short":"M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner, R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H. Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers in Neuroscience 6 (2012).","chicago":"Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.” Frontiers in Neuroscience. Frontiers Research Foundation, 2012. https://doi.org/10.3389/fnins.2012.00055.","ama":"Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV. Frontiers in Neuroscience. 2012;6. doi:10.3389/fnins.2012.00055","ista":"Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R, Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition IV. Frontiers in Neuroscience. 6, 55.","ieee":"M. Tangermann et al., “Review of the BCI competition IV,” Frontiers in Neuroscience, vol. 6. Frontiers Research Foundation, 2012.","apa":"Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner, C., … Blankertz, B. (2012). Review of the BCI competition IV. Frontiers in Neuroscience. Frontiers Research Foundation. https://doi.org/10.3389/fnins.2012.00055"},"abstract":[{"lang":"eng","text":"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."}],"type":"journal_article","oa_version":"Published Version","file":[{"file_name":"IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":2693701,"file_id":"5356","relation":"main_file","date_created":"2018-12-12T10:18:34Z","date_updated":"2020-07-14T12:46:35Z","checksum":"195238221c4b0b0f4035f6f6c16ea17c"}],"pubrep_id":"945","title":"Review of the BCI competition IV","ddc":["004"],"status":"public","intvolume":" 6","_id":"493","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"07","language":[{"iso":"eng"}],"doi":"10.3389/fnins.2012.00055","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2020-07-14T12:46:35Z","publist_id":"7327","article_number":"55","date_created":"2018-12-11T11:46:46Z","date_updated":"2021-01-12T08:01:03Z","volume":6,"author":[{"full_name":"Tangermann, Michael","first_name":"Michael","last_name":"Tangermann"},{"full_name":"Müller, Klaus","last_name":"Müller","first_name":"Klaus"},{"last_name":"Aertsen","first_name":"Ad","full_name":"Aertsen, Ad"},{"last_name":"Birbaumer","first_name":"Niels","full_name":"Birbaumer, Niels"},{"first_name":"Christoph","last_name":"Braun","full_name":"Braun, Christoph"},{"full_name":"Brunner, Clemens","last_name":"Brunner","first_name":"Clemens"},{"full_name":"Leeb, Robert","last_name":"Leeb","first_name":"Robert"},{"first_name":"Carsten","last_name":"Mehring","full_name":"Mehring, Carsten"},{"full_name":"Miller, Kai","first_name":"Kai","last_name":"Miller"},{"full_name":"Müller Putz, Gernot","last_name":"Müller Putz","first_name":"Gernot"},{"last_name":"Nolte","first_name":"Guido","full_name":"Nolte, Guido"},{"first_name":"Gert","last_name":"Pfurtscheller","full_name":"Pfurtscheller, Gert"},{"first_name":"Hubert","last_name":"Preissl","full_name":"Preissl, Hubert"},{"full_name":"Schalk, Gerwin","last_name":"Schalk","first_name":"Gerwin"},{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","last_name":"Schlögl"},{"full_name":"Vidaurre, Carmen","last_name":"Vidaurre","first_name":"Carmen"},{"full_name":"Waldert, Stephan","first_name":"Stephan","last_name":"Waldert"},{"full_name":"Blankertz, Benjamin","last_name":"Blankertz","first_name":"Benjamin"}],"publication_status":"published","publisher":"Frontiers Research Foundation","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"acknowledgement":"The studies were in part or completely supported by the Bundesministerium für Bildung und Forschung (BMBF), Fkz 01IB001A, 01GQ0850, by the German Science Foundation (DFG, contract MU 987/3-2), by the European ICT Programme Projects FP7-224631 and 216886, the World Class University Program through the National Research Foundation of Korea funded by the Ministry of Education, Science, and Technology (Grant R31-10008), the US Army Research Office [W911NF-08-1-0216 (Gerwin Schalk) and W911NF-07-1-0415 (Gerwin Schalk)] and the NIH [EB006356 (Gerwin Schalk) and EB000856 (Gerwin Schalk), the WIN-Kolleg of the Heidelberg Academy of Sciences and Humanities, German Federal Ministry of Education and Research grants 01GQ0420, 01GQ0761, 01GQ0762, and 01GQ0830, German Research Foundation grants 550/B5 and C6, and by a scholarship from the German National Academic Foundation. This paper only reflects the authors’ views and funding agencies are not liable for any use that may be made of the information contained herein.\r\n","year":"2012"},{"month":"10","quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"conference":{"start_date":"2012-09-06","location":"Napoli, Italy","end_date":"2012-09-08","name":"GandALF: Games, Automata, Logics and Formal Verification"},"doi":"10.4204/EPTCS.96.18","file_date_updated":"2020-07-14T12:46:35Z","ec_funded":1,"publist_id":"7325","publication_status":"published","publisher":"Open Publishing Association","department":[{"_id":"KrCh"}],"year":"2012","date_updated":"2021-01-12T08:01:04Z","date_created":"2018-12-11T11:46:47Z","volume":96,"author":[{"first_name":"Alex","last_name":"Kruckman","full_name":"Kruckman, Alex"},{"full_name":"Rubin, Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin","first_name":"Sasha"},{"full_name":"Sheridan, John","last_name":"Sheridan","first_name":"John"},{"last_name":"Zax","first_name":"Ben","full_name":"Zax, Ben"}],"scopus_import":1,"day":"07","has_accepted_license":"1","page":"238 - 246","publication":"Proceedings GandALF 2012","citation":{"ieee":"A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012, vol. 96, pp. 238–246.","apa":"Kruckman, A., Rubin, S., Sheridan, J., & Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.96.18","ista":"Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.","ama":"Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata with advice. In: Proceedings GandALF 2012. Vol 96. Open Publishing Association; 2012:238-246. doi:10.4204/EPTCS.96.18","chicago":"Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.” In Proceedings GandALF 2012, 96:238–46. Open Publishing Association, 2012. https://doi.org/10.4204/EPTCS.96.18.","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.","mla":"Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:10.4204/EPTCS.96.18."},"date_published":"2012-10-07T00:00:00Z","alternative_title":["EPTCS"],"type":"conference","abstract":[{"lang":"eng","text":"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."}],"ddc":["004"],"title":"A Myhill Nerode theorem for automata with advice","status":"public","intvolume":" 96","_id":"495","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf","access_level":"open_access","creator":"system","file_size":97736,"content_type":"application/pdf","file_id":"5152","relation":"main_file","date_created":"2018-12-12T10:15:31Z","date_updated":"2020-07-14T12:46:35Z","checksum":"56277f95edc9d531fa3bdc5f9579fda8"}],"pubrep_id":"944"},{"page":"913 - 924","citation":{"ista":"Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924.","ieee":"M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation in fragmented plant populations: Implications for restoration genetics,” Evolutionary Applications, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.","apa":"Pickup, M., Field, D., Rowell, D., & Young, A. (2012). Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. Wiley-Blackwell. https://doi.org/10.1111/j.1752-4571.2012.00284.x","ama":"Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 2012;5(8):913-924. doi:10.1111/j.1752-4571.2012.00284.x","chicago":"Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” Evolutionary Applications. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1752-4571.2012.00284.x.","mla":"Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” Evolutionary Applications, vol. 5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:10.1111/j.1752-4571.2012.00284.x.","short":"M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924."},"publication":"Evolutionary Applications","date_published":"2012-12-01T00:00:00Z","has_accepted_license":"1","day":"01","intvolume":" 5","ddc":["576"],"status":"public","title":"Predicting local adaptation in fragmented plant populations: Implications for restoration genetics","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"498","file":[{"checksum":"233007138606aca5a2f75f7ae1742f43","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:10:33Z","file_id":"4821","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":396136,"access_level":"open_access","file_name":"IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf"}],"oa_version":"Published Version","pubrep_id":"942","type":"journal_article","issue":"8","abstract":[{"lang":"eng","text":"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."}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"language":[{"iso":"eng"}],"doi":"10.1111/j.1752-4571.2012.00284.x","month":"12","publisher":"Wiley-Blackwell","department":[{"_id":"NiBa"}],"publication_status":"published","acknowledgement":"We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer C. H. Barrett for comments that improved the quality of the manuscript.\r\n","year":"2012","volume":5,"date_created":"2018-12-11T11:46:48Z","date_updated":"2021-01-12T08:01:06Z","author":[{"orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","last_name":"Pickup","first_name":"Melinda","full_name":"Pickup, Melinda"},{"first_name":"David","last_name":"Field","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","full_name":"Field, David"},{"full_name":"Rowell, David","last_name":"Rowell","first_name":"David"},{"last_name":"Young","first_name":"Andrew","full_name":"Young, Andrew"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","publist_id":"7322","file_date_updated":"2020-07-14T12:46:35Z"},{"date_published":"2012-01-01T00:00:00Z","doi":"10.1109/LICS.2012.65","conference":{"start_date":"2012-06-25","location":"Dubrovnik, Croatia","end_date":"2012-06-28","name":"LICS: Symposium on Logic in Computer Science"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf","open_access":"1"}],"citation":{"chicago":"Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.” IEEE, 2012. https://doi.org/10.1109/LICS.2012.65.","short":"A. Rabinovich, S. Rubin, in:, IEEE, 2012.","mla":"Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.","ieee":"A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.","apa":"Rabinovich, A., & Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.65","ista":"Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.","ama":"Rabinovich A, Rubin S. Interpretations in trees with countably many branches. In: IEEE; 2012. doi:10.1109/LICS.2012.65"},"oa":1,"project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","month":"01","day":"01","scopus_import":1,"author":[{"last_name":"Rabinovich","first_name":"Alexander","full_name":"Rabinovich, Alexander"},{"first_name":"Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha"}],"oa_version":"Preprint","date_updated":"2021-01-12T08:01:05Z","date_created":"2018-12-11T11:46:47Z","_id":"496","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2012","department":[{"_id":"KrCh"}],"publisher":"IEEE","publication_status":"published","title":"Interpretations in trees with countably many branches","status":"public","publist_id":"7324","ec_funded":1,"abstract":[{"lang":"eng","text":"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."}],"type":"conference","article_number":"6280474","alternative_title":["LICS"]},{"quality_controlled":"1","citation":{"ieee":"U. Boker and O. Kupferman, “Translating to Co-Büchi made tight, unified, and useful,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4. ACM, 2012.","apa":"Boker, U., & Kupferman, O. (2012). Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2362355.2362357","ista":"Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29.","ama":"Boker U, Kupferman O. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 2012;13(4). doi:10.1145/2362355.2362357","chicago":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” ACM Transactions on Computational Logic (TOCL). ACM, 2012. https://doi.org/10.1145/2362355.2362357.","short":"U. Boker, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 13 (2012).","mla":"Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4, 29, ACM, 2012, doi:10.1145/2362355.2362357."},"publication":"ACM Transactions on Computational Logic (TOCL)","language":[{"iso":"eng"}],"date_published":"2012-10-01T00:00:00Z","doi":"10.1145/2362355.2362357","scopus_import":1,"month":"10","day":"01","publisher":"ACM","intvolume":" 13","department":[{"_id":"ToHe"}],"status":"public","publication_status":"published","title":"Translating to Co-Büchi made tight, unified, and useful","year":"2012","_id":"494","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":13,"date_created":"2018-12-11T11:46:47Z","date_updated":"2021-01-12T08:01:03Z","author":[{"full_name":"Boker, Udi","last_name":"Boker","first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"type":"journal_article","article_number":"29","publist_id":"7326","issue":"4","abstract":[{"text":"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.","lang":"eng"}]},{"scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"30","citation":{"chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” Journal of Cell Biology. Rockefeller University Press, 2012. https://doi.org/10.1083/jcb.201204039.","short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.","mla":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” Journal of Cell Biology, vol. 197, no. 3, Rockefeller University Press, 2012, pp. 347–49, doi:10.1083/jcb.201204039.","apa":"Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201204039","ieee":"M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” Journal of Cell Biology, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.","ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","ama":"Sixt MK. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 2012;197(3):347-349. doi:10.1083/jcb.201204039"},"publication":"Journal of Cell Biology","page":"347 - 349","article_type":"original","date_published":"2012-04-30T00:00:00Z","type":"journal_article","issue":"3","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"506","intvolume":" 197","title":"Cell migration: Fibroblasts find a new way to get ahead","status":"public","ddc":["570"],"oa_version":"Published Version","file":[{"checksum":"45c02be33ebd99fc3077d60b9c90bdfa","date_created":"2019-02-12T09:03:09Z","date_updated":"2020-07-14T12:46:36Z","relation":"main_file","file_id":"5957","file_size":986566,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2012_CellBiology_Sixt.pdf"}],"month":"04","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"quality_controlled":"1","doi":"10.1083/jcb.201204039","language":[{"iso":"eng"}],"publist_id":"7314","file_date_updated":"2020-07-14T12:46:36Z","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","year":"2012","publisher":"Rockefeller University Press","department":[{"_id":"MiSi"}],"publication_status":"published","author":[{"full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"}],"volume":197,"date_updated":"2021-01-12T08:01:11Z","date_created":"2018-12-11T11:46:51Z"},{"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"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."}],"intvolume":" 16","ddc":["004"],"title":"Faster algorithms for alternating refinement relations","status":"public","_id":"497","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","file_name":"IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf","file_size":471236,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4712","checksum":"f1b0dd99240800db2d7dbf9b5131fe5e","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:08:50Z"}],"oa_version":"Published Version","pubrep_id":"943","scopus_import":1,"has_accepted_license":"1","day":"01","page":"167 - 182","citation":{"ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.","apa":"Chatterjee, K., Chaubal, S., & Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2012.167","ama":"Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182. doi:10.4230/LIPIcs.CSL.2012.167","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.CSL.2012.167.","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167.","short":"K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182."},"date_published":"2012-09-01T00:00:00Z","ec_funded":1,"publist_id":"7323","file_date_updated":"2020-07-14T12:46:35Z","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2012","volume":16,"date_created":"2018-12-11T11:46:48Z","date_updated":"2023-02-23T12:23:32Z","related_material":{"record":[{"id":"5378","relation":"earlier_version","status":"public"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Siddhesh","last_name":"Chaubal","full_name":"Chaubal, Siddhesh"},{"first_name":"Pritish","last_name":"Kamath","full_name":"Kamath, Pritish"}],"month":"09","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.CSL.2012.167","conference":{"name":"EACSL: European Association for Computer Science Logic","start_date":"2012-09-03","location":"Fontainebleau, France","end_date":"2012-09-06"}},{"article_processing_charge":"No","day":"01","page":"1386 - 1399","citation":{"short":"K. Chatterjee, M.H. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.","mla":"Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.","chicago":"Chatterjee, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1386–99. SIAM, 2012. https://doi.org/10.1137/1.9781611973099.109.","ama":"Chatterjee K, Henzinger MH. An O(n2) time algorithm for alternating Büchi games. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM; 2012:1386-1399. doi:10.1137/1.9781611973099.109","apa":"Chatterjee, K., & Henzinger, M. H. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM. https://doi.org/10.1137/1.9781611973099.109","ieee":"K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.","ista":"Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399."},"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","date_published":"2012-01-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is Õ(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n·m) boundary by presenting a new technique that reduces the running time to O(n 2). This bound also leads to O(n 2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n 3)), and (3) in Markov decision processes (improving for m > n 4/3 an earlier bound of O(min(m 1.5, m·n 2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n 2), which is an improvement over earlier bounds for m > n 4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem."}],"status":"public","title":"An O(n2) time algorithm for alternating Büchi games","_id":"3165","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","pubrep_id":"15","month":"01","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1109.5018","open_access":"1"}],"external_id":{"arxiv":["1109.5018"]},"language":[{"iso":"eng"}],"doi":"10.1137/1.9781611973099.109","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Kyoto, Japan","start_date":"2012-01-17","end_date":"2012-01-19"},"publist_id":"3519","ec_funded":1,"publisher":"SIAM","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2012","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, Vienna Science and Technology Fund (WWTF) Grant ICT10-002, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","date_created":"2018-12-11T12:01:46Z","date_updated":"2023-02-23T12:23:35Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"2141"},{"id":"5379","relation":"earlier_version","status":"public"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"}]},{"type":"conference","article_number":"6280438","ec_funded":1,"publist_id":"3770","abstract":[{"text":"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 parity 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 computational 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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2956","acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the Israeli Centers of Research Excellence (ICORE) program, (Center No. 4/11), the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.\r\nA Technical Report of this paper is available via internal link.","year":"2012","department":[{"_id":"KrCh"}],"publisher":"IEEE","status":"public","publication_status":"published","title":"Mean payoff pushdown games","related_material":{"record":[{"id":"5377","relation":"earlier_version","status":"public"}]},"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"}],"oa_version":"None","date_updated":"2023-02-23T12:23:30Z","date_created":"2018-12-11T12:00:32Z","scopus_import":1,"day":"23","month":"08","citation":{"ista":"Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.","apa":"Chatterjee, K., & Velner, Y. (2012). Mean payoff pushdown games. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.30","ieee":"K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.","ama":"Chatterjee K, Velner Y. Mean payoff pushdown games. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.30","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.30.","mla":"Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280438, IEEE, 2012, doi:10.1109/LICS.2012.30.","short":"K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012."},"publication":"Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1109/LICS.2012.30","date_published":"2012-08-23T00:00:00Z","conference":{"name":"LICS: Logic in Computer Science","location":"Dubrovnik, Croatia ","start_date":"2012-06-25","end_date":"2012-06-28"},"language":[{"iso":"eng"}]}]