[{"citation":{"mla":"Shah, Neel, et al. <i>A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle</i>. IEEE, 2015, pp. 2737–45, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">10.1109/CVPR.2015.7298890</a>.","short":"N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 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., &#38; 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. <a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">https://doi.org/10.1109/CVPR.2015.7298890</a>","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:<a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">10.1109/CVPR.2015.7298890</a>","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.","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. <a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">https://doi.org/10.1109/CVPR.2015.7298890</a>."},"oa_version":"Preprint","date_updated":"2021-01-12T06:53:40Z","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Shah, Neel","id":"31ABAF80-F248-11E8-B48F-1D18A9856A87","first_name":"Neel","last_name":"Shah"},{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"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"}],"publication_status":"published","month":"06","title":"A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle","language":[{"iso":"eng"}],"publisher":"IEEE","date_published":"2015-06-01T00:00:00Z","_id":"1859","type":"conference","oa":1,"date_created":"2018-12-11T11:54:24Z","day":"01","doi":"10.1109/CVPR.2015.7298890","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1408.6804"}],"page":"2737 - 2745","status":"public","year":"2015","scopus_import":1,"ec_funded":1,"publist_id":"5240","conference":{"start_date":"2015-06-07","end_date":"2015-06-12","location":"Boston, MA, USA","name":"CVPR: Computer Vision and Pattern Recognition"}},{"author":[{"first_name":"Amélie","last_name":"Royer","full_name":"Royer, Amélie"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"department":[{"_id":"ChLa"}],"date_updated":"2021-01-12T06:53:41Z","oa_version":"Submitted Version","citation":{"mla":"Royer, Amélie, and Christoph Lampert. <i>Classifier Adaptation at Prediction Time</i>. IEEE, 2015, pp. 1401–09, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">10.1109/CVPR.2015.7298746</a>.","short":"A. Royer, C. Lampert, in:, IEEE, 2015, pp. 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.","ama":"Royer A, Lampert C. Classifier adaptation at prediction time. In: IEEE; 2015:1401-1409. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">10.1109/CVPR.2015.7298746</a>","ista":"Royer A, Lampert C. 2015. Classifier adaptation at prediction time. CVPR: Computer Vision and Pattern Recognition, 1401–1409.","chicago":"Royer, Amélie, and Christoph Lampert. “Classifier Adaptation at Prediction Time,” 1401–9. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">https://doi.org/10.1109/CVPR.2015.7298746</a>.","apa":"Royer, A., &#38; 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. <a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">https://doi.org/10.1109/CVPR.2015.7298746</a>"},"language":[{"iso":"eng"}],"date_published":"2015-06-01T00:00:00Z","publisher":"IEEE","title":"Classifier adaptation at prediction time","month":"06","publication_status":"published","abstract":[{"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.","lang":"eng"}],"year":"2015","day":"01","page":"1401 - 1409","status":"public","doi":"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"}],"oa":1,"date_created":"2018-12-11T11:54:24Z","_id":"1860","type":"conference","publist_id":"5239","conference":{"end_date":"2015-06-12","start_date":"2015-06-07","name":"CVPR: Computer Vision and Pattern Recognition","location":"Boston, MA, United States"},"ec_funded":1,"scopus_import":1},{"oa_version":"Preprint","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"author":[{"last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"last_name":"Knowles","first_name":"Antti","full_name":"Knowles, Antti"}],"issue":"3","month":"03","volume":16,"language":[{"iso":"eng"}],"type":"journal_article","_id":"1864","date_created":"2018-12-11T11:54:26Z","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5107"}],"ec_funded":1,"citation":{"ama":"Erdös L, Knowles A. The Altshuler–Shklovskii formulas for random band matrices II: The general case. <i>Annales Henri Poincare</i>. 2015;16(3):709-799. doi:<a href=\"https://doi.org/10.1007/s00023-014-0333-5\">10.1007/s00023-014-0333-5</a>","chicago":"Erdös, László, and Antti Knowles. “The Altshuler–Shklovskii Formulas for Random Band Matrices II: The General Case.” <i>Annales Henri Poincare</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00023-014-0333-5\">https://doi.org/10.1007/s00023-014-0333-5</a>.","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., &#38; Knowles, A. (2015). The Altshuler–Shklovskii formulas for random band matrices II: The general case. <i>Annales Henri Poincare</i>. Springer. <a href=\"https://doi.org/10.1007/s00023-014-0333-5\">https://doi.org/10.1007/s00023-014-0333-5</a>","ieee":"L. Erdös and A. Knowles, “The Altshuler–Shklovskii formulas for random band matrices II: The general case,” <i>Annales Henri Poincare</i>, vol. 16, no. 3. Springer, pp. 709–799, 2015.","short":"L. Erdös, A. Knowles, Annales Henri Poincare 16 (2015) 709–799.","mla":"Erdös, László, and Antti Knowles. “The Altshuler–Shklovskii Formulas for Random Band Matrices II: The General Case.” <i>Annales Henri Poincare</i>, vol. 16, no. 3, Springer, 2015, pp. 709–99, doi:<a href=\"https://doi.org/10.1007/s00023-014-0333-5\">10.1007/s00023-014-0333-5</a>."},"department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T06:53:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","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"}],"title":"The Altshuler–Shklovskii formulas for random band matrices II: The general case","publisher":"Springer","date_published":"2015-03-01T00:00:00Z","oa":1,"day":"01","doi":"10.1007/s00023-014-0333-5","page":"709 - 799","year":"2015","scopus_import":1,"publication":"Annales Henri Poincare","publist_id":"5233","intvolume":"        16"},{"citation":{"apa":"Grones, P., &#38; Friml, J. (2015). Auxin transporters and binding proteins at a glance. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.159418\">https://doi.org/10.1242/jcs.159418</a>","ista":"Grones P, Friml J. 2015. Auxin transporters and binding proteins at a glance. Journal of Cell Science. 128(1), 1–7.","ama":"Grones P, Friml J. Auxin transporters and binding proteins at a glance. <i>Journal of Cell Science</i>. 2015;128(1):1-7. doi:<a href=\"https://doi.org/10.1242/jcs.159418\">10.1242/jcs.159418</a>","chicago":"Grones, Peter, and Jiří Friml. “Auxin Transporters and Binding Proteins at a Glance.” <i>Journal of Cell Science</i>. Company of Biologists, 2015. <a href=\"https://doi.org/10.1242/jcs.159418\">https://doi.org/10.1242/jcs.159418</a>.","ieee":"P. Grones and J. Friml, “Auxin transporters and binding proteins at a glance,” <i>Journal of Cell Science</i>, vol. 128, no. 1. Company of Biologists, pp. 1–7, 2015.","short":"P. Grones, J. Friml, Journal of Cell Science 128 (2015) 1–7.","mla":"Grones, Peter, and Jiří Friml. “Auxin Transporters and Binding Proteins at a Glance.” <i>Journal of Cell Science</i>, vol. 128, no. 1, Company of Biologists, 2015, pp. 1–7, doi:<a href=\"https://doi.org/10.1242/jcs.159418\">10.1242/jcs.159418</a>."},"department":[{"_id":"JiFr"}],"date_updated":"2021-01-12T06:53:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"publication_status":"published","abstract":[{"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.","lang":"eng"}],"title":"Auxin transporters and binding proteins at a glance","file_date_updated":"2020-07-14T12:45:19Z","date_published":"2015-01-01T00:00:00Z","publisher":"Company of Biologists","oa":1,"page":"1 - 7","year":"2015","doi":"10.1242/jcs.159418","day":"01","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]","scopus_import":1,"publication":"Journal of Cell Science","publist_id":"5225","intvolume":"       128","oa_version":"Submitted Version","quality_controlled":"1","author":[{"id":"399876EC-F248-11E8-B48F-1D18A9856A87","full_name":"Grones, Peter","first_name":"Peter","last_name":"Grones"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596"}],"file":[{"date_created":"2018-12-12T10:11:00Z","date_updated":"2020-07-14T12:45:19Z","content_type":"application/pdf","file_name":"IST-2016-563-v1+1_1.full.pdf","relation":"main_file","access_level":"open_access","file_size":1688844,"file_id":"4852","checksum":"24c779f4cd9d549ca6833e26f486be27","creator":"system"}],"issue":"1","has_accepted_license":"1","month":"01","volume":128,"language":[{"iso":"eng"}],"type":"journal_article","_id":"1871","date_created":"2018-12-11T11:54:28Z","status":"public","pubrep_id":"563"},{"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.2058"}],"date_created":"2018-12-11T11:54:28Z","type":"journal_article","_id":"1873","language":[{"iso":"eng"}],"volume":221,"month":"04","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","oa_version":"Preprint","intvolume":"       221","arxiv":1,"publist_id":"5224","publication":"Artificial Intelligence","scopus_import":1,"day":"01","year":"2015","doi":"10.1016/j.artint.2014.12.009","page":"46 - 72","oa":1,"date_published":"2015-04-01T00:00:00Z","publisher":"Elsevier","title":"POMDPs under probabilistic semantics","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."}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1408.2058"]},"date_updated":"2021-01-12T06:53:46Z","department":[{"_id":"KrCh"}],"citation":{"mla":"Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” <i>Artificial Intelligence</i>, vol. 221, Elsevier, 2015, pp. 46–72, doi:<a href=\"https://doi.org/10.1016/j.artint.2014.12.009\">10.1016/j.artint.2014.12.009</a>.","short":"K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.","ieee":"K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” <i>Artificial Intelligence</i>, vol. 221. Elsevier, pp. 46–72, 2015.","apa":"Chatterjee, K., &#38; Chmelik, M. (2015). POMDPs under probabilistic semantics. <i>Artificial Intelligence</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.artint.2014.12.009\">https://doi.org/10.1016/j.artint.2014.12.009</a>","ama":"Chatterjee K, Chmelik M. POMDPs under probabilistic semantics. <i>Artificial Intelligence</i>. 2015;221:46-72. doi:<a href=\"https://doi.org/10.1016/j.artint.2014.12.009\">10.1016/j.artint.2014.12.009</a>","chicago":"Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.” <i>Artificial Intelligence</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.artint.2014.12.009\">https://doi.org/10.1016/j.artint.2014.12.009</a>.","ista":"Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72."}},{"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."}],"publication_status":"published","ddc":["570"],"publisher":"Wiley-Blackwell","date_published":"2015-08-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:19Z","title":"Developing 3D SEM in a broad biological context","date_updated":"2021-01-12T06:53:48Z","department":[{"_id":"JiFr"}],"citation":{"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. <i>Journal of Microscopy</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/jmi.12211\">https://doi.org/10.1111/jmi.12211</a>","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.” <i>Journal of Microscopy</i>. Wiley-Blackwell, 2015. <a href=\"https://doi.org/10.1111/jmi.12211\">https://doi.org/10.1111/jmi.12211</a>.","ama":"Kremer A, Lippens S, Bartunkova S, et al. Developing 3D SEM in a broad biological context. <i>Journal of Microscopy</i>. 2015;259(2):80-96. doi:<a href=\"https://doi.org/10.1111/jmi.12211\">10.1111/jmi.12211</a>","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.","ieee":"A. Kremer <i>et al.</i>, “Developing 3D SEM in a broad biological context,” <i>Journal of Microscopy</i>, vol. 259, no. 2. Wiley-Blackwell, pp. 80–96, 2015.","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.” <i>Journal of Microscopy</i>, vol. 259, no. 2, Wiley-Blackwell, 2015, pp. 80–96, doi:<a href=\"https://doi.org/10.1111/jmi.12211\">10.1111/jmi.12211</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"intvolume":"       259","publist_id":"5218","publication":"Journal of Microscopy","oa":1,"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.","day":"01","year":"2015","doi":"10.1111/jmi.12211","page":"80 - 96","has_accepted_license":"1","month":"08","issue":"2","file":[{"date_updated":"2020-07-14T12:45:19Z","date_created":"2018-12-12T10:11:19Z","content_type":"application/pdf","file_name":"IST-2016-459-v1+1_KREMER_et_al-2015-Journal_of_Microscopy.pdf","relation":"main_file","file_size":2899898,"access_level":"open_access","creator":"system","checksum":"3649c5372d1644062d728ea9287e367f","file_id":"4872"}],"language":[{"iso":"eng"}],"volume":259,"quality_controlled":"1","oa_version":"Published Version","author":[{"full_name":"Kremer, A","last_name":"Kremer","first_name":"A"},{"last_name":"Lippens","first_name":"Stefaan","full_name":"Lippens, Stefaan"},{"last_name":"Bartunkova","first_name":"Sonia","full_name":"Bartunkova, Sonia"},{"first_name":"Bob","last_name":"Asselbergh","full_name":"Asselbergh, Bob"},{"last_name":"Blanpain","first_name":"Cendric","full_name":"Blanpain, Cendric"},{"orcid":"0000-0002-9767-8699","last_name":"Fendrych","first_name":"Matyas","full_name":"Fendrych, Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87"},{"first_name":"A","last_name":"Goossens","full_name":"Goossens, A"},{"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","last_name":"Larsimont","first_name":"Jean"},{"full_name":"Mc Guire, Conor","first_name":"Conor","last_name":"Mc Guire"},{"full_name":"Nowack, Moritz","last_name":"Nowack","first_name":"Moritz"},{"last_name":"Saelens","first_name":"Xavier","full_name":"Saelens, Xavier"},{"full_name":"Schertel, Andreas","first_name":"Andreas","last_name":"Schertel"},{"full_name":"Schepens, B","first_name":"B","last_name":"Schepens"},{"first_name":"M","last_name":"Slezak","full_name":"Slezak, M"},{"first_name":"Vincent","last_name":"Timmerman","full_name":"Timmerman, Vincent"},{"full_name":"Theunis, Clara","last_name":"Theunis","first_name":"Clara"},{"full_name":"Van Brempt, Ronald","first_name":"Ronald","last_name":"Van Brempt"},{"first_name":"Y","last_name":"Visser","full_name":"Visser, Y"},{"first_name":"Christophe","last_name":"Guérin","full_name":"Guérin, Christophe"}],"pubrep_id":"459","date_created":"2018-12-11T11:54:30Z","type":"journal_article","_id":"1879","status":"public"},{"scopus_import":1,"intvolume":"        17","publist_id":"5214","publication":"New Journal of Physics","oa":1,"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","day":"15","doi":"10.1088/1367-2630/17/1/013022","year":"2015","abstract":[{"lang":"eng","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"}],"publication_status":"published","ddc":["530"],"date_published":"2015-01-15T00:00:00Z","publisher":"IOP Publishing Ltd.","file_date_updated":"2020-07-14T12:45:20Z","title":"Superfluid behavior of a Bose-Einstein condensate in a random potential","date_updated":"2021-01-12T06:53:48Z","department":[{"_id":"RoSe"}],"citation":{"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.” <i>New Journal of Physics</i>, vol. 17, 013022, IOP Publishing Ltd., 2015, doi:<a href=\"https://doi.org/10.1088/1367-2630/17/1/013022\">10.1088/1367-2630/17/1/013022</a>.","ieee":"M. Könenberg, T. Moser, R. Seiringer, and J. Yngvason, “Superfluid behavior of a Bose-Einstein condensate in a random potential,” <i>New Journal of Physics</i>, vol. 17. IOP Publishing Ltd., 2015.","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.","chicago":"Könenberg, Martin, Thomas Moser, Robert Seiringer, and Jakob Yngvason. “Superfluid Behavior of a Bose-Einstein Condensate in a Random Potential.” <i>New Journal of Physics</i>. IOP Publishing Ltd., 2015. <a href=\"https://doi.org/10.1088/1367-2630/17/1/013022\">https://doi.org/10.1088/1367-2630/17/1/013022</a>.","ama":"Könenberg M, Moser T, Seiringer R, Yngvason J. Superfluid behavior of a Bose-Einstein condensate in a random potential. <i>New Journal of Physics</i>. 2015;17. doi:<a href=\"https://doi.org/10.1088/1367-2630/17/1/013022\">10.1088/1367-2630/17/1/013022</a>","apa":"Könenberg, M., Moser, T., Seiringer, R., &#38; Yngvason, J. (2015). Superfluid behavior of a Bose-Einstein condensate in a random potential. <i>New Journal of Physics</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1367-2630/17/1/013022\">https://doi.org/10.1088/1367-2630/17/1/013022</a>"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"447","date_created":"2018-12-11T11:54:30Z","_id":"1880","type":"journal_article","status":"public","has_accepted_license":"1","month":"01","article_number":"013022","file":[{"file_name":"IST-2016-447-v1+1_document_1_.pdf","date_updated":"2020-07-14T12:45:20Z","date_created":"2018-12-12T10:12:44Z","content_type":"application/pdf","file_size":768108,"access_level":"open_access","creator":"system","checksum":"38fdf2b5ac30445e26a5d613abd84b16","file_id":"4963","relation":"main_file"}],"language":[{"iso":"eng"}],"volume":17,"project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"quality_controlled":"1","oa_version":"Published Version","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"},{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yngvason","first_name":"Jakob","full_name":"Yngvason, Jakob"}]},{"author":[{"full_name":"Fahrenberg, Uli","first_name":"Uli","last_name":"Fahrenberg"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881"},{"last_name":"Legay","first_name":"Axel","full_name":"Legay, Axel"},{"last_name":"Traonouez","first_name":"Louis","full_name":"Traonouez, Louis"}],"project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"volume":8997,"month":"01","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1408.1256"}],"date_created":"2018-12-11T11:54:31Z","_id":"1882","type":"conference","conference":{"name":"FACS: Formal Aspects of Component Software","location":"Bertinoro, Italy","start_date":"2014-09-10","end_date":"2014-09-12"},"ec_funded":1,"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2021-01-12T06:53:49Z","citation":{"mla":"Fahrenberg, Uli, et al. <i>Compositionality for Quantitative Specifications</i>. Vol. 8997, Springer, 2015, pp. 306–24, doi:<a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">10.1007/978-3-319-15317-9_19</a>.","short":"U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 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., &#38; Traonouez, L. (2015). Compositionality for quantitative specifications (Vol. 8997, pp. 306–324). Presented at the FACS: Formal Aspects of Component Software, Bertinoro, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">https://doi.org/10.1007/978-3-319-15317-9_19</a>","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.","ama":"Fahrenberg U, Kretinsky J, Legay A, Traonouez L. Compositionality for quantitative specifications. In: Vol 8997. Springer; 2015:306-324. doi:<a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">10.1007/978-3-319-15317-9_19</a>","chicago":"Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,” 8997:306–24. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-15317-9_19\">https://doi.org/10.1007/978-3-319-15317-9_19</a>."},"publisher":"Springer","date_published":"2015-01-30T00:00:00Z","title":"Compositionality for quantitative specifications","publication_status":"published","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."}],"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.","doi":"10.1007/978-3-319-15317-9_19","day":"30","year":"2015","page":"306 - 324","oa":1,"publist_id":"5216","intvolume":"      8997","scopus_import":1},{"article_type":"original","type":"journal_article","_id":"1883","date_created":"2018-12-11T11:54:31Z","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1012.3298","open_access":"1"}],"article_number":"022803","issue":"2","month":"02","volume":91,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Preprint","quality_controlled":"1","author":[{"full_name":"Keller-Schmidt, Stephanie","first_name":"Stephanie","last_name":"Keller-Schmidt"},{"first_name":"Murat","last_name":"Tugrul","orcid":"0000-0002-8523-0758","id":"37C323C6-F248-11E8-B48F-1D18A9856A87","full_name":"Tugrul, Murat"},{"first_name":"Víctor","last_name":"Eguíluz","full_name":"Eguíluz, Víctor"},{"full_name":"Hernandez Garcia, Emilio","first_name":"Emilio","last_name":"Hernandez Garcia"},{"first_name":"Konstantin","last_name":"Klemm","full_name":"Klemm, Konstantin"}],"scopus_import":1,"publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","arxiv":1,"publist_id":"5213","intvolume":"        91","oa":1,"doi":"10.1103/PhysRevE.91.022803","year":"2015","day":"02","publication_status":"published","abstract":[{"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","lang":"eng"}],"title":"Anomalous scaling in an age-dependent branching model","publisher":"American Institute of Physics","date_published":"2015-02-02T00:00:00Z","citation":{"mla":"Keller-Schmidt, Stephanie, et al. “Anomalous Scaling in an Age-Dependent Branching Model.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 2, 022803, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.022803\">10.1103/PhysRevE.91.022803</a>.","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).","ieee":"S. Keller-Schmidt, M. Tugrul, V. Eguíluz, E. Hernandez Garcia, and K. Klemm, “Anomalous scaling in an age-dependent branching model,” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 2. American Institute of Physics, 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.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1103/PhysRevE.91.022803\">https://doi.org/10.1103/PhysRevE.91.022803</a>.","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.","ama":"Keller-Schmidt S, Tugrul M, Eguíluz V, Hernandez Garcia E, Klemm K. Anomalous scaling in an age-dependent branching model. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. 2015;91(2). doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.022803\">10.1103/PhysRevE.91.022803</a>","apa":"Keller-Schmidt, S., Tugrul, M., Eguíluz, V., Hernandez Garcia, E., &#38; Klemm, K. (2015). Anomalous scaling in an age-dependent branching model. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.91.022803\">https://doi.org/10.1103/PhysRevE.91.022803</a>"},"department":[{"_id":"NiBa"}],"date_updated":"2021-01-12T06:53:49Z","external_id":{"arxiv":["1012.3298"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publication":"Genetics","publist_id":"5210","intvolume":"       199","scopus_import":1,"status":"public","day":"01","year":"2015","doi":"10.1534/genetics.114.171850","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.5599"}],"page":"39 - 59","_id":"1885","type":"journal_article","date_created":"2018-12-11T11:54:32Z","oa":1,"volume":199,"title":"Positional information, positional error, and readout precision in morphogenesis: A mathematical framework","date_published":"2015-01-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Genetics Society of America","issue":"1","publication_status":"published","month":"01","abstract":[{"lang":"eng","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. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"},{"full_name":"Dubuis, Julien","first_name":"Julien","last_name":"Dubuis"},{"full_name":"Petkova, Mariela","first_name":"Mariela","last_name":"Petkova"},{"full_name":"Gregor, Thomas","first_name":"Thomas","last_name":"Gregor"}],"oa_version":"Preprint","citation":{"ieee":"G. Tkačik, J. Dubuis, M. Petkova, and T. Gregor, “Positional information, positional error, and readout precision in morphogenesis: A mathematical framework,” <i>Genetics</i>, vol. 199, no. 1. Genetics Society of America, pp. 39–59, 2015.","apa":"Tkačik, G., Dubuis, J., Petkova, M., &#38; Gregor, T. (2015). Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.114.171850\">https://doi.org/10.1534/genetics.114.171850</a>","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.","chicago":"Tkačik, Gašper, Julien Dubuis, Mariela Petkova, and Thomas Gregor. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” <i>Genetics</i>. Genetics Society of America, 2015. <a href=\"https://doi.org/10.1534/genetics.114.171850\">https://doi.org/10.1534/genetics.114.171850</a>.","ama":"Tkačik G, Dubuis J, Petkova M, Gregor T. Positional information, positional error, and readout precision in morphogenesis: A mathematical framework. <i>Genetics</i>. 2015;199(1):39-59. doi:<a href=\"https://doi.org/10.1534/genetics.114.171850\">10.1534/genetics.114.171850</a>","mla":"Tkačik, Gašper, et al. “Positional Information, Positional Error, and Readout Precision in Morphogenesis: A Mathematical Framework.” <i>Genetics</i>, vol. 199, no. 1, Genetics Society of America, 2015, pp. 39–59, doi:<a href=\"https://doi.org/10.1534/genetics.114.171850\">10.1534/genetics.114.171850</a>.","short":"G. Tkačik, J. Dubuis, M. Petkova, T. Gregor, Genetics 199 (2015) 39–59."},"quality_controlled":"1","department":[{"_id":"GaTk"}],"date_updated":"2021-01-12T06:53:50Z"},{"oa_version":"Preprint","citation":{"mla":"Sokolowski, Thomas R., and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 6, 062710, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">10.1103/PhysRevE.91.062710</a>.","short":"T.R. Sokolowski, G. Tkačik, Physical Review E Statistical Nonlinear and Soft Matter Physics 91 (2015).","apa":"Sokolowski, T. R., &#38; Tkačik, G. (2015). Optimizing information flow in small genetic networks. IV. Spatial coupling. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">https://doi.org/10.1103/PhysRevE.91.062710</a>","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.","ama":"Sokolowski TR, Tkačik G. Optimizing information flow in small genetic networks. IV. Spatial coupling. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. 2015;91(6). doi:<a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">10.1103/PhysRevE.91.062710</a>","chicago":"Sokolowski, Thomas R, and Gašper Tkačik. “Optimizing Information Flow in Small Genetic Networks. IV. Spatial Coupling.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1103/PhysRevE.91.062710\">https://doi.org/10.1103/PhysRevE.91.062710</a>.","ieee":"T. R. Sokolowski and G. Tkačik, “Optimizing information flow in small genetic networks. IV. Spatial coupling,” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 91, no. 6. American Institute of Physics, 2015."},"date_updated":"2021-01-12T06:54:13Z","quality_controlled":"1","department":[{"_id":"GaTk"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Thomas R","last_name":"Sokolowski","orcid":"0000-0002-1287-3779","id":"3E999752-F248-11E8-B48F-1D18A9856A87","full_name":"Sokolowski, Thomas R"},{"full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","first_name":"Gasper","last_name":"Tkacik"}],"issue":"6","article_number":"062710","abstract":[{"lang":"eng","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 &quot;input&quot;) 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."}],"publication_status":"published","month":"06","title":"Optimizing information flow in small genetic networks. IV. Spatial coupling","volume":91,"language":[{"iso":"eng"}],"date_published":"2015-06-15T00:00:00Z","publisher":"American Institute of Physics","_id":"1940","type":"journal_article","oa":1,"date_created":"2018-12-11T11:54:49Z","main_file_link":[{"url":"http://arxiv.org/abs/1501.04015","open_access":"1"}],"doi":"10.1103/PhysRevE.91.062710","year":"2015","day":"15","status":"public","scopus_import":1,"publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","intvolume":"        91","publist_id":"5145"},{"status":"public","publication_identifier":{"isbn":["978-1-4503-3300-9"]},"_id":"1992","type":"conference","date_created":"2018-12-11T11:55:05Z","conference":{"location":"Mumbai, India","name":"POPL: Principles of Programming Languages","end_date":"2015-01-17","start_date":"2015-01-15"},"pubrep_id":"317","author":[{"last_name":"Gupta","first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun"},{"full_name":"Samanta, Roopsha","id":"3D2AAC08-F248-11E8-B48F-1D18A9856A87","first_name":"Roopsha","last_name":"Samanta"},{"full_name":"Tarrach, Thorsten","id":"3D6E8F2C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4409-8487","last_name":"Tarrach","first_name":"Thorsten"}],"oa_version":"Submitted Version","quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"file_id":"5314","checksum":"f0d4395b600f410a191256ac0b73af32","creator":"system","access_level":"open_access","file_size":399462,"relation":"main_file","file_name":"IST-2015-317-v1+1_author_version.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:17:56Z","date_updated":"2020-07-14T12:45:22Z"}],"has_accepted_license":"1","month":"01","day":"15","doi":"10.1145/2676726.2677008","page":"433 - 444","year":"2015","oa":1,"publist_id":"5091","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","chicago":"Gupta, Ashutosh, Thomas A Henzinger, Arjun Radhakrishna, Roopsha Samanta, and Thorsten Tarrach. “Succinct Representation of Concurrent Trace Sets,” 433–44. ACM, 2015. <a href=\"https://doi.org/10.1145/2676726.2677008\">https://doi.org/10.1145/2676726.2677008</a>.","ama":"Gupta A, Henzinger TA, Radhakrishna A, Samanta R, Tarrach T. Succinct representation of concurrent trace sets. In: ACM; 2015:433-444. doi:<a href=\"https://doi.org/10.1145/2676726.2677008\">10.1145/2676726.2677008</a>","apa":"Gupta, A., Henzinger, T. A., Radhakrishna, A., Samanta, R., &#38; Tarrach, T. (2015). Succinct representation of concurrent trace sets (pp. 433–444). Presented at the POPL: Principles of Programming Languages, Mumbai, India: ACM. <a href=\"https://doi.org/10.1145/2676726.2677008\">https://doi.org/10.1145/2676726.2677008</a>","mla":"Gupta, Ashutosh, et al. <i>Succinct Representation of Concurrent Trace Sets</i>. ACM, 2015, pp. 433–44, doi:<a href=\"https://doi.org/10.1145/2676726.2677008\">10.1145/2676726.2677008</a>.","short":"A. Gupta, T.A. Henzinger, A. Radhakrishna, R. Samanta, T. Tarrach, in:, ACM, 2015, pp. 433–444."},"date_updated":"2021-01-12T06:54:33Z","department":[{"_id":"ToHe"}],"title":"Succinct representation of concurrent trace sets","publisher":"ACM","date_published":"2015-01-15T00:00:00Z","file_date_updated":"2020-07-14T12:45:22Z","ddc":["005"],"abstract":[{"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.","lang":"eng"}],"publication_status":"published"},{"oa_version":"Submitted Version","quality_controlled":"1","project":[{"name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","grant_number":"243071","_id":"25DC711C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","grant_number":"CR-118/3-1","name":"Host-Parasite Coevolution"}],"author":[{"full_name":"Konrad, Matthias","id":"46528076-F248-11E8-B48F-1D18A9856A87","last_name":"Konrad","first_name":"Matthias"},{"last_name":"Grasse","first_name":"Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87","full_name":"Grasse, Anna V"},{"full_name":"Tragust, Simon","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Tragust"},{"last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia"}],"issue":"1799","article_number":"20141976","month":"01","article_processing_charge":"No","acknowledged_ssus":[{"_id":"EM-Fac"}],"volume":282,"language":[{"iso":"eng"}],"type":"journal_article","_id":"1993","article_type":"original","date_created":"2018-12-11T11:55:06Z","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4286035/"}],"publication_identifier":{"eissn":["1471-2954"],"issn":["0962-8452"]},"status":"public","ec_funded":1,"citation":{"mla":"Konrad, Matthias, et al. “Anti-Pathogen Protection versus Survival Costs Mediated by an Ectosymbiont in an Ant Host.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 282, no. 1799, 20141976, The Royal Society, 2015, doi:<a href=\"https://doi.org/10.1098/rspb.2014.1976\">10.1098/rspb.2014.1976</a>.","short":"M. Konrad, A.V. Grasse, S. Tragust, S. Cremer, Proceedings of the Royal Society of London Series B Biological Sciences 282 (2015).","ieee":"M. Konrad, A. V. Grasse, S. Tragust, and S. Cremer, “Anti-pathogen protection versus survival costs mediated by an ectosymbiont in an ant host,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 282, no. 1799. The Royal Society, 2015.","chicago":"Konrad, Matthias, Anna V Grasse, Simon Tragust, and Sylvia Cremer. “Anti-Pathogen Protection versus Survival Costs Mediated by an Ectosymbiont in an Ant Host.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. The Royal Society, 2015. <a href=\"https://doi.org/10.1098/rspb.2014.1976\">https://doi.org/10.1098/rspb.2014.1976</a>.","ista":"Konrad M, Grasse AV, Tragust S, Cremer S. 2015. Anti-pathogen protection versus survival costs mediated by an ectosymbiont in an ant host. Proceedings of the Royal Society of London Series B Biological Sciences. 282(1799), 20141976.","ama":"Konrad M, Grasse AV, Tragust S, Cremer S. Anti-pathogen protection versus survival costs mediated by an ectosymbiont in an ant host. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2015;282(1799). doi:<a href=\"https://doi.org/10.1098/rspb.2014.1976\">10.1098/rspb.2014.1976</a>","apa":"Konrad, M., Grasse, A. V., Tragust, S., &#38; Cremer, S. (2015). Anti-pathogen protection versus survival costs mediated by an ectosymbiont in an ant host. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rspb.2014.1976\">https://doi.org/10.1098/rspb.2014.1976</a>"},"date_updated":"2023-02-23T14:06:41Z","department":[{"_id":"SyCr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["25473011"]},"abstract":[{"text":"The fitness effects of symbionts on their hosts can be context-dependent, with usually benign symbionts causing detrimental effects when their hosts are stressed, or typically parasitic symbionts providing protection towards their hosts (e.g. against pathogen infection). Here, we studied the novel association between the invasive garden ant Lasius neglectus and its fungal ectosymbiont Laboulbenia formicarum for potential costs and benefits. We tested ants with different Laboulbenia levels for their survival and immunity under resource limitation and exposure to the obligate killing entomopathogen Metarhizium brunneum. While survival of L. neglectus workers under starvation was significantly decreased with increasing Laboulbenia levels, host survival under Metarhizium exposure increased with higher levels of the ectosymbiont, suggesting a symbiont-mediated anti-pathogen protection, which seems to be driven mechanistically by both improved sanitary behaviours and an upregulated immune system. Ants with high Laboulbenia levels showed significantly longer self-grooming and elevated expression of immune genes relevant for wound repair and antifungal responses (β-1,3-glucan binding protein, Prophenoloxidase), compared with ants carrying low Laboulbenia levels. This suggests that the ectosymbiont Laboulbenia formicarum weakens its ant host by either direct resource exploitation or the costs of an upregulated behavioural and immunological response, which, however, provides a prophylactic protection upon later exposure to pathogens. ","lang":"eng"}],"publication_status":"published","title":"Anti-pathogen protection versus survival costs mediated by an ectosymbiont in an ant host","publisher":"The Royal Society","date_published":"2015-01-22T00:00:00Z","pmid":1,"oa":1,"day":"22","doi":"10.1098/rspb.2014.1976","year":"2015","acknowledgement":"Funding was obtained by the German Research Foundation (CR 118–2) and an ERC StG (243071) by the European Research Council (both to S.C.).\r\nWe thank Line V. Ugelvig for help with ant collection and statistical discussion, Xavier Espadaler for detailed information on the ant collection site, Birgit Lautenschläger for the electron microscopy images and Eva Sixt for ant drawings. We further thank Jørgen Eilenberg for the fungal strain, Meghan L. Vyleta for genetic strain characterization and immune gene primer development, Paul Schmid-Hempel for discussion, and Line V. Ugelvig, Xavier Espadaler and Christopher D. Pull for comments on the manuscript. S.C., M.K. and S.T. conceived the study; M.K. and A.V.G. performed the experiments; M.K. performed the statistical analysis; S.C. and M.K. wrote the manuscript with intense contributions of A.V.G. and S.T.; all authors approved the manuscript.","related_material":{"record":[{"status":"public","relation":"research_data","id":"9740"}]},"scopus_import":"1","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","intvolume":"       282","publist_id":"5090"},{"scopus_import":1,"publication":"Journal of Symbolic Computation","publist_id":"5082","type":"journal_article","_id":"1997","date_created":"2018-12-11T11:55:07Z","oa":1,"day":"01","status":"public","year":"2015","doi":"10.1016/j.jsc.2014.09.014","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.0077"}],"page":"285 - 296","issue":"May-June","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"}],"month":"05","publication_status":"published","title":"The three-state toric homogeneous Markov chain model has Markov degree two","volume":"68/Part 2","publisher":"Elsevier","language":[{"iso":"eng"}],"date_published":"2015-05-01T00:00:00Z","oa_version":"Preprint","citation":{"chicago":"Noren, Patrik. “The Three-State Toric Homogeneous Markov Chain Model Has Markov Degree Two.” <i>Journal of Symbolic Computation</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.jsc.2014.09.014\">https://doi.org/10.1016/j.jsc.2014.09.014</a>.","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.","ama":"Noren P. The three-state toric homogeneous Markov chain model has Markov degree two. <i>Journal of Symbolic Computation</i>. 2015;68/Part 2(May-June):285-296. doi:<a href=\"https://doi.org/10.1016/j.jsc.2014.09.014\">10.1016/j.jsc.2014.09.014</a>","apa":"Noren, P. (2015). The three-state toric homogeneous Markov chain model has Markov degree two. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jsc.2014.09.014\">https://doi.org/10.1016/j.jsc.2014.09.014</a>","ieee":"P. Noren, “The three-state toric homogeneous Markov chain model has Markov degree two,” <i>Journal of Symbolic Computation</i>, vol. 68/Part 2, no. May-June. Elsevier, pp. 285–296, 2015.","mla":"Noren, Patrik. “The Three-State Toric Homogeneous Markov Chain Model Has Markov Degree Two.” <i>Journal of Symbolic Computation</i>, vol. 68/Part 2, no. May-June, Elsevier, 2015, pp. 285–96, doi:<a href=\"https://doi.org/10.1016/j.jsc.2014.09.014\">10.1016/j.jsc.2014.09.014</a>.","short":"P. Noren, Journal of Symbolic Computation 68/Part 2 (2015) 285–296."},"date_updated":"2021-01-12T06:54:35Z","quality_controlled":"1","department":[{"_id":"CaUh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"46870C74-F248-11E8-B48F-1D18A9856A87","full_name":"Noren, Patrik","first_name":"Patrik","last_name":"Noren"}]},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.3436"}],"status":"public","date_created":"2018-12-11T11:55:10Z","type":"journal_article","_id":"2006","author":[{"full_name":"Hein, Nicolas","last_name":"Hein","first_name":"Nicolas"},{"full_name":"Hillar, Christopher","last_name":"Hillar","first_name":"Christopher"},{"id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","full_name":"Martin Del Campo Sanchez, Abraham","first_name":"Abraham","last_name":"Martin Del Campo Sanchez"},{"full_name":"Sottile, Frank","first_name":"Frank","last_name":"Sottile"},{"last_name":"Teitler","first_name":"Zach","full_name":"Teitler, Zach"}],"quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":24,"month":"06","issue":"3","doi":"10.1080/10586458.2014.980044","year":"2015","page":"261 - 269","day":"23","oa":1,"intvolume":"        24","publist_id":"5070","publication":"Experimental Mathematics","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:54:40Z","department":[{"_id":"CaUh"}],"citation":{"apa":"Hein, N., Hillar, C., Martin del Campo Sanchez, A., Sottile, F., &#38; Teitler, Z. (2015). The monotone secant conjecture in the real Schubert calculus. <i>Experimental Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/10586458.2014.980044\">https://doi.org/10.1080/10586458.2014.980044</a>","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.","chicago":"Hein, Nicolas, Christopher Hillar, Abraham Martin del Campo Sanchez, Frank Sottile, and Zach Teitler. “The Monotone Secant Conjecture in the Real Schubert Calculus.” <i>Experimental Mathematics</i>. Taylor &#38; Francis, 2015. <a href=\"https://doi.org/10.1080/10586458.2014.980044\">https://doi.org/10.1080/10586458.2014.980044</a>.","ama":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. The monotone secant conjecture in the real Schubert calculus. <i>Experimental Mathematics</i>. 2015;24(3):261-269. doi:<a href=\"https://doi.org/10.1080/10586458.2014.980044\">10.1080/10586458.2014.980044</a>","ieee":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, and Z. Teitler, “The monotone secant conjecture in the real Schubert calculus,” <i>Experimental Mathematics</i>, vol. 24, no. 3. Taylor &#38; Francis, pp. 261–269, 2015.","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.” <i>Experimental Mathematics</i>, vol. 24, no. 3, Taylor &#38; Francis, 2015, pp. 261–69, doi:<a href=\"https://doi.org/10.1080/10586458.2014.980044\">10.1080/10586458.2014.980044</a>."},"publisher":"Taylor & Francis","date_published":"2015-06-23T00:00:00Z","title":"The monotone secant conjecture in the real Schubert calculus","abstract":[{"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. ","lang":"eng"}],"publication_status":"published"},{"citation":{"mla":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” <i>Scandinavian Journal of Statistics</i>, vol. 42, no. 3, Wiley, 2015, pp. 832–47, doi:<a href=\"https://doi.org/10.1111/sjos.12139\">10.1111/sjos.12139</a>.","short":"A. Klimova, T. Rudas, Scandinavian Journal of Statistics 42 (2015) 832–847.","apa":"Klimova, A., &#38; Rudas, T. (2015). Iterative scaling in curved exponential families. <i>Scandinavian Journal of Statistics</i>. Wiley. <a href=\"https://doi.org/10.1111/sjos.12139\">https://doi.org/10.1111/sjos.12139</a>","chicago":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” <i>Scandinavian Journal of Statistics</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/sjos.12139\">https://doi.org/10.1111/sjos.12139</a>.","ista":"Klimova A, Rudas T. 2015. Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. 42(3), 832–847.","ama":"Klimova A, Rudas T. Iterative scaling in curved exponential families. <i>Scandinavian Journal of Statistics</i>. 2015;42(3):832-847. doi:<a href=\"https://doi.org/10.1111/sjos.12139\">10.1111/sjos.12139</a>","ieee":"A. Klimova and T. Rudas, “Iterative scaling in curved exponential families,” <i>Scandinavian Journal of Statistics</i>, vol. 42, no. 3. Wiley, pp. 832–847, 2015."},"date_updated":"2021-01-12T06:54:41Z","department":[{"_id":"CaUh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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"}],"publication_status":"published","title":"Iterative scaling in curved exponential families","publisher":"Wiley","date_published":"2015-09-01T00:00:00Z","oa":1,"doi":"10.1111/sjos.12139","year":"2015","page":"832 - 847","day":"01","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).","scopus_import":1,"publication":"Scandinavian Journal of Statistics","intvolume":"        42","publist_id":"5068","oa_version":"Preprint","quality_controlled":"1","author":[{"id":"31934120-F248-11E8-B48F-1D18A9856A87","full_name":"Klimova, Anna","last_name":"Klimova","first_name":"Anna"},{"last_name":"Rudas","first_name":"Tamás","full_name":"Rudas, Tamás"}],"issue":"3","month":"09","volume":42,"language":[{"iso":"eng"}],"type":"journal_article","_id":"2008","date_created":"2018-12-11T11:55:11Z","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1307.3282","open_access":"1"}]},{"intvolume":"        87","publist_id":"5062","publication":"Computational Statistics & Data Analysis","scopus_import":1,"year":"2015","day":"01","doi":"10.1016/j.csda.2015.01.017","status":"public","page":"57 - 72","main_file_link":[{"url":"http://arxiv.org/abs/1404.6617","open_access":"1"}],"oa":1,"date_created":"2018-12-11T11:55:13Z","_id":"2014","type":"journal_article","date_published":"2015-07-01T00:00:00Z","publisher":"Elsevier","language":[{"iso":"eng"}],"volume":87,"title":"Faithfulness and learning hypergraphs from discrete distributions","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."}],"publication_status":"published","month":"07","issue":"7","author":[{"full_name":"Klimova, Anna","id":"31934120-F248-11E8-B48F-1D18A9856A87","last_name":"Klimova","first_name":"Anna"},{"full_name":"Uhler, Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216","first_name":"Caroline","last_name":"Uhler"},{"first_name":"Tamás","last_name":"Rudas","full_name":"Rudas, Tamás"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:54:43Z","quality_controlled":"1","department":[{"_id":"CaUh"}],"oa_version":"Preprint","citation":{"short":"A. Klimova, C. Uhler, T. Rudas, Computational Statistics &#38; Data Analysis 87 (2015) 57–72.","mla":"Klimova, Anna, et al. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” <i>Computational Statistics &#38; Data Analysis</i>, vol. 87, no. 7, Elsevier, 2015, pp. 57–72, doi:<a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">10.1016/j.csda.2015.01.017</a>.","ista":"Klimova A, Uhler C, Rudas T. 2015. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics &#38; Data Analysis. 87(7), 57–72.","ama":"Klimova A, Uhler C, Rudas T. Faithfulness and learning hypergraphs from discrete distributions. <i>Computational Statistics &#38; Data Analysis</i>. 2015;87(7):57-72. doi:<a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">10.1016/j.csda.2015.01.017</a>","chicago":"Klimova, Anna, Caroline Uhler, and Tamás Rudas. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” <i>Computational Statistics &#38; Data Analysis</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">https://doi.org/10.1016/j.csda.2015.01.017</a>.","apa":"Klimova, A., Uhler, C., &#38; Rudas, T. (2015). Faithfulness and learning hypergraphs from discrete distributions. <i>Computational Statistics &#38; Data Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.csda.2015.01.017\">https://doi.org/10.1016/j.csda.2015.01.017</a>","ieee":"A. Klimova, C. Uhler, and T. Rudas, “Faithfulness and learning hypergraphs from discrete distributions,” <i>Computational Statistics &#38; Data Analysis</i>, vol. 87, no. 7. Elsevier, pp. 57–72, 2015."}},{"pubrep_id":"615","status":"public","date_created":"2018-12-11T11:55:17Z","type":"journal_article","_id":"2025","language":[{"iso":"eng"}],"volume":1853,"month":"01","has_accepted_license":"1","issue":"1","file":[{"access_level":"open_access","file_size":926685,"checksum":"5bb328edebb6a91337cadd7d63f961b7","file_id":"4936","creator":"system","relation":"main_file","file_name":"IST-2016-615-v1+1_BBAMCR.pdf","date_created":"2018-12-12T10:12:18Z","date_updated":"2020-07-14T12:45:25Z","content_type":"application/pdf"}],"author":[{"full_name":"Kawada, Daiki","last_name":"Kawada","first_name":"Daiki"},{"first_name":"Hiromu","last_name":"Kobayashi","full_name":"Kobayashi, Hiromu"},{"full_name":"Tomita, Tsuyoshi","first_name":"Tsuyoshi","last_name":"Tomita"},{"first_name":"Eisuke","last_name":"Nakata","full_name":"Nakata, Eisuke"},{"full_name":"Nagano, Makoto","last_name":"Nagano","first_name":"Makoto"},{"full_name":"Siekhaus, Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","first_name":"Daria E","last_name":"Siekhaus"},{"full_name":"Toshima, Junko","last_name":"Toshima","first_name":"Junko"},{"first_name":"Jiro","last_name":"Toshimaa","full_name":"Toshimaa, Jiro"}],"quality_controlled":"1","oa_version":"Submitted Version","intvolume":"      1853","publist_id":"5047","publication":"Biochimica et Biophysica Acta - Molecular Cell Research","scopus_import":1,"day":"01","doi":"10.1016/j.bbamcr.2014.10.009","year":"2015","page":"144 - 156","oa":1,"file_date_updated":"2020-07-14T12:45:25Z","date_published":"2015-01-01T00:00:00Z","publisher":"Elsevier","title":"The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins","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."}],"publication_status":"published","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:54:48Z","department":[{"_id":"DaSi"}],"citation":{"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. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">https://doi.org/10.1016/j.bbamcr.2014.10.009</a>","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.","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.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">https://doi.org/10.1016/j.bbamcr.2014.10.009</a>.","ama":"Kawada D, Kobayashi H, Tomita T, et al. The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. 2015;1853(1):144-156. doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">10.1016/j.bbamcr.2014.10.009</a>","ieee":"D. Kawada <i>et al.</i>, “The yeast Arf-GAP Glo3p is required for the endocytic recycling of cell surface proteins,” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 1. Elsevier, pp. 144–156, 2015.","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.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 1, Elsevier, 2015, pp. 144–56, doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2014.10.009\">10.1016/j.bbamcr.2014.10.009</a>."}},{"_id":"2030","type":"journal_article","oa":1,"date_created":"2018-12-11T11:55:18Z","year":"2015","day":"01","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1311.2481","open_access":"1"}],"page":"1 - 11","doi":"10.1016/j.compfluid.2014.09.021","scopus_import":1,"publication":"Computers and Fluids","publist_id":"5042","intvolume":"       106","citation":{"mla":"Shi, Liang, et al. “A Hybrid MPI-OpenMP Parallel Implementation for Pseudospectral Simulations with Application to Taylor-Couette Flow.” <i>Computers and Fluids</i>, vol. 106, no. 1, Elsevier, 2015, pp. 1–11, doi:<a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">10.1016/j.compfluid.2014.09.021</a>.","short":"L. Shi, M. Rampp, B. Hof, M. Avila, Computers and Fluids 106 (2015) 1–11.","apa":"Shi, L., Rampp, M., Hof, B., &#38; Avila, M. (2015). A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. <i>Computers and Fluids</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">https://doi.org/10.1016/j.compfluid.2014.09.021</a>","ama":"Shi L, Rampp M, Hof B, Avila M. A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow. <i>Computers and Fluids</i>. 2015;106(1):1-11. doi:<a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">10.1016/j.compfluid.2014.09.021</a>","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.","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.” <i>Computers and Fluids</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.compfluid.2014.09.021\">https://doi.org/10.1016/j.compfluid.2014.09.021</a>.","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,” <i>Computers and Fluids</i>, vol. 106, no. 1. Elsevier, pp. 1–11, 2015."},"oa_version":"Preprint","quality_controlled":"1","department":[{"_id":"BjHo"}],"date_updated":"2021-01-12T06:54:51Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Shi","first_name":"Liang","id":"374A3F1A-F248-11E8-B48F-1D18A9856A87","full_name":"Shi, Liang"},{"first_name":"Markus","last_name":"Rampp","full_name":"Rampp, Markus"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Hof, Björn","first_name":"Björn","last_name":"Hof","orcid":"0000-0003-2057-2754"},{"full_name":"Avila, Marc","first_name":"Marc","last_name":"Avila"}],"issue":"1","publication_status":"published","month":"01","abstract":[{"lang":"eng","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."}],"title":"A hybrid MPI-OpenMP parallel implementation for pseudospectral simulations with application to Taylor-Couette flow","volume":106,"date_published":"2015-01-01T00:00:00Z","publisher":"Elsevier","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"volume":115,"month":"01","issue":"1","author":[{"full_name":"Bérard, Béatrice","last_name":"Bérard","first_name":"Béatrice"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nathalie","last_name":"Sznajder","full_name":"Sznajder, Nathalie"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Preprint","ec_funded":1,"status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4225"}],"date_created":"2018-12-11T11:55:20Z","_id":"2034","type":"journal_article","date_published":"2015-01-01T00:00:00Z","publisher":"Elsevier","title":"Probabilistic opacity for Markov decision processes","abstract":[{"lang":"eng","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."}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:54:52Z","department":[{"_id":"KrCh"}],"citation":{"mla":"Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.” <i> Information Processing Letters</i>, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>.","short":"B. Bérard, K. Chatterjee, N. Sznajder,  Information Processing Letters 115 (2015) 52–59.","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. <i> Information Processing Letters</i>. 2015;115(1):52-59. doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>","chicago":"Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” <i> Information Processing Letters</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>.","apa":"Bérard, B., Chatterjee, K., &#38; Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. <i> Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>","ieee":"B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” <i> Information Processing Letters</i>, vol. 115, no. 1. Elsevier, pp. 52–59, 2015."},"intvolume":"       115","publist_id":"5025","publication":" Information Processing Letters","scopus_import":1,"doi":"10.1016/j.ipl.2014.09.001","year":"2015","page":"52 - 59","day":"01","oa":1}]