[{"date_updated":"2025-04-15T07:31:57Z","ddc":["570"],"publication_status":"published","status":"public","doi":"10.2217/fnl.14.18","oa":1,"oa_version":"Published Version","volume":9,"day":"01","article_processing_charge":"No","pubrep_id":"528","file":[{"creator":"system","date_updated":"2020-07-14T12:45:31Z","file_size":3848424,"content_type":"application/pdf","date_created":"2018-12-12T10:10:25Z","file_name":"IST-2016-528-v1+1_fnl.14.18.pdf","file_id":"4812","access_level":"open_access","checksum":"ba06659ecadabceec9a37dd8c4586dce","relation":"main_file"}],"file_date_updated":"2020-07-14T12:45:31Z","project":[{"grant_number":"618444","call_identifier":"FP7","_id":"25D61E48-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms of Cerebral Cortex Development"}],"citation":{"ieee":"M. P. Postiglione and S. Hippenmeyer, “Monitoring neurogenesis in the cerebral cortex: an update,” <i>Future Neurology</i>, vol. 9, no. 3. Future Science Group, pp. 323–340, 2014.","ama":"Postiglione MP, Hippenmeyer S. Monitoring neurogenesis in the cerebral cortex: an update. <i>Future Neurology</i>. 2014;9(3):323-340. doi:<a href=\"https://doi.org/10.2217/fnl.14.18\">10.2217/fnl.14.18</a>","apa":"Postiglione, M. P., &#38; Hippenmeyer, S. (2014). Monitoring neurogenesis in the cerebral cortex: an update. <i>Future Neurology</i>. Future Science Group. <a href=\"https://doi.org/10.2217/fnl.14.18\">https://doi.org/10.2217/fnl.14.18</a>","mla":"Postiglione, Maria P., and Simon Hippenmeyer. “Monitoring Neurogenesis in the Cerebral Cortex: An Update.” <i>Future Neurology</i>, vol. 9, no. 3, Future Science Group, 2014, pp. 323–40, doi:<a href=\"https://doi.org/10.2217/fnl.14.18\">10.2217/fnl.14.18</a>.","short":"M.P. Postiglione, S. Hippenmeyer, Future Neurology 9 (2014) 323–340.","ista":"Postiglione MP, Hippenmeyer S. 2014. Monitoring neurogenesis in the cerebral cortex: an update. Future Neurology. 9(3), 323–340.","chicago":"Postiglione, Maria P, and Simon Hippenmeyer. “Monitoring Neurogenesis in the Cerebral Cortex: An Update.” <i>Future Neurology</i>. Future Science Group, 2014. <a href=\"https://doi.org/10.2217/fnl.14.18\">https://doi.org/10.2217/fnl.14.18</a>."},"year":"2014","has_accepted_license":"1","month":"05","publication":"Future Neurology","ec_funded":1,"type":"journal_article","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","corr_author":"1","publication_identifier":{"eissn":["1748-6971"],"issn":["1479-6708"]},"title":"Monitoring neurogenesis in the cerebral cortex: an update","department":[{"_id":"SiHi"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"author":[{"first_name":"Maria P","id":"2C67902A-F248-11E8-B48F-1D18A9856A87","last_name":"Postiglione","full_name":"Postiglione, Maria P"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"The cerebral cortex, the seat of our cognitive abilities, is composed of an intricate network of billions of excitatory projection and inhibitory interneurons. Postmitotic cortical neurons are generated by a diverse set of neural stem cell progenitors within dedicated zones and defined periods of neurogenesis during embryonic development. Disruptions in neurogenesis can lead to alterations in the neuronal cytoarchitecture, which is thought to represent a major underlying cause for several neurological disorders, including microcephaly, autism and epilepsy. Although a number of signaling pathways regulating neurogenesis have been described, the precise cellular and molecular mechanisms regulating the functional neural stem cell properties in cortical neurogenesis remain unclear. Here, we discuss the most up-to-date strategies to monitor the fundamental mechanistic parameters of neuronal progenitor proliferation, and recent advances deciphering the logic and dynamics of neurogenesis."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Future Science Group","publist_id":"4806","date_created":"2018-12-11T11:56:09Z","issue":"3","scopus_import":"1","language":[{"iso":"eng"}],"date_published":"2014-05-01T00:00:00Z","intvolume":"         9","_id":"2175","page":"323 - 340"},{"date_updated":"2025-09-29T11:36:43Z","status":"public","publication_status":"published","doi":"10.1038/nprot.2014.099","oa_version":"None","volume":9,"day":"29","article_processing_charge":"No","project":[{"name":"Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen","_id":"25BDE9A4-B435-11E9-9278-68D0E5697425","grant_number":"SFB-TR3-TP10B"}],"citation":{"ieee":"D. Studer <i>et al.</i>, “Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue,” <i>Nature Protocols</i>, vol. 9, no. 6. Nature Publishing Group, pp. 1480–1495, 2014.","mla":"Studer, Daniel, et al. “Capture of Activity-Induced Ultrastructural Changes at Synapses by High-Pressure Freezing of Brain Tissue.” <i>Nature Protocols</i>, vol. 9, no. 6, Nature Publishing Group, 2014, pp. 1480–95, doi:<a href=\"https://doi.org/10.1038/nprot.2014.099\">10.1038/nprot.2014.099</a>.","short":"D. Studer, S. Zhao, X. Chai, P.M. Jonas, W. Graber, S. Nestel, M. Frotscher, Nature Protocols 9 (2014) 1480–1495.","ista":"Studer D, Zhao S, Chai X, Jonas PM, Graber W, Nestel S, Frotscher M. 2014. Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. Nature Protocols. 9(6), 1480–1495.","chicago":"Studer, Daniel, Shanting Zhao, Xuejun Chai, Peter M Jonas, Werner Graber, Sigrun Nestel, and Michael Frotscher. “Capture of Activity-Induced Ultrastructural Changes at Synapses by High-Pressure Freezing of Brain Tissue.” <i>Nature Protocols</i>. Nature Publishing Group, 2014. <a href=\"https://doi.org/10.1038/nprot.2014.099\">https://doi.org/10.1038/nprot.2014.099</a>.","ama":"Studer D, Zhao S, Chai X, et al. Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. <i>Nature Protocols</i>. 2014;9(6):1480-1495. doi:<a href=\"https://doi.org/10.1038/nprot.2014.099\">10.1038/nprot.2014.099</a>","apa":"Studer, D., Zhao, S., Chai, X., Jonas, P. M., Graber, W., Nestel, S., &#38; Frotscher, M. (2014). Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue. <i>Nature Protocols</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nprot.2014.099\">https://doi.org/10.1038/nprot.2014.099</a>"},"year":"2014","external_id":{"isi":["000337145800020"]},"month":"05","publication":"Nature Protocols","type":"journal_article","title":"Capture of activity-induced ultrastructural changes at synapses by high-pressure freezing of brain tissue","department":[{"_id":"PeJo"}],"author":[{"first_name":"Daniel","last_name":"Studer","full_name":"Studer, Daniel"},{"full_name":"Zhao, Shanting","first_name":"Shanting","last_name":"Zhao"},{"last_name":"Chai","first_name":"Xuejun","full_name":"Chai, Xuejun"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M"},{"full_name":"Graber, Werner","first_name":"Werner","last_name":"Graber"},{"last_name":"Nestel","first_name":"Sigrun","full_name":"Nestel, Sigrun"},{"last_name":"Frotscher","first_name":"Michael","full_name":"Frotscher, Michael"}],"abstract":[{"lang":"eng","text":"Electron microscopy (EM) allows for the simultaneous visualization of all tissue components at high resolution. However, the extent to which conventional aldehyde fixation and ethanol dehydration of the tissue alter the fine structure of cells and organelles, thereby preventing detection of subtle structural changes induced by an experiment, has remained an issue. Attempts have been made to rapidly freeze tissue to preserve native ultrastructure. Shock-freezing of living tissue under high pressure (high-pressure freezing, HPF) followed by cryosubstitution of the tissue water avoids aldehyde fixation and dehydration in ethanol; the tissue water is immobilized in â ̂1/450 ms, and a close-to-native fine structure of cells, organelles and molecules is preserved. Here we describe a protocol for HPF that is useful to monitor ultrastructural changes associated with functional changes at synapses in the brain but can be applied to many other tissues as well. The procedure requires a high-pressure freezer and takes a minimum of 7 d but can be paused at several points."}],"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"publisher":"Nature Publishing Group","publist_id":"4807","date_created":"2018-12-11T11:56:09Z","issue":"6","scopus_import":"1","language":[{"iso":"eng"}],"date_published":"2014-05-29T00:00:00Z","_id":"2176","intvolume":"         9","page":"1480 - 1495"},{"_id":"2177","page":"152 - 160","date_published":"2014-01-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","month":"01","date_created":"2018-12-11T11:56:09Z","scopus_import":1,"publist_id":"4805","conference":{"end_date":"2014-01-07","location":"Portland, USA","name":"SODA: Symposium on Discrete Algorithms","start_date":"2014-01-05"},"citation":{"ama":"Edelsbrunner H, Parsa S. On the computational complexity of betti numbers reductions from matrix rank. In: <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>. SIAM; 2014:152-160. doi:<a href=\"https://doi.org/10.1137/1.9781611973402.11\">10.1137/1.9781611973402.11</a>","apa":"Edelsbrunner, H., &#38; Parsa, S. (2014). On the computational complexity of betti numbers reductions from matrix rank. In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 152–160). Portland, USA: SIAM. <a href=\"https://doi.org/10.1137/1.9781611973402.11\">https://doi.org/10.1137/1.9781611973402.11</a>","chicago":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” In <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 152–60. SIAM, 2014. <a href=\"https://doi.org/10.1137/1.9781611973402.11\">https://doi.org/10.1137/1.9781611973402.11</a>.","short":"H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–160.","mla":"Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.” <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, SIAM, 2014, pp. 152–60, doi:<a href=\"https://doi.org/10.1137/1.9781611973402.11\">10.1137/1.9781611973402.11</a>.","ista":"Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.","ieee":"H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers reductions from matrix rank,” in <i>Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Portland, USA, 2014, pp. 152–160."},"year":"2014","publisher":"SIAM","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We give evidence for the difficulty of computing Betti numbers of simplicial complexes over a finite field. We do this by reducing the rank computation for sparse matrices with to non-zero entries to computing Betti numbers of simplicial complexes consisting of at most a constant times to simplices. Together with the known reduction in the other direction, this implies that the two problems have the same computational complexity."}],"day":"01","quality_controlled":"1","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Parsa, Salman","last_name":"Parsa","id":"4BDBD4F2-F248-11E8-B48F-1D18A9856A87","first_name":"Salman"}],"oa_version":"None","department":[{"_id":"HeEd"}],"status":"public","publication_status":"published","title":"On the computational complexity of betti numbers reductions from matrix rank","doi":"10.1137/1.9781611973402.11","corr_author":"1","type":"conference","date_updated":"2024-10-09T20:55:33Z"},{"publication":"Beitrage zur Algebra und Geometrie","month":"03","external_id":{"arxiv":["1204.3070"]},"year":"2014","citation":{"ista":"Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. 2014. Markov degree of the three-state toric homogeneous Markov chain model. Beitrage zur Algebra und Geometrie. 55(1), 161–188.","mla":"Haws, David, et al. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.” <i>Beitrage Zur Algebra Und Geometrie</i>, vol. 55, no. 1, Springer, 2014, pp. 161–88, doi:<a href=\"https://doi.org/10.1007/s13366-013-0178-y\">10.1007/s13366-013-0178-y</a>.","short":"D. Haws, A. Martin del Campo Sanchez, A. Takemura, R. Yoshida, Beitrage Zur Algebra Und Geometrie 55 (2014) 161–188.","chicago":"Haws, David, Abraham Martin del Campo Sanchez, Akimichi Takemura, and Ruriko Yoshida. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.” <i>Beitrage Zur Algebra Und Geometrie</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s13366-013-0178-y\">https://doi.org/10.1007/s13366-013-0178-y</a>.","apa":"Haws, D., Martin del Campo Sanchez, A., Takemura, A., &#38; Yoshida, R. (2014). Markov degree of the three-state toric homogeneous Markov chain model. <i>Beitrage Zur Algebra Und Geometrie</i>. Springer. <a href=\"https://doi.org/10.1007/s13366-013-0178-y\">https://doi.org/10.1007/s13366-013-0178-y</a>","ama":"Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. Markov degree of the three-state toric homogeneous Markov chain model. <i>Beitrage zur Algebra und Geometrie</i>. 2014;55(1):161-188. doi:<a href=\"https://doi.org/10.1007/s13366-013-0178-y\">10.1007/s13366-013-0178-y</a>","ieee":"D. Haws, A. Martin del Campo Sanchez, A. Takemura, and R. Yoshida, “Markov degree of the three-state toric homogeneous Markov chain model,” <i>Beitrage zur Algebra und Geometrie</i>, vol. 55, no. 1. Springer, pp. 161–188, 2014."},"oa_version":"Submitted Version","oa":1,"day":"01","article_processing_charge":"No","volume":55,"date_updated":"2025-06-11T07:59:53Z","doi":"10.1007/s13366-013-0178-y","publication_status":"published","status":"public","acknowledgement":"Research of Martín del Campo supported in part by NSF Grant DMS-915211.","language":[{"iso":"eng"}],"scopus_import":"1","issue":"1","date_created":"2018-12-11T11:56:10Z","page":"161 - 188","_id":"2178","intvolume":"        55","date_published":"2014-03-01T00:00:00Z","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4804","author":[{"first_name":"David","last_name":"Haws","full_name":"Haws, David"},{"full_name":"Martin Del Campo Sanchez, Abraham","id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","first_name":"Abraham","last_name":"Martin Del Campo Sanchez"},{"first_name":"Akimichi","last_name":"Takemura","full_name":"Takemura, Akimichi"},{"first_name":"Ruriko","last_name":"Yoshida","full_name":"Yoshida, Ruriko"}],"department":[{"_id":"CaUh"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"We consider the three-state toric homogeneous Markov chain model (THMC) without loops and initial parameters. At time T, the size of the design matrix is 6 × 3 · 2T-1 and the convex hull of its columns is the model polytope. We study the behavior of this polytope for T ≥ 3 and we show that it is defined by 24 facets for all T ≥ 5. Moreover, we give a complete description of these facets. From this, we deduce that the toric ideal associated with the design matrix is generated by binomials of degree at most 6. Our proof is based on a result due to Sturmfels, who gave a bound on the degree of the generators of a toric ideal, provided the normality of the corresponding toric variety. In our setting, we established the normality of the toric variety associated to the THMC model by studying the geometric properties of the model polytope."}],"arxiv":1,"type":"journal_article","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.3070"}],"title":"Markov degree of the three-state toric homogeneous Markov chain model"},{"ddc":["570"],"publication_status":"published","status":"public","doi":"10.1214/ECP.v19-3121","date_updated":"2025-09-29T11:35:54Z","volume":19,"article_processing_charge":"No","pubrep_id":"426","day":"09","file_date_updated":"2020-07-14T12:45:31Z","file":[{"file_id":"4729","file_name":"IST-2016-426-v1+1_3121-17518-1-PB.pdf","date_created":"2018-12-12T10:09:06Z","relation":"main_file","access_level":"open_access","checksum":"bd8a041c76d62fe820bf73ff13ce7d1b","file_size":327322,"date_updated":"2020-07-14T12:45:31Z","creator":"system","content_type":"application/pdf"}],"oa":1,"oa_version":"Published Version","has_accepted_license":"1","citation":{"ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Local semicircle law with imprimitive variance matrix,” <i>Electronic Communications in Probability</i>, vol. 19. Institute of Mathematical Statistics, 2014.","mla":"Ajanki, Oskari H., et al. “Local Semicircle Law with Imprimitive Variance Matrix.” <i>Electronic Communications in Probability</i>, vol. 19, Institute of Mathematical Statistics, 2014, doi:<a href=\"https://doi.org/10.1214/ECP.v19-3121\">10.1214/ECP.v19-3121</a>.","ista":"Ajanki OH, Erdös L, Krüger TH. 2014. Local semicircle law with imprimitive variance matrix. Electronic Communications in Probability. 19.","short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Electronic Communications in Probability 19 (2014).","chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Local Semicircle Law with Imprimitive Variance Matrix.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2014. <a href=\"https://doi.org/10.1214/ECP.v19-3121\">https://doi.org/10.1214/ECP.v19-3121</a>.","apa":"Ajanki, O. H., Erdös, L., &#38; Krüger, T. H. (2014). Local semicircle law with imprimitive variance matrix. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/ECP.v19-3121\">https://doi.org/10.1214/ECP.v19-3121</a>","ama":"Ajanki OH, Erdös L, Krüger TH. Local semicircle law with imprimitive variance matrix. <i>Electronic Communications in Probability</i>. 2014;19. doi:<a href=\"https://doi.org/10.1214/ECP.v19-3121\">10.1214/ECP.v19-3121</a>"},"year":"2014","external_id":{"isi":["000341869300001"]},"publication":"Electronic Communications in Probability","month":"06","title":"Local semicircle law with imprimitive variance matrix","license":"https://creativecommons.org/licenses/by/4.0/","corr_author":"1","type":"journal_article","abstract":[{"text":"We extend the proof of the local semicircle law for generalized Wigner matrices given in MR3068390 to the case when the matrix of variances has an eigenvalue -1. In particular, this result provides a short proof of the optimal local Marchenko-Pastur law at the hard edge (i.e. around zero) for sample covariance matrices X*X, where the variances of the entries of X may vary.","lang":"eng"}],"quality_controlled":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"LaEr"}],"author":[{"last_name":"Ajanki","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87","first_name":"Oskari H","full_name":"Ajanki, Oskari H"},{"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ó"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","first_name":"Torben H","last_name":"Krüger","full_name":"Krüger, Torben H"}],"publist_id":"4803","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"publisher":"Institute of Mathematical Statistics","date_published":"2014-06-09T00:00:00Z","_id":"2179","intvolume":"        19","date_created":"2018-12-11T11:56:10Z","scopus_import":"1","language":[{"iso":"eng"}]},{"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01009578/document"}],"corr_author":"1","type":"journal_article","title":"Learning a priori constrained weighted majority votes","department":[{"_id":"ChLa"}],"author":[{"first_name":"Aurélien","last_name":"Bellet","full_name":"Bellet, Aurélien"},{"first_name":"Amaury","last_name":"Habrard","full_name":"Habrard, Amaury"},{"last_name":"Morvant","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","first_name":"Emilie","orcid":"0000-0002-8301-7240","full_name":"Morvant, Emilie"},{"first_name":"Marc","last_name":"Sebban","full_name":"Sebban, Marc"}],"abstract":[{"text":"Weighted majority votes allow one to combine the output of several classifiers or voters. MinCq is a recent algorithm for optimizing the weight of each voter based on the minimization of a theoretical bound over the risk of the vote with elegant PAC-Bayesian generalization guarantees. However, while it has demonstrated good performance when combining weak classifiers, MinCq cannot make use of the useful a priori knowledge that one may have when using a mixture of weak and strong voters. In this paper, we propose P-MinCq, an extension of MinCq that can incorporate such knowledge in the form of a  constraint over the distribution of the weights, along with general proofs of convergence that stand in the sample compression setting for data-dependent voters. The approach is applied to a vote of k-NN classifiers with a specific modeling of the voters' performance. P-MinCq significantly outperforms the classic k-NN classifier, a symmetric NN and MinCq using the same voters. We show that it is also competitive with LMNN, a popular metric learning algorithm, and that combining both approaches further reduces the error.","lang":"eng"}],"quality_controlled":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"publisher":"Springer","publist_id":"4802","issue":"1-2","date_created":"2018-12-11T11:56:10Z","scopus_import":"1","language":[{"iso":"eng"}],"acknowledgement":"This work was funded by the French project SoLSTiCe ANR-13-BS02-01 of the ANR. ","date_published":"2014-10-01T00:00:00Z","intvolume":"        97","_id":"2180","page":"129 - 154","date_updated":"2025-09-29T11:35:24Z","status":"public","publication_status":"published","doi":"10.1007/s10994-014-5462-z","oa":1,"oa_version":"Submitted Version","volume":97,"article_processing_charge":"No","day":"01","project":[{"name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"308036"}],"year":"2014","citation":{"chicago":"Bellet, Aurélien, Amaury Habrard, Emilie Morvant, and Marc Sebban. “Learning a Priori Constrained Weighted Majority Votes.” <i>Machine Learning</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s10994-014-5462-z\">https://doi.org/10.1007/s10994-014-5462-z</a>.","mla":"Bellet, Aurélien, et al. “Learning a Priori Constrained Weighted Majority Votes.” <i>Machine Learning</i>, vol. 97, no. 1–2, Springer, 2014, pp. 129–54, doi:<a href=\"https://doi.org/10.1007/s10994-014-5462-z\">10.1007/s10994-014-5462-z</a>.","short":"A. Bellet, A. Habrard, E. Morvant, M. Sebban, Machine Learning 97 (2014) 129–154.","ista":"Bellet A, Habrard A, Morvant E, Sebban M. 2014. Learning a priori constrained weighted majority votes. Machine Learning. 97(1–2), 129–154.","ama":"Bellet A, Habrard A, Morvant E, Sebban M. Learning a priori constrained weighted majority votes. <i>Machine Learning</i>. 2014;97(1-2):129-154. doi:<a href=\"https://doi.org/10.1007/s10994-014-5462-z\">10.1007/s10994-014-5462-z</a>","apa":"Bellet, A., Habrard, A., Morvant, E., &#38; Sebban, M. (2014). Learning a priori constrained weighted majority votes. <i>Machine Learning</i>. Springer. <a href=\"https://doi.org/10.1007/s10994-014-5462-z\">https://doi.org/10.1007/s10994-014-5462-z</a>","ieee":"A. Bellet, A. Habrard, E. Morvant, and M. Sebban, “Learning a priori constrained weighted majority votes,” <i>Machine Learning</i>, vol. 97, no. 1–2. Springer, pp. 129–154, 2014."},"external_id":{"isi":["000341431300007"]},"publication":"Machine Learning","month":"10","ec_funded":1},{"ec_funded":1,"publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","month":"06","external_id":{"arxiv":["1403.3209"],"isi":["000337733900007"]},"citation":{"ieee":"V. Botella Soler and P. Glendinning, “Hierarchy and polysynchrony in an adaptive network ,” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 89, no. 6. American Institute of Physics, 2014.","apa":"Botella Soler, V., &#38; Glendinning, P. (2014). Hierarchy and polysynchrony in an adaptive network . <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.89.062809\">https://doi.org/10.1103/PhysRevE.89.062809</a>","ama":"Botella Soler V, Glendinning P. Hierarchy and polysynchrony in an adaptive network . <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. 2014;89(6). doi:<a href=\"https://doi.org/10.1103/PhysRevE.89.062809\">10.1103/PhysRevE.89.062809</a>","chicago":"Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony in an Adaptive Network .” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 2014. <a href=\"https://doi.org/10.1103/PhysRevE.89.062809\">https://doi.org/10.1103/PhysRevE.89.062809</a>.","ista":"Botella Soler V, Glendinning P. 2014. Hierarchy and polysynchrony in an adaptive network . Physical Review E Statistical Nonlinear and Soft Matter Physics. 89(6), 062809.","mla":"Botella Soler, Vicente, and Paul Glendinning. “Hierarchy and Polysynchrony in an Adaptive Network .” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 89, no. 6, 062809, American Institute of Physics, 2014, doi:<a href=\"https://doi.org/10.1103/PhysRevE.89.062809\">10.1103/PhysRevE.89.062809</a>.","short":"V. Botella Soler, P. Glendinning, Physical Review E Statistical Nonlinear and Soft Matter Physics 89 (2014)."},"year":"2014","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"article_processing_charge":"No","day":"16","volume":89,"oa_version":"Preprint","oa":1,"doi":"10.1103/PhysRevE.89.062809","publication_status":"published","status":"public","date_updated":"2025-09-29T11:34:45Z","article_number":"062809","_id":"2183","intvolume":"        89","date_published":"2014-06-16T00:00:00Z","acknowledgement":"V.B.S. is partially supported by contract MEC (Grant No. AYA2010-22111-C03-02).\r\n","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2018-12-11T11:56:11Z","issue":"6","publist_id":"4798","publisher":"American Institute of Physics","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","quality_controlled":"1","abstract":[{"text":"We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be nontrivial. The structure of the network shows interesting hierarchical properties and in certain parameter regions the dynamics is polysynchronous: Nodes can be divided in differently synchronized classes but, contrary to cluster synchronization, nodes in the same class need not be connected to each other. These complicated synchrony patterns have been conjectured to play roles in systems biology and circuits. The adaptive system we study describes ways whereby this behavior can evolve from undifferentiated nodes.","lang":"eng"}],"author":[{"full_name":"Botella Soler, Vicente","id":"421234E8-F248-11E8-B48F-1D18A9856A87","first_name":"Vicente","orcid":"0000-0002-8790-1914","last_name":"Botella Soler"},{"full_name":"Glendinning, Paul","last_name":"Glendinning","first_name":"Paul"}],"department":[{"_id":"GaTk"}],"title":"Hierarchy and polysynchrony in an adaptive network ","arxiv":1,"corr_author":"1","type":"journal_article","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.3209"}]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"ACM","isi":1,"publist_id":"4797","scopus_import":"1","issue":"3","date_created":"2018-12-11T11:56:12Z","acknowledgement":"The research by M. K. was supported by project GAUK 49209. The research by M. K. was also supported by project 1M0545 by the Ministry of Education of the Czech Republic and by Center of Excellence { Inst. for Theor. Comput. Sci., Prague (project P202/12/G061 of GACR). The research by U. W. was supported by the Swiss National Science Foundation (SNF Projects 200021-125309, 200020-138230, and PP00P2-138948).","language":[{"iso":"eng"}],"date_published":"2014-05-01T00:00:00Z","article_number":"17 ","_id":"2184","intvolume":"        61","main_file_link":[{"url":"http://arxiv.org/abs/1105.6257","open_access":"1"}],"arxiv":1,"type":"journal_article","title":"Computing all maps into a sphere","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"author":[{"full_name":"Čadek, Martin","first_name":"Martin","last_name":"Čadek"},{"id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","last_name":"Krcál","full_name":"Krcál, Marek"},{"last_name":"Matoušek","first_name":"Jiří","full_name":"Matoušek, Jiří"},{"full_name":"Sergeraert, Francis","first_name":"Francis","last_name":"Sergeraert"},{"full_name":"Vokřínek, Lukáš","first_name":"Lukáš","last_name":"Vokřínek"},{"full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Given topological spaces X,Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X→ Y. We consider a computational version, where X,Y are given as finite simplicial complexes, and the goal is to compute [X,Y], that is, all homotopy classes of suchmaps.We solve this problem in the stable range, where for some d ≥ 2, we have dim X ≤ 2d-2 and Y is (d-1)-connected; in particular, Y can be the d-dimensional sphere Sd. The algorithm combines classical tools and ideas from homotopy theory (obstruction theory, Postnikov systems, and simplicial sets) with algorithmic tools from effective algebraic topology (locally effective simplicial sets and objects with effective homology). In contrast, [X,Y] is known to be uncomputable for general X,Y, since for X = S1 it includes a well known undecidable problem: testing triviality of the fundamental group of Y. In follow-up papers, the algorithm is shown to run in polynomial time for d fixed, and extended to other problems, such as the extension problem, where we are given a subspace A ⊂ X and a map A→ Y and ask whether it extends to a map X → Y, or computing the Z2-index-everything in the stable range. Outside the stable range, the extension problem is undecidable."}],"external_id":{"isi":["000337201400003"],"arxiv":["1105.6257"]},"citation":{"ieee":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, “Computing all maps into a sphere,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014.","apa":"Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., &#38; Wagner, U. (2014). Computing all maps into a sphere. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597629\">https://doi.org/10.1145/2597629</a>","ama":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. Computing all maps into a sphere. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597629\">10.1145/2597629</a>","chicago":"Čadek, Martin, Marek Krcál, Jiří Matoušek, Francis Sergeraert, Lukáš Vokřínek, and Uli Wagner. “Computing All Maps into a Sphere.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597629\">https://doi.org/10.1145/2597629</a>.","ista":"Čadek M, Krcál M, Matoušek J, Sergeraert F, Vokřínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17.","short":"M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Journal of the ACM 61 (2014).","mla":"Čadek, Martin, et al. “Computing All Maps into a Sphere.” <i>Journal of the ACM</i>, vol. 61, no. 3, 17, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597629\">10.1145/2597629</a>."},"year":"2014","publication":"Journal of the ACM","month":"05","date_updated":"2025-09-29T11:34:15Z","doi":"10.1145/2597629","publication_status":"published","status":"public","oa":1,"oa_version":"Preprint","article_processing_charge":"No","day":"01","volume":61},{"date_published":"2014-04-01T00:00:00Z","page":"93 - 110","intvolume":"      8441","_id":"2185","alternative_title":["LNCS"],"scopus_import":1,"date_created":"2018-12-11T11:56:12Z","language":[{"iso":"eng"}],"publist_id":"4795","conference":{"end_date":"2014-05-15","start_date":"2014-05-11","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","location":"Copenhagen, Denmark"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","abstract":[{"text":"We revisit the classical problem of converting an imperfect source of randomness into a usable cryptographic key. Assume that we have some cryptographic application P that expects a uniformly random m-bit key R and ensures that the best attack (in some complexity class) against P(R) has success probability at most δ. Our goal is to design a key-derivation function (KDF) h that converts any random source X of min-entropy k into a sufficiently &quot;good&quot; key h(X), guaranteeing that P(h(X)) has comparable security δ′ which is 'close' to δ. Seeded randomness extractors provide a generic way to solve this problem for all applications P, with resulting security δ′ = O(δ), provided that we start with entropy k ≥ m + 2 log (1/δ) - O(1). By a result of Radhakrishnan and Ta-Shma, this bound on k (called the &quot;RT-bound&quot;) is also known to be tight in general. Unfortunately, in many situations the loss of 2 log (1/δ) bits of entropy is unacceptable. This motivates the study KDFs with less entropy waste by placing some restrictions on the source X or the application P. In this work we obtain the following new positive and negative results in this regard: - Efficient samplability of the source X does not help beat the RT-bound for general applications. This resolves the SRT (samplable RT) conjecture of Dachman-Soled et al. [DGKM12] in the affirmative, and also shows that the existence of computationally-secure extractors beating the RT-bound implies the existence of one-way functions. - We continue in the line of work initiated by Barak et al. [BDK+11] and construct new information-theoretic KDFs which beat the RT-bound for large but restricted classes of applications. Specifically, we design efficient KDFs that work for all unpredictability applications P (e.g., signatures, MACs, one-way functions, etc.) and can either: (1) extract all of the entropy k = m with a very modest security loss δ′ = O(δ·log (1/δ)), or alternatively, (2) achieve essentially optimal security δ′ = O(δ) with a very modest entropy loss k ≥ m + loglog (1/δ). In comparison, the best prior results from [BDK+11] for this class of applications would only guarantee δ′ = O(√δ) when k = m, and would need k ≥ m + log (1/δ) to get δ′ = O(δ). - The weaker bounds of [BDK+11] hold for a larger class of so-called &quot;square- friendly&quot; applications (which includes all unpredictability, but also some important indistinguishability, applications). Unfortunately, we show that these weaker bounds are tight for the larger class of applications. - We abstract out a clean, information-theoretic notion of (k,δ,δ′)- unpredictability extractors, which guarantee &quot;induced&quot; security δ′ for any δ-secure unpredictability application P, and characterize the parameters achievable for such unpredictability extractors. Of independent interest, we also relate this notion to the previously-known notion of (min-entropy) condensers, and improve the state-of-the-art parameters for such condensers.","lang":"eng"}],"quality_controlled":"1","department":[{"_id":"KrPi"}],"author":[{"full_name":"Dodis, Yevgeniy","last_name":"Dodis","first_name":"Yevgeniy"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wichs","first_name":"Daniel","full_name":"Wichs, Daniel"}],"title":"Key derivation without entropy waste","type":"conference","month":"04","has_accepted_license":"1","year":"2014","citation":{"apa":"Dodis, Y., Pietrzak, K. Z., &#38; Wichs, D. (2014). Key derivation without entropy waste. In P. Nguyen &#38; E. Oswald (Eds.) (Vol. 8441, pp. 93–110). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-642-55220-5_6\">https://doi.org/10.1007/978-3-642-55220-5_6</a>","ama":"Dodis Y, Pietrzak KZ, Wichs D. Key derivation without entropy waste. In: Nguyen P, Oswald E, eds. Vol 8441. Springer; 2014:93-110. doi:<a href=\"https://doi.org/10.1007/978-3-642-55220-5_6\">10.1007/978-3-642-55220-5_6</a>","chicago":"Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Daniel Wichs. “Key Derivation without Entropy Waste.” edited by Phong Nguyen and Elisabeth Oswald, 8441:93–110. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-55220-5_6\">https://doi.org/10.1007/978-3-642-55220-5_6</a>.","ista":"Dodis Y, Pietrzak KZ, Wichs D. 2014. Key derivation without entropy waste. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 8441, 93–110.","mla":"Dodis, Yevgeniy, et al. <i>Key Derivation without Entropy Waste</i>. Edited by Phong Nguyen and Elisabeth Oswald, vol. 8441, Springer, 2014, pp. 93–110, doi:<a href=\"https://doi.org/10.1007/978-3-642-55220-5_6\">10.1007/978-3-642-55220-5_6</a>.","short":"Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer, 2014, pp. 93–110.","ieee":"Y. Dodis, K. Z. Pietrzak, and D. Wichs, “Key derivation without entropy waste,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 2014, vol. 8441, pp. 93–110."},"day":"01","pubrep_id":"680","volume":8441,"file_date_updated":"2020-07-14T12:45:31Z","file":[{"date_created":"2018-12-12T10:08:43Z","file_name":"IST-2016-680-v1+1_708.pdf","file_id":"4705","checksum":"da1aa01221086083b23c92e547b48ff4","access_level":"open_access","relation":"main_file","creator":"system","file_size":505389,"date_updated":"2020-07-14T12:45:31Z","content_type":"application/pdf"}],"oa":1,"oa_version":"Submitted Version","ddc":["000","004"],"doi":"10.1007/978-3-642-55220-5_6","status":"public","publication_status":"published","date_updated":"2021-01-12T06:55:51Z","editor":[{"first_name":"Phong","last_name":"Nguyen","full_name":"Nguyen, Phong"},{"full_name":"Oswald, Elisabeth","last_name":"Oswald","first_name":"Elisabeth"}]},{"language":[{"iso":"eng"}],"issue":"7","date_created":"2018-12-11T11:56:12Z","scopus_import":"1","intvolume":"       104","_id":"2186","page":"871 - 891","date_published":"2014-05-07T00:00:00Z","isi":1,"publisher":"Springer","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4793","author":[{"first_name":"Thomas","last_name":"Chen","full_name":"Chen, Thomas"},{"full_name":"Hainzl, Christian","last_name":"Hainzl","first_name":"Christian"},{"last_name":"Pavlović","first_name":"Nataša","full_name":"Pavlović, Nataša"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"department":[{"_id":"RoSe"}],"quality_controlled":"1","abstract":[{"text":"We prove the existence of scattering states for the defocusing cubic Gross-Pitaevskii (GP) hierarchy in ℝ3. Moreover, we show that an exponential energy growth condition commonly used in the well-posedness theory of the GP hierarchy is, in a specific sense, necessary. In fact, we prove that without the latter, there exist initial data for the focusing cubic GP hierarchy for which instantaneous blowup occurs.","lang":"eng"}],"type":"journal_article","arxiv":1,"main_file_link":[{"url":"http://arxiv.org/abs/1311.2136","open_access":"1"}],"title":"On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti","publication":"Letters in Mathematical Physics","month":"05","year":"2014","citation":{"ieee":"T. Chen, C. Hainzl, N. Pavlović, and R. Seiringer, “On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti,” <i>Letters in Mathematical Physics</i>, vol. 104, no. 7. Springer, pp. 871–891, 2014.","chicago":"Chen, Thomas, Christian Hainzl, Nataša Pavlović, and Robert Seiringer. “On the Well-Posedness and Scattering for the Gross-Pitaevskii Hierarchy via Quantum de Finetti.” <i>Letters in Mathematical Physics</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s11005-014-0693-2\">https://doi.org/10.1007/s11005-014-0693-2</a>.","ista":"Chen T, Hainzl C, Pavlović N, Seiringer R. 2014. On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. Letters in Mathematical Physics. 104(7), 871–891.","mla":"Chen, Thomas, et al. “On the Well-Posedness and Scattering for the Gross-Pitaevskii Hierarchy via Quantum de Finetti.” <i>Letters in Mathematical Physics</i>, vol. 104, no. 7, Springer, 2014, pp. 871–91, doi:<a href=\"https://doi.org/10.1007/s11005-014-0693-2\">10.1007/s11005-014-0693-2</a>.","short":"T. Chen, C. Hainzl, N. Pavlović, R. Seiringer, Letters in Mathematical Physics 104 (2014) 871–891.","apa":"Chen, T., Hainzl, C., Pavlović, N., &#38; Seiringer, R. (2014). On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-014-0693-2\">https://doi.org/10.1007/s11005-014-0693-2</a>","ama":"Chen T, Hainzl C, Pavlović N, Seiringer R. On the well-posedness and scattering for the Gross-Pitaevskii hierarchy via quantum de Finetti. <i>Letters in Mathematical Physics</i>. 2014;104(7):871-891. doi:<a href=\"https://doi.org/10.1007/s11005-014-0693-2\">10.1007/s11005-014-0693-2</a>"},"external_id":{"isi":["000336412300005"],"arxiv":["1311.2136"]},"oa_version":"Submitted Version","oa":1,"project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"volume":104,"day":"07","article_processing_charge":"No","date_updated":"2025-09-29T11:33:31Z","publication_status":"published","status":"public","doi":"10.1007/s11005-014-0693-2"},{"publisher":"Springer","article_type":"original","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4787","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2018-12-11T11:56:13Z","issue":"3-4","page":"193 - 220","_id":"2187","intvolume":"        51","date_published":"2014-06-01T00:00:00Z","type":"journal_article","title":"Synthesizing robust systems","author":[{"first_name":"Roderick","last_name":"Bloem","full_name":"Bloem, Roderick"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Greimel, Karin","last_name":"Greimel","first_name":"Karin"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Hofferek, Georg","last_name":"Hofferek","first_name":"Georg"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"},{"full_name":"Könighofer, Bettina","first_name":"Bettina","last_name":"Könighofer"},{"full_name":"Könighofer, Robert","first_name":"Robert","last_name":"Könighofer"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","abstract":[{"text":"Systems should not only be correct but also robust in the sense that they behave reasonably in unexpected situations. This article addresses synthesis of robust reactive systems from temporal specifications. Existing methods allow arbitrary behavior if assumptions in the specification are violated. To overcome this, we define two robustness notions, combine them, and show how to enforce them in synthesis. The first notion applies to safety properties: If safety assumptions are violated temporarily, we require that the system recovers to normal operation with as few errors as possible. The second notion requires that, if liveness assumptions are violated, as many guarantees as possible should be fulfilled nevertheless. We present a synthesis procedure achieving this for the important class of GR(1) specifications, and establish complexity bounds. We also present an implementation of a special case of robustness, and show experimental results.","lang":"eng"}],"external_id":{"isi":["000335981500004"]},"year":"2014","citation":{"ieee":"R. Bloem <i>et al.</i>, “Synthesizing robust systems,” <i>Acta Informatica</i>, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.” <i>Acta Informatica</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00236-013-0191-5\">https://doi.org/10.1007/s00236-013-0191-5</a>.","mla":"Bloem, Roderick, et al. “Synthesizing Robust Systems.” <i>Acta Informatica</i>, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:<a href=\"https://doi.org/10.1007/s00236-013-0191-5\">10.1007/s00236-013-0191-5</a>.","ista":"Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.","short":"R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.","apa":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B., … Könighofer, R. (2014). Synthesizing robust systems. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-013-0191-5\">https://doi.org/10.1007/s00236-013-0191-5</a>","ama":"Bloem R, Chatterjee K, Greimel K, et al. Synthesizing robust systems. <i>Acta Informatica</i>. 2014;51(3-4):193-220. doi:<a href=\"https://doi.org/10.1007/s00236-013-0191-5\">10.1007/s00236-013-0191-5</a>"},"has_accepted_license":"1","month":"06","publication":"Acta Informatica","ec_funded":1,"date_updated":"2025-09-29T11:32:51Z","doi":"10.1007/s00236-013-0191-5","publication_status":"published","status":"public","ddc":["621"],"oa_version":"Submitted Version","oa":1,"file":[{"content_type":"application/pdf","file_size":169523,"date_updated":"2020-07-14T12:45:31Z","creator":"system","relation":"main_file","access_level":"open_access","checksum":"d7f560f3d923f0f00aa10a0652f83273","file_name":"IST-2012-71-v1+1_Synthesizing_robust_systems.pdf","file_id":"5234","date_created":"2018-12-12T10:16:44Z"}],"project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"}],"file_date_updated":"2020-07-14T12:45:31Z","day":"01","article_processing_charge":"No","pubrep_id":"71","volume":51},{"external_id":{"isi":["000335813800006"]},"year":"2014","citation":{"ieee":"U. Kania, M. Fendrych, and J. Friml, “Polar delivery in plants; commonalities and differences to animal epithelial cells,” <i>Open Biology</i>, vol. 4, no. APRIL. Royal Society, 2014.","apa":"Kania, U., Fendrych, M., &#38; Friml, J. (2014). Polar delivery in plants; commonalities and differences to animal epithelial cells. <i>Open Biology</i>. Royal Society. <a href=\"https://doi.org/10.1098/rsob.140017\">https://doi.org/10.1098/rsob.140017</a>","ama":"Kania U, Fendrych M, Friml J. Polar delivery in plants; commonalities and differences to animal epithelial cells. <i>Open Biology</i>. 2014;4(APRIL). doi:<a href=\"https://doi.org/10.1098/rsob.140017\">10.1098/rsob.140017</a>","short":"U. Kania, M. Fendrych, J. Friml, Open Biology 4 (2014).","ista":"Kania U, Fendrych M, Friml J. 2014. Polar delivery in plants; commonalities and differences to animal epithelial cells. Open Biology. 4(APRIL), 140017.","mla":"Kania, Urszula, et al. “Polar Delivery in Plants; Commonalities and Differences to Animal Epithelial Cells.” <i>Open Biology</i>, vol. 4, no. APRIL, 140017, Royal Society, 2014, doi:<a href=\"https://doi.org/10.1098/rsob.140017\">10.1098/rsob.140017</a>.","chicago":"Kania, Urszula, Matyas Fendrych, and Jiří Friml. “Polar Delivery in Plants; Commonalities and Differences to Animal Epithelial Cells.” <i>Open Biology</i>. Royal Society, 2014. <a href=\"https://doi.org/10.1098/rsob.140017\">https://doi.org/10.1098/rsob.140017</a>."},"has_accepted_license":"1","month":"04","publication":"Open Biology","date_updated":"2025-09-29T11:32:17Z","doi":"10.1098/rsob.140017","status":"public","publication_status":"published","ddc":["570"],"oa_version":"Published Version","oa":1,"file":[{"date_created":"2018-12-12T10:13:40Z","file_id":"5025","file_name":"IST-2016-441-v1+1_140017.full.pdf","checksum":"2020627feff36cf0799167c84149fa75","access_level":"open_access","relation":"main_file","creator":"system","file_size":682570,"date_updated":"2020-07-14T12:45:31Z","content_type":"application/pdf"}],"file_date_updated":"2020-07-14T12:45:31Z","day":"16","article_processing_charge":"No","pubrep_id":"441","volume":4,"publisher":"Royal Society","isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4786","acknowledgement":"This work was supported by a grant from the Research Foundation-Flanders (Odysseus).\r\n\r\n","language":[{"iso":"eng"}],"scopus_import":"1","date_created":"2018-12-11T11:56:13Z","issue":"APRIL","article_number":"140017","_id":"2188","intvolume":"         4","date_published":"2014-04-16T00:00:00Z","type":"journal_article","corr_author":"1","title":"Polar delivery in plants; commonalities and differences to animal epithelial cells","author":[{"full_name":"Kania, Urszula","last_name":"Kania","first_name":"Urszula","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fendrych, Matyas","first_name":"Matyas","last_name":"Fendrych"},{"full_name":"Friml, Jiřĺ","last_name":"Friml","first_name":"Jiřĺ","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"department":[{"_id":"JiFr"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","abstract":[{"lang":"eng","text":"Although plant and animal cells use a similar core mechanism to deliver proteins to the plasma membrane, their different lifestyle, body organization and specific cell structures resulted in the acquisition of regulatory mechanisms that vary in the two kingdoms. In particular, cell polarity regulators do not seem to be conserved, because genes encoding key components are absent in plant genomes. In plants, the broad knowledge on polarity derives from the study of auxin transporters, the PIN-FORMED proteins, in the model plant Arabidopsis thaliana. In animals, much information is provided from the study of polarity in epithelial cells that exhibit basolateral and luminal apical polarities, separated by tight junctions. In this review, we summarize the similarities and differences of the polarization mechanisms between plants and animals and survey the main genetic approaches that have been used to characterize new genes involved in polarity establishment in plants, including the frequently used forward and reverse genetics screens as well as a novel chemical genetics approach that is expected to overcome the limitation of classical genetics methods."}]},{"volume":1,"day":"01","abstract":[{"lang":"fre","text":"En apprentissage automatique, nous parlons d'adaptation de domaine lorsque les données de test (cibles) et d'apprentissage (sources) sont générées selon différentes distributions. Nous devons donc développer des algorithmes de classification capables de s'adapter à une nouvelle distribution, pour laquelle aucune information sur les étiquettes n'est disponible. Nous attaquons cette problématique sous l'angle de l'approche PAC-Bayésienne qui se focalise sur l'apprentissage de modèles définis comme des votes de majorité sur un ensemble de fonctions. Dans ce contexte, nous introduisons PV-MinCq une version adaptative de l'algorithme (non adaptatif) MinCq. PV-MinCq suit le principe suivant. Nous transférons les étiquettes sources aux points cibles proches pour ensuite appliquer MinCq sur l'échantillon cible ``auto-étiqueté'' (justifié par une borne théorique). Plus précisément, nous définissons un auto-étiquetage non itératif qui se focalise dans les régions où les distributions marginales source et cible sont les plus similaires. Dans un second temps, nous étudions l'influence de notre auto-étiquetage pour en déduire une procédure de validation des hyperparamètres. Finalement, notre approche montre des résultats empiriques prometteurs."}],"quality_controlled":"1","article_processing_charge":"No","author":[{"last_name":"Morvant","first_name":"Emilie","orcid":"0000-0002-8301-7240","id":"4BAC2A72-F248-11E8-B48F-1D18A9856A87","full_name":"Morvant, Emilie"}],"oa_version":"Preprint","department":[{"_id":"ChLa"}],"oa":1,"publication_status":"published","status":"public","title":"Adaptation de domaine de vote de majorité par auto-étiquetage non itératif","type":"conference","date_updated":"2024-10-09T20:55:32Z","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01005776/"}],"intvolume":"         1","_id":"2189","page":"49-58","date_published":"2014-07-01T00:00:00Z","language":[{"iso":"eng"}],"month":"07","date_created":"2018-12-11T11:56:13Z","publist_id":"4785","conference":{"name":"CAP: Conférence Francophone sur l'Apprentissage Automatique (Machine Learning French Conference)","location":"Saint-Etienne, France"},"citation":{"ieee":"E. Morvant, “Adaptation de domaine de vote de majorité par auto-étiquetage non itératif,” presented at the CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne, France, 2014, vol. 1, pp. 49–58.","ama":"Morvant E. Adaptation de domaine de vote de majorité par auto-étiquetage non itératif. In: Vol 1. Elsevier; 2014:49-58.","apa":"Morvant, E. (2014). Adaptation de domaine de vote de majorité par auto-étiquetage non itératif (Vol. 1, pp. 49–58). Presented at the CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference), Saint-Etienne, France: Elsevier.","short":"E. Morvant, in:, Elsevier, 2014, pp. 49–58.","mla":"Morvant, Emilie. <i>Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage Non Itératif</i>. Vol. 1, Elsevier, 2014, pp. 49–58.","ista":"Morvant E. 2014. Adaptation de domaine de vote de majorité par auto-étiquetage non itératif. CAP: Conférence Francophone sur l’Apprentissage Automatique (Machine Learning French Conference) vol. 1, 49–58.","chicago":"Morvant, Emilie. “Adaptation de Domaine de Vote de Majorité Par Auto-Étiquetage Non Itératif,” 1:49–58. Elsevier, 2014."},"year":"2014","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"conference","corr_author":"1","arxiv":1,"main_file_link":[{"url":"http://arxiv.org/abs/1402.3388","open_access":"1"}],"title":"From LTL to deterministic automata: A safraless compositional approach","author":[{"full_name":"Esparza, Javier","first_name":"Javier","last_name":"Esparza"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","full_name":"Kretinsky, Jan"}],"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula φ. The automaton is the product of a master automaton and an array of slave automata, one for each G-subformula of φ. The slave automaton for G ψ is in charge of recognizing whether FG ψ holds. As opposed to standard determinization procedures, the states of all our automata have a clear logical structure, which allows for various optimizations. Our construction subsumes former algorithms for fragments of LTL. Experimental results show improvement in the sizes of the resulting automata compared to existing methods."}],"quality_controlled":"1","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"name":"CAV: Computer Aided Verification"},"publist_id":"4784","language":[{"iso":"eng"}],"acknowledgement":"The author is on leave from Faculty of Informatics, Masaryk University, Czech Republic, and partially supported by the Czech Science Foundation, grant No. P202/12/G061.","date_created":"2018-12-11T11:56:14Z","scopus_import":"1","intvolume":"      8559","_id":"2190","alternative_title":["LNCS"],"page":"192 - 208","date_published":"2014-01-01T00:00:00Z","date_updated":"2025-06-11T08:01:04Z","publication_status":"published","status":"public","doi":"10.1007/978-3-319-08867-9_13","oa_version":"Submitted Version","oa":1,"project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"}],"volume":8559,"article_processing_charge":"No","day":"01","citation":{"ieee":"J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.","apa":"Esparza, J., &#38; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">https://doi.org/10.1007/978-3-319-08867-9_13</a>","ama":"Esparza J, Kretinsky J. From LTL to deterministic automata: A safraless compositional approach. In: Vol 8559. Springer; 2014:192-208. doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">10.1007/978-3-319-08867-9_13</a>","chicago":"Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,” 8559:192–208. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">https://doi.org/10.1007/978-3-319-08867-9_13</a>.","mla":"Esparza, Javier, and Jan Kretinsky. <i>From LTL to Deterministic Automata: A Safraless Compositional Approach</i>. Vol. 8559, Springer, 2014, pp. 192–208, doi:<a href=\"https://doi.org/10.1007/978-3-319-08867-9_13\">10.1007/978-3-319-08867-9_13</a>.","short":"J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.","ista":"Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208."},"year":"2014","external_id":{"arxiv":["1402.3388"]},"month":"01","ec_funded":1},{"month":"08","publication":"Theoretical Computer Science","ec_funded":1,"citation":{"ieee":"K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” <i>Theoretical Computer Science</i>, vol. 547, no. C. Elsevier, pp. 104–116, 2014.","mla":"Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” <i>Theoretical Computer Science</i>, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">10.1016/j.tcs.2014.06.031</a>.","short":"K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical Computer Science 547 (2014) 104–116.","ista":"Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">https://doi.org/10.1016/j.tcs.2014.06.031</a>.","ama":"Chatterjee K, Henzinger M, Krinninger S, Loitzenbauer V, Raskin M. Approximating the minimum cycle mean. <i>Theoretical Computer Science</i>. 2014;547(C):104-116. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">10.1016/j.tcs.2014.06.031</a>","apa":"Chatterjee, K., Henzinger, M., Krinninger, S., Loitzenbauer, V., &#38; Raskin, M. (2014). Approximating the minimum cycle mean. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.06.031\">https://doi.org/10.1016/j.tcs.2014.06.031</a>"},"year":"2014","external_id":{"isi":["000340694000008"],"arxiv":["1307.4473"]},"oa":1,"oa_version":"Preprint","volume":547,"day":"28","article_processing_charge":"No","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_updated":"2025-09-29T13:17:21Z","status":"public","publication_status":"published","doi":"10.1016/j.tcs.2014.06.031","issue":"C","date_created":"2018-12-11T11:51:40Z","scopus_import":"1","language":[{"iso":"eng"}],"date_published":"2014-08-28T00:00:00Z","_id":"1375","intvolume":"       547","page":"104 - 116","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"article_type":"original","publisher":"Elsevier","publist_id":"5836","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"},{"full_name":"Raskin, Michael","last_name":"Raskin","first_name":"Michael"}],"abstract":[{"lang":"eng","text":"We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that the algorithmic question is reducible to the problem of a logarithmic number of min-plus matrix multiplications of n×n-matrices, where n is the number of vertices of the graph. (2) Second, when the weights are nonnegative, we present the first (1+ε)-approximation algorithm for the problem and the running time of our algorithm is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε)) factor in space a cycle with approximately optimal weight can be computed within the same time bound."}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.4473"}],"type":"journal_article","arxiv":1,"title":"Approximating the minimum cycle mean"},{"abstract":[{"text":"Fault-tolerant distributed algorithms play an important role in ensuring the reliability of many software applications. In this paper we consider distributed algorithms whose computations are organized in rounds. To verify the correctness of such algorithms, we reason about (i) properties (such as invariants) of the state, (ii) the transitions controlled by the algorithm, and (iii) the communication graph. We introduce a logic that addresses these points, and contains set comprehensions with cardinality constraints, function symbols to describe the local states of each process, and a limited form of quantifier alternation to express the verification conditions. We show its use in automating the verification of consensus algorithms. In particular, we give a semi-decision procedure for the unsatisfiability problem of the logic and identify a decidable fragment. We successfully applied our framework to verify the correctness of a variety of consensus algorithms tolerant to both benign faults (message loss, process crashes) and value faults (message corruption).","lang":"eng"}],"quality_controlled":"1","department":[{"_id":"ToHe"}],"author":[{"full_name":"Dragoi, Cezara","last_name":"Dragoi","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Veith, Helmut","last_name":"Veith","first_name":"Helmut"},{"first_name":"Josef","last_name":"Widder","full_name":"Widder, Josef"},{"orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien"}],"title":"A logic-based framework for verifying consensus algorithms","type":"conference","date_published":"2014-01-01T00:00:00Z","_id":"1392","intvolume":"      8318","alternative_title":["LNCS"],"page":"161 - 181","date_created":"2018-12-11T11:51:45Z","scopus_import":1,"language":[{"iso":"eng"}],"acknowledgement":"Supported by the Vienna Science and Technology Fund (WWTF) through grant PROSEED.","publist_id":"5817","conference":{"start_date":"2014-01-19","location":"San Diego, USA","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","end_date":"2014-01-21"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","volume":8318,"day":"01","pubrep_id":"179","file_date_updated":"2020-07-14T12:44:48Z","file":[{"relation":"main_file","checksum":"bffa33d39be77df0da39defe97eabf84","access_level":"open_access","file_id":"4859","file_name":"IST-2014-179-v1+1_vmcai14.pdf","date_created":"2018-12-12T10:11:06Z","content_type":"application/pdf","date_updated":"2020-07-14T12:44:48Z","file_size":444138,"creator":"system"}],"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"}],"oa":1,"oa_version":"Submitted Version","ddc":["000","005"],"publication_status":"published","status":"public","doi":"10.1007/978-3-642-54013-4_10","date_updated":"2021-01-12T06:50:22Z","ec_funded":1,"month":"01","has_accepted_license":"1","year":"2014","citation":{"ieee":"C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based framework for verifying consensus algorithms,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp. 161–181.","short":"C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer, 2014, pp. 161–181.","ista":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based framework for verifying consensus algorithms. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 8318, 161–181.","mla":"Dragoi, Cezara, et al. <i>A Logic-Based Framework for Verifying Consensus Algorithms</i>. Vol. 8318, Springer, 2014, pp. 161–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">10.1007/978-3-642-54013-4_10</a>.","chicago":"Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,” 8318:161–81. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">https://doi.org/10.1007/978-3-642-54013-4_10</a>.","apa":"Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., &#38; Zufferey, D. (2014). A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">https://doi.org/10.1007/978-3-642-54013-4_10</a>","ama":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. A logic-based framework for verifying consensus algorithms. In: Vol 8318. Springer; 2014:161-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_10\">10.1007/978-3-642-54013-4_10</a>"}},{"_id":"1393","page":"167 - 181","date_published":"2014-05-31T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:51:45Z","scopus_import":"1","conference":{"end_date":"2014-06-07","start_date":"2014-05-31","location":"Hyderabad, India","name":"FOSE: Future of Software Engineering"},"publist_id":"5816","publisher":"ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","abstract":[{"lang":"eng","text":"Probabilistic programs are usual functional or imperative programs with two added constructs: (1) the ability to draw values at random from distributions, and (2) the ability to condition values of variables in a program via observations. Models from diverse application areas such as computer vision, coding theory, cryptographic protocols, biology and reliability analysis can be written as probabilistic programs. Probabilistic inference is the problem of computing an explicit representation of the probability distribution implicitly specified by a probabilistic program. Depending on the application, the desired output from inference may vary-we may want to estimate the expected value of some function f with respect to the distribution, or the mode of the distribution, or simply a set of samples drawn from the distribution. In this paper, we describe connections this research area called \\Probabilistic Programming&quot; has with programming languages and software engineering, and this includes language design, and the static and dynamic analysis of programs. We survey current state of the art and speculate on promising directions for future research."}],"author":[{"full_name":"Gordon, Andrew","last_name":"Gordon","first_name":"Andrew"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Nori, Aditya","first_name":"Aditya","last_name":"Nori"},{"full_name":"Rajamani, Sriram","last_name":"Rajamani","first_name":"Sriram"}],"department":[{"_id":"ToHe"}],"title":"Probabilistic programming","type":"conference","main_file_link":[{"url":"https://doi.org/10.1145/2593882.2593900","open_access":"1"}],"ec_funded":1,"publication":"Proceedings of the on Future of Software Engineering","month":"05","year":"2014","citation":{"ieee":"A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,” in <i>Proceedings of the on Future of Software Engineering</i>, Hyderabad, India, 2014, pp. 167–181.","short":"A. Gordon, T.A. Henzinger, A. Nori, S. Rajamani, in:, Proceedings of the on Future of Software Engineering, ACM, 2014, pp. 167–181.","mla":"Gordon, Andrew, et al. “Probabilistic Programming.” <i>Proceedings of the on Future of Software Engineering</i>, ACM, 2014, pp. 167–81, doi:<a href=\"https://doi.org/10.1145/2593882.2593900\">10.1145/2593882.2593900</a>.","ista":"Gordon A, Henzinger TA, Nori A, Rajamani S. 2014. Probabilistic programming. Proceedings of the on Future of Software Engineering. FOSE: Future of Software Engineering, 167–181.","chicago":"Gordon, Andrew, Thomas A Henzinger, Aditya Nori, and Sriram Rajamani. “Probabilistic Programming.” In <i>Proceedings of the on Future of Software Engineering</i>, 167–81. ACM, 2014. <a href=\"https://doi.org/10.1145/2593882.2593900\">https://doi.org/10.1145/2593882.2593900</a>.","ama":"Gordon A, Henzinger TA, Nori A, Rajamani S. Probabilistic programming. In: <i>Proceedings of the on Future of Software Engineering</i>. ACM; 2014:167-181. doi:<a href=\"https://doi.org/10.1145/2593882.2593900\">10.1145/2593882.2593900</a>","apa":"Gordon, A., Henzinger, T. A., Nori, A., &#38; Rajamani, S. (2014). Probabilistic programming. In <i>Proceedings of the on Future of Software Engineering</i> (pp. 167–181). Hyderabad, India: ACM. <a href=\"https://doi.org/10.1145/2593882.2593900\">https://doi.org/10.1145/2593882.2593900</a>"},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"day":"31","article_processing_charge":"No","oa_version":"Published Version","oa":1,"status":"public","publication_status":"published","doi":"10.1145/2593882.2593900","ddc":["000"],"date_updated":"2026-06-18T17:31:28Z"},{"department":[{"_id":"SyCr"}],"author":[{"full_name":"Konrad, Matthias","last_name":"Konrad","first_name":"Matthias","id":"46528076-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"None","abstract":[{"text":"In this thesis I studied various individual and social immune defences employed by the invasive garden ant Lasius neglectus mostly against entomopathogenic fungi.  The first two chapters of this thesis address the phenomenon of 'social immunisation'. Social immunisation, that is the immunological protection of group members due to social contact to a pathogen-exposed nestmate, has been described in various social insect species against different types of pathogens. However, in the case of entomopathogenic fungi it has, so far, only been demonstrated that social immunisation exists at all. Its underlying mechanisms r any other properties were, however, unknown. In the first chapter of this thesis I identified the mechanistic basis of social immunisation in L. neglectus against the entomopathogenous fungus Metarhizium. I could show that nestmates of a pathogen-exposed individual contract low-level infections due to social interactions. These low-level infections are, however, non-lethal and cause an active stimulation of the immune system, which protects the nestmates upon subsequent pathogen encounters. In the second chapter of this thesis I investigated the specificity and colony level effects of social immunisation. I demonstrated that the protection conferred by social immunisation is highly specific, protecting ants only against the same pathogen strain. In addition, depending on the respective context, social immunisation may even cause fitness costs. I further showed that social immunisation crucially affects sanitary behaviour and disease dynamics within ant groups. In the third chapter of this thesis I studied the effects of the ectosymbiotic fungus Laboulbenia formicarum on its host L. neglectus. Although Laboulbeniales are the largest order of insect-parasitic fungi, research concerning host fitness consequence is sparse. I showed that highly Laboulbenia-infected ants sustain fitness costs under resource limitation, however, gain fitness benefits when exposed to an entomopathogenus fungus. These effects are probably cause by a prophylactic upregulation of behavioural as well as physiological immune defences in highly infected ants.","lang":"eng"}],"day":"01","article_processing_charge":"No","type":"dissertation","date_updated":"2026-04-09T14:27:01Z","corr_author":"1","publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","status":"public","title":"Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus","date_created":"2018-12-11T11:51:46Z","OA_place":"publisher","month":"02","language":[{"iso":"eng"}],"degree_awarded":"PhD","date_published":"2014-02-01T00:00:00Z","alternative_title":["ISTA Thesis"],"_id":"1395","page":"131","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2014","citation":{"ieee":"M. Konrad, “Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus,” Institute of Science and Technology Austria, 2014.","chicago":"Konrad, Matthias. “Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus.” Institute of Science and Technology Austria, 2014.","short":"M. Konrad, Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus, Institute of Science and Technology Austria, 2014.","ista":"Konrad M. 2014. Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. Institute of Science and Technology Austria.","mla":"Konrad, Matthias. <i>Immune Defences in Ants: Effects of Social Immunisation and a Fungal Ectosymbiont in the Ant Lasius Neglectus</i>. Institute of Science and Technology Austria, 2014.","apa":"Konrad, M. (2014). <i>Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus</i>. Institute of Science and Technology Austria.","ama":"Konrad M. Immune defences in ants: Effects of social immunisation and a fungal ectosymbiont in the ant Lasius neglectus. 2014."},"supervisor":[{"full_name":"Cremer, Sylvia M","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia M","orcid":"0000-0002-2193-3868","last_name":"Cremer"}],"publisher":"Institute of Science and Technology Austria","publist_id":"5814"},{"abstract":[{"lang":"eng","text":"Phosphatidylinositol (Ptdlns) is a structural phospholipid that can be phosphorylated into various lipid signaling molecules, designated polyphosphoinositides (PPIs). The reversible phosphorylation of PPIs on the 3, 4, or 5 position of inositol is performed by a set of organelle-specific kinases and phosphatases, and the characteristic head groups make these molecules ideal for regulating biological processes in time and space. In yeast and mammals, Ptdlns3P and Ptdlns(3,5)P2 play crucial roles in trafficking toward the lytic compartments, whereas the role in plants is not yet fully understood. Here we identified the role of a land plant-specific subgroup of PPI phosphatases, the suppressor of actin 2 (SAC2) to SAC5, during vauolar trafficking and morphogenesis in Arabidopsis thaliana. SAC2-SAC5 localize to the tonoplast along with Ptdlns3P, the presumable product of their activity. in SAC gain- and loss-of-function mutants, the levels of Ptdlns monophosphates and bisphosphates were changed, with opposite effects on the morphology of storage and lytic vacuoles, and the trafficking toward the vacuoles was defective. Moreover, multiple sac knockout mutants had an increased number of smaller storage and lytic vacuoles, whereas extralarge vacuoles were observed in the overexpression lines, correlating with various growth and developmental defects. The fragmented vacuolar phenotype of sac mutants could be mimicked by treating wild-type seedlings with Ptdlns(3,5)P2, corroborating that this PPI is important for vacuole morphology. Taken together, these results provide evidence that PPIs, together with their metabolic enzymes SAC2-SAC5, are crucial for vacuolar trafficking and for vacuolar morphology and function in plants."}],"article_processing_charge":"No","day":"01","oa_version":"None","author":[{"full_name":"Marhavá, Petra","first_name":"Petra","id":"44E59624-F248-11E8-B48F-1D18A9856A87","last_name":"Marhavá"}],"department":[{"_id":"JiFr"}],"title":"Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana","status":"public","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"date_updated":"2026-04-09T14:27:28Z","corr_author":"1","type":"dissertation","page":"90","_id":"1402","alternative_title":["ISTA Thesis"],"date_published":"2014-12-01T00:00:00Z","degree_awarded":"PhD","language":[{"iso":"eng"}],"month":"12","date_created":"2018-12-11T11:51:49Z","OA_place":"publisher","publist_id":"5805","publisher":"Institute of Science and Technology Austria","citation":{"ieee":"P. Marhavá, “Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana,” Institute of Science and Technology Austria, 2014.","ama":"Marhavá P. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. 2014.","apa":"Marhavá, P. (2014). <i>Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana</i>. Institute of Science and Technology Austria.","mla":"Marhavá, Petra. <i>Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana</i>. Institute of Science and Technology Austria, 2014.","ista":"Marhavá P. 2014. Molecular mechanisms of patterning and subcellular trafficking in Arabidopsis thaliana. Institute of Science and Technology Austria.","short":"P. Marhavá, Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana, Institute of Science and Technology Austria, 2014.","chicago":"Marhavá, Petra. “Molecular Mechanisms of Patterning and Subcellular Trafficking in Arabidopsis Thaliana.” Institute of Science and Technology Austria, 2014."},"year":"2014","supervisor":[{"full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","last_name":"Friml"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"corr_author":"1","type":"dissertation","related_material":{"record":[{"id":"2282","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"2950"},{"id":"3373","status":"public","relation":"part_of_dissertation"}]},"title":"Forces driving epithelial spreading in zebrafish epiboly","department":[{"_id":"CaHe"}],"author":[{"full_name":"Behrndt, Martin","first_name":"Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","last_name":"Behrndt"}],"abstract":[{"text":"A variety of developmental and disease related processes depend on epithelial cell sheet spreading. In order to gain insight into the biophysical mechanism(s) underlying the tissue morphogenesis we studied the spreading of an epithelium during the early development of the zebrafish embryo. In zebrafish epiboly the enveloping cell layer (EVL), a simple squamous epithelium, spreads over the yolk cell to completely engulf it at the end of gastrulation. Previous studies have proposed that an actomyosin ring forming within the yolk syncytial layer (YSL) acts as purse string that through constriction along its circumference pulls on the margin of the EVL. Direct biophysical evidence for this hypothesis has however been missing. The aim of the thesis was to understand how the actomyosin ring may generate pulling forces onto the EVL and what cellular mechanism(s) may facilitate the spreading of the epithelium. Using laser ablation to measure cortical tension within the actomyosin ring we found an anisotropic tension distribution, which was highest along the circumference of the ring. However the low degree of anisotropy was incompatible with the actomyosin ring functioning as a purse string only. Additionally, we observed retrograde cortical flow from vegetal parts of the ring into the EVL margin. Interpreting the experimental data using a theoretical distribution that models  the tissues as active viscous gels led us to proposen that the actomyosin ring has a twofold contribution to EVL epiboly. It not only acts as a purse string through constriction along its circumference, but in addition constriction along the width of the ring generates pulling forces through friction-resisted cortical flow. Moreover, when rendering the purse string mechanism unproductive EVL epiboly proceeded normally indicating that the flow-friction mechanism is sufficient to drive the process. Aiming to understand what cellular mechanism(s) may facilitate the spreading of the epithelium we found that tension-oriented EVL cell divisions limit tissue anisotropy by releasing tension along the division axis and promote epithelial spreading. Notably, EVL cells undergo ectopic cell fusion in conditions in which oriented-cell division is impaired or the epithelium is mechanically challenged. Taken together our study of EVL epiboly suggests a novel mechanism of force generation for actomyosin rings through friction-resisted cortical flow and highlights the importance of tension-oriented cell divisions in epithelial morphogenesis.","lang":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"IST Austria","publist_id":"5804","OA_place":"repository","date_created":"2018-12-11T11:51:49Z","language":[{"iso":"eng"}],"date_published":"2014-08-01T00:00:00Z","_id":"1403","alternative_title":["IST Austria Thesis"],"page":"91","date_updated":"2026-06-18T18:45:01Z","ddc":["590"],"publication_status":"published","status":"public","oa_version":"None","article_processing_charge":"No","day":"01","file_date_updated":"2026-03-09T14:53:14Z","file":[{"date_created":"2026-03-09T14:53:14Z","file_id":"21421","file_name":"2014 Behrnd final.pdf","access_level":"closed","checksum":"67df5501b1b5b313c3bf9a360d713693","relation":"main_file","creator":"cchlebak","file_size":24842978,"date_updated":"2026-03-09T14:53:14Z","content_type":"application/pdf"}],"supervisor":[{"last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"year":"2014","citation":{"short":"M. Behrndt, Forces Driving Epithelial Spreading in Zebrafish Epiboly, IST Austria, 2014.","ista":"Behrndt M. 2014. Forces driving epithelial spreading in zebrafish epiboly. IST Austria.","mla":"Behrndt, Martin. <i>Forces Driving Epithelial Spreading in Zebrafish Epiboly</i>. IST Austria, 2014.","chicago":"Behrndt, Martin. “Forces Driving Epithelial Spreading in Zebrafish Epiboly.” IST Austria, 2014.","ama":"Behrndt M. Forces driving epithelial spreading in zebrafish epiboly. 2014.","apa":"Behrndt, M. (2014). <i>Forces driving epithelial spreading in zebrafish epiboly</i>. IST Austria.","ieee":"M. Behrndt, “Forces driving epithelial spreading in zebrafish epiboly,” IST Austria, 2014."},"has_accepted_license":"1","acknowledged_ssus":[{"_id":"SSU"}],"month":"08","degree_awarded":"PhD"}]