[{"oa_version":"Published Version","date_created":"2018-12-12T12:31:31Z","date_published":"2016-08-25T00:00:00Z","ddc":["571"],"month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:02Z","department":[{"_id":"ToBo"}],"day":"25","citation":{"ama":"Lukacisin M, Landon M, Jajoo R. MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>","short":"M. Lukacisin, M. Landon, R. Jajoo, (2016).","ista":"Lukacisin M, Landon M, Jajoo R. 2016. MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>.","apa":"Lukacisin, M., Landon, M., &#38; Jajoo, R. (2016). MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:45\">https://doi.org/10.15479/AT:ISTA:45</a>","ieee":"M. Lukacisin, M. Landon, and R. Jajoo, “MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2016.","chicago":"Lukacisin, Martin, Matthieu Landon, and Rishi Jajoo. “MATLAB Analysis Code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:45\">https://doi.org/10.15479/AT:ISTA:45</a>.","mla":"Lukacisin, Martin, et al. <i>MATLAB Analysis Code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.”</i> Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>."},"type":"research_data","article_processing_charge":"No","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","image":"/images/cc_by_sa.png","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)"},"file":[{"relation":"main_file","creator":"system","file_size":296722548,"file_name":"IST-2016-45-v1+1_PaperCode.zip","date_updated":"2020-07-14T12:47:02Z","checksum":"ee697f2b1ade4dc14d6ac0334dd832ab","content_type":"application/zip","access_level":"open_access","date_created":"2018-12-12T13:02:58Z","file_id":"5616"}],"publisher":"Institute of Science and Technology Austria","keyword":["transcription","pausing","backtracking","polymerase","RNA","NET-seq","nucleosome","basepairing"],"doi":"10.15479/AT:ISTA:45","year":"2016","abstract":[{"text":"MATLAB code and processed datasets available for reproducing the results in: \r\nLukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.\r\n*equal contributions","lang":"eng"}],"_id":"5556","author":[{"first_name":"Martin","id":"298FFE8C-F248-11E8-B48F-1D18A9856A87","last_name":"Lukacisin","full_name":"Lukacisin, Martin","orcid":"0000-0001-6549-4177"},{"last_name":"Landon","full_name":"Landon, Matthieu","first_name":"Matthieu"},{"last_name":"Jajoo","full_name":"Jajoo, Rishi","first_name":"Rishi"}],"datarep_id":"45","oa":1,"title":"MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'","status":"public","related_material":{"record":[{"id":"8431","status":"deleted","relation":"used_in_publication"},{"relation":"research_paper","status":"public","id":"1029"}]},"date_updated":"2024-02-21T13:51:53Z"},{"year":"2016","abstract":[{"text":"Small synthetic discrete tomography problems.\r\nSizes are 32x32, 64z64 and 256x256.\r\nProjection angles are 2, 4, and 6.\r\nNumber of labels are 3 and 5.","lang":"eng"}],"keyword":["discrete tomography"],"doi":"10.15479/AT:ISTA:46","author":[{"last_name":"Swoboda","full_name":"Swoboda, Paul","first_name":"Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"}],"datarep_id":"46","title":"Synthetic discrete tomography problems","oa":1,"_id":"5557","status":"public","date_updated":"2024-02-21T13:50:21Z","date_published":"2016-09-20T00:00:00Z","oa_version":"Published Version","date_created":"2018-12-12T12:31:31Z","department":[{"_id":"VlKo"}],"day":"20","citation":{"chicago":"Swoboda, Paul. “Synthetic Discrete Tomography Problems.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:46\">https://doi.org/10.15479/AT:ISTA:46</a>.","mla":"Swoboda, Paul. <i>Synthetic Discrete Tomography Problems</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>.","ieee":"P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science and Technology Austria, 2016.","apa":"Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:46\">https://doi.org/10.15479/AT:ISTA:46</a>","ista":"Swoboda P. 2016. Synthetic discrete tomography problems, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>.","short":"P. Swoboda, (2016).","ama":"Swoboda P. Synthetic discrete tomography problems. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:47:02Z","month":"09","ddc":["006"],"contributor":[{"contributor_type":"data_collector","last_name":"Kuske","first_name":"Jan"}],"has_accepted_license":"1","type":"research_data","article_processing_charge":"No","file":[{"file_id":"5645","date_created":"2018-12-12T13:05:19Z","file_name":"IST-2016-46-v1+1_discrete_tomography_synthetic.zip","creator":"system","relation":"main_file","file_size":36058401,"date_updated":"2020-07-14T12:47:02Z","access_level":"open_access","checksum":"aa5a16a0dc888da7186fb8fc45e88439","content_type":"application/zip"}],"tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"publisher":"Institute of Science and Technology Austria"},{"author":[{"last_name":"Bojsen-Hansen","full_name":"Bojsen-Hansen, Morten","first_name":"Morten","id":"439F0C8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4417-3224"}],"oa":1,"title":"Tracking, Correcting and Absorbing Water Surface Waves","datarep_id":"48","_id":"5558","year":"2016","abstract":[{"lang":"eng","text":"PhD thesis LaTeX source code"}],"doi":"10.15479/AT:ISTA:48","date_updated":"2024-02-21T13:50:48Z","status":"public","related_material":{"record":[{"id":"1122","status":"public","relation":"other"}]},"day":"23","department":[{"_id":"ChWo"}],"citation":{"mla":"Bojsen-Hansen, Morten. <i>Tracking, Correcting and Absorbing Water Surface Waves</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:48\">10.15479/AT:ISTA:48</a>.","chicago":"Bojsen-Hansen, Morten. “Tracking, Correcting and Absorbing Water Surface Waves.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:48\">https://doi.org/10.15479/AT:ISTA:48</a>.","apa":"Bojsen-Hansen, M. (2016). Tracking, Correcting and Absorbing Water Surface Waves. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:48\">https://doi.org/10.15479/AT:ISTA:48</a>","ieee":"M. Bojsen-Hansen, “Tracking, Correcting and Absorbing Water Surface Waves.” Institute of Science and Technology Austria, 2016.","ista":"Bojsen-Hansen M. 2016. Tracking, Correcting and Absorbing Water Surface Waves, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:48\">10.15479/AT:ISTA:48</a>.","ama":"Bojsen-Hansen M. Tracking, Correcting and Absorbing Water Surface Waves. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:48\">10.15479/AT:ISTA:48</a>","short":"M. Bojsen-Hansen, (2016)."},"pubrep_id":"640","publist_id":"6238","month":"09","ddc":["004"],"file_date_updated":"2020-07-14T12:47:02Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2016-09-23T00:00:00Z","oa_version":"Published Version","date_created":"2018-12-12T12:31:31Z","file":[{"file_name":"IST-2016-48-v1+1_2016_Bojsen-Hansen_TCaAWSW.tar.bz2","relation":"main_file","creator":"system","file_size":55237885,"access_level":"open_access","content_type":"application/x-bzip2","checksum":"5b1b256ad796fbddb4b7729f5e45e444","date_updated":"2020-07-14T12:47:02Z","file_id":"5589","date_created":"2018-12-12T13:02:18Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","type":"research_data","article_processing_charge":"No"},{"doi":"10.1093/molbev/msv270","abstract":[{"text":"Parasitism creates selection for resistance mechanisms in host populations and is hypothesized to promote increased host evolvability. However, the influence of these traits on host evolution when parasites are no longer present is unclear. We used experimental evolution and whole-genome sequencing of Escherichia coli to determine the effects of past and present exposure to parasitic viruses (phages) on the spread of mutator alleles, resistance, and bacterial competitive fitness. We found that mutator alleles spread rapidly during adaptation to any of four different phage species, and this pattern was even more pronounced with multiple phages present simultaneously. However, hypermutability did not detectably accelerate adaptation in the absence of phages and recovery of fitness costs associated with resistance. Several lineages evolved phage resistance through elevated mucoidy, and during subsequent evolution in phage-free conditions they rapidly reverted to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this phenotypic reversion was achieved by additional genetic changes rather than by genotypic reversion of the initial resistance mutations. Insertion sequence (IS) elements played a key role in both the acquisition of resistance and adaptation in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions were not more frequent in mutator lineages. Our results provide a genetic explanation for rapid reversion of mucoidy, a phenotype observed in other bacterial species including human pathogens. Moreover, this demonstrates that the types of genetic change underlying adaptation to fitness costs, and consequently the impact of evolvability mechanisms such as increased point-mutation rates, depend critically on the mechanism of resistance.","lang":"eng"}],"issue":"3","_id":"5749","title":"Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria","author":[{"full_name":"Wielgoss, Sébastien","last_name":"Wielgoss","first_name":"Sébastien"},{"orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias","full_name":"Bergmiller, Tobias","last_name":"Bergmiller"},{"first_name":"Anna M.","full_name":"Bischofberger, Anna M.","last_name":"Bischofberger"},{"last_name":"Hall","full_name":"Hall, Alex R.","first_name":"Alex R."}],"publication_status":"published","status":"public","acknowledgement":"The authors thank three anonymous reviewers and the editor for helpful comments on the manuscript, as well as Dominique Schneider for feedback on an earlier draft, Jenna Gallie for lytic λ and Julien Capelle for T5 and T6. This work was supported by the Swiss National Science Foundation (PZ00P3_148255 to A.H.) and an EU Marie Curie PEOPLE Postdoctoral Fellowship for Career Development (FP7-PEOPLE-2012-IEF-331824 to S.W.).","publication_identifier":{"issn":["0737-4038"],"eissn":["1537-1719"]},"oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:10Z","ddc":["576"],"pmid":1,"month":"03","citation":{"chicago":"Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex R. Hall. “Adaptation to Parasites and Costs of Parasite Resistance in Mutator and Nonmutator Bacteria.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/molbev/msv270\">https://doi.org/10.1093/molbev/msv270</a>.","mla":"Wielgoss, Sébastien, et al. “Adaptation to Parasites and Costs of Parasite Resistance in Mutator and Nonmutator Bacteria.” <i>Molecular Biology and Evolution</i>, vol. 33, no. 3, Oxford University Press, 2016, pp. 770–82, doi:<a href=\"https://doi.org/10.1093/molbev/msv270\">10.1093/molbev/msv270</a>.","apa":"Wielgoss, S., Bergmiller, T., Bischofberger, A. M., &#38; Hall, A. R. (2016). Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msv270\">https://doi.org/10.1093/molbev/msv270</a>","ieee":"S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria,” <i>Molecular Biology and Evolution</i>, vol. 33, no. 3. Oxford University Press, pp. 770–782, 2016.","short":"S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, Molecular Biology and Evolution 33 (2016) 770–782.","ista":"Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2016. Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria. Molecular Biology and Evolution. 33(3), 770–782.","ama":"Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria. <i>Molecular Biology and Evolution</i>. 2016;33(3):770-782. doi:<a href=\"https://doi.org/10.1093/molbev/msv270\">10.1093/molbev/msv270</a>"},"pubrep_id":"587","day":"01","volume":33,"article_processing_charge":"No","has_accepted_license":"1","file":[{"file_id":"5750","date_created":"2018-12-18T13:21:45Z","access_level":"open_access","checksum":"47d9010690b6c5c17f2ac830cc63ac5c","content_type":"application/pdf","date_updated":"2020-07-14T12:47:10Z","file_name":"2016_MolBiolEvol_Wielgoss.pdf","relation":"main_file","file_size":634037,"creator":"dernst"}],"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"year":"2016","oa":1,"page":"770-782","related_material":{"record":[{"status":"public","relation":"research_data","id":"9719"}]},"date_updated":"2023-09-05T13:46:05Z","publication":"Molecular Biology and Evolution","date_created":"2018-12-18T13:18:10Z","scopus_import":"1","date_published":"2016-03-01T00:00:00Z","external_id":{"pmid":["26609077"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"CaGu"}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","publisher":"Oxford University Press","intvolume":"        33"},{"date_created":"2019-01-08T20:44:24Z","date_published":"2016-06-02T00:00:00Z","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"HeEd"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"book_chapter","intvolume":"      9667","publisher":"Springer Nature","alternative_title":["LNCS"],"year":"2016","page":"253-264","date_updated":"2022-01-28T08:01:22Z","publication":"Computational Topology in Image Context","conference":{"name":"CTIC: Computational Topology in Image Context","start_date":"2016-06-15","location":"Marseille, France","end_date":"2016-06-17"},"oa_version":"None","month":"06","day":"02","citation":{"apa":"Sen, N., Biswas, R., &#38; Bhowmick, P. (2016). On some local topological properties of naive discrete sphere. In <i>Computational Topology in Image Context</i> (Vol. 9667, pp. 253–264). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">https://doi.org/10.1007/978-3-319-39441-1_23</a>","ieee":"N. Sen, R. Biswas, and P. Bhowmick, “On some local topological properties of naive discrete sphere,” in <i>Computational Topology in Image Context</i>, vol. 9667, Cham: Springer Nature, 2016, pp. 253–264.","ama":"Sen N, Biswas R, Bhowmick P. On some local topological properties of naive discrete sphere. In: <i>Computational Topology in Image Context</i>. Vol 9667. Cham: Springer Nature; 2016:253-264. doi:<a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">10.1007/978-3-319-39441-1_23</a>","short":"N. Sen, R. Biswas, P. Bhowmick, in:, Computational Topology in Image Context, Springer Nature, Cham, 2016, pp. 253–264.","ista":"Sen N, Biswas R, Bhowmick P. 2016.On some local topological properties of naive discrete sphere. In: Computational Topology in Image Context. LNCS, vol. 9667, 253–264.","chicago":"Sen, Nabhasmita, Ranita Biswas, and Partha Bhowmick. “On Some Local Topological Properties of Naive Discrete Sphere.” In <i>Computational Topology in Image Context</i>, 9667:253–64. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">https://doi.org/10.1007/978-3-319-39441-1_23</a>.","mla":"Sen, Nabhasmita, et al. “On Some Local Topological Properties of Naive Discrete Sphere.” <i>Computational Topology in Image Context</i>, vol. 9667, Springer Nature, 2016, pp. 253–64, doi:<a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">10.1007/978-3-319-39441-1_23</a>."},"volume":9667,"article_processing_charge":"No","doi":"10.1007/978-3-319-39441-1_23","abstract":[{"lang":"eng","text":"Discretization of sphere in the integer space follows a particular discretization scheme, which, in principle, conforms to some topological model. This eventually gives rise to interesting topological properties of a discrete spherical surface, which need to be investigated for its analytical characterization. This paper presents some novel results on the local topological properties of the naive model of discrete sphere. They follow from the bijection of each quadraginta octant of naive sphere with its projection map called f -map on the corresponding functional plane and from the characterization of certain jumps in the f-map. As an application, we have shown how these properties can be used in designing an efficient reconstruction algorithm for a naive spherical surface from an input voxel set when it is sparse or noisy."}],"_id":"5805","author":[{"last_name":"Sen","full_name":"Sen, Nabhasmita","first_name":"Nabhasmita"},{"last_name":"Biswas","full_name":"Biswas, Ranita","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"first_name":"Partha","full_name":"Bhowmick, Partha","last_name":"Bhowmick"}],"title":"On some local topological properties of naive discrete sphere","place":"Cham","status":"public","publication_status":"published","publication_identifier":{"isbn":["978-3-319-39440-4"],"issn":["0302-9743"],"eisbn":["978-3-319-39441-1"],"eissn":["1611-3349"]}},{"year":"2016","alternative_title":["LNCS"],"publication":"Discrete Geometry for Computer Imagery","date_updated":"2022-01-28T08:10:11Z","page":"256-267","department":[{"_id":"HeEd"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","extern":"1","date_published":"2016-04-09T00:00:00Z","date_created":"2019-01-08T20:44:37Z","publisher":"Springer Nature","intvolume":"      9647","type":"conference","language":[{"iso":"eng"}],"quality_controlled":"1","title":"On functionality of quadraginta octants of naive sphere with application to circle drawing","author":[{"last_name":"Biswas","full_name":"Biswas, Ranita","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890"},{"first_name":"Partha","last_name":"Bhowmick","full_name":"Bhowmick, Partha"}],"_id":"5806","abstract":[{"text":"Although the concept of functional plane for naive plane is studied and reported in the literature in great detail, no similar study is yet found for naive sphere. This article exposes the first study in this line, opening up further prospects of analyzing the topological properties of sphere in the discrete space. We show that each quadraginta octant Q of a naive sphere forms a bijection with its projected pixel set on a unique coordinate plane, which thereby serves as the functional plane of Q, and hence gives rise to merely mono-jumps during back projection. The other two coordinate planes serve as para-functional and dia-functional planes for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds neither of the two. Owing to this, the quadraginta octants form symmetry groups and subgroups with equivalent jump conditions. We also show a potential application in generating a special class of discrete 3D circles based on back projection and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry, uniqueness, and bounded distance from the underlying real sphere and real plane.","lang":"eng"}],"doi":"10.1007/978-3-319-32360-2_20","publication_identifier":{"issn":["0302-9743","1611-3349"],"eisbn":["978-3-319-32360-2"],"isbn":["978-3-319-32359-6"]},"publication_status":"published","status":"public","place":"Cham","citation":{"ieee":"R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive sphere with application to circle drawing,” in <i>Discrete Geometry for Computer Imagery</i>, Nantes, France, 2016, vol. 9647, pp. 256–267.","apa":"Biswas, R., &#38; Bhowmick, P. (2016). On functionality of quadraginta octants of naive sphere with application to circle drawing. In <i>Discrete Geometry for Computer Imagery</i> (Vol. 9647, pp. 256–267). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">https://doi.org/10.1007/978-3-319-32360-2_20</a>","ama":"Biswas R, Bhowmick P. On functionality of quadraginta octants of naive sphere with application to circle drawing. In: <i>Discrete Geometry for Computer Imagery</i>. Vol 9647. Cham: Springer Nature; 2016:256-267. doi:<a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">10.1007/978-3-319-32360-2_20</a>","short":"R. Biswas, P. Bhowmick, in:, Discrete Geometry for Computer Imagery, Springer Nature, Cham, 2016, pp. 256–267.","ista":"Biswas R, Bhowmick P. 2016. On functionality of quadraginta octants of naive sphere with application to circle drawing. Discrete Geometry for Computer Imagery. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 9647, 256–267.","mla":"Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.” <i>Discrete Geometry for Computer Imagery</i>, vol. 9647, Springer Nature, 2016, pp. 256–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">10.1007/978-3-319-32360-2_20</a>.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.” In <i>Discrete Geometry for Computer Imagery</i>, 9647:256–67. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">https://doi.org/10.1007/978-3-319-32360-2_20</a>."},"day":"09","month":"04","oa_version":"None","conference":{"end_date":"2016-04-20","start_date":"2016-04-18","location":"Nantes, France","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"volume":9647,"article_processing_charge":"No"},{"abstract":[{"text":"A discrete spherical circle is a topologically well-connected 3D circle in the integer space, which belongs to a discrete sphere as well as a discrete plane. It is one of the most important 3D geometric primitives, but has not possibly yet been studied up to its merit. This paper is a maiden exposition of some of its elementary properties, which indicates a sense of its profound theoretical prospects in the framework of digital geometry. We have shown how different types of discretization can lead to forbidden and admissible classes, when one attempts to define the discretization of a spherical circle in terms of intersection between a discrete sphere and a discrete plane. Several fundamental theoretical results have been presented, the algorithm for construction of discrete spherical circles has been discussed, and some test results have been furnished to demonstrate its practicality and usefulness.","lang":"eng"}],"year":"2016","doi":"10.1007/978-3-319-26145-4_7","title":"On the connectivity and smoothness of discrete spherical circles","author":[{"full_name":"Biswas, Ranita","last_name":"Biswas","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","orcid":"0000-0002-5372-7890"},{"first_name":"Partha","full_name":"Bhowmick, Partha","last_name":"Bhowmick"},{"full_name":"Brimkov, Valentin E.","last_name":"Brimkov","first_name":"Valentin E."}],"_id":"5809","status":"public","publication_status":"published","page":"86-100","place":"Cham","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["978-3-319-26145-4"],"isbn":["978-3-319-26144-7"]},"publication":"Combinatorial image analysis","date_updated":"2022-01-28T08:13:03Z","date_published":"2016-01-06T00:00:00Z","extern":"1","oa_version":"None","date_created":"2019-01-08T20:45:19Z","conference":{"location":"Kolkata, India","start_date":"2015-11-24","end_date":"2015-11-27","name":"IWCIA: International Workshop on Combinatorial Image Analysis"},"citation":{"chicago":"Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Connectivity and Smoothness of Discrete Spherical Circles.” In <i>Combinatorial Image Analysis</i>, 9448:86–100. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">https://doi.org/10.1007/978-3-319-26145-4_7</a>.","mla":"Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical Circles.” <i>Combinatorial Image Analysis</i>, vol. 9448, Springer Nature, 2016, pp. 86–100, doi:<a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">10.1007/978-3-319-26145-4_7</a>.","ieee":"R. Biswas, P. Bhowmick, and V. E. Brimkov, “On the connectivity and smoothness of discrete spherical circles,” in <i>Combinatorial image analysis</i>, vol. 9448, Cham: Springer Nature, 2016, pp. 86–100.","apa":"Biswas, R., Bhowmick, P., &#38; Brimkov, V. E. (2016). On the connectivity and smoothness of discrete spherical circles. In <i>Combinatorial image analysis</i> (Vol. 9448, pp. 86–100). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">https://doi.org/10.1007/978-3-319-26145-4_7</a>","ista":"Biswas R, Bhowmick P, Brimkov VE. 2016.On the connectivity and smoothness of discrete spherical circles. In: Combinatorial image analysis. vol. 9448, 86–100.","ama":"Biswas R, Bhowmick P, Brimkov VE. On the connectivity and smoothness of discrete spherical circles. In: <i>Combinatorial Image Analysis</i>. Vol 9448. Cham: Springer Nature; 2016:86-100. doi:<a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">10.1007/978-3-319-26145-4_7</a>","short":"R. Biswas, P. Bhowmick, V.E. Brimkov, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2016, pp. 86–100."},"department":[{"_id":"HeEd"}],"day":"06","month":"01","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","volume":9448,"type":"book_chapter","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Springer Nature","intvolume":"      9448"},{"year":"2016","oa":1,"article_number":"1865","publication":"PeerJ","date_updated":"2021-01-12T06:50:41Z","date_published":"2016-01-01T00:00:00Z","date_created":"2018-12-11T11:51:59Z","scopus_import":1,"department":[{"_id":"SyCr"}],"publist_id":"5767","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","publisher":"PeerJ","intvolume":"      2016","abstract":[{"text":"The rare socially parasitic butterfly Maculinea alcon occurs in two forms, which are characteristic of hygric or xeric habitats and which exploit different host plants and host ants. The status of these two forms has been the subject of considerable controversy. Populations of the two forms are usually spatially distinct, but at Răscruci in Romania both forms occur on the same site (syntopically). We examined the genetic differentiation between the two forms using eight microsatellite markers, and compared with a nearby hygric site, Şardu. Our results showed that while the two forms are strongly differentiated at Răscruci, it is the xeric form there that is most similar to the hygric form at Şardu, and Bayesian clustering algorithms suggest that these two populations have exchanged genes relatively recently. We found strong evidence for population substructuring, caused by high within host ant nest relatedness, indicating very limited dispersal of most ovipositing females, but not association with particular host ant species. Our results are consistent with the results of larger scale phylogeographic studies that suggest that the two forms represent local ecotypes specialising on different host plants, each with a distinct flowering phenology, providing a temporal rather than spatial barrier to gene flow.","lang":"eng"}],"issue":"3","doi":"10.7717/peerj.1865","title":"Host plant use drives genetic differentiation in syntopic populations of Maculinea alcon","author":[{"last_name":"Tartally","full_name":"Tartally, András","first_name":"András"},{"last_name":"Kelager","full_name":"Kelager, Andreas","first_name":"Andreas"},{"last_name":"Fürst","full_name":"Fürst, Matthias","first_name":"Matthias","id":"393B1196-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3712-925X"},{"full_name":"Nash, David","last_name":"Nash","first_name":"David"}],"_id":"1431","status":"public","publication_status":"published","oa_version":"Published Version","pubrep_id":"584","citation":{"chicago":"Tartally, András, Andreas Kelager, Matthias Fürst, and David Nash. “Host Plant Use Drives Genetic Differentiation in Syntopic Populations of Maculinea Alcon.” <i>PeerJ</i>. PeerJ, 2016. <a href=\"https://doi.org/10.7717/peerj.1865\">https://doi.org/10.7717/peerj.1865</a>.","mla":"Tartally, András, et al. “Host Plant Use Drives Genetic Differentiation in Syntopic Populations of Maculinea Alcon.” <i>PeerJ</i>, vol. 2016, no. 3, 1865, PeerJ, 2016, doi:<a href=\"https://doi.org/10.7717/peerj.1865\">10.7717/peerj.1865</a>.","ama":"Tartally A, Kelager A, Fürst M, Nash D. Host plant use drives genetic differentiation in syntopic populations of Maculinea alcon. <i>PeerJ</i>. 2016;2016(3). doi:<a href=\"https://doi.org/10.7717/peerj.1865\">10.7717/peerj.1865</a>","short":"A. Tartally, A. Kelager, M. Fürst, D. Nash, PeerJ 2016 (2016).","ista":"Tartally A, Kelager A, Fürst M, Nash D. 2016. Host plant use drives genetic differentiation in syntopic populations of Maculinea alcon. PeerJ. 2016(3), 1865.","apa":"Tartally, A., Kelager, A., Fürst, M., &#38; Nash, D. (2016). Host plant use drives genetic differentiation in syntopic populations of Maculinea alcon. <i>PeerJ</i>. PeerJ. <a href=\"https://doi.org/10.7717/peerj.1865\">https://doi.org/10.7717/peerj.1865</a>","ieee":"A. Tartally, A. Kelager, M. Fürst, and D. Nash, “Host plant use drives genetic differentiation in syntopic populations of Maculinea alcon,” <i>PeerJ</i>, vol. 2016, no. 3. PeerJ, 2016."},"day":"01","ddc":["570"],"file_date_updated":"2020-07-14T12:44:53Z","month":"01","has_accepted_license":"1","volume":2016,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2018-12-12T10:17:19Z","file_id":"5272","creator":"system","file_size":1216360,"relation":"main_file","file_name":"IST-2016-584-v1+1_peerj-1865.pdf","checksum":"c27d898598a1e3d7f629607a309254e1","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:44:53Z"}]},{"has_accepted_license":"1","volume":7,"file":[{"file_id":"5355","date_created":"2018-12-12T10:18:33Z","date_updated":"2020-07-14T12:44:53Z","access_level":"open_access","content_type":"application/pdf","checksum":"7e84d0392348c874d473b62f1042de22","file_name":"IST-2016-582-v1+1_ncomms11552.pdf","creator":"system","file_size":4510512,"relation":"main_file"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","day":"13","citation":{"ama":"Mishra RK, Kim S, Guzmán J, Jonas PM. Symmetric spike timing-dependent plasticity at CA3–CA3 synapses optimizes storage and recall in autoassociative networks. <i>Nature Communications</i>. 2016;7. doi:<a href=\"https://doi.org/10.1038/ncomms11552\">10.1038/ncomms11552</a>","ista":"Mishra RK, Kim S, Guzmán J, Jonas PM. 2016. Symmetric spike timing-dependent plasticity at CA3–CA3 synapses optimizes storage and recall in autoassociative networks. Nature Communications. 7, 11552.","short":"R.K. Mishra, S. Kim, J. Guzmán, P.M. Jonas, Nature Communications 7 (2016).","apa":"Mishra, R. K., Kim, S., Guzmán, J., &#38; Jonas, P. M. (2016). Symmetric spike timing-dependent plasticity at CA3–CA3 synapses optimizes storage and recall in autoassociative networks. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms11552\">https://doi.org/10.1038/ncomms11552</a>","ieee":"R. K. Mishra, S. Kim, J. Guzmán, and P. M. Jonas, “Symmetric spike timing-dependent plasticity at CA3–CA3 synapses optimizes storage and recall in autoassociative networks,” <i>Nature Communications</i>, vol. 7. Nature Publishing Group, 2016.","mla":"Mishra, Rajiv Kumar, et al. “Symmetric Spike Timing-Dependent Plasticity at CA3–CA3 Synapses Optimizes Storage and Recall in Autoassociative Networks.” <i>Nature Communications</i>, vol. 7, 11552, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/ncomms11552\">10.1038/ncomms11552</a>.","chicago":"Mishra, Rajiv Kumar, Sooyun Kim, José Guzmán, and Peter M Jonas. “Symmetric Spike Timing-Dependent Plasticity at CA3–CA3 Synapses Optimizes Storage and Recall in Autoassociative Networks.” <i>Nature Communications</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/ncomms11552\">https://doi.org/10.1038/ncomms11552</a>."},"pubrep_id":"582","ddc":["570"],"month":"05","file_date_updated":"2020-07-14T12:44:53Z","status":"public","publication_status":"published","acknowledgement":"We thank Jozsef Csicsvari and Nelson Spruston for critically reading the manuscript. We also thank A. Schlögl for programming, F. Marr for technical assistance and E. Kramberger for manuscript editing. ","ec_funded":1,"project":[{"call_identifier":"FWF","name":"Mechanisms of transmitter release at GABAergic synapses","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","grant_number":"P24909-B24"},{"name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","call_identifier":"FP7","_id":"25C0F108-B435-11E9-9278-68D0E5697425","grant_number":"268548"}],"abstract":[{"text":"CA3–CA3 recurrent excitatory synapses are thought to play a key role in memory storage and pattern completion. Whether the plasticity properties of these synapses are consistent with their proposed network functions remains unclear. Here, we examine the properties of spike timing-dependent plasticity (STDP) at CA3–CA3 synapses. Low-frequency pairing of excitatory postsynaptic potentials (EPSPs) and action potentials (APs) induces long-term potentiation (LTP), independent of temporal order. The STDP curve is symmetric and broad (half-width ~150 ms). Consistent with these STDP induction properties, AP–EPSP sequences lead to supralinear summation of spine [Ca2+] transients. Furthermore, afterdepolarizations (ADPs) following APs efficiently propagate into dendrites of CA3 pyramidal neurons, and EPSPs summate with dendritic ADPs. In autoassociative network models, storage and recall are more robust with symmetric than with asymmetric STDP rules. Thus, a specialized STDP induction rule allows reliable storage and recall of information in the hippocampal CA3 network.","lang":"eng"}],"doi":"10.1038/ncomms11552","author":[{"last_name":"Mishra","full_name":"Mishra, Rajiv Kumar","first_name":"Rajiv Kumar","id":"46CB58F2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kim","full_name":"Kim, Sooyun","first_name":"Sooyun","id":"394AB1C8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-2209-5242","last_name":"Guzmán","full_name":"Guzmán, José","first_name":"José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"}],"title":"Symmetric spike timing-dependent plasticity at CA3–CA3 synapses optimizes storage and recall in autoassociative networks","_id":"1432","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"         7","publisher":"Nature Publishing Group","date_published":"2016-05-13T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:51:59Z","department":[{"_id":"PeJo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"5766","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1396"}]},"article_number":"11552","publication":"Nature Communications","date_updated":"2023-09-07T11:55:25Z","year":"2016","oa":1},{"publication":"Journal of Functional Analysis","date_updated":"2021-01-12T06:50:42Z","page":"672 - 719","oa":1,"year":"2016","intvolume":"       271","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1508.05905"}],"publisher":"Academic Press","quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"publist_id":"5764","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2016-08-01T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:52:00Z","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"status":"public","publication_status":"published","ec_funded":1,"author":[{"orcid":"0000-0003-3036-1475","last_name":"Bao","full_name":"Bao, Zhigang","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"last_name":"Schnelli","full_name":"Schnelli, Kevin","first_name":"Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231"}],"title":"Local stability of the free additive convolution","_id":"1434","issue":"3","abstract":[{"lang":"eng","text":"We prove that the system of subordination equations, defining the free additive convolution of two probability measures, is stable away from the edges of the support and blow-up singularities by showing that the recent smoothness condition of Kargin is always satisfied. As an application, we consider the local spectral statistics of the random matrix ensemble A+UBU⁎A+UBU⁎, where U is a Haar distributed random unitary or orthogonal matrix, and A and B   are deterministic matrices. In the bulk regime, we prove that the empirical spectral distribution of A+UBU⁎A+UBU⁎ concentrates around the free additive convolution of the spectral distributions of A and B   on scales down to N−2/3N−2/3."}],"doi":"10.1016/j.jfa.2016.04.006","volume":271,"day":"01","citation":{"mla":"Bao, Zhigang, et al. “Local Stability of the Free Additive Convolution.” <i>Journal of Functional Analysis</i>, vol. 271, no. 3, Academic Press, 2016, pp. 672–719, doi:<a href=\"https://doi.org/10.1016/j.jfa.2016.04.006\">10.1016/j.jfa.2016.04.006</a>.","chicago":"Bao, Zhigang, László Erdös, and Kevin Schnelli. “Local Stability of the Free Additive Convolution.” <i>Journal of Functional Analysis</i>. Academic Press, 2016. <a href=\"https://doi.org/10.1016/j.jfa.2016.04.006\">https://doi.org/10.1016/j.jfa.2016.04.006</a>.","ieee":"Z. Bao, L. Erdös, and K. Schnelli, “Local stability of the free additive convolution,” <i>Journal of Functional Analysis</i>, vol. 271, no. 3. Academic Press, pp. 672–719, 2016.","apa":"Bao, Z., Erdös, L., &#38; Schnelli, K. (2016). Local stability of the free additive convolution. <i>Journal of Functional Analysis</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jfa.2016.04.006\">https://doi.org/10.1016/j.jfa.2016.04.006</a>","short":"Z. Bao, L. Erdös, K. Schnelli, Journal of Functional Analysis 271 (2016) 672–719.","ista":"Bao Z, Erdös L, Schnelli K. 2016. Local stability of the free additive convolution. Journal of Functional Analysis. 271(3), 672–719.","ama":"Bao Z, Erdös L, Schnelli K. Local stability of the free additive convolution. <i>Journal of Functional Analysis</i>. 2016;271(3):672-719. doi:<a href=\"https://doi.org/10.1016/j.jfa.2016.04.006\">10.1016/j.jfa.2016.04.006</a>"},"month":"08","oa_version":"Preprint"},{"year":"2016","oa":1,"article_number":"1207393","publication":"Neural Plasticity","date_updated":"2021-01-12T06:50:43Z","date_published":"2016-01-01T00:00:00Z","date_created":"2018-12-11T11:52:00Z","scopus_import":1,"department":[{"_id":"PeJo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"5762","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"publisher":"Hindawi Publishing Corporation","intvolume":"      2016","abstract":[{"lang":"eng","text":"ATP released from neurons and astrocytes during neuronal activity or under pathophysiological circumstances is able to influence information flow in neuronal circuits by activation of ionotropic P2X and metabotropic P2Y receptors and subsequent modulation of cellular excitability, synaptic strength, and plasticity. In the present paper we review cellular and network effects of P2Y receptors in the brain. We show that P2Y receptors inhibit the release of neurotransmitters, modulate voltage- and ligand-gated ion channels, and differentially influence the induction of synaptic plasticity in the prefrontal cortex, hippocampus, and cerebellum. The findings discussed here may explain how P2Y1 receptor activation during brain injury, hypoxia, inflammation, schizophrenia, or Alzheimer's disease leads to an impairment of cognitive processes. Hence, it is suggested that the blockade of P2Y1 receptors may have therapeutic potential against cognitive disturbances in these states."}],"doi":"10.1155/2016/1207393","title":"P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction","author":[{"first_name":"José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","last_name":"Guzmán","full_name":"Guzmán, José"},{"first_name":"Zoltan","full_name":"Gerevich, Zoltan","last_name":"Gerevich"}],"_id":"1435","publication_status":"published","status":"public","oa_version":"Published Version","citation":{"ieee":"J. Guzmán and Z. Gerevich, “P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction,” <i>Neural Plasticity</i>, vol. 2016. Hindawi Publishing Corporation, 2016.","apa":"Guzmán, J., &#38; Gerevich, Z. (2016). P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. <i>Neural Plasticity</i>. Hindawi Publishing Corporation. <a href=\"https://doi.org/10.1155/2016/1207393\">https://doi.org/10.1155/2016/1207393</a>","ista":"Guzmán J, Gerevich Z. 2016. P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. Neural Plasticity. 2016, 1207393.","ama":"Guzmán J, Gerevich Z. P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction. <i>Neural Plasticity</i>. 2016;2016. doi:<a href=\"https://doi.org/10.1155/2016/1207393\">10.1155/2016/1207393</a>","short":"J. Guzmán, Z. Gerevich, Neural Plasticity 2016 (2016).","chicago":"Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” <i>Neural Plasticity</i>. Hindawi Publishing Corporation, 2016. <a href=\"https://doi.org/10.1155/2016/1207393\">https://doi.org/10.1155/2016/1207393</a>.","mla":"Guzmán, José, and Zoltan Gerevich. “P2Y Receptors in Synaptic Transmission and Plasticity: Therapeutic Potential in Cognitive Dysfunction.” <i>Neural Plasticity</i>, vol. 2016, 1207393, Hindawi Publishing Corporation, 2016, doi:<a href=\"https://doi.org/10.1155/2016/1207393\">10.1155/2016/1207393</a>."},"pubrep_id":"580","day":"01","file_date_updated":"2020-07-14T12:44:54Z","month":"01","ddc":["570"],"has_accepted_license":"1","volume":2016,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_created":"2018-12-12T10:09:17Z","file_id":"4740","content_type":"application/pdf","checksum":"8dc5c2f3d44d4775a6e7e3edb0d7a0da","access_level":"open_access","date_updated":"2020-07-14T12:44:54Z","file_size":1395180,"relation":"main_file","creator":"system","file_name":"IST-2016-580-v1+1_1207393.pdf"}]},{"page":"1 - 30","publication":"Journal de Mathématiques Pures et Appliquées","date_updated":"2021-01-12T06:50:43Z","year":"2016","oa":1,"type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       105","publisher":"Elsevier","date_published":"2016-01-01T00:00:00Z","scopus_import":1,"date_created":"2018-12-11T11:52:00Z","department":[{"_id":"RoSe"}],"publist_id":"5763","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","ec_funded":1,"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"issue":"1","abstract":[{"text":"We study the time evolution of a system of N spinless fermions in R3 which interact through a pair potential, e.g., the Coulomb potential. We compare the dynamics given by the solution to Schrödinger's equation with the time-dependent Hartree-Fock approximation, and we give an estimate for the accuracy of this approximation in terms of the kinetic energy of the system. This leads, in turn, to bounds in terms of the initial total energy of the system.","lang":"eng"}],"doi":"10.1016/j.matpur.2015.09.003","author":[{"last_name":"Bach","full_name":"Bach, Volker","first_name":"Volker"},{"first_name":"Sébastien","last_name":"Breteaux","full_name":"Breteaux, Sébastien"},{"orcid":"0000-0002-9166-5889","first_name":"Sören P","id":"40AC02DC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrat","full_name":"Petrat, Sören P"},{"last_name":"Pickl","full_name":"Pickl, Peter","first_name":"Peter"},{"full_name":"Tzaneteas, Tim","last_name":"Tzaneteas","first_name":"Tim"}],"title":"Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction","_id":"1436","has_accepted_license":"1","volume":105,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"file":[{"file_id":"4825","date_created":"2018-12-12T10:10:36Z","access_level":"open_access","content_type":"application/pdf","checksum":"c5afe1f6935bc7f2b546adbde1d31a35","date_updated":"2020-07-14T12:44:54Z","file_name":"IST-2016-581-v1+1_1-s2.0-S0021782415001191-main.pdf","creator":"system","relation":"main_file","file_size":658491}],"oa_version":"Published Version","day":"01","citation":{"chicago":"Bach, Volker, Sébastien Breteaux, Sören P Petrat, Peter Pickl, and Tim Tzaneteas. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent Hartree-Fock Approximation with Coulomb Interaction.” <i>Journal de Mathématiques Pures et Appliquées</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">https://doi.org/10.1016/j.matpur.2015.09.003</a>.","mla":"Bach, Volker, et al. “Kinetic Energy Estimates for the Accuracy of the Time-Dependent Hartree-Fock Approximation with Coulomb Interaction.” <i>Journal de Mathématiques Pures et Appliquées</i>, vol. 105, no. 1, Elsevier, 2016, pp. 1–30, doi:<a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">10.1016/j.matpur.2015.09.003</a>.","ieee":"V. Bach, S. Breteaux, S. P. Petrat, P. Pickl, and T. Tzaneteas, “Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction,” <i>Journal de Mathématiques Pures et Appliquées</i>, vol. 105, no. 1. Elsevier, pp. 1–30, 2016.","apa":"Bach, V., Breteaux, S., Petrat, S. P., Pickl, P., &#38; Tzaneteas, T. (2016). Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. <i>Journal de Mathématiques Pures et Appliquées</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">https://doi.org/10.1016/j.matpur.2015.09.003</a>","ista":"Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. 2016. Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. Journal de Mathématiques Pures et Appliquées. 105(1), 1–30.","ama":"Bach V, Breteaux S, Petrat SP, Pickl P, Tzaneteas T. Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction. <i>Journal de Mathématiques Pures et Appliquées</i>. 2016;105(1):1-30. doi:<a href=\"https://doi.org/10.1016/j.matpur.2015.09.003\">10.1016/j.matpur.2015.09.003</a>","short":"V. Bach, S. Breteaux, S.P. Petrat, P. Pickl, T. Tzaneteas, Journal de Mathématiques Pures et Appliquées 105 (2016) 1–30."},"pubrep_id":"581","file_date_updated":"2020-07-14T12:44:54Z","month":"01","ddc":["510","530"]},{"conference":{"location":"St. Petersburg, FL, USA","start_date":"2016-01-20","end_date":"2016-01-22","name":"POPL: Principles of Programming Languages"},"oa_version":"Preprint","month":"01","day":"11","citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837624\">https://doi.org/10.1145/2837614.2837624</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. Vol. 20–22, ACM, 2016, pp. 733–47, doi:<a href=\"https://doi.org/10.1145/2837614.2837624\">10.1145/2837614.2837624</a>.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2016). Algorithms for algebraic path properties in concurrent systems of constant treewidth components (Vol. 20–22, pp. 733–747). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837624\">https://doi.org/10.1145/2837614.2837624</a>","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. In: Vol 20-22. ACM; 2016:733-747. doi:<a href=\"https://doi.org/10.1145/2837614.2837624\">10.1145/2837614.2837624</a>","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2016. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL: Principles of Programming Languages, POPL, vol. 20–22, 733–747.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747."},"volume":"20-22","arxiv":1,"doi":"10.1145/2837614.2837624","abstract":[{"lang":"eng","text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks."}],"_id":"1437","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"last_name":"Goharshady","full_name":"Goharshady, Amir","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","ec_funded":1,"status":"public","publication_status":"published","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"scopus_import":1,"date_created":"2018-12-11T11:52:01Z","external_id":{"arxiv":["1510.07565"]},"date_published":"2016-01-11T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5761","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"type":"conference","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.07565"}],"publisher":"ACM","year":"2016","alternative_title":["POPL"],"oa":1,"page":"733 - 747","related_material":{"record":[{"id":"5441","status":"public","relation":"earlier_version"},{"id":"5442","relation":"earlier_version","status":"public"},{"id":"821","relation":"dissertation_contains","status":"public"},{"relation":"later_version","status":"public","id":"6009"},{"status":"public","relation":"dissertation_contains","id":"8934"}]},"date_updated":"2024-03-25T23:30:18Z"},{"alternative_title":["POPL"],"year":"2016","oa":1,"page":"327 - 342","related_material":{"record":[{"status":"public","relation":"later_version","id":"5993"}]},"date_updated":"2023-09-19T14:38:41Z","date_created":"2018-12-11T11:52:01Z","scopus_import":1,"external_id":{"arxiv":["1510.08517"]},"date_published":"2016-01-11T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5760","department":[{"_id":"KrCh"}],"quality_controlled":"1","language":[{"iso":"eng"}],"type":"conference","publisher":"ACM","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1510.08517"}],"doi":"10.1145/2837614.2837639","abstract":[{"lang":"eng","text":"In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: (a) qualitative ones that ask (i) whether the program terminates with probability 1 (almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); (b) quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps decreases exponentially (concentration problem). To solve these questions, we utilize the notion of ranking supermartingales which is a powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmic synthesis of linear ranking-supermartingales over affine probabilistic programs (APP's) with both angelic and demonic non-determinism. An important subclass of APP's is LRAPP which is defined as the class of all APP's over which a linear ranking-supermartingale exists. Our main contributions are as follows. Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism. Secondly, we show that the concentration problem over LRAPP can be solved in the same complexity as for the membership problem of LRAPP. Finally, we show that the expectation problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's without probability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate the effectiveness of our approach to answer the qualitative and quantitative questions over APP's with at most demonic non-determinism."}],"_id":"1438","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Hongfei","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","last_name":"Fu","full_name":"Fu, Hongfei"},{"full_name":"Novotny, Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr"},{"full_name":"Hasheminezhad, Rouzbeh","last_name":"Hasheminezhad","first_name":"Rouzbeh"}],"ec_funded":1,"status":"public","acknowledgement":"Supported by the Natural Science Foundation of China (NSFC) under Grant No. 61532019 ","publication_status":"published","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"oa_version":"Preprint","conference":{"name":"POPL: Principles of Programming Languages","end_date":"2016-01-22","location":"St. Petersburg, FL, USA","start_date":"2016-01-20"},"month":"01","citation":{"ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Vol 20-22. ACM; 2016:327-342. doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, in:, ACM, 2016, pp. 327–342.","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL: Principles of Programming Languages, POPL, vol. 20–22, 327–342.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 327–342.","apa":"Chatterjee, K., Fu, H., Novotný, P., &#38; Hasheminezhad, R. (2016). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Vol. 20–22, pp. 327–342). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>","mla":"Chatterjee, Krishnendu, et al. <i>Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs</i>. Vol. 20–22, ACM, 2016, pp. 327–42, doi:<a href=\"https://doi.org/10.1145/2837614.2837639\">10.1145/2837614.2837639</a>.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs,” 20–22:327–42. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837639\">https://doi.org/10.1145/2837614.2837639</a>."},"day":"11","volume":"20-22","arxiv":1},{"date_published":"2016-01-11T00:00:00Z","date_created":"2018-12-11T11:52:01Z","scopus_import":1,"department":[{"_id":"ToHe"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"5759","language":[{"iso":"eng"}],"quality_controlled":"1","type":"conference","publisher":"ACM","main_file_link":[{"url":"https://hal.inria.fr/hal-01251199/","open_access":"1"}],"alternative_title":["ACM SIGPLAN Notices"],"year":"2016","oa":1,"page":"400 - 415","date_updated":"2021-01-12T06:50:45Z","oa_version":"Preprint","conference":{"name":"POPL: Principles of Programming Languages","end_date":"2016-01-22","location":"St. Petersburg, FL, USA","start_date":"2016-01-20"},"citation":{"mla":"Dragoi, Cezara, et al. <i>PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms</i>. Vol. 20–22, ACM, 2016, pp. 400–15, doi:<a href=\"https://doi.org/10.1145/2837614.2837650\">10.1145/2837614.2837650</a>.","chicago":"Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “PSYNC: A Partially Synchronous Language for Fault-Tolerant Distributed Algorithms,” 20–22:400–415. ACM, 2016. <a href=\"https://doi.org/10.1145/2837614.2837650\">https://doi.org/10.1145/2837614.2837650</a>.","ieee":"C. Dragoi, T. A. Henzinger, and D. Zufferey, “PSYNC: A partially synchronous language for fault-tolerant distributed algorithms,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 400–415.","apa":"Dragoi, C., Henzinger, T. A., &#38; Zufferey, D. (2016). PSYNC: A partially synchronous language for fault-tolerant distributed algorithms (Vol. 20–22, pp. 400–415). Presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA: ACM. <a href=\"https://doi.org/10.1145/2837614.2837650\">https://doi.org/10.1145/2837614.2837650</a>","ista":"Dragoi C, Henzinger TA, Zufferey D. 2016. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms. POPL: Principles of Programming Languages, ACM SIGPLAN Notices, vol. 20–22, 400–415.","short":"C. Dragoi, T.A. Henzinger, D. Zufferey, in:, ACM, 2016, pp. 400–415.","ama":"Dragoi C, Henzinger TA, Zufferey D. PSYNC: A partially synchronous language for fault-tolerant distributed algorithms. In: Vol 20-22. ACM; 2016:400-415. doi:<a href=\"https://doi.org/10.1145/2837614.2837650\">10.1145/2837614.2837650</a>"},"day":"11","month":"01","volume":"20-22","abstract":[{"lang":"eng","text":"Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. We introduce PSYNC, a domain specific language based on the Heard-Of model, which views asynchronous faulty systems as synchronous ones with an adversarial environment that simulates asynchrony and faults by dropping messages. We define a runtime system for PSYNC that efficiently executes on asynchronous networks. We formalize the relation between the runtime system and PSYNC in terms of observational refinement. The high-level lockstep abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification. We have implemented an embedding of PSYNC in the SCALA programming language with a runtime system for asynchronous networks. We show the applicability of PSYNC by implementing several important fault-tolerant distributed algorithms and we compare the implementation of consensus algorithms in PSYNC against implementations in other languages in terms of code size, runtime efficiency, and verification."}],"doi":"10.1145/2837614.2837650","title":"PSYNC: A partially synchronous language for fault-tolerant distributed algorithms","author":[{"full_name":"Dragoi, Cezara","last_name":"Dragoi","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0002-3197-8736","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","full_name":"Zufferey, Damien"}],"_id":"1439","status":"public","publication_status":"published","acknowledgement":"Damien Zufferey was supported by DARPA (Grants FA8650-11-C-7192 and FA8650-15-C-7564) and NSF (Grant CCF-1138967). ","ec_funded":1,"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}]},{"project":[{"_id":"255BFFFA-B435-11E9-9278-68D0E5697425","grant_number":"RGY0084/2012","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)"},{"grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","name":"Microbial Ion Channels for Synthetic Neurobiology","call_identifier":"FP7"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","call_identifier":"FWF","name":"Molecular Drug Targets"}],"date_updated":"2021-01-12T06:50:46Z","publication":"Structure","page":"213 - 215","ec_funded":1,"publication_status":"published","status":"public","acknowledgement":"The author thanks Banerjee et al. (2016) for providing coordinates prior to public release and apologizes to colleagues whose work was not cited or discussed due to the limited space available. The author is supported by grants from EU FP7 (CIG-303564), HFSP (RGY0084_2012), and FWF (W1232).","_id":"1440","title":"Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain","author":[{"full_name":"Janovjak, Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L","orcid":"0000-0002-8023-9315"}],"doi":"10.1016/j.str.2016.01.002","issue":"2","year":"2016","publisher":"Cell Press","intvolume":"        24","volume":24,"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","month":"02","publist_id":"5756","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of a C-Terminal Light-Sensing Domain.” <i>Structure</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.str.2016.01.002\">https://doi.org/10.1016/j.str.2016.01.002</a>.","mla":"Janovjak, Harald L. “Light at the End of the Protein: Crystal Structure of a C-Terminal Light-Sensing Domain.” <i>Structure</i>, vol. 24, no. 2, Cell Press, 2016, pp. 213–15, doi:<a href=\"https://doi.org/10.1016/j.str.2016.01.002\">10.1016/j.str.2016.01.002</a>.","ista":"Janovjak HL. 2016. Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. Structure. 24(2), 213–215.","ama":"Janovjak HL. Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. <i>Structure</i>. 2016;24(2):213-215. doi:<a href=\"https://doi.org/10.1016/j.str.2016.01.002\">10.1016/j.str.2016.01.002</a>","short":"H.L. Janovjak, Structure 24 (2016) 213–215.","ieee":"H. L. Janovjak, “Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain,” <i>Structure</i>, vol. 24, no. 2. Cell Press, pp. 213–215, 2016.","apa":"Janovjak, H. L. (2016). Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain. <i>Structure</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.str.2016.01.002\">https://doi.org/10.1016/j.str.2016.01.002</a>"},"department":[{"_id":"HaJa"}],"day":"02","date_created":"2018-12-11T11:52:02Z","oa_version":"None","scopus_import":1,"date_published":"2016-02-02T00:00:00Z"},{"file":[{"date_created":"2018-12-12T10:17:03Z","file_id":"5255","relation":"main_file","file_size":1268662,"creator":"system","file_name":"IST-2017-840-v1+1_reichhart.pdf","date_updated":"2020-07-14T12:44:55Z","content_type":"application/pdf","checksum":"26da07960e57ac4750b54179197ce57f","access_level":"open_access"}],"volume":55,"has_accepted_license":"1","file_date_updated":"2020-07-14T12:44:55Z","month":"05","ddc":["571","576"],"day":"17","citation":{"mla":"Gschaider-Reichhart, Eva, et al. “A Phytochrome Sensory Domain Permits Receptor Activation by Red Light.” <i>Angewandte Chemie - International Edition</i>, vol. 55, no. 21, Wiley, 2016, pp. 6339–42, doi:<a href=\"https://doi.org/10.1002/anie.201601736\">10.1002/anie.201601736</a>.","chicago":"Gschaider-Reichhart, Eva, Álvaro Inglés Prieto, Alexandra-Madelaine Tichy, Catherine Mckenzie, and Harald L Janovjak. “A Phytochrome Sensory Domain Permits Receptor Activation by Red Light.” <i>Angewandte Chemie - International Edition</i>. Wiley, 2016. <a href=\"https://doi.org/10.1002/anie.201601736\">https://doi.org/10.1002/anie.201601736</a>.","short":"E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, H.L. Janovjak, Angewandte Chemie - International Edition 55 (2016) 6339–6342.","ista":"Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL. 2016. A phytochrome sensory domain permits receptor activation by red light. Angewandte Chemie - International Edition. 55(21), 6339–6342.","ama":"Gschaider-Reichhart E, Inglés Prieto Á, Tichy A-M, Mckenzie C, Janovjak HL. A phytochrome sensory domain permits receptor activation by red light. <i>Angewandte Chemie - International Edition</i>. 2016;55(21):6339-6342. doi:<a href=\"https://doi.org/10.1002/anie.201601736\">10.1002/anie.201601736</a>","apa":"Gschaider-Reichhart, E., Inglés Prieto, Á., Tichy, A.-M., Mckenzie, C., &#38; Janovjak, H. L. (2016). A phytochrome sensory domain permits receptor activation by red light. <i>Angewandte Chemie - International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.201601736\">https://doi.org/10.1002/anie.201601736</a>","ieee":"E. Gschaider-Reichhart, Á. Inglés Prieto, A.-M. Tichy, C. Mckenzie, and H. L. Janovjak, “A phytochrome sensory domain permits receptor activation by red light,” <i>Angewandte Chemie - International Edition</i>, vol. 55, no. 21. Wiley, pp. 6339–6342, 2016."},"pubrep_id":"840","oa_version":"Submitted Version","project":[{"call_identifier":"FP7","name":"Microbial Ion Channels for Synthetic Neurobiology","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564"},{"_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","name":"Molecular Drug Targets","call_identifier":"FWF"}],"ec_funded":1,"acknowledgement":"A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W1232) and a FemTech fellowship (Austrian Research Promotion Agency: 3580812).","publication_status":"published","status":"public","_id":"1441","author":[{"first_name":"Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","last_name":"Gschaider-Reichhart","full_name":"Gschaider-Reichhart, Eva","orcid":"0000-0002-7218-7738"},{"orcid":"0000-0002-5409-8571","full_name":"Inglés Prieto, Álvaro","last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","first_name":"Álvaro"},{"full_name":"Tichy, Alexandra-Madelaine","last_name":"Tichy","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87","first_name":"Alexandra-Madelaine"},{"first_name":"Catherine","id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","last_name":"Mckenzie","full_name":"Mckenzie, Catherine"},{"orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L","full_name":"Janovjak, Harald L","last_name":"Janovjak"}],"title":"A phytochrome sensory domain permits receptor activation by red light","doi":"10.1002/anie.201601736","issue":"21","abstract":[{"text":"Optogenetics and photopharmacology enable the spatio-temporal control of cell and animal behavior by light. Although red light offers deep-tissue penetration and minimal phototoxicity, very few red-light-sensitive optogenetic methods are currently available. We have now developed a red-light-induced homodimerization domain. We first showed that an optimized sensory domain of the cyanobacterial phytochrome 1 can be expressed robustly and without cytotoxicity in human cells. We then applied this domain to induce the dimerization of two receptor tyrosine kinases—the fibroblast growth factor receptor 1 and the neurotrophin receptor trkB. This new optogenetic method was then used to activate the MAPK/ERK pathway non-invasively in mammalian tissue and in multicolor cell-signaling experiments. The light-controlled dimerizer and red-light-activated receptor tyrosine kinases will prove useful to regulate a variety of cellular processes with light. Go deep with red: The sensory domain (S) of the cyanobacterial phytochrome 1 (CPH1) was repurposed to induce the homodimerization of proteins in living cells by red light. By using this domain, light-activated protein kinases were engineered that can be activated orthogonally from many fluorescent proteins and through mammalian tissue. Pr/Pfr=red-/far-red-absorbing state of CPH1.","lang":"eng"}],"intvolume":"        55","publisher":"Wiley","language":[{"iso":"eng"}],"type":"journal_article","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5755","department":[{"_id":"HaJa"}],"scopus_import":1,"date_created":"2018-12-11T11:52:02Z","date_published":"2016-05-17T00:00:00Z","date_updated":"2023-09-07T12:49:08Z","publication":"Angewandte Chemie - International Edition","page":"6339 - 6342","related_material":{"record":[{"id":"418","relation":"dissertation_contains","status":"public"}]},"oa":1,"year":"2016"},{"publication_status":"published","status":"public","_id":"1446","author":[{"last_name":"Calatrava Moreno","full_name":"Calatrava Moreno, Maria","first_name":"Maria"},{"id":"4718F954-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Auzinger, Thomas","last_name":"Auzinger","orcid":"0000-0002-1546-3265"},{"first_name":"Hannes","last_name":"Werthner","full_name":"Werthner, Hannes"}],"title":"On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data","doi":"10.1007/s11192-016-1842-4","issue":"1","abstract":[{"lang":"eng","text":"The accuracy of interdisciplinarity measurements is directly related to the quality of the underlying bibliographic data. Existing indicators of interdisciplinarity are not capable of reflecting the inaccuracies introduced by incorrect and incomplete records because correct and complete bibliographic data can rarely be obtained. This is the case for the Rao–Stirling index, which cannot handle references that are not categorized into disciplinary fields. We introduce a method that addresses this problem. It extends the Rao–Stirling index to acknowledge missing data by calculating its interval of uncertainty using computational optimization. The evaluation of our method indicates that the uncertainty interval is not only useful for estimating the inaccuracy of interdisciplinarity measurements, but it also delivers slightly more accurate aggregated interdisciplinarity measurements than the Rao–Stirling index."}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2020-07-14T12:44:55Z","content_type":"application/pdf","checksum":"32d46268588b87d9b686492018e6a2b2","access_level":"open_access","creator":"system","file_size":806035,"relation":"main_file","file_name":"IST-2016-530-v1+1_s11192-016-1842-4.pdf","date_created":"2018-12-12T10:10:56Z","file_id":"4848"}],"article_processing_charge":"No","volume":107,"has_accepted_license":"1","ddc":["000"],"month":"04","file_date_updated":"2020-07-14T12:44:55Z","day":"01","citation":{"apa":"Calatrava Moreno, M., Auzinger, T., &#38; Werthner, H. (2016). On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. <i>Scientometrics</i>. Springer. <a href=\"https://doi.org/10.1007/s11192-016-1842-4\">https://doi.org/10.1007/s11192-016-1842-4</a>","ieee":"M. Calatrava Moreno, T. Auzinger, and H. Werthner, “On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data,” <i>Scientometrics</i>, vol. 107, no. 1. Springer, pp. 213–232, 2016.","ama":"Calatrava Moreno M, Auzinger T, Werthner H. On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. <i>Scientometrics</i>. 2016;107(1):213-232. doi:<a href=\"https://doi.org/10.1007/s11192-016-1842-4\">10.1007/s11192-016-1842-4</a>","ista":"Calatrava Moreno M, Auzinger T, Werthner H. 2016. On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data. Scientometrics. 107(1), 213–232.","short":"M. Calatrava Moreno, T. Auzinger, H. Werthner, Scientometrics 107 (2016) 213–232.","chicago":"Calatrava Moreno, Maria, Thomas Auzinger, and Hannes Werthner. “On the Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic Data.” <i>Scientometrics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s11192-016-1842-4\">https://doi.org/10.1007/s11192-016-1842-4</a>.","mla":"Calatrava Moreno, Maria, et al. “On the Uncertainty of Interdisciplinarity Measurements Due to Incomplete Bibliographic Data.” <i>Scientometrics</i>, vol. 107, no. 1, Springer, 2016, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/s11192-016-1842-4\">10.1007/s11192-016-1842-4</a>."},"pubrep_id":"530","oa_version":"Published Version","date_updated":"2021-11-16T08:29:11Z","publication":"Scientometrics","page":"213 - 232","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s11192-016-1902-9"}]},"oa":1,"year":"2016","intvolume":"       107","publisher":"Springer","type":"journal_article","quality_controlled":"1","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publist_id":"5750","department":[{"_id":"BeBi"}],"scopus_import":"1","date_created":"2018-12-11T11:52:04Z","date_published":"2016-04-01T00:00:00Z"},{"citation":{"apa":"Fathi, M., &#38; Maas, J. (2016). Entropic Ricci curvature bounds for discrete interacting systems. <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/15-AAP1133\">https://doi.org/10.1214/15-AAP1133</a>","ieee":"M. Fathi and J. Maas, “Entropic Ricci curvature bounds for discrete interacting systems,” <i>The Annals of Applied Probability</i>, vol. 26, no. 3. Institute of Mathematical Statistics, pp. 1774–1806, 2016.","ama":"Fathi M, Maas J. Entropic Ricci curvature bounds for discrete interacting systems. <i>The Annals of Applied Probability</i>. 2016;26(3):1774-1806. doi:<a href=\"https://doi.org/10.1214/15-AAP1133\">10.1214/15-AAP1133</a>","short":"M. Fathi, J. Maas, The Annals of Applied Probability 26 (2016) 1774–1806.","ista":"Fathi M, Maas J. 2016. Entropic Ricci curvature bounds for discrete interacting systems. The Annals of Applied Probability. 26(3), 1774–1806.","mla":"Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting Systems.” <i>The Annals of Applied Probability</i>, vol. 26, no. 3, Institute of Mathematical Statistics, 2016, pp. 1774–806, doi:<a href=\"https://doi.org/10.1214/15-AAP1133\">10.1214/15-AAP1133</a>.","chicago":"Fathi, Max, and Jan Maas. “Entropic Ricci Curvature Bounds for Discrete Interacting Systems.” <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2016. <a href=\"https://doi.org/10.1214/15-AAP1133\">https://doi.org/10.1214/15-AAP1133</a>."},"day":"01","month":"06","oa_version":"Preprint","volume":26,"title":"Entropic Ricci curvature bounds for discrete interacting systems","author":[{"first_name":"Max","last_name":"Fathi","full_name":"Fathi, Max"},{"orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Maas, Jan","last_name":"Maas"}],"_id":"1448","abstract":[{"text":"We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and death chains, product chains, Bernoulli–Laplace models, and random transposition models). However, a general method to obtain discrete Ricci bounds had been lacking. Our method covers all of the examples above. In addition we obtain new Ricci curvature bounds for zero-range processes on the complete graph. The method is inspired by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities.","lang":"eng"}],"issue":"3","doi":"10.1214/15-AAP1133","publication_status":"published","acknowledgement":"Supported by the German Research Foundation through the Collaborative Research Center 1060\r\nThe Mathematics of Emergent Effects and the Hausdorff Center for Mathematics. Part of this work has been done while M. Fathi visited J. Maas at the University of Bonn in July 2014.We would like to thank the referees for their careful reading of the manuscript. ","status":"public","department":[{"_id":"JaMa"}],"publist_id":"5748","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2016-06-01T00:00:00Z","date_created":"2018-12-11T11:52:05Z","scopus_import":1,"publisher":"Institute of Mathematical Statistics","intvolume":"        26","main_file_link":[{"url":"http://arxiv.org/abs/1501.00562","open_access":"1"}],"quality_controlled":"1","type":"journal_article","language":[{"iso":"eng"}],"oa":1,"year":"2016","publication":"The Annals of Applied Probability","date_updated":"2021-01-12T06:50:49Z","page":"1774 - 1806"},{"oa":1,"year":"2016","publication":"eLife","date_updated":"2021-01-12T06:50:59Z","article_number":"e10276","department":[{"_id":"DaSi"}],"publist_id":"5721","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2016-02-25T00:00:00Z","date_created":"2018-12-11T11:52:14Z","scopus_import":1,"publisher":"eLife Sciences Publications","intvolume":"         5","language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","title":"Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton","author":[{"first_name":"Junko","full_name":"Toshima, Junko","last_name":"Toshima"},{"first_name":"Eri","last_name":"Furuya","full_name":"Furuya, Eri"},{"first_name":"Makoto","last_name":"Nagano","full_name":"Nagano, Makoto"},{"first_name":"Chisa","full_name":"Kanno, Chisa","last_name":"Kanno"},{"first_name":"Yuta","last_name":"Sakamoto","full_name":"Sakamoto, Yuta"},{"last_name":"Ebihara","full_name":"Ebihara, Masashi","first_name":"Masashi"},{"full_name":"Siekhaus, Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E","orcid":"0000-0001-8323-8353"},{"last_name":"Toshima","full_name":"Toshima, Jiro","first_name":"Jiro"}],"_id":"1475","abstract":[{"text":"The actin cytoskeleton plays important roles in the formation and internalization of endocytic vesicles. In yeast, endocytic vesicles move towards early endosomes along actin cables, however, the molecular machinery regulating interaction between endocytic vesicles and actin cables is poorly understood. The Eps15-like protein Pan1p plays a key role in actin-mediated endocytosis and is negatively regulated by Ark1 and Prk1 kinases. Here we show that pan1 mutated to prevent phosphorylation at all 18 threonines, pan1-18TA, displayed almost the same endocytic defect as ark1Δ prk1Δ cells, and contained abnormal actin concentrations including several endocytic compartments. Early endosomes were highly localized in the actin concentrations and displayed movement along actin cables. The dephosphorylated form of Pan1p also caused stable associations between endocytic vesicles and actin cables, and between endocytic vesicles and endosomes. Thus Pan1 phosphorylation is part of a novel mechanism that regulates endocytic compartment interactions with each other and with actin cables.","lang":"eng"}],"issue":"February 2016","doi":"10.7554/eLife.10276","project":[{"call_identifier":"FP7","name":"Investigating the role of transporters in invasive migration through junctions","_id":"2536F660-B435-11E9-9278-68D0E5697425","grant_number":"334077"}],"publication_status":"published","status":"public","ec_funded":1,"citation":{"ista":"Toshima J, Furuya E, Nagano M, Kanno C, Sakamoto Y, Ebihara M, Siekhaus DE, Toshima J. 2016. Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. eLife. 5(February 2016), e10276.","ama":"Toshima J, Furuya E, Nagano M, et al. Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. <i>eLife</i>. 2016;5(February 2016). doi:<a href=\"https://doi.org/10.7554/eLife.10276\">10.7554/eLife.10276</a>","short":"J. Toshima, E. Furuya, M. Nagano, C. Kanno, Y. Sakamoto, M. Ebihara, D.E. Siekhaus, J. Toshima, ELife 5 (2016).","apa":"Toshima, J., Furuya, E., Nagano, M., Kanno, C., Sakamoto, Y., Ebihara, M., … Toshima, J. (2016). Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.10276\">https://doi.org/10.7554/eLife.10276</a>","ieee":"J. Toshima <i>et al.</i>, “Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton,” <i>eLife</i>, vol. 5, no. February 2016. eLife Sciences Publications, 2016.","chicago":"Toshima, Junko, Eri Furuya, Makoto Nagano, Chisa Kanno, Yuta Sakamoto, Masashi Ebihara, Daria E Siekhaus, and Jiro Toshima. “Yeast Eps15-like Endocytic Protein Pan1p Regulates the Interaction between Endocytic Vesicles, Endosomes and the Actin Cytoskeleton.” <i>ELife</i>. eLife Sciences Publications, 2016. <a href=\"https://doi.org/10.7554/eLife.10276\">https://doi.org/10.7554/eLife.10276</a>.","mla":"Toshima, Junko, et al. “Yeast Eps15-like Endocytic Protein Pan1p Regulates the Interaction between Endocytic Vesicles, Endosomes and the Actin Cytoskeleton.” <i>ELife</i>, vol. 5, no. February 2016, e10276, eLife Sciences Publications, 2016, doi:<a href=\"https://doi.org/10.7554/eLife.10276\">10.7554/eLife.10276</a>."},"pubrep_id":"529","day":"25","month":"02","file_date_updated":"2020-07-14T12:44:56Z","ddc":["570"],"oa_version":"Published Version","file":[{"file_id":"4793","date_created":"2018-12-12T10:10:08Z","file_name":"IST-2016-529-v1+1_elife-10276-v1.pdf","relation":"main_file","file_size":5198001,"creator":"system","access_level":"open_access","checksum":"d1cc44870580756ba8badd8e41adfdb5","content_type":"application/pdf","date_updated":"2020-07-14T12:44:56Z"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","volume":5}]