[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"James P.","last_name":"Sethna","full_name":"Sethna, James P."},{"last_name":"Bierbaum","first_name":"Matthew K.","full_name":"Bierbaum, Matthew K."},{"full_name":"Dahmen, Karin A.","first_name":"Karin A.","last_name":"Dahmen"},{"full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074","last_name":"Goodrich","first_name":"Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425"},{"full_name":"Greer, Julia R.","first_name":"Julia R.","last_name":"Greer"},{"last_name":"Hayden","first_name":"Lorien X.","full_name":"Hayden, Lorien X."},{"full_name":"Kent-Dobias, Jaron P.","first_name":"Jaron P.","last_name":"Kent-Dobias"},{"last_name":"Lee","first_name":"Edward D.","full_name":"Lee, Edward D."},{"last_name":"Liarte","first_name":"Danilo B.","full_name":"Liarte, Danilo B."},{"first_name":"Xiaoyue","last_name":"Ni","full_name":"Ni, Xiaoyue"},{"last_name":"Quinn","first_name":"Katherine N.","full_name":"Quinn, Katherine N."},{"full_name":"Raju, Archishman","last_name":"Raju","first_name":"Archishman"},{"full_name":"Rocklin, D. Zeb","first_name":"D. Zeb","last_name":"Rocklin"},{"full_name":"Shekhawat, Ashivni","last_name":"Shekhawat","first_name":"Ashivni"},{"last_name":"Zapperi","first_name":"Stefano","full_name":"Zapperi, Stefano"}],"oa":1,"title":"Deformation of crystals: Connections with statistical physics","date_updated":"2021-01-12T08:15:18Z","publisher":"Annual Reviews","date_published":"2017-07-01T00:00:00Z","month":"07","intvolume":" 47","article_type":"original","year":"2017","language":[{"iso":"eng"}],"page":"217-246","article_processing_charge":"No","quality_controlled":"1","day":"01","status":"public","_id":"7755","date_created":"2020-04-30T11:38:24Z","abstract":[{"lang":"eng","text":"We give a bird's-eye view of the plastic deformation of crystals aimed at the statistical physics community, as well as a broad introduction to the statistical theories of forced rigid systems aimed at the plasticity community. Memory effects in magnets, spin glasses, charge density waves, and dilute colloidal suspensions are discussed in relation to the onset of plastic yielding in crystals. Dislocation avalanches and complex dislocation tangles are discussed via a brief introduction to the renormalization group and scaling. Analogies to emergent scale invariance in fracture, jamming, coarsening, and a variety of depinning transitions are explored. Dislocation dynamics in crystals challenge nonequilibrium statistical physics. Statistical physics provides both cautionary tales of subtle memory effects in nonequilibrium systems and systematic tools designed to address complex scale-invariant behavior on multiple length scales and timescales."}],"type":"journal_article","volume":47,"citation":{"short":"J.P. Sethna, M.K. Bierbaum, K.A. Dahmen, C.P. Goodrich, J.R. Greer, L.X. Hayden, J.P. Kent-Dobias, E.D. Lee, D.B. Liarte, X. Ni, K.N. Quinn, A. Raju, D.Z. Rocklin, A. Shekhawat, S. Zapperi, Annual Review of Materials Research 47 (2017) 217–246.","ista":"Sethna JP, Bierbaum MK, Dahmen KA, Goodrich CP, Greer JR, Hayden LX, Kent-Dobias JP, Lee ED, Liarte DB, Ni X, Quinn KN, Raju A, Rocklin DZ, Shekhawat A, Zapperi S. 2017. Deformation of crystals: Connections with statistical physics. Annual Review of Materials Research. 47, 217–246.","ieee":"J. P. Sethna et al., “Deformation of crystals: Connections with statistical physics,” Annual Review of Materials Research, vol. 47. Annual Reviews, pp. 217–246, 2017.","ama":"Sethna JP, Bierbaum MK, Dahmen KA, et al. Deformation of crystals: Connections with statistical physics. Annual Review of Materials Research. 2017;47:217-246. doi:10.1146/annurev-matsci-070115-032036","chicago":"Sethna, James P., Matthew K. Bierbaum, Karin A. Dahmen, Carl Peter Goodrich, Julia R. Greer, Lorien X. Hayden, Jaron P. Kent-Dobias, et al. “Deformation of Crystals: Connections with Statistical Physics.” Annual Review of Materials Research. Annual Reviews, 2017. https://doi.org/10.1146/annurev-matsci-070115-032036.","apa":"Sethna, J. P., Bierbaum, M. K., Dahmen, K. A., Goodrich, C. P., Greer, J. R., Hayden, L. X., … Zapperi, S. (2017). Deformation of crystals: Connections with statistical physics. Annual Review of Materials Research. Annual Reviews. https://doi.org/10.1146/annurev-matsci-070115-032036","mla":"Sethna, James P., et al. “Deformation of Crystals: Connections with Statistical Physics.” Annual Review of Materials Research, vol. 47, Annual Reviews, 2017, pp. 217–46, doi:10.1146/annurev-matsci-070115-032036."},"publication_identifier":{"issn":["1531-7331","1545-4118"]},"extern":"1","oa_version":"Published Version","publication":"Annual Review of Materials Research","doi":"10.1146/annurev-matsci-070115-032036","main_file_link":[{"url":"https://doi.org/10.1146/annurev-matsci-070115-032036","open_access":"1"}],"publication_status":"published"},{"volume":167,"publication_identifier":{"issn":["0022-4715","1572-9613"]},"extern":"1","citation":{"chicago":"Baity-Jesi, Marco, Carl Peter Goodrich, Andrea J. Liu, Sidney R. Nagel, and James P. Sethna. “Emergent SO(3) Symmetry of the Frictionless Shear Jamming Transition.” Journal of Statistical Physics. Springer Nature, 2017. https://doi.org/10.1007/s10955-016-1703-9.","ista":"Baity-Jesi M, Goodrich CP, Liu AJ, Nagel SR, Sethna JP. 2017. Emergent SO(3) symmetry of the frictionless shear jamming transition. Journal of Statistical Physics. 167(3–4), 735–748.","ieee":"M. Baity-Jesi, C. P. Goodrich, A. J. Liu, S. R. Nagel, and J. P. Sethna, “Emergent SO(3) symmetry of the frictionless shear jamming transition,” Journal of Statistical Physics, vol. 167, no. 3–4. Springer Nature, pp. 735–748, 2017.","short":"M. Baity-Jesi, C.P. Goodrich, A.J. Liu, S.R. Nagel, J.P. Sethna, Journal of Statistical Physics 167 (2017) 735–748.","ama":"Baity-Jesi M, Goodrich CP, Liu AJ, Nagel SR, Sethna JP. Emergent SO(3) symmetry of the frictionless shear jamming transition. Journal of Statistical Physics. 2017;167(3-4):735-748. doi:10.1007/s10955-016-1703-9","mla":"Baity-Jesi, Marco, et al. “Emergent SO(3) Symmetry of the Frictionless Shear Jamming Transition.” Journal of Statistical Physics, vol. 167, no. 3–4, Springer Nature, 2017, pp. 735–48, doi:10.1007/s10955-016-1703-9.","apa":"Baity-Jesi, M., Goodrich, C. P., Liu, A. J., Nagel, S. R., & Sethna, J. P. (2017). Emergent SO(3) symmetry of the frictionless shear jamming transition. Journal of Statistical Physics. Springer Nature. https://doi.org/10.1007/s10955-016-1703-9"},"abstract":[{"text":"We study the shear jamming of athermal frictionless soft spheres, and find that in the thermodynamic limit, a shear-jammed state exists with different elastic properties from the isotropically-jammed state. For example, shear-jammed states can have a non-zero residual shear stress in the thermodynamic limit that arises from long-range stress-stress correlations. As a result, the ratio of the shear and bulk moduli, which in isotropically-jammed systems vanishes as the jamming transition is approached from above, instead approaches a constant. Despite these striking differences, we argue that in a deeper sense, the shear jamming and isotropic jamming transitions actually have the same symmetry, and that the differences can be fully understood by rotating the six-dimensional basis of the elastic modulus tensor.","lang":"eng"}],"type":"journal_article","date_created":"2020-04-30T11:38:38Z","_id":"7756","quality_controlled":"1","day":"03","status":"public","publication":"Journal of Statistical Physics","publication_status":"published","doi":"10.1007/s10955-016-1703-9","oa_version":"None","date_published":"2017-01-03T00:00:00Z","month":"01","intvolume":" 167","publisher":"Springer Nature","date_updated":"2021-01-12T08:15:19Z","title":"Emergent SO(3) symmetry of the frictionless shear jamming transition","author":[{"first_name":"Marco","last_name":"Baity-Jesi","full_name":"Baity-Jesi, Marco"},{"first_name":"Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","last_name":"Goodrich","orcid":"0000-0002-1307-5074","full_name":"Goodrich, Carl Peter"},{"full_name":"Liu, Andrea J.","last_name":"Liu","first_name":"Andrea J."},{"first_name":"Sidney R.","last_name":"Nagel","full_name":"Nagel, Sidney R."},{"last_name":"Sethna","first_name":"James P.","full_name":"Sethna, James P."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3-4","article_processing_charge":"No","page":"735-748","language":[{"iso":"eng"}],"article_type":"original","year":"2017"},{"oa_version":"None","publication":"Proceedings of the National Academy of Sciences","doi":"10.1073/pnas.1612139114","publication_status":"published","day":"07","quality_controlled":"1","status":"public","date_created":"2020-04-30T11:38:53Z","_id":"7757","abstract":[{"text":"Recent advances in designing metamaterials have demonstrated that global mechanical properties of disordered spring networks can be tuned by selectively modifying only a small subset of bonds. Here, using a computationally efficient approach, we extend this idea to tune more general properties of networks. With nearly complete success, we are able to produce a strain between any two target nodes in a network in response to an applied source strain on any other pair of nodes by removing only ∼1% of the bonds. We are also able to control multiple pairs of target nodes, each with a different individual response, from a single source, and to tune multiple independent source/target responses simultaneously into a network. We have fabricated physical networks in macroscopic 2D and 3D systems that exhibit these responses. This work is inspired by the long-range coupled conformational changes that constitute allosteric function in proteins. The fact that allostery is a common means for regulation in biological molecules suggests that it is a relatively easy property to develop through evolution. In analogy, our results show that long-range coupled mechanical responses are similarly easy to achieve in disordered networks.","lang":"eng"}],"type":"journal_article","volume":114,"publication_identifier":{"issn":["0027-8424","1091-6490"]},"extern":"1","citation":{"mla":"Rocks, Jason W., et al. “Designing Allostery-Inspired Response in Mechanical Networks.” Proceedings of the National Academy of Sciences, vol. 114, no. 10, Proceedings of the National Academy of Sciences, 2017, pp. 2520–25, doi:10.1073/pnas.1612139114.","apa":"Rocks, J. W., Pashine, N., Bischofberger, I., Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2017). Designing allostery-inspired response in mechanical networks. Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1612139114","chicago":"Rocks, Jason W., Nidhi Pashine, Irmgard Bischofberger, Carl Peter Goodrich, Andrea J. Liu, and Sidney R. Nagel. “Designing Allostery-Inspired Response in Mechanical Networks.” Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1612139114.","ista":"Rocks JW, Pashine N, Bischofberger I, Goodrich CP, Liu AJ, Nagel SR. 2017. Designing allostery-inspired response in mechanical networks. Proceedings of the National Academy of Sciences. 114(10), 2520–2525.","short":"J.W. Rocks, N. Pashine, I. Bischofberger, C.P. Goodrich, A.J. Liu, S.R. Nagel, Proceedings of the National Academy of Sciences 114 (2017) 2520–2525.","ieee":"J. W. Rocks, N. Pashine, I. Bischofberger, C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Designing allostery-inspired response in mechanical networks,” Proceedings of the National Academy of Sciences, vol. 114, no. 10. Proceedings of the National Academy of Sciences, pp. 2520–2525, 2017.","ama":"Rocks JW, Pashine N, Bischofberger I, Goodrich CP, Liu AJ, Nagel SR. Designing allostery-inspired response in mechanical networks. Proceedings of the National Academy of Sciences. 2017;114(10):2520-2525. doi:10.1073/pnas.1612139114"},"article_type":"original","year":"2017","language":[{"iso":"eng"}],"article_processing_charge":"No","page":"2520-2525","author":[{"last_name":"Rocks","first_name":"Jason W.","full_name":"Rocks, Jason W."},{"last_name":"Pashine","first_name":"Nidhi","full_name":"Pashine, Nidhi"},{"first_name":"Irmgard","last_name":"Bischofberger","full_name":"Bischofberger, Irmgard"},{"id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","last_name":"Goodrich","orcid":"0000-0002-1307-5074","full_name":"Goodrich, Carl Peter"},{"full_name":"Liu, Andrea J.","first_name":"Andrea J.","last_name":"Liu"},{"full_name":"Nagel, Sidney R.","first_name":"Sidney R.","last_name":"Nagel"}],"title":"Designing allostery-inspired response in mechanical networks","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"10","date_updated":"2021-01-12T08:15:19Z","publisher":"Proceedings of the National Academy of Sciences","date_published":"2017-03-07T00:00:00Z","month":"03","intvolume":" 114"},{"doi":"10.1073/pnas.1608838114","publication_status":"published","publication":"Proceedings of the National Academy of Sciences","oa_version":"None","publication_identifier":{"issn":["0027-8424","1091-6490"]},"extern":"1","citation":{"chicago":"Goodrich, Carl Peter, and Michael P. Brenner. “Using Active Colloids as Machines to Weave and Braid on the Micrometer Scale.” Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1608838114.","short":"C.P. Goodrich, M.P. Brenner, Proceedings of the National Academy of Sciences 114 (2017) 257–262.","ista":"Goodrich CP, Brenner MP. 2017. Using active colloids as machines to weave and braid on the micrometer scale. Proceedings of the National Academy of Sciences. 114(2), 257–262.","ieee":"C. P. Goodrich and M. P. Brenner, “Using active colloids as machines to weave and braid on the micrometer scale,” Proceedings of the National Academy of Sciences, vol. 114, no. 2. Proceedings of the National Academy of Sciences, pp. 257–262, 2017.","ama":"Goodrich CP, Brenner MP. Using active colloids as machines to weave and braid on the micrometer scale. Proceedings of the National Academy of Sciences. 2017;114(2):257-262. doi:10.1073/pnas.1608838114","mla":"Goodrich, Carl Peter, and Michael P. Brenner. “Using Active Colloids as Machines to Weave and Braid on the Micrometer Scale.” Proceedings of the National Academy of Sciences, vol. 114, no. 2, Proceedings of the National Academy of Sciences, 2017, pp. 257–62, doi:10.1073/pnas.1608838114.","apa":"Goodrich, C. P., & Brenner, M. P. (2017). Using active colloids as machines to weave and braid on the micrometer scale. Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.1608838114"},"volume":114,"type":"journal_article","abstract":[{"text":"Controlling motion at the microscopic scale is a fundamental goal in the development of biologically inspired systems. We show that the motion of active, self-propelled colloids can be sufficiently controlled for use as a tool to assemble complex structures such as braids and weaves out of microscopic filaments. Unlike typical self-assembly paradigms, these structures are held together by geometric constraints rather than adhesive bonds. The out-of-equilibrium assembly that we propose involves precisely controlling the 2D motion of active colloids so that their path has a nontrivial topology. We demonstrate with proof-of-principle Brownian dynamics simulations that, when the colloids are attached to long semiflexible filaments, this motion causes the filaments to braid. The ability of the active particles to provide sufficient force necessary to bend the filaments into a braid depends on a number of factors, including the self-propulsion mechanism, the properties of the filament, and the maximum curvature in the braid. Our work demonstrates that nonequilibrium assembly pathways can be designed using active particles.","lang":"eng"}],"date_created":"2020-04-30T11:39:09Z","_id":"7758","day":"10","quality_controlled":"1","status":"public","page":"257-262","article_processing_charge":"No","language":[{"iso":"eng"}],"year":"2017","article_type":"original","intvolume":" 114","month":"01","date_published":"2017-01-10T00:00:00Z","publisher":"Proceedings of the National Academy of Sciences","date_updated":"2021-01-12T08:15:20Z","issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Using active colloids as machines to weave and braid on the micrometer scale","author":[{"id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","orcid":"0000-0002-1307-5074","last_name":"Goodrich","full_name":"Goodrich, Carl Peter"},{"full_name":"Brenner, Michael P.","last_name":"Brenner","first_name":"Michael P."}]},{"page":"105 - 116","license":"https://creativecommons.org/licenses/by-nd/4.0/","year":"2017","date_published":"2017-04-04T00:00:00Z","intvolume":" 46","month":"04","date_updated":"2023-10-17T12:28:13Z","oa":1,"publication":"Rundgespräche Forum Ökologie","oa_version":"Published Version","volume":46,"tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"ddc":["592"],"date_created":"2018-12-11T11:46:35Z","status":"public","day":"04","article_processing_charge":"No","department":[{"_id":"SyCr"}],"publist_id":"7362","language":[{"iso":"eng"}],"pubrep_id":"962","has_accepted_license":"1","publisher":"Verlag Dr. Friedrich Pfeil","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern","author":[{"full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"file":[{"creator":"system","file_size":1711131,"content_type":"application/pdf","file_id":"5175","relation":"main_file","access_level":"open_access","checksum":"4919baf9050415ca151fe22497379f78","file_name":"IST-2018-962-v1+1_044676698_07_Cremer__Invasive_Ameisen_in_Europa_...__BY-ND_.pdf","date_created":"2018-12-12T10:15:52Z","date_updated":"2020-07-14T12:46:32Z"}],"publication_status":"published","publication_identifier":{"issn":["2366-2875"]},"citation":{"mla":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” Rundgespräche Forum Ökologie, vol. 46, Verlag Dr. Friedrich Pfeil, 2017, pp. 105–16.","apa":"Cremer, S. (2017). Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. Rundgespräche Forum Ökologie. Verlag Dr. Friedrich Pfeil.","chicago":"Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die Heimische Fauna Verändern.” Rundgespräche Forum Ökologie. Verlag Dr. Friedrich Pfeil, 2017.","short":"S. Cremer, Rundgespräche Forum Ökologie 46 (2017) 105–116.","ieee":"S. Cremer, “Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern,” Rundgespräche Forum Ökologie, vol. 46. Verlag Dr. Friedrich Pfeil, pp. 105–116, 2017.","ista":"Cremer S. 2017. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. Rundgespräche Forum Ökologie. 46, 105–116.","ama":"Cremer S. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna verändern. Rundgespräche Forum Ökologie. 2017;46:105-116."},"abstract":[{"lang":"eng","text":"The social insects bees, wasps, ants, and termites are species-rich, occur in many habitats, and often constitute a large part of the biomass. Many are also invasive, including species of termites, the red imported fire ant, and the Argentine ant. While invasive social insects have been a problem in Southern Europe for some time, Central Europa was free of invasive ant species until recently because most ants are adapted to warmer climates. Only in the 1990s, did Lasius neglectus, a close relative of the common black garden ant, arrive in Germany. First described in 1990 based on individuals collected in Budapest, the species has since been detected for example in France, Germany, Spain, England, and Kyrgyzstan. The species is spread with soil during construction work or plantings, and L. neglectus therefore is often found in parks and botanical gardens. Another invasive ant now spreading in southern Germany is Formica fuscocinerea, which occurs along rivers, including in the sandy floodplains of the river Isar. As is typical of pioneer species, F. fuscocinerea quickly becomes extremely abundant and therefore causes problems for example on playgrounds in Munich. All invasive ant species are characterized by cooperation across nests, leading to strongly interconnected, very large super-colonies. The resulting dominance results in the extinction of native ant species as well as other arthropod species and thus in the reduction of biodiversity."}],"type":"journal_article","file_date_updated":"2020-07-14T12:46:32Z","_id":"459","quality_controlled":"1"},{"volume":27,"date_created":"2018-12-11T11:46:37Z","ddc":["530"],"day":"01","status":"public","publication":"Chaos","doi":"10.1063/1.5002771","oa_version":"Published Version","date_published":"2017-11-01T00:00:00Z","intvolume":" 27","month":"11","article_number":"113112","date_updated":"2024-02-28T13:02:12Z","oa":1,"issue":"11","year":"2017","citation":{"mla":"Altmeyer, Sebastian, et al. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” Chaos, vol. 27, no. 11, 113112, AIP Publishing, 2017, doi:10.1063/1.5002771.","apa":"Altmeyer, S., Do, Y., & Ryu, S. (2017). Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. AIP Publishing. https://doi.org/10.1063/1.5002771","chicago":"Altmeyer, Sebastian, Younghae Do, and Soorok Ryu. “Transient Behavior between Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” Chaos. AIP Publishing, 2017. https://doi.org/10.1063/1.5002771.","ista":"Altmeyer S, Do Y, Ryu S. 2017. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. 27(11), 113112.","short":"S. Altmeyer, Y. Do, S. Ryu, Chaos 27 (2017).","ieee":"S. Altmeyer, Y. Do, and S. Ryu, “Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow,” Chaos, vol. 27, no. 11. AIP Publishing, 2017.","ama":"Altmeyer S, Do Y, Ryu S. Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow. Chaos. 2017;27(11). doi:10.1063/1.5002771"},"publication_identifier":{"issn":["10541500"]},"abstract":[{"lang":"eng","text":"We investigate transient behaviors induced by magnetic fields on the dynamics of the flow of a ferrofluid in the gap between two concentric, independently rotating cylinders. Without applying any magnetic fields, we uncover emergence of flow states constituted by a combination of a localized spiral state (SPIl) in the top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v) with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl + SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented, we observe the transient behaviors between multi-cell states passing through two critical thresholds in a strength of an axial (transverse) magnetic field. Before the first critical threshold of a magnetic field strength, multi-stable states with different number of cells could be observed. After the first critical threshold, we find the transient behavior between the three- and two-cell flow states. For more strength of magnetic field or after the second critical threshold, we discover that multi-cell states are disappeared and a localized spiral state remains to be stimulated. The studied transient behavior could be understood by the investigation of various quantities including a modal kinetic energy, a mode amplitude of the radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence of new flow states and the transient behavior between their states in ferrofluidic flows indicate that richer and potentially controllable dynamics through magnetic fields could be possible in ferrofluic flow."}],"scopus_import":"1","type":"journal_article","file_date_updated":"2020-07-14T12:46:32Z","_id":"463","quality_controlled":"1","publication_status":"published","has_accepted_license":"1","publisher":"AIP Publishing","title":"Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette flow","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Altmeyer, Sebastian","orcid":"0000-0001-5964-0203","last_name":"Altmeyer","id":"2EE67FDC-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian"},{"full_name":"Do, Younghae","first_name":"Younghae","last_name":"Do"},{"first_name":"Soorok","last_name":"Ryu","full_name":"Ryu, Soorok"}],"file":[{"file_name":"2017_Chaos_Altmeyer.pdf","date_updated":"2020-07-14T12:46:32Z","date_created":"2019-10-24T15:14:30Z","content_type":"application/pdf","file_id":"6970","creator":"dernst","file_size":7714020,"access_level":"open_access","relation":"main_file","checksum":"0731f9d416760c1062db258ca51f8bdc"}],"article_processing_charge":"No","department":[{"_id":"BjHo"}],"publist_id":"7358","language":[{"iso":"eng"}],"article_type":"original"},{"citation":{"apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017."},"publication_identifier":{"issn":["1860-5974"]},"scopus_import":"1","arxiv":1,"abstract":[{"text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:32Z","type":"journal_article","_id":"464","quality_controlled":"1","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","has_accepted_license":"1","publisher":"International Federation of Computational Logic","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Improved algorithms for parity and Streett objectives","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"file":[{"checksum":"12d469ae69b80361333d7dead965cf5d","access_level":"open_access","relation":"main_file","file_size":582940,"creator":"system","file_id":"5010","content_type":"application/pdf","date_created":"2018-12-12T10:13:27Z","date_updated":"2020-07-14T12:46:32Z","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf"}],"article_processing_charge":"No","department":[{"_id":"KrCh"}],"publist_id":"7357","language":[{"iso":"eng"}],"pubrep_id":"956","volume":13,"date_created":"2018-12-11T11:46:37Z","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"ddc":["004"],"status":"public","day":"26","publication":"Logical Methods in Computer Science","doi":"10.23638/LMCS-13(3:26)2017","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1661"}]},"oa_version":"Published Version","ec_funded":1,"date_published":"2017-09-26T00:00:00Z","intvolume":" 13","month":"09","article_number":"26","date_updated":"2025-06-02T08:53:41Z","oa":1,"issue":"3","external_id":{"arxiv":["1410.0833"]},"year":"2017"},{"year":"2017","date_updated":"2023-02-23T12:26:25Z","issue":"3","oa":1,"month":"09","intvolume":" 13","date_published":"2017-09-13T00:00:00Z","related_material":{"record":[{"id":"1610","status":"public","relation":"earlier_version"},{"status":"public","relation":"earlier_version","id":"5438"}]},"oa_version":"Published Version","ec_funded":1,"doi":"10.23638/LMCS-13(3:23)2017","publication":"Logical Methods in Computer Science","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"date_created":"2018-12-11T11:46:37Z","ddc":["004"],"status":"public","day":"13","volume":13,"language":[{"iso":"eng"}],"pubrep_id":"955","publist_id":"7356","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file":[{"file_name":"IST-2015-321-v1+1_main.pdf","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:37Z","creator":"system","file_size":279071,"file_id":"5090","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"08041379ba408d40664f449eb5907a8f"},{"date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:14:38Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","checksum":"08041379ba408d40664f449eb5907a8f","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5091","creator":"system","file_size":279071}],"title":"Edit distance for pushdown automata","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publisher":"International Federation of Computational Logic","project":[{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"grant_number":"Z211","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","_id":"465","quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3)."},"publication_identifier":{"issn":["18605974"]},"file_date_updated":"2020-07-14T12:46:33Z","type":"journal_article","abstract":[{"lang":"eng","text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. "}],"scopus_import":1},{"_id":"466","quality_controlled":"1","citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017.","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017"},"publication_identifier":{"issn":["18605974"]},"abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. ","lang":"eng"}],"scopus_import":1,"type":"journal_article","file_date_updated":"2020-07-14T12:46:33Z","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"701309"}],"publication_status":"published","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Křetínská, Zuzana","first_name":"Zuzana","last_name":"Křetínská"},{"full_name":"Kretinsky, Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"bfa405385ec6229ad5ead89ab5751639","relation":"main_file","access_level":"open_access","file_size":511832,"creator":"system","content_type":"application/pdf","file_id":"5354","date_updated":"2020-07-14T12:46:33Z","date_created":"2018-12-12T10:18:32Z","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf"}],"has_accepted_license":"1","publisher":"International Federation of Computational Logic","language":[{"iso":"eng"}],"pubrep_id":"957","department":[{"_id":"KrCh"}],"publist_id":"7355","tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"date_created":"2018-12-11T11:46:38Z","ddc":["004"],"day":"03","status":"public","volume":13,"related_material":{"record":[{"id":"1657","status":"public","relation":"earlier_version"},{"id":"5429","status":"public","relation":"earlier_version"},{"id":"5435","status":"public","relation":"earlier_version"}]},"ec_funded":1,"oa_version":"Published Version","publication":"Logical Methods in Computer Science","doi":"10.23638/LMCS-13(2:15)2017","date_updated":"2023-02-23T12:26:16Z","oa":1,"issue":"2","date_published":"2017-07-03T00:00:00Z","month":"07","intvolume":" 13","article_number":"15","year":"2017"},{"oa":1,"issue":"4","date_updated":"2023-02-23T12:26:19Z","article_number":"31","date_published":"2017-12-01T00:00:00Z","intvolume":" 18","month":"12","year":"2017","external_id":{"arxiv":["1606.03598"]},"status":"public","day":"01","date_created":"2018-12-11T11:46:38Z","volume":18,"oa_version":"Preprint","ec_funded":1,"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1656"},{"relation":"earlier_version","status":"public","id":"5415"},{"status":"public","relation":"earlier_version","id":"5436"}]},"publication":"ACM Transactions on Computational Logic (TOCL)","doi":"10.1145/3152769","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.03598"}],"title":"Nested weighted automata","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ACM","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"7354","quality_controlled":"1","_id":"467","arxiv":1,"abstract":[{"text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.","lang":"eng"}],"scopus_import":1,"type":"journal_article","publication_identifier":{"issn":["15293785"]},"citation":{"mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.","ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31."},"publication_status":"published","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}]},{"type":"journal_article","file_date_updated":"2020-07-14T12:46:34Z","abstract":[{"lang":"eng","text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios."}],"scopus_import":1,"publication_identifier":{"issn":["07300301"]},"citation":{"apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103.","ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678."},"quality_controlled":"1","_id":"470","publication_status":"published","project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"638176"}],"publisher":"ACM","has_accepted_license":"1","file":[{"date_created":"2020-01-24T09:32:35Z","date_updated":"2020-07-14T12:46:34Z","file_name":"wavepackets_final.pdf","access_level":"open_access","relation":"main_file","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","file_size":13131683,"creator":"wojtan","content_type":"application/pdf","file_id":"7359"}],"author":[{"full_name":"Jeschke, Stefan","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke"},{"orcid":"0000-0001-6646-5546","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Water wave packets","department":[{"_id":"ChWo"}],"publist_id":"7350","article_processing_charge":"Yes (in subscription journal)","article_type":"original","language":[{"iso":"eng"}],"volume":36,"status":"public","day":"01","ddc":["006"],"date_created":"2018-12-11T11:46:39Z","doi":"10.1145/3072959.3073678","publication":"ACM Transactions on Graphics","ec_funded":1,"oa_version":"Published Version","article_number":"103","month":"07","intvolume":" 36","date_published":"2017-07-01T00:00:00Z","issue":"4","acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"date_updated":"2023-02-23T12:20:26Z","year":"2017"},{"quality_controlled":"1","_id":"471","type":"journal_article","scopus_import":1,"abstract":[{"lang":"eng","text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. "}],"citation":{"ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139."},"publication_identifier":{"issn":["15293785"]},"publication_status":"published","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"},{"full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana","orcid":"0000-0002-9041-0905","last_name":"Petrov"}],"title":"Faster statistical model checking for unbounded temporal properties","publisher":"ACM","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"publist_id":"7349","status":"public","day":"01","date_created":"2018-12-11T11:46:39Z","volume":18,"oa_version":"Submitted Version","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1234"}]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.05739"}],"doi":"10.1145/3060139","publication":"ACM Transactions on Computational Logic (TOCL)","issue":"2","oa":1,"date_updated":"2023-02-21T16:48:11Z","article_number":"12","intvolume":" 18","month":"05","date_published":"2017-05-01T00:00:00Z","year":"2017"},{"publisher":"Wiley-Blackwell","intvolume":" 37","month":"06","date_published":"2017-06-21T00:00:00Z","issue":"25","title":"Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held","author":[{"orcid":"0000-0002-6170-2546","last_name":"Eguchi","id":"2B7846DC-F248-11E8-B48F-1D18A9856A87","first_name":"Kohgaku","full_name":"Eguchi, Kohgaku"},{"first_name":"Zachari","last_name":"Taoufiq","full_name":"Taoufiq, Zachari"},{"full_name":"Thorn Seshold, Oliver","first_name":"Oliver","last_name":"Thorn Seshold"},{"full_name":"Trauner, Dirk","last_name":"Trauner","first_name":"Dirk"},{"full_name":"Hasegawa, Masato","first_name":"Masato","last_name":"Hasegawa"},{"full_name":"Takahashi, Tomoyuki","first_name":"Tomoyuki","last_name":"Takahashi"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:00:51Z","publist_id":"7348","page":"6043 - 6052","year":"2017","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"α-Synuclein is a presynaptic protein the function of which has yet to be identified, but its neuronal content increases in patients of synucleinopa-thies including Parkinson’s disease. Chronic overexpression of α-synuclein reportedly expresses various phenotypes of synaptic dysfunction, but the primary target of its toxicity has not been determined. To investigate this, we acutely loaded human recombinant α-synuclein or its pathological mutants in their monomeric forms into the calyces of Held presynaptic terminals in slices from auditorily mature and immature rats of either sex. Membrane capacitance measurements revealed significant and specific inhibitory effects of WT monomeric α-synuclein on vesicle endocytosis throughout development. However, the α-synuclein A53T mutant affected vesicle endocytosis only at immature calyces, where as the A30P mutant had no effect throughout. The endocytic impairment by WTα-synuclein was rescued by intraterminal coloading of the microtubule (MT) polymerization blocker nocodazole. Furthermore, it was reversibly rescued by presynaptically loaded photostatin-1, a pho-toswitcheable inhibitor of MT polymerization, inalight-wavelength-dependent manner. Incontrast, endocyticinhibition by the A53T mutant at immature calyces was not rescued by nocodazole. Functionally, presynaptically loaded WT α-synuclein had no effect on basal synaptic transmission evoked at a low frequency, but significantly attenuated exocytosis and impaired the fidelity of neurotransmission during prolonged high-frequency stimulation. We conclude that monomeric WTα-synuclein primarily inhibits vesicle endocytosis via MT overassembly, thereby impairing high-frequency neurotransmission."}],"extern":"1","citation":{"chicago":"Eguchi, Kohgaku, Zachari Taoufiq, Oliver Thorn Seshold, Dirk Trauner, Masato Hasegawa, and Tomoyuki Takahashi. “Wild-Type Monomeric α-Synuclein Can Impair Vesicle Endocytosis and Synaptic Fidelity via Tubulin Polymerization at the Calyx of Held.” European Journal of Neuroscience. Wiley-Blackwell, 2017. https://doi.org/10.1523/JNEUROSCI.0179-17.2017.","ama":"Eguchi K, Taoufiq Z, Thorn Seshold O, Trauner D, Hasegawa M, Takahashi T. Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. European Journal of Neuroscience. 2017;37(25):6043-6052. doi:10.1523/JNEUROSCI.0179-17.2017","ista":"Eguchi K, Taoufiq Z, Thorn Seshold O, Trauner D, Hasegawa M, Takahashi T. 2017. Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. European Journal of Neuroscience. 37(25), 6043–6052.","short":"K. Eguchi, Z. Taoufiq, O. Thorn Seshold, D. Trauner, M. Hasegawa, T. Takahashi, European Journal of Neuroscience 37 (2017) 6043–6052.","ieee":"K. Eguchi, Z. Taoufiq, O. Thorn Seshold, D. Trauner, M. Hasegawa, and T. Takahashi, “Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held,” European Journal of Neuroscience, vol. 37, no. 25. Wiley-Blackwell, pp. 6043–6052, 2017.","mla":"Eguchi, Kohgaku, et al. “Wild-Type Monomeric α-Synuclein Can Impair Vesicle Endocytosis and Synaptic Fidelity via Tubulin Polymerization at the Calyx of Held.” European Journal of Neuroscience, vol. 37, no. 25, Wiley-Blackwell, 2017, pp. 6043–52, doi:10.1523/JNEUROSCI.0179-17.2017.","apa":"Eguchi, K., Taoufiq, Z., Thorn Seshold, O., Trauner, D., Hasegawa, M., & Takahashi, T. (2017). Wild-type monomeric α-synuclein can impair vesicle endocytosis and synaptic fidelity via tubulin polymerization at the calyx of held. European Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1523/JNEUROSCI.0179-17.2017"},"publication_identifier":{"issn":["02706474"]},"volume":37,"day":"21","status":"public","quality_controlled":"1","_id":"472","date_created":"2018-12-11T11:46:40Z","doi":"10.1523/JNEUROSCI.0179-17.2017","publication_status":"published","publication":"European Journal of Neuroscience","oa_version":"None"},{"publication_status":"published","_id":"481","quality_controlled":"1","citation":{"mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.","apa":"Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229."},"file_date_updated":"2020-07-14T12:46:35Z","type":"journal_article","scopus_import":1,"abstract":[{"text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"language":[{"iso":"eng"}],"pubrep_id":"949","department":[{"_id":"HeEd"}],"publist_id":"7338","file":[{"file_size":769296,"creator":"system","file_id":"4758","content_type":"application/pdf","access_level":"open_access","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","relation":"main_file","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:09:34Z"}],"title":"Planar matchings for weighted straight skeletons","author":[{"last_name":"Biedl","first_name":"Therese","full_name":"Biedl, Therese"},{"full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"},{"full_name":"Palfrader, Peter","first_name":"Peter","last_name":"Palfrader"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","publisher":"World Scientific Publishing","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"10892"}]},"oa_version":"Published Version","doi":"10.1142/S0218195916600050","publication":"International Journal of Computational Geometry and Applications","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T11:46:43Z","ddc":["004","514","516"],"status":"public","day":"13","volume":26,"year":"2017","page":"211 - 229","date_updated":"2023-02-21T16:06:22Z","issue":"3-4","oa":1,"month":"04","intvolume":" 26","date_published":"2017-04-13T00:00:00Z","acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15."},{"year":"2017","page":"739 - 800","date_updated":"2021-01-12T08:00:57Z","oa":1,"issue":"3","date_published":"2017-08-25T00:00:00Z","intvolume":" 21","month":"08","ec_funded":1,"oa_version":"Submitted Version","publication":"Advances in Theoretical and Mathematical Physics","main_file_link":[{"url":"https://arxiv.org/abs/1602.02312","open_access":"1"}],"doi":"10.4310/ATMP.2017.v21.n3.a5","date_created":"2018-12-11T11:46:43Z","status":"public","day":"25","volume":21,"language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"publist_id":"7337","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bourgade, Paul","last_name":"Bourgade","first_name":"Paul"},{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"},{"first_name":"Jun","last_name":"Yin","full_name":"Yin, Jun"}],"title":"Universality for a class of random band matrices","publisher":"International Press","project":[{"call_identifier":"FP7","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"}],"publication_status":"published","_id":"483","quality_controlled":"1","citation":{"chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017.","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.","apa":"Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5"},"publication_identifier":{"issn":["10950761"]},"scopus_import":1,"abstract":[{"lang":"eng","text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices."}],"type":"journal_article"},{"doi":"10.4310/ATMP.2017.v21.n3.a4","main_file_link":[{"url":"https://arxiv.org/abs/1509.04631","open_access":"1"}],"publication":"Advances in Theoretical and Mathematical Physics","ec_funded":1,"oa_version":"Submitted Version","volume":21,"date_created":"2018-12-11T11:46:43Z","day":"01","status":"public","page":"683 - 738","year":"2017","intvolume":" 21","month":"01","date_published":"2017-01-01T00:00:00Z","date_updated":"2021-01-12T08:00:58Z","issue":"3","oa":1,"project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"call_identifier":"FWF","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","publication_identifier":{"issn":["10950761"]},"citation":{"mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.","apa":"Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738."},"type":"journal_article","abstract":[{"lang":"eng","text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory."}],"scopus_import":1,"_id":"484","quality_controlled":"1","publist_id":"7336","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"publisher":"International Press","author":[{"first_name":"Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","last_name":"Nam","full_name":"Nam, Phan"},{"last_name":"Napiórkowski","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin M","full_name":"Napiórkowski, Marcin M"}],"title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"oa_version":"None","publication":"Optics InfoBase Conference Papers","publication_status":"published","doi":"10.1364/NLO.2017.NM3A.1","day":"01","quality_controlled":"1","status":"public","date_created":"2018-12-11T11:46:44Z","_id":"485","scopus_import":"1","abstract":[{"text":"We present results on nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band with more than 0.1% photon number conversion efficiency with MHz bandwidth, in a crystalline whispering gallery mode resonator","lang":"eng"}],"type":"conference","volume":"F54","publication_identifier":{"isbn":["978-155752820-9"]},"citation":{"mla":"Rueda Sanchez, Alfredo R., et al. “Single Sideband Microwave to Optical Photon Conversion-an-Electro-Optic-Realization.” Optics InfoBase Conference Papers, vol. F54, NM3A.1, Optica Publishing Group, 2017, doi:10.1364/NLO.2017.NM3A.1.","apa":"Rueda Sanchez, A. R., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2017). Single sideband microwave to optical photon conversion-an-electro-optic-realization. In Optics InfoBase Conference Papers (Vol. F54). Waikoloa, HI, United States: Optica Publishing Group. https://doi.org/10.1364/NLO.2017.NM3A.1","chicago":"Rueda Sanchez, Alfredo R, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Single Sideband Microwave to Optical Photon Conversion-an-Electro-Optic-Realization.” In Optics InfoBase Conference Papers, Vol. F54. Optica Publishing Group, 2017. https://doi.org/10.1364/NLO.2017.NM3A.1.","ama":"Rueda Sanchez AR, Sedlmeir F, Collodo M, et al. Single sideband microwave to optical photon conversion-an-electro-optic-realization. In: Optics InfoBase Conference Papers. Vol F54. Optica Publishing Group; 2017. doi:10.1364/NLO.2017.NM3A.1","ista":"Rueda Sanchez AR, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2017. Single sideband microwave to optical photon conversion-an-electro-optic-realization. Optics InfoBase Conference Papers. NLO: Nonlinear Optics vol. F54, NM3A.1.","ieee":"A. R. Rueda Sanchez et al., “Single sideband microwave to optical photon conversion-an-electro-optic-realization,” in Optics InfoBase Conference Papers, Waikoloa, HI, United States, 2017, vol. F54.","short":"A.R. Rueda Sanchez, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optics InfoBase Conference Papers, Optica Publishing Group, 2017."},"year":"2017","language":[{"iso":"eng"}],"department":[{"_id":"JoFi"}],"publist_id":"7335","conference":{"name":"NLO: Nonlinear Optics","start_date":"2017-07-17","end_date":"2017-07-21","location":"Waikoloa, HI, United States"},"article_processing_charge":"No","author":[{"first_name":"Alfredo R","id":"3B82B0F8-F248-11E8-B48F-1D18A9856A87","last_name":"Rueda Sanchez","orcid":"0000-0001-6249-5860","full_name":"Rueda Sanchez, Alfredo R"},{"first_name":"Florian","last_name":"Sedlmeir","full_name":"Sedlmeir, Florian"},{"full_name":"Collodo, Michele","first_name":"Michele","last_name":"Collodo"},{"full_name":"Vogl, Ulrich","first_name":"Ulrich","last_name":"Vogl"},{"last_name":"Stiller","first_name":"Birgit","full_name":"Stiller, Birgit"},{"full_name":"Schunk, Gerhard","first_name":"Gerhard","last_name":"Schunk"},{"first_name":"Dmitry","last_name":"Strekalov","full_name":"Strekalov, Dmitry"},{"last_name":"Marquardt","first_name":"Christoph","full_name":"Marquardt, Christoph"},{"full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink"},{"first_name":"Oskar","last_name":"Painter","full_name":"Painter, Oskar"},{"first_name":"Gerd","last_name":"Leuchs","full_name":"Leuchs, Gerd"},{"last_name":"Schwefel","first_name":"Harald","full_name":"Schwefel, Harald"}],"title":"Single sideband microwave to optical photon conversion-an-electro-optic-realization","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-17T12:15:38Z","publisher":"Optica Publishing Group","article_number":"NM3A.1","date_published":"2017-07-01T00:00:00Z","month":"07"},{"quality_controlled":"1","_id":"486","scopus_import":1,"abstract":[{"text":"Color texture reproduction in 3D printing commonly ignores volumetric light transport (cross-talk) between surface points on a 3D print. Such light diffusion leads to significant blur of details and color bleeding, and is particularly severe for highly translucent resin-based print materials. Given their widely varying scattering properties, this cross-talk between surface points strongly depends on the internal structure of the volume surrounding each surface point. Existing scattering-aware methods use simplified models for light diffusion, and often accept the visual blur as an immutable property of the print medium. In contrast, our work counteracts heterogeneous scattering to obtain the impression of a crisp albedo texture on top of the 3D print, by optimizing for a fully volumetric material distribution that preserves the target appearance. Our method employs an efficient numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous scattering, supported by a practical calibration procedure to obtain scattering parameters from a given set of printer materials. Despite the inherent translucency of the medium, we reproduce detailed surface textures on 3D prints. We evaluate our system using a commercial, five-tone 3D print process and compare against the printer’s native color texturing mode, demonstrating that our method preserves high-frequency features well without having to compromise on color gamut.","lang":"eng"}],"type":"journal_article","file_date_updated":"2020-07-14T12:46:35Z","citation":{"mla":"Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.” ACM Transactions on Graphics, vol. 36, no. 6, 241, ACM, 2017, doi:10.1145/3130800.3130890.","apa":"Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., … Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3130800.3130890","chicago":"Elek, Oskar, Denis Sumin, Ran Zhang, Tim Weyrich, Karol Myszkowski, Bernd Bickel, Alexander Wilkie, and Jaroslav Krivanek. “Scattering-Aware Texture Reproduction for 3D Printing.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3130800.3130890.","ieee":"O. Elek et al., “Scattering-aware texture reproduction for 3D printing,” ACM Transactions on Graphics, vol. 36, no. 6. ACM, 2017.","short":"O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie, J. Krivanek, ACM Transactions on Graphics 36 (2017).","ista":"Elek O, Sumin D, Zhang R, Weyrich T, Myszkowski K, Bickel B, Wilkie A, Krivanek J. 2017. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 36(6), 241.","ama":"Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for 3D printing. ACM Transactions on Graphics. 2017;36(6). doi:10.1145/3130800.3130890"},"publication_identifier":{"issn":["07300301"]},"publication_status":"published","project":[{"name":"Distributed 3D Object Design","_id":"2508E324-B435-11E9-9278-68D0E5697425","grant_number":"642841","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Elek","first_name":"Oskar","full_name":"Elek, Oskar"},{"full_name":"Sumin, Denis","first_name":"Denis","last_name":"Sumin"},{"orcid":"0000-0002-3808-281X","last_name":"Zhang","first_name":"Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Ran"},{"last_name":"Weyrich","first_name":"Tim","full_name":"Weyrich, Tim"},{"last_name":"Myszkowski","first_name":"Karol","full_name":"Myszkowski, Karol"},{"full_name":"Bickel, Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"last_name":"Wilkie","first_name":"Alexander","full_name":"Wilkie, Alexander"},{"full_name":"Krivanek, Jaroslav","first_name":"Jaroslav","last_name":"Krivanek"}],"title":"Scattering-aware texture reproduction for 3D printing","file":[{"file_name":"IST-2018-1052-v1+1_ElekSumin2017SGA.pdf","date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-12T10:10:46Z","creator":"system","file_size":107349827,"file_id":"4836","content_type":"application/pdf","checksum":"48386fa6956c3645fc89594dc898b147","relation":"main_file","access_level":"open_access"},{"access_level":"open_access","relation":"main_file","checksum":"21c89c28fb8d70f6602f752bf997aa0f","creator":"bbickel","file_size":4683145,"file_id":"7189","content_type":"application/pdf","date_created":"2019-12-16T14:48:57Z","date_updated":"2020-07-14T12:46:35Z","file_name":"ElekSumin2017SGA_reduced_file_size.pdf"}],"publisher":"ACM","has_accepted_license":"1","article_type":"original","pubrep_id":"1052","language":[{"iso":"eng"}],"department":[{"_id":"BeBi"}],"publist_id":"7334","article_processing_charge":"No","day":"20","status":"public","ddc":["003","000","005"],"date_created":"2018-12-11T11:46:44Z","volume":36,"ec_funded":1,"oa_version":"Submitted Version","related_material":{"record":[{"id":"8386","status":"public","relation":"dissertation_contains"}]},"publication":"ACM Transactions on Graphics","doi":"10.1145/3130800.3130890","oa":1,"issue":"6","date_updated":"2023-09-07T13:11:15Z","article_number":"241","date_published":"2017-11-20T00:00:00Z","month":"11","intvolume":" 36","year":"2017"},{"oa_version":"None","publication":"Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies","doi":"10.1145/3143361.3143367","publication_status":"published","quality_controlled":"1","day":"28","status":"public","_id":"487","date_created":"2018-12-11T11:46:45Z","scopus_import":1,"abstract":[{"lang":"eng","text":"In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x."}],"type":"conference","publication_identifier":{"isbn":["978-145035422-6"]},"citation":{"apa":"Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., & Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367","mla":"Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.” Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.","ista":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017. Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.","short":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.","ieee":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14.","ama":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367","chicago":"Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367."},"year":"2017","language":[{"iso":"eng"}],"publist_id":"7333","department":[{"_id":"DaAl"}],"conference":{"location":"Incheon, South Korea","start_date":"2017-12-12","end_date":"2017-12-15","name":"CoNEXT: Conference on emerging Networking EXperiments and Technologies"},"page":"2 - 14","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Towards unlicensed cellular networks in TV white spaces","author":[{"last_name":"Baig","first_name":"Ghufran","full_name":"Baig, Ghufran"},{"first_name":"Bozidar","last_name":"Radunovic","full_name":"Radunovic, Bozidar"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X"},{"first_name":"Matthew","last_name":"Balkwill","full_name":"Balkwill, Matthew"},{"full_name":"Karagiannis, Thomas","first_name":"Thomas","last_name":"Karagiannis"},{"full_name":"Qiu, Lili","last_name":"Qiu","first_name":"Lili"}],"date_updated":"2023-02-23T12:21:11Z","publisher":"ACM","date_published":"2017-11-28T00:00:00Z","month":"11"},{"article_number":"82","date_published":"2017-03-06T00:00:00Z","intvolume":" 7","month":"03","oa":1,"issue":"1","date_updated":"2023-02-23T12:26:57Z","year":"2017","volume":7,"day":"06","status":"public","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["004"],"date_created":"2018-12-11T11:46:53Z","publication":"Scientific Reports","doi":"10.1038/s41598-017-00107-w","oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"id":"5449","status":"public","relation":"earlier_version"}]},"publisher":"Nature Publishing Group","has_accepted_license":"1","title":"Amplification on undirected population structures: Comets beat stars","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"full_name":"Tkadlec, Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"file":[{"date_updated":"2020-07-14T12:46:36Z","date_created":"2018-12-12T10:18:35Z","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","relation":"main_file","checksum":"7d05cbdd914e194a019c0f91fb64e9a8","access_level":"open_access","creator":"system","file_size":1536783,"file_id":"5357","content_type":"application/pdf"}],"publist_id":"7307","department":[{"_id":"KrCh"}],"article_processing_charge":"No","pubrep_id":"938","language":[{"iso":"eng"}],"scopus_import":1,"abstract":[{"lang":"eng","text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. "}],"type":"journal_article","file_date_updated":"2020-07-14T12:46:36Z","publication_identifier":{"issn":["20452322"]},"citation":{"apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w","mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82.","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w."},"quality_controlled":"1","_id":"512","publication_status":"published","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"}]}]