---
_id: '140'
abstract:
- lang: eng
  text: Reachability analysis is difficult for hybrid automata with affine differential
    equations, because the reach set needs to be approximated. Promising abstraction
    techniques usually employ interval methods or template polyhedra. Interval methods
    account for dense time and guarantee soundness, and there are interval-based tools
    that overapproximate affine flowpipes. But interval methods impose bounded and
    rigid shapes, which make refinement expensive and fixpoint detection difficult.
    Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded,
    but sound template refinement for unbounded reachability analysis has been implemented
    only for systems with piecewise constant dynamics. We capitalize on the advantages
    of both techniques, combining interval arithmetic and template polyhedra, using
    the former to abstract time and the latter to abstract space. During a CEGAR loop,
    whenever a spurious error trajectory is found, we compute additional space constraints
    and split time intervals, and use these space-time interpolants to eliminate the
    counterexample. Space-time interpolation offers a lazy, flexible framework for
    increasing precision while guaranteeing soundness, both for error avoidance and
    fixpoint detection. To the best of out knowledge, this is the first abstraction
    refinement scheme for the reachability analysis over unbounded and dense time
    of affine hybrid systems, which is both sound and automatic. We demonstrate the
    effectiveness of our algorithm with several benchmark examples, which cannot be
    handled by other tools.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Goran
  full_name: Frehse, Goran
  last_name: Frehse
- first_name: Mirco
  full_name: Giacobbe, Mirco
  id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
  last_name: Giacobbe
  orcid: 0000-0001-8180-0904
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
citation:
  ama: 'Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981.
    Springer; 2018:468-486. doi:<a href="https://doi.org/10.1007/978-3-319-96145-3_25">10.1007/978-3-319-96145-3_25</a>'
  apa: 'Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2018). Space-time interpolants
    (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification,
    Oxford, United Kingdom: Springer. <a href="https://doi.org/10.1007/978-3-319-96145-3_25">https://doi.org/10.1007/978-3-319-96145-3_25</a>'
  chicago: Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,”
    10981:468–86. Springer, 2018. <a href="https://doi.org/10.1007/978-3-319-96145-3_25">https://doi.org/10.1007/978-3-319-96145-3_25</a>.
  ieee: 'G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented
    at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981,
    pp. 468–486.'
  ista: 'Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer
    Aided Verification, LNCS, vol. 10981, 468–486.'
  mla: Frehse, Goran, et al. <i>Space-Time Interpolants</i>. Vol. 10981, Springer,
    2018, pp. 468–86, doi:<a href="https://doi.org/10.1007/978-3-319-96145-3_25">10.1007/978-3-319-96145-3_25</a>.
  short: G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.
conference:
  end_date: 2018-07-17
  location: Oxford, United Kingdom
  name: 'CAV: Computer Aided Verification'
  start_date: 2018-07-14
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-19T09:30:43Z
day: '18'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_25
external_id:
  isi:
  - '000491481600025'
file:
- access_level: open_access
  checksum: 6dca832f575d6b3f0ea9dff56f579142
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:17:53Z
  date_updated: 2020-07-14T12:44:50Z
  file_id: '5310'
  file_name: IST-2018-1010-v1+1_space-time_interpolants.pdf
  file_size: 563710
  relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: '     10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 468 - 486
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
publication_identifier:
  issn:
  - '03029743'
publication_status: published
publisher: Springer
publist_id: '7783'
pubrep_id: '1010'
quality_controlled: '1'
related_material:
  record:
  - id: '6894'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Space-time interpolants
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)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10981
year: '2018'
...
---
_id: '14003'
abstract:
- lang: eng
  text: "Molecular chirality plays an essential role in most biochemical processes.
    The observation and quantification of chirality-sensitive signals, however, remains
    extremely challenging, especially on ultrafast timescales and in dilute media.
    Here, we describe the experimental realization of an all-optical and ultrafast
    scheme for detecting chiral dynamics in molecules. This technique is based on
    high-harmonic generation by a combination of two-color counterrotating femtosecond
    laser pulses with polarization states tunable from linear to circular. We demonstrate
    two different implementations of chiral-sensitive high-harmonic spectroscopy on
    an ensemble of randomly oriented methyloxirane molecules in the gas phase. Using
    two elliptically polarized fields, we observe that the ellipticities maximizing
    the harmonic signal reach up to \r\n4.4\r\n±\r\n0.2\r\n%\r\n (at 17.6 eV). Using
    two circularly polarized fields, we observe circular dichroisms ranging up to
    \r\n13\r\n±\r\n6\r\n%\r\n (28.3–33.1 eV). Our theoretical analysis confirms that
    the observed chiral response originates from subfemtosecond electron dynamics
    driven by the magnetic component of the driving laser field. This assignment is
    supported by the experimental observation of a strong intensity dependence of
    the chiral effects and its agreement with theory. We moreover report and explain
    a pronounced variation of the signal strength and dichroism with the driving-field
    ellipticities and harmonic orders. Finally, we demonstrate the sensitivity of
    the experimental observables to the shape of the electron hole. This technique
    for chiral discrimination will yield femtosecond temporal resolution when integrated
    in a pump-probe scheme and subfemtosecond resolution on chiral charge migration
    in a self-probing scheme."
article_number: '031060'
article_processing_charge: No
article_type: original
author:
- first_name: Denitsa Rangelova
  full_name: Baykusheva, Denitsa Rangelova
  id: 71b4d059-2a03-11ee-914d-dfa3beed6530
  last_name: Baykusheva
- first_name: Hans Jakob
  full_name: Wörner, Hans Jakob
  last_name: Wörner
citation:
  ama: Baykusheva DR, Wörner HJ. Chiral discrimination through bielliptical high-harmonic
    spectroscopy. <i>Physical Review X</i>. 2018;8(3). doi:<a href="https://doi.org/10.1103/physrevx.8.031060">10.1103/physrevx.8.031060</a>
  apa: Baykusheva, D. R., &#38; Wörner, H. J. (2018). Chiral discrimination through
    bielliptical high-harmonic spectroscopy. <i>Physical Review X</i>. American Physical
    Society. <a href="https://doi.org/10.1103/physrevx.8.031060">https://doi.org/10.1103/physrevx.8.031060</a>
  chicago: Baykusheva, Denitsa Rangelova, and Hans Jakob Wörner. “Chiral Discrimination
    through Bielliptical High-Harmonic Spectroscopy.” <i>Physical Review X</i>. American
    Physical Society, 2018. <a href="https://doi.org/10.1103/physrevx.8.031060">https://doi.org/10.1103/physrevx.8.031060</a>.
  ieee: D. R. Baykusheva and H. J. Wörner, “Chiral discrimination through bielliptical
    high-harmonic spectroscopy,” <i>Physical Review X</i>, vol. 8, no. 3. American
    Physical Society, 2018.
  ista: Baykusheva DR, Wörner HJ. 2018. Chiral discrimination through bielliptical
    high-harmonic spectroscopy. Physical Review X. 8(3), 031060.
  mla: Baykusheva, Denitsa Rangelova, and Hans Jakob Wörner. “Chiral Discrimination
    through Bielliptical High-Harmonic Spectroscopy.” <i>Physical Review X</i>, vol.
    8, no. 3, 031060, American Physical Society, 2018, doi:<a href="https://doi.org/10.1103/physrevx.8.031060">10.1103/physrevx.8.031060</a>.
  short: D.R. Baykusheva, H.J. Wörner, Physical Review X 8 (2018).
date_created: 2023-08-10T06:34:48Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2023-08-22T07:42:07Z
day: '01'
doi: 10.1103/physrevx.8.031060
extern: '1'
intvolume: '         8'
issue: '3'
keyword:
- General Physics and Astronomy
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1103/PhysRevX.8.031060
month: '07'
oa: 1
oa_version: Published Version
publication: Physical Review X
publication_identifier:
  eissn:
  - 2160-3308
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Chiral discrimination through bielliptical high-harmonic spectroscopy
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2018'
...
---
_id: '141'
abstract:
- lang: eng
  text: 'Given a model and a specification, the fundamental model-checking problem
    asks for algorithmic verification of whether the model satisfies the specification.
    We consider graphs and Markov decision processes (MDPs), which are fundamental
    models for reactive systems. One of the very basic specifications that arise in
    verification of reactive systems is the strong fairness (aka Streett) objective.
    Given different types of requests and corresponding grants, the objective requires
    that for each type, if the request event happens infinitely often, then the corresponding
    grant event must also happen infinitely often. All ω -regular objectives can be
    expressed as Streett objectives and hence they are canonical in verification.
    To handle the state-space explosion, symbolic algorithms are required that operate
    on a succinct implicit representation of the system rather than explicitly accessing
    the system. While explicit algorithms for graphs and MDPs with Streett objectives
    have been widely studied, there has been no improvement of the basic symbolic
    algorithms. The worst-case numbers of symbolic steps required for the basic symbolic
    algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work
    we present the first sub-quadratic symbolic algorithm for graphs with Streett
    objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic
    insights we present an implementation of the new symbolic approach and show that
    it improves the existing approach on several academic benchmark examples.'
acknowledgement: 'Acknowledgements. K. C. and M. H. are partially supported by the
  Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported
  by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant
  (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon
  2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement
  No. 665385.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Veronika
  full_name: Loitzenbauer, Veronika
  last_name: Loitzenbauer
- first_name: Simin
  full_name: Oraee, Simin
  last_name: Oraee
- first_name: Viktor
  full_name: Toman, Viktor
  id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
  last_name: Toman
  orcid: 0000-0001-9036-063X
citation:
  ama: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms
    for graphs and Markov decision processes with fairness objectives. In: Vol 10982.
    Springer; 2018:178-197. doi:<a href="https://doi.org/10.1007/978-3-319-96142-2_13">10.1007/978-3-319-96142-2_13</a>'
  apa: 'Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., &#38; Toman,
    V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness
    objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification,
    Oxford, United Kingdom: Springer. <a href="https://doi.org/10.1007/978-3-319-96142-2_13">https://doi.org/10.1007/978-3-319-96142-2_13</a>'
  chicago: Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin
    Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes
    with Fairness Objectives,” 10982:178–97. Springer, 2018. <a href="https://doi.org/10.1007/978-3-319-96142-2_13">https://doi.org/10.1007/978-3-319-96142-2_13</a>.
  ieee: 'K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman,
    “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,”
    presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018,
    vol. 10982, pp. 178–197.'
  ista: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic
    algorithms for graphs and Markov decision processes with fairness objectives.
    CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.'
  mla: Chatterjee, Krishnendu, et al. <i>Symbolic Algorithms for Graphs and Markov
    Decision Processes with Fairness Objectives</i>. Vol. 10982, Springer, 2018, pp.
    178–97, doi:<a href="https://doi.org/10.1007/978-3-319-96142-2_13">10.1007/978-3-319-96142-2_13</a>.
  short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:,
    Springer, 2018, pp. 178–197.
conference:
  end_date: 2018-07-17
  location: Oxford, United Kingdom
  name: 'CAV: Computer Aided Verification'
  start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2025-07-14T09:10:15Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-319-96142-2_13
ec_funded: 1
external_id:
  isi:
  - '000491469700013'
file:
- access_level: open_access
  checksum: 1a6ffa4febe8bb8ac28be3adb3eafebc
  content_type: application/pdf
  creator: dernst
  date_created: 2018-12-18T08:52:38Z
  date_updated: 2020-07-14T12:44:53Z
  file_id: '5737'
  file_name: 2018_LNCS_Chatterjee.pdf
  file_size: 675606
  relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: '     10982'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 178-197
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '665385'
  name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7782'
quality_controlled: '1'
related_material:
  record:
  - id: '10199'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Symbolic algorithms for graphs and Markov decision processes with fairness
  objectives
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)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10982
year: '2018'
...
---
_id: '14198'
abstract:
- lang: eng
  text: "High-dimensional time series are common in many domains. Since human\r\ncognition
    is not optimized to work well in high-dimensional spaces, these areas\r\ncould
    benefit from interpretable low-dimensional representations. However, most\r\nrepresentation
    learning algorithms for time series data are difficult to\r\ninterpret. This is
    due to non-intuitive mappings from data features to salient\r\nproperties of the
    representation and non-smoothness over time. To address this\r\nproblem, we propose
    a new representation learning framework building on ideas\r\nfrom interpretable
    discrete dimensionality reduction and deep generative\r\nmodeling. This framework
    allows us to learn discrete representations of time\r\nseries, which give rise
    to smooth and interpretable embeddings with superior\r\nclustering performance.
    We introduce a new way to overcome the\r\nnon-differentiability in discrete representation
    learning and present a\r\ngradient-based version of the traditional self-organizing
    map algorithm that is\r\nmore performant than the original. Furthermore, to allow
    for a probabilistic\r\ninterpretation of our method, we integrate a Markov model
    in the representation\r\nspace. This model uncovers the temporal transition structure,
    improves\r\nclustering performance even further and provides additional explanatory\r\ninsights
    as well as a natural representation of uncertainty. We evaluate our\r\nmodel in
    terms of clustering performance and interpretability on static\r\n(Fashion-)MNIST
    data, a time series of linearly interpolated (Fashion-)MNIST\r\nimages, a chaotic
    Lorenz attractor system with two macro states, as well as on\r\na challenging
    real world medical time series application on the eICU data set.\r\nOur learned
    representations compare favorably with competitor methods and\r\nfacilitate downstream
    tasks on the real world data."
article_processing_charge: No
arxiv: 1
author:
- first_name: Vincent
  full_name: Fortuin, Vincent
  last_name: Fortuin
- first_name: Matthias
  full_name: Hüser, Matthias
  last_name: Hüser
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Heiko
  full_name: Strathmann, Heiko
  last_name: Strathmann
- first_name: Gunnar
  full_name: Rätsch, Gunnar
  last_name: Rätsch
citation:
  ama: 'Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. SOM-VAE: Interpretable
    discrete representation learning on time series. In: <i>International Conference
    on Learning Representations</i>. ; 2018.'
  apa: 'Fortuin, V., Hüser, M., Locatello, F., Strathmann, H., &#38; Rätsch, G. (2018).
    SOM-VAE: Interpretable discrete representation learning on time series. In <i>International
    Conference on Learning Representations</i>. New Orleans, LA, United States.'
  chicago: 'Fortuin, Vincent, Matthias Hüser, Francesco Locatello, Heiko Strathmann,
    and Gunnar Rätsch. “SOM-VAE: Interpretable Discrete Representation Learning on
    Time Series.” In <i>International Conference on Learning Representations</i>,
    2018.'
  ieee: 'V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, and G. Rätsch, “SOM-VAE:
    Interpretable discrete representation learning on time series,” in <i>International
    Conference on Learning Representations</i>, New Orleans, LA, United States, 2018.'
  ista: 'Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. 2018. SOM-VAE: Interpretable
    discrete representation learning on time series. International Conference on Learning
    Representations. ICLR: International Conference on Learning Representations.'
  mla: 'Fortuin, Vincent, et al. “SOM-VAE: Interpretable Discrete Representation Learning
    on Time Series.” <i>International Conference on Learning Representations</i>,
    2018.'
  short: V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, G. Rätsch, in:, International
    Conference on Learning Representations, 2018.
conference:
  end_date: 2019-05-09
  location: New Orleans, LA, United States
  name: 'ICLR: International Conference on Learning Representations'
  start_date: 2019-05-06
date_created: 2023-08-22T14:12:48Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-13T06:35:12Z
day: '06'
department:
- _id: FrLo
extern: '1'
external_id:
  arxiv:
  - '1806.02199'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1806.02199
month: '06'
oa: 1
oa_version: Preprint
publication: International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
status: public
title: 'SOM-VAE: Interpretable discrete representation learning on time series'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '142'
abstract:
- lang: eng
  text: We address the problem of analyzing the reachable set of a polynomial nonlinear
    continuous system by over-approximating the flowpipe of its dynamics. The common
    approach to tackle this problem is to perform a numerical integration over a given
    time horizon based on Taylor expansion and interval arithmetic. However, this
    method results to be very conservative when there is a large difference in speed
    between trajectories as time progresses. In this paper, we propose to use combinations
    of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate
    flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse
    box which is big enough to contain the segment is constructed using sampled simulation
    and then in the box we compute by linear programming a set of barrier functions
    (called barrier tube or BT for short) which work together to form a tube surrounding
    the flowpipe. The benefit of using PBT is that (1) BT is independent of time and
    hence can avoid being stretched and deformed by time; and (2) a small number of
    BTs can form a tight over-approximation for the flowpipe, which means that the
    computation required to decide whether the BTs intersect the unsafe set can be
    reduced significantly. We implemented a prototype called PBTS in C++. Experiments
    on some benchmark systems show that our approach is effective.
acknowledgement: 'Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Hui
  full_name: Kong, Hui
  id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
  last_name: Kong
  orcid: 0000-0002-3066-6941
- first_name: Ezio
  full_name: Bartocci, Ezio
  last_name: Bartocci
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
citation:
  ama: 'Kong H, Bartocci E, Henzinger TA. Reachable set over-approximation for nonlinear
    systems using piecewise barrier tubes. In: Vol 10981. Springer; 2018:449-467.
    doi:<a href="https://doi.org/10.1007/978-3-319-96145-3_24">10.1007/978-3-319-96145-3_24</a>'
  apa: 'Kong, H., Bartocci, E., &#38; Henzinger, T. A. (2018). Reachable set over-approximation
    for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467).
    Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer.
    <a href="https://doi.org/10.1007/978-3-319-96145-3_24">https://doi.org/10.1007/978-3-319-96145-3_24</a>'
  chicago: Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation
    for Nonlinear Systems Using Piecewise Barrier Tubes,” 10981:449–67. Springer,
    2018. <a href="https://doi.org/10.1007/978-3-319-96145-3_24">https://doi.org/10.1007/978-3-319-96145-3_24</a>.
  ieee: 'H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation
    for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer
    Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.'
  ista: 'Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation
    for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification,
    LNCS, vol. 10981, 449–467.'
  mla: Kong, Hui, et al. <i>Reachable Set Over-Approximation for Nonlinear Systems
    Using Piecewise Barrier Tubes</i>. Vol. 10981, Springer, 2018, pp. 449–67, doi:<a
    href="https://doi.org/10.1007/978-3-319-96145-3_24">10.1007/978-3-319-96145-3_24</a>.
  short: H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467.
conference:
  end_date: 2018-07-17
  location: Oxford, United Kingdom
  name: 'CAV: Computer Aided Verification'
  start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-15T12:12:08Z
day: '18'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_24
external_id:
  isi:
  - '000491481600024'
file:
- access_level: open_access
  checksum: fd95e8026deacef3dc752a733bb9355f
  content_type: application/pdf
  creator: dernst
  date_created: 2018-12-17T15:57:06Z
  date_updated: 2020-07-14T12:44:53Z
  file_id: '5718'
  file_name: 2018_LNCS_Kong.pdf
  file_size: 5591566
  relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: '     10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 449 - 467
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: The Wittgenstein Prize
publication_status: published
publisher: Springer
publist_id: '7781'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reachable set over-approximation for nonlinear systems using piecewise barrier
  tubes
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)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10981
year: '2018'
...
---
_id: '14201'
abstract:
- lang: eng
  text: "Variational inference is a popular technique to approximate a possibly\r\nintractable
    Bayesian posterior with a more tractable one. Recently, boosting\r\nvariational
    inference has been proposed as a new paradigm to approximate the\r\nposterior
    by a mixture of densities by greedily adding components to the\r\nmixture. However,
    as is the case with many other variational inference\r\nalgorithms, its theoretical
    properties have not been studied. In the present\r\nwork, we study the convergence
    properties of this approach from a modern\r\noptimization viewpoint by establishing
    connections to the classic Frank-Wolfe\r\nalgorithm. Our analyses yields novel
    theoretical insights regarding the\r\nsufficient conditions for convergence, explicit
    rates, and algorithmic\r\nsimplifications. Since a lot of focus in previous works
    for variational\r\ninference has been on tractability, our work is especially
    important as a much\r\nneeded attempt to bridge the gap between probabilistic
    models and their\r\ncorresponding theoretical properties."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Rajiv
  full_name: Khanna, Rajiv
  last_name: Khanna
- first_name: Joydeep
  full_name: Ghosh, Joydeep
  last_name: Ghosh
- first_name: Gunnar
  full_name: Rätsch, Gunnar
  last_name: Rätsch
citation:
  ama: 'Locatello F, Khanna R, Ghosh J, Rätsch G. Boosting variational inference:
    An optimization perspective. In: <i>Proceedings of the 21st International Conference
    on Artificial Intelligence and Statistics</i>. Vol 84. ML Research Press; 2018:464-472.'
  apa: 'Locatello, F., Khanna, R., Ghosh, J., &#38; Rätsch, G. (2018). Boosting variational
    inference: An optimization perspective. In <i>Proceedings of the 21st International
    Conference on Artificial Intelligence and Statistics</i> (Vol. 84, pp. 464–472).
    Playa Blanca, Lanzarote: ML Research Press.'
  chicago: 'Locatello, Francesco, Rajiv Khanna, Joydeep Ghosh, and Gunnar Rätsch.
    “Boosting Variational Inference: An Optimization Perspective.” In <i>Proceedings
    of the 21st International Conference on Artificial Intelligence and Statistics</i>,
    84:464–72. ML Research Press, 2018.'
  ieee: 'F. Locatello, R. Khanna, J. Ghosh, and G. Rätsch, “Boosting variational inference:
    An optimization perspective,” in <i>Proceedings of the 21st International Conference
    on Artificial Intelligence and Statistics</i>, Playa Blanca, Lanzarote, 2018,
    vol. 84, pp. 464–472.'
  ista: 'Locatello F, Khanna R, Ghosh J, Rätsch G. 2018. Boosting variational inference:
    An optimization perspective. Proceedings of the 21st International Conference
    on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence
    and Statistics, PMLR, vol. 84, 464–472.'
  mla: 'Locatello, Francesco, et al. “Boosting Variational Inference: An Optimization
    Perspective.” <i>Proceedings of the 21st International Conference on Artificial
    Intelligence and Statistics</i>, vol. 84, ML Research Press, 2018, pp. 464–72.'
  short: F. Locatello, R. Khanna, J. Ghosh, G. Rätsch, in:, Proceedings of the 21st
    International Conference on Artificial Intelligence and Statistics, ML Research
    Press, 2018, pp. 464–472.
conference:
  end_date: 2018-04-11
  location: Playa Blanca, Lanzarote
  name: 'AISTATS: Conference on Artificial Intelligence and Statistics'
  start_date: 2018-04-09
date_created: 2023-08-22T14:15:20Z
date_published: 2018-04-15T00:00:00Z
date_updated: 2023-09-13T07:52:40Z
day: '15'
department:
- _id: FrLo
extern: '1'
external_id:
  arxiv:
  - '1708.01733'
intvolume: '        84'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1708.01733
month: '04'
oa: 1
oa_version: Preprint
page: 464-472
publication: Proceedings of the 21st International Conference on Artificial Intelligence
  and Statistics
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Boosting variational inference: An optimization perspective'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 84
year: '2018'
...
---
_id: '14202'
abstract:
- lang: eng
  text: "Approximating a probability density in a tractable manner is a central task\r\nin
    Bayesian statistics. Variational Inference (VI) is a popular technique that\r\nachieves
    tractability by choosing a relatively simple variational family.\r\nBorrowing
    ideas from the classic boosting framework, recent approaches attempt\r\nto \\emph{boost}
    VI by replacing the selection of a single density with a\r\ngreedily constructed
    mixture of densities. In order to guarantee convergence,\r\nprevious works impose
    stringent assumptions that require significant effort for\r\npractitioners. Specifically,
    they require a custom implementation of the greedy\r\nstep (called the LMO) for
    every probabilistic model with respect to an\r\nunnatural variational family of
    truncated distributions. Our work fixes these\r\nissues with novel theoretical
    and algorithmic insights. On the theoretical\r\nside, we show that boosting VI
    satisfies a relaxed smoothness assumption which\r\nis sufficient for the convergence
    of the functional Frank-Wolfe (FW) algorithm.\r\nFurthermore, we rephrase the
    LMO problem and propose to maximize the Residual\r\nELBO (RELBO) which replaces
    the standard ELBO optimization in VI. These\r\ntheoretical enhancements allow
    for black box implementation of the boosting\r\nsubroutine. Finally, we present
    a stopping criterion drawn from the duality gap\r\nin the classic FW analyses
    and exhaustive experiments to illustrate the\r\nusefulness of our theoretical
    and algorithmic contributions."
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Gideon
  full_name: Dresdner, Gideon
  last_name: Dresdner
- first_name: Rajiv
  full_name: Khanna, Rajiv
  last_name: Khanna
- first_name: Isabel
  full_name: Valera, Isabel
  last_name: Valera
- first_name: Gunnar
  full_name: Rätsch, Gunnar
  last_name: Rätsch
citation:
  ama: 'Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. Boosting black box
    variational inference. In: <i>Advances in Neural Information Processing Systems</i>.
    Vol 31. Neural Information Processing Systems Foundation; 2018.'
  apa: 'Locatello, F., Dresdner, G., Khanna, R., Valera, I., &#38; Rätsch, G. (2018).
    Boosting black box variational inference. In <i>Advances in Neural Information
    Processing Systems</i> (Vol. 31). Montreal, Canada: Neural Information Processing
    Systems Foundation.'
  chicago: Locatello, Francesco, Gideon Dresdner, Rajiv Khanna, Isabel Valera, and
    Gunnar Rätsch. “Boosting Black Box Variational Inference.” In <i>Advances in Neural
    Information Processing Systems</i>, Vol. 31. Neural Information Processing Systems
    Foundation, 2018.
  ieee: F. Locatello, G. Dresdner, R. Khanna, I. Valera, and G. Rätsch, “Boosting
    black box variational inference,” in <i>Advances in Neural Information Processing
    Systems</i>, Montreal, Canada, 2018, vol. 31.
  ista: 'Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. 2018. Boosting black
    box variational inference. Advances in Neural Information Processing Systems.
    NeurIPS: Neural Information Processing Systems vol. 31.'
  mla: Locatello, Francesco, et al. “Boosting Black Box Variational Inference.” <i>Advances
    in Neural Information Processing Systems</i>, vol. 31, Neural Information Processing
    Systems Foundation, 2018.
  short: F. Locatello, G. Dresdner, R. Khanna, I. Valera, G. Rätsch, in:, Advances
    in Neural Information Processing Systems, Neural Information Processing Systems
    Foundation, 2018.
conference:
  end_date: 2018-12-08
  location: Montreal, Canada
  name: 'NeurIPS: Neural Information Processing Systems'
  start_date: 2018-12-03
date_created: 2023-08-22T14:15:40Z
date_published: 2018-06-06T00:00:00Z
date_updated: 2023-09-13T07:38:24Z
day: '06'
department:
- _id: FrLo
extern: '1'
external_id:
  arxiv:
  - '1806.02185'
intvolume: '        31'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1806.02185
month: '06'
oa: 1
oa_version: Preprint
publication: Advances in Neural Information Processing Systems
publication_identifier:
  eissn:
  - 1049-5258
  isbn:
  - '9781510884472'
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Boosting black box variational inference
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2018'
...
---
_id: '14203'
abstract:
- lang: eng
  text: We propose a conditional gradient framework for a composite convex minimization
    template with broad applications. Our approach combines smoothing and homotopy
    techniques under the CGM framework, and provably achieves the optimal O(1/k−−√)
    convergence rate. We demonstrate that the same rate holds if the linear subproblems
    are solved approximately with additive or multiplicative error. In contrast with
    the relevant work, we are able to characterize the convergence when the non-smooth
    term is an indicator function. Specific applications of our framework include
    the non-smooth minimization, semidefinite programming, and minimization with linear
    inclusion constraints over a compact domain. Numerical evidence demonstrates the
    benefits of our framework.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Alp
  full_name: Yurtsever, Alp
  last_name: Yurtsever
- first_name: Olivier
  full_name: Fercoq, Olivier
  last_name: Fercoq
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Volkan
  full_name: Cevher, Volkan
  last_name: Cevher
citation:
  ama: 'Yurtsever A, Fercoq O, Locatello F, Cevher V. A conditional gradient framework
    for composite convex minimization with applications to semidefinite programming.
    In: <i>Proceedings of the 35th International Conference on Machine Learning</i>.
    Vol 80. ML Research Press; 2018:5727-5736.'
  apa: 'Yurtsever, A., Fercoq, O., Locatello, F., &#38; Cevher, V. (2018). A conditional
    gradient framework for composite convex minimization with applications to semidefinite
    programming. In <i>Proceedings of the 35th International Conference on Machine
    Learning</i> (Vol. 80, pp. 5727–5736). Stockholm, Sweden: ML Research Press.'
  chicago: Yurtsever, Alp, Olivier Fercoq, Francesco Locatello, and Volkan Cevher.
    “A Conditional Gradient Framework for Composite Convex Minimization with Applications
    to Semidefinite Programming.” In <i>Proceedings of the 35th International Conference
    on Machine Learning</i>, 80:5727–36. ML Research Press, 2018.
  ieee: A. Yurtsever, O. Fercoq, F. Locatello, and V. Cevher, “A conditional gradient
    framework for composite convex minimization with applications to semidefinite
    programming,” in <i>Proceedings of the 35th International Conference on Machine
    Learning</i>, Stockholm, Sweden, 2018, vol. 80, pp. 5727–5736.
  ista: 'Yurtsever A, Fercoq O, Locatello F, Cevher V. 2018. A conditional gradient
    framework for composite convex minimization with applications to semidefinite
    programming. Proceedings of the 35th International Conference on Machine Learning.
    ICML: International Conference on Machine Learning, PMLR, vol. 80, 5727–5736.'
  mla: Yurtsever, Alp, et al. “A Conditional Gradient Framework for Composite Convex
    Minimization with Applications to Semidefinite Programming.” <i>Proceedings of
    the 35th International Conference on Machine Learning</i>, vol. 80, ML Research
    Press, 2018, pp. 5727–36.
  short: A. Yurtsever, O. Fercoq, F. Locatello, V. Cevher, in:, Proceedings of the
    35th International Conference on Machine Learning, ML Research Press, 2018, pp.
    5727–5736.
conference:
  end_date: 2018-07-15
  location: Stockholm, Sweden
  name: 'ICML: International Conference on Machine Learning'
  start_date: 2018-07-10
date_created: 2023-08-22T14:16:01Z
date_published: 2018-07-15T00:00:00Z
date_updated: 2023-09-13T08:13:39Z
day: '15'
department:
- _id: FrLo
extern: '1'
external_id:
  arxiv:
  - '1804.08544'
intvolume: '        80'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1804.08544
month: '07'
oa: 1
oa_version: Preprint
page: 5727-5736
publication: Proceedings of the 35th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
status: public
title: A conditional gradient framework for composite convex minimization with applications
  to semidefinite programming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2018'
...
---
_id: '14204'
abstract:
- lang: eng
  text: Two popular examples of first-order optimization methods over linear spaces
    are coordinate descent and matching pursuit algorithms, with their randomized
    variants. While the former targets the optimization by moving along coordinates,
    the latter considers a generalized notion of directions. Exploiting the connection
    between the two algorithms, we present a unified analysis of both, providing affine
    invariant sublinear O(1/t) rates on smooth objectives and linear convergence on
    strongly convex objectives. As a byproduct of our affine invariant analysis of
    matching pursuit, our rates for steepest coordinate descent are the tightest known.
    Furthermore, we show the first accelerated convergence rate O(1/t2) for matching
    pursuit and steepest coordinate descent on convex objectives.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Anant
  full_name: Raj, Anant
  last_name: Raj
- first_name: Sai Praneeth
  full_name: Karimireddy, Sai Praneeth
  last_name: Karimireddy
- first_name: Gunnar
  full_name: Rätsch, Gunnar
  last_name: Rätsch
- first_name: Bernhard
  full_name: Schölkopf, Bernhard
  last_name: Schölkopf
- first_name: Sebastian U.
  full_name: Stich, Sebastian U.
  last_name: Stich
- first_name: Martin
  full_name: Jaggi, Martin
  last_name: Jaggi
citation:
  ama: 'Locatello F, Raj A, Karimireddy SP, et al. On matching pursuit and coordinate
    descent. In: <i>Proceedings of the 35th International Conference on Machine Learning</i>.
    Vol 80. ML Research Press; 2018:3198-3207.'
  apa: Locatello, F., Raj, A., Karimireddy, S. P., Rätsch, G., Schölkopf, B., Stich,
    S. U., &#38; Jaggi, M. (2018). On matching pursuit and coordinate descent. In
    <i>Proceedings of the 35th International Conference on Machine Learning</i> (Vol.
    80, pp. 3198–3207). ML Research Press.
  chicago: Locatello, Francesco, Anant Raj, Sai Praneeth Karimireddy, Gunnar Rätsch,
    Bernhard Schölkopf, Sebastian U. Stich, and Martin Jaggi. “On Matching Pursuit
    and Coordinate Descent.” In <i>Proceedings of the 35th International Conference
    on Machine Learning</i>, 80:3198–3207. ML Research Press, 2018.
  ieee: F. Locatello <i>et al.</i>, “On matching pursuit and coordinate descent,”
    in <i>Proceedings of the 35th International Conference on Machine Learning</i>,
    2018, vol. 80, pp. 3198–3207.
  ista: Locatello F, Raj A, Karimireddy SP, Rätsch G, Schölkopf B, Stich SU, Jaggi
    M. 2018. On matching pursuit and coordinate descent. Proceedings of the 35th International
    Conference on Machine Learning. , PMLR, vol. 80, 3198–3207.
  mla: Locatello, Francesco, et al. “On Matching Pursuit and Coordinate Descent.”
    <i>Proceedings of the 35th International Conference on Machine Learning</i>, vol.
    80, ML Research Press, 2018, pp. 3198–207.
  short: F. Locatello, A. Raj, S.P. Karimireddy, G. Rätsch, B. Schölkopf, S.U. Stich,
    M. Jaggi, in:, Proceedings of the 35th International Conference on Machine Learning,
    ML Research Press, 2018, pp. 3198–3207.
date_created: 2023-08-22T14:16:25Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2023-09-13T08:19:05Z
day: '01'
department:
- _id: FrLo
extern: '1'
external_id:
  arxiv:
  - '1803.09539'
intvolume: '        80'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1803.09539
month: '07'
oa: 1
oa_version: Preprint
page: 3198-3207
publication: Proceedings of the 35th International Conference on Machine Learning
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On matching pursuit and coordinate descent
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2018'
...
---
_id: '14224'
abstract:
- lang: eng
  text: Clustering is a cornerstone of unsupervised learning which can be thought
    as disentangling multiple generative mechanisms underlying the data. In this paper
    we introduce an algorithmic framework to train mixtures of implicit generative
    models which we particularize for variational autoencoders. Relying on an additional
    set of discriminators, we propose a competitive procedure in which the models
    only need to approximate the portion of the data distribution from which they
    can produce realistic samples. As a byproduct, each model is simpler to train,
    and a clustering interpretation arises naturally from the partitioning of the
    training points among the models. We empirically show that our approach splits
    the training distribution in a reasonable way and increases the quality of the
    generated samples.
article_processing_charge: No
arxiv: 1
author:
- first_name: Francesco
  full_name: Locatello, Francesco
  id: 26cfd52f-2483-11ee-8040-88983bcc06d4
  last_name: Locatello
  orcid: 0000-0002-4850-0683
- first_name: Damien
  full_name: Vincent, Damien
  last_name: Vincent
- first_name: Ilya
  full_name: Tolstikhin, Ilya
  last_name: Tolstikhin
- first_name: Gunnar
  full_name: Ratsch, Gunnar
  last_name: Ratsch
- first_name: Sylvain
  full_name: Gelly, Sylvain
  last_name: Gelly
- first_name: Bernhard
  full_name: Scholkopf, Bernhard
  last_name: Scholkopf
citation:
  ama: 'Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. Clustering
    meets implicit generative models. In: <i>6th International Conference on Learning
    Representations</i>. ; 2018.'
  apa: Locatello, F., Vincent, D., Tolstikhin, I., Ratsch, G., Gelly, S., &#38; Scholkopf,
    B. (2018). Clustering meets implicit generative models. In <i>6th International
    Conference on Learning Representations</i>. Vancouver, Canada.
  chicago: Locatello, Francesco, Damien Vincent, Ilya Tolstikhin, Gunnar Ratsch, Sylvain
    Gelly, and Bernhard Scholkopf. “Clustering Meets Implicit Generative Models.”
    In <i>6th International Conference on Learning Representations</i>, 2018.
  ieee: F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, and B. Scholkopf,
    “Clustering meets implicit generative models,” in <i>6th International Conference
    on Learning Representations</i>, Vancouver, Canada, 2018.
  ista: Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. 2018.
    Clustering meets implicit generative models. 6th International Conference on Learning
    Representations. International Conference on Machine Learning.
  mla: Locatello, Francesco, et al. “Clustering Meets Implicit Generative Models.”
    <i>6th International Conference on Learning Representations</i>, 2018.
  short: F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, B. Scholkopf,
    in:, 6th International Conference on Learning Representations, 2018.
conference:
  end_date: 2018-05-03
  location: Vancouver, Canada
  name: International Conference on Machine Learning
  start_date: 2018-04-30
date_created: 2023-08-22T14:25:34Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-09-13T09:08:24Z
day: '01'
department:
- _id: FrLo
extern: '1'
external_id:
  arxiv:
  - '1804.11130'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1804.11130
month: '05'
oa: 1
oa_version: Preprint
publication: 6th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
scopus_import: '1'
status: public
title: Clustering meets implicit generative models
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '14284'
abstract:
- lang: eng
  text: Pore-forming toxins (PFT) are virulence factors that transform from soluble
    to membrane-bound states. The Yersinia YaxAB system represents a family of binary
    α-PFTs with orthologues in human, insect, and plant pathogens, with unknown structures.
    YaxAB was shown to be cytotoxic and likely involved in pathogenesis, though the
    molecular basis for its two-component lytic mechanism remains elusive. Here, we
    present crystal structures of YaxA and YaxB, together with a cryo-electron microscopy
    map of the YaxAB complex. Our structures reveal a pore predominantly composed
    of decamers of YaxA–YaxB heterodimers. Both subunits bear membrane-active moieties,
    but only YaxA is capable of binding to membranes by itself. YaxB can subsequently
    be recruited to membrane-associated YaxA and induced to present its lytic transmembrane
    helices. Pore formation can progress by further oligomerization of YaxA–YaxB dimers.
    Our results allow for a comparison between pore assemblies belonging to the wider
    ClyA-like family of α-PFTs, highlighting diverse pore architectures.
article_number: '1806'
article_processing_charge: No
article_type: original
author:
- first_name: Bastian
  full_name: Bräuning, Bastian
  last_name: Bräuning
- first_name: Eva
  full_name: Bertosin, Eva
  last_name: Bertosin
- first_name: Florian M
  full_name: Praetorius, Florian M
  id: dfec9381-4341-11ee-8fd8-faa02bba7d62
  last_name: Praetorius
- first_name: Christian
  full_name: Ihling, Christian
  last_name: Ihling
- first_name: Alexandra
  full_name: Schatt, Alexandra
  last_name: Schatt
- first_name: Agnes
  full_name: Adler, Agnes
  last_name: Adler
- first_name: Klaus
  full_name: Richter, Klaus
  last_name: Richter
- first_name: Andrea
  full_name: Sinz, Andrea
  last_name: Sinz
- first_name: Hendrik
  full_name: Dietz, Hendrik
  last_name: Dietz
- first_name: Michael
  full_name: Groll, Michael
  last_name: Groll
citation:
  ama: Bräuning B, Bertosin E, Praetorius FM, et al. Structure and mechanism of the
    two-component α-helical pore-forming toxin YaxAB. <i>Nature Communications</i>.
    2018;9. doi:<a href="https://doi.org/10.1038/s41467-018-04139-2">10.1038/s41467-018-04139-2</a>
  apa: Bräuning, B., Bertosin, E., Praetorius, F. M., Ihling, C., Schatt, A., Adler,
    A., … Groll, M. (2018). Structure and mechanism of the two-component α-helical
    pore-forming toxin YaxAB. <i>Nature Communications</i>. Springer Nature. <a href="https://doi.org/10.1038/s41467-018-04139-2">https://doi.org/10.1038/s41467-018-04139-2</a>
  chicago: Bräuning, Bastian, Eva Bertosin, Florian M Praetorius, Christian Ihling,
    Alexandra Schatt, Agnes Adler, Klaus Richter, Andrea Sinz, Hendrik Dietz, and
    Michael Groll. “Structure and Mechanism of the Two-Component α-Helical Pore-Forming
    Toxin YaxAB.” <i>Nature Communications</i>. Springer Nature, 2018. <a href="https://doi.org/10.1038/s41467-018-04139-2">https://doi.org/10.1038/s41467-018-04139-2</a>.
  ieee: B. Bräuning <i>et al.</i>, “Structure and mechanism of the two-component α-helical
    pore-forming toxin YaxAB,” <i>Nature Communications</i>, vol. 9. Springer Nature,
    2018.
  ista: Bräuning B, Bertosin E, Praetorius FM, Ihling C, Schatt A, Adler A, Richter
    K, Sinz A, Dietz H, Groll M. 2018. Structure and mechanism of the two-component
    α-helical pore-forming toxin YaxAB. Nature Communications. 9, 1806.
  mla: Bräuning, Bastian, et al. “Structure and Mechanism of the Two-Component α-Helical
    Pore-Forming Toxin YaxAB.” <i>Nature Communications</i>, vol. 9, 1806, Springer
    Nature, 2018, doi:<a href="https://doi.org/10.1038/s41467-018-04139-2">10.1038/s41467-018-04139-2</a>.
  short: B. Bräuning, E. Bertosin, F.M. Praetorius, C. Ihling, A. Schatt, A. Adler,
    K. Richter, A. Sinz, H. Dietz, M. Groll, Nature Communications 9 (2018).
date_created: 2023-09-06T12:07:33Z
date_published: 2018-05-04T00:00:00Z
date_updated: 2023-11-07T11:46:12Z
day: '04'
doi: 10.1038/s41467-018-04139-2
extern: '1'
external_id:
  pmid:
  - '29728606'
intvolume: '         9'
keyword:
- General Physics and Astronomy
- General Biochemistry
- Genetics and Molecular Biology
- General Chemistry
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1038/s41467-018-04139-2
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
  issn:
  - 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure and mechanism of the two-component α-helical pore-forming toxin YaxAB
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2018'
...
---
_id: '143'
abstract:
- lang: eng
  text: 'Vector Addition Systems with States (VASS) provide a well-known and fundamental
    model for the analysis of concurrent processes, parameterized systems, and are
    also used as abstract models of programs in resource bound analysis. In this paper
    we study the problem of obtaining asymptotic bounds on the termination time of
    a given VASS. In particular, we focus on the practically important case of obtaining
    polynomial bounds on termination time. Our main contributions are as follows:
    First, we present a polynomial-time algorithm for deciding whether a given VASS
    has a linear asymptotic complexity. We also show that if the complexity of a VASS
    is not linear, it is at least quadratic. Second, we classify VASS according to
    quantitative properties of their cycles. We show that certain singularities in
    these properties are the key reason for non-polynomial asymptotic complexity of
    VASS. In absence of singularities, we show that the asymptotic complexity is always
    polynomial and of the form Θ(nk), for some integer k d, where d is the dimension
    of the VASS. We present a polynomial-time algorithm computing the optimal k. For
    general VASS, the same algorithm, which is based on a complete technique for the
    construction of ranking functions in VASS, produces a valid lower bound, i.e.,
    a k such that the termination complexity is (nk). Our results are based on new
    insights into the geometry of VASS dynamics, which hold the potential for further
    applicability to VASS analysis.'
alternative_title:
- ACM/IEEE Symposium on Logic in Computer Science
article_processing_charge: No
author:
- first_name: Tomáš
  full_name: Brázdil, Tomáš
  last_name: Brázdil
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Antonín
  full_name: Kučera, Antonín
  last_name: Kučera
- first_name: Petr
  full_name: Novotny, Petr
  id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
  last_name: Novotny
- first_name: Dominik
  full_name: Velan, Dominik
  last_name: Velan
- first_name: Florian
  full_name: Zuleger, Florian
  last_name: Zuleger
citation:
  ama: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. Efficient
    algorithms for asymptotic bounds on termination time in VASS. In: Vol F138033.
    IEEE; 2018:185-194. doi:<a href="https://doi.org/10.1145/3209108.3209191">10.1145/3209108.3209191</a>'
  apa: 'Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., &#38; Zuleger,
    F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS
    (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science,
    Oxford, United Kingdom: IEEE. <a href="https://doi.org/10.1145/3209108.3209191">https://doi.org/10.1145/3209108.3209191</a>'
  chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik
    Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination
    Time in VASS,” F138033:185–94. IEEE, 2018. <a href="https://doi.org/10.1145/3209108.3209191">https://doi.org/10.1145/3209108.3209191</a>.
  ieee: 'T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger,
    “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented
    at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033,
    pp. 185–194.'
  ista: 'Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient
    algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer
    Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.'
  mla: Brázdil, Tomáš, et al. <i>Efficient Algorithms for Asymptotic Bounds on Termination
    Time in VASS</i>. Vol. F138033, IEEE, 2018, pp. 185–94, doi:<a href="https://doi.org/10.1145/3209108.3209191">10.1145/3209108.3209191</a>.
  short: T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:,
    IEEE, 2018, pp. 185–194.
conference:
  end_date: 2018-07-12
  location: Oxford, United Kingdom
  name: 'LICS: Logic in Computer Science'
  start_date: 2018-07-09
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-09T00:00:00Z
date_updated: 2025-06-02T08:53:48Z
day: '09'
department:
- _id: KrCh
doi: 10.1145/3209108.3209191
ec_funded: 1
external_id:
  isi:
  - '000545262800020'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1804.10985
month: '07'
oa: 1
oa_version: Preprint
page: 185 - 194
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '279307'
  name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
publication_identifier:
  isbn:
  - 978-1-4503-5583-4
publication_status: published
publisher: IEEE
publist_id: '7780'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient algorithms for asymptotic bounds on termination time in VASS
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: F138033
year: '2018'
...
---
_id: '14306'
abstract:
- lang: eng
  text: 'Function and activity of biomolecules often depend on their spatial arrangement.
    The method introduced here allows genetically encoding the spatial arrangement
    of proteins and DNA. The approach relies on staple proteins that fold double-stranded
    DNA into user-defined shapes. This thesis describes the development of staple
    proteins based on the DNA recognition of TAL effectors and presents experimentally
    derived rules for designing a variety of self-assembling nanoscale shapes featuring
    structural motifs such as curvature, vertices, corners, and multilayer helix packing. '
article_processing_charge: No
author:
- first_name: Florian M
  full_name: Praetorius, Florian M
  id: dfec9381-4341-11ee-8fd8-faa02bba7d62
  last_name: Praetorius
citation:
  ama: Praetorius FM. Genetically encoding the spatial arrangement of DNA and proteins
    in self-assembling nanostructures. 2018.
  apa: Praetorius, F. M. (2018). <i>Genetically encoding the spatial arrangement of
    DNA and proteins in self-assembling nanostructures</i>. Technische Universität
    München.
  chicago: Praetorius, Florian M. “Genetically Encoding the Spatial Arrangement of
    DNA and Proteins in Self-Assembling Nanostructures.” Technische Universität München,
    2018.
  ieee: F. M. Praetorius, “Genetically encoding the spatial arrangement of DNA and
    proteins in self-assembling nanostructures,” Technische Universität München, 2018.
  ista: Praetorius FM. 2018. Genetically encoding the spatial arrangement of DNA and
    proteins in self-assembling nanostructures. Technische Universität München.
  mla: Praetorius, Florian M. <i>Genetically Encoding the Spatial Arrangement of DNA
    and Proteins in Self-Assembling Nanostructures</i>. Technische Universität München,
    2018.
  short: F.M. Praetorius, Genetically Encoding the Spatial Arrangement of DNA and
    Proteins in Self-Assembling Nanostructures, Technische Universität München, 2018.
date_created: 2023-09-06T13:11:22Z
date_published: 2018-01-16T00:00:00Z
date_updated: 2023-11-07T11:43:38Z
day: '16'
degree_awarded: PhD
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://mediatum.ub.tum.de/1398662
month: '01'
oa: 1
oa_version: Published Version
publication_status: published
publisher: Technische Universität München
status: public
supervisor:
- first_name: Hendrik
  full_name: Dietz, Hendrik
  last_name: Dietz
title: Genetically encoding the spatial arrangement of DNA and proteins in self-assembling
  nanostructures
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '9053'
abstract:
- lang: eng
  text: The development of strategies to assemble microscopic machines from dissipative
    building blocks are essential on the route to novel active materials. We recently
    demonstrated the hierarchical self-assembly of phoretic microswimmers into self-spinning
    microgears and their synchronization by diffusiophoretic interactions [Aubret
    et al., Nat. Phys., 2018]. In this paper, we adopt a pedagogical approach and
    expose our strategy to control self-assembly and build machines using phoretic
    phenomena. We notably introduce Highly Inclined Laminated Optical sheets microscopy
    (HILO) to image and characterize anisotropic and dynamic diffusiophoretic interactions,
    which cannot be performed by conventional fluorescence microscopy. The dynamics
    of a (haematite) photocatalytic material immersed in (hydrogen peroxide) fuel
    under various illumination patterns is first described and quantitatively rationalized
    by a model of diffusiophoresis, the migration of a colloidal particle in a concentration
    gradient. It is further exploited to design phototactic microswimmers that direct
    towards the high intensity of light, as a result of the reorientation of the haematite
    in a light gradient. We finally show the assembly of self-spinning microgears
    from colloidal microswimmers and carefully characterize the interactions using
    HILO techniques. The results are compared with analytical and numerical predictions
    and agree quantitatively, stressing the important role played by concentration
    gradients induced by chemical activity to control and design interactions. Because
    the approach described hereby is generic, this works paves the way for the rational
    design of machines by controlling phoretic phenomena.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Antoine
  full_name: Aubret, Antoine
  last_name: Aubret
- first_name: Jérémie A
  full_name: Palacci, Jérémie A
  id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d
  last_name: Palacci
  orcid: 0000-0002-7253-9465
citation:
  ama: Aubret A, Palacci JA. Diffusiophoretic design of self-spinning microgears from
    colloidal microswimmers. <i>Soft Matter</i>. 2018;14(47):9577-9588. doi:<a href="https://doi.org/10.1039/c8sm01760c">10.1039/c8sm01760c</a>
  apa: Aubret, A., &#38; Palacci, J. A. (2018). Diffusiophoretic design of self-spinning
    microgears from colloidal microswimmers. <i>Soft Matter</i>. Royal Society of
    Chemistry . <a href="https://doi.org/10.1039/c8sm01760c">https://doi.org/10.1039/c8sm01760c</a>
  chicago: Aubret, Antoine, and Jérémie A Palacci. “Diffusiophoretic Design of Self-Spinning
    Microgears from Colloidal Microswimmers.” <i>Soft Matter</i>. Royal Society of
    Chemistry , 2018. <a href="https://doi.org/10.1039/c8sm01760c">https://doi.org/10.1039/c8sm01760c</a>.
  ieee: A. Aubret and J. A. Palacci, “Diffusiophoretic design of self-spinning microgears
    from colloidal microswimmers,” <i>Soft Matter</i>, vol. 14, no. 47. Royal Society
    of Chemistry , pp. 9577–9588, 2018.
  ista: Aubret A, Palacci JA. 2018. Diffusiophoretic design of self-spinning microgears
    from colloidal microswimmers. Soft Matter. 14(47), 9577–9588.
  mla: Aubret, Antoine, and Jérémie A. Palacci. “Diffusiophoretic Design of Self-Spinning
    Microgears from Colloidal Microswimmers.” <i>Soft Matter</i>, vol. 14, no. 47,
    Royal Society of Chemistry , 2018, pp. 9577–88, doi:<a href="https://doi.org/10.1039/c8sm01760c">10.1039/c8sm01760c</a>.
  short: A. Aubret, J.A. Palacci, Soft Matter 14 (2018) 9577–9588.
date_created: 2021-02-01T13:44:41Z
date_published: 2018-12-21T00:00:00Z
date_updated: 2023-02-23T13:47:43Z
day: '21'
doi: 10.1039/c8sm01760c
extern: '1'
external_id:
  arxiv:
  - '1909.11121'
  pmid:
  - '30456407'
intvolume: '        14'
issue: '47'
keyword:
- General Chemistry
- Condensed Matter Physics
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1909.11121
month: '12'
oa: 1
oa_version: Preprint
page: 9577-9588
pmid: 1
publication: Soft Matter
publication_identifier:
  eissn:
  - 1744-6848
  issn:
  - 1744-683X
publication_status: published
publisher: 'Royal Society of Chemistry '
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diffusiophoretic design of self-spinning microgears from colloidal microswimmers
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 14
year: '2018'
...
---
_id: '9062'
abstract:
- lang: eng
  text: 'Self-assembly is the autonomous organization of components into patterns
    or structures: an essential ingredient of biology and a desired route to complex
    organization1. At equilibrium, the structure is encoded through specific interactions2,3,4,5,6,7,8,
    at an unfavourable entropic cost for the system. An alternative approach, widely
    used by nature, uses energy input to bypass the entropy bottleneck and develop
    features otherwise impossible at equilibrium9. Dissipative building blocks that
    inject energy locally were made available by recent advances in colloidal science10,11
    but have not been used to control self-assembly. Here we show the targeted formation
    of self-powered microgears from active particles and their autonomous synchronization
    into dynamical superstructures. We use a photoactive component that consumes fuel,
    haematite, to devise phototactic microswimmers that form self-spinning microgears
    following spatiotemporal light patterns. The gears are coupled via their chemical
    clouds by diffusiophoresis12 and constitute the elementary bricks of synchronized
    superstructures, which autonomously regulate their dynamics. The results are quantitatively
    rationalized on the basis of a stochastic description of diffusio-phoretic oscillators
    dynamically coupled by chemical gradients. Our findings harness non-equilibrium
    phoretic phenomena to program interactions and direct self-assembly with fidelity
    and specificity. It lays the groundwork for the autonomous construction of dynamical
    architectures and functional micro-machinery.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Antoine
  full_name: Aubret, Antoine
  last_name: Aubret
- first_name: Mena
  full_name: Youssef, Mena
  last_name: Youssef
- first_name: Stefano
  full_name: Sacanna, Stefano
  last_name: Sacanna
- first_name: Jérémie A
  full_name: Palacci, Jérémie A
  id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d
  last_name: Palacci
  orcid: 0000-0002-7253-9465
citation:
  ama: Aubret A, Youssef M, Sacanna S, Palacci JA. Targeted assembly and synchronization
    of self-spinning microgears. <i>Nature Physics</i>. 2018;14(11):1114-1118. doi:<a
    href="https://doi.org/10.1038/s41567-018-0227-4">10.1038/s41567-018-0227-4</a>
  apa: Aubret, A., Youssef, M., Sacanna, S., &#38; Palacci, J. A. (2018). Targeted
    assembly and synchronization of self-spinning microgears. <i>Nature Physics</i>.
    Springer Nature. <a href="https://doi.org/10.1038/s41567-018-0227-4">https://doi.org/10.1038/s41567-018-0227-4</a>
  chicago: Aubret, Antoine, Mena Youssef, Stefano Sacanna, and Jérémie A Palacci.
    “Targeted Assembly and Synchronization of Self-Spinning Microgears.” <i>Nature
    Physics</i>. Springer Nature, 2018. <a href="https://doi.org/10.1038/s41567-018-0227-4">https://doi.org/10.1038/s41567-018-0227-4</a>.
  ieee: A. Aubret, M. Youssef, S. Sacanna, and J. A. Palacci, “Targeted assembly and
    synchronization of self-spinning microgears,” <i>Nature Physics</i>, vol. 14,
    no. 11. Springer Nature, pp. 1114–1118, 2018.
  ista: Aubret A, Youssef M, Sacanna S, Palacci JA. 2018. Targeted assembly and synchronization
    of self-spinning microgears. Nature Physics. 14(11), 1114–1118.
  mla: Aubret, Antoine, et al. “Targeted Assembly and Synchronization of Self-Spinning
    Microgears.” <i>Nature Physics</i>, vol. 14, no. 11, Springer Nature, 2018, pp.
    1114–18, doi:<a href="https://doi.org/10.1038/s41567-018-0227-4">10.1038/s41567-018-0227-4</a>.
  short: A. Aubret, M. Youssef, S. Sacanna, J.A. Palacci, Nature Physics 14 (2018)
    1114–1118.
date_created: 2021-02-02T13:52:49Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2023-02-23T13:48:02Z
day: '01'
doi: 10.1038/s41567-018-0227-4
extern: '1'
external_id:
  arxiv:
  - '1810.01033'
intvolume: '        14'
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1810.01033
month: '11'
oa: 1
oa_version: Preprint
page: 1114-1118
publication: Nature Physics
publication_identifier:
  eissn:
  - 1745-2481
  issn:
  - 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Targeted assembly and synchronization of self-spinning microgears
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 14
year: '2018'
...
---
_id: '9066'
abstract:
- lang: eng
  text: The novel electronic state of the canted antiferromagnetic (AFM) insulator,
    strontium iridate (Sr2IrO4) has been well described by the spin-orbit-entangled
    isospin Jeff = 1/2, but the role of isospin in transport phenomena remains poorly
    understood. In this study, antiferromagnet-based spintronic functionality is demonstrated
    by combining unique characteristics of the isospin state in Sr2IrO4. Based on
    magnetic and transport measurements, large and highly anisotropic magnetoresistance
    (AMR) is obtained by manipulating the antiferromagnetic isospin domains. First-principles
    calculations suggest that electrons whose isospin directions are strongly coupled
    to in-plane net magnetic moment encounter the isospin mismatch when moving across
    antiferromagnetic domain boundaries, which generates a high resistance state.
    By rotating a magnetic field that aligns in-plane net moments and removes domain
    boundaries, the macroscopically-ordered isospins govern dynamic transport through
    the system, which leads to the extremely angle-sensitive AMR. As with this work
    that establishes a link between isospins and magnetotransport in strongly spin-orbit-coupled
    AFM Sr2IrO4, the peculiar AMR effect provides a beneficial foundation for fundamental
    and applied research on AFM spintronics.
article_number: '1805564'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nara
  full_name: Lee, Nara
  last_name: Lee
- first_name: Eunjung
  full_name: Ko, Eunjung
  last_name: Ko
- first_name: Hwan Young
  full_name: Choi, Hwan Young
  last_name: Choi
- first_name: Yun Jeong
  full_name: Hong, Yun Jeong
  last_name: Hong
- first_name: Muhammad
  full_name: Nauman, Muhammad
  id: 32c21954-2022-11eb-9d5f-af9f93c24e71
  last_name: Nauman
  orcid: 0000-0002-2111-4846
- first_name: Woun
  full_name: Kang, Woun
  last_name: Kang
- first_name: Hyoung Joon
  full_name: Choi, Hyoung Joon
  last_name: Choi
- first_name: Young Jai
  full_name: Choi, Young Jai
  last_name: Choi
- first_name: Younjung
  full_name: Jo, Younjung
  last_name: Jo
citation:
  ama: Lee N, Ko E, Choi HY, et al. Antiferromagnet‐based spintronic functionality
    by controlling isospin domains in a layered perovskite iridate. <i>Advanced Materials</i>.
    2018;30(52). doi:<a href="https://doi.org/10.1002/adma.201805564">10.1002/adma.201805564</a>
  apa: Lee, N., Ko, E., Choi, H. Y., Hong, Y. J., Nauman, M., Kang, W., … Jo, Y. (2018).
    Antiferromagnet‐based spintronic functionality by controlling isospin domains
    in a layered perovskite iridate. <i>Advanced Materials</i>. Wiley. <a href="https://doi.org/10.1002/adma.201805564">https://doi.org/10.1002/adma.201805564</a>
  chicago: Lee, Nara, Eunjung Ko, Hwan Young Choi, Yun Jeong Hong, Muhammad Nauman,
    Woun Kang, Hyoung Joon Choi, Young Jai Choi, and Younjung Jo. “Antiferromagnet‐based
    Spintronic Functionality by Controlling Isospin Domains in a Layered Perovskite
    Iridate.” <i>Advanced Materials</i>. Wiley, 2018. <a href="https://doi.org/10.1002/adma.201805564">https://doi.org/10.1002/adma.201805564</a>.
  ieee: N. Lee <i>et al.</i>, “Antiferromagnet‐based spintronic functionality by controlling
    isospin domains in a layered perovskite iridate,” <i>Advanced Materials</i>, vol.
    30, no. 52. Wiley, 2018.
  ista: Lee N, Ko E, Choi HY, Hong YJ, Nauman M, Kang W, Choi HJ, Choi YJ, Jo Y. 2018.
    Antiferromagnet‐based spintronic functionality by controlling isospin domains
    in a layered perovskite iridate. Advanced Materials. 30(52), 1805564.
  mla: Lee, Nara, et al. “Antiferromagnet‐based Spintronic Functionality by Controlling
    Isospin Domains in a Layered Perovskite Iridate.” <i>Advanced Materials</i>, vol.
    30, no. 52, 1805564, Wiley, 2018, doi:<a href="https://doi.org/10.1002/adma.201805564">10.1002/adma.201805564</a>.
  short: N. Lee, E. Ko, H.Y. Choi, Y.J. Hong, M. Nauman, W. Kang, H.J. Choi, Y.J.
    Choi, Y. Jo, Advanced Materials 30 (2018).
date_created: 2021-02-02T15:50:58Z
date_published: 2018-10-29T00:00:00Z
date_updated: 2021-02-03T13:58:39Z
day: '29'
doi: 10.1002/adma.201805564
extern: '1'
external_id:
  arxiv:
  - '1811.04562'
intvolume: '        30'
issue: '52'
keyword:
- Mechanical Engineering
- General Materials Science
- Mechanics of Materials
language:
- iso: eng
month: '10'
oa_version: Preprint
publication: Advanced Materials
publication_identifier:
  issn:
  - 0935-9648
  - 1521-4095
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Antiferromagnet‐based spintronic functionality by controlling isospin domains
  in a layered perovskite iridate
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2018'
...
---
_id: '9068'
abstract:
- lang: eng
  text: We report the temperature-dependent resistivity ρ(T) of chalcogenide NiS2-xSex
    (x = 0.1) using hydrostatic pressure as a control parameter in the temperature
    range of 4–300 K. The insulating behavior of ρ(T) survives at low temperatures
    in the pressure regime below 7.5 kbar, whereas a clear insulator-to-metallic transition
    is observed above 7.5 kbar. Two types of magnetic transitions, from the paramagnetic
    (PM) to the antiferromagnetic (AFM) state and from the AFM state to the weak ferromagnetic
    (WF) state, were evaluated and confirmed by magnetization measurement. According
    to the temperature–pressure phase diagram, the WF phase survives up to 7.5 kbar,
    and the transition temperature of the WF transition decreases as the pressure
    increases, whereas the metal–insulator transition temperature increases up to
    9.4 kbar. We analyzed the metallic behavior and proposed Fermi-liquid behavior
    of NiS1.9Se0.1.
article_processing_charge: No
article_type: original
author:
- first_name: Tayyaba
  full_name: Hussain, Tayyaba
  last_name: Hussain
- first_name: Myeong-jun
  full_name: Oh, Myeong-jun
  last_name: Oh
- first_name: Muhammad
  full_name: Nauman, Muhammad
  id: 32c21954-2022-11eb-9d5f-af9f93c24e71
  last_name: Nauman
  orcid: 0000-0002-2111-4846
- first_name: Younjung
  full_name: Jo, Younjung
  last_name: Jo
- first_name: Garam
  full_name: Han, Garam
  last_name: Han
- first_name: Changyoung
  full_name: Kim, Changyoung
  last_name: Kim
- first_name: Woun
  full_name: Kang, Woun
  last_name: Kang
citation:
  ama: 'Hussain T, Oh M, Nauman M, et al. Pressure-induced metal–insulator transitions
    in chalcogenide NiS2-Se. <i>Physica B: Condensed Matter</i>. 2018;536:235-238.
    doi:<a href="https://doi.org/10.1016/j.physb.2017.11.032">10.1016/j.physb.2017.11.032</a>'
  apa: 'Hussain, T., Oh, M., Nauman, M., Jo, Y., Han, G., Kim, C., &#38; Kang, W.
    (2018). Pressure-induced metal–insulator transitions in chalcogenide NiS2-Se.
    <i>Physica B: Condensed Matter</i>. Elsevier. <a href="https://doi.org/10.1016/j.physb.2017.11.032">https://doi.org/10.1016/j.physb.2017.11.032</a>'
  chicago: 'Hussain, Tayyaba, Myeong-jun Oh, Muhammad Nauman, Younjung Jo, Garam Han,
    Changyoung Kim, and Woun Kang. “Pressure-Induced Metal–Insulator Transitions in
    Chalcogenide NiS2-Se.” <i>Physica B: Condensed Matter</i>. Elsevier, 2018. <a
    href="https://doi.org/10.1016/j.physb.2017.11.032">https://doi.org/10.1016/j.physb.2017.11.032</a>.'
  ieee: 'T. Hussain <i>et al.</i>, “Pressure-induced metal–insulator transitions in
    chalcogenide NiS2-Se,” <i>Physica B: Condensed Matter</i>, vol. 536. Elsevier,
    pp. 235–238, 2018.'
  ista: 'Hussain T, Oh M, Nauman M, Jo Y, Han G, Kim C, Kang W. 2018. Pressure-induced
    metal–insulator transitions in chalcogenide NiS2-Se. Physica B: Condensed Matter.
    536, 235–238.'
  mla: 'Hussain, Tayyaba, et al. “Pressure-Induced Metal–Insulator Transitions in
    Chalcogenide NiS2-Se.” <i>Physica B: Condensed Matter</i>, vol. 536, Elsevier,
    2018, pp. 235–38, doi:<a href="https://doi.org/10.1016/j.physb.2017.11.032">10.1016/j.physb.2017.11.032</a>.'
  short: 'T. Hussain, M. Oh, M. Nauman, Y. Jo, G. Han, C. Kim, W. Kang, Physica B:
    Condensed Matter 536 (2018) 235–238.'
date_created: 2021-02-02T15:52:43Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2021-02-04T07:18:57Z
day: '01'
doi: 10.1016/j.physb.2017.11.032
extern: '1'
intvolume: '       536'
language:
- iso: eng
month: '05'
oa_version: None
page: 235-238
publication: 'Physica B: Condensed Matter'
publication_identifier:
  issn:
  - 0921-4526
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Pressure-induced metal–insulator transitions in chalcogenide NiS2-Se
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 536
year: '2018'
...
---
_id: '913'
abstract:
- lang: eng
  text: Coordinated cell polarization in developing tissues is a recurrent theme in
    multicellular organisms. In plants, a directional distribution of the plant hormone
    auxin is at the core of many developmental programs. A feedback regulation of
    auxin on the polarized localization of PIN auxin transporters in individual cells
    has been proposed as a self-organizing mechanism for coordinated tissue polarization,
    but the molecular mechanisms linking auxin signalling to PIN-dependent auxin transport
    remain unknown. We performed a microarray-based approach to find regulators of
    the auxin-induced PIN relocation in the Arabidopsis thaliana root. We identified
    a subset of a family of phosphatidylinositol transfer proteins (PITP), the PATELLINs
    (PATL). Here, we show that PATLs are expressed in partially overlapping cells
    types in different tissues going through mitosis or initiating differentiation
    programs. PATLs are plasma membrane-associated proteins accumulated in Arabidopsis
    embryos, primary roots, lateral root primordia, and developing stomata. Higher
    order patl mutants display reduced PIN1 repolarization in response to auxin, shorter
    root apical meristem, and drastic defects in embryo and seedling development.
    This suggests PATLs redundantly play a crucial role in polarity and patterning
    in Arabidopsis.
article_number: jcs.204198
article_processing_charge: No
author:
- first_name: Ricardo
  full_name: Tejos, Ricardo
  last_name: Tejos
- first_name: Cecilia
  full_name: Rodríguez Furlán, Cecilia
  last_name: Rodríguez Furlán
- first_name: Maciek
  full_name: Adamowski, Maciek
  id: 45F536D2-F248-11E8-B48F-1D18A9856A87
  last_name: Adamowski
  orcid: 0000-0001-6463-5257
- first_name: Michael
  full_name: Sauer, Michael
  last_name: Sauer
- first_name: Lorena
  full_name: Norambuena, Lorena
  last_name: Norambuena
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. PATELLINS
    are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis
    thaliana. <i>Journal of Cell Science</i>. 2018;131(2). doi:<a href="https://doi.org/10.1242/jcs.204198">10.1242/jcs.204198</a>
  apa: Tejos, R., Rodríguez Furlán, C., Adamowski, M., Sauer, M., Norambuena, L.,
    &#38; Friml, J. (2018). PATELLINS are regulators of auxin mediated PIN1 relocation
    and plant development in Arabidopsis thaliana. <i>Journal of Cell Science</i>.
    Company of Biologists. <a href="https://doi.org/10.1242/jcs.204198">https://doi.org/10.1242/jcs.204198</a>
  chicago: Tejos, Ricardo, Cecilia Rodríguez Furlán, Maciek Adamowski, Michael Sauer,
    Lorena Norambuena, and Jiří Friml. “PATELLINS Are Regulators of Auxin Mediated
    PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” <i>Journal of
    Cell Science</i>. Company of Biologists, 2018. <a href="https://doi.org/10.1242/jcs.204198">https://doi.org/10.1242/jcs.204198</a>.
  ieee: R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, and
    J. Friml, “PATELLINS are regulators of auxin mediated PIN1 relocation and plant
    development in Arabidopsis thaliana,” <i>Journal of Cell Science</i>, vol. 131,
    no. 2. Company of Biologists, 2018.
  ista: Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J.
    2018. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development
    in Arabidopsis thaliana. Journal of Cell Science. 131(2), jcs. 204198.
  mla: Tejos, Ricardo, et al. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation
    and Plant Development in Arabidopsis Thaliana.” <i>Journal of Cell Science</i>,
    vol. 131, no. 2, jcs. 204198, Company of Biologists, 2018, doi:<a href="https://doi.org/10.1242/jcs.204198">10.1242/jcs.204198</a>.
  short: R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, J.
    Friml, Journal of Cell Science 131 (2018).
date_created: 2018-12-11T11:49:10Z
date_published: 2018-01-29T00:00:00Z
date_updated: 2025-05-07T11:12:29Z
day: '29'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1242/jcs.204198
ec_funded: 1
external_id:
  isi:
  - '000424842400019'
file:
- access_level: open_access
  checksum: bf156c20a4f117b4b932370d54cbac8c
  content_type: application/pdf
  creator: dernst
  date_created: 2019-04-12T08:46:32Z
  date_updated: 2020-07-14T12:48:15Z
  file_id: '6299'
  file_name: 2017_adamowski_PATELLINS_are.pdf
  file_size: 14925985
  relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: '       131'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '282300'
  name: Polarity and subcellular dynamics in plants
publication: Journal of Cell Science
publication_identifier:
  issn:
  - '00219533'
publication_status: published
publisher: Company of Biologists
publist_id: '6530'
pubrep_id: '988'
quality_controlled: '1'
scopus_import: '1'
status: public
title: PATELLINS are regulators of auxin mediated PIN1 relocation and plant development
  in Arabidopsis thaliana
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 131
year: '2018'
...
---
_id: '9134'
abstract:
- lang: eng
  text: Several studies have shown the existence of a critical latitude where the
    dissipation of internal tides is strongly enhanced. Internal tides are internal
    waves generated by barotropic tidal currents impinging rough topography at the
    seafloor. Their dissipation and concomitant diapycnal mixing are believed to be
    important for water masses and the large‐scale ocean circulation. The purpose
    of this study is to clarify the physical processes at the origin of this strong
    latitudinal dependence of tidal energy dissipation. We find that different mechanisms
    are involved equatorward and poleward of the critical latitude. Triadic resonant
    instabilities are responsible for the dissipation of internal tides equatorward
    of the critical latitude. In particular, a dominant triad involving the primary
    internal tide and near‐inertial waves is key. At the critical latitude, the peak
    of energy dissipation is explained by both increased instability growth rates,
    and smaller scales of secondary waves thus more prone to break and dissipate their
    energy. Surprisingly, poleward of the critical latitude, the generation of evanescent
    waves appears to be crucial. Triadic instabilities have been widely studied, but
    the transfer of energy to evanescent waves has received comparatively little attention.
    Our work suggests that the nonlinear transfer of energy from the internal tide
    to evanescent waves (corresponding to the 2f‐pump mechanism described by Young
    et al., 2008, https://doi.org/10.1017/S0022112008001742) is an efficient mechanism
    to dissipate internal tide energy near and poleward of the critical latitude.
    The theoretical results are confirmed in idealized high‐resolution numerical simulations
    of a barotropic M2 tide impinging sinusoidal topography in a linearly stratified
    fluid.
article_processing_charge: No
article_type: original
author:
- first_name: O.
  full_name: Richet, O.
  last_name: Richet
- first_name: J.-M.
  full_name: Chomaz, J.-M.
  last_name: Chomaz
- first_name: Caroline J
  full_name: Muller, Caroline J
  id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
  last_name: Muller
  orcid: 0000-0001-5836-5350
citation:
  ama: 'Richet O, Chomaz J-M, Muller CJ. Internal tide dissipation at topography:
    Triadic resonant instability equatorward and evanescent waves poleward of the
    critical latitude. <i>Journal of Geophysical Research: Oceans</i>. 2018;123(9):6136-6155.
    doi:<a href="https://doi.org/10.1029/2017jc013591">10.1029/2017jc013591</a>'
  apa: 'Richet, O., Chomaz, J.-M., &#38; Muller, C. J. (2018). Internal tide dissipation
    at topography: Triadic resonant instability equatorward and evanescent waves poleward
    of the critical latitude. <i>Journal of Geophysical Research: Oceans</i>. American
    Geophysical Union. <a href="https://doi.org/10.1029/2017jc013591">https://doi.org/10.1029/2017jc013591</a>'
  chicago: 'Richet, O., J.-M. Chomaz, and Caroline J Muller. “Internal Tide Dissipation
    at Topography: Triadic Resonant Instability Equatorward and Evanescent Waves Poleward
    of the Critical Latitude.” <i>Journal of Geophysical Research: Oceans</i>. American
    Geophysical Union, 2018. <a href="https://doi.org/10.1029/2017jc013591">https://doi.org/10.1029/2017jc013591</a>.'
  ieee: 'O. Richet, J.-M. Chomaz, and C. J. Muller, “Internal tide dissipation at
    topography: Triadic resonant instability equatorward and evanescent waves poleward
    of the critical latitude,” <i>Journal of Geophysical Research: Oceans</i>, vol.
    123, no. 9. American Geophysical Union, pp. 6136–6155, 2018.'
  ista: 'Richet O, Chomaz J-M, Muller CJ. 2018. Internal tide dissipation at topography:
    Triadic resonant instability equatorward and evanescent waves poleward of the
    critical latitude. Journal of Geophysical Research: Oceans. 123(9), 6136–6155.'
  mla: 'Richet, O., et al. “Internal Tide Dissipation at Topography: Triadic Resonant
    Instability Equatorward and Evanescent Waves Poleward of the Critical Latitude.”
    <i>Journal of Geophysical Research: Oceans</i>, vol. 123, no. 9, American Geophysical
    Union, 2018, pp. 6136–55, doi:<a href="https://doi.org/10.1029/2017jc013591">10.1029/2017jc013591</a>.'
  short: 'O. Richet, J.-M. Chomaz, C.J. Muller, Journal of Geophysical Research: Oceans
    123 (2018) 6136–6155.'
date_created: 2021-02-15T14:17:25Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2022-01-24T12:39:03Z
day: '01'
doi: 10.1029/2017jc013591
extern: '1'
intvolume: '       123'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1029/2017JC013591
month: '09'
oa: 1
oa_version: Published Version
page: 6136-6155
publication: 'Journal of Geophysical Research: Oceans'
publication_identifier:
  issn:
  - 2169-9275
publication_status: published
publisher: American Geophysical Union
quality_controlled: '1'
status: public
title: 'Internal tide dissipation at topography: Triadic resonant instability equatorward
  and evanescent waves poleward of the critical latitude'
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 123
year: '2018'
...
---
_id: '9135'
abstract:
- lang: eng
  text: Idealized simulations of tropical moist convection have revealed that clouds
    can spontaneously clump together in a process called self-aggregation. This results
    in a state where a moist cloudy region with intense deep convection is surrounded
    by extremely dry subsiding air devoid of deep convection. Because of the idealized
    settings of the simulations where it was discovered, the relevance of self-aggregation
    to the real world is still debated. Here, we show that self-aggregation feedbacks
    play a leading-order role in the spontaneous genesis of tropical cyclones in cloud-resolving
    simulations. Those feedbacks accelerate the cyclogenesis process by a factor of
    2, and the feedbacks contributing to the cyclone formation show qualitative and
    quantitative agreement with the self-aggregation process. Once the cyclone is
    formed, wind-induced surface heat exchange (WISHE) effects dominate, although
    we find that self-aggregation feedbacks have a small but nonnegligible contribution
    to the maintenance of the mature cyclone. Our results suggest that self-aggregation,
    and the framework developed for its study, can help shed more light into the physical
    processes leading to cyclogenesis and cyclone intensification. In particular,
    our results point out the importance of the longwave radiative cooling outside
    the cyclone.
article_processing_charge: No
article_type: original
author:
- first_name: Caroline J
  full_name: Muller, Caroline J
  id: f978ccb0-3f7f-11eb-b193-b0e2bd13182b
  last_name: Muller
  orcid: 0000-0001-5836-5350
- first_name: David M.
  full_name: Romps, David M.
  last_name: Romps
citation:
  ama: Muller CJ, Romps DM. Acceleration of tropical cyclogenesis by self-aggregation
    feedbacks. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(12):2930-2935.
    doi:<a href="https://doi.org/10.1073/pnas.1719967115">10.1073/pnas.1719967115</a>
  apa: Muller, C. J., &#38; Romps, D. M. (2018). Acceleration of tropical cyclogenesis
    by self-aggregation feedbacks. <i>Proceedings of the National Academy of Sciences</i>.
    Proceedings of the National Academy of Sciences. <a href="https://doi.org/10.1073/pnas.1719967115">https://doi.org/10.1073/pnas.1719967115</a>
  chicago: Muller, Caroline J, and David M. Romps. “Acceleration of Tropical Cyclogenesis
    by Self-Aggregation Feedbacks.” <i>Proceedings of the National Academy of Sciences</i>.
    Proceedings of the National Academy of Sciences, 2018. <a href="https://doi.org/10.1073/pnas.1719967115">https://doi.org/10.1073/pnas.1719967115</a>.
  ieee: C. J. Muller and D. M. Romps, “Acceleration of tropical cyclogenesis by self-aggregation
    feedbacks,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115,
    no. 12. Proceedings of the National Academy of Sciences, pp. 2930–2935, 2018.
  ista: Muller CJ, Romps DM. 2018. Acceleration of tropical cyclogenesis by self-aggregation
    feedbacks. Proceedings of the National Academy of Sciences. 115(12), 2930–2935.
  mla: Muller, Caroline J., and David M. Romps. “Acceleration of Tropical Cyclogenesis
    by Self-Aggregation Feedbacks.” <i>Proceedings of the National Academy of Sciences</i>,
    vol. 115, no. 12, Proceedings of the National Academy of Sciences, 2018, pp. 2930–35,
    doi:<a href="https://doi.org/10.1073/pnas.1719967115">10.1073/pnas.1719967115</a>.
  short: C.J. Muller, D.M. Romps, Proceedings of the National Academy of Sciences
    115 (2018) 2930–2935.
date_created: 2021-02-15T14:18:16Z
date_published: 2018-03-20T00:00:00Z
date_updated: 2022-01-24T12:39:49Z
day: '20'
doi: 10.1073/pnas.1719967115
extern: '1'
intvolume: '       115'
issue: '12'
keyword:
- Multidisciplinary
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1073/pnas.1719967115
month: '03'
oa: 1
oa_version: Published Version
page: 2930-2935
publication: Proceedings of the National Academy of Sciences
publication_identifier:
  issn:
  - 0027-8424
  - 1091-6490
publication_status: published
publisher: Proceedings of the National Academy of Sciences
quality_controlled: '1'
status: public
title: Acceleration of tropical cyclogenesis by self-aggregation feedbacks
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 115
year: '2018'
...
