[{"year":"2018","date_created":"2021-11-14T23:01:25Z","author":[{"full_name":"Allini, Elie Noumon","first_name":"Elie Noumon","last_name":"Allini"},{"first_name":"Maciej","last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"},{"full_name":"Petura, Oto","last_name":"Petura","first_name":"Oto"},{"first_name":"Florent","last_name":"Bernard","full_name":"Bernard, Florent"},{"full_name":"Laban, Marek","first_name":"Marek","last_name":"Laban"},{"first_name":"Viktor","last_name":"Fischer","full_name":"Fischer, Viktor"}],"month":"01","scopus_import":"1","abstract":[{"lang":"eng","text":"In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied."}],"oa":1,"date_updated":"2026-07-06T13:16:35Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"OA_type":"diamond","intvolume":"      2018","publication_status":"published","quality_controlled":"1","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.13154/tches.v2018.i3.214-242","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"article_type":"original","file":[{"creator":"cchlebak","date_updated":"2021-11-15T10:27:29Z","relation":"main_file","content_type":"application/pdf","checksum":"b816b848f046c48a8357700d9305dce5","success":1,"access_level":"open_access","date_created":"2021-11-15T10:27:29Z","file_size":955755,"file_id":"10289","file_name":"2018_IACR_Allini.pdf"}],"has_accepted_license":"1","doi":"10.13154/tches.v2018.i3.214-242","day":"01","_id":"10286","OA_place":"publisher","date_published":"2018-01-01T00:00:00Z","volume":2018,"ddc":["000"],"oa_version":"Published Version","status":"public","article_processing_charge":"No","issue":"3","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","type":"journal_article","publication_identifier":{"eissn":["2569-2925"]},"file_date_updated":"2021-11-15T10:27:29Z","title":"Evaluation and monitoring of free running oscillators serving as source of randomness","citation":{"mla":"Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>.","ama":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. 2018;2018(3):214-242. doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>","ista":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.","short":"E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242.","chicago":"Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research, 2018. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>.","ieee":"E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018.","apa":"Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., &#38; Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>"},"corr_author":"1","das_tickbox":"1","publisher":"International Association for Cryptologic Research","page":"214-242"},{"volume":34,"ddc":["570"],"oa_version":"Published Version","issue":"21","status":"public","article_processing_charge":"No","publication":"Bioinformatics","type":"journal_article","isi":1,"file_date_updated":"2020-07-14T12:47:15Z","title":"Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation","publication_identifier":{"eissn":["1367-4811"]},"has_accepted_license":"1","doi":"10.1093/bioinformatics/bty340","day":"01","_id":"5995","date_published":"2018-11-01T00:00:00Z","das_tickbox":"1","publisher":"Oxford University Press","page":"3653-3658","citation":{"mla":"Usmanova, Dinara R., et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” <i>Bioinformatics</i>, vol. 34, no. 21, Oxford University Press, 2018, pp. 3653–58, doi:<a href=\"https://doi.org/10.1093/bioinformatics/bty340\">10.1093/bioinformatics/bty340</a>.","ista":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, Eremina AA, Gorshkova AA, Kanevskiy GM, Lonishin LR, Meister AV, Yakupova AG, Kondrashov F, Ivankov D. 2018. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 34(21), 3653–3658.","ama":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, et al. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. <i>Bioinformatics</i>. 2018;34(21):3653-3658. doi:<a href=\"https://doi.org/10.1093/bioinformatics/bty340\">10.1093/bioinformatics/bty340</a>","short":"D.R. Usmanova, N.S. Bogatyreva, J. Ariño Bernad, A.A. Eremina, A.A. Gorshkova, G.M. Kanevskiy, L.R. Lonishin, A.V. Meister, A.G. Yakupova, F. Kondrashov, D. Ivankov, Bioinformatics 34 (2018) 3653–3658.","chicago":"Usmanova, Dinara R, Natalya S Bogatyreva, Joan Ariño Bernad, Aleksandra A Eremina, Anastasiya A Gorshkova, German M Kanevskiy, Lyubov R Lonishin, et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” <i>Bioinformatics</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/bioinformatics/bty340\">https://doi.org/10.1093/bioinformatics/bty340</a>.","ieee":"D. R. Usmanova <i>et al.</i>, “Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation,” <i>Bioinformatics</i>, vol. 34, no. 21. Oxford University Press, pp. 3653–3658, 2018.","apa":"Usmanova, D. R., Bogatyreva, N. S., Ariño Bernad, J., Eremina, A. A., Gorshkova, A. A., Kanevskiy, G. M., … Ivankov, D. (2018). Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/bty340\">https://doi.org/10.1093/bioinformatics/bty340</a>"},"oa":1,"date_updated":"2026-07-06T13:48:02Z","tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"intvolume":"        34","publication_status":"published","year":"2018","date_created":"2019-02-14T12:48:00Z","author":[{"full_name":"Usmanova, Dinara R","last_name":"Usmanova","first_name":"Dinara R"},{"first_name":"Natalya S","last_name":"Bogatyreva","full_name":"Bogatyreva, Natalya S"},{"full_name":"Ariño Bernad, Joan","first_name":"Joan","last_name":"Ariño Bernad"},{"last_name":"Eremina","first_name":"Aleksandra A","full_name":"Eremina, Aleksandra A"},{"last_name":"Gorshkova","first_name":"Anastasiya A","full_name":"Gorshkova, Anastasiya A"},{"full_name":"Kanevskiy, German M","first_name":"German M","last_name":"Kanevskiy"},{"full_name":"Lonishin, Lyubov R","first_name":"Lyubov R","last_name":"Lonishin"},{"first_name":"Alexander V","last_name":"Meister","full_name":"Meister, Alexander V"},{"last_name":"Yakupova","first_name":"Alisa G","full_name":"Yakupova, Alisa G"},{"first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor"},{"orcid":"0000-0002-8224-4118","last_name":"Ivankov","id":"49FF1036-F248-11E8-B48F-1D18A9856A87","first_name":"Dmitry","full_name":"Ivankov, Dmitry"}],"external_id":{"pmid":["29722803"],"isi":["000450038900008"]},"month":"11","scopus_import":"1","abstract":[{"text":"Motivation\r\nComputational prediction of the effect of mutations on protein stability is used by researchers in many fields. The utility of the prediction methods is affected by their accuracy and bias. Bias, a systematic shift of the predicted change of stability, has been noted as an issue for several methods, but has not been investigated systematically. Presence of the bias may lead to misleading results especially when exploring the effects of combination of different mutations.\r\n\r\nResults\r\nHere we use a protocol to measure the bias as a function of the number of introduced mutations. It is based on a self-consistency test of the reciprocity the effect of a mutation. An advantage of the used approach is that it relies solely on crystal structures without experimentally measured stability values. We applied the protocol to four popular algorithms predicting change of protein stability upon mutation, FoldX, Eris, Rosetta and I-Mutant, and found an inherent bias. For one program, FoldX, we manage to substantially reduce the bias using additional relaxation by Modeller. Authors using algorithms for predicting effects of mutations should be aware of the bias described here.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"FyKo"}],"pmid":1,"license":"https://creativecommons.org/licenses/by-nc/4.0/","file":[{"date_created":"2019-02-14T13:00:55Z","file_size":291969,"file_id":"5997","file_name":"2018_Oxford_Usmanova.pdf","relation":"main_file","creator":"kschuh","date_updated":"2020-07-14T12:47:15Z","access_level":"open_access","checksum":"7e0495153f44211479674601d7f6ee03","content_type":"application/pdf"}],"project":[{"_id":"26120F5C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Systematic investigation of epistasis in molecular evolution","grant_number":"335980"}],"quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1093/bioinformatics/bty340"},{"corr_author":"1","citation":{"mla":"Fischer, Julian L., and Günther Grün. “Existence of Positive Solutions to Stochastic Thin-Film Equations.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 1, Society for Industrial and Applied Mathematics, 2018, pp. 411–55, doi:<a href=\"https://doi.org/10.1137/16M1098796\">10.1137/16M1098796</a>.","ama":"Fischer JL, Grün G. Existence of positive solutions to stochastic thin-film equations. <i>SIAM Journal on Mathematical Analysis</i>. 2018;50(1):411-455. doi:<a href=\"https://doi.org/10.1137/16M1098796\">10.1137/16M1098796</a>","ista":"Fischer JL, Grün G. 2018. Existence of positive solutions to stochastic thin-film equations. SIAM Journal on Mathematical Analysis. 50(1), 411–455.","short":"J.L. Fischer, G. Grün, SIAM Journal on Mathematical Analysis 50 (2018) 411–455.","chicago":"Fischer, Julian L, and Günther Grün. “Existence of Positive Solutions to Stochastic Thin-Film Equations.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/16M1098796\">https://doi.org/10.1137/16M1098796</a>.","apa":"Fischer, J. L., &#38; Grün, G. (2018). Existence of positive solutions to stochastic thin-film equations. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/16M1098796\">https://doi.org/10.1137/16M1098796</a>","ieee":"J. L. Fischer and G. Grün, “Existence of positive solutions to stochastic thin-film equations,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 1. Society for Industrial and Applied Mathematics, pp. 411–455, 2018."},"das_tickbox":"1","page":"411 - 455","publisher":"Society for Industrial and Applied Mathematics","_id":"404","day":"30","doi":"10.1137/16M1098796","has_accepted_license":"1","publist_id":"7425","date_published":"2018-01-30T00:00:00Z","article_processing_charge":"No","status":"public","issue":"1","oa_version":"Published Version","ddc":["510"],"volume":50,"file_date_updated":"2020-07-14T12:46:22Z","title":"Existence of positive solutions to stochastic thin-film equations","isi":1,"type":"journal_article","publication":"SIAM Journal on Mathematical Analysis","fulldoi":"https://doi.org/10.1137/16M1098796","language":[{"iso":"eng"}],"quality_controlled":"1","article_type":"original","department":[{"_id":"JuFi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"access_level":"open_access","checksum":"89a8eae7c52bb356c04f52b44bff4b5a","content_type":"application/pdf","relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:46:22Z","file_id":"6992","file_name":"2018_SIAM_Fischer.pdf","date_created":"2019-11-07T12:20:25Z","file_size":557338}],"external_id":{"isi":["000426630900015"]},"author":[{"full_name":"Fischer, Julian L","first_name":"Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X"},{"last_name":"Grün","first_name":"Günther","full_name":"Grün, Günther"}],"date_created":"2018-12-11T11:46:17Z","year":"2018","abstract":[{"text":"We construct martingale solutions to stochastic thin-film equations by introducing a (spatial) semidiscretization and establishing convergence. The discrete scheme allows for variants of the energy and entropy estimates in the continuous setting as long as the discrete energy does not exceed certain threshold values depending on the spatial grid size $h$. Using a stopping time argument to prolongate high-energy paths constant in time, arbitrary moments of coupled energy/entropy functionals can be controlled. Having established Hölder regularity of approximate solutions, the convergence proof is then based on compactness arguments---in particular on Jakubowski's generalization of Skorokhod's theorem---weak convergence methods, and recent tools on martingale convergence.\r\n\r\n","lang":"eng"}],"month":"01","scopus_import":"1","date_updated":"2026-07-06T14:01:18Z","oa":1,"publication_status":"published","intvolume":"        50"},{"arxiv":1,"oa_version":"Published Version","ddc":["500"],"status":"public","article_processing_charge":"No","issue":"3","volume":50,"type":"journal_article","title":"Power law decay for systems of randomly coupled differential equations","main_file_link":[{"url":"https://arxiv.org/abs/1708.01546","open_access":"1"}],"isi":1,"publication":"SIAM Journal on Mathematical Analysis","day":"01","_id":"181","doi":"10.1137/17M1143125","acknowledgement":"The work of the second author was also partially supported by the Hausdorff Center of Mathematics.","publist_id":"7740","date_published":"2018-01-01T00:00:00Z","das_tickbox":"1","page":"3271 - 3290","publisher":"Society for Industrial and Applied Mathematics","citation":{"ista":"Erdös L, Krüger TH, Renfrew DT. 2018. Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. 50(3), 3271–3290.","short":"L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis 50 (2018) 3271–3290.","mla":"Erdös, László, et al. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3, Society for Industrial and Applied Mathematics, 2018, pp. 3271–90, doi:<a href=\"https://doi.org/10.1137/17M1143125\">10.1137/17M1143125</a>.","ama":"Erdös L, Krüger TH, Renfrew DT. Power law decay for systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical Analysis</i>. 2018;50(3):3271-3290. doi:<a href=\"https://doi.org/10.1137/17M1143125\">10.1137/17M1143125</a>","chicago":"Erdös, László, Torben H Krüger, and David T Renfrew. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/17M1143125\">https://doi.org/10.1137/17M1143125</a>.","apa":"Erdös, L., Krüger, T. H., &#38; Renfrew, D. T. (2018). Power law decay for systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/17M1143125\">https://doi.org/10.1137/17M1143125</a>","ieee":"L. Erdös, T. H. Krüger, and D. T. Renfrew, “Power law decay for systems of randomly coupled differential equations,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3. Society for Industrial and Applied Mathematics, pp. 3271–3290, 2018."},"date_updated":"2026-07-06T14:02:06Z","oa":1,"intvolume":"        50","publication_status":"published","author":[{"first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László"},{"full_name":"Krüger, Torben H","first_name":"Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Renfrew, David T","id":"4845BF6A-F248-11E8-B48F-1D18A9856A87","last_name":"Renfrew","orcid":"0000-0003-3493-121X","first_name":"David T"}],"external_id":{"isi":["000437018500032"],"arxiv":["1708.01546"]},"date_created":"2018-12-11T11:45:03Z","year":"2018","month":"01","scopus_import":"1","abstract":[{"text":"We consider large random matrices X with centered, independent entries but possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for f, g functions analytic on the spectrum of X. We use these results to compute the long time asymptotics for systems of coupled di erential equations with random coe cients. We show that when the coupling is critical, the norm squared of the solution decays like t−1/2.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"LaEr"}],"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"},{"call_identifier":"FWF","name":"Structured Non-Hermitian Random Matrices","grant_number":"M02080","_id":"258F40A4-B435-11E9-9278-68D0E5697425"}],"fulldoi":"https://doi.org/10.1137/17M1143125","quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1},{"external_id":{"isi":["000428958900038"]},"author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Iglesias Ham, Mabel","last_name":"Iglesias Ham","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","first_name":"Mabel"}],"year":"2018","date_created":"2018-12-11T11:45:46Z","abstract":[{"lang":"eng","text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice."}],"scopus_import":"1","month":"03","oa":1,"date_updated":"2026-07-06T14:00:50Z","publication_status":"published","intvolume":"        32","project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"fulldoi":"https://doi.org/10.1137/16M1097201","language":[{"iso":"eng"}],"quality_controlled":"1","article_type":"original","department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"312","day":"29","doi":"10.1137/16M1097201","acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","publist_id":"7553","date_published":"2018-03-29T00:00:00Z","article_processing_charge":"No","issue":"1","status":"public","oa_version":"Submitted Version","volume":32,"main_file_link":[{"url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf","open_access":"1"}],"isi":1,"publication_identifier":{"issn":["0895-4801"]},"title":"On the optimality of the FCC lattice for soft sphere packing","type":"journal_article","publication":"SIAM J Discrete Math","citation":{"chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>.","apa":"Edelsbrunner, H., &#38; Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>","ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” <i>SIAM J Discrete Math</i>, vol. 32, no. 1. Society for Industrial and Applied Mathematics, pp. 750–782, 2018.","ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. 2018;32(1):750-782. doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>, vol. 32, no. 1, Society for Industrial and Applied Mathematics, 2018, pp. 750–82, doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>.","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782."},"das_tickbox":"1","page":"750 - 782","publisher":"Society for Industrial and Applied Mathematics"},{"day":"20","_id":"22","doi":"10.1364/OPTICA.5.001210","publist_id":"8033","date_published":"2018-10-20T00:00:00Z","oa_version":"Published Version","ddc":["530"],"status":"public","issue":"10","article_processing_charge":"No","volume":5,"type":"journal_article","title":"Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters","isi":1,"main_file_link":[{"url":"www.doi.org/10.1364/OPTICA.5.001210 ","open_access":"1"}],"publication_identifier":{"issn":["2334-2536"]},"publication":"Optica","citation":{"short":"G. Botello, F. Sedlmeir, A.R. Rueda Sanchez, K. Abdalmalak, E. Brown, G. Leuchs, S. Preu, D. Segovia Vargas, D. Strekalov, L. Munoz, H. Schwefel, Optica 5 (2018) 1210–1219.","mla":"Botello, Gabriel, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>, vol. 5, no. 10, Optica Publishing Group, 2018, pp. 1210–19, doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>.","ista":"Botello G, Sedlmeir F, Rueda Sanchez AR, Abdalmalak K, Brown E, Leuchs G, Preu S, Segovia Vargas D, Strekalov D, Munoz L, Schwefel H. 2018. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. Optica. 5(10), 1210–1219.","ama":"Botello G, Sedlmeir F, Rueda Sanchez AR, et al. Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. 2018;5(10):1210-1219. doi:<a href=\"https://doi.org/10.1364/OPTICA.5.001210\">10.1364/OPTICA.5.001210</a>","ieee":"G. Botello <i>et al.</i>, “Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters,” <i>Optica</i>, vol. 5, no. 10. Optica Publishing Group, pp. 1210–1219, 2018.","apa":"Botello, G., Sedlmeir, F., Rueda Sanchez, A. R., Abdalmalak, K., Brown, E., Leuchs, G., … Schwefel, H. (2018). Sensitivity limits of millimeter-wave photonic radiometers based on efficient electro-optic upconverters. <i>Optica</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>","chicago":"Botello, Gabriel, Florian Sedlmeir, Alfredo R Rueda Sanchez, Kerlos Abdalmalak, Elliott Brown, Gerd Leuchs, Sascha Preu, et al. “Sensitivity Limits of Millimeter-Wave Photonic Radiometers Based on Efficient Electro-Optic Upconverters.” <i>Optica</i>. Optica Publishing Group, 2018. <a href=\"https://doi.org/10.1364/OPTICA.5.001210\">https://doi.org/10.1364/OPTICA.5.001210</a>."},"das_tickbox":"1","page":"1210-1219","publisher":"Optica Publishing Group","author":[{"last_name":"Botello","first_name":"Gabriel","full_name":"Botello, Gabriel"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"last_name":"Rueda Sanchez","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-5860","first_name":"Alfredo R","full_name":"Rueda Sanchez, Alfredo R"},{"first_name":"Kerlos","last_name":"Abdalmalak","full_name":"Abdalmalak, Kerlos"},{"full_name":"Brown, Elliott","last_name":"Brown","first_name":"Elliott"},{"full_name":"Leuchs, Gerd","last_name":"Leuchs","first_name":"Gerd"},{"first_name":"Sascha","last_name":"Preu","full_name":"Preu, Sascha"},{"last_name":"Segovia Vargas","first_name":"Daniel","full_name":"Segovia Vargas, Daniel"},{"first_name":"Dmitry","last_name":"Strekalov","full_name":"Strekalov, Dmitry"},{"full_name":"Munoz, Luis","last_name":"Munoz","first_name":"Luis"},{"first_name":"Harald","last_name":"Schwefel","full_name":"Schwefel, Harald"}],"external_id":{"isi":["000447853100007"]},"date_created":"2018-12-11T11:44:12Z","year":"2018","month":"10","scopus_import":"1","abstract":[{"lang":"eng","text":"Conventional ultra-high sensitivity detectors in the millimeter-wave range are usually cooled as their own thermal noise at room temperature would mask the weak received radiation. The need for cryogenic systems increases the cost and complexity of the instruments, hindering the development of, among others, airborne and space applications. In this work, the nonlinear parametric upconversion of millimeter-wave radiation to the optical domain inside high-quality (Q) lithium niobate whispering-gallery mode (WGM) resonators is proposed for ultra-low noise detection. We experimentally demonstrate coherent upconversion of millimeter-wave signals to a 1550 nm telecom carrier, with a photon conversion efficiency surpassing the state-of-the-art by 2 orders of magnitude. Moreover, a theoretical model shows that the thermal equilibrium of counterpropagating WGMs is broken by overcoupling the millimeter-wave WGM, effectively cooling the upconverted mode and allowing ultra-low noise detection. By theoretically estimating the sensitivity of a correlation radiometer based on the presented scheme, it is found that room-temperature radiometers with better sensitivity than state-of-the-art high-electron-mobility transistor (HEMT)-based radiometers can be designed. This detection paradigm can be used to develop room-temperature instrumentation for radio astronomy, earth observation, planetary missions, and imaging systems."}],"date_updated":"2026-07-07T06:22:34Z","oa":1,"intvolume":"         5","publication_status":"published","fulldoi":"https://doi.org/10.1364/OPTICA.5.001210","quality_controlled":"1","language":[{"iso":"eng"}],"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JoFi"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"E-Lib"}],"related_material":{"record":[{"id":"6657","status":"public","relation":"later_version"}]},"file":[{"file_size":202798,"date_created":"2019-01-22T09:06:51Z","file_name":"2018_WorkingPaper_Danowski.pdf","file_id":"5872","date_updated":"2020-07-14T12:47:10Z","creator":"dernst","relation":"main_file","content_type":"application/pdf","checksum":"6cb95f8772491d155ce77c6160655fff","access_level":"open_access"}],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.5281/zenodo.1244154","oa":1,"date_updated":"2026-07-07T06:28:30Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","date_created":"2018-12-17T10:28:26Z","year":"2018","author":[{"full_name":"Danowski, Patrick","orcid":"0000-0002-6026-4409","last_name":"Danowski","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick"}],"scopus_import":"1","month":"05","abstract":[{"lang":"eng","text":"In the working paper I describe in detail the approach for Open Access definitions which was presented in the Workshop \"Open Access Monitoring - Approaches and Perspectives\" in Vienna. It defines five criteria on which are the definitions build. Each criteria can be out of 4 classes. The minimum classes for the criteria which are used in a Open Access definition can be presented as the Classification of Open Access Tuples e.g. Open Access (Berlin Declaration) (1,1,1,1,3) this methods allows much easier to distinguish between different Open Access definitions. This is needed if the Open Access Universe should be measured in studies or monitoring approaches and the results should become more comparable.     "}],"das_tickbox":"1","publisher":"Zenodo","page":"5","citation":{"ama":"Danowski P. <i>An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors</i>. Zenodo; 2018. doi:<a href=\"https://doi.org/10.5281/zenodo.1244154\">10.5281/zenodo.1244154</a>","mla":"Danowski, Patrick. <i>An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors</i>. Zenodo, 2018, doi:<a href=\"https://doi.org/10.5281/zenodo.1244154\">10.5281/zenodo.1244154</a>.","short":"P. Danowski, An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors, Zenodo, 2018.","ista":"Danowski P. 2018. An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors, Zenodo, 5p.","ieee":"P. Danowski, <i>An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors</i>. Zenodo, 2018.","apa":"Danowski, P. (2018). <i>An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors</i>. Zenodo. <a href=\"https://doi.org/10.5281/zenodo.1244154\">https://doi.org/10.5281/zenodo.1244154</a>","chicago":"Danowski, Patrick. <i>An Austrian Proposal for the Classification of Open Access Tuples (COAT) - Distinguish Different Open Access Types beyond Colors</i>. Zenodo, 2018. <a href=\"https://doi.org/10.5281/zenodo.1244154\">https://doi.org/10.5281/zenodo.1244154</a>."},"corr_author":"1","ddc":["020"],"oa_version":"Published Version","status":"public","article_processing_charge":"No","type":"working_paper","title":"An Austrian proposal for the Classification of Open Access Tuples (COAT) - Distinguish different Open Access types beyond colors","file_date_updated":"2020-07-14T12:47:10Z","has_accepted_license":"1","doi":"10.5281/zenodo.1244154","day":"09","_id":"5686","date_published":"2018-05-09T00:00:00Z"},{"citation":{"chicago":"Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/16M110407X\">https://doi.org/10.1137/16M110407X</a>.","ieee":"A. Akopyan and E. Segal Halevi, “Counting blanks in polygonal arrangements,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 32, no. 3. Society for Industrial and Applied Mathematics, pp. 2242–2257, 2018.","apa":"Akopyan, A., &#38; Segal Halevi, E. (2018). Counting blanks in polygonal arrangements. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/16M110407X\">https://doi.org/10.1137/16M110407X</a>","ista":"Akopyan A, Segal Halevi E. 2018. Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. 32(3), 2242–2257.","ama":"Akopyan A, Segal Halevi E. Counting blanks in polygonal arrangements. <i>SIAM Journal on Discrete Mathematics</i>. 2018;32(3):2242-2257. doi:<a href=\"https://doi.org/10.1137/16M110407X\">10.1137/16M110407X</a>","mla":"Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 32, no. 3, Society for Industrial and Applied Mathematics, 2018, pp. 2242–57, doi:<a href=\"https://doi.org/10.1137/16M110407X\">10.1137/16M110407X</a>.","short":"A. Akopyan, E. Segal Halevi, SIAM Journal on Discrete Mathematics 32 (2018) 2242–2257."},"publisher":"Society for Industrial and Applied Mathematics","page":"2242 - 2257","doi":"10.1137/16M110407X","_id":"58","day":"06","date_published":"2018-09-06T00:00:00Z","publist_id":"7996","volume":32,"article_processing_charge":"No","status":"public","issue":"3","arxiv":1,"oa_version":"Preprint","publication":"SIAM Journal on Discrete Mathematics","title":"Counting blanks in polygonal arrangements","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.00960"}],"type":"journal_article","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"ec_funded":1,"language":[{"iso":"eng"}],"quality_controlled":"1","fulldoi":"https://doi.org/10.1137/16M110407X","department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:44:24Z","year":"2018","external_id":{"isi":["000450810500036"],"arxiv":["1604.00960"]},"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","orcid":"0000-0002-2548-617X","first_name":"Arseniy","full_name":"Akopyan, Arseniy"},{"full_name":"Segal Halevi, Erel","last_name":"Segal Halevi","first_name":"Erel"}],"abstract":[{"lang":"eng","text":"Inside a two-dimensional region (``cake&quot;&quot;), there are m nonoverlapping tiles of a certain kind (``toppings&quot;&quot;). We want to expand the toppings while keeping them nonoverlapping, and possibly add some blank pieces of the same ``certain kind,&quot;&quot; such that the entire cake is covered. How many blanks must we add? We study this question in several cases: (1) The cake and toppings are general polygons. (2) The cake and toppings are convex figures. (3) The cake and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear polygon and the toppings are axis-parallel rectangles. In all four cases, we provide tight bounds on the number of blanks."}],"scopus_import":"1","month":"09","date_updated":"2026-07-07T10:46:26Z","oa":1,"publication_status":"published","intvolume":"        32"},{"department":[{"_id":"MiLe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","language":[{"iso":"eng"}],"ec_funded":1,"quality_controlled":"1","fulldoi":"https://doi.org/10.1103/PhysRevA.97.022510","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"}],"publication_status":"published","intvolume":"        97","date_updated":"2026-07-07T13:17:14Z","oa":1,"abstract":[{"text":"We investigate the quantum interference induced shifts between energetically close states in highly charged ions, with the energy structure being observed by laser spectroscopy. In this work, we focus on hyperfine states of lithiumlike heavy-Z isotopes and quantify how much quantum interference changes the observed transition frequencies. The process of photon excitation and subsequent photon decay for the transition 2s→2p→2s is implemented with fully relativistic and full-multipole frameworks, which are relevant for such relativistic atomic systems. We consider the isotopes Pb79+207 and Bi80+209 due to experimental interest, as well as other examples of isotopes with lower Z, namely Pr56+141 and Ho64+165. We conclude that quantum interference can induce shifts up to 11% of the linewidth in the measurable resonances of the considered isotopes, if interference between resonances is neglected. The inclusion of relativity decreases the cross section by 35%, mainly due to the complete retardation form of the electric dipole multipole. However, the contribution of the next higher multipoles (e.g., magnetic quadrupole) to the cross section is negligible. This makes the contribution of relativity and higher-order multipoles to the quantum interference induced shifts a minor effect, even for heavy-Z elements.","lang":"eng"}],"scopus_import":"1","month":"02","date_created":"2018-12-11T11:46:25Z","year":"2018","external_id":{"arxiv":["1802.07920"],"isi":["000425601000004"]},"author":[{"first_name":"Pedro","last_name":"Amaro","full_name":"Amaro, Pedro"},{"full_name":"Loureiro, Ulisses","last_name":"Loureiro","first_name":"Ulisses"},{"first_name":"Laleh","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87","last_name":"Safari","full_name":"Safari, Laleh"},{"full_name":"Fratini, Filippo","first_name":"Filippo","last_name":"Fratini"},{"full_name":"Indelicato, Paul","first_name":"Paul","last_name":"Indelicato"},{"full_name":"Stöhlker, Thomas","first_name":"Thomas","last_name":"Stöhlker"},{"full_name":"Santos, José","first_name":"José","last_name":"Santos"}],"publisher":"American Physical Society","das_tickbox":"1","citation":{"apa":"Amaro, P., Loureiro, U., Safari, L., Fratini, F., Indelicato, P., Stöhlker, T., &#38; Santos, J. (2018). Quantum interference in laser spectroscopy of highly charged lithiumlike ions. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.97.022510\">https://doi.org/10.1103/PhysRevA.97.022510</a>","ieee":"P. Amaro <i>et al.</i>, “Quantum interference in laser spectroscopy of highly charged lithiumlike ions,” <i>Physical Review A</i>, vol. 97, no. 2. American Physical Society, 2018.","chicago":"Amaro, Pedro, Ulisses Loureiro, Laleh Safari, Filippo Fratini, Paul Indelicato, Thomas Stöhlker, and José Santos. “Quantum Interference in Laser Spectroscopy of Highly Charged Lithiumlike Ions.” <i>Physical Review A</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevA.97.022510\">https://doi.org/10.1103/PhysRevA.97.022510</a>.","short":"P. Amaro, U. Loureiro, L. Safari, F. Fratini, P. Indelicato, T. Stöhlker, J. Santos, Physical Review A 97 (2018).","mla":"Amaro, Pedro, et al. “Quantum Interference in Laser Spectroscopy of Highly Charged Lithiumlike Ions.” <i>Physical Review A</i>, vol. 97, no. 2, 022510, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevA.97.022510\">10.1103/PhysRevA.97.022510</a>.","ama":"Amaro P, Loureiro U, Safari L, et al. Quantum interference in laser spectroscopy of highly charged lithiumlike ions. <i>Physical Review A</i>. 2018;97(2). doi:<a href=\"https://doi.org/10.1103/PhysRevA.97.022510\">10.1103/PhysRevA.97.022510</a>","ista":"Amaro P, Loureiro U, Safari L, Fratini F, Indelicato P, Stöhlker T, Santos J. 2018. Quantum interference in laser spectroscopy of highly charged lithiumlike ions. Physical Review A. 97(2), 022510."},"publication":"Physical Review A","title":"Quantum interference in laser spectroscopy of highly charged lithiumlike ions","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1802.07920"}],"article_number":"022510","type":"journal_article","volume":97,"status":"public","article_processing_charge":"No","issue":"2","arxiv":1,"oa_version":"Preprint","date_published":"2018-02-21T00:00:00Z","publist_id":"7396","doi":"10.1103/PhysRevA.97.022510","acknowledgement":"This work was funded by the Portuguese Fundação para a Ciência e a Tecnologia (FCT/MCTES/PIDDAC) under Grant No. UID/FIS/04559/2013 (LIBPhys). P.A. acknowledges the support of the FCT, under Contract No. SFRH/BPD/92329/2013. L.S. acknowledges financial support from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA Grant Agreement No. (291734). Laboratoire Kastler Brossel (LKB) is “Unité Mixte de Recherche de Sorbonne Université, de ENS-PSL Research University, du Collège de France et du CNRS No. 8552.” APPENDIX:\r\n","_id":"427","day":"21"},{"publist_id":"7572","date_published":"2018-04-09T00:00:00Z","day":"09","_id":"307","acknowledgement":"The work was partially supported by Russian Foundation for Basic Research (Grant No. 15-02-05657a) and by the Basic research program of Higher School of Economics (HSE).","doi":"10.1103/PhysRevA.97.043812","type":"journal_article","article_number":" 043812 ","main_file_link":[{"url":"https://arxiv.org/abs/1712.10127","open_access":"1"}],"title":"Nanoscopy of pairs of atoms by fluorescence in a magnetic field","isi":1,"publication":"Physical Review A","arxiv":1,"oa_version":"Submitted Version","issue":"4","status":"public","article_processing_charge":"No","volume":97,"citation":{"mla":"Redchenko, Elena, et al. “Nanoscopy of Pairs of Atoms by Fluorescence in a Magnetic Field.” <i>Physical Review A</i>, vol. 97, no. 4, 043812, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevA.97.043812\">10.1103/PhysRevA.97.043812</a>.","short":"E. Redchenko, A. Makarov, V. Yudson, Physical Review A 97 (2018).","ama":"Redchenko E, Makarov A, Yudson V. Nanoscopy of pairs of atoms by fluorescence in a magnetic field. <i>Physical Review A</i>. 2018;97(4). doi:<a href=\"https://doi.org/10.1103/PhysRevA.97.043812\">10.1103/PhysRevA.97.043812</a>","ista":"Redchenko E, Makarov A, Yudson V. 2018. Nanoscopy of pairs of atoms by fluorescence in a magnetic field. Physical Review A. 97(4), 043812.","chicago":"Redchenko, Elena, Alexander Makarov, and Vladimir Yudson. “Nanoscopy of Pairs of Atoms by Fluorescence in a Magnetic Field.” <i>Physical Review A</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevA.97.043812\">https://doi.org/10.1103/PhysRevA.97.043812</a>.","ieee":"E. Redchenko, A. Makarov, and V. Yudson, “Nanoscopy of pairs of atoms by fluorescence in a magnetic field,” <i>Physical Review A</i>, vol. 97, no. 4. American Physical Society, 2018.","apa":"Redchenko, E., Makarov, A., &#38; Yudson, V. (2018). Nanoscopy of pairs of atoms by fluorescence in a magnetic field. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.97.043812\">https://doi.org/10.1103/PhysRevA.97.043812</a>"},"publisher":"American Physical Society","das_tickbox":"1","month":"04","scopus_import":"1","abstract":[{"lang":"eng","text":"Spontaneous emission spectra of two initially excited closely spaced identical atoms are very sensitive to the strength and the direction of the applied magnetic field. We consider the relevant schemes that ensure the determination of the mutual spatial orientation of the atoms and the distance between them by entirely optical means. A corresponding theoretical description is given accounting for the dipole-dipole interaction between the two atoms in the presence of a magnetic field and for polarizations of the quantum field interacting with magnetic sublevels of the two-atom system. "}],"author":[{"id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","last_name":"Redchenko","first_name":"Elena","full_name":"Redchenko, Elena"},{"full_name":"Makarov, Alexander","first_name":"Alexander","last_name":"Makarov"},{"last_name":"Yudson","first_name":"Vladimir","full_name":"Yudson, Vladimir"}],"external_id":{"isi":["000429454000015"],"arxiv":["1712.10127"]},"date_created":"2018-12-11T11:45:44Z","year":"2018","intvolume":"        97","publication_status":"published","date_updated":"2026-07-07T13:16:52Z","oa":1,"fulldoi":"https://doi.org/10.1103/PhysRevA.97.043812","quality_controlled":"1","language":[{"iso":"eng"}],"article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"JoFi"}]},{"date_updated":"2026-07-07T13:35:51Z","oa":1,"intvolume":"      2018","publication_status":"published","conference":{"start_date":"2018-06-24","end_date":"2018-06-29","location":"Delft, Netherlands","name":"ICAPS: International Conference on Automated Planning and Scheduling"},"date_created":"2018-12-11T11:44:16Z","year":"2018","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Chemlík, Martin","last_name":"Chemlík","first_name":"Martin"},{"first_name":"Ufuk","last_name":"Topcu","full_name":"Topcu, Ufuk"}],"external_id":{"isi":["000492986200006"],"arxiv":["1710.00675"]},"month":"06","scopus_import":"1","abstract":[{"text":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1609/icaps.v28i1.13875","volume":2018,"oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","status":"public","publication":"28th International Conference on Automated Planning and Scheduling","type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1710.00675","open_access":"1"}],"title":"Sensor synthesis for POMDPs with reachability objectives","isi":1,"doi":"10.1609/icaps.v28i1.13875","day":"01","_id":"34","date_published":"2018-06-01T00:00:00Z","publist_id":"8021","das_tickbox":"1","publisher":"AAAI Press","page":"47 - 55","citation":{"chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives.” In <i>28th International Conference on Automated Planning and Scheduling</i>, 2018:47–55. AAAI Press, 2018. <a href=\"https://doi.org/10.1609/icaps.v28i1.13875\">https://doi.org/10.1609/icaps.v28i1.13875</a>.","ieee":"K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” in <i>28th International Conference on Automated Planning and Scheduling</i>, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.","apa":"Chatterjee, K., Chemlík, M., &#38; Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives. In <i>28th International Conference on Automated Planning and Scheduling</i> (Vol. 2018, pp. 47–55). Delft, Netherlands: AAAI Press. <a href=\"https://doi.org/10.1609/icaps.v28i1.13875\">https://doi.org/10.1609/icaps.v28i1.13875</a>","mla":"Chatterjee, Krishnendu, et al. “Sensor Synthesis for POMDPs with Reachability Objectives.” <i>28th International Conference on Automated Planning and Scheduling</i>, vol. 2018, AAAI Press, 2018, pp. 47–55, doi:<a href=\"https://doi.org/10.1609/icaps.v28i1.13875\">10.1609/icaps.v28i1.13875</a>.","ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: <i>28th International Conference on Automated Planning and Scheduling</i>. Vol 2018. AAAI Press; 2018:47-55. doi:<a href=\"https://doi.org/10.1609/icaps.v28i1.13875\">10.1609/icaps.v28i1.13875</a>","ista":"Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. 28th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2018, 47–55.","short":"K. Chatterjee, M. Chemlík, U. Topcu, in:, 28th International Conference on Automated Planning and Scheduling, AAAI Press, 2018, pp. 47–55."}},{"das_tickbox":"1","publisher":"AAAI Press","citation":{"short":"K. Chatterjee, W. Dvorák, M. Henzinger, A. Svozil, in:, 28th International Conference on Automated Planning and Scheduling, AAAI Press, 2018.","mla":"Chatterjee, Krishnendu, et al. “Algorithms and Conditional Lower Bounds for Planning Problems.” <i>28th International Conference on Automated Planning and Scheduling</i>, AAAI Press, 2018.","ama":"Chatterjee K, Dvorák W, Henzinger M, Svozil A. Algorithms and conditional lower bounds for planning problems. In: <i>28th International Conference on Automated Planning and Scheduling</i>. AAAI Press; 2018.","ista":"Chatterjee K, Dvorák W, Henzinger M, Svozil A. 2018. Algorithms and conditional lower bounds for planning problems. 28th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M., &#38; Svozil, A. (2018). Algorithms and conditional lower bounds for planning problems. In <i>28th International Conference on Automated Planning and Scheduling</i>. Delft, Netherlands: AAAI Press.","ieee":"K. Chatterjee, W. Dvorák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in <i>28th International Conference on Automated Planning and Scheduling</i>, Delft, Netherlands, 2018.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In <i>28th International Conference on Automated Planning and Scheduling</i>. AAAI Press, 2018."},"status":"public","article_processing_charge":"No","oa_version":"Preprint","arxiv":1,"publication":"28th International Conference on Automated Planning and Scheduling","isi":1,"main_file_link":[{"url":"https://arxiv.org/abs/1804.07031","open_access":"1"}],"title":"Algorithms and conditional lower bounds for planning problems","type":"conference","_id":"35","day":"01","date_published":"2018-06-01T00:00:00Z","publist_id":"8020","department":[{"_id":"KrCh"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","id":"9293","status":"public"}]},"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"date_updated":"2026-07-07T13:36:04Z","publication_status":"published","date_created":"2018-12-11T11:44:17Z","year":"2018","conference":{"name":"ICAPS: International Conference on Automated Planning and Scheduling","location":"Delft, Netherlands","end_date":"2018-06-29","start_date":"2018-06-24"},"external_id":{"arxiv":["1804.07031"],"isi":["000492986200007"]},"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Dvorák, Wolfgang","last_name":"Dvorák","first_name":"Wolfgang"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Svozil, Alexander","first_name":"Alexander","last_name":"Svozil"}],"abstract":[{"text":"We consider planning problems for graphs, Markov decision processes (MDPs), and games on graphs. While graphs represent the most basic planning model, MDPs represent interaction with nature and games on graphs represent interaction with an adversarial environment. We consider two planning problems where there are k different target sets, and the problems are as follows: (a) the coverage problem asks whether there is a plan for each individual target set; and (b) the sequential target reachability problem asks whether the targets can be reached in sequence. For the coverage problem, we present a linear-time algorithm for graphs, and quadratic conditional lower bound for MDPs and games on graphs. For the sequential target problem, we present a linear-time algorithm for graphs, a sub-quadratic algorithm for MDPs, and a quadratic conditional lower bound for games on graphs. Our results with conditional lower bounds establish (i) model-separation results showing that for the coverage problem MDPs and games on graphs are harder than graphs and for the sequential reachability problem games on graphs are harder than MDPs and graphs; and (ii) objective-separation results showing that for MDPs the coverage problem is harder than the sequential target problem.","lang":"eng"}],"month":"06","scopus_import":"1"},{"author":[{"first_name":"Kazutaka","last_name":"Nakashima","full_name":"Nakashima, Kazutaka"},{"full_name":"Auzinger, Thomas","first_name":"Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger","orcid":"0000-0002-1546-3265"},{"full_name":"Iarussi, Emmanuel","first_name":"Emmanuel","orcid":"0000-0001-7438-9299","last_name":"Iarussi","id":"33F19F16-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ran","orcid":"0000-0002-3808-281X","last_name":"Zhang","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Ran"},{"last_name":"Igarashi","first_name":"Takeo","full_name":"Igarashi, Takeo"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd"}],"external_id":{"isi":["000448185000096"]},"date_created":"2018-12-11T11:44:09Z","year":"2018","month":"08","scopus_import":"1","abstract":[{"lang":"eng","text":"Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects."}],"date_updated":"2026-07-07T14:00:35Z","oa":1,"intvolume":"        37","publication_status":"published","project":[{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"},{"name":"Distributed 3D Object Design","grant_number":"642841","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425"}],"fulldoi":"https://doi.org/10.1145/3197517.3201341","quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/","relation":"press_release","description":"News on IST Homepage"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BeBi"}],"file":[{"date_updated":"2020-07-14T12:44:38Z","creator":"system","relation":"main_file","checksum":"6a5368bc86c4e1a9fcfe588fd1f14ee8","content_type":"application/pdf","access_level":"open_access","file_size":104225664,"date_created":"2018-12-12T10:18:38Z","file_name":"IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf","file_id":"5360"},{"access_level":"open_access","checksum":"3861e693ba47c51f3ec7b7867d573a61","content_type":"application/zip","relation":"main_file","date_updated":"2020-07-14T12:44:38Z","creator":"system","file_name":"IST-2018-1037-v1+2_CoreCavity-Supplemental.zip","file_id":"5361","file_size":377743553,"date_created":"2018-12-12T10:18:39Z"},{"date_updated":"2020-07-14T12:44:38Z","creator":"system","relation":"main_file","content_type":"video/vnd.objectvideo","checksum":"490040c685ed869536e2a18f5a906b94","access_level":"open_access","file_size":162634396,"date_created":"2018-12-12T10:18:41Z","file_name":"IST-2018-1037-v1+3_CoreCavity-Video.mp4","file_id":"5362"},{"creator":"system","date_updated":"2020-07-14T12:44:38Z","relation":"main_file","checksum":"be7fc8b229adda727419b6504b3b9352","content_type":"image/jpeg","access_level":"open_access","date_created":"2018-12-12T10:18:42Z","file_size":527972,"file_id":"5363","file_name":"IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg"}],"day":"04","_id":"12","has_accepted_license":"1","doi":"10.1145/3197517.3201341","publist_id":"8044","date_published":"2018-08-04T00:00:00Z","ddc":["004","516","670"],"oa_version":"Submitted Version","status":"public","issue":"4","article_processing_charge":"No","volume":37,"article_number":"135","type":"journal_article","file_date_updated":"2020-07-14T12:44:38Z","title":"CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds","isi":1,"publication":"ACM Transactions on Graphics","citation":{"short":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transactions on Graphics 37 (2018).","mla":"Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4, 135, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201341\">10.1145/3197517.3201341</a>.","ista":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transactions on Graphics. 37(4), 135.","ama":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM Transactions on Graphics</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201341\">10.1145/3197517.3201341</a>","chicago":"Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” <i>ACM Transactions on Graphics</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201341\">https://doi.org/10.1145/3197517.3201341</a>.","apa":"Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., &#38; Bickel, B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3197517.3201341\">https://doi.org/10.1145/3197517.3201341</a>","ieee":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel, “CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds,” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4. ACM, 2018."},"pubrep_id":"1037","publisher":"ACM"},{"external_id":{"isi":["000448185000050"]},"author":[{"last_name":"Umetani","first_name":"Nobuyuki","full_name":"Umetani, Nobuyuki"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","full_name":"Bickel, Bernd"}],"year":"2018","date_created":"2018-12-11T11:44:06Z","abstract":[{"lang":"eng","text":"We present a data-driven technique to instantly predict how fluid flows around various three-dimensional objects. Such simulation is useful for computational fabrication and engineering, but is usually computationally expensive since it requires solving the Navier-Stokes equation for many time steps. To accelerate the process, we propose a machine learning framework which predicts aerodynamic forces and velocity and pressure fields given a threedimensional shape input. Handling detailed free-form three-dimensional shapes in a data-driven framework is challenging because machine learning approaches usually require a consistent parametrization of input and output. We present a novel PolyCube maps-based parametrization that can be computed for three-dimensional shapes at interactive rates. This allows us to efficiently learn the nonlinear response of the flow using a Gaussian process regression. We demonstrate the effectiveness of our approach for the interactive design and optimization of a car body."}],"scopus_import":"1","month":"08","date_updated":"2026-07-07T13:58:59Z","oa":1,"publication_status":"published","intvolume":"        37","project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020"}],"fulldoi":"https://doi.org/10.1145/3197517.3201325","ec_funded":1,"language":[{"iso":"eng"}],"quality_controlled":"1","related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/new-interactive-machine-learning-tool-makes-car-designs-more-aerodynamic/","relation":"press_release"}]},"department":[{"_id":"BeBi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"7a2243668f215821bc6aecad0320079a","content_type":"application/pdf","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:46:22Z","relation":"main_file","file_id":"5216","file_name":"IST-2018-1049-v1+1_2018_sigg_Learning3DAerodynamics.pdf","date_created":"2018-12-12T10:16:28Z","file_size":22803163}],"_id":"4","day":"04","doi":"10.1145/3197517.3201325","has_accepted_license":"1","publist_id":"8053","date_published":"2018-08-04T00:00:00Z","article_processing_charge":"No","status":"public","issue":"4","oa_version":"Submitted Version","ddc":["003","004"],"volume":37,"title":"Learning three-dimensional flow for interactive aerodynamic design","isi":1,"file_date_updated":"2020-07-14T12:46:22Z","type":"journal_article","article_number":"89","publication":"ACM Transactions on Graphics","citation":{"apa":"Umetani, N., &#38; Bickel, B. (2018). Learning three-dimensional flow for interactive aerodynamic design. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3197517.3201325\">https://doi.org/10.1145/3197517.3201325</a>","ieee":"N. Umetani and B. Bickel, “Learning three-dimensional flow for interactive aerodynamic design,” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4. ACM, 2018.","chicago":"Umetani, Nobuyuki, and Bernd Bickel. “Learning Three-Dimensional Flow for Interactive Aerodynamic Design.” <i>ACM Transactions on Graphics</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201325\">https://doi.org/10.1145/3197517.3201325</a>.","ista":"Umetani N, Bickel B. 2018. Learning three-dimensional flow for interactive aerodynamic design. ACM Transactions on Graphics. 37(4), 89.","short":"N. Umetani, B. Bickel, ACM Transactions on Graphics 37 (2018).","ama":"Umetani N, Bickel B. Learning three-dimensional flow for interactive aerodynamic design. <i>ACM Transactions on Graphics</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201325\">10.1145/3197517.3201325</a>","mla":"Umetani, Nobuyuki, and Bernd Bickel. “Learning Three-Dimensional Flow for Interactive Aerodynamic Design.” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4, 89, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201325\">10.1145/3197517.3201325</a>."},"pubrep_id":"1049","das_tickbox":"1","publisher":"ACM"},{"intvolume":"        37","publication_status":"published","oa":1,"date_updated":"2026-07-07T13:59:14Z","scopus_import":"1","month":"08","abstract":[{"text":"We propose a new method for fabricating digital objects through reusable silicone molds. Molds are generated by casting liquid silicone into custom 3D printed containers called metamolds. Metamolds automatically define the cuts that are needed to extract the cast object from the silicone mold. The shape of metamolds is designed through a novel segmentation technique, which takes into account both geometric and topological constraints involved in the process of mold casting. Our technique is simple, does not require changing the shape or topology of the input objects, and only requires off-the- shelf materials and technologies. We successfully tested our method on a set of challenging examples with complex shapes and rich geometric detail. © 2018 Association for Computing Machinery.","lang":"eng"}],"year":"2018","date_created":"2018-12-11T11:44:09Z","author":[{"full_name":"Alderighi, Thomas","first_name":"Thomas","last_name":"Alderighi"},{"last_name":"Malomo","first_name":"Luigi","full_name":"Malomo, Luigi"},{"first_name":"Daniela","last_name":"Giorgi","full_name":"Giorgi, Daniela"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","full_name":"Bickel, Bernd"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"}],"external_id":{"isi":["000448185000097"]},"file":[{"file_size":91939066,"date_created":"2018-12-12T10:18:52Z","file_name":"IST-2018-1038-v1+1_metamolds_authorversion.pdf","file_id":"5374","relation":"main_file","date_updated":"2020-07-14T12:44:43Z","creator":"system","access_level":"open_access","content_type":"application/pdf","checksum":"61d46273dca4de626accef1d17a0aaad"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BeBi"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/metamolds-molding-a-mold/","relation":"press_release","description":"News on IST Homepage"}]},"quality_controlled":"1","language":[{"iso":"eng"}],"ec_funded":1,"fulldoi":"https://doi.org/10.1145/3197517.3201381","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"publication":"ACM Transactions on Graphics","type":"journal_article","article_number":"136","file_date_updated":"2020-07-14T12:44:43Z","isi":1,"title":"Metamolds: Computational design of silicone molds","volume":37,"oa_version":"Submitted Version","ddc":["004"],"article_processing_charge":"No","issue":"4","status":"public","date_published":"2018-08-04T00:00:00Z","publist_id":"8043","has_accepted_license":"1","doi":"10.1145/3197517.3201381","day":"04","_id":"13","publisher":"ACM","das_tickbox":"1","pubrep_id":"1038","citation":{"apa":"Alderighi, T., Malomo, L., Giorgi, D., Pietroni, N., Bickel, B., &#38; Cignoni, P. (2018). Metamolds: Computational design of silicone molds. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3197517.3201381\">https://doi.org/10.1145/3197517.3201381</a>","ieee":"T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, and P. Cignoni, “Metamolds: Computational design of silicone molds,” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4. ACM, 2018.","chicago":"Alderighi, Thomas, Luigi Malomo, Daniela Giorgi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “Metamolds: Computational Design of Silicone Molds.” <i>ACM Transactions on Graphics</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201381\">https://doi.org/10.1145/3197517.3201381</a>.","mla":"Alderighi, Thomas, et al. “Metamolds: Computational Design of Silicone Molds.” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4, 136, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201381\">10.1145/3197517.3201381</a>.","ama":"Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. Metamolds: Computational design of silicone molds. <i>ACM Transactions on Graphics</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201381\">10.1145/3197517.3201381</a>","short":"T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, P. Cignoni, ACM Transactions on Graphics 37 (2018).","ista":"Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. 2018. Metamolds: Computational design of silicone molds. ACM Transactions on Graphics. 37(4), 136."}},{"year":"2018","date_created":"2019-06-27T09:32:55Z","conference":{"location":"Montreal, Canada","name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2018-12-08","start_date":"2018-12-02"},"external_id":{"isi":["000461852000047"],"arxiv":["1809.10505"]},"author":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Hoefler, Torsten","first_name":"Torsten","last_name":"Hoefler"},{"full_name":"Johansson, Mikael","first_name":"Mikael","last_name":"Johansson"},{"full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","last_name":"Konstantinov","orcid":"0009-0009-5204-7621","first_name":"Nikola H"},{"last_name":"Khirirat","first_name":"Sarit","full_name":"Khirirat, Sarit"},{"last_name":"Renggli","first_name":"Cedric","full_name":"Renggli, Cedric"}],"abstract":[{"lang":"eng","text":"Distributed training of massive machine learning models, in particular deep neural networks, via Stochastic Gradient Descent (SGD) is becoming commonplace. Several families of communication-reduction methods, such as quantization, large-batch methods, and gradient sparsification, have been proposed. To date, gradient sparsification methods--where each node sorts gradients by magnitude, and only communicates a subset of the components, accumulating the rest locally--are known to yield some of the largest practical gains. Such methods can reduce the amount of communication per step by up to \\emph{three orders of magnitude}, while preserving model accuracy. Yet, this family of methods currently has no theoretical justification. This is the question we address in this paper. We prove that, under analytic assumptions, sparsifying gradients by magnitude with local error correction provides convergence guarantees, for both convex and non-convex smooth objectives, for data-parallel SGD. The main insight is that sparsification methods implicitly maintain bounds on the maximum impact of stale updates, thanks to selection by magnitude. Our analysis and empirical validation also reveal that these methods do require analytical conditions to converge well, justifying existing heuristics."}],"scopus_import":"1","month":"12","oa":1,"date_updated":"2026-07-08T05:48:21Z","publication_status":"published","project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"language":[{"iso":"eng"}],"ec_funded":1,"quality_controlled":"1","department":[{"_id":"DaAl"},{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["Advances in Neural Information Processing Systems"],"_id":"6589","day":"01","date_published":"2018-12-01T00:00:00Z","article_processing_charge":"No","status":"public","arxiv":1,"oa_version":"Preprint","publication":"32nd Conference on Neural Information Processing Systems","publication_identifier":{"issn":["1049-5258"]},"title":"The convergence of sparsified gradient methods","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.10505"}],"isi":1,"type":"conference","corr_author":"1","citation":{"mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Sparsified Gradient Methods.” <i>32nd Conference on Neural Information Processing Systems</i>, Neural Information Processing Systems Foundation, 2018, pp. 5973–83.","ama":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. The convergence of sparsified gradient methods. In: <i>32nd Conference on Neural Information Processing Systems</i>. Neural Information Processing Systems Foundation; 2018:5973-5983.","ista":"Alistarh D-A, Hoefler T, Johansson M, Konstantinov NH, Khirirat S, Renggli C. 2018. The convergence of sparsified gradient methods. 32nd Conference on Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems, Advances in Neural Information Processing Systems, , 5973–5983.","short":"D.-A. Alistarh, T. Hoefler, M. Johansson, N.H. Konstantinov, S. Khirirat, C. Renggli, in:, 32nd Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 5973–5983.","ieee":"D.-A. Alistarh, T. Hoefler, M. Johansson, N. H. Konstantinov, S. Khirirat, and C. Renggli, “The convergence of sparsified gradient methods,” in <i>32nd Conference on Neural Information Processing Systems</i>, Montreal, Canada, 2018, pp. 5973–5983.","apa":"Alistarh, D.-A., Hoefler, T., Johansson, M., Konstantinov, N. H., Khirirat, S., &#38; Renggli, C. (2018). The convergence of sparsified gradient methods. In <i>32nd Conference on Neural Information Processing Systems</i> (pp. 5973–5983). Montreal, Canada: Neural Information Processing Systems Foundation.","chicago":"Alistarh, Dan-Adrian, Torsten Hoefler, Mikael Johansson, Nikola H Konstantinov, Sarit Khirirat, and Cedric Renggli. “The Convergence of Sparsified Gradient Methods.” In <i>32nd Conference on Neural Information Processing Systems</i>, 5973–83. Neural Information Processing Systems Foundation, 2018."},"das_tickbox":"1","publisher":"Neural Information Processing Systems Foundation","page":"5973-5983"},{"project":[{"grant_number":"P28842-B22","name":"Sex chromosome evolution under male- and female- heterogamety","call_identifier":"FWF","_id":"250ED89C-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"quality_controlled":"1","fulldoi":"https://doi.org/10.7554/eLife.35684","department":[{"_id":"BeVi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","related_material":{"record":[{"status":"public","id":"5586","relation":"popular_science"}]},"file":[{"relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:44:43Z","access_level":"open_access","checksum":"d6331d4385b1fffd6b47b45d5949d841","content_type":"application/pdf","date_created":"2018-12-17T11:55:05Z","file_size":3158125,"file_id":"5695","file_name":"2018_eLife_Picard.pdf"}],"date_created":"2018-12-11T11:44:47Z","year":"2018","external_id":{"isi":["000441388200001"]},"author":[{"full_name":"Picard, Marion A","first_name":"Marion A","orcid":"0000-0002-8101-2518","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","last_name":"Picard"},{"full_name":"Cosseau, Celine","first_name":"Celine","last_name":"Cosseau"},{"last_name":"Ferré","first_name":"Sabrina","full_name":"Ferré, Sabrina"},{"full_name":"Quack, Thomas","last_name":"Quack","first_name":"Thomas"},{"first_name":"Christoph","last_name":"Grevelding","full_name":"Grevelding, Christoph"},{"first_name":"Yohann","last_name":"Couté","full_name":"Couté, Yohann"},{"full_name":"Vicoso, Beatriz","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","first_name":"Beatriz"}],"abstract":[{"text":"XY systems usually show chromosome-wide compensation of X-linked genes, while in many ZW systems, compensation is restricted to a minority of dosage-sensitive genes. Why such differences arose is still unclear. Here, we combine comparative genomics, transcriptomics and proteomics to obtain a complete overview of the evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium) and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary strata. We use these to assess gene expression evolution following sex-linkage. The resulting patterns suggest a reduction in expression of Z-linked genes in females, combined with upregulation of the Z in both sexes, in line with the first step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics suggest that post-transcriptional mechanisms do not play a major role in balancing the expression of Z-linked genes. ","lang":"eng"}],"scopus_import":"1","month":"08","date_updated":"2026-07-28T09:45:56Z","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","intvolume":"         7","citation":{"ama":"Picard MAL, Cosseau C, Ferré S, et al. Evolution of gene dosage on the Z-chromosome of schistosome parasites. <i>eLife</i>. 2018;7. doi:<a href=\"https://doi.org/10.7554/eLife.35684\">10.7554/eLife.35684</a>","short":"M.A.L. Picard, C. Cosseau, S. Ferré, T. Quack, C. Grevelding, Y. Couté, B. Vicoso, ELife 7 (2018).","mla":"Picard, Marion A. L., et al. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” <i>ELife</i>, vol. 7, e35684, eLife Sciences Publications, 2018, doi:<a href=\"https://doi.org/10.7554/eLife.35684\">10.7554/eLife.35684</a>.","ista":"Picard MAL, Cosseau C, Ferré S, Quack T, Grevelding C, Couté Y, Vicoso B. 2018. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife. 7, e35684.","apa":"Picard, M. A. L., Cosseau, C., Ferré, S., Quack, T., Grevelding, C., Couté, Y., &#38; Vicoso, B. (2018). Evolution of gene dosage on the Z-chromosome of schistosome parasites. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.35684\">https://doi.org/10.7554/eLife.35684</a>","ieee":"M. A. L. Picard <i>et al.</i>, “Evolution of gene dosage on the Z-chromosome of schistosome parasites,” <i>eLife</i>, vol. 7. eLife Sciences Publications, 2018.","chicago":"Picard, Marion A L, Celine Cosseau, Sabrina Ferré, Thomas Quack, Christoph Grevelding, Yohann Couté, and Beatriz Vicoso. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” <i>ELife</i>. eLife Sciences Publications, 2018. <a href=\"https://doi.org/10.7554/eLife.35684\">https://doi.org/10.7554/eLife.35684</a>."},"das_tickbox":"1","publisher":"eLife Sciences Publications","acknowledgement":"We are grateful to Lu Dabing (Soochow University, Suzhou, China) for providing Schistosoma japonicum samples, to Ariana Macon (IST Austria) and Georgette Stovall (JLU Giessen) for technical assistance, to IT support at IST Austria for providing optimal environment to bioinformatic analyses, and to the Vicoso lab for comments on the manuscript.","doi":"10.7554/eLife.35684","has_accepted_license":"1","_id":"131","day":"13","date_published":"2018-08-13T00:00:00Z","acknowledged_ssus":[{"_id":"CampIT"}],"publist_id":"7792","volume":7,"status":"public","article_processing_charge":"No","ddc":["570"],"oa_version":"Published Version","publication":"eLife","isi":1,"title":"Evolution of gene dosage on the Z-chromosome of schistosome parasites","file_date_updated":"2020-07-14T12:44:43Z","article_number":"e35684","type":"journal_article"},{"title":"Input files and scripts from \"Evolution of gene dosage on the Z-chromosome of schistosome parasites\" by Picard M.A.L., et al (2018)","file_date_updated":"2020-07-14T12:47:08Z","type":"research_data","datarep_id":"109","article_processing_charge":"No","status":"public","oa_version":"Published Version","ddc":["570"],"keyword":["schistosoma","Z-chromosome","gene expression"],"date_published":"2018-07-24T00:00:00Z","_id":"5586","day":"24","doi":"10.15479/AT:ISTA:109","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","citation":{"mla":"Vicoso, Beatriz. <i>Input Files and Scripts from “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites” by Picard M.A.L., et Al (2018)</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:109\">10.15479/AT:ISTA:109</a>.","ama":"Vicoso B. Input files and scripts from “Evolution of gene dosage on the Z-chromosome of schistosome parasites” by Picard M.A.L., et al (2018). 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:109\">10.15479/AT:ISTA:109</a>","ista":"Vicoso B. 2018. Input files and scripts from ‘Evolution of gene dosage on the Z-chromosome of schistosome parasites’ by Picard M.A.L., et al (2018), Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:109\">10.15479/AT:ISTA:109</a>.","short":"B. Vicoso, (2018).","ieee":"B. Vicoso, “Input files and scripts from ‘Evolution of gene dosage on the Z-chromosome of schistosome parasites’ by Picard M.A.L., et al (2018).” Institute of Science and Technology Austria, 2018.","apa":"Vicoso, B. (2018). Input files and scripts from “Evolution of gene dosage on the Z-chromosome of schistosome parasites” by Picard M.A.L., et al (2018). Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:109\">https://doi.org/10.15479/AT:ISTA:109</a>","chicago":"Vicoso, Beatriz. “Input Files and Scripts from ‘Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites’ by Picard M.A.L., et Al (2018).” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:109\">https://doi.org/10.15479/AT:ISTA:109</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","short":"CC0 (1.0)","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2026-07-28T09:45:56Z","oa":1,"abstract":[{"text":"Input files and scripts from \"Evolution of gene dosage on the Z-chromosome of schistosome parasites\" by Picard M.A.L., et al (2018).","lang":"eng"}],"month":"07","author":[{"full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","first_name":"Beatriz"}],"contributor":[{"first_name":"Marion A","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","last_name":"Picard","orcid":"0000-0002-8101-2518"}],"date_created":"2018-12-12T12:31:40Z","year":"2018","file":[{"file_name":"IST-2018-109-v1+1_SupplementaryMethods.zip","file_id":"5601","file_size":11918144,"date_created":"2018-12-12T13:02:35Z","access_level":"open_access","checksum":"e60b484bd6f55c08eb66a189cb72c923","content_type":"application/zip","relation":"main_file","date_updated":"2020-07-14T12:47:08Z","creator":"system"}],"license":"https://creativecommons.org/publicdomain/zero/1.0/","related_material":{"record":[{"status":"public","id":"131","relation":"research_paper"}]},"department":[{"_id":"BeVi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.15479/AT:ISTA:109","project":[{"call_identifier":"FWF","name":"Sex chromosome evolution under male- and female- heterogamety","grant_number":"P28842-B22","_id":"250ED89C-B435-11E9-9278-68D0E5697425"}]},{"volume":839,"status":"public","article_processing_charge":"No","arxiv":1,"oa_version":"Preprint","publication":"Journal of Fluid Mechanics","title":"The critical point of the transition to turbulence in pipe flow","isi":1,"publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.06372"}],"type":"journal_article","acknowledgement":" We  also  thank  Philipp  Maier  and  the  IST  Austria  workshop  for  their dedicated technical support","doi":"10.1017/jfm.2017.923","_id":"5996","day":"25","date_published":"2018-03-25T00:00:00Z","OA_place":"repository","acknowledged_ssus":[{"_id":"M-Shop"}],"publisher":"Cambridge University Press","page":"76-94","corr_author":"1","citation":{"ista":"Vasudevan M, Hof B. 2018. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 839, 76–94.","ama":"Vasudevan M, Hof B. The critical point of the transition to turbulence in pipe flow. <i>Journal of Fluid Mechanics</i>. 2018;839:76-94. doi:<a href=\"https://doi.org/10.1017/jfm.2017.923\">10.1017/jfm.2017.923</a>","mla":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” <i>Journal of Fluid Mechanics</i>, vol. 839, Cambridge University Press, 2018, pp. 76–94, doi:<a href=\"https://doi.org/10.1017/jfm.2017.923\">10.1017/jfm.2017.923</a>.","short":"M. Vasudevan, B. Hof, Journal of Fluid Mechanics 839 (2018) 76–94.","chicago":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2018. <a href=\"https://doi.org/10.1017/jfm.2017.923\">https://doi.org/10.1017/jfm.2017.923</a>.","apa":"Vasudevan, M., &#38; Hof, B. (2018). The critical point of the transition to turbulence in pipe flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2017.923\">https://doi.org/10.1017/jfm.2017.923</a>","ieee":"M. Vasudevan and B. Hof, “The critical point of the transition to turbulence in pipe flow,” <i>Journal of Fluid Mechanics</i>, vol. 839. Cambridge University Press, pp. 76–94, 2018."},"date_updated":"2026-07-28T14:02:09Z","oa":1,"OA_type":"green","publication_status":"published","intvolume":"       839","date_created":"2019-02-14T12:50:50Z","year":"2018","external_id":{"arxiv":["1709.06372"],"isi":["000437858300003"]},"author":[{"full_name":"Vasudevan, Mukund","first_name":"Mukund","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87","last_name":"Vasudevan"},{"last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn","full_name":"Hof, Björn"}],"abstract":[{"text":"In pipes, turbulence sets in despite the linear stability of the laminar Hagen–Poiseuille flow. The Reynolds number ( ) for which turbulence first appears in a given experiment – the ‘natural transition point’ – depends on imperfections of the set-up, or, more precisely, on the magnitude of finite amplitude perturbations. At onset, turbulence typically only occupies a certain fraction of the flow, and this fraction equally is found to differ from experiment to experiment. Despite these findings, Reynolds proposed that after sufficiently long times, flows may settle to steady conditions: below a critical velocity, flows should (regardless of initial conditions) always return to laminar, while above this velocity, eddying motion should persist. As will be shown, even in pipes several thousand diameters long, the spatio-temporal intermittent flow patterns observed at the end of the pipe strongly depend on the initial conditions, and there is no indication that different flow patterns would eventually settle to a (statistical) steady state. Exploiting the fact that turbulent puffs do not age (i.e. they are memoryless), we continuously recreate the puff sequence exiting the pipe at the pipe entrance, and in doing so introduce periodic boundary conditions for the puff pattern. This procedure allows us to study the evolution of the flow patterns for arbitrary long times, and we find that after times in excess of advective time units, indeed a statistical steady state is reached. Although the resulting flows remain spatio-temporally intermittent, puff splitting and decay rates eventually reach a balance, so that the turbulent fraction fluctuates around a well-defined level which only depends on . In accordance with Reynolds’ proposition, we find that at lower (here 2020), flows eventually always resume to laminar, while for higher ( ), turbulence persists. The critical point for pipe flow hence falls in the interval of $2020 , which is in very good agreement with the recently proposed value of . The latter estimate was based on single-puff statistics and entirely neglected puff interactions. Unlike in typical contact processes where such interactions strongly affect the percolation threshold, in pipe flow, the critical point is only marginally influenced. Interactions, on the other hand, are responsible for the approach to the statistical steady state. As shown, they strongly affect the resulting flow patterns, where they cause ‘puff clustering’, and these regions of large puff densities are observed to travel across the puff pattern in a wave-like fashion.","lang":"eng"}],"month":"03","scopus_import":"1","department":[{"_id":"BjHo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","project":[{"call_identifier":"FP7","grant_number":"306589","name":"Decoding the complexity of turbulence at its origin","_id":"25152F3A-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"ec_funded":1,"quality_controlled":"1","fulldoi":"https://doi.org/10.1017/jfm.2017.923"},{"publist_id":"7718","date_published":"2018-05-25T00:00:00Z","OA_place":"publisher","day":"25","_id":"197","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"acknowledgement":"I also gratefully acknowledge the support of NVIDIA Corporation with the donation of the GPUs used for this research.","doi":"10.15479/AT:ISTA:th_1021","type":"dissertation","file_date_updated":"2020-07-14T12:45:22Z","title":"Weakly-supervised segmentation and unsupervised modeling of natural images","publication_identifier":{"issn":["2663-337X"]},"ddc":["004"],"oa_version":"Published Version","status":"public","article_processing_charge":"No","degree_awarded":"PhD","pubrep_id":"1021","supervisor":[{"full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ista":"Kolesnikov A. 2018. Weakly-supervised segmentation and unsupervised modeling of natural images. Institute of Science and Technology Austria.","short":"A. Kolesnikov, Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images, Institute of Science and Technology Austria, 2018.","mla":"Kolesnikov, Alexander. <i>Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1021\">10.15479/AT:ISTA:th_1021</a>.","ama":"Kolesnikov A. Weakly-supervised segmentation and unsupervised modeling of natural images. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_1021\">10.15479/AT:ISTA:th_1021</a>","chicago":"Kolesnikov, Alexander. “Weakly-Supervised Segmentation and Unsupervised Modeling of Natural Images.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1021\">https://doi.org/10.15479/AT:ISTA:th_1021</a>.","apa":"Kolesnikov, A. (2018). <i>Weakly-supervised segmentation and unsupervised modeling of natural images</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_1021\">https://doi.org/10.15479/AT:ISTA:th_1021</a>","ieee":"A. Kolesnikov, “Weakly-supervised segmentation and unsupervised modeling of natural images,” Institute of Science and Technology Austria, 2018."},"corr_author":"1","page":"113","publisher":"Institute of Science and Technology Austria","month":"05","abstract":[{"text":"Modern computer vision systems heavily rely on statistical machine learning models, which typically require large amounts of labeled data to be learned reliably. Moreover, very recently computer vision research widely adopted techniques for representation learning, which further increase the demand for labeled data. However, for many important practical problems there is relatively small amount of labeled data available, so it is problematic to leverage full potential of the representation learning methods. One way to overcome this obstacle is to invest substantial resources into producing large labelled datasets. Unfortunately, this can be prohibitively expensive in practice. In this thesis we focus on the alternative way of tackling the aforementioned issue. We concentrate on methods, which make use of weakly-labeled or even unlabeled data. Specifically, the first half of the thesis is dedicated to the semantic image segmentation task. We develop a technique, which achieves competitive segmentation performance and only requires annotations in a form of global image-level labels instead of dense segmentation masks. Subsequently, we present a new methodology, which further improves segmentation performance by leveraging tiny additional feedback from a human annotator. By using our methods practitioners can greatly reduce the amount of data annotation effort, which is required to learn modern image segmentation models. In the second half of the thesis we focus on methods for learning from unlabeled visual data. We study a family of autoregressive models for modeling structure of natural images and discuss potential applications of these models. Moreover, we conduct in-depth study of one of these applications, where we develop the state-of-the-art model for the probabilistic image colorization task.","lang":"eng"}],"author":[{"first_name":"Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander"}],"date_created":"2018-12-11T11:45:09Z","year":"2018","publication_status":"published","date_updated":"2026-07-29T13:22:05Z","oa":1,"fulldoi":"https://doi.org/10.15479/AT:ISTA:th_1021","doi_confirm":"1","language":[{"iso":"eng"}],"ec_funded":1,"project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"file":[{"access_level":"open_access","checksum":"bc678e02468d8ebc39dc7267dfb0a1c4","content_type":"application/pdf","relation":"main_file","creator":"system","date_updated":"2020-07-14T12:45:22Z","file_id":"5113","file_name":"IST-2018-1021-v1+1_thesis-unsigned-pdfa.pdf","date_created":"2018-12-12T10:14:57Z","file_size":12918758},{"access_level":"closed","content_type":"application/zip","checksum":"bc66973b086da5a043f1162dcfb1fde4","relation":"source_file","creator":"dernst","date_updated":"2020-07-14T12:45:22Z","file_id":"6225","file_name":"2018_Thesis_Kolesnikov_source.zip","date_created":"2019-04-05T09:34:49Z","file_size":55973760}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"ChLa"},{"_id":"GradSch"}]}]
