[{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1104.2272"}],"status":"public","day":"01","year":"2014","doi":"10.1215/00127094-2649752","page":"1127 - 1190","_id":"2699","type":"journal_article","oa":1,"date_created":"2018-12-11T11:59:08Z","publication":"Duke Mathematical Journal","intvolume":"       163","publist_id":"4197","scopus_import":1,"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bourgade, Paul","first_name":"Paul","last_name":"Bourgade"},{"last_name":"Yau","first_name":"Horng","full_name":"Yau, Horng"}],"oa_version":"Preprint","citation":{"short":"L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.","mla":"Erdös, László, et al. “Universality of General β-Ensembles.” <i>Duke Mathematical Journal</i>, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:<a href=\"https://doi.org/10.1215/00127094-2649752\">10.1215/00127094-2649752</a>.","ieee":"L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,” <i>Duke Mathematical Journal</i>, vol. 163, no. 6. Duke University Press, pp. 1127–1190, 2014.","ama":"Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. <i>Duke Mathematical Journal</i>. 2014;163(6):1127-1190. doi:<a href=\"https://doi.org/10.1215/00127094-2649752\">10.1215/00127094-2649752</a>","chicago":"Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.” <i>Duke Mathematical Journal</i>. Duke University Press, 2014. <a href=\"https://doi.org/10.1215/00127094-2649752\">https://doi.org/10.1215/00127094-2649752</a>.","ista":"Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke Mathematical Journal. 163(6), 1127–1190.","apa":"Erdös, L., Bourgade, P., &#38; Yau, H. (2014). Universality of general β-ensembles. <i>Duke Mathematical Journal</i>. Duke University Press. <a href=\"https://doi.org/10.1215/00127094-2649752\">https://doi.org/10.1215/00127094-2649752</a>"},"date_updated":"2021-01-12T06:59:07Z","quality_controlled":"1","department":[{"_id":"LaEr"}],"title":"Universality of general β-ensembles","volume":163,"language":[{"iso":"eng"}],"date_published":"2014-04-01T00:00:00Z","publisher":"Duke University Press","issue":"6","abstract":[{"lang":"eng","text":"We prove the universality of the β-ensembles with convex analytic potentials and for any β &gt;\r\n0, i.e. we show that the spacing distributions of log-gases at any inverse temperature β coincide with those of the Gaussian β-ensembles."}],"publication_status":"published","month":"04"},{"month":"06","issue":"3-4","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":51,"project":[{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"}],"quality_controlled":"1","oa_version":"Preprint","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Randour","first_name":"Mickael","full_name":"Randour, Mickael"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"date_created":"2018-12-11T11:59:14Z","_id":"2716","type":"journal_article","article_type":"original","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1201.5073"}],"abstract":[{"text":"Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we study the strategy synthesis problem for games with such multi-dimensional objectives along with a parity condition, a canonical way to express ω ω -regular conditions. While in general, the winning strategies in such games may require infinite memory, for synthesis the most relevant problem is the construction of a finite-memory winning strategy (if one exists). Our main contributions are as follows. First, we show a tight exponential bound (matching upper and lower bounds) on the memory required for finite-memory winning strategies in both multi-dimensional mean-payoff and energy games along with parity objectives. This significantly improves the triple exponential upper bound for multi energy games (without parity) that could be derived from results in literature for games on vector addition systems with states. Second, we present an optimal symbolic and incremental algorithm to compute a finite-memory winning strategy (if one exists) in such games. Finally, we give a complete characterization of when finite memory of strategies can be traded off for randomness. In particular, we show that for one-dimension mean-payoff parity games, randomized memoryless strategies are as powerful as their pure finite-memory counterparts.","lang":"eng"}],"publication_status":"published","publisher":"Springer","date_published":"2014-06-01T00:00:00Z","title":"Strategy synthesis for multi-dimensional quantitative objectives","date_updated":"2023-02-21T16:06:56Z","department":[{"_id":"KrCh"}],"citation":{"apa":"Chatterjee, K., Randour, M., &#38; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>","ama":"Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional quantitative objectives. <i>Acta Informatica</i>. 2014;51(3-4):129-163. doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>","chicago":"Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0182-6\">https://doi.org/10.1007/s00236-013-0182-6</a>.","ista":"Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.","ieee":"K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.","mla":"Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:<a href=\"https://doi.org/10.1007/s00236-013-0182-6\">10.1007/s00236-013-0182-6</a>.","short":"K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1201.5073"]},"related_material":{"record":[{"id":"10904","relation":"earlier_version","status":"public"}]},"scopus_import":"1","intvolume":"        51","publist_id":"4176","arxiv":1,"publication":"Acta Informatica","oa":1,"acknowledgement":"Krishnendu Chatterjee is supported by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307: Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS. fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499: inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful to the anonymous reviewers for their insightful comments. ","day":"01","year":"2014","page":"129 - 163","doi":"10.1007/s00236-013-0182-6"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing House, 2014, pp. 31–50.","mla":"Edelsbrunner, Herbert, and Dmitriy Morozovy. <i>Persistent Homology: Theory and Practice</i>. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>.","ieee":"H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.","ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>","ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>.","apa":"Edelsbrunner, H., &#38; Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: European Mathematical Society Publishing House. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>"},"date_updated":"2021-01-12T07:00:36Z","department":[{"_id":"HeEd"}],"title":"Persistent homology: Theory and practice","file_date_updated":"2020-07-14T12:45:52Z","date_published":"2014-01-01T00:00:00Z","publisher":"European Mathematical Society Publishing House","ddc":["000"],"abstract":[{"lang":"eng","text":"Persistent homology is a recent grandchild of homology that has found use in\r\nscience and engineering as well as in mathematics. This paper surveys the method as well\r\nas the applications, neglecting completeness in favor of highlighting ideas and directions."}],"publication_status":"published","page":"31 - 50","year":"2014","doi":"10.4171/120-1/3","day":"01","acknowledgement":"This research is partially supported by NSF under grant DBI-0820624, by ESF under the Research Networking Programme, and by the Russian Government Project 11.G34.31.0053.","oa":1,"publist_id":"3842","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Dmitriy","last_name":"Morozovy","full_name":"Morozovy, Dmitriy"}],"oa_version":"Submitted Version","quality_controlled":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"file":[{"file_size":435320,"access_level":"open_access","creator":"system","file_id":"5232","checksum":"1d4a046f1af945c407c5c4d411d4c5e4","relation":"main_file","file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf","date_updated":"2020-07-14T12:45:52Z","date_created":"2018-12-12T10:16:43Z","content_type":"application/pdf"}],"month":"01","has_accepted_license":"1","status":"public","type":"conference","_id":"2905","date_created":"2018-12-11T12:00:16Z","conference":{"name":"ECM: European Congress of Mathematics","location":"Kraków, Poland","end_date":"2012-07-07","start_date":"2012-07-02"},"pubrep_id":"544"},{"date_created":"2018-12-11T12:02:20Z","type":"journal_article","_id":"3263","status":"public","pubrep_id":"432","quality_controlled":"1","oa_version":"Published Version","author":[{"orcid":"0000-0002-6699-1455","last_name":"Tkacik","first_name":"Gasper","full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ghosh","first_name":"Anandamohan","full_name":"Ghosh, Anandamohan"},{"last_name":"Schneidman","first_name":"Elad","full_name":"Schneidman, Elad"},{"full_name":"Segev, Ronen","first_name":"Ronen","last_name":"Segev"}],"month":"01","has_accepted_license":"1","file":[{"creator":"system","checksum":"1d5816b343abe5eadc3eb419bcece971","file_id":"5011","file_size":1568524,"access_level":"open_access","relation":"main_file","file_name":"IST-2016-432-v1+1_journal.pone.0085841.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-12T10:13:28Z"}],"article_number":"e85841","issue":"1","language":[{"iso":"eng"}],"volume":9,"oa":1,"acknowledgement":"This work was supported by The Israel Science Foundation and The Human Frontiers Science Program.\r\nWe thank the referees for helping significantly improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason Prentice for stimulating discussions. GT wishes to thank the faculty and students of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory, Woods Hole.\r\n","day":"21","year":"2014","doi":"10.1371/journal.pone.0085841","scopus_import":1,"publist_id":"3385","intvolume":"         9","publication":"PLoS One","department":[{"_id":"GaTk"}],"date_updated":"2021-01-12T07:42:14Z","citation":{"apa":"Tkačik, G., Ghosh, A., Schneidman, E., &#38; Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>","ista":"Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.","ama":"Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. 2014;9(1). doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>","chicago":"Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>.","ieee":"G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” <i>PLoS One</i>, vol. 9, no. 1. Public Library of Science, 2014.","mla":"Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>, vol. 9, no. 1, e85841, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>.","short":"G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014)."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution."}],"ddc":["570"],"publisher":"Public Library of Science","date_published":"2014-01-21T00:00:00Z","file_date_updated":"2020-07-14T12:46:06Z","title":"Adaptation to changes in higher-order stimulus statistics in the salamander retina"},{"publication_identifier":{"issn":["0914-3505"]},"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/cga.12039"}],"date_created":"2022-03-04T08:17:25Z","article_type":"original","type":"journal_article","_id":"10815","language":[{"iso":"eng"}],"volume":54,"article_processing_charge":"No","month":"02","issue":"1","author":[{"first_name":"Masakazu","last_name":"Hashimoto","full_name":"Hashimoto, Masakazu"},{"last_name":"Morita","first_name":"Hitoshi","id":"4C6E54C6-F248-11E8-B48F-1D18A9856A87","full_name":"Morita, Hitoshi"},{"last_name":"Ueno","first_name":"Naoto","full_name":"Ueno, Naoto"}],"quality_controlled":"1","oa_version":"None","intvolume":"        54","publication":"Congenital Anomalies","scopus_import":"1","keyword":["Developmental Biology","Embryology","General Medicine","Pediatrics","Perinatology","and Child Health"],"acknowledgement":"The authors thank all the members of the Division of Morphogenesis, National Institute for Basic Biology, for their contributions to the research, their encouragement, and helpful discussions, particularly Dr M. Suzuki for his critical reading of the manuscript. We also thank the Model Animal Research and Spectrography and Bioimaging Facilities, NIBB Core Research Facilities, for technical support. M.H. was supported by a research fellowship from the Japan Society for the Promotion of Science (JSPS). Our work introduced in this review was supported by a Grant-in-Aid for Scientific Research on Innovative Areas from the Ministry of Education, Culture, Sports, Science, and Technology (MEXT), Japan, to N.U.","year":"2014","doi":"10.1111/cga.12039","page":"1-7","day":"01","oa":1,"pmid":1,"date_published":"2014-02-01T00:00:00Z","publisher":"Wiley","title":"Molecular and cellular mechanisms of development underlying congenital diseases","publication_status":"published","abstract":[{"text":"In the last several decades, developmental biology has clarified the molecular mechanisms of embryogenesis and organogenesis. In particular, it has demonstrated that the “tool-kit genes” essential for regulating developmental processes are not only highly conserved among species, but are also used as systems at various times and places in an organism to control distinct developmental events. Therefore, mutations in many of these tool-kit genes may cause congenital diseases involving morphological abnormalities. This link between genes and abnormal morphological phenotypes underscores the importance of understanding how cells behave and contribute to morphogenesis as a result of gene function. Recent improvements in live imaging and in quantitative analyses of cellular dynamics will advance our understanding of the cellular pathogenesis of congenital diseases associated with aberrant morphologies. In these studies, it is critical to select an appropriate model organism for the particular phenomenon of interest.","lang":"eng"}],"external_id":{"pmid":["24666178"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"CaHe"}],"date_updated":"2022-03-04T08:26:05Z","citation":{"mla":"Hashimoto, Masakazu, et al. “Molecular and Cellular Mechanisms of Development Underlying Congenital Diseases.” <i>Congenital Anomalies</i>, vol. 54, no. 1, Wiley, 2014, pp. 1–7, doi:<a href=\"https://doi.org/10.1111/cga.12039\">10.1111/cga.12039</a>.","short":"M. Hashimoto, H. Morita, N. Ueno, Congenital Anomalies 54 (2014) 1–7.","apa":"Hashimoto, M., Morita, H., &#38; Ueno, N. (2014). Molecular and cellular mechanisms of development underlying congenital diseases. <i>Congenital Anomalies</i>. Wiley. <a href=\"https://doi.org/10.1111/cga.12039\">https://doi.org/10.1111/cga.12039</a>","chicago":"Hashimoto, Masakazu, Hitoshi Morita, and Naoto Ueno. “Molecular and Cellular Mechanisms of Development Underlying Congenital Diseases.” <i>Congenital Anomalies</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/cga.12039\">https://doi.org/10.1111/cga.12039</a>.","ista":"Hashimoto M, Morita H, Ueno N. 2014. Molecular and cellular mechanisms of development underlying congenital diseases. Congenital Anomalies. 54(1), 1–7.","ama":"Hashimoto M, Morita H, Ueno N. Molecular and cellular mechanisms of development underlying congenital diseases. <i>Congenital Anomalies</i>. 2014;54(1):1-7. doi:<a href=\"https://doi.org/10.1111/cga.12039\">10.1111/cga.12039</a>","ieee":"M. Hashimoto, H. Morita, and N. Ueno, “Molecular and cellular mechanisms of development underlying congenital diseases,” <i>Congenital Anomalies</i>, vol. 54, no. 1. Wiley, pp. 1–7, 2014."}},{"language":[{"iso":"eng"}],"volume":8318,"article_processing_charge":"No","month":"01","author":[{"first_name":"Benjamin","last_name":"Aminof","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","full_name":"Aminof, Benjamin"},{"last_name":"Jacobs","first_name":"Swen","full_name":"Jacobs, Swen"},{"full_name":"Khalimov, Ayrat","first_name":"Ayrat","last_name":"Khalimov"},{"first_name":"Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha"}],"quality_controlled":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"oa_version":"Preprint","conference":{"start_date":"2014-01-19","end_date":"2014-01-21","location":"San Diego, CA, United States","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation"},"ec_funded":1,"status":"public","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1311.4425"}],"publication_identifier":{"isbn":["9783642540127"],"eisbn":["9783642540134"],"issn":["0302-9743"],"eissn":["1611-3349"]},"date_created":"2022-03-18T13:01:22Z","_id":"10884","type":"conference","publisher":"Springer Nature","date_published":"2014-01-30T00:00:00Z","title":"Parameterized model checking of token-passing systems","publication_status":"published","abstract":[{"lang":"eng","text":"We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL  ∗ \\X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL  ∗ \\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \\X, provided processes cannot choose the directions for sending or receiving the token.\r\nWe unify and substantially extend these results by systematically exploring fragments of indexed CTL  ∗ \\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token."}],"external_id":{"arxiv":["1311.4425"]},"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"date_updated":"2022-05-17T08:36:01Z","citation":{"mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” <i>Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">10.1007/978-3-642-54013-4_15</a>.","short":"B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in <i>Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","apa":"Aminof, B., Jacobs, S., Khalimov, A., &#38; Rubin, S. (2014). Parameterized model checking of token-passing systems. In <i>Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">https://doi.org/10.1007/978-3-642-54013-4_15</a>","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: <i>Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:262-281. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">10.1007/978-3-642-54013-4_15</a>","chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In <i>Verification, Model Checking, and Abstract Interpretation</i>, 8318:262–81. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">https://doi.org/10.1007/978-3-642-54013-4_15</a>.","ista":"Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281."},"arxiv":1,"intvolume":"      8318","publication":"Verification, Model Checking, and Abstract Interpretation","scopus_import":"1","acknowledgement":"This work was supported by the Austrian Science Fund through grant P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23); ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants PROSEED, ICT12-059, and VRG11-005.","doi":"10.1007/978-3-642-54013-4_15","page":"262-281","day":"30","year":"2014","oa":1},{"date_created":"2022-04-07T07:50:04Z","_id":"11080","type":"journal_article","article_type":"original","status":"public","publication_identifier":{"issn":["0092-8674"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cell.2014.02.004"}],"month":"02","issue":"5","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":156,"quality_controlled":"1","oa_version":"Published Version","author":[{"full_name":"Buchwalter, Abigail","first_name":"Abigail","last_name":"Buchwalter"},{"first_name":"Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W"}],"scopus_import":"1","keyword":["General Biochemistry","Genetics and Molecular Biology"],"intvolume":"       156","publication":"Cell","oa":1,"year":"2014","doi":"10.1016/j.cell.2014.02.004","page":"868-869","day":"27","abstract":[{"text":"The spindle assembly checkpoint prevents separation of sister chromatids until each kinetochore is attached to the mitotic spindle. Rodriguez-Bravo et al. report that the nuclear pore complex scaffolds spindle assembly checkpoint signaling in interphase, providing a store of inhibitory signals that limits the speed of the subsequent mitosis.","lang":"eng"}],"publication_status":"published","publisher":"Elsevier","date_published":"2014-02-27T00:00:00Z","pmid":1,"title":"Nuclear pores set the speed limit for mitosis","date_updated":"2022-07-18T08:44:33Z","extern":"1","citation":{"mla":"Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit for Mitosis.” <i>Cell</i>, vol. 156, no. 5, Elsevier, 2014, pp. 868–69, doi:<a href=\"https://doi.org/10.1016/j.cell.2014.02.004\">10.1016/j.cell.2014.02.004</a>.","short":"A. Buchwalter, M. Hetzer, Cell 156 (2014) 868–869.","ieee":"A. Buchwalter and M. Hetzer, “Nuclear pores set the speed limit for mitosis,” <i>Cell</i>, vol. 156, no. 5. Elsevier, pp. 868–869, 2014.","apa":"Buchwalter, A., &#38; Hetzer, M. (2014). Nuclear pores set the speed limit for mitosis. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2014.02.004\">https://doi.org/10.1016/j.cell.2014.02.004</a>","ista":"Buchwalter A, Hetzer M. 2014. Nuclear pores set the speed limit for mitosis. Cell. 156(5), 868–869.","chicago":"Buchwalter, Abigail, and Martin Hetzer. “Nuclear Pores Set the Speed Limit for Mitosis.” <i>Cell</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.cell.2014.02.004\">https://doi.org/10.1016/j.cell.2014.02.004</a>.","ama":"Buchwalter A, Hetzer M. Nuclear pores set the speed limit for mitosis. <i>Cell</i>. 2014;156(5):868-869. doi:<a href=\"https://doi.org/10.1016/j.cell.2014.02.004\">10.1016/j.cell.2014.02.004</a>"},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","external_id":{"pmid":["24581486"]}},{"extern":"1","date_updated":"2022-07-18T08:45:09Z","citation":{"mla":"Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development and Disease.” <i>Journal of Cell Biology</i>, vol. 205, no. 2, Rockefeller University Press, 2014, pp. 133–41, doi:<a href=\"https://doi.org/10.1083/jcb.201402003\">10.1083/jcb.201402003</a>.","short":"E. Hatch, M. Hetzer, Journal of Cell Biology 205 (2014) 133–141.","ieee":"E. Hatch and M. Hetzer, “Breaching the nuclear envelope in development and disease,” <i>Journal of Cell Biology</i>, vol. 205, no. 2. Rockefeller University Press, pp. 133–141, 2014.","chicago":"Hatch, Emily, and Martin Hetzer. “Breaching the Nuclear Envelope in Development and Disease.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2014. <a href=\"https://doi.org/10.1083/jcb.201402003\">https://doi.org/10.1083/jcb.201402003</a>.","ama":"Hatch E, Hetzer M. Breaching the nuclear envelope in development and disease. <i>Journal of Cell Biology</i>. 2014;205(2):133-141. doi:<a href=\"https://doi.org/10.1083/jcb.201402003\">10.1083/jcb.201402003</a>","ista":"Hatch E, Hetzer M. 2014. Breaching the nuclear envelope in development and disease. Journal of Cell Biology. 205(2), 133–141.","apa":"Hatch, E., &#38; Hetzer, M. (2014). Breaching the nuclear envelope in development and disease. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201402003\">https://doi.org/10.1083/jcb.201402003</a>"},"external_id":{"pmid":["24751535"]},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","publication_status":"published","abstract":[{"lang":"eng","text":"In eukaryotic cells the nuclear genome is enclosed by the nuclear envelope (NE). In metazoans, the NE breaks down in mitosis and it has been assumed that the physical barrier separating nucleoplasm and cytoplasm remains intact during the rest of the cell cycle and cell differentiation. However, recent studies suggest that nonmitotic NE remodeling plays a critical role in development, virus infection, laminopathies, and cancer. Although the mechanisms underlying these NE restructuring events are currently being defined, one common theme is activation of protein kinase C family members in the interphase nucleus to disrupt the nuclear lamina, demonstrating the importance of the lamina in maintaining nuclear integrity."}],"pmid":1,"publisher":"Rockefeller University Press","date_published":"2014-04-21T00:00:00Z","title":"Breaching the nuclear envelope in development and disease","oa":1,"day":"21","doi":"10.1083/jcb.201402003","year":"2014","page":"133-141","keyword":["Cell Biology"],"scopus_import":"1","intvolume":"       205","publication":"Journal of Cell Biology","quality_controlled":"1","oa_version":"Published Version","author":[{"full_name":"Hatch, Emily","first_name":"Emily","last_name":"Hatch"},{"orcid":"0000-0002-2111-992X","first_name":"Martin W","last_name":"HETZER","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"month":"04","issue":"2","language":[{"iso":"eng"}],"volume":205,"article_processing_charge":"No","date_created":"2022-04-07T07:50:13Z","article_type":"review","_id":"11081","type":"journal_article","main_file_link":[{"url":"https://doi.org/10.1083/jcb.201402003","open_access":"1"}],"publication_identifier":{"issn":["1540-8140","0021-9525"]},"status":"public"},{"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","citation":{"mla":"Buchwalter, Abigail L., et al. “Nup50 Is Required for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” <i>Molecular Biology of the Cell</i>, vol. 25, no. 16, American Society for Cell Biology, 2014, pp. 2472–84, doi:<a href=\"https://doi.org/10.1091/mbc.e14-04-0865\">10.1091/mbc.e14-04-0865</a>.","short":"A.L. Buchwalter, Y. Liang, M. Hetzer, Molecular Biology of the Cell 25 (2014) 2472–2484.","ama":"Buchwalter AL, Liang Y, Hetzer M. Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. <i>Molecular Biology of the Cell</i>. 2014;25(16):2472-2484. doi:<a href=\"https://doi.org/10.1091/mbc.e14-04-0865\">10.1091/mbc.e14-04-0865</a>","chicago":"Buchwalter, Abigail L., Yun Liang, and Martin Hetzer. “Nup50 Is Required for Cell Differentiation and Exhibits Transcription-Dependent Dynamics.” <i>Molecular Biology of the Cell</i>. American Society for Cell Biology, 2014. <a href=\"https://doi.org/10.1091/mbc.e14-04-0865\">https://doi.org/10.1091/mbc.e14-04-0865</a>.","ista":"Buchwalter AL, Liang Y, Hetzer M. 2014. Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. Molecular Biology of the Cell. 25(16), 2472–2484.","apa":"Buchwalter, A. L., Liang, Y., &#38; Hetzer, M. (2014). Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics. <i>Molecular Biology of the Cell</i>. American Society for Cell Biology. <a href=\"https://doi.org/10.1091/mbc.e14-04-0865\">https://doi.org/10.1091/mbc.e14-04-0865</a>","ieee":"A. L. Buchwalter, Y. Liang, and M. Hetzer, “Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics,” <i>Molecular Biology of the Cell</i>, vol. 25, no. 16. American Society for Cell Biology, pp. 2472–2484, 2014."},"extern":"1","date_updated":"2022-07-18T08:45:20Z","title":"Nup50 is required for cell differentiation and exhibits transcription-dependent dynamics","date_published":"2014-08-15T00:00:00Z","publisher":"American Society for Cell Biology","publication_status":"published","abstract":[{"lang":"eng","text":"The nuclear pore complex (NPC) plays a critical role in gene expression by mediating import of transcription regulators into the nucleus and export of RNA transcripts to the cytoplasm. Emerging evidence suggests that in addition to mediating transport, a subset of nucleoporins (Nups) engage in transcriptional activation and elongation at genomic loci that are not associated with NPCs. The underlying mechanism and regulation of Nup mobility on and off nuclear pores remain unclear. Here we show that Nup50 is a mobile Nup with a pronounced presence both at the NPC and in the nucleoplasm that can move between these different localizations. Strikingly, the dynamic behavior of Nup50 in both locations is dependent on active transcription by RNA polymerase II and requires the N-terminal half of the protein, which contains importin α– and Nup153-binding domains. However, Nup50 dynamics are independent of importin α, Nup153, and Nup98, even though the latter two proteins also exhibit transcription-dependent mobility. Of interest, depletion of Nup50 from C2C12 myoblasts does not affect cell proliferation but inhibits differentiation into myotubes. Taken together, our results suggest a transport-independent role for Nup50 in chromatin biology that occurs away from the NPC."}],"page":"2472-2484","doi":"10.1091/mbc.e14-04-0865","year":"2014","day":"15","oa":1,"publication":"Molecular Biology of the Cell","intvolume":"        25","scopus_import":"1","keyword":["Cell Biology","Molecular Biology"],"author":[{"full_name":"Buchwalter, Abigail L.","first_name":"Abigail L.","last_name":"Buchwalter"},{"full_name":"Liang, Yun","first_name":"Yun","last_name":"Liang"},{"first_name":"Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W"}],"oa_version":"Published Version","quality_controlled":"1","volume":25,"article_processing_charge":"No","language":[{"iso":"eng"}],"issue":"16","month":"08","publication_identifier":{"issn":["1059-1524","1939-4586"]},"status":"public","main_file_link":[{"url":"https://doi.org/10.1091/mbc.e14-04-0865","open_access":"1"}],"article_type":"original","_id":"11082","type":"journal_article","date_created":"2022-04-07T07:50:24Z"},{"oa":1,"year":"2014","day":"21","doi":"10.1093/mnras/stu1343","page":"2695-2704","acknowledgement":"First, we acknowledge the referee for their comments, which have improved the clarity of this paper. JPS and IRS acknowledge support from STFC (ST/I001573/1). IRS also acknowledges support from the ERC Advanced Investigator programme DUSTYGAL and a Royal Society/Wolfson Merit Award. DS acknowledges financial support from NWO through a Veni fellowship and from FCT through the award of an FCT-IF starting grant. PNB acknowledges STFC for financial support.","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: abundances","galaxies: evolution","galaxies: kinematics and dynamics"],"scopus_import":"1","publication":"Monthly Notices of the Royal Astronomical Society","intvolume":"       443","arxiv":1,"citation":{"ieee":"J. P. Stott <i>et al.</i>, “A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 443, no. 3. Oxford University Press, pp. 2695–2704, 2014.","apa":"Stott, J. P., Sobral, D., Swinbank, A. M., Smail, I., Bower, R., Best, P. N., … Matthee, J. J. (2014). A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stu1343\">https://doi.org/10.1093/mnras/stu1343</a>","chicago":"Stott, John P., David Sobral, A. M. Swinbank, Ian Smail, Richard Bower, Philip N. Best, Ray M. Sharples, James E. Geach, and Jorryt J Matthee. “A Relationship between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/mnras/stu1343\">https://doi.org/10.1093/mnras/stu1343</a>.","ista":"Stott JP, Sobral D, Swinbank AM, Smail I, Bower R, Best PN, Sharples RM, Geach JE, Matthee JJ. 2014. A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. Monthly Notices of the Royal Astronomical Society. 443(3), 2695–2704.","ama":"Stott JP, Sobral D, Swinbank AM, et al. A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS. <i>Monthly Notices of the Royal Astronomical Society</i>. 2014;443(3):2695-2704. doi:<a href=\"https://doi.org/10.1093/mnras/stu1343\">10.1093/mnras/stu1343</a>","short":"J.P. Stott, D. Sobral, A.M. Swinbank, I. Smail, R. Bower, P.N. Best, R.M. Sharples, J.E. Geach, J.J. Matthee, Monthly Notices of the Royal Astronomical Society 443 (2014) 2695–2704.","mla":"Stott, John P., et al. “A Relationship between Specific Star Formation Rate and Metallicity Gradient within z ∼ 1 Galaxies from KMOS-HiZELS.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 443, no. 3, Oxford University Press, 2014, pp. 2695–704, doi:<a href=\"https://doi.org/10.1093/mnras/stu1343\">10.1093/mnras/stu1343</a>."},"date_updated":"2022-08-19T08:27:25Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1407.1047"]},"abstract":[{"lang":"eng","text":"We have observed a sample of typical z ∼ 1 star-forming galaxies, selected from the HiZELS survey, with the new K-band Multi-Object Spectrograph (KMOS) near-infrared, multi-integral field unit instrument on the Very Large Telescope (VLT), in order to obtain their dynamics and metallicity gradients. The majority of our galaxies have a metallicity gradient consistent with being flat or negative (i.e. higher metallicity cores than outskirts). Intriguingly, we find a trend between metallicity gradient and specific star formation rate (sSFR), such that galaxies with a high sSFR tend to have relatively metal poor centres, a result which is strengthened when combined with data sets from the literature. This result appears to explain the discrepancies reported between different high-redshift studies and varying claims for evolution. From a galaxy evolution perspective, the trend we see would mean that a galaxy's sSFR is governed by the amount of metal-poor gas that can be funnelled into its core, triggered either by merging or through efficient accretion. In fact, merging may play a significant role as it is the starburst galaxies at all epochs, which have the more positive metallicity gradients. Our results may help to explain the origin of the fundamental metallicity relation, in which galaxies at a fixed mass are observed to have lower metallicities at higher star formation rates, especially if the metallicity is measured in an aperture encompassing only the central regions of the galaxy. Finally, we note that this study demonstrates the power of KMOS as an efficient instrument for large-scale resolved galaxy surveys."}],"publication_status":"published","title":"A relationship between specific star formation rate and metallicity gradient within z ∼ 1 galaxies from KMOS-HiZELS","publisher":"Oxford University Press","date_published":"2014-09-21T00:00:00Z","_id":"11582","type":"journal_article","article_type":"original","date_created":"2022-07-14T12:16:10Z","publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1407.1047"}],"status":"public","oa_version":"Preprint","quality_controlled":"1","author":[{"full_name":"Stott, John P.","first_name":"John P.","last_name":"Stott"},{"first_name":"David","last_name":"Sobral","full_name":"Sobral, David"},{"full_name":"Swinbank, A. M.","last_name":"Swinbank","first_name":"A. M."},{"first_name":"Ian","last_name":"Smail","full_name":"Smail, Ian"},{"full_name":"Bower, Richard","last_name":"Bower","first_name":"Richard"},{"full_name":"Best, Philip N.","last_name":"Best","first_name":"Philip N."},{"first_name":"Ray M.","last_name":"Sharples","full_name":"Sharples, Ray M."},{"first_name":"James E.","last_name":"Geach","full_name":"Geach, James E."},{"full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","last_name":"Matthee","first_name":"Jorryt J"}],"issue":"3","month":"09","article_processing_charge":"No","volume":443,"language":[{"iso":"eng"}]},{"oa":1,"acknowledgement":"We thank the anonymous referee for the comments and suggestions which improved both the quality and clarity of this work. DS acknowledges financial support from the Netherlands Organisation for Scientific Research (NWO) through a Veni fellowship. IRS acknowledges support from STFC (ST/I001573/1), a Leverhulme Fellowship, the ERC Advanced Investigator programme DUSTYGAL 321334 and a Royal Society/Wolfson Merit Award. PNB acknowledges support from the Leverhulme Trust. JWK acknowledges the support from the Creative Research Initiative Program, no. 2008- 0060544, of the National Research Foundation of Korea (NRF) funded by the Korean government (MSIP). JPUF and BMJ acknowledge support from the ERC-StG grant EGGS-278202. The Dark Cosmology Centre is funded by the Danish National Research Foundation. This work is based in part on data obtained as part of the UKIRT Infrared Deep Sky Survey. Based on observations obtained with MegaPrime/MegaCam, a joint project of CFHT and CEA/IRFU, at the Canada–France–Hawaii Telescope (CFHT) which is operated by the National Research Council (NRC) of Canada, the Institut National des Science de l’Univers of the Centre National de la Recherche Scientifique (CNRS) of France and the University of Hawaii. This work is based in part on data products produced at Terapix available at the Canadian Astronomy Data Centre as part of the Canada-France-Hawaii Telescope Legacy Survey, a collaborative project of NRC and CNRS. This work was only possible due to OPTICON/FP7 and the access that it granted to the CFHT telescope. The authors also wish to acknowledge the CFHTLS and UKIDSS surveys for their excellent legacy and complementary value – without such high-quality data sets, this research would not have been possible.","year":"2014","day":"21","doi":"10.1093/mnras/stu392","page":"2375-2387","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","cosmology: observations","dark ages","reionization","first stars"],"scopus_import":"1","arxiv":1,"intvolume":"       440","publication":"Monthly Notices of the Royal Astronomical Society","extern":"1","date_updated":"2022-08-19T08:30:30Z","citation":{"apa":"Matthee, J. J., Sobral, D., Swinbank, A. M., Smail, I., Best, P. N., Kim, J.-W., … Fynbo, J. (2014). A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/stu392\">https://doi.org/10.1093/mnras/stu392</a>","ista":"Matthee JJ, Sobral D, Swinbank AM, Smail I, Best PN, Kim J-W, Franx M, Milvang-Jensen B, Fynbo J. 2014. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. Monthly Notices of the Royal Astronomical Society. 440(3), 2375–2387.","chicago":"Matthee, Jorryt J, David Sobral, A. M. Swinbank, Ian Smail, P. N. Best, Jae-Woo Kim, Marijn Franx, Bo Milvang-Jensen, and Johan Fynbo. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity Function and Implications for Other Surveys.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/mnras/stu392\">https://doi.org/10.1093/mnras/stu392</a>.","ama":"Matthee JJ, Sobral D, Swinbank AM, et al. A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys. <i>Monthly Notices of the Royal Astronomical Society</i>. 2014;440(3):2375-2387. doi:<a href=\"https://doi.org/10.1093/mnras/stu392\">10.1093/mnras/stu392</a>","ieee":"J. J. Matthee <i>et al.</i>, “A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 440, no. 3. Oxford University Press, pp. 2375–2387, 2014.","mla":"Matthee, Jorryt J., et al. “A 10 Deg2 Lyman α Survey at Z=8.8 with Spectroscopic Follow-up: Strong Constraints on the Luminosity Function and Implications for Other Surveys.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 440, no. 3, Oxford University Press, 2014, pp. 2375–87, doi:<a href=\"https://doi.org/10.1093/mnras/stu392\">10.1093/mnras/stu392</a>.","short":"J.J. Matthee, D. Sobral, A.M. Swinbank, I. Smail, P.N. Best, J.-W. Kim, M. Franx, B. Milvang-Jensen, J. Fynbo, Monthly Notices of the Royal Astronomical Society 440 (2014) 2375–2387."},"external_id":{"arxiv":["1402.6697"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"Candidate galaxies at redshifts of z ∼ 10 are now being found in extremely deep surveys, probing very small areas. As a consequence, candidates are very faint, making spectroscopic confirmation practically impossible. In order to overcome such limitations, we have undertaken the CF-HiZELS survey, which is a large-area, medium-depth near-infrared narrow-band survey targeted at z = 8.8 Lyman α (Lyα) emitters (LAEs) and covering 10 deg2 in part of the SSA22 field with the Canada–France–Hawaii Telescope (CFHT). We surveyed a comoving volume of 4.7 × 106 Mpc3 to a Lyα luminosity limit of 6.3 × 1043舁erg舁s−1. We look for Lyα candidates by applying the following criteria: (i) clear emission-line source, (ii) no optical detections (ugriz from CFHTLS), (iii) no visible detection in the optical stack (ugriz > 27), (iv) visually checked reliable NBJ and J detections and (v) J − K ≤ 0. We compute photometric redshifts and remove a significant amount of dusty lower redshift line-emitters at z ∼ 1.4 or 2.2. A total of 13 Lyα candidates were found, of which two are marked as strong candidates, but the majority have very weak constraints on their spectral energy distributions. Using follow-up observations with SINFONI/VLT, we are able to exclude the most robust candidates as LAEs. We put a strong constraint on the Lyα luminosity function at z ∼ 9 and make realistic predictions for ongoing and future surveys. Our results show that surveys for the highest redshift LAEs are susceptible of multiple contaminations and that spectroscopic follow-up is absolutely necessary."}],"date_published":"2014-05-21T00:00:00Z","publisher":"Oxford University Press","title":"A 10 deg2 Lyman α survey at z=8.8 with spectroscopic follow-up: Strong constraints on the luminosity function and implications for other surveys","date_created":"2022-07-14T12:33:24Z","article_type":"original","_id":"11583","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.6697"}],"publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"status":"public","quality_controlled":"1","oa_version":"Preprint","author":[{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","first_name":"Jorryt J","last_name":"Matthee","orcid":"0000-0003-2871-127X"},{"last_name":"Sobral","first_name":"David","full_name":"Sobral, David"},{"full_name":"Swinbank, A. M.","first_name":"A. M.","last_name":"Swinbank"},{"full_name":"Smail, Ian","last_name":"Smail","first_name":"Ian"},{"last_name":"Best","first_name":"P. N.","full_name":"Best, P. N."},{"full_name":"Kim, Jae-Woo","first_name":"Jae-Woo","last_name":"Kim"},{"last_name":"Franx","first_name":"Marijn","full_name":"Franx, Marijn"},{"first_name":"Bo","last_name":"Milvang-Jensen","full_name":"Milvang-Jensen, Bo"},{"first_name":"Johan","last_name":"Fynbo","full_name":"Fynbo, Johan"}],"month":"05","issue":"3","language":[{"iso":"eng"}],"volume":440,"article_processing_charge":"No"},{"oa":1,"day":"01","page":"260 - 271","doi":"10.1007/978-3-662-44777-2_22","year":"2014","scopus_import":"1","publication":"22nd Annual European Symposium on Algorithms","arxiv":1,"intvolume":"      8737","citation":{"ama":"Charikar M, Henzinger MH, Nguyễn HL. Online bipartite matching with decomposable weights. In: <i>22nd Annual European Symposium on Algorithms</i>. Vol 8737. Springer Nature; 2014:260-271. doi:<a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">10.1007/978-3-662-44777-2_22</a>","ista":"Charikar M, Henzinger MH, Nguyễn HL. 2014. Online bipartite matching with decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LNCS, vol. 8737, 260–271.","chicago":"Charikar, Moses, Monika H Henzinger, and Huy L. Nguyễn. “Online Bipartite Matching with Decomposable Weights.” In <i>22nd Annual European Symposium on Algorithms</i>, 8737:260–71. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">https://doi.org/10.1007/978-3-662-44777-2_22</a>.","apa":"Charikar, M., Henzinger, M. H., &#38; Nguyễn, H. L. (2014). Online bipartite matching with decomposable weights. In <i>22nd Annual European Symposium on Algorithms</i> (Vol. 8737, pp. 260–271). Wroclaw, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">https://doi.org/10.1007/978-3-662-44777-2_22</a>","ieee":"M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching with decomposable weights,” in <i>22nd Annual European Symposium on Algorithms</i>, Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.","short":"M. Charikar, M.H. Henzinger, H.L. Nguyễn, in:, 22nd Annual European Symposium on Algorithms, Springer Nature, 2014, pp. 260–271.","mla":"Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.” <i>22nd Annual European Symposium on Algorithms</i>, vol. 8737, Springer Nature, 2014, pp. 260–71, doi:<a href=\"https://doi.org/10.1007/978-3-662-44777-2_22\">10.1007/978-3-662-44777-2_22</a>."},"extern":"1","date_updated":"2023-02-13T11:16:24Z","external_id":{"arxiv":["1409.2139"]},"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"We study a weighted online bipartite matching problem: G(V 1, V 2, E) is a weighted bipartite graph where V 1 is known beforehand and the vertices of V 2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices in V 1, so as to maximize the sum of weights of edges in the matching. If assignments to V 1 cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with free disposal, where vertices in V 1 can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over the course of the algorithm. For this problem, the greedy algorithm is 0.5-competitive and determining whether a better competitive ratio is achievable is a well known open problem.\r\n\r\nWe identify an interesting special case where the edge weights are decomposable as the product of two factors, one corresponding to each end point of the edge. This is analogous to the well studied related machines model in the scheduling literature, although the objective functions are different. For this case of decomposable edge weights, we design a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show that such instances with decomposable weights are non-trivial by establishing upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.\r\n\r\nA tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1 case as well as the case where edge weights depend on the offline vertices only, but for these cases, reassignments cannot change the quality of the solution. Beating 0.5 for weighted matching where reassignments are necessary has been a significant challenge. We thus give the first online algorithm with competitive ratio strictly better than 0.5 for a non-trivial case of weighted matching with free disposal."}],"title":"Online bipartite matching with decomposable weights","publisher":"Springer Nature","date_published":"2014-09-01T00:00:00Z","type":"conference","_id":"11789","date_created":"2022-08-11T10:41:47Z","publication_identifier":{"issn":["0302-9743"],"isbn":["978-366244776-5"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1409.2139"}],"status":"public","conference":{"end_date":"2014-09-10","start_date":"2014-09-08","name":"ESA: Annual European Symposium on Algorithms","location":"Wroclaw, Poland"},"oa_version":"Preprint","quality_controlled":"1","author":[{"full_name":"Charikar, Moses","first_name":"Moses","last_name":"Charikar"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"last_name":"Nguyễn","first_name":"Huy L.","full_name":"Nguyễn, Huy L."}],"month":"09","volume":8737,"article_processing_charge":"No","language":[{"iso":"eng"}]},{"status":"public","publication_identifier":{"issn":["0031-9007","1079-7114"]},"main_file_link":[{"url":"https://arxiv.org/abs/1306.1285","open_access":"1"}],"date_created":"2020-04-30T11:42:39Z","type":"journal_article","_id":"7771","article_type":"letter_note","author":[{"orcid":"0000-0002-1307-5074","last_name":"Goodrich","first_name":"Carl Peter","full_name":"Goodrich, Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425"},{"first_name":"Andrea J.","last_name":"Liu","full_name":"Liu, Andrea J."},{"full_name":"Nagel, Sidney R.","first_name":"Sidney R.","last_name":"Nagel"}],"oa_version":"Preprint","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":112,"month":"04","issue":"4","article_number":"049801 ","doi":"10.1103/physrevlett.112.049801","year":"2014","day":"20","oa":1,"intvolume":"       112","arxiv":1,"publication":"Physical Review Letters","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1306.1285"]},"date_updated":"2021-01-12T08:15:26Z","extern":"1","citation":{"ieee":"C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Comment on ‘Repulsive contact interactions make jammed particulate systems inherently nonharmonic,’” <i>Physical Review Letters</i>, vol. 112, no. 4. American Physical Society, 2014.","apa":"Goodrich, C. P., Liu, A. J., &#38; Nagel, S. R. (2014). Comment on “Repulsive contact interactions make jammed particulate systems inherently nonharmonic.” <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.112.049801\">https://doi.org/10.1103/physrevlett.112.049801</a>","ama":"Goodrich CP, Liu AJ, Nagel SR. Comment on “Repulsive contact interactions make jammed particulate systems inherently nonharmonic.” <i>Physical Review Letters</i>. 2014;112(4). doi:<a href=\"https://doi.org/10.1103/physrevlett.112.049801\">10.1103/physrevlett.112.049801</a>","ista":"Goodrich CP, Liu AJ, Nagel SR. 2014. Comment on “Repulsive contact interactions make jammed particulate systems inherently nonharmonic”. Physical Review Letters. 112(4), 049801.","chicago":"Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “Comment on ‘Repulsive Contact Interactions Make Jammed Particulate Systems Inherently Nonharmonic.’” <i>Physical Review Letters</i>. American Physical Society, 2014. <a href=\"https://doi.org/10.1103/physrevlett.112.049801\">https://doi.org/10.1103/physrevlett.112.049801</a>.","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 112 (2014).","mla":"Goodrich, Carl Peter, et al. “Comment on ‘Repulsive Contact Interactions Make Jammed Particulate Systems Inherently Nonharmonic.’” <i>Physical Review Letters</i>, vol. 112, no. 4, 049801, American Physical Society, 2014, doi:<a href=\"https://doi.org/10.1103/physrevlett.112.049801\">10.1103/physrevlett.112.049801</a>."},"date_published":"2014-04-20T00:00:00Z","publisher":"American Physical Society","title":"Comment on “Repulsive contact interactions make jammed particulate systems inherently nonharmonic”","abstract":[{"lang":"eng","text":"In their Letter, Schreck, Bertrand, O'Hern and Shattuck [Phys. Rev. Lett. 107, 078301 (2011)] study nonlinearities in jammed particulate systems that arise when contacts are altered. They conclude that there is \"no harmonic regime in the large system limit for all compressions\" and \"at jamming onset for any system size.\" Their argument rests on the claim that for finite-range repulsive potentials, of the form used in studies of jamming, the breaking or forming of a single contact is sufficient to destroy the linear regime. We dispute these conclusions and argue that linear response is both justified and essential for understanding the nature of the jammed solid. "}],"publication_status":"published"},{"intvolume":"       111","publication":"Proceedings of the National Academy of Sciences","oa":1,"day":"15","page":"E2895-E2904","doi":"10.1073/pnas.1321869111","year":"2014","publication_status":"published","abstract":[{"text":"Most excitatory inputs in the mammalian brain are made on dendritic spines, rather than on dendritic shafts. Spines compartmentalize calcium, and this biochemical isolation can underlie input-specific synaptic plasticity, providing a raison d'etre for spines. However, recent results indicate that the spine can experience a membrane potential different from that in the parent dendrite, as though the spine neck electrically isolated the spine. Here we use two-photon calcium imaging of mouse neocortical pyramidal neurons to analyze the correlation between the morphologies of spines activated under minimal synaptic stimulation and the excitatory postsynaptic potentials they generate. We find that excitatory postsynaptic potential amplitudes are inversely correlated with spine neck lengths. Furthermore, a spike timing-dependent plasticity protocol, in which two-photon glutamate uncaging over a spine is paired with postsynaptic spikes, produces rapid shrinkage of the spine neck and concomitant increases in the amplitude of the evoked spine potentials. Using numerical simulations, we explore the parameter regimes for the spine neck resistance and synaptic conductance changes necessary to explain our observations. Our data, directly correlating synaptic and morphological plasticity, imply that long-necked spines have small or negligible somatic voltage contributions, but that, upon synaptic stimulation paired with postsynaptic activity, they can shorten their necks and increase synaptic efficacy, thus changing the input/output gain of pyramidal neurons. ","lang":"eng"}],"pmid":1,"date_published":"2014-07-15T00:00:00Z","publisher":"Proceedings of the National Academy of Sciences","title":"Activity-dependent dendritic spine neck changes are correlated with synaptic strength","extern":"1","date_updated":"2021-01-12T08:16:34Z","citation":{"mla":"Araya, R., et al. “Activity-Dependent Dendritic Spine Neck Changes Are Correlated with Synaptic Strength.” <i>Proceedings of the National Academy of Sciences</i>, vol. 111, no. 28, Proceedings of the National Academy of Sciences, 2014, pp. E2895–904, doi:<a href=\"https://doi.org/10.1073/pnas.1321869111\">10.1073/pnas.1321869111</a>.","short":"R. Araya, T.P. Vogels, R. Yuste, Proceedings of the National Academy of Sciences 111 (2014) E2895–E2904.","ista":"Araya R, Vogels TP, Yuste R. 2014. Activity-dependent dendritic spine neck changes are correlated with synaptic strength. Proceedings of the National Academy of Sciences. 111(28), E2895–E2904.","ama":"Araya R, Vogels TP, Yuste R. Activity-dependent dendritic spine neck changes are correlated with synaptic strength. <i>Proceedings of the National Academy of Sciences</i>. 2014;111(28):E2895-E2904. doi:<a href=\"https://doi.org/10.1073/pnas.1321869111\">10.1073/pnas.1321869111</a>","chicago":"Araya, R., Tim P Vogels, and R. Yuste. “Activity-Dependent Dendritic Spine Neck Changes Are Correlated with Synaptic Strength.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences, 2014. <a href=\"https://doi.org/10.1073/pnas.1321869111\">https://doi.org/10.1073/pnas.1321869111</a>.","apa":"Araya, R., Vogels, T. P., &#38; Yuste, R. (2014). Activity-dependent dendritic spine neck changes are correlated with synaptic strength. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1321869111\">https://doi.org/10.1073/pnas.1321869111</a>","ieee":"R. Araya, T. P. Vogels, and R. Yuste, “Activity-dependent dendritic spine neck changes are correlated with synaptic strength,” <i>Proceedings of the National Academy of Sciences</i>, vol. 111, no. 28. Proceedings of the National Academy of Sciences, pp. E2895–E2904, 2014."},"external_id":{"pmid":["24982196"]},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","date_created":"2020-06-25T13:06:24Z","article_type":"original","type":"journal_article","_id":"8021","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4104910/"}],"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"status":"public","month":"07","issue":"28","language":[{"iso":"eng"}],"volume":111,"article_processing_charge":"No","quality_controlled":"1","oa_version":"Published Version","author":[{"full_name":"Araya, R.","first_name":"R.","last_name":"Araya"},{"first_name":"Tim P","last_name":"Vogels","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P"},{"full_name":"Yuste, R.","last_name":"Yuste","first_name":"R."}]},{"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6364799/","open_access":"1"}],"status":"public","publication_identifier":{"issn":["0896-6273"]},"_id":"8022","type":"journal_article","article_type":"original","date_created":"2020-06-25T13:07:37Z","author":[{"full_name":"Hennequin, Guillaume","last_name":"Hennequin","first_name":"Guillaume"},{"last_name":"Vogels","first_name":"Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P"},{"full_name":"Gerstner, Wulfram","first_name":"Wulfram","last_name":"Gerstner"}],"oa_version":"Submitted Version","quality_controlled":"1","article_processing_charge":"No","volume":82,"language":[{"iso":"eng"}],"issue":"6","month":"06","day":"18","doi":"10.1016/j.neuron.2014.04.045","year":"2014","page":"1394-1406","oa":1,"publication":"Neuron","intvolume":"        82","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","external_id":{"pmid":["24945778"]},"citation":{"apa":"Hennequin, G., Vogels, T. P., &#38; Gerstner, W. (2014). Optimal control of transient dynamics in balanced networks supports generation of complex movements. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2014.04.045\">https://doi.org/10.1016/j.neuron.2014.04.045</a>","ama":"Hennequin G, Vogels TP, Gerstner W. Optimal control of transient dynamics in balanced networks supports generation of complex movements. <i>Neuron</i>. 2014;82(6):1394-1406. doi:<a href=\"https://doi.org/10.1016/j.neuron.2014.04.045\">10.1016/j.neuron.2014.04.045</a>","ista":"Hennequin G, Vogels TP, Gerstner W. 2014. Optimal control of transient dynamics in balanced networks supports generation of complex movements. Neuron. 82(6), 1394–1406.","chicago":"Hennequin, Guillaume, Tim P Vogels, and Wulfram Gerstner. “Optimal Control of Transient Dynamics in Balanced Networks Supports Generation of Complex Movements.” <i>Neuron</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.neuron.2014.04.045\">https://doi.org/10.1016/j.neuron.2014.04.045</a>.","ieee":"G. Hennequin, T. P. Vogels, and W. Gerstner, “Optimal control of transient dynamics in balanced networks supports generation of complex movements,” <i>Neuron</i>, vol. 82, no. 6. Elsevier, pp. 1394–1406, 2014.","short":"G. Hennequin, T.P. Vogels, W. Gerstner, Neuron 82 (2014) 1394–1406.","mla":"Hennequin, Guillaume, et al. “Optimal Control of Transient Dynamics in Balanced Networks Supports Generation of Complex Movements.” <i>Neuron</i>, vol. 82, no. 6, Elsevier, 2014, pp. 1394–406, doi:<a href=\"https://doi.org/10.1016/j.neuron.2014.04.045\">10.1016/j.neuron.2014.04.045</a>."},"date_updated":"2021-01-12T08:16:35Z","extern":"1","title":"Optimal control of transient dynamics in balanced networks supports generation of complex movements","date_published":"2014-06-18T00:00:00Z","publisher":"Elsevier","pmid":1,"abstract":[{"lang":"eng","text":"Populations of neurons in motor cortex engage in complex transient dynamics of large amplitude during the execution of limb movements. Traditional network models with stochastically assigned synapses cannot reproduce this behavior. Here we introduce a class of cortical architectures with strong and random excitatory recurrence that is stabilized by intricate, fine-tuned inhibition, optimized from a control theory perspective. Such networks transiently amplify specific activity states and can be used to reliably execute multidimensional movement patterns. Similar to the experimental observations, these transients must be preceded by a steady-state initialization phase from which the network relaxes back into the background state by way of complex internal dynamics. In our networks, excitation and inhibition are as tightly balanced as recently reported in experiments across several brain areas, suggesting inhibitory control of complex excitatory recurrence as a generic organizational principle in cortex."}],"publication_status":"published"},{"article_type":"original","type":"journal_article","_id":"8023","date_created":"2020-06-25T13:08:30Z","publication_identifier":{"eissn":["1522-1598"],"issn":["0022-3077"]},"status":"public","oa_version":"Published Version","quality_controlled":"1","author":[{"last_name":"Tomm","first_name":"Christian","full_name":"Tomm, Christian"},{"full_name":"Avermann, Michael","last_name":"Avermann","first_name":"Michael"},{"full_name":"Petersen, Carl","first_name":"Carl","last_name":"Petersen"},{"full_name":"Gerstner, Wulfram","last_name":"Gerstner","first_name":"Wulfram"},{"id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P","first_name":"Tim P","last_name":"Vogels","orcid":"0000-0003-3295-6181"}],"file":[{"relation":"main_file","success":1,"access_level":"open_access","file_size":1632295,"file_id":"8122","checksum":"7c06a086da6f924342650de6dc555c3f","creator":"cziletti","date_created":"2020-07-16T10:12:13Z","date_updated":"2020-07-16T10:12:13Z","content_type":"application/pdf","file_name":"2014_JNeurophysiol_Tomm.pdf"}],"issue":"8","month":"10","has_accepted_license":"1","volume":112,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa":1,"day":"15","page":"1801-1814","doi":"10.1152/jn.00629.2013","year":"2014","publication":"Journal of Neurophysiology","intvolume":"       112","citation":{"mla":"Tomm, Christian, et al. “Connection-Type-Specific Biases Make Uniform Random Network Models Consistent with Cortical Recordings.” <i>Journal of Neurophysiology</i>, vol. 112, no. 8, American Physiological Society, 2014, pp. 1801–14, doi:<a href=\"https://doi.org/10.1152/jn.00629.2013\">10.1152/jn.00629.2013</a>.","short":"C. Tomm, M. Avermann, C. Petersen, W. Gerstner, T.P. Vogels, Journal of Neurophysiology 112 (2014) 1801–1814.","ieee":"C. Tomm, M. Avermann, C. Petersen, W. Gerstner, and T. P. Vogels, “Connection-type-specific biases make uniform random network models consistent with cortical recordings,” <i>Journal of Neurophysiology</i>, vol. 112, no. 8. American Physiological Society, pp. 1801–1814, 2014.","apa":"Tomm, C., Avermann, M., Petersen, C., Gerstner, W., &#38; Vogels, T. P. (2014). Connection-type-specific biases make uniform random network models consistent with cortical recordings. <i>Journal of Neurophysiology</i>. American Physiological Society. <a href=\"https://doi.org/10.1152/jn.00629.2013\">https://doi.org/10.1152/jn.00629.2013</a>","chicago":"Tomm, Christian, Michael Avermann, Carl Petersen, Wulfram Gerstner, and Tim P Vogels. “Connection-Type-Specific Biases Make Uniform Random Network Models Consistent with Cortical Recordings.” <i>Journal of Neurophysiology</i>. American Physiological Society, 2014. <a href=\"https://doi.org/10.1152/jn.00629.2013\">https://doi.org/10.1152/jn.00629.2013</a>.","ama":"Tomm C, Avermann M, Petersen C, Gerstner W, Vogels TP. Connection-type-specific biases make uniform random network models consistent with cortical recordings. <i>Journal of Neurophysiology</i>. 2014;112(8):1801-1814. doi:<a href=\"https://doi.org/10.1152/jn.00629.2013\">10.1152/jn.00629.2013</a>","ista":"Tomm C, Avermann M, Petersen C, Gerstner W, Vogels TP. 2014. Connection-type-specific biases make uniform random network models consistent with cortical recordings. Journal of Neurophysiology. 112(8), 1801–1814."},"extern":"1","date_updated":"2021-01-12T08:16:35Z","external_id":{"pmid":["24944218"]},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"ddc":["570"],"publication_status":"published","abstract":[{"text":"Uniform random sparse network architectures are ubiquitous in computational neuroscience, but the implicit hypothesis that they are a good representation of real neuronal networks has been met with skepticism. Here we used two experimental data sets, a study of triplet connectivity statistics and a data set measuring neuronal responses to channelrhodopsin stimuli, to evaluate the fidelity of thousands of model networks. Network architectures comprised three neuron types (excitatory, fast spiking, and nonfast spiking inhibitory) and were created from a set of rules that govern the statistics of the resulting connection types. In a high-dimensional parameter scan, we varied the degree distributions (i.e., how many cells each neuron connects with) and the synaptic weight correlations of synapses from or onto the same neuron. These variations converted initially uniform random and homogeneously connected networks, in which every neuron sent and received equal numbers of synapses with equal synaptic strength distributions, to highly heterogeneous networks in which the number of synapses per neuron, as well as average synaptic strength of synapses from or to a neuron were variable. By evaluating the impact of each variable on the network structure and dynamics, and their similarity to the experimental data, we could falsify the uniform random sparse connectivity hypothesis for 7 of 36 connectivity parameters, but we also confirmed the hypothesis in 8 cases. Twenty-one parameters had no substantial impact on the results of the test protocols we used.","lang":"eng"}],"title":"Connection-type-specific biases make uniform random network models consistent with cortical recordings","pmid":1,"publisher":"American Physiological Society","file_date_updated":"2020-07-16T10:12:13Z","date_published":"2014-10-15T00:00:00Z"},{"author":[{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","department":[{"_id":"RoSe"}],"date_updated":"2023-10-17T11:12:33Z","citation":{"ieee":"R. Seiringer, “Structure of the excitation spectrum for many-body quantum systems,” in <i>Proceeding of the International Congress of Mathematicans</i>, Seoul, South Korea, 2014, vol. 3, pp. 1175–1194.","apa":"Seiringer, R. (2014). Structure of the excitation spectrum for many-body quantum systems. In <i>Proceeding of the International Congress of Mathematicans</i> (Vol. 3, pp. 1175–1194). Seoul, South Korea: International Congress of Mathematicians.","ista":"Seiringer R. 2014. Structure of the excitation spectrum for many-body quantum systems. Proceeding of the International Congress of Mathematicans. ICM: International Congress of Mathematicans vol. 3, 1175–1194.","chicago":"Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” In <i>Proceeding of the International Congress of Mathematicans</i>, 3:1175–94. International Congress of Mathematicians, 2014.","ama":"Seiringer R. Structure of the excitation spectrum for many-body quantum systems. In: <i>Proceeding of the International Congress of Mathematicans</i>. Vol 3. International Congress of Mathematicians; 2014:1175-1194.","short":"R. Seiringer, in:, Proceeding of the International Congress of Mathematicans, International Congress of Mathematicians, 2014, pp. 1175–1194.","mla":"Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” <i>Proceeding of the International Congress of Mathematicans</i>, vol. 3, International Congress of Mathematicians, 2014, pp. 1175–94."},"oa_version":"Published Version","date_published":"2014-08-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"International Congress of Mathematicians","volume":3,"title":"Structure of the excitation spectrum for many-body quantum systems","article_processing_charge":"No","publication_status":"published","month":"08","abstract":[{"lang":"eng","text":"Many questions concerning models in quantum mechanics require a detailed analysis of the spectrum of the corresponding Hamiltonian, a linear operator on a suitable Hilbert space. Of particular relevance for an understanding of the low-temperature properties of a system is the structure of the excitation spectrum, which is the part of the spectrum close to the spectral bottom. We present recent progress on this question for bosonic many-body quantum systems with weak two-body interactions. Such system are currently of great interest, due to their experimental realization in ultra-cold atomic gases. We investigate the accuracy of the Bogoliubov approximations, which predicts that the low-energy spectrum is made up of sums of elementary excitations, with linear dispersion law at low momentum. The latter property is crucial for the superfluid behavior the system."}],"page":"1175-1194","publication_identifier":{"isbn":["9788961058063"]},"year":"2014","main_file_link":[{"url":"http://www.icm2014.org/en/vod/proceedings.html","open_access":"1"}],"day":"01","status":"public","date_created":"2020-06-29T07:59:35Z","oa":1,"type":"conference","_id":"8044","conference":{"name":"ICM: International Congress of Mathematicans","location":"Seoul, South Korea","start_date":"2014-08-13","end_date":"2014-08-21"},"intvolume":"         3","publication":"Proceeding of the International Congress of Mathematicans","scopus_import":"1"},{"citation":{"short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics 33 (2014).","mla":"Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2, 15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., &#38; Wonka, P. (2014). Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>.","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. 2014;33(2). doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15.","ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using geometric relationship functions,” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2. ACM, 2014."},"date_updated":"2021-01-12T06:52:06Z","department":[{"_id":"ChWo"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"abstract":[{"lang":"eng","text":"We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations."}],"publication_status":"published","title":"Edit propagation using geometric relationship functions","date_published":"2014-03-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:07Z","publisher":"ACM","oa":1,"doi":"10.1145/2591010","year":"2014","day":"01","publication":"ACM Transactions on Graphics","intvolume":"        33","publist_id":"5526","oa_version":"Submitted Version","quality_controlled":"1","author":[{"full_name":"Guerrero, Paul","last_name":"Guerrero","first_name":"Paul"},{"id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan","last_name":"Jeschke","first_name":"Stefan"},{"first_name":"Michael","last_name":"Wimmer","full_name":"Wimmer, Michael"},{"first_name":"Peter","last_name":"Wonka","full_name":"Wonka, Peter"}],"issue":"2","file":[{"file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:07Z","date_created":"2018-12-12T10:11:22Z","creator":"system","file_id":"4876","checksum":"7f91e588a4e888610313b98271e6418e","file_size":9832561,"access_level":"open_access","relation":"main_file"}],"article_number":"15","month":"03","has_accepted_license":"1","volume":33,"language":[{"iso":"eng"}],"_id":"1629","type":"journal_article","date_created":"2018-12-11T11:53:08Z","status":"public","pubrep_id":"577"},{"publication":"SCN 2014","intvolume":"      8642","publist_id":"5509","editor":[{"first_name":"Michel","last_name":"Abdalla","full_name":"Abdalla, Michel"},{"first_name":"Roberto","last_name":"De Prisco","full_name":"De Prisco, Roberto"}],"scopus_import":1,"page":"95 - 114","doi":"10.1007/978-3-319-10879-7_7","year":"2014","day":"01","oa":1,"title":"Constrained Verifiable Random Functions ","date_published":"2014-01-01T00:00:00Z","publisher":"Springer","abstract":[{"text":"We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs, respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom function at any point of its domain; in addition, it enables computation of a non-interactive proof that the function value was computed correctly. In a constrained VRF from the key sk one can derive constrained keys skS for subsets S of the domain, which allow computation of function values and proofs only at points in S. After formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for any set that can be decided by a polynomial-size circuit. Our VRFs have the same function values as the Boneh-Waters PRFs and are proved secure under the same hardness assumption, showing that verifiability comes at no cost. Constrained (functional) VRFs were stated as an open problem by Boyle et al.","lang":"eng"}],"publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"citation":{"chicago":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>.","ista":"Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.","ama":"Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De Prisco R, eds. <i>SCN 2014</i>. Vol 8642. Springer; 2014:95-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>","apa":"Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla &#38; R. De Prisco (Eds.), <i>SCN 2014</i> (Vol. 8642, pp. 95–114). Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>","ieee":"G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in <i>SCN 2014</i>, Amalfi, Italy, 2014, vol. 8642, pp. 95–114.","mla":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp. 95–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>.","short":"G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer, 2014, pp. 95–114."},"date_updated":"2021-01-12T06:52:12Z","department":[{"_id":"KrPi"}],"ec_funded":1,"conference":{"name":"SCN: Security and Cryptography for Networks","location":"Amalfi, Italy","start_date":"2014-09-03","end_date":"2014-09-05"},"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2014/537"}],"status":"public","type":"conference","_id":"1643","date_created":"2018-12-11T11:53:13Z","volume":8642,"language":[{"iso":"eng"}],"month":"01","author":[{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg","first_name":"Georg","last_name":"Fuchsbauer"}],"oa_version":"Submitted Version","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}]},{"oa_version":"Submitted Version","citation":{"short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing, 2014, pp. 31–38.","mla":"Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 169, Open Publishing, 2014, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>.","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving recursion free-horn clauses,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Vienna, Austria, 2014, vol. 169, pp. 31–38.","ista":"Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science, EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.","ama":"Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion free-horn clauses. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 169. Open Publishing; 2014:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 169:31–38. Open Publishing, 2014. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>.","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>"},"department":[{"_id":"ToHe"}],"quality_controlled":"1","date_updated":"2021-01-12T06:52:38Z","alternative_title":["EPTCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh"},{"last_name":"Popeea","first_name":"Corneliu","full_name":"Popeea, Corneliu"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"month":"12","publication_status":"published","abstract":[{"text":"In this paper we present INTERHORN, a solver for recursion-free Horn clauses. The main application domain of INTERHORN lies in solving interpolation problems arising in software verification. We show how a range of interpolation problems, including path, transition, nested, state/transition and well-founded interpolation can be handled directly by INTERHORN. By detailing these interpolation problems and their Horn clause representations, we hope to encourage the emergence of a common back-end interpolation interface useful for diverse verification tools.","lang":"eng"}],"volume":169,"title":"Generalised interpolation by solving recursion free-horn clauses","date_published":"2014-12-02T00:00:00Z","publisher":"Open Publishing","language":[{"iso":"eng"}],"type":"conference","_id":"1702","date_created":"2018-12-11T11:53:33Z","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1303.7378v2","open_access":"1"}],"year":"2014","day":"02","status":"public","page":"31 - 38","doi":"10.4204/EPTCS.169.5","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","conference":{"name":"HCVS: Horn Clauses for Verification and Synthesis","location":"Vienna, Austria","end_date":"2014-07-17","start_date":"2014-07-17"},"publist_id":"5435","intvolume":"       169"}]