[{"abstract":[{"lang":"eng","text":"With the accelerated development of robot technologies, optimal control becomes one of the central themes of research. In traditional approaches, the controller, by its internal functionality, finds appropriate actions on the basis of the history of sensor values, guided by the goals, intentions, objectives, learning schemes, and so forth. While very successful with classical robots, these methods run into severe difficulties when applied to soft robots, a new field of robotics with large interest for human-robot interaction. We claim that a novel controller paradigm opens new perspective for this field. This paper applies a recently developed neuro controller with differential extrinsic synaptic plasticity to a muscle-tendon driven arm-shoulder system from the Myorobotics toolkit. In the experiments, we observe a vast variety of self-organized behavior patterns: when left alone, the arm realizes pseudo-random sequences of different poses. By applying physical forces, the system can be entrained into definite motion patterns like wiping a table. Most interestingly, after attaching an object, the controller gets in a functional resonance with the object's internal dynamics, starting to shake spontaneously bottles half-filled with water or sensitively driving an attached pendulum into a circular mode. When attached to the crank of a wheel the neural system independently develops to rotate it. In this way, the robot discovers affordances of objects its body is interacting with."}],"publication_status":"published","quality_controlled":"1","author":[{"first_name":"Georg S","last_name":"Martius","full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Raphael","last_name":"Hostettler","full_name":"Hostettler, Raphael"},{"full_name":"Knoll, Alois","last_name":"Knoll","first_name":"Alois"},{"full_name":"Der, Ralf","last_name":"Der","first_name":"Ralf"}],"doi":"10.1109/IROS.2016.7759138","scopus_import":1,"day":"28","publisher":"IEEE","oa_version":"None","title":"Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm","date_updated":"2021-01-12T06:49:08Z","volume":"2016-November","_id":"1214","type":"conference","date_created":"2018-12-11T11:50:45Z","language":[{"iso":"eng"}],"status":"public","citation":{"ama":"Martius GS, Hostettler R, Knoll A, Der R. Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm. In: Vol 2016-November. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/IROS.2016.7759138\">10.1109/IROS.2016.7759138</a>","short":"G.S. Martius, R. Hostettler, A. Knoll, R. Der, in:, IEEE, 2016.","ieee":"G. S. Martius, R. Hostettler, A. Knoll, and R. Der, “Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm,” presented at the IEEE RSJ International Conference on Intelligent Robots and Systems IROS , Daejeon, Korea, 2016, vol. 2016–November.","chicago":"Martius, Georg S, Raphael Hostettler, Alois Knoll, and Ralf Der. “Compliant Control for Soft Robots: Emergent Behavior of a Tendon Driven Anthropomorphic Arm,” Vol. 2016–November. IEEE, 2016. <a href=\"https://doi.org/10.1109/IROS.2016.7759138\">https://doi.org/10.1109/IROS.2016.7759138</a>.","ista":"Martius GS, Hostettler R, Knoll A, Der R. 2016. Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm. IEEE RSJ International Conference on Intelligent Robots and Systems IROS  vol. 2016–November, 7759138.","mla":"Martius, Georg S., et al. <i>Compliant Control for Soft Robots: Emergent Behavior of a Tendon Driven Anthropomorphic Arm</i>. Vol. 2016–November, 7759138, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/IROS.2016.7759138\">10.1109/IROS.2016.7759138</a>.","apa":"Martius, G. S., Hostettler, R., Knoll, A., &#38; Der, R. (2016). Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm (Vol. 2016–November). Presented at the IEEE RSJ International Conference on Intelligent Robots and Systems IROS , Daejeon, Korea: IEEE. <a href=\"https://doi.org/10.1109/IROS.2016.7759138\">https://doi.org/10.1109/IROS.2016.7759138</a>"},"date_published":"2016-11-28T00:00:00Z","acknowledgement":"RD thanks for the hospitality at the Max-Planck-Institute and for helpful discussions with Nihat Ay and Keyan Zahedi.","conference":{"location":"Daejeon, Korea","end_date":"2016-09-14","start_date":"2016-09-09","name":"IEEE RSJ International Conference on Intelligent Robots and Systems IROS "},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2016","month":"11","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"publist_id":"6121","article_number":"7759138"},{"department":[{"_id":"HeEd"}],"publist_id":"6118","year":"2016","month":"01","issue":"1","citation":{"apa":"Kasten, J., Reininghaus, J., Hotz, I., Hege, H., Noack, B., Daviller, G., &#38; Morzyński, M. (2016). Acceleration feature points of unsteady shear flows. <i>Archives of Mechanics</i>. Polish Academy of Sciences Publishing House.","mla":"Kasten, Jens, et al. “Acceleration Feature Points of Unsteady Shear Flows.” <i>Archives of Mechanics</i>, vol. 68, no. 1, Polish Academy of Sciences Publishing House, 2016, pp. 55–80.","ista":"Kasten J, Reininghaus J, Hotz I, Hege H, Noack B, Daviller G, Morzyński M. 2016. Acceleration feature points of unsteady shear flows. Archives of Mechanics. 68(1), 55–80.","chicago":"Kasten, Jens, Jan Reininghaus, Ingrid Hotz, Hans Hege, Bernd Noack, Guillaume Daviller, and Marek Morzyński. “Acceleration Feature Points of Unsteady Shear Flows.” <i>Archives of Mechanics</i>. Polish Academy of Sciences Publishing House, 2016.","ieee":"J. Kasten <i>et al.</i>, “Acceleration feature points of unsteady shear flows,” <i>Archives of Mechanics</i>, vol. 68, no. 1. Polish Academy of Sciences Publishing House, pp. 55–80, 2016.","short":"J. Kasten, J. Reininghaus, I. Hotz, H. Hege, B. Noack, G. Daviller, M. Morzyński, Archives of Mechanics 68 (2016) 55–80.","ama":"Kasten J, Reininghaus J, Hotz I, et al. Acceleration feature points of unsteady shear flows. <i>Archives of Mechanics</i>. 2016;68(1):55-80."},"acknowledgement":"The authors acknowledge funding of the German Re-\r\nsearch  Foundation  (DFG)  via  the  Collaborative  Re-\r\nsearch  Center  (SFB  557)  \\Control  of  Complex  Turbu-\r\nlent  Shear  Flows\"  and  the  Emmy  Noether  Program.\r\nFurther  funding  was  provided  by  the  Zuse  Institute\r\nBerlin  (ZIB),  the  DFG-CNRS  research  group  \\Noise\r\nGeneration in Turbulent Flows\" (2003{2010), the Chaire\r\nd'Excellence 'Closed-loop control of turbulent shear  ows\r\nusing reduced-order models' (TUCOROM) of the French\r\nAgence Nationale de la Recherche (ANR), and the Eu-\r\nropean  Social  Fund  (ESF  App.   No.   100098251).   We\r\nthank  the  Ambrosys  Ltd.  Society  for  Complex  Sys-\r\ntems  Management  and  the  Bernd  R.  Noack  Cybernet-\r\nics  Foundation  for  additional  support.   A  part  of  this\r\nwork was performed using HPC resources from GENCI-[CCRT/CINES/IDRIS]  supported  by  the  Grant  2011-\r\n[x2011020912","date_published":"2016-01-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"publication":"Archives of Mechanics","status":"public","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:49:09Z","_id":"1216","volume":68,"type":"journal_article","date_created":"2018-12-11T11:50:46Z","author":[{"full_name":"Kasten, Jens","last_name":"Kasten","first_name":"Jens"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan","last_name":"Reininghaus","first_name":"Jan"},{"last_name":"Hotz","full_name":"Hotz, Ingrid","first_name":"Ingrid"},{"full_name":"Hege, Hans","last_name":"Hege","first_name":"Hans"},{"first_name":"Bernd","full_name":"Noack, Bernd","last_name":"Noack"},{"first_name":"Guillaume","full_name":"Daviller, Guillaume","last_name":"Daviller"},{"first_name":"Marek","full_name":"Morzyński, Marek","last_name":"Morzyński"}],"scopus_import":1,"day":"01","oa_version":"Published Version","publisher":"Polish Academy of Sciences Publishing House","title":"Acceleration feature points of unsteady shear flows","main_file_link":[{"url":"http://am.ippt.pan.pl/am/article/viewFile/v68p55/pdf","open_access":"1"}],"quality_controlled":"1","publication_status":"published","page":"55 - 80","abstract":[{"text":"A framework fo r extracting features in 2D transient flows, based on the acceleration field to ensure Galilean invariance is proposed in this paper. The minima of the acceleration magnitude (a superset of acceleration zeros) are extracted and discriminated into vortices and saddle points, based on the spectral properties of the velocity Jacobian. The extraction of topological features is performed with purely combinatorial algorithms from discrete computational topology. The feature points are prioritized with persistence, as a physically meaningful importance measure. These feature points are tracked in time with a robust algorithm for tracking features. Thus, a space-time hierarchy of the minima is built and vortex merging events are detected. We apply the acceleration feature extraction strategy to three two-dimensional shear flows: (1) an incompressible periodic cylinder wake, (2) an incompressible planar mixing layer and (3) a weakly compressible planar jet. The vortex-like acceleration feature points are shown to be well aligned with acceleration zeros, maxima of the vorticity magnitude, minima of the pressure field and minima of λ2.","lang":"eng"}],"intvolume":"        68"},{"page":"39 - 51","abstract":[{"lang":"eng","text":"Understanding the regulation of T-cell responses during inflammation and auto-immunity is fundamental for designing efficient therapeutic strategies against immune diseases. In this regard, prostaglandin E 2 (PGE 2) is mostly considered a myeloid-derived immunosuppressive molecule. We describe for the first time that T cells secrete PGE 2 during T-cell receptor stimulation. In addition, we show that autocrine PGE 2 signaling through EP receptors is essential for optimal CD4 + T-cell activation in vitro and in vivo, and for T helper 1 (Th1) and regulatory T cell differentiation. PGE 2 was found to provide additive co-stimulatory signaling through AKT activation. Intravital multiphoton microscopy showed that triggering EP receptors in T cells is also essential for the stability of T cell-dendritic cell (DC) interactions and Th-cell accumulation in draining lymph nodes (LNs) during inflammation. We further demonstrated that blocking EP receptors in T cells during the initial phase of collagen-induced arthritis in mice resulted in a reduction of clinical arthritis. This could be attributable to defective T-cell activation, accompanied by a decline in activated and interferon-γ-producing CD4 + Th1 cells in draining LNs. In conclusion, we prove that T lymphocytes secret picomolar concentrations of PGE 2, which in turn provide additive co-stimulatory signaling, enabling T cells to attain a favorable activation threshold. PGE 2 signaling in T cells is also required for maintaining long and stable interactions with DCs within LNs. Blockade of EP receptors in vivo impairs T-cell activation and development of T cell-mediated inflammatory responses. This may have implications in various pathophysiological settings."}],"intvolume":"        94","publication_status":"published","quality_controlled":"1","day":"01","scopus_import":1,"doi":"10.1038/icb.2015.62","author":[{"full_name":"Sreeramkumar, Vinatha","last_name":"Sreeramkumar","first_name":"Vinatha"},{"last_name":"Hons","full_name":"Hons, Miroslav","id":"4167FE56-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6625-3348","first_name":"Miroslav"},{"full_name":"Punzón, Carmen","last_name":"Punzón","first_name":"Carmen"},{"first_name":"Jens","last_name":"Stein","full_name":"Stein, Jens"},{"first_name":"David","full_name":"Sancho, David","last_name":"Sancho"},{"first_name":"Manuel","last_name":"Fresno Forcelledo","full_name":"Fresno Forcelledo, Manuel"},{"last_name":"Cuesta","full_name":"Cuesta, Natalia","first_name":"Natalia"}],"title":"Efficient T-cell priming and activation requires signaling through prostaglandin E2 (EP) receptors","oa_version":"None","publisher":"Nature Publishing Group","_id":"1217","volume":94,"date_updated":"2021-01-12T06:49:09Z","date_created":"2018-12-11T11:50:46Z","type":"journal_article","publication":"Immunology and Cell Biology","language":[{"iso":"eng"}],"status":"public","citation":{"ama":"Sreeramkumar V, Hons M, Punzón C, et al. Efficient T-cell priming and activation requires signaling through prostaglandin E2 (EP) receptors. <i>Immunology and Cell Biology</i>. 2016;94(1):39-51. doi:<a href=\"https://doi.org/10.1038/icb.2015.62\">10.1038/icb.2015.62</a>","ieee":"V. Sreeramkumar <i>et al.</i>, “Efficient T-cell priming and activation requires signaling through prostaglandin E2 (EP) receptors,” <i>Immunology and Cell Biology</i>, vol. 94, no. 1. Nature Publishing Group, pp. 39–51, 2016.","short":"V. Sreeramkumar, M. Hons, C. Punzón, J. Stein, D. Sancho, M. Fresno Forcelledo, N. Cuesta, Immunology and Cell Biology 94 (2016) 39–51.","chicago":"Sreeramkumar, Vinatha, Miroslav Hons, Carmen Punzón, Jens Stein, David Sancho, Manuel Fresno Forcelledo, and Natalia Cuesta. “Efficient T-Cell Priming and Activation Requires Signaling through Prostaglandin E2 (EP) Receptors.” <i>Immunology and Cell Biology</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/icb.2015.62\">https://doi.org/10.1038/icb.2015.62</a>.","ista":"Sreeramkumar V, Hons M, Punzón C, Stein J, Sancho D, Fresno Forcelledo M, Cuesta N. 2016. Efficient T-cell priming and activation requires signaling through prostaglandin E2 (EP) receptors. Immunology and Cell Biology. 94(1), 39–51.","apa":"Sreeramkumar, V., Hons, M., Punzón, C., Stein, J., Sancho, D., Fresno Forcelledo, M., &#38; Cuesta, N. (2016). Efficient T-cell priming and activation requires signaling through prostaglandin E2 (EP) receptors. <i>Immunology and Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/icb.2015.62\">https://doi.org/10.1038/icb.2015.62</a>","mla":"Sreeramkumar, Vinatha, et al. “Efficient T-Cell Priming and Activation Requires Signaling through Prostaglandin E2 (EP) Receptors.” <i>Immunology and Cell Biology</i>, vol. 94, no. 1, Nature Publishing Group, 2016, pp. 39–51, doi:<a href=\"https://doi.org/10.1038/icb.2015.62\">10.1038/icb.2015.62</a>."},"issue":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2016-01-01T00:00:00Z","acknowledgement":"This manuscript has been supported by grants SAF2007-61716 and S-SAL-0159/2006 awarded by the Spanish Ministry of Science and Education and the Community of Madrid to Dr M Fresno.","year":"2016","month":"01","department":[{"_id":"MiSi"}],"publist_id":"6116"},{"month":"07","department":[{"_id":"ToBo"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Angermayr, P. Van Alphen, D. Hasdemir, G. Kramer, M. Iqbal, W. Van Grondelle, H. Hoefsloot, Y. Choi, K. Hellingwerf, Applied and Environmental Microbiology 82 (2016) 4180–4189.","ieee":"A. Angermayr <i>et al.</i>, “Culturing synechocystis sp. Strain pcc 6803 with N2 and CO2 in a diel regime reveals multiphase glycogen dynamics with low maintenance costs,” <i>Applied and Environmental Microbiology</i>, vol. 82, no. 14. American Society for Microbiology, pp. 4180–4189, 2016.","ama":"Angermayr A, Van Alphen P, Hasdemir D, et al. Culturing synechocystis sp. Strain pcc 6803 with N2 and CO2 in a diel regime reveals multiphase glycogen dynamics with low maintenance costs. <i>Applied and Environmental Microbiology</i>. 2016;82(14):4180-4189. doi:<a href=\"https://doi.org/10.1128/AEM.00256-16\">10.1128/AEM.00256-16</a>","mla":"Angermayr, Andreas, et al. “Culturing Synechocystis Sp. Strain Pcc 6803 with N2 and CO2 in a Diel Regime Reveals Multiphase Glycogen Dynamics with Low Maintenance Costs.” <i>Applied and Environmental Microbiology</i>, vol. 82, no. 14, American Society for Microbiology, 2016, pp. 4180–89, doi:<a href=\"https://doi.org/10.1128/AEM.00256-16\">10.1128/AEM.00256-16</a>.","apa":"Angermayr, A., Van Alphen, P., Hasdemir, D., Kramer, G., Iqbal, M., Van Grondelle, W., … Hellingwerf, K. (2016). Culturing synechocystis sp. Strain pcc 6803 with N2 and CO2 in a diel regime reveals multiphase glycogen dynamics with low maintenance costs. <i>Applied and Environmental Microbiology</i>. American Society for Microbiology. <a href=\"https://doi.org/10.1128/AEM.00256-16\">https://doi.org/10.1128/AEM.00256-16</a>","chicago":"Angermayr, Andreas, Pascal Van Alphen, Dicle Hasdemir, Gertjan Kramer, Muzamal Iqbal, Wilmar Van Grondelle, Huub Hoefsloot, Younghae Choi, and Klaas Hellingwerf. “Culturing Synechocystis Sp. Strain Pcc 6803 with N2 and CO2 in a Diel Regime Reveals Multiphase Glycogen Dynamics with Low Maintenance Costs.” <i>Applied and Environmental Microbiology</i>. American Society for Microbiology, 2016. <a href=\"https://doi.org/10.1128/AEM.00256-16\">https://doi.org/10.1128/AEM.00256-16</a>.","ista":"Angermayr A, Van Alphen P, Hasdemir D, Kramer G, Iqbal M, Van Grondelle W, Hoefsloot H, Choi Y, Hellingwerf K. 2016. Culturing synechocystis sp. Strain pcc 6803 with N2 and CO2 in a diel regime reveals multiphase glycogen dynamics with low maintenance costs. Applied and Environmental Microbiology. 82(14), 4180–4189."},"issue":"14","oa_version":"Submitted Version","title":"Culturing synechocystis sp. Strain pcc 6803 with N2 and CO2 in a diel regime reveals multiphase glycogen dynamics with low maintenance costs","scopus_import":1,"day":"01","author":[{"orcid":"0000-0001-8619-2223","first_name":"Andreas","full_name":"Angermayr, Andreas","id":"4677C796-F248-11E8-B48F-1D18A9856A87","last_name":"Angermayr"},{"first_name":"Pascal","full_name":"Van Alphen, Pascal","last_name":"Van Alphen"},{"full_name":"Hasdemir, Dicle","last_name":"Hasdemir","first_name":"Dicle"},{"last_name":"Kramer","full_name":"Kramer, Gertjan","first_name":"Gertjan"},{"first_name":"Muzamal","full_name":"Iqbal, Muzamal","last_name":"Iqbal"},{"full_name":"Van Grondelle, Wilmar","last_name":"Van Grondelle","first_name":"Wilmar"},{"first_name":"Huub","full_name":"Hoefsloot, Huub","last_name":"Hoefsloot"},{"first_name":"Younghae","full_name":"Choi, Younghae","last_name":"Choi"},{"last_name":"Hellingwerf","full_name":"Hellingwerf, Klaas","first_name":"Klaas"}],"date_created":"2018-12-11T11:50:46Z","volume":82,"abstract":[{"text":"Investigating the physiology of cyanobacteria cultured under a diel light regime is relevant for a better understanding of the resulting growth characteristics and for specific biotechnological applications that are foreseen for these photosynthetic organisms. Here, we present the results of a multiomics study of the model cyanobacterium Synechocystis sp. strain PCC 6803, cultured in a lab-scale photobioreactor in physiological conditions relevant for large-scale culturing. The culture was sparged withN2 andCO2, leading to an anoxic environment during the dark period. Growth followed the availability of light. Metabolite analysis performed with 1Hnuclear magnetic resonance analysis showed that amino acids involved in nitrogen and sulfur assimilation showed elevated levels in the light. Most protein levels, analyzed through mass spectrometry, remained rather stable. However, several high-light-response proteins and stress-response proteins showed distinct changes at the onset of the light period. Microarray-based transcript analysis found common patterns of~56% of the transcriptome following the diel regime. These oscillating transcripts could be grouped coarsely into genes that were upregulated and downregulated in the dark period. The accumulated glycogen was degraded in the anaerobic environment in the dark. A small part was degraded gradually, reflecting basic maintenance requirements of the cells in darkness. Surprisingly, the largest part was degraded rapidly in a short time span at the end of the dark period. This degradation could allow rapid formation of metabolic intermediates at the end of the dark period, preparing the cells for the resumption of growth at the start of the light period.","lang":"eng"}],"intvolume":"        82","publication_status":"published","year":"2016","publist_id":"6117","publication":"Applied and Environmental Microbiology","status":"public","date_published":"2016-07-01T00:00:00Z","acknowledgement":"Dutch Ministry of Economic Affairs, Agriculture, and Innovation through the program BioSolar CellsS. Andreas Angermayr,Pascal van Alphen, Klaas J. Hellingwerf\r\nWe thank Naira Quintana (presently at Rousselot, Belgium) for the ini-\r\ntiative  at  the  10th  Cyanobacterial  Molecular  Biology  Workshop\r\n(CMBW), June 2010, Lake Arrowhead, Los Angeles, CA, USA, to start the\r\ncollaborative endeavor reported here. We thank Timo Maarleveld from\r\nCWI/VU (Amsterdam) for a custom-made Python script handling the output from the NMR analysis and for evaluating and visualizing the\r\nseparate metabolites for their evaluation. We thank Rob Verpoorte from\r\nLeiden University (metabolome analysis) and Hans Aerts from the AMC\r\n(proteome analysis) for lab space and equipment. We thank Robert Leh-\r\nmann (Humboldt University Berlin) and Ilka Axmann (University of\r\nDüsseldorf) for sharing the R-code for the LOS transformation of the\r\ntranscript data. We thank Hans C. P. Matthijs from IBED for inspiring\r\ndialogues and insightful thoughts on continuous culturing of cyanobac-\r\nteria. We thank Sandra Waaijenborg for performing the transcript nor-\r\nmalization and Johan Westerhuis from BDA, Jeroen van der Steen and\r\nFilipe Branco dos Santos from MMP, and Lucas Stal from IBED/NIOZ for\r\nhelpful discussions. We thank Milou Schuurmans from MMP for help\r\nwith sampling and glycogen determination. We thank the members of the\r\nRNA Biology & Applied Bioinformatics group at SILS, in particular Selina\r\nvan Leeuwen, Elisa Hoekstra, and Martijs Jonker, for the microarray anal-\r\nysis. We thank the reviewers of this work for their insightful comments\r\nwhich improved the quality of the manuscript. This work, including the efforts of S. Andreas Angermayr, Pascal van\r\nAlphen, and Klaas J. Hellingwerf, was funded by Dutch Ministry of Eco-\r\nnomic Affairs, Agriculture, and Innovation through the program BioSolar\r\nCells.","publisher":"American Society for Microbiology","doi":"10.1128/AEM.00256-16","type":"journal_article","_id":"1218","date_updated":"2021-01-12T06:49:10Z","page":"4180 - 4189","quality_controlled":"1","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4959195/","open_access":"1"}]},{"year":"2016","publist_id":"6115","publication":"Annals of Probability","status":"public","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7"}],"ec_funded":1,"date_published":"2016-01-01T00:00:00Z","acknowledgement":"J.C. was supported in part by National Research Foundation of Korea Grant 2011-0013474 and TJ Park Junior Faculty Fellowship.\r\nK.S. was supported by ERC Advanced Grant RANMAT, No. 338804, and the \"Fund for Math.\"\r\nB.S. was supported by NSF GRFP Fellowship DGE-1144152.\r\nH.Y. was supported in part by NSF Grant DMS-13-07444 and Simons investigator fellowship. We thank Paul Bourgade, László Erd ̋os and Antti Knowles for helpful comments. We are grateful to the Taida Institute for Mathematical\r\nSciences and National Taiwan Universality for their hospitality during part of this\r\nresearch. We thank Thomas Spencer and the Institute for Advanced Study for their\r\nhospitality during the academic year 2013–2014.  ","doi":"10.1214/15-AOP1023","publisher":"Institute of Mathematical Statistics","_id":"1219","date_updated":"2021-01-12T06:49:10Z","type":"journal_article","page":"2349 - 2425","main_file_link":[{"url":"https://arxiv.org/abs/1405.6634","open_access":"1"}],"quality_controlled":"1","month":"01","department":[{"_id":"LaEr"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"mla":"Lee, Jioon, et al. “Bulk Universality for Deformed Wigner Matrices.” <i>Annals of Probability</i>, vol. 44, no. 3, Institute of Mathematical Statistics, 2016, pp. 2349–425, doi:<a href=\"https://doi.org/10.1214/15-AOP1023\">10.1214/15-AOP1023</a>.","apa":"Lee, J., Schnelli, K., Stetler, B., &#38; Yau, H. (2016). Bulk universality for deformed wigner matrices. <i>Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/15-AOP1023\">https://doi.org/10.1214/15-AOP1023</a>","ista":"Lee J, Schnelli K, Stetler B, Yau H. 2016. Bulk universality for deformed wigner matrices. Annals of Probability. 44(3), 2349–2425.","chicago":"Lee, Jioon, Kevin Schnelli, Ben Stetler, and Horngtzer Yau. “Bulk Universality for Deformed Wigner Matrices.” <i>Annals of Probability</i>. Institute of Mathematical Statistics, 2016. <a href=\"https://doi.org/10.1214/15-AOP1023\">https://doi.org/10.1214/15-AOP1023</a>.","short":"J. Lee, K. Schnelli, B. Stetler, H. Yau, Annals of Probability 44 (2016) 2349–2425.","ieee":"J. Lee, K. Schnelli, B. Stetler, and H. Yau, “Bulk universality for deformed wigner matrices,” <i>Annals of Probability</i>, vol. 44, no. 3. Institute of Mathematical Statistics, pp. 2349–2425, 2016.","ama":"Lee J, Schnelli K, Stetler B, Yau H. Bulk universality for deformed wigner matrices. <i>Annals of Probability</i>. 2016;44(3):2349-2425. doi:<a href=\"https://doi.org/10.1214/15-AOP1023\">10.1214/15-AOP1023</a>"},"issue":"3","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"author":[{"first_name":"Jioon","last_name":"Lee","full_name":"Lee, Jioon"},{"first_name":"Kevin","orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","last_name":"Schnelli"},{"full_name":"Stetler, Ben","last_name":"Stetler","first_name":"Ben"},{"first_name":"Horngtzer","full_name":"Yau, Horngtzer","last_name":"Yau"}],"oa_version":"Preprint","title":"Bulk universality for deformed wigner matrices","volume":44,"date_created":"2018-12-11T11:50:47Z","abstract":[{"lang":"eng","text":"We consider N×N random matrices of the form H = W + V where W is a real symmetric or complex Hermitian Wigner matrix and V is a random or deterministic, real, diagonal matrix whose entries are independent of W. We assume subexponential decay for the matrix entries of W, and we choose V so that the eigenvalues ofW and V are typically of the same order. For a large class of diagonal matrices V , we show that the local statistics in the bulk of the spectrum are universal in the limit of large N."}],"intvolume":"        44","publication_status":"published"},{"oa_version":"Preprint","title":"Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency","publisher":"AIAA","author":[{"first_name":"Gregor","full_name":"Mikić, Gregor","last_name":"Mikić"},{"first_name":"Alex","full_name":"Stoll, Alex","last_name":"Stoll"},{"last_name":"Bevirt","full_name":"Bevirt, Joe","first_name":"Joe"},{"id":"483E70DE-F248-11E8-B48F-1D18A9856A87","full_name":"Grah, Rok","last_name":"Grah","first_name":"Rok","orcid":"0000-0003-2539-3560"},{"first_name":"Mark","last_name":"Moore","full_name":"Moore, Mark"}],"doi":"10.2514/6.2016-3764","scopus_import":1,"day":"01","type":"conference","date_created":"2018-12-11T11:50:47Z","date_updated":"2023-02-21T10:17:50Z","_id":"1220","abstract":[{"lang":"eng","text":"Theoretical and numerical aspects of aerodynamic efficiency of propulsion systems coupled to the boundary layer of a fuselage are studied. We discuss the effects of local flow fields, which are affected both by conservative flow acceleration as well as total pressure losses, on the efficiency of boundary layer immersed propulsion devices. We introduce the concept of a boundary layer retardation turbine that helps reduce skin friction over the fuselage. We numerically investigate efficiency gains offered by boundary layer and wake interacting devices. We discuss the results in terms of a total energy consumption framework and show that efficiency gains of any device depend on all the other elements of the propulsion system."}],"page":"1 - 19","publication_status":"published","quality_controlled":"1","main_file_link":[{"url":"https://ntrs.nasa.gov/search.jsp?R=20160010167&amp;hterms=Fuselage+boundary+layer+ingestion+propulsion+applied+thin+haul+commuter+aircraft+optimal+efficiency&amp;qs=N%3D0%26Ntk%3DAll%26Ntt%3DFuselage%2520boundary%2520layer%2520ingestion%2520propulsion%2520applied%2520to%2520a%2520thin%2520haul%2520commuter%2520aircraft%2520for%2520optimal%2520efficiency%26Ntx%3Dmode%2520matchallpartial%26Nm%3D123%7CCollection%7CNASA%2520STI%7C%7C17%7CCollection%7CNACA","open_access":"1"}],"month":"06","year":"2016","publist_id":"6114","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"language":[{"iso":"eng"}],"status":"public","oa":1,"conference":{"start_date":"2016-06-13","end_date":"2016-06-17","name":"AIAA: Aviation Technology, Integration, and Operations Conference","location":"Washington, D.C., USA"},"date_published":"2016-06-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Mikić G, Stoll A, Bevirt J, Grah R, Moore M. Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency. In: AIAA; 2016:1-19. doi:<a href=\"https://doi.org/10.2514/6.2016-3764\">10.2514/6.2016-3764</a>","short":"G. Mikić, A. Stoll, J. Bevirt, R. Grah, M. Moore, in:, AIAA, 2016, pp. 1–19.","ieee":"G. Mikić, A. Stoll, J. Bevirt, R. Grah, and M. Moore, “Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency,” presented at the AIAA: Aviation Technology, Integration, and Operations Conference, Washington, D.C., USA, 2016, pp. 1–19.","chicago":"Mikić, Gregor, Alex Stoll, Joe Bevirt, Rok Grah, and Mark Moore. “Fuselage Boundary Layer Ingestion Propulsion Applied to a Thin Haul Commuter Aircraft for Optimal Efficiency,” 1–19. AIAA, 2016. <a href=\"https://doi.org/10.2514/6.2016-3764\">https://doi.org/10.2514/6.2016-3764</a>.","ista":"Mikić G, Stoll A, Bevirt J, Grah R, Moore M. 2016. Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency. AIAA: Aviation Technology, Integration, and Operations Conference, 1–19.","mla":"Mikić, Gregor, et al. <i>Fuselage Boundary Layer Ingestion Propulsion Applied to a Thin Haul Commuter Aircraft for Optimal Efficiency</i>. AIAA, 2016, pp. 1–19, doi:<a href=\"https://doi.org/10.2514/6.2016-3764\">10.2514/6.2016-3764</a>.","apa":"Mikić, G., Stoll, A., Bevirt, J., Grah, R., &#38; Moore, M. (2016). Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency (pp. 1–19). Presented at the AIAA: Aviation Technology, Integration, and Operations Conference, Washington, D.C., USA: AIAA. <a href=\"https://doi.org/10.2514/6.2016-3764\">https://doi.org/10.2514/6.2016-3764</a>"}},{"ddc":["581"],"quality_controlled":"1","doi":"10.12688/f1000research.7654.1","article_processing_charge":"No","publisher":"F1000 Research","date_updated":"2025-05-07T11:12:30Z","_id":"1221","type":"journal_article","project":[{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"status":"public","publication":"F1000 Research ","ec_funded":1,"acknowledgement":"This work was supported by ERC Independent Research grant (ERC-2011-StG-20101109-PSDP to JF). JM internship was supported by the grant “Action Austria – Slovakia”. MG was supported by the scholarship \"Stipendien der Stipendienstiftung der Republik Österreich\". Work by EH and CPR were supported by ANR blanc ANR-14-CE11-0018. We would like to thank Mark Estelle and Yunde Zhao for provid\r\n-\r\ning \r\nabp1-c1\r\n, \r\nabp1-TD1 \r\nand \r\nabp1-WTc1 \r\nseeds. We thank Emeline \r\nHuault for technical assistance.","date_published":"2016-01-20T00:00:00Z","year":"2016","publist_id":"6113","has_accepted_license":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"abstract":[{"text":"The Auxin Binding Protein 1 (ABP1) is one of the most studied proteins in plants. Since decades ago, it has been the prime receptor candidate for the plant hormone auxin with a plethora of described functions in auxin signaling and development. The developmental importance of ABP1 has recently been questioned by identification of Arabidopsis thaliana abp1 knock-out alleles that show no obvious phenotypes under normal growth conditions. In this study, we examined the contradiction between the normal growth and development of the abp1 knock-outs and the strong morphological defects observed in three different ethanol-inducible abp1 knock-down mutants ( abp1-AS, SS12K, SS12S). By analyzing segregating populations of abp1 knock-out vs. abp1 knock-down crosses we show that the strong morphological defects that were believed to be the result of conditional down-regulation of ABP1 can be reproduced also in the absence of the functional ABP1 protein. This data suggests that the phenotypes in abp1 knock-down lines are due to the off-target effects and asks for further reflections on the biological function of ABP1 or alternative explanations for the missing phenotypic defects in the abp1 loss-of-function alleles.","lang":"eng"}],"intvolume":"         5","publication_status":"published","file_date_updated":"2020-07-14T12:44:39Z","author":[{"first_name":"Jaroslav","last_name":"Michalko","id":"483727CA-F248-11E8-B48F-1D18A9856A87","full_name":"Michalko, Jaroslav"},{"id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","full_name":"Glanc, Matous","last_name":"Glanc","orcid":"0000-0003-0619-7783","first_name":"Matous"},{"last_name":"Perrot Rechenmann","full_name":"Perrot Rechenmann, Catherine","first_name":"Catherine"},{"last_name":"Friml","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí"}],"day":"20","scopus_import":"1","title":"Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein","oa_version":"Published Version","volume":5,"article_type":"original","date_created":"2018-12-11T11:50:47Z","oa":1,"pubrep_id":"711","language":[{"iso":"eng"}],"citation":{"apa":"Michalko, J., Glanc, M., Perrot Rechenmann, C., &#38; Friml, J. (2016). Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein. <i>F1000 Research </i>. F1000 Research. <a href=\"https://doi.org/10.12688/f1000research.7654.1\">https://doi.org/10.12688/f1000research.7654.1</a>","mla":"Michalko, Jaroslav, et al. “Strong Morphological Defects in Conditional Arabidopsis Abp1 Knock-down Mutants Generated in Absence of Functional ABP1 Protein.” <i>F1000 Research </i>, vol. 5, 86, F1000 Research, 2016, doi:<a href=\"https://doi.org/10.12688/f1000research.7654.1\">10.12688/f1000research.7654.1</a>.","ista":"Michalko J, Glanc M, Perrot Rechenmann C, Friml J. 2016. Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein. F1000 Research . 5, 86.","chicago":"Michalko, Jaroslav, Matous Glanc, Catherine Perrot Rechenmann, and Jiří Friml. “Strong Morphological Defects in Conditional Arabidopsis Abp1 Knock-down Mutants Generated in Absence of Functional ABP1 Protein.” <i>F1000 Research </i>. F1000 Research, 2016. <a href=\"https://doi.org/10.12688/f1000research.7654.1\">https://doi.org/10.12688/f1000research.7654.1</a>.","ieee":"J. Michalko, M. Glanc, C. Perrot Rechenmann, and J. Friml, “Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein,” <i>F1000 Research </i>, vol. 5. F1000 Research, 2016.","short":"J. Michalko, M. Glanc, C. Perrot Rechenmann, J. Friml, F1000 Research  5 (2016).","ama":"Michalko J, Glanc M, Perrot Rechenmann C, Friml J. Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein. <i>F1000 Research </i>. 2016;5. doi:<a href=\"https://doi.org/10.12688/f1000research.7654.1\">10.12688/f1000research.7654.1</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","department":[{"_id":"JiFr"}],"file":[{"relation":"main_file","checksum":"c9e50bb6096a7ba4a832969935820f19","file_name":"IST-2016-711-v1+1_770cf1e0-612f-4e85-a500-54b6349fbbab_7654_-_jaroslav_michalko.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"5154","file_size":2990459,"date_created":"2018-12-12T10:15:33Z","date_updated":"2020-07-14T12:44:39Z","creator":"system"}],"article_number":"86"},{"oa_version":"Preprint","title":"Optimal packings of congruent circles on a square flat torus","day":"01","scopus_import":1,"author":[{"full_name":"Musin, Oleg","last_name":"Musin","first_name":"Oleg"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","full_name":"Nikitenko, Anton","last_name":"Nikitenko","first_name":"Anton"}],"date_created":"2018-12-11T11:50:48Z","volume":55,"intvolume":"        55","abstract":[{"text":"We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason—the problem of “super resolution of images.” We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly, for the case N=7 there are three different optimal arrangements. Our proof is based on a computer enumeration of toroidal irreducible contact graphs.","lang":"eng"}],"publication_status":"published","month":"01","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Musin O, Nikitenko A. 2016. Optimal packings of congruent circles on a square flat torus. Discrete &#38; Computational Geometry. 55(1), 1–20.","chicago":"Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles on a Square Flat Torus.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00454-015-9742-6\">https://doi.org/10.1007/s00454-015-9742-6</a>.","mla":"Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles on a Square Flat Torus.” <i>Discrete &#38; Computational Geometry</i>, vol. 55, no. 1, Springer, 2016, pp. 1–20, doi:<a href=\"https://doi.org/10.1007/s00454-015-9742-6\">10.1007/s00454-015-9742-6</a>.","apa":"Musin, O., &#38; Nikitenko, A. (2016). Optimal packings of congruent circles on a square flat torus. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9742-6\">https://doi.org/10.1007/s00454-015-9742-6</a>","ama":"Musin O, Nikitenko A. Optimal packings of congruent circles on a square flat torus. <i>Discrete &#38; Computational Geometry</i>. 2016;55(1):1-20. doi:<a href=\"https://doi.org/10.1007/s00454-015-9742-6\">10.1007/s00454-015-9742-6</a>","short":"O. Musin, A. Nikitenko, Discrete &#38; Computational Geometry 55 (2016) 1–20.","ieee":"O. Musin and A. Nikitenko, “Optimal packings of congruent circles on a square flat torus,” <i>Discrete &#38; Computational Geometry</i>, vol. 55, no. 1. Springer, pp. 1–20, 2016."},"issue":"1","publisher":"Springer","doi":"10.1007/s00454-015-9742-6","type":"journal_article","_id":"1222","date_updated":"2021-01-12T06:49:11Z","page":"1 - 20","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1212.0649"}],"year":"2016","publist_id":"6111","status":"public","publication":"Discrete & Computational Geometry","date_published":"2016-01-01T00:00:00Z","acknowledgement":"We wish to thank Alexey Tarasov, Vladislav Volkov and Brittany Fasy for some useful comments and remarks, and especially Thom Sulanke for modifying surftri to suit our purposes. Oleg R. Musin was partially supported by the NSF Grant DMS-1400876 and by the RFBR Grant 15-01-99563. Anton V. Nikitenko was supported by the Chebyshev Laboratory (Department of Mathematics and Mechanics, St. Petersburg State University) under RF Government Grant 11.G34.31.0026."},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.3961"}],"quality_controlled":"1","publication_status":"published","page":"557 - 600","abstract":[{"lang":"eng","text":"We consider a random Schrödinger operator on the binary tree with a random potential which is the sum of a random radially symmetric potential, Qr, and a random transversally periodic potential, κQt, with coupling constant κ. Using a new one-dimensional dynamical systems approach combined with Jensen's inequality in hyperbolic space (our key estimate) we obtain a fractional moment estimate proving localization for small and large κ. Together with a previous result we therefore obtain a model with two Anderson transitions, from localization to delocalization and back to localization, when increasing κ. As a by-product we also have a partially new proof of one-dimensional Anderson localization at any disorder."}],"intvolume":"         6","volume":6,"_id":"1223","date_updated":"2021-01-12T06:49:12Z","date_created":"2018-12-11T11:50:48Z","type":"journal_article","day":"01","scopus_import":1,"author":[{"first_name":"Richard","full_name":"Froese, Richard","last_name":"Froese"},{"first_name":"Darrick","last_name":"Lee","full_name":"Lee, Darrick"},{"orcid":"0000-0001-8255-3968","first_name":"Christian","full_name":"Sadel, Christian","id":"4760E9F8-F248-11E8-B48F-1D18A9856A87","last_name":"Sadel"},{"full_name":"Spitzer, Wolfgang","last_name":"Spitzer","first_name":"Wolfgang"},{"full_name":"Stolz, Günter","last_name":"Stolz","first_name":"Günter"}],"doi":"10.4171/JST/132","oa_version":"Preprint","publisher":"European Mathematical Society","title":"Localization for transversally periodic random potentials on binary trees","citation":{"apa":"Froese, R., Lee, D., Sadel, C., Spitzer, W., &#38; Stolz, G. (2016). Localization for transversally periodic random potentials on binary trees. <i>Journal of Spectral Theory</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/JST/132\">https://doi.org/10.4171/JST/132</a>","mla":"Froese, Richard, et al. “Localization for Transversally Periodic Random Potentials on Binary Trees.” <i>Journal of Spectral Theory</i>, vol. 6, no. 3, European Mathematical Society, 2016, pp. 557–600, doi:<a href=\"https://doi.org/10.4171/JST/132\">10.4171/JST/132</a>.","ista":"Froese R, Lee D, Sadel C, Spitzer W, Stolz G. 2016. Localization for transversally periodic random potentials on binary trees. Journal of Spectral Theory. 6(3), 557–600.","chicago":"Froese, Richard, Darrick Lee, Christian Sadel, Wolfgang Spitzer, and Günter Stolz. “Localization for Transversally Periodic Random Potentials on Binary Trees.” <i>Journal of Spectral Theory</i>. European Mathematical Society, 2016. <a href=\"https://doi.org/10.4171/JST/132\">https://doi.org/10.4171/JST/132</a>.","ieee":"R. Froese, D. Lee, C. Sadel, W. Spitzer, and G. Stolz, “Localization for transversally periodic random potentials on binary trees,” <i>Journal of Spectral Theory</i>, vol. 6, no. 3. European Mathematical Society, pp. 557–600, 2016.","short":"R. Froese, D. Lee, C. Sadel, W. Spitzer, G. Stolz, Journal of Spectral Theory 6 (2016) 557–600.","ama":"Froese R, Lee D, Sadel C, Spitzer W, Stolz G. Localization for transversally periodic random potentials on binary trees. <i>Journal of Spectral Theory</i>. 2016;6(3):557-600. doi:<a href=\"https://doi.org/10.4171/JST/132\">10.4171/JST/132</a>"},"issue":"3","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2016-01-01T00:00:00Z","oa":1,"publication":"Journal of Spectral Theory","status":"public","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"publist_id":"6112","year":"2016","month":"01"},{"issue":"1","citation":{"ista":"Teitel Z, Pickup M, Field D, Barrett S. 2016. The dynamics of resource allocation and costs of reproduction in a sexually dimorphic, wind-pollinated dioecious plant. Plant Biology. 18(1), 98–103.","chicago":"Teitel, Zachary, Melinda Pickup, David Field, and Spencer Barrett. “The Dynamics of Resource Allocation and Costs of Reproduction in a Sexually Dimorphic, Wind-Pollinated Dioecious Plant.” <i>Plant Biology</i>. Wiley-Blackwell, 2016. <a href=\"https://doi.org/10.1111/plb.12336\">https://doi.org/10.1111/plb.12336</a>.","apa":"Teitel, Z., Pickup, M., Field, D., &#38; Barrett, S. (2016). The dynamics of resource allocation and costs of reproduction in a sexually dimorphic, wind-pollinated dioecious plant. <i>Plant Biology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/plb.12336\">https://doi.org/10.1111/plb.12336</a>","mla":"Teitel, Zachary, et al. “The Dynamics of Resource Allocation and Costs of Reproduction in a Sexually Dimorphic, Wind-Pollinated Dioecious Plant.” <i>Plant Biology</i>, vol. 18, no. 1, Wiley-Blackwell, 2016, pp. 98–103, doi:<a href=\"https://doi.org/10.1111/plb.12336\">10.1111/plb.12336</a>.","ama":"Teitel Z, Pickup M, Field D, Barrett S. The dynamics of resource allocation and costs of reproduction in a sexually dimorphic, wind-pollinated dioecious plant. <i>Plant Biology</i>. 2016;18(1):98-103. doi:<a href=\"https://doi.org/10.1111/plb.12336\">10.1111/plb.12336</a>","ieee":"Z. Teitel, M. Pickup, D. Field, and S. Barrett, “The dynamics of resource allocation and costs of reproduction in a sexually dimorphic, wind-pollinated dioecious plant,” <i>Plant Biology</i>, vol. 18, no. 1. Wiley-Blackwell, pp. 98–103, 2016.","short":"Z. Teitel, M. Pickup, D. Field, S. Barrett, Plant Biology 18 (2016) 98–103."},"date_published":"2016-01-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"Plant Biology","status":"public","department":[{"_id":"NiBa"}],"publist_id":"6110","year":"2016","month":"01","quality_controlled":"1","publication_status":"published","page":"98 - 103","intvolume":"        18","abstract":[{"lang":"eng","text":"Sexual dimorphism in resource allocation is expected to change during the life cycle of dioecious plants because of temporal differences between the sexes in reproductive investment. Given the potential for sex-specific differences in reproductive costs, resource availability may contribute to variation in reproductive allocation in females and males. Here, we used Rumex hastatulus, a dioecious, wind-pollinated annual plant, to investigate whether sexual dimorphism varies with life-history stage and nutrient availability, and determine whether allocation patterns differ depending on reproductive commitment. To examine if the costs of reproduction varied between the sexes, reproduction was either allowed or prevented through bud removal, and biomass allocation was measured at maturity. In a second experiment to assess variation in sexual dimorphism across the life cycle, and whether this varied with resource availability, plants were grown in high and low nutrients and allocation to roots, aboveground vegetative growth and reproduction were measured at three developmental stages. Males prevented from reproducing compensated with increased above- and belowground allocation to a much larger degree than females, suggesting that male reproductive costs reduce vegetative growth. The proportional allocation to roots, reproductive structures and aboveground vegetative growth varied between the sexes and among life-cycle stages, but not with nutrient treatment. Females allocated proportionally more resources to roots than males at peak flowering, but this pattern was reversed at reproductive maturity under low-nutrient conditions. Our study illustrates the importance of temporal dynamics in sex-specific resource allocation and provides support for high male reproductive costs in wind-pollinated plants."}],"date_updated":"2021-01-12T06:49:12Z","volume":18,"_id":"1224","type":"journal_article","date_created":"2018-12-11T11:50:48Z","author":[{"first_name":"Zachary","full_name":"Teitel, Zachary","last_name":"Teitel"},{"full_name":"Pickup, Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","last_name":"Pickup","orcid":"0000-0001-6118-0541","first_name":"Melinda"},{"orcid":"0000-0002-4014-8478","first_name":"David","full_name":"Field, David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","last_name":"Field"},{"first_name":"Spencer","full_name":"Barrett, Spencer","last_name":"Barrett"}],"doi":"10.1111/plb.12336","day":"01","scopus_import":1,"oa_version":"None","title":"The dynamics of resource allocation and costs of reproduction in a sexually dimorphic, wind-pollinated dioecious plant","publisher":"Wiley-Blackwell"},{"alternative_title":["LNCS"],"doi":"10.1007/978-3-319-44618-9_21","publisher":"Springer","_id":"1225","date_updated":"2023-02-23T10:08:16Z","type":"conference","page":"391 - 408","main_file_link":[{"url":"https://eprint.iacr.org/2016/662","open_access":"1"}],"quality_controlled":"1","year":"2016","related_material":{"record":[{"id":"1647","relation":"earlier_version","status":"public"}]},"publist_id":"6109","status":"public","project":[{"call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425"},{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"date_published":"2016-08-11T00:00:00Z","conference":{"end_date":"2016-09-02","start_date":"2016-08-31","name":"SCN: Security and Cryptography for Networks","location":"Amalfi, Italy"},"scopus_import":1,"day":"11","author":[{"first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"last_name":"Hanser","full_name":"Hanser, Christian","first_name":"Christian"},{"first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg"},{"first_name":"Daniel","last_name":"Slamanig","full_name":"Slamanig, Daniel"}],"oa_version":"Submitted Version","title":"Practical round-optimal blind signatures in the standard model from weaker assumptions","volume":9841,"date_created":"2018-12-11T11:50:49Z","abstract":[{"lang":"eng","text":"At Crypto 2015 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standard-model construction of efficient roundoptimal blind signatures that does not require complexity leveraging. It is conceptually simple and builds on the primitive of structure-preserving signatures on equivalence classes (SPS-EQ). FHS prove the unforgeability of their scheme assuming EUF-CMA security of the SPS-EQ scheme and hardness of a version of the DH inversion problem. Blindness under adversarially chosen keys is proven under an interactive variant of the DDH assumption. We propose a variant of their scheme whose blindness can be proven under a non-interactive assumption, namely a variant of the bilinear DDH assumption. We moreover prove its unforgeability assuming only unforgeability of the underlying SPS-EQ but no additional assumptions as needed for the FHS scheme."}],"intvolume":"      9841","publication_status":"published","month":"08","department":[{"_id":"KrPi"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"ama":"Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Vol 9841. Springer; 2016:391-408. doi:<a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">10.1007/978-3-319-44618-9_21</a>","ieee":"G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, and D. Slamanig, “Practical round-optimal blind signatures in the standard model from weaker assumptions,” presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy, 2016, vol. 9841, pp. 391–408.","short":"G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, D. Slamanig, in:, Springer, 2016, pp. 391–408.","ista":"Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. 2016. Practical round-optimal blind signatures in the standard model from weaker assumptions. SCN: Security and Cryptography for Networks, LNCS, vol. 9841, 391–408.","chicago":"Fuchsbauer, Georg, Christian Hanser, Chethan Kamath Hosdurg, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions,” 9841:391–408. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">https://doi.org/10.1007/978-3-319-44618-9_21</a>.","apa":"Fuchsbauer, G., Hanser, C., Kamath Hosdurg, C., &#38; Slamanig, D. (2016). Practical round-optimal blind signatures in the standard model from weaker assumptions (Vol. 9841, pp. 391–408). Presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">https://doi.org/10.1007/978-3-319-44618-9_21</a>","mla":"Fuchsbauer, Georg, et al. <i>Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions</i>. Vol. 9841, Springer, 2016, pp. 391–408, doi:<a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">10.1007/978-3-319-44618-9_21</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publist_id":"6108","external_id":{"pmid":["27595392"]},"year":"2016","date_published":"2016-10-20T00:00:00Z","pmid":1,"ec_funded":1,"project":[{"_id":"2593EBD6-B435-11E9-9278-68D0E5697425","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (FEBS)"},{"_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","grant_number":"701309"}],"status":"public","publication":"Nature","type":"journal_article","date_updated":"2021-01-12T06:49:13Z","_id":"1226","publisher":"Nature Publishing Group","doi":"10.1038/nature19794","article_processing_charge":"No","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5164932/"}],"page":"406 - 410","department":[{"_id":"LeSa"}],"month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"7625","citation":{"ieee":"K. Fiedorczuk, J. A. Letts, G. Degliesposti, K. Kaszuba, M. Skehel, and L. A. Sazanov, “Atomic structure of the entire mammalian mitochondrial complex i,” <i>Nature</i>, vol. 538, no. 7625. Nature Publishing Group, pp. 406–410, 2016.","short":"K. Fiedorczuk, J.A. Letts, G. Degliesposti, K. Kaszuba, M. Skehel, L.A. Sazanov, Nature 538 (2016) 406–410.","ama":"Fiedorczuk K, Letts JA, Degliesposti G, Kaszuba K, Skehel M, Sazanov LA. Atomic structure of the entire mammalian mitochondrial complex i. <i>Nature</i>. 2016;538(7625):406-410. doi:<a href=\"https://doi.org/10.1038/nature19794\">10.1038/nature19794</a>","apa":"Fiedorczuk, K., Letts, J. A., Degliesposti, G., Kaszuba, K., Skehel, M., &#38; Sazanov, L. A. (2016). Atomic structure of the entire mammalian mitochondrial complex i. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature19794\">https://doi.org/10.1038/nature19794</a>","mla":"Fiedorczuk, Karol, et al. “Atomic Structure of the Entire Mammalian Mitochondrial Complex I.” <i>Nature</i>, vol. 538, no. 7625, Nature Publishing Group, 2016, pp. 406–10, doi:<a href=\"https://doi.org/10.1038/nature19794\">10.1038/nature19794</a>.","ista":"Fiedorczuk K, Letts JA, Degliesposti G, Kaszuba K, Skehel M, Sazanov LA. 2016. Atomic structure of the entire mammalian mitochondrial complex i. Nature. 538(7625), 406–410.","chicago":"Fiedorczuk, Karol, James A Letts, Gianluca Degliesposti, Karol Kaszuba, Mark Skehel, and Leonid A Sazanov. “Atomic Structure of the Entire Mammalian Mitochondrial Complex I.” <i>Nature</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/nature19794\">https://doi.org/10.1038/nature19794</a>."},"language":[{"iso":"eng"}],"oa":1,"article_type":"original","date_created":"2018-12-11T11:50:49Z","volume":538,"title":"Atomic structure of the entire mammalian mitochondrial complex i","oa_version":"Submitted Version","author":[{"first_name":"Karol","full_name":"Fiedorczuk, Karol","id":"5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0","last_name":"Fiedorczuk"},{"full_name":"Letts, James A","id":"322DA418-F248-11E8-B48F-1D18A9856A87","last_name":"Letts","first_name":"James A","orcid":"0000-0002-9864-3586"},{"first_name":"Gianluca","last_name":"Degliesposti","full_name":"Degliesposti, Gianluca"},{"first_name":"Karol","id":"3FDF9472-F248-11E8-B48F-1D18A9856A87","full_name":"Kaszuba, Karol","last_name":"Kaszuba"},{"first_name":"Mark","full_name":"Skehel, Mark","last_name":"Skehel"},{"first_name":"Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A"}],"day":"20","scopus_import":1,"publication_status":"published","abstract":[{"text":"Mitochondrial complex I (also known as NADH:ubiquinone oxidoreductase) contributes to cellular energy production by transferring electrons from NADH to ubiquinone coupled to proton translocation across the membrane. It is the largest protein assembly of the respiratory chain with a total mass of 970 kilodaltons. Here we present a nearly complete atomic structure of ovine (Ovis aries) mitochondrial complex I at 3.9 Å resolution, solved by cryo-electron microscopy with cross-linking and mass-spectrometry mapping experiments. All 14 conserved core subunits and 31 mitochondria-specific supernumerary subunits are resolved within the L-shaped molecule. The hydrophilic matrix arm comprises flavin mononucleotide and 8 iron-sulfur clusters involved in electron transfer, and the membrane arm contains 78 transmembrane helices, mostly contributed by antiporter-like subunits involved in proton translocation. Supernumerary subunits form an interlinked, stabilizing shell around the conserved core. Tightly bound lipids (including cardiolipins) further stabilize interactions between the hydrophobic subunits. Subunits with possible regulatory roles contain additional cofactors, NADPH and two phosphopantetheine molecules, which are shown to be involved in inter-subunit interactions. We observe two different conformations of the complex, which may be related to the conformationally driven coupling mechanism and to the active-deactive transition of the enzyme. Our structure provides insight into the mechanism, assembly, maturation and dysfunction of mitochondrial complex I, and allows detailed molecular analysis of disease-causing mutations.","lang":"eng"}],"intvolume":"       538"},{"_id":"1227","date_updated":"2021-01-12T06:49:13Z","type":"conference","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-47151-8_9","publisher":"Springer","quality_controlled":"1","page":"128 - 144","ddc":["005"],"publist_id":"6107","year":"2016","conference":{"location":"Grenoble, France","name":"HSB: Hybrid Systems Biology","end_date":"2016-10-21","start_date":"2016-10-20"},"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).","date_published":"2016-09-25T00:00:00Z","status":"public","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"volume":9957,"date_created":"2018-12-11T11:50:49Z","day":"25","scopus_import":1,"author":[{"orcid":"0000-0002-3066-6941","first_name":"Hui","last_name":"Kong","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","full_name":"Kong, Hui"},{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"orcid":"0000-0002-0686-0365","first_name":"Sergiy","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yu","last_name":"Jiang","full_name":"Jiang, Yu"},{"orcid":"0000-0003-3658-1065","first_name":"Christian","last_name":"Schilling","full_name":"Schilling, Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Submitted Version","title":"Discrete abstraction of multiaffine systems","file_date_updated":"2020-07-14T12:44:39Z","publication_status":"published","has_accepted_license":"1","intvolume":"      9957","abstract":[{"text":"Many biological systems can be modeled as multiaffine hybrid systems. Due to the nonlinearity of multiaffine systems, it is difficult to verify their properties of interest directly. A common strategy to tackle this problem is to construct and analyze a discrete overapproximation of the original system. However, the conservativeness of a discrete abstraction significantly determines the level of confidence we can have in the properties of the original system. In this paper, in order to reduce the conservativeness of a discrete abstraction, we propose a new method based on a sufficient and necessary decision condition for computing discrete transitions between states in the abstract system. We assume the state space partition of a multiaffine system to be based on a set of multivariate polynomials. Hence, a rectangular partition defined in terms of polynomials of the form (xi − c) is just a simple case of multivariate polynomial partition, and the new decision condition applies naturally. We analyze and demonstrate the improvement of our method over the existing methods using some examples.","lang":"eng"}],"department":[{"_id":"ToHe"}],"file":[{"file_id":"4840","file_size":683955,"date_created":"2018-12-12T10:10:49Z","creator":"system","date_updated":"2020-07-14T12:44:39Z","relation":"main_file","checksum":"994e164b558c47bacf8dc066dd27c8fc","file_name":"IST-2017-781-v1+1_main.pdf","access_level":"open_access","content_type":"application/pdf"}],"month":"09","citation":{"ieee":"H. Kong <i>et al.</i>, “Discrete abstraction of multiaffine systems,” presented at the HSB: Hybrid Systems Biology, Grenoble, France, 2016, vol. 9957, pp. 128–144.","short":"H. Kong, E. Bartocci, S. Bogomolov, R. Grosu, T.A. Henzinger, Y. Jiang, C. Schilling, in:, Springer, 2016, pp. 128–144.","ama":"Kong H, Bartocci E, Bogomolov S, et al. Discrete abstraction of multiaffine systems. In: Vol 9957. Springer; 2016:128-144. doi:<a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">10.1007/978-3-319-47151-8_9</a>","apa":"Kong, H., Bartocci, E., Bogomolov, S., Grosu, R., Henzinger, T. A., Jiang, Y., &#38; Schilling, C. (2016). Discrete abstraction of multiaffine systems (Vol. 9957, pp. 128–144). Presented at the HSB: Hybrid Systems Biology, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">https://doi.org/10.1007/978-3-319-47151-8_9</a>","mla":"Kong, Hui, et al. <i>Discrete Abstraction of Multiaffine Systems</i>. Vol. 9957, Springer, 2016, pp. 128–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">10.1007/978-3-319-47151-8_9</a>.","chicago":"Kong, Hui, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, Thomas A Henzinger, Yu Jiang, and Christian Schilling. “Discrete Abstraction of Multiaffine Systems,” 9957:128–44. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">https://doi.org/10.1007/978-3-319-47151-8_9</a>.","ista":"Kong H, Bartocci E, Bogomolov S, Grosu R, Henzinger TA, Jiang Y, Schilling C. 2016. Discrete abstraction of multiaffine systems. HSB: Hybrid Systems Biology, LNCS, vol. 9957, 128–144."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"pubrep_id":"781","language":[{"iso":"eng"}]},{"publisher":"Springer","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-39555-5_16","type":"conference","_id":"1229","date_updated":"2023-09-07T12:30:22Z","ddc":["005","600"],"page":"285 - 303","quality_controlled":"1","related_material":{"record":[{"id":"83","status":"public","relation":"dissertation_contains"}]},"year":"2016","publist_id":"6105","status":"public","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020"}],"date_published":"2016-06-09T00:00:00Z","conference":{"name":"ACNS: Applied Cryptography and Network Security","start_date":"2016-06-19","end_date":"2016-06-22","location":"Guildford, UK"},"acknowledgement":"Research  supported  by  the  European  Research  Council,  ERC  starting  grant (259668-PSPC) and ERC consolidator grant (682815 - TOCNeT).","ec_funded":1,"oa_version":"Submitted Version","title":"Offline witness encryption","day":"09","scopus_import":1,"author":[{"last_name":"Abusalah","id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M","first_name":"Hamza M"},{"first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"date_created":"2018-12-11T11:50:50Z","volume":9696,"intvolume":"      9696","abstract":[{"lang":"eng","text":"Witness encryption (WE) was introduced by Garg et al. [GGSW13]. A WE scheme is defined for some NP language L and lets a sender encrypt messages relative to instances x. A ciphertext for x can be decrypted using w witnessing x ∈ L, but hides the message if x ∈ L. Garg et al. construct WE from multilinear maps and give another construction [GGH+13b] using indistinguishability obfuscation (iO) for circuits. Due to the reliance on such heavy tools, WE can cur- rently hardly be implemented on powerful hardware and will unlikely be realizable on constrained devices like smart cards any time soon. We construct a WE scheme where encryption is done by simply computing a Naor-Yung ciphertext (two CPA encryptions and a NIZK proof). To achieve this, our scheme has a setup phase, which outputs public parameters containing an obfuscated circuit (only required for decryption), two encryption keys and a common reference string (used for encryption). This setup need only be run once, and the parame- ters can be used for arbitrary many encryptions. Our scheme can also be turned into a functional WE scheme, where a message is encrypted w.r.t. a statement and a function f, and decryption with a witness w yields f (m, w). Our construction is inspired by the functional encryption scheme by Garg et al. and we prove (selective) security assuming iO and statistically simulation-sound NIZK. We give a construction of the latter in bilinear groups and combining it with ElGamal encryption, our ciphertexts are of size 1.3 kB at a 128-bit security level and can be computed on a smart card."}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:44:39Z","publication_status":"published","month":"06","file":[{"file_id":"5273","creator":"system","date_updated":"2020-07-14T12:44:39Z","date_created":"2018-12-12T10:17:20Z","file_size":515000,"checksum":"34fa9ce681da845a1ba945ba3dc57867","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-765-v1+1_838.pdf"}],"department":[{"_id":"KrPi"}],"pubrep_id":"765","language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 285–303.","short":"H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.","ama":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. Offline witness encryption. In: Vol 9696. Springer; 2016:285-303. doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">10.1007/978-3-319-39555-5_16</a>","apa":"Abusalah, H. M., Fuchsbauer, G., &#38; Pietrzak, K. Z. (2016). Offline witness encryption (Vol. 9696, pp. 285–303). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">https://doi.org/10.1007/978-3-319-39555-5_16</a>","mla":"Abusalah, Hamza M., et al. <i>Offline Witness Encryption</i>. Vol. 9696, Springer, 2016, pp. 285–303, doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">10.1007/978-3-319-39555-5_16</a>.","ista":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Offline witness encryption. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696, 285–303.","chicago":"Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Offline Witness Encryption,” 9696:285–303. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">https://doi.org/10.1007/978-3-319-39555-5_16</a>."}},{"date_created":"2018-12-11T11:50:50Z","volume":9583,"title":"Abstraction-driven concolic testing","oa_version":"Preprint","day":"01","scopus_import":1,"author":[{"first_name":"Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw"},{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"publication_status":"published","abstract":[{"text":"Concolic testing is a promising method for generating test suites for large programs. However, it suffers from the path-explosion problem and often fails to find tests that cover difficult-to-reach parts of programs. In contrast, model checkers based on counterexample-guided abstraction refinement explore programs exhaustively, while failing to scale on large programs with precision. In this paper, we present a novel method that iteratively combines concolic testing and model checking to find a test suite for a given coverage criterion. If concolic testing fails to cover some test goals, then the model checker refines its program abstraction to prove more paths infeasible, which reduces the search space for concolic testing. We have implemented our method on top of the concolictesting tool Crest and the model checker CpaChecker. We evaluated our tool on a collection of programs and a category of SvComp benchmarks. In our experiments, we observed an improvement in branch coverage compared to Crest from 48% to 63% in the best case, and from 66% to 71% on average.","lang":"eng"}],"intvolume":"      9583","department":[{"_id":"ToHe"}],"month":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Daca P, Gupta A, Henzinger TA. Abstraction-driven concolic testing. In: Vol 9583. Springer; 2016:328-347. doi:<a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">10.1007/978-3-662-49122-5_16</a>","ieee":"P. Daca, A. Gupta, and T. A. Henzinger, “Abstraction-driven concolic testing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA, 2016, vol. 9583, pp. 328–347.","short":"P. Daca, A. Gupta, T.A. Henzinger, in:, Springer, 2016, pp. 328–347.","chicago":"Daca, Przemyslaw, Ashutosh Gupta, and Thomas A Henzinger. “Abstraction-Driven Concolic Testing,” 9583:328–47. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">https://doi.org/10.1007/978-3-662-49122-5_16</a>.","ista":"Daca P, Gupta A, Henzinger TA. 2016. Abstraction-driven concolic testing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 9583, 328–347.","apa":"Daca, P., Gupta, A., &#38; Henzinger, T. A. (2016). Abstraction-driven concolic testing (Vol. 9583, pp. 328–347). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">https://doi.org/10.1007/978-3-662-49122-5_16</a>","mla":"Daca, Przemyslaw, et al. <i>Abstraction-Driven Concolic Testing</i>. Vol. 9583, Springer, 2016, pp. 328–47, doi:<a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">10.1007/978-3-662-49122-5_16</a>."},"language":[{"iso":"eng"}],"oa":1,"type":"conference","_id":"1230","date_updated":"2023-09-07T11:58:33Z","publisher":"Springer","alternative_title":["LNCS"],"doi":"10.1007/978-3-662-49122-5_16","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1511.02615","open_access":"1"}],"page":"328 - 347","publist_id":"6104","related_material":{"record":[{"id":"1155","relation":"dissertation_contains","status":"public"}]},"year":"2016","conference":{"end_date":"2016-01-19","start_date":"2016-01-17","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"St. Petersburg, FL, USA"},"acknowledgement":"We thank Andrey Kupriyanov for feedback on the manuscript,\r\nand Michael Tautschnig for help with preparing the experiments. This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).","date_published":"2016-01-01T00:00:00Z","ec_funded":1,"status":"public","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}]},{"project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"},{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"status":"public","ec_funded":1,"conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2016-05-08","end_date":"2016-05-12","location":"Vienna, Austria"},"acknowledgement":"Joël Alwen, Chethan Kamath, and Krzysztof Pietrzak’s research is partially supported by an ERC starting grant (259668-PSPC). Vladimir Kolmogorov is partially supported by an ERC consolidator grant (616160-DOICV). Binyi Chen was partially supported by NSF grants CNS-1423566 and CNS-1514526, and a gift from the Gareatis Foundation. Stefano Tessaro was partially supported by NSF grants CNS-1423566, CNS-1528178, a Hellman Fellowship, and the Glen and Susanne Culler Chair.\r\n\r\nThis work was done in part while the authors were visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons Collaboration in Cryptography through NSF grant CNS-1523467.","date_published":"2016-04-28T00:00:00Z","year":"2016","publist_id":"6103","page":"358 - 387","main_file_link":[{"url":"https://eprint.iacr.org/2016/100","open_access":"1"}],"quality_controlled":"1","doi":"10.1007/978-3-662-49896-5_13","alternative_title":["LNCS"],"publisher":"Springer","date_updated":"2021-01-12T06:49:15Z","_id":"1231","type":"conference","oa":1,"language":[{"iso":"eng"}],"citation":{"mla":"Alwen, Joel F., et al. <i>On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model</i>. Vol. 9666, Springer, 2016, pp. 358–87, doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">10.1007/978-3-662-49896-5_13</a>.","apa":"Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., &#38; Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">https://doi.org/10.1007/978-3-662-49896-5_13</a>","ista":"Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387.","chicago":"Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">https://doi.org/10.1007/978-3-662-49896-5_13</a>.","short":"J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.","ieee":"J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.","ama":"Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">10.1007/978-3-662-49896-5_13</a>"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"04","department":[{"_id":"KrPi"},{"_id":"VlKo"}],"abstract":[{"lang":"eng","text":"We study the time-and memory-complexities of the problem of computing labels of (multiple) randomly selected challenge-nodes in a directed acyclic graph. The w-bit label of a node is the hash of the labels of its parents, and the hash function is modeled as a random oracle. Specific instances of this problem underlie both proofs of space [Dziembowski et al. CRYPTO’15] as well as popular memory-hard functions like scrypt. As our main tool, we introduce the new notion of a probabilistic parallel entangled pebbling game, a new type of combinatorial pebbling game on a graph, which is closely related to the labeling game on the same graph. As a first application of our framework, we prove that for scrypt, when the underlying hash function is invoked n times, the cumulative memory complexity (CMC) (a notion recently introduced by Alwen and Serbinenko (STOC’15) to capture amortized memory-hardness for parallel adversaries) is at least Ω(w · (n/ log(n))2). This bound holds for adversaries that can store many natural functions of the labels (e.g., linear combinations), but still not arbitrary functions thereof. We then introduce and study a combinatorial quantity, and show how a sufficiently small upper bound on it (which we conjecture) extends our CMC bound for scrypt to hold against arbitrary adversaries. We also show that such an upper bound solves the main open problem for proofs-of-space protocols: namely, establishing that the time complexity of computing the label of a random node in a graph on n nodes (given an initial kw-bit state) reduces tightly to the time complexity for black pebbling on the same graph (given an initial k-node pebbling)."}],"intvolume":"      9666","publication_status":"published","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","last_name":"Alwen","first_name":"Joel F"},{"first_name":"Binyi","full_name":"Chen, Binyi","last_name":"Chen"},{"first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg"},{"first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"},{"last_name":"Tessaro","full_name":"Tessaro, Stefano","first_name":"Stefano"}],"day":"28","scopus_import":1,"title":"On the complexity of scrypt and proofs of space in the parallel random oracle model","oa_version":"Submitted Version","volume":9666,"date_created":"2018-12-11T11:50:51Z"},{"doi":"10.1038/nature19774","author":[{"last_name":"Letts","id":"322DA418-F248-11E8-B48F-1D18A9856A87","full_name":"Letts, James A","first_name":"James A","orcid":"0000-0002-9864-3586"},{"first_name":"Karol","id":"5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0","full_name":"Fiedorczuk, Karol","last_name":"Fiedorczuk"},{"orcid":"0000-0002-0977-7989","first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A"}],"scopus_import":1,"day":"29","oa_version":"None","title":"The architecture of respiratory supercomplexes","publisher":"Nature Publishing Group","date_updated":"2021-01-12T06:49:16Z","volume":537,"_id":"1232","type":"journal_article","date_created":"2018-12-11T11:50:51Z","page":"644 - 648","abstract":[{"lang":"eng","text":"Mitochondrial electron transport chain complexes are organized into supercomplexes responsible for carrying out cellular respiration. Here we present three architectures of mammalian (ovine) supercomplexes determined by cryo-electron microscopy. We identify two distinct arrangements of supercomplex CICIII 2 CIV (the respirasome) - a major 'tight' form and a minor 'loose' form (resolved at the resolution of 5.8 Å and 6.7 Å, respectively), which may represent different stages in supercomplex assembly or disassembly. We have also determined an architecture of supercomplex CICIII 2 at 7.8 Å resolution. All observed density can be attributed to the known 80 subunits of the individual complexes, including 132 transmembrane helices. The individual complexes form tight interactions that vary between the architectures, with complex IV subunit COX7a switching contact from complex III to complex I. The arrangement of active sites within the supercomplex may help control reactive oxygen species production. To our knowledge, these are the first complete architectures of the dominant, physiologically relevant state of the electron transport chain."}],"intvolume":"       537","publication_status":"published","quality_controlled":"1","year":"2016","month":"09","department":[{"_id":"LeSa"}],"publist_id":"6102","project":[{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (FEBS)","_id":"2593EBD6-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"publication":"Nature","status":"public","issue":"7622","citation":{"ama":"Letts JA, Fiedorczuk K, Sazanov LA. The architecture of respiratory supercomplexes. <i>Nature</i>. 2016;537(7622):644-648. doi:<a href=\"https://doi.org/10.1038/nature19774\">10.1038/nature19774</a>","ieee":"J. A. Letts, K. Fiedorczuk, and L. A. Sazanov, “The architecture of respiratory supercomplexes,” <i>Nature</i>, vol. 537, no. 7622. Nature Publishing Group, pp. 644–648, 2016.","short":"J.A. Letts, K. Fiedorczuk, L.A. Sazanov, Nature 537 (2016) 644–648.","ista":"Letts JA, Fiedorczuk K, Sazanov LA. 2016. The architecture of respiratory supercomplexes. Nature. 537(7622), 644–648.","chicago":"Letts, James A, Karol Fiedorczuk, and Leonid A Sazanov. “The Architecture of Respiratory Supercomplexes.” <i>Nature</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/nature19774\">https://doi.org/10.1038/nature19774</a>.","apa":"Letts, J. A., Fiedorczuk, K., &#38; Sazanov, L. A. (2016). The architecture of respiratory supercomplexes. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature19774\">https://doi.org/10.1038/nature19774</a>","mla":"Letts, James A., et al. “The Architecture of Respiratory Supercomplexes.” <i>Nature</i>, vol. 537, no. 7622, Nature Publishing Group, 2016, pp. 644–48, doi:<a href=\"https://doi.org/10.1038/nature19774\">10.1038/nature19774</a>."},"date_published":"2016-09-29T00:00:00Z","acknowledgement":"We thank the MRC LMB Cambridge for the use of the Titan Krios microscope. Data processing was performed using the IST high-performance computer cluster. J.A.L. holds a long-term fellowship from FEBS. K.F. is partially funded by a MRC UK PhD fellowship.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"date_updated":"2021-01-12T06:49:16Z","_id":"1233","type":"conference","doi":"10.1007/978-3-662-49096-9_12","alternative_title":["LNCS"],"publisher":"Springer","main_file_link":[{"url":"https://eprint.iacr.org/2015/853","open_access":"1"}],"quality_controlled":"1","page":"282 - 305","publist_id":"6100","year":"2016","ec_funded":1,"acknowledgement":"G. Fuchsbauer and K. Pietrzak are supported by the European Research Council, ERC Starting Grant (259668-PSPC). F. Heuer is funded by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and DFG SPP 1736, Algorithms for BIG DATA. E. Kiltz is supported by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation, the German Israel Foundation, and ERC Project ERCC (FP7/615074).","date_published":"2016-01-01T00:00:00Z","conference":{"location":"Tel Aviv, Israel","name":"TCC: Theory of Cryptography Conference","start_date":"2016-01-10","end_date":"2016-01-13"},"project":[{"grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"status":"public","volume":9562,"date_created":"2018-12-11T11:50:51Z","author":[{"last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"full_name":"Heuer, Felix","last_name":"Heuer","first_name":"Felix"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"scopus_import":1,"day":"01","title":"Standard security does imply security against selective opening for markov distributions","oa_version":"Submitted Version","publication_status":"published","abstract":[{"lang":"eng","text":"About three decades ago it was realized that implementing private channels between parties which can be adaptively corrupted requires an encryption scheme that is secure against selective opening attacks. Whether standard (IND-CPA) security implies security against selective opening attacks has been a major open question since. The only known reduction from selective opening to IND-CPA security loses an exponential factor. A polynomial reduction is only known for the very special case where the distribution considered in the selective opening security experiment is a product distribution, i.e., the messages are sampled independently from each other. In this paper we give a reduction whose loss is quantified via the dependence graph (where message dependencies correspond to edges) of the underlying message distribution. In particular, for some concrete distributions including Markov distributions, our reduction is polynomial."}],"intvolume":"      9562","department":[{"_id":"KrPi"}],"month":"01","citation":{"ama":"Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. Standard security does imply security against selective opening for markov distributions. In: Vol 9562. Springer; 2016:282-305. doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">10.1007/978-3-662-49096-9_12</a>","ieee":"G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security does imply security against selective opening for markov distributions,” presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562, pp. 282–305.","short":"G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp. 282–305.","chicago":"Fuchsbauer, Georg, Felix Heuer, Eike Kiltz, and Krzysztof Z Pietrzak. “Standard Security Does Imply Security against Selective Opening for Markov Distributions,” 9562:282–305. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">https://doi.org/10.1007/978-3-662-49096-9_12</a>.","ista":"Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. 2016. Standard security does imply security against selective opening for markov distributions. TCC: Theory of Cryptography Conference, LNCS, vol. 9562, 282–305.","apa":"Fuchsbauer, G., Heuer, F., Kiltz, E., &#38; Pietrzak, K. Z. (2016). Standard security does imply security against selective opening for markov distributions (Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">https://doi.org/10.1007/978-3-662-49096-9_12</a>","mla":"Fuchsbauer, Georg, et al. <i>Standard Security Does Imply Security against Selective Opening for Markov Distributions</i>. Vol. 9562, Springer, 2016, pp. 282–305, doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">10.1007/978-3-662-49096-9_12</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}]},{"author":[{"last_name":"Daca","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","first_name":"Jan","orcid":"0000-0002-8122-2881"},{"full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov","first_name":"Tatjana","orcid":"0000-0002-9041-0905"}],"scopus_import":1,"day":"01","oa_version":"Preprint","title":"Faster statistical model checking for unbounded temporal properties","volume":9636,"date_created":"2018-12-11T11:50:51Z","abstract":[{"text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds.","lang":"eng"}],"intvolume":"      9636","publication_status":"published","month":"01","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"oa":1,"language":[{"iso":"eng"}],"citation":{"ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands, 2016, vol. 9636, pp. 112–129.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Springer, 2016, pp. 112–129.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. In: Vol 9636. Springer; 2016:112-129. doi:<a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">10.1007/978-3-662-49674-9_7</a>","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Faster statistical model checking for unbounded temporal properties (Vol. 9636, pp. 112–129). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">https://doi.org/10.1007/978-3-662-49674-9_7</a>","mla":"Daca, Przemyslaw, et al. <i>Faster Statistical Model Checking for Unbounded Temporal Properties</i>. Vol. 9636, Springer, 2016, pp. 112–29, doi:<a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">10.1007/978-3-662-49674-9_7</a>.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Faster statistical model checking for unbounded temporal properties. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9636, 112–129.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties,” 9636:112–29. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">https://doi.org/10.1007/978-3-662-49674-9_7</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/978-3-662-49674-9_7","alternative_title":["LNCS"],"publisher":"Springer","date_updated":"2023-09-07T11:58:33Z","_id":"1234","type":"conference","page":"112 - 129","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.05739"}],"quality_controlled":"1","year":"2016","related_material":{"record":[{"id":"471","status":"public","relation":"later_version"},{"id":"1155","status":"public","relation":"dissertation_contains"}]},"publist_id":"6099","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"}],"status":"public","ec_funded":1,"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2016-04-08","start_date":"2016-04-02","location":"Eindhoven, The Netherlands"},"date_published":"2016-01-01T00:00:00Z","acknowledgement":"This research was funded in part by the European Research Council (ERC) under\r\ngrant  agreement  267989  (QUAREM),  the  Austrian  Science  Fund  (FWF)  under\r\ngrants project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), the Peo-\r\nple Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme (FP7/2007-2013) REA Grant No 291734, the SNSF Advanced Postdoc.\r\nMobility Fellowship – grant number P300P2\r\n161067, and the Czech Science Foun-\r\ndation under grant agreement P202/12/G061."},{"language":[{"iso":"eng"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"H. M. Abusalah and G. Fuchsbauer, “Constrained PRFs for unbounded inputs with short keys,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 445–463.","short":"H.M. Abusalah, G. Fuchsbauer, in:, Springer, 2016, pp. 445–463.","ama":"Abusalah HM, Fuchsbauer G. Constrained PRFs for unbounded inputs with short keys. In: Vol 9696. Springer; 2016:445-463. doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">10.1007/978-3-319-39555-5_24</a>","apa":"Abusalah, H. M., &#38; Fuchsbauer, G. (2016). Constrained PRFs for unbounded inputs with short keys (Vol. 9696, pp. 445–463). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">https://doi.org/10.1007/978-3-319-39555-5_24</a>","mla":"Abusalah, Hamza M., and Georg Fuchsbauer. <i>Constrained PRFs for Unbounded Inputs with Short Keys</i>. Vol. 9696, Springer, 2016, pp. 445–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">10.1007/978-3-319-39555-5_24</a>.","chicago":"Abusalah, Hamza M, and Georg Fuchsbauer. “Constrained PRFs for Unbounded Inputs with Short Keys,” 9696:445–63. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">https://doi.org/10.1007/978-3-319-39555-5_24</a>.","ista":"Abusalah HM, Fuchsbauer G. 2016. Constrained PRFs for unbounded inputs with short keys. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696, 445–463."},"month":"01","department":[{"_id":"KrPi"}],"intvolume":"      9696","abstract":[{"text":"A constrained pseudorandom function (CPRF) F: K×X → Y for a family T of subsets of χ is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a short constrained key kS, which allows to evaluate F(k, ·) on all inputs x ∈ S, while the outputs on all inputs x /∈ S look random even given kS. Abusalah et al. recently constructed the first constrained PRF for inputs of arbitrary length whose sets S are decided by Turing machines. They use their CPRF to build broadcast encryption and the first ID-based non-interactive key exchange for an unbounded number of users. Their constrained keys are obfuscated circuits and are therefore large. In this work we drastically reduce the key size and define a constrained key for a Turing machine M as a short signature on M. For this, we introduce a new signature primitive with constrained signing keys that let one only sign certain messages, while forging a signature on others is hard even when knowing the coins for key generation.","lang":"eng"}],"publication_status":"published","title":"Constrained PRFs for unbounded inputs with short keys","oa_version":"Submitted Version","day":"01","scopus_import":1,"author":[{"first_name":"Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M","last_name":"Abusalah"},{"first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"}],"date_created":"2018-12-11T11:50:52Z","volume":9696,"status":"public","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"},{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"date_published":"2016-01-01T00:00:00Z","acknowledgement":"H. Abusalah—Research supported by the European Research Council, ERC starting grant (259668-PSPC) and ERC consolidator grant (682815 - TOCNeT).","conference":{"end_date":"2016-06-22","start_date":"2016-06-19","name":"ACNS: Applied Cryptography and Network Security","location":"Guildford, UK"},"ec_funded":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"83"}]},"year":"2016","publist_id":"6098","page":"445 - 463","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/279.pdf"}],"publisher":"Springer","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-39555-5_24","type":"conference","_id":"1235","date_updated":"2023-09-07T12:30:22Z"}]