[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"A synthetic route for producing Cu 2ZnGeSe 4 nanocrystals with narrow size distributions and controlled composition is presented. These nanocrystals were used to produce densely packed nanomaterials by hot-pressing. From the characterization of the thermoelectric properties of these nanomaterials, Cu 2ZnGeSe 4 is demonstrated to show excellent thermoelectric properties. A very preliminary adjustment of the nanocrystal composition has already resulted in a figure of merit of up to 0.55 at 450°C. ","lang":"eng"}],"language":[{"iso":"eng"}],"oa":1,"year":"2012","status":"public","oa_version":"None","author":[{"orcid":"0000-0001-5013-2843","last_name":"Ibáñez","full_name":"Ibáñez, Maria","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zamani, Reza","last_name":"Zamani","first_name":"Reza"},{"full_name":"Lalonde, Aaron","last_name":"Lalonde","first_name":"Aaron"},{"full_name":"Cadavid, Doris","last_name":"Cadavid","first_name":"Doris"},{"first_name":"Wenhua","full_name":"Li, Wenhua","last_name":"Li"},{"first_name":"Alexey","full_name":"Shavel, Alexey","last_name":"Shavel"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"first_name":"Joan","full_name":"Morante, Joan","last_name":"Morante"},{"last_name":"Gorsse","full_name":"Gorsse, Stéphane","first_name":"Stéphane"},{"full_name":"Snyder, G Jeffrey","last_name":"Snyder","first_name":"G Jeffrey"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"page":"4060 - 4063","publisher":"ACS","quality_controlled":"1","publication_status":"published","type":"journal_article","publication":"Journal of the American Chemical Society","day":"07","title":"Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties","date_published":"2012-03-07T00:00:00Z","extern":"1","_id":"347","issue":"9","doi":"10.1021/ja211952z","main_file_link":[{"url":"https://authors.library.caltech.edu/30261/","open_access":"1"}],"volume":134,"intvolume":"       134","publist_id":"7487","date_created":"2018-12-11T11:45:57Z","date_updated":"2021-01-12T07:43:40Z","citation":{"chicago":"Ibáñez, Maria, Reza Zamani, Aaron Lalonde, Doris Cadavid, Wenhua Li, Alexey Shavel, Jordi Arbiol, et al. “Cu 2ZnGeSe 4 Nanocrystals: Synthesis and Thermoelectric Properties.” <i>Journal of the American Chemical Society</i>. ACS, 2012. <a href=\"https://doi.org/10.1021/ja211952z\">https://doi.org/10.1021/ja211952z</a>.","ieee":"M. Ibáñez <i>et al.</i>, “Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties,” <i>Journal of the American Chemical Society</i>, vol. 134, no. 9. ACS, pp. 4060–4063, 2012.","short":"M. Ibáñez, R. Zamani, A. Lalonde, D. Cadavid, W. Li, A. Shavel, J. Arbiol, J. Morante, S. Gorsse, G.J. Snyder, A. Cabot, Journal of the American Chemical Society 134 (2012) 4060–4063.","mla":"Ibáñez, Maria, et al. “Cu 2ZnGeSe 4 Nanocrystals: Synthesis and Thermoelectric Properties.” <i>Journal of the American Chemical Society</i>, vol. 134, no. 9, ACS, 2012, pp. 4060–63, doi:<a href=\"https://doi.org/10.1021/ja211952z\">10.1021/ja211952z</a>.","apa":"Ibáñez, M., Zamani, R., Lalonde, A., Cadavid, D., Li, W., Shavel, A., … Cabot, A. (2012). Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. <i>Journal of the American Chemical Society</i>. ACS. <a href=\"https://doi.org/10.1021/ja211952z\">https://doi.org/10.1021/ja211952z</a>","ama":"Ibáñez M, Zamani R, Lalonde A, et al. Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. <i>Journal of the American Chemical Society</i>. 2012;134(9):4060-4063. doi:<a href=\"https://doi.org/10.1021/ja211952z\">10.1021/ja211952z</a>","ista":"Ibáñez M, Zamani R, Lalonde A, Cadavid D, Li W, Shavel A, Arbiol J, Morante J, Gorsse S, Snyder GJ, Cabot A. 2012. Cu 2ZnGeSe 4 nanocrystals: Synthesis and thermoelectric properties. Journal of the American Chemical Society. 134(9), 4060–4063."},"acknowledgement":"This work was supported by the Spanish MICINN Projects MAT2008-05779, MAT2008-03400-E/MAT, MAT2010-15138, ENE2008-03277-E/CON, CSD2009-00050, and CSD2009-00013. M.I. thanks the Spanish MICINN for her Ph.D. Grant. J.A. and R.Z. also acknowledge Generalitat de Catalunya 2009-SGR-770 and XaRMAE. A.C. is thankful for financial support through the Ramon y Cajal Program of the Spanish MICINN.","month":"03","article_type":"original"},{"citation":{"ista":"Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.","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>","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>","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.","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>.","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>."},"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.","article_type":"original","month":"03","intvolume":"        78","publist_id":"2341","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:29Z","date_updated":"2022-05-24T08:00:54Z","doi":"10.1016/j.jcss.2011.05.002","file":[{"file_id":"5897","checksum":"241b939deb4517cdd4426d49c67e3fa2","relation":"main_file","date_updated":"2020-07-14T12:46:17Z","date_created":"2019-01-29T10:54:28Z","access_level":"open_access","content_type":"application/pdf","creator":"kschuh","file_size":336450,"file_name":"a_survey_of_stochastic_omega-regular_games.pdf"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jcss.2011.05.002"}],"volume":78,"_id":"3846","issue":"2","publication":"Journal of Computer and System Sciences","day":"02","date_published":"2012-03-02T00:00:00Z","title":"A survey of stochastic ω regular games","has_accepted_license":"1","publisher":"Elsevier","scopus_import":"1","quality_controlled":"1","publication_status":"published","type":"journal_article","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"page":"394 - 413","status":"public","oa_version":"Submitted Version","year":"2012","oa":1,"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"article_processing_charge":"No"},{"publication_status":"published","type":"journal_article","abstract":[{"text":"In this Letter we present detailed study of the density of states near defects in Bi 2Se 3. In particular, we present data on the commonly found triangular defects in this system. While we do not find any measurable quasiparticle scattering interference effects, we do find localized resonances, which can be well fitted by theory once the potential is taken to be extended to properly account for the observed defects. The data together with the fits confirm that while the local density of states around the Dirac point of the electronic spectrum at the surface is significantly disrupted near the impurity by the creation of low-energy resonance state, the Dirac point is not locally destroyed. We discuss our results in terms of the expected protected surface state of topological insulators. © 2012 American Physical Society.","lang":"eng"}],"publisher":"American Physical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"STM imaging of impurity resonances on Bi 2Se 3","date_published":"2012-01-01T00:00:00Z","day":"01","publication":"Physical Review Letters","language":[{"iso":"eng"}],"volume":108,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1108.0022"}],"doi":"10.1103/PhysRevLett.108.206402","issue":"20","extern":"1","_id":"387","year":"2012","month":"01","author":[{"first_name":"Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","full_name":"Alpichshev, Zhanybek","last_name":"Alpichshev","orcid":"0000-0002-7183-5203"},{"last_name":"Biswas","full_name":"Biswas, Rudro","first_name":"Rudro"},{"last_name":"Balatsky","full_name":"Balatsky, Alexander","first_name":"Alexander"},{"last_name":"Analytis","full_name":"Analytis, James","first_name":"James"},{"full_name":"Chu, Jiunhaw","last_name":"Chu","first_name":"Jiunhaw"},{"first_name":"Ian","last_name":"Fisher","full_name":"Fisher, Ian"},{"full_name":"Kapitulnik, Aharon","last_name":"Kapitulnik","first_name":"Aharon"}],"citation":{"ista":"Alpichshev Z, Biswas R, Balatsky A, Analytis J, Chu J, Fisher I, Kapitulnik A. 2012. STM imaging of impurity resonances on Bi 2Se 3. Physical Review Letters. 108(20).","apa":"Alpichshev, Z., Biswas, R., Balatsky, A., Analytis, J., Chu, J., Fisher, I., &#38; Kapitulnik, A. (2012). STM imaging of impurity resonances on Bi 2Se 3. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.108.206402\">https://doi.org/10.1103/PhysRevLett.108.206402</a>","ama":"Alpichshev Z, Biswas R, Balatsky A, et al. STM imaging of impurity resonances on Bi 2Se 3. <i>Physical Review Letters</i>. 2012;108(20). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.108.206402\">10.1103/PhysRevLett.108.206402</a>","ieee":"Z. Alpichshev <i>et al.</i>, “STM imaging of impurity resonances on Bi 2Se 3,” <i>Physical Review Letters</i>, vol. 108, no. 20. American Physical Society, 2012.","mla":"Alpichshev, Zhanybek, et al. “STM Imaging of Impurity Resonances on Bi 2Se 3.” <i>Physical Review Letters</i>, vol. 108, no. 20, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.108.206402\">10.1103/PhysRevLett.108.206402</a>.","short":"Z. Alpichshev, R. Biswas, A. Balatsky, J. Analytis, J. Chu, I. Fisher, A. Kapitulnik, Physical Review Letters 108 (2012).","chicago":"Alpichshev, Zhanybek, Rudro Biswas, Alexander Balatsky, James Analytis, Jiunhaw Chu, Ian Fisher, and Aharon Kapitulnik. “STM Imaging of Impurity Resonances on Bi 2Se 3.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevLett.108.206402\">https://doi.org/10.1103/PhysRevLett.108.206402</a>."},"date_created":"2018-12-11T11:46:11Z","date_updated":"2021-01-12T07:52:49Z","oa_version":"None","publist_id":"7442","status":"public","intvolume":"       108"},{"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2012","pubrep_id":"946","author":[{"first_name":"Taras","last_name":"Galkovskyi","full_name":"Galkovskyi, Taras"},{"full_name":"Mileyko, Yuriy","last_name":"Mileyko","first_name":"Yuriy"},{"first_name":"Alexander","full_name":"Bucksch, Alexander","last_name":"Bucksch"},{"full_name":"Moore, Brad","last_name":"Moore","first_name":"Brad"},{"full_name":"Symonova, Olga","last_name":"Symonova","first_name":"Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Price","full_name":"Price, Charles","first_name":"Charles"},{"last_name":"Topp","full_name":"Topp, Chrostopher","first_name":"Chrostopher"},{"full_name":"Iyer Pascuzzi, Anjali","last_name":"Iyer Pascuzzi","first_name":"Anjali"},{"first_name":"Paul","full_name":"Zurek, Paul","last_name":"Zurek"},{"first_name":"Suqin","last_name":"Fang","full_name":"Fang, Suqin"},{"first_name":"John","full_name":"Harer, John","last_name":"Harer"},{"first_name":"Philip","full_name":"Benfey, Philip","last_name":"Benfey"},{"first_name":"Joshua","last_name":"Weitz","full_name":"Weitz, Joshua"}],"status":"public","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:35Z","article_number":"116","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Background: Characterizing root system architecture (RSA) is essential to understanding the development and function of vascular plants. Identifying RSA-associated genes also represents an underexplored opportunity for crop improvement. Software tools are needed to accelerate the pace at which quantitative traits of RSA are estimated from images of root networks.Results: We have developed GiA Roots (General Image Analysis of Roots), a semi-automated software tool designed specifically for the high-throughput analysis of root system images. GiA Roots includes user-assisted algorithms to distinguish root from background and a fully automated pipeline that extracts dozens of root system phenotypes. Quantitative information on each phenotype, along with intermediate steps for full reproducibility, is returned to the end-user for downstream analysis. GiA Roots has a GUI front end and a command-line interface for interweaving the software into large-scale workflows. GiA Roots can also be extended to estimate novel phenotypes specified by the end-user.Conclusions: We demonstrate the use of GiA Roots on a set of 2393 images of rice roots representing 12 genotypes from the species Oryza sativa. We validate trait measurements against prior analyses of this image set that demonstrated that RSA traits are likely heritable and associated with genotypic differences. Moreover, we demonstrate that GiA Roots is extensible and an end-user can add functionality so that GiA Roots can estimate novel RSA traits. In summary, we show that the software can function as an efficient tool as part of a workflow to move from large numbers of root images to downstream analysis."}],"oa":1,"ddc":["005","514","516"],"language":[{"iso":"eng"}],"doi":"10.1186/1471-2229-12-116","file":[{"creator":"system","file_name":"IST-2018-946-v1+1_2012_Symonova_GiA_Roots.pdf","file_size":1691436,"file_id":"4953","checksum":"0c629e36acd5f2878ff7dd088d67d494","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:12:35Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"volume":12,"extern":"1","_id":"492","citation":{"ieee":"T. Galkovskyi <i>et al.</i>, “GiA Roots: Software for the high throughput analysis of plant root system architecture,” <i>BMC Plant Biology</i>, vol. 12. BioMed Central, 2012.","mla":"Galkovskyi, Taras, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” <i>BMC Plant Biology</i>, vol. 12, 116, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1471-2229-12-116\">10.1186/1471-2229-12-116</a>.","short":"T. Galkovskyi, Y. Mileyko, A. Bucksch, B. Moore, O. Symonova, C. Price, C. Topp, A. Iyer Pascuzzi, P. Zurek, S. Fang, J. Harer, P. Benfey, J. Weitz, BMC Plant Biology 12 (2012).","chicago":"Galkovskyi, Taras, Yuriy Mileyko, Alexander Bucksch, Brad Moore, Olga Symonova, Charles Price, Chrostopher Topp, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.” <i>BMC Plant Biology</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1471-2229-12-116\">https://doi.org/10.1186/1471-2229-12-116</a>.","ista":"Galkovskyi T, Mileyko Y, Bucksch A, Moore B, Symonova O, Price C, Topp C, Iyer Pascuzzi A, Zurek P, Fang S, Harer J, Benfey P, Weitz J. 2012. GiA Roots: Software for the high throughput analysis of plant root system architecture. BMC Plant Biology. 12, 116.","apa":"Galkovskyi, T., Mileyko, Y., Bucksch, A., Moore, B., Symonova, O., Price, C., … Weitz, J. (2012). GiA Roots: Software for the high throughput analysis of plant root system architecture. <i>BMC Plant Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2229-12-116\">https://doi.org/10.1186/1471-2229-12-116</a>","ama":"Galkovskyi T, Mileyko Y, Bucksch A, et al. GiA Roots: Software for the high throughput analysis of plant root system architecture. <i>BMC Plant Biology</i>. 2012;12. doi:<a href=\"https://doi.org/10.1186/1471-2229-12-116\">10.1186/1471-2229-12-116</a>"},"month":"07","intvolume":"        12","publist_id":"7328","date_created":"2018-12-11T11:46:46Z","date_updated":"2022-08-25T14:59:17Z","has_accepted_license":"1","publisher":"BioMed Central","publication_status":"published","scopus_import":"1","quality_controlled":"1","type":"journal_article","publication":"BMC Plant Biology","day":"26","title":"GiA Roots: Software for the high throughput analysis of plant root system architecture","date_published":"2012-07-26T00:00:00Z"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The BCI competition IV stands in the tradition of prior BCI competitions that aim to provide high quality neuroscientific data for open access to the scientific community. As experienced already in prior competitions not only scientists from the narrow field of BCI compete, but scholars with a broad variety of backgrounds and nationalities. They include high specialists as well as students.The goals of all BCI competitions have always been to challenge with respect to novel paradigms and complex data. We report on the following challenges: (1) asynchronous data, (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer, (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after past competitions, our hope is that winning entries may enhance the analysis methods of future BCIs."}],"article_number":"55","file_date_updated":"2020-07-14T12:46:35Z","language":[{"iso":"eng"}],"ddc":["004"],"oa":1,"pubrep_id":"945","year":"2012","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","status":"public","author":[{"first_name":"Michael","last_name":"Tangermann","full_name":"Tangermann, Michael"},{"first_name":"Klaus","full_name":"Müller, Klaus","last_name":"Müller"},{"full_name":"Aertsen, Ad","last_name":"Aertsen","first_name":"Ad"},{"last_name":"Birbaumer","full_name":"Birbaumer, Niels","first_name":"Niels"},{"last_name":"Braun","full_name":"Braun, Christoph","first_name":"Christoph"},{"first_name":"Clemens","full_name":"Brunner, Clemens","last_name":"Brunner"},{"full_name":"Leeb, Robert","last_name":"Leeb","first_name":"Robert"},{"first_name":"Carsten","last_name":"Mehring","full_name":"Mehring, Carsten"},{"full_name":"Miller, Kai","last_name":"Miller","first_name":"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"},{"first_name":"Gert","full_name":"Pfurtscheller, Gert","last_name":"Pfurtscheller"},{"first_name":"Hubert","last_name":"Preissl","full_name":"Preissl, Hubert"},{"last_name":"Schalk","full_name":"Schalk, Gerwin","first_name":"Gerwin"},{"full_name":"Schlögl, Alois","last_name":"Schlögl","orcid":"0000-0002-5621-8100","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Carmen","last_name":"Vidaurre","full_name":"Vidaurre, Carmen"},{"first_name":"Stephan","last_name":"Waldert","full_name":"Waldert, Stephan"},{"first_name":"Benjamin","full_name":"Blankertz, Benjamin","last_name":"Blankertz"}],"type":"journal_article","scopus_import":1,"quality_controlled":"1","publication_status":"published","publisher":"Frontiers Research Foundation","has_accepted_license":"1","day":"13","date_published":"2012-07-13T00:00:00Z","title":"Review of the BCI competition IV","publication":"Frontiers in Neuroscience","_id":"493","file":[{"creator":"system","file_name":"IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf","file_size":2693701,"date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:18:34Z","access_level":"open_access","relation":"main_file","checksum":"195238221c4b0b0f4035f6f6c16ea17c","file_id":"5356","content_type":"application/pdf"}],"volume":6,"doi":"10.3389/fnins.2012.00055","publist_id":"7327","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"date_updated":"2021-01-12T08:01:03Z","date_created":"2018-12-11T11:46:46Z","intvolume":"         6","month":"07","citation":{"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).","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>.","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>.","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.","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>","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>"},"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"},{"language":[{"iso":"eng"}],"ddc":["004"],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice."}],"file_date_updated":"2020-07-14T12:46:35Z","oa_version":"Published Version","status":"public","author":[{"first_name":"Alex","full_name":"Kruckman, Alex","last_name":"Kruckman"},{"id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha","full_name":"Rubin, Sasha","last_name":"Rubin"},{"first_name":"John","full_name":"Sheridan, John","last_name":"Sheridan"},{"first_name":"Ben","last_name":"Zax","full_name":"Zax, Ben"}],"page":"238 - 246","pubrep_id":"944","year":"2012","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ec_funded":1,"day":"07","date_published":"2012-10-07T00:00:00Z","title":"A Myhill Nerode theorem for automata with advice","publication":"Proceedings GandALF 2012","publication_status":"published","type":"conference","scopus_import":1,"quality_controlled":"1","publisher":"Open Publishing Association","has_accepted_license":"1","alternative_title":["EPTCS"],"publist_id":"7325","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:01:04Z","date_created":"2018-12-11T11:46:47Z","intvolume":"        96","month":"10","citation":{"chicago":"Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.” In <i>Proceedings GandALF 2012</i>, 96:238–46. Open Publishing Association, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>.","ieee":"A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in <i>Proceedings GandALF 2012</i>, Napoli, Italy, 2012, vol. 96, pp. 238–246.","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.","mla":"Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” <i>Proceedings GandALF 2012</i>, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>.","apa":"Kruckman, A., Rubin, S., Sheridan, J., &#38; Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In <i>Proceedings GandALF 2012</i> (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>","ama":"Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata with advice. In: <i>Proceedings GandALF 2012</i>. Vol 96. Open Publishing Association; 2012:238-246. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>","ista":"Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246."},"conference":{"start_date":"2012-09-06","location":"Napoli, Italy","end_date":"2012-09-08","name":"GandALF: Games, Automata, Logics and Formal Verification"},"_id":"495","file":[{"content_type":"application/pdf","file_id":"5152","checksum":"56277f95edc9d531fa3bdc5f9579fda8","access_level":"open_access","date_created":"2018-12-12T10:15:31Z","relation":"main_file","date_updated":"2020-07-14T12:46:35Z","file_size":97736,"file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf","creator":"system"}],"volume":96,"doi":"10.4204/EPTCS.96.18","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}]},{"article_number":"6280474","alternative_title":["LICS"],"quality_controlled":"1","publication_status":"published","scopus_import":1,"type":"conference","publisher":"IEEE","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We study the expressive power of logical interpretations on the class of scattered trees, namely those with countably many infinite branches. Scattered trees can be thought of as the tree analogue of scattered linear orders. Every scattered tree has an ordinal rank that reflects the structure of its infinite branches. We prove, roughly, that trees and orders of large rank cannot be interpreted in scattered trees of small rank. We consider a quite general notion of interpretation: each element of the interpreted structure is represented by a set of tuples of subsets of the interpreting tree. Our trees are countable, not necessarily finitely branching, and may have finitely many unary predicates as labellings. We also show how to replace injective set-interpretations in (not necessarily scattered) trees by 'finitary' set-interpretations.","lang":"eng"}],"oa":1,"day":"01","date_published":"2012-01-01T00:00:00Z","title":"Interpretations in trees with countably many branches","language":[{"iso":"eng"}],"ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf"}],"doi":"10.1109/LICS.2012.65","project":[{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2012-06-25","location":"Dubrovnik, Croatia","name":"LICS: Symposium on Logic in Computer Science","end_date":"2012-06-28"},"_id":"496","year":"2012","author":[{"first_name":"Alexander","last_name":"Rabinovich","full_name":"Rabinovich, Alexander"},{"full_name":"Rubin, Sasha","last_name":"Rubin","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"}],"month":"01","citation":{"chicago":"Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.” IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>.","mla":"Rabinovich, Alexander, and Sasha Rubin. <i>Interpretations in Trees with Countably Many Branches</i>. 6280474, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>.","short":"A. Rabinovich, S. Rubin, in:, IEEE, 2012.","ieee":"A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.","ama":"Rabinovich A, Rubin S. Interpretations in trees with countably many branches. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>","apa":"Rabinovich, A., &#38; Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>","ista":"Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474."},"publist_id":"7324","oa_version":"Preprint","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T11:46:47Z","date_updated":"2021-01-12T08:01:05Z","status":"public"},{"file_date_updated":"2020-07-14T12:46:35Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm. © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath."}],"ddc":["004"],"oa":1,"language":[{"iso":"eng"}],"ec_funded":1,"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"pubrep_id":"943","year":"2012","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Siddhesh","last_name":"Chaubal","full_name":"Chaubal, Siddhesh"},{"first_name":"Pritish","full_name":"Kamath, Pritish","last_name":"Kamath"}],"page":"167 - 182","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5378"}]},"oa_version":"Published Version","status":"public","has_accepted_license":"1","alternative_title":["LIPIcs"],"type":"conference","publication_status":"published","scopus_import":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"01","title":"Faster algorithms for alternating refinement relations","date_published":"2012-09-01T00:00:00Z","file":[{"file_id":"4712","checksum":"f1b0dd99240800db2d7dbf9b5131fe5e","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:08:50Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","creator":"system","file_size":471236,"file_name":"IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf"}],"volume":16,"doi":"10.4230/LIPIcs.CSL.2012.167","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"conference":{"location":"Fontainebleau, France","start_date":"2012-09-03","name":"EACSL: European Association for Computer Science Logic","end_date":"2012-09-06"},"_id":"497","month":"09","citation":{"ama":"Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>.","short":"K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>.","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182."},"publist_id":"7323","department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:23:32Z","date_created":"2018-12-11T11:46:48Z","intvolume":"        16"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"year":"2012","pubrep_id":"942","author":[{"orcid":"0000-0001-6118-0541","full_name":"Pickup, Melinda","last_name":"Pickup","first_name":"Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David","last_name":"Field","orcid":"0000-0002-4014-8478"},{"first_name":"David","full_name":"Rowell, David","last_name":"Rowell"},{"last_name":"Young","full_name":"Young, Andrew","first_name":"Andrew"}],"page":"913 - 924","status":"public","oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:35Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Understanding patterns and correlates of local adaptation in heterogeneous landscapes can provide important information in the selection of appropriate seed sources for restoration. We assessed the extent of local adaptation of fitness components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance, quantitative (QST) and neutral (FST) genetic differentiation, and size of the local and foreign populations could predict patterns of adaptive differentiation. Local adaptation varied among populations and fitness components. Including all population pairs, local adaptation was observed for seedling survival, but not for biomass, while foreign genotype advantage was observed for reproduction (number of inflorescences). Among population pairs, local adaptation increased with QST and local population size for biomass. QST was associated with environmental distance, suggesting ecological selection for phenotypic divergence. However, low FST and variation in population structure in small populations demonstrates the interaction of gene flow and drift in constraining local adaptation in R. leptorrhynchoides. Our study indicates that for species in heterogeneous landscapes, collecting seed from large populations from similar environments to candidate sites is likely to provide the most appropriate seed sources for restoration."}],"oa":1,"ddc":["576"],"language":[{"iso":"eng"}],"doi":"10.1111/j.1752-4571.2012.00284.x","file":[{"creator":"system","file_name":"IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf","file_size":396136,"access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:10:33Z","file_id":"4821","checksum":"233007138606aca5a2f75f7ae1742f43","content_type":"application/pdf"}],"volume":5,"_id":"498","issue":"8","citation":{"ista":"Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924.","apa":"Pickup, M., Field, D., Rowell, D., &#38; Young, A. (2012). Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>","ama":"Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. 2012;5(8):913-924. doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>","ieee":"M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation in fragmented plant populations: Implications for restoration genetics,” <i>Evolutionary Applications</i>, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.","mla":"Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>, vol. 5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>.","short":"M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924.","chicago":"Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>."},"acknowledgement":"We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer C. H. Barrett for comments that improved the quality of the manuscript.\r\n","month":"12","intvolume":"         5","department":[{"_id":"NiBa"}],"publist_id":"7322","date_created":"2018-12-11T11:46:48Z","date_updated":"2021-01-12T08:01:06Z","has_accepted_license":"1","publisher":"Wiley-Blackwell","quality_controlled":"1","publication_status":"published","type":"journal_article","publication":"Evolutionary Applications","day":"01","date_published":"2012-12-01T00:00:00Z","title":"Predicting local adaptation in fragmented plant populations: Implications for restoration genetics"},{"has_accepted_license":"1","quality_controlled":"1","scopus_import":1,"type":"journal_article","publication_status":"published","publisher":"Rockefeller University Press","day":"30","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","date_published":"2012-04-30T00:00:00Z","title":"Cell migration: Fibroblasts find a new way to get ahead","publication":"Journal of Cell Biology","file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:36Z","date_created":"2019-02-12T09:03:09Z","access_level":"open_access","checksum":"45c02be33ebd99fc3077d60b9c90bdfa","file_id":"5957","content_type":"application/pdf","creator":"kschuh","file_name":"2012_CellBiology_Sixt.pdf","file_size":986566}],"volume":197,"doi":"10.1083/jcb.201204039","issue":"3","_id":"506","month":"04","article_type":"original","citation":{"ieee":"M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” <i>Journal of Cell Biology</i>, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.","short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.","mla":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>, vol. 197, no. 3, Rockefeller University Press, 2012, pp. 347–49, doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>.","chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2012. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>.","ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","apa":"Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>","ama":"Sixt MK. Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. 2012;197(3):347-349. doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>"},"publist_id":"7314","department":[{"_id":"MiSi"}],"date_created":"2018-12-11T11:46:51Z","date_updated":"2021-01-12T08:01:11Z","intvolume":"       197","file_date_updated":"2020-07-14T12:46:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","ddc":["570"],"oa":1,"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"year":"2012","author":[{"orcid":"0000-0002-6620-9179","last_name":"Sixt","full_name":"Sixt, Michael K","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"page":"347 - 349","oa_version":"Published Version","status":"public"},{"abstract":[{"lang":"eng","text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean-payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two- player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP- hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two- player pushdown games. Finally we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded."}],"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"technical_report","publication_status":"published","file_date_updated":"2020-07-14T12:46:38Z","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","language":[{"iso":"eng"}],"title":"Mean-payoff pushdown games","date_published":"2012-07-02T00:00:00Z","day":"02","oa":1,"ddc":["000","005"],"_id":"5377","year":"2012","pubrep_id":"10","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2012-0002","file":[{"creator":"system","file_size":592098,"file_name":"IST-2012-002_IST-2012-0002.pdf","access_level":"open_access","date_created":"2018-12-12T11:54:00Z","relation":"main_file","date_updated":"2020-07-14T12:46:38Z","checksum":"a03c08c1589dbb0c96183a8bcf3ab240","file_id":"5522","content_type":"application/pdf"}],"status":"public","date_created":"2018-12-12T11:38:59Z","date_updated":"2023-02-23T11:05:50Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","related_material":{"record":[{"status":"public","relation":"later_version","id":"2956"}]},"citation":{"ista":"Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.","apa":"Chatterjee, K., &#38; Velner, Y. (2012). <i>Mean-payoff pushdown games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>","ama":"Chatterjee K, Velner Y. <i>Mean-Payoff Pushdown Games</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>","ieee":"K. Chatterjee and Y. Velner, <i>Mean-payoff pushdown games</i>. IST Austria, 2012.","short":"K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.","mla":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>."},"month":"07","page":"33","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}]},{"publisher":"IST Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.","lang":"eng"}],"type":"technical_report","publication_status":"published","file_date_updated":"2020-07-14T12:46:39Z","has_accepted_license":"1","alternative_title":["IST Austria Technical Report"],"language":[{"iso":"eng"}],"day":"04","date_published":"2012-07-04T00:00:00Z","title":"Faster algorithms for alternating refinement relations","oa":1,"ddc":["000","005"],"_id":"5378","year":"2012","pubrep_id":"14","doi":"10.15479/AT:IST-2012-0001","publication_identifier":{"issn":["2664-1690"]},"file":[{"file_name":"IST-2012-0001_IST-2012-0001.pdf","file_size":394256,"creator":"system","content_type":"application/pdf","checksum":"ec8d1857cc7095d3de5107a0162ced37","file_id":"5489","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:46:39Z","date_created":"2018-12-12T11:53:28Z"}],"status":"public","department":[{"_id":"KrCh"}],"oa_version":"Published Version","date_created":"2018-12-12T11:38:59Z","date_updated":"2023-02-23T12:21:38Z","citation":{"ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.","ama":"Chatterjee K, Chaubal S, Kamath P. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). <i>Faster algorithms for alternating refinement relations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>","short":"K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>.","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, <i>Faster algorithms for alternating refinement relations</i>. IST Austria, 2012.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>."},"related_material":{"record":[{"id":"497","relation":"later_version","status":"public"}]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Chaubal","full_name":"Chaubal, Siddhesh","first_name":"Siddhesh"},{"last_name":"Kamath","full_name":"Kamath, Pritish","first_name":"Pritish"}],"page":"21","month":"07"},{"intvolume":"        40","status":"public","publist_id":"4908","date_created":"2018-12-11T11:55:51Z","date_updated":"2021-01-12T06:55:27Z","citation":{"chicago":"Hairer, Martin, and Jan Maas. “A Spatial Version of the Itô-Stratonovich Correction.” <i>Annals of Probability</i>. Institute of Mathematical Statistics, 2012. <a href=\"https://doi.org/10.1214/11-AOP662\">https://doi.org/10.1214/11-AOP662</a>.","mla":"Hairer, Martin, and Jan Maas. “A Spatial Version of the Itô-Stratonovich Correction.” <i>Annals of Probability</i>, vol. 40, no. 4, Institute of Mathematical Statistics, 2012, pp. 1675–714, doi:<a href=\"https://doi.org/10.1214/11-AOP662\">10.1214/11-AOP662</a>.","short":"M. Hairer, J. Maas, Annals of Probability 40 (2012) 1675–1714.","ieee":"M. Hairer and J. Maas, “A spatial version of the Itô-Stratonovich correction,” <i>Annals of Probability</i>, vol. 40, no. 4. Institute of Mathematical Statistics, pp. 1675–1714, 2012.","ama":"Hairer M, Maas J. A spatial version of the Itô-Stratonovich correction. <i>Annals of Probability</i>. 2012;40(4):1675-1714. doi:<a href=\"https://doi.org/10.1214/11-AOP662\">10.1214/11-AOP662</a>","apa":"Hairer, M., &#38; Maas, J. (2012). A spatial version of the Itô-Stratonovich correction. <i>Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/11-AOP662\">https://doi.org/10.1214/11-AOP662</a>","ista":"Hairer M, Maas J. 2012. A spatial version of the Itô-Stratonovich correction. Annals of Probability. 40(4), 1675–1714."},"acknowledgement":"Supported by Rubicon Grant 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). Supported by the EPSRC Grants EP/E002269/1 and EP/D071593/1, a Wolfson Research Merit Award of the Royal Society and a Philip Leverhulme prize of the Lev","author":[{"first_name":"Martin","last_name":"Hairer","full_name":"Hairer, Martin M"},{"full_name":"Jan Maas","last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"page":"1675 - 1714","month":"07","_id":"2125","extern":1,"year":"2012","issue":"4","doi":"10.1214/11-AOP662","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1011.0966"}],"volume":40,"publication":"Annals of Probability","day":"01","date_published":"2012-07-01T00:00:00Z","title":"A spatial version of the Itô-Stratonovich correction","oa":1,"publisher":"Institute of Mathematical Statistics","abstract":[{"lang":"eng","text":"We consider a class of stochastic PDEs of Burgers type in spatial dimension 1, driven by space–time white noise. Even though it is well known that these equations are well posed, it turns out that if one performs a spatial discretization of the nonlinearity in the “wrong” way, then the sequence of approximate equations does converge to a limit, but this limit exhibits an additional correction term. This correction term is proportional to the local quadratic cross-variation (in space) of the gradient of the conserved quantity with the solution itself. This can be understood as a consequence of the fact that for any fixed time, the law of the solution is locally equivalent to Wiener measure, where space plays the role of time. In this sense, the correction term is similar to the usual Itô–Stratonovich correction term that arises when one considers different temporal discretizations of stochastic ODEs."}],"type":"journal_article","quality_controlled":0,"publication_status":"published"},{"quality_controlled":0,"publication_status":"published","type":"journal_article","abstract":[{"lang":"eng","text":"We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott, Sturm, and Villani for geodesic measure spaces. In order to apply to the discrete setting, the role of the Wasserstein metric is taken over by a different metric, having the property that continuous time Markov chains are gradient flows of the entropy. Using this notion of Ricci curvature we prove discrete analogues of fundamental results by Bakry–Émery and Otto–Villani. Further, we show that Ricci curvature bounds are preserved under tensorisation. As a special case we obtain the sharp Ricci curvature lower bound for the discrete hypercube."}],"publisher":"Springer","title":"Ricci curvature of finite Markov chains via convexity of the entropy","date_published":"2012-12-01T00:00:00Z","day":"01","publication":"Archive for Rational Mechanics and Analysis","oa":1,"issue":"3","_id":"2127","year":"2012","extern":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1111.2687"}],"volume":206,"doi":"10.1007/s00205-012-0554-z","date_updated":"2021-01-12T06:55:28Z","date_created":"2018-12-11T11:55:52Z","publist_id":"4906","status":"public","intvolume":"       206","month":"12","page":"997 - 1038","author":[{"first_name":"Matthias","last_name":"Erbar","full_name":"Erbar, Matthias"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Jan Maas","last_name":"Maas","orcid":"0000-0002-0845-1338"}],"acknowledgement":"Jan Maas is supported by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","citation":{"ista":"Erbar M, Maas J. 2012. Ricci curvature of finite Markov chains via convexity of the entropy. Archive for Rational Mechanics and Analysis. 206(3), 997–1038.","apa":"Erbar, M., &#38; Maas, J. (2012). Ricci curvature of finite Markov chains via convexity of the entropy. <i>Archive for Rational Mechanics and Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s00205-012-0554-z\">https://doi.org/10.1007/s00205-012-0554-z</a>","ama":"Erbar M, Maas J. Ricci curvature of finite Markov chains via convexity of the entropy. <i>Archive for Rational Mechanics and Analysis</i>. 2012;206(3):997-1038. doi:<a href=\"https://doi.org/10.1007/s00205-012-0554-z\">10.1007/s00205-012-0554-z</a>","ieee":"M. Erbar and J. Maas, “Ricci curvature of finite Markov chains via convexity of the entropy,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 206, no. 3. Springer, pp. 997–1038, 2012.","mla":"Erbar, Matthias, and Jan Maas. “Ricci Curvature of Finite Markov Chains via Convexity of the Entropy.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 206, no. 3, Springer, 2012, pp. 997–1038, doi:<a href=\"https://doi.org/10.1007/s00205-012-0554-z\">10.1007/s00205-012-0554-z</a>.","short":"M. Erbar, J. Maas, Archive for Rational Mechanics and Analysis 206 (2012) 997–1038.","chicago":"Erbar, Matthias, and Jan Maas. “Ricci Curvature of Finite Markov Chains via Convexity of the Entropy.” <i>Archive for Rational Mechanics and Analysis</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00205-012-0554-z\">https://doi.org/10.1007/s00205-012-0554-z</a>."}},{"page":"379 - 395","month":"10","author":[{"last_name":"Maas","full_name":"Jan Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"full_name":"van Neerven, Jan M","last_name":"Van Neerven","first_name":"Jan"},{"first_name":"Pierre","full_name":"Portal, Pierre","last_name":"Portal"}],"acknowledgement":"J. Maas was supported by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). J. van Neerven was supported by VICI subsidy 639.033.604 of the Netherlands Organisation for Scientific Research (NWO).","citation":{"ista":"Maas J, Van Neerven J, Portal P. 2012. Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure. Arkiv för Matematik. 50(2), 379–395.","ama":"Maas J, Van Neerven J, Portal P. Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure. <i>Arkiv för Matematik</i>. 2012;50(2):379-395. doi:<a href=\"https://doi.org/10.1007/s11512-010-0143-z\">10.1007/s11512-010-0143-z</a>","apa":"Maas, J., Van Neerven, J., &#38; Portal, P. (2012). Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure. <i>Arkiv För Matematik</i>. Springer. <a href=\"https://doi.org/10.1007/s11512-010-0143-z\">https://doi.org/10.1007/s11512-010-0143-z</a>","mla":"Maas, Jan, et al. “Whitney Coverings and the Tent Spaces T 1,q (γ) for the Gaussian Measure.” <i>Arkiv För Matematik</i>, vol. 50, no. 2, Springer, 2012, pp. 379–95, doi:<a href=\"https://doi.org/10.1007/s11512-010-0143-z\">10.1007/s11512-010-0143-z</a>.","short":"J. Maas, J. Van Neerven, P. Portal, Arkiv För Matematik 50 (2012) 379–395.","ieee":"J. Maas, J. Van Neerven, and P. Portal, “Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure,” <i>Arkiv för Matematik</i>, vol. 50, no. 2. Springer, pp. 379–395, 2012.","chicago":"Maas, Jan, Jan Van Neerven, and Pierre Portal. “Whitney Coverings and the Tent Spaces T 1,q (γ) for the Gaussian Measure.” <i>Arkiv För Matematik</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s11512-010-0143-z\">https://doi.org/10.1007/s11512-010-0143-z</a>."},"date_created":"2018-12-11T11:55:52Z","date_updated":"2021-01-12T06:55:28Z","publist_id":"4907","status":"public","intvolume":"        50","volume":50,"main_file_link":[{"url":"http://arxiv.org/abs/1002.4911","open_access":"1"}],"doi":"10.1007/s11512-010-0143-z","issue":"2","extern":1,"_id":"2128","year":"2012","oa":1,"date_published":"2012-10-01T00:00:00Z","title":"Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure","day":"01","publication":"Arkiv för Matematik","quality_controlled":0,"type":"journal_article","publication_status":"published","abstract":[{"lang":"eng","text":"We introduce a technique for handling Whitney decompositions in Gaussian harmonic analysis and apply it to the study of Gaussian analogues of the classical tent spaces T 1,q of Coifman–Meyer–Stein."}],"publisher":"Springer"},{"publication":"Physical Review Letters","language":[{"iso":"eng"}],"title":"Nonadiabatic preparation of spin crystals with ultracold polar molecules","date_published":"2012-07-16T00:00:00Z","day":"16","oa":1,"abstract":[{"text":"We study the growth dynamics of ordered structures of strongly interacting polar molecules in optical lattices. Using a dipole blockade of microwave excitations, we map the system onto an interacting spin-1/2 model possessing ground states with crystalline order, and describe a way to prepare these states by nonadiabatically driving the transitions between molecular rotational levels. The proposed technique bypasses the need to cross a phase transition and allows for the creation of ordered domains of considerably larger size compared to approaches relying on adiabatic preparation.","lang":"eng"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"American Physical Society","type":"journal_article","publication_status":"published","status":"public","intvolume":"       109","date_created":"2018-12-11T11:56:17Z","date_updated":"2021-11-16T08:01:02Z","publist_id":"4772","oa_version":"None","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1103/PhysRevLett.109.049901"}]},"citation":{"ama":"Lemeshko M, Krems R, Weimer H. Nonadiabatic preparation of spin crystals with ultracold polar molecules. <i>Physical Review Letters</i>. 2012;109(3). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.109.035301\">10.1103/PhysRevLett.109.035301</a>","apa":"Lemeshko, M., Krems, R., &#38; Weimer, H. (2012). Nonadiabatic preparation of spin crystals with ultracold polar molecules. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.109.035301\">https://doi.org/10.1103/PhysRevLett.109.035301</a>","ista":"Lemeshko M, Krems R, Weimer H. 2012. Nonadiabatic preparation of spin crystals with ultracold polar molecules. Physical Review Letters. 109(3).","chicago":"Lemeshko, Mikhail, Roman Krems, and Hendrik Weimer. “Nonadiabatic Preparation of Spin Crystals with Ultracold Polar Molecules.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevLett.109.035301\">https://doi.org/10.1103/PhysRevLett.109.035301</a>.","mla":"Lemeshko, Mikhail, et al. “Nonadiabatic Preparation of Spin Crystals with Ultracold Polar Molecules.” <i>Physical Review Letters</i>, vol. 109, no. 3, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.109.035301\">10.1103/PhysRevLett.109.035301</a>.","short":"M. Lemeshko, R. Krems, H. Weimer, Physical Review Letters 109 (2012).","ieee":"M. Lemeshko, R. Krems, and H. Weimer, “Nonadiabatic preparation of spin crystals with ultracold polar molecules,” <i>Physical Review Letters</i>, vol. 109, no. 3. American Physical Society, 2012."},"month":"07","author":[{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"},{"last_name":"Krems","full_name":"Krems, Roman","first_name":"Roman"},{"first_name":"Hendrik","full_name":"Weimer, Hendrik","last_name":"Weimer"}],"year":"2012","_id":"2201","extern":"1","issue":"3","doi":"10.1103/PhysRevLett.109.035301","main_file_link":[{"url":"http://arxiv.org/abs/1203.0010","open_access":"1"}],"volume":109},{"status":"public","intvolume":"        86","date_updated":"2021-01-12T06:55:57Z","date_created":"2018-12-11T11:56:18Z","publist_id":"4773","citation":{"ista":"Alyabyshev S, Lemeshko M, Krems R. 2012. Sensitive imaging of electromagnetic fields with paramagnetic polar molecules. Physical Review A - Atomic, Molecular, and Optical Physics. 86(1).","ama":"Alyabyshev S, Lemeshko M, Krems R. Sensitive imaging of electromagnetic fields with paramagnetic polar molecules. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. 2012;86(1). doi:<a href=\"https://doi.org/10.1103/PhysRevA.86.013409\">10.1103/PhysRevA.86.013409</a>","apa":"Alyabyshev, S., Lemeshko, M., &#38; Krems, R. (2012). Sensitive imaging of electromagnetic fields with paramagnetic polar molecules. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.86.013409\">https://doi.org/10.1103/PhysRevA.86.013409</a>","short":"S. Alyabyshev, M. Lemeshko, R. Krems, Physical Review A - Atomic, Molecular, and Optical Physics 86 (2012).","mla":"Alyabyshev, Sergey, et al. “Sensitive Imaging of Electromagnetic Fields with Paramagnetic Polar Molecules.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 86, no. 1, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevA.86.013409\">10.1103/PhysRevA.86.013409</a>.","ieee":"S. Alyabyshev, M. Lemeshko, and R. Krems, “Sensitive imaging of electromagnetic fields with paramagnetic polar molecules,” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 86, no. 1. American Physical Society, 2012.","chicago":"Alyabyshev, Sergey, Mikhail Lemeshko, and Roman Krems. “Sensitive Imaging of Electromagnetic Fields with Paramagnetic Polar Molecules.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevA.86.013409\">https://doi.org/10.1103/PhysRevA.86.013409</a>."},"month":"07","author":[{"first_name":"Sergey","full_name":"Alyabyshev, Sergey V","last_name":"Alyabyshev"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","full_name":"Mikhail Lemeshko","orcid":"0000-0002-6990-7802"},{"last_name":"Krems","full_name":"Krems, Roman V","first_name":"Roman"}],"year":"2012","_id":"2202","extern":1,"issue":"1","doi":"10.1103/PhysRevA.86.013409","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.1857"}],"volume":86,"publication":"Physical Review A - Atomic, Molecular, and Optical Physics","title":"Sensitive imaging of electromagnetic fields with paramagnetic polar molecules","date_published":"2012-07-13T00:00:00Z","day":"13","oa":1,"abstract":[{"lang":"eng","text":"We propose a method for sensitive parallel detection of low-frequency electromagnetic fields based on the fine structure interactions in paramagnetic polar molecules. Compared to the recently implemented scheme employing ultracold 87Rb atoms by Böhi, the technique based on molecules offers a 100-fold higher sensitivity, the possibility to measure both the electric and magnetic field components, and a probe of a wide range of frequencies from the dc limit to the THz regime."}],"publisher":"American Physical Society","publication_status":"published","type":"journal_article","quality_controlled":0},{"issue":"15-16","extern":1,"_id":"2203","year":"2012","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1108.4583"}],"volume":110,"doi":"10.1080/00268976.2012.689868","publist_id":"4770","date_updated":"2021-01-12T06:55:58Z","date_created":"2018-12-11T11:56:18Z","intvolume":"       110","status":"public","author":[{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko","last_name":"Lemeshko"},{"first_name":"Břetislav","last_name":"Friedrich","full_name":"Friedrich, Břetislav"}],"page":"1873 - 1881","month":"01","citation":{"short":"M. Lemeshko, B. Friedrich, Molecular Physics 110 (2012) 1873–1881.","mla":"Lemeshko, Mikhail, and Břetislav Friedrich. “Interaction between Polar Molecules Subject to a Far-off-Resonant Optical Field: Entangled Dipoles up- or down-Holding Each Other.” <i>Molecular Physics</i>, vol. 110, no. 15–16, Taylor &#38; Francis, 2012, pp. 1873–81, doi:<a href=\"https://doi.org/10.1080/00268976.2012.689868\">10.1080/00268976.2012.689868</a>.","ieee":"M. Lemeshko and B. Friedrich, “Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other,” <i>Molecular Physics</i>, vol. 110, no. 15–16. Taylor &#38; Francis, pp. 1873–1881, 2012.","chicago":"Lemeshko, Mikhail, and Břetislav Friedrich. “Interaction between Polar Molecules Subject to a Far-off-Resonant Optical Field: Entangled Dipoles up- or down-Holding Each Other.” <i>Molecular Physics</i>. Taylor &#38; Francis, 2012. <a href=\"https://doi.org/10.1080/00268976.2012.689868\">https://doi.org/10.1080/00268976.2012.689868</a>.","ista":"Lemeshko M, Friedrich B. 2012. Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other. Molecular Physics. 110(15–16), 1873–1881.","ama":"Lemeshko M, Friedrich B. Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other. <i>Molecular Physics</i>. 2012;110(15-16):1873-1881. doi:<a href=\"https://doi.org/10.1080/00268976.2012.689868\">10.1080/00268976.2012.689868</a>","apa":"Lemeshko, M., &#38; Friedrich, B. (2012). Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other. <i>Molecular Physics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00268976.2012.689868\">https://doi.org/10.1080/00268976.2012.689868</a>"},"quality_controlled":0,"publication_status":"published","type":"journal_article","publisher":"Taylor & Francis","abstract":[{"lang":"eng","text":"We show that the electric dipole-dipole interaction between a pair of polar molecules undergoes an all-out transformation when superimposed by a far-off-resonant optical field. The combined interaction potential becomes tunable by variation of wavelength, polarisation and intensity of the optical field and its dependence on the intermolecular separation exhibits a crossover from an inverse-power to an oscillating behaviour. The ability thereby offered to control molecular interactions opens up avenues toward the creation and manipulation of novel phases of ultracold polar gases among whose characteristics is a long-range entanglement of the dipoles' mutual orientation. We devised an accurate analytic model of such optical-field-dressed dipole-dipole interaction potentials, which enables a straightforward access to the optical-field parameters required for the design of intermolecular interactions in the laboratory."}],"day":"01","date_published":"2012-01-01T00:00:00Z","title":"Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other","publication":"Molecular Physics","oa":1},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Nestin-cre transgenic mice have been widely used to direct recombination to neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs). Here we report that a readily utilized, and the only commercially available, Nestin-cre line is insufficient for directing recombination in early embryonic NSCs and NPCs. Analysis of recombination efficiency in multiple cre-dependent reporters and a genetic mosaic line revealed consistent temporal and spatial patterns of recombination in NSCs and NPCs. For comparison we utilized a knock-in Emx1cre line and found robust recombination in NSCs and NPCs in ventricular and subventricular zones of the cerebral cortices as early as embryonic day 12.5. In addition we found that the rate of Nestin-cre driven recombination only reaches sufficiently high levels in NSCs and NPCs during late embryonic and early postnatal periods. These findings are important when commercially available cre lines are considered for directing recombination to embryonic NSCs and NPCs.","lang":"eng"}],"file_date_updated":"2020-07-14T12:45:35Z","language":[{"iso":"eng"}],"ddc":["576"],"oa":1,"pubrep_id":"387","year":"2012","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa_version":"Published Version","status":"public","author":[{"first_name":"Huixuan","full_name":"Liang, Huixuan","last_name":"Liang"},{"full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"full_name":"Ghashghaei, H.","last_name":"Ghashghaei","first_name":"H."}],"page":"1200 - 1203","type":"journal_article","publication_status":"published","quality_controlled":"1","scopus_import":1,"publisher":"The Company of Biologists","has_accepted_license":"1","day":"15","title":"A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors","date_published":"2012-12-15T00:00:00Z","publication":"Biology open","issue":"12","_id":"2263","file":[{"file_name":"IST-2015-387-v1+1_1200.full.pdf","file_size":726695,"creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:13:09Z","date_updated":"2020-07-14T12:45:35Z","access_level":"open_access","relation":"main_file","file_id":"4990","checksum":"605a1800b81227848c361fd6ba7d22ba"}],"volume":1,"doi":"10.1242/bio.20122287","department":[{"_id":"SiHi"}],"publist_id":"4682","date_updated":"2021-01-12T06:56:23Z","date_created":"2018-12-11T11:56:38Z","intvolume":"         1","month":"12","citation":{"apa":"Liang, H., Hippenmeyer, S., &#38; Ghashghaei, H. (2012). A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. <i>Biology Open</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/bio.20122287\">https://doi.org/10.1242/bio.20122287</a>","ama":"Liang H, Hippenmeyer S, Ghashghaei H. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. <i>Biology open</i>. 2012;1(12):1200-1203. doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>","ista":"Liang H, Hippenmeyer S, Ghashghaei H. 2012. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. Biology open. 1(12), 1200–1203.","chicago":"Liang, Huixuan, Simon Hippenmeyer, and H. Ghashghaei. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>. The Company of Biologists, 2012. <a href=\"https://doi.org/10.1242/bio.20122287\">https://doi.org/10.1242/bio.20122287</a>.","ieee":"H. Liang, S. Hippenmeyer, and H. Ghashghaei, “A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors,” <i>Biology open</i>, vol. 1, no. 12. The Company of Biologists, pp. 1200–1203, 2012.","mla":"Liang, Huixuan, et al. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>, vol. 1, no. 12, The Company of Biologists, 2012, pp. 1200–03, doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>.","short":"H. Liang, S. Hippenmeyer, H. Ghashghaei, Biology Open 1 (2012) 1200–1203."}},{"doi":"10.2312/EGPGV/EGPGV12/139-148","file":[{"file_name":"IST-2016-572-v1+1_preiner_2012_AS-draft.pdf","file_size":14903860,"creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:11:13Z","date_updated":"2020-07-14T12:45:35Z","access_level":"open_access","relation":"main_file","checksum":"5495bb6ee8662cd401b34afb04dfb40f","file_id":"4866"}],"extern":"1","_id":"2267","year":"2012","conference":{"name":"EGPGV: Eurographics Symposium on Parallel Graphics and Visualization","end_date":"2012-05-14","start_date":"2012-05-13","location":"Calgari, Italy"},"pubrep_id":"572","citation":{"apa":"Preiner, R., Jeschke, S., &#38; Wimmer, M. (2012). Auto splats: Dynamic point cloud visualization on the GPU (pp. 139–148). Presented at the EGPGV: Eurographics Symposium on Parallel Graphics and Visualization, Calgari, Italy: Eurographics Association. <a href=\"https://doi.org/10.2312/EGPGV/EGPGV12/139-148\">https://doi.org/10.2312/EGPGV/EGPGV12/139-148</a>","ama":"Preiner R, Jeschke S, Wimmer M. Auto splats: Dynamic point cloud visualization on the GPU. In: Eurographics Association; 2012:139-148. doi:<a href=\"https://doi.org/10.2312/EGPGV/EGPGV12/139-148\">10.2312/EGPGV/EGPGV12/139-148</a>","ista":"Preiner R, Jeschke S, Wimmer M. 2012. Auto splats: Dynamic point cloud visualization on the GPU. EGPGV: Eurographics Symposium on Parallel Graphics and Visualization, 139–148.","chicago":"Preiner, Reinhold, Stefan Jeschke, and Michael Wimmer. “Auto Splats: Dynamic Point Cloud Visualization on the GPU,” 139–48. Eurographics Association, 2012. <a href=\"https://doi.org/10.2312/EGPGV/EGPGV12/139-148\">https://doi.org/10.2312/EGPGV/EGPGV12/139-148</a>.","ieee":"R. Preiner, S. Jeschke, and M. Wimmer, “Auto splats: Dynamic point cloud visualization on the GPU,” presented at the EGPGV: Eurographics Symposium on Parallel Graphics and Visualization, Calgari, Italy, 2012, pp. 139–148.","mla":"Preiner, Reinhold, et al. <i>Auto Splats: Dynamic Point Cloud Visualization on the GPU</i>. Eurographics Association, 2012, pp. 139–48, doi:<a href=\"https://doi.org/10.2312/EGPGV/EGPGV12/139-148\">10.2312/EGPGV/EGPGV12/139-148</a>.","short":"R. Preiner, S. Jeschke, M. Wimmer, in:, Eurographics Association, 2012, pp. 139–148."},"page":"139 - 148","month":"05","author":[{"first_name":"Reinhold","full_name":"Preiner, Reinhold","last_name":"Preiner"},{"id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Jeschke","full_name":"Jeschke, Stefan"},{"last_name":"Wimmer","full_name":"Wimmer, Michael","first_name":"Michael"}],"status":"public","date_updated":"2021-01-12T06:56:24Z","date_created":"2018-12-11T11:56:40Z","publist_id":"4677","oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:45:35Z","has_accepted_license":"1","abstract":[{"text":"Capturing real-world objects with laser-scanning technology has become an everyday task. Recently, the acquisition of dynamic scenes at interactive frame rates has become feasible. A high-quality visualization of the resulting point cloud stream would require a per-frame reconstruction of object surfaces. Unfortunately, reconstruction computations are still too time-consuming to be applied interactively. In this paper we present a local surface reconstruction and visualization technique that provides interactive feedback for reasonably sized point clouds, while achieving high image quality. Our method is performed entirely on the GPU and in screen pace, exploiting the efficiency of the common rasterization pipeline. The approach is very general, as no assumption is made about point connectivity or sampling density. This naturally allows combining the outputs of multiple scanners in a single visualization, which is useful for many virtual and augmented reality applications. ","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publisher":"Eurographics Association","type":"conference","quality_controlled":"1","publication_status":"published","oa":1,"ddc":["000"],"language":[{"iso":"eng"}],"title":"Auto splats: Dynamic point cloud visualization on the GPU","date_published":"2012-05-13T00:00:00Z","day":"13"}]