[{"publist_id":"5642","intvolume":"       234","status":"public","date_created":"2018-12-11T11:52:33Z","month":"05","volume":234,"publisher":"Elsevier","related_material":{"record":[{"id":"1820","status":"public","relation":"earlier_version"},{"id":"5425","status":"public","relation":"earlier_version"}]},"oa":1,"_id":"1529","title":"Optimal cost almost-sure reachability in POMDPs","publication":"Artificial Intelligence","publication_status":"published","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest.","lang":"eng"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"quality_controlled":"1","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gupta","first_name":"Raghav","full_name":"Gupta, Raghav"},{"full_name":"Kanodia, Ayush","first_name":"Ayush","last_name":"Kanodia"}],"main_file_link":[{"url":"http://arxiv.org/abs/1411.3880","open_access":"1"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.” <i>Artificial Intelligence</i>, vol. 234, Elsevier, 2016, pp. 26–48, doi:<a href=\"https://doi.org/10.1016/j.artint.2016.01.007\">10.1016/j.artint.2016.01.007</a>.","apa":"Chatterjee, K., Chmelik, M., Gupta, R., &#38; Kanodia, A. (2016). Optimal cost almost-sure reachability in POMDPs. <i>Artificial Intelligence</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.artint.2016.01.007\">https://doi.org/10.1016/j.artint.2016.01.007</a>","short":"K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” <i>Artificial Intelligence</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.artint.2016.01.007\">https://doi.org/10.1016/j.artint.2016.01.007</a>.","ista":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.","ieee":"K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” <i>Artificial Intelligence</i>, vol. 234. Elsevier, pp. 26–48, 2016.","ama":"Chatterjee K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability in POMDPs. <i>Artificial Intelligence</i>. 2016;234:26-48. doi:<a href=\"https://doi.org/10.1016/j.artint.2016.01.007\">10.1016/j.artint.2016.01.007</a>"},"year":"2016","scopus_import":1,"arxiv":1,"page":"26 - 48","date_published":"2016-05-01T00:00:00Z","external_id":{"arxiv":["1411.3880"]},"language":[{"iso":"eng"}],"doi":"10.1016/j.artint.2016.01.007","department":[{"_id":"KrCh"}],"ec_funded":1,"acknowledgement":"We thank Blai Bonet for helping us with RTDP-Bel. The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2023-02-23T12:25:49Z","type":"journal_article","oa_version":"Preprint"},{"department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.jfa.2015.12.007","ec_funded":1,"acknowledgement":"We thank Jan Dereziński for several inspiring discussions and useful remarks. We thank the referee for helpful comments. J.P.S. thanks the Erwin Schrödinger Institute for the hospitality during the thematic programme “Quantum many-body systems, random matrices, and disorder”. We gratefully acknowledge the financial supports by the European Union's Seventh Framework Programme under the ERC Advanced Grant ERC-2012-AdG 321029 (J.P.S.) and the REA grant agreement No. 291734 (P.T.N.), as well as the support of the National Science Center (NCN) grant No. 2012/07/N/ST1/03185 and the Austrian Science Fund (FWF) project No. P 27533-N27 (M.N.).","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Submitted Version","type":"journal_article","date_updated":"2021-01-12T06:51:30Z","scopus_import":1,"page":"4340 - 4368","date_published":"2016-06-01T00:00:00Z","_id":"1545","oa":1,"title":"Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations","publication":"Journal of Functional Analysis","abstract":[{"lang":"eng","text":"We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our sufficient conditions are optimal in the sense that they become necessary when the relevant one-body operators commute."}],"publication_status":"published","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"},{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"quality_controlled":"1","author":[{"last_name":"Nam","first_name":"Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Nam, Phan"},{"full_name":"Napiórkowski, Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin M","last_name":"Napiórkowski"},{"full_name":"Solovej, Jan","last_name":"Solovej","first_name":"Jan"}],"main_file_link":[{"url":"http://arxiv.org/abs/1508.07321","open_access":"1"}],"citation":{"apa":"Nam, P., Napiórkowski, M. M., &#38; Solovej, J. (2016). Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. <i>Journal of Functional Analysis</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jfa.2015.12.007\">https://doi.org/10.1016/j.jfa.2015.12.007</a>","mla":"Nam, Phan, et al. “Diagonalization of Bosonic Quadratic Hamiltonians by Bogoliubov Transformations.” <i>Journal of Functional Analysis</i>, vol. 270, no. 11, Academic Press, 2016, pp. 4340–68, doi:<a href=\"https://doi.org/10.1016/j.jfa.2015.12.007\">10.1016/j.jfa.2015.12.007</a>.","ama":"Nam P, Napiórkowski MM, Solovej J. Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. <i>Journal of Functional Analysis</i>. 2016;270(11):4340-4368. doi:<a href=\"https://doi.org/10.1016/j.jfa.2015.12.007\">10.1016/j.jfa.2015.12.007</a>","ieee":"P. Nam, M. M. Napiórkowski, and J. Solovej, “Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations,” <i>Journal of Functional Analysis</i>, vol. 270, no. 11. Academic Press, pp. 4340–4368, 2016.","chicago":"Nam, Phan, Marcin M Napiórkowski, and Jan Solovej. “Diagonalization of Bosonic Quadratic Hamiltonians by Bogoliubov Transformations.” <i>Journal of Functional Analysis</i>. Academic Press, 2016. <a href=\"https://doi.org/10.1016/j.jfa.2015.12.007\">https://doi.org/10.1016/j.jfa.2015.12.007</a>.","short":"P. Nam, M.M. Napiórkowski, J. Solovej, Journal of Functional Analysis 270 (2016) 4340–4368.","ista":"Nam P, Napiórkowski MM, Solovej J. 2016. Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations. Journal of Functional Analysis. 270(11), 4340–4368."},"year":"2016","publist_id":"5626","intvolume":"       270","status":"public","month":"06","date_created":"2018-12-11T11:52:38Z","issue":"11","volume":270,"publisher":"Academic Press"},{"department":[{"_id":"ToBo"}],"has_accepted_license":"1","doi":"10.1098/rspb.2015.2452","language":[{"iso":"eng"}],"acknowledgement":"We thank the High-Throughput Genomics Group at the Wellcome Trust Centre for Human Genetics funded by Wellcome\r\nTrust grant reference 090532/Z/09/Z and Medical Research Council Hub grant no. G0900747 91070 for generation of the high-throughput sequencing data. We thank Wook Kim and two anonymous reviewers for their constructive feedback on previous versions of our manuscript.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","date_updated":"2021-01-12T06:51:33Z","type":"journal_article","day":"13","scopus_import":1,"file":[{"access_level":"open_access","file_name":"IST-2016-488-v1+1_20152452.full.pdf","checksum":"78ffe70c1c88af3856d31ca6b7195a27","file_id":"4899","date_updated":"2020-07-14T12:45:02Z","creator":"system","content_type":"application/pdf","file_size":626804,"date_created":"2018-12-12T10:11:43Z","relation":"main_file"}],"date_published":"2016-01-13T00:00:00Z","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","title":"The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa","_id":"1552","oa":1,"ddc":["570"],"abstract":[{"text":"Antibiotic resistance carries a fitness cost that must be overcome in order for resistance to persist over the long term. Compensatory mutations that recover the functional defects associated with resistance mutations have been argued to play a key role in overcoming the cost of resistance, but compensatory mutations are expected to be rare relative to generally beneficial mutations that increase fitness, irrespective of antibiotic resistance. Given this asymmetry, population genetics theory predicts that populations should adapt by compensatory mutations when the cost of resistance is large, whereas generally beneficial mutations should drive adaptation when the cost of resistance is small. We tested this prediction by determining the genomic mechanisms underpinning adaptation to antibiotic-free conditions in populations of the pathogenic bacterium Pseudomonas aeruginosa that carry costly antibiotic resistance mutations. Whole-genome sequencing revealed that populations founded by high-cost rifampicin-resistant mutants adapted via compensatory mutations in three genes of the RNA polymerase core enzyme, whereas populations founded by low-cost mutants adapted by generally beneficial mutations, predominantly in the quorum-sensing transcriptional regulator gene lasR. Even though the importance of compensatory evolution in maintaining resistance has been widely recognized, our study shows that the roles of general adaptation in maintaining resistance should not be underestimated and highlights the need to understand how selection at other sites in the genome influences the dynamics of resistance alleles in clinical settings.","lang":"eng"}],"publication_status":"published","citation":{"chicago":"Qi, Qin, Macarena Toll Riera, Karl Heilbron, Gail Preston, and R Craig Maclean. “The Genomic Basis of Adaptation to the Fitness Cost of Rifampicin Resistance in Pseudomonas Aeruginosa.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The, 2016. <a href=\"https://doi.org/10.1098/rspb.2015.2452\">https://doi.org/10.1098/rspb.2015.2452</a>.","short":"Q. Qi, M. Toll Riera, K. Heilbron, G. Preston, R.C. Maclean, Proceedings of the Royal Society of London Series B Biological Sciences 283 (2016).","ista":"Qi Q, Toll Riera M, Heilbron K, Preston G, Maclean RC. 2016. The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. Proceedings of the Royal Society of London Series B Biological Sciences. 283(1822), 20152452.","ama":"Qi Q, Toll Riera M, Heilbron K, Preston G, Maclean RC. The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. 2016;283(1822). doi:<a href=\"https://doi.org/10.1098/rspb.2015.2452\">10.1098/rspb.2015.2452</a>","ieee":"Q. Qi, M. Toll Riera, K. Heilbron, G. Preston, and R. C. Maclean, “The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa,” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 283, no. 1822. Royal Society, The, 2016.","mla":"Qi, Qin, et al. “The Genomic Basis of Adaptation to the Fitness Cost of Rifampicin Resistance in Pseudomonas Aeruginosa.” <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>, vol. 283, no. 1822, 20152452, Royal Society, The, 2016, doi:<a href=\"https://doi.org/10.1098/rspb.2015.2452\">10.1098/rspb.2015.2452</a>.","apa":"Qi, Q., Toll Riera, M., Heilbron, K., Preston, G., &#38; Maclean, R. C. (2016). The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. <i>Proceedings of the Royal Society of London Series B Biological Sciences</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rspb.2015.2452\">https://doi.org/10.1098/rspb.2015.2452</a>"},"quality_controlled":"1","author":[{"first_name":"Qin","last_name":"Qi","orcid":"0000-0002-6148-2416","full_name":"Qi, Qin","id":"3B22D412-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Toll Riera, Macarena","last_name":"Toll Riera","first_name":"Macarena"},{"full_name":"Heilbron, Karl","first_name":"Karl","last_name":"Heilbron"},{"last_name":"Preston","first_name":"Gail","full_name":"Preston, Gail"},{"last_name":"Maclean","first_name":"R Craig","full_name":"Maclean, R Craig"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2016","intvolume":"       283","publist_id":"5619","month":"01","date_created":"2018-12-11T11:52:40Z","status":"public","article_number":"20152452","pubrep_id":"488","volume":283,"issue":"1822","file_date_updated":"2020-07-14T12:45:02Z","publisher":"Royal Society, The"},{"date_published":"2016-04-01T00:00:00Z","issue":"2","volume":29,"page":"363 - 421","publisher":"Springer","intvolume":"        29","scopus_import":1,"publist_id":"5579","month":"04","date_created":"2018-12-11T11:52:54Z","status":"public","citation":{"mla":"Abe, Masayuki, et al. “Structure Preserving Signatures and Commitments to Group Elements.” <i>Journal of Cryptology</i>, vol. 29, no. 2, Springer, 2016, pp. 363–421, doi:<a href=\"https://doi.org/10.1007/s00145-014-9196-7\">10.1007/s00145-014-9196-7</a>.","apa":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., &#38; Ohkubo, M. (2016). Structure preserving signatures and commitments to group elements. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-014-9196-7\">https://doi.org/10.1007/s00145-014-9196-7</a>","ama":"Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. Structure preserving signatures and commitments to group elements. <i>Journal of Cryptology</i>. 2016;29(2):363-421. doi:<a href=\"https://doi.org/10.1007/s00145-014-9196-7\">10.1007/s00145-014-9196-7</a>","ieee":"M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, “Structure preserving signatures and commitments to group elements,” <i>Journal of Cryptology</i>, vol. 29, no. 2. Springer, pp. 363–421, 2016.","ista":"Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. 2016. Structure preserving signatures and commitments to group elements. Journal of Cryptology. 29(2), 363–421.","chicago":"Abe, Masayuki, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. “Structure Preserving Signatures and Commitments to Group Elements.” <i>Journal of Cryptology</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00145-014-9196-7\">https://doi.org/10.1007/s00145-014-9196-7</a>.","short":"M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Journal of Cryptology 29 (2016) 363–421."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Abe, Masayuki","last_name":"Abe","first_name":"Masayuki"},{"last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"first_name":"Jens","last_name":"Groth","full_name":"Groth, Jens"},{"last_name":"Haralambiev","first_name":"Kristiyan","full_name":"Haralambiev, Kristiyan"},{"full_name":"Ohkubo, Miyako","first_name":"Miyako","last_name":"Ohkubo"}],"quality_controlled":"1","oa_version":"None","type":"journal_article","date_updated":"2021-01-12T06:51:49Z","year":"2016","day":"01","title":"Structure preserving signatures and commitments to group elements","publication":"Journal of Cryptology","department":[{"_id":"KrPi"}],"_id":"1592","language":[{"iso":"eng"}],"doi":"10.1007/s00145-014-9196-7","acknowledgement":"The authors would like to thank the anonymous reviewers of this paper. We also would like to express our appreciation to the program committee and the anonymous reviewers for CRYPTO 2010. The first author thanks Sherman S. M. Chow for his comment on group signatures in Sect. 7.1.","abstract":[{"text":"A modular approach to constructing cryptographic protocols leads to simple designs but often inefficient instantiations. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest a new design paradigm, structure-preserving cryptography, that provides a way to construct modular protocols with reasonable efficiency while retaining conceptual simplicity. A cryptographic scheme over a bilinear group is called structure-preserving if its public inputs and outputs consist of elements from the bilinear groups and their consistency can be verified by evaluating pairing-product equations. As structure-preserving schemes smoothly interoperate with each other, they are useful as building blocks in modular design of cryptographic applications. This paper introduces structure-preserving commitment and signature schemes over bilinear groups with several desirable properties. The commitment schemes include homomorphic, trapdoor and length-reducing commitments to group elements, and the structure-preserving signature schemes are the first ones that yield constant-size signatures on multiple group elements. A structure-preserving signature scheme is called automorphic if the public keys lie in the message space, which cannot be achieved by compressing inputs via a cryptographic hash function, as this would destroy the mathematical structure we are trying to preserve. Automorphic signatures can be used for building certification chains underlying privacy-preserving protocols. Among a vast number of applications of structure-preserving protocols, we present an efficient round-optimal blind-signature scheme and a group signature scheme with an efficient and concurrently secure protocol for enrolling new members.","lang":"eng"}],"publication_status":"published"},{"project":[{"call_identifier":"FP7","_id":"25A603A2-B435-11E9-9278-68D0E5697425","grant_number":"281556","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)"},{"grant_number":"Y 564-B12","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)","call_identifier":"FWF","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"Chemokines are the main guidance cues directing leukocyte migration. Opposed to early assumptions, chemokines do not necessarily act as soluble cues but are often immobilized within tissues, e.g., dendritic cell migration toward lymphatic vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled assay systems to quantitatively study haptotaxis in vitro are still missing. In this chapter, we describe an in vitro haptotaxis assay optimized for the unique properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive state, using laser-assisted protein adsorption by photobleaching. The cells follow this immobilized CCL21 gradient in a haptotaxis chamber, which provides three dimensionally confined migration conditions.","lang":"eng"}],"publication_status":"published","pmid":1,"publication":"Methods in Enzymology","title":"Quantitative analysis of dendritic cell haptotaxis","_id":"1597","year":"2016","citation":{"mla":"Schwarz, Jan, and Michael K. Sixt. “Quantitative Analysis of Dendritic Cell Haptotaxis.” <i>Methods in Enzymology</i>, vol. 570, Elsevier, 2016, pp. 567–81, doi:<a href=\"https://doi.org/10.1016/bs.mie.2015.11.004\">10.1016/bs.mie.2015.11.004</a>.","apa":"Schwarz, J., &#38; Sixt, M. K. (2016). Quantitative analysis of dendritic cell haptotaxis. <i>Methods in Enzymology</i>. Elsevier. <a href=\"https://doi.org/10.1016/bs.mie.2015.11.004\">https://doi.org/10.1016/bs.mie.2015.11.004</a>","ama":"Schwarz J, Sixt MK. Quantitative analysis of dendritic cell haptotaxis. <i>Methods in Enzymology</i>. 2016;570:567-581. doi:<a href=\"https://doi.org/10.1016/bs.mie.2015.11.004\">10.1016/bs.mie.2015.11.004</a>","ieee":"J. Schwarz and M. K. Sixt, “Quantitative analysis of dendritic cell haptotaxis,” <i>Methods in Enzymology</i>, vol. 570. Elsevier, pp. 567–581, 2016.","ista":"Schwarz J, Sixt MK. 2016. Quantitative analysis of dendritic cell haptotaxis. Methods in Enzymology. 570, 567–581.","short":"J. Schwarz, M.K. Sixt, Methods in Enzymology 570 (2016) 567–581.","chicago":"Schwarz, Jan, and Michael K Sixt. “Quantitative Analysis of Dendritic Cell Haptotaxis.” <i>Methods in Enzymology</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/bs.mie.2015.11.004\">https://doi.org/10.1016/bs.mie.2015.11.004</a>."},"author":[{"full_name":"Schwarz, Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","last_name":"Schwarz","first_name":"Jan"},{"last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"}],"quality_controlled":"1","month":"01","date_created":"2018-12-11T11:52:56Z","status":"public","intvolume":"       570","publist_id":"5573","publisher":"Elsevier","article_type":"original","volume":570,"acknowledgement":"This work was supported by the Boehringer Ingelheim Fonds, the European Research Council (ERC StG 281556), and a START Award of the Austrian Science Foundation (FWF). We thank Robert Hauschild, Anne Reversat, and Jack Merrin for valuable input and the Imaging Facility of IST Austria for excellent support.","ec_funded":1,"acknowledged_ssus":[{"_id":"Bio"}],"department":[{"_id":"MiSi"}],"doi":"10.1016/bs.mie.2015.11.004","language":[{"iso":"eng"}],"oa_version":"None","type":"journal_article","date_updated":"2021-01-12T06:51:51Z","day":"01","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"external_id":{"pmid":["26921962"]},"date_published":"2016-01-01T00:00:00Z","page":"567 - 581"},{"year":"2016","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5583642/"}],"citation":{"ama":"Kiermaier E, Moussion C, Veldkamp C, et al. Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. <i>Science</i>. 2016;351(6269):186-190. doi:<a href=\"https://doi.org/10.1126/science.aad0512\">10.1126/science.aad0512</a>","ieee":"E. Kiermaier <i>et al.</i>, “Polysialylation controls dendritic cell trafficking by regulating chemokine recognition,” <i>Science</i>, vol. 351, no. 6269. American Association for the Advancement of Science, pp. 186–190, 2016.","ista":"Kiermaier E, Moussion C, Veldkamp C, Gerardy  Schahn R, de Vries I, Williams L, Chaffee G, Phillips A, Freiberger F, Imre R, Taleski D, Payne R, Braun A, Förster R, Mechtler K, Mühlenhoff M, Volkman B, Sixt MK. 2016. Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. Science. 351(6269), 186–190.","chicago":"Kiermaier, Eva, Christine Moussion, Christopher Veldkamp, Rita Gerardy  Schahn, Ingrid de Vries, Larry Williams, Gary Chaffee, et al. “Polysialylation Controls Dendritic Cell Trafficking by Regulating Chemokine Recognition.” <i>Science</i>. American Association for the Advancement of Science, 2016. <a href=\"https://doi.org/10.1126/science.aad0512\">https://doi.org/10.1126/science.aad0512</a>.","short":"E. Kiermaier, C. Moussion, C. Veldkamp, R. Gerardy  Schahn, I. de Vries, L. Williams, G. Chaffee, A. Phillips, F. Freiberger, R. Imre, D. Taleski, R. Payne, A. Braun, R. Förster, K. Mechtler, M. Mühlenhoff, B. Volkman, M.K. Sixt, Science 351 (2016) 186–190.","apa":"Kiermaier, E., Moussion, C., Veldkamp, C., Gerardy  Schahn, R., de Vries, I., Williams, L., … Sixt, M. K. (2016). Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aad0512\">https://doi.org/10.1126/science.aad0512</a>","mla":"Kiermaier, Eva, et al. “Polysialylation Controls Dendritic Cell Trafficking by Regulating Chemokine Recognition.” <i>Science</i>, vol. 351, no. 6269, American Association for the Advancement of Science, 2016, pp. 186–90, doi:<a href=\"https://doi.org/10.1126/science.aad0512\">10.1126/science.aad0512</a>."},"author":[{"id":"3EB04B78-F248-11E8-B48F-1D18A9856A87","full_name":"Kiermaier, Eva","orcid":"0000-0001-6165-5738","first_name":"Eva","last_name":"Kiermaier"},{"first_name":"Christine","last_name":"Moussion","id":"3356F664-F248-11E8-B48F-1D18A9856A87","full_name":"Moussion, Christine"},{"last_name":"Veldkamp","first_name":"Christopher","full_name":"Veldkamp, Christopher"},{"full_name":"Gerardy  Schahn, Rita","first_name":"Rita","last_name":"Gerardy  Schahn"},{"first_name":"Ingrid","last_name":"De Vries","full_name":"De Vries, Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Larry","last_name":"Williams","full_name":"Williams, Larry"},{"full_name":"Chaffee, Gary","last_name":"Chaffee","first_name":"Gary"},{"last_name":"Phillips","first_name":"Andrew","full_name":"Phillips, Andrew"},{"first_name":"Friedrich","last_name":"Freiberger","full_name":"Freiberger, Friedrich"},{"first_name":"Richard","last_name":"Imre","full_name":"Imre, Richard"},{"last_name":"Taleski","first_name":"Deni","full_name":"Taleski, Deni"},{"last_name":"Payne","first_name":"Richard","full_name":"Payne, Richard"},{"full_name":"Braun, Asolina","last_name":"Braun","first_name":"Asolina"},{"full_name":"Förster, Reinhold","last_name":"Förster","first_name":"Reinhold"},{"full_name":"Mechtler, Karl","last_name":"Mechtler","first_name":"Karl"},{"first_name":"Martina","last_name":"Mühlenhoff","full_name":"Mühlenhoff, Martina"},{"full_name":"Volkman, Brian","first_name":"Brian","last_name":"Volkman"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","_id":"25A603A2-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","grant_number":"281556"},{"grant_number":"289720","name":"Stromal Cell-immune Cell Interactions in Health and Disease","_id":"25A76F58-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)","grant_number":"Y 564-B12"}],"publication_status":"published","abstract":[{"text":"The addition of polysialic acid to N- and/or O-linked glycans, referred to as polysialylation, is a rare posttranslational modification that is mainly known to control the developmental plasticity of the nervous system. Here we show that CCR7, the central chemokine receptor controlling immune cell trafficking to secondary lymphatic organs, carries polysialic acid. This modification is essential for the recognition of the CCR7 ligand CCL21. As a consequence, dendritic cell trafficking is abrogated in polysialyltransferase-deficient mice, manifesting as disturbed lymph node homeostasis and unresponsiveness to inflammatory stimuli. Structure-function analysis of chemokine-receptor interactions reveals that CCL21 adopts an autoinhibited conformation, which is released upon interaction with polysialic acid. Thus, we describe a glycosylation-mediated immune cell trafficking disorder and its mechanistic basis.\r\n","lang":"eng"}],"publication":"Science","title":"Polysialylation controls dendritic cell trafficking by regulating chemokine recognition","pmid":1,"oa":1,"_id":"1599","publisher":"American Association for the Advancement of Science","article_type":"original","volume":351,"issue":"6269","date_created":"2018-12-11T11:52:57Z","month":"01","status":"public","intvolume":"       351","publist_id":"5570","date_updated":"2021-01-12T06:51:52Z","type":"journal_article","oa_version":"Submitted Version","day":"08","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank S. Schüchner and E. Ogris for kindly providing the antibody to GFP, M. Helmbrecht and A. Huber for providing Nrp2−/− mice, the IST Scientific Support Facilities for excellent services, and J. Renkawitz and K. Vaahtomeri for critically reading the manuscript. ","ec_funded":1,"acknowledged_ssus":[{"_id":"SSU"}],"doi":"10.1126/science.aad0512","language":[{"iso":"eng"}],"department":[{"_id":"MiSi"}],"date_published":"2016-01-08T00:00:00Z","external_id":{"pmid":["26657283"]},"page":"186 - 190","scopus_import":1},{"publisher":"Birkhäuser","issue":"7","volume":17,"status":"public","month":"07","date_created":"2018-12-11T11:53:00Z","publist_id":"5558","intvolume":"        17","year":"2016","quality_controlled":"1","author":[{"first_name":"Christian","last_name":"Sadel","orcid":"0000-0001-8255-3968","full_name":"Sadel, Christian","id":"4760E9F8-F248-11E8-B48F-1D18A9856A87"}],"citation":{"short":"C. Sadel, Annales Henri Poincare 17 (2016) 1631–1675.","chicago":"Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on Antitrees and Spectral Theory for Operators with One Propagating Channel.” <i>Annales Henri Poincare</i>. Birkhäuser, 2016. <a href=\"https://doi.org/10.1007/s00023-015-0456-3\">https://doi.org/10.1007/s00023-015-0456-3</a>.","ista":"Sadel C. 2016. Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. Annales Henri Poincare. 17(7), 1631–1675.","ieee":"C. Sadel, “Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel,” <i>Annales Henri Poincare</i>, vol. 17, no. 7. Birkhäuser, pp. 1631–1675, 2016.","ama":"Sadel C. Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. <i>Annales Henri Poincare</i>. 2016;17(7):1631-1675. doi:<a href=\"https://doi.org/10.1007/s00023-015-0456-3\">10.1007/s00023-015-0456-3</a>","apa":"Sadel, C. (2016). Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. <i>Annales Henri Poincare</i>. Birkhäuser. <a href=\"https://doi.org/10.1007/s00023-015-0456-3\">https://doi.org/10.1007/s00023-015-0456-3</a>","mla":"Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on Antitrees and Spectral Theory for Operators with One Propagating Channel.” <i>Annales Henri Poincare</i>, vol. 17, no. 7, Birkhäuser, 2016, pp. 1631–75, doi:<a href=\"https://doi.org/10.1007/s00023-015-0456-3\">10.1007/s00023-015-0456-3</a>."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.04287"}],"abstract":[{"text":"We show that the Anderson model has a transition from localization to delocalization at exactly 2 dimensional growth rate on antitrees with normalized edge weights which are certain discrete graphs. The kinetic part has a one-dimensional structure allowing a description through transfer matrices which involve some Schur complement. For such operators we introduce the notion of having one propagating channel and extend theorems from the theory of one-dimensional Jacobi operators that relate the behavior of transfer matrices with the spectrum. These theorems are then applied to the considered model. In essence, in a certain energy region the kinetic part averages the random potentials along shells and the transfer matrices behave similar as for a one-dimensional operator with random potential of decaying variance. At d dimensional growth for d&gt;2 this effective decay is strong enough to obtain absolutely continuous spectrum, whereas for some uniform d dimensional growth with d&lt;2 one has pure point spectrum in this energy region. At exactly uniform 2 dimensional growth also some singular continuous spectrum appears, at least at small disorder. As a corollary we also obtain a change from singular spectrum (d≤2) to absolutely continuous spectrum (d≥3) for random operators of the type rΔdr+λ on ℤd, where r is an orthogonal radial projection, Δd the discrete adjacency operator (Laplacian) on ℤd and λ a random potential. ","lang":"eng"}],"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"_id":"1608","oa":1,"title":"Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel","publication":"Annales Henri Poincare","page":"1631 - 1675","date_published":"2016-07-01T00:00:00Z","scopus_import":1,"day":"01","oa_version":"Preprint","date_updated":"2021-01-12T06:51:58Z","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"LaEr"}],"doi":"10.1007/s00023-015-0456-3","language":[{"iso":"eng"}],"ec_funded":1},{"status":"public","date_created":"2018-12-11T11:53:01Z","month":"02","publist_id":"5554","scopus_import":1,"intvolume":"        75","publisher":"Springer","volume":75,"issue":"1","page":"75 - 84","date_published":"2016-02-01T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"We prove that whenever A is a 3-conservative relational structure with only binary and unary relations,then the algebra of polymorphisms of A either has no Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety (i.e.,CSP(A)has bounded width)."}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00012-015-0358-8","department":[{"_id":"VlKo"}],"_id":"1612","title":"CSP for binary conservative relational structures","publication":"Algebra Universalis","day":"01","year":"2016","date_updated":"2021-01-12T06:52:00Z","type":"journal_article","oa_version":"Preprint","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kazda","first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","full_name":"Kazda, Alexandr"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1112.1099"}],"citation":{"mla":"Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” <i>Algebra Universalis</i>, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:<a href=\"https://doi.org/10.1007/s00012-015-0358-8\">10.1007/s00012-015-0358-8</a>.","apa":"Kazda, A. (2016). CSP for binary conservative relational structures. <i>Algebra Universalis</i>. Springer. <a href=\"https://doi.org/10.1007/s00012-015-0358-8\">https://doi.org/10.1007/s00012-015-0358-8</a>","ieee":"A. Kazda, “CSP for binary conservative relational structures,” <i>Algebra Universalis</i>, vol. 75, no. 1. Springer, pp. 75–84, 2016.","ama":"Kazda A. CSP for binary conservative relational structures. <i>Algebra Universalis</i>. 2016;75(1):75-84. doi:<a href=\"https://doi.org/10.1007/s00012-015-0358-8\">10.1007/s00012-015-0358-8</a>","ista":"Kazda A. 2016. CSP for binary conservative relational structures. Algebra Universalis. 75(1), 75–84.","chicago":"Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” <i>Algebra Universalis</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00012-015-0358-8\">https://doi.org/10.1007/s00012-015-0358-8</a>.","short":"A. Kazda, Algebra Universalis 75 (2016) 75–84."}},{"publisher":"Wiley","file_date_updated":"2020-07-14T12:45:07Z","pubrep_id":"469","volume":26,"issue":"5","status":"public","month":"05","date_created":"2018-12-11T11:53:03Z","publist_id":"5550","intvolume":"        26","year":"2016","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"author":[{"last_name":"Kowalski","first_name":"Janina","full_name":"Kowalski, Janina","id":"3F3CA136-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jian","last_name":"Gan","id":"3614E438-F248-11E8-B48F-1D18A9856A87","full_name":"Gan, Jian"},{"last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"},{"full_name":"Pernia-Andrade, Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","first_name":"Alejandro","last_name":"Pernia-Andrade"}],"quality_controlled":"1","citation":{"ama":"Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. <i>Hippocampus</i>. 2016;26(5):668-682. doi:<a href=\"https://doi.org/10.1002/hipo.22550\">10.1002/hipo.22550</a>","ieee":"J. Kowalski, J. Gan, P. M. Jonas, and A. Pernia-Andrade, “Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats,” <i>Hippocampus</i>, vol. 26, no. 5. Wiley, pp. 668–682, 2016.","short":"J. Kowalski, J. Gan, P.M. Jonas, A. Pernia-Andrade, Hippocampus 26 (2016) 668–682.","chicago":"Kowalski, Janina, Jian Gan, Peter M Jonas, and Alejandro Pernia-Andrade. “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern in Vivo in Anesthetized Rats.” <i>Hippocampus</i>. Wiley, 2016. <a href=\"https://doi.org/10.1002/hipo.22550\">https://doi.org/10.1002/hipo.22550</a>.","ista":"Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. 2016. Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. Hippocampus. 26(5), 668–682.","apa":"Kowalski, J., Gan, J., Jonas, P. M., &#38; Pernia-Andrade, A. (2016). Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. <i>Hippocampus</i>. Wiley. <a href=\"https://doi.org/10.1002/hipo.22550\">https://doi.org/10.1002/hipo.22550</a>","mla":"Kowalski, Janina, et al. “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern in Vivo in Anesthetized Rats.” <i>Hippocampus</i>, vol. 26, no. 5, Wiley, 2016, pp. 668–82, doi:<a href=\"https://doi.org/10.1002/hipo.22550\">10.1002/hipo.22550</a>."},"abstract":[{"lang":"eng","text":"The hippocampus plays a key role in learning and memory. Previous studies suggested that the main types of principal neurons, dentate gyrus granule cells (GCs), CA3 pyramidal neurons, and CA1 pyramidal neurons, differ in their activity pattern, with sparse firing in GCs and more frequent firing in CA3 and CA1 pyramidal neurons. It has been assumed but never shown that such different activity may be caused by differential synaptic excitation. To test this hypothesis, we performed high-resolution whole-cell patch-clamp recordings in anesthetized rats in vivo. In contrast to previous in vitro data, both CA3 and CA1 pyramidal neurons fired action potentials spontaneously, with a frequency of ∼3–6 Hz, whereas GCs were silent. Furthermore, both CA3 and CA1 cells primarily fired in bursts. To determine the underlying mechanisms, we quantitatively assessed the frequency of spontaneous excitatory synaptic input, the passive membrane properties, and the active membrane characteristics. Surprisingly, GCs showed comparable synaptic excitation to CA3 and CA1 cells and the highest ratio of excitation versus hyperpolarizing inhibition. Thus, differential synaptic excitation is not responsible for differences in firing. Moreover, the three types of hippocampal neurons markedly differed in their passive properties. While GCs showed the most negative membrane potential, CA3 pyramidal neurons had the highest input resistance and the slowest membrane time constant. The three types of neurons also differed in the active membrane characteristics. GCs showed the highest action potential threshold, but displayed the largest gain of the input-output curves. In conclusion, our results reveal that differential firing of the three main types of hippocampal principal neurons in vivo is not primarily caused by differences in the characteristics of the synaptic input, but by the distinct properties of synaptic integration and input-output transformation."}],"publication_status":"published","_id":"1616","ddc":["570"],"oa":1,"publication":"Hippocampus","title":"Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats","page":"668 - 682","file":[{"date_created":"2018-12-12T10:13:47Z","relation":"main_file","file_size":905348,"creator":"system","content_type":"application/pdf","date_updated":"2020-07-14T12:45:07Z","file_id":"5033","access_level":"open_access","checksum":"284b72b12fbe15474833ed3d4549f86b","file_name":"IST-2016-469-v1+1_Kowalski_et_al-Hippocampus.pdf"}],"date_published":"2016-05-01T00:00:00Z","scopus_import":"1","publication_identifier":{"eissn":["1098-1063"],"issn":["1050-9631"]},"day":"01","oa_version":"Published Version","date_updated":"2023-10-17T10:02:02Z","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":"The authors thank Jose Guzman for critically reading prior versions of the manuscript. They also thank T. Asenov for\r\nengineering mechanical devices, A. Schlögl for efficient pro-gramming, F. Marr for technical assistance, and E. Kramberger for manuscript editing.","department":[{"_id":"PeJo"}],"has_accepted_license":"1","doi":"10.1002/hipo.22550","language":[{"iso":"eng"}]},{"year":"2016","day":"01","oa_version":"Submitted Version","type":"journal_article","date_updated":"2021-01-12T06:52:02Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Pausinger"},{"full_name":"Steinerberger, Stefan","last_name":"Steinerberger","first_name":"Stefan"}],"quality_controlled":"1","citation":{"mla":"Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered Sampling.” <i>Journal of Complexity</i>, vol. 33, Academic Press, 2016, pp. 199–216, doi:<a href=\"https://doi.org/10.1016/j.jco.2015.11.003\">10.1016/j.jco.2015.11.003</a>.","apa":"Pausinger, F., &#38; Steinerberger, S. (2016). On the discrepancy of jittered sampling. <i>Journal of Complexity</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jco.2015.11.003\">https://doi.org/10.1016/j.jco.2015.11.003</a>","ista":"Pausinger F, Steinerberger S. 2016. On the discrepancy of jittered sampling. Journal of Complexity. 33, 199–216.","chicago":"Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered Sampling.” <i>Journal of Complexity</i>. Academic Press, 2016. <a href=\"https://doi.org/10.1016/j.jco.2015.11.003\">https://doi.org/10.1016/j.jco.2015.11.003</a>.","short":"F. Pausinger, S. Steinerberger, Journal of Complexity 33 (2016) 199–216.","ieee":"F. Pausinger and S. Steinerberger, “On the discrepancy of jittered sampling,” <i>Journal of Complexity</i>, vol. 33. Academic Press, pp. 199–216, 2016.","ama":"Pausinger F, Steinerberger S. On the discrepancy of jittered sampling. <i>Journal of Complexity</i>. 2016;33:199-216. doi:<a href=\"https://doi.org/10.1016/j.jco.2015.11.003\">10.1016/j.jco.2015.11.003</a>"},"main_file_link":[{"url":"http://arxiv.org/abs/1510.00251","open_access":"1"}],"abstract":[{"lang":"eng","text":"We study the discrepancy of jittered sampling sets: such a set P⊂ [0,1]d is generated for fixed m∈ℕ by partitioning [0,1]d into md axis aligned cubes of equal measure and placing a random point inside each of the N=md cubes. We prove that, for N sufficiently large, 1/10 d/N1/2+1/2d ≤EDN∗(P)≤ √d(log N) 1/2/N1/2+1/2d, where the upper bound with an unspecified constant Cd was proven earlier by Beck. Our proof makes crucial use of the sharp Dvoretzky-Kiefer-Wolfowitz inequality and a suitably taylored Bernstein inequality; we have reasons to believe that the upper bound has the sharp scaling in N. Additional heuristics suggest that jittered sampling should be able to improve known bounds on the inverse of the star-discrepancy in the regime N≳dd. We also prove a partition principle showing that every partition of [0,1]d combined with a jittered sampling construction gives rise to a set whose expected squared L2-discrepancy is smaller than that of purely random points."}],"publication_status":"published","acknowledgement":"We are grateful to the referee whose suggestions greatly improved the quality and clarity of the exposition.","department":[{"_id":"HeEd"}],"_id":"1617","language":[{"iso":"eng"}],"oa":1,"doi":"10.1016/j.jco.2015.11.003","publication":"Journal of Complexity","title":"On the discrepancy of jittered sampling","publisher":"Academic Press","page":"199 - 216","volume":33,"date_published":"2016-04-01T00:00:00Z","status":"public","month":"04","date_created":"2018-12-11T11:53:03Z","scopus_import":1,"publist_id":"5549","intvolume":"        33"},{"year":"2016","author":[{"last_name":"Frank","first_name":"Rupert","full_name":"Frank, Rupert"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Solovej","first_name":"Jan","full_name":"Solovej, Jan"}],"quality_controlled":"1","citation":{"ieee":"R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “The external field dependence of the BCS critical temperature,” <i>Communications in Mathematical Physics</i>, vol. 342, no. 1. Springer, pp. 189–216, 2016.","ama":"Frank R, Hainzl C, Seiringer R, Solovej J. The external field dependence of the BCS critical temperature. <i>Communications in Mathematical Physics</i>. 2016;342(1):189-216. doi:<a href=\"https://doi.org/10.1007/s00220-015-2526-2\">10.1007/s00220-015-2526-2</a>","short":"R. Frank, C. Hainzl, R. Seiringer, J. Solovej, Communications in Mathematical Physics 342 (2016) 189–216.","chicago":"Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “The External Field Dependence of the BCS Critical Temperature.” <i>Communications in Mathematical Physics</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00220-015-2526-2\">https://doi.org/10.1007/s00220-015-2526-2</a>.","ista":"Frank R, Hainzl C, Seiringer R, Solovej J. 2016. The external field dependence of the BCS critical temperature. Communications in Mathematical Physics. 342(1), 189–216.","mla":"Frank, Rupert, et al. “The External Field Dependence of the BCS Critical Temperature.” <i>Communications in Mathematical Physics</i>, vol. 342, no. 1, Springer, 2016, pp. 189–216, doi:<a href=\"https://doi.org/10.1007/s00220-015-2526-2\">10.1007/s00220-015-2526-2</a>.","apa":"Frank, R., Hainzl, C., Seiringer, R., &#38; Solovej, J. (2016). The external field dependence of the BCS critical temperature. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-015-2526-2\">https://doi.org/10.1007/s00220-015-2526-2</a>"},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.2352"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We consider the Bardeen–Cooper–Schrieffer free energy functional for particles interacting via a two-body potential on a microscopic scale and in the presence of weak external fields varying on a macroscopic scale. We study the influence of the external fields on the critical temperature. We show that in the limit where the ratio between the microscopic and macroscopic scale tends to zero, the next to leading order of the critical temperature is determined by the lowest eigenvalue of the linearization of the Ginzburg–Landau equation."}],"oa":1,"_id":"1620","publication":"Communications in Mathematical Physics","title":"The external field dependence of the BCS critical temperature","publisher":"Springer","volume":342,"issue":"1","status":"public","date_created":"2018-12-11T11:53:04Z","month":"02","publist_id":"5546","intvolume":"       342","day":"01","type":"journal_article","date_updated":"2021-01-12T06:52:03Z","oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The authors are grateful to I. M. Sigal for useful discussions. Financial support from the US National Science Foundation through Grants PHY-1347399 and DMS-1363432 (R.L.F.), from the Danish council for independent research and from ERC Advanced Grant 321029 (J.P.S.) is acknowledged.","doi":"10.1007/s00220-015-2526-2","language":[{"iso":"eng"}],"department":[{"_id":"RoSe"}],"page":"189 - 216","date_published":"2016-02-01T00:00:00Z","scopus_import":1},{"year":"2016","quality_controlled":"1","author":[{"full_name":"Lundholm, Douglas","last_name":"Lundholm","first_name":"Douglas"},{"full_name":"Nam, Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","last_name":"Nam","first_name":"Phan"},{"full_name":"Portmann, Fabian","first_name":"Fabian","last_name":"Portmann"}],"main_file_link":[{"url":"http://arxiv.org/abs/1501.04570","open_access":"1"}],"citation":{"mla":"Lundholm, Douglas, et al. “Fractional Hardy–Lieb–Thirring and Related Inequalities for Interacting Systems.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 219, no. 3, Springer, 2016, pp. 1343–82, doi:<a href=\"https://doi.org/10.1007/s00205-015-0923-5\">10.1007/s00205-015-0923-5</a>.","apa":"Lundholm, D., Nam, P., &#38; Portmann, F. (2016). Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. <i>Archive for Rational Mechanics and Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s00205-015-0923-5\">https://doi.org/10.1007/s00205-015-0923-5</a>","ama":"Lundholm D, Nam P, Portmann F. Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. <i>Archive for Rational Mechanics and Analysis</i>. 2016;219(3):1343-1382. doi:<a href=\"https://doi.org/10.1007/s00205-015-0923-5\">10.1007/s00205-015-0923-5</a>","ieee":"D. Lundholm, P. Nam, and F. Portmann, “Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 219, no. 3. Springer, pp. 1343–1382, 2016.","ista":"Lundholm D, Nam P, Portmann F. 2016. Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. Archive for Rational Mechanics and Analysis. 219(3), 1343–1382.","chicago":"Lundholm, Douglas, Phan Nam, and Fabian Portmann. “Fractional Hardy–Lieb–Thirring and Related Inequalities for Interacting Systems.” <i>Archive for Rational Mechanics and Analysis</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00205-015-0923-5\">https://doi.org/10.1007/s00205-015-0923-5</a>.","short":"D. Lundholm, P. Nam, F. Portmann, Archive for Rational Mechanics and Analysis 219 (2016) 1343–1382."},"publication_status":"published","abstract":[{"lang":"eng","text":"We prove analogues of the Lieb–Thirring and Hardy–Lieb–Thirring inequalities for many-body quantum systems with fractional kinetic operators and homogeneous interaction potentials, where no anti-symmetry on the wave functions is assumed. These many-body inequalities imply interesting one-body interpolation inequalities, and we show that the corresponding one- and many-body inequalities are actually equivalent in certain cases."}],"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"oa":1,"_id":"1622","publication":"Archive for Rational Mechanics and Analysis","title":"Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems","publisher":"Springer","volume":219,"issue":"3","status":"public","date_created":"2018-12-11T11:53:05Z","month":"03","publist_id":"5542","intvolume":"       219","day":"01","type":"journal_article","date_updated":"2021-01-12T06:52:04Z","oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank Jan  Philip  Solovej, Robert Seiringer and Vladimir Maz’ya for helpful discussions, as well as Rupert Frank\r\nand the anonymous referee for useful comments. Part of this work has been carried out during a visit at the Institut Mittag-Leffler (Stockholm). D.L. acknowledges financial support by the grant KAW 2010.0063 from the Knut and Alice Wallenberg Foundation and the Swedish Research Council grant no. 2013-4734. P.T.N. is supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734. F.P. acknowledges support from the ERC project no. 321029 “The\r\nmathematics of the structure of matter”.","doi":"10.1007/s00205-015-0923-5","language":[{"iso":"eng"}],"department":[{"_id":"RoSe"}],"ec_funded":1,"page":"1343 - 1382","date_published":"2016-03-01T00:00:00Z","scopus_import":1},{"page":"1 - 12","file":[{"file_id":"4865","date_updated":"2020-07-14T12:45:07Z","access_level":"open_access","checksum":"6a65ba187994d4ad86c1c509e0ff482a","file_name":"IST-2016-465-v1+1_1-s2.0-S0040580915001094-main.pdf","date_created":"2018-12-12T10:11:12Z","relation":"main_file","file_size":1684043,"content_type":"application/pdf","creator":"system"}],"date_published":"2016-04-01T00:00:00Z","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","oa_version":"Published Version","type":"journal_article","date_updated":"2021-01-12T06:52:07Z","department":[{"_id":"NiBa"}],"has_accepted_license":"1","language":[{"iso":"eng"}],"doi":"10.1016/j.tpb.2015.10.008","ec_funded":1,"pubrep_id":"465","volume":108,"publisher":"Academic Press","file_date_updated":"2020-07-14T12:45:07Z","publist_id":"5524","intvolume":"       108","status":"public","month":"04","date_created":"2018-12-11T11:53:08Z","quality_controlled":"1","author":[{"first_name":"Jerome","last_name":"Kelleher","full_name":"Kelleher, Jerome"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison"},{"full_name":"Véber, Amandine","last_name":"Véber","first_name":"Amandine"},{"last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"citation":{"apa":"Kelleher, J., Etheridge, A., Véber, A., &#38; Barton, N. H. (2016). Spread of pedigree versus genetic ancestry in spatially distributed populations. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.tpb.2015.10.008\">https://doi.org/10.1016/j.tpb.2015.10.008</a>","mla":"Kelleher, Jerome, et al. “Spread of Pedigree versus Genetic Ancestry in Spatially Distributed Populations.” <i>Theoretical Population Biology</i>, vol. 108, Academic Press, 2016, pp. 1–12, doi:<a href=\"https://doi.org/10.1016/j.tpb.2015.10.008\">10.1016/j.tpb.2015.10.008</a>.","ieee":"J. Kelleher, A. Etheridge, A. Véber, and N. H. Barton, “Spread of pedigree versus genetic ancestry in spatially distributed populations,” <i>Theoretical Population Biology</i>, vol. 108. Academic Press, pp. 1–12, 2016.","ama":"Kelleher J, Etheridge A, Véber A, Barton NH. Spread of pedigree versus genetic ancestry in spatially distributed populations. <i>Theoretical Population Biology</i>. 2016;108:1-12. doi:<a href=\"https://doi.org/10.1016/j.tpb.2015.10.008\">10.1016/j.tpb.2015.10.008</a>","ista":"Kelleher J, Etheridge A, Véber A, Barton NH. 2016. Spread of pedigree versus genetic ancestry in spatially distributed populations. Theoretical Population Biology. 108, 1–12.","short":"J. Kelleher, A. Etheridge, A. Véber, N.H. Barton, Theoretical Population Biology 108 (2016) 1–12.","chicago":"Kelleher, Jerome, Alison Etheridge, Amandine Véber, and Nicholas H Barton. “Spread of Pedigree versus Genetic Ancestry in Spatially Distributed Populations.” <i>Theoretical Population Biology</i>. Academic Press, 2016. <a href=\"https://doi.org/10.1016/j.tpb.2015.10.008\">https://doi.org/10.1016/j.tpb.2015.10.008</a>."},"year":"2016","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"1631","ddc":["576"],"oa":1,"publication":"Theoretical Population Biology","title":"Spread of pedigree versus genetic ancestry in spatially distributed populations","abstract":[{"text":"Ancestral processes are fundamental to modern population genetics and spatial structure has been the subject of intense interest for many years. Despite this interest, almost nothing is known about the distribution of the locations of pedigree or genetic ancestors. Using both spatially continuous and stepping-stone models, we show that the distribution of pedigree ancestors approaches a travelling wave, for which we develop two alternative approximations. The speed and width of the wave are sensitive to the local details of the model. After a short time, genetic ancestors spread far more slowly than pedigree ancestors, ultimately diffusing out with radius ## rather than spreading at constant speed. In contrast to the wave of pedigree ancestors, the spread of genetic ancestry is insensitive to the local details of the models.","lang":"eng"}],"publication_status":"published","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"publisher":"Springer","file_date_updated":"2020-07-14T12:45:08Z","pubrep_id":"1001","issue":"2","volume":35,"status":"public","month":"06","date_created":"2018-12-11T11:53:12Z","publist_id":"5512","intvolume":"        35","year":"2016","quality_controlled":"1","author":[{"last_name":"Zemová","first_name":"Radka","full_name":"Zemová, Radka"},{"last_name":"Zwiewka","first_name":"Marta","full_name":"Zwiewka, Marta"},{"last_name":"Bielach","first_name":"Agnieszka","full_name":"Bielach, Agnieszka"},{"first_name":"Hélène","last_name":"Robert","full_name":"Robert, Hélène"},{"first_name":"Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ieee":"R. Zemová, M. Zwiewka, A. Bielach, H. Robert, and J. Friml, “A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana,” <i>Journal of Plant Growth Regulation</i>, vol. 35, no. 2. Springer, pp. 465–476, 2016.","ama":"Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. <i>Journal of Plant Growth Regulation</i>. 2016;35(2):465-476. doi:<a href=\"https://doi.org/10.1007/s00344-015-9553-2\">10.1007/s00344-015-9553-2</a>","ista":"Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. 2016. A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. Journal of Plant Growth Regulation. 35(2), 465–476.","chicago":"Zemová, Radka, Marta Zwiewka, Agnieszka Bielach, Hélène Robert, and Jiří Friml. “A Forward Genetic Screen for New Regulators of Auxin Mediated Degradation of Auxin Transport Proteins in Arabidopsis Thaliana.” <i>Journal of Plant Growth Regulation</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00344-015-9553-2\">https://doi.org/10.1007/s00344-015-9553-2</a>.","short":"R. Zemová, M. Zwiewka, A. Bielach, H. Robert, J. Friml, Journal of Plant Growth Regulation 35 (2016) 465–476.","mla":"Zemová, Radka, et al. “A Forward Genetic Screen for New Regulators of Auxin Mediated Degradation of Auxin Transport Proteins in Arabidopsis Thaliana.” <i>Journal of Plant Growth Regulation</i>, vol. 35, no. 2, Springer, 2016, pp. 465–76, doi:<a href=\"https://doi.org/10.1007/s00344-015-9553-2\">10.1007/s00344-015-9553-2</a>.","apa":"Zemová, R., Zwiewka, M., Bielach, A., Robert, H., &#38; Friml, J. (2016). A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. <i>Journal of Plant Growth Regulation</i>. Springer. <a href=\"https://doi.org/10.1007/s00344-015-9553-2\">https://doi.org/10.1007/s00344-015-9553-2</a>"},"abstract":[{"lang":"eng","text":"The plant hormone auxin (indole-3-acetic acid) is a major regulator of plant growth and development including embryo and root patterning, lateral organ formation and growth responses to environmental stimuli. Auxin is directionally transported from cell to cell by the action of specific auxin influx [AUXIN-RESISTANT1 (AUX1)] and efflux [PIN-FORMED (PIN)] transport regulators, whose polar, subcellular localizations are aligned with the direction of the auxin flow. Auxin itself regulates its own transport by modulation of the expression and subcellular localization of the auxin transporters. Increased auxin levels promote the transcription of PIN2 and AUX1 genes as well as stabilize PIN proteins at the plasma membrane, whereas prolonged auxin exposure increases the turnover of PIN proteins and their degradation in the vacuole. In this study, we applied a forward genetic approach, to identify molecular components playing a role in the auxin-mediated degradation. We generated EMS-mutagenized Arabidopsis PIN2::PIN2:GFP, AUX1::AUX1:YFP eir1aux1 populations and designed a screen for mutants with persistently strong fluorescent signals of the tagged PIN2 and AUX1 after prolonged treatment with the synthetic auxin 2,4-dichlorophenoxyacetic acid (2,4-D). This approach yielded novel auxin degradation mutants defective in trafficking and degradation of PIN2 and AUX1 proteins and established a role for auxin-mediated degradation in plant development."}],"publication_status":"published","_id":"1641","ddc":["581"],"oa":1,"publication":"Journal of Plant Growth Regulation","title":"A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana","page":"465 - 476","file":[{"file_size":5637591,"creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:08:34Z","relation":"main_file","access_level":"open_access","checksum":"0dc6a300cde6536ceedd2bcdd2060efb","file_name":"IST-2018-1001-v1+1_Zemova_JPlantGrowthRegul_2016_proofs.pdf","file_id":"4695","date_updated":"2020-07-14T12:45:08Z"}],"date_published":"2016-06-01T00:00:00Z","scopus_import":1,"day":"01","oa_version":"Preprint","type":"journal_article","date_updated":"2021-01-12T06:52:11Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"European Social Fund (CZ.1.07/2.3.00/20.0043) and the Czech Science Foundation GAČR (GA13-40637S) to JF. ","has_accepted_license":"1","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00344-015-9553-2"},{"pubrep_id":"677","volume":9452,"file_date_updated":"2020-07-14T12:45:08Z","publisher":"Springer","intvolume":"      9452","publist_id":"5497","month":"01","conference":{"end_date":"2015-12-03","name":"ASIACRYPT: Theory and Application of Cryptology and Information Security","location":"Auckland, New Zealand","start_date":"2015-11-29"},"date_created":"2018-12-11T11:53:16Z","status":"public","citation":{"mla":"Okamoto, Tatsuaki, et al. <i>New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators</i>. Vol. 9452, Springer, 2016, pp. 121–45, doi:<a href=\"https://doi.org/10.1007/978-3-662-48797-6_6\">10.1007/978-3-662-48797-6_6</a>.","apa":"Okamoto, T., Pietrzak, K. Z., Waters, B., &#38; Wichs, D. (2016). New realizations of somewhere statistically binding hashing and positional accumulators (Vol. 9452, pp. 121–145). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48797-6_6\">https://doi.org/10.1007/978-3-662-48797-6_6</a>","ista":"Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere statistically binding hashing and positional accumulators. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 9452, 121–145.","short":"T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp. 121–145.","chicago":"Okamoto, Tatsuaki, Krzysztof Z Pietrzak, Brent Waters, and Daniel Wichs. “New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators,” 9452:121–45. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-48797-6_6\">https://doi.org/10.1007/978-3-662-48797-6_6</a>.","ieee":"T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of somewhere statistically binding hashing and positional accumulators,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.","ama":"Okamoto T, Pietrzak KZ, Waters B, Wichs D. New realizations of somewhere statistically binding hashing and positional accumulators. In: Vol 9452. Springer; 2016:121-145. doi:<a href=\"https://doi.org/10.1007/978-3-662-48797-6_6\">10.1007/978-3-662-48797-6_6</a>"},"quality_controlled":"1","author":[{"full_name":"Okamoto, Tatsuaki","last_name":"Okamoto","first_name":"Tatsuaki"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z"},{"full_name":"Waters, Brent","first_name":"Brent","last_name":"Waters"},{"last_name":"Wichs","first_name":"Daniel","full_name":"Wichs, Daniel"}],"year":"2016","title":"New realizations of somewhere statistically binding hashing and positional accumulators","_id":"1653","ddc":["000"],"oa":1,"project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"A somewhere statistically binding (SSB) hash, introduced by Hubáček and Wichs (ITCS ’15), can be used to hash a long string x to a short digest y = H hk (x) using a public hashing-key hk. Furthermore, there is a way to set up the hash key hk to make it statistically binding on some arbitrary hidden position i, meaning that: (1) the digest y completely determines the i’th bit (or symbol) of x so that all pre-images of y have the same value in the i’th position, (2) it is computationally infeasible to distinguish the position i on which hk is statistically binding from any other position i’. Lastly, the hash should have a local opening property analogous to Merkle-Tree hashing, meaning that given x and y = H hk (x) it should be possible to create a short proof π that certifies the value of the i’th bit (or symbol) of x without having to provide the entire input x. A similar primitive called a positional accumulator, introduced by Koppula, Lewko and Waters (STOC ’15) further supports dynamic updates of the hashed value. These tools, which are interesting in their own right, also serve as one of the main technical components in several recent works building advanced applications from indistinguishability obfuscation (iO).\r\n\r\nThe prior constructions of SSB hashing and positional accumulators required fully homomorphic encryption (FHE) and iO respectively. In this work, we give new constructions of these tools based on well studied number-theoretic assumptions such as DDH, Phi-Hiding and DCR, as well as a general construction from lossy/injective functions.","lang":"eng"}],"publication_status":"published","file":[{"date_updated":"2020-07-14T12:45:08Z","file_id":"4923","access_level":"open_access","checksum":"a57711cb660c5b17b42bb47275a00180","file_name":"IST-2016-677-v1+1_869.pdf","date_created":"2018-12-12T10:12:05Z","relation":"main_file","file_size":580088,"creator":"system","content_type":"application/pdf"}],"date_published":"2016-01-08T00:00:00Z","page":"121 - 145","alternative_title":["LNCS"],"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","type":"conference","date_updated":"2021-01-12T06:52:16Z","day":"08","ec_funded":1,"department":[{"_id":"KrPi"}],"has_accepted_license":"1","doi":"10.1007/978-3-662-48797-6_6","language":[{"iso":"eng"}]},{"scopus_import":1,"date_published":"2016-01-10T00:00:00Z","file":[{"checksum":"f8869ec110c35c852ef6a37425374af7","file_name":"IST-2017-774-v1+1_2016-J-03-FirstIntVolume.pdf","access_level":"open_access","file_id":"4928","date_updated":"2020-07-14T12:45:10Z","content_type":"application/pdf","creator":"system","file_size":248985,"relation":"main_file","date_created":"2018-12-12T10:12:10Z"}],"page":"674 - 703","ec_funded":1,"doi":"10.1016/j.aim.2015.10.004","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"has_accepted_license":"1","acknowledgement":"This research is partially supported by the Toposys project FP7-ICT-318493-STREP, and by ESF under the ACAT Research Network Programme.\r\nBoth authors thank Anne Marie Svane for her comments on an early version of this paper. The second author wishes to thank Eva B. Vedel Jensen and Markus Kiderlen from Aarhus University for enlightening discussions and their kind hospitality during a visit of their department in 2014.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"journal_article","date_updated":"2023-09-07T11:41:25Z","oa_version":"Published Version","day":"10","intvolume":"       287","publist_id":"5488","date_created":"2018-12-11T11:53:20Z","month":"01","status":"public","volume":287,"pubrep_id":"774","file_date_updated":"2020-07-14T12:45:10Z","publisher":"Academic Press","publication":"Advances in Mathematics","title":"Approximation and convergence of the intrinsic volume","oa":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1399"}]},"ddc":["004"],"_id":"1662","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493","name":"Topological Complex Systems"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We introduce a modification of the classic notion of intrinsic volume using persistence moments of height functions. Evaluating the modified first intrinsic volume on digital approximations of a compact body with smoothly embedded boundary in Rn, we prove convergence to the first intrinsic volume of the body as the resolution of the approximation improves. We have weaker results for the other modified intrinsic volumes, proving they converge to the corresponding intrinsic volumes of the n-dimensional unit ball."}],"citation":{"apa":"Edelsbrunner, H., &#38; Pausinger, F. (2016). Approximation and convergence of the intrinsic volume. <i>Advances in Mathematics</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.aim.2015.10.004\">https://doi.org/10.1016/j.aim.2015.10.004</a>","mla":"Edelsbrunner, Herbert, and Florian Pausinger. “Approximation and Convergence of the Intrinsic Volume.” <i>Advances in Mathematics</i>, vol. 287, Academic Press, 2016, pp. 674–703, doi:<a href=\"https://doi.org/10.1016/j.aim.2015.10.004\">10.1016/j.aim.2015.10.004</a>.","ista":"Edelsbrunner H, Pausinger F. 2016. Approximation and convergence of the intrinsic volume. Advances in Mathematics. 287, 674–703.","short":"H. Edelsbrunner, F. Pausinger, Advances in Mathematics 287 (2016) 674–703.","chicago":"Edelsbrunner, Herbert, and Florian Pausinger. “Approximation and Convergence of the Intrinsic Volume.” <i>Advances in Mathematics</i>. Academic Press, 2016. <a href=\"https://doi.org/10.1016/j.aim.2015.10.004\">https://doi.org/10.1016/j.aim.2015.10.004</a>.","ieee":"H. Edelsbrunner and F. Pausinger, “Approximation and convergence of the intrinsic volume,” <i>Advances in Mathematics</i>, vol. 287. Academic Press, pp. 674–703, 2016.","ama":"Edelsbrunner H, Pausinger F. Approximation and convergence of the intrinsic volume. <i>Advances in Mathematics</i>. 2016;287:674-703. doi:<a href=\"https://doi.org/10.1016/j.aim.2015.10.004\">10.1016/j.aim.2015.10.004</a>"},"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Pausinger"}],"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"year":"2016"},{"quality_controlled":"1","author":[{"last_name":"Bogomolov","first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy"},{"first_name":"Alexandre","last_name":"Donzé","full_name":"Donzé, Alexandre"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"first_name":"Radu","last_name":"Grosu","full_name":"Grosu, Radu"},{"full_name":"Johnson, Taylor","first_name":"Taylor","last_name":"Johnson"},{"last_name":"Ladan","first_name":"Hamed","full_name":"Ladan, Hamed"},{"last_name":"Podelski","first_name":"Andreas","full_name":"Podelski, Andreas"},{"full_name":"Wehrle, Martin","last_name":"Wehrle","first_name":"Martin"}],"citation":{"ama":"Bogomolov S, Donzé A, Frehse G, et al. Guided search for hybrid systems based on coarse-grained space abstractions. <i>International Journal on Software Tools for Technology Transfer</i>. 2016;18(4):449-467. doi:<a href=\"https://doi.org/10.1007/s10009-015-0393-y\">10.1007/s10009-015-0393-y</a>","ieee":"S. Bogomolov <i>et al.</i>, “Guided search for hybrid systems based on coarse-grained space abstractions,” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 18, no. 4. Springer, pp. 449–467, 2016.","ista":"Bogomolov S, Donzé A, Frehse G, Grosu R, Johnson T, Ladan H, Podelski A, Wehrle M. 2016. Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. 18(4), 449–467.","chicago":"Bogomolov, Sergiy, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor Johnson, Hamed Ladan, Andreas Podelski, and Martin Wehrle. “Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.” <i>International Journal on Software Tools for Technology Transfer</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s10009-015-0393-y\">https://doi.org/10.1007/s10009-015-0393-y</a>.","short":"S. Bogomolov, A. Donzé, G. Frehse, R. Grosu, T. Johnson, H. Ladan, A. Podelski, M. Wehrle, International Journal on Software Tools for Technology Transfer 18 (2016) 449–467.","mla":"Bogomolov, Sergiy, et al. “Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 18, no. 4, Springer, 2016, pp. 449–67, doi:<a href=\"https://doi.org/10.1007/s10009-015-0393-y\">10.1007/s10009-015-0393-y</a>.","apa":"Bogomolov, S., Donzé, A., Frehse, G., Grosu, R., Johnson, T., Ladan, H., … Wehrle, M. (2016). Guided search for hybrid systems based on coarse-grained space abstractions. <i>International Journal on Software Tools for Technology Transfer</i>. Springer. <a href=\"https://doi.org/10.1007/s10009-015-0393-y\">https://doi.org/10.1007/s10009-015-0393-y</a>"},"year":"2016","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["000"],"oa":1,"_id":"1705","publication":"International Journal on Software Tools for Technology Transfer","title":"Guided search for hybrid systems based on coarse-grained space abstractions","publication_status":"published","abstract":[{"text":"Hybrid systems represent an important and powerful formalism for modeling real-world applications such as embedded systems. A verification tool like SpaceEx is based on the exploration of a symbolic search space (the region space). As a verification tool, it is typically optimized towards proving the absence of errors. In some settings, e.g., when the verification tool is employed in a feedback-directed design cycle, one would like to have the option to call a version that is optimized towards finding an error trajectory in the region space. A recent approach in this direction is based on guided search. Guided search relies on a cost function that indicates which states are promising to be explored, and preferably explores more promising states first. In this paper, we propose an abstraction-based cost function based on coarse-grained space abstractions for guiding the reachability analysis. For this purpose, a suitable abstraction technique that exploits the flexible granularity of modern reachability analysis algorithms is introduced. The new cost function is an effective extension of pattern database approaches that have been successfully applied in other areas. The approach has been implemented in the SpaceEx model checker. The evaluation shows its practical potential.","lang":"eng"}],"project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"volume":18,"issue":"4","pubrep_id":"457","publisher":"Springer","file_date_updated":"2020-07-14T12:45:13Z","publist_id":"5431","intvolume":"        18","status":"public","date_created":"2018-12-11T11:53:34Z","month":"08","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (via OA deal)","day":"01","date_updated":"2021-01-12T06:52:38Z","type":"journal_article","oa_version":"Published Version","doi":"10.1007/s10009-015-0393-y","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"has_accepted_license":"1","ec_funded":1,"page":"449 - 467","date_published":"2016-08-01T00:00:00Z","file":[{"relation":"main_file","date_created":"2018-12-12T10:15:26Z","file_size":2296522,"creator":"system","content_type":"application/pdf","file_id":"5146","date_updated":"2020-07-14T12:45:13Z","file_name":"IST-2016-457-v1+1_s10009-015-0393-y.pdf","checksum":"31561d7705599a9bd4ea816accc0752e","access_level":"open_access"}],"scopus_import":1},{"publist_id":"5429","scopus_import":1,"article_number":"7402041","status":"public","date_created":"2018-12-11T11:53:35Z","conference":{"end_date":"2015-12-02","name":"ICT-DM: Information and Communication Technologies for Disaster Management","start_date":"2015-11-30","location":"Rennes, France"},"month":"02","date_published":"2016-02-11T00:00:00Z","publisher":"IEEE","language":[{"iso":"eng"}],"doi":"10.1109/ICT-DM.2015.7402041","department":[{"_id":"ChLa"}],"_id":"1707","title":"Optimal geospatial allocation of volunteers for crisis management","publication_status":"published","abstract":[{"text":"Volunteer supporters play an important role in modern crisis and disaster management. In the times of mobile Internet devices, help from thousands of volunteers can be requested within a short time span, thus relieving professional helpers from minor chores or geographically spread-out tasks. However, the simultaneous availability of many volunteers also poses new problems. In particular, the volunteer efforts must be well coordinated, or otherwise situations might emerge in which too many idle volunteers at one location become more of a burden than a relief to the professionals.\r\nIn this work, we study the task of optimally assigning volunteers to selected locations, e.g. in order to perform regular measurements, to report on damage, or to distribute information or resources to the population in a crisis situation. We formulate the assignment tasks as an optimization problem and propose an effective and efficient solution procedure. Experiments on real data of the Team Österreich, consisting of over 36,000 Austrian volunteers, show the effectiveness and efficiency of our approach.","lang":"eng"}],"acknowledgement":"The DRIVER FP7 project has received funding from the European Unions Seventh Framework Programme for research, technological development and demonstration under grant agreement no 607798. RE-ACTA was funded within the framework of the Austrian Security Research Programme KIRAS by the Federal Ministry for Transport, Innovation and Technology.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"id":"49BC895A-F248-11E8-B48F-1D18A9856A87","full_name":"Pielorz, Jasmin","first_name":"Jasmin","last_name":"Pielorz"},{"first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","citation":{"ama":"Pielorz J, Lampert C. Optimal geospatial allocation of volunteers for crisis management. In: IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/ICT-DM.2015.7402041\">10.1109/ICT-DM.2015.7402041</a>","ieee":"J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for crisis management,” presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France, 2016.","short":"J. Pielorz, C. Lampert, in:, IEEE, 2016.","chicago":"Pielorz, Jasmin, and Christoph Lampert. “Optimal Geospatial Allocation of Volunteers for Crisis Management.” IEEE, 2016. <a href=\"https://doi.org/10.1109/ICT-DM.2015.7402041\">https://doi.org/10.1109/ICT-DM.2015.7402041</a>.","ista":"Pielorz J, Lampert C. 2016. Optimal geospatial allocation of volunteers for crisis management. ICT-DM: Information and Communication Technologies for Disaster Management, 7402041.","apa":"Pielorz, J., &#38; Lampert, C. (2016). Optimal geospatial allocation of volunteers for crisis management. Presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France: IEEE. <a href=\"https://doi.org/10.1109/ICT-DM.2015.7402041\">https://doi.org/10.1109/ICT-DM.2015.7402041</a>","mla":"Pielorz, Jasmin, and Christoph Lampert. <i>Optimal Geospatial Allocation of Volunteers for Crisis Management</i>. 7402041, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/ICT-DM.2015.7402041\">10.1109/ICT-DM.2015.7402041</a>."},"day":"11","year":"2016","date_updated":"2021-01-12T06:52:39Z","type":"conference","oa_version":"None"},{"scopus_import":1,"arxiv":1,"page":"17 - 46","date_published":"2016-09-01T00:00:00Z","external_id":{"arxiv":["1210.0508"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00453-015-0017-7","department":[{"_id":"VlKo"}],"ec_funded":1,"acknowledgement":"This work has been partially supported by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no. 616160.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","type":"journal_article","date_updated":"2023-10-17T09:51:31Z","oa_version":"Preprint","publist_id":"5316","intvolume":"        76","status":"public","date_created":"2018-12-11T11:54:02Z","month":"09","volume":76,"issue":"1","publisher":"Springer","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"2272"}]},"oa":1,"_id":"1794","publication":"Algorithmica","title":"Inference algorithms for pattern-based CRFs on sequence data","publication_status":"published","abstract":[{"lang":"eng","text":"We consider Conditional random fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) (Formula presented.) is the sum of terms over intervals [i, j] where each term is non-zero only if the substring (Formula presented.) equals a prespecified pattern w. Such CRFs can be naturally applied to many sequence tagging problems. We present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.) where L is the combined length of input patterns, (Formula presented.) is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of Ye et al. (NIPS, 2009) whose complexities are respectively (Formula presented.), (Formula presented.) and (Formula presented.), where (Formula presented.) is the number of input patterns. In addition, we give an efficient algorithm for sampling, and revisit the case of MAP with non-positive weights."}],"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Rustem","last_name":"Takhanov","full_name":"Takhanov, Rustem","id":"2CCAC26C-F248-11E8-B48F-1D18A9856A87"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.0508"}],"citation":{"chicago":"Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” <i>Algorithmica</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00453-015-0017-7\">https://doi.org/10.1007/s00453-015-0017-7</a>.","short":"V. Kolmogorov, R. Takhanov, Algorithmica 76 (2016) 17–46.","ista":"Kolmogorov V, Takhanov R. 2016. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 76(1), 17–46.","ieee":"V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” <i>Algorithmica</i>, vol. 76, no. 1. Springer, pp. 17–46, 2016.","ama":"Kolmogorov V, Takhanov R. Inference algorithms for pattern-based CRFs on sequence data. <i>Algorithmica</i>. 2016;76(1):17-46. doi:<a href=\"https://doi.org/10.1007/s00453-015-0017-7\">10.1007/s00453-015-0017-7</a>","mla":"Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” <i>Algorithmica</i>, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:<a href=\"https://doi.org/10.1007/s00453-015-0017-7\">10.1007/s00453-015-0017-7</a>.","apa":"Kolmogorov, V., &#38; Takhanov, R. (2016). Inference algorithms for pattern-based CRFs on sequence data. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-015-0017-7\">https://doi.org/10.1007/s00453-015-0017-7</a>"},"year":"2016"},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.00600"}],"citation":{"chicago":"Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” <i>Journal of Multivariate Analysis</i>. Elsevier, 2016. <a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">https://doi.org/10.1016/j.jmva.2015.10.005</a>.","short":"A. Klimova, T. Rudas, Journal of Multivariate Analysis 143 (2016) 440–452.","ista":"Klimova A, Rudas T. 2016. On the closure of relational models. Journal of Multivariate Analysis. 143, 440–452.","ieee":"A. Klimova and T. Rudas, “On the closure of relational models,” <i>Journal of Multivariate Analysis</i>, vol. 143. Elsevier, pp. 440–452, 2016.","ama":"Klimova A, Rudas T. On the closure of relational models. <i>Journal of Multivariate Analysis</i>. 2016;143:440-452. doi:<a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">10.1016/j.jmva.2015.10.005</a>","apa":"Klimova, A., &#38; Rudas, T. (2016). On the closure of relational models. <i>Journal of Multivariate Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">https://doi.org/10.1016/j.jmva.2015.10.005</a>","mla":"Klimova, Anna, and Tamás Rudas. “On the Closure of Relational Models.” <i>Journal of Multivariate Analysis</i>, vol. 143, Elsevier, 2016, pp. 440–52, doi:<a href=\"https://doi.org/10.1016/j.jmva.2015.10.005\">10.1016/j.jmva.2015.10.005</a>."},"author":[{"id":"31934120-F248-11E8-B48F-1D18A9856A87","full_name":"Klimova, Anna","first_name":"Anna","last_name":"Klimova"},{"last_name":"Rudas","first_name":"Tamás","full_name":"Rudas, Tamás"}],"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_updated":"2021-01-12T06:53:30Z","type":"journal_article","year":"2016","day":"01","title":"On the closure of relational models","publication":"Journal of Multivariate Analysis","_id":"1833","department":[{"_id":"CaUh"}],"doi":"10.1016/j.jmva.2015.10.005","oa":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Relational models for contingency tables are generalizations of log-linear models, allowing effects associated with arbitrary subsets of cells in the table, and not necessarily containing the overall effect, that is, a common parameter in every cell. Similarly to log-linear models, relational models can be extended to non-negative distributions, but the extension requires more complex methods. An extended relational model is defined as an algebraic variety, and it turns out to be the closure of the original model with respect to the Bregman divergence. In the extended relational model, the MLE of the cell parameters always exists and is unique, but some of its properties may be different from those of the MLE under log-linear models. The MLE can be computed using a generalized iterative scaling procedure based on Bregman projections. "}],"publication_status":"published","date_published":"2016-01-01T00:00:00Z","volume":143,"page":"440 - 452","publisher":"Elsevier","intvolume":"       143","scopus_import":1,"publist_id":"5270","month":"01","date_created":"2018-12-11T11:54:15Z","status":"public"}]