[{"language":[{"iso":"eng"}],"oa_version":"Preprint","month":"10","publication":"Advances in Mathematics","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1609.08136"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","publication_identifier":{"issn":["0001-8708"]},"oa":1,"date_published":"2017-10-15T00:00:00Z","type":"journal_article","publisher":"Elsevier","article_type":"original","page":"292-312","quality_controlled":"1","publication_status":"published","date_created":"2021-06-22T11:51:27Z","article_processing_charge":"No","title":"Resilience for the Littlewood–Offord problem","intvolume":"       319","_id":"9588","scopus_import":"1","author":[{"full_name":"Bandeira, Afonso S.","first_name":"Afonso S.","last_name":"Bandeira"},{"last_name":"Ferber","first_name":"Asaf","full_name":"Ferber, Asaf"},{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","last_name":"Kwan","first_name":"Matthew Alan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3"}],"volume":319,"extern":"1","arxiv":1,"doi":"10.1016/j.aim.2017.08.031","day":"15","abstract":[{"text":"Consider the sum  X(ξ)=∑ni=1aiξi , where  a=(ai)ni=1  is a sequence of non-zero reals and  ξ=(ξi)ni=1  is a sequence of i.i.d. Rademacher random variables (that is,  Pr[ξi=1]=Pr[ξi=−1]=1/2 ). The classical Littlewood-Offord problem asks for the best possible upper bound on the concentration probabilities  Pr[X=x] . In this paper we study a resilience version of the Littlewood-Offord problem: how many of the  ξi  is an adversary typically allowed to change without being able to force concentration on a particular value? We solve this problem asymptotically, and present a few interesting open problems.","lang":"eng"}],"date_updated":"2023-02-23T14:01:57Z","citation":{"ista":"Bandeira AS, Ferber A, Kwan MA. 2017. Resilience for the Littlewood–Offord problem. Advances in Mathematics. 319, 292–312.","mla":"Bandeira, Afonso S., et al. “Resilience for the Littlewood–Offord Problem.” <i>Advances in Mathematics</i>, vol. 319, Elsevier, 2017, pp. 292–312, doi:<a href=\"https://doi.org/10.1016/j.aim.2017.08.031\">10.1016/j.aim.2017.08.031</a>.","short":"A.S. Bandeira, A. Ferber, M.A. Kwan, Advances in Mathematics 319 (2017) 292–312.","ieee":"A. S. Bandeira, A. Ferber, and M. A. Kwan, “Resilience for the Littlewood–Offord problem,” <i>Advances in Mathematics</i>, vol. 319. Elsevier, pp. 292–312, 2017.","chicago":"Bandeira, Afonso S., Asaf Ferber, and Matthew Alan Kwan. “Resilience for the Littlewood–Offord Problem.” <i>Advances in Mathematics</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.aim.2017.08.031\">https://doi.org/10.1016/j.aim.2017.08.031</a>.","ama":"Bandeira AS, Ferber A, Kwan MA. Resilience for the Littlewood–Offord problem. <i>Advances in Mathematics</i>. 2017;319:292-312. doi:<a href=\"https://doi.org/10.1016/j.aim.2017.08.031\">10.1016/j.aim.2017.08.031</a>","apa":"Bandeira, A. S., Ferber, A., &#38; Kwan, M. A. (2017). Resilience for the Littlewood–Offord problem. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2017.08.031\">https://doi.org/10.1016/j.aim.2017.08.031</a>"},"year":"2017","external_id":{"arxiv":["1609.08136"]}},{"language":[{"iso":"eng"}],"oa_version":"Published Version","month":"06","publication":"European Journal of Combinatorics","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.ejc.2017.02.003"}],"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","publication_identifier":{"issn":["0195-6698"]},"oa":1,"type":"journal_article","date_published":"2017-06-01T00:00:00Z","publisher":"Elsevier","article_type":"original","quality_controlled":"1","page":"6-25","article_processing_charge":"No","date_created":"2021-06-22T12:18:59Z","publication_status":"published","intvolume":"        63","title":"The average number of spanning trees in sparse graphs with given degrees","scopus_import":"1","_id":"9589","author":[{"full_name":"Greenhill, Catherine","first_name":"Catherine","last_name":"Greenhill"},{"full_name":"Isaev, Mikhail","last_name":"Isaev","first_name":"Mikhail"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan"},{"full_name":"McKay, Brendan D.","first_name":"Brendan D.","last_name":"McKay"}],"volume":63,"extern":"1","day":"01","arxiv":1,"doi":"10.1016/j.ejc.2017.02.003","abstract":[{"text":"We give an asymptotic expression for the expected number of spanning trees in a random graph with a given degree sequence , provided that the number of edges is at least , where  is the maximum degree. A key part of our argument involves establishing a concentration result for a certain family of functions over random trees with given degrees, using Prüfer codes.","lang":"eng"}],"year":"2017","citation":{"short":"C. Greenhill, M. Isaev, M.A. Kwan, B.D. McKay, European Journal of Combinatorics 63 (2017) 6–25.","mla":"Greenhill, Catherine, et al. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” <i>European Journal of Combinatorics</i>, vol. 63, Elsevier, 2017, pp. 6–25, doi:<a href=\"https://doi.org/10.1016/j.ejc.2017.02.003\">10.1016/j.ejc.2017.02.003</a>.","ista":"Greenhill C, Isaev M, Kwan MA, McKay BD. 2017. The average number of spanning trees in sparse graphs with given degrees. European Journal of Combinatorics. 63, 6–25.","ama":"Greenhill C, Isaev M, Kwan MA, McKay BD. The average number of spanning trees in sparse graphs with given degrees. <i>European Journal of Combinatorics</i>. 2017;63:6-25. doi:<a href=\"https://doi.org/10.1016/j.ejc.2017.02.003\">10.1016/j.ejc.2017.02.003</a>","apa":"Greenhill, C., Isaev, M., Kwan, M. A., &#38; McKay, B. D. (2017). The average number of spanning trees in sparse graphs with given degrees. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2017.02.003\">https://doi.org/10.1016/j.ejc.2017.02.003</a>","ieee":"C. Greenhill, M. Isaev, M. A. Kwan, and B. D. McKay, “The average number of spanning trees in sparse graphs with given degrees,” <i>European Journal of Combinatorics</i>, vol. 63. Elsevier, pp. 6–25, 2017.","chicago":"Greenhill, Catherine, Mikhail Isaev, Matthew Alan Kwan, and Brendan D. McKay. “The Average Number of Spanning Trees in Sparse Graphs with given Degrees.” <i>European Journal of Combinatorics</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.ejc.2017.02.003\">https://doi.org/10.1016/j.ejc.2017.02.003</a>."},"date_updated":"2023-02-23T14:02:00Z","external_id":{"arxiv":["1606.01586"]}},{"citation":{"chicago":"De Martino, Daniele. “Scales and Multimodal Flux Distributions in Stationary Metabolic Network Models via Thermodynamics.” <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>. American Institute of Physics, 2017. <a href=\"https://doi.org/10.1103/PhysRevE.95.062419\">https://doi.org/10.1103/PhysRevE.95.062419</a>.","ieee":"D. De Martino, “Scales and multimodal flux distributions in stationary metabolic network models via thermodynamics,” <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>, vol. 95, no. 6. American Institute of Physics, p. 062419, 2017.","ama":"De Martino D. Scales and multimodal flux distributions in stationary metabolic network models via thermodynamics. <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>. 2017;95(6):062419. doi:<a href=\"https://doi.org/10.1103/PhysRevE.95.062419\">10.1103/PhysRevE.95.062419</a>","apa":"De Martino, D. (2017). Scales and multimodal flux distributions in stationary metabolic network models via thermodynamics. <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.95.062419\">https://doi.org/10.1103/PhysRevE.95.062419</a>","ista":"De Martino D. 2017. Scales and multimodal flux distributions in stationary metabolic network models via thermodynamics.  Physical Review E Statistical Nonlinear and Soft Matter Physics . 95(6), 062419.","mla":"De Martino, Daniele. “Scales and Multimodal Flux Distributions in Stationary Metabolic Network Models via Thermodynamics.” <i> Physical Review E Statistical Nonlinear and Soft Matter Physics </i>, vol. 95, no. 6, American Institute of Physics, 2017, p. 062419, doi:<a href=\"https://doi.org/10.1103/PhysRevE.95.062419\">10.1103/PhysRevE.95.062419</a>.","short":"D. De Martino,  Physical Review E Statistical Nonlinear and Soft Matter Physics  95 (2017) 062419."},"year":"2017","date_updated":"2023-09-22T09:59:01Z","external_id":{"isi":["000404546400004"]},"isi":1,"day":"28","doi":"10.1103/PhysRevE.95.062419","abstract":[{"lang":"eng","text":"In this work it is shown that scale-free tails in metabolic flux distributions inferred in stationary models are an artifact due to reactions involved in thermodynamically unfeasible cycles, unbounded by physical constraints and in principle able to perform work without expenditure of free energy. After implementing thermodynamic constraints by removing such loops, metabolic flux distributions scale meaningfully with the physical limiting factors, acquiring in turn a richer multimodal structure potentially leading to symmetry breaking while optimizing for objective functions."}],"volume":95,"scopus_import":"1","_id":"959","issue":"6","author":[{"first_name":"Daniele","last_name":"De Martino","orcid":"0000-0002-5214-4706","full_name":"De Martino, Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:49:25Z","article_processing_charge":"No","department":[{"_id":"GaTk"}],"publication_status":"published","intvolume":"        95","title":"Scales and multimodal flux distributions in stationary metabolic network models via thermodynamics","ec_funded":1,"quality_controlled":"1","page":"062419","publisher":"American Institute of Physics","type":"journal_article","date_published":"2017-06-28T00:00:00Z","publication_identifier":{"issn":["24700045"]},"publist_id":"6446","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/1703.00853.pdf"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","publication":" Physical Review E Statistical Nonlinear and Soft Matter Physics ","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","month":"06","language":[{"iso":"eng"}]},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.07960"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","publication_identifier":{"issn":["0895-4801"],"eissn":["1095-7146"]},"oa":1,"type":"journal_article","date_published":"2017-01-12T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"Preprint","month":"01","publication":"SIAM Journal on Discrete Mathematics","volume":31,"extern":"1","day":"12","doi":"10.1137/15m1032910","arxiv":1,"abstract":[{"text":"We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding trees into fixed dense graphs and into random graphs, and extends a sizeable body of existing research on randomly perturbed graphs. Specifically, we show that there is c=c(α,Δ) such that if G is an n-vertex graph with minimum degree at least αn, and T is an n-vertex tree with maximum degree at most Δ , then if we add cn uniformly random edges to G, the resulting graph will contain T asymptotically almost surely (as n→∞ ). Our proof uses a lemma concerning the decomposition of a dense graph into super-regular pairs of comparable sizes, which may be of independent interest.","lang":"eng"}],"year":"2017","citation":{"short":"M. Krivelevich, M.A. Kwan, B. Sudakov, SIAM Journal on Discrete Mathematics 31 (2017) 155–171.","mla":"Krivelevich, Michael, et al. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.” <i>SIAM Journal on Discrete Mathematics</i>, vol. 31, no. 1, Society for Industrial &#38; Applied Mathematics, 2017, pp. 155–71, doi:<a href=\"https://doi.org/10.1137/15m1032910\">10.1137/15m1032910</a>.","ista":"Krivelevich M, Kwan MA, Sudakov B. 2017. Bounded-degree spanning trees in randomly perturbed graphs. SIAM Journal on Discrete Mathematics. 31(1), 155–171.","ama":"Krivelevich M, Kwan MA, Sudakov B. Bounded-degree spanning trees in randomly perturbed graphs. <i>SIAM Journal on Discrete Mathematics</i>. 2017;31(1):155-171. doi:<a href=\"https://doi.org/10.1137/15m1032910\">10.1137/15m1032910</a>","apa":"Krivelevich, M., Kwan, M. A., &#38; Sudakov, B. (2017). Bounded-degree spanning trees in randomly perturbed graphs. <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/15m1032910\">https://doi.org/10.1137/15m1032910</a>","chicago":"Krivelevich, Michael, Matthew Alan Kwan, and Benny Sudakov. “Bounded-Degree Spanning Trees in Randomly Perturbed Graphs.” <i>SIAM Journal on Discrete Mathematics</i>. Society for Industrial &#38; Applied Mathematics, 2017. <a href=\"https://doi.org/10.1137/15m1032910\">https://doi.org/10.1137/15m1032910</a>.","ieee":"M. Krivelevich, M. A. Kwan, and B. Sudakov, “Bounded-degree spanning trees in randomly perturbed graphs,” <i>SIAM Journal on Discrete Mathematics</i>, vol. 31, no. 1. Society for Industrial &#38; Applied Mathematics, pp. 155–171, 2017."},"date_updated":"2023-02-23T14:02:05Z","external_id":{"arxiv":["1507.07960"]},"publisher":"Society for Industrial & Applied Mathematics","article_type":"original","quality_controlled":"1","page":"155-171","article_processing_charge":"No","date_created":"2021-06-22T12:26:25Z","publication_status":"published","intvolume":"        31","title":"Bounded-degree spanning trees in randomly perturbed graphs","scopus_import":"1","_id":"9590","issue":"1","author":[{"first_name":"Michael","last_name":"Krivelevich","full_name":"Krivelevich, Michael"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","last_name":"Kwan"},{"full_name":"Sudakov, Benny","last_name":"Sudakov","first_name":"Benny"}]},{"file":[{"file_size":2153858,"checksum":"dc1f5a475b918d09a0f9f587400b1626","date_created":"2018-12-12T10:09:40Z","content_type":"application/pdf","file_name":"IST-2017-830-v1+1_2017_Hansen_CellPolarity.pdf","date_updated":"2020-07-14T12:48:16Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"4764"}],"related_material":{"record":[{"status":"public","id":"9962","relation":"dissertation_contains"}]},"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2017-06-28T00:00:00Z","type":"journal_article","publication_identifier":{"issn":["16625102"]},"oa":1,"publist_id":"6445","language":[{"iso":"eng"}],"publication":"Frontiers in Cellular Neuroscience","has_accepted_license":"1","oa_version":"Published Version","project":[{"grant_number":"618444","name":"Molecular Mechanisms of Cerebral Cortex Development","_id":"25D61E48-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25D7962E-B435-11E9-9278-68D0E5697425","name":"Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal Level","grant_number":"RGP0053/2014"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25985A36-B435-11E9-9278-68D0E5697425","name":"The biochemical basis of PAR polarization","grant_number":"T00817-B21"}],"month":"06","article_number":"176","volume":11,"ddc":["570"],"date_updated":"2024-03-25T23:30:23Z","citation":{"short":"A.H. Hansen, C.F. Düllberg, C. Mieck, M. Loose, S. Hippenmeyer, Frontiers in Cellular Neuroscience 11 (2017).","mla":"Hansen, Andi H., et al. “Cell Polarity in Cerebral Cortex Development - Cellular Architecture Shaped by Biochemical Networks.” <i>Frontiers in Cellular Neuroscience</i>, vol. 11, 176, Frontiers Research Foundation, 2017, doi:<a href=\"https://doi.org/10.3389/fncel.2017.00176\">10.3389/fncel.2017.00176</a>.","ista":"Hansen AH, Düllberg CF, Mieck C, Loose M, Hippenmeyer S. 2017. Cell polarity in cerebral cortex development - cellular architecture shaped by biochemical networks. Frontiers in Cellular Neuroscience. 11, 176.","apa":"Hansen, A. H., Düllberg, C. F., Mieck, C., Loose, M., &#38; Hippenmeyer, S. (2017). Cell polarity in cerebral cortex development - cellular architecture shaped by biochemical networks. <i>Frontiers in Cellular Neuroscience</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fncel.2017.00176\">https://doi.org/10.3389/fncel.2017.00176</a>","ama":"Hansen AH, Düllberg CF, Mieck C, Loose M, Hippenmeyer S. Cell polarity in cerebral cortex development - cellular architecture shaped by biochemical networks. <i>Frontiers in Cellular Neuroscience</i>. 2017;11. doi:<a href=\"https://doi.org/10.3389/fncel.2017.00176\">10.3389/fncel.2017.00176</a>","ieee":"A. H. Hansen, C. F. Düllberg, C. Mieck, M. Loose, and S. Hippenmeyer, “Cell polarity in cerebral cortex development - cellular architecture shaped by biochemical networks,” <i>Frontiers in Cellular Neuroscience</i>, vol. 11. Frontiers Research Foundation, 2017.","chicago":"Hansen, Andi H, Christian F Düllberg, Christine Mieck, Martin Loose, and Simon Hippenmeyer. “Cell Polarity in Cerebral Cortex Development - Cellular Architecture Shaped by Biochemical Networks.” <i>Frontiers in Cellular Neuroscience</i>. Frontiers Research Foundation, 2017. <a href=\"https://doi.org/10.3389/fncel.2017.00176\">https://doi.org/10.3389/fncel.2017.00176</a>."},"year":"2017","isi":1,"external_id":{"isi":["000404486700001"]},"doi":"10.3389/fncel.2017.00176","day":"28","abstract":[{"lang":"eng","text":"The human cerebral cortex is the seat of our cognitive abilities and composed of an extraordinary number of neurons, organized in six distinct layers. The establishment of specific morphological and physiological features in individual neurons needs to be regulated with high precision. Impairments in the sequential developmental programs instructing corticogenesis lead to alterations in the cortical cytoarchitecture which is thought to represent the major underlying cause for several neurological disorders including neurodevelopmental and psychiatric diseases. In this review we discuss the role of cell polarity at sequential stages during cortex development. We first provide an overview of morphological cell polarity features in cortical neural stem cells and newly-born postmitotic neurons. We then synthesize a conceptual molecular and biochemical framework how cell polarity is established at the cellular level through a break in symmetry in nascent cortical projection neurons. Lastly we provide a perspective how the molecular mechanisms applying to single cells could be probed and integrated in an in vivo and tissue-wide context."}],"quality_controlled":"1","ec_funded":1,"file_date_updated":"2020-07-14T12:48:16Z","publisher":"Frontiers Research Foundation","_id":"960","scopus_import":"1","author":[{"last_name":"Hansen","first_name":"Andi H","full_name":"Hansen, Andi H","id":"38853E16-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christian F","last_name":"Düllberg","orcid":"0000-0001-6335-9748","full_name":"Düllberg, Christian F","id":"459064DC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mieck, Christine","orcid":"0000-0003-1919-7416","last_name":"Mieck","first_name":"Christine","id":"34CAE85C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","last_name":"Loose","first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","first_name":"Simon","last_name":"Hippenmeyer"}],"publication_status":"published","department":[{"_id":"SiHi"},{"_id":"MaLo"}],"article_processing_charge":"Yes","date_created":"2018-12-11T11:49:25Z","title":"Cell polarity in cerebral cortex development - cellular architecture shaped by biochemical networks","pubrep_id":"830","intvolume":"        11"},{"author":[{"id":"419EECCC-F248-11E8-B48F-1D18A9856A87","full_name":"Barone, Vanessa","orcid":"0000-0003-2676-3367","last_name":"Barone","first_name":"Vanessa"}],"_id":"961","title":"Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation","pubrep_id":"825","alternative_title":["ISTA Thesis"],"department":[{"_id":"CaHe"}],"article_processing_charge":"No","date_created":"2018-12-11T11:49:25Z","publication_status":"published","file_date_updated":"2020-07-14T12:48:16Z","page":"109","publisher":"Institute of Science and Technology Austria","citation":{"mla":"Barone, Vanessa. <i>Cell Adhesion and Cell Fate: An Effective Feedback Loop during Zebrafish Gastrulation</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_825\">10.15479/AT:ISTA:th_825</a>.","short":"V. Barone, Cell Adhesion and Cell Fate: An Effective Feedback Loop during Zebrafish Gastrulation, Institute of Science and Technology Austria, 2017.","ista":"Barone V. 2017. Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation. Institute of Science and Technology Austria.","apa":"Barone, V. (2017). <i>Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_825\">https://doi.org/10.15479/AT:ISTA:th_825</a>","ama":"Barone V. Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_825\">10.15479/AT:ISTA:th_825</a>","chicago":"Barone, Vanessa. “Cell Adhesion and Cell Fate: An Effective Feedback Loop during Zebrafish Gastrulation.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_825\">https://doi.org/10.15479/AT:ISTA:th_825</a>.","ieee":"V. Barone, “Cell adhesion and cell fate: An effective feedback loop during zebrafish gastrulation,” Institute of Science and Technology Austria, 2017."},"year":"2017","date_updated":"2023-09-27T14:16:45Z","abstract":[{"text":"Cell-cell  contact  formation  constitutes  the  first  step  in  the  emergence  of  multicellularity  in evolution, thereby  allowing  the  differentiation  of  specialized  cell  types.  In  metazoan development, cell-cell contact formation is thought to influence cell fate specification, and cell   fate   specification   has   been   implicated   in   cell-cell  contact formation.   However, remarkably little is yet known about whether and how the interaction and feedback between cell-cell contact formation and cell fate specification affect development. Here we identify a positive  feedback  loop  between  cell-cell  contact  duration,  morphogen  signaling  and mesendoderm  cell  fate  specification  during  zebrafish  gastrulation.  We  show  that  long lasting cell-cell contacts enhance the competence of prechordal plate (ppl) progenitor cells to  respond  to  Nodal  signaling,  required  for  proper  ppl  cell  fate  specification.  We  further show  that  Nodal  signalling  romotes  ppl  cell-cell  contact  duration,  thereby  generating  an effective  positive  feedback  loop  between  ppl  cell-cell  contact  duration  and  cell  fate specification. Finally, by using a combination of theoretical modeling and experimentation, we  show  that  this  feedback  loop  determines  whether  anterior  axial  mesendoderm  cells become  ppl  progenitors  or,  instead,  turn  into  endoderm  progenitors.  Our  findings  reveal that  the  gene  regulatory  networks  leading  to  cell  fate  diversification  within  the  developing embryo  are  controlled  by  the  interdependent  activities  of  cell-cell  signaling  and  contact formation.","lang":"eng"}],"day":"01","degree_awarded":"PhD","doi":"10.15479/AT:ISTA:th_825","ddc":["570","590"],"acknowledgement":"Many people accompanied me during this trip: I would not have reached my destination nor \r\nenjoyed the travelling without them. First of all, thanks to CP. Thanks for making me part of \r\nyour team, always full of diverse, interesting and incredibly competent people and thanks for \r\nall  the  good  science  I  witnessed  and  participated  in.  It  has  been  a \r\nblast,  an  incredibly \r\nexciting  one!  Thanks  to  JLo,  for  teaching  me  how  to  master  my  pipettes  and  showing  me \r\nthat science is a lot of fun. Many, many thanks to Gabby for teaching me basically everything \r\nabout  zebrafish  and  being  always  there  to  advice,  sugge\r\nst,  support...and  play  fussball! \r\nThank you to Julien, for the critical eye on things, Pedro, for all the invaluable feedback and \r\nthe amazing kicker matches, and Keisuke, for showing me the light, and to the three of them \r\ntogether  for  all  the  good  laughs  we\r\nhad.  My  start  in  Vienna  would  have  been  a  lot  more \r\ndifficult  without  you  guys.  Also  it  would  not  have  been  possible  without  Elena  and  Inês: \r\nthanks  for  helping  setting  up  this  lab  and  for  the  dinners  in  Gugging.  Thanks  to  Martin,  for \r\nhelping  me  understand \r\nthe  physics  behind  biology.  Thanks  to  Philipp,  for  the  interest  and \r\nadvice, and to Michael, for the Viennise take on things. Thanks to Julia, for putting up with \r\nbeing our technician and becoming a friend in the process. And now to the newest members \r\nof th\r\ne lab. Thanks to Daniel for the enthusiasm and the neverending energy and for all your \r\nhelp over the years: thank you! To Jana, for showing me that one doesn’t give up, no matter \r\nwhat.  To  Shayan,  for  being  such  a  motivated  student.  To  Matt,  for  helping  out\r\nwith  coding \r\nand for finding punk solutions to data analysis problems. Thanks to all the members of the \r\nlab, Verena, Hitoshi, Silvia, Conny, Karla, Nicoletta, Zoltan, Peng, Benoit, Roland, Yuuta and \r\nFeyza,  for  the  wonderful  atmosphere  in  the  lab.  Many  than\r\nks  to  Koni  and  Deborah:  doing \r\nexperiments would have been much more difficult without your help. Special thanks to Katjia \r\nfor  setting  up  an  amazing  imaging  facility  and  for  building  the  best  team,  Robert,  Nasser, \r\nAnna and Doreen: thank you for putting up w\r\nith all the late sortings and for helping with all \r\nthe technical problems. Thanks to Eva, Verena and Matthias for keeping the fish happy. Big \r\nthanks to Harald Janovjak for being a present and helpful committee member over the years \r\nand  to  Patrick  Lemaire  f\r\nor  the  helpful  insight  and  extremely  interesting  discussion  we  had \r\nabout  the  project.  Also,  this  journey  would  not  have  been  the  same  without  all  the  friends \r\nthat I met in Dresden and then in Vienna: Daniele, Claire, Kuba, Steffi, Harold, Dejan, Irene, \r\nFab\r\nienne, Hande, Tiago, Marianne, Jon, Srdjan, Branca, Uli, Murat, Alex, Conny, Christoph, \r\nCaro, Simone, Barbara, Felipe, Dama, Jose, Hubert and many others that filled my days with \r\nfun and support. A special thank to my family, always close even if they are \r\nkilometers away. \r\nGrazie  ai  miei  fratelli,  Nunzio  e  William,  e  alla  mia  mamma,  per  essermi  sempre  vicini  pur \r\nvivendo a chilometri di distanza. And, last but not least, thanks to Moritz, for putting up with \r\nthe crazy life of a scientist, the living apart for\r\nso long, never knowing when things are going \r\nto happen. Thanks for being a great partner and my number one fan!","has_accepted_license":"1","month":"03","oa_version":"Published Version","language":[{"iso":"eng"}],"type":"dissertation","date_published":"2017-03-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa":1,"publist_id":"6444","supervisor":[{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["2663-337X"]},"status":"public","related_material":{"record":[{"relation":"part_of_dissertation","id":"1100","status":"public"},{"status":"public","id":"1537","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"1912"},{"relation":"part_of_dissertation","id":"2926","status":"public"},{"status":"public","id":"3246","relation":"part_of_dissertation"},{"status":"public","id":"676","relation":"part_of_dissertation"},{"id":"735","relation":"part_of_dissertation","status":"public"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_name":"2017_Barone_thesis_final.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2020-07-14T12:48:16Z","file_size":14497822,"checksum":"242f88c87f2cf267bf05049fa26a687b","date_created":"2019-04-05T08:36:52Z","creator":"dernst","file_id":"6205","access_level":"closed","relation":"source_file"},{"relation":"main_file","access_level":"open_access","file_id":"6206","creator":"dernst","date_created":"2019-04-05T08:36:52Z","file_size":14995941,"checksum":"ba5b0613ed8bade73a409acdd880fb8a","date_updated":"2020-07-14T12:48:16Z","file_name":"2017_Barone_thesis_.pdf","content_type":"application/pdf"}]},{"volume":10427,"external_id":{"isi":["000431900900021"]},"isi":1,"year":"2017","citation":{"ieee":"M. Trinh, D. H. Chu, and J. Jaffar, “Model counting for recursively-defined strings,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 399–418.","chicago":"Trinh, Minh, Duc Hiep Chu, and Joxan Jaffar. “Model Counting for Recursively-Defined Strings.” edited by Rupak Majumdar and Viktor Kunčak, 10427:399–418. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_21\">https://doi.org/10.1007/978-3-319-63390-9_21</a>.","ama":"Trinh M, Chu DH, Jaffar J. Model counting for recursively-defined strings. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:399-418. doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_21\">10.1007/978-3-319-63390-9_21</a>","apa":"Trinh, M., Chu, D. H., &#38; Jaffar, J. (2017). Model counting for recursively-defined strings. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10427, pp. 399–418). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_21\">https://doi.org/10.1007/978-3-319-63390-9_21</a>","ista":"Trinh M, Chu DH, Jaffar J. 2017. Model counting for recursively-defined strings. CAV: Computer Aided Verification, LNCS, vol. 10427, 399–418.","mla":"Trinh, Minh, et al. <i>Model Counting for Recursively-Defined Strings</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 399–418, doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_21\">10.1007/978-3-319-63390-9_21</a>.","short":"M. Trinh, D.H. Chu, J. Jaffar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 399–418."},"date_updated":"2023-09-22T09:58:02Z","abstract":[{"text":"We present a new algorithm for model counting of a class of string constraints. In addition to the classic operation of concatenation, our class includes some recursively defined operations such as Kleene closure, and replacement of substrings. Additionally, our class also includes length constraints on the string expressions, which means, by requiring reasoning about numbers, that we face a multi-sorted logic. In the end, our string constraints are motivated by their use in programming for web applications. Our algorithm comprises two novel features: the ability to use a technique of (1) partial derivatives for constraints that are already in a solved form, i.e. a form where its (string) satisfiability is clearly displayed, and (2) non-progression, where cyclic reasoning in the reduction process may be terminated (thus allowing for the algorithm to look elsewhere). Finally, we experimentally compare our model counter with two recent works on model counting of similar constraints, SMC [18] and ABC [5], to demonstrate its superior performance.","lang":"eng"}],"day":"01","doi":"10.1007/978-3-319-63390-9_21","quality_controlled":"1","page":"399 - 418","editor":[{"full_name":"Majumdar, Rupak","first_name":"Rupak","last_name":"Majumdar"},{"full_name":"Kunčak, Viktor","last_name":"Kunčak","first_name":"Viktor"}],"publisher":"Springer","author":[{"last_name":"Trinh","first_name":"Minh","full_name":"Trinh, Minh"},{"full_name":"Chu, Duc Hiep","first_name":"Duc Hiep","last_name":"Chu","id":"3598E630-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jaffar","first_name":"Joxan","full_name":"Jaffar, Joxan"}],"scopus_import":"1","_id":"962","intvolume":"     10427","alternative_title":["LNCS"],"title":"Model counting for recursively-defined strings","date_created":"2018-12-11T11:49:26Z","article_processing_charge":"No","department":[{"_id":"ToHe"}],"publication_status":"published","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","type":"conference","date_published":"2017-01-01T00:00:00Z","publist_id":"6443","publication_identifier":{"issn":["03029743"]},"language":[{"iso":"eng"}],"conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","end_date":"2017-07-28","location":"Heidelberg, Germany"},"month":"01","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"None"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","relation":"later_version","id":"6005"}]},"file":[{"creator":"system","file_id":"5059","relation":"main_file","access_level":"open_access","file_name":"IST-2017-829-v1+1_mfcs-cr.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:48:18Z","file_size":369730,"checksum":"f55eaf7f3c36ea07801112acfedd17d5","date_created":"2018-12-12T10:14:10Z"}],"publist_id":"6438","oa":1,"publication_identifier":{"issn":["18688969"]},"date_published":"2017-06-01T00:00:00Z","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"location":"Aalborg, Denmark","end_date":"2017-08-25","start_date":"2017-08-21","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"language":[{"iso":"eng"}],"month":"06","article_number":"37","oa_version":"Published Version","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"has_accepted_license":"1","ddc":["004"],"volume":83,"abstract":[{"text":"Network games are widely used as a model for selfish resource-allocation problems. In the classical model, each player selects a path connecting her source and target vertex. The cost of traversing an edge depends on the number of players that traverse it. Thus, it abstracts the fact that different users may use a resource at different times and for different durations, which plays an important role in defining the costs of the users in reality. For example, when transmitting packets in a communication network, routing traffic in a road network, or processing a task in a production system, the traversal of the network involves an inherent delay, and so sharing and congestion of resources crucially depends on time. We study timed network games , which add a time component to network games. Each vertex v in the network is associated with a cost function, mapping the load on v to the price that a player pays for staying in v for one time unit with this load. In addition, each edge has a guard, describing time intervals in which the edge can be traversed, forcing the players to spend time on vertices. Unlike earlier work that add a time component to network games, the time in our model is continuous and cannot be discretized. In particular, players have uncountably many strategies, and a game may have uncountably many pure Nash equilibria. We study properties of timed network games with cost-sharing or congestion cost functions: their stability, equilibrium inefficiency, and complexity. In particular, we show that the answer to the question whether we can restrict attention to boundary strategies, namely ones in which edges are traversed only at the boundaries of guards, is mixed. ","lang":"eng"}],"doi":"10.4230/LIPIcs.MFCS.2017.37","day":"01","date_updated":"2023-02-23T12:35:50Z","citation":{"apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2017). Timed network games with clocks (Vol. 83). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.37\">https://doi.org/10.4230/LIPIcs.MFCS.2017.37</a>","ama":"Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.37\">10.4230/LIPIcs.MFCS.2017.37</a>","ieee":"G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Aalborg, Denmark, 2017, vol. 83.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.37\">https://doi.org/10.4230/LIPIcs.MFCS.2017.37</a>.","mla":"Avni, Guy, et al. <i>Timed Network Games with Clocks</i>. Vol. 83, 37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2017.37\">10.4230/LIPIcs.MFCS.2017.37</a>.","short":"G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ista":"Avni G, Guha S, Kupferman O. 2017. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 37."},"year":"2017","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:48:18Z","quality_controlled":"1","pubrep_id":"829","title":"Timed network games with clocks","alternative_title":["LIPIcs"],"intvolume":"        83","publication_status":"published","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:49:26Z","author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Shibashis","last_name":"Guha","full_name":"Guha, Shibashis"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"_id":"963","scopus_import":1},{"oa":1,"publication_identifier":{"eissn":["1089-7690"],"issn":["0021-9606"]},"type":"journal_article","date_published":"2017-09-14T00:00:00Z","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","main_file_link":[{"open_access":"1","url":"https://pure.qub.ac.uk/en/publications/the-gibbs-free-energy-of-homogeneous-nucleation-from-atomistic-nuclei-to-the-planar-limit(4599cdb4-dcc4-4522-8763-7b2a165ebf12).html"}],"article_number":"104707","month":"09","oa_version":"Submitted Version","publication":"The Journal of Chemical Physics","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In this paper we discuss how the information contained in atomistic simulations of homogeneous nucleation should be used when fitting the parameters in macroscopic nucleation models. We show how the number of solid and liquid atoms in such simulations can be determined unambiguously by using a Gibbs dividing surface and how the free energy as a function of the number of solid atoms in the nucleus can thus be extracted. We then show that the parameters (the chemical potential, the interfacial free energy, and a Tolman correction) of a model based on classical nucleation theory can be fitted using the information contained in these free-energy profiles but that the parameters in such models are highly correlated. This correlation is unfortunate as it ensures that small errors in the computed free energy surface can give rise to large errors in the extrapolated properties of the fitted model. To resolve this problem we thus propose a method for fitting macroscopic nucleation models that uses simulations of planar interfaces and simulations of three-dimensional nuclei in tandem. We show that when the chemical potentials and the interface energy are pinned to their planar-interface values, more precise estimates for the Tolman length are obtained. Extrapolating the free energy profile obtained from small simulation boxes to larger nuclei is thus more reliable."}],"day":"14","arxiv":1,"doi":"10.1063/1.4997180","external_id":{"pmid":["28915742"],"arxiv":["1703.06062"]},"citation":{"ieee":"B. Cheng, G. A. Tribello, and M. Ceriotti, “The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit,” <i>The Journal of Chemical Physics</i>, vol. 147, no. 10. AIP Publishing, 2017.","chicago":"Cheng, Bingqing, Gareth A. Tribello, and Michele Ceriotti. “The Gibbs Free Energy of Homogeneous Nucleation: From Atomistic Nuclei to the Planar Limit.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4997180\">https://doi.org/10.1063/1.4997180</a>.","apa":"Cheng, B., Tribello, G. A., &#38; Ceriotti, M. (2017). The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4997180\">https://doi.org/10.1063/1.4997180</a>","ama":"Cheng B, Tribello GA, Ceriotti M. The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit. <i>The Journal of Chemical Physics</i>. 2017;147(10). doi:<a href=\"https://doi.org/10.1063/1.4997180\">10.1063/1.4997180</a>","ista":"Cheng B, Tribello GA, Ceriotti M. 2017. The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit. The Journal of Chemical Physics. 147(10), 104707.","mla":"Cheng, Bingqing, et al. “The Gibbs Free Energy of Homogeneous Nucleation: From Atomistic Nuclei to the Planar Limit.” <i>The Journal of Chemical Physics</i>, vol. 147, no. 10, 104707, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4997180\">10.1063/1.4997180</a>.","short":"B. Cheng, G.A. Tribello, M. Ceriotti, The Journal of Chemical Physics 147 (2017)."},"year":"2017","date_updated":"2023-02-23T14:04:02Z","extern":"1","volume":147,"intvolume":"       147","title":"The Gibbs free energy of homogeneous nucleation: From atomistic nuclei to the planar limit","date_created":"2021-07-15T08:13:29Z","article_processing_charge":"No","publication_status":"published","issue":"10","author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","first_name":"Bingqing","full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632"},{"last_name":"Tribello","first_name":"Gareth A.","full_name":"Tribello, Gareth A."},{"last_name":"Ceriotti","first_name":"Michele","full_name":"Ceriotti, Michele"}],"scopus_import":"1","pmid":1,"_id":"9660","article_type":"original","publisher":"AIP Publishing","quality_controlled":"1"},{"quality_controlled":"1","publisher":"AIP Publishing","article_type":"original","_id":"9661","pmid":1,"scopus_import":"1","author":[{"id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","first_name":"Bingqing","full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632"},{"last_name":"Ceriotti","first_name":"Michele","full_name":"Ceriotti, Michele"}],"issue":"3","publication_status":"published","date_created":"2021-07-15T08:27:31Z","article_processing_charge":"No","title":"Bridging the gap between atomistic and macroscopic models of homogeneous nucleation","intvolume":"       146","volume":146,"extern":"1","date_updated":"2021-08-09T12:31:57Z","citation":{"ieee":"B. Cheng and M. Ceriotti, “Bridging the gap between atomistic and macroscopic models of homogeneous nucleation,” <i>The Journal of Chemical Physics</i>, vol. 146, no. 3. AIP Publishing, 2017.","chicago":"Cheng, Bingqing, and Michele Ceriotti. “Bridging the Gap between Atomistic and Macroscopic Models of Homogeneous Nucleation.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2017. <a href=\"https://doi.org/10.1063/1.4973883\">https://doi.org/10.1063/1.4973883</a>.","apa":"Cheng, B., &#38; Ceriotti, M. (2017). Bridging the gap between atomistic and macroscopic models of homogeneous nucleation. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/1.4973883\">https://doi.org/10.1063/1.4973883</a>","ama":"Cheng B, Ceriotti M. Bridging the gap between atomistic and macroscopic models of homogeneous nucleation. <i>The Journal of Chemical Physics</i>. 2017;146(3). doi:<a href=\"https://doi.org/10.1063/1.4973883\">10.1063/1.4973883</a>","ista":"Cheng B, Ceriotti M. 2017. Bridging the gap between atomistic and macroscopic models of homogeneous nucleation. The Journal of Chemical Physics. 146(3), 034106.","short":"B. Cheng, M. Ceriotti, The Journal of Chemical Physics 146 (2017).","mla":"Cheng, Bingqing, and Michele Ceriotti. “Bridging the Gap between Atomistic and Macroscopic Models of Homogeneous Nucleation.” <i>The Journal of Chemical Physics</i>, vol. 146, no. 3, 034106, AIP Publishing, 2017, doi:<a href=\"https://doi.org/10.1063/1.4973883\">10.1063/1.4973883</a>."},"year":"2017","external_id":{"pmid":["28109231"],"arxiv":["1610.01322"]},"arxiv":1,"doi":"10.1063/1.4973883","day":"21","abstract":[{"lang":"eng","text":"Macroscopic theories of nucleation such as classical nucleation theory envision that clusters of the bulk stable phase form inside the bulk metastable phase. Molecular dynamics simulations are often used to elucidate nucleation mechanisms, by capturing the microscopic configurations of all the atoms. In this paper, we introduce a thermodynamic model that links macroscopic theories and atomic-scale simulations and thus provide a simple and elegant framework for testing the limits of classical nucleation theory."}],"language":[{"iso":"eng"}],"publication":"The Journal of Chemical Physics","oa_version":"Preprint","month":"01","article_number":"034106","main_file_link":[{"url":"https://arxiv.org/abs/1610.01322","open_access":"1"}],"status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_published":"2017-01-21T00:00:00Z","type":"journal_article","publication_identifier":{"eissn":["1089-7690"],"issn":["0021-9606"]},"oa":1},{"language":[{"iso":"eng"}],"conference":{"start_date":"2017-08-06","name":"ICML: International Conference on Machine Learning","end_date":"2017-08-11","location":"Sydney, Australia"},"has_accepted_license":"1","publication":"34th International Conference on Machine Learning","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","month":"08","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1612.08185"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","type":"conference","date_published":"2017-08-01T00:00:00Z","publication_identifier":{"isbn":["978-151085514-4"]},"oa":1,"publist_id":"6398","quality_controlled":"1","ec_funded":1,"page":"1905 - 1914","publisher":"JMLR","scopus_import":"1","_id":"1000","author":[{"full_name":"Kolesnikov, Alexander","first_name":"Alexander","last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph"}],"department":[{"_id":"ChLa"}],"date_created":"2018-12-11T11:49:37Z","article_processing_charge":"No","publication_status":"published","intvolume":"        70","title":"PixelCNN models with auxiliary variables for natural image modeling","acknowledgement":"We thank Tim Salimans for spotting a mistake in our preliminary arXiv manuscript. This work was funded by the European Research Council under the European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.","volume":70,"year":"2017","citation":{"mla":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” <i>34th International Conference on Machine Learning</i>, vol. 70, JMLR, 2017, pp. 1905–14.","short":"A. Kolesnikov, C. Lampert, in:, 34th International Conference on Machine Learning, JMLR, 2017, pp. 1905–1914.","ista":"Kolesnikov A, Lampert C. 2017. PixelCNN models with auxiliary variables for natural image modeling. 34th International Conference on Machine Learning. ICML: International Conference on Machine Learning vol. 70, 1905–1914.","apa":"Kolesnikov, A., &#38; Lampert, C. (2017). PixelCNN models with auxiliary variables for natural image modeling. In <i>34th International Conference on Machine Learning</i> (Vol. 70, pp. 1905–1914). Sydney, Australia: JMLR.","ama":"Kolesnikov A, Lampert C. PixelCNN models with auxiliary variables for natural image modeling. In: <i>34th International Conference on Machine Learning</i>. Vol 70. JMLR; 2017:1905-1914.","ieee":"A. Kolesnikov and C. Lampert, “PixelCNN models with auxiliary variables for natural image modeling,” in <i>34th International Conference on Machine Learning</i>, Sydney, Australia, 2017, vol. 70, pp. 1905–1914.","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “PixelCNN Models with Auxiliary Variables for Natural Image Modeling.” In <i>34th International Conference on Machine Learning</i>, 70:1905–14. JMLR, 2017."},"date_updated":"2023-09-22T09:50:41Z","external_id":{"isi":["000683309501102"],"arxiv":["1612.08185"]},"isi":1,"day":"01","arxiv":1,"abstract":[{"text":"We study probabilistic models of natural images and extend the autoregressive family of PixelCNN models by incorporating latent variables. Subsequently, we describe two new generative image models that exploit different image transformations as latent variables: a quantized grayscale view of the image or a multi-resolution image pyramid. The proposed models tackle two known shortcomings of existing PixelCNN models: 1) their tendency to focus on low-level image details, while largely ignoring high-level image information, such as object shapes, and 2) their computationally costly procedure for image sampling. We experimentally demonstrate benefits of our LatentPixelCNN models, in particular showing that they produce much more realistically looking image samples than previous state-of-the-art probabilistic models. ","lang":"eng"}]},{"abstract":[{"lang":"eng","text":"We present a computational approach for designing CurveUps, curvy shells that form from an initially flat state. They consist of small rigid tiles that are tightly held together by two pre-stretched elastic sheets attached to them. Our method allows the realization of smooth, doubly curved surfaces that can be fabricated as a flat piece. Once released, the restoring forces of the pre-stretched sheets support the object to take shape in 3D. CurveUps are structurally stable in their target configuration. The design process starts with a target surface. Our method generates a tile layout in 2D and optimizes the distribution, shape, and attachment areas of the tiles to obtain a configuration that is fabricable and in which the curved up state closely matches the target. Our approach is based on an efficient approximate model and a local optimization strategy for an otherwise intractable nonlinear optimization problem. We demonstrate the effectiveness of our approach for a wide range of shapes, all realized as physical prototypes."}],"doi":"10.1145/3072959.3073709","day":"01","isi":1,"external_id":{"isi":["000406432100032"]},"date_updated":"2023-09-22T09:49:58Z","year":"2017","citation":{"ista":"Guseinov R, Miguel E, Bickel B. 2017. CurveUps: Shaping objects from flat plates with tension-actuated curvature. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 64.","short":"R. Guseinov, E. Miguel, B. Bickel, in:, ACM, 2017.","mla":"Guseinov, Ruslan, et al. <i>CurveUps: Shaping Objects from Flat Plates with Tension-Actuated Curvature</i>. Vol. 36, no. 4, 64, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073709\">10.1145/3072959.3073709</a>.","chicago":"Guseinov, Ruslan, Eder Miguel, and Bernd Bickel. “CurveUps: Shaping Objects from Flat Plates with Tension-Actuated Curvature,” Vol. 36. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073709\">https://doi.org/10.1145/3072959.3073709</a>.","ieee":"R. Guseinov, E. Miguel, and B. Bickel, “CurveUps: Shaping objects from flat plates with tension-actuated curvature,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2017, vol. 36, no. 4.","ama":"Guseinov R, Miguel E, Bickel B. CurveUps: Shaping objects from flat plates with tension-actuated curvature. In: Vol 36. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3072959.3073709\">10.1145/3072959.3073709</a>","apa":"Guseinov, R., Miguel, E., &#38; Bickel, B. (2017). CurveUps: Shaping objects from flat plates with tension-actuated curvature (Vol. 36). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3072959.3073709\">https://doi.org/10.1145/3072959.3073709</a>"},"ddc":["003","004"],"volume":36,"pubrep_id":"1053","alternative_title":["ACM Transactions on Graphics"],"title":"CurveUps: Shaping objects from flat plates with tension-actuated curvature","intvolume":"        36","publication_status":"published","date_created":"2018-12-11T11:49:38Z","article_processing_charge":"No","department":[{"_id":"BeBi"}],"author":[{"first_name":"Ruslan","last_name":"Guseinov","orcid":"0000-0001-9819-5077","full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Miguel, Eder","first_name":"Eder","last_name":"Miguel"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"issue":"4","_id":"1001","publisher":"ACM","file_date_updated":"2018-12-12T10:10:24Z","ec_funded":1,"quality_controlled":"1","oa":1,"publist_id":"6397","date_published":"2017-01-01T00:00:00Z","type":"conference","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"status":"public","id":"8366","relation":"dissertation_contains"}]},"status":"public","file":[{"relation":"main_file","access_level":"open_access","creator":"system","file_id":"4811","file_size":36159696,"date_created":"2018-12-12T10:10:24Z","content_type":"application/pdf","file_name":"IST-2018-1053-v1+1_CurveUp.pdf","date_updated":"2018-12-12T10:10:24Z"}],"month":"01","article_number":"64","oa_version":"Submitted Version","project":[{"call_identifier":"H2020","_id":"25082902-B435-11E9-9278-68D0E5697425","grant_number":"645599","name":"Soft-bodied intelligence for Manipulation"},{"grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"has_accepted_license":"1","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","start_date":"2017-08-19","location":"Los Angeles, CA, United States","end_date":"2017-08-25"},"language":[{"iso":"eng"}]},{"volume":36,"ddc":["003","004"],"date_updated":"2023-09-22T09:49:31Z","year":"2017","citation":{"ieee":"R. Zhang, T. Auzinger, D. Ceylan, W. Li, and B. Bickel, “Functionality-aware retargeting of mechanisms to 3D shapes,” presented at the SIGGRAPH: Computer Graphics and Interactive Techniques, Los Angeles, CA, United States , 2017, vol. 36, no. 4.","chicago":"Zhang, Ran, Thomas Auzinger, Duygu Ceylan, Wilmot Li, and Bernd Bickel. “Functionality-Aware Retargeting of Mechanisms to 3D Shapes,” Vol. 36. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073710\">https://doi.org/10.1145/3072959.3073710</a>.","apa":"Zhang, R., Auzinger, T., Ceylan, D., Li, W., &#38; Bickel, B. (2017). Functionality-aware retargeting of mechanisms to 3D shapes (Vol. 36). Presented at the SIGGRAPH: Computer Graphics and Interactive Techniques, Los Angeles, CA, United States : ACM. <a href=\"https://doi.org/10.1145/3072959.3073710\">https://doi.org/10.1145/3072959.3073710</a>","ama":"Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. Functionality-aware retargeting of mechanisms to 3D shapes. In: Vol 36. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3072959.3073710\">10.1145/3072959.3073710</a>","ista":"Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. 2017. Functionality-aware retargeting of mechanisms to 3D shapes. SIGGRAPH: Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 81.","short":"R. Zhang, T. Auzinger, D. Ceylan, W. Li, B. Bickel, in:, ACM, 2017.","mla":"Zhang, Ran, et al. <i>Functionality-Aware Retargeting of Mechanisms to 3D Shapes</i>. Vol. 36, no. 4, 81, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073710\">10.1145/3072959.3073710</a>."},"isi":1,"external_id":{"isi":["000406432100049"]},"doi":"10.1145/3072959.3073710","day":"01","abstract":[{"text":"  We present an interactive design system to create functional mechanical  objects. Our computational approach allows novice users to retarget an  existing mechanical template to a user-specified input shape. Our proposed  representation for a mechanical template encodes a parameterized mechanism,  mechanical constraints that ensure a physically valid configuration, spatial relationships of mechanical parts to the user-provided shape, and functional constraints that specify an intended functionality. We provide an intuitive interface and optimization-in-the-loop approach for finding a valid  configuration of the mechanism and the shape to ensure that higher-level  functional goals are met. Our algorithm interactively optimizes the mechanism  while the user manipulates the placement of mechanical components and the shape. Our system allows users to efficiently explore various design choices and to synthesize customized mechanical objects that can be fabricated with rapid prototyping technologies. We demonstrate the efficacy of our approach by retargeting various mechanical templates to different shapes and fabricating the resulting functional mechanical objects.\r\n","lang":"eng"}],"quality_controlled":"1","ec_funded":1,"file_date_updated":"2018-12-12T10:09:05Z","publisher":"ACM","_id":"1002","scopus_import":"1","author":[{"id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran","first_name":"Ran","last_name":"Zhang"},{"first_name":"Thomas","last_name":"Auzinger","orcid":"0000-0002-1546-3265","full_name":"Auzinger, Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Duygu","last_name":"Ceylan","full_name":"Ceylan, Duygu"},{"full_name":"Li, Wilmot","last_name":"Li","first_name":"Wilmot"},{"orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"issue":"4","publication_status":"published","department":[{"_id":"BeBi"}],"date_created":"2018-12-11T11:49:38Z","article_processing_charge":"No","pubrep_id":"1050","title":"Functionality-aware retargeting of mechanisms to 3D shapes","alternative_title":["ACM Transactions on Graphics"],"intvolume":"        36","file":[{"access_level":"open_access","relation":"main_file","file_id":"4728","creator":"system","date_created":"2018-12-12T10:09:05Z","file_size":25463895,"date_updated":"2018-12-12T10:09:05Z","file_name":"IST-2018-1050-v1+1_MechRet.pdf","content_type":"application/pdf"}],"status":"public","related_material":{"record":[{"status":"public","id":"8386","relation":"dissertation_contains"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2017-06-01T00:00:00Z","type":"conference","publication_identifier":{"issn":["07300301"]},"oa":1,"publist_id":"6396","language":[{"iso":"eng"}],"conference":{"end_date":"2017-08-03","location":"Los Angeles, CA, United States ","start_date":"2017-07-30","name":"SIGGRAPH: Computer Graphics and Interactive Techniques"},"has_accepted_license":"1","oa_version":"Submitted Version","project":[{"grant_number":"642841","name":"Distributed 3D Object Design","_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"month":"06","article_number":"81"},{"publisher":"AAAI Press","quality_controlled":"1","page":"70 - 76","file_date_updated":"2018-12-12T10:16:58Z","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:49:38Z","article_processing_charge":"No","publication_status":"published","pubrep_id":"818","title":"An abstraction-refinement methodology for reasoning about network games","scopus_import":"1","_id":"1003","author":[{"last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Guha","first_name":"Shibashis","full_name":"Guha, Shibashis"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"ddc":["004"],"day":"30","doi":"10.24963/ijcai.2017/11","abstract":[{"text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an overapproximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. Our experimental results demonstrate the efficiency of the methodology.","lang":"eng"}],"citation":{"ista":"Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology for reasoning about network games. IJCAI: International Joint Conference on Artificial Intelligence , 70–76.","short":"G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.","mla":"Avni, Guy, et al. <i>An Abstraction-Refinement Methodology for Reasoning about Network Games</i>. AAAI Press, 2017, pp. 70–76, doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games,” 70–76. AAAI Press, 2017. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>.","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. In: AAAI Press; 2017:70-76. doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>"},"year":"2017","date_updated":"2023-09-22T09:49:00Z","external_id":{"isi":["000764137500011"]},"isi":1,"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence ","start_date":"2017-08-19","end_date":"2017-08-25","location":"Melbourne, Australia"},"language":[{"iso":"eng"}],"project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Submitted Version","month":"05","has_accepted_license":"1","file":[{"date_created":"2018-12-12T10:16:58Z","file_size":365172,"date_updated":"2018-12-12T10:16:58Z","file_name":"IST-2017-818-v1+1_allIJCAI_CR.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5249","creator":"system"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"id":"6006","relation":"later_version","status":"public"}]},"publication_identifier":{"issn":["10450823"]},"oa":1,"publist_id":"6395","type":"conference","date_published":"2017-05-30T00:00:00Z"},{"oa":1,"publist_id":"6394","publication_identifier":{"issn":["0959437X"]},"type":"journal_article","date_published":"2017-08-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","file":[{"content_type":"application/pdf","file_name":"Otvos_Benkova_CurOpDevBiol_2017.pdf","date_updated":"2019-04-17T08:00:36Z","file_size":364133,"date_created":"2019-04-17T08:00:36Z","creator":"dernst","file_id":"6336","relation":"main_file","success":1,"access_level":"open_access"}],"month":"08","project":[{"call_identifier":"FWF","_id":"2542D156-B435-11E9-9278-68D0E5697425","grant_number":"I 1774-B16","name":"Hormone cross-talk drives nutrient dependent plant development"}],"oa_version":"Submitted Version","has_accepted_license":"1","publication":"Current Opinion in Genetics & Development","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The fundamental tasks of the root system are, besides anchoring, mediating interactions between plant and soil and providing the plant with water and nutrients. The architecture of the root system is controlled by endogenous mechanisms that constantly integrate environmental signals, such as availability of nutrients and water. Extremely important for efficient soil exploitation and survival under less favorable conditions is the developmental flexibility of the root system that is largely determined by its postembryonic branching capacity. Modulation of initiation and outgrowth of lateral roots provides roots with an exceptional plasticity, allows optimal adjustment to underground heterogeneity, and enables effective soil exploitation and use of resources. Here we discuss recent advances in understanding the molecular mechanisms that shape the plant root system and integrate external cues to adapt to the changing environment."}],"day":"01","doi":"10.1016/j.gde.2017.03.010","external_id":{"isi":["000404880400013"],"pmid":["28391060"]},"isi":1,"citation":{"ista":"Ötvös K, Benková E. 2017. Spatiotemporal mechanisms of root branching. Current Opinion in Genetics &#38; Development. 45, 82–89.","short":"K. Ötvös, E. Benková, Current Opinion in Genetics &#38; Development 45 (2017) 82–89.","mla":"Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.” <i>Current Opinion in Genetics &#38; Development</i>, vol. 45, Elsevier, 2017, pp. 82–89, doi:<a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">10.1016/j.gde.2017.03.010</a>.","chicago":"Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.” <i>Current Opinion in Genetics &#38; Development</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">https://doi.org/10.1016/j.gde.2017.03.010</a>.","ieee":"K. Ötvös and E. Benková, “Spatiotemporal mechanisms of root branching,” <i>Current Opinion in Genetics &#38; Development</i>, vol. 45. Elsevier, pp. 82–89, 2017.","ama":"Ötvös K, Benková E. Spatiotemporal mechanisms of root branching. <i>Current Opinion in Genetics &#38; Development</i>. 2017;45:82-89. doi:<a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">10.1016/j.gde.2017.03.010</a>","apa":"Ötvös, K., &#38; Benková, E. (2017). Spatiotemporal mechanisms of root branching. <i>Current Opinion in Genetics &#38; Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">https://doi.org/10.1016/j.gde.2017.03.010</a>"},"year":"2017","date_updated":"2023-09-22T09:48:15Z","ddc":["575"],"volume":45,"intvolume":"        45","title":"Spatiotemporal mechanisms of root branching","pubrep_id":"1017","department":[{"_id":"EvBe"}],"date_created":"2018-12-11T11:49:38Z","article_processing_charge":"No","publication_status":"published","author":[{"first_name":"Krisztina","last_name":"Ötvös","orcid":"0000-0002-5503-4983","full_name":"Ötvös, Krisztina","id":"29B901B0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Eva","last_name":"Benková","orcid":"0000-0002-8510-9739","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","pmid":1,"_id":"1004","publisher":"Elsevier","file_date_updated":"2019-04-17T08:00:36Z","quality_controlled":"1","page":"82 - 89"},{"file":[{"file_id":"5236","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2018-12-12T10:16:46Z","content_type":"application/pdf","file_name":"IST-2017-814-v1+1_s12864-017-3705-7.pdf","date_created":"2018-12-12T10:16:46Z","file_size":2379672}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"status":"public","relation":"research_data","id":"9859"},{"id":"9860","relation":"research_data","status":"public"}]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2017-04-26T00:00:00Z","type":"journal_article","publication_identifier":{"issn":["14712164"]},"oa":1,"publist_id":"6392","language":[{"iso":"eng"}],"publication":"BMC Genomics","has_accepted_license":"1","oa_version":"Published Version","month":"04","volume":18,"ddc":["570"],"date_updated":"2023-09-22T09:47:44Z","year":"2017","citation":{"ista":"Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg H, Kurtz J. 2017. Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. BMC Genomics. 18(1), 329.","mla":"Greenwood, Jenny, et al. “Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” <i>BMC Genomics</i>, vol. 18, no. 1, BioMed Central, 2017, p. 329, doi:<a href=\"https://doi.org/10.1186/s12864-017-3705-7\">10.1186/s12864-017-3705-7</a>.","short":"J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel, H. Schulenburg, J. Kurtz, BMC Genomics 18 (2017) 329.","ieee":"J. Greenwood <i>et al.</i>, “Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae,” <i>BMC Genomics</i>, vol. 18, no. 1. BioMed Central, p. 329, 2017.","chicago":"Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” <i>BMC Genomics</i>. BioMed Central, 2017. <a href=\"https://doi.org/10.1186/s12864-017-3705-7\">https://doi.org/10.1186/s12864-017-3705-7</a>.","ama":"Greenwood J, Milutinovic B, Peuß R, et al. Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. <i>BMC Genomics</i>. 2017;18(1):329. doi:<a href=\"https://doi.org/10.1186/s12864-017-3705-7\">10.1186/s12864-017-3705-7</a>","apa":"Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel, P., … Kurtz, J. (2017). Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s12864-017-3705-7\">https://doi.org/10.1186/s12864-017-3705-7</a>"},"isi":1,"external_id":{"isi":["000400625200004"]},"doi":"10.1186/s12864-017-3705-7","day":"26","abstract":[{"text":"Background: The phenomenon of immune priming, i.e. enhanced protection following a secondary exposure to a pathogen, has now been demonstrated in a wide range of invertebrate species. Despite accumulating phenotypic evidence, knowledge of its mechanistic underpinnings is currently very limited. Here we used the system of the red flour beetle, Tribolium castaneum and the insect pathogen Bacillus thuringiensis (Bt) to further our molecular understanding of the oral immune priming phenomenon. We addressed how ingestion of bacterial cues (derived from spore supernatants) of an orally pathogenic and non-pathogenic Bt strain affects gene expression upon later challenge exposure, using a whole-transcriptome sequencing approach. Results: Whereas gene expression of individuals primed with the orally non-pathogenic strain showed minor changes to controls, we found that priming with the pathogenic strain induced regulation of a large set of distinct genes, many of which are known immune candidates. Intriguingly, the immune repertoire activated upon priming and subsequent challenge qualitatively differed from the one mounted upon infection with Bt without previous priming. Moreover, a large subset of priming-specific genes showed an inverse regulation compared to their regulation upon challenge only. Conclusions: Our data demonstrate that gene expression upon infection is strongly affected by previous immune priming. We hypothesise that this shift in gene expression indicates activation of a more targeted and efficient response towards a previously encountered pathogen, in anticipation of potential secondary encounter.","lang":"eng"}],"page":"329","quality_controlled":"1","file_date_updated":"2018-12-12T10:16:46Z","publisher":"BioMed Central","_id":"1006","scopus_import":"1","author":[{"last_name":"Greenwood","first_name":"Jenny","full_name":"Greenwood, Jenny"},{"id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","full_name":"Milutinovic, Barbara","orcid":"0000-0002-8214-4758","last_name":"Milutinovic","first_name":"Barbara"},{"full_name":"Peuß, Robert","first_name":"Robert","last_name":"Peuß"},{"last_name":"Behrens","first_name":"Sarah","full_name":"Behrens, Sarah"},{"full_name":"Essar, Daniela","last_name":"Essar","first_name":"Daniela"},{"full_name":"Rosenstiel, Philip","first_name":"Philip","last_name":"Rosenstiel"},{"full_name":"Schulenburg, Hinrich","first_name":"Hinrich","last_name":"Schulenburg"},{"full_name":"Kurtz, Joachim","last_name":"Kurtz","first_name":"Joachim"}],"issue":"1","publication_status":"published","date_created":"2018-12-11T11:49:39Z","department":[{"_id":"SyCr"}],"article_processing_charge":"No","title":"Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae","pubrep_id":"814","intvolume":"        18"},{"publication_identifier":{"issn":["0005-1098"]},"oa":1,"publist_id":"6391","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"journal_article","date_published":"2017-06-01T00:00:00Z","file":[{"date_created":"2018-12-12T10:11:29Z","file_size":1401954,"date_updated":"2018-12-12T10:11:29Z","content_type":"application/pdf","file_name":"IST-2017-813-v1+1_ZerosOfNonlinearSystems.pdf","relation":"main_file","access_level":"open_access","file_id":"4884","creator":"system"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"oa_version":"Published Version","month":"06","has_accepted_license":"1","publication":"Automatica","language":[{"iso":"eng"}],"day":"01","doi":"10.1016/j.automatica.2017.03.030","abstract":[{"lang":"eng","text":"A nonlinear system possesses an invariance with respect to a set of transformations if its output dynamics remain invariant when transforming the input, and adjusting the initial condition accordingly. Most research has focused on invariances with respect to time-independent pointwise transformations like translational-invariance (u(t) -&gt; u(t) + p, p in R) or scale-invariance (u(t) -&gt; pu(t), p in R&gt;0). In this article, we introduce the concept of s0-invariances with respect to continuous input transformations exponentially growing/decaying over time. We show that s0-invariant systems not only encompass linear time-invariant (LTI) systems with transfer functions having an irreducible zero at s0 in R, but also that the input/output relationship of nonlinear s0-invariant systems possesses properties well known from their linear counterparts. Furthermore, we extend the concept of s0-invariances to second- and higher-order s0-invariances, corresponding to invariances with respect to transformations of the time-derivatives of the input, and encompassing LTI systems with zeros of multiplicity two or higher. Finally, we show that nth-order 0-invariant systems realize – under mild conditions – nth-order nonlinear differential operators: when excited by an input of a characteristic functional form, the system’s output converges to a constant value only depending on the nth (nonlinear) derivative of the input."}],"citation":{"ama":"Lang M, Sontag E. Zeros of nonlinear systems with input invariances. <i>Automatica</i>. 2017;81C:46-55. doi:<a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">10.1016/j.automatica.2017.03.030</a>","apa":"Lang, M., &#38; Sontag, E. (2017). Zeros of nonlinear systems with input invariances. <i>Automatica</i>. International Federation of Automatic Control. <a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">https://doi.org/10.1016/j.automatica.2017.03.030</a>","chicago":"Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.” <i>Automatica</i>. International Federation of Automatic Control, 2017. <a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">https://doi.org/10.1016/j.automatica.2017.03.030</a>.","ieee":"M. Lang and E. Sontag, “Zeros of nonlinear systems with input invariances,” <i>Automatica</i>, vol. 81C. International Federation of Automatic Control, pp. 46–55, 2017.","short":"M. Lang, E. Sontag, Automatica 81C (2017) 46–55.","mla":"Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.” <i>Automatica</i>, vol. 81C, International Federation of Automatic Control, 2017, pp. 46–55, doi:<a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">10.1016/j.automatica.2017.03.030</a>.","ista":"Lang M, Sontag E. 2017. Zeros of nonlinear systems with input invariances. Automatica. 81C, 46–55."},"year":"2017","date_updated":"2023-10-17T08:51:18Z","external_id":{"isi":["000403513900006"]},"isi":1,"volume":"81C","ddc":["000"],"article_processing_charge":"Yes (in subscription journal)","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"date_created":"2018-12-11T11:49:39Z","publication_status":"published","pubrep_id":"813","title":"Zeros of nonlinear systems with input invariances","scopus_import":"1","_id":"1007","author":[{"first_name":"Moritz","last_name":"Lang","full_name":"Lang, Moritz","id":"29E0800A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sontag, Eduardo","first_name":"Eduardo","last_name":"Sontag"}],"publisher":"International Federation of Automatic Control","ec_funded":1,"quality_controlled":"1","page":"46 - 55","file_date_updated":"2018-12-12T10:11:29Z"},{"conference":{"location":"San Francisco, CA, United States","end_date":"2017-02-10","name":"AAAI: Conference on Artificial Intelligence","start_date":"2017-02-04"},"language":[{"iso":"eng"}],"oa_version":"Submitted Version","project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"month":"01","publication":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","main_file_link":[{"url":"http://www.aaai.org/ocs/index.php/AAAI/AAAI17/paper/download/14354/14092","open_access":"1"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","publist_id":"6387","oa":1,"date_published":"2017-01-01T00:00:00Z","type":"conference","publisher":"AAAI Press","page":"3725 - 3732","quality_controlled":"1","ec_funded":1,"publication_status":"published","article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T11:49:40Z","title":"Optimizing expectation with guarantees in POMDPs","intvolume":"         5","_id":"1009","scopus_import":"1","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr"},{"first_name":"Guillermo","last_name":"Pérez","full_name":"Pérez, Guillermo"},{"first_name":"Jean","last_name":"Raskin","full_name":"Raskin, Jean"},{"full_name":"Zikelic, Djordje","first_name":"Djordje","last_name":"Zikelic"}],"acknowledgement":"he research leading to these results was supported by the Austrian Science Fund (FWF) NFN Grant no. S11407-N23 (RiSE/SHiNE); two ERC Starting grants (279307: Graph Games, 279499: inVEST); the Vienna Science and Tech- nology Fund (WWTF) through project ICT15-003; and the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734].","volume":5,"day":"01","abstract":[{"text":"A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Recently, there has been a surge of interest in POMDPs where the goal is to maximize the probability to ensure that the payoff is at least a given threshold, but these approaches do not consider any optimization beyond satisfying this threshold constraint. In this work we go beyond both the “expectation” and “threshold” approaches and consider a “guaranteed payoff optimization (GPO)” problem for POMDPs, where we are given a threshold t and the objective is to find a policy σ such that a) each possible outcome of σ yields a discounted-sum payoff of at least t, and b) the expected discounted-sum payoff of σ is optimal (or near-optimal) among all policies satisfying a). We present a practical approach to tackle the GPO problem and evaluate it on standard POMDP benchmarks.","lang":"eng"}],"date_updated":"2025-06-02T08:53:49Z","year":"2017","citation":{"short":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.","mla":"Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, vol. 5, AAAI Press, 2017, pp. 3725–32.","ista":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.","ama":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation with guarantees in POMDPs. In: <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>. Vol 5. AAAI Press; 2017:3725-3732.","apa":"Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., &#38; Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i> (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.","chicago":"Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, 5:3725–32. AAAI Press, 2017.","ieee":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732."},"isi":1,"external_id":{"isi":["000485630703107"]}},{"ddc":["510","539"],"volume":22,"abstract":[{"text":"We prove a local law in the bulk of the spectrum for random Gram matrices XX∗, a generalization of sample covariance matrices, where X is a large matrix with independent, centered entries with arbitrary variances. The limiting eigenvalue density that generalizes the Marchenko-Pastur law is determined by solving a system of nonlinear equations. Our entrywise and averaged local laws are on the optimal scale with the optimal error bounds. They hold both in the square case (hard edge) and in the properly rectangular case (soft edge). In the latter case we also establish a macroscopic gap away from zero in the spectrum of XX∗. ","lang":"eng"}],"day":"08","arxiv":1,"doi":"10.1214/17-EJP42","external_id":{"arxiv":["1606.07353"],"isi":["000396611900025"]},"isi":1,"citation":{"ama":"Alt J, Erdös L, Krüger TH. Local law for random Gram matrices. <i>Electronic Journal of Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-EJP42\">10.1214/17-EJP42</a>","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (2017). Local law for random Gram matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-EJP42\">https://doi.org/10.1214/17-EJP42</a>","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “Local Law for Random Gram Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-EJP42\">https://doi.org/10.1214/17-EJP42</a>.","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “Local law for random Gram matrices,” <i>Electronic Journal of Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017.","mla":"Alt, Johannes, et al. “Local Law for Random Gram Matrices.” <i>Electronic Journal of Probability</i>, vol. 22, 25, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-EJP42\">10.1214/17-EJP42</a>.","short":"J. Alt, L. Erdös, T.H. Krüger, Electronic Journal of Probability 22 (2017).","ista":"Alt J, Erdös L, Krüger TH. 2017. Local law for random Gram matrices. Electronic Journal of Probability. 22, 25."},"year":"2017","date_updated":"2023-09-22T09:45:23Z","publisher":"Institute of Mathematical Statistics","file_date_updated":"2018-12-12T10:13:39Z","ec_funded":1,"quality_controlled":"1","intvolume":"        22","title":"Local law for random Gram matrices","pubrep_id":"807","date_created":"2018-12-11T11:49:40Z","department":[{"_id":"LaEr"}],"article_processing_charge":"No","publication_status":"published","author":[{"first_name":"Johannes","last_name":"Alt","full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H","first_name":"Torben H","last_name":"Krüger"}],"scopus_import":"1","_id":"1010","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"id":"149","relation":"dissertation_contains","status":"public"}]},"file":[{"date_created":"2018-12-12T10:13:39Z","file_size":639384,"date_updated":"2018-12-12T10:13:39Z","file_name":"IST-2017-807-v1+1_euclid.ejp.1488942016.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5024","creator":"system"}],"oa":1,"publist_id":"6386","publication_identifier":{"issn":["10836489"]},"type":"journal_article","date_published":"2017-03-08T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"language":[{"iso":"eng"}],"article_number":"25","month":"03","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"oa_version":"Published Version","has_accepted_license":"1","publication":"Electronic Journal of Probability"},{"publication_identifier":{"issn":["03029743"]},"oa":1,"publist_id":"6384","date_published":"2017-03-19T00:00:00Z","type":"conference","main_file_link":[{"url":"https://arxiv.org/abs/1701.04914","open_access":"1"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"month":"03","conference":{"end_date":"2017-04-29","location":"Uppsala, Sweden","start_date":"2017-04-22","name":"ESOP: European Symposium on Programming"},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-54434-1_11","day":"19","abstract":[{"text":"Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the bestknown complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project.","lang":"eng"}],"date_updated":"2023-09-22T09:44:50Z","year":"2017","citation":{"ama":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>","apa":"Chatterjee, K., Kragl, B., Mishra, S., &#38; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>","chicago":"Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>.","ieee":"K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.","short":"K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Weighted Recursive State Machines</i>. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>.","ista":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313."},"isi":1,"external_id":{"isi":["000681702400011"]},"volume":10201,"publication_status":"published","date_created":"2018-12-11T11:49:41Z","article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Faster algorithms for weighted recursive state machines","alternative_title":["LNCS"],"intvolume":"     10201","_id":"1011","scopus_import":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","first_name":"Bernhard","full_name":"Kragl, Bernhard","orcid":"0000-0001-7745-9117"},{"first_name":"Samarth","last_name":"Mishra","full_name":"Mishra, Samarth"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis"}],"publisher":"Springer","editor":[{"first_name":"Hongseok","last_name":"Yang","full_name":"Yang, Hongseok"}],"page":"287 - 313","ec_funded":1,"quality_controlled":"1"}]