[{"author":[{"first_name":"Bettina","last_name":"Schwamb","full_name":"Schwamb, Bettina"},{"first_name":"Robert","last_name":"Pick","full_name":"Pick, Robert"},{"last_name":"Fernández","first_name":"Sara","full_name":"Fernández, Sara"},{"full_name":"Völp, Kirsten","last_name":"Völp","first_name":"Kirsten"},{"full_name":"Heering, Jan","last_name":"Heering","first_name":"Jan"},{"full_name":"Dötsch, Volker","first_name":"Volker","last_name":"Dötsch"},{"full_name":"Bösser, Susanne","first_name":"Susanne","last_name":"Bösser"},{"first_name":"Jennifer","last_name":"Jung","full_name":"Jung, Jennifer"},{"full_name":"Beinoravičiute Kellner, Rasa","first_name":"Rasa","last_name":"Beinoravičiute Kellner"},{"full_name":"Wesely, Josephine","first_name":"Josephine","last_name":"Wesely"},{"last_name":"Zörnig","first_name":"Inka","full_name":"Zörnig, Inka"},{"full_name":"Hammerschmidt, Matthias","last_name":"Hammerschmidt","first_name":"Matthias"},{"first_name":"Matthias","last_name":"Nowak","id":"30845DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Nowak, Matthias"},{"first_name":"Roland","last_name":"Penzel","full_name":"Penzel, Roland"},{"full_name":"Zatloukal, Kurt","last_name":"Zatloukal","first_name":"Kurt"},{"first_name":"Stefan","last_name":"Joos","full_name":"Joos, Stefan"},{"last_name":"Rieker","first_name":"Ralf","full_name":"Rieker, Ralf"},{"full_name":"Agaimy, Abbas","first_name":"Abbas","last_name":"Agaimy"},{"first_name":"Stephan","last_name":"Söder","full_name":"Söder, Stephan"},{"last_name":"Reid Lombardo","first_name":"Kmarie","full_name":"Reid Lombardo, Kmarie"},{"full_name":"Kendrick, Michael","last_name":"Kendrick","first_name":"Michael"},{"first_name":"Michael","last_name":"Bardsley","full_name":"Bardsley, Michael"},{"first_name":"Yujiro","last_name":"Hayashi","full_name":"Hayashi, Yujiro"},{"full_name":"Asuzu, David","first_name":"David","last_name":"Asuzu"},{"full_name":"Syed, Sabriya","first_name":"Sabriya","last_name":"Syed"},{"last_name":"Ördög","first_name":"Tamás","full_name":"Ördög, Tamás"},{"full_name":"Zörnig, Martin","first_name":"Martin","last_name":"Zörnig"}],"date_created":"2018-12-11T11:54:20Z","date_updated":"2021-01-12T06:53:36Z","volume":137,"year":"2015","pmid":1,"publication_status":"published","department":[{"_id":"LifeSc"}],"publisher":"Wiley","publist_id":"5253","doi":"10.1002/ijc.29498","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["25716227"]},"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4497860/","open_access":"1"}],"quality_controlled":"1","month":"09","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1848","title":"FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors","status":"public","intvolume":" 137","abstract":[{"lang":"eng","text":"The ability to escape apoptosis is a hallmark of cancer-initiating cells and a key factor of resistance to oncolytic therapy. Here, we identify FAM96A as a ubiquitous, evolutionarily conserved apoptosome-activating protein and investigate its potential pro-apoptotic tumor suppressor function in gastrointestinal stromal tumors (GISTs). Interaction between FAM96A and apoptotic peptidase activating factor 1 (APAF1) was identified in yeast two-hybrid screen and further studied by deletion mutants, glutathione-S-transferase pull-down, co-immunoprecipitation and immunofluorescence. Effects of FAM96A overexpression and knock-down on apoptosis sensitivity were examined in cancer cells and zebrafish embryos. Expression of FAM96A in GISTs and histogenetically related cells including interstitial cells of Cajal (ICCs), “fibroblast-like cells” (FLCs) and ICC stem cells (ICC-SCs) was investigated by Northern blotting, reverse transcription—polymerase chain reaction, immunohistochemistry and Western immunoblotting. Tumorigenicity of GIST cells and transformed murine ICC-SCs stably transduced to re-express FAM96A was studied by xeno- and allografting into immunocompromised mice. FAM96A was found to bind APAF1 and to enhance the induction of mitochondrial apoptosis. FAM96A protein or mRNA was dramatically reduced or lost in 106 of 108 GIST samples representing three independent patient cohorts. Whereas ICCs, ICC-SCs and FLCs, the presumed normal counterparts of GIST, were found to robustly express FAM96A protein and mRNA, FAM96A expression was much reduced in tumorigenic ICC-SCs. Re-expression of FAM96A in GIST cells and transformed ICC-SCs increased apoptosis sensitivity and diminished tumorigenicity. Our data suggest FAM96A is a novel pro-apoptotic tumor suppressor that is lost during GIST tumorigenesis."}],"issue":"6","type":"journal_article","date_published":"2015-09-01T00:00:00Z","publication":"International Journal of Cancer","citation":{"ieee":"B. Schwamb et al., “FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors,” International Journal of Cancer, vol. 137, no. 6. Wiley, pp. 1318–1329, 2015.","apa":"Schwamb, B., Pick, R., Fernández, S., Völp, K., Heering, J., Dötsch, V., … Zörnig, M. (2015). FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International Journal of Cancer. Wiley. https://doi.org/10.1002/ijc.29498","ista":"Schwamb B, Pick R, Fernández S, Völp K, Heering J, Dötsch V, Bösser S, Jung J, Beinoravičiute Kellner R, Wesely J, Zörnig I, Hammerschmidt M, Nowak M, Penzel R, Zatloukal K, Joos S, Rieker R, Agaimy A, Söder S, Reid Lombardo K, Kendrick M, Bardsley M, Hayashi Y, Asuzu D, Syed S, Ördög T, Zörnig M. 2015. FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International Journal of Cancer. 137(6), 1318–1329.","ama":"Schwamb B, Pick R, Fernández S, et al. FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International Journal of Cancer. 2015;137(6):1318-1329. doi:10.1002/ijc.29498","chicago":"Schwamb, Bettina, Robert Pick, Sara Fernández, Kirsten Völp, Jan Heering, Volker Dötsch, Susanne Bösser, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor in Gastrointestinal Stromal Tumors.” International Journal of Cancer. Wiley, 2015. https://doi.org/10.1002/ijc.29498.","short":"B. Schwamb, R. Pick, S. Fernández, K. Völp, J. Heering, V. Dötsch, S. Bösser, J. Jung, R. Beinoravičiute Kellner, J. Wesely, I. Zörnig, M. Hammerschmidt, M. Nowak, R. Penzel, K. Zatloukal, S. Joos, R. Rieker, A. Agaimy, S. Söder, K. Reid Lombardo, M. Kendrick, M. Bardsley, Y. Hayashi, D. Asuzu, S. Syed, T. Ördög, M. Zörnig, International Journal of Cancer 137 (2015) 1318–1329.","mla":"Schwamb, Bettina, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor in Gastrointestinal Stromal Tumors.” International Journal of Cancer, vol. 137, no. 6, Wiley, 2015, pp. 1318–29, doi:10.1002/ijc.29498."},"article_type":"original","page":"1318 - 1329","day":"01","article_processing_charge":"No","scopus_import":1},{"oa":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"doi":"10.1007/s00236-015-0215-4","language":[{"iso":"eng"}],"month":"04","year":"2015","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer","author":[{"full_name":"Beneš, Nikola","last_name":"Beneš","first_name":"Nikola"},{"full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan"},{"full_name":"Larsen, Kim","first_name":"Kim","last_name":"Larsen"},{"full_name":"Möller, Mikael","last_name":"Möller","first_name":"Mikael"},{"full_name":"Sickert, Salomon","first_name":"Salomon","last_name":"Sickert"},{"first_name":"Jiří","last_name":"Srba","full_name":"Srba, Jiří"}],"date_created":"2018-12-11T11:54:20Z","date_updated":"2021-01-12T06:53:35Z","volume":52,"file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5255","ec_funded":1,"publication":"Acta Informatica","citation":{"ama":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking on parametric modal transition systems. Acta Informatica. 2015;52(2-3):269-297. doi:10.1007/s00236-015-0215-4","ista":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.","apa":"Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., & Srba, J. (2015). Refinement checking on parametric modal transition systems. Acta Informatica. Springer. https://doi.org/10.1007/s00236-015-0215-4","ieee":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” Acta Informatica, vol. 52, no. 2–3. Springer, pp. 269–297, 2015.","mla":"Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.” Acta Informatica, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:10.1007/s00236-015-0215-4.","short":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297.","chicago":"Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” Acta Informatica. Springer, 2015. https://doi.org/10.1007/s00236-015-0215-4."},"article_type":"original","page":"269 - 297","date_published":"2015-04-01T00:00:00Z","scopus_import":1,"day":"01","article_processing_charge":"No","has_accepted_license":"1","_id":"1846","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"Refinement checking on parametric modal transition systems","status":"public","intvolume":" 52","file":[{"access_level":"open_access","file_name":"2015_ActaInfo_Benes.pdf","file_size":488482,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7854","checksum":"fb4037ddc4fc05f33080dd3547ede350","date_created":"2020-05-15T08:57:44Z","date_updated":"2020-07-14T12:45:19Z"}],"oa_version":"Submitted Version","type":"journal_article","abstract":[{"text":"Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcomes many of the limitations. We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae, allowing us to employ state-of-the-art QBF solvers for modal refinement checking. The experiments we report on show that the feasibility of refinement checking is more influenced by the degree of nondeterminism rather than by the syntactic restrictions on the types of formulae allowed in the description of the PMTS.","lang":"eng"}],"issue":"2-3"},{"day":"18","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2015-03-18T00:00:00Z","publication":"Neuron","citation":{"apa":"Vandael, D. H., Espinoza Martinez, C., & Jonas, P. M. (2015). Excitement about inhibitory presynaptic terminals. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2015.03.006","ieee":"D. H. Vandael, C. Espinoza Martinez, and P. M. Jonas, “Excitement about inhibitory presynaptic terminals,” Neuron, vol. 85, no. 6. Elsevier, pp. 1149–1151, 2015.","ista":"Vandael DH, Espinoza Martinez C, Jonas PM. 2015. Excitement about inhibitory presynaptic terminals. Neuron. 85(6), 1149–1151.","ama":"Vandael DH, Espinoza Martinez C, Jonas PM. Excitement about inhibitory presynaptic terminals. Neuron. 2015;85(6):1149-1151. doi:10.1016/j.neuron.2015.03.006","chicago":"Vandael, David H, Claudia Espinoza Martinez, and Peter M Jonas. “Excitement about Inhibitory Presynaptic Terminals.” Neuron. Elsevier, 2015. https://doi.org/10.1016/j.neuron.2015.03.006.","short":"D.H. Vandael, C. Espinoza Martinez, P.M. Jonas, Neuron 85 (2015) 1149–1151.","mla":"Vandael, David H., et al. “Excitement about Inhibitory Presynaptic Terminals.” Neuron, vol. 85, no. 6, Elsevier, 2015, pp. 1149–51, doi:10.1016/j.neuron.2015.03.006."},"page":"1149 - 1151","abstract":[{"lang":"eng","text":"Based on extrapolation from excitatory synapses, it is often assumed that depletion of the releasable pool of synaptic vesicles is the main factor underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba (2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes in presynaptic action potential waveform substantially contribute to synaptic depression. Based on extrapolation from excitatory synapses, it is often assumed that depletion of the releasable pool of synaptic vesicles is the main factor underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba (2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes in presynaptic action potential waveform substantially contribute to synaptic depression."}],"issue":"6","type":"journal_article","pubrep_id":"822","file":[{"date_created":"2018-12-12T10:16:07Z","date_updated":"2020-07-14T12:45:19Z","checksum":"d1808550e376a0eca2a950fda017cfa6","relation":"main_file","file_id":"5192","content_type":"application/pdf","file_size":411832,"creator":"system","file_name":"IST-2017-822-v1+1_Perspective_Fig__Final.pdf","access_level":"open_access"},{"creator":"system","content_type":"application/pdf","file_size":100769,"file_name":"IST-2017-822-v1+2_Perspective_Final2.pdf","access_level":"open_access","date_created":"2018-12-12T10:16:07Z","date_updated":"2020-07-14T12:45:19Z","checksum":"a279f4ae61e6c8f33d68f69a0d02097d","file_id":"5193","relation":"main_file"}],"oa_version":"Published Version","_id":"1845","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","ddc":["570"],"title":"Excitement about inhibitory presynaptic terminals","intvolume":" 85","month":"03","doi":"10.1016/j.neuron.2015.03.006","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"quality_controlled":"1","file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5256","license":"https://creativecommons.org/licenses/by-nc/4.0/","author":[{"last_name":"Vandael","first_name":"David H","orcid":"0000-0001-7577-1676","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","full_name":"Vandael, David H"},{"full_name":"Espinoza Martinez, Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4710-2082","first_name":"Claudia ","last_name":"Espinoza Martinez"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M"}],"date_updated":"2021-10-08T09:07:34Z","date_created":"2018-12-11T11:54:19Z","volume":85,"year":"2015","publication_status":"published","department":[{"_id":"PeJo"}],"publisher":"Elsevier"},{"date_published":"2015-04-01T00:00:00Z","citation":{"chicago":"Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” IEEE Transactions on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2014.2364971.","short":"B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic Control 60 (2015) 1010–1022.","mla":"Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information Bottleneck.” IEEE Transactions on Automatic Control, vol. 60, no. 4, IEEE, 2015, pp. 1010–22, doi:10.1109/TAC.2014.2364971.","apa":"Geiger, B., Petrov, T., Kubin, G., & Koeppl, H. (2015). Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. IEEE. https://doi.org/10.1109/TAC.2014.2364971","ieee":"B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation via information bottleneck,” IEEE Transactions on Automatic Control, vol. 60, no. 4. IEEE, pp. 1010–1022, 2015.","ista":"Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022.","ama":"Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation via information bottleneck. IEEE Transactions on Automatic Control. 2015;60(4):1010-1022. doi:10.1109/TAC.2014.2364971"},"publication":"IEEE Transactions on Automatic Control","page":"1010 - 1022","day":"01","scopus_import":1,"oa_version":"Preprint","_id":"1840","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 60","title":"Optimal Kullback-Leibler aggregation via information bottleneck","status":"public","issue":"4","abstract":[{"lang":"eng","text":"In this paper, we present a method for reducing a regular, discrete-time Markov chain (DTMC) to another DTMC with a given, typically much smaller number of states. The cost of reduction is defined as the Kullback-Leibler divergence rate between a projection of the original process through a partition function and a DTMC on the correspondingly partitioned state space. Finding the reduced model with minimal cost is computationally expensive, as it requires an exhaustive search among all state space partitions, and an exact evaluation of the reduction cost for each candidate partition. Our approach deals with the latter problem by minimizing an upper bound on the reduction cost instead of minimizing the exact cost. The proposed upper bound is easy to compute and it is tight if the original chain is lumpable with respect to the partition. Then, we express the problem in the form of information bottleneck optimization, and propose using the agglomerative information bottleneck algorithm for searching a suboptimal partition greedily, rather than exhaustively. The theory is illustrated with examples and one application scenario in the context of modeling bio-molecular interactions."}],"type":"journal_article","doi":"10.1109/TAC.2014.2364971","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1304.6603","open_access":"1"}],"quality_controlled":"1","publication_identifier":{"issn":["0018-9286"]},"month":"04","author":[{"full_name":"Geiger, Bernhard","last_name":"Geiger","first_name":"Bernhard"},{"last_name":"Petrov","first_name":"Tatjana","orcid":"0000-0002-9041-0905","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","full_name":"Petrov, Tatjana"},{"full_name":"Kubin, Gernot","first_name":"Gernot","last_name":"Kubin"},{"last_name":"Koeppl","first_name":"Heinz","full_name":"Koeppl, Heinz"}],"volume":60,"date_created":"2018-12-11T11:54:18Z","date_updated":"2021-01-12T06:53:33Z","acknowledgement":"This work was supported by the Austrian Research Association under Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2 128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n","year":"2015","department":[{"_id":"CaGu"},{"_id":"ToHe"}],"publisher":"IEEE","publication_status":"published","publist_id":"5262"},{"scopus_import":1,"day":"01","page":"919 - 930","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","citation":{"short":"V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930.","mla":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:10.1109/TPAMI.2014.2363465.","chicago":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/TPAMI.2014.2363465.","ama":"Kolmogorov V. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2015;37(5):919-930. doi:10.1109/TPAMI.2014.2363465","apa":"Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2014.2363465","ieee":"V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930, 2015.","ista":"Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(5), 919–930."},"date_published":"2015-05-01T00:00:00Z","type":"journal_article","abstract":[{"text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diffusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. The new family of algorithms can be viewed as a generalization of TRW-S from pairwise to higher-order graphical models. We test SRMP on several real-world problems with promising results.","lang":"eng"}],"issue":"5","status":"public","title":"A new look at reweighted message passing","intvolume":" 37","_id":"1841","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","month":"05","quality_controlled":"1","project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5655"}],"language":[{"iso":"eng"}],"doi":"10.1109/TPAMI.2014.2363465","publist_id":"5261","ec_funded":1,"publication_status":"published","publisher":"IEEE","department":[{"_id":"VlKo"}],"year":"2015","date_updated":"2021-01-12T06:53:33Z","date_created":"2018-12-11T11:54:18Z","volume":37,"author":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}]},{"page":"2168 - 2172","quality_controlled":"1","citation":{"chicago":"Himschoot, Ellie, Tom Beeckman, Jiří Friml, and Steffen Vanneste. “Calcium Is an Organizer of Cell Polarity in Plants.” Biochimica et Biophysica Acta - Molecular Cell Research. Elsevier, 2015. https://doi.org/10.1016/j.bbamcr.2015.02.017.","short":"E. Himschoot, T. Beeckman, J. Friml, S. Vanneste, Biochimica et Biophysica Acta - Molecular Cell Research 1853 (2015) 2168–2172.","mla":"Himschoot, Ellie, et al. “Calcium Is an Organizer of Cell Polarity in Plants.” Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no. 9, Elsevier, 2015, pp. 2168–72, doi:10.1016/j.bbamcr.2015.02.017.","apa":"Himschoot, E., Beeckman, T., Friml, J., & Vanneste, S. (2015). Calcium is an organizer of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research. Elsevier. https://doi.org/10.1016/j.bbamcr.2015.02.017","ieee":"E. Himschoot, T. Beeckman, J. Friml, and S. Vanneste, “Calcium is an organizer of cell polarity in plants,” Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no. 9. Elsevier, pp. 2168–2172, 2015.","ista":"Himschoot E, Beeckman T, Friml J, Vanneste S. 2015. Calcium is an organizer of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research. 1853(9), 2168–2172.","ama":"Himschoot E, Beeckman T, Friml J, Vanneste S. Calcium is an organizer of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research. 2015;1853(9):2168-2172. doi:10.1016/j.bbamcr.2015.02.017"},"publication":"Biochimica et Biophysica Acta - Molecular Cell Research","language":[{"iso":"eng"}],"doi":"10.1016/j.bbamcr.2015.02.017","date_published":"2015-09-01T00:00:00Z","scopus_import":1,"day":"01","month":"09","publisher":"Elsevier","department":[{"_id":"JiFr"}],"intvolume":" 1853","status":"public","publication_status":"published","title":"Calcium is an organizer of cell polarity in plants","year":"2015","_id":"1849","acknowledgement":"The contributing authors were supported by the Ghent University Special Research Fund (to E.H.), the Interuniversity Attraction Poles Programme (IAP VI/33 and IUAP P7/29 ‘MARS’), the European Research Council (project ERC-2011-StG-20101109-PSDP, to J.F.), and the Research Foundation Flanders (to S.V.).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":1853,"oa_version":"None","date_created":"2018-12-11T11:54:21Z","date_updated":"2021-01-12T06:53:36Z","author":[{"full_name":"Himschoot, Ellie","first_name":"Ellie","last_name":"Himschoot"},{"first_name":"Tom","last_name":"Beeckman","full_name":"Beeckman, Tom"},{"full_name":"Friml, Jiřĺ","first_name":"Jiřĺ","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"}],"type":"journal_article","publist_id":"5252","issue":"9","abstract":[{"text":"Cell polarity is a fundamental property of pro- and eukaryotic cells. It is necessary for coordination of cell division, cell morphogenesis and signaling processes. How polarity is generated and maintained is a complex issue governed by interconnected feed-back regulations between small GTPase signaling and membrane tension-based signaling that controls membrane trafficking, and cytoskeleton organization and dynamics. Here, we will review the potential role for calcium as a crucial signal that connects and coordinates the respective processes during polarization processes in plants. This article is part of a Special Issue entitled: 13th European Symposium on Calcium.","lang":"eng"}]},{"scopus_import":1,"month":"03","day":"02","page":"356 - 358","quality_controlled":"1","citation":{"ama":"Grones P, Friml J. ABP1: Finally docking. Molecular Plant. 2015;8(3):356-358. doi:10.1016/j.molp.2014.12.013","ieee":"P. Grones and J. Friml, “ABP1: Finally docking,” Molecular Plant, vol. 8, no. 3. Elsevier, pp. 356–358, 2015.","apa":"Grones, P., & Friml, J. (2015). ABP1: Finally docking. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2014.12.013","ista":"Grones P, Friml J. 2015. ABP1: Finally docking. Molecular Plant. 8(3), 356–358.","short":"P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358.","mla":"Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant, vol. 8, no. 3, Elsevier, 2015, pp. 356–58, doi:10.1016/j.molp.2014.12.013.","chicago":"Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant. Elsevier, 2015. https://doi.org/10.1016/j.molp.2014.12.013."},"publication":"Molecular Plant","language":[{"iso":"eng"}],"date_published":"2015-03-02T00:00:00Z","doi":"10.1016/j.molp.2014.12.013","type":"journal_article","publist_id":"5254","issue":"3","intvolume":" 8","department":[{"_id":"JiFr"}],"publisher":"Elsevier","publication_status":"published","status":"public","title":"ABP1: Finally docking","_id":"1847","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP), European Social Fund (CZ.1.07/2.3.00/20.0043), and the Czech Science Foundation GAČR (GA13-40637S).","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":8,"oa_version":"None","date_updated":"2021-01-12T06:53:35Z","date_created":"2018-12-11T11:54:20Z","author":[{"full_name":"Grones, Peter","first_name":"Peter","last_name":"Grones","id":"399876EC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Friml, Jiřĺ","first_name":"Jiřĺ","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}]},{"date_updated":"2021-01-12T06:53:37Z","date_created":"2018-12-11T11:54:21Z","volume":372,"author":[{"full_name":"Novak, Sebastian","last_name":"Novak","first_name":"Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer"}],"publication_status":"published","publisher":"Elsevier","department":[{"_id":"NiBa"},{"_id":"SyCr"}],"year":"2015","file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5251","ec_funded":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.jtbi.2015.02.018","quality_controlled":"1","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7"},{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7","_id":"25DC711C-B435-11E9-9278-68D0E5697425","grant_number":"243071"}],"oa":1,"month":"05","file":[{"file_id":"5326","relation":"main_file","date_created":"2018-12-12T10:18:07Z","date_updated":"2020-07-14T12:45:19Z","checksum":"3c0dcacc900bc45cc65a453dfda4ca43","file_name":"IST-2015-329-v1+1_manuscript.pdf","access_level":"open_access","creator":"system","file_size":1546914,"content_type":"application/pdf"}],"oa_version":"Submitted Version","pubrep_id":"329","ddc":["576"],"title":"Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates","status":"public","intvolume":" 372","_id":"1850","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Entomopathogenic fungi are potent biocontrol agents that are widely used against insect pests, many of which are social insects. Nevertheless, theoretical investigations of their particular life history are scarce. We develop a model that takes into account the main distinguishing features between traditionally studied diseases and obligate killing pathogens, like the (biocontrol-relevant) insect-pathogenic fungi Metarhizium and Beauveria. First, obligate killing entomopathogenic fungi produce new infectious particles (conidiospores) only after host death and not yet on the living host. Second, the killing rates of entomopathogenic fungi depend strongly on the initial exposure dosage, thus we explicitly consider the pathogen load of individual hosts. Further, we make the model applicable not only to solitary host species, but also to group living species by incorporating social interactions between hosts, like the collective disease defences of insect societies. Our results identify the optimal killing rate for the pathogen that minimises its invasion threshold. Furthermore, we find that the rate of contact between hosts has an ambivalent effect: dense interaction networks between individuals are considered to facilitate disease outbreaks because of increased pathogen transmission. In social insects, this is compensated by their collective disease defences, i.e., social immunity. For the type of pathogens considered here, we show that even without social immunity, high contact rates between live individuals dilute the pathogen in the host colony and hence can reduce individual pathogen loads below disease-causing levels."}],"issue":"5","type":"journal_article","date_published":"2015-05-07T00:00:00Z","page":"54 - 64","publication":"Journal of Theoretical Biology","citation":{"chicago":"Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.” Journal of Theoretical Biology. Elsevier, 2015. https://doi.org/10.1016/j.jtbi.2015.02.018.","mla":"Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.” Journal of Theoretical Biology, vol. 372, no. 5, Elsevier, 2015, pp. 54–64, doi:10.1016/j.jtbi.2015.02.018.","short":"S. Novak, S. Cremer, Journal of Theoretical Biology 372 (2015) 54–64.","ista":"Novak S, Cremer S. 2015. Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. Journal of Theoretical Biology. 372(5), 54–64.","ieee":"S. Novak and S. Cremer, “Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates,” Journal of Theoretical Biology, vol. 372, no. 5. Elsevier, pp. 54–64, 2015.","apa":"Novak, S., & Cremer, S. (2015). Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2015.02.018","ama":"Novak S, Cremer S. Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. Journal of Theoretical Biology. 2015;372(5):54-64. doi:10.1016/j.jtbi.2015.02.018"},"day":"07","has_accepted_license":"1","scopus_import":1},{"scopus_import":"1","day":"09","article_processing_charge":"No","has_accepted_license":"1","publication":"Evolution","citation":{"ama":"Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 2015;69(4):1015-1026. doi:10.1111/evo.12618","apa":"Priklopil, T., Kisdi, E., & Gyllenberg, M. (2015). Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. Wiley. https://doi.org/10.1111/evo.12618","ieee":"T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating,” Evolution, vol. 69, no. 4. Wiley, pp. 1015–1026, 2015.","ista":"Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 69(4), 1015–1026.","short":"T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.","mla":"Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” Evolution, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:10.1111/evo.12618.","chicago":"Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” Evolution. Wiley, 2015. https://doi.org/10.1111/evo.12618."},"article_type":"original","page":"1015 - 1026","date_published":"2015-02-09T00:00:00Z","type":"journal_article","abstract":[{"text":"We consider mating strategies for females who search for males sequentially during a season of limited length. We show that the best strategy rejects a given male type if encountered before a time-threshold but accepts him after. For frequency-independent benefits, we obtain the optimal time-thresholds explicitly for both discrete and continuous distributions of males, and allow for mistakes being made in assessing the correct male type. When the benefits are indirect (genes for the offspring) and the population is under frequency-dependent ecological selection, the benefits depend on the mating strategy of other females as well. This case is particularly relevant to speciation models that seek to explore the stability of reproductive isolation by assortative mating under frequency-dependent ecological selection. We show that the indirect benefits are to be quantified by the reproductive values of couples, and describe how the evolutionarily stable time-thresholds can be found. We conclude with an example based on the Levene model, in which we analyze the evolutionarily stable assortative mating strategies and the strength of reproductive isolation provided by them.","lang":"eng"}],"issue":"4","_id":"1851","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"status":"public","title":"Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating","intvolume":" 69","file":[{"file_name":"2015_Evolution_Priklopil.pdf","access_level":"open_access","creator":"dernst","file_size":967214,"content_type":"application/pdf","file_id":"7855","relation":"main_file","date_updated":"2020-07-14T12:45:19Z","date_created":"2020-05-15T09:05:34Z","checksum":"1e8be0b1d7598a78cd2623d8ee8e7798"}],"oa_version":"Submitted Version","month":"02","publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"external_id":{"pmid":["25662095"]},"oa":1,"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"doi":"10.1111/evo.12618","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5249","ec_funded":1,"year":"2015","pmid":1,"publication_status":"published","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"publisher":"Wiley","author":[{"first_name":"Tadeas","last_name":"Priklopil","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","full_name":"Priklopil, Tadeas"},{"first_name":"Eva","last_name":"Kisdi","full_name":"Kisdi, Eva"},{"first_name":"Mats","last_name":"Gyllenberg","full_name":"Gyllenberg, Mats"}],"date_updated":"2022-06-07T10:52:37Z","date_created":"2018-12-11T11:54:21Z","volume":69},{"oa_version":"Preprint","date_created":"2018-12-11T11:54:24Z","date_updated":"2021-01-12T06:53:40Z","author":[{"id":"31ABAF80-F248-11E8-B48F-1D18A9856A87","last_name":"Shah","first_name":"Neel","full_name":"Shah, Neel"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"publisher":"IEEE","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"publication_status":"published","status":"public","title":"A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1859","year":"2015","publist_id":"5240","ec_funded":1,"abstract":[{"text":"Structural support vector machines (SSVMs) are amongst the best performing models for structured computer vision tasks, such as semantic image segmentation or human pose estimation. Training SSVMs, however, is computationally costly, because it requires repeated calls to a structured prediction subroutine (called \\emph{max-oracle}), which has to solve an optimization problem itself, e.g. a graph cut.\r\nIn this work, we introduce a new algorithm for SSVM training that is more efficient than earlier techniques when the max-oracle is computationally expensive, as it is frequently the case in computer vision tasks. The main idea is to (i) combine the recent stochastic Block-Coordinate Frank-Wolfe algorithm with efficient hyperplane caching, and (ii) use an automatic selection rule for deciding whether to call the exact max-oracle or to rely on an approximate one based on the cached hyperplanes.\r\nWe show experimentally that this strategy leads to faster convergence to the optimum with respect to the number of requires oracle calls, and that this translates into faster convergence with respect to the total runtime when the max-oracle is slow compared to the other steps of the algorithm. ","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1109/CVPR.2015.7298890","date_published":"2015-06-01T00:00:00Z","conference":{"start_date":"2015-06-07","location":"Boston, MA, USA","end_date":"2015-06-12","name":"CVPR: Computer Vision and Pattern Recognition"},"project":[{"grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"},{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"page":"2737 - 2745","quality_controlled":"1","oa":1,"citation":{"chicago":"Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle,” 2737–45. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298890.","mla":"Shah, Neel, et al. A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle. IEEE, 2015, pp. 2737–45, doi:10.1109/CVPR.2015.7298890.","short":"N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 2737–2745.","ista":"Shah N, Kolmogorov V, Lampert C. 2015. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. CVPR: Computer Vision and Pattern Recognition, 2737–2745.","ieee":"N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745.","apa":"Shah, N., Kolmogorov, V., & Lampert, C. (2015). A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle (pp. 2737–2745). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7298890","ama":"Shah N, Kolmogorov V, Lampert C. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. In: IEEE; 2015:2737-2745. doi:10.1109/CVPR.2015.7298890"},"main_file_link":[{"url":"http://arxiv.org/abs/1408.6804","open_access":"1"}],"day":"01","month":"06","scopus_import":1},{"author":[{"last_name":"Royer","first_name":"Amélie","full_name":"Royer, Amélie"},{"first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"oa_version":"Submitted Version","date_updated":"2021-01-12T06:53:41Z","date_created":"2018-12-11T11:54:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1860","year":"2015","publisher":"IEEE","department":[{"_id":"ChLa"}],"publication_status":"published","status":"public","title":"Classifier adaptation at prediction time","publist_id":"5239","ec_funded":1,"abstract":[{"lang":"eng","text":"Classifiers for object categorization are usually evaluated by their accuracy on a set of i.i.d. test examples. This provides us with an estimate of the expected error when applying the classifiers to a single new image. In real application, however, classifiers are rarely only used for a single image and then discarded. Instead, they are applied sequentially to many images, and these are typically not i.i.d. samples from a fixed data distribution, but they carry dependencies and their class distribution varies over time. In this work, we argue that the phenomenon of correlated data at prediction time is not a nuisance, but a blessing in disguise. We describe a probabilistic method for adapting classifiers at prediction time without having to retrain them. We also introduce a framework for creating realistically distributed image sequences, which offers a way to benchmark classifier adaptation methods, such as the one we propose. Experiments on the ILSVRC2010 and ILSVRC2012 datasets show that adapting object classification systems at prediction time can significantly reduce their error rate, even with no additional human feedback."}],"type":"conference","date_published":"2015-06-01T00:00:00Z","doi":"10.1109/CVPR.2015.7298746","conference":{"start_date":"2015-06-07","location":"Boston, MA, United States","end_date":"2015-06-12","name":"CVPR: Computer Vision and Pattern Recognition"},"language":[{"iso":"eng"}],"oa":1,"citation":{"ama":"Royer A, Lampert C. Classifier adaptation at prediction time. In: IEEE; 2015:1401-1409. doi:10.1109/CVPR.2015.7298746","ista":"Royer A, Lampert C. 2015. Classifier adaptation at prediction time. CVPR: Computer Vision and Pattern Recognition, 1401–1409.","ieee":"A. Royer and C. Lampert, “Classifier adaptation at prediction time,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 1401–1409.","apa":"Royer, A., & Lampert, C. (2015). Classifier adaptation at prediction time (pp. 1401–1409). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298746","mla":"Royer, Amélie, and Christoph Lampert. Classifier Adaptation at Prediction Time. IEEE, 2015, pp. 1401–09, doi:10.1109/CVPR.2015.7298746.","short":"A. Royer, C. Lampert, in:, IEEE, 2015, pp. 1401–1409.","chicago":"Royer, Amélie, and Christoph Lampert. “Classifier Adaptation at Prediction Time,” 1401–9. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298746."},"main_file_link":[{"open_access":"1","url":"http://www.cv-foundation.org/openaccess/content_cvpr_2015/papers/Royer_Classifier_Adaptation_at_2015_CVPR_paper.pdf"}],"project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"page":"1401 - 1409","quality_controlled":"1","day":"01","month":"06","scopus_import":1},{"author":[{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"date_created":"2018-12-11T11:54:24Z","date_updated":"2021-01-12T06:53:40Z","oa_version":"Preprint","_id":"1858","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","status":"public","title":"Predicting the future behavior of a time-varying probability distribution","publication_status":"published","publisher":"IEEE","department":[{"_id":"ChLa"}],"abstract":[{"text":"We study the problem of predicting the future, though only in the probabilistic sense of estimating a future state of a time-varying probability distribution. This is not only an interesting academic problem, but solving this extrapolation problem also has many practical application, e.g. for training classifiers that have to operate under time-varying conditions. Our main contribution is a method for predicting the next step of the time-varying distribution from a given sequence of sample sets from earlier time steps. For this we rely on two recent machine learning techniques: embedding probability distributions into a reproducing kernel Hilbert space, and learning operators by vector-valued regression. We illustrate the working principles and the practical usefulness of our method by experiments on synthetic and real data. We also highlight an exemplary application: training a classifier in a domain adaptation setting without having access to examples from the test time distribution at training time.","lang":"eng"}],"publist_id":"5241","type":"conference","conference":{"end_date":"2015-06-12","start_date":"2015-06-07","location":"Boston, MA, United States","name":"CVPR: Computer Vision and Pattern Recognition"},"doi":"10.1109/CVPR.2015.7298696","date_published":"2015-10-15T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1406.5362"]},"citation":{"mla":"Lampert, Christoph. Predicting the Future Behavior of a Time-Varying Probability Distribution. IEEE, 2015, pp. 942–50, doi:10.1109/CVPR.2015.7298696.","short":"C. Lampert, in:, IEEE, 2015, pp. 942–950.","chicago":"Lampert, Christoph. “Predicting the Future Behavior of a Time-Varying Probability Distribution,” 942–50. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298696.","ama":"Lampert C. Predicting the future behavior of a time-varying probability distribution. In: IEEE; 2015:942-950. doi:10.1109/CVPR.2015.7298696","ista":"Lampert C. 2015. Predicting the future behavior of a time-varying probability distribution. CVPR: Computer Vision and Pattern Recognition, 942–950.","apa":"Lampert, C. (2015). Predicting the future behavior of a time-varying probability distribution (pp. 942–950). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298696","ieee":"C. Lampert, “Predicting the future behavior of a time-varying probability distribution,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 942–950."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.5362"}],"quality_controlled":"1","page":"942 - 950","day":"15","month":"10","scopus_import":1},{"oa_version":"Preprint","date_created":"2018-12-11T11:54:23Z","date_updated":"2023-02-23T10:17:31Z","author":[{"full_name":"Pentina, Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","first_name":"Anastasia","last_name":"Pentina"},{"full_name":"Sharmanska, Viktoriia","last_name":"Sharmanska","first_name":"Viktoriia","orcid":"0000-0003-0192-9308","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"publisher":"IEEE","department":[{"_id":"ChLa"}],"status":"public","title":"Curriculum learning of multiple tasks","publication_status":"published","_id":"1857","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5243","abstract":[{"lang":"eng","text":"Sharing information between multiple tasks enables algorithms to achieve good generalization performance even from small amounts of training data. However, in a realistic scenario of multi-task learning not all tasks are equally related to each other, hence it could be advantageous to transfer information only between the most related tasks. In this work we propose an approach that processes multiple tasks in a sequence with sharing between subsequent tasks instead of solving all tasks jointly. Subsequently, we address the question of curriculum learning of tasks, i.e. finding the best order of tasks to be learned. Our approach is based on a generalization bound criterion for choosing the task order that optimizes the average expected classification performance over all tasks. Our experimental results show that learning multiple related tasks sequentially can be more effective than learning them jointly, the order in which tasks are being solved affects the overall performance, and that our model is able to automatically discover the favourable order of tasks. "}],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1109/CVPR.2015.7299188","date_published":"2015-06-01T00:00:00Z","conference":{"location":"Boston, MA, United States","start_date":"2015-06-07","end_date":"2015-06-12","name":"CVPR: Computer Vision and Pattern Recognition"},"page":"5492 - 5500","quality_controlled":"1","citation":{"mla":"Pentina, Anastasia, et al. Curriculum Learning of Multiple Tasks. IEEE, 2015, pp. 5492–500, doi:10.1109/CVPR.2015.7299188.","short":"A. Pentina, V. Sharmanska, C. Lampert, in:, IEEE, 2015, pp. 5492–5500.","chicago":"Pentina, Anastasia, Viktoriia Sharmanska, and Christoph Lampert. “Curriculum Learning of Multiple Tasks,” 5492–5500. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299188.","ama":"Pentina A, Sharmanska V, Lampert C. Curriculum learning of multiple tasks. In: IEEE; 2015:5492-5500. doi:10.1109/CVPR.2015.7299188","ista":"Pentina A, Sharmanska V, Lampert C. 2015. Curriculum learning of multiple tasks. CVPR: Computer Vision and Pattern Recognition, 5492–5500.","ieee":"A. Pentina, V. Sharmanska, and C. Lampert, “Curriculum learning of multiple tasks,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 5492–5500.","apa":"Pentina, A., Sharmanska, V., & Lampert, C. (2015). Curriculum learning of multiple tasks (pp. 5492–5500). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7299188"},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1412.1353","open_access":"1"}],"month":"06","day":"01","scopus_import":1},{"month":"02","doi":"10.1002/elps.201400451","language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564","call_identifier":"FP7","name":"Microbial Ion Channels for Synthetic Neurobiology"},{"_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)"}],"publist_id":"5230","ec_funded":1,"author":[{"first_name":"Jens","last_name":"Hühner","full_name":"Hühner, Jens"},{"first_name":"Álvaro","last_name":"Inglés Prieto","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5409-8571","full_name":"Inglés Prieto, Álvaro"},{"full_name":"Neusüß, Christian","last_name":"Neusüß","first_name":"Christian"},{"last_name":"Lämmerhofer","first_name":"Michael","full_name":"Lämmerhofer, Michael"},{"full_name":"Janovjak, Harald L","last_name":"Janovjak","first_name":"Harald L","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:54:26Z","date_updated":"2021-01-12T06:53:43Z","volume":36,"year":"2015","publication_status":"published","publisher":"Wiley","department":[{"_id":"HaJa"}],"day":"01","scopus_import":1,"date_published":"2015-02-01T00:00:00Z","publication":"Electrophoresis","citation":{"ieee":"J. Hühner, Á. Inglés Prieto, C. Neusüß, M. Lämmerhofer, and H. L. Janovjak, “Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection,” Electrophoresis, vol. 36, no. 4. Wiley, pp. 518–525, 2015.","apa":"Hühner, J., Inglés Prieto, Á., Neusüß, C., Lämmerhofer, M., & Janovjak, H. L. (2015). Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection. Electrophoresis. Wiley. https://doi.org/10.1002/elps.201400451","ista":"Hühner J, Inglés Prieto Á, Neusüß C, Lämmerhofer M, Janovjak HL. 2015. Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection. Electrophoresis. 36(4), 518–525.","ama":"Hühner J, Inglés Prieto Á, Neusüß C, Lämmerhofer M, Janovjak HL. Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection. Electrophoresis. 2015;36(4):518-525. doi:10.1002/elps.201400451","chicago":"Hühner, Jens, Álvaro Inglés Prieto, Christian Neusüß, Michael Lämmerhofer, and Harald L Janovjak. “Quantification of Riboflavin, Flavin Mononucleotide, and Flavin Adenine Dinucleotide in Mammalian Model Cells by CE with LED-Induced Fluorescence Detection.” Electrophoresis. Wiley, 2015. https://doi.org/10.1002/elps.201400451.","short":"J. Hühner, Á. Inglés Prieto, C. Neusüß, M. Lämmerhofer, H.L. Janovjak, Electrophoresis 36 (2015) 518–525.","mla":"Hühner, Jens, et al. “Quantification of Riboflavin, Flavin Mononucleotide, and Flavin Adenine Dinucleotide in Mammalian Model Cells by CE with LED-Induced Fluorescence Detection.” Electrophoresis, vol. 36, no. 4, Wiley, 2015, pp. 518–25, doi:10.1002/elps.201400451."},"page":"518 - 525","abstract":[{"lang":"eng","text":"Cultured mammalian cells essential are model systems in basic biology research, production platforms of proteins for medical use, and testbeds in synthetic biology. Flavin cofactors, in particular flavin mononucleotide (FMN) and flavin adenine dinucleotide (FAD), are critical for cellular redox reactions and sense light in naturally occurring photoreceptors and optogenetic tools. Here, we quantified flavin contents of commonly used mammalian cell lines. We first compared three procedures for extraction of free and noncovalently protein-bound flavins and verified extraction using fluorescence spectroscopy. For separation, two CE methods with different BGEs were established, and detection was performed by LED-induced fluorescence with limit of detections (LODs 0.5-3.8 nM). We found that riboflavin (RF), FMN, and FAD contents varied significantly between cell lines. RF (3.1-14 amol/cell) and FAD (2.2-17.0 amol/cell) were the predominant flavins, while FMN (0.46-3.4 amol/cell) was found at markedly lower levels. Observed flavin contents agree with those previously extracted from mammalian tissues, yet reduced forms of RF were detected that were not described previously. Quantification of flavins in mammalian cell lines will allow a better understanding of cellular redox reactions and optogenetic tools."}],"issue":"4","type":"journal_article","pubrep_id":"836","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1867","title":"Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence detection","status":"public","intvolume":" 36"},{"citation":{"apa":"Robert, H., Grunewald, W., Sauer, M., Cannoot, B., Soriano, M., Swarup, R., … Friml, J. (2015). Plant embryogenesis requires AUX/LAX-mediated auxin influx. Development. Company of Biologists. https://doi.org/10.1242/dev.115832","ieee":"H. Robert et al., “Plant embryogenesis requires AUX/LAX-mediated auxin influx,” Development, vol. 142, no. 4. Company of Biologists, pp. 702–711, 2015.","ista":"Robert H, Grunewald W, Sauer M, Cannoot B, Soriano M, Swarup R, Weijers D, Bennett M, Boutilier K, Friml J. 2015. Plant embryogenesis requires AUX/LAX-mediated auxin influx. Development. 142(4), 702–711.","ama":"Robert H, Grunewald W, Sauer M, et al. Plant embryogenesis requires AUX/LAX-mediated auxin influx. Development. 2015;142(4):702-711. doi:10.1242/dev.115832","chicago":"Robert, Hélène, Wim Grunewald, Michael Sauer, Bernard Cannoot, Mercedes Soriano, Ranjan Swarup, Dolf Weijers, Malcolm Bennett, Kim Boutilier, and Jiří Friml. “Plant Embryogenesis Requires AUX/LAX-Mediated Auxin Influx.” Development. Company of Biologists, 2015. https://doi.org/10.1242/dev.115832.","short":"H. Robert, W. Grunewald, M. Sauer, B. Cannoot, M. Soriano, R. Swarup, D. Weijers, M. Bennett, K. Boutilier, J. Friml, Development 142 (2015) 702–711.","mla":"Robert, Hélène, et al. “Plant Embryogenesis Requires AUX/LAX-Mediated Auxin Influx.” Development, vol. 142, no. 4, Company of Biologists, 2015, pp. 702–11, doi:10.1242/dev.115832."},"publication":"Development","page":"702 - 711","date_published":"2015-02-15T00:00:00Z","scopus_import":1,"day":"15","_id":"1865","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 142","title":"Plant embryogenesis requires AUX/LAX-mediated auxin influx","status":"public","oa_version":"None","type":"journal_article","issue":"4","abstract":[{"text":"The plant hormone auxin and its directional transport are known to play a crucial role in defining the embryonic axis and subsequent development of the body plan. Although the role of PIN auxin efflux transporters has been clearly assigned during embryonic shoot and root specification, the role of the auxin influx carriers AUX1 and LIKE-AUX1 (LAX) proteins is not well established. Here, we used chemical and genetic tools on Brassica napus microspore-derived embryos and Arabidopsis thaliana zygotic embryos, and demonstrate that AUX1, LAX1 and LAX2 are required for both shoot and root pole formation, in concert with PIN efflux carriers. Furthermore, we uncovered a positive-feedback loop betweenMONOPTEROS(ARF5)-dependent auxin signalling and auxin transport. ThisMONOPTEROSdependent transcriptional regulation of auxin influx (AUX1, LAX1 and LAX2) and auxin efflux (PIN1 and PIN4) carriers by MONOPTEROS helps to maintain proper auxin transport to the root tip. These results indicate that auxin-dependent cell specification during embryo development requires balanced auxin transport involving both influx and efflux mechanisms, and that this transport is maintained by a positive transcriptional feedback on auxin signalling.","lang":"eng"}],"project":[{"call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1242/dev.115832","language":[{"iso":"eng"}],"month":"02","acknowledgement":"W.G. is a post-doctoral fellow of the Research Foundation Flanders. H.S.R. is supported by Employment of Best Young Scientists for International Cooperation Empowerment [CZ.1.07/2.3.00/30.0037], co-financed by the European Social Fund and the state budget of the Czech Republic. Mi.S. was funded by the Ramón y Cajal program. This work was supported by the European Research Council [project ERC-2011-StG-20101109-PSDP], project ‘CEITEC – Central European Institute of Technology’ [CZ.1.05/1.1.00/02.0068], the European Social Fund [CZ.1.07/2.3.00/20.0043] and the Czech Science Foundation GACR [GA13-40637S] to J.F. We acknowledge funding from the Biological and Biotechnological Science Research Council (BBSRC) and Engineering Physics Science Research Council (EPSRC) to R.S. and M.B","year":"2015","department":[{"_id":"JiFr"}],"publisher":"Company of Biologists","publication_status":"published","author":[{"first_name":"Hélène","last_name":"Robert","full_name":"Robert, Hélène"},{"full_name":"Grunewald, Wim","first_name":"Wim","last_name":"Grunewald"},{"full_name":"Sauer, Michael","last_name":"Sauer","first_name":"Michael"},{"last_name":"Cannoot","first_name":"Bernard","full_name":"Cannoot, Bernard"},{"first_name":"Mercedes","last_name":"Soriano","full_name":"Soriano, Mercedes"},{"last_name":"Swarup","first_name":"Ranjan","full_name":"Swarup, Ranjan"},{"first_name":"Dolf","last_name":"Weijers","full_name":"Weijers, Dolf"},{"full_name":"Bennett, Malcolm","last_name":"Bennett","first_name":"Malcolm"},{"last_name":"Boutilier","first_name":"Kim","full_name":"Boutilier, Kim"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"}],"volume":142,"date_created":"2018-12-11T11:54:26Z","date_updated":"2021-01-12T06:53:43Z","publist_id":"5231","ec_funded":1},{"quality_controlled":"1","publication":"Physical Review E","citation":{"chicago":"Park, Youngyong, Younghae Do, Sebastian Altmeyer, Yingcheng Lai, and Gyuwon Lee. “Early Effect in Time-Dependent, High-Dimensional Nonlinear Dynamical Systems with Multiple Resonances.” Physical Review E. American Physical Society, 2015. https://doi.org/10.1103/PhysRevE.91.022906.","short":"Y. Park, Y. Do, S. Altmeyer, Y. Lai, G. Lee, Physical Review E 91 (2015).","mla":"Park, Youngyong, et al. “Early Effect in Time-Dependent, High-Dimensional Nonlinear Dynamical Systems with Multiple Resonances.” Physical Review E, vol. 91, no. 2, 022906, American Physical Society, 2015, doi:10.1103/PhysRevE.91.022906.","apa":"Park, Y., Do, Y., Altmeyer, S., Lai, Y., & Lee, G. (2015). Early effect in time-dependent, high-dimensional nonlinear dynamical systems with multiple resonances. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.91.022906","ieee":"Y. Park, Y. Do, S. Altmeyer, Y. Lai, and G. Lee, “Early effect in time-dependent, high-dimensional nonlinear dynamical systems with multiple resonances,” Physical Review E, vol. 91, no. 2. American Physical Society, 2015.","ista":"Park Y, Do Y, Altmeyer S, Lai Y, Lee G. 2015. Early effect in time-dependent, high-dimensional nonlinear dynamical systems with multiple resonances. Physical Review E. 91(2), 022906.","ama":"Park Y, Do Y, Altmeyer S, Lai Y, Lee G. Early effect in time-dependent, high-dimensional nonlinear dynamical systems with multiple resonances. Physical Review E. 2015;91(2). doi:10.1103/PhysRevE.91.022906"},"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevE.91.022906","date_published":"2015-02-09T00:00:00Z","scopus_import":1,"day":"09","month":"02","publication_identifier":{"issn":["1539-3755"]},"publication_status":"published","title":"Early effect in time-dependent, high-dimensional nonlinear dynamical systems with multiple resonances","status":"public","department":[{"_id":"BjHo"}],"intvolume":" 91","publisher":"American Physical Society","_id":"1868","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","date_updated":"2021-01-12T06:53:44Z","date_created":"2018-12-11T11:54:27Z","volume":91,"oa_version":"None","author":[{"last_name":"Park","first_name":"Youngyong","full_name":"Park, Youngyong"},{"first_name":"Younghae","last_name":"Do","full_name":"Do, Younghae"},{"orcid":"0000-0001-5964-0203","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","last_name":"Altmeyer","first_name":"Sebastian","full_name":"Altmeyer, Sebastian"},{"last_name":"Lai","first_name":"Yingcheng","full_name":"Lai, Yingcheng"},{"last_name":"Lee","first_name":"Gyuwon","full_name":"Lee, Gyuwon"}],"article_number":"022906","type":"journal_article","abstract":[{"lang":"eng","text":"We investigate high-dimensional nonlinear dynamical systems exhibiting multiple resonances under adiabatic parameter variations. Our motivations come from experimental considerations where time-dependent sweeping of parameters is a practical approach to probing and characterizing the bifurcations of the system. The question is whether bifurcations so detected are faithful representations of the bifurcations intrinsic to the original stationary system. Utilizing a harmonically forced, closed fluid flow system that possesses multiple resonances and solving the Navier-Stokes equation under proper boundary conditions, we uncover the phenomenon of the early effect. Specifically, as a control parameter, e.g., the driving frequency, is adiabatically increased from an initial value, resonances emerge at frequency values that are lower than those in the corresponding stationary system. The phenomenon is established by numerical characterization of physical quantities through the resonances, which include the kinetic energy and the vorticity field, and a heuristic analysis based on the concept of instantaneous frequency. A simple formula is obtained which relates the resonance points in the time-dependent and time-independent systems. Our findings suggest that, in general, any true bifurcation of a nonlinear dynamical system can be unequivocally uncovered through adiabatic parameter sweeping, in spite of a shift in the bifurcation point, which is of value to experimental studies of nonlinear dynamical systems."}],"publist_id":"5229","issue":"2"},{"year":"2015","publication_status":"published","publisher":"Springer","department":[{"_id":"LaEr"}],"author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","full_name":"Erdös, László"},{"full_name":"Knowles, Antti","first_name":"Antti","last_name":"Knowles"}],"date_updated":"2021-01-12T06:53:42Z","date_created":"2018-12-11T11:54:26Z","volume":16,"ec_funded":1,"publist_id":"5233","main_file_link":[{"url":"http://arxiv.org/abs/1309.5107","open_access":"1"}],"oa":1,"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"doi":"10.1007/s00023-014-0333-5","language":[{"iso":"eng"}],"month":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1864","status":"public","title":"The Altshuler–Shklovskii formulas for random band matrices II: The general case","intvolume":" 16","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"The Altshuler–Shklovskii formulas (Altshuler and Shklovskii, BZh Eksp Teor Fiz 91:200, 1986) predict, for any disordered quantum system in the diffusive regime, a universal power law behaviour for the correlation functions of the mesoscopic eigenvalue density. In this paper and its companion (Erdős and Knowles, The Altshuler–Shklovskii formulas for random band matrices I: the unimodular case, 2013), we prove these formulas for random band matrices. In (Erdős and Knowles, The Altshuler–Shklovskii formulas for random band matrices I: the unimodular case, 2013) we introduced a diagrammatic approach and presented robust estimates on general diagrams under certain simplifying assumptions. In this paper, we remove these assumptions by giving a general estimate of the subleading diagrams. We also give a precise analysis of the leading diagrams which give rise to the Altschuler–Shklovskii power laws. Moreover, we introduce a family of general random band matrices which interpolates between real symmetric (β = 1) and complex Hermitian (β = 2) models, and track the transition for the mesoscopic density–density correlation. Finally, we address the higher-order correlation functions by proving that they behave asymptotically according to a Gaussian process whose covariance is given by the Altshuler–Shklovskii formulas.\r\n"}],"issue":"3","publication":"Annales Henri Poincare","citation":{"ista":"Erdös L, Knowles A. 2015. The Altshuler–Shklovskii formulas for random band matrices II: The general case. Annales Henri Poincare. 16(3), 709–799.","apa":"Erdös, L., & Knowles, A. (2015). The Altshuler–Shklovskii formulas for random band matrices II: The general case. Annales Henri Poincare. Springer. https://doi.org/10.1007/s00023-014-0333-5","ieee":"L. Erdös and A. Knowles, “The Altshuler–Shklovskii formulas for random band matrices II: The general case,” Annales Henri Poincare, vol. 16, no. 3. Springer, pp. 709–799, 2015.","ama":"Erdös L, Knowles A. The Altshuler–Shklovskii formulas for random band matrices II: The general case. Annales Henri Poincare. 2015;16(3):709-799. doi:10.1007/s00023-014-0333-5","chicago":"Erdös, László, and Antti Knowles. “The Altshuler–Shklovskii Formulas for Random Band Matrices II: The General Case.” Annales Henri Poincare. Springer, 2015. https://doi.org/10.1007/s00023-014-0333-5.","mla":"Erdös, László, and Antti Knowles. “The Altshuler–Shklovskii Formulas for Random Band Matrices II: The General Case.” Annales Henri Poincare, vol. 16, no. 3, Springer, 2015, pp. 709–99, doi:10.1007/s00023-014-0333-5.","short":"L. Erdös, A. Knowles, Annales Henri Poincare 16 (2015) 709–799."},"page":"709 - 799","date_published":"2015-03-01T00:00:00Z","scopus_import":1,"day":"01"},{"scopus_import":1,"day":"01","month":"02","citation":{"chicago":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” ACM Transactions on Modeling and Computer Simulation. ACM, 2015. https://doi.org/10.1145/2688906.","short":"J. Ruess, J. Lygeros, ACM Transactions on Modeling and Computer Simulation 25 (2015).","mla":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2, 8, ACM, 2015, doi:10.1145/2688906.","ieee":"J. Ruess and J. Lygeros, “Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks,” ACM Transactions on Modeling and Computer Simulation, vol. 25, no. 2. ACM, 2015.","apa":"Ruess, J., & Lygeros, J. (2015). Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. ACM. https://doi.org/10.1145/2688906","ista":"Ruess J, Lygeros J. 2015. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. 25(2), 8.","ama":"Ruess J, Lygeros J. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. 2015;25(2). doi:10.1145/2688906"},"publication":"ACM Transactions on Modeling and Computer Simulation","quality_controlled":"1","doi":"10.1145/2688906","date_published":"2015-02-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","article_number":"8","issue":"2","publist_id":"5238","abstract":[{"text":"Continuous-time Markov chains are commonly used in practice for modeling biochemical reaction networks in which the inherent randomness of themolecular interactions cannot be ignored. This has motivated recent research effort into methods for parameter inference and experiment design for such models. The major difficulty is that such methods usually require one to iteratively solve the chemical master equation that governs the time evolution of the probability distribution of the system. This, however, is rarely possible, and even approximation techniques remain limited to relatively small and simple systems. An alternative explored in this article is to base methods on only some low-order moments of the entire probability distribution. We summarize the theory behind such moment-based methods for parameter inference and experiment design and provide new case studies where we investigate their performance.","lang":"eng"}],"_id":"1861","year":"2015","acknowledgement":"HYCON2; EC; European Commission\r\n","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 25","publisher":"ACM","department":[{"_id":"ToHe"},{"_id":"GaTk"}],"status":"public","title":"Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks","publication_status":"published","author":[{"full_name":"Ruess, Jakob","orcid":"0000-0003-1615-3282","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","last_name":"Ruess","first_name":"Jakob"},{"last_name":"Lygeros","first_name":"John","full_name":"Lygeros, John"}],"oa_version":"None","volume":25,"date_created":"2018-12-11T11:54:25Z","date_updated":"2021-01-12T06:53:41Z"},{"scopus_import":1,"day":"28","month":"01","page":"86-86","citation":{"ieee":"T. A. Henzinger and J. Raskin, “The equivalence problem for finite automata: Technical perspective,” Communications of the ACM, vol. 58, no. 2. ACM, pp. 86–86, 2015.","apa":"Henzinger, T. A., & Raskin, J. (2015). The equivalence problem for finite automata: Technical perspective. Communications of the ACM. ACM. https://doi.org/10.1145/2701001","ista":"Henzinger TA, Raskin J. 2015. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 58(2), 86–86.","ama":"Henzinger TA, Raskin J. The equivalence problem for finite automata: Technical perspective. Communications of the ACM. 2015;58(2):86-86. doi:10.1145/2701001","chicago":"Henzinger, Thomas A, and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” Communications of the ACM. ACM, 2015. https://doi.org/10.1145/2701001.","short":"T.A. Henzinger, J. Raskin, Communications of the ACM 58 (2015) 86–86.","mla":"Henzinger, Thomas A., and Jean Raskin. “The Equivalence Problem for Finite Automata: Technical Perspective.” Communications of the ACM, vol. 58, no. 2, ACM, 2015, pp. 86–86, doi:10.1145/2701001."},"publication":"Communications of the ACM","language":[{"iso":"eng"}],"date_published":"2015-01-28T00:00:00Z","doi":"10.1145/2701001","type":"journal_article","issue":"2","publist_id":"5232","department":[{"_id":"ToHe"}],"intvolume":" 58","publisher":"ACM","status":"public","title":"The equivalence problem for finite automata: Technical perspective","publication_status":"published","year":"2015","_id":"1866","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":58,"date_created":"2018-12-11T11:54:26Z","date_updated":"2021-01-12T06:53:43Z","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Raskin, Jean","first_name":"Jean","last_name":"Raskin"}]},{"file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5225","author":[{"last_name":"Grones","first_name":"Peter","id":"399876EC-F248-11E8-B48F-1D18A9856A87","full_name":"Grones, Peter"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí"}],"date_created":"2018-12-11T11:54:28Z","date_updated":"2021-01-12T06:53:45Z","volume":128,"acknowledgement":"This work was supported by the European Research Council [project ERC-2011-StG-20101109-PSDP]; European Social Fund [grant number CZ.1.07/2.3.00/20.0043] and the Czech Science Foundation GAČR [grant number GA13-40637S]","year":"2015","publication_status":"published","publisher":"Company of Biologists","department":[{"_id":"JiFr"}],"month":"01","doi":"10.1242/jcs.159418","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"The plant hormone auxin is a key regulator of plant growth and development. Differences in auxin distribution within tissues are mediated by the polar auxin transport machinery, and cellular auxin responses occur depending on changes in cellular auxin levels. Multiple receptor systems at the cell surface and in the interior operate to sense and interpret fluctuations in auxin distribution that occur during plant development. Until now, three proteins or protein complexes that can bind auxin have been identified. SCFTIR1 [a SKP1-cullin-1-F-box complex that contains transport inhibitor response 1 (TIR1) as the F-box protein] and S-phase-kinaseassociated protein 2 (SKP2) localize to the nucleus, whereas auxinbinding protein 1 (ABP1), predominantly associates with the endoplasmic reticulum and cell surface. In this Cell Science at a Glance article, we summarize recent discoveries in the field of auxin transport and signaling that have led to the identification of new components of these pathways, as well as their mutual interaction."}],"issue":"1","type":"journal_article","pubrep_id":"563","oa_version":"Submitted Version","file":[{"creator":"system","file_size":1688844,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2016-563-v1+1_1.full.pdf","checksum":"24c779f4cd9d549ca6833e26f486be27","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-12T10:11:00Z","file_id":"4852","relation":"main_file"}],"_id":"1871","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["570"],"title":"Auxin transporters and binding proteins at a glance","intvolume":" 128","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2015-01-01T00:00:00Z","publication":"Journal of Cell Science","citation":{"mla":"Grones, Peter, and Jiří Friml. “Auxin Transporters and Binding Proteins at a Glance.” Journal of Cell Science, vol. 128, no. 1, Company of Biologists, 2015, pp. 1–7, doi:10.1242/jcs.159418.","short":"P. Grones, J. Friml, Journal of Cell Science 128 (2015) 1–7.","chicago":"Grones, Peter, and Jiří Friml. “Auxin Transporters and Binding Proteins at a Glance.” Journal of Cell Science. Company of Biologists, 2015. https://doi.org/10.1242/jcs.159418.","ama":"Grones P, Friml J. Auxin transporters and binding proteins at a glance. Journal of Cell Science. 2015;128(1):1-7. doi:10.1242/jcs.159418","ista":"Grones P, Friml J. 2015. Auxin transporters and binding proteins at a glance. Journal of Cell Science. 128(1), 1–7.","ieee":"P. Grones and J. Friml, “Auxin transporters and binding proteins at a glance,” Journal of Cell Science, vol. 128, no. 1. Company of Biologists, pp. 1–7, 2015.","apa":"Grones, P., & Friml, J. (2015). Auxin transporters and binding proteins at a glance. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.159418"},"page":"1 - 7"},{"scopus_import":1,"day":"01","month":"07","publication":"Hippocampus","citation":{"chicago":"Boccara, Charlotte N., Lisa Kjønigsen, Ingvild Hammer, Jan Bjaalie, Trygve Leergaard, and Menno Witter. “A Three-Plane Architectonic Atlas of the Rat Hippocampal Region.” Hippocampus. Wiley, 2015. https://doi.org/10.1002/hipo.22407.","short":"C.N. Boccara, L. Kjønigsen, I. Hammer, J. Bjaalie, T. Leergaard, M. Witter, Hippocampus 25 (2015) 838–857.","mla":"Boccara, Charlotte N., et al. “A Three-Plane Architectonic Atlas of the Rat Hippocampal Region.” Hippocampus, vol. 25, no. 7, Wiley, 2015, pp. 838–57, doi:10.1002/hipo.22407.","ieee":"C. N. Boccara, L. Kjønigsen, I. Hammer, J. Bjaalie, T. Leergaard, and M. Witter, “A three-plane architectonic atlas of the rat hippocampal region,” Hippocampus, vol. 25, no. 7. Wiley, pp. 838–857, 2015.","apa":"Boccara, C. N., Kjønigsen, L., Hammer, I., Bjaalie, J., Leergaard, T., & Witter, M. (2015). A three-plane architectonic atlas of the rat hippocampal region. Hippocampus. Wiley. https://doi.org/10.1002/hipo.22407","ista":"Boccara CN, Kjønigsen L, Hammer I, Bjaalie J, Leergaard T, Witter M. 2015. A three-plane architectonic atlas of the rat hippocampal region. Hippocampus. 25(7), 838–857.","ama":"Boccara CN, Kjønigsen L, Hammer I, Bjaalie J, Leergaard T, Witter M. A three-plane architectonic atlas of the rat hippocampal region. Hippocampus. 2015;25(7):838-857. doi:10.1002/hipo.22407"},"quality_controlled":"1","page":"838 - 857","date_published":"2015-07-01T00:00:00Z","doi":"10.1002/hipo.22407","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"The hippocampal region, comprising the hippocampal formation and the parahippocampal region, has been one of the most intensively studied parts of the brain for decades. Better understanding of its functional diversity and complexity has led to an increased demand for specificity in experimental procedures and manipulations. In view of the complex 3D structure of the hippocampal region, precisely positioned experimental approaches require a fine-grained architectural description that is available and readable to experimentalists lacking detailed anatomical experience. In this paper, we provide the first cyto- and chemoarchitectural description of the hippocampal formation and parahippocampal region in the rat at high resolution and in the three standard sectional planes: coronal, horizontal and sagittal. The atlas uses a series of adjacent sections stained for neurons and for a number of chemical marker substances, particularly parvalbumin and calbindin. All the borders defined in one plane have been cross-checked against their counterparts in the other two planes. The entire dataset will be made available as a web-based interactive application through the Rodent Brain WorkBench (http://www.rbwb.org) which, together with this paper, provides a unique atlas resource.","lang":"eng"}],"publist_id":"5222","issue":"7","_id":"1874","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A three-plane architectonic atlas of the rat hippocampal region","status":"public","publication_status":"published","publisher":"Wiley","department":[{"_id":"JoCs"}],"intvolume":" 25","author":[{"id":"3FC06552-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7237-5109","first_name":"Charlotte","last_name":"Boccara","full_name":"Boccara, Charlotte"},{"full_name":"Kjønigsen, Lisa","first_name":"Lisa","last_name":"Kjønigsen"},{"first_name":"Ingvild","last_name":"Hammer","full_name":"Hammer, Ingvild"},{"first_name":"Jan","last_name":"Bjaalie","full_name":"Bjaalie, Jan"},{"full_name":"Leergaard, Trygve","last_name":"Leergaard","first_name":"Trygve"},{"first_name":"Menno","last_name":"Witter","full_name":"Witter, Menno"}],"date_updated":"2021-01-12T06:53:46Z","date_created":"2018-12-11T11:54:29Z","oa_version":"None","volume":25},{"scopus_import":1,"month":"04","day":"01","publication":"Artificial Intelligence","citation":{"ama":"Chatterjee K, Chmelik M. POMDPs under probabilistic semantics. Artificial Intelligence. 2015;221:46-72. doi:10.1016/j.artint.2014.12.009","ieee":"K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221. Elsevier, pp. 46–72, 2015.","apa":"Chatterjee, K., & Chmelik, M. (2015). POMDPs under probabilistic semantics. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2014.12.009","ista":"Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72.","short":"K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.","mla":"Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence, vol. 221, Elsevier, 2015, pp. 46–72, doi:10.1016/j.artint.2014.12.009.","chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” Artificial Intelligence. Elsevier, 2015. https://doi.org/10.1016/j.artint.2014.12.009."},"external_id":{"arxiv":["1408.2058"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.2058"}],"oa":1,"quality_controlled":"1","page":"46 - 72","date_published":"2015-04-01T00:00:00Z","doi":"10.1016/j.artint.2014.12.009","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] is associated with every transition, and the payoff of an infinite path is the long-run average of the rewards. We consider two types of path constraints: (i) a quantitative constraint defines the set of paths where the payoff is at least a given threshold λ1ε(0,1]; and (ii) a qualitative constraint which is a special case of the quantitative constraint with λ1=1. We consider the computation of the almost-sure winning set, where the controller needs to ensure that the path constraint is satisfied with probability 1. Our main results for qualitative path constraints are as follows: (i) the problem of deciding the existence of a finite-memory controller is EXPTIME-complete; and (ii) the problem of deciding the existence of an infinite-memory controller is undecidable. For quantitative path constraints we show that the problem of deciding the existence of a finite-memory controller is undecidable. We also present a prototype implementation of our EXPTIME algorithm and experimental results on several examples."}],"publist_id":"5224","year":"2015","_id":"1873","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","status":"public","title":"POMDPs under probabilistic semantics","intvolume":" 221","department":[{"_id":"KrCh"}],"publisher":"Elsevier","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"}],"date_updated":"2021-01-12T06:53:46Z","date_created":"2018-12-11T11:54:28Z","oa_version":"Preprint","volume":221},{"file_date_updated":"2020-07-14T12:45:19Z","publist_id":"5218","author":[{"full_name":"Kremer, A","first_name":"A","last_name":"Kremer"},{"last_name":"Lippens","first_name":"Stefaan","full_name":"Lippens, Stefaan"},{"full_name":"Bartunkova, Sonia","last_name":"Bartunkova","first_name":"Sonia"},{"first_name":"Bob","last_name":"Asselbergh","full_name":"Asselbergh, Bob"},{"last_name":"Blanpain","first_name":"Cendric","full_name":"Blanpain, Cendric"},{"first_name":"Matyas","last_name":"Fendrych","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","full_name":"Fendrych, Matyas"},{"full_name":"Goossens, A","first_name":"A","last_name":"Goossens"},{"first_name":"Matthew","last_name":"Holt","full_name":"Holt, Matthew"},{"last_name":"Janssens","first_name":"Sophie","full_name":"Janssens, Sophie"},{"full_name":"Krols, Michiel","first_name":"Michiel","last_name":"Krols"},{"full_name":"Larsimont, Jean","first_name":"Jean","last_name":"Larsimont"},{"first_name":"Conor","last_name":"Mc Guire","full_name":"Mc Guire, Conor"},{"last_name":"Nowack","first_name":"Moritz","full_name":"Nowack, Moritz"},{"full_name":"Saelens, Xavier","last_name":"Saelens","first_name":"Xavier"},{"last_name":"Schertel","first_name":"Andreas","full_name":"Schertel, Andreas"},{"full_name":"Schepens, B","last_name":"Schepens","first_name":"B"},{"first_name":"M","last_name":"Slezak","full_name":"Slezak, M"},{"full_name":"Timmerman, Vincent","last_name":"Timmerman","first_name":"Vincent"},{"full_name":"Theunis, Clara","first_name":"Clara","last_name":"Theunis"},{"full_name":"Van Brempt, Ronald","first_name":"Ronald","last_name":"Van Brempt"},{"first_name":"Y","last_name":"Visser","full_name":"Visser, Y"},{"last_name":"Guérin","first_name":"Christophe","full_name":"Guérin, Christophe"}],"date_created":"2018-12-11T11:54:30Z","date_updated":"2021-01-12T06:53:48Z","volume":259,"acknowledgement":"The Zeiss Merlin with Gatan 3View2XP and Zeiss Auriga were acquired through a CLEM grant from Minister Ingrid Lieten to the VIB Bio-Imaging-Core. Michiel Krols and Saskia Lippens are the recipients of a fellowship from the FWO (Fonds Wetenschappelijk Onderzoek) of Flanders.","year":"2015","publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Wiley-Blackwell","month":"08","doi":"10.1111/jmi.12211","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","abstract":[{"lang":"eng","text":"When electron microscopy (EM) was introduced in the 1930s it gave scientists their first look into the nanoworld of cells. Over the last 80 years EM has vastly increased our understanding of the complex cellular structures that underlie the diverse functions that cells need to maintain life. One drawback that has been difficult to overcome was the inherent lack of volume information, mainly due to the limit on the thickness of sections that could be viewed in a transmission electron microscope (TEM). For many years scientists struggled to achieve three-dimensional (3D) EM using serial section reconstructions, TEM tomography, and scanning EM (SEM) techniques such as freeze-fracture. Although each technique yielded some special information, they required a significant amount of time and specialist expertise to obtain even a very small 3D EM dataset. Almost 20 years ago scientists began to exploit SEMs to image blocks of embedded tissues and perform serial sectioning of these tissues inside the SEM chamber. Using first focused ion beams (FIB) and subsequently robotic ultramicrotomes (serial block-face, SBF-SEM) microscopists were able to collect large volumes of 3D EM information at resolutions that could address many important biological questions, and do so in an efficient manner. We present here some examples of 3D EM taken from the many diverse specimens that have been imaged in our core facility. We propose that the next major step forward will be to efficiently correlate functional information obtained using light microscopy (LM) with 3D EM datasets to more completely investigate the important links between cell structures and their functions."}],"issue":"2","type":"journal_article","pubrep_id":"459","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"4872","date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-12T10:11:19Z","checksum":"3649c5372d1644062d728ea9287e367f","file_name":"IST-2016-459-v1+1_KREMER_et_al-2015-Journal_of_Microscopy.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2899898,"creator":"system"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1879","status":"public","ddc":["570"],"title":"Developing 3D SEM in a broad biological context","intvolume":" 259","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2015-08-01T00:00:00Z","publication":"Journal of Microscopy","citation":{"ama":"Kremer A, Lippens S, Bartunkova S, et al. Developing 3D SEM in a broad biological context. Journal of Microscopy. 2015;259(2):80-96. doi:10.1111/jmi.12211","ieee":"A. Kremer et al., “Developing 3D SEM in a broad biological context,” Journal of Microscopy, vol. 259, no. 2. Wiley-Blackwell, pp. 80–96, 2015.","apa":"Kremer, A., Lippens, S., Bartunkova, S., Asselbergh, B., Blanpain, C., Fendrych, M., … Guérin, C. (2015). Developing 3D SEM in a broad biological context. Journal of Microscopy. Wiley-Blackwell. https://doi.org/10.1111/jmi.12211","ista":"Kremer A, Lippens S, Bartunkova S, Asselbergh B, Blanpain C, Fendrych M, Goossens A, Holt M, Janssens S, Krols M, Larsimont J, Mc Guire C, Nowack M, Saelens X, Schertel A, Schepens B, Slezak M, Timmerman V, Theunis C, Van Brempt R, Visser Y, Guérin C. 2015. Developing 3D SEM in a broad biological context. Journal of Microscopy. 259(2), 80–96.","short":"A. Kremer, S. Lippens, S. Bartunkova, B. Asselbergh, C. Blanpain, M. Fendrych, A. Goossens, M. Holt, S. Janssens, M. Krols, J. Larsimont, C. Mc Guire, M. Nowack, X. Saelens, A. Schertel, B. Schepens, M. Slezak, V. Timmerman, C. Theunis, R. Van Brempt, Y. Visser, C. Guérin, Journal of Microscopy 259 (2015) 80–96.","mla":"Kremer, A., et al. “Developing 3D SEM in a Broad Biological Context.” Journal of Microscopy, vol. 259, no. 2, Wiley-Blackwell, 2015, pp. 80–96, doi:10.1111/jmi.12211.","chicago":"Kremer, A, Stefaan Lippens, Sonia Bartunkova, Bob Asselbergh, Cendric Blanpain, Matyas Fendrych, A Goossens, et al. “Developing 3D SEM in a Broad Biological Context.” Journal of Microscopy. Wiley-Blackwell, 2015. https://doi.org/10.1111/jmi.12211."},"page":"80 - 96"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"quality_controlled":"1","doi":"10.1088/1367-2630/17/1/013022","language":[{"iso":"eng"}],"month":"01","acknowledgement":"Support from the Natural Sciences and Engineering Research Council of Canada NSERC (MK and RS) and from the Austrian Science Fund FWF (JY, under project P 22929-N16) is gratefully acknowledged","year":"2015","publisher":"IOP Publishing Ltd.","department":[{"_id":"RoSe"}],"publication_status":"published","author":[{"last_name":"Könenberg","first_name":"Martin","full_name":"Könenberg, Martin"},{"first_name":"Thomas","last_name":"Moser","id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","full_name":"Moser, Thomas"},{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"},{"first_name":"Jakob","last_name":"Yngvason","full_name":"Yngvason, Jakob"}],"volume":17,"date_created":"2018-12-11T11:54:30Z","date_updated":"2021-01-12T06:53:48Z","article_number":"013022","publist_id":"5214","file_date_updated":"2020-07-14T12:45:20Z","citation":{"ieee":"M. Könenberg, T. Moser, R. Seiringer, and J. Yngvason, “Superfluid behavior of a Bose-Einstein condensate in a random potential,” New Journal of Physics, vol. 17. IOP Publishing Ltd., 2015.","apa":"Könenberg, M., Moser, T., Seiringer, R., & Yngvason, J. (2015). Superfluid behavior of a Bose-Einstein condensate in a random potential. New Journal of Physics. IOP Publishing Ltd. https://doi.org/10.1088/1367-2630/17/1/013022","ista":"Könenberg M, Moser T, Seiringer R, Yngvason J. 2015. Superfluid behavior of a Bose-Einstein condensate in a random potential. New Journal of Physics. 17, 013022.","ama":"Könenberg M, Moser T, Seiringer R, Yngvason J. Superfluid behavior of a Bose-Einstein condensate in a random potential. New Journal of Physics. 2015;17. doi:10.1088/1367-2630/17/1/013022","chicago":"Könenberg, Martin, Thomas Moser, Robert Seiringer, and Jakob Yngvason. “Superfluid Behavior of a Bose-Einstein Condensate in a Random Potential.” New Journal of Physics. IOP Publishing Ltd., 2015. https://doi.org/10.1088/1367-2630/17/1/013022.","short":"M. Könenberg, T. Moser, R. Seiringer, J. Yngvason, New Journal of Physics 17 (2015).","mla":"Könenberg, Martin, et al. “Superfluid Behavior of a Bose-Einstein Condensate in a Random Potential.” New Journal of Physics, vol. 17, 013022, IOP Publishing Ltd., 2015, doi:10.1088/1367-2630/17/1/013022."},"publication":"New Journal of Physics","date_published":"2015-01-15T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"15","_id":"1880","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 17","status":"public","title":"Superfluid behavior of a Bose-Einstein condensate in a random potential","ddc":["530"],"pubrep_id":"447","file":[{"creator":"system","content_type":"application/pdf","file_size":768108,"file_name":"IST-2016-447-v1+1_document_1_.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:20Z","date_created":"2018-12-12T10:12:44Z","checksum":"38fdf2b5ac30445e26a5d613abd84b16","file_id":"4963","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"We investigate the relation between Bose-Einstein condensation (BEC) and superfluidity in the ground state of a one-dimensional model of interacting bosons in a strong random potential. We prove rigorously that in a certain parameter regime the superfluid fraction can be arbitrarily small while complete BEC prevails. In another regime there is both complete BEC and complete superfluidity, despite the strong disorder","lang":"eng"}]},{"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1408.1256"}],"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"quality_controlled":"1","doi":"10.1007/978-3-319-15317-9_19","conference":{"start_date":"2014-09-10","location":"Bertinoro, Italy","end_date":"2014-09-12","name":"FACS: Formal Aspects of Component Software"},"language":[{"iso":"eng"}],"month":"01","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) project S11402-N23 (RiSE), and by the Czech Science Foundation, grant No. P202/12/G061.","year":"2015","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer","publication_status":"published","author":[{"first_name":"Uli","last_name":"Fahrenberg","full_name":"Fahrenberg, Uli"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Legay, Axel","first_name":"Axel","last_name":"Legay"},{"full_name":"Traonouez, Louis","first_name":"Louis","last_name":"Traonouez"}],"volume":8997,"date_updated":"2021-01-12T06:53:49Z","date_created":"2018-12-11T11:54:31Z","publist_id":"5216","ec_funded":1,"citation":{"mla":"Fahrenberg, Uli, et al. Compositionality for Quantitative Specifications. Vol. 8997, Springer, 2015, pp. 306–24, doi:10.1007/978-3-319-15317-9_19.","short":"U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.","chicago":"Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,” 8997:306–24. Springer, 2015. https://doi.org/10.1007/978-3-319-15317-9_19.","ama":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. Compositionality for quantitative specifications. In: Vol 8997. Springer; 2015:306-324. doi:10.1007/978-3-319-15317-9_19","ista":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. 2015. Compositionality for quantitative specifications. FACS: Formal Aspects of Component Software, LNCS, vol. 8997, 306–324.","ieee":"U. Fahrenberg, J. Kretinsky, A. Legay, and L. Traonouez, “Compositionality for quantitative specifications,” presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy, 2015, vol. 8997, pp. 306–324.","apa":"Fahrenberg, U., Kretinsky, J., Legay, A., & Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer. https://doi.org/10.1007/978-3-319-15317-9_19"},"page":"306 - 324","date_published":"2015-01-30T00:00:00Z","scopus_import":1,"day":"30","_id":"1882","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 8997","status":"public","title":"Compositionality for quantitative specifications","oa_version":"Preprint","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear various types of quantitative information. Throughout the design process the actions can be further refined and the information made more precise. We show how to compute the results of standard operations on the systems, including the quotient (residual), which has not been previously considered for quantitative non-deterministic systems. Our quantitative framework has close connections to the modal nu-calculus and is compositional with respect to general notions of distances between systems and the standard operations."}]},{"scopus_import":1,"article_processing_charge":"No","day":"02","article_type":"original","citation":{"ama":"Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. Anomalous scaling in an age-dependent branching model. Physical Review E Statistical Nonlinear and Soft Matter Physics. 2015;91(2). doi:10.1103/PhysRevE.91.022803","ista":"Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. 2015. Anomalous scaling in an age-dependent branching model. Physical Review E Statistical Nonlinear and Soft Matter Physics. 91(2), 022803.","ieee":"S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, and K. Klemm, “Anomalous scaling in an age-dependent branching model,” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 91, no. 2. American Institute of Physics, 2015.","apa":"Keller-Schmidt, S., Tugrul, M., Eguíluz, V., Hernandez Garcia, E., & Klemm, K. (2015). Anomalous scaling in an age-dependent branching model. Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics. https://doi.org/10.1103/PhysRevE.91.022803","mla":"Keller-Schmidt, Stephanie, et al. “Anomalous Scaling in an Age-Dependent Branching Model.” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 91, no. 2, 022803, American Institute of Physics, 2015, doi:10.1103/PhysRevE.91.022803.","short":"S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, K. Klemm, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015).","chicago":"Keller-Schmidt, Stephanie, Murat Tugrul, Víctor Eguíluz, Emilio Hernandez Garcia, and Konstantin Klemm. “Anomalous Scaling in an Age-Dependent Branching Model.” Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics, 2015. https://doi.org/10.1103/PhysRevE.91.022803."},"publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","date_published":"2015-02-02T00:00:00Z","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"We introduce a one-parametric family of tree growth models, in which branching probabilities decrease with branch age τ as τ-α. Depending on the exponent α, the scaling of tree depth with tree size n displays a transition between the logarithmic scaling of random trees and an algebraic growth. At the transition (α=1) tree depth grows as (logn)2. This anomalous scaling is in good agreement with the trend observed in evolution of biological species, thus providing a theoretical support for age-dependent speciation and associating it to the occurrence of a critical point.\r\n"}],"intvolume":" 91","status":"public","title":"Anomalous scaling in an age-dependent branching model","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1883","oa_version":"Preprint","month":"02","quality_controlled":"1","oa":1,"external_id":{"arxiv":["1012.3298"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1012.3298"}],"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevE.91.022803","article_number":"022803","publist_id":"5213","publisher":"American Institute of Physics","department":[{"_id":"NiBa"}],"publication_status":"published","year":"2015","volume":91,"date_updated":"2021-01-12T06:53:49Z","date_created":"2018-12-11T11:54:31Z","author":[{"full_name":"Keller-Schmidt, Stephanie","last_name":"Keller-Schmidt","first_name":"Stephanie"},{"first_name":"Murat","last_name":"Tugrul","id":"37C323C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8523-0758","full_name":"Tugrul, Murat"},{"full_name":"Eguíluz, Víctor","last_name":"Eguíluz","first_name":"Víctor"},{"first_name":"Emilio","last_name":"Hernandez Garcia","full_name":"Hernandez Garcia, Emilio"},{"last_name":"Klemm","first_name":"Konstantin","full_name":"Klemm, Konstantin"}]},{"scopus_import":1,"month":"01","day":"24","page":"223 - 238","quality_controlled":"1","citation":{"ieee":"E. Cires Rodriguez and J. Prieto, “Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula,” Journal of Plant Research, vol. 128, no. 2. Springer, pp. 223–238, 2015.","apa":"Cires Rodriguez, E., & Prieto, J. (2015). Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula. Journal of Plant Research. Springer. https://doi.org/10.1007/s10265-014-0691-6","ista":"Cires Rodriguez E, Prieto J. 2015. Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula. Journal of Plant Research. 128(2), 223–238.","ama":"Cires Rodriguez E, Prieto J. Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula. Journal of Plant Research. 2015;128(2):223-238. doi:10.1007/s10265-014-0691-6","chicago":"Cires Rodriguez, Eduardo, and José Prieto. “Phylogenetic Relationships of Petrocoptis A. Braun Ex Endl. (Caryophyllaceae), a Discussed Genus from the Iberian Peninsula.” Journal of Plant Research. Springer, 2015. https://doi.org/10.1007/s10265-014-0691-6.","short":"E. Cires Rodriguez, J. Prieto, Journal of Plant Research 128 (2015) 223–238.","mla":"Cires Rodriguez, Eduardo, and José Prieto. “Phylogenetic Relationships of Petrocoptis A. Braun Ex Endl. (Caryophyllaceae), a Discussed Genus from the Iberian Peninsula.” Journal of Plant Research, vol. 128, no. 2, Springer, 2015, pp. 223–38, doi:10.1007/s10265-014-0691-6."},"publication":"Journal of Plant Research","language":[{"iso":"eng"}],"doi":"10.1007/s10265-014-0691-6","date_published":"2015-01-24T00:00:00Z","type":"journal_article","issue":"2","publist_id":"5217","abstract":[{"text":"Petrocoptis is a small genus of chasmophytic plants endemic to the Iberian Peninsula, with some localized populations in the French Pyrenees. Within the genus, a dozen species have been recognized based on morphological diversity, most of them with limited distribution area, in small populations and frequently with potential threats to their survival. To date, however, a molecular evaluation of the current systematic treatments has not been carried out. The aim of the present study is to infer phylogenetic relationships among its subordinate taxa by using plastidial rps16 intron and nuclear internal transcribed spacer (ITS) DNA sequences; and evaluate the phylogenetic placement of the genus Petrocoptis within the family Caryophyllaceae. The monophyly of Petrocoptis is supported by both ITS and rps16 intron sequence analyses. Furthermore, time estimates using BEAST analyses indicate a Middle to Late Miocene diversification (10.59 Myr, 6.44–15.26 Myr highest posterior densities [HPD], for ITS; 14.30 Myr, 8.61–21.00 Myr HPD, for rps16 intron).","lang":"eng"}],"department":[{"_id":"JiFr"}],"publisher":"Springer","intvolume":" 128","status":"public","publication_status":"published","title":"Phylogenetic relationships of Petrocoptis A. Braun ex Endl. (Caryophyllaceae), a discussed genus from the Iberian Peninsula","_id":"1878","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","oa_version":"None","volume":128,"date_created":"2018-12-11T11:54:30Z","date_updated":"2021-01-12T06:53:47Z","author":[{"id":"2AD56A7A-F248-11E8-B48F-1D18A9856A87","first_name":"Eduardo","last_name":"Cires Rodriguez","full_name":"Cires Rodriguez, Eduardo"},{"full_name":"Prieto, José","first_name":"José","last_name":"Prieto"}]},{"abstract":[{"text":"The concept of positional information is central to our understanding of how cells determine their location in a multicellular structure and thereby their developmental fates. Nevertheless, positional information has neither been defined mathematically nor quantified in a principled way. Here we provide an information-theoretic definition in the context of developmental gene expression patterns and examine the features of expression patterns that affect positional information quantitatively. We connect positional information with the concept of positional error and develop tools to directly measure information and error from experimental data. We illustrate our framework for the case of gap gene expression patterns in the early Drosophila embryo and show how information that is distributed among only four genes is sufficient to determine developmental fates with nearly single-cell resolution. Our approach can be generalized to a variety of different model systems; procedures and examples are discussed in detail. ","lang":"eng"}],"publist_id":"5210","issue":"1","type":"journal_article","date_updated":"2021-01-12T06:53:50Z","date_created":"2018-12-11T11:54:32Z","volume":199,"oa_version":"Preprint","author":[{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gasper","last_name":"Tkacik","full_name":"Tkacik, Gasper"},{"full_name":"Dubuis, Julien","last_name":"Dubuis","first_name":"Julien"},{"last_name":"Petkova","first_name":"Mariela","full_name":"Petkova, Mariela"},{"full_name":"Gregor, Thomas","last_name":"Gregor","first_name":"Thomas"}],"status":"public","title":"Positional information, positional error, and readout precision in morphogenesis: A mathematical framework","publication_status":"published","department":[{"_id":"GaTk"}],"publisher":"Genetics Society of America","intvolume":" 199","year":"2015","_id":"1885","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","day":"01","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2015-01-01T00:00:00Z","doi":"10.1534/genetics.114.171850","quality_controlled":"1","page":"39 - 59","publication":"Genetics","main_file_link":[{"url":"http://arxiv.org/abs/1404.5599","open_access":"1"}],"citation":{"ama":"Tkačik G, Dubuis J, Petkova M, Gregor T. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. Genetics. 2015;199(1):39-59. doi:10.1534/genetics.114.171850","ieee":"G. Tkačik, J. Dubuis, M. Petkova, and T. Gregor, “Positional information, positional error, and readout precision in morphogenesis: A mathematical framework,” Genetics, vol. 199, no. 1. Genetics Society of America, pp. 39–59, 2015.","apa":"Tkačik, G., Dubuis, J., Petkova, M., & Gregor, T. (2015). Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.114.171850","ista":"Tkačik G, Dubuis J, Petkova M, Gregor T. 2015. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. Genetics. 199(1), 39–59.","short":"G. Tkačik, J. Dubuis, M. Petkova, T. Gregor, Genetics 199 (2015) 39–59.","mla":"Tkačik, Gašper, et al. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” Genetics, vol. 199, no. 1, Genetics Society of America, 2015, pp. 39–59, doi:10.1534/genetics.114.171850.","chicago":"Tkačik, Gašper, Julien Dubuis, Mariela Petkova, and Thomas Gregor. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” Genetics. Genetics Society of America, 2015. https://doi.org/10.1534/genetics.114.171850."},"oa":1},{"scopus_import":1,"month":"06","day":"15","citation":{"short":"T.R. Sokolowski, G. Tkačik, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015).","mla":"Sokolowski, Thomas R., and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 91, no. 6, 062710, American Institute of Physics, 2015, doi:10.1103/PhysRevE.91.062710.","chicago":"Sokolowski, Thomas R, and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics, 2015. https://doi.org/10.1103/PhysRevE.91.062710.","ama":"Sokolowski TR, Tkačik G. Optimizing information flow in small genetic networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft Matter Physics. 2015;91(6). doi:10.1103/PhysRevE.91.062710","ieee":"T. R. Sokolowski and G. Tkačik, “Optimizing information flow in small genetic networks. IV. Spatial coupling,” Physical Review E Statistical Nonlinear and Soft Matter Physics, vol. 91, no. 6. American Institute of Physics, 2015.","apa":"Sokolowski, T. R., & Tkačik, G. (2015). Optimizing information flow in small genetic networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft Matter Physics. American Institute of Physics. https://doi.org/10.1103/PhysRevE.91.062710","ista":"Sokolowski TR, Tkačik G. 2015. Optimizing information flow in small genetic networks. IV. Spatial coupling. Physical Review E Statistical Nonlinear and Soft Matter Physics. 91(6), 062710."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.04015"}],"oa":1,"publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","quality_controlled":"1","date_published":"2015-06-15T00:00:00Z","doi":"10.1103/PhysRevE.91.062710","language":[{"iso":"eng"}],"type":"journal_article","article_number":"062710","issue":"6","publist_id":"5145","abstract":[{"text":"We typically think of cells as responding to external signals independently by regulating their gene expression levels, yet they often locally exchange information and coordinate. Can such spatial coupling be of benefit for conveying signals subject to gene regulatory noise? Here we extend our information-theoretic framework for gene regulation to spatially extended systems. As an example, we consider a lattice of nuclei responding to a concentration field of a transcriptional regulator (the "input") by expressing a single diffusible target gene. When input concentrations are low, diffusive coupling markedly improves information transmission; optimal gene activation functions also systematically change. A qualitatively new regulatory strategy emerges where individual cells respond to the input in a nearly step-like fashion that is subsequently averaged out by strong diffusion. While motivated by early patterning events in the Drosophila embryo, our framework is generically applicable to spatially coupled stochastic gene expression models.","lang":"eng"}],"_id":"1940","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 91","department":[{"_id":"GaTk"}],"publisher":"American Institute of Physics","status":"public","publication_status":"published","title":"Optimizing information flow in small genetic networks. IV. Spatial coupling","author":[{"orcid":"0000-0002-1287-3779","id":"3E999752-F248-11E8-B48F-1D18A9856A87","last_name":"Sokolowski","first_name":"Thomas R","full_name":"Sokolowski, Thomas R"},{"full_name":"Tkacik, Gasper","first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"}],"oa_version":"Preprint","volume":91,"date_updated":"2021-01-12T06:54:13Z","date_created":"2018-12-11T11:54:49Z"},{"citation":{"chicago":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” Physics Letters, Section A. Elsevier, 2015. https://doi.org/10.1016/j.physleta.2014.12.010.","mla":"Pausinger, Florian, and Stefan Steinerberger. “On the Distribution of Local Extrema in Quantum Chaos.” Physics Letters, Section A, vol. 379, no. 6, Elsevier, 2015, pp. 535–41, doi:10.1016/j.physleta.2014.12.010.","short":"F. Pausinger, S. Steinerberger, Physics Letters, Section A 379 (2015) 535–541.","ista":"Pausinger F, Steinerberger S. 2015. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 379(6), 535–541.","ieee":"F. Pausinger and S. Steinerberger, “On the distribution of local extrema in quantum chaos,” Physics Letters, Section A, vol. 379, no. 6. Elsevier, pp. 535–541, 2015.","apa":"Pausinger, F., & Steinerberger, S. (2015). On the distribution of local extrema in quantum chaos. Physics Letters, Section A. Elsevier. https://doi.org/10.1016/j.physleta.2014.12.010","ama":"Pausinger F, Steinerberger S. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 2015;379(6):535-541. doi:10.1016/j.physleta.2014.12.010"},"publication":"Physics Letters, Section A","page":"535 - 541","quality_controlled":"1","date_published":"2015-03-06T00:00:00Z","doi":"10.1016/j.physleta.2014.12.010","language":[{"iso":"eng"}],"scopus_import":1,"day":"06","month":"03","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1938","year":"2015","acknowledgement":"F.P. was supported by the Graduate School of IST Austria. S.S. was partially supported by CRC1060 of the DFG\r\nThe authors thank Olga Symonova and Michael Kerber for sharing their implementation of the persistence algorithm. ","department":[{"_id":"HeEd"}],"intvolume":" 379","publisher":"Elsevier","status":"public","publication_status":"published","title":"On the distribution of local extrema in quantum chaos","author":[{"first_name":"Florian","last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian"},{"full_name":"Steinerberger, Stefan","first_name":"Stefan","last_name":"Steinerberger"}],"oa_version":"None","volume":379,"date_updated":"2021-01-12T06:54:12Z","date_created":"2018-12-11T11:54:49Z","type":"journal_article","issue":"6","publist_id":"5152","abstract":[{"text":"We numerically investigate the distribution of extrema of 'chaotic' Laplacian eigenfunctions on two-dimensional manifolds. Our contribution is two-fold: (a) we count extrema on grid graphs with a small number of randomly added edges and show the behavior to coincide with the 1957 prediction of Longuet-Higgins for the continuous case and (b) we compute the regularity of their spatial distribution using discrepancy, which is a classical measure from the theory of Monte Carlo integration. The first part suggests that grid graphs with randomly added edges should behave like two-dimensional surfaces with ergodic geodesic flow; in the second part we show that the extrema are more regularly distributed in space than the grid Z2.","lang":"eng"}]},{"month":"02","day":"01","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2015-02-01T00:00:00Z","doi":"10.1016/j.pbi.2014.12.002","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"page":"116 - 123","quality_controlled":"1","citation":{"chicago":"Rakusová, Hana, Matyas Fendrych, and Jiří Friml. “Intracellular Trafficking and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” Current Opinion in Plant Biology. Elsevier, 2015. https://doi.org/10.1016/j.pbi.2014.12.002.","mla":"Rakusová, Hana, et al. “Intracellular Trafficking and PIN-Mediated Cell Polarity during Tropic Responses in Plants.” Current Opinion in Plant Biology, vol. 23, no. 2, Elsevier, 2015, pp. 116–23, doi:10.1016/j.pbi.2014.12.002.","short":"H. Rakusová, M. Fendrych, J. Friml, Current Opinion in Plant Biology 23 (2015) 116–123.","ista":"Rakusová H, Fendrych M, Friml J. 2015. Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. Current Opinion in Plant Biology. 23(2), 116–123.","apa":"Rakusová, H., Fendrych, M., & Friml, J. (2015). Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. Current Opinion in Plant Biology. Elsevier. https://doi.org/10.1016/j.pbi.2014.12.002","ieee":"H. Rakusová, M. Fendrych, and J. Friml, “Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants,” Current Opinion in Plant Biology, vol. 23, no. 2. Elsevier, pp. 116–123, 2015.","ama":"Rakusová H, Fendrych M, Friml J. Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants. Current Opinion in Plant Biology. 2015;23(2):116-123. doi:10.1016/j.pbi.2014.12.002"},"publication":"Current Opinion in Plant Biology","publist_id":"5140","ec_funded":1,"issue":"2","type":"journal_article","volume":23,"oa_version":"None","date_created":"2018-12-11T11:54:51Z","date_updated":"2021-01-12T06:54:15Z","author":[{"first_name":"Hana","last_name":"Rakusová","full_name":"Rakusová, Hana"},{"full_name":"Fendrych, Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","first_name":"Matyas","last_name":"Fendrych"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"}],"intvolume":" 23","department":[{"_id":"JiFr"}],"publisher":"Elsevier","publication_status":"published","title":"Intracellular trafficking and PIN-mediated cell polarity during tropic responses in plants","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1944","year":"2015","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP); the Agency for Innovation by Science and Technology (IWT) (predoctoral fellowship to H.R.); and the People Programme (Marie Curie Actions) of the European Union"},{"date_published":"2015-01-15T00:00:00Z","citation":{"short":"A. Gupta, T.A. Henzinger, A. Radhakrishna, R. Samanta, T. Tarrach, in:, ACM, 2015, pp. 433–444.","mla":"Gupta, Ashutosh, et al. Succinct Representation of Concurrent Trace Sets. ACM, 2015, pp. 433–44, doi:10.1145/2676726.2677008.","chicago":"Gupta, Ashutosh, Thomas A Henzinger, Arjun Radhakrishna, Roopsha Samanta, and Thorsten Tarrach. “Succinct Representation of Concurrent Trace Sets,” 433–44. ACM, 2015. https://doi.org/10.1145/2676726.2677008.","ama":"Gupta A, Henzinger TA, Radhakrishna A, Samanta R, Tarrach T. Succinct representation of concurrent trace sets. In: ACM; 2015:433-444. doi:10.1145/2676726.2677008","ieee":"A. Gupta, T. A. Henzinger, A. Radhakrishna, R. Samanta, and T. Tarrach, “Succinct representation of concurrent trace sets,” presented at the POPL: Principles of Programming Languages, Mumbai, India, 2015, pp. 433–444.","apa":"Gupta, A., Henzinger, T. A., Radhakrishna, A., Samanta, R., & Tarrach, T. (2015). Succinct representation of concurrent trace sets (pp. 433–444). Presented at the POPL: Principles of Programming Languages, Mumbai, India: ACM. https://doi.org/10.1145/2676726.2677008","ista":"Gupta A, Henzinger TA, Radhakrishna A, Samanta R, Tarrach T. 2015. Succinct representation of concurrent trace sets. POPL: Principles of Programming Languages, 433–444."},"page":"433 - 444","has_accepted_license":"1","day":"15","scopus_import":1,"pubrep_id":"317","oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:45:22Z","date_created":"2018-12-12T10:17:56Z","checksum":"f0d4395b600f410a191256ac0b73af32","file_id":"5314","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":399462,"file_name":"IST-2015-317-v1+1_author_version.pdf","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1992","status":"public","ddc":["005"],"title":"Succinct representation of concurrent trace sets","abstract":[{"lang":"eng","text":"We present a method and a tool for generating succinct representations of sets of concurrent traces. We focus on trace sets that contain all correct or all incorrect permutations of events from a given trace. We represent trace sets as HB-Formulas that are Boolean combinations of happens-before constraints between events. To generate a representation of incorrect interleavings, our method iteratively explores interleavings that violate the specification and gathers generalizations of the discovered interleavings into an HB-Formula; its complement yields a representation of correct interleavings.\r\n\r\nWe claim that our trace set representations can drive diverse verification, fault localization, repair, and synthesis techniques for concurrent programs. We demonstrate this by using our tool in three case studies involving synchronization synthesis, bug summarization, and abstraction refinement based verification. In each case study, our initial experimental results have been promising.\r\n\r\nIn the first case study, we present an algorithm for inferring missing synchronization from an HB-Formula representing correct interleavings of a given trace. The algorithm applies rules to rewrite specific patterns in the HB-Formula into locks, barriers, and wait-notify constructs. In the second case study, we use an HB-Formula representing incorrect interleavings for bug summarization. While the HB-Formula itself is a concise counterexample summary, we present additional inference rules to help identify specific concurrency bugs such as data races, define-use order violations, and two-stage access bugs. In the final case study, we present a novel predicate learning procedure that uses HB-Formulas representing abstract counterexamples to accelerate counterexample-guided abstraction refinement (CEGAR). In each iteration of the CEGAR loop, the procedure refines the abstraction to eliminate multiple spurious abstract counterexamples drawn from the HB-Formula."}],"type":"conference","doi":"10.1145/2676726.2677008","conference":{"location":"Mumbai, India","start_date":"2015-01-15","end_date":"2015-01-17","name":"POPL: Principles of Programming Languages"},"language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","publication_identifier":{"isbn":["978-1-4503-3300-9"]},"month":"01","author":[{"last_name":"Gupta","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"full_name":"Samanta, Roopsha","first_name":"Roopsha","last_name":"Samanta","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87"},{"id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","first_name":"Thorsten","last_name":"Tarrach","full_name":"Tarrach, Thorsten"}],"date_created":"2018-12-11T11:55:05Z","date_updated":"2021-01-12T06:54:33Z","year":"2015","publisher":"ACM","department":[{"_id":"ToHe"}],"publication_status":"published","publist_id":"5091","file_date_updated":"2020-07-14T12:45:22Z"},{"quality_controlled":"1","page":"285 - 296","publication":"Journal of Symbolic Computation","citation":{"ista":"Noren P. 2015. The three-state toric homogeneous Markov chain model has Markov degree two. Journal of Symbolic Computation. 68/Part 2(May-June), 285–296.","apa":"Noren, P. (2015). The three-state toric homogeneous Markov chain model has Markov degree two. Journal of Symbolic Computation. Elsevier. https://doi.org/10.1016/j.jsc.2014.09.014","ieee":"P. Noren, “The three-state toric homogeneous Markov chain model has Markov degree two,” Journal of Symbolic Computation, vol. 68/Part 2, no. May-June. Elsevier, pp. 285–296, 2015.","ama":"Noren P. The three-state toric homogeneous Markov chain model has Markov degree two. Journal of Symbolic Computation. 2015;68/Part 2(May-June):285-296. doi:10.1016/j.jsc.2014.09.014","chicago":"Noren, Patrik. “The Three-State Toric Homogeneous Markov Chain Model Has Markov Degree Two.” Journal of Symbolic Computation. Elsevier, 2015. https://doi.org/10.1016/j.jsc.2014.09.014.","mla":"Noren, Patrik. “The Three-State Toric Homogeneous Markov Chain Model Has Markov Degree Two.” Journal of Symbolic Computation, vol. 68/Part 2, no. May-June, Elsevier, 2015, pp. 285–96, doi:10.1016/j.jsc.2014.09.014.","short":"P. Noren, Journal of Symbolic Computation 68/Part 2 (2015) 285–296."},"main_file_link":[{"url":"http://arxiv.org/abs/1207.0077","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"date_published":"2015-05-01T00:00:00Z","doi":"10.1016/j.jsc.2014.09.014","scopus_import":1,"day":"01","month":"05","publication_status":"published","status":"public","title":"The three-state toric homogeneous Markov chain model has Markov degree two","publisher":"Elsevier","department":[{"_id":"CaUh"}],"year":"2015","_id":"1997","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:55:07Z","date_updated":"2021-01-12T06:54:35Z","volume":"68/Part 2","oa_version":"Preprint","author":[{"full_name":"Noren, Patrik","first_name":"Patrik","last_name":"Noren","id":"46870C74-F248-11E8-B48F-1D18A9856A87"}],"type":"journal_article","abstract":[{"text":"We prove that the three-state toric homogeneous Markov chain model has Markov degree two. In algebraic terminology this means, that a certain class of toric ideals is generated by quadratic binomials. This was conjectured by Haws, Martin del Campo, Takemura and Yoshida, who proved that they are generated by degree six binomials.","lang":"eng"}],"issue":"May-June","publist_id":"5082"},{"publist_id":"5068","department":[{"_id":"CaUh"}],"publisher":"Wiley","publication_status":"published","year":"2015","acknowledgement":"Part of the material presented here was contained in the PhD thesis of the first author to which the second author and Thomas Richardson were advisers. The authors wish to thank him for several comments and suggestions. We also thank the reviewers and the Associate Editor for helpful comments. The proof of Proposition 1 uses the idea of Olga Klimova, to whom the authors are also indebted. The second author was supported in part by Grant K-106154 from the Hungarian National Scientific Research Fund (OTKA).","volume":42,"date_updated":"2021-01-12T06:54:41Z","date_created":"2018-12-11T11:55:11Z","author":[{"full_name":"Klimova, Anna","last_name":"Klimova","first_name":"Anna","id":"31934120-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rudas","first_name":"Tamás","full_name":"Rudas, Tamás"}],"month":"09","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1307.3282","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1111/sjos.12139","type":"journal_article","issue":"3","abstract":[{"text":"The paper describes a generalized iterative proportional fitting procedure that can be used for maximum likelihood estimation in a special class of the general log-linear model. The models in this class, called relational, apply to multivariate discrete sample spaces that do not necessarily have a Cartesian product structure and may not contain an overall effect. When applied to the cell probabilities, the models without the overall effect are curved exponential families and the values of the sufficient statistics are reproduced by the MLE only up to a constant of proportionality. The paper shows that Iterative Proportional Fitting, Generalized Iterative Scaling, and Improved Iterative Scaling fail to work for such models. The algorithm proposed here is based on iterated Bregman projections. As a by-product, estimates of the multiplicative parameters are also obtained. An implementation of the algorithm is available as an R-package.","lang":"eng"}],"intvolume":" 42","title":"Iterative scaling in curved exponential families","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2008","oa_version":"Preprint","scopus_import":1,"day":"01","page":"832 - 847","citation":{"ama":"Klimova A, Rudas T. Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. 2015;42(3):832-847. doi:10.1111/sjos.12139","ieee":"A. Klimova and T. Rudas, “Iterative scaling in curved exponential families,” Scandinavian Journal of Statistics, vol. 42, no. 3. Wiley, pp. 832–847, 2015.","apa":"Klimova, A., & Rudas, T. (2015). Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. Wiley. https://doi.org/10.1111/sjos.12139","ista":"Klimova A, Rudas T. 2015. Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. 42(3), 832–847.","short":"A. Klimova, T. Rudas, Scandinavian Journal of Statistics 42 (2015) 832–847.","mla":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” Scandinavian Journal of Statistics, vol. 42, no. 3, Wiley, 2015, pp. 832–47, doi:10.1111/sjos.12139.","chicago":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” Scandinavian Journal of Statistics. Wiley, 2015. https://doi.org/10.1111/sjos.12139."},"publication":"Scandinavian Journal of Statistics","date_published":"2015-09-01T00:00:00Z"},{"article_processing_charge":"No","day":"23","scopus_import":1,"date_published":"2015-06-23T00:00:00Z","citation":{"ama":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. 2015;24(3):261-269. doi:10.1080/10586458.2014.980044","apa":"Hein, N., Hillar, C., Martin del Campo Sanchez, A., Sottile, F., & Teitler, Z. (2015). The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. Taylor & Francis. https://doi.org/10.1080/10586458.2014.980044","ieee":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, and Z. Teitler, “The monotone secant conjecture in the real Schubert calculus,” Experimental Mathematics, vol. 24, no. 3. Taylor & Francis, pp. 261–269, 2015.","ista":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. 2015. The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. 24(3), 261–269.","short":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, Z. Teitler, Experimental Mathematics 24 (2015) 261–269.","mla":"Hein, Nicolas, et al. “The Monotone Secant Conjecture in the Real Schubert Calculus.” Experimental Mathematics, vol. 24, no. 3, Taylor & Francis, 2015, pp. 261–69, doi:10.1080/10586458.2014.980044.","chicago":"Hein, Nicolas, Christopher Hillar, Abraham Martin del Campo Sanchez, Frank Sottile, and Zach Teitler. “The Monotone Secant Conjecture in the Real Schubert Calculus.” Experimental Mathematics. Taylor & Francis, 2015. https://doi.org/10.1080/10586458.2014.980044."},"publication":"Experimental Mathematics","page":"261 - 269","issue":"3","abstract":[{"lang":"eng","text":"The monotone secant conjecture posits a rich class of polynomial systems, all of whose solutions are real. These systems come from the Schubert calculus on flag manifolds, and the monotone secant conjecture is a compelling generalization of the Shapiro conjecture for Grassmannians (Theorem of Mukhin, Tarasov, and Varchenko). We present some theoretical evidence for this conjecture, as well as computational evidence obtained by 1.9 teraHertz-years of computing, and we discuss some of the phenomena we observed in our data. "}],"type":"journal_article","oa_version":"Preprint","_id":"2006","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 24","title":"The monotone secant conjecture in the real Schubert calculus","status":"public","month":"06","doi":"10.1080/10586458.2014.980044","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.3436"}],"oa":1,"quality_controlled":"1","publist_id":"5070","author":[{"last_name":"Hein","first_name":"Nicolas","full_name":"Hein, Nicolas"},{"full_name":"Hillar, Christopher","first_name":"Christopher","last_name":"Hillar"},{"full_name":"Martin Del Campo Sanchez, Abraham","id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","last_name":"Martin Del Campo Sanchez","first_name":"Abraham"},{"full_name":"Sottile, Frank","first_name":"Frank","last_name":"Sottile"},{"full_name":"Teitler, Zach","last_name":"Teitler","first_name":"Zach"}],"volume":24,"date_updated":"2021-01-12T06:54:40Z","date_created":"2018-12-11T11:55:10Z","year":"2015","department":[{"_id":"CaUh"}],"publisher":"Taylor & Francis","publication_status":"published"},{"issue":"7","publist_id":"5062","abstract":[{"lang":"eng","text":"The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribution can be quantified with various measures, leading to different concepts of strong-faithfulness. Lower and upper bounds for the proportions of distributions that do not satisfy strong-faithfulness are computed for different parameterizations and measures of association."}],"type":"journal_article","author":[{"full_name":"Klimova, Anna","last_name":"Klimova","first_name":"Anna","id":"31934120-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","first_name":"Caroline"},{"first_name":"Tamás","last_name":"Rudas","full_name":"Rudas, Tamás"}],"oa_version":"Preprint","volume":87,"date_updated":"2021-01-12T06:54:43Z","date_created":"2018-12-11T11:55:13Z","_id":"2014","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","department":[{"_id":"CaUh"}],"publisher":"Elsevier","intvolume":" 87","publication_status":"published","title":"Faithfulness and learning hypergraphs from discrete distributions","status":"public","month":"07","day":"01","scopus_import":1,"doi":"10.1016/j.csda.2015.01.017","date_published":"2015-07-01T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.6617"}],"citation":{"ama":"Klimova A, Uhler C, Rudas T. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. 2015;87(7):57-72. doi:10.1016/j.csda.2015.01.017","ista":"Klimova A, Uhler C, Rudas T. 2015. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. 87(7), 57–72.","ieee":"A. Klimova, C. Uhler, and T. Rudas, “Faithfulness and learning hypergraphs from discrete distributions,” Computational Statistics & Data Analysis, vol. 87, no. 7. Elsevier, pp. 57–72, 2015.","apa":"Klimova, A., Uhler, C., & Rudas, T. (2015). Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. Elsevier. https://doi.org/10.1016/j.csda.2015.01.017","mla":"Klimova, Anna, et al. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” Computational Statistics & Data Analysis, vol. 87, no. 7, Elsevier, 2015, pp. 57–72, doi:10.1016/j.csda.2015.01.017.","short":"A. Klimova, C. Uhler, T. Rudas, Computational Statistics & Data Analysis 87 (2015) 57–72.","chicago":"Klimova, Anna, Caroline Uhler, and Tamás Rudas. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” Computational Statistics & Data Analysis. Elsevier, 2015. https://doi.org/10.1016/j.csda.2015.01.017."},"oa":1,"publication":"Computational Statistics & Data Analysis","page":"57 - 72","quality_controlled":"1"},{"date_created":"2018-12-11T11:55:17Z","date_updated":"2021-01-12T06:54:48Z","volume":1853,"author":[{"first_name":"Daiki","last_name":"Kawada","full_name":"Kawada, Daiki"},{"full_name":"Kobayashi, Hiromu","first_name":"Hiromu","last_name":"Kobayashi"},{"first_name":"Tsuyoshi","last_name":"Tomita","full_name":"Tomita, Tsuyoshi"},{"full_name":"Nakata, Eisuke","last_name":"Nakata","first_name":"Eisuke"},{"first_name":"Makoto","last_name":"Nagano","full_name":"Nagano, Makoto"},{"full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","first_name":"Daria E"},{"last_name":"Toshima","first_name":"Junko","full_name":"Toshima, Junko"},{"first_name":"Jiro","last_name":"Toshimaa","full_name":"Toshimaa, Jiro"}],"publication_status":"published","publisher":"Elsevier","department":[{"_id":"DaSi"}],"year":"2015","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","file_date_updated":"2020-07-14T12:45:25Z","publist_id":"5047","language":[{"iso":"eng"}],"doi":"10.1016/j.bbamcr.2014.10.009","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"month":"01","file":[{"access_level":"open_access","file_name":"IST-2016-615-v1+1_BBAMCR.pdf","content_type":"application/pdf","file_size":926685,"creator":"system","relation":"main_file","file_id":"4936","checksum":"5bb328edebb6a91337cadd7d63f961b7","date_created":"2018-12-12T10:12:18Z","date_updated":"2020-07-14T12:45:25Z"}],"oa_version":"Submitted Version","pubrep_id":"615","title":"The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins","status":"public","ddc":["570"],"intvolume":" 1853","_id":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Small GTP-binding proteins of the Ras superfamily play diverse roles in intracellular trafficking. Among them, the Rab, Arf, and Rho families function in successive steps of vesicle transport, in forming vesicles from donor membranes, directing vesicle trafficking toward target membranes and docking vesicles onto target membranes. These proteins act as molecular switches that are controlled by a cycle of GTP binding and hydrolysis regulated by guanine nucleotide exchange factors (GEFs) and GTPase-activating proteins (GAPs). In this study we explored the role of GAPs in the regulation of the endocytic pathway using fluorescently labeled yeast mating pheromone α-factor. Among 25 non-essential GAP mutants, we found that deletion of the GLO3 gene, encoding Arf-GAP protein, caused defective internalization of fluorescently labeled α-factor. Quantitative analysis revealed that glo3Δ cells show defective α-factor binding to the cell surface. Interestingly, Ste2p, the α-factor receptor, was mis-localized from the plasma membrane to the vacuole in glo3Δ cells. Domain deletion mutants of Glo3p revealed that a GAP-independent function, as well as the GAP activity, of Glo3p is important for both α-factor binding and Ste2p localization at the cell surface. Additionally, we found that deletion of the GLO3 gene affects the size and number of Arf1p-residing Golgi compartments and causes a defect in transport from the TGN to the plasma membrane. Furthermore, we demonstrated that glo3Δ cells were defective in the late endosome-to-TGN transport pathway, but not in the early endosome-to-TGN transport pathway. These findings suggest novel roles for Arf-GAP Glo3p in endocytic recycling of cell surface proteins."}],"issue":"1","type":"journal_article","date_published":"2015-01-01T00:00:00Z","page":"144 - 156","publication":"Biochimica et Biophysica Acta - Molecular Cell Research","citation":{"short":"D. Kawada, H. Kobayashi, T. Tomita, E. Nakata, M. Nagano, D.E. Siekhaus, J. Toshima, J. Toshimaa, Biochimica et Biophysica Acta - Molecular Cell Research 1853 (2015) 144–156.","mla":"Kawada, Daiki, et al. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no. 1, Elsevier, 2015, pp. 144–56, doi:10.1016/j.bbamcr.2014.10.009.","chicago":"Kawada, Daiki, Hiromu Kobayashi, Tsuyoshi Tomita, Eisuke Nakata, Makoto Nagano, Daria E Siekhaus, Junko Toshima, and Jiro Toshimaa. “The Yeast Arf-GAP Glo3p Is Required for the Endocytic Recycling of Cell Surface Proteins.” Biochimica et Biophysica Acta - Molecular Cell Research. Elsevier, 2015. https://doi.org/10.1016/j.bbamcr.2014.10.009.","ama":"Kawada D, Kobayashi H, Tomita T, et al. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research. 2015;1853(1):144-156. doi:10.1016/j.bbamcr.2014.10.009","apa":"Kawada, D., Kobayashi, H., Tomita, T., Nakata, E., Nagano, M., Siekhaus, D. E., … Toshimaa, J. (2015). The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research. Elsevier. https://doi.org/10.1016/j.bbamcr.2014.10.009","ieee":"D. Kawada et al., “The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins,” Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no. 1. Elsevier, pp. 144–156, 2015.","ista":"Kawada D, Kobayashi H, Tomita T, Nakata E, Nagano M, Siekhaus DE, Toshima J, Toshimaa J. 2015. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. Biochimica et Biophysica Acta - Molecular Cell Research. 1853(1), 144–156."},"day":"01","has_accepted_license":"1","scopus_import":1},{"day":"01","month":"01","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2015-01-01T00:00:00Z","doi":"10.1016/j.compfluid.2014.09.021","quality_controlled":"1","page":"1 - 11","publication":"Computers and Fluids","oa":1,"citation":{"mla":"Shi, Liang, et al. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” Computers and Fluids, vol. 106, no. 1, Elsevier, 2015, pp. 1–11, doi:10.1016/j.compfluid.2014.09.021.","short":"L. Shi, M. Rampp, B. Hof, M. Avila, Computers and Fluids 106 (2015) 1–11.","chicago":"Shi, Liang, Markus Rampp, Björn Hof, and Marc Avila. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” Computers and Fluids. Elsevier, 2015. https://doi.org/10.1016/j.compfluid.2014.09.021.","ama":"Shi L, Rampp M, Hof B, Avila M. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. Computers and Fluids. 2015;106(1):1-11. doi:10.1016/j.compfluid.2014.09.021","ista":"Shi L, Rampp M, Hof B, Avila M. 2015. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. Computers and Fluids. 106(1), 1–11.","ieee":"L. Shi, M. Rampp, B. Hof, and M. Avila, “A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow,” Computers and Fluids, vol. 106, no. 1. Elsevier, pp. 1–11, 2015.","apa":"Shi, L., Rampp, M., Hof, B., & Avila, M. (2015). A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. Computers and Fluids. Elsevier. https://doi.org/10.1016/j.compfluid.2014.09.021"},"main_file_link":[{"url":"http://arxiv.org/abs/1311.2481","open_access":"1"}],"abstract":[{"text":"A hybrid-parallel direct-numerical-simulation method with application to turbulent Taylor-Couette flow is presented. The Navier-Stokes equations are discretized in cylindrical coordinates with the spectral Fourier-Galerkin method in the axial and azimuthal directions, and high-order finite differences in the radial direction. Time is advanced by a second-order, semi-implicit projection scheme, which requires the solution of five Helmholtz/Poisson equations, avoids staggered grids and renders very small slip velocities. Nonlinear terms are evaluated with the pseudospectral method. The code is parallelized using a hybrid MPI-OpenMP strategy, which, compared with a flat MPI parallelization, is simpler to implement, allows to reduce inter-node communications and MPI overhead that become relevant at high processor-core counts, and helps to contain the memory footprint. A strong scaling study shows that the hybrid code maintains scalability up to more than 20,000 processor cores and thus allows to perform simulations at higher resolutions than previously feasible. In particular, it opens up the possibility to simulate turbulent Taylor-Couette flows at Reynolds numbers up to O(105). This enables to probe hydrodynamic turbulence in Keplerian flows in experimentally relevant regimes.","lang":"eng"}],"issue":"1","publist_id":"5042","type":"journal_article","date_created":"2018-12-11T11:55:18Z","date_updated":"2021-01-12T06:54:51Z","oa_version":"Preprint","volume":106,"author":[{"first_name":"Liang","last_name":"Shi","id":"374A3F1A-F248-11E8-B48F-1D18A9856A87","full_name":"Shi, Liang"},{"full_name":"Rampp, Markus","last_name":"Rampp","first_name":"Markus"},{"first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn"},{"last_name":"Avila","first_name":"Marc","full_name":"Avila, Marc"}],"title":"A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow","publication_status":"published","status":"public","intvolume":" 106","publisher":"Elsevier","department":[{"_id":"BjHo"}],"_id":"2030","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"10","doi":"10.1007/s10208-014-9223-y","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","name":"Topological Complex Systems","call_identifier":"FP7"}],"file_date_updated":"2020-07-14T12:45:26Z","publist_id":"5022","ec_funded":1,"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"first_name":"Grzegorz","last_name":"Jablonski","id":"4483EF78-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3536-9866","full_name":"Jablonski, Grzegorz"},{"last_name":"Mrozek","first_name":"Marian","full_name":"Mrozek, Marian"}],"date_created":"2018-12-11T11:55:20Z","date_updated":"2021-01-12T06:54:53Z","volume":15,"acknowledgement":"This research is partially supported by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by the Russian Government under mega project 11.G34.31.0053, and by the Polish National Science Center under Grant No. N201 419639.","year":"2015","publication_status":"published","publisher":"Springer","department":[{"_id":"HeEd"}],"day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2015-10-01T00:00:00Z","publication":"Foundations of Computational Mathematics","citation":{"ieee":"H. Edelsbrunner, G. Jablonski, and M. Mrozek, “The persistent homology of a self-map,” Foundations of Computational Mathematics, vol. 15, no. 5. Springer, pp. 1213–1244, 2015.","apa":"Edelsbrunner, H., Jablonski, G., & Mrozek, M. (2015). The persistent homology of a self-map. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-014-9223-y","ista":"Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244.","ama":"Edelsbrunner H, Jablonski G, Mrozek M. The persistent homology of a self-map. Foundations of Computational Mathematics. 2015;15(5):1213-1244. doi:10.1007/s10208-014-9223-y","chicago":"Edelsbrunner, Herbert, Grzegorz Jablonski, and Marian Mrozek. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics. Springer, 2015. https://doi.org/10.1007/s10208-014-9223-y.","short":"H. Edelsbrunner, G. Jablonski, M. Mrozek, Foundations of Computational Mathematics 15 (2015) 1213–1244.","mla":"Edelsbrunner, Herbert, et al. “The Persistent Homology of a Self-Map.” Foundations of Computational Mathematics, vol. 15, no. 5, Springer, 2015, pp. 1213–44, doi:10.1007/s10208-014-9223-y."},"page":"1213 - 1244","abstract":[{"text":"Considering a continuous self-map and the induced endomorphism on homology, we study the eigenvalues and eigenspaces of the latter. Taking a filtration of representations, we define the persistence of the eigenspaces, effectively introducing a hierarchical organization of the map. The algorithm that computes this information for a finite sample is proved to be stable, and to give the correct answer for a sufficiently dense sample. Results computed with an implementation of the algorithm provide evidence of its practical utility.\r\n","lang":"eng"}],"issue":"5","type":"journal_article","pubrep_id":"486","file":[{"creator":"system","content_type":"application/pdf","file_size":1317546,"file_name":"IST-2016-486-v1+1_s10208-014-9223-y.pdf","access_level":"open_access","date_created":"2018-12-12T10:08:10Z","date_updated":"2020-07-14T12:45:26Z","checksum":"3566f3a8b0c1bc550e62914a88c584ff","file_id":"4670","relation":"main_file"}],"oa_version":"Published Version","_id":"2035","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The persistent homology of a self-map","ddc":["000"],"status":"public","intvolume":" 15"},{"scopus_import":1,"day":"01","publication":" Information Processing Letters","citation":{"chicago":"Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” Information Processing Letters. Elsevier, 2015. https://doi.org/10.1016/j.ipl.2014.09.001.","short":"B. Bérard, K. Chatterjee, N. Sznajder, Information Processing Letters 115 (2015) 52–59.","mla":"Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.” Information Processing Letters, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:10.1016/j.ipl.2014.09.001.","apa":"Bérard, B., Chatterjee, K., & Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2014.09.001","ieee":"B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” Information Processing Letters, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.","ista":"Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 52–59.","ama":"Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes. Information Processing Letters. 2015;115(1):52-59. doi:10.1016/j.ipl.2014.09.001"},"page":"52 - 59","date_published":"2015-01-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non-deterministicchoice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and ω-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non-opaquebecomes decidable for a restricted class of ω-regular secrets, as well as for all ω-regular secrets under finite-memory schedulers.","lang":"eng"}],"issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2034","status":"public","title":"Probabilistic opacity for Markov decision processes","intvolume":" 115","oa_version":"Preprint","month":"01","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4225"}],"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"doi":"10.1016/j.ipl.2014.09.001","language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"5025","year":"2015","publication_status":"published","publisher":"Elsevier","department":[{"_id":"KrCh"}],"author":[{"last_name":"Bérard","first_name":"Béatrice","full_name":"Bérard, Béatrice"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Sznajder","first_name":"Nathalie","full_name":"Sznajder, Nathalie"}],"date_created":"2018-12-11T11:55:20Z","date_updated":"2021-01-12T06:54:52Z","volume":115},{"type":"journal_article","publist_id":"4951","issue":"2","abstract":[{"text":"We study the spectrum of a large system of N identical bosons interacting via a two-body potential with strength 1/N. In this mean-field regime, Bogoliubov's theory predicts that the spectrum of the N-particle Hamiltonian can be approximated by that of an effective quadratic Hamiltonian acting on Fock space, which describes the fluctuations around a condensed state. Recently, Bogoliubov's theory has been justified rigorously in the case that the low-energy eigenvectors of the N-particle Hamiltonian display complete condensation in the unique minimizer of the corresponding Hartree functional. In this paper, we shall justify Bogoliubov's theory for the high-energy part of the spectrum of the N-particle Hamiltonian corresponding to (non-linear) excited states of the Hartree functional. Moreover, we shall extend the existing results on the excitation spectrum to the case of non-uniqueness and/or degeneracy of the Hartree minimizer. In particular, the latter covers the case of rotating Bose gases, when the rotation speed is large enough to break the symmetry and to produce multiple quantized vortices in the Hartree minimizer. ","lang":"eng"}],"department":[{"_id":"RoSe"}],"publisher":"Springer","intvolume":" 215","title":"Collective excitations of Bose gases in the mean-field regime","status":"public","publication_status":"published","year":"2015","_id":"2085","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":215,"oa_version":"Preprint","date_updated":"2021-01-12T06:55:13Z","date_created":"2018-12-11T11:55:37Z","author":[{"first_name":"Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Nam, Phan"},{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert"}],"scopus_import":1,"day":"01","month":"02","page":"381 - 417","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1402.1153","open_access":"1"}],"citation":{"short":"P. Nam, R. Seiringer, Archive for Rational Mechanics and Analysis 215 (2015) 381–417.","mla":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” Archive for Rational Mechanics and Analysis, vol. 215, no. 2, Springer, 2015, pp. 381–417, doi:10.1007/s00205-014-0781-6.","chicago":"Nam, Phan, and Robert Seiringer. “Collective Excitations of Bose Gases in the Mean-Field Regime.” Archive for Rational Mechanics and Analysis. Springer, 2015. https://doi.org/10.1007/s00205-014-0781-6.","ama":"Nam P, Seiringer R. Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. 2015;215(2):381-417. doi:10.1007/s00205-014-0781-6","apa":"Nam, P., & Seiringer, R. (2015). Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-014-0781-6","ieee":"P. Nam and R. Seiringer, “Collective excitations of Bose gases in the mean-field regime,” Archive for Rational Mechanics and Analysis, vol. 215, no. 2. Springer, pp. 381–417, 2015.","ista":"Nam P, Seiringer R. 2015. Collective excitations of Bose gases in the mean-field regime. Archive for Rational Mechanics and Analysis. 215(2), 381–417."},"oa":1,"publication":"Archive for Rational Mechanics and Analysis","language":[{"iso":"eng"}],"date_published":"2015-02-01T00:00:00Z","doi":"10.1007/s00205-014-0781-6"},{"issue":"3","publist_id":"4818","abstract":[{"lang":"eng","text":"We consider the spectral statistics of large random band matrices on mesoscopic energy scales. We show that the correlation function of the local eigenvalue density exhibits a universal power law behaviour that differs from the Wigner-Dyson- Mehta statistics. This law had been predicted in the physics literature by Altshuler and Shklovskii in (Zh Eksp Teor Fiz (Sov Phys JETP) 91(64):220(127), 1986); it describes the correlations of the eigenvalue density in general metallic sampleswith weak disorder. Our result rigorously establishes the Altshuler-Shklovskii formulas for band matrices. In two dimensions, where the leading term vanishes owing to an algebraic cancellation, we identify the first non-vanishing term and show that it differs substantially from the prediction of Kravtsov and Lerner in (Phys Rev Lett 74:2563-2566, 1995). The proof is given in the current paper and its companion (Ann. H. Poincaré. arXiv:1309.5107, 2014). "}],"type":"journal_article","oa_version":"Preprint","volume":333,"date_updated":"2021-01-12T06:55:43Z","date_created":"2018-12-11T11:56:05Z","author":[{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Knowles, Antti","first_name":"Antti","last_name":"Knowles"}],"intvolume":" 333","publisher":"Springer","department":[{"_id":"LaEr"}],"status":"public","publication_status":"published","title":"The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case","year":"2015","_id":"2166","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","month":"02","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2015-02-01T00:00:00Z","doi":"10.1007/s00220-014-2119-5","page":"1365 - 1416","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1309.5106","open_access":"1"}],"oa":1,"citation":{"mla":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” Communications in Mathematical Physics, vol. 333, no. 3, Springer, 2015, pp. 1365–416, doi:10.1007/s00220-014-2119-5.","short":"L. Erdös, A. Knowles, Communications in Mathematical Physics 333 (2015) 1365–1416.","chicago":"Erdös, László, and Antti Knowles. “The Altshuler-Shklovskii Formulas for Random Band Matrices I: The Unimodular Case.” Communications in Mathematical Physics. Springer, 2015. https://doi.org/10.1007/s00220-014-2119-5.","ama":"Erdös L, Knowles A. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. 2015;333(3):1365-1416. doi:10.1007/s00220-014-2119-5","ista":"Erdös L, Knowles A. 2015. The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. 333(3), 1365–1416.","apa":"Erdös, L., & Knowles, A. (2015). The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-014-2119-5","ieee":"L. Erdös and A. Knowles, “The Altshuler-Shklovskii formulas for random band matrices I: the unimodular case,” Communications in Mathematical Physics, vol. 333, no. 3. Springer, pp. 1365–1416, 2015."},"publication":"Communications in Mathematical Physics"},{"license":"https://creativecommons.org/licenses/by-nd/4.0/","file_date_updated":"2020-07-14T12:45:17Z","ec_funded":1,"publist_id":"5271","article_number":"20","date_updated":"2023-02-23T10:38:13Z","date_created":"2018-12-11T11:54:15Z","volume":11,"author":[{"full_name":"Chakraborty, Soham","last_name":"Chakraborty","first_name":"Soham"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Sezgin","first_name":"Ali","full_name":"Sezgin, Ali"},{"first_name":"Viktor","last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor"}],"related_material":{"record":[{"id":"2328","relation":"earlier_version","status":"public"}]},"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"International Federation of Computational Logic","year":"2015","month":"04","language":[{"iso":"eng"}],"doi":"10.2168/LMCS-11(1:20)2015","quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"oa":1,"abstract":[{"text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. ","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:45:17Z","date_created":"2018-12-12T10:11:27Z","checksum":"7370e164d0a731f442424a92669efc34","relation":"main_file","file_id":"4881","file_size":380203,"content_type":"application/pdf","creator":"system","file_name":"IST-2015-390-v1+1_1502.07639.pdf","access_level":"open_access"}],"pubrep_id":"390","status":"public","ddc":["000"],"title":"Aspect-oriented linearizability proofs","intvolume":" 11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1832","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":1,"date_published":"2015-04-01T00:00:00Z","article_type":"original","publication":"Logical Methods in Computer Science","citation":{"short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015).","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science, vol. 11, no. 1, 20, International Federation of Computational Logic, 2015, doi:10.2168/LMCS-11(1:20)2015.","chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science. International Federation of Computational Logic, 2015. https://doi.org/10.2168/LMCS-11(1:20)2015.","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 2015;11(1). doi:10.2168/LMCS-11(1:20)2015","apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.2168/LMCS-11(1:20)2015","ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” Logical Methods in Computer Science, vol. 11, no. 1. International Federation of Computational Logic, 2015.","ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20."}},{"quality_controlled":"1","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1311.4219","open_access":"1"}],"external_id":{"arxiv":["1311.4219"]},"language":[{"iso":"eng"}],"doi":"10.1137/130945648","month":"02","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"SIAM","year":"2015","date_updated":"2023-02-23T10:46:30Z","date_created":"2018-12-11T11:56:41Z","volume":44,"author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Thapper","first_name":"Johan","full_name":"Thapper, Johan"},{"full_name":"Živný, Stanislav","first_name":"Stanislav","last_name":"Živný"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2518"}]},"publist_id":"4673","page":"1 - 36","publication":"SIAM Journal on Computing","citation":{"chicago":"Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2015. https://doi.org/10.1137/130945648.","short":"V. Kolmogorov, J. Thapper, S. Živný, SIAM Journal on Computing 44 (2015) 1–36.","mla":"Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648.","ieee":"V. Kolmogorov, J. Thapper, and S. Živný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM, pp. 1–36, 2015.","apa":"Kolmogorov, V., Thapper, J., & Živný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/130945648","ista":"Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.","ama":"Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 2015;44(1):1-36. doi:10.1137/130945648"},"date_published":"2015-02-01T00:00:00Z","scopus_import":1,"day":"01","status":"public","title":"The power of linear programming for general-valued CSPs","intvolume":" 44","_id":"2271","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. Finite-valued constraint languages contain functions that take on rational costs and general-valued constraint languages contain functions that take on rational or infinite costs. An instance of the problem is specified by a sum of functions from the language with the goal to minimise the sum. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs).\r\nOur main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation (BLP). For a general-valued constraint language Γ, BLP is a decision procedure for Γ if and only if Γ admits a symmetric fractional polymorphism of every arity. For a finite-valued constraint language Γ, BLP is a decision procedure if and only if Γ admits a symmetric fractional polymorphism of some arity, or equivalently, if Γ admits a symmetric fractional polymorphism of arity 2.\r\nUsing these results, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) submodular on arbitrary lattices; (2) bisubmodular (also known as k-submodular) on arbitrary finite domains; (3) weakly (and hence strongly) tree-submodular on arbitrary trees. "}],"issue":"1"},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1302.2434"}],"citation":{"ama":"Browning TD, Munshi R. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 2015;27(4):2025-2050. doi:10.1515/forum-2013-6024","ieee":"T. D. Browning and R. Munshi, “Pairs of diagonal quadratic forms and linear correlations among sums of two squares,” Forum Mathematicum, vol. 27, no. 4. Walter de Gruyter GmbH, pp. 2025–2050, 2015.","apa":"Browning, T. D., & Munshi, R. (2015). Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. Walter de Gruyter GmbH. https://doi.org/10.1515/forum-2013-6024","ista":"Browning TD, Munshi R. 2015. Pairs of diagonal quadratic forms and linear correlations among sums of two squares. Forum Mathematicum. 27(4), 2025–2050.","short":"T.D. Browning, R. Munshi, Forum Mathematicum 27 (2015) 2025–2050.","mla":"Browning, Timothy D., and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum, vol. 27, no. 4, Walter de Gruyter GmbH, 2015, pp. 2025–50, doi:10.1515/forum-2013-6024.","chicago":"Browning, Timothy D, and Ritabrata Munshi. “Pairs of Diagonal Quadratic Forms and Linear Correlations among Sums of Two Squares.” Forum Mathematicum. Walter de Gruyter GmbH, 2015. https://doi.org/10.1515/forum-2013-6024."},"publication":"Forum Mathematicum","page":"2025 - 2050","quality_controlled":0,"doi":"10.1515/forum-2013-6024","date_published":"2015-07-10T00:00:00Z","day":"10","month":"07","_id":"257","year":"2015","acknowledgement":"While working on this paper the first author was supported by ERC grant 306457 and the second author was supported by SwarnaJayanti Fellowship 2011–12, DST, Government of India.","publisher":"Walter de Gruyter GmbH","intvolume":" 27","title":"Pairs of diagonal quadratic forms and linear correlations among sums of two squares","status":"public","publication_status":"published","author":[{"full_name":"Timothy Browning","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D"},{"full_name":"Munshi, Ritabrata","first_name":"Ritabrata","last_name":"Munshi"}],"volume":27,"date_created":"2018-12-11T11:45:28Z","date_updated":"2021-01-12T06:58:18Z","type":"journal_article","publist_id":"7645","issue":"4","abstract":[{"lang":"eng","text":"For suitable pairs of diagonal quadratic forms in eight variables we use the circle method to investigate the density of simultaneous integer solutions and relate this to the problem of estimating linear correlations among sums of two squares."}],"extern":1},{"day":"01","month":"08","publication":"Arithmetic and Geometry","citation":{"short":"T.D. Browning, in:, Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113.","mla":"Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113, doi:10.1017/CBO9781316106877.009.","chicago":"Browning, Timothy D. “A Survey of Applications of the Circle Method to Rational Points.” In Arithmetic and Geometry, 89–113. Cambridge University Press, 2015. https://doi.org/10.1017/CBO9781316106877.009.","ama":"Browning TD. A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. Cambridge University Press; 2015:89-113. doi:10.1017/CBO9781316106877.009","ieee":"T. D. Browning, “A survey of applications of the circle method to rational points,” in Arithmetic and Geometry, Cambridge University Press, 2015, pp. 89–113.","apa":"Browning, T. D. (2015). A survey of applications of the circle method to rational points. In Arithmetic and Geometry (pp. 89–113). Cambridge University Press. https://doi.org/10.1017/CBO9781316106877.009","ista":"Browning TD. 2015.A survey of applications of the circle method to rational points. In: Arithmetic and Geometry. , 89–113."},"quality_controlled":"1","page":"89 - 113","doi":"10.1017/CBO9781316106877.009","date_published":"2015-08-01T00:00:00Z","language":[{"iso":"eng"}],"type":"book_chapter","abstract":[{"lang":"eng","text":"Given a number field k and a projective algebraic variety X defined over k, the question of whether X contains a k-rational point is both very natural and very difficult. In the event that the set X(k) of k-rational points is not empty, one can also ask how the points of X(k) are distributed. Are they dense in X under the Zariski topology? Are they dense in the set."}],"publist_id":"7644","extern":"1","_id":"258","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A survey of applications of the circle method to rational points","status":"public","publication_status":"published","publisher":"Cambridge University Press","author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Browning, Timothy D"}],"date_created":"2018-12-11T11:45:28Z","date_updated":"2021-01-12T06:58:22Z","oa_version":"None"},{"doi":"10.1007/s00039-015-0328-5","date_published":"2015-06-11T00:00:00Z","quality_controlled":0,"page":"671 - 732","publication":"Geometric and Functional Analysis","citation":{"chicago":"Browning, Timothy D, and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis. Birkhäuser, 2015. https://doi.org/10.1007/s00039-015-0328-5.","mla":"Browning, Timothy D., and Pankaj Vishe. “Rational Points on Cubic Hypersurfaces over F_q(T) .” Geometric and Functional Analysis, vol. 25, no. 3, Birkhäuser, 2015, pp. 671–732, doi:10.1007/s00039-015-0328-5.","short":"T.D. Browning, P. Vishe, Geometric and Functional Analysis 25 (2015) 671–732.","ista":"Browning TD, Vishe P. 2015. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 25(3), 671–732.","apa":"Browning, T. D., & Vishe, P. (2015). Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. Birkhäuser. https://doi.org/10.1007/s00039-015-0328-5","ieee":"T. D. Browning and P. Vishe, “Rational points on cubic hypersurfaces over F_q(t) ,” Geometric and Functional Analysis, vol. 25, no. 3. Birkhäuser, pp. 671–732, 2015.","ama":"Browning TD, Vishe P. Rational points on cubic hypersurfaces over F_q(t) . Geometric and Functional Analysis. 2015;25(3):671-732. doi:10.1007/s00039-015-0328-5"},"month":"06","day":"11","date_updated":"2021-01-12T06:58:25Z","date_created":"2018-12-11T11:45:29Z","volume":25,"author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning"},{"full_name":"Vishe, Pankaj","first_name":"Pankaj","last_name":"Vishe"}],"title":"Rational points on cubic hypersurfaces over F_q(t) ","publication_status":"published","status":"public","publisher":"Birkhäuser","intvolume":" 25","acknowledgement":"EP/J018260/1\tEngineering and Physical Sciences Research Council EPSRC","_id":"259","year":"2015","extern":1,"abstract":[{"lang":"eng","text":"The Hasse principle and weak approximation is established for non-singular cubic hypersurfaces X over the function field "}],"publist_id":"7643","issue":"3","type":"journal_article"},{"oa_version":"Preprint","intvolume":" 573","status":"public","title":"Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1598","issue":"3","abstract":[{"text":"We consider Markov decision processes (MDPs) with specifications given as Büchi (liveness) objectives, and examine the problem of computing the set of almost-sure winning vertices such that the objective can be ensured with probability 1 from these vertices. We study for the first time the average-case complexity of the classical algorithm for computing the set of almost-sure winning vertices for MDPs with Büchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average-case running time is linear (as compared to the worst-case linear number of iterations and quadratic time complexity). Second, for the average-case analysis over all MDPs we show that the expected number of iterations is constant and the average-case running time is linear (again as compared to the worst-case linear number of iterations and quadratic time complexity). Finally we also show that when all MDPs are equally likely, the probability that the classical algorithm requires more than a constant number of iterations is exponentially small.","lang":"eng"}],"type":"journal_article","date_published":"2015-03-30T00:00:00Z","page":"71 - 89","citation":{"short":"K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015) 71–89.","mla":"Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:10.1016/j.tcs.2015.01.050.","chicago":"Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.” Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050.","ama":"Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 2015;573(3):71-89. doi:10.1016/j.tcs.2015.01.050","ieee":"K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” Theoretical Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.","apa":"Chatterjee, K., Joglekar, M., & Shah, N. (2015). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.050","ista":"Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theoretical Computer Science. 573(3), 71–89."},"publication":"Theoretical Computer Science","article_processing_charge":"No","day":"30","scopus_import":1,"volume":573,"date_updated":"2023-02-23T10:55:03Z","date_created":"2018-12-11T11:52:56Z","related_material":{"record":[{"id":"2715","relation":"earlier_version","status":"public"}]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Manas","last_name":"Joglekar","full_name":"Joglekar, Manas"},{"last_name":"Shah","first_name":"Nisarg","full_name":"Shah, Nisarg"}],"publisher":"Elsevier","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2015","acknowledgement":"The research was supported by FWF Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start Grant (279307: Graph Games), and the Microsoft Faculty Fellows Award. Nisarg Shah is also supported by NSF Grant CCF-1215883.\r\n","ec_funded":1,"publist_id":"5571","language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2015.01.050","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1202.4175"}],"external_id":{"arxiv":["1202.4175"]},"month":"03"},{"ec_funded":1,"publist_id":"5305","date_created":"2018-12-11T11:54:06Z","date_updated":"2023-02-23T10:59:19Z","volume":48,"author":[{"last_name":"Attali","first_name":"Dominique","full_name":"Attali, Dominique"},{"full_name":"Bauer, Ulrich","last_name":"Bauer","first_name":"Ulrich","orcid":"0000-0002-9683-0724","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Devillers, Olivier","first_name":"Olivier","last_name":"Devillers"},{"full_name":"Glisse, Marc","last_name":"Glisse","first_name":"Marc"},{"full_name":"Lieutier, André","last_name":"Lieutier","first_name":"André"}],"related_material":{"record":[{"id":"2812","relation":"earlier_version","status":"public"}]},"publication_status":"published","publisher":"Elsevier","department":[{"_id":"HeEd"}],"year":"2015","month":"06","language":[{"iso":"eng"}],"doi":"10.1016/j.comgeo.2014.08.010","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"abstract":[{"lang":"eng","text":"We consider the problem of deciding whether the persistent homology group of a simplicial pair (K,L) can be realized as the homology H∗(X) of some complex X with L ⊂ X ⊂ K. We show that this problem is NP-complete even if K is embedded in double-struck R3. As a consequence, we show that it is NP-hard to simplify level and sublevel sets of scalar functions on double-struck S3 within a given tolerance constraint. This problem has relevance to the visualization of medical images by isosurfaces. We also show an implication to the theory of well groups of scalar functions: not every well group can be realized by some level set, and deciding whether a well group can be realized is NP-hard."}],"issue":"8","type":"journal_article","oa_version":"None","status":"public","title":"Homological reconstruction and simplification in R3","intvolume":" 48","_id":"1805","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"03","scopus_import":1,"date_published":"2015-06-03T00:00:00Z","page":"606 - 621","publication":"Computational Geometry: Theory and Applications","citation":{"ista":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2015. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 48(8), 606–621.","ieee":"D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in R3,” Computational Geometry: Theory and Applications, vol. 48, no. 8. Elsevier, pp. 606–621, 2015.","apa":"Attali, D., Bauer, U., Devillers, O., Glisse, M., & Lieutier, A. (2015). Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2014.08.010","ama":"Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. Homological reconstruction and simplification in R3. Computational Geometry: Theory and Applications. 2015;48(8):606-621. doi:10.1016/j.comgeo.2014.08.010","chicago":"Attali, Dominique, Ulrich Bauer, Olivier Devillers, Marc Glisse, and André Lieutier. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2014.08.010.","mla":"Attali, Dominique, et al. “Homological Reconstruction and Simplification in R3.” Computational Geometry: Theory and Applications, vol. 48, no. 8, Elsevier, 2015, pp. 606–21, doi:10.1016/j.comgeo.2014.08.010.","short":"D. Attali, U. Bauer, O. Devillers, M. Glisse, A. Lieutier, Computational Geometry: Theory and Applications 48 (2015) 606–621."}},{"intvolume":" 27","publisher":"ACS","title":"Efficient and inexpensive sodium magnesium hybrid battery","status":"public","publication_status":"published","year":"2015","_id":"333","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":27,"oa_version":"None","date_created":"2018-12-11T11:45:52Z","date_updated":"2021-01-12T07:42:42Z","author":[{"full_name":"Walter, Marc","first_name":"Marc","last_name":"Walter"},{"last_name":"Kravchyk","first_name":"Kostiantyn","full_name":"Kravchyk, Kostiantyn"},{"first_name":"Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"first_name":"Maksym","last_name":"Kovalenko","full_name":"Kovalenko, Maksym"}],"type":"journal_article","extern":"1","publist_id":"7507","issue":"21","abstract":[{"text":"We present a hybrid intercalation battery based on a sodium/magnesium (Na/Mg) dual salt electrolyte, metallic magnesium anode, and a cathode based on FeS2 nanocrystals (NCs). Compared to lithium or sodium, metallic magnesium anode is safer due to dendrite-free electroplating and offers extremely high volumetric (3833 mAh cm-3) and gravimetric capacities (2205 mAh g-1). Na-ion cathodes, FeS2 NCs in the present study, may serve as attractive alternatives to Mg-ion cathodes due to the higher voltage of operation and fast, highly reversible insertion of Na-ions. In this proof-of-concept study, electrochemical cycling of the Na/Mg hybrid battery was characterized by high rate capability, high Coulombic efficiency of 99.8%, and high energy density. In particular, with an average discharge voltage of ∼1.1 V and a cathodic capacity of 189 mAh g-1 at a current of 200 mA g-1, the presented Mg/FeS2 hybrid battery delivers energy densities of up to 210 Wh kg-1, comparable to commercial Li-ion batteries and approximately twice as high as state-of-the-art Mg-ion batteries based on Mo6S8 cathodes. Further significant gains in the energy density are expected from the development of Na/Mg electrolytes with a broader electrochemical stability window. Fully based on Earth-abundant elements, hybrid Na-Mg batteries are highly promising for large-scale stationary energy storage. ","lang":"eng"}],"page":"7452 - 7458","article_type":"original","quality_controlled":"1","citation":{"mla":"Walter, Marc, et al. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials, vol. 27, no. 21, ACS, 2015, pp. 7452–58, doi:10.1021/acs.chemmater.5b03531.","short":"M. Walter, K. Kravchyk, M. Ibáñez, M. Kovalenko, Chemistry of Materials 27 (2015) 7452–7458.","chicago":"Walter, Marc, Kostiantyn Kravchyk, Maria Ibáñez, and Maksym Kovalenko. “Efficient and Inexpensive Sodium Magnesium Hybrid Battery.” Chemistry of Materials. ACS, 2015. https://doi.org/10.1021/acs.chemmater.5b03531.","ama":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 2015;27(21):7452-7458. doi:10.1021/acs.chemmater.5b03531","ista":"Walter M, Kravchyk K, Ibáñez M, Kovalenko M. 2015. Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. 27(21), 7452–7458.","ieee":"M. Walter, K. Kravchyk, M. Ibáñez, and M. Kovalenko, “Efficient and inexpensive sodium magnesium hybrid battery,” Chemistry of Materials, vol. 27, no. 21. ACS, pp. 7452–7458, 2015.","apa":"Walter, M., Kravchyk, K., Ibáñez, M., & Kovalenko, M. (2015). Efficient and inexpensive sodium magnesium hybrid battery. Chemistry of Materials. ACS. https://doi.org/10.1021/acs.chemmater.5b03531"},"publication":"Chemistry of Materials","language":[{"iso":"eng"}],"date_published":"2015-10-16T00:00:00Z","doi":"10.1021/acs.chemmater.5b03531","article_processing_charge":"No","day":"16","month":"10"}]