[{"type":"conference","publication":" Conference proceedings CHES 2012","date_created":"2018-12-11T11:55:25Z","citation":{"ama":"Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography. In: <i> Conference Proceedings CHES 2012</i>. Vol 7428. Springer; 2012:213-232. doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>","mla":"Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” <i> Conference Proceedings CHES 2012</i>, vol. 7428, Springer, 2012, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>.","apa":"Faust, S., Pietrzak, K. Z., &#38; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In <i> Conference proceedings CHES 2012</i> (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>","ieee":"S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in <i> Conference proceedings CHES 2012</i>, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.","short":"S. Faust, K.Z. Pietrzak, J. Schipper, in:,  Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.","ista":"Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography.  Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428, 213–232.","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical Leakage-Resilient Symmetric Cryptography.” In <i> Conference Proceedings CHES 2012</i>, 7428:213–32. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>."},"oa_version":"Preprint","month":"09","quality_controlled":"1","acknowledgement":"Sebastian Faust acknowledges support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC Starting Grant 259668-PSPC.\r\n","intvolume":"      7428","doi":"10.1007/978-3-642-33027-8_13","date_published":"2012-09-01T00:00:00Z","status":"public","day":"01","main_file_link":[{"open_access":"1","url":"http://www.iacr.org/archive/ches2012/74280211/74280211.pdf"}],"oa":1,"volume":7428,"year":"2012","scopus_import":1,"language":[{"iso":"eng"}],"author":[{"full_name":"Faust, Sebastian","last_name":"Faust","first_name":"Sebastian"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"first_name":"Joachim","full_name":"Schipper, Joachim","last_name":"Schipper","id":"7BE863D4-E9CF-11E9-9EDB-90527418172C"}],"conference":{"name":"CHES: Cryptographic Hardware and Embedded Systems","start_date":"2012-09-09","location":"Leuven, Belgium","end_date":"2012-09-12"},"date_updated":"2021-01-12T06:54:58Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Leakage resilient cryptography attempts to incorporate side-channel leakage into the black-box security model and designs cryptographic schemes that are provably secure within it. Informally, a scheme is leakage-resilient if it remains secure even if an adversary learns a bounded amount of arbitrary information about the schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily complicated in order to achieve strong provable security guarantees. As advocated by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in practice much simpler construction may already suffice to protect against realistic side-channel attacks. In this paper, we show that indeed for simpler constructions leakage-resilience can be obtained when we aim for relaxed security notions where the leakage-functions and/or the inputs to the primitive are chosen non-adaptively. For example, we show that a three round Feistel network instantiated with a leakage resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.) We also show that a minor variation of the classical GGM construction gives a leakage resilient PRF if both, the leakage-function and the inputs, are chosen non-adaptively.","lang":"eng"}],"publist_id":"5003","publisher":"Springer","_id":"2048","ec_funded":1,"publication_status":"published","project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"page":"213 - 232","title":"Practical leakage-resilient symmetric cryptography","department":[{"_id":"KrPi"}],"alternative_title":["LNCS"]},{"date_updated":"2021-01-12T06:54:58Z","abstract":[{"text":"We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.\r\n\r\nPerformance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.\r\n","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"conference":{"start_date":"2012-03-19","location":"Washington, DC, USA","name":"FSE: Fast Software Encryption","end_date":"2012-03-21"},"author":[{"last_name":"Heyse","full_name":"Heyse, Stefan","first_name":"Stefan"},{"first_name":"Eike","full_name":"Kiltz, Eike","last_name":"Kiltz"},{"last_name":"Lyubashevsky","full_name":"Lyubashevsky, Vadim","first_name":"Vadim"},{"first_name":"Christof","full_name":"Paar, Christof","last_name":"Paar"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"}],"scopus_import":1,"year":"2012","volume":7549,"alternative_title":["LNCS"],"department":[{"_id":"KrPi"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668"}],"title":"Lapin: An efficient authentication protocol based on ring-LPN","page":"346 - 365","publication_status":"published","publisher":"Springer","publist_id":"5002","ec_funded":1,"_id":"2049","quality_controlled":"1","acknowledgement":"Supported by the European Research Council / ERC Starting Grant (259668- PSPC)\r\nWe would like to thank the anonymous referees of this confer- ence and those of the ECRYPT Workshop on Lightweight Cryptography for very useful comments, and in particular for the suggestion that the scheme is somewhat vulnerable to a man-in-the-middle attack whenever an adversary observes two reader challenges that are the same. We hope that the attack we described in Appendix A corresponds to what the reviewer had in mind. We also thank Tanja Lange for pointing us to the pa- per of [Kir11] and for discussions of some of her recent work. ","month":"03","publication":" Conference proceedings FSE 2012","citation":{"apa":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &#38; Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In <i> Conference proceedings FSE 2012</i> (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>","mla":"Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” <i> Conference Proceedings FSE 2012</i>, vol. 7549, Springer, 2012, pp. 346–65, doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>.","ama":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient authentication protocol based on ring-LPN. In: <i> Conference Proceedings FSE 2012</i>. Vol 7549. Springer; 2012:346-365. doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>","chicago":"Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In <i> Conference Proceedings FSE 2012</i>, 7549:346–65. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>.","ista":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient authentication protocol based on ring-LPN.  Conference proceedings FSE 2012. FSE: Fast Software Encryption, LNCS, vol. 7549, 346–365.","ieee":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in <i> Conference proceedings FSE 2012</i>, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.","short":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:,  Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365."},"oa_version":"Preprint","date_created":"2018-12-11T11:55:25Z","type":"conference","main_file_link":[{"url":"http://www.iacr.org/archive/fse2012/75490350/75490350.pdf","open_access":"1"}],"day":"01","oa":1,"status":"public","doi":"10.1007/978-3-642-34047-5_20","date_published":"2012-03-01T00:00:00Z","intvolume":"      7549"},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.6926"}],"day":"01","oa":1,"date_published":"2012-11-01T00:00:00Z","doi":"10.1145/2393596.2393664","article_number":"57","status":"public","month":"11","quality_controlled":"1","acknowledgement":"This  research  was  supported  by  the  Canadian  NSERC grant   RGPIN   341819-07,    the   ERC   Advanced   Grant QUAREM, and the Austrian Science Fund NFN RiSE.","type":"conference","publication":"Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering","citation":{"ama":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. Conditional model checking: A technique to pass information between verifiers. In: <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. ACM; 2012. doi:<a href=\"https://doi.org/10.1145/2393596.2393664\">10.1145/2393596.2393664</a>","mla":"Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>, 57, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2393596.2393664\">10.1145/2393596.2393664</a>.","apa":"Beyer, D., Henzinger, T. A., Keremoglu, M., &#38; Wendler, P. (2012). Conditional model checking: A technique to pass information between verifiers. In <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. Cary, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2393596.2393664\">https://doi.org/10.1145/2393596.2393664</a>","ieee":"D. Beyer, T. A. Henzinger, M. Keremoglu, and P. Wendler, “Conditional model checking: A technique to pass information between verifiers,” in <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>, Cary, NC, USA, 2012.","short":"D. Beyer, T.A. Henzinger, M. Keremoglu, P. Wendler, in:, Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, ACM, 2012.","ista":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. 2012. Conditional model checking: A technique to pass information between verifiers. Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. FSE: Foundations of Software Engineering, 57.","chicago":"Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” In <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2393596.2393664\">https://doi.org/10.1145/2393596.2393664</a>."},"oa_version":"Preprint","date_created":"2018-12-11T11:51:42Z","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"title":"Conditional model checking: A technique to pass information between verifiers","department":[{"_id":"ToHe"}],"publisher":"ACM","publist_id":"5826","ec_funded":1,"_id":"1384","publication_status":"published","language":[{"iso":"eng"}],"conference":{"end_date":"2012-11-16","location":"Cary, NC, USA","start_date":"2012-11-11","name":"FSE: Foundations of Software Engineering"},"author":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Mehmet","full_name":"Keremoglu, Mehmet","last_name":"Keremoglu"},{"full_name":"Wendler, Philipp","last_name":"Wendler","first_name":"Philipp"}],"date_updated":"2021-01-12T06:50:18Z","abstract":[{"text":"Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually manifests itself in a space-out, time-out, or one component of the verification tool giving up; in all of these failing cases, significant computation is performed by the verification tool before the failure, but no result is reported. We propose to reformulate the model-checking problem as follows, in order to have the verification tool report a summary of the performed work even in case of failure: given a program and a specification, the model checker returns a condition Ψ - usually a state predicate - such that the program satisfies the specification under the condition Ψ - that is, as long as the program does not leave the states in which Ψ is satisfied. In our experiments, we investigated as one major application of conditional model checking the sequential combination of model checkers with information passing. We give the condition that one model checker produces, as input to a second conditional model checker, such that the verification problem for the second is restricted to the part of the state space that is not covered by the condition, i.e., the second model checker works on the problems that the first model checker could not solve. Our experiments demonstrate that repeated application of conditional model checkers, passing information from one model checker to the next, can significantly improve the verification results and performance, i.e., we can now verify programs that we could not verify before.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"year":"2012"},{"year":"2012","citation":{"ista":"Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization, IST Austria, 13p.","chicago":"Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">https://doi.org/10.15479/AT:IST-2012-0003</a>.","ieee":"F. Korc, V. Kolmogorov, and C. Lampert, <i>Approximating marginals using discrete energy minimization</i>. IST Austria, 2012.","short":"F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.","mla":"Korc, Filip, et al. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">10.15479/AT:IST-2012-0003</a>.","apa":"Korc, F., Kolmogorov, V., &#38; Lampert, C. (2012). <i>Approximating marginals using discrete energy minimization</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">https://doi.org/10.15479/AT:IST-2012-0003</a>","ama":"Korc F, Kolmogorov V, Lampert C. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">10.15479/AT:IST-2012-0003</a>"},"oa_version":"Published Version","date_created":"2018-12-12T11:39:06Z","type":"technical_report","has_accepted_license":"1","date_updated":"2023-02-23T11:13:22Z","file":[{"date_updated":"2020-07-14T12:46:44Z","file_name":"IST-2012-0003_IST-2012-0003.pdf","checksum":"7e0ba85ad123b13223aaf6cdde2d288c","date_created":"2018-12-12T11:53:29Z","file_size":618744,"creator":"system","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5490"}],"abstract":[{"lang":"eng","text":"We consider the problem of inference in agraphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete  Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pair-wise terms over a discretized domain. This allows the use of techniques originally devel-oped for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it  from training data. Experimental results show that for certain types of graphs a learned function can out-perform the  Bethe approximation. We also establish a link between the Bethe free energy and submodular functions."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"author":[{"first_name":"Filip","id":"476A2FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Korc","full_name":"Korc, Filip"},{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"pubrep_id":"36","month":"07","status":"public","ddc":["000"],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"3124"}]},"publication_status":"published","file_date_updated":"2020-07-14T12:46:44Z","doi":"10.15479/AT:IST-2012-0003","date_published":"2012-07-23T00:00:00Z","publisher":"IST Austria","_id":"5396","alternative_title":["IST Austria Technical Report"],"department":[{"_id":"VlKo"},{"_id":"ChLa"}],"day":"23","oa":1,"title":"Approximating marginals using discrete energy minimization","page":"13"},{"language":[{"iso":"eng"}],"conference":{"location":"Thiruvananthapuram, Kerala, India","start_date":"2012-10-03","name":"ATVA 2012","end_date":"2012-10-06"},"author":[{"first_name":"Ashutosh","full_name":"Gupta, Ashutosh","last_name":"Gupta"}],"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783642333859","9783642333866"]},"file":[{"creator":"dernst","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5746","date_created":"2018-12-18T13:07:35Z","file_size":465502,"date_updated":"2020-07-14T12:47:10Z","file_name":"2012_ATVA_Gupta.pdf","checksum":"68415837a315de3cc4d120f6019d752c"}],"date_updated":"2023-09-05T14:15:29Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","volume":7561,"has_accepted_license":"1","year":"2012","place":"Berlin, Heidelberg","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"page":"107-121","title":"Improved Single Pass Algorithms for Resolution Proof Reduction","department":[{"_id":"ToHe"}],"publisher":"Springer Berlin Heidelberg","_id":"5745","ec_funded":1,"series_title":"LNCS","publication_status":"published","file_date_updated":"2020-07-14T12:47:10Z","ddc":["005"],"pubrep_id":"180","quality_controlled":"1","type":"book_chapter","publication":"Automated Technology for Verification and Analysis","date_created":"2018-12-18T13:01:46Z","citation":{"mla":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Springer Berlin Heidelberg, 2012, pp. 107–21, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>.","apa":"Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction. In <i>Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 107–121). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>","ama":"Gupta A. Improved Single Pass Algorithms for Resolution Proof Reduction. In: <i>Automated Technology for Verification and Analysis</i>. Vol 7561. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:107-121. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>","chicago":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” In <i>Automated Technology for Verification and Analysis</i>, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>.","ista":"Gupta A. 2012.Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. vol. 7561, 107–121.","short":"A. Gupta, in:, Automated Technology for Verification and Analysis, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121.","ieee":"A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,” in <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121."},"oa_version":"None","oa":1,"intvolume":"      7561","date_published":"2012-01-01T00:00:00Z","doi":"10.1007/978-3-642-33386-6_10","status":"public"},{"oa":1,"external_id":{"isi":["000301173600004"]},"main_file_link":[{"url":"http://mi.mathnet.ru/eng/jmag525","open_access":"1"}],"day":"01","status":"public","isi":1,"date_published":"2012-01-01T00:00:00Z","intvolume":"         8","acknowledgement":"This work is supported by the Austrian Science Fund (FWF), Project P22025-N18.\r\n","quality_controlled":"1","month":"01","citation":{"short":"F. Pausinger, Journal of Mathematical Physics, Analysis, Geometry 8 (2012) 63–78.","ieee":"F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,” <i>Journal of Mathematical Physics, Analysis, Geometry</i>, vol. 8, no. 1. B. Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.","chicago":"Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two Intervals.” <i>Journal of Mathematical Physics, Analysis, Geometry</i>. B. Verkin Institute for Low Temperature Physics and Engineering, 2012.","ista":"Pausinger F. 2012. Elementary solutions of the Bernstein problem on two intervals. Journal of Mathematical Physics, Analysis, Geometry. 8(1), 63–78.","ama":"Pausinger F. Elementary solutions of the Bernstein problem on two intervals. <i>Journal of Mathematical Physics, Analysis, Geometry</i>. 2012;8(1):63-78.","apa":"Pausinger, F. (2012). Elementary solutions of the Bernstein problem on two intervals. <i>Journal of Mathematical Physics, Analysis, Geometry</i>. B. Verkin Institute for Low Temperature Physics and Engineering.","mla":"Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two Intervals.” <i>Journal of Mathematical Physics, Analysis, Geometry</i>, vol. 8, no. 1, B. Verkin Institute for Low Temperature Physics and Engineering, 2012, pp. 63–78."},"oa_version":"Published Version","date_created":"2019-06-27T08:16:56Z","publication":"Journal of Mathematical Physics, Analysis, Geometry","type":"journal_article","department":[{"_id":"HeEd"}],"title":"Elementary solutions of the Bernstein problem on two intervals","page":"63-78","publication_status":"published","_id":"6588","publisher":"B. Verkin Institute for Low Temperature Physics and Engineering","article_type":"original","abstract":[{"lang":"eng","text":"First we note that the best polynomial approximation to vertical bar x vertical bar on the set, which consists of an interval on the positive half-axis and a point on the negative half-axis, can be given by means of the classical Chebyshev polynomials. Then we explore the cases when a solution of the related problem on two intervals can be given in elementary functions."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_updated":"2023-10-16T09:41:31Z","author":[{"orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","last_name":"Pausinger","first_name":"Florian"}],"publication_identifier":{"issn":["1812-9471"]},"language":[{"iso":"eng"}],"issue":"1","scopus_import":"1","year":"2012","volume":8},{"month":"09","quality_controlled":"1","type":"journal_article","publication":"Science","citation":{"ista":"Ibarra CA, Feng X, Schoft VK, Hsieh T-F, Uzawa R, Rodrigues JA, Zemach A, Chumak N, Machlicova A, Nishimura T, Rojas D, Fischer RL, Tamaru H, Zilberman D. 2012. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. Science. 337(6100), 1360–1364.","chicago":"Ibarra, Christian A., Xiaoqi Feng, Vera K. Schoft, Tzung-Fu Hsieh, Rie Uzawa, Jessica A. Rodrigues, Assaf Zemach, et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1224839\">https://doi.org/10.1126/science.1224839</a>.","ieee":"C. A. Ibarra <i>et al.</i>, “Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes,” <i>Science</i>, vol. 337, no. 6100. American Association for the Advancement of Science, pp. 1360–1364, 2012.","short":"C.A. Ibarra, X. Feng, V.K. Schoft, T.-F. Hsieh, R. Uzawa, J.A. Rodrigues, A. Zemach, N. Chumak, A. Machlicova, T. Nishimura, D. Rojas, R.L. Fischer, H. Tamaru, D. Zilberman, Science 337 (2012) 1360–1364.","mla":"Ibarra, Christian A., et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” <i>Science</i>, vol. 337, no. 6100, American Association for the Advancement of Science, 2012, pp. 1360–64, doi:<a href=\"https://doi.org/10.1126/science.1224839\">10.1126/science.1224839</a>.","apa":"Ibarra, C. A., Feng, X., Schoft, V. K., Hsieh, T.-F., Uzawa, R., Rodrigues, J. A., … Zilberman, D. (2012). Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1224839\">https://doi.org/10.1126/science.1224839</a>","ama":"Ibarra CA, Feng X, Schoft VK, et al. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. <i>Science</i>. 2012;337(6100):1360-1364. doi:<a href=\"https://doi.org/10.1126/science.1224839\">10.1126/science.1224839</a>"},"oa_version":"Published Version","date_created":"2021-06-04T07:51:31Z","external_id":{"pmid":["22984074"]},"extern":"1","day":"14","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4034762/"}],"oa":1,"date_published":"2012-09-14T00:00:00Z","doi":"10.1126/science.1224839","intvolume":"       337","status":"public","pmid":1,"language":[{"iso":"eng"}],"author":[{"first_name":"Christian A.","full_name":"Ibarra, Christian A.","last_name":"Ibarra"},{"full_name":"Feng, Xiaoqi","last_name":"Feng","first_name":"Xiaoqi"},{"first_name":"Vera K.","full_name":"Schoft, Vera K.","last_name":"Schoft"},{"first_name":"Tzung-Fu","full_name":"Hsieh, Tzung-Fu","last_name":"Hsieh"},{"last_name":"Uzawa","full_name":"Uzawa, Rie","first_name":"Rie"},{"full_name":"Rodrigues, Jessica A.","last_name":"Rodrigues","first_name":"Jessica A."},{"full_name":"Zemach, Assaf","last_name":"Zemach","first_name":"Assaf"},{"last_name":"Chumak","full_name":"Chumak, Nina","first_name":"Nina"},{"last_name":"Machlicova","full_name":"Machlicova, Adriana","first_name":"Adriana"},{"full_name":"Nishimura, Toshiro","last_name":"Nishimura","first_name":"Toshiro"},{"first_name":"Denisse","full_name":"Rojas, Denisse","last_name":"Rojas"},{"last_name":"Fischer","full_name":"Fischer, Robert L.","first_name":"Robert L."},{"full_name":"Tamaru, Hisashi","last_name":"Tamaru","first_name":"Hisashi"},{"orcid":"0000-0002-0123-8649","first_name":"Daniel","last_name":"Zilberman","full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"}],"publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"article_processing_charge":"No","date_updated":"2021-12-14T08:28:51Z","abstract":[{"text":"The Arabidopsis thaliana central cell, the companion cell of the egg, undergoes DNA demethylation before fertilization, but the targeting preferences, mechanism, and biological significance of this process remain unclear. Here, we show that active DNA demethylation mediated by the DEMETER DNA glycosylase accounts for all of the demethylation in the central cell and preferentially targets small, AT-rich, and nucleosome-depleted euchromatic transposable elements. The vegetative cell, the companion cell of sperm, also undergoes DEMETER-dependent demethylation of similar sequences, and lack of DEMETER in vegetative cells causes reduced small RNA–directed DNA methylation of transposons in sperm. Our results demonstrate that demethylation in companion cells reinforces transposon methylation in plant gametes and likely contributes to stable silencing of transposable elements across generations.","lang":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":337,"has_accepted_license":"1","scopus_import":"1","issue":"6100","year":"2012","title":"Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes","page":"1360-1364","department":[{"_id":"DaZi"}],"publisher":"American Association for the Advancement of Science","article_type":"original","_id":"9451","publication_status":"published","ddc":["580"]},{"author":[{"first_name":"Devin","last_name":"Coleman-Derr","full_name":"Coleman-Derr, Devin"},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","last_name":"Zilberman","first_name":"Daniel","orcid":"0000-0002-0123-8649"}],"publication_identifier":{"issn":["1553-7390"],"eissn":["1553-7404"]},"pmid":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The regulation of eukaryotic chromatin relies on interactions between many epigenetic factors, including histone modifications, DNA methylation, and the incorporation of histone variants. H2A.Z, one of the most conserved but enigmatic histone variants that is enriched at the transcriptional start sites of genes, has been implicated in a variety of chromosomal processes. Recently, we reported a genome-wide anticorrelation between H2A.Z and DNA methylation, an epigenetic hallmark of heterochromatin that has also been found in the bodies of active genes in plants and animals. Here, we investigate the basis of this anticorrelation using a novel h2a.z loss-of-function line in Arabidopsis thaliana. Through genome-wide bisulfite sequencing, we demonstrate that loss of H2A.Z in Arabidopsis has only a minor effect on the level or profile of DNA methylation in genes, and we propose that the global anticorrelation between DNA methylation and H2A.Z is primarily caused by the exclusion of H2A.Z from methylated DNA. RNA sequencing and genomic mapping of H2A.Z show that H2A.Z enrichment across gene bodies, rather than at the TSS, is correlated with lower transcription levels and higher measures of gene responsiveness. Loss of H2A.Z causes misregulation of many genes that are disproportionately associated with response to environmental and developmental stimuli. We propose that H2A.Z deposition in gene bodies promotes variability in levels and patterns of gene expression, and that a major function of genic DNA methylation is to exclude H2A.Z from constitutively expressed genes."}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","date_updated":"2021-12-14T08:29:57Z","volume":8,"scopus_import":"1","issue":"10","year":"2012","title":"Deposition of histone variant H2A.Z within gene bodies regulates responsive genes","department":[{"_id":"DaZi"}],"_id":"9497","publisher":"Public Library of Science","article_type":"original","publication_status":"published","month":"10","quality_controlled":"1","type":"journal_article","citation":{"ama":"Coleman-Derr D, Zilberman D. Deposition of histone variant H2A.Z within gene bodies regulates responsive genes. <i>PLoS Genetics</i>. 2012;8(10). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1002988\">10.1371/journal.pgen.1002988</a>","mla":"Coleman-Derr, Devin, and Daniel Zilberman. “Deposition of Histone Variant H2A.Z within Gene Bodies Regulates Responsive Genes.” <i>PLoS Genetics</i>, vol. 8, no. 10, e1002988, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1002988\">10.1371/journal.pgen.1002988</a>.","apa":"Coleman-Derr, D., &#38; Zilberman, D. (2012). Deposition of histone variant H2A.Z within gene bodies regulates responsive genes. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1002988\">https://doi.org/10.1371/journal.pgen.1002988</a>","ieee":"D. Coleman-Derr and D. Zilberman, “Deposition of histone variant H2A.Z within gene bodies regulates responsive genes,” <i>PLoS Genetics</i>, vol. 8, no. 10. Public Library of Science, 2012.","short":"D. Coleman-Derr, D. Zilberman, PLoS Genetics 8 (2012).","chicago":"Coleman-Derr, Devin, and Daniel Zilberman. “Deposition of Histone Variant H2A.Z within Gene Bodies Regulates Responsive Genes.” <i>PLoS Genetics</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pgen.1002988\">https://doi.org/10.1371/journal.pgen.1002988</a>.","ista":"Coleman-Derr D, Zilberman D. 2012. Deposition of histone variant H2A.Z within gene bodies regulates responsive genes. PLoS Genetics. 8(10), e1002988."},"oa_version":"Published Version","date_created":"2021-06-07T10:55:27Z","publication":"PLoS Genetics","oa":1,"extern":"1","external_id":{"pmid":["23071449"]},"day":"11","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1371/journal.pgen.1002988"}],"article_number":"e1002988","doi":"10.1371/journal.pgen.1002988","date_published":"2012-10-11T00:00:00Z","intvolume":"         8","status":"public"},{"publication":"PLoS Genetics","oa_version":"Published Version","citation":{"short":"S.Y. Kim, J. Lee, L. Eshed-Williams, D. Zilberman, Z.R. Sung, PLoS Genetics 8 (2012).","ieee":"S. Y. Kim, J. Lee, L. Eshed-Williams, D. Zilberman, and Z. R. Sung, “EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development,” <i>PLoS Genetics</i>, vol. 8, no. 3. Public Library of Science, 2012.","chicago":"Kim, Sang Yeol, Jungeun Lee, Leor Eshed-Williams, Daniel Zilberman, and Z. Renee Sung. “EMF1 and PRC2 Cooperate to Repress Key Regulators of Arabidopsis Development.” <i>PLoS Genetics</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pgen.1002512\">https://doi.org/10.1371/journal.pgen.1002512</a>.","ista":"Kim SY, Lee J, Eshed-Williams L, Zilberman D, Sung ZR. 2012. EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development. PLoS Genetics. 8(3), e1002512.","ama":"Kim SY, Lee J, Eshed-Williams L, Zilberman D, Sung ZR. EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development. <i>PLoS Genetics</i>. 2012;8(3). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1002512\">10.1371/journal.pgen.1002512</a>","apa":"Kim, S. Y., Lee, J., Eshed-Williams, L., Zilberman, D., &#38; Sung, Z. R. (2012). EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1002512\">https://doi.org/10.1371/journal.pgen.1002512</a>","mla":"Kim, Sang Yeol, et al. “EMF1 and PRC2 Cooperate to Repress Key Regulators of Arabidopsis Development.” <i>PLoS Genetics</i>, vol. 8, no. 3, e1002512, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1002512\">10.1371/journal.pgen.1002512</a>."},"date_created":"2021-06-07T11:07:56Z","type":"journal_article","quality_controlled":"1","month":"03","status":"public","date_published":"2012-03-22T00:00:00Z","doi":"10.1371/journal.pgen.1002512","intvolume":"         8","article_number":"e1002512","external_id":{"pmid":["22457632"]},"extern":"1","day":"22","main_file_link":[{"url":"https://doi.org/10.1371/journal.pgen.1002512","open_access":"1"}],"oa":1,"issue":"3","scopus_import":"1","year":"2012","volume":8,"article_processing_charge":"No","date_updated":"2021-12-14T08:31:14Z","abstract":[{"lang":"eng","text":"EMBRYONIC FLOWER1 (EMF1) is a plant-specific gene crucial to Arabidopsis vegetative development. Loss of function mutants in the EMF1 gene mimic the phenotype caused by mutations in Polycomb Group protein (PcG) genes, which encode epigenetic repressors that regulate many aspects of eukaryotic development. In Arabidopsis, Polycomb Repressor Complex 2 (PRC2), made of PcG proteins, catalyzes trimethylation of lysine 27 on histone H3 (H3K27me3) and PRC1-like proteins catalyze H2AK119 ubiquitination. Despite functional similarity to PcG proteins, EMF1 lacks sequence homology with known PcG proteins; thus, its role in the PcG mechanism is unclear. To study the EMF1 functions and its mechanism of action, we performed genome-wide mapping of EMF1 binding and H3K27me3 modification sites in Arabidopsis seedlings. The EMF1 binding pattern is similar to that of H3K27me3 modification on the chromosomal and genic level. ChIPOTLe peak finding and clustering analyses both show that the highly trimethylated genes also have high enrichment levels of EMF1 binding, termed EMF1_K27 genes. EMF1 interacts with regulatory genes, which are silenced to allow vegetative growth, and with genes specifying cell fates during growth and differentiation. H3K27me3 marks not only these genes but also some genes that are involved in endosperm development and maternal effects. Transcriptome analysis, coupled with the H3K27me3 pattern, of EMF1_K27 genes in emf1 and PRC2 mutants showed that EMF1 represses gene activities via diverse mechanisms and plays a novel role in the PcG mechanism."}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","pmid":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1553-7404"],"issn":["1553-7390"]},"author":[{"first_name":"Sang Yeol","last_name":"Kim","full_name":"Kim, Sang Yeol"},{"full_name":"Lee, Jungeun","last_name":"Lee","first_name":"Jungeun"},{"last_name":"Eshed-Williams","full_name":"Eshed-Williams, Leor","first_name":"Leor"},{"first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","last_name":"Zilberman","orcid":"0000-0002-0123-8649"},{"full_name":"Sung, Z. Renee","last_name":"Sung","first_name":"Z. Renee"}],"publication_status":"published","publisher":"Public Library of Science","article_type":"original","_id":"9499","department":[{"_id":"DaZi"}],"title":"EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development"},{"month":"04","quality_controlled":"1","type":"journal_article","date_created":"2021-06-08T08:58:52Z","citation":{"ama":"Huff JT, Zilberman D. Regulation of biological accuracy, precision, and memory by plant chromatin organization. <i>Current Opinion in Genetics and Development</i>. 2012;22(2):132-138. doi:<a href=\"https://doi.org/10.1016/j.gde.2012.01.007\">10.1016/j.gde.2012.01.007</a>","mla":"Huff, Jason T., and Daniel Zilberman. “Regulation of Biological Accuracy, Precision, and Memory by Plant Chromatin Organization.” <i>Current Opinion in Genetics and Development</i>, vol. 22, no. 2, Elsevier, 2012, pp. 132–38, doi:<a href=\"https://doi.org/10.1016/j.gde.2012.01.007\">10.1016/j.gde.2012.01.007</a>.","apa":"Huff, J. T., &#38; Zilberman, D. (2012). Regulation of biological accuracy, precision, and memory by plant chromatin organization. <i>Current Opinion in Genetics and Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2012.01.007\">https://doi.org/10.1016/j.gde.2012.01.007</a>","short":"J.T. Huff, D. Zilberman, Current Opinion in Genetics and Development 22 (2012) 132–138.","ieee":"J. T. Huff and D. Zilberman, “Regulation of biological accuracy, precision, and memory by plant chromatin organization,” <i>Current Opinion in Genetics and Development</i>, vol. 22, no. 2. Elsevier, pp. 132–138, 2012.","ista":"Huff JT, Zilberman D. 2012. Regulation of biological accuracy, precision, and memory by plant chromatin organization. Current Opinion in Genetics and Development. 22(2), 132–138.","chicago":"Huff, Jason T., and Daniel Zilberman. “Regulation of Biological Accuracy, Precision, and Memory by Plant Chromatin Organization.” <i>Current Opinion in Genetics and Development</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.gde.2012.01.007\">https://doi.org/10.1016/j.gde.2012.01.007</a>."},"oa_version":"None","publication":"Current Opinion in Genetics and Development","external_id":{"pmid":["22336527"]},"extern":"1","intvolume":"        22","date_published":"2012-04-01T00:00:00Z","doi":"10.1016/j.gde.2012.01.007","status":"public","author":[{"first_name":"Jason T.","last_name":"Huff","full_name":"Huff, Jason T."},{"first_name":"Daniel","last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649"}],"publication_identifier":{"issn":["0959-437X"]},"language":[{"iso":"eng"}],"pmid":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","abstract":[{"lang":"eng","text":"Accumulating evidence points toward diverse functions for plant chromatin. Remarkable progress has been made over the last few years in elucidating the mechanisms for a number of these functions. Activity of the histone demethylase IBM1 accurately targets DNA methylation to silent repeats and transposable elements, not to genes. A genetic screen uncovered the surprising role of H2A.Z-containing nucleosomes in sensing precise differences in ambient temperature and consequent gene regulation. Precise maintenance of chromosome number is assured by a histone modification that suppresses inappropriate DNA replication and by centromeric histone H3 regulation of chromosome segregation. Histones and noncoding RNAs regulate FLOWERING LOCUS C, the expression of which quantitatively measures the duration of cold exposure, functioning as memory of winter. These findings are a testament to the power of using plants to research chromatin organization, and demonstrate examples of how chromatin functions to achieve biological accuracy, precision, and memory."}],"date_updated":"2021-12-14T08:32:38Z","article_processing_charge":"No","volume":22,"year":"2012","issue":"2","scopus_import":"1","title":"Regulation of biological accuracy, precision, and memory by plant chromatin organization","page":"132-138","department":[{"_id":"DaZi"}],"_id":"9528","article_type":"review","publisher":"Elsevier","publication_status":"published"},{"year":"2012","scopus_import":"1","volume":77,"date_updated":"2021-12-14T08:33:09Z","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","abstract":[{"text":"The most well-studied function of DNA methylation in eukaryotic cells is the transcriptional silencing of genes and transposons. More recent results showed that many eukaryotes methylate the bodies of genes as well and that this methylation correlates with transcriptional activity rather than repression. The purpose of gene body methylation remains mysterious, but is potentially related to the histone variant H2A.Z. Studies in plants and animals have shown that the genome-wide distributions of H2A.Z and DNA methylation are strikingly anticorrelated. Furthermore, we and other investigators have shown that this relationship is likely to be the result of an ancient but unknown mechanism by which DNA methylation prevents the incorporation of H2A.Z. Recently, we discovered strong correlations between the presence of H2A.Z within gene bodies, the degree to which a gene's expression varies across tissue types or environmental conditions, and transcriptional misregulation in an h2a.z mutant. We propose that one basal function of gene body methylation is the establishment of constitutive expression patterns within housekeeping genes by excluding H2A.Z from their bodies.","lang":"eng"}],"language":[{"iso":"eng"}],"pmid":1,"publication_identifier":{"eissn":["1943-4456"],"issn":["0091-7451"]},"author":[{"first_name":"D.","last_name":"Coleman-Derr","full_name":"Coleman-Derr, D."},{"orcid":"0000-0002-0123-8649","first_name":"Daniel","last_name":"Zilberman","full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"}],"publication_status":"published","article_type":"review","publisher":"Cold Spring Harbor Laboratory Press","_id":"9535","department":[{"_id":"DaZi"}],"title":"DNA methylation, H2A.Z, and the regulation of constitutive expression","page":"147-154","publication":"Cold Spring Harbor Symposia on Quantitative Biology","date_created":"2021-06-08T13:01:23Z","oa_version":"Published Version","citation":{"apa":"Coleman-Derr, D., &#38; Zilberman, D. (2012). DNA methylation, H2A.Z, and the regulation of constitutive expression. <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/sqb.2012.77.014944\">https://doi.org/10.1101/sqb.2012.77.014944</a>","mla":"Coleman-Derr, D., and Daniel Zilberman. “DNA Methylation, H2A.Z, and the Regulation of Constitutive Expression.” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 77, Cold Spring Harbor Laboratory Press, 2012, pp. 147–54, doi:<a href=\"https://doi.org/10.1101/sqb.2012.77.014944\">10.1101/sqb.2012.77.014944</a>.","ama":"Coleman-Derr D, Zilberman D. DNA methylation, H2A.Z, and the regulation of constitutive expression. <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. 2012;77:147-154. doi:<a href=\"https://doi.org/10.1101/sqb.2012.77.014944\">10.1101/sqb.2012.77.014944</a>","chicago":"Coleman-Derr, D., and Daniel Zilberman. “DNA Methylation, H2A.Z, and the Regulation of Constitutive Expression.” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Cold Spring Harbor Laboratory Press, 2012. <a href=\"https://doi.org/10.1101/sqb.2012.77.014944\">https://doi.org/10.1101/sqb.2012.77.014944</a>.","ista":"Coleman-Derr D, Zilberman D. 2012. DNA methylation, H2A.Z, and the regulation of constitutive expression. Cold Spring Harbor Symposia on Quantitative Biology. 77, 147–154.","short":"D. Coleman-Derr, D. Zilberman, Cold Spring Harbor Symposia on Quantitative Biology 77 (2012) 147–154.","ieee":"D. Coleman-Derr and D. Zilberman, “DNA methylation, H2A.Z, and the regulation of constitutive expression,” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 77. Cold Spring Harbor Laboratory Press, pp. 147–154, 2012."},"type":"journal_article","quality_controlled":"1","month":"12","status":"public","intvolume":"        77","doi":"10.1101/sqb.2012.77.014944","date_published":"2012-12-18T00:00:00Z","day":"18","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/sqb.2012.77.014944"}],"external_id":{"pmid":["23250988"]},"extern":"1","oa":1},{"date_updated":"2023-02-23T11:18:41Z","article_processing_charge":"No","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"lang":"eng","text":"Due to the omnipresent risk of epidemics, insect societies have evolved sophisticated disease defences at the individual and colony level. An intriguing yet little understood phenomenon is that social contact to pathogen-exposed individuals reduces susceptibility of previously naive nestmates to this pathogen. We tested whether such social immunisation in Lasius ants against the entomopathogenic fungus Metarhizium anisopliae is based on active upregulation of the immune system of nestmates following contact to an infectious individual or passive protection via transfer of immune effectors among group members—that is, active versus passive immunisation. We found no evidence for involvement of passive immunisation via transfer of antimicrobials among colony members. Instead, intensive allogrooming behaviour between naive and pathogen-exposed ants before fungal conidia firmly attached to their cuticle suggested passage of the pathogen from the exposed individuals to their nestmates. By tracing fluorescence-labelled conidia we indeed detected frequent pathogen transfer to the nestmates, where they caused low-level infections as revealed by growth of small numbers of fungal colony forming units from their dissected body content. These infections rarely led to death, but instead promoted an enhanced ability to inhibit fungal growth and an active upregulation of immune genes involved in antifungal defences (defensin and prophenoloxidase, PPO). Contrarily, there was no upregulation of the gene cathepsin L, which is associated with antibacterial and antiviral defences, and we found no increased antibacterial activity of nestmates of fungus-exposed ants. This indicates that social immunisation after fungal exposure is specific, similar to recent findings for individual-level immune priming in invertebrates. Epidemiological modeling further suggests that active social immunisation is adaptive, as it leads to faster elimination of the disease and lower death rates than passive immunisation. Interestingly, humans have also utilised the protective effect of low-level infections to fight smallpox by intentional transfer of low pathogen doses (“variolation” or “inoculation”)."}],"month":"09","author":[{"last_name":"Konrad","id":"46528076-F248-11E8-B48F-1D18A9856A87","full_name":"Konrad, Matthias","first_name":"Matthias"},{"id":"418901AA-F248-11E8-B48F-1D18A9856A87","last_name":"Vyleta","full_name":"Vyleta, Meghan","first_name":"Meghan"},{"last_name":"Theis","full_name":"Theis, Fabian","first_name":"Fabian"},{"full_name":"Stock, Miriam","last_name":"Stock","id":"42462816-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam"},{"full_name":"Klatt, Martina","last_name":"Klatt","id":"E60F29C6-E9AE-11E9-AF6E-D190C7302F38","first_name":"Martina"},{"full_name":"Drescher, Verena","last_name":"Drescher","first_name":"Verena"},{"first_name":"Carsten","full_name":"Marr, Carsten","last_name":"Marr"},{"orcid":"0000-0003-1832-8883","last_name":"Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","full_name":"Ugelvig, Line V","first_name":"Line V"},{"orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia"}],"year":"2012","date_created":"2021-07-30T08:39:13Z","oa_version":"Published Version","citation":{"mla":"Konrad, Matthias, et al. <i>Data from: Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/dryad.sv37s\">10.5061/dryad.sv37s</a>.","apa":"Konrad, M., Vyleta, M., Theis, F., Stock, M., Klatt, M., Drescher, V., … Cremer, S. (2012). Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies. Dryad. <a href=\"https://doi.org/10.5061/dryad.sv37s\">https://doi.org/10.5061/dryad.sv37s</a>","ama":"Konrad M, Vyleta M, Theis F, et al. Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies. 2012. doi:<a href=\"https://doi.org/10.5061/dryad.sv37s\">10.5061/dryad.sv37s</a>","ista":"Konrad M, Vyleta M, Theis F, Stock M, Klatt M, Drescher V, Marr C, Ugelvig LV, Cremer S. 2012. Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies, Dryad, <a href=\"https://doi.org/10.5061/dryad.sv37s\">10.5061/dryad.sv37s</a>.","chicago":"Konrad, Matthias, Meghan Vyleta, Fabian Theis, Miriam Stock, Martina Klatt, Verena Drescher, Carsten Marr, Line V Ugelvig, and Sylvia Cremer. “Data from: Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.” Dryad, 2012. <a href=\"https://doi.org/10.5061/dryad.sv37s\">https://doi.org/10.5061/dryad.sv37s</a>.","ieee":"M. Konrad <i>et al.</i>, “Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies.” Dryad, 2012.","short":"M. Konrad, M. Vyleta, F. Theis, M. Stock, M. Klatt, V. Drescher, C. Marr, L.V. Ugelvig, S. Cremer, (2012)."},"type":"research_data_reference","department":[{"_id":"SyCr"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.sv37s"}],"day":"27","title":"Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies","oa":1,"status":"public","related_material":{"record":[{"id":"3242","relation":"used_in_publication","status":"public"}]},"publisher":"Dryad","date_published":"2012-09-27T00:00:00Z","doi":"10.5061/dryad.sv37s","_id":"9755"},{"month":"12","author":[{"id":"35A7A418-F248-11E8-B48F-1D18A9856A87","last_name":"Tragust","full_name":"Tragust, Simon","first_name":"Simon"},{"full_name":"Mitteregger, Barbara","last_name":"Mitteregger","id":"479DDAAC-E9CD-11E9-9B5F-82450873F7A1","first_name":"Barbara"},{"orcid":"0000-0003-2676-3367","first_name":"Vanessa","last_name":"Barone","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","full_name":"Barone, Vanessa"},{"last_name":"Konrad","id":"46528076-F248-11E8-B48F-1D18A9856A87","full_name":"Konrad, Matthias","first_name":"Matthias"},{"orcid":"0000-0003-1832-8883","first_name":"Line V","full_name":"Ugelvig, Line V","last_name":"Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia"}],"abstract":[{"text":"To fight infectious diseases, host immune defences are employed at multiple levels. Sanitary behaviour, such as pathogen avoidance and removal, acts as a first line of defence to prevent infection [1] before activation of the physiological immune system. Insect societies have evolved a wide range of collective hygiene measures and intensive health care towards pathogen-exposed group members [2]. One of the most common behaviours is allogrooming, in which nestmates remove infectious particles from the body surfaces of exposed individuals [3]. Here we show that, in invasive garden ants, grooming of fungus-exposed brood is effective beyond the sheer mechanical removal of fungal conidiospores as it also includes chemical disinfection through the application of poison produced by the ants themselves. Formic acid is the main active component of the poison. It inhibits fungal growth of conidiospores remaining on the brood surface after grooming and also those collected in the mouth of the grooming ant. This dual function is achieved by uptake of the poison droplet into the mouth through acidopore self-grooming and subsequent application onto the infectious brood via brood grooming. This extraordinary behaviour extends current understanding of grooming and the establishment of social immunity in insect societies.","lang":"eng"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","article_processing_charge":"No","date_updated":"2023-02-23T11:04:28Z","type":"research_data_reference","citation":{"ista":"Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. 2012. Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison, Dryad, <a href=\"https://doi.org/10.5061/dryad.61649\">10.5061/dryad.61649</a>.","chicago":"Tragust, Simon, Barbara Mitteregger, Vanessa Barone, Matthias Konrad, Line V Ugelvig, and Sylvia Cremer. “Data from: Ants Disinfect Fungus-Exposed Brood by Oral Uptake and Spread of Their Poison.” Dryad, 2012. <a href=\"https://doi.org/10.5061/dryad.61649\">https://doi.org/10.5061/dryad.61649</a>.","short":"S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L.V. Ugelvig, S. Cremer, (2012).","ieee":"S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L. V. Ugelvig, and S. Cremer, “Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison.” Dryad, 2012.","apa":"Tragust, S., Mitteregger, B., Barone, V., Konrad, M., Ugelvig, L. V., &#38; Cremer, S. (2012). Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. Dryad. <a href=\"https://doi.org/10.5061/dryad.61649\">https://doi.org/10.5061/dryad.61649</a>","mla":"Tragust, Simon, et al. <i>Data from: Ants Disinfect Fungus-Exposed Brood by Oral Uptake and Spread of Their Poison</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/dryad.61649\">10.5061/dryad.61649</a>.","ama":"Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. 2012. doi:<a href=\"https://doi.org/10.5061/dryad.61649\">10.5061/dryad.61649</a>"},"oa_version":"Published Version","date_created":"2021-07-30T12:31:31Z","year":"2012","title":"Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison","oa":1,"day":"14","main_file_link":[{"url":"https://doi.org/10.5061/dryad.61649","open_access":"1"}],"department":[{"_id":"SyCr"}],"_id":"9757","date_published":"2012-12-14T00:00:00Z","doi":"10.5061/dryad.61649","publisher":"Dryad","related_material":{"record":[{"relation":"used_in_publication","id":"2926","status":"public"}]},"status":"public"},{"type":"research_data_reference","date_created":"2021-07-30T12:36:39Z","citation":{"short":"S. Aeschbacher, A. Futschik, M. Beaumont, (2012).","ieee":"S. Aeschbacher, A. Futschik, and M. Beaumont, “Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates.” Dryad, 2012.","ista":"Aeschbacher S, Futschik A, Beaumont M. 2012. Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates, Dryad, <a href=\"https://doi.org/10.5061/dryad.274b1\">10.5061/dryad.274b1</a>.","chicago":"Aeschbacher, Simon, Andreas Futschik, and Mark Beaumont. “Data from: Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates.” Dryad, 2012. <a href=\"https://doi.org/10.5061/dryad.274b1\">https://doi.org/10.5061/dryad.274b1</a>.","ama":"Aeschbacher S, Futschik A, Beaumont M. Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. 2012. doi:<a href=\"https://doi.org/10.5061/dryad.274b1\">10.5061/dryad.274b1</a>","mla":"Aeschbacher, Simon, et al. <i>Data from: Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/dryad.274b1\">10.5061/dryad.274b1</a>.","apa":"Aeschbacher, S., Futschik, A., &#38; Beaumont, M. (2012). Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. Dryad. <a href=\"https://doi.org/10.5061/dryad.274b1\">https://doi.org/10.5061/dryad.274b1</a>"},"oa_version":"Published Version","year":"2012","author":[{"id":"2D35326E-F248-11E8-B48F-1D18A9856A87","last_name":"Aeschbacher","full_name":"Aeschbacher, Simon","first_name":"Simon"},{"first_name":"Andreas","last_name":"Futschik","full_name":"Futschik, Andreas"},{"last_name":"Beaumont","full_name":"Beaumont, Mark","first_name":"Mark"}],"month":"11","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"lang":"eng","text":"We propose a two-step procedure for estimating multiple migration rates in an approximate Bayesian computation (ABC) framework, accounting for global nuisance parameters. The approach is not limited to migration, but generally of interest for inference problems with multiple parameters and a modular structure (e.g. independent sets of demes or loci). We condition on a known, but complex demographic model of a spatially subdivided population, motivated by the reintroduction of Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters ancestral mutation rate and male mating skew have been estimated for the whole population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step, we estimate in this study the migration rates independently for clusters of demes putatively connected by migration. For large clusters (many migration rates), ABC faces the problem of too many summary statistics. We therefore assess by simulation if estimation per pair of demes is a valid alternative. We find that the trade-off between reduced dimensionality for the pairwise estimation on the one hand and lower accuracy due to the assumption of pairwise independence on the other depends on the number of migration rates to be inferred: the accuracy of the pairwise approach increases with the number of parameters, relative to the joint estimation approach. To distinguish between low and zero migration, we perform ABC-type model comparison between a model with migration and one without. Applying the approach to microsatellite data from Alpine ibex, we find no evidence for substantial gene flow via migration, except for one pair of demes in one direction."}],"date_updated":"2023-02-23T11:05:19Z","article_processing_charge":"No","_id":"9758","publisher":"Dryad","date_published":"2012-11-14T00:00:00Z","doi":"10.5061/dryad.274b1","related_material":{"record":[{"status":"public","id":"2944","relation":"used_in_publication"}]},"status":"public","oa":1,"title":"Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates","day":"14","main_file_link":[{"url":"https://doi.org/10.5061/dryad.274b1","open_access":"1"}],"department":[{"_id":"NiBa"}]},{"oa":1,"day":"01","intvolume":"        13","date_published":"2012-01-01T00:00:00Z","doi":"10.1038/nrn3125","status":"public","month":"01","pubrep_id":"820","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","quality_controlled":"1","type":"journal_article","date_created":"2018-12-11T12:02:38Z","citation":{"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.","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.” <i>Nature Reviews Neuroscience</i>. Nature Publishing Group, 2012. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>.","short":"E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience 13 (2012) 7–21.","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,” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1. Nature Publishing Group, pp. 7–21, 2012.","mla":"Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast Mammalian Synapses.” <i>Nature Reviews Neuroscience</i>, vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>.","apa":"Eggermann, E., Bucurenciu, I., Goswami, S., &#38; Jonas, P. M. (2012). Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrn3125\">https://doi.org/10.1038/nrn3125</a>","ama":"Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. <i>Nature Reviews Neuroscience</i>. 2012;13(1):7-21. doi:<a href=\"https://doi.org/10.1038/nrn3125\">10.1038/nrn3125</a>"},"oa_version":"Submitted Version","publication":"Nature Reviews Neuroscience","title":"Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses","page":"7 - 21","project":[{"grant_number":"JO_780/A5","name":"Synaptic Mechanisms of Neuronal Network Function","_id":"25BC64A8-B435-11E9-9278-68D0E5697425"},{"_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","grant_number":"SFB-TR3-TP10B"}],"department":[{"_id":"PeJo"}],"_id":"3317","publist_id":"3322","publisher":"Nature Publishing Group","ddc":["570"],"file_date_updated":"2020-07-14T12:46:07Z","publication_status":"published","author":[{"first_name":"Emmanuel","id":"34DACA34-E9AE-11E9-849C-D35BD8ADC20C","full_name":"Eggermann, Emmanuel","last_name":"Eggermann"},{"first_name":"Iancu","id":"4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A","last_name":"Bucurenciu","full_name":"Bucurenciu, Iancu"},{"first_name":"Sarit","last_name":"Goswami","id":"3A578F32-F248-11E8-B48F-1D18A9856A87","full_name":"Goswami, Sarit"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"file":[{"checksum":"4c1c86b2f6e4e1562f5bb800b457ea9f","file_name":"IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf","date_updated":"2020-07-14T12:46:07Z","file_size":314246,"date_created":"2018-12-12T10:12:13Z","file_id":"4931","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"system"},{"relation":"main_file","file_id":"4932","creator":"system","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:12:14Z","file_size":1840216,"checksum":"bceb2efdd49d115f4dde8486bc1be3f2","date_updated":"2020-07-14T12:46:07Z","file_name":"IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf"}],"date_updated":"2021-01-12T07:42:36Z","has_accepted_license":"1","volume":13,"year":"2012","issue":"1","scopus_import":1},{"day":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.1510"}],"title":"A worst case bound for topology computation of algebraic curves","oa":1,"page":"239 - 258","department":[{"_id":"HeEd"}],"date_published":"2012-03-01T00:00:00Z","doi":"10.1016/j.jsc.2011.11.001","publisher":"Elsevier","intvolume":"        47","publist_id":"3303","_id":"3331","status":"public","publication_status":"published","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-8030-9299","first_name":"Michael","full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87","last_name":"Kerber"},{"full_name":"Sagraloff, Michael","last_name":"Sagraloff","first_name":"Michael"}],"month":"03","date_updated":"2021-01-12T07:42:43Z","quality_controlled":"1","abstract":[{"lang":"eng","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."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","volume":47,"issue":"3","scopus_import":1,"year":"2012","publication":" Journal of Symbolic Computation","oa_version":"Preprint","citation":{"ama":"Kerber M, Sagraloff M. A worst case bound for topology computation of algebraic curves. <i> Journal of Symbolic Computation</i>. 2012;47(3):239-258. doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>","apa":"Kerber, M., &#38; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. <i> Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>","mla":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i> Journal of Symbolic Computation</i>, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:<a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">10.1016/j.jsc.2011.11.001</a>.","ieee":"M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,” <i> Journal of Symbolic Computation</i>, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.","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.","chicago":"Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.” <i> Journal of Symbolic Computation</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jsc.2011.11.001\">https://doi.org/10.1016/j.jsc.2011.11.001</a>."},"date_created":"2018-12-11T12:02:43Z"},{"day":"22","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1107.2009"}],"external_id":{"arxiv":["1107.2009"]},"oa":1,"status":"public","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5382"}]},"intvolume":"      7213","date_published":"2012-03-22T00:00:00Z","doi":"10.1007/978-3-642-28729-9_18","quality_controlled":"1","arxiv":1,"month":"03","date_created":"2018-12-11T12:02:46Z","oa_version":"Preprint","citation":{"ama":"Chatterjee K. Robustness of structurally equivalent concurrent parity games. In: Vol 7213. Springer; 2012:270-285. doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>","mla":"Chatterjee, Krishnendu. <i>Robustness of Structurally Equivalent Concurrent Parity Games</i>. Vol. 7213, Springer, 2012, pp. 270–85, doi:<a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">10.1007/978-3-642-28729-9_18</a>.","apa":"Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>","short":"K. Chatterjee, in:, Springer, 2012, pp. 270–285.","ieee":"K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.","ista":"Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.","chicago":"Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,” 7213:270–85. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28729-9_18\">https://doi.org/10.1007/978-3-642-28729-9_18</a>."},"type":"conference","department":[{"_id":"KrCh"}],"alternative_title":["LNCS"],"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","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","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"270 - 285","title":"Robustness of structurally equivalent concurrent parity games","publication_status":"published","publist_id":"3284","publisher":"Springer","_id":"3341","ec_funded":1,"date_updated":"2023-02-23T12:23:46Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with \\omega-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity gameswith respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition function is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal)."}],"language":[{"iso":"eng"}],"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"conference":{"end_date":"2012-04-01","start_date":"2012-03-24","location":"Tallinn, Estonia","name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"year":"2012","scopus_import":1,"volume":7213},{"publication_status":"published","status":"public","_id":"3836","doi":"10.1016/j.scico.2010.06.004","date_published":"2012-02-01T00:00:00Z","publisher":"Elsevier","intvolume":"        77","publist_id":"2370","department":[{"_id":"ToHe"}],"page":"96 - 112","title":"Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code","day":"01","citation":{"mla":"Ghosal, Arkadeb, et al. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” <i>Science of Computer Programming</i>, vol. 77, no. 2, Elsevier, 2012, pp. 96–112, doi:<a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">10.1016/j.scico.2010.06.004</a>.","apa":"Ghosal, A., Iercan, D., Kirsch, C., Henzinger, T. A., &#38; Sangiovanni Vincentelli, A. (2012). Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. <i>Science of Computer Programming</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">https://doi.org/10.1016/j.scico.2010.06.004</a>","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. <i>Science of Computer Programming</i>. 2012;77(2):96-112. doi:<a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">10.1016/j.scico.2010.06.004</a>","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.” <i>Science of Computer Programming</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.scico.2010.06.004\">https://doi.org/10.1016/j.scico.2010.06.004</a>.","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.","short":"A. Ghosal, D. Iercan, C. Kirsch, T.A. Henzinger, A. Sangiovanni Vincentelli, Science of Computer Programming 77 (2012) 96–112.","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,” <i>Science of Computer Programming</i>, vol. 77, no. 2. Elsevier, pp. 96–112, 2012."},"oa_version":"None","date_created":"2018-12-11T12:05:26Z","issue":"2","scopus_import":1,"publication":"Science of Computer Programming","year":"2012","type":"journal_article","volume":77,"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"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:32Z","quality_controlled":"1","month":"02","author":[{"last_name":"Ghosal","full_name":"Ghosal, Arkadeb","first_name":"Arkadeb"},{"first_name":"Daniel","full_name":"Iercan, Daniel","last_name":"Iercan"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Sangiovanni Vincentelli","full_name":"Sangiovanni Vincentelli, Alberto","first_name":"Alberto"}],"language":[{"iso":"eng"}]},{"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.","quality_controlled":"1","month":"03","oa_version":"Submitted Version","citation":{"ama":"Chatterjee K, Henzinger TA. A survey of stochastic ω regular games. <i>Journal of Computer and System Sciences</i>. 2012;78(2):394-413. doi:<a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">10.1016/j.jcss.2011.05.002</a>","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2012). A survey of stochastic ω regular games. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">https://doi.org/10.1016/j.jcss.2011.05.002</a>","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω Regular Games.” <i>Journal of Computer and System Sciences</i>, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:<a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">10.1016/j.jcss.2011.05.002</a>.","ieee":"K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” <i>Journal of Computer and System Sciences</i>, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.","short":"K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jcss.2011.05.002\">https://doi.org/10.1016/j.jcss.2011.05.002</a>.","ista":"Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413."},"date_created":"2018-12-11T12:05:29Z","publication":"Journal of Computer and System Sciences","type":"journal_article","oa":1,"day":"02","main_file_link":[{"url":"https://doi.org/10.1016/j.jcss.2011.05.002","open_access":"1"}],"status":"public","doi":"10.1016/j.jcss.2011.05.002","date_published":"2012-03-02T00:00:00Z","intvolume":"        78","abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:46:17Z","file_name":"a_survey_of_stochastic_omega-regular_games.pdf","checksum":"241b939deb4517cdd4426d49c67e3fa2","date_created":"2019-01-29T10:54:28Z","file_size":336450,"creator":"kschuh","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5897"}],"date_updated":"2022-05-24T08:00:54Z","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"issue":"2","scopus_import":"1","year":"2012","has_accepted_license":"1","volume":78,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"A survey of stochastic ω regular games","page":"394 - 413","file_date_updated":"2020-07-14T12:46:17Z","publication_status":"published","ddc":["000"],"_id":"3846","publisher":"Elsevier","publist_id":"2341","article_type":"original"},{"has_accepted_license":"1","volume":6,"scopus_import":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2012","author":[{"first_name":"Michael","full_name":"Tangermann, Michael","last_name":"Tangermann"},{"first_name":"Klaus","last_name":"Müller","full_name":"Müller, Klaus"},{"full_name":"Aertsen, Ad","last_name":"Aertsen","first_name":"Ad"},{"full_name":"Birbaumer, Niels","last_name":"Birbaumer","first_name":"Niels"},{"first_name":"Christoph","last_name":"Braun","full_name":"Braun, Christoph"},{"first_name":"Clemens","full_name":"Brunner, Clemens","last_name":"Brunner"},{"full_name":"Leeb, Robert","last_name":"Leeb","first_name":"Robert"},{"full_name":"Mehring, Carsten","last_name":"Mehring","first_name":"Carsten"},{"first_name":"Kai","last_name":"Miller","full_name":"Miller, Kai"},{"first_name":"Gernot","last_name":"Müller Putz","full_name":"Müller Putz, Gernot"},{"first_name":"Guido","last_name":"Nolte","full_name":"Nolte, Guido"},{"last_name":"Pfurtscheller","full_name":"Pfurtscheller, Gert","first_name":"Gert"},{"first_name":"Hubert","last_name":"Preissl","full_name":"Preissl, Hubert"},{"first_name":"Gerwin","last_name":"Schalk","full_name":"Schalk, Gerwin"},{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois","last_name":"Schlögl","orcid":"0000-0002-5621-8100"},{"first_name":"Carmen","full_name":"Vidaurre, Carmen","last_name":"Vidaurre"},{"first_name":"Stephan","full_name":"Waldert, Stephan","last_name":"Waldert"},{"first_name":"Benjamin","full_name":"Blankertz, Benjamin","last_name":"Blankertz"}],"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:01:03Z","file":[{"date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf","checksum":"195238221c4b0b0f4035f6f6c16ea17c","date_created":"2018-12-12T10:18:34Z","file_size":2693701,"creator":"system","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5356"}],"_id":"493","publisher":"Frontiers Research Foundation","publist_id":"7327","ddc":["004"],"publication_status":"published","file_date_updated":"2020-07-14T12:46:35Z","title":"Review of the BCI competition IV","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"type":"journal_article","citation":{"ama":"Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. 2012;6. doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>","mla":"Tangermann, Michael, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>, vol. 6, 55, Frontiers Research Foundation, 2012, doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>.","apa":"Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner, C., … Blankertz, B. (2012). Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>","ieee":"M. Tangermann <i>et al.</i>, “Review of the BCI competition IV,” <i>Frontiers in Neuroscience</i>, vol. 6. Frontiers Research Foundation, 2012.","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).","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.","chicago":"Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation, 2012. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>."},"oa_version":"Published Version","date_created":"2018-12-11T11:46:46Z","publication":"Frontiers in Neuroscience","month":"07","pubrep_id":"945","license":"https://creativecommons.org/licenses/by/4.0/","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","quality_controlled":"1","article_number":"55","doi":"10.3389/fnins.2012.00055","date_published":"2012-07-13T00:00:00Z","intvolume":"         6","status":"public","oa":1,"day":"13"}]