[{"year":"2017","date_updated":"2023-10-16T11:09:39Z","issue":"4","abstract":[{"lang":"eng","text":"Aim: The present study was to compare the effects of nicotinic acid and nicotinamide on the plasma methyl donors, choline and betaine. Methods: Thirty adult subjects were randomly divided into three groups of equal size, and orally received purified water (C group), nicotinic acid (300 mg, NA group) or nicotinamide (300 mg, NM group). Plasma nicotinamide, N 1-methylnicotinamide, homocysteine, betaine and choline levels before and 1.5-h and 3-h post-dosing, plasma normetanephrine and metanephrine concentrations at 3-h post-dosing, and the urinary excretion of N 1-methyl-2-pyridone-5-carboxamide during the test period were examined. Results: The level of 3-h plasma nicotinamide, N 1-methylnicotinamide, homocysteine, the urinary excretion of N 1-methyl-2-pyridone-5-carboxamide and pulse pressure (PP) in the NM group was 221%, 3972%, 61%, 1728% and 21.2% higher than that of the control group (P &lt; 0.01, except homocysteine and PP P &lt; 0.05), while the 3-h plasma betaine, normetanephrine and metanephrine level in the NM group was 24.4%, 9.4% and 11.7% lower (P &lt; 0.05, except betaine P &lt; 0.01), without significant difference in choline levels. Similar but less pronounced changes were observed in the NA group, with a lower level of 3-h plasma N 1-methylnicotinamide (1.90 ± 0.20 μmol/l vs. 3.62 ± 0.27 μmol/l, P &lt; 0.01) and homocysteine (12.85 ± 1.39 μmol/l vs. 18.08 ± 1.02 μmol/l, P &lt; 0.05) but a higher level of betaine (27.44 ± 0.71 μmol/l vs. 23.52 ± 0.61 μmol/l, P &lt; 0.05) than that of the NM group. Conclusion: The degradation of nicotinamide consumes more betaine than that of nicotinic acid at identical doses. This difference should be taken into consideration in niacin fortification. © 2016 Elsevier Ltd and European Society for Clinical Nutrition and Metabolism."}],"_id":"1146","publication_identifier":{"issn":["0261-5614"]},"status":"public","month":"08","publication_status":"published","doi":"10.1016/j.clnu.2016.07.016","date_published":"2017-08-01T00:00:00Z","oa_version":"None","scopus_import":"1","intvolume":"        36","citation":{"ama":"Sun W, Zhai M-Z, Li D, et al. Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels. <i>Clinical Nutrition</i>. 2017;36(4):1136-1142. doi:<a href=\"https://doi.org/10.1016/j.clnu.2016.07.016\">10.1016/j.clnu.2016.07.016</a>","ieee":"W. Sun <i>et al.</i>, “Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels,” <i>Clinical Nutrition</i>, vol. 36, no. 4. Elsevier, pp. 1136–1142, 2017.","short":"W. Sun, M.-Z. Zhai, D. Li, Y. Zhou, N. Chen, M. Guo, S. Zhou, Clinical Nutrition 36 (2017) 1136–1142.","chicago":"Sun, Wuping, Ming-Zhu Zhai, Da Li, Yiming Zhou, Nana Chen, Ming Guo, and Shisheng Zhou. “Comparison of the Effects of Nicotinic Acid and Nicotinamide Degradation on Plasma Betaine and Choline Levels.” <i>Clinical Nutrition</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.clnu.2016.07.016\">https://doi.org/10.1016/j.clnu.2016.07.016</a>.","apa":"Sun, W., Zhai, M.-Z., Li, D., Zhou, Y., Chen, N., Guo, M., &#38; Zhou, S. (2017). Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels. <i>Clinical Nutrition</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.clnu.2016.07.016\">https://doi.org/10.1016/j.clnu.2016.07.016</a>","ista":"Sun W, Zhai M-Z, Li D, Zhou Y, Chen N, Guo M, Zhou S. 2017. Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels. Clinical Nutrition. 36(4), 1136–1142.","mla":"Sun, Wuping, et al. “Comparison of the Effects of Nicotinic Acid and Nicotinamide Degradation on Plasma Betaine and Choline Levels.” <i>Clinical Nutrition</i>, vol. 36, no. 4, Elsevier, 2017, pp. 1136–42, doi:<a href=\"https://doi.org/10.1016/j.clnu.2016.07.016\">10.1016/j.clnu.2016.07.016</a>."},"day":"01","acknowledgement":"We thank all the participants for their contribution to this study and volunteers from the Nursing School of Dalian University for their supporting to collect blood and urine samples of the participants. We also thank Dr. Yasunori Takayama from National Institute for Physiological Sciences of Japan for his kind help.","author":[{"first_name":"Wuping","last_name":"Sun","full_name":"Sun, Wuping"},{"full_name":"Zhai, Ming-Zhu","id":"34009CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Zhai","first_name":"Ming-Zhu"},{"last_name":"Li","first_name":"Da","full_name":"Li, Da"},{"full_name":"Zhou, Yiming","first_name":"Yiming","last_name":"Zhou"},{"first_name":"Nana","last_name":"Chen","full_name":"Chen, Nana"},{"last_name":"Guo","first_name":"Ming","full_name":"Guo, Ming"},{"full_name":"Zhou, Shisheng","first_name":"Shisheng","last_name":"Zhou"}],"title":"Comparison of the effects of nicotinic acid and nicotinamide degradation on plasma betaine and choline levels","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"1136-1142","date_created":"2018-12-11T11:50:24Z","publication":"Clinical Nutrition","language":[{"iso":"eng"}],"department":[{"_id":"RySh"}],"type":"journal_article","publist_id":"6212","article_processing_charge":"No","volume":36,"quality_controlled":"1"},{"external_id":{"isi":["000393528700009"]},"volume":18,"quality_controlled":"1","publist_id":"6206","article_processing_charge":"No","language":[{"iso":"eng"}],"department":[{"_id":"ChWo"}],"type":"journal_article","date_created":"2018-12-11T11:50:26Z","page":"85 - 94","publication":"Journal of Computational Science","has_accepted_license":"1","title":"A multi objective memetic inverse solver reinforced by local optimization methods","publisher":"Elsevier","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_updated":"2019-01-18T08:43:16Z","file_name":"2016_jocs_ewa.pdf","date_created":"2019-01-18T08:43:16Z","creator":"dernst","file_id":"5842","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":1083911,"success":1}],"isi":1,"author":[{"full_name":"Gajda-Zagorska, Ewa P","id":"47794CF0-F248-11E8-B48F-1D18A9856A87","last_name":"Gajda-Zagorska","first_name":"Ewa P"},{"full_name":"Schaefer, Robert","last_name":"Schaefer","first_name":"Robert"},{"last_name":"Smołka","first_name":"Maciej","full_name":"Smołka, Maciej"},{"full_name":"Pardo, David","last_name":"Pardo","first_name":"David"},{"last_name":"Alvarez Aramberri","first_name":"Julen","full_name":"Alvarez Aramberri, Julen"}],"day":"01","intvolume":"        18","citation":{"chicago":"Gajda-Zagorska, Ewa P, Robert Schaefer, Maciej Smołka, David Pardo, and Julen Alvarez Aramberri. “A Multi Objective Memetic Inverse Solver Reinforced by Local Optimization Methods.” <i>Journal of Computational Science</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.jocs.2016.06.007\">https://doi.org/10.1016/j.jocs.2016.06.007</a>.","mla":"Gajda-Zagorska, Ewa P., et al. “A Multi Objective Memetic Inverse Solver Reinforced by Local Optimization Methods.” <i>Journal of Computational Science</i>, vol. 18, Elsevier, 2017, pp. 85–94, doi:<a href=\"https://doi.org/10.1016/j.jocs.2016.06.007\">10.1016/j.jocs.2016.06.007</a>.","ista":"Gajda-Zagorska EP, Schaefer R, Smołka M, Pardo D, Alvarez Aramberri J. 2017. A multi objective memetic inverse solver reinforced by local optimization methods. Journal of Computational Science. 18, 85–94.","apa":"Gajda-Zagorska, E. P., Schaefer, R., Smołka, M., Pardo, D., &#38; Alvarez Aramberri, J. (2017). A multi objective memetic inverse solver reinforced by local optimization methods. <i>Journal of Computational Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jocs.2016.06.007\">https://doi.org/10.1016/j.jocs.2016.06.007</a>","ieee":"E. P. Gajda-Zagorska, R. Schaefer, M. Smołka, D. Pardo, and J. Alvarez Aramberri, “A multi objective memetic inverse solver reinforced by local optimization methods,” <i>Journal of Computational Science</i>, vol. 18. Elsevier, pp. 85–94, 2017.","ama":"Gajda-Zagorska EP, Schaefer R, Smołka M, Pardo D, Alvarez Aramberri J. A multi objective memetic inverse solver reinforced by local optimization methods. <i>Journal of Computational Science</i>. 2017;18:85-94. doi:<a href=\"https://doi.org/10.1016/j.jocs.2016.06.007\">10.1016/j.jocs.2016.06.007</a>","short":"E.P. Gajda-Zagorska, R. Schaefer, M. Smołka, D. Pardo, J. Alvarez Aramberri, Journal of Computational Science 18 (2017) 85–94."},"ddc":["000"],"file_date_updated":"2019-01-18T08:43:16Z","scopus_import":"1","date_published":"2017-01-01T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","doi":"10.1016/j.jocs.2016.06.007","month":"01","publication_identifier":{"issn":["18777503"]},"oa":1,"status":"public","_id":"1152","year":"2017","date_updated":"2023-09-20T11:29:44Z","abstract":[{"lang":"eng","text":"We propose a new memetic strategy that can solve the multi-physics, complex inverse problems, formulated as the multi-objective optimization ones, in which objectives are misfits between the measured and simulated states of various governing processes. The multi-deme structure of the strategy allows for both, intensive, relatively cheap exploration with a moderate accuracy and more accurate search many regions of Pareto set in parallel. The special type of selection operator prefers the coherent alternative solutions, eliminating artifacts appearing in the particular processes. The additional accuracy increment is obtained by the parallel convex searches applied to the local scalarizations of the misfit vector. The strategy is dedicated for solving ill-conditioned problems, for which inverting the single physical process can lead to the ambiguous results. The skill of the selection in artifact elimination is shown on the benchmark problem, while the whole strategy was applied for identification of oil deposits, where the misfits are related to various frequencies of the magnetic and electric waves of the magnetotelluric measurements. 2016 Elsevier B.V."}]},{"oa_version":"Published Version","date_published":"2017-01-02T00:00:00Z","doi":"10.15479/AT:ISTA:TH_730","publication_status":"published","citation":{"mla":"Daca, Przemyslaw. <i>Statistical and Logical Methods for Property Checking</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_730\">10.15479/AT:ISTA:TH_730</a>.","ista":"Daca P. 2017. Statistical and logical methods for property checking. Institute of Science and Technology Austria.","apa":"Daca, P. (2017). <i>Statistical and logical methods for property checking</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_730\">https://doi.org/10.15479/AT:ISTA:TH_730</a>","chicago":"Daca, Przemyslaw. “Statistical and Logical Methods for Property Checking.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_730\">https://doi.org/10.15479/AT:ISTA:TH_730</a>.","ama":"Daca P. Statistical and logical methods for property checking. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_730\">10.15479/AT:ISTA:TH_730</a>","ieee":"P. Daca, “Statistical and logical methods for property checking,” Institute of Science and Technology Austria, 2017.","short":"P. Daca, Statistical and Logical Methods for Property Checking, Institute of Science and Technology Austria, 2017."},"file_date_updated":"2020-07-14T12:44:34Z","ddc":["004","005"],"_id":"1155","abstract":[{"text":"This dissertation concerns the automatic verification of probabilistic systems and programs with arrays by statistical and logical methods. Although statistical and logical methods are different in nature, we show that they can be successfully combined for system analysis. In the first part of the dissertation we present a new statistical algorithm for the verification of probabilistic systems with respect to unbounded properties, including linear temporal logic. Our algorithm often performs faster than the previous approaches, and at the same time requires less information about the system. In addition, our method can be generalized to unbounded quantitative properties such as mean-payoff bounds. In the second part, we introduce two techniques for comparing probabilistic systems. Probabilistic systems are typically compared using the notion of equivalence, which requires the systems to have the equal probability of all behaviors. However, this notion is often too strict, since probabilities are typically only empirically estimated, and any imprecision may break the relation between processes. On the one hand, we propose to replace the Boolean notion of equivalence by a quantitative distance of similarity. For this purpose, we introduce a statistical framework for estimating distances between Markov chains based on their simulation runs, and we investigate which distances can be approximated in our framework. On the other hand, we propose to compare systems with respect to a new qualitative logic, which expresses that behaviors occur with probability one or a positive probability. This qualitative analysis is robust with respect to modeling errors and applicable to many domains. In the last part, we present a new quantifier-free logic for integer arrays, which allows us to express counting. Counting properties are prevalent in array-manipulating programs, however they cannot be expressed in the quantified fragments of the theory of arrays. We present a decision procedure for our logic, and provide several complexity results.","lang":"eng"}],"date_updated":"2023-09-07T11:58:34Z","year":"2017","month":"01","ec_funded":1,"status":"public","oa":1,"publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","page":"163","date_created":"2018-12-11T11:50:27Z","related_material":{"record":[{"id":"1093","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"1230"},{"status":"public","relation":"part_of_dissertation","id":"1234"},{"id":"1391","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"1501"},{"id":"1502","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"2063"},{"relation":"part_of_dissertation","status":"public","id":"2167"}]},"article_processing_charge":"No","pubrep_id":"730","publist_id":"6203","author":[{"first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw"}],"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":1028586,"checksum":"1406a681cb737508234fde34766be2c2","file_id":"4880","creator":"system","access_level":"open_access","file_name":"IST-2017-730-v1+1_Statistical_and_Logical_Methods_for_Property_Checking.pdf","date_updated":"2020-07-14T12:44:34Z","date_created":"2018-12-12T10:11:26Z"}],"acknowledgement":" First of all, I want to thank my advisor, prof. Thomas A. Henzinger, for his guidance during my PhD program. I am grateful for the freedom I was given to pursue my research interests, and his continuous support. Working with prof. Henzinger was a truly inspiring experience and taught me what it means to be a scientist. I want to express my gratitude to my collaborators: Nikola Beneš, Krishnendu Chatterjee, Martin Chmelík, Ashutosh Gupta, Willibald Krenn, Jan Kˇretínský, Dejan Nickovic, Andrey Kupriyanov, and Tatjana Petrov. I have learned a great deal from my collaborators, and without their help this thesis would not be possible. In addition, I want to thank the members of my thesis committee: Dirk Beyer, Dejan Nickovic, and Georg Weissenbacher for their advice and reviewing this dissertation. I would especially like to acknowledge the late Helmut Veith, who was a member of my committee. I will remember Helmut for his kindness, enthusiasm, and wit, as well as for being an inspiring scientist. Finally, I would like to thank my colleagues for making my stay at IST such a pleasant experience: Guy Avni, Sergiy Bogomolov, Ventsislav Chonev, Rasmus Ibsen-Jensen, Mirco Giacobbe, Bernhard Kragl, Hui Kong, Petr Novotný, Jan Otop, Andreas Pavlogiannis, Tantjana Petrov, Arjun Radhakrishna, Jakob Ruess, Thorsten Tarrach, as well as other members of groups Henzinger and Chatterjee. ","day":"02","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Institute of Science and Technology Austria","title":"Statistical and logical methods for property checking"},{"has_accepted_license":"1","page":"552 - 565","date_created":"2018-12-11T11:50:28Z","publication":"Plant Physiology","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"publist_id":"6199","article_processing_charge":"No","article_type":"original","external_id":{"pmid":["27837086"],"isi":["000394135800041"]},"quality_controlled":"1","volume":173,"pmid":1,"day":"01","project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"isi":1,"author":[{"last_name":"Steenackers","first_name":"Ward","full_name":"Steenackers, Ward"},{"first_name":"Petr","last_name":"Klíma","full_name":"Klíma, Petr"},{"last_name":"Quareshy","first_name":"Mussa","full_name":"Quareshy, Mussa"},{"full_name":"Cesarino, Igor","last_name":"Cesarino","first_name":"Igor"},{"full_name":"Kumpf, Robert","first_name":"Robert","last_name":"Kumpf"},{"full_name":"Corneillie, Sander","first_name":"Sander","last_name":"Corneillie"},{"last_name":"Araújo","first_name":"Pedro","full_name":"Araújo, Pedro"},{"last_name":"Viaene","first_name":"Tom","full_name":"Viaene, Tom"},{"first_name":"Geert","last_name":"Goeminne","full_name":"Goeminne, Geert"},{"full_name":"Nowack, Moritz","first_name":"Moritz","last_name":"Nowack"},{"full_name":"Ljung, Karin","first_name":"Karin","last_name":"Ljung"},{"first_name":"Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"last_name":"Blakeslee","first_name":"Joshua","full_name":"Blakeslee, Joshua"},{"last_name":"Novák","first_name":"Ondřej","full_name":"Novák, Ondřej"},{"last_name":"Zažímalová","first_name":"Eva","full_name":"Zažímalová, Eva"},{"full_name":"Napier, Richard","first_name":"Richard","last_name":"Napier"},{"first_name":"Wout","last_name":"Boerjan","full_name":"Boerjan, Wout"},{"last_name":"Vanholme","first_name":"Bartel","full_name":"Vanholme, Bartel"}],"file":[{"date_created":"2019-11-18T16:12:25Z","file_name":"2016_PlantPhysi_Steenackers.pdf","date_updated":"2020-07-14T12:44:36Z","access_level":"open_access","file_id":"7040","checksum":"fd4d1cfe7ed70e54bb12ae3881f3fb91","creator":"dernst","file_size":4109142,"content_type":"application/pdf","relation":"main_file"}],"publisher":"American Society of Plant Biologists","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation","publication_status":"published","doi":"10.1104/pp.16.00943","oa_version":"Submitted Version","date_published":"2017-01-01T00:00:00Z","scopus_import":"1","file_date_updated":"2020-07-14T12:44:36Z","ddc":["580"],"intvolume":"       173","citation":{"short":"W. Steenackers, P. Klíma, M. Quareshy, I. Cesarino, R. Kumpf, S. Corneillie, P. Araújo, T. Viaene, G. Goeminne, M. Nowack, K. Ljung, J. Friml, J. Blakeslee, O. Novák, E. Zažímalová, R. Napier, W. Boerjan, B. Vanholme, Plant Physiology 173 (2017) 552–565.","ama":"Steenackers W, Klíma P, Quareshy M, et al. Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. <i>Plant Physiology</i>. 2017;173(1):552-565. doi:<a href=\"https://doi.org/10.1104/pp.16.00943\">10.1104/pp.16.00943</a>","ieee":"W. Steenackers <i>et al.</i>, “Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation,” <i>Plant Physiology</i>, vol. 173, no. 1. American Society of Plant Biologists, pp. 552–565, 2017.","chicago":"Steenackers, Ward, Petr Klíma, Mussa Quareshy, Igor Cesarino, Robert Kumpf, Sander Corneillie, Pedro Araújo, et al. “Cis-Cinnamic Acid Is a Novel Natural Auxin Efflux Inhibitor That Promotes Lateral Root Formation.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2017. <a href=\"https://doi.org/10.1104/pp.16.00943\">https://doi.org/10.1104/pp.16.00943</a>.","mla":"Steenackers, Ward, et al. “Cis-Cinnamic Acid Is a Novel Natural Auxin Efflux Inhibitor That Promotes Lateral Root Formation.” <i>Plant Physiology</i>, vol. 173, no. 1, American Society of Plant Biologists, 2017, pp. 552–65, doi:<a href=\"https://doi.org/10.1104/pp.16.00943\">10.1104/pp.16.00943</a>.","ista":"Steenackers W, Klíma P, Quareshy M, Cesarino I, Kumpf R, Corneillie S, Araújo P, Viaene T, Goeminne G, Nowack M, Ljung K, Friml J, Blakeslee J, Novák O, Zažímalová E, Napier R, Boerjan W, Vanholme B. 2017. Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. Plant Physiology. 173(1), 552–565.","apa":"Steenackers, W., Klíma, P., Quareshy, M., Cesarino, I., Kumpf, R., Corneillie, S., … Vanholme, B. (2017). Cis-cinnamic acid is a novel natural auxin efflux inhibitor that promotes lateral root formation. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.16.00943\">https://doi.org/10.1104/pp.16.00943</a>"},"date_updated":"2025-05-07T11:12:30Z","abstract":[{"lang":"eng","text":"Auxin steers numerous physiological processes in plants, making the tight control of its endogenous levels and spatiotemporal distribution a necessity. This regulation is achieved by different mechanisms, including auxin biosynthesis, metabolic conversions, degradation, and transport. Here, we introduce cis-cinnamic acid (c-CA) as a novel and unique addition to a small group of endogenous molecules affecting in planta auxin concentrations. c-CA is the photo-isomerization product of the phenylpropanoid pathway intermediate trans-CA (t-CA). When grown on c-CA-containing medium, an evolutionary diverse set of plant species were shown to exhibit phenotypes characteristic for high auxin levels, including inhibition of primary root growth, induction of root hairs, and promotion of adventitious and lateral rooting. By molecular docking and receptor binding assays, we showed that c-CA itself is neither an auxin nor an anti-auxin, and auxin profiling data revealed that c-CA does not significantly interfere with auxin biosynthesis. Single cell-based auxin accumulation assays showed that c-CA, and not t-CA, is a potent inhibitor of auxin efflux. Auxin signaling reporters detected changes in spatiotemporal distribution of the auxin response along the root of c-CA-treated plants, and long-distance auxin transport assays showed no inhibition of rootward auxin transport. Overall, these results suggest that the phenotypes of c-CA-treated plants are the consequence of a local change in auxin accumulation, induced by the inhibition of auxin efflux. This work reveals a novel mechanism how plants may regulate auxin levels and adds a novel, naturally occurring molecule to the chemical toolbox for the studies of auxin homeostasis."}],"issue":"1","year":"2017","_id":"1159","status":"public","publication_identifier":{"issn":["0032-0889"]},"oa":1,"month":"01","ec_funded":1},{"year":"2017","date_updated":"2023-09-20T11:28:49Z","abstract":[{"text":"We investigate fundamental nonlinear dynamics of ferrofluidic Taylor-Couette flow - flow confined be-tween two concentric independently rotating cylinders - consider small aspect ratio by solving the ferro-hydrodynamical equations, carrying out systematic bifurcation analysis. Without magnetic field, we find steady flow patterns, previously observed with a simple fluid, such as those containing normal one- or two vortex cells, as well as anomalous one-cell and twin-cell flow states. However, when a symmetry-breaking transverse magnetic field is present, all flow states exhibit stimulated, finite two-fold mode. Various bifurcations between steady and unsteady states can occur, corresponding to the transitions between the two-cell and one-cell states. While unsteady, axially oscillating flow states can arise, we also detect the emergence of new unsteady flow states. In particular, we uncover two new states: one contains only the azimuthally oscillating solution in the configuration of the twin-cell flow state, and an-other a rotating flow state. Topologically, these flow states are a limit cycle and a quasiperiodic solution on a two-torus, respectively. Emergence of new flow states in addition to observed ones with classical fluid, indicates that richer but potentially more controllable dynamics in ferrofluidic flows, as such flow states depend on the external magnetic field.","lang":"eng"}],"_id":"1160","article_number":"40012","oa":1,"publication_identifier":{"issn":["20452322"]},"status":"public","month":"01","publication_status":"published","doi":"10.1038/srep40012","date_published":"2017-01-06T00:00:00Z","oa_version":"Published Version","ddc":["532"],"scopus_import":"1","file_date_updated":"2020-07-14T12:44:36Z","citation":{"short":"S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 7 (2017).","ieee":"S. Altmeyer, Y. Do, and Y. Lai, “Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio,” <i>Scientific Reports</i>, vol. 7. Nature Publishing Group, 2017.","ama":"Altmeyer S, Do Y, Lai Y. Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. <i>Scientific Reports</i>. 2017;7. doi:<a href=\"https://doi.org/10.1038/srep40012\">10.1038/srep40012</a>","mla":"Altmeyer, Sebastian, et al. “Dynamics of Ferrofluidic Flow in the Taylor-Couette System with a Small Aspect Ratio.” <i>Scientific Reports</i>, vol. 7, 40012, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/srep40012\">10.1038/srep40012</a>.","ista":"Altmeyer S, Do Y, Lai Y. 2017. Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. Scientific Reports. 7, 40012.","apa":"Altmeyer, S., Do, Y., &#38; Lai, Y. (2017). Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep40012\">https://doi.org/10.1038/srep40012</a>","chicago":"Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Dynamics of Ferrofluidic Flow in the Taylor-Couette System with a Small Aspect Ratio.” <i>Scientific Reports</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/srep40012\">https://doi.org/10.1038/srep40012</a>."},"intvolume":"         7","day":"06","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2020-07-14T12:44:36Z","file_name":"IST-2017-743-v1+1_srep40012.pdf","date_created":"2018-12-12T10:10:16Z","checksum":"694aa70399444570825099c1a7ec91f2","file_id":"4802","creator":"system","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":4546835}],"author":[{"last_name":"Altmeyer","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5964-0203","first_name":"Sebastian","full_name":"Altmeyer, Sebastian"},{"full_name":"Do, Younghae","first_name":"Younghae","last_name":"Do"},{"full_name":"Lai, Ying","first_name":"Ying","last_name":"Lai"}],"isi":1,"title":"Dynamics of ferrofluidic flow in the Taylor-Couette system with a small aspect ratio","publisher":"Nature Publishing Group","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:28Z","publication":"Scientific Reports","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"BjHo"}],"type":"journal_article","publist_id":"6198","article_processing_charge":"No","pubrep_id":"743","external_id":{"isi":["000391269700001"]},"quality_controlled":"1","volume":7},{"year":"2017","date_updated":"2023-09-20T11:28:19Z","abstract":[{"lang":"eng","text":"Coordinated changes of cell shape are often the result of the excitable, wave-like dynamics of the actin cytoskeleton. New work shows that, in migrating cells, protrusion waves arise from mechanochemical crosstalk between adhesion sites, membrane tension and the actin protrusive machinery."}],"issue":"1","_id":"1161","publication_identifier":{"issn":["09609822"]},"status":"public","month":"01","publication_status":"published","doi":"10.1016/j.cub.2016.11.035","date_published":"2017-01-09T00:00:00Z","oa_version":"None","scopus_import":"1","citation":{"short":"J. Müller, M.K. Sixt, Current Biology 27 (2017) R24–R25.","ieee":"J. Müller and M. K. Sixt, “Cell migration: Making the waves,” <i>Current Biology</i>, vol. 27, no. 1. Cell Press, pp. R24–R25, 2017.","ama":"Müller J, Sixt MK. Cell migration: Making the waves. <i>Current Biology</i>. 2017;27(1):R24-R25. doi:<a href=\"https://doi.org/10.1016/j.cub.2016.11.035\">10.1016/j.cub.2016.11.035</a>","chicago":"Müller, Jan, and Michael K Sixt. “Cell Migration: Making the Waves.” <i>Current Biology</i>. Cell Press, 2017. <a href=\"https://doi.org/10.1016/j.cub.2016.11.035\">https://doi.org/10.1016/j.cub.2016.11.035</a>.","apa":"Müller, J., &#38; Sixt, M. K. (2017). Cell migration: Making the waves. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2016.11.035\">https://doi.org/10.1016/j.cub.2016.11.035</a>","ista":"Müller J, Sixt MK. 2017. Cell migration: Making the waves. Current Biology. 27(1), R24–R25.","mla":"Müller, Jan, and Michael K. Sixt. “Cell Migration: Making the Waves.” <i>Current Biology</i>, vol. 27, no. 1, Cell Press, 2017, pp. R24–25, doi:<a href=\"https://doi.org/10.1016/j.cub.2016.11.035\">10.1016/j.cub.2016.11.035</a>."},"intvolume":"        27","day":"09","isi":1,"author":[{"first_name":"Jan","id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","last_name":"Müller","full_name":"Müller, Jan"},{"first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","last_name":"Sixt","full_name":"Sixt, Michael K"}],"title":"Cell migration: Making the waves","publisher":"Cell Press","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:29Z","page":"R24 - R25","publication":"Current Biology","language":[{"iso":"eng"}],"department":[{"_id":"MiSi"}],"type":"journal_article","publist_id":"6197","article_processing_charge":"No","external_id":{"isi":["000391902500010"]},"volume":27,"quality_controlled":"1"},{"intvolume":"        95","citation":{"ama":"Spałek J, Zegrodnik M, Kaczmarczyk J. Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2017;95(2). doi:<a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">10.1103/PhysRevB.95.024506</a>","ieee":"J. Spałek, M. Zegrodnik, and J. Kaczmarczyk, “Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 95, no. 2. American Physical Society, 2017.","short":"J. Spałek, M. Zegrodnik, J. Kaczmarczyk, Physical Review B - Condensed Matter and Materials Physics 95 (2017).","mla":"Spałek, Jozef, et al. “Universal Properties of High Temperature Superconductors from Real Space Pairing T-J-U Model and Its Quantitative Comparison with Experiment.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 95, no. 2, 024506, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">10.1103/PhysRevB.95.024506</a>.","apa":"Spałek, J., Zegrodnik, M., &#38; Kaczmarczyk, J. (2017). Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">https://doi.org/10.1103/PhysRevB.95.024506</a>","ista":"Spałek J, Zegrodnik M, Kaczmarczyk J. 2017. Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment. Physical Review B - Condensed Matter and Materials Physics. 95(2), 024506.","chicago":"Spałek, Jozef, Michał Zegrodnik, and Jan Kaczmarczyk. “Universal Properties of High Temperature Superconductors from Real Space Pairing T-J-U Model and Its Quantitative Comparison with Experiment.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/PhysRevB.95.024506\">https://doi.org/10.1103/PhysRevB.95.024506</a>."},"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1606.03247","open_access":"1"}],"oa_version":"Submitted Version","date_published":"2017-01-13T00:00:00Z","publication_status":"published","doi":"10.1103/PhysRevB.95.024506","month":"01","ec_funded":1,"status":"public","oa":1,"publication_identifier":{"issn":["24699950"]},"article_number":"024506","_id":"1162","date_updated":"2023-09-20T11:25:56Z","abstract":[{"text":"Selected universal experimental properties of high-temperature superconducting (HTS) cuprates have been singled out in the last decade. One of the pivotal challenges in this field is the designation of a consistent interpretation framework within which we can describe quantitatively the universal features of those systems. Here we analyze in a detailed manner the principal experimental data and compare them quantitatively with the approach based on a single-band model of strongly correlated electrons supplemented with strong antiferromagnetic (super)exchange interaction (the so-called t−J−U model). The model rationale is provided by estimating its microscopic parameters on the basis of the three-band approach for the Cu-O plane. We use our original full Gutzwiller wave-function solution by going beyond the renormalized mean-field theory (RMFT) in a systematic manner. Our approach reproduces very well the observed hole doping (δ) dependence of the kinetic-energy gain in the superconducting phase, one of the principal non-Bardeen-Cooper-Schrieffer features of the cuprates. The calculated Fermi velocity in the nodal direction is practically δ-independent and its universal value agrees very well with that determined experimentally. Also, a weak doping dependence of the Fermi wave vector leads to an almost constant value of the effective mass in a pure superconducting phase which is both observed in experiment and reproduced within our approach. An assessment of the currently used models (t−J, Hubbard) is carried out and the results of the canonical RMFT as a zeroth-order solution are provided for comparison to illustrate the necessity of the introduced higher-order contributions.","lang":"eng"}],"issue":"2","year":"2017","external_id":{"isi":["000391852800006"]},"quality_controlled":"1","volume":95,"publist_id":"6195","article_processing_charge":"No","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"MiLe"}],"date_created":"2018-12-11T11:50:29Z","publication":"Physical Review B - Condensed Matter and Materials Physics","publisher":"American Physical Society","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Universal properties of high temperature superconductors from real space pairing t-J-U model and its quantitative comparison with experiment","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"author":[{"full_name":"Spałek, Jozef","first_name":"Jozef","last_name":"Spałek"},{"last_name":"Zegrodnik","first_name":"Michał","full_name":"Zegrodnik, Michał"},{"orcid":"0000-0002-1629-3675","first_name":"Jan","last_name":"Kaczmarczyk","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","full_name":"Kaczmarczyk, Jan"}],"isi":1,"day":"13"},{"scopus_import":"1","intvolume":"        29","citation":{"apa":"Wysokiński, M., &#38; Kaczmarczyk, J. (2017). Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. <i>Journal of Physics: Condensed Matter</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1361-648X/aa532f\">https://doi.org/10.1088/1361-648X/aa532f</a>","ista":"Wysokiński M, Kaczmarczyk J. 2017. Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. Journal of Physics: Condensed Matter. 29(8), 085604.","mla":"Wysokiński, Marcin, and Jan Kaczmarczyk. “Unconventional Superconductivity in Generalized Hubbard Model Role of Electron–Hole Symmetry Breaking Terms.” <i>Journal of Physics: Condensed Matter</i>, vol. 29, no. 8, 085604, IOP Publishing Ltd., 2017, doi:<a href=\"https://doi.org/10.1088/1361-648X/aa532f\">10.1088/1361-648X/aa532f</a>.","chicago":"Wysokiński, Marcin, and Jan Kaczmarczyk. “Unconventional Superconductivity in Generalized Hubbard Model Role of Electron–Hole Symmetry Breaking Terms.” <i>Journal of Physics: Condensed Matter</i>. IOP Publishing Ltd., 2017. <a href=\"https://doi.org/10.1088/1361-648X/aa532f\">https://doi.org/10.1088/1361-648X/aa532f</a>.","short":"M. Wysokiński, J. Kaczmarczyk, Journal of Physics: Condensed Matter 29 (2017).","ama":"Wysokiński M, Kaczmarczyk J. Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms. <i>Journal of Physics: Condensed Matter</i>. 2017;29(8). doi:<a href=\"https://doi.org/10.1088/1361-648X/aa532f\">10.1088/1361-648X/aa532f</a>","ieee":"M. Wysokiński and J. Kaczmarczyk, “Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms,” <i>Journal of Physics: Condensed Matter</i>, vol. 29, no. 8. IOP Publishing Ltd., 2017."},"publication_status":"published","doi":"10.1088/1361-648X/aa532f","date_published":"2017-01-16T00:00:00Z","oa_version":"None","publication_identifier":{"issn":["09538984"]},"status":"public","ec_funded":1,"month":"01","year":"2017","date_updated":"2023-09-20T11:25:32Z","issue":"8","abstract":[{"text":"We investigate the effect of the electron-hole (e-h) symmetry breaking on d-wave superconductivity induced by non-local effects of correlations in the generalized Hubbard model. The symmetry breaking is introduced in a two-fold manner: by the next-to-nearest neighbor hopping of electrons and by the charge-bond interaction - the off-diagonal term of the Coulomb potential. Both terms lead to a pronounced asymmetry of the superconducting order parameter. The next-to-nearest neighbor hopping enhances superconductivity for h-doping, while diminishes it for e-doping. The charge-bond interaction alone leads to the opposite effect and, additionally, to the kinetic-energy gain upon condensation in the underdoped regime. With both terms included, with similar amplitudes, the height of the superconducting dome and the critical doping remain in favor of h-doping. The influence of the charge-bond interaction on deviations from symmetry of the shape of the gap at the Fermi surface in the momentum space is briefly discussed.","lang":"eng"}],"_id":"1163","article_number":"085604","publist_id":"6194","article_processing_charge":"No","external_id":{"isi":["000393955500001"]},"quality_controlled":"1","volume":29,"date_created":"2018-12-11T11:50:29Z","publication":"Journal of Physics: Condensed Matter","language":[{"iso":"eng"}],"department":[{"_id":"MiLe"}],"type":"journal_article","title":"Unconventional superconductivity in generalized Hubbard model role of electron–hole symmetry breaking terms","publisher":"IOP Publishing Ltd.","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"16","project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"isi":1,"author":[{"full_name":"Wysokiński, Marcin","last_name":"Wysokiński","first_name":"Marcin"},{"first_name":"Jan","orcid":"0000-0002-1629-3675","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","last_name":"Kaczmarczyk","full_name":"Kaczmarczyk, Jan"}]},{"date_published":"2017-08-01T00:00:00Z","oa_version":"Submitted Version","doi":"10.1007/s10260-016-0375-6","publication_status":"published","citation":{"ieee":"E. Perrone, A. Rappold, and W. Müller, “D inf s optimality in copula models,” <i>Statistical Methods and Applications</i>, vol. 26, no. 3. Springer, pp. 403–418, 2017.","ama":"Perrone E, Rappold A, Müller W. D inf s optimality in copula models. <i>Statistical Methods and Applications</i>. 2017;26(3):403-418. doi:<a href=\"https://doi.org/10.1007/s10260-016-0375-6\">10.1007/s10260-016-0375-6</a>","short":"E. Perrone, A. Rappold, W. Müller, Statistical Methods and Applications 26 (2017) 403–418.","apa":"Perrone, E., Rappold, A., &#38; Müller, W. (2017). D inf s optimality in copula models. <i>Statistical Methods and Applications</i>. Springer. <a href=\"https://doi.org/10.1007/s10260-016-0375-6\">https://doi.org/10.1007/s10260-016-0375-6</a>","mla":"Perrone, Elisa, et al. “D Inf s Optimality in Copula Models.” <i>Statistical Methods and Applications</i>, vol. 26, no. 3, Springer, 2017, pp. 403–18, doi:<a href=\"https://doi.org/10.1007/s10260-016-0375-6\">10.1007/s10260-016-0375-6</a>.","ista":"Perrone E, Rappold A, Müller W. 2017. D inf s optimality in copula models. Statistical Methods and Applications. 26(3), 403–418.","chicago":"Perrone, Elisa, Andreas Rappold, and Werner Müller. “D Inf s Optimality in Copula Models.” <i>Statistical Methods and Applications</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s10260-016-0375-6\">https://doi.org/10.1007/s10260-016-0375-6</a>."},"intvolume":"        26","ddc":["519"],"file_date_updated":"2020-07-14T12:44:37Z","scopus_import":"1","_id":"1168","year":"2017","abstract":[{"text":"Optimum experimental design theory has recently been extended for parameter estimation in copula models. The use of these models allows one to gain in flexibility by considering the model parameter set split into marginal and dependence parameters. However, this separation also leads to the natural issue of estimating only a subset of all model parameters. In this work, we treat this problem with the application of the (Formula presented.)-optimality to copula models. First, we provide an extension of the corresponding equivalence theory. Then, we analyze a wide range of flexible copula models to highlight the usefulness of (Formula presented.)-optimality in many possible scenarios. Finally, we discuss how the usage of the introduced design criterion also relates to the more general issue of copula selection and optimal design for model discrimination.","lang":"eng"}],"issue":"3","date_updated":"2023-09-20T11:25:09Z","month":"08","oa":1,"status":"public","department":[{"_id":"CaUh"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Statistical Methods and Applications","date_created":"2018-12-11T11:50:31Z","page":"403 - 418","has_accepted_license":"1","volume":26,"quality_controlled":"1","external_id":{"isi":["000407973200004"]},"article_processing_charge":"No","pubrep_id":"739","publist_id":"6189","file":[{"relation":"main_file","content_type":"application/pdf","file_size":56664,"date_updated":"2020-07-14T12:44:37Z","file_name":"IST-2017-739-v1+2_10260_2016_375_MOESM1_ESM.pdf","date_created":"2018-12-12T10:16:13Z","file_id":"5199","checksum":"0b2d1b647ca96e9ef13a14b8b6775e0f","creator":"system","access_level":"open_access"},{"checksum":"3321ef34e02e28acfc427f77cf32812a","file_id":"5200","creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:44:37Z","file_name":"IST-2017-739-v1+3_s10260-016-0375-6.pdf","date_created":"2018-12-12T10:16:14Z","relation":"main_file","content_type":"application/pdf","file_size":688953}],"isi":1,"author":[{"full_name":"Perrone, Elisa","orcid":"0000-0003-0370-9835","first_name":"Elisa","last_name":"Perrone","id":"2A5F8724-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andreas","last_name":"Rappold","full_name":"Rappold, Andreas"},{"first_name":"Werner","last_name":"Müller","full_name":"Müller, Werner"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","acknowledgement":"This work has been supported by the project ANR-2011-IS01-001-01 “DESIRE” and Austrian Science Fund (FWF) I833-N18. Open access funding is provided by the Austrian Science Fund (FWF). ","title":"D inf s optimality in copula models","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer"},{"status":"public","publication_identifier":{"issn":["00166731"]},"oa":1,"month":"01","ec_funded":1,"date_updated":"2025-05-28T11:42:46Z","abstract":[{"lang":"eng","text":"Dispersal is a crucial factor in natural evolution, since it determines the habitat experienced by any population and defines the spatial scale of interactions between individuals. There is compelling evidence for systematic differences in dispersal characteristics within the same population, i.e., genotype-dependent dispersal. The consequences of genotype-dependent dispersal on other evolutionary phenomena, however, are poorly understood. In this article we investigate the effect of genotype-dependent dispersal on spatial gene frequency patterns, using a generalization of the classical diffusion model of selection and dispersal. Dispersal is characterized by the variance of dispersal (diffusion coefficient) and the mean displacement (directional advection term). We demonstrate that genotype-dependent dispersal may change the qualitative behavior of Fisher waves, which change from being “pulled” to being “pushed” wave fronts as the discrepancy in dispersal between genotypes increases. The speed of any wave is partitioned into components due to selection, genotype-dependent variance of dispersal, and genotype-dependent mean displacement. We apply our findings to wave fronts maintained by selection against heterozygotes. Furthermore, we identify a benefit of increased variance of dispersal, quantify its effect on the speed of the wave, and discuss the implications for the evolution of dispersal strategies."}],"issue":"1","year":"2017","_id":"1169","scopus_import":"1","file_date_updated":"2020-07-14T12:44:37Z","ddc":["576"],"intvolume":"       205","citation":{"apa":"Novak, S., &#38; Kollár, R. (2017). Spatial gene frequency waves under genotype dependent dispersal. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.116.193946\">https://doi.org/10.1534/genetics.116.193946</a>","ista":"Novak S, Kollár R. 2017. Spatial gene frequency waves under genotype dependent dispersal. Genetics. 205(1), 367–374.","mla":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” <i>Genetics</i>, vol. 205, no. 1, Genetics Society of America, 2017, pp. 367–74, doi:<a href=\"https://doi.org/10.1534/genetics.116.193946\">10.1534/genetics.116.193946</a>.","chicago":"Novak, Sebastian, and Richard Kollár. “Spatial Gene Frequency Waves under Genotype Dependent Dispersal.” <i>Genetics</i>. Genetics Society of America, 2017. <a href=\"https://doi.org/10.1534/genetics.116.193946\">https://doi.org/10.1534/genetics.116.193946</a>.","ama":"Novak S, Kollár R. Spatial gene frequency waves under genotype dependent dispersal. <i>Genetics</i>. 2017;205(1):367-374. doi:<a href=\"https://doi.org/10.1534/genetics.116.193946\">10.1534/genetics.116.193946</a>","ieee":"S. Novak and R. Kollár, “Spatial gene frequency waves under genotype dependent dispersal,” <i>Genetics</i>, vol. 205, no. 1. Genetics Society of America, pp. 367–374, 2017.","short":"S. Novak, R. Kollár, Genetics 205 (2017) 367–374."},"publication_status":"published","doi":"10.1534/genetics.116.193946","oa_version":"Submitted Version","date_published":"2017-01-01T00:00:00Z","publisher":"Genetics Society of America","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Spatial gene frequency waves under genotype dependent dispersal","day":"01","project":[{"grant_number":"618091","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"isi":1,"author":[{"orcid":"0000-0002-2519-824X","first_name":"Sebastian","last_name":"Novak","id":"461468AE-F248-11E8-B48F-1D18A9856A87","full_name":"Novak, Sebastian"},{"first_name":"Richard","last_name":"Kollár","full_name":"Kollár, Richard"}],"file":[{"access_level":"open_access","file_id":"4833","checksum":"7c8ab79cda1f92760bbbbe0f53175bfc","creator":"system","date_created":"2018-12-12T10:10:43Z","file_name":"IST-2016-727-v1+1_SFC_Genetics_final.pdf","date_updated":"2020-07-14T12:44:37Z","file_size":361500,"content_type":"application/pdf","relation":"main_file"}],"publist_id":"6188","article_processing_charge":"No","pubrep_id":"727","external_id":{"isi":["000393677300025"]},"quality_controlled":"1","volume":205,"has_accepted_license":"1","date_created":"2018-12-11T11:50:31Z","page":"367 - 374","publication":"Genetics","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"NiBa"}]},{"external_id":{"isi":["000418056000005"]},"volume":37,"quality_controlled":"1","publist_id":"6182","article_processing_charge":"No","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"page":"887 - 910","date_created":"2018-12-11T11:50:32Z","publication":"Combinatorica","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"The Voronoi functional is maximized by the Delaunay triangulation in the plane","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems"}],"isi":1,"author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Alexey","last_name":"Glazyrin","full_name":"Glazyrin, Alexey"},{"full_name":"Musin, Oleg","first_name":"Oleg","last_name":"Musin"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","orcid":"0000-0002-0659-3201","first_name":"Anton"}],"acknowledgement":"This research is partially supported by the Russian Government under the Mega Project 11.G34.31.0053, by the Toposys project FP7-ICT-318493-STREP, by ESF under the ACAT Research Network Programme, by RFBR grant 11-01-00735, and by NSF grants DMS-1101688, DMS-1400876.","day":"01","citation":{"ista":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. 2017. The Voronoi functional is maximized by the Delaunay triangulation in the plane. Combinatorica. 37(5), 887–910.","mla":"Edelsbrunner, Herbert, et al. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” <i>Combinatorica</i>, vol. 37, no. 5, Springer, 2017, pp. 887–910, doi:<a href=\"https://doi.org/10.1007/s00493-016-3308-y\">10.1007/s00493-016-3308-y</a>.","apa":"Edelsbrunner, H., Glazyrin, A., Musin, O., &#38; Nikitenko, A. (2017). The Voronoi functional is maximized by the Delaunay triangulation in the plane. <i>Combinatorica</i>. Springer. <a href=\"https://doi.org/10.1007/s00493-016-3308-y\">https://doi.org/10.1007/s00493-016-3308-y</a>","chicago":"Edelsbrunner, Herbert, Alexey Glazyrin, Oleg Musin, and Anton Nikitenko. “The Voronoi Functional Is Maximized by the Delaunay Triangulation in the Plane.” <i>Combinatorica</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00493-016-3308-y\">https://doi.org/10.1007/s00493-016-3308-y</a>.","ama":"Edelsbrunner H, Glazyrin A, Musin O, Nikitenko A. The Voronoi functional is maximized by the Delaunay triangulation in the plane. <i>Combinatorica</i>. 2017;37(5):887-910. doi:<a href=\"https://doi.org/10.1007/s00493-016-3308-y\">10.1007/s00493-016-3308-y</a>","ieee":"H. Edelsbrunner, A. Glazyrin, O. Musin, and A. Nikitenko, “The Voronoi functional is maximized by the Delaunay triangulation in the plane,” <i>Combinatorica</i>, vol. 37, no. 5. Springer, pp. 887–910, 2017.","short":"H. Edelsbrunner, A. Glazyrin, O. Musin, A. Nikitenko, Combinatorica 37 (2017) 887–910."},"intvolume":"        37","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1411.6337"}],"scopus_import":"1","oa_version":"Submitted Version","date_published":"2017-10-01T00:00:00Z","publication_status":"published","doi":"10.1007/s00493-016-3308-y","month":"10","ec_funded":1,"status":"public","publication_identifier":{"issn":["02099683"]},"oa":1,"_id":"1173","date_updated":"2023-09-20T11:23:53Z","abstract":[{"lang":"eng","text":"We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions."}],"issue":"5","year":"2017"},{"citation":{"short":"M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Skórski M. Lower bounds on key derivation for square-friendly applications. In: Vol 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">10.4230/LIPIcs.STACS.2017.57</a>","ieee":"M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66.","chicago":"Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,” Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">https://doi.org/10.4230/LIPIcs.STACS.2017.57</a>.","apa":"Skórski, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">https://doi.org/10.4230/LIPIcs.STACS.2017.57</a>","ista":"Skórski M. 2017. Lower bounds on key derivation for square-friendly applications. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 66, 57.","mla":"Skórski, Maciej. <i>Lower Bounds on Key Derivation for Square-Friendly Applications</i>. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2017.57\">10.4230/LIPIcs.STACS.2017.57</a>."},"intvolume":"        66","main_file_link":[{"url":"http://drops.dagstuhl.de/opus/volltexte/2017/6976","open_access":"1"}],"scopus_import":"1","oa_version":"Submitted Version","date_published":"2017-03-01T00:00:00Z","publication_status":"published","conference":{"location":"Hannover, Germany","end_date":"2017-03-11","name":"STACS: Symposium on Theoretical Aspects of Computer Science","start_date":"2017-03-08"},"doi":"10.4230/LIPIcs.STACS.2017.57","month":"03","ec_funded":1,"status":"public","oa":1,"publication_identifier":{"issn":["18688969"]},"article_number":"57","_id":"1174","date_updated":"2023-09-20T11:23:15Z","abstract":[{"text":"Security of cryptographic applications is typically defined by security games. The adversary, within certain resources, cannot win with probability much better than 0 (for unpredictability applications, like one-way functions) or much better than 1/2 (indistinguishability applications for instance encryption schemes). In so called squared-friendly applications the winning probability of the adversary, for different values of the application secret randomness, is not only close to 0 or 1/2 on average, but also concentrated in the sense that its second central moment is small. The class of squared-friendly applications, which contains all unpredictability applications and many indistinguishability applications, is particularly important for key derivation. Barak et al. observed that for square-friendly applications one can beat the &quot;RT-bound&quot;, extracting secure keys with significantly smaller entropy loss. In turn Dodis and Yu showed that in squared-friendly applications one can directly use a &quot;weak&quot; key, which has only high entropy, as a secure key. In this paper we give sharp lower bounds on square security assuming security for &quot;weak&quot; keys. We show that any application which is either (a) secure with weak keys or (b) allows for entropy savings for keys derived by universal hashing, must be square-friendly. Quantitatively, our lower bounds match the positive results of Dodis and Yu and Barak et al. (TCC\\'13, CRYPTO\\'11) Hence, they can be understood as a general characterization of squared-friendly applications. While the positive results on squared-friendly applications where derived by one clever application of the Cauchy-Schwarz Inequality, for tight lower bounds we need more machinery. In our approach we use convex optimization techniques and some theory of circular matrices.","lang":"eng"}],"year":"2017","external_id":{"isi":["000521077300057"]},"quality_controlled":"1","volume":66,"publist_id":"6180","article_processing_charge":"No","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"date_created":"2018-12-11T11:50:32Z","alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Lower bounds on key derivation for square-friendly applications","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","first_name":"Maciej","full_name":"Skórski, Maciej"}],"isi":1,"day":"01"},{"language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"type":"conference","date_created":"2018-12-11T11:50:33Z","page":"38:1-38-21","has_accepted_license":"1","quality_controlled":"1","volume":67,"editor":[{"first_name":"Christos","last_name":"Papadimitriou","full_name":"Papadimitriou, Christos"}],"publist_id":"6179","pubrep_id":"927","file":[{"file_size":557769,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"dbc94810be07c2fb1945d5c2a6130e6c","file_id":"5263","creator":"system","date_created":"2018-12-12T10:17:11Z","date_updated":"2020-07-14T12:44:37Z","file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf"}],"author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F"},{"full_name":"De Rezende, Susanna","first_name":"Susanna","last_name":"De Rezende"},{"last_name":"Nordstrom","first_name":"Jakob","full_name":"Nordstrom, Jakob"},{"last_name":"Vinyals","first_name":"Marc","full_name":"Vinyals, Marc"}],"day":"01","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"alternative_title":["LIPIcs"],"title":"Cumulative space in black-white pebbling and resolution","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-01-01T00:00:00Z","oa_version":"Published Version","publication_status":"published","conference":{"start_date":"2017-01-09","name":"ITCS: Innovations in Theoretical Computer Science","end_date":"2017-01-11","location":"Berkeley, CA, United States"},"doi":"10.4230/LIPIcs.ITCS.2017.38","intvolume":"        67","citation":{"chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>.","ista":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., &#38; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">https://doi.org/10.4230/LIPIcs.ITCS.2017.38</a>","mla":"Alwen, Joel F., et al. <i>Cumulative Space in Black-White Pebbling and Resolution</i>. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>.","ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2017.38\">10.4230/LIPIcs.ITCS.2017.38</a>","ieee":"J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.","short":"J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21."},"ddc":["005","600"],"scopus_import":1,"file_date_updated":"2020-07-14T12:44:37Z","_id":"1175","year":"2017","date_updated":"2021-01-12T06:48:51Z","abstract":[{"lang":"eng","text":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation.  Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure."}],"month":"01","publication_identifier":{"issn":["18688969"]},"oa":1,"status":"public"},{"day":"03","isi":1,"author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F"},{"first_name":"Jeremiah","last_name":"Blocki","full_name":"Blocki, Jeremiah"}],"title":"Towards practical attacks on Argon2i and balloon hashing","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","date_created":"2018-12-11T11:50:33Z","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference","article_processing_charge":"No","publist_id":"6178","quality_controlled":"1","external_id":{"isi":["000424197300011"]},"year":"2017","abstract":[{"lang":"eng","text":"The algorithm Argon2i-B of Biryukov, Dinu and Khovratovich is currently being considered by the IRTF (Internet Research Task Force) as a new de-facto standard for password hashing. An older version (Argon2i-A) of the same algorithm was chosen as the winner of the recent Password Hashing Competition. An important competitor to Argon2i-B is the recently introduced Balloon Hashing (BH) algorithm of Corrigan-Gibs, Boneh and Schechter. A key security desiderata for any such algorithm is that evaluating it (even using a custom device) requires a large amount of memory amortized across multiple instances. Alwen and Blocki (CRYPTO 2016) introduced a class of theoretical attacks against Argon2i-A and BH. While these attacks yield large asymptotic reductions in the amount of memory, it was not, a priori, clear if (1) they can be extended to the newer Argon2i-B, (2) the attacks are effective on any algorithm for practical parameter ranges (e.g., 1GB of memory) and (3) if they can be effectively instantiated against any algorithm under realistic hardware constrains. In this work we answer all three of these questions in the affirmative for all three algorithms. This is also the first work to analyze the security of Argon2i-B. In more detail, we extend the theoretical attacks of Alwen and Blocki (CRYPTO 2016) to the recent Argon2i-B proposal demonstrating severe asymptotic deficiencies in its security. Next we introduce several novel heuristics for improving the attack's concrete memory efficiency even when on-chip memory bandwidth is bounded. We then simulate our attacks on randomly sampled Argon2i-A, Argon2i-B and BH instances and measure the resulting memory consumption for various practical parameter ranges and for a variety of upperbounds on the amount of parallelism available to the attacker. Finally we describe, implement, and test a new heuristic for applying the Alwen-Blocki attack to functions employing a technique developed by Corrigan-Gibs et al. for improving concrete security of memory-hard functions. We analyze the collected data and show the effects various parameters have on the memory consumption of the attack. In particular, we can draw several interesting conclusions about the level of security provided by these functions. · For the Alwen-Blocki attack to fail against practical memory parameters, Argon2i-B must be instantiated with more than 10 passes on memory - beyond the \"paranoid\" parameter setting in the current IRTF proposal. · The technique of Corrigan-Gibs for improving security can also be overcome by the Alwen-Blocki attack under realistic hardware constraints. · On a positive note, both the asymptotic and concrete security of Argon2i-B seem to improve on that of Argon2i-A."}],"date_updated":"2023-09-20T11:22:25Z","_id":"1176","article_number":"7961977","publication_identifier":{"isbn":["978-150905761-0"]},"oa":1,"status":"public","month":"07","doi":"10.1109/EuroSP.2017.47","conference":{"name":"EuroS&P: European Symposium on Security and Privacy","start_date":"2017-04-26","location":"Paris, France","end_date":"2017-04-28"},"publication_status":"published","date_published":"2017-07-03T00:00:00Z","oa_version":"Submitted Version","scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2016/759","open_access":"1"}],"citation":{"chicago":"Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>.","ista":"Alwen JF, Blocki J. 2017. Towards practical attacks on Argon2i and balloon hashing. EuroS&#38;P: European Symposium on Security and Privacy, 7961977.","mla":"Alwen, Joel F., and Jeremiah Blocki. <i>Towards Practical Attacks on Argon2i and Balloon Hashing</i>. 7961977, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>.","apa":"Alwen, J. F., &#38; Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France: IEEE. <a href=\"https://doi.org/10.1109/EuroSP.2017.47\">https://doi.org/10.1109/EuroSP.2017.47</a>","ieee":"J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&#38;P: European Symposium on Security and Privacy, Paris, France, 2017.","ama":"Alwen JF, Blocki J. Towards practical attacks on Argon2i and balloon hashing. In: IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/EuroSP.2017.47\">10.1109/EuroSP.2017.47</a>","short":"J.F. Alwen, J. Blocki, in:, IEEE, 2017."}},{"title":"The power of choice in priority scheduling","publisher":"ACM","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","isi":1,"author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh"},{"first_name":"Justin","last_name":"Kopinsky","full_name":"Kopinsky, Justin"},{"last_name":"Li","first_name":"Jerry","full_name":"Li, Jerry"},{"full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","id":"3279A00C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5634-0731","first_name":"Giorgi"}],"day":"26","external_id":{"isi":["000462995000035"]},"volume":"Part F129314","quality_controlled":"1","publist_id":"6864","article_processing_charge":"No","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"type":"conference","date_created":"2018-12-11T11:48:31Z","page":"283 - 292","publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","month":"07","publication_identifier":{"isbn":["978-145034992-5"]},"oa":1,"status":"public","_id":"791","year":"2017","date_updated":"2023-09-27T12:17:59Z","abstract":[{"lang":"eng","text":"Consider the following random process: we are given n queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues at random, and remove the element of lower label (higher priority) among the two. The cost of a removal is the rank of the label removed, among labels still present in any of the queues, that is, the distance from the optimal choice at each step. Variants of this strategy are prevalent in state-of-the-art concurrent priority queue implementations. Nonetheless, it is not known whether such implementations provide any rank guarantees, even in a sequential model. We answer this question, showing that this strategy provides surprisingly strong guarantees: Although the single-choice process, where we always insert and remove from a single randomly chosen queue, has degrading cost, going to infinity as we increase the number of steps, in the two choice process, the expected rank of a removed element is O(n) while the expected worst-case cost is O(n log n). These bounds are tight, and hold irrespective of the number of steps for which we run the process. The argument is based on a new technical connection between &quot;heavily loaded&quot; balls-into-bins processes and priority scheduling. Our analytic results inspire a new concurrent priority queue implementation, which improves upon the state of the art in terms of practical performance."}],"citation":{"mla":"Alistarh, Dan-Adrian, et al. “The Power of Choice in Priority Scheduling.” <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, vol. Part F129314, ACM, 2017, pp. 283–92, doi:<a href=\"https://doi.org/10.1145/3087801.3087810\">10.1145/3087801.3087810</a>.","ista":"Alistarh D-A, Kopinsky J, Li J, Nadiradze G. 2017. The power of choice in priority scheduling. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Principles of Distributed Computing vol. Part F129314, 283–292.","apa":"Alistarh, D.-A., Kopinsky, J., Li, J., &#38; Nadiradze, G. (2017). The power of choice in priority scheduling. In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i> (Vol. Part F129314, pp. 283–292). Washington, WA, USA: ACM. <a href=\"https://doi.org/10.1145/3087801.3087810\">https://doi.org/10.1145/3087801.3087810</a>","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Giorgi Nadiradze. “The Power of Choice in Priority Scheduling.” In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Part F129314:283–92. ACM, 2017. <a href=\"https://doi.org/10.1145/3087801.3087810\">https://doi.org/10.1145/3087801.3087810</a>.","short":"D.-A. Alistarh, J. Kopinsky, J. Li, G. Nadiradze, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2017, pp. 283–292.","ieee":"D.-A. Alistarh, J. Kopinsky, J. Li, and G. Nadiradze, “The power of choice in priority scheduling,” in <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Washington, WA, USA, 2017, vol. Part F129314, pp. 283–292.","ama":"Alistarh D-A, Kopinsky J, Li J, Nadiradze G. The power of choice in priority scheduling. In: <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. Vol Part F129314. ACM; 2017:283-292. doi:<a href=\"https://doi.org/10.1145/3087801.3087810\">10.1145/3087801.3087810</a>"},"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1706.04178","open_access":"1"}],"date_published":"2017-07-26T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","conference":{"location":"Washington, WA, USA","end_date":"2017-07-27","name":"PODC: Principles of Distributed Computing","start_date":"2017-07-25"},"doi":"10.1145/3087801.3087810"},{"page":"274 - 301","date_created":"2018-12-11T11:48:32Z","publication":"Journal of Fluid Mechanics","language":[{"iso":"eng"}],"department":[{"_id":"BjHo"}],"type":"journal_article","publist_id":"6862","article_processing_charge":"No","external_id":{"isi":["000414641700001"]},"volume":833,"quality_controlled":"1","day":"25","project":[{"name":"ROOTS Genome-wide Analysis of Root Traits","grant_number":"11-NSF-1070","_id":"25636330-B435-11E9-9278-68D0E5697425"}],"isi":1,"author":[{"orcid":"0000-0003-0423-5010","first_name":"Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","last_name":"Budanur","full_name":"Budanur, Nazmi B"},{"full_name":"Short, Kimberly","last_name":"Short","first_name":"Kimberly"},{"full_name":"Farazmand, Mohammad","first_name":"Mohammad","last_name":"Farazmand"},{"first_name":"Ashley","last_name":"Willis","full_name":"Willis, Ashley"},{"first_name":"Predrag","last_name":"Cvitanović","full_name":"Cvitanović, Predrag"}],"title":"Relative periodic orbits form the backbone of turbulent pipe flow","publisher":"Cambridge University Press","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","doi":"10.1017/jfm.2017.699","date_published":"2017-12-25T00:00:00Z","oa_version":"Submitted Version","main_file_link":[{"url":"https://arxiv.org/abs/1705.03720","open_access":"1"}],"scopus_import":"1","intvolume":"       833","citation":{"short":"N.B. Budanur, K. Short, M. Farazmand, A. Willis, P. Cvitanović, Journal of Fluid Mechanics 833 (2017) 274–301.","ieee":"N. B. Budanur, K. Short, M. Farazmand, A. Willis, and P. Cvitanović, “Relative periodic orbits form the backbone of turbulent pipe flow,” <i>Journal of Fluid Mechanics</i>, vol. 833. Cambridge University Press, pp. 274–301, 2017.","ama":"Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. Relative periodic orbits form the backbone of turbulent pipe flow. <i>Journal of Fluid Mechanics</i>. 2017;833:274-301. doi:<a href=\"https://doi.org/10.1017/jfm.2017.699\">10.1017/jfm.2017.699</a>","ista":"Budanur NB, Short K, Farazmand M, Willis A, Cvitanović P. 2017. Relative periodic orbits form the backbone of turbulent pipe flow. Journal of Fluid Mechanics. 833, 274–301.","apa":"Budanur, N. B., Short, K., Farazmand, M., Willis, A., &#38; Cvitanović, P. (2017). Relative periodic orbits form the backbone of turbulent pipe flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2017.699\">https://doi.org/10.1017/jfm.2017.699</a>","mla":"Budanur, Nazmi B., et al. “Relative Periodic Orbits Form the Backbone of Turbulent Pipe Flow.” <i>Journal of Fluid Mechanics</i>, vol. 833, Cambridge University Press, 2017, pp. 274–301, doi:<a href=\"https://doi.org/10.1017/jfm.2017.699\">10.1017/jfm.2017.699</a>.","chicago":"Budanur, Nazmi B, Kimberly Short, Mohammad Farazmand, Ashley Willis, and Predrag Cvitanović. “Relative Periodic Orbits Form the Backbone of Turbulent Pipe Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2017. <a href=\"https://doi.org/10.1017/jfm.2017.699\">https://doi.org/10.1017/jfm.2017.699</a>."},"year":"2017","date_updated":"2023-09-27T12:17:35Z","abstract":[{"lang":"eng","text":"The chaotic dynamics of low-dimensional systems, such as Lorenz or Rössler flows, is guided by the infinity of periodic orbits embedded in their strange attractors. Whether this is also the case for the infinite-dimensional dynamics of Navier–Stokes equations has long been speculated, and is a topic of ongoing study. Periodic and relative periodic solutions have been shown to be involved in transitions to turbulence. Their relevance to turbulent dynamics – specifically, whether periodic orbits play the same role in high-dimensional nonlinear systems like the Navier–Stokes equations as they do in lower-dimensional systems – is the focus of the present investigation. We perform here a detailed study of pipe flow relative periodic orbits with energies and mean dissipations close to turbulent values. We outline several approaches to reduction of the translational symmetry of the system. We study pipe flow in a minimal computational cell at   Re=2500, and report a library of invariant solutions found with the aid of the method of slices. Detailed study of the unstable manifolds of a sample of these solutions is consistent with the picture that relative periodic orbits are embedded in the chaotic saddle and that they guide the turbulent dynamics."}],"_id":"792","publication_identifier":{"issn":["00221120"]},"oa":1,"status":"public","month":"12"},{"publisher":"Elsevier","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"On the existence of ordinary triangles","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"isi":1,"author":[{"full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek"},{"full_name":"Mojarrad, Hossein","last_name":"Mojarrad","first_name":"Hossein"},{"first_name":"Márton","last_name":"Naszódi","full_name":"Naszódi, Márton"},{"last_name":"Solymosi","first_name":"József","full_name":"Solymosi, József"},{"full_name":"Stich, Sebastian","last_name":"Stich","first_name":"Sebastian"},{"first_name":"May","last_name":"Szedlák","full_name":"Szedlák, May"}],"day":"01","external_id":{"isi":["000412039700003"]},"volume":66,"quality_controlled":"1","publist_id":"6861","article_processing_charge":"No","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"page":"28 - 31","date_created":"2018-12-11T11:48:32Z","publication":"Computational Geometry: Theory and Applications","month":"01","ec_funded":1,"status":"public","oa":1,"publication_identifier":{"issn":["09257721"]},"_id":"793","date_updated":"2023-09-27T12:15:16Z","abstract":[{"text":"Let P be a finite point set in the plane. A cordinary triangle in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P . Motivated by a question of Erdös, and answering a question of de Zeeuw, we prove that there exists a constant c &gt; 0such that P contains a c-ordinary triangle, provided that P is not contained in the union of two lines. Furthermore, the number of c-ordinary triangles in P is Ω(| P |). ","lang":"eng"}],"year":"2017","intvolume":"        66","citation":{"chicago":"Fulek, Radoslav, Hossein Mojarrad, Márton Naszódi, József Solymosi, Sebastian Stich, and May Szedlák. “On the Existence of Ordinary Triangles.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.comgeo.2017.07.002\">https://doi.org/10.1016/j.comgeo.2017.07.002</a>.","ista":"Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. 2017. On the existence of ordinary triangles. Computational Geometry: Theory and Applications. 66, 28–31.","apa":"Fulek, R., Mojarrad, H., Naszódi, M., Solymosi, J., Stich, S., &#38; Szedlák, M. (2017). On the existence of ordinary triangles. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2017.07.002\">https://doi.org/10.1016/j.comgeo.2017.07.002</a>","mla":"Fulek, Radoslav, et al. “On the Existence of Ordinary Triangles.” <i>Computational Geometry: Theory and Applications</i>, vol. 66, Elsevier, 2017, pp. 28–31, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2017.07.002\">10.1016/j.comgeo.2017.07.002</a>.","short":"R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, M. Szedlák, Computational Geometry: Theory and Applications 66 (2017) 28–31.","ama":"Fulek R, Mojarrad H, Naszódi M, Solymosi J, Stich S, Szedlák M. On the existence of ordinary triangles. <i>Computational Geometry: Theory and Applications</i>. 2017;66:28-31. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2017.07.002\">10.1016/j.comgeo.2017.07.002</a>","ieee":"R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, and M. Szedlák, “On the existence of ordinary triangles,” <i>Computational Geometry: Theory and Applications</i>, vol. 66. Elsevier, pp. 28–31, 2017."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1701.08183"}],"oa_version":"Submitted Version","date_published":"2017-01-01T00:00:00Z","publication_status":"published","doi":"10.1016/j.comgeo.2017.07.002"},{"language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"type":"journal_article","date_created":"2018-12-11T11:48:32Z","page":"1 - 13","publication":"Computational Geometry: Theory and Applications","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1165"}]},"external_id":{"isi":["000412039700001"]},"quality_controlled":"1","volume":66,"publist_id":"6860","article_processing_charge":"No","isi":1,"author":[{"orcid":"0000-0001-8485-1774","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","full_name":"Fulek, Radoslav"}],"day":"01","acknowledgement":"I would like to thank Jan Kynčl, Dömötör Pálvölgyi and anonymous referees for many comments and suggestions that helped to improve the presentation of the result.","title":"C-planarity of embedded cyclic c-graphs","publisher":"Elsevier","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2017-12-01T00:00:00Z","oa_version":"Preprint","publication_status":"published","doi":"10.1016/j.comgeo.2017.06.016","citation":{"chicago":"Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.” <i>Computational Geometry: Theory and Applications</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.comgeo.2017.06.016\">https://doi.org/10.1016/j.comgeo.2017.06.016</a>.","apa":"Fulek, R. (2017). C-planarity of embedded cyclic c-graphs. <i>Computational Geometry: Theory and Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2017.06.016\">https://doi.org/10.1016/j.comgeo.2017.06.016</a>","ista":"Fulek R. 2017. C-planarity of embedded cyclic c-graphs. Computational Geometry: Theory and Applications. 66, 1–13.","mla":"Fulek, Radoslav. “C-Planarity of Embedded Cyclic c-Graphs.” <i>Computational Geometry: Theory and Applications</i>, vol. 66, Elsevier, 2017, pp. 1–13, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2017.06.016\">10.1016/j.comgeo.2017.06.016</a>.","short":"R. Fulek, Computational Geometry: Theory and Applications 66 (2017) 1–13.","ieee":"R. Fulek, “C-planarity of embedded cyclic c-graphs,” <i>Computational Geometry: Theory and Applications</i>, vol. 66. Elsevier, pp. 1–13, 2017.","ama":"Fulek R. C-planarity of embedded cyclic c-graphs. <i>Computational Geometry: Theory and Applications</i>. 2017;66:1-13. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2017.06.016\">10.1016/j.comgeo.2017.06.016</a>"},"intvolume":"        66","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.01346"}],"scopus_import":"1","_id":"794","year":"2017","date_updated":"2023-09-27T12:14:49Z","abstract":[{"lang":"eng","text":"We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows. Given a graph G with the vertex set partitioned into three parts embedded on a 2-sphere, our algorithm decides if we can augment G by adding edges without creating an edge-crossing so that in the resulting spherical graph the vertices of each part induce a connected sub-graph. We proceed by a reduction to the problem of testing the existence of a perfect matching in planar bipartite graphs. We formulate our result in a slightly more general setting of cyclic clustered graphs, i.e., the simple graph obtained by contracting each cluster, where we disregard loops and multi-edges, is a cycle."}],"month":"12","oa":1,"status":"public"},{"title":"Unified Hanani Tutte theorem","publisher":"International Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"28","file":[{"relation":"main_file","content_type":"application/pdf","file_size":236944,"file_id":"5853","creator":"dernst","checksum":"ef320cff0f062051e858f929be6a3581","access_level":"open_access","date_updated":"2020-07-14T12:48:06Z","file_name":"2017_ElectrCombi_Fulek.pdf","date_created":"2019-01-18T14:04:08Z"}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Fulek, Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav"},{"full_name":"Kynčl, Jan","first_name":"Jan","last_name":"Kynčl"},{"first_name":"Dömötör","last_name":"Pálvölgyi","full_name":"Pálvölgyi, Dömötör"}],"publist_id":"6859","article_processing_charge":"No","article_type":"original","quality_controlled":"1","volume":24,"date_created":"2018-12-11T11:48:32Z","publication":"Electronic Journal of Combinatorics","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"UlWa"}],"type":"journal_article","publication_identifier":{"issn":["10778926"]},"oa":1,"status":"public","ec_funded":1,"month":"07","year":"2017","date_updated":"2022-03-18T12:58:53Z","issue":"3","abstract":[{"lang":"eng","text":"We introduce a common generalization of the strong Hanani–Tutte theorem and the weak Hanani–Tutte theorem: if a graph G has a drawing D in the plane where every pair of independent edges crosses an even number of times, then G has a planar drawing preserving the rotation of each vertex whose incident edges cross each other evenly in D. The theorem is implicit in the proof of the strong Hanani–Tutte theorem by Pelsmajer, Schaefer and Štefankovič. We give a new, somewhat simpler proof."}],"_id":"795","article_number":"P3.18","ddc":["000"],"file_date_updated":"2020-07-14T12:48:06Z","scopus_import":"1","intvolume":"        24","citation":{"short":"R. Fulek, J. Kynčl, D. Pálvölgyi, Electronic Journal of Combinatorics 24 (2017).","ieee":"R. Fulek, J. Kynčl, and D. Pálvölgyi, “Unified Hanani Tutte theorem,” <i>Electronic Journal of Combinatorics</i>, vol. 24, no. 3. International Press, 2017.","ama":"Fulek R, Kynčl J, Pálvölgyi D. Unified Hanani Tutte theorem. <i>Electronic Journal of Combinatorics</i>. 2017;24(3). doi:<a href=\"https://doi.org/10.37236/6663\">10.37236/6663</a>","chicago":"Fulek, Radoslav, Jan Kynčl, and Dömötör Pálvölgyi. “Unified Hanani Tutte Theorem.” <i>Electronic Journal of Combinatorics</i>. International Press, 2017. <a href=\"https://doi.org/10.37236/6663\">https://doi.org/10.37236/6663</a>.","mla":"Fulek, Radoslav, et al. “Unified Hanani Tutte Theorem.” <i>Electronic Journal of Combinatorics</i>, vol. 24, no. 3, P3.18, International Press, 2017, doi:<a href=\"https://doi.org/10.37236/6663\">10.37236/6663</a>.","ista":"Fulek R, Kynčl J, Pálvölgyi D. 2017. Unified Hanani Tutte theorem. Electronic Journal of Combinatorics. 24(3), P3.18.","apa":"Fulek, R., Kynčl, J., &#38; Pálvölgyi, D. (2017). Unified Hanani Tutte theorem. <i>Electronic Journal of Combinatorics</i>. International Press. <a href=\"https://doi.org/10.37236/6663\">https://doi.org/10.37236/6663</a>"},"publication_status":"published","doi":"10.37236/6663","date_published":"2017-07-28T00:00:00Z","oa_version":"Published Version"},{"volume":111,"quality_controlled":"1","external_id":{"isi":["000406779700031"]},"article_processing_charge":"No","publist_id":"6857","department":[{"_id":"JoFi"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Applied Physics Letters","date_created":"2018-12-11T11:48:33Z","title":"Al transmon qubits on silicon on insulator for quantum device integration","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"American Institute of Physics","author":[{"full_name":"Keller, Andrew J","first_name":"Andrew J","last_name":"Keller"},{"last_name":"Dieterle","first_name":"Paul","full_name":"Dieterle, Paul"},{"last_name":"Fang","first_name":"Michael","full_name":"Fang, Michael"},{"first_name":"Brett","last_name":"Berger","full_name":"Berger, Brett"},{"full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","first_name":"Johannes M","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Oskar","last_name":"Painter","full_name":"Painter, Oskar"}],"isi":1,"day":"01","acknowledgement":"This work was supported by the AFOSR MURI Quantum Photonic Matter (Grant No. 16RT0696), the AFOSR MURI Wiring Quantum Networks with Mechanical Transducers (Grant No. FA9550-15-1-0015), the Institute for Quantum Information and Matter, an NSF Physics Frontiers Center (Grant No. PHY-1125565) with the support of the Gordon and Betty Moore Foundation, and the Kavli Nanoscience Institute at Caltech. A.J.K. acknowledges the IQIM Postdoctoral Fellowship.","citation":{"chicago":"Keller, Andrew J, Paul Dieterle, Michael Fang, Brett Berger, Johannes M Fink, and Oskar Painter. “Al Transmon Qubits on Silicon on Insulator for Quantum Device Integration.” <i>Applied Physics Letters</i>. American Institute of Physics, 2017. <a href=\"https://doi.org/10.1063/1.4994661\">https://doi.org/10.1063/1.4994661</a>.","ista":"Keller AJ, Dieterle P, Fang M, Berger B, Fink JM, Painter O. 2017. Al transmon qubits on silicon on insulator for quantum device integration. Applied Physics Letters. 111(4), 042603.","apa":"Keller, A. J., Dieterle, P., Fang, M., Berger, B., Fink, J. M., &#38; Painter, O. (2017). Al transmon qubits on silicon on insulator for quantum device integration. <i>Applied Physics Letters</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4994661\">https://doi.org/10.1063/1.4994661</a>","mla":"Keller, Andrew J., et al. “Al Transmon Qubits on Silicon on Insulator for Quantum Device Integration.” <i>Applied Physics Letters</i>, vol. 111, no. 4, 042603, American Institute of Physics, 2017, doi:<a href=\"https://doi.org/10.1063/1.4994661\">10.1063/1.4994661</a>.","ama":"Keller AJ, Dieterle P, Fang M, Berger B, Fink JM, Painter O. Al transmon qubits on silicon on insulator for quantum device integration. <i>Applied Physics Letters</i>. 2017;111(4). doi:<a href=\"https://doi.org/10.1063/1.4994661\">10.1063/1.4994661</a>","ieee":"A. J. Keller, P. Dieterle, M. Fang, B. Berger, J. M. Fink, and O. Painter, “Al transmon qubits on silicon on insulator for quantum device integration,” <i>Applied Physics Letters</i>, vol. 111, no. 4. American Institute of Physics, 2017.","short":"A.J. Keller, P. Dieterle, M. Fang, B. Berger, J.M. Fink, O. Painter, Applied Physics Letters 111 (2017)."},"intvolume":"       111","main_file_link":[{"url":"https://arxiv.org/abs/1703.10195","open_access":"1"}],"scopus_import":"1","date_published":"2017-07-01T00:00:00Z","oa_version":"Submitted Version","doi":"10.1063/1.4994661","publication_status":"published","month":"07","publication_identifier":{"issn":["00036951"]},"oa":1,"status":"public","_id":"796","article_number":"042603","year":"2017","abstract":[{"text":"We present the fabrication and characterization of an aluminum transmon qubit on a silicon-on-insulator substrate. Key to the qubit fabrication is the use of an anhydrous hydrofluoric vapor process which selectively removes the lossy silicon oxide buried underneath the silicon device layer. For a 5.6 GHz qubit measured dispersively by a 7.1 GHz resonator, we find T1 = 3.5 μs and T∗2 = 2.2 μs. This process in principle permits the co-fabrication of silicon photonic and mechanical elements, providing a route towards chip-scale integration of electro-opto-mechanical transducers for quantum networking of superconducting microwave quantum circuits. The additional processing steps are compatible with established fabrication techniques for aluminum transmon qubits on silicon.","lang":"eng"}],"issue":"4","date_updated":"2023-09-27T12:13:36Z"}]