[{"quality_controlled":"1","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2012-10-06","start_date":"2012-10-03","location":"Thiruvananthapuram, India"},"doi":"10.1007/978-3-642-33386-6_14","language":[{"iso":"eng"}],"month":"10","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783642333859"],"issn":["0302-9743"],"eisbn":["9783642333866"]},"acknowledgement":"This work has been partially supported by the French ANR project Veridyc","year":"2012","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","author":[{"last_name":"Bouajjani","first_name":"Ahmed","full_name":"Bouajjani, Ahmed"},{"full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","last_name":"Dragoi"},{"full_name":"Enea, Constantin","first_name":"Constantin","last_name":"Enea"},{"last_name":"Sighireanu","first_name":"Mihaela","full_name":"Sighireanu, Mihaela"}],"date_updated":"2023-09-05T14:07:24Z","date_created":"2022-03-21T07:58:39Z","volume":7561,"place":"Berlin, Heidelberg","publication":"Automated Technology for Verification and Analysis","citation":{"chicago":"Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” In Automated Technology for Verification and Analysis, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_14.","short":"A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.","mla":"Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” Automated Technology for Verification and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.","ieee":"A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.","apa":"Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Accurate invariant checking for programs manipulating lists and arrays with infinite data. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 167–182). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-33386-6_14","ista":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking for programs manipulating lists and arrays with infinite data. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and AnalysisLNCS, LNCS, vol. 7561, 167–182.","ama":"Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:10.1007/978-3-642-33386-6_14"},"page":"167-182","date_published":"2012-10-15T00:00:00Z","scopus_import":"1","series_title":"LNCS","day":"15","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10903","title":"Accurate invariant checking for programs manipulating lists and arrays with infinite data","status":"public","intvolume":" 7561","oa_version":"None","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"We propose a logic-based framework for automated reasoning about sequential programs manipulating singly-linked lists and arrays with unbounded data. We introduce the logic SLAD, which allows combining shape constraints, written in a fragment of Separation Logic, with data and size constraints. We address the problem of checking the entailment between SLAD formulas, which is crucial in performing pre-post condition reasoning. Although this problem is undecidable in general for SLAD, we propose a sound and powerful procedure that is able to solve this problem for a large class of formulas, beyond the capabilities of existing techniques and tools. We prove that this procedure is complete, i.e., it is actually a decision procedure for this problem, for an important fragment of SLAD including known decidable logics. We implemented this procedure and shown its preciseness and its efficiency on a significant benchmark of formulas.","lang":"eng"}]},{"date_published":"2012-10-01T00:00:00Z","citation":{"ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in Algorithms – ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer. https://doi.org/10.1007/978-3-642-33090-2_27","ista":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.","ama":"Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: Algorithms – ESA 2012. Vol 7501. Springer; 2012:301-312. doi:10.1007/978-3-642-33090-2_27","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” In Algorithms – ESA 2012, 7501:301–12. Springer, 2012. https://doi.org/10.1007/978-3-642-33090-2_27.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, Algorithms – ESA 2012, Springer, 2012, pp. 301–312.","mla":"Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithms – ESA 2012, vol. 7501, Springer, 2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27."},"publication":"Algorithms – ESA 2012","page":"301-312","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10905","intvolume":" 7501","status":"public","title":"Polynomial-time algorithms for energy games with special weight structures","abstract":[{"lang":"eng","text":"Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP ∩ co−NP, but are not known to be in P. While the existence of polynomial-time algorithms has been a major open problem for decades, there is no algorithm that solves any non-trivial subclass in polynomial time.\r\nIn this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several counter examples that show that many previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting graph structures need not help."}],"type":"conference","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-33090-2_27","conference":{"location":"Ljubljana, Slovenia","start_date":"2012-09-10","end_date":"2012-09-12","name":"ESA: European Symposium on Algorithms"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.08234"}],"external_id":{"arxiv":["1604.08234"]},"project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783642330896"],"eisbn":["9783642330902"],"issn":["0302-9743"]},"month":"10","related_material":{"record":[{"id":"535","status":"public","relation":"later_version"}]},"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"volume":7501,"date_updated":"2023-09-05T14:09:30Z","date_created":"2022-03-21T08:01:45Z","year":"2012","acknowledgement":"Supported by the Austrian Science Fund (FWF): P23499-N23, the Austrian Science Fund (FWF): S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award","publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","ec_funded":1},{"alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"HSF(C) is a tool that automates verification of safety and liveness properties for C programs. This paper describes the verification approach taken by HSF(C) and provides instructions on how to install and use the tool.","lang":"eng"}],"intvolume":" 7214","status":"public","title":"HSF(C): A software verifier based on Horn clauses","_id":"10906","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","series_title":"LNCS","scopus_import":"1","article_processing_charge":"No","day":"01","page":"549-551","citation":{"ieee":"S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in Tools and Algorithms for the Construction and Analysis of Systems, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.","apa":"Grebenshchikov, S., Gupta, A., Lopes, N. P., Popeea, C., & Rybalchenko, A. (2012). HSF(C): A software verifier based on Horn clauses. In C. Flanagan & B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (Vol. 7214, pp. 549–551). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-28756-5_46","ista":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. 2012. HSF(C): A software verifier based on Horn clauses. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of SystemsLNCS, LNCS, vol. 7214, 549–551.","ama":"Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. Tools and Algorithms for the Construction and Analysis of Systems. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:10.1007/978-3-642-28756-5_46","chicago":"Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.” In Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-28756-5_46.","short":"S. Grebenshchikov, A. Gupta, N.P. Lopes, C. Popeea, A. Rybalchenko, in:, C. Flanagan, B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems, Springer, Berlin, Heidelberg, 2012, pp. 549–551.","mla":"Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:10.1007/978-3-642-28756-5_46."},"publication":"Tools and Algorithms for the Construction and Analysis of Systems","date_published":"2012-04-01T00:00:00Z","place":"Berlin, Heidelberg","department":[{"_id":"ToHe"}],"publisher":"Springer","editor":[{"full_name":"Flanagan, Cormac","first_name":"Cormac","last_name":"Flanagan"},{"last_name":"König","first_name":"Barbara","full_name":"König, Barbara"}],"publication_status":"published","year":"2012","volume":7214,"date_created":"2022-03-21T08:03:30Z","date_updated":"2023-09-05T14:09:54Z","author":[{"last_name":"Grebenshchikov","first_name":"Sergey","full_name":"Grebenshchikov, Sergey"},{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"first_name":"Nuno P.","last_name":"Lopes","full_name":"Lopes, Nuno P."},{"last_name":"Popeea","first_name":"Corneliu","full_name":"Popeea, Corneliu"},{"full_name":"Rybalchenko, Andrey","first_name":"Andrey","last_name":"Rybalchenko"}],"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783642287565"],"isbn":["9783642287558"],"eissn":["1611-3349"]},"month":"04","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1007/978-3-642-28756-5_46","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-28756-5_46","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2012-04-01","location":"Tallinn, Estonia","start_date":"2012-03-24"}},{"type":"book_chapter","_id":"5745","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Improved Single Pass Algorithms for Resolution Proof Reduction","ddc":["005"],"status":"public","intvolume":" 7561","pubrep_id":"180","oa_version":"None","file":[{"file_size":465502,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2012_ATVA_Gupta.pdf","checksum":"68415837a315de3cc4d120f6019d752c","date_updated":"2020-07-14T12:47:10Z","date_created":"2018-12-18T13:07:35Z","relation":"main_file","file_id":"5746"}],"series_title":"LNCS","has_accepted_license":"1","article_processing_charge":"No","publication":"Automated Technology for Verification and Analysis","citation":{"ista":"Gupta A. 2012.Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. vol. 7561, 107–121.","ieee":"A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,” in Automated Technology for Verification and Analysis, vol. 7561, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121.","apa":"Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction. In Automated Technology for Verification and Analysis (Vol. 7561, pp. 107–121). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-33386-6_10","ama":"Gupta A. Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:107-121. doi:10.1007/978-3-642-33386-6_10","chicago":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” In Automated Technology for Verification and Analysis, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33386-6_10.","mla":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” Automated Technology for Verification and Analysis, vol. 7561, Springer Berlin Heidelberg, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.","short":"A. Gupta, in:, Automated Technology for Verification and Analysis, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121."},"page":"107-121","date_published":"2012-01-01T00:00:00Z","place":"Berlin, Heidelberg","file_date_updated":"2020-07-14T12:47:10Z","ec_funded":1,"year":"2012","publication_status":"published","publisher":"Springer Berlin Heidelberg","department":[{"_id":"ToHe"}],"author":[{"full_name":"Gupta, Ashutosh","first_name":"Ashutosh","last_name":"Gupta"}],"date_updated":"2023-09-05T14:15:29Z","date_created":"2018-12-18T13:01:46Z","volume":7561,"publication_identifier":{"issn":["0302-9743"],"isbn":["9783642333859","9783642333866"],"eissn":["1611-3349"]},"oa":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"conference":{"name":"ATVA 2012","end_date":"2012-10-06","location":"Thiruvananthapuram, Kerala, India","start_date":"2012-10-03"},"doi":"10.1007/978-3-642-33386-6_10","language":[{"iso":"eng"}]},{"has_accepted_license":"1","day":"01","citation":{"ista":"Zufferey D, Wies T, Henzinger TA. 2012. Ideal abstractions for well structured transition systems. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 445–460.","ieee":"D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.","apa":"Zufferey, D., Wies, T., & Henzinger, T. A. (2012). Ideal abstractions for well structured transition systems (Vol. 7148, pp. 445–460). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_29","ama":"Zufferey D, Wies T, Henzinger TA. Ideal abstractions for well structured transition systems. In: Vol 7148. Springer; 2012:445-460. doi:10.1007/978-3-642-27940-9_29","chicago":"Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_29.","mla":"Zufferey, Damien, et al. Ideal Abstractions for Well Structured Transition Systems. Vol. 7148, Springer, 2012, pp. 445–60, doi:10.1007/978-3-642-27940-9_29.","short":"D. Zufferey, T. Wies, T.A. Henzinger, in:, Springer, 2012, pp. 445–460."},"page":"445 - 460","date_published":"2012-01-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems equipped with a well-quasi-ordering on states that is also a simulation relation. WSTS are an attractive target for formal analysis because there exist generic algorithms that decide interesting verification problems for this class. Among the most popular algorithms are acceleration-based forward analyses for computing the covering set. Termination of these algorithms can only be guaranteed for flattable WSTS. Yet, many WSTS of practical interest are not flattable and the question whether any given WSTS is flattable is itself undecidable. We therefore propose an analysis that computes the covering set and captures the essence of acceleration-based algorithms, but sacrifices precision for guaranteed termination. Our analysis is an abstract interpretation whose abstract domain builds on the ideal completion of the well-quasi-ordered state space, and a widening operator that mimics acceleration and controls the loss of precision of the analysis. We present instances of our framework for various classes of WSTS. Our experience with a prototype implementation indicates that, despite the inherent precision loss, our analysis often computes the precise covering set of the analyzed system."}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"3251","intvolume":" 7148","status":"public","title":"Ideal abstractions for well structured transition systems","ddc":["000","005"],"pubrep_id":"100","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:09:35Z","date_updated":"2020-07-14T12:46:05Z","checksum":"f2f0d55efa32309ad1fe65a5fcaad90c","file_id":"4759","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":217104,"file_name":"IST-2012-100-v1+1_Ideal_abstractions_for_well-structured_transition_systems.pdf","access_level":"open_access"}],"month":"01","oa":1,"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1007/978-3-642-27940-9_29","conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"Philadelphia, PA, USA","start_date":"2012-01-22","end_date":"2012-01-24"},"language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"3406","file_date_updated":"2020-07-14T12:46:05Z","year":"2012","acknowledgement":"This research was supported in part by the European Research Council (ERC) Advanced Investigator Grant QUAREM and by the Austrian Science Fund (FWF) project S11402-N23.","department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1405"}]},"author":[{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien","full_name":"Zufferey, Damien"},{"id":"447BFB88-F248-11E8-B48F-1D18A9856A87","last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"volume":7148,"date_updated":"2023-09-07T11:36:36Z","date_created":"2018-12-11T12:02:16Z"},{"date_updated":"2023-09-07T11:40:43Z","date_created":"2018-12-11T12:01:43Z","volume":486,"author":[{"full_name":"Diaz Jr, Luis","first_name":"Luis","last_name":"Diaz Jr"},{"full_name":"Williams, Richard","first_name":"Richard","last_name":"Williams"},{"full_name":"Wu, Jian","last_name":"Wu","first_name":"Jian"},{"full_name":"Kinde, Isaac","last_name":"Kinde","first_name":"Isaac"},{"full_name":"Hecht, Joel","first_name":"Joel","last_name":"Hecht"},{"full_name":"Berlin, Jordan","first_name":"Jordan","last_name":"Berlin"},{"first_name":"Benjamin","last_name":"Allen","full_name":"Allen, Benjamin"},{"last_name":"Božić","first_name":"Ivana","full_name":"Božić, Ivana"},{"full_name":"Reiter, Johannes","last_name":"Reiter","first_name":"Johannes","orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"},{"last_name":"Kinzler","first_name":"Kenneth","full_name":"Kinzler, Kenneth"},{"full_name":"Oliner, Kelly","last_name":"Oliner","first_name":"Kelly"},{"first_name":"Bert","last_name":"Vogelstein","full_name":"Vogelstein, Bert"}],"related_material":{"record":[{"id":"1400","relation":"dissertation_contains","status":"public"}]},"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Nature Publishing Group","year":"2012","pmid":1,"publist_id":"3537","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1038/nature11219","quality_controlled":"1","project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3436069/"}],"external_id":{"pmid":["22722843"]},"month":"06","oa_version":"Submitted Version","title":"The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers","status":"public","intvolume":" 486","_id":"3157","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Colorectal tumours that are wild type for KRAS are often sensitive to EGFR blockade, but almost always develop resistance within several months of initiating therapy. The mechanisms underlying this acquired resistance to anti-EGFR antibodies are largely unknown. This situation is in marked contrast to that of small-molecule targeted agents, such as inhibitors of ABL, EGFR, BRAF and MEK, in which mutations in the genes encoding the protein targets render the tumours resistant to the effects of the drugs. The simplest hypothesis to account for the development of resistance to EGFR blockade is that rare cells with KRAS mutations pre-exist at low levels in tumours with ostensibly wild-type KRAS genes. Although this hypothesis would seem readily testable, there is no evidence in pre-clinical models to support it, nor is there data from patients. To test this hypothesis, we determined whether mutant KRAS DNA could be detected in the circulation of 28 patients receiving monotherapy with panitumumab, a therapeutic anti-EGFR antibody. We found that 9 out of 24 (38%) patients whose tumours were initially KRAS wild type developed detectable mutations in KRAS in their sera, three of which developed multiple different KRAS mutations. The appearance of these mutations was very consistent, generally occurring between 5 and 6months following treatment. Mathematical modelling indicated that the mutations were present in expanded subclones before the initiation of panitumumab treatment. These results suggest that the emergence of KRAS mutations is a mediator of acquired resistance to EGFR blockade and that these mutations can be detected in a non-invasive manner. They explain why solid tumours develop resistance to targeted therapies in a highly reproducible fashion."}],"issue":"7404","type":"journal_article","date_published":"2012-06-28T00:00:00Z","page":"537 - 540","publication":"Nature","citation":{"chicago":"Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.” Nature. Nature Publishing Group, 2012. https://doi.org/10.1038/nature11219.","short":"L. Diaz Jr, R. Williams, J. Wu, I. Kinde, J. Hecht, J. Berlin, B. Allen, I. Božić, J. Reiter, M. Nowak, K. Kinzler, K. Oliner, B. Vogelstein, Nature 486 (2012) 537–540.","mla":"Diaz Jr, Luis, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.” Nature, vol. 486, no. 7404, Nature Publishing Group, 2012, pp. 537–40, doi:10.1038/nature11219.","apa":"Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J., … Vogelstein, B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. Nature Publishing Group. https://doi.org/10.1038/nature11219","ieee":"L. Diaz Jr et al., “The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers,” Nature, vol. 486, no. 7404. Nature Publishing Group, pp. 537–540, 2012.","ista":"Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Božić I, Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. 486(7404), 537–540.","ama":"Diaz Jr L, Williams R, Wu J, et al. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. 2012;486(7404):537-540. doi:10.1038/nature11219"},"day":"28","scopus_import":1},{"date_published":"2012-02-01T00:00:00Z","publication":"Theoretical Population Biology","citation":{"chicago":"Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.” Theoretical Population Biology. Academic Press, 2012. https://doi.org/10.1016/j.tpb.2011.11.003.","short":"K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.” Theoretical Population Biology, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:10.1016/j.tpb.2011.11.003.","apa":"Chatterjee, K., Reiter, J., & Nowak, M. (2012). Evolutionary dynamics of biological auctions. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2011.11.003","ieee":"K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” Theoretical Population Biology, vol. 81, no. 1. Academic Press, pp. 69–80, 2012.","ista":"Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.","ama":"Chatterjee K, Reiter J, Nowak M. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 2012;81(1):69-80. doi:10.1016/j.tpb.2011.11.003"},"page":"69 - 80","day":"01","scopus_import":1,"oa_version":"Submitted Version","_id":"3260","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Evolutionary dynamics of biological auctions","status":"public","intvolume":" 81","abstract":[{"text":"Many scenarios in the living world, where individual organisms compete for winning positions (or resources), have properties of auctions. Here we study the evolution of bids in biological auctions. For each auction, n individuals are drawn at random from a population of size N. Each individual makes a bid which entails a cost. The winner obtains a benefit of a certain value. Costs and benefits are translated into reproductive success (fitness). Therefore, successful bidding strategies spread in the population. We compare two types of auctions. In “biological all-pay auctions”, the costs are the bid for every participating individual. In “biological second price all-pay auctions”, the cost for everyone other than the winner is the bid, but the cost for the winner is the second highest bid. Second price all-pay auctions are generalizations of the “war of attrition” introduced by Maynard Smith. We study evolutionary dynamics in both types of auctions. We calculate pairwise invasion plots and evolutionarily stable distributions over the continuous strategy space. We find that the average bid in second price all-pay auctions is higher than in all-pay auctions, but the average cost for the winner is similar in both auctions. In both cases, the average bid is a declining function of the number of participants, n. The more individuals participate in an auction the smaller is the chance of winning, and thus expensive bids must be avoided.\r\n","lang":"eng"}],"issue":"1","type":"journal_article","doi":"10.1016/j.tpb.2011.11.003","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ ","open_access":"1"}],"oa":1,"external_id":{"pmid":["22120126"]},"quality_controlled":"1","project":[{"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","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"month":"02","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Reiter, Johannes","first_name":"Johannes","last_name":"Reiter","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0170-7353"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1400"}]},"date_updated":"2023-09-07T11:40:43Z","date_created":"2018-12-11T12:02:19Z","volume":81,"year":"2012","pmid":1,"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Academic Press","ec_funded":1,"publist_id":"3388"},{"day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2012-04-01T00:00:00Z","article_type":"original","page":"600 - 606","publication":"Nature Neuroscience","citation":{"ista":"Kim S, Guzmán J, Hu H, Jonas PM. 2012. Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. Nature Neuroscience. 15(4), 600–606.","ieee":"S. Kim, J. Guzmán, H. Hu, and P. M. Jonas, “Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons,” Nature Neuroscience, vol. 15, no. 4. Nature Publishing Group, pp. 600–606, 2012.","apa":"Kim, S., Guzmán, J., Hu, H., & Jonas, P. M. (2012). Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.3060","ama":"Kim S, Guzmán J, Hu H, Jonas PM. Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. Nature Neuroscience. 2012;15(4):600-606. doi:10.1038/nn.3060","chicago":"Kim, Sooyun, José Guzmán, Hua Hu, and Peter M Jonas. “Active Dendrites Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal Neurons.” Nature Neuroscience. Nature Publishing Group, 2012. https://doi.org/10.1038/nn.3060.","mla":"Kim, Sooyun, et al. “Active Dendrites Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal Neurons.” Nature Neuroscience, vol. 15, no. 4, Nature Publishing Group, 2012, pp. 600–06, doi:10.1038/nn.3060.","short":"S. Kim, J. Guzmán, H. Hu, P.M. Jonas, Nature Neuroscience 15 (2012) 600–606."},"abstract":[{"text":"CA3 pyramidal neurons are important for memory formation and pattern completion in the hippocampal network. It is generally thought that proximal synapses from the mossy fibers activate these neurons most efficiently, whereas distal inputs from the perforant path have a weaker modulatory influence. We used confocally targeted patch-clamp recording from dendrites and axons to map the activation of rat CA3 pyramidal neurons at the subcellular level. Our results reveal two distinct dendritic domains. In the proximal domain, action potentials initiated in the axon backpropagate actively with large amplitude and fast time course. In the distal domain, Na+ channel–mediated dendritic spikes are efficiently initiated by waveforms mimicking synaptic events. CA3 pyramidal neuron dendrites showed a high Na+-to-K+ conductance density ratio, providing ideal conditions for active backpropagation and dendritic spike initiation. Dendritic spikes may enhance the computational power of CA3 pyramidal neurons in the hippocampal network.","lang":"eng"}],"issue":"4","type":"journal_article","oa_version":"Published Version","status":"public","title":"Active dendrites support efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons","intvolume":" 15","_id":"3258","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"04","publication_identifier":{"issn":["1546-1726"]},"language":[{"iso":"eng"}],"doi":"10.1038/nn.3060","quality_controlled":"1","project":[{"_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","grant_number":"SFB-TR3-TP10B","name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen"}],"external_id":{"pmid":["22388958"]},"oa":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3617474/"}],"publist_id":"3390","date_updated":"2023-09-07T11:43:52Z","date_created":"2018-12-11T12:02:18Z","volume":15,"author":[{"last_name":"Kim","first_name":"Sooyun","id":"394AB1C8-F248-11E8-B48F-1D18A9856A87","full_name":"Kim, Sooyun"},{"id":"30CC5506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2209-5242","first_name":"José","last_name":"Guzmán","full_name":"Guzmán, José"},{"first_name":"Hua","last_name":"Hu","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","full_name":"Hu, Hua"},{"full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M"}],"related_material":{"record":[{"id":"2964","relation":"dissertation_contains","status":"public"}]},"publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"PeJo"}],"year":"2012","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (TR 3/B10) and the European Union (European Research Council Advanced grant to P.J.).","pmid":1},{"month":"06","day":"01","publication_identifier":{"issn":["2663-337X"]},"article_processing_charge":"No","date_published":"2012-06-01T00:00:00Z","degree_awarded":"PhD","supervisor":[{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M"}],"language":[{"iso":"eng"}],"citation":{"apa":"Kim, S. (2012). Active properties of hippocampal CA3 pyramidal neuron dendrites. Institute of Science and Technology Austria.","ieee":"S. Kim, “Active properties of hippocampal CA3 pyramidal neuron dendrites,” Institute of Science and Technology Austria, 2012.","ista":"Kim S. 2012. Active properties of hippocampal CA3 pyramidal neuron dendrites. Institute of Science and Technology Austria.","ama":"Kim S. Active properties of hippocampal CA3 pyramidal neuron dendrites. 2012.","chicago":"Kim, Sooyun. “Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites.” Institute of Science and Technology Austria, 2012.","short":"S. Kim, Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites, Institute of Science and Technology Austria, 2012.","mla":"Kim, Sooyun. Active Properties of Hippocampal CA3 Pyramidal Neuron Dendrites. Institute of Science and Technology Austria, 2012."},"page":"65","abstract":[{"text":"CA3 pyramidal neurons are important for memory formation and pattern completion in the hippocampal network. These neurons receive multiple excitatory inputs from numerous sources. Therefore, the rules of spatiotemporal integration of multiple synaptic inputs and propagation of action potentials are important to understand how CA3 neurons contribute to higher brain functions at cellular level. By using confocally targeted patch-clamp recording techniques, we investigated the biophysical properties of rat CA3 pyramidal neuron dendrites. We found two distinct dendritic domains critical for action potential initiation and propagation: In the proximal domain, action potentials initiated in the axon backpropagate actively with large amplitude and fast time course. In the distal domain, Na+-channel mediated dendritic spikes are efficiently evoked by local dendritic depolarization or waveforms mimicking synaptic events. These findings can be explained by a high Na+-to-K+ conductance density ratio of CA3 pyramidal neuron dendrites. The results challenge the prevailing view that proximal mossy fiber inputs activate CA3 pyramidal neurons more efficiently than distal perforant inputs by showing that the distal synapses trigger a different form of activity represented by dendritic spikes. The high probability of dendritic spike initiation in the distal area may enhance the computational power of CA3 pyramidal neurons in the hippocampal network. ","lang":"eng"}],"publist_id":"3755","type":"dissertation","alternative_title":["ISTA Thesis"],"author":[{"full_name":"Kim, Sooyun","last_name":"Kim","first_name":"Sooyun","id":"394AB1C8-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"3258","relation":"part_of_dissertation","status":"public"}]},"date_updated":"2023-09-07T11:43:51Z","date_created":"2018-12-11T12:00:35Z","oa_version":"None","_id":"2964","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","year":"2012","title":"Active properties of hippocampal CA3 pyramidal neuron dendrites","status":"public","publication_status":"published","department":[{"_id":"PeJo"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria"},{"title":"Cell adhesion in embryo morphogenesis","publication_status":"published","status":"public","intvolume":" 24","department":[{"_id":"CaHe"}],"publisher":"Elsevier","year":"2012","_id":"3246","acknowledgement":"This review comes from a themed issue on Cell structure and dynamics Edited by Jason Swedlow and Gaudenz Danuser","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-07T12:05:08Z","date_created":"2018-12-11T12:02:14Z","volume":24,"oa_version":"None","author":[{"first_name":"Vanessa","last_name":"Barone","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2676-3367","full_name":"Barone, Vanessa"},{"full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"961","status":"public","relation":"dissertation_contains"}]},"type":"journal_article","abstract":[{"text":"Visualizing and analyzing shape changes at various scales, ranging from single molecules to whole organisms, are essential for understanding complex morphogenetic processes, such as early embryonic development. Embryo morphogenesis relies on the interplay between different tissues, the properties of which are again determined by the interaction between their constituent cells. Cell interactions, on the other hand, are controlled by various molecules, such as signaling and adhesion molecules, which in order to exert their functions need to be spatiotemporally organized within and between the interacting cells. In this review, we will focus on the role of cell adhesion functioning at different scales to organize cell, tissue and embryo morphogenesis. We will specifically ask how the subcellular distribution of adhesion molecules controls the formation of cell-cell contacts, how cell-cell contacts determine tissue shape, and how tissue interactions regulate embryo morphogenesis.","lang":"eng"}],"publist_id":"3423","issue":"1","quality_controlled":"1","page":"148 - 153","publication":"Current Opinion in Cell Biology","citation":{"chicago":"Barone, Vanessa, and Carl-Philipp J Heisenberg. “Cell Adhesion in Embryo Morphogenesis.” Current Opinion in Cell Biology. Elsevier, 2012. https://doi.org/10.1016/j.ceb.2011.11.006.","short":"V. Barone, C.-P.J. Heisenberg, Current Opinion in Cell Biology 24 (2012) 148–153.","mla":"Barone, Vanessa, and Carl-Philipp J. Heisenberg. “Cell Adhesion in Embryo Morphogenesis.” Current Opinion in Cell Biology, vol. 24, no. 1, Elsevier, 2012, pp. 148–53, doi:10.1016/j.ceb.2011.11.006.","apa":"Barone, V., & Heisenberg, C.-P. J. (2012). Cell adhesion in embryo morphogenesis. Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2011.11.006","ieee":"V. Barone and C.-P. J. Heisenberg, “Cell adhesion in embryo morphogenesis,” Current Opinion in Cell Biology, vol. 24, no. 1. Elsevier, pp. 148–153, 2012.","ista":"Barone V, Heisenberg C-PJ. 2012. Cell adhesion in embryo morphogenesis. Current Opinion in Cell Biology. 24(1), 148–153.","ama":"Barone V, Heisenberg C-PJ. Cell adhesion in embryo morphogenesis. Current Opinion in Cell Biology. 2012;24(1):148-153. doi:10.1016/j.ceb.2011.11.006"},"language":[{"iso":"eng"}],"date_published":"2012-02-01T00:00:00Z","doi":"10.1016/j.ceb.2011.11.006","scopus_import":1,"day":"01","month":"02"},{"author":[{"full_name":"Ibarra, Christian A.","last_name":"Ibarra","first_name":"Christian A."},{"full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","last_name":"Feng","first_name":"Xiaoqi"},{"first_name":"Vera K.","last_name":"Schoft","full_name":"Schoft, Vera K."},{"full_name":"Hsieh, Tzung-Fu","first_name":"Tzung-Fu","last_name":"Hsieh"},{"full_name":"Uzawa, Rie","last_name":"Uzawa","first_name":"Rie"},{"full_name":"Rodrigues, Jessica A.","last_name":"Rodrigues","first_name":"Jessica A."},{"last_name":"Zemach","first_name":"Assaf","full_name":"Zemach, Assaf"},{"full_name":"Chumak, Nina","first_name":"Nina","last_name":"Chumak"},{"full_name":"Machlicova, Adriana","last_name":"Machlicova","first_name":"Adriana"},{"last_name":"Nishimura","first_name":"Toshiro","full_name":"Nishimura, Toshiro"},{"full_name":"Rojas, Denisse","first_name":"Denisse","last_name":"Rojas"},{"full_name":"Fischer, Robert L.","first_name":"Robert L.","last_name":"Fischer"},{"first_name":"Hisashi","last_name":"Tamaru","full_name":"Tamaru, Hisashi"},{"full_name":"Zilberman, Daniel","last_name":"Zilberman","first_name":"Daniel"}],"volume":337,"date_updated":"2023-10-16T09:27:26Z","date_created":"2023-01-16T09:21:24Z","pmid":1,"year":"2012","acknowledgement":"We thank S. Harmer for assistance with the analysis of histone modifications, the BioOptics team at the Vienna Biocenter Campus for sorting sperm and vegetative cell nuclei, K. Slotkin for the LAT52p-amiRNA=GFP plasmid, and G. Drews for the DD45p-GFP transgenic line. This work was partially funded by an NIH grant (GM69415) to R.L.F., NSF grants (MCB-0918821 and IOS-1025890) to R.L.F. and D.Z., a Young Investigator Grant from the Arnold and Mabel Beckman Foundation to D.Z., an Austrian Science Fund (FWF) grant P21389-B03 to H.T., a Ruth L. Kirschstein NIH Predoctoral Fellowship (GM093633) to C.A.I., a Fulbright Scholarship to J.A.R., a fellowship from the Jane Coffin Childs Memorial Fund to A.Z., and a Robert and Colleen Haas Scholarship to D.R. Sequencing data are deposited in GEO (GSE38935).","department":[{"_id":"XiFe"}],"publisher":"American Association for the Advancement of Science","publication_status":"published","doi":"10.1126/science.1224839","language":[{"iso":"eng"}],"external_id":{"pmid":["22984074"]},"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4034762/","open_access":"1"}],"oa":1,"quality_controlled":"1","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"month":"09","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12198","intvolume":" 337","status":"public","title":"Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes","issue":"6100","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"}],"type":"journal_article","date_published":"2012-09-14T00:00:00Z","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.","ieee":"C. A. Ibarra et al., “Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes,” Science, vol. 337, no. 6100. American Association for the Advancement of Science, pp. 1360–1364, 2012.","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. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1224839","ama":"Ibarra CA, Feng X, Schoft VK, et al. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. Science. 2012;337(6100):1360-1364. doi:10.1126/science.1224839","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.” Science. American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1224839.","mla":"Ibarra, Christian A., et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” Science, vol. 337, no. 6100, American Association for the Advancement of Science, 2012, pp. 1360–64, doi:10.1126/science.1224839.","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."},"publication":"Science","page":"1360-1364","article_type":"original","article_processing_charge":"No","day":"14","scopus_import":"1","keyword":["Multidisciplinary"]},{"abstract":[{"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.","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"Published Version","status":"public","title":"Elementary solutions of the Bernstein problem on two intervals","intvolume":" 8","_id":"6588","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2012-01-01T00:00:00Z","article_type":"original","page":"63-78","publication":"Journal of Mathematical Physics, Analysis, Geometry","citation":{"ieee":"F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,” Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1. B. Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.","apa":"Pausinger, F. (2012). Elementary solutions of the Bernstein problem on two intervals. Journal of Mathematical Physics, Analysis, Geometry. B. Verkin Institute for Low Temperature Physics and Engineering.","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. Journal of Mathematical Physics, Analysis, Geometry. 2012;8(1):63-78.","chicago":"Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two Intervals.” Journal of Mathematical Physics, Analysis, Geometry. B. Verkin Institute for Low Temperature Physics and Engineering, 2012.","short":"F. Pausinger, Journal of Mathematical Physics, Analysis, Geometry 8 (2012) 63–78.","mla":"Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two Intervals.” Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1, B. Verkin Institute for Low Temperature Physics and Engineering, 2012, pp. 63–78."},"date_created":"2019-06-27T08:16:56Z","date_updated":"2023-10-16T09:41:31Z","volume":8,"author":[{"first_name":"Florian","last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian"}],"publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"B. Verkin Institute for Low Temperature Physics and Engineering","year":"2012","acknowledgement":"This work is supported by the Austrian Science Fund (FWF), Project P22025-N18.\r\n","month":"01","publication_identifier":{"issn":["1812-9471"]},"language":[{"iso":"eng"}],"isi":1,"quality_controlled":"1","main_file_link":[{"url":"http://mi.mathnet.ru/eng/jmag525","open_access":"1"}],"oa":1,"external_id":{"isi":["000301173600004"]}},{"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"month":"05","oa":1,"quality_controlled":"1","doi":"10.1111/j.1467-8659.2012.03062.x","conference":{"name":"EUROGRAPHICS: Conference on European Association for Computer Graphics","start_date":"2012-05-13","location":"Cagliari, Sardinia, Italy","end_date":"2012-05-18"},"language":[{"iso":"eng"}],"publist_id":"3576","file_date_updated":"2020-07-14T12:46:00Z","acknowledgement":"This work was funded by NSF grant IIS-1017014 and CCF- 0917093.","year":"2012","department":[{"_id":"ChWo"}],"publisher":"Wiley","publication_status":"published","author":[{"first_name":"Jihun","last_name":"Yu","full_name":"Yu, Jihun"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan"},{"last_name":"Turk","first_name":"Greg","full_name":"Turk, Greg"},{"last_name":"Yap","first_name":"Chee","full_name":"Yap, Chee"}],"volume":31,"date_updated":"2023-10-16T09:54:40Z","date_created":"2018-12-11T12:01:31Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","citation":{"ieee":"J. Yu, C. Wojtan, G. Turk, and C. Yap, “Explicit mesh surfaces for particle based fluids,” in Computer Graphics Forum, Cagliari, Sardinia, Italy, 2012, vol. 31, no. 2, pp. 815–824.","apa":"Yu, J., Wojtan, C., Turk, G., & Yap, C. (2012). Explicit mesh surfaces for particle based fluids. In Computer Graphics Forum (Vol. 31, pp. 815–824). Cagliari, Sardinia, Italy: Wiley. https://doi.org/10.1111/j.1467-8659.2012.03062.x","ista":"Yu J, Wojtan C, Turk G, Yap C. 2012. Explicit mesh surfaces for particle based fluids. Computer Graphics Forum. EUROGRAPHICS: Conference on European Association for Computer Graphics, Eurographics, vol. 31, 815–824.","ama":"Yu J, Wojtan C, Turk G, Yap C. Explicit mesh surfaces for particle based fluids. In: Computer Graphics Forum. Vol 31. Wiley; 2012:815-824. doi:10.1111/j.1467-8659.2012.03062.x","chicago":"Yu, Jihun, Chris Wojtan, Greg Turk, and Chee Yap. “Explicit Mesh Surfaces for Particle Based Fluids.” In Computer Graphics Forum, 31:815–24. Wiley, 2012. https://doi.org/10.1111/j.1467-8659.2012.03062.x.","short":"J. Yu, C. Wojtan, G. Turk, C. Yap, in:, Computer Graphics Forum, Wiley, 2012, pp. 815–824.","mla":"Yu, Jihun, et al. “Explicit Mesh Surfaces for Particle Based Fluids.” Computer Graphics Forum, vol. 31, no. 2, Wiley, 2012, pp. 815–24, doi:10.1111/j.1467-8659.2012.03062.x."},"publication":"Computer Graphics Forum","page":"815 - 824","date_published":"2012-05-01T00:00:00Z","type":"conference","alternative_title":["Eurographics"],"issue":"2","abstract":[{"lang":"eng","text":"We introduce the idea of using an explicit triangle mesh to track the air/fluid interface in a smoothed particle hydrodynamics (SPH) simulator. Once an initial surface mesh is created, this mesh is carried forward in time using nearby particle velocities to advect the mesh vertices. The mesh connectivity remains mostly unchanged across time-steps; it is only modified locally for topology change events or for the improvement of triangle quality. In order to ensure that the surface mesh does not diverge from the underlying particle simulation, we periodically project the mesh surface onto an implicit surface defined by the physics simulation. The mesh surface gives us several advantages over previous SPH surface tracking techniques. We demonstrate a new method for surface tension calculations that clearly outperforms the state of the art in SPH surface tension for computer graphics. We also demonstrate a method for tracking detailed surface information (like colors) that is less susceptible to numerical diffusion than competing techniques. Finally, our temporally-coherent surface mesh allows us to simulate high-resolution surface wave dynamics without being limited by the particle resolution of the SPH simulation."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3123","intvolume":" 31","title":"Explicit mesh surfaces for particle based fluids","ddc":["000"],"status":"public","pubrep_id":"601","oa_version":"Submitted Version","file":[{"file_id":"5092","relation":"main_file","checksum":"acb325dd1e31859bedd30e013f61d0b9","date_created":"2018-12-12T10:14:39Z","date_updated":"2020-07-14T12:46:00Z","access_level":"open_access","file_name":"IST-2016-601-v1+1_meshSPH.pdf","creator":"system","content_type":"application/pdf","file_size":5740527}]},{"intvolume":" 64","title":"Die Zeit des Abwartens ist vorbei!","status":"public","_id":"3244","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","popular_science":"1","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"Bibliothekare haben die Aufgabe, sich mit neuen Medienformen auseinanderzusetzen.\r\n"}],"page":"284","article_type":"letter_note","citation":{"ieee":"P. Danowski, “Die Zeit des Abwartens ist vorbei!,” BuB - Forum Bibliothek und Information, vol. 64, no. 4. Fachzeitschrift des BIB – Berufsverband Information Bibliothek, p. 284, 2012.","apa":"Danowski, P. (2012). Die Zeit des Abwartens ist vorbei! BuB - Forum Bibliothek und Information. Fachzeitschrift des BIB – Berufsverband Information Bibliothek.","ista":"Danowski P. 2012. Die Zeit des Abwartens ist vorbei! BuB - Forum Bibliothek und Information. 64(4), 284.","ama":"Danowski P. Die Zeit des Abwartens ist vorbei! BuB - Forum Bibliothek und Information. 2012;64(4):284.","chicago":"Danowski, Patrick. “Die Zeit des Abwartens ist vorbei!” BuB - Forum Bibliothek und Information. Fachzeitschrift des BIB – Berufsverband Information Bibliothek, 2012.","short":"P. Danowski, BuB - Forum Bibliothek und Information 64 (2012) 284.","mla":"Danowski, Patrick. “Die Zeit des Abwartens ist vorbei!” BuB - Forum Bibliothek und Information, vol. 64, no. 4, Fachzeitschrift des BIB – Berufsverband Information Bibliothek, 2012, p. 284."},"publication":"BuB - Forum Bibliothek und Information","date_published":"2012-04-15T00:00:00Z","article_processing_charge":"No","day":"15","department":[{"_id":"E-Lib"}],"publisher":"Fachzeitschrift des BIB – Berufsverband Information Bibliothek","publication_status":"published","year":"2012","volume":64,"date_updated":"2023-10-16T10:19:14Z","date_created":"2018-12-11T12:02:13Z","author":[{"last_name":"Danowski","first_name":"Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","full_name":"Danowski, Patrick"}],"publist_id":"3432","oa":1,"main_file_link":[{"open_access":"1","url":"https://www.b-u-b.de/fileadmin/archiv/imports/pdf_files/2012/bub_2012_04_284.pdf"}],"language":[{"iso":"ger"}],"publication_identifier":{"issn":["1869 -1137"]},"month":"04"},{"publist_id":"3433","volume":2012,"date_updated":"2023-10-16T10:40:18Z","date_created":"2018-12-11T12:02:13Z","author":[{"id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6026-4409","first_name":"Patrick","last_name":"Danowski","full_name":"Danowski, Patrick"}],"department":[{"_id":"E-Lib"}],"publisher":"Büchereiverband Österreichs","publication_status":"published","year":"2012","publication_identifier":{"issn":["1607-7172"]},"month":"03","language":[{"iso":"ger"}],"oa":1,"main_file_link":[{"url":"https://www.bvoe.at/sites/default/files/2022-07/BP_1_12.pdf","open_access":"1"}],"issue":"1","abstract":[{"text":"Wie wandelt sich das Berufsbild in Wissenschaftlichen Bibliotheken? Patrick Danowski gibt seine Einschätzung ab. ","lang":"eng"}],"type":"journal_article","oa_version":"Published Version","popular_science":"1","intvolume":" 2012","title":"Zwischen Technologie und Information","status":"public","_id":"3243","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"01","date_published":"2012-03-01T00:00:00Z","page":"11","article_type":"letter_note","citation":{"ama":"Danowski P. Zwischen Technologie und Information. Büchereiperspektiven. 2012;2012(1):11.","apa":"Danowski, P. (2012). Zwischen Technologie und Information. Büchereiperspektiven. Büchereiverband Österreichs.","ieee":"P. Danowski, “Zwischen Technologie und Information,” Büchereiperspektiven, vol. 2012, no. 1. Büchereiverband Österreichs, p. 11, 2012.","ista":"Danowski P. 2012. Zwischen Technologie und Information. Büchereiperspektiven. 2012(1), 11.","short":"P. Danowski, Büchereiperspektiven 2012 (2012) 11.","mla":"Danowski, Patrick. “Zwischen Technologie und Information.” Büchereiperspektiven, vol. 2012, no. 1, Büchereiverband Österreichs, 2012, p. 11.","chicago":"Danowski, Patrick. “Zwischen Technologie und Information.” Büchereiperspektiven. Büchereiverband Österreichs, 2012."},"publication":"Büchereiperspektiven"},{"article_processing_charge":"No","day":"11","month":"10","date_published":"2012-10-11T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ista":"Kroemer O, Lampert C, Peters J. 2012. Multi-modal learning for dynamic tactile sensing","ieee":"O. Kroemer, C. Lampert, and J. Peters, “Multi-modal learning for dynamic tactile sensing,” 2012.","apa":"Kroemer, O., Lampert, C., & Peters, J. (2012). Multi-modal learning for dynamic tactile sensing. Deutsches Zentrum für Luft und Raumfahrt.","ama":"Kroemer O, Lampert C, Peters J. Multi-modal learning for dynamic tactile sensing. In: Deutsches Zentrum für Luft und Raumfahrt; 2012.","chicago":"Kroemer, Oliver, Christoph Lampert, and Jan Peters. “Multi-Modal Learning for Dynamic Tactile Sensing.” Deutsches Zentrum für Luft und Raumfahrt, 2012.","mla":"Kroemer, Oliver, et al. Multi-Modal Learning for Dynamic Tactile Sensing. Deutsches Zentrum für Luft und Raumfahrt, 2012.","short":"O. Kroemer, C. Lampert, J. Peters, in:, Deutsches Zentrum für Luft und Raumfahrt, 2012."},"quality_controlled":"1","publist_id":"3828","type":"conference","author":[{"full_name":"Kroemer, Oliver","first_name":"Oliver","last_name":"Kroemer"},{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Peters","full_name":"Peters, Jan"}],"oa_version":"None","date_updated":"2023-10-17T07:58:59Z","date_created":"2018-12-11T12:00:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2915","year":"2012","acknowledgement":"The project receives funding from the European Community’s Seventh Framework Programme under grant agreement\r\nno. ICT- 248273 GeRT.","department":[{"_id":"ChLa"}],"publisher":"Deutsches Zentrum für Luft und Raumfahrt","status":"public","publication_status":"published","title":"Multi-modal learning for dynamic tactile sensing"},{"language":[{"iso":"eng"}],"doi":"10.4213/rm9503","date_published":"2012-10-01T00:00:00Z","quality_controlled":"1","page":"1167–1168","publication":"Russian Mathematical Surveys","citation":{"ama":"Edelsbrunner H, Strelkova N. On the configuration space for the shortest networks. Russian Mathematical Surveys. 2012;67(6):1167–1168. doi:10.4213/rm9503","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space for the shortest networks. Russian Mathematical Surveys. 67(6), 1167–1168.","apa":"Edelsbrunner, H., & Strelkova, N. (2012). On the configuration space for the shortest networks. Russian Mathematical Surveys. Russian Academy of Sciences. https://doi.org/10.4213/rm9503","ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” Russian Mathematical Surveys, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012.","mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” Russian Mathematical Surveys, vol. 67, no. 6, Russian Academy of Sciences, 2012, pp. 1167–1168, doi:10.4213/rm9503.","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” Russian Mathematical Surveys. Russian Academy of Sciences, 2012. https://doi.org/10.4213/rm9503."},"day":"01","month":"10","article_processing_charge":"No","date_updated":"2023-10-17T11:40:39Z","date_created":"2018-12-11T12:00:18Z","oa_version":"None","volume":67,"author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Strelkova, Nataliya","first_name":"Nataliya","last_name":"Strelkova"}],"title":"On the configuration space for the shortest networks","status":"public","publication_status":"published","publisher":"Russian Academy of Sciences","intvolume":" 67","department":[{"_id":"HeEd"}],"_id":"2912","year":"2012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"3831","issue":"6","type":"journal_article"},{"title":"The most persistent soft-clique in a set of sampled graphs","publication_status":"published","status":"public","publisher":"ML Research Press","department":[{"_id":"ChLa"},{"_id":"HeEd"}],"_id":"3127","year":"2012","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:01:33Z","date_updated":"2023-10-17T11:55:06Z","oa_version":"Preprint","author":[{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"},{"full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","first_name":"Chao","last_name":"Chen"}],"type":"conference","abstract":[{"text":"When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques.\r\n We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data, we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations.","lang":"eng"}],"publist_id":"3572","quality_controlled":"1","page":"211-218","publication":"Proceedings of the 29th International Conference on Machine Learning","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1206.4652"}],"citation":{"mla":"Quadrianto, Novi, et al. “The Most Persistent Soft-Clique in a Set of Sampled Graphs.” Proceedings of the 29th International Conference on Machine Learning, ML Research Press, 2012, pp. 211–18.","short":"N. Quadrianto, C. Lampert, C. Chen, in:, Proceedings of the 29th International Conference on Machine Learning, ML Research Press, 2012, pp. 211–218.","chicago":"Quadrianto, Novi, Christoph Lampert, and Chao Chen. “The Most Persistent Soft-Clique in a Set of Sampled Graphs.” In Proceedings of the 29th International Conference on Machine Learning, 211–18. ML Research Press, 2012.","ama":"Quadrianto N, Lampert C, Chen C. The most persistent soft-clique in a set of sampled graphs. In: Proceedings of the 29th International Conference on Machine Learning. ML Research Press; 2012:211-218.","ista":"Quadrianto N, Lampert C, Chen C. 2012. The most persistent soft-clique in a set of sampled graphs. Proceedings of the 29th International Conference on Machine Learning. ICML: International Conference on Machine Learning, 211–218.","ieee":"N. Quadrianto, C. Lampert, and C. Chen, “The most persistent soft-clique in a set of sampled graphs,” in Proceedings of the 29th International Conference on Machine Learning, Edinburgh, United Kingdom, 2012, pp. 211–218.","apa":"Quadrianto, N., Lampert, C., & Chen, C. (2012). The most persistent soft-clique in a set of sampled graphs. In Proceedings of the 29th International Conference on Machine Learning (pp. 211–218). Edinburgh, United Kingdom: ML Research Press."},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"ICML: International Conference on Machine Learning","location":"Edinburgh, United Kingdom","start_date":"2012-06-26","end_date":"2012-07-01"},"date_published":"2012-06-01T00:00:00Z","scopus_import":"1","day":"01","month":"06","article_processing_charge":"No"},{"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.5802/jtnb.819","publication_identifier":{"eissn":["2118-8572"],"issn":["1246-7405"]},"month":"01","department":[{"_id":"HeEd"}],"publisher":"Université de Bordeaux","publication_status":"published","year":"2012","volume":24,"date_updated":"2023-10-18T07:53:47Z","date_created":"2018-12-11T12:00:15Z","author":[{"first_name":"Florian","last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian"}],"publist_id":"3843","file_date_updated":"2020-07-14T12:45:52Z","page":"729 - 749","article_type":"original","citation":{"short":"F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.","mla":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” Journal de Theorie Des Nombres Des Bordeaux, vol. 24, no. 3, Université de Bordeaux, 2012, pp. 729–49, doi:10.5802/jtnb.819.","chicago":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” Journal de Theorie Des Nombres Des Bordeaux. Université de Bordeaux, 2012. https://doi.org/10.5802/jtnb.819.","ama":"Pausinger F. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 2012;24(3):729-749. doi:10.5802/jtnb.819","ieee":"F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” Journal de Theorie des Nombres des Bordeaux, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012.","apa":"Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. Journal de Theorie Des Nombres Des Bordeaux. Université de Bordeaux. https://doi.org/10.5802/jtnb.819","ista":"Pausinger F. 2012. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 24(3), 729–749."},"publication":"Journal de Theorie des Nombres des Bordeaux","date_published":"2012-01-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","intvolume":" 24","ddc":["510"],"title":"Weak multipliers for generalized van der Corput sequences","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2904","file":[{"file_size":819275,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"JTNB_2012__24_3_729_0.pdf","checksum":"6954bfe9d7f4119fbdda7a11cf0f5c67","date_created":"2020-05-11T12:40:39Z","date_updated":"2020-07-14T12:45:52Z","relation":"main_file","file_id":"7819"}],"oa_version":"Published Version","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P(i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b - 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences."},{"text":"Les suites de Van der Corput généralisées sont dessuites unidimensionnelles et infinies dans l’intervalle de l’unité.Elles sont générées par permutations des entiers de la basebetsont les éléments constitutifs des suites multi-dimensionnelles deHalton. Suites aux progrès récents d’Atanassov concernant le com-portement de distribution uniforme des suites de Halton nous nousintéressons aux permutations de la formuleP(i) =ai(modb)pour les entiers premiers entre euxaetb. Dans cet article nousidentifions des multiplicateursagénérant des suites de Van derCorput ayant une mauvaise distribution. Nous donnons les bornesinférieures explicites pour cette distribution asymptotique asso-ciée à ces suites et relions ces dernières aux suites générées parpermutation d’identité, qui sont, selon Faure, les moins bien dis-tribuées des suites généralisées de Van der Corput dans une basedonnée.","lang":"fre"}]},{"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Musin, Oleg","first_name":"Oleg","last_name":"Musin"},{"full_name":"Ukhalov, Alexey","last_name":"Ukhalov","first_name":"Alexey"},{"first_name":"Olga","last_name":"Yakimova","full_name":"Yakimova, Olga"},{"last_name":"Alexeev","first_name":"Vladislav","full_name":"Alexeev, Vladislav"},{"full_name":"Bogaevskaya, Victoriya","last_name":"Bogaevskaya","first_name":"Victoriya"},{"full_name":"Gorohov, Andrey","first_name":"Andrey","last_name":"Gorohov"},{"first_name":"Margarita","last_name":"Preobrazhenskaya","full_name":"Preobrazhenskaya, Margarita"}],"volume":19,"oa_version":"Published Version","date_updated":"2023-10-18T07:34:45Z","date_created":"2018-12-11T12:00:15Z","_id":"2902","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2012","department":[{"_id":"HeEd"}],"publisher":"Russian Academy of Sciences","intvolume":" 19","publication_status":"published","status":"public","title":"Fractal and computational geometry for generalizing cartographic objects","publist_id":"3845","issue":"6","abstract":[{"lang":"eng","text":"We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm. "}],"type":"journal_article","date_published":"2012-12-01T00:00:00Z","language":[{"iso":"rus"}],"main_file_link":[{"url":"http://mi.mathnet.ru/eng/mais280","open_access":"1"}],"citation":{"ista":"Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.","ieee":"H. Edelsbrunner et al., “Fractal and computational geometry for generalizing cartographic objects,” Modeling and Analysis of Information Systems, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012.","apa":"Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V., … Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. Russian Academy of Sciences.","ama":"Edelsbrunner H, Musin O, Ukhalov A, et al. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 2012;19(6):152-160.","chicago":"Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya. “Fractal and computational geometry for generalizing cartographic objects.” Modeling and Analysis of Information Systems. Russian Academy of Sciences, 2012.","mla":"Edelsbrunner, Herbert, et al. “Fractal and computational geometry for generalizing cartographic objects.” Modeling and Analysis of Information Systems, vol. 19, no. 6, Russian Academy of Sciences, 2012, pp. 152–60.","short":"H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems 19 (2012) 152–160."},"oa":1,"publication":"Modeling and Analysis of Information Systems","page":"152 - 160","article_type":"original","quality_controlled":"1","article_processing_charge":"No","month":"12","day":"01"}]