[{"ec_funded":1,"scopus_import":"1","date_updated":"2026-04-16T10:08:53Z","doi":"10.1016/j.neuron.2013.09.046","external_id":{"isi":["000329559000015"]},"volume":81,"publisher":"Elsevier","department":[{"_id":"PeJo"}],"citation":{"ieee":"A. Pernia-Andrade and P. M. Jonas, “Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations,” <i>Neuron</i>, vol. 81, no. 1. Elsevier, pp. 140–152, 2014.","ista":"Pernia-Andrade A, Jonas PM. 2014. Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. Neuron. 81(1), 140–152.","ama":"Pernia-Andrade A, Jonas PM. Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. <i>Neuron</i>. 2014;81(1):140-152. doi:<a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">10.1016/j.neuron.2013.09.046</a>","chicago":"Pernia-Andrade, Alejandro, and Peter M Jonas. “Theta-Gamma-Modulated Synaptic Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.” <i>Neuron</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">https://doi.org/10.1016/j.neuron.2013.09.046</a>.","short":"A. Pernia-Andrade, P.M. Jonas, Neuron 81 (2014) 140–152.","apa":"Pernia-Andrade, A., &#38; Jonas, P. M. (2014). Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">https://doi.org/10.1016/j.neuron.2013.09.046</a>","mla":"Pernia-Andrade, Alejandro, and Peter M. Jonas. “Theta-Gamma-Modulated Synaptic Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.” <i>Neuron</i>, vol. 81, no. 1, Elsevier, 2014, pp. 140–52, doi:<a href=\"https://doi.org/10.1016/j.neuron.2013.09.046\">10.1016/j.neuron.2013.09.046</a>."},"year":"2014","author":[{"full_name":"Pernia-Andrade, Alejandro","first_name":"Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","last_name":"Pernia-Andrade"},{"full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"publication":"Neuron","file":[{"file_name":"IST-2016-422-v1+1_1-s2.0-S0896627313009227-main.pdf","date_created":"2018-12-12T10:09:48Z","file_size":4373072,"access_level":"open_access","checksum":"438547cfcd9045a22f065f2019f07849","content_type":"application/pdf","date_updated":"2020-07-14T12:45:35Z","creator":"system","relation":"main_file","file_id":"4773"}],"fulldoi":"https://doi.org/10.1016/j.neuron.2013.09.046","project":[{"name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","grant_number":"268548","call_identifier":"FP7","_id":"25C0F108-B435-11E9-9278-68D0E5697425"},{"_id":"25C26B1E-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P24909-B24","name":"Mechanisms of transmitter release at GABAergic synapses"}],"title":"Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo define a mechanism for network oscillations","page":"140 - 152","publication_identifier":{"issn":["0896-6273"]},"pubrep_id":"422","ddc":["570"],"file_date_updated":"2020-07-14T12:45:35Z","issue":"1","status":"public","publication_status":"published","abstract":[{"text":"Theta-gamma network oscillations are thought to represent key reference signals for information processing in neuronal ensembles, but the underlying synaptic mechanisms remain unclear. To address this question, we performed whole-cell (WC) patch-clamp recordings from mature hippocampal granule cells (GCs) in vivo in the dentate gyrus of anesthetized and awake rats. GCs in vivo fired action potentials at low frequency, consistent with sparse coding in the dentate gyrus. GCs were exposed to barrages of fast AMPAR-mediated excitatory postsynaptic currents (EPSCs), primarily relayed from the entorhinal cortex, and inhibitory postsynaptic currents (IPSCs), presumably generated by local interneurons. EPSCs exhibited coherence with the field potential predominantly in the theta frequency band, whereas IPSCs showed coherence primarily in the gamma range. Action potentials in GCs were phase locked to network oscillations. Thus, theta-gamma-modulated synaptic currents may provide a framework for sparse temporal coding of information in the dentate gyrus.","lang":"eng"}],"has_accepted_license":"1","date_published":"2014-01-08T00:00:00Z","article_processing_charge":"No","isi":1,"oa_version":"Published Version","publist_id":"4692","language":[{"iso":"eng"}],"oa":1,"corr_author":"1","quality_controlled":"1","type":"journal_article","_id":"2254","day":"08","date_created":"2018-12-11T11:56:35Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","month":"01","intvolume":"        81"},{"oa_version":"Published Version","date_published":"2014-01-02T00:00:00Z","status":"public","has_accepted_license":"1","publication_status":"published","abstract":[{"lang":"eng","text":"Maximum entropy models are the least structured probability distributions that exactly reproduce a chosen set of statistics measured in an interacting network. Here we use this principle to construct probabilistic models which describe the correlated spiking activity of populations of up to 120 neurons in the salamander retina as it responds to natural movies. Already in groups as small as 10 neurons, interactions between spikes can no longer be regarded as small perturbations in an otherwise independent system; for 40 or more neurons pairwise interactions need to be supplemented by a global interaction that controls the distribution of synchrony in the population. Here we show that such “K-pairwise” models—being systematic extensions of the previously used pairwise Ising models—provide an excellent account of the data. We explore the properties of the neural vocabulary by: 1) estimating its entropy, which constrains the population's capacity to represent visual information; 2) classifying activity patterns into a small set of metastable collective modes; 3) showing that the neural codeword ensembles are extremely inhomogenous; 4) demonstrating that the state of individual neurons is highly predictable from the rest of the population, allowing the capacity for error correction."}],"isi":1,"article_processing_charge":"No","article_number":"e1003408","language":[{"iso":"eng"}],"publist_id":"4689","corr_author":"1","quality_controlled":"1","_id":"2257","type":"journal_article","day":"02","oa":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:56:36Z","intvolume":"        10","month":"01","scopus_import":"1","external_id":{"isi":["000337948500010"]},"date_updated":"2025-09-29T11:14:06Z","doi":"10.1371/journal.pcbi.1003408","publisher":"Public Library of Science","volume":10,"citation":{"ieee":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Searching for collective behavior in a large network of sensory neurons,” <i>PLoS Computational Biology</i>, vol. 10, no. 1. Public Library of Science, 2014.","ama":"Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. Searching for collective behavior in a large network of sensory neurons. <i>PLoS Computational Biology</i>. 2014;10(1). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">10.1371/journal.pcbi.1003408</a>","ista":"Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. 2014. Searching for collective behavior in a large network of sensory neurons. PLoS Computational Biology. 10(1), e1003408.","chicago":"Tkačik, Gašper, Olivier Marre, Dario Amodei, Elad Schneidman, William Bialek, and Michael Berry. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” <i>PLoS Computational Biology</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">https://doi.org/10.1371/journal.pcbi.1003408</a>.","short":"G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, M. Berry, PLoS Computational Biology 10 (2014).","apa":"Tkačik, G., Marre, O., Amodei, D., Schneidman, E., Bialek, W., &#38; Berry, M. (2014). Searching for collective behavior in a large network of sensory neurons. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">https://doi.org/10.1371/journal.pcbi.1003408</a>","mla":"Tkačik, Gašper, et al. “Searching for Collective Behavior in a Large Network of Sensory Neurons.” <i>PLoS Computational Biology</i>, vol. 10, no. 1, e1003408, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003408\">10.1371/journal.pcbi.1003408</a>."},"year":"2014","department":[{"_id":"GaTk"}],"title":"Searching for collective behavior in a large network of sensory neurons","publication":"PLoS Computational Biology","author":[{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"last_name":"Amodei","first_name":"Dario","full_name":"Amodei, Dario"},{"first_name":"Elad","full_name":"Schneidman, Elad","last_name":"Schneidman"},{"first_name":"William","full_name":"Bialek, William","last_name":"Bialek"},{"last_name":"Berry","full_name":"Berry, Michael","first_name":"Michael"}],"fulldoi":"https://doi.org/10.1371/journal.pcbi.1003408","file":[{"file_size":2194790,"date_created":"2018-12-12T10:12:46Z","file_name":"IST-2016-436-v1+1_journal.pcbi.1003408.pdf","checksum":"c720222c5e924a4acb17f23b9381a6ca","file_id":"4965","creator":"system","relation":"main_file","date_updated":"2020-07-14T12:45:35Z","content_type":"application/pdf","access_level":"open_access"}],"pubrep_id":"436","ddc":["570"],"acknowledgement":"This work was funded by NSF grant IIS-0613435, NSF grant PHY-0957573, NSF grant CCF-0939370, NIH grant R01 EY14196, NIH grant P50 GM071508, the Fannie and John Hertz Foundation, the Swartz Foundation, the WM Keck Foundation, ANR Optima and the French State program “Investissements d'Avenir” [LIFESENSES: ANR-10-LABX-65], and the Austrian Research Foundation FWF P25651.","issue":"1","file_date_updated":"2020-07-14T12:45:35Z","related_material":{"record":[{"status":"public","id":"5562","relation":"research_data"}]},"publication_identifier":{"issn":["1553-734X"]}},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:56:38Z","intvolume":"        42","month":"03","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","_id":"2261","day":"05","type":"journal_article","article_number":"e34","language":[{"iso":"eng"}],"publist_id":"4684","date_published":"2014-03-05T00:00:00Z","status":"public","has_accepted_license":"1","abstract":[{"text":"To reveal the full potential of human pluripotent stem cells, new methods for rapid, site-specific genomic engineering are needed. Here, we describe a system for precise genetic modification of human embryonic stem cells (ESCs) and induced pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located in a safe, intergenic, transcriptionally active region of chromosome 22, as the recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient cell lines were established by site-specific placement of a ‘landing pad’ cassette carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE) mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This system provided complete control over content, direction and copy number of inserted genes, with a specificity of 100%. A series of genes, including mCherry and various combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from a Parkinson’s disease patient and a normal sibling control. The DICE system offers rapid, efficient and precise gene insertion in ESC and iPSC and is particularly well suited for repeated modifications of the same locus.","lang":"eng"}],"publication_status":"published","isi":1,"article_processing_charge":"No","oa_version":"Preprint","acknowledgement":"California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]. Funding for open access charge: California Institute for Regenerative Medicine [RT2-01880 and TR2-01756]\r\nCC BY 3,0","ddc":["571","610"],"pubrep_id":"961","file_date_updated":"2020-07-14T12:45:35Z","issue":"5","publication":"Nucleic Acids Research","author":[{"last_name":"Zhu","first_name":"Fangfang","full_name":"Zhu, Fangfang"},{"last_name":"Gamboa","full_name":"Gamboa, Matthew","first_name":"Matthew"},{"first_name":"Alfonso","full_name":"Farruggio, Alfonso","last_name":"Farruggio"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"},{"last_name":"Tasic","first_name":"Bosiljka","full_name":"Tasic, Bosiljka"},{"last_name":"Schüle","full_name":"Schüle, Birgitt","first_name":"Birgitt"},{"first_name":"Yanru","full_name":"Chen Tsai, Yanru","last_name":"Chen Tsai"},{"last_name":"Calos","first_name":"Michele","full_name":"Calos, Michele"}],"fulldoi":"https://doi.org/10.1093/nar/gkt1290","file":[{"date_created":"2018-12-12T10:09:15Z","file_name":"IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf","file_size":11044478,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:35Z","relation":"main_file","creator":"system","file_id":"4738","checksum":"e9268f5f96a820f04d7ebbf85927c3cb"}],"title":"DICE, an efficient system for iterative genomic editing in human pluripotent stem cells","publisher":"Oxford University Press","volume":42,"citation":{"mla":"Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” <i>Nucleic Acids Research</i>, vol. 42, no. 5, e34, Oxford University Press, 2014, doi:<a href=\"https://doi.org/10.1093/nar/gkt1290\">10.1093/nar/gkt1290</a>.","apa":"Zhu, F., Gamboa, M., Farruggio, A., Hippenmeyer, S., Tasic, B., Schüle, B., … Calos, M. (2014). DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gkt1290\">https://doi.org/10.1093/nar/gkt1290</a>","short":"F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y. Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).","ieee":"F. Zhu <i>et al.</i>, “DICE, an efficient system for iterative genomic editing in human pluripotent stem cells,” <i>Nucleic Acids Research</i>, vol. 42, no. 5. Oxford University Press, 2014.","chicago":"Zhu, Fangfang, Matthew Gamboa, Alfonso Farruggio, Simon Hippenmeyer, Bosiljka Tasic, Birgitt Schüle, Yanru Chen Tsai, and Michele Calos. “DICE, an Efficient System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” <i>Nucleic Acids Research</i>. Oxford University Press, 2014. <a href=\"https://doi.org/10.1093/nar/gkt1290\">https://doi.org/10.1093/nar/gkt1290</a>.","ama":"Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. <i>Nucleic Acids Research</i>. 2014;42(5). doi:<a href=\"https://doi.org/10.1093/nar/gkt1290\">10.1093/nar/gkt1290</a>","ista":"Zhu F, Gamboa M, Farruggio A, Hippenmeyer S, Tasic B, Schüle B, Chen Tsai Y, Calos M. 2014. DICE, an efficient system for iterative genomic editing in human pluripotent stem cells. Nucleic Acids Research. 42(5), e34."},"year":"2014","department":[{"_id":"SiHi"}],"scopus_import":"1","external_id":{"isi":["000333093600005"]},"doi":"10.1093/nar/gkt1290","date_updated":"2025-09-29T11:13:18Z"},{"publisher":"IEEE","year":"2014","citation":{"ista":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943.","ama":"Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature regularization. In: IEEE; 2014:2936-2943. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.365\">10.1109/ICCV.2013.365</a>","chicago":"Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. <a href=\"https://doi.org/10.1109/ICCV.2013.365\">https://doi.org/10.1109/ICCV.2013.365</a>.","ieee":"C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.","short":"C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.","apa":"Olsson, C., Ulen, J., Boykov, Y., &#38; Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.365\">https://doi.org/10.1109/ICCV.2013.365</a>","mla":"Olsson, Carl, et al. <i>Partial Enumeration and Curvature Regularization</i>. IEEE, 2014, pp. 2936–43, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.365\">10.1109/ICCV.2013.365</a>."},"department":[{"_id":"VlKo"}],"scopus_import":"1","external_id":{"isi":["000351830500367"]},"doi":"10.1109/ICCV.2013.365","date_updated":"2025-09-29T14:28:16Z","ddc":["000"],"pubrep_id":"566","file_date_updated":"2020-07-14T12:45:36Z","page":"2936 - 2943","title":"Partial enumeration and curvature regularization","author":[{"last_name":"Olsson","full_name":"Olsson, Carl","first_name":"Carl"},{"last_name":"Ulen","full_name":"Ulen, Johannes","first_name":"Johannes"},{"last_name":"Boykov","full_name":"Boykov, Yuri","first_name":"Yuri"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"conference":{"name":"ICCV: International Conference on Computer Vision","end_date":"2013-12-08","start_date":"2013-12-01","location":"Sydney, Australia"},"fulldoi":"https://doi.org/10.1109/ICCV.2013.365","file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:45:36Z","creator":"system","file_id":"4754","relation":"main_file","checksum":"4a74b5c92d6dcd2348c2c10ec8dd18bf","access_level":"open_access","file_size":378601,"date_created":"2018-12-12T10:09:30Z","file_name":"IST-2016-566-v1+1_iccv13_part_enumeration.pdf"}],"language":[{"iso":"eng"}],"publist_id":"4669","oa_version":"Submitted Version","date_published":"2014-03-03T00:00:00Z","publication_status":"published","abstract":[{"text":"Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumeration of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. \r\nThis partial enumeration technique reduces complex high-order energy formulations to pairwise Constraint Satisfaction Problems with unary costs (uCSP), which can be efficiently solved using standard methods like TRW-S. Our approach outperforms a number of existing state-of-the-art algorithms on well known difficult problems (e.g. curvature regularization, stereo, deconvolution); it gives near global minimum and better speed. \r\nOur main application of interest is curvature regularization. In the context of segmentation, our partial enumeration technique allows to evaluate curvature directly on small patches using a novel integral geometry approach.\r\n","lang":"eng"}],"has_accepted_license":"1","status":"public","isi":1,"article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:56:42Z","month":"03","quality_controlled":"1","_id":"2275","day":"03","type":"conference","oa":1},{"doi":"10.1007/s11005-013-0667-9","date_updated":"2025-09-29T11:12:19Z","external_id":{"arxiv":["1301.5682"],"isi":["000330128000002"]},"scopus_import":"1","department":[{"_id":"RoSe"}],"year":"2014","citation":{"short":"Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156.","apa":"Guo, Y., &#38; Seiringer, R. (2014). On the mass concentration for Bose-Einstein condensates with attractive interactions. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-013-0667-9\">https://doi.org/10.1007/s11005-013-0667-9</a>","mla":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” <i>Letters in Mathematical Physics</i>, vol. 104, no. 2, Springer, 2014, pp. 141–56, doi:<a href=\"https://doi.org/10.1007/s11005-013-0667-9\">10.1007/s11005-013-0667-9</a>.","ama":"Guo Y, Seiringer R. On the mass concentration for Bose-Einstein condensates with attractive interactions. <i>Letters in Mathematical Physics</i>. 2014;104(2):141-156. doi:<a href=\"https://doi.org/10.1007/s11005-013-0667-9\">10.1007/s11005-013-0667-9</a>","ista":"Guo Y, Seiringer R. 2014. On the mass concentration for Bose-Einstein condensates with attractive interactions. Letters in Mathematical Physics. 104(2), 141–156.","chicago":"Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein Condensates with Attractive Interactions.” <i>Letters in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s11005-013-0667-9\">https://doi.org/10.1007/s11005-013-0667-9</a>.","ieee":"Y. Guo and R. Seiringer, “On the mass concentration for Bose-Einstein condensates with attractive interactions,” <i>Letters in Mathematical Physics</i>, vol. 104, no. 2. Springer, pp. 141–156, 2014."},"volume":104,"publisher":"Springer","title":"On the mass concentration for Bose-Einstein condensates with attractive interactions","page":"141 - 156","fulldoi":"https://doi.org/10.1007/s11005-013-0667-9","publication":"Letters in Mathematical Physics","author":[{"last_name":"Guo","first_name":"Yujin","full_name":"Guo, Yujin"},{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","first_name":"Robert","orcid":"0000-0002-6781-0521"}],"issue":"2","oa_version":"Preprint","article_processing_charge":"No","isi":1,"publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"We consider two-dimensional Bose-Einstein condensates with attractive interaction, described by the Gross-Pitaevskii functional. Minimizers of this functional exist only if the interaction strength a satisfies {Mathematical expression}, where Q is the unique positive radial solution of {Mathematical expression} in {Mathematical expression}. We present a detailed analysis of the behavior of minimizers as a approaches a*, where all the mass concentrates at a global minimum of the trapping potential."}],"date_published":"2014-02-01T00:00:00Z","publist_id":"4653","article_type":"original","language":[{"iso":"eng"}],"type":"journal_article","_id":"2281","day":"01","corr_author":"1","quality_controlled":"1","oa":1,"arxiv":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1301.5682"}],"month":"02","intvolume":"       104","date_created":"2018-12-11T11:56:44Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"tmp":{"short":"CC BY-NC (4.0)","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"},"intvolume":"        23","month":"02","date_created":"2018-12-11T11:56:46Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","_id":"2285","type":"journal_article","day":"01","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"publist_id":"4646","oa_version":"Published Version","isi":1,"article_processing_charge":"No","date_published":"2014-02-01T00:00:00Z","status":"public","publication_status":"published","has_accepted_license":"1","abstract":[{"lang":"eng","text":"GABAergic inhibitory interneurons control fundamental aspects of neuronal network function. Their functional roles are assumed to be defined by the identity of their input synapses, the architecture of their dendritic tree, the passive and active membrane properties and finally the nature of their postsynaptic targets. Indeed, interneurons display a high degree of morphological and physiological heterogeneity. However, whether their morphological and physiological characteristics are correlated and whether interneuron diversity can be described by a continuum of GABAergic cell types or by distinct classes has remained unclear. Here we perform a detailed morphological and physiological characterization of GABAergic cells in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased and efficient sampling and classification we used knock-in mice expressing the enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive neurons and performed cluster analysis. We identified five interneuron classes, each of them characterized by a distinct set of anatomical and physiological parameters. Cross-correlation analysis further revealed a direct relation between morphological and physiological properties indicating that dentate gyrus interneurons fall into functionally distinct classes which may differentially control neuronal network activity."}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","issue":"2","file_date_updated":"2020-07-14T12:45:37Z","acknowledgement":"Funded by Deutsche Forschungsgemeinschaft. Grant Numbers: SFB 505, SFB 780, BA1582/2-1 Excellence Initiative of the German Research Foundation (Spemann Graduate School). Grant Number: GSC-4 Lichtenberg Professorship-Award (VW-Foundation); Schram-Foundation; Excellence Initiative Brain Links-Brain Tools. The authors thank Drs. Jonas-Frederic Sauer and Claudio Elgueta for critically reading the manuscript. They also thank Karin Winterhalter, Margit Northemann and Ulrich Nöller for technical assistance.","ddc":["570"],"pubrep_id":"461","page":"189 - 203","title":"Morpho-physiological criteria divide dentate gyrus interneurons into classes","fulldoi":"https://doi.org/10.1002/hipo.22214","file":[{"file_size":801589,"file_name":"IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf","date_created":"2018-12-12T10:15:54Z","file_id":"5178","creator":"system","relation":"main_file","date_updated":"2020-07-14T12:45:37Z","content_type":"application/pdf","checksum":"ff6bc75a79dbc985a2e31b79253e6444","access_level":"open_access"}],"publication":"Hippocampus","author":[{"last_name":"Hosp","first_name":"Jonas","full_name":"Hosp, Jonas"},{"full_name":"Strüber, Michael","first_name":"Michael","last_name":"Strüber"},{"first_name":"Yuchio","full_name":"Yanagawa, Yuchio","last_name":"Yanagawa"},{"last_name":"Obata","full_name":"Obata, Kunihiko","first_name":"Kunihiko"},{"last_name":"Vida","first_name":"Imre","full_name":"Vida, Imre"},{"full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bartos","full_name":"Bartos, Marlene","first_name":"Marlene"}],"citation":{"chicago":"Hosp, Jonas, Michael Strüber, Yuchio Yanagawa, Kunihiko Obata, Imre Vida, Peter M Jonas, and Marlene Bartos. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” <i>Hippocampus</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.1002/hipo.22214\">https://doi.org/10.1002/hipo.22214</a>.","ama":"Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide dentate gyrus interneurons into classes. <i>Hippocampus</i>. 2014;23(2):189-203. doi:<a href=\"https://doi.org/10.1002/hipo.22214\">10.1002/hipo.22214</a>","ista":"Hosp J, Strüber M, Yanagawa Y, Obata K, Vida I, Jonas PM, Bartos M. 2014. Morpho-physiological criteria divide dentate gyrus interneurons into classes. Hippocampus. 23(2), 189–203.","ieee":"J. Hosp <i>et al.</i>, “Morpho-physiological criteria divide dentate gyrus interneurons into classes,” <i>Hippocampus</i>, vol. 23, no. 2. Wiley-Blackwell, pp. 189–203, 2014.","mla":"Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons into Classes.” <i>Hippocampus</i>, vol. 23, no. 2, Wiley-Blackwell, 2014, pp. 189–203, doi:<a href=\"https://doi.org/10.1002/hipo.22214\">10.1002/hipo.22214</a>.","apa":"Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., &#38; Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons into classes. <i>Hippocampus</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/hipo.22214\">https://doi.org/10.1002/hipo.22214</a>","short":"J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos, Hippocampus 23 (2014) 189–203."},"year":"2014","department":[{"_id":"PeJo"}],"volume":23,"publisher":"Wiley-Blackwell","external_id":{"isi":["000329879300006"]},"date_updated":"2025-09-29T11:11:47Z","doi":"10.1002/hipo.22214","scopus_import":"1"},{"oa_version":"Preprint","status":"public","publication_status":"published","abstract":[{"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.","lang":"eng"}],"date_published":"2014-04-01T00:00:00Z","article_processing_charge":"No","isi":1,"publist_id":"4197","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"2699","day":"01","type":"journal_article","oa":1,"arxiv":1,"date_created":"2018-12-11T11:59:08Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"04","main_file_link":[{"url":"http://arxiv.org/abs/1104.2272","open_access":"1"}],"intvolume":"       163","scopus_import":"1","doi":"10.1215/00127094-2649752","date_updated":"2025-09-29T11:11:17Z","external_id":{"arxiv":["1104.2272"],"isi":["000334478100003"]},"publisher":"Duke University Press","volume":163,"department":[{"_id":"LaEr"}],"citation":{"short":"L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 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>","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>.","ista":"Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke Mathematical Journal. 163(6), 1127–1190.","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>.","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."},"year":"2014","title":"Universality of general β-ensembles","page":"1127 - 1190","author":[{"full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"first_name":"Paul","full_name":"Bourgade, Paul","last_name":"Bourgade"},{"last_name":"Yau","full_name":"Yau, Horng","first_name":"Horng"}],"publication":"Duke Mathematical Journal","fulldoi":"https://doi.org/10.1215/00127094-2649752","issue":"6"},{"language":[{"iso":"eng"}],"publist_id":"3940","date_published":"2014-07-01T00:00:00Z","publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length."}],"isi":1,"article_processing_charge":"No","oa_version":"None","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:59:56Z","intvolume":"        27","month":"07","quality_controlled":"1","type":"journal_article","_id":"2852","day":"01","volume":27,"publisher":"Springer","citation":{"apa":"Fischlin, M., Lehmann, A., &#38; Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>","short":"M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.","mla":"Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>.","ieee":"M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” <i>Journal of Cryptology</i>, vol. 27, no. 3. Springer, pp. 397–428, 2014.","ama":"Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. 2014;27(3):397-428. doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>","ista":"Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428.","chicago":"Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>."},"year":"2014","department":[{"_id":"KrPi"}],"scopus_import":"1","external_id":{"isi":["000336370500001"]},"date_updated":"2025-09-29T11:09:56Z","doi":"10.1007/s00145-013-9148-7","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3225"}]},"issue":"3","publication":"Journal of Cryptology","author":[{"last_name":"Fischlin","first_name":"Marc","full_name":"Fischlin, Marc"},{"last_name":"Lehmann","full_name":"Lehmann, Anja","first_name":"Anja"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"fulldoi":"https://doi.org/10.1007/s00145-013-9148-7","page":"397 - 428","title":"Robust multi-property combiners for hash functions"},{"oa_version":"Submitted Version","date_published":"2014-01-01T00:00:00Z","publication_status":"published","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC was introduced by Bellare, Canetti and Krawczyk [Crypto'96], who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, assuming that (1) f is a PRF and (2) the function we get when cascading f is weakly collision-resistant. Unfortunately, HMAC is typically instantiated with cryptographic hash functions like MD5 or SHA-1 for which (2) has been found to be wrong. To restore the provable guarantees for NMAC, Bellare [Crypto'06] showed its security based solely on the assumption that f is a PRF, albeit via a non-uniform reduction. - Our first contribution is a simpler and uniform proof for this fact: If f is an ε-secure PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries), then NMAC f is an (ε+ℓqδ)-secure PRF against q queries of length at most ℓ blocks each. - We then show that this ε+ℓqδ bound is basically tight. For the most interesting case where ℓqδ ≥ ε we prove this by constructing an f for which an attack with advantage ℓqδ exists. This also violates the bound O(ℓε) on the PRF-security of NMAC recently claimed by Koblitz and Menezes. - Finally, we analyze the PRF-security of a modification of NMAC called NI [An and Bellare, Crypto'99] that differs mainly by using a compression function with an additional keying input. This avoids the constant rekeying on multi-block messages in NMAC and allows for a security proof starting by the standard switch from a PRF to a random function, followed by an information-theoretic analysis. We carry out such an analysis, obtaining a tight ℓq2/2 c bound for this step, improving over the trivial bound of ℓ2q2/2c. The proof borrows combinatorial techniques originally developed for proving the security of CBC-MAC [Bellare et al., Crypto'05]."}],"language":[{"iso":"eng"}],"publist_id":"4955","alternative_title":["LNCS"],"corr_author":"1","quality_controlled":"1","_id":"2082","type":"conference","day":"01","oa":1,"date_created":"2018-12-11T11:55:36Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":"      8616","month":"01","scopus_import":"1","date_updated":"2026-04-08T14:18:39Z","doi":"10.1007/978-3-662-44371-2_7","ec_funded":1,"volume":8616,"publisher":"Springer","editor":[{"full_name":"Garay, Juan","first_name":"Juan","last_name":"Garay"},{"full_name":"Gennaro, Rosario","first_name":"Rosario","last_name":"Gennaro"}],"citation":{"ieee":"P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA, 2014, vol. 8616, no. 1, pp. 113–130.","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security of NMAC and HMAC.” edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>.","ista":"Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC. CRYPTO: International Cryptology Conference, LNCS, vol. 8616, 113–130.","ama":"Gazi P, Pietrzak KZ, Rybar M. The exact PRF-security of NMAC and HMAC. In: Garay J, Gennaro R, eds. Vol 8616. Springer; 2014:113-130. doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>","mla":"Gazi, Peter, et al. <i>The Exact PRF-Security of NMAC and HMAC</i>. Edited by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30, doi:<a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">10.1007/978-3-662-44371-2_7</a>.","short":"P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.","apa":"Gazi, P., Pietrzak, K. Z., &#38; Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay &#38; R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-44371-2_7\">https://doi.org/10.1007/978-3-662-44371-2_7</a>"},"year":"2014","department":[{"_id":"KrPi"}],"page":"113 - 130","title":"The exact PRF-security of NMAC and HMAC","author":[{"first_name":"Peter","full_name":"Gazi, Peter","last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Rybar, Michal","first_name":"Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","last_name":"Rybar"}],"fulldoi":"https://doi.org/10.1007/978-3-662-44371-2_7","project":[{"grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"conference":{"location":"Santa Barbara, USA","start_date":"2014-08-17","end_date":"2014-08-21","name":"CRYPTO: International Cryptology Conference"},"file":[{"creator":"system","date_updated":"2020-07-14T12:45:28Z","relation":"main_file","file_id":"4999","content_type":"application/pdf","checksum":"dab6ab36a5f6af94f2b597e6404ed11d","access_level":"open_access","file_size":492310,"file_name":"IST-2016-682-v1+1_578.pdf","date_created":"2018-12-12T10:13:17Z"}],"ddc":["000","004"],"pubrep_id":"682","file_date_updated":"2020-07-14T12:45:28Z","issue":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"838"}]}},{"publication_status":"published","abstract":[{"lang":"eng","text":"Understanding the effects of sex and migration on adaptation to novel environments remains a key problem in evolutionary biology. Using a single-cell alga Chlamydomonas reinhardtii, we investigated how sex and migration affected rates of evolutionary rescue in a sink environment, and subsequent changes in fitness following evolutionary rescue. We show that sex and migration affect both the rate of evolutionary rescue and subsequent adaptation. However, their combined effects change as the populations adapt to a sink habitat. Both sex and migration independently increased rates of evolutionary rescue, but the effect of sex on subsequent fitness improvements, following initial rescue, changed with migration, as sex was beneficial in the absence of migration but constraining adaptation when combined with migration. These results suggest that sex and migration are beneficial during the initial stages of adaptation, but can become detrimental as the population adapts to its environment."}],"status":"public","has_accepted_license":"1","date_published":"2014-04-25T00:00:00Z","article_processing_charge":"No","isi":1,"oa_version":"Published Version","publist_id":"4954","language":[{"iso":"eng"}],"article_type":"original","oa":1,"quality_controlled":"1","corr_author":"1","type":"journal_article","_id":"2083","day":"25","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:55:36Z","month":"04","intvolume":"        68","scopus_import":"1","doi":"10.1111/evo.12440","date_updated":"2025-09-29T11:46:47Z","external_id":{"isi":["000340470600012"]},"publisher":"Wiley","volume":68,"department":[{"_id":"CaGu"}],"year":"2014","citation":{"mla":"Lagator, Mato, et al. “Role of Sex and Migration in Adaptation to Sink Environments.” <i>Evolution</i>, vol. 68, no. 8, Wiley, 2014, pp. 2296–305, doi:<a href=\"https://doi.org/10.1111/evo.12440\">10.1111/evo.12440</a>.","short":"M. Lagator, A. Morgan, P. Neve, N. Colegrave, Evolution 68 (2014) 2296–2305.","apa":"Lagator, M., Morgan, A., Neve, P., &#38; Colegrave, N. (2014). Role of sex and migration in adaptation to sink environments. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/evo.12440\">https://doi.org/10.1111/evo.12440</a>","chicago":"Lagator, Mato, Andrew Morgan, Paul Neve, and Nick Colegrave. “Role of Sex and Migration in Adaptation to Sink Environments.” <i>Evolution</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/evo.12440\">https://doi.org/10.1111/evo.12440</a>.","ama":"Lagator M, Morgan A, Neve P, Colegrave N. Role of sex and migration in adaptation to sink environments. <i>Evolution</i>. 2014;68(8):2296-2305. doi:<a href=\"https://doi.org/10.1111/evo.12440\">10.1111/evo.12440</a>","ista":"Lagator M, Morgan A, Neve P, Colegrave N. 2014. Role of sex and migration in adaptation to sink environments. Evolution. 68(8), 2296–2305.","ieee":"M. Lagator, A. Morgan, P. Neve, and N. Colegrave, “Role of sex and migration in adaptation to sink environments,” <i>Evolution</i>, vol. 68, no. 8. Wiley, pp. 2296–2305, 2014."},"author":[{"full_name":"Lagator, Mato","first_name":"Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87","last_name":"Lagator"},{"full_name":"Morgan, Andrew","first_name":"Andrew","last_name":"Morgan"},{"first_name":"Paul","full_name":"Neve, Paul","last_name":"Neve"},{"last_name":"Colegrave","first_name":"Nick","full_name":"Colegrave, Nick"}],"publication":"Evolution","file":[{"file_size":467254,"date_created":"2020-05-14T16:40:31Z","file_name":"2014_Evolution_Lagator.pdf","checksum":"8d459b07e4a11bb5fde92d969184fe48","content_type":"application/pdf","relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:45:28Z","file_id":"7845","access_level":"open_access"}],"fulldoi":"https://doi.org/10.1111/evo.12440","title":"Role of sex and migration in adaptation to sink environments","page":"2296 - 2305","related_material":{"record":[{"id":"9747","status":"public","relation":"research_data"}]},"acknowledgement":"The authors are grateful to the Leverhulme Trust (F/00 215/AW) for funding this work.","ddc":["570"],"file_date_updated":"2020-07-14T12:45:28Z","issue":"8"},{"month":"07","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4194103/","open_access":"1"}],"intvolume":"        33","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:55:37Z","oa":1,"type":"journal_article","_id":"2084","day":"01","quality_controlled":"1","corr_author":"1","publist_id":"4953","language":[{"iso":"eng"}],"article_processing_charge":"No","isi":1,"publication_status":"published","abstract":[{"text":"Receptor tyrosine kinases (RTKs) are a large family of cell surface receptors that sense growth factors and hormones and regulate a variety of cell behaviours in health and disease. Contactless activation of RTKs with spatial and temporal precision is currently not feasible. Here, we generated RTKs that are insensitive to endogenous ligands but can be selectively activated by low-intensity blue light. We screened light-oxygen-voltage (LOV)-sensing domains for their ability to activate RTKs by light-activated dimerization. Incorporation of LOV domains found in aureochrome photoreceptors of stramenopiles resulted in robust activation of the fibroblast growth factor receptor 1 (FGFR1), epidermal growth factor receptor (EGFR) and rearranged during transfection (RET). In human cancer and endothelial cells, light induced cellular signalling with spatial and temporal precision. Furthermore, light faithfully mimicked complex mitogenic and morphogenic cell behaviour induced by growth factors. RTKs under optical control (Opto-RTKs) provide a powerful optogenetic approach to actuate cellular signals and manipulate cell behaviour.","lang":"eng"}],"status":"public","date_published":"2014-07-01T00:00:00Z","oa_version":"Submitted Version","related_material":{"record":[{"status":"public","id":"418","relation":"dissertation_contains"}]},"issue":"15","acknowledgement":"European Union Seventh Framework Programme; Human Frontier Science Program; Oesterreichische Nationalbank Anniversary Fund 14211; Austrian Research Promotion Agency; FemTech","fulldoi":"https://doi.org/10.15252/embj.201387695","author":[{"first_name":"Michael","full_name":"Grusch, Michael","last_name":"Grusch"},{"last_name":"Schelch","first_name":"Karin","full_name":"Schelch, Karin"},{"first_name":"Robert","full_name":"Riedler, Robert","last_name":"Riedler"},{"first_name":"Eva","orcid":"0000-0002-7218-7738","full_name":"Gschaider-Reichhart, Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart"},{"full_name":"Differ, Christopher","first_name":"Christopher","last_name":"Differ"},{"last_name":"Berger","full_name":"Berger, Walter","first_name":"Walter"},{"id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","last_name":"Inglés Prieto","full_name":"Inglés Prieto, Álvaro","first_name":"Álvaro","orcid":"0000-0002-5409-8571"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315","first_name":"Harald L"}],"publication":"EMBO Journal","title":"Spatio-temporally precise activation of engineered receptor tyrosine kinases by light","page":"1713 - 1726","department":[{"_id":"HaJa"}],"year":"2014","citation":{"mla":"Grusch, Michael, et al. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” <i>EMBO Journal</i>, vol. 33, no. 15, Wiley-Blackwell, 2014, pp. 1713–26, doi:<a href=\"https://doi.org/10.15252/embj.201387695\">10.15252/embj.201387695</a>.","short":"M. Grusch, K. Schelch, R. Riedler, E. Gschaider-Reichhart, C. Differ, W. Berger, Á. Inglés Prieto, H.L. Janovjak, EMBO Journal 33 (2014) 1713–1726.","apa":"Grusch, M., Schelch, K., Riedler, R., Gschaider-Reichhart, E., Differ, C., Berger, W., … Janovjak, H. L. (2014). Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.15252/embj.201387695\">https://doi.org/10.15252/embj.201387695</a>","ieee":"M. Grusch <i>et al.</i>, “Spatio-temporally precise activation of engineered receptor tyrosine kinases by light,” <i>EMBO Journal</i>, vol. 33, no. 15. Wiley-Blackwell, pp. 1713–1726, 2014.","chicago":"Grusch, Michael, Karin Schelch, Robert Riedler, Eva Gschaider-Reichhart, Christopher Differ, Walter Berger, Álvaro Inglés Prieto, and Harald L Janovjak. “Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases by Light.” <i>EMBO Journal</i>. Wiley-Blackwell, 2014. <a href=\"https://doi.org/10.15252/embj.201387695\">https://doi.org/10.15252/embj.201387695</a>.","ama":"Grusch M, Schelch K, Riedler R, et al. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. <i>EMBO Journal</i>. 2014;33(15):1713-1726. doi:<a href=\"https://doi.org/10.15252/embj.201387695\">10.15252/embj.201387695</a>","ista":"Grusch M, Schelch K, Riedler R, Gschaider-Reichhart E, Differ C, Berger W, Inglés Prieto Á, Janovjak HL. 2014. Spatio-temporally precise activation of engineered receptor tyrosine kinases by light. EMBO Journal. 33(15), 1713–1726."},"volume":33,"publisher":"Wiley-Blackwell","doi":"10.15252/embj.201387695","date_updated":"2026-04-08T14:11:53Z","external_id":{"isi":["000339917000011"]},"scopus_import":"1"},{"scopus_import":"1","external_id":{"isi":["000339995100042"]},"date_updated":"2025-09-29T11:45:41Z","doi":"10.1371/journal.pone.0103989","publisher":"Public Library of Science","volume":9,"citation":{"mla":"Wolf, Stephan, et al. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>, vol. 9, no. 8, e103989, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>.","short":"S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, PLoS One 9 (2014).","apa":"Wolf, S., Mcmahon, D., Lim, K., Pull, C., Clark, S., Paxton, R., &#38; Osborne, J. (2014). So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>","chicago":"Wolf, Stephan, Dino Mcmahon, Ka Lim, Christopher Pull, Suzanne Clark, Robert Paxton, and Juliet Osborne. “So near and yet so Far: Harmonic Radar Reveals Reduced Homing Ability of Nosema Infected Honeybees.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0103989\">https://doi.org/10.1371/journal.pone.0103989</a>.","ama":"Wolf S, Mcmahon D, Lim K, et al. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. <i>PLoS One</i>. 2014;9(8). doi:<a href=\"https://doi.org/10.1371/journal.pone.0103989\">10.1371/journal.pone.0103989</a>","ista":"Wolf S, Mcmahon D, Lim K, Pull C, Clark S, Paxton R, Osborne J. 2014. So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees. PLoS One. 9(8), e103989.","ieee":"S. Wolf <i>et al.</i>, “So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees,” <i>PLoS One</i>, vol. 9, no. 8. Public Library of Science, 2014."},"year":"2014","department":[{"_id":"SyCr"}],"publication":"PLoS One","author":[{"first_name":"Stephan","full_name":"Wolf, Stephan","last_name":"Wolf"},{"full_name":"Mcmahon, Dino","first_name":"Dino","last_name":"Mcmahon"},{"full_name":"Lim, Ka","first_name":"Ka","last_name":"Lim"},{"id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","last_name":"Pull","first_name":"Christopher","orcid":"0000-0003-1122-3982","full_name":"Pull, Christopher"},{"full_name":"Clark, Suzanne","first_name":"Suzanne","last_name":"Clark"},{"first_name":"Robert","full_name":"Paxton, Robert","last_name":"Paxton"},{"last_name":"Osborne","full_name":"Osborne, Juliet","first_name":"Juliet"}],"fulldoi":"https://doi.org/10.1371/journal.pone.0103989","file":[{"file_size":1013386,"file_name":"IST-2016-437-v1+1_journal.pone.0103989.pdf","date_created":"2018-12-12T10:13:55Z","checksum":"2fc62c6739eada4bddf026afbae669db","date_updated":"2020-07-14T12:45:28Z","file_id":"5042","relation":"main_file","creator":"system","content_type":"application/pdf","access_level":"open_access"}],"title":"So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected honeybees","related_material":{"record":[{"relation":"research_data","status":"public","id":"9888"}]},"acknowledgement":"This study was funded jointly by a grant from BBSRC, Defra, NERC, the Scottish Government and the Wellcome Trust, under the Insect Pollinators Initiative (grant numbers BB/I00097/1 and BB/I000100/1). Rothamsted Research is a national institute of bioscience strategically funded by the UK Biotechnology and Biological Sciences Research Council (BBSRC).","ddc":["570"],"pubrep_id":"437","issue":"8","file_date_updated":"2020-07-14T12:45:28Z","date_published":"2014-08-06T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"Pathogens may gain a fitness advantage through manipulation of the behaviour of their hosts. Likewise, host behavioural changes can be a defence mechanism, counteracting the impact of pathogens on host fitness. We apply harmonic radar technology to characterize the impact of an emerging pathogen - Nosema ceranae (Microsporidia) - on honeybee (Apis mellifera) flight and orientation performance in the field. Honeybees are the most important commercial pollinators. Emerging diseases have been proposed to play a prominent role in colony decline, partly through sub-lethal behavioural manipulation of their hosts. We found that homing success was significantly reduced in diseased (65.8%) versus healthy foragers (92.5%). Although lost bees had significantly reduced continuous flight times and prolonged resting times, other flight characteristics and navigational abilities showed no significant difference between infected and non-infected bees. Our results suggest that infected bees express normal flight characteristics but are constrained in their homing ability, potentially compromising the colony by reducing its resource inputs, but also counteracting the intra-colony spread of infection. We provide the first high-resolution analysis of sub-lethal effects of an emerging disease on insect flight behaviour. The potential causes and the implications for both host and parasite are discussed."}],"status":"public","has_accepted_license":"1","isi":1,"article_processing_charge":"No","oa_version":"Published Version","article_number":"e103989","language":[{"iso":"eng"}],"publist_id":"4949","oa":1,"quality_controlled":"1","_id":"2086","type":"journal_article","day":"06","date_created":"2018-12-11T11:55:37Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"         9","month":"08","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"}},{"oa":1,"quality_controlled":"1","type":"journal_article","_id":"2141","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:55:57Z","intvolume":"        61","month":"05","main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/3933/"}],"date_published":"2014-05-01T00:00:00Z","abstract":[{"text":"The computation of the winning set for Büchi objectives in alternating games on graphs is a central problem in computer-aided verification with a large number of applications. The long-standing best known upper bound for solving the problem is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2)-time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m&gt;n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms are the first dynamic algorithms for this problem. We then consider another core graph theoretic problem in verification of probabilistic systems, namely computing the maximal end-component decomposition of a graph. We present two improved static algorithms for the maximal end-component decomposition problem. Our first algorithm is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm which is obtained using the same technique as for alternating Büchi games. Thus, we obtain an O(min &amp;lcu;m ⋅ √m,n2})-time algorithm improving the long-standing O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component decomposition of a graph under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time per edge insertion. Again, our algorithms are the first dynamic algorithms for this problem.","lang":"eng"}],"status":"public","publication_status":"published","isi":1,"article_processing_charge":"No","oa_version":"Submitted Version","article_number":"a15","language":[{"iso":"eng"}],"publist_id":"4883","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530"}],"publication":"Journal of the ACM","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"fulldoi":"https://doi.org/10.1145/2597631","title":"Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition","related_material":{"record":[{"id":"3165","status":"public","relation":"earlier_version"}]},"issue":"3","ec_funded":1,"scopus_import":"1","external_id":{"isi":["000337201400001"]},"doi":"10.1145/2597631","date_updated":"2025-09-29T11:45:13Z","publisher":"ACM","volume":61,"citation":{"ieee":"K. Chatterjee and M. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014.","ista":"Chatterjee K, Henzinger M. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.","ama":"Chatterjee K, Henzinger M. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>","chicago":"Chatterjee, Krishnendu, and Monika Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>.","short":"K. Chatterjee, M. Henzinger, Journal of the ACM 61 (2014).","apa":"Chatterjee, K., &#38; Henzinger, M. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597631\">https://doi.org/10.1145/2597631</a>","mla":"Chatterjee, Krishnendu, and Monika Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.” <i>Journal of the ACM</i>, vol. 61, no. 3, a15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597631\">10.1145/2597631</a>."},"year":"2014","department":[{"_id":"KrCh"}]},{"publisher":"ACM","department":[{"_id":"HeEd"}],"citation":{"chicago":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 355–64. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>.","ista":"Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364.","ama":"Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability of persistence. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:355-364. doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>","ieee":"U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 355–364.","mla":"Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 355–64, doi:<a href=\"https://doi.org/10.1145/2582112.2582168\">10.1145/2582112.2582168</a>.","apa":"Bauer, U., &#38; Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 355–364). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582168\">https://doi.org/10.1145/2582112.2582168</a>","short":"U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–364."},"year":"2014","scopus_import":"1","date_updated":"2025-06-11T07:57:54Z","doi":"10.1145/2582112.2582168","external_id":{"arxiv":["1311.3681"]},"ec_funded":1,"title":"Induced matchings of barcodes and the algebraic stability of persistence","page":"355 - 364","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","full_name":"Bauer, Ulrich","first_name":"Ulrich","orcid":"0000-0002-9683-0724"},{"full_name":"Lesnick, Michael","first_name":"Michael","last_name":"Lesnick"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","fulldoi":"https://doi.org/10.1145/2582112.2582168","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493","name":"Topological Complex Systems"}],"conference":{"location":"Kyoto, Japan","name":"SoCG: Symposium on Computational Geometry","end_date":"2014-06-11","start_date":"2014-06-08"},"publist_id":"4853","language":[{"iso":"eng"}],"oa_version":"Submitted Version","publication_status":"published","abstract":[{"lang":"eng","text":"We define a simple, explicit map sending a morphism f : M → N of pointwise finite dimensional persistence modules to a matching between the barcodes of M and N. Our main result is that, in a precise sense, the quality of this matching is tightly controlled by the lengths of the longest intervals in the barcodes of ker f and coker f . As an immediate corollary, we obtain a new proof of the algebraic stability theorem for persistence barcodes [5, 9], a fundamental result in the theory of persistent homology. In contrast to previous proofs, ours shows explicitly how a δ-interleaving morphism between two persistence modules induces a δ-matching between the barcodes of the two modules. Our main result also specializes to a structure theorem for submodules and quotients of persistence modules. Copyright is held by the owner/author(s)."}],"status":"public","date_published":"2014-06-01T00:00:00Z","article_processing_charge":"No","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:01Z","month":"06","main_file_link":[{"url":"http://arxiv.org/abs/1311.3681","open_access":"1"}],"quality_controlled":"1","day":"01","_id":"2153","type":"conference","oa":1},{"oa":1,"_id":"2154","day":"01","type":"journal_article","quality_controlled":"1","intvolume":"        52","main_file_link":[{"url":"http://arxiv.org/abs/1102.3515","open_access":"1"}],"month":"07","date_created":"2018-12-11T11:56:01Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"isi":1,"article_processing_charge":"No","date_published":"2014-07-01T00:00:00Z","status":"public","publication_status":"published","abstract":[{"lang":"eng","text":"A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that for every d there exists cd &gt; 0 such that for every n-point set P ⊂ ℝd, some point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned by the points of P. The largest possible value of cd has been the subject of ongoing research. Recently Gromov improved the existing lower bounds considerably by introducing a new, topological proof method. We provide an exposition of the combinatorial component of Gromov's approach, in terms accessible to combinatorialists and discrete geometers, and we investigate the limits of his method. In particular, we give tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds yield a minor improvement over Gromov's lower bounds on cd for large d, but they also show that the room for further improvement through the cofilling profiles alone is quite small. We also prove a slightly better lower bound for c3 by an approach using an additional structure besides the cofilling profiles. We formulate a combinatorial extremal problem whose solution might perhaps lead to a tight lower bound for cd."}],"oa_version":"Submitted Version","language":[{"iso":"eng"}],"publist_id":"4852","project":[{"_id":"25FA3206-B435-11E9-9278-68D0E5697425","name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","grant_number":"PP00P2_138948"}],"fulldoi":"https://doi.org/10.1007/s00454-014-9584-7","publication":"Discrete & Computational Geometry","author":[{"last_name":"Matoušek","full_name":"Matoušek, Jiří","first_name":"Jiří"},{"full_name":"Wagner, Uli","first_name":"Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"page":"1 - 33","title":"On Gromov's method of selecting heavily covered points","issue":"1","acknowledgement":"Swiss National Science Foundation (SNF 200021-125309, 200020-138230, 200020-12507)","external_id":{"arxiv":["1102.3515"],"isi":["000339382600001"]},"date_updated":"2025-09-29T11:44:29Z","doi":"10.1007/s00454-014-9584-7","scopus_import":"1","citation":{"mla":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1, Springer, 2014, pp. 1–33, doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>.","apa":"Matoušek, J., &#38; Wagner, U. (2014). On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>","short":"J. Matoušek, U. Wagner, Discrete &#38; Computational Geometry 52 (2014) 1–33.","ieee":"J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered points,” <i>Discrete &#38; Computational Geometry</i>, vol. 52, no. 1. Springer, pp. 1–33, 2014.","chicago":"Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered Points.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00454-014-9584-7\">https://doi.org/10.1007/s00454-014-9584-7</a>.","ista":"Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered points. Discrete &#38; Computational Geometry. 52(1), 1–33.","ama":"Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points. <i>Discrete &#38; Computational Geometry</i>. 2014;52(1):1-33. doi:<a href=\"https://doi.org/10.1007/s00454-014-9584-7\">10.1007/s00454-014-9584-7</a>"},"year":"2014","department":[{"_id":"UlWa"}],"publisher":"Springer","volume":52},{"arxiv":1,"date_created":"2018-12-11T11:56:01Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1312.1231"}],"month":"06","quality_controlled":"1","corr_author":"1","day":"01","_id":"2155","type":"conference","oa":1,"language":[{"iso":"eng"}],"publist_id":"4851","oa_version":"Submitted Version","date_published":"2014-06-01T00:00:00Z","publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"Given a finite set of points in Rn and a positive radius, we study the Čech, Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete Morse theory. We prove that the latter three complexes are simple-homotopy equivalent. Our results have applications in topological data analysis and in the reconstruction of shapes from sampled data. Copyright is held by the owner/author(s)."}],"article_processing_charge":"No","acknowledgement":"This research is partially supported by ESF under the ACAT Research Network Programme, and by the Russian Government under mega project 11.G34.31.0053","page":"484 - 490","title":"The morse theory of Čech and Delaunay filtrations","author":[{"first_name":"Ulrich","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer"},{"first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","fulldoi":"https://doi.org/10.1145/2582112.2582167","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493","name":"Topological Complex Systems"}],"conference":{"location":"Kyoto, Japan","start_date":"2014-06-08","name":"SoCG: Symposium on Computational Geometry","end_date":"2014-06-11"},"publisher":"ACM","year":"2014","citation":{"ieee":"U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 484–490.","ista":"Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.","ama":"Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:484-490. doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>","chicago":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 484–90. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>.","short":"U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–490.","apa":"Bauer, U., &#38; Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay filtrations. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 484–490). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582167\">https://doi.org/10.1145/2582112.2582167</a>","mla":"Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay Filtrations.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 484–90, doi:<a href=\"https://doi.org/10.1145/2582112.2582167\">10.1145/2582112.2582167</a>."},"department":[{"_id":"HeEd"}],"scopus_import":"1","external_id":{"arxiv":["1312.1231"]},"doi":"10.1145/2582112.2582167","date_updated":"2025-06-11T07:58:27Z","ec_funded":1},{"publisher":"ACM","department":[{"_id":"HeEd"}],"citation":{"ieee":"U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 464–473.","chicago":"Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb Graphs.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 464–73. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>.","ama":"Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:464-473. doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>","ista":"Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473.","mla":"Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 464–73, doi:<a href=\"https://doi.org/10.1145/2582112.2582169\">10.1145/2582112.2582169</a>.","apa":"Bauer, U., Ge, X., &#38; Wang, Y. (2014). Measuring distance between Reeb graphs. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 464–473). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582169\">https://doi.org/10.1145/2582112.2582169</a>","short":"U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–473."},"year":"2014","scopus_import":"1","doi":"10.1145/2582112.2582169","date_updated":"2025-06-11T07:58:42Z","external_id":{"arxiv":["1307.2839"]},"ec_funded":1,"acknowledgement":"National Science Foundation under grants CCF-1319406, CCF-1116258.","title":"Measuring distance between Reeb graphs","page":"464 - 473","author":[{"last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich","first_name":"Ulrich","orcid":"0000-0002-9683-0724"},{"last_name":"Ge","full_name":"Ge, Xiaoyin","first_name":"Xiaoyin"},{"full_name":"Wang, Yusu","first_name":"Yusu","last_name":"Wang"}],"publication":"Proceedings of the Annual Symposium on Computational Geometry","conference":{"location":"Kyoto, Japan","start_date":"2014-06-08","end_date":"2014-06-11","name":"SoCG: Symposium on Computational Geometry"},"fulldoi":"https://doi.org/10.1145/2582112.2582169","project":[{"name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"publist_id":"4850","language":[{"iso":"eng"}],"oa_version":"Submitted Version","status":"public","abstract":[{"text":"We propose a metric for Reeb graphs, called the functional distortion distance. Under this distance, the Reeb graph is stable against small changes of input functions. At the same time, it remains discriminative at differentiating input functions. In particular, the main result is that the functional distortion distance between two Reeb graphs is bounded from below by the bottleneck distance between both the ordinary and extended persistence diagrams for appropriate dimensions. As an application of our results, we analyze a natural simplification scheme for Reeb graphs, and show that persistent features in Reeb graph remains persistent under simplification. Understanding the stability of important features of the Reeb graph under simplification is an interesting problem on its own right, and critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s).","lang":"eng"}],"publication_status":"published","date_published":"2014-06-01T00:00:00Z","article_processing_charge":"No","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:02Z","month":"06","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.2839"}],"quality_controlled":"1","_id":"2156","day":"01","type":"conference","oa":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:56:02Z","month":"06","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0815"}],"arxiv":1,"oa":1,"quality_controlled":"1","type":"conference","_id":"2157","day":"01","publist_id":"4849","language":[{"iso":"eng"}],"publication_status":"published","status":"public","abstract":[{"lang":"eng","text":"We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, i.e., an essential curve in the boundary of X bounding a disk in S3 nX with length bounded by a computable function of the number of tetrahedra of X."}],"date_published":"2014-06-01T00:00:00Z","article_processing_charge":"No","oa_version":"Submitted Version","related_material":{"record":[{"relation":"later_version","status":"public","id":"425"}]},"acknowledgement":"ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023  (SNSF-PP00P2-138948); Swiss National Science Foundation  (SNSF-200020-138230).","publication":"Proceedings of the Annual Symposium on Computational Geometry","author":[{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"first_name":"Eric","full_name":"Sedgwick, Eric","last_name":"Sedgwick"},{"last_name":"Tancer","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","first_name":"Martin","full_name":"Tancer, Martin"},{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","first_name":"Uli","full_name":"Wagner, Uli"}],"conference":{"end_date":"2014-06-11","name":"SoCG: Symposium on Computational Geometry","start_date":"2014-06-08","location":"Kyoto, Japan"},"fulldoi":"https://doi.org/10.1145/2582112.2582137","title":"Embeddability in the 3 sphere is decidable","page":"78 - 84","publisher":"ACM","department":[{"_id":"UlWa"}],"year":"2014","citation":{"ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3 sphere is decidable,” in <i>Proceedings of the Annual Symposium on Computational Geometry</i>, Kyoto, Japan, 2014, pp. 78–84.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere is decidable. In: <i>Proceedings of the Annual Symposium on Computational Geometry</i>. ACM; 2014:78-84. doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3 sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 78–84.","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3 Sphere Is Decidable.” In <i>Proceedings of the Annual Symposium on Computational Geometry</i>, 78–84. ACM, 2014. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2014). Embeddability in the 3 sphere is decidable. In <i>Proceedings of the Annual Symposium on Computational Geometry</i> (pp. 78–84). Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/2582112.2582137\">https://doi.org/10.1145/2582112.2582137</a>","mla":"Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” <i>Proceedings of the Annual Symposium on Computational Geometry</i>, ACM, 2014, pp. 78–84, doi:<a href=\"https://doi.org/10.1145/2582112.2582137\">10.1145/2582112.2582137</a>."},"scopus_import":"1","date_updated":"2025-06-11T07:59:02Z","doi":"10.1145/2582112.2582137","external_id":{"arxiv":["1402.0815"]}},{"date_created":"2018-12-11T11:56:03Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","intvolume":"        30","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/"}],"month":"10","quality_controlled":"1","_id":"2158","day":"01","type":"journal_article","oa":1,"language":[{"iso":"eng"}],"publist_id":"4848","oa_version":"Submitted Version","date_published":"2014-10-01T00:00:00Z","publication_status":"published","abstract":[{"text":"Directional guidance of migrating cells is relatively well explored in the reductionist setting of cell culture experiments. Here spatial gradients of chemical cues as well as gradients of mechanical substrate characteristics prove sufficient to attract single cells as well as their collectives. How such gradients present and act in the context of an organism is far less clear. Here we review recent advances in understanding how guidance cues emerge and operate in the physiological context.","lang":"eng"}],"status":"public","isi":1,"article_processing_charge":"No","acknowledgement":"This effort was supported by the Intramural Research Program of the Center for Cancer Research, NCI, National Institutes of Health and the European Research Council (ERC).","issue":"1","page":"33 - 40","title":"New paradigms in the establishment and maintenance of gradients during directed cell migration","author":[{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar"},{"last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","first_name":"Michael K"},{"first_name":"Carole","full_name":"Parent, Carole","last_name":"Parent"}],"publication":"Current Opinion in Cell Biology","fulldoi":"https://doi.org/10.1016/j.ceb.2014.05.010","volume":30,"publisher":"Elsevier","year":"2014","citation":{"apa":"Majumdar, R., Sixt, M. K., &#38; Parent, C. (2014). New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>","short":"R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014) 33–40.","mla":"Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>.","ista":"Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and maintenance of gradients during directed cell migration. Current Opinion in Cell Biology. 30(1), 33–40.","ama":"Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance of gradients during directed cell migration. <i>Current Opinion in Cell Biology</i>. 2014;30(1):33-40. doi:<a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">10.1016/j.ceb.2014.05.010</a>","chicago":"Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in the Establishment and Maintenance of Gradients during Directed Cell Migration.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.ceb.2014.05.010\">https://doi.org/10.1016/j.ceb.2014.05.010</a>.","ieee":"R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment and maintenance of gradients during directed cell migration,” <i>Current Opinion in Cell Biology</i>, vol. 30, no. 1. Elsevier, pp. 33–40, 2014."},"department":[{"_id":"MiSi"}],"scopus_import":"1","external_id":{"isi":["000343620300006"],"pmid":["24959970"]},"pmid":1,"date_updated":"2025-09-29T11:43:11Z","doi":"10.1016/j.ceb.2014.05.010"},{"article_processing_charge":"No","abstract":[{"lang":"eng","text":"Transfer learning has received a lot of attention in the machine learning community over the last years, and several effective algorithms have been developed. However, relatively little is known about their theoretical properties, especially in the setting of lifelong learning, where the goal is to transfer information to tasks for which no data have been observed so far. In this work we study lifelong learning from a theoretical perspective. Our main result is a PAC-Bayesian generalization bound that offers a unified view on existing paradigms for transfer learning, such as the transfer of parameters or the transfer of low-dimensional representations. We also use the bound to derive two principled lifelong learning algorithms, and we show that these yield results comparable with existing methods."}],"status":"public","publication_status":"published","date_published":"2014-05-10T00:00:00Z","date_updated":"2024-10-09T20:55:36Z","scopus_import":"1","oa_version":"Submitted Version","department":[{"_id":"ChLa"}],"year":"2014","citation":{"mla":"Pentina, Anastasia, and Christoph Lampert. <i>A PAC-Bayesian Bound for Lifelong Learning</i>. Vol. 32, ML Research Press, 2014, pp. 991–99.","short":"A. Pentina, C. Lampert, in:, ML Research Press, 2014, pp. 991–999.","apa":"Pentina, A., &#38; Lampert, C. (2014). A PAC-Bayesian bound for Lifelong Learning (Vol. 32, pp. 991–999). Presented at the ICML: International Conference on Machine Learning, Beijing, China: ML Research Press.","ieee":"A. Pentina and C. Lampert, “A PAC-Bayesian bound for Lifelong Learning,” presented at the ICML: International Conference on Machine Learning, Beijing, China, 2014, vol. 32, pp. 991–999.","chicago":"Pentina, Anastasia, and Christoph Lampert. “A PAC-Bayesian Bound for Lifelong Learning,” 32:991–99. ML Research Press, 2014.","ama":"Pentina A, Lampert C. A PAC-Bayesian bound for Lifelong Learning. In: Vol 32. ML Research Press; 2014:991-999.","ista":"Pentina A, Lampert C. 2014. A PAC-Bayesian bound for Lifelong Learning. ICML: International Conference on Machine Learning vol. 32, 991–999."},"volume":32,"publisher":"ML Research Press","publist_id":"4844","language":[{"iso":"eng"}],"oa":1,"conference":{"location":"Beijing, China","name":"ICML: International Conference on Machine Learning","end_date":"2014-06-26","start_date":"2014-06-21"},"author":[{"first_name":"Anastasia","full_name":"Pentina, Anastasia","last_name":"Pentina","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"_id":"2160","type":"conference","day":"10","title":"A PAC-Bayesian bound for Lifelong Learning","page":"991 - 999","quality_controlled":"1","corr_author":"1","main_file_link":[{"url":"https://dl.acm.org/citation.cfm?id=3045003","open_access":"1"}],"month":"05","intvolume":"        32","date_created":"2018-12-11T11:56:03Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]