---
_id: '160'
abstract:
- lang: eng
text: We present layered concurrent programs, a compact and expressive notation
for specifying refinement proofs of concurrent programs. A layered concurrent
program specifies a sequence of connected concurrent programs, from most concrete
to most abstract, such that common parts of different programs are written exactly
once. These programs are expressed in the ordinary syntax of imperative concurrent
programs using gated atomic actions, sequencing, choice, and (recursive) procedure
calls. Each concurrent program is automatically extracted from the layered program.
We reduce refinement to the safety of a sequence of concurrent checker programs,
one each to justify the connection between every two consecutive concurrent programs.
These checker programs are also automatically extracted from the layered program.
Layered concurrent programs have been implemented in the CIVL verifier which has
been successfully used for the verification of several complex concurrent programs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
citation:
ama: 'Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102.
doi:10.1007/978-3-319-96145-3_5'
apa: 'Kragl, B., & Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981,
pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer.
https://doi.org/10.1007/978-3-319-96145-3_5'
chicago: Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102.
Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_5.
ieee: 'B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV:
Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.'
ista: 'Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided
Verification, LNCS, vol. 10981, 79–102.'
mla: Kragl, Bernhard, and Shaz Qadeer. Layered Concurrent Programs. Vol.
10981, Springer, 2018, pp. 79–102, doi:10.1007/978-3-319-96145-3_5.
short: B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.
conference:
end_date: 2018-07-17
location: Oxford, UK
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:57Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-13T08:45:09Z
day: '18'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_5
external_id:
isi:
- '000491481600005'
file:
- access_level: open_access
checksum: c64fff560fe5a7532ec10626ad1c215e
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:52:12Z
date_updated: 2020-07-14T12:45:04Z
file_id: '5705'
file_name: 2018_LNCS_Kragl.pdf
file_size: 1603844
relation: main_file
file_date_updated: 2020-07-14T12:45:04Z
has_accepted_license: '1'
intvolume: ' 10981'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: 79 - 102
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '7761'
quality_controlled: '1'
related_material:
record:
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Layered Concurrent Programs
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: '161'
abstract:
- lang: eng
text: 'Which properties of metabolic networks can be derived solely from stoichiometry?
Predictive results have been obtained by flux balance analysis (FBA), by postulating
that cells set metabolic fluxes to maximize growth rate. Here we consider a generalization
of FBA to single-cell level using maximum entropy modeling, which we extend and
test experimentally. Specifically, we define for Escherichia coli metabolism a
flux distribution that yields the experimental growth rate: the model, containing
FBA as a limit, provides a better match to measured fluxes and it makes a wide
range of predictions: on flux variability, regulation, and correlations; on the
relative importance of stoichiometry vs. optimization; on scaling relations for
growth rate distributions. We validate the latter here with single-cell data at
different sub-inhibitory antibiotic concentrations. The model quantifies growth
optimization as emerging from the interplay of competitive dynamics in the population
and regulation of metabolism at the level of single cells.'
article_number: '2988'
article_processing_charge: No
author:
- first_name: Daniele
full_name: De Martino, Daniele
id: 3FF5848A-F248-11E8-B48F-1D18A9856A87
last_name: De Martino
orcid: 0000-0002-5214-4706
- first_name: Andersson Anna
full_name: Mc, Andersson Anna
last_name: Mc
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: De Martino D, Mc AA, Bergmiller T, Guet CC, Tkačik G. Statistical mechanics
for metabolic networks during steady state growth. Nature Communications.
2018;9(1). doi:10.1038/s41467-018-05417-9
apa: De Martino, D., Mc, A. A., Bergmiller, T., Guet, C. C., & Tkačik, G. (2018).
Statistical mechanics for metabolic networks during steady state growth. Nature
Communications. Springer Nature. https://doi.org/10.1038/s41467-018-05417-9
chicago: De Martino, Daniele, Andersson Anna Mc, Tobias Bergmiller, Calin C Guet,
and Gašper Tkačik. “Statistical Mechanics for Metabolic Networks during Steady
State Growth.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-05417-9.
ieee: D. De Martino, A. A. Mc, T. Bergmiller, C. C. Guet, and G. Tkačik, “Statistical
mechanics for metabolic networks during steady state growth,” Nature Communications,
vol. 9, no. 1. Springer Nature, 2018.
ista: De Martino D, Mc AA, Bergmiller T, Guet CC, Tkačik G. 2018. Statistical mechanics
for metabolic networks during steady state growth. Nature Communications. 9(1),
2988.
mla: De Martino, Daniele, et al. “Statistical Mechanics for Metabolic Networks during
Steady State Growth.” Nature Communications, vol. 9, no. 1, 2988, Springer
Nature, 2018, doi:10.1038/s41467-018-05417-9.
short: D. De Martino, A.A. Mc, T. Bergmiller, C.C. Guet, G. Tkačik, Nature Communications
9 (2018).
date_created: 2018-12-11T11:44:57Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2024-02-21T13:45:39Z
day: '30'
ddc:
- '570'
department:
- _id: GaTk
- _id: CaGu
doi: 10.1038/s41467-018-05417-9
ec_funded: 1
external_id:
isi:
- '000440149300021'
file:
- access_level: open_access
checksum: 3ba7ab27b27723c7dcf633e8fc1f8f18
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:44:28Z
date_updated: 2020-07-14T12:45:06Z
file_id: '5728'
file_name: 2018_NatureComm_DeMartino.pdf
file_size: 1043205
relation: main_file
file_date_updated: 2020-07-14T12:45:06Z
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Nature Communications
publication_status: published
publisher: Springer Nature
publist_id: '7760'
quality_controlled: '1'
related_material:
record:
- id: '5587'
relation: popular_science
status: public
scopus_import: '1'
status: public
title: Statistical mechanics for metabolic networks during steady state growth
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: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 9
year: '2018'
...
---
_id: '13055'
abstract:
- lang: eng
text: "Dataset for manuscript 'Social network plasticity decreases disease transmission
in a eusocial insect'\r\nCompared to previous versions: - raw image files added\r\n
\ - correction of URLs within
README.txt file\r\n"
article_processing_charge: No
author:
- first_name: Nathalie
full_name: Stroeymeyt, Nathalie
last_name: Stroeymeyt
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Alessandro
full_name: Crespi, Alessandro
last_name: Crespi
- first_name: Danielle
full_name: Mersch, Danielle
last_name: Mersch
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Laurent
full_name: Keller, Laurent
last_name: Keller
citation:
ama: Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network
plasticity decreases disease transmission in a eusocial insect. 2018. doi:10.5281/ZENODO.1322669
apa: Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller,
L. (2018). Social network plasticity decreases disease transmission in a eusocial
insect. Zenodo. https://doi.org/10.5281/ZENODO.1322669
chicago: Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch,
Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease
Transmission in a Eusocial Insect.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.1322669.
ieee: N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller,
“Social network plasticity decreases disease transmission in a eusocial insect.”
Zenodo, 2018.
ista: Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social
network plasticity decreases disease transmission in a eusocial insect, Zenodo,
10.5281/ZENODO.1322669.
mla: Stroeymeyt, Nathalie, et al. Social Network Plasticity Decreases Disease
Transmission in a Eusocial Insect. Zenodo, 2018, doi:10.5281/ZENODO.1322669.
short: N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, (2018).
date_created: 2023-05-23T13:24:51Z
date_published: 2018-10-23T00:00:00Z
date_updated: 2023-10-17T11:50:04Z
day: '23'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.5281/ZENODO.1322669
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.1480665
month: '10'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '7'
relation: used_in_publication
status: public
status: public
title: Social network plasticity decreases disease transmission in a eusocial insect
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '13059'
abstract:
- lang: eng
text: "This dataset contains a GitHub repository containing all the data, analysis,
Nextflow workflows and Jupyter notebooks to replicate the manuscript titled \"Fast
and accurate large multiple sequence alignments with a root-to-leaf regressive
method\".\r\nIt also contains the Multiple Sequence Alignments (MSAs) generated
and well as the main figures and tables from the manuscript.\r\nThe repository
is also available at GitHub (https://github.com/cbcrg/dpa-analysis) release `v1.2`.\r\nFor
details on how to use the regressive alignment algorithm, see the T-Coffee software
suite (https://github.com/cbcrg/tcoffee)."
article_processing_charge: No
author:
- first_name: Edgar
full_name: Garriga, Edgar
last_name: Garriga
- first_name: Paolo
full_name: di Tommaso, Paolo
last_name: di Tommaso
- first_name: Cedrik
full_name: Magis, Cedrik
last_name: Magis
- first_name: Ionas
full_name: Erb, Ionas
last_name: Erb
- first_name: Leila
full_name: Mansouri, Leila
last_name: Mansouri
- first_name: Athanasios
full_name: Baltzis, Athanasios
last_name: Baltzis
- first_name: Hafid
full_name: Laayouni, Hafid
last_name: Laayouni
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Evan
full_name: Floden, Evan
last_name: Floden
- first_name: Cedric
full_name: Notredame, Cedric
last_name: Notredame
citation:
ama: Garriga E, di Tommaso P, Magis C, et al. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method. 2018. doi:10.5281/ZENODO.2025846
apa: Garriga, E., di Tommaso, P., Magis, C., Erb, I., Mansouri, L., Baltzis, A.,
… Notredame, C. (2018). Fast and accurate large multiple sequence alignments with
a root-to-leaf regressive method. Zenodo. https://doi.org/10.5281/ZENODO.2025846
chicago: Garriga, Edgar, Paolo di Tommaso, Cedrik Magis, Ionas Erb, Leila Mansouri,
Athanasios Baltzis, Hafid Laayouni, Fyodor Kondrashov, Evan Floden, and Cedric
Notredame. “Fast and Accurate Large Multiple Sequence Alignments with a Root-to-Leaf
Regressive Method.” Zenodo, 2018. https://doi.org/10.5281/ZENODO.2025846.
ieee: E. Garriga et al., “Fast and accurate large multiple sequence alignments
with a root-to-leaf regressive method.” Zenodo, 2018.
ista: Garriga E, di Tommaso P, Magis C, Erb I, Mansouri L, Baltzis A, Laayouni H,
Kondrashov F, Floden E, Notredame C. 2018. Fast and accurate large multiple sequence
alignments with a root-to-leaf regressive method, Zenodo, 10.5281/ZENODO.2025846.
mla: Garriga, Edgar, et al. Fast and Accurate Large Multiple Sequence Alignments
with a Root-to-Leaf Regressive Method. Zenodo, 2018, doi:10.5281/ZENODO.2025846.
short: E. Garriga, P. di Tommaso, C. Magis, I. Erb, L. Mansouri, A. Baltzis, H.
Laayouni, F. Kondrashov, E. Floden, C. Notredame, (2018).
date_created: 2023-05-23T16:08:20Z
date_published: 2018-12-07T00:00:00Z
date_updated: 2023-09-06T14:32:51Z
day: '07'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.5281/ZENODO.2025846
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/zenodo.3271452
month: '12'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '7181'
relation: used_in_publication
status: public
status: public
title: Fast and accurate large multiple sequence alignments with a root-to-leaf regressive
method
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: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '131'
abstract:
- lang: eng
text: 'XY systems usually show chromosome-wide compensation of X-linked genes, while
in many ZW systems, compensation is restricted to a minority of dosage-sensitive
genes. Why such differences arose is still unclear. Here, we combine comparative
genomics, transcriptomics and proteomics to obtain a complete overview of the
evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare
the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium)
and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary
strata. We use these to assess gene expression evolution following sex-linkage.
The resulting patterns suggest a reduction in expression of Z-linked genes in
females, combined with upregulation of the Z in both sexes, in line with the first
step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics
suggest that post-transcriptional mechanisms do not play a major role in balancing
the expression of Z-linked genes. '
acknowledgement: We are grateful to Lu Dabing (Soochow University, Suzhou, China)
for providing Schistosoma japonicum samples, to Ariana Macon (IST Austria) and Georgette
Stovall (JLU Giessen) for technical assistance, to IT support at IST Austria for
providing optimal environment to bioinformatic analyses, and to the Vicoso lab for
comments on the manuscript.
article_number: e35684
article_processing_charge: No
article_type: original
author:
- first_name: Marion A
full_name: Picard, Marion A
id: 2C921A7A-F248-11E8-B48F-1D18A9856A87
last_name: Picard
orcid: 0000-0002-8101-2518
- first_name: Celine
full_name: Cosseau, Celine
last_name: Cosseau
- first_name: Sabrina
full_name: Ferré, Sabrina
last_name: Ferré
- first_name: Thomas
full_name: Quack, Thomas
last_name: Quack
- first_name: Christoph
full_name: Grevelding, Christoph
last_name: Grevelding
- first_name: Yohann
full_name: Couté, Yohann
last_name: Couté
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: Picard MAL, Cosseau C, Ferré S, et al. Evolution of gene dosage on the Z-chromosome
of schistosome parasites. eLife. 2018;7. doi:10.7554/eLife.35684
apa: Picard, M. A. L., Cosseau, C., Ferré, S., Quack, T., Grevelding, C., Couté,
Y., & Vicoso, B. (2018). Evolution of gene dosage on the Z-chromosome of schistosome
parasites. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.35684
chicago: Picard, Marion A L, Celine Cosseau, Sabrina Ferré, Thomas Quack, Christoph
Grevelding, Yohann Couté, and Beatriz Vicoso. “Evolution of Gene Dosage on the
Z-Chromosome of Schistosome Parasites.” ELife. eLife Sciences Publications,
2018. https://doi.org/10.7554/eLife.35684.
ieee: M. A. L. Picard et al., “Evolution of gene dosage on the Z-chromosome
of schistosome parasites,” eLife, vol. 7. eLife Sciences Publications,
2018.
ista: Picard MAL, Cosseau C, Ferré S, Quack T, Grevelding C, Couté Y, Vicoso B.
2018. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife.
7, e35684.
mla: Picard, Marion A. L., et al. “Evolution of Gene Dosage on the Z-Chromosome
of Schistosome Parasites.” ELife, vol. 7, e35684, eLife Sciences Publications,
2018, doi:10.7554/eLife.35684.
short: M.A.L. Picard, C. Cosseau, S. Ferré, T. Quack, C. Grevelding, Y. Couté, B.
Vicoso, ELife 7 (2018).
date_created: 2018-12-11T11:44:47Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2024-02-21T13:45:12Z
day: '13'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.7554/eLife.35684
external_id:
isi:
- '000441388200001'
file:
- access_level: open_access
checksum: d6331d4385b1fffd6b47b45d5949d841
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T11:55:05Z
date_updated: 2020-07-14T12:44:43Z
file_id: '5695'
file_name: 2018_eLife_Picard.pdf
file_size: 3158125
relation: main_file
file_date_updated: 2020-07-14T12:44:43Z
has_accepted_license: '1'
intvolume: ' 7'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 250ED89C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28842-B22
name: Sex chromosome evolution under male- and female- heterogamety
publication: eLife
publication_status: published
publisher: eLife Sciences Publications
publist_id: '7792'
quality_controlled: '1'
related_material:
record:
- id: '5586'
relation: popular_science
status: public
scopus_import: '1'
status: public
title: Evolution of gene dosage on the Z-chromosome of schistosome parasites
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: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7
year: '2018'
...
---
_id: '132'
abstract:
- lang: eng
text: Pancreas development involves a coordinated process in which an early phase
of cell segregation is followed by a longer phase of lineage restriction, expansion,
and tissue remodeling. By combining clonal tracing and whole-mount reconstruction
with proliferation kinetics and single-cell transcriptional profiling, we define
the functional basis of pancreas morphogenesis. We show that the large-scale organization
of mouse pancreas can be traced to the activity of self-renewing precursors positioned
at the termini of growing ducts, which act collectively to drive serial rounds
of stochastic ductal bifurcation balanced by termination. During this phase of
branching morphogenesis, multipotent precursors become progressively fate-restricted,
giving rise to self-renewing acinar-committed precursors that are conveyed with
growing ducts, as well as ductal progenitors that expand the trailing ducts and
give rise to delaminating endocrine cells. These findings define quantitatively
how the functional behavior and lineage progression of precursor pools determine
the large-scale patterning of pancreatic sub-compartments.
acknowledgement: E.H. is funded by a Junior Research Fellowship from Trinity College,
Cam-bridge, a Sir Henry Wellcome Fellowship from the Wellcome Trust, and theBettencourt-Schueller
Young Researcher Prize for support.
article_processing_charge: No
article_type: original
author:
- first_name: Magdalena
full_name: Sznurkowska, Magdalena
last_name: Sznurkowska
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Roberta
full_name: Azzarelli, Roberta
last_name: Azzarelli
- first_name: Steffen
full_name: Rulands, Steffen
last_name: Rulands
- first_name: Sonia
full_name: Nestorowa, Sonia
last_name: Nestorowa
- first_name: Christopher
full_name: Hindley, Christopher
last_name: Hindley
- first_name: Jennifer
full_name: Nichols, Jennifer
last_name: Nichols
- first_name: Berthold
full_name: Göttgens, Berthold
last_name: Göttgens
- first_name: Meritxell
full_name: Huch, Meritxell
last_name: Huch
- first_name: Anna
full_name: Philpott, Anna
last_name: Philpott
- first_name: Benjamin
full_name: Simons, Benjamin
last_name: Simons
citation:
ama: Sznurkowska M, Hannezo EB, Azzarelli R, et al. Defining lineage potential and
fate behavior of precursors during pancreas development. Developmental Cell.
2018;46(3):360-375. doi:10.1016/j.devcel.2018.06.028
apa: Sznurkowska, M., Hannezo, E. B., Azzarelli, R., Rulands, S., Nestorowa, S.,
Hindley, C., … Simons, B. (2018). Defining lineage potential and fate behavior
of precursors during pancreas development. Developmental Cell. Cell Press.
https://doi.org/10.1016/j.devcel.2018.06.028
chicago: Sznurkowska, Magdalena, Edouard B Hannezo, Roberta Azzarelli, Steffen Rulands,
Sonia Nestorowa, Christopher Hindley, Jennifer Nichols, et al. “Defining Lineage
Potential and Fate Behavior of Precursors during Pancreas Development.” Developmental
Cell. Cell Press, 2018. https://doi.org/10.1016/j.devcel.2018.06.028.
ieee: M. Sznurkowska et al., “Defining lineage potential and fate behavior
of precursors during pancreas development,” Developmental Cell, vol. 46,
no. 3. Cell Press, pp. 360–375, 2018.
ista: Sznurkowska M, Hannezo EB, Azzarelli R, Rulands S, Nestorowa S, Hindley C,
Nichols J, Göttgens B, Huch M, Philpott A, Simons B. 2018. Defining lineage potential
and fate behavior of precursors during pancreas development. Developmental Cell.
46(3), 360–375.
mla: Sznurkowska, Magdalena, et al. “Defining Lineage Potential and Fate Behavior
of Precursors during Pancreas Development.” Developmental Cell, vol. 46,
no. 3, Cell Press, 2018, pp. 360–75, doi:10.1016/j.devcel.2018.06.028.
short: M. Sznurkowska, E.B. Hannezo, R. Azzarelli, S. Rulands, S. Nestorowa, C.
Hindley, J. Nichols, B. Göttgens, M. Huch, A. Philpott, B. Simons, Developmental
Cell 46 (2018) 360–375.
date_created: 2018-12-11T11:44:48Z
date_published: 2018-08-06T00:00:00Z
date_updated: 2023-09-11T12:52:41Z
day: '06'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1016/j.devcel.2018.06.028
external_id:
isi:
- '000441327300012'
file:
- access_level: open_access
checksum: 78d2062b9e3c3b90fe71545aeb6d2f65
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T10:49:49Z
date_updated: 2020-07-14T12:44:43Z
file_id: '5694'
file_name: 2018_DevelopmentalCell_Sznurkowska.pdf
file_size: 8948384
relation: main_file
file_date_updated: 2020-07-14T12:44:43Z
has_accepted_license: '1'
intvolume: ' 46'
isi: 1
issue: '3'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 360 - 375
publication: Developmental Cell
publication_status: published
publisher: Cell Press
publist_id: '7791'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Defining lineage potential and fate behavior of precursors during pancreas
development
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: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 46
year: '2018'
...
---
_id: '133'
abstract:
- lang: eng
text: Synchronous programs are easy to specify because the side effects of an operation
are finished by the time the invocation of the operation returns to the caller.
Asynchronous programs, on the other hand, are difficult to specify because there
are side effects due to pending computation scheduled as a result of the invocation
of an operation. They are also difficult to verify because of the large number
of possible interleavings of concurrent computation threads. We present synchronization,
a new proof rule that simplifies the verification of asynchronous programs by
introducing the fiction, for proof purposes, that asynchronous operations complete
synchronously. Synchronization summarizes an asynchronous computation as immediate
atomic effect. Modular verification is enabled via pending asynchronous calls
in atomic summaries, and a complementary proof rule that eliminates pending asynchronous
calls when components and their specifications are composed. We evaluate synchronization
in the context of a multi-layer refinement verification methodology on a collection
of benchmark programs.
alternative_title:
- LIPIcs
article_number: '21'
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- 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: 'Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21'
apa: 'Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous
(Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory,
Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21'
chicago: Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the
Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.
ieee: 'B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,”
presented at the CONCUR: International Conference on Concurrency Theory, Beijing,
China, 2018, vol. 118.'
ista: 'Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR:
International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.'
mla: Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.
short: B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:48Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2023-09-07T13:18:00Z
day: '13'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2018.21
file:
- access_level: open_access
checksum: c90895f4c5fafc18ddc54d1c8848077e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:46Z
date_updated: 2020-07-14T12:44:44Z
file_id: '5368'
file_name: IST-2018-853-v2+2_concur2018.pdf
file_size: 745438
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-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:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7790'
pubrep_id: '1039'
quality_controlled: '1'
related_material:
record:
- id: '6426'
relation: earlier_version
status: public
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Synchronizing the asynchronous
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 118
year: '2018'
...
---
_id: '134'
abstract:
- lang: eng
text: "The current state of the art in real-time two-dimensional water wave simulation
requires developers to choose between efficient Fourier-based methods, which lack
interactions with moving obstacles, and finite-difference or finite element methods,
which handle environmental interactions but are significantly more expensive.
This paper attempts to bridge this long-standing gap between complexity and performance,
by proposing a new wave simulation method that can faithfully simulate wave interactions
with moving obstacles in real time while simultaneously preserving minute details
and accommodating very large simulation domains.\r\n\r\nPrevious methods for simulating
2D water waves directly compute the change in height of the water surface, a strategy
which imposes limitations based on the CFL condition (fast moving waves require
small time steps) and Nyquist's limit (small wave details require closely-spaced
simulation variables). This paper proposes a novel wavelet transformation that
discretizes the liquid motion in terms of amplitude-like functions that vary over
space, frequency, and direction, effectively generalizing Fourier-based methods
to handle local interactions. Because these new variables change much more slowly
over space than the original water height function, our change of variables drastically
reduces the limitations of the CFL condition and Nyquist limit, allowing us to
simulate highly detailed water waves at very large visual resolutions. Our discretization
is amenable to fast summation and easy to parallelize. We also present basic extensions
like pre-computed wave paths and two-way solid fluid coupling. Finally, we argue
that our discretization provides a convenient set of variables for artistic manipulation,
which we illustrate with a novel wave-painting interface."
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- SIGGRAPH
article_number: '94'
article_processing_charge: No
author:
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Tomas
full_name: Skrivan, Tomas
id: 486A5A46-F248-11E8-B48F-1D18A9856A87
last_name: Skrivan
- first_name: Matthias
full_name: Mueller Fischer, Matthias
last_name: Mueller Fischer
- first_name: Nuttapong
full_name: Chentanez, Nuttapong
last_name: Chentanez
- first_name: Miles
full_name: Macklin, Miles
last_name: Macklin
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C.
Water surface wavelets. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201336
apa: Jeschke, S., Skrivan, T., Mueller Fischer, M., Chentanez, N., Macklin, M.,
& Wojtan, C. (2018). Water surface wavelets. ACM Transactions on Graphics.
ACM. https://doi.org/10.1145/3197517.3201336
chicago: Jeschke, Stefan, Tomas Skrivan, Matthias Mueller Fischer, Nuttapong Chentanez,
Miles Macklin, and Chris Wojtan. “Water Surface Wavelets.” ACM Transactions
on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201336.
ieee: S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, and
C. Wojtan, “Water surface wavelets,” ACM Transactions on Graphics, vol.
37, no. 4. ACM, 2018.
ista: Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C.
2018. Water surface wavelets. ACM Transactions on Graphics. 37(4), 94.
mla: Jeschke, Stefan, et al. “Water Surface Wavelets.” ACM Transactions on Graphics,
vol. 37, no. 4, 94, ACM, 2018, doi:10.1145/3197517.3201336.
short: S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, C.
Wojtan, ACM Transactions on Graphics 37 (2018).
date_created: 2018-12-11T11:44:48Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2024-02-28T13:58:51Z
day: '30'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3197517.3201336
ec_funded: 1
external_id:
isi:
- '000448185000055'
file:
- access_level: open_access
checksum: db75ebabe2ec432bf41389e614d6ef62
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:59:23Z
date_updated: 2020-07-14T12:44:45Z
file_id: '5744'
file_name: 2018_ACM_Jeschke.pdf
file_size: 22185016
relation: main_file
file_date_updated: 2020-07-14T12:44:45Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '7789'
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-water-simulation-captures-small-details-even-in-large-scenes/
scopus_import: '1'
status: public
title: Water surface wavelets
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2018'
...
---
_id: '135'
abstract:
- lang: eng
text: The Fluid Implicit Particle method (FLIP) reduces numerical dissipation by
combining particles with grids. To improve performance, the subsequent narrow
band FLIP method (NB‐FLIP) uses a FLIP‐based fluid simulation only near the liquid
surface and a traditional grid‐based fluid simulation away from the surface. This
spatially‐limited FLIP simulation significantly reduces the number of particles
and alleviates a computational bottleneck. In this paper, we extend the NB‐FLIP
idea even further, by allowing a simulation to transition between a FLIP‐like
fluid simulation and a grid‐based simulation in arbitrary locations, not just
near the surface. This approach leads to even more savings in memory and computation,
because we can concentrate the particles only in areas where they are needed.
More importantly, this new method allows us to seamlessly transition to smooth
implicit surface geometry wherever the particle‐based simulation is unnecessary.
Consequently, our method leads to a practical algorithm for avoiding the noisy
surface artifacts associated with particle‐based liquid simulations, while simultaneously
maintaining the benefits of a FLIP simulation in regions of dynamic motion.
alternative_title:
- Eurographics
article_processing_charge: No
article_type: original
author:
- first_name: Takahiro
full_name: Sato, Takahiro
last_name: Sato
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Nils
full_name: Thuerey, Nils
last_name: Thuerey
- first_name: Takeo
full_name: Igarashi, Takeo
last_name: Igarashi
- first_name: Ryoichi
full_name: Ando, Ryoichi
last_name: Ando
citation:
ama: Sato T, Wojtan C, Thuerey N, Igarashi T, Ando R. Extended narrow band FLIP
for liquid simulations. Computer Graphics Forum. 2018;37(2):169-177. doi:10.1111/cgf.13351
apa: Sato, T., Wojtan, C., Thuerey, N., Igarashi, T., & Ando, R. (2018). Extended
narrow band FLIP for liquid simulations. Computer Graphics Forum. Wiley.
https://doi.org/10.1111/cgf.13351
chicago: Sato, Takahiro, Chris Wojtan, Nils Thuerey, Takeo Igarashi, and Ryoichi
Ando. “Extended Narrow Band FLIP for Liquid Simulations.” Computer Graphics
Forum. Wiley, 2018. https://doi.org/10.1111/cgf.13351.
ieee: T. Sato, C. Wojtan, N. Thuerey, T. Igarashi, and R. Ando, “Extended narrow
band FLIP for liquid simulations,” Computer Graphics Forum, vol. 37, no.
2. Wiley, pp. 169–177, 2018.
ista: Sato T, Wojtan C, Thuerey N, Igarashi T, Ando R. 2018. Extended narrow band
FLIP for liquid simulations. Computer Graphics Forum. 37(2), 169–177.
mla: Sato, Takahiro, et al. “Extended Narrow Band FLIP for Liquid Simulations.”
Computer Graphics Forum, vol. 37, no. 2, Wiley, 2018, pp. 169–77, doi:10.1111/cgf.13351.
short: T. Sato, C. Wojtan, N. Thuerey, T. Igarashi, R. Ando, Computer Graphics Forum
37 (2018) 169–177.
date_created: 2018-12-11T11:44:49Z
date_published: 2018-05-22T00:00:00Z
date_updated: 2023-09-11T14:00:26Z
day: '22'
ddc:
- '006'
department:
- _id: ChWo
doi: 10.1111/cgf.13351
ec_funded: 1
external_id:
isi:
- '000434085600016'
file:
- access_level: open_access
checksum: 8edb90da8a72395eb5d970580e0925b6
content_type: application/pdf
creator: wojtan
date_created: 2020-10-08T08:38:23Z
date_updated: 2020-10-08T08:38:23Z
file_id: '8627'
file_name: exnbflip.pdf
file_size: 54309947
relation: main_file
success: 1
file_date_updated: 2020-10-08T08:38:23Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 169 - 177
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extended narrow band FLIP for liquid simulations
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '136'
abstract:
- lang: eng
text: Recent studies suggest that unstable, nonchaotic solutions of the Navier-Stokes
equation may provide deep insights into fluid turbulence. In this article, we
present a combined experimental and numerical study exploring the dynamical role
of unstable equilibrium solutions and their invariant manifolds in a weakly turbulent,
electromagnetically driven, shallow fluid layer. Identifying instants when turbulent
evolution slows down, we compute 31 unstable equilibria of a realistic two-dimensional
model of the flow. We establish the dynamical relevance of these unstable equilibria
by showing that they are closely visited by the turbulent flow. We also establish
the dynamical relevance of unstable manifolds by verifying that they are shadowed
by turbulent trajectories departing from the neighborhoods of unstable equilibria
over large distances in state space.
article_processing_charge: No
arxiv: 1
author:
- first_name: Balachandra
full_name: Suri, Balachandra
id: 47A5E706-F248-11E8-B48F-1D18A9856A87
last_name: Suri
- first_name: Jeffrey
full_name: Tithof, Jeffrey
last_name: Tithof
- first_name: Roman
full_name: Grigoriev, Roman
last_name: Grigoriev
- first_name: Michael
full_name: Schatz, Michael
last_name: Schatz
citation:
ama: Suri B, Tithof J, Grigoriev R, Schatz M. Unstable equilibria and invariant
manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E.
2018;98(2). doi:10.1103/PhysRevE.98.023105
apa: Suri, B., Tithof, J., Grigoriev, R., & Schatz, M. (2018). Unstable equilibria
and invariant manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical
Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.98.023105
chicago: Suri, Balachandra, Jeffrey Tithof, Roman Grigoriev, and Michael Schatz.
“Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional Kolmogorov-like
Flow.” Physical Review E. American Physical Society, 2018. https://doi.org/10.1103/PhysRevE.98.023105.
ieee: B. Suri, J. Tithof, R. Grigoriev, and M. Schatz, “Unstable equilibria and
invariant manifolds in quasi-two-dimensional Kolmogorov-like flow,” Physical
Review E, vol. 98, no. 2. American Physical Society, 2018.
ista: Suri B, Tithof J, Grigoriev R, Schatz M. 2018. Unstable equilibria and invariant
manifolds in quasi-two-dimensional Kolmogorov-like flow. Physical Review E. 98(2).
mla: Suri, Balachandra, et al. “Unstable Equilibria and Invariant Manifolds in Quasi-Two-Dimensional
Kolmogorov-like Flow.” Physical Review E, vol. 98, no. 2, American Physical
Society, 2018, doi:10.1103/PhysRevE.98.023105.
short: B. Suri, J. Tithof, R. Grigoriev, M. Schatz, Physical Review E 98 (2018).
date_created: 2018-12-11T11:44:49Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2023-10-10T13:29:10Z
day: '13'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.98.023105
external_id:
arxiv:
- '1808.02088'
isi:
- '000441466800010'
intvolume: ' 98'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.02088
month: '08'
oa: 1
oa_version: Submitted Version
publication: Physical Review E
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unstable equilibria and invariant manifolds in quasi-two-dimensional Kolmogorov-like
flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 98
year: '2018'
...
---
_id: '137'
abstract:
- lang: eng
text: Fluorescent sensors are an essential part of the experimental toolbox of the
life sciences, where they are used ubiquitously to visualize intra- and extracellular
signaling. In the brain, optical neurotransmitter sensors can shed light on temporal
and spatial aspects of signal transmission by directly observing, for instance,
neurotransmitter release and spread. Here we report the development and application
of the first optical sensor for the amino acid glycine, which is both an inhibitory
neurotransmitter and a co-agonist of the N-methyl-d-aspartate receptors (NMDARs)
involved in synaptic plasticity. Computational design of a glycine-specific binding
protein allowed us to produce the optical glycine FRET sensor (GlyFS), which can
be used with single and two-photon excitation fluorescence microscopy. We took
advantage of this newly developed sensor to test predictions about the uneven
spatial distribution of glycine in extracellular space and to demonstrate that
extracellular glycine levels are controlled by plasticity-inducing stimuli.
article_processing_charge: No
article_type: original
author:
- first_name: William
full_name: Zhang, William
last_name: Zhang
- first_name: Michel
full_name: Herde, Michel
last_name: Herde
- first_name: Joshua
full_name: Mitchell, Joshua
last_name: Mitchell
- first_name: Jason
full_name: Whitfield, Jason
last_name: Whitfield
- first_name: Andreas
full_name: Wulff, Andreas
last_name: Wulff
- first_name: Vanessa
full_name: Vongsouthi, Vanessa
last_name: Vongsouthi
- first_name: Inmaculada
full_name: Sanchez Romero, Inmaculada
id: 3D9C5D30-F248-11E8-B48F-1D18A9856A87
last_name: Sanchez Romero
- first_name: Polina
full_name: Gulakova, Polina
last_name: Gulakova
- first_name: Daniel
full_name: Minge, Daniel
last_name: Minge
- first_name: Björn
full_name: Breithausen, Björn
last_name: Breithausen
- first_name: Susanne
full_name: Schoch, Susanne
last_name: Schoch
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Colin
full_name: Jackson, Colin
last_name: Jackson
- first_name: Christian
full_name: Henneberger, Christian
last_name: Henneberger
citation:
ama: Zhang W, Herde M, Mitchell J, et al. Monitoring hippocampal glycine with the
computationally designed optical sensor GlyFS. Nature Chemical Biology.
2018;14(9):861-869. doi:10.1038/s41589-018-0108-2
apa: Zhang, W., Herde, M., Mitchell, J., Whitfield, J., Wulff, A., Vongsouthi, V.,
… Henneberger, C. (2018). Monitoring hippocampal glycine with the computationally
designed optical sensor GlyFS. Nature Chemical Biology. Nature Publishing
Group. https://doi.org/10.1038/s41589-018-0108-2
chicago: Zhang, William, Michel Herde, Joshua Mitchell, Jason Whitfield, Andreas
Wulff, Vanessa Vongsouthi, Inmaculada Sanchez-Romero, et al. “Monitoring Hippocampal
Glycine with the Computationally Designed Optical Sensor GlyFS.” Nature Chemical
Biology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41589-018-0108-2.
ieee: W. Zhang et al., “Monitoring hippocampal glycine with the computationally
designed optical sensor GlyFS,” Nature Chemical Biology, vol. 14, no. 9.
Nature Publishing Group, pp. 861–869, 2018.
ista: Zhang W, Herde M, Mitchell J, Whitfield J, Wulff A, Vongsouthi V, Sanchez-Romero
I, Gulakova P, Minge D, Breithausen B, Schoch S, Janovjak HL, Jackson C, Henneberger
C. 2018. Monitoring hippocampal glycine with the computationally designed optical
sensor GlyFS. Nature Chemical Biology. 14(9), 861–869.
mla: Zhang, William, et al. “Monitoring Hippocampal Glycine with the Computationally
Designed Optical Sensor GlyFS.” Nature Chemical Biology, vol. 14, no. 9,
Nature Publishing Group, 2018, pp. 861–69, doi:10.1038/s41589-018-0108-2.
short: W. Zhang, M. Herde, J. Mitchell, J. Whitfield, A. Wulff, V. Vongsouthi, I.
Sanchez-Romero, P. Gulakova, D. Minge, B. Breithausen, S. Schoch, H.L. Janovjak,
C. Jackson, C. Henneberger, Nature Chemical Biology 14 (2018) 861–869.
date_created: 2018-12-11T11:44:49Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-09-13T08:58:05Z
day: '30'
department:
- _id: HaJa
doi: 10.1038/s41589-018-0108-2
external_id:
isi:
- '000442174500013'
pmid:
- '30061718 '
intvolume: ' 14'
isi: 1
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pubmed/30061718
month: '07'
oa: 1
oa_version: Submitted Version
page: 861 - 869
pmid: 1
project:
- _id: 255BFFFA-B435-11E9-9278-68D0E5697425
grant_number: RGY0084/2012
name: In situ real-time imaging of neurotransmitter signaling using designer optical
sensors (HFSP Young Investigator)
publication: Nature Chemical Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '7786'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitoring hippocampal glycine with the computationally designed optical sensor
GlyFS
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 14
year: '2018'
...
---
_id: '139'
abstract:
- lang: eng
text: 'Genome-scale diversity data are increasingly available in a variety of biological
systems, and can be used to reconstruct the past evolutionary history of species
divergence. However, extracting the full demographic information from these data
is not trivial, and requires inferential methods that account for the diversity
of coalescent histories throughout the genome. Here, we evaluate the potential
and limitations of one such approach. We reexamine a well-known system of mussel
sister species, using the joint site frequency spectrum (jSFS) of synonymousmutations
computed either fromexome capture or RNA-seq, in an Approximate Bayesian Computation
(ABC) framework. We first assess the best sampling strategy (number of: individuals,
loci, and bins in the jSFS), and show that model selection is robust to variation
in the number of individuals and loci. In contrast, different binning choices
when summarizing the jSFS, strongly affect the results: including classes of low
and high frequency shared polymorphisms can more effectively reveal recent migration
events. We then take advantage of the flexibility of ABC to compare more realistic
models of speciation, including variation in migration rates through time (i.e.,
periodic connectivity) and across genes (i.e., genome-wide heterogeneity in migration
rates). We show that these models were consistently selected as the most probable,
suggesting that mussels have experienced a complex history of gene flow during
divergence and that the species boundary is semi-permeable. Our work provides
a comprehensive evaluation of ABC demographic inference in mussels based on the
coding jSFS, and supplies guidelines for employing different sequencing techniques
and sampling strategies. We emphasize, perhaps surprisingly, that inferences are
less limited by the volume of data, than by the way in which they are analyzed.'
article_number: '30083438'
article_processing_charge: No
author:
- first_name: Christelle
full_name: Fraisse, Christelle
id: 32DF5794-F248-11E8-B48F-1D18A9856A87
last_name: Fraisse
orcid: 0000-0001-8441-5075
- first_name: Camille
full_name: Roux, Camille
last_name: Roux
- first_name: Pierre
full_name: Gagnaire, Pierre
last_name: Gagnaire
- first_name: Jonathan
full_name: Romiguier, Jonathan
last_name: Romiguier
- first_name: Nicolas
full_name: Faivre, Nicolas
last_name: Faivre
- first_name: John
full_name: Welch, John
last_name: Welch
- first_name: Nicolas
full_name: Bierne, Nicolas
last_name: Bierne
citation:
ama: 'Fraisse C, Roux C, Gagnaire P, et al. The divergence history of European blue
mussel species reconstructed from Approximate Bayesian Computation: The effects
of sequencing techniques and sampling strategies. PeerJ. 2018;2018(7).
doi:10.7717/peerj.5198'
apa: 'Fraisse, C., Roux, C., Gagnaire, P., Romiguier, J., Faivre, N., Welch, J.,
& Bierne, N. (2018). The divergence history of European blue mussel species
reconstructed from Approximate Bayesian Computation: The effects of sequencing
techniques and sampling strategies. PeerJ. PeerJ. https://doi.org/10.7717/peerj.5198'
chicago: 'Fraisse, Christelle, Camille Roux, Pierre Gagnaire, Jonathan Romiguier,
Nicolas Faivre, John Welch, and Nicolas Bierne. “The Divergence History of European
Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects
of Sequencing Techniques and Sampling Strategies.” PeerJ. PeerJ, 2018.
https://doi.org/10.7717/peerj.5198.'
ieee: 'C. Fraisse et al., “The divergence history of European blue mussel
species reconstructed from Approximate Bayesian Computation: The effects of sequencing
techniques and sampling strategies,” PeerJ, vol. 2018, no. 7. PeerJ, 2018.'
ista: 'Fraisse C, Roux C, Gagnaire P, Romiguier J, Faivre N, Welch J, Bierne N.
2018. The divergence history of European blue mussel species reconstructed from
Approximate Bayesian Computation: The effects of sequencing techniques and sampling
strategies. PeerJ. 2018(7), 30083438.'
mla: 'Fraisse, Christelle, et al. “The Divergence History of European Blue Mussel
Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing
Techniques and Sampling Strategies.” PeerJ, vol. 2018, no. 7, 30083438,
PeerJ, 2018, doi:10.7717/peerj.5198.'
short: C. Fraisse, C. Roux, P. Gagnaire, J. Romiguier, N. Faivre, J. Welch, N. Bierne,
PeerJ 2018 (2018).
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-30T00:00:00Z
date_updated: 2023-10-17T12:25:28Z
day: '30'
ddc:
- '576'
department:
- _id: BeVi
- _id: NiBa
doi: 10.7717/peerj.5198
external_id:
isi:
- '000440484800002'
file:
- access_level: open_access
checksum: 7d55ae22598a1c70759cd671600cff53
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:42:11Z
date_updated: 2020-07-14T12:44:48Z
file_id: '5739'
file_name: 2018_PeerJ_Fraisse.pdf
file_size: 1480792
relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
has_accepted_license: '1'
intvolume: ' 2018'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: PeerJ
publication_status: published
publisher: PeerJ
publist_id: '7784'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The divergence history of European blue mussel species reconstructed from
Approximate Bayesian Computation: The effects of sequencing techniques and sampling
strategies'
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: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2018
year: '2018'
...
---
_id: '14'
abstract:
- lang: eng
text: The intercellular transport of auxin is driven by PIN-formed (PIN) auxin efflux
carriers. PINs are localized at the plasma membrane (PM) and on constitutively
recycling endomembrane vesicles. Therefore, PINs can mediate auxin transport either
by direct translocation across the PM or by pumping auxin into secretory vesicles
(SVs), leading to its secretory release upon fusion with the PM. Which of these
two mechanisms dominates is a matter of debate. Here, we addressed the issue with
a mathematical modeling approach. We demonstrate that the efficiency of secretory
transport depends on SV size, half-life of PINs on the PM, pH, exocytosis frequency
and PIN density. 3D structured illumination microscopy (SIM) was used to determine
PIN density on the PM. Combining this data with published values of the other
parameters, we show that the transport activity of PINs in SVs would have to be
at least 1000× greater than on the PM in order to produce a comparable macroscopic
auxin transport. If both transport mechanisms operated simultaneously and PINs
were equally active on SVs and PM, the contribution of secretion to the total
auxin flux would be negligible. In conclusion, while secretory vesicle-mediated
transport of auxin is an intriguing and theoretically possible model, it is unlikely
to be a major mechanism of auxin transport inplanta.
acknowledgement: 'European Research Council (ERC): 742985 to Jiri Friml; M.A. was
supported by the Austrian Science Fund (FWF) (M2379-B28); AJ was supported by the
Austria Science Fund (FWF): I03630 to Jiri Friml.'
article_processing_charge: No
article_type: original
author:
- first_name: Sander
full_name: Hille, Sander
last_name: Hille
- first_name: Maria
full_name: Akhmanova, Maria
id: 3425EC26-F248-11E8-B48F-1D18A9856A87
last_name: Akhmanova
orcid: 0000-0003-1522-3162
- first_name: Matous
full_name: Glanc, Matous
id: 1AE1EA24-02D0-11E9-9BAA-DAF4881429F2
last_name: Glanc
orcid: 0000-0003-0619-7783
- first_name: Alexander J
full_name: Johnson, Alexander J
id: 46A62C3A-F248-11E8-B48F-1D18A9856A87
last_name: Johnson
orcid: 0000-0002-2739-8843
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. Relative contribution
of PIN-containing secretory vesicles and plasma membrane PINs to the directed
auxin transport: Theoretical estimation. International Journal of Molecular
Sciences. 2018;19(11). doi:10.3390/ijms19113566'
apa: 'Hille, S., Akhmanova, M., Glanc, M., Johnson, A. J., & Friml, J. (2018).
Relative contribution of PIN-containing secretory vesicles and plasma membrane
PINs to the directed auxin transport: Theoretical estimation. International
Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms19113566'
chicago: 'Hille, Sander, Maria Akhmanova, Matous Glanc, Alexander J Johnson, and
Jiří Friml. “Relative Contribution of PIN-Containing Secretory Vesicles and Plasma
Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.” International
Journal of Molecular Sciences. MDPI, 2018. https://doi.org/10.3390/ijms19113566.'
ieee: 'S. Hille, M. Akhmanova, M. Glanc, A. J. Johnson, and J. Friml, “Relative
contribution of PIN-containing secretory vesicles and plasma membrane PINs to
the directed auxin transport: Theoretical estimation,” International Journal
of Molecular Sciences, vol. 19, no. 11. MDPI, 2018.'
ista: 'Hille S, Akhmanova M, Glanc M, Johnson AJ, Friml J. 2018. Relative contribution
of PIN-containing secretory vesicles and plasma membrane PINs to the directed
auxin transport: Theoretical estimation. International Journal of Molecular Sciences.
19(11).'
mla: 'Hille, Sander, et al. “Relative Contribution of PIN-Containing Secretory Vesicles
and Plasma Membrane PINs to the Directed Auxin Transport: Theoretical Estimation.”
International Journal of Molecular Sciences, vol. 19, no. 11, MDPI, 2018,
doi:10.3390/ijms19113566.'
short: S. Hille, M. Akhmanova, M. Glanc, A.J. Johnson, J. Friml, International Journal
of Molecular Sciences 19 (2018).
date_created: 2018-12-11T11:44:09Z
date_published: 2018-11-12T00:00:00Z
date_updated: 2023-09-18T08:09:32Z
day: '12'
ddc:
- '580'
department:
- _id: DaSi
- _id: JiFr
doi: 10.3390/ijms19113566
ec_funded: 1
external_id:
isi:
- '000451528500282'
file:
- access_level: open_access
checksum: e4b59c2599b0ca26ebf5b8434bcde94a
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:04:11Z
date_updated: 2020-07-14T12:44:50Z
file_id: '5719'
file_name: 2018_IJMS_Hille.pdf
file_size: 2200593
relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 261099A6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '742985'
name: Tracing Evolution of Auxin Transport and Polarity in Plants
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
publication: International Journal of Molecular Sciences
publication_identifier:
eissn:
- 1422-0067
publication_status: published
publisher: MDPI
publist_id: '8042'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Relative contribution of PIN-containing secretory vesicles and plasma membrane
PINs to the directed auxin transport: Theoretical estimation'
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: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 19
year: '2018'
...
---
_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:10.1007/978-3-319-96145-3_25'
apa: 'Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants
(Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25'
chicago: Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,”
10981:468–86. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_25.
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. Space-Time Interpolants. Vol. 10981, Springer,
2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.
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: '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:10.1007/978-3-319-96142-2_13'
apa: 'Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & 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. https://doi.org/10.1007/978-3-319-96142-2_13'
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. https://doi.org/10.1007/978-3-319-96142-2_13.
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. Symbolic Algorithms for Graphs and Markov
Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp.
178–97, doi:10.1007/978-3-319-96142-2_13.
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: International Conference
on Learning Representations. ; 2018.'
apa: 'Fortuin, V., Hüser, M., Locatello, F., Strathmann, H., & Rätsch, G. (2018).
SOM-VAE: Interpretable discrete representation learning on time series. In International
Conference on Learning Representations. 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 International Conference on Learning Representations,
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 International
Conference on Learning Representations, 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.” International Conference on Learning Representations,
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:10.1007/978-3-319-96145-3_24'
apa: 'Kong, H., Bartocci, E., & 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.
https://doi.org/10.1007/978-3-319-96145-3_24'
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. https://doi.org/10.1007/978-3-319-96145-3_24.
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. Reachable Set Over-Approximation for Nonlinear Systems
Using Piecewise Barrier Tubes. Vol. 10981, Springer, 2018, pp. 449–67, doi:10.1007/978-3-319-96145-3_24.
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: Proceedings of the 21st International Conference
on Artificial Intelligence and Statistics. Vol 84. ML Research Press; 2018:464-472.'
apa: 'Locatello, F., Khanna, R., Ghosh, J., & Rätsch, G. (2018). Boosting variational
inference: An optimization perspective. In Proceedings of the 21st International
Conference on Artificial Intelligence and Statistics (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 Proceedings
of the 21st International Conference on Artificial Intelligence and Statistics,
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 Proceedings of the 21st International Conference
on Artificial Intelligence and Statistics, 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.” Proceedings of the 21st International Conference on Artificial
Intelligence and Statistics, 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: Advances in Neural Information Processing Systems.
Vol 31. Neural Information Processing Systems Foundation; 2018.'
apa: 'Locatello, F., Dresdner, G., Khanna, R., Valera, I., & Rätsch, G. (2018).
Boosting black box variational inference. In Advances in Neural Information
Processing Systems (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 Advances in Neural
Information Processing Systems, 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 Advances in Neural Information Processing
Systems, 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.” Advances
in Neural Information Processing Systems, 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: Proceedings of the 35th International Conference on Machine Learning.
Vol 80. ML Research Press; 2018:5727-5736.'
apa: 'Yurtsever, A., Fercoq, O., Locatello, F., & Cevher, V. (2018). A conditional
gradient framework for composite convex minimization with applications to semidefinite
programming. In Proceedings of the 35th International Conference on Machine
Learning (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 Proceedings of the 35th International Conference
on Machine Learning, 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 Proceedings of the 35th International Conference on Machine
Learning, 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.” Proceedings of
the 35th International Conference on Machine Learning, 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'
...