---
_id: '7126'
abstract:
- lang: eng
text: In the Minimum Description Length (MDL) principle, learning from the data
is equivalent to an optimal coding problem. We show that the codes that achieve
optimal compression in MDL are critical in a very precise sense. First, when they
are taken as generative models of samples, they generate samples with broad empirical
distributions and with a high value of the relevance, defined as the entropy of
the empirical frequencies. These results are derived for different statistical
models (Dirichlet model, independent and pairwise dependent spin models, and restricted
Boltzmann machines). Second, MDL codes sit precisely at a second order phase transition
point where the symmetry between the sampled outcomes is spontaneously broken.
The order parameter controlling the phase transition is the coding cost of the
samples. The phase transition is a manifestation of the optimality of MDL codes,
and it arises because codes that achieve a higher compression do not exist. These
results suggest a clear interpretation of the widespread occurrence of statistical
criticality as a characterization of samples which are maximally informative on
the underlying generative process.
article_number: '755'
article_processing_charge: No
article_type: original
author:
- first_name: Ryan J
full_name: Cubero, Ryan J
id: 850B2E12-9CD4-11E9-837F-E719E6697425
last_name: Cubero
orcid: 0000-0003-0002-1867
- first_name: Matteo
full_name: Marsili, Matteo
last_name: Marsili
- first_name: Yasser
full_name: Roudi, Yasser
last_name: Roudi
citation:
ama: Cubero RJ, Marsili M, Roudi Y. Minimum description length codes are critical.
Entropy. 2018;20(10). doi:10.3390/e20100755
apa: Cubero, R. J., Marsili, M., & Roudi, Y. (2018). Minimum description length
codes are critical. Entropy. MDPI. https://doi.org/10.3390/e20100755
chicago: Cubero, Ryan J, Matteo Marsili, and Yasser Roudi. “Minimum Description
Length Codes Are Critical.” Entropy. MDPI, 2018. https://doi.org/10.3390/e20100755.
ieee: R. J. Cubero, M. Marsili, and Y. Roudi, “Minimum description length codes
are critical,” Entropy, vol. 20, no. 10. MDPI, 2018.
ista: Cubero RJ, Marsili M, Roudi Y. 2018. Minimum description length codes are
critical. Entropy. 20(10), 755.
mla: Cubero, Ryan J., et al. “Minimum Description Length Codes Are Critical.” Entropy,
vol. 20, no. 10, 755, MDPI, 2018, doi:10.3390/e20100755.
short: R.J. Cubero, M. Marsili, Y. Roudi, Entropy 20 (2018).
date_created: 2019-11-26T22:18:05Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2021-01-12T08:11:56Z
day: '01'
ddc:
- '519'
doi: 10.3390/e20100755
extern: '1'
file:
- access_level: open_access
checksum: d642b7b661e1d5066b62e6ea9986b917
content_type: application/pdf
creator: rcubero
date_created: 2019-11-26T22:23:08Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7127'
file_name: entropy-20-00755-v2.pdf
file_size: 1366813
relation: main_file
file_date_updated: 2020-07-14T12:47:50Z
has_accepted_license: '1'
intvolume: ' 20'
issue: '10'
keyword:
- Minimum Description Length
- normalized maximum likelihood
- statistical criticality
- phase transitions
- large deviations
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: Entropy
publication_identifier:
issn:
- 1099-4300
publication_status: published
publisher: MDPI
quality_controlled: '1'
status: public
title: Minimum description length codes are critical
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: 20
year: '2018'
...
---
_id: '723'
abstract:
- lang: eng
text: Escaping local optima is one of the major obstacles to function optimisation.
Using the metaphor of a fitness landscape, local optima correspond to hills separated
by fitness valleys that have to be overcome. We define a class of fitness valleys
of tunable difficulty by considering their length, representing the Hamming path
between the two optima and their depth, the drop in fitness. For this function
class we present a runtime comparison between stochastic search algorithms using
different search strategies. The (1+1) EA is a simple and well-studied evolutionary
algorithm that has to jump across the valley to a point of higher fitness because
it does not accept worsening moves (elitism). In contrast, the Metropolis algorithm
and the Strong Selection Weak Mutation (SSWM) algorithm, a famous process in population
genetics, are both able to cross the fitness valley by accepting worsening moves.
We show that the runtime of the (1+1) EA depends critically on the length of the
valley while the runtimes of the non-elitist algorithms depend crucially on the
depth of the valley. Moreover, we show that both SSWM and Metropolis can also
efficiently optimise a rugged function consisting of consecutive valleys.
article_processing_charge: No
author:
- first_name: Pietro
full_name: Oliveto, Pietro
last_name: Oliveto
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Jorge
full_name: Pérez Heredia, Jorge
last_name: Pérez Heredia
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
citation:
ama: Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. How to escape
local optima in black box optimisation when non elitism outperforms elitism. Algorithmica.
2018;80(5):1604-1633. doi:10.1007/s00453-017-0369-2
apa: Oliveto, P., Paixao, T., Pérez Heredia, J., Sudholt, D., & Trubenova, B.
(2018). How to escape local optima in black box optimisation when non elitism
outperforms elitism. Algorithmica. Springer. https://doi.org/10.1007/s00453-017-0369-2
chicago: Oliveto, Pietro, Tiago Paixao, Jorge Pérez Heredia, Dirk Sudholt, and Barbora
Trubenova. “How to Escape Local Optima in Black Box Optimisation When Non Elitism
Outperforms Elitism.” Algorithmica. Springer, 2018. https://doi.org/10.1007/s00453-017-0369-2.
ieee: P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, and B. Trubenova, “How
to escape local optima in black box optimisation when non elitism outperforms
elitism,” Algorithmica, vol. 80, no. 5. Springer, pp. 1604–1633, 2018.
ista: Oliveto P, Paixao T, Pérez Heredia J, Sudholt D, Trubenova B. 2018. How to
escape local optima in black box optimisation when non elitism outperforms elitism.
Algorithmica. 80(5), 1604–1633.
mla: Oliveto, Pietro, et al. “How to Escape Local Optima in Black Box Optimisation
When Non Elitism Outperforms Elitism.” Algorithmica, vol. 80, no. 5, Springer,
2018, pp. 1604–33, doi:10.1007/s00453-017-0369-2.
short: P. Oliveto, T. Paixao, J. Pérez Heredia, D. Sudholt, B. Trubenova, Algorithmica
80 (2018) 1604–1633.
date_created: 2018-12-11T11:48:09Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2025-04-15T08:22:22Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1007/s00453-017-0369-2
ec_funded: 1
external_id:
isi:
- '000428239300010'
file:
- access_level: open_access
checksum: 7d92f5d7be81e387edeec4f06442791c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:14Z
date_updated: 2020-07-14T12:47:54Z
file_id: '4674'
file_name: IST-2018-1014-v1+1_2018_Paixao_Escape.pdf
file_size: 691245
relation: main_file
file_date_updated: 2020-07-14T12:47:54Z
has_accepted_license: '1'
intvolume: ' 80'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1604 - 1633
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Algorithmica
publication_status: published
publisher: Springer
publist_id: '6957'
pubrep_id: '1014'
quality_controlled: '1'
scopus_import: '1'
status: public
title: How to escape local optima in black box optimisation when non elitism outperforms
elitism
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: 80
year: '2018'
...
---
_id: '7271'
abstract:
- lang: eng
text: The recent demand of multifunctional materials and devices for advanced applications
in energy conversion and data storage resulted into a revival of multiferroics,
that is, materials characterized by the coexistence of ferromagnetism and ferroelectricity.
Despite intense efforts made in the past decade, single-phase room temperature
multiferroics are yet to be discovered/fabricated. Nanostructured ferroic materials
could potentially exhibit multiferroism since a high fraction of their atoms/ions
are superficial, thereby altering significantly the properties of the bulk phase.
Alternately, a magnetic order can be induced into ferroelectric materials upon
aliovalent doping with magnetic ions. Here, we report on the synthesis of aggregate-free
single-phase transition-metal-doped BaTiO3 quasi-monodisperse cuboidal nanocrystals
(NC) which exhibit multiferroic properties at room temperature and can be suitable
for applications in data storage. The proposed synthetic route allows the inclusion
of a high concentration of magnetic ions such as Mn+ (M = Cr, Mn, Fe, Co) up to
a nominal concentration of 4% without the formation of any secondary phase. The
size of the nanocrystals was controlled in a wide range from ∼15 up to ∼70 nm
by varying the reaction time from 48 to 144 h. The presence of unpaired electrons
and their magnetic ordering have been probed by electron paramagnetic resonance
spectroscopy (EPR), and a vibrating sample magnetometer (VSM). Likewise, an acentric
structure, associated with the existence of a dielectric polarization, was observed
by lattice dynamics analysis and piezoresponse force microscopy (PFM). These results
show that high-quality titanium-containing perovskite nanocrystals which display
multiferroic properties at room temperature can be fabricated via soft solution-based
synthetic routes, and the properties of these materials can be modulated by changing
the size of the nanocrystals and the concentration of the dopant thereby opening
the door to the design and study of single-phase multiferroic materials.
article_processing_charge: No
article_type: original
author:
- first_name: Tommaso
full_name: Costanzo, Tommaso
id: D93824F4-D9BA-11E9-BB12-F207E6697425
last_name: Costanzo
orcid: 0000-0001-9732-3815
- first_name: John
full_name: McCracken, John
last_name: McCracken
- first_name: Aurelian
full_name: Rotaru, Aurelian
last_name: Rotaru
- first_name: Gabriel
full_name: Caruntu, Gabriel
last_name: Caruntu
citation:
ama: Costanzo T, McCracken J, Rotaru A, Caruntu G. Quasi-monodisperse transition-metal-doped
BaTiO3 (M = Cr, Mn, Fe, Co) colloidal nanocrystals with multiferroic properties.
ACS Applied Nano Materials. 2018;1(9):4863-4874. doi:10.1021/acsanm.8b01036
apa: Costanzo, T., McCracken, J., Rotaru, A., & Caruntu, G. (2018). Quasi-monodisperse
transition-metal-doped BaTiO3 (M = Cr, Mn, Fe, Co) colloidal nanocrystals with
multiferroic properties. ACS Applied Nano Materials. ACS. https://doi.org/10.1021/acsanm.8b01036
chicago: Costanzo, Tommaso, John McCracken, Aurelian Rotaru, and Gabriel Caruntu.
“Quasi-Monodisperse Transition-Metal-Doped BaTiO3 (M = Cr, Mn, Fe, Co) Colloidal
Nanocrystals with Multiferroic Properties.” ACS Applied Nano Materials.
ACS, 2018. https://doi.org/10.1021/acsanm.8b01036.
ieee: T. Costanzo, J. McCracken, A. Rotaru, and G. Caruntu, “Quasi-monodisperse
transition-metal-doped BaTiO3 (M = Cr, Mn, Fe, Co) colloidal nanocrystals with
multiferroic properties,” ACS Applied Nano Materials, vol. 1, no. 9. ACS,
pp. 4863–4874, 2018.
ista: Costanzo T, McCracken J, Rotaru A, Caruntu G. 2018. Quasi-monodisperse transition-metal-doped
BaTiO3 (M = Cr, Mn, Fe, Co) colloidal nanocrystals with multiferroic properties.
ACS Applied Nano Materials. 1(9), 4863–4874.
mla: Costanzo, Tommaso, et al. “Quasi-Monodisperse Transition-Metal-Doped BaTiO3
(M = Cr, Mn, Fe, Co) Colloidal Nanocrystals with Multiferroic Properties.” ACS
Applied Nano Materials, vol. 1, no. 9, ACS, 2018, pp. 4863–74, doi:10.1021/acsanm.8b01036.
short: T. Costanzo, J. McCracken, A. Rotaru, G. Caruntu, ACS Applied Nano Materials
1 (2018) 4863–4874.
date_created: 2020-01-13T21:58:27Z
date_published: 2018-09-28T00:00:00Z
date_updated: 2023-02-23T13:02:57Z
day: '28'
doi: 10.1021/acsanm.8b01036
extern: '1'
intvolume: ' 1'
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 4863-4874
publication: ACS Applied Nano Materials
publication_identifier:
issn:
- 2574-0970
publication_status: published
publisher: ACS
quality_controlled: '1'
status: public
title: Quasi-monodisperse transition-metal-doped BaTiO3 (M = Cr, Mn, Fe, Co) colloidal
nanocrystals with multiferroic properties
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2018'
...
---
_id: '7277'
abstract:
- lang: eng
text: 'Solid alkali metal carbonates are universal passivation layer components
of intercalation battery materials and common side products in metal‐O2 batteries,
and are believed to form and decompose reversibly in metal‐O2/CO2 cells. In these
cathodes, Li2CO3 decomposes to CO2 when exposed to potentials above 3.8 V vs.
Li/Li+. However, O2 evolution, as would be expected according to the decomposition
reaction 2 Li2CO3→4 Li++4 e−+2 CO2+O2, is not detected. O atoms are thus unaccounted
for, which was previously ascribed to unidentified parasitic reactions. Here,
we show that highly reactive singlet oxygen (1O2) forms upon oxidizing Li2CO3
in an aprotic electrolyte and therefore does not evolve as O2. These results have
substantial implications for the long‐term cyclability of batteries: they underpin
the importance of avoiding 1O2 in metal‐O2 batteries, question the possibility
of a reversible metal‐O2/CO2 battery based on a carbonate discharge product, and
help explain the interfacial reactivity of transition‐metal cathodes with residual
Li2CO3.'
article_processing_charge: No
article_type: original
author:
- first_name: Nika
full_name: Mahne, Nika
last_name: Mahne
- first_name: Sara E.
full_name: Renfrew, Sara E.
last_name: Renfrew
- first_name: Bryan D.
full_name: McCloskey, Bryan D.
last_name: McCloskey
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. Electrochemical oxidation
of Lithium Carbonate generates singlet oxygen. Angewandte Chemie International
Edition. 2018;57(19):5529-5533. doi:10.1002/anie.201802277
apa: Mahne, N., Renfrew, S. E., McCloskey, B. D., & Freunberger, S. A. (2018).
Electrochemical oxidation of Lithium Carbonate generates singlet oxygen. Angewandte
Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201802277
chicago: Mahne, Nika, Sara E. Renfrew, Bryan D. McCloskey, and Stefan Alexander
Freunberger. “Electrochemical Oxidation of Lithium Carbonate Generates Singlet
Oxygen.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201802277.
ieee: N. Mahne, S. E. Renfrew, B. D. McCloskey, and S. A. Freunberger, “Electrochemical
oxidation of Lithium Carbonate generates singlet oxygen,” Angewandte Chemie
International Edition, vol. 57, no. 19. Wiley, pp. 5529–5533, 2018.
ista: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. 2018. Electrochemical oxidation
of Lithium Carbonate generates singlet oxygen. Angewandte Chemie International
Edition. 57(19), 5529–5533.
mla: Mahne, Nika, et al. “Electrochemical Oxidation of Lithium Carbonate Generates
Singlet Oxygen.” Angewandte Chemie International Edition, vol. 57, no.
19, Wiley, 2018, pp. 5529–33, doi:10.1002/anie.201802277.
short: N. Mahne, S.E. Renfrew, B.D. McCloskey, S.A. Freunberger, Angewandte Chemie
International Edition 57 (2018) 5529–5533.
date_created: 2020-01-15T07:20:09Z
date_published: 2018-03-15T00:00:00Z
date_updated: 2021-01-12T08:12:42Z
day: '15'
ddc:
- '540'
doi: 10.1002/anie.201802277
extern: '1'
file:
- access_level: open_access
checksum: 45868d0adc2d13a506bb9a59eb4f409c
content_type: application/pdf
creator: dernst
date_created: 2020-01-22T16:28:31Z
date_updated: 2020-07-14T12:47:55Z
file_id: '7357'
file_name: 2018_AngewChemie_Mahne.pdf
file_size: 657963
relation: main_file
file_date_updated: 2020-07-14T12:47:55Z
has_accepted_license: '1'
intvolume: ' 57'
issue: '19'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 5529-5533
publication: Angewandte Chemie International Edition
publication_identifier:
issn:
- 1433-7851
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Electrochemical oxidation of Lithium Carbonate generates singlet oxygen
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2018'
...
---
_id: '7285'
abstract:
- lang: eng
text: Hydrogelation, the self-assembly of molecules into soft, water-loaded networks,
is one way to bridge the structural gap between single molecules and functional
materials. The potential of hydrogels, such as those based on perylene bisimides,
lies in their chemical, physical, optical, and electronic properties, which are
governed by the supramolecular structure of the gel. However, the structural motifs
and their precise role for long-range conductivity are yet to be explored. Here,
we present a comprehensive structural picture of a perylene bisimide hydrogel,
suggesting that its long-range conductivity is limited by charge transfer between
electronic backbones. We reveal nanocrystalline ribbon-like structures as the
electronic and structural backbone units between which charge transfer is mediated
by polar solvent bridges. We exemplify this effect with sensing, where exposure
to polar vapor enhances conductivity by 5 orders of magnitude, emphasizing the
crucial role of the interplay between structural motif and surrounding medium
for the rational design of devices based on nanocrystalline hydrogels.
article_processing_charge: No
article_type: original
author:
- first_name: Max
full_name: Burian, Max
last_name: Burian
- first_name: Francesco
full_name: Rigodanza, Francesco
last_name: Rigodanza
- first_name: Nicola
full_name: Demitri, Nicola
last_name: Demitri
- first_name: Luka
full_name: D̵ord̵ević, Luka
last_name: D̵ord̵ević
- first_name: Silvia
full_name: Marchesan, Silvia
last_name: Marchesan
- first_name: Tereza
full_name: Steinhartova, Tereza
last_name: Steinhartova
- first_name: Ilse
full_name: Letofsky-Papst, Ilse
last_name: Letofsky-Papst
- first_name: Ivan
full_name: Khalakhan, Ivan
last_name: Khalakhan
- first_name: Eléonore
full_name: Mourad, Eléonore
last_name: Mourad
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: Heinz
full_name: Amenitsch, Heinz
last_name: Amenitsch
- first_name: Maurizio
full_name: Prato, Maurizio
last_name: Prato
- first_name: Zois
full_name: Syrgiannis, Zois
last_name: Syrgiannis
citation:
ama: Burian M, Rigodanza F, Demitri N, et al. Inter-backbone charge transfer as
prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS
Nano. 2018;12(6):5800-5806. doi:10.1021/acsnano.8b01689
apa: Burian, M., Rigodanza, F., Demitri, N., D̵ord̵ević, L., Marchesan, S., Steinhartova,
T., … Syrgiannis, Z. (2018). Inter-backbone charge transfer as prerequisite for
long-range conductivity in perylene bisimide hydrogels. ACS Nano. ACS.
https://doi.org/10.1021/acsnano.8b01689
chicago: Burian, Max, Francesco Rigodanza, Nicola Demitri, Luka D̵ord̵ević, Silvia
Marchesan, Tereza Steinhartova, Ilse Letofsky-Papst, et al. “Inter-Backbone Charge
Transfer as Prerequisite for Long-Range Conductivity in Perylene Bisimide Hydrogels.”
ACS Nano. ACS, 2018. https://doi.org/10.1021/acsnano.8b01689.
ieee: M. Burian et al., “Inter-backbone charge transfer as prerequisite for
long-range conductivity in perylene bisimide hydrogels,” ACS Nano, vol.
12, no. 6. ACS, pp. 5800–5806, 2018.
ista: Burian M, Rigodanza F, Demitri N, D̵ord̵ević L, Marchesan S, Steinhartova
T, Letofsky-Papst I, Khalakhan I, Mourad E, Freunberger SA, Amenitsch H, Prato
M, Syrgiannis Z. 2018. Inter-backbone charge transfer as prerequisite for long-range
conductivity in perylene bisimide hydrogels. ACS Nano. 12(6), 5800–5806.
mla: Burian, Max, et al. “Inter-Backbone Charge Transfer as Prerequisite for Long-Range
Conductivity in Perylene Bisimide Hydrogels.” ACS Nano, vol. 12, no. 6,
ACS, 2018, pp. 5800–06, doi:10.1021/acsnano.8b01689.
short: M. Burian, F. Rigodanza, N. Demitri, L. D̵ord̵ević, S. Marchesan, T. Steinhartova,
I. Letofsky-Papst, I. Khalakhan, E. Mourad, S.A. Freunberger, H. Amenitsch, M.
Prato, Z. Syrgiannis, ACS Nano 12 (2018) 5800–5806.
date_created: 2020-01-15T12:13:25Z
date_published: 2018-06-05T00:00:00Z
date_updated: 2021-01-12T08:12:46Z
day: '05'
ddc:
- '540'
- '541'
doi: 10.1021/acsnano.8b01689
extern: '1'
file:
- access_level: open_access
checksum: 050f7f0ba5d845c5c71779ef14ad5ef3
content_type: application/pdf
creator: sfreunbe
date_created: 2020-06-29T14:56:40Z
date_updated: 2020-07-14T12:47:55Z
file_id: '8052'
file_name: Manuscript 20092017_subm.pdf
file_size: 1333353
relation: main_file
file_date_updated: 2020-07-14T12:47:55Z
has_accepted_license: '1'
intvolume: ' 12'
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 5800-5806
publication: ACS Nano
publication_identifier:
issn:
- 1936-0851
publication_status: published
publisher: ACS
quality_controlled: '1'
status: public
title: Inter-backbone charge transfer as prerequisite for long-range conductivity
in perylene bisimide hydrogels
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2018'
...
---
_id: '7286'
abstract:
- lang: eng
text: The solid electrolyte interphase (SEI) in Li and Na ion batteries forms when
highly reducing or oxidizing electrode materials come into contact with a liquid
organic electrolyte. Its ability to form a mechanically robust, ion-conducting,
and electron-insulating layer critically determines performance, cycle life, and
safety. Li or Na alkyl carbonates (LiAC and NaAC, respectively) are lead SEI components
in state-of-the-art carbonate based electrolytes, and our fundamental understanding
of their charge transport and mechanical properties may hold the key to designing
electrolytes forming an improved SEI. We synthesized a homologous series of LiACs
and NaACs from methyl to octyl analogues and characterized them with respect to
structure, ionic conductivity, and stiffness. The compounds assume layered structures
except for the lithium methyl carbonate. Room-temperature conductivities were
found to be ∼10–9 S cm–1 for lithium methyl carbonate, <10–12 S cm–1 for the other
LiACs, and <10–12 S cm–1 for the NaACs with ion transport mostly attributed to
grain boundaries. While LiACs show stiffnesses of ∼1 GPa, NaACs become significantly
softer with increasing chain lengths. These findings will help to more precisely
interpret the complex results from charge transport and mechanical characterization
of real SEIs and can give a rationale for influencing the SEI’s mechanical properties
via the electrolyte.
article_processing_charge: No
article_type: original
author:
- first_name: Lukas
full_name: Schafzahl, Lukas
last_name: Schafzahl
- first_name: Heike
full_name: Ehmann, Heike
last_name: Ehmann
- first_name: Manfred
full_name: Kriechbaum, Manfred
last_name: Kriechbaum
- first_name: Jürgen
full_name: Sattelkow, Jürgen
last_name: Sattelkow
- first_name: Thomas
full_name: Ganner, Thomas
last_name: Ganner
- first_name: Harald
full_name: Plank, Harald
last_name: Plank
- first_name: Martin
full_name: Wilkening, Martin
last_name: Wilkening
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: 'Schafzahl L, Ehmann H, Kriechbaum M, et al. Long-chain Li and Na alkyl carbonates
as solid electrolyte interphase components: Structure, ion transport, and mechanical
properties. Chemistry of Materials. 2018;30(10):3338-3345. doi:10.1021/acs.chemmater.8b00750'
apa: 'Schafzahl, L., Ehmann, H., Kriechbaum, M., Sattelkow, J., Ganner, T., Plank,
H., … Freunberger, S. A. (2018). Long-chain Li and Na alkyl carbonates as solid
electrolyte interphase components: Structure, ion transport, and mechanical properties.
Chemistry of Materials. ACS. https://doi.org/10.1021/acs.chemmater.8b00750'
chicago: 'Schafzahl, Lukas, Heike Ehmann, Manfred Kriechbaum, Jürgen Sattelkow,
Thomas Ganner, Harald Plank, Martin Wilkening, and Stefan Alexander Freunberger.
“Long-Chain Li and Na Alkyl Carbonates as Solid Electrolyte Interphase Components:
Structure, Ion Transport, and Mechanical Properties.” Chemistry of Materials.
ACS, 2018. https://doi.org/10.1021/acs.chemmater.8b00750.'
ieee: 'L. Schafzahl et al., “Long-chain Li and Na alkyl carbonates as solid
electrolyte interphase components: Structure, ion transport, and mechanical properties,”
Chemistry of Materials, vol. 30, no. 10. ACS, pp. 3338–3345, 2018.'
ista: 'Schafzahl L, Ehmann H, Kriechbaum M, Sattelkow J, Ganner T, Plank H, Wilkening
M, Freunberger SA. 2018. Long-chain Li and Na alkyl carbonates as solid electrolyte
interphase components: Structure, ion transport, and mechanical properties. Chemistry
of Materials. 30(10), 3338–3345.'
mla: 'Schafzahl, Lukas, et al. “Long-Chain Li and Na Alkyl Carbonates as Solid Electrolyte
Interphase Components: Structure, Ion Transport, and Mechanical Properties.” Chemistry
of Materials, vol. 30, no. 10, ACS, 2018, pp. 3338–45, doi:10.1021/acs.chemmater.8b00750.'
short: L. Schafzahl, H. Ehmann, M. Kriechbaum, J. Sattelkow, T. Ganner, H. Plank,
M. Wilkening, S.A. Freunberger, Chemistry of Materials 30 (2018) 3338–3345.
date_created: 2020-01-15T12:13:37Z
date_published: 2018-05-03T00:00:00Z
date_updated: 2021-01-12T08:12:46Z
day: '03'
doi: 10.1021/acs.chemmater.8b00750
extern: '1'
intvolume: ' 30'
issue: '10'
language:
- iso: eng
month: '05'
oa_version: None
page: 3338-3345
publication: Chemistry of Materials
publication_identifier:
eissn:
- 1520-5002
issn:
- 0897-4756
publication_status: published
publisher: ACS
quality_controlled: '1'
status: public
title: 'Long-chain Li and Na alkyl carbonates as solid electrolyte interphase components:
Structure, ion transport, and mechanical properties'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2018'
...
---
_id: '7287'
abstract:
- lang: eng
text: Passivation layers on electrode materials are ubiquitous in nonaqueous battery
chemistries and strongly govern performance and lifetime. They comprise breakdown
products of the electrolyte including carbonate, alkyl carbonates, alkoxides,
carboxylates, and polymers. Parasitic chemistry in metal–O2 batteries forms similar
products and is tied to the deviation of the O2 balance from the ideal stoichiometry
during formation/decomposition of alkaline peroxides or superoxides. Accurate
and integral quantification of carbonaceous species and peroxides or superoxides
in battery electrodes remains, however, elusive. We present a refined procedure
to quantify them accurately and sensitively by pointing out and rectifying pitfalls
of previous procedures. Carbonaceous compounds are differentiated into inorganic
and organic ones. We combine mass and UV–vis spectrometry to quantify evolved
O2 and complexed peroxide and CO2 evolved from carbonaceous compounds by acid
treatment and Fenton’s reaction. The capabilities of the method are exemplified
by means of Li–O2 and Na–O2 cathodes, graphite anodes, and LiNi0.8Co0.15Al0.05O2
cathodes.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Bettina
full_name: Schafzahl, Bettina
last_name: Schafzahl
- first_name: Eléonore
full_name: Mourad, Eléonore
last_name: Mourad
- first_name: Lukas
full_name: Schafzahl, Lukas
last_name: Schafzahl
- first_name: Yann K.
full_name: Petit, Yann K.
last_name: Petit
- first_name: Anjana R.
full_name: Raju, Anjana R.
last_name: Raju
- first_name: Musthafa Ottakam
full_name: Thotiyl, Musthafa Ottakam
last_name: Thotiyl
- first_name: Martin
full_name: Wilkening, Martin
last_name: Wilkening
- first_name: Christian
full_name: Slugovc, Christian
last_name: Slugovc
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Schafzahl B, Mourad E, Schafzahl L, et al. Quantifying total superoxide, peroxide,
and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase.
ACS Energy Letters. 2018;3(1):170-176. doi:10.1021/acsenergylett.7b01111
apa: Schafzahl, B., Mourad, E., Schafzahl, L., Petit, Y. K., Raju, A. R., Thotiyl,
M. O., … Freunberger, S. A. (2018). Quantifying total superoxide, peroxide, and
carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase.
ACS Energy Letters. ACS. https://doi.org/10.1021/acsenergylett.7b01111
chicago: Schafzahl, Bettina, Eléonore Mourad, Lukas Schafzahl, Yann K. Petit, Anjana
R. Raju, Musthafa Ottakam Thotiyl, Martin Wilkening, Christian Slugovc, and Stefan
Alexander Freunberger. “Quantifying Total Superoxide, Peroxide, and Carbonaceous
Compounds in Metal–O2 Batteries and the Solid Electrolyte Interphase.” ACS
Energy Letters. ACS, 2018. https://doi.org/10.1021/acsenergylett.7b01111.
ieee: B. Schafzahl et al., “Quantifying total superoxide, peroxide, and carbonaceous
compounds in metal–O2 batteries and the solid electrolyte interphase,” ACS
Energy Letters, vol. 3, no. 1. ACS, pp. 170–176, 2018.
ista: Schafzahl B, Mourad E, Schafzahl L, Petit YK, Raju AR, Thotiyl MO, Wilkening
M, Slugovc C, Freunberger SA. 2018. Quantifying total superoxide, peroxide, and
carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase.
ACS Energy Letters. 3(1), 170–176.
mla: Schafzahl, Bettina, et al. “Quantifying Total Superoxide, Peroxide, and Carbonaceous
Compounds in Metal–O2 Batteries and the Solid Electrolyte Interphase.” ACS
Energy Letters, vol. 3, no. 1, ACS, 2018, pp. 170–76, doi:10.1021/acsenergylett.7b01111.
short: B. Schafzahl, E. Mourad, L. Schafzahl, Y.K. Petit, A.R. Raju, M.O. Thotiyl,
M. Wilkening, C. Slugovc, S.A. Freunberger, ACS Energy Letters 3 (2018) 170–176.
date_created: 2020-01-15T12:13:52Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T08:12:46Z
day: '01'
ddc:
- '540'
- '543'
- '546'
- '547'
doi: 10.1021/acsenergylett.7b01111
extern: '1'
file:
- access_level: open_access
checksum: 461ccf575ba077af90314fe72d20521e
content_type: application/pdf
creator: sfreunbe
date_created: 2020-06-29T14:19:36Z
date_updated: 2020-07-14T12:47:55Z
file_id: '8049'
file_name: O2 TIOC_fin_incl_SI.pdf
file_size: 1892355
relation: main_file
file_date_updated: 2020-07-14T12:47:55Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 170-176
publication: ACS Energy Letters
publication_identifier:
issn:
- 2380-8195
- 2380-8195
publication_status: published
publisher: ACS
quality_controlled: '1'
status: public
title: Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2
batteries and the solid electrolyte interphase
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2018'
...
---
_id: '738'
abstract:
- lang: eng
text: 'This paper is devoted to automatic competitive analysis of real-time scheduling
algorithms for firm-deadline tasksets, where only completed tasks con- tribute
some utility to the system. Given such a taskset T , the competitive ratio of
an on-line scheduling algorithm A for T is the worst-case utility ratio of A over
the utility achieved by a clairvoyant algorithm. We leverage the theory of quantitative
graph games to address the competitive analysis and competitive synthesis problems.
For the competitive analysis case, given any taskset T and any finite-memory on-
line scheduling algorithm A , we show that the competitive ratio of A in T can
be computed in polynomial time in the size of the state space of A . Our approach
is flexible as it also provides ways to model meaningful constraints on the released
task sequences that determine the competitive ratio. We provide an experimental
study of many well-known on-line scheduling algorithms, which demonstrates the
feasibility of our competitive analysis approach that effectively replaces human
ingenuity (required Preliminary versions of this paper have appeared in Chatterjee
et al. ( 2013 , 2014 ). B Andreas Pavlogiannis pavlogiannis@ist.ac.at Krishnendu
Chatterjee krish.chat@ist.ac.at Alexander Kößler koe@ecs.tuwien.ac.at Ulrich Schmid
s@ecs.tuwien.ac.at 1 IST Austria (Institute of Science and Technology Austria),
Am Campus 1, 3400 Klosterneuburg, Austria 2 Embedded Computing Systems Group,
Vienna University of Technology, Treitlstrasse 3, 1040 Vienna, Austria 123 Real-Time
Syst for finding worst-case scenarios) by computing power. For the competitive
synthesis case, we are just given a taskset T , and the goal is to automatically
synthesize an opti- mal on-line scheduling algorithm A , i.e., one that guarantees
the largest competitive ratio possible for T . We show how the competitive synthesis
problem can be reduced to a two-player graph game with partial information, and
establish that the compu- tational complexity of solving this game is Np -complete.
The competitive synthesis problem is hence in Np in the size of the state space
of the non-deterministic labeled transition system encoding the taskset. Overall,
the proposed framework assists in the selection of suitable scheduling algorithms
for a given taskset, which is in fact the most common situation in real-time systems
design. '
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Alexander
full_name: Kößler, Alexander
last_name: Kößler
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
citation:
ama: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. Automated competitive analysis
of real time scheduling with graph games. Real-Time Systems. 2018;54(1):166-207.
doi:10.1007/s11241-017-9293-4
apa: Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2018). Automated
competitive analysis of real time scheduling with graph games. Real-Time Systems.
Springer. https://doi.org/10.1007/s11241-017-9293-4
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich
Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”
Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.
ieee: K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “Automated competitive
analysis of real time scheduling with graph games,” Real-Time Systems,
vol. 54, no. 1. Springer, pp. 166–207, 2018.
ista: Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2018. Automated competitive
analysis of real time scheduling with graph games. Real-Time Systems. 54(1), 166–207.
mla: Chatterjee, Krishnendu, et al. “Automated Competitive Analysis of Real Time
Scheduling with Graph Games.” Real-Time Systems, vol. 54, no. 1, Springer,
2018, pp. 166–207, doi:10.1007/s11241-017-9293-4.
short: K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, Real-Time Systems 54
(2018) 166–207.
corr_author: '1'
date_created: 2018-12-11T11:48:14Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2025-04-15T08:12:27Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/s11241-017-9293-4
ec_funded: 1
external_id:
isi:
- '000419955500006'
file:
- access_level: open_access
checksum: c2590ef160709d8054cf29ee173f1454
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:14Z
date_updated: 2020-07-14T12:47:56Z
file_id: '5267'
file_name: IST-2018-960-v1+1_2017_Chatterjee_Automated_competetive.pdf
file_size: 1163507
relation: main_file
file_date_updated: 2020-07-14T12:47:56Z
has_accepted_license: '1'
intvolume: ' 54'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 166 - 207
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Real-Time Systems
publication_status: published
publisher: Springer
publist_id: '6929'
pubrep_id: '960'
quality_controlled: '1'
related_material:
record:
- id: '2820'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Automated competitive analysis of real time scheduling with graph games
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: 54
year: '2018'
...
---
_id: '7407'
abstract:
- lang: eng
text: 'Proofs of space (PoS) [Dziembowski et al., CRYPTO''15] are proof systems
where a prover can convince a verifier that he "wastes" disk space. PoS were introduced
as a more ecological and economical replacement for proofs of work which are currently
used to secure blockchains like Bitcoin. In this work we investigate extensions
of PoS which allow the prover to embed useful data into the dedicated space, which
later can be recovered. Our first contribution is a security proof for the original
PoS from CRYPTO''15 in the random oracle model (the original proof only applied
to a restricted class of adversaries which can store a subset of the data an honest
prover would store). When this PoS is instantiated with recent constructions of
maximally depth robust graphs, our proof implies basically optimal security. As
a second contribution we show three different extensions of this PoS where useful
data can be embedded into the space required by the prover. Our security proof
for the PoS extends (non-trivially) to these constructions. We discuss how some
of these variants can be used as proofs of catalytic space (PoCS), a notion we
put forward in this work, and which basically is a PoS where most of the space
required by the prover can be used to backup useful data. Finally we discuss how
one of the extensions is a candidate construction for a proof of replication (PoR),
a proof system recently suggested in the Filecoin whitepaper. '
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical
Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59'
apa: 'Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations
in Theoretical Computer Science Conference (Vol. 124, p. 59:1-59:25). San
Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59'
chicago: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations
in Theoretical Computer Science Conference, 124:59:1-59:25. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.
ieee: K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical
Computer Science Conference, San Diego, CA, United States, 2018, vol. 124,
p. 59:1-59:25.
ista: 'Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical
Computer Science Conference. ITCS: Innovations in Theoretical Computer Science,
LIPIcs, vol. 124, 59:1-59:25.'
mla: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in
Theoretical Computer Science Conference, vol. 124, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25.
conference:
end_date: 2019-01-12
location: San Diego, CA, United States
name: 'ITCS: Innovations in Theoretical Computer Science'
start_date: 2019-01-10
corr_author: '1'
date_created: 2020-01-30T09:16:05Z
date_published: 2018-12-31T00:00:00Z
date_updated: 2025-07-03T11:55:28Z
day: '31'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPICS.ITCS.2019.59
ec_funded: 1
file:
- access_level: open_access
checksum: 5cebb7f7849a3beda898f697d755dd96
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:17:52Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7443'
file_name: 2018_LIPIcs_Pietrzak.pdf
file_size: 822884
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/194
month: '12'
oa: 1
oa_version: Published Version
page: 59:1-59:25
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: 10th Innovations in Theoretical Computer Science Conference
publication_identifier:
isbn:
- 978-3-95977-095-8
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Proofs of catalytic space
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: 124
year: '2018'
...
---
_id: '742'
abstract:
- lang: eng
text: 'We give a detailed and easily accessible proof of Gromov’s Topological Overlap
Theorem. Let X be a finite simplicial complex or, more generally, a finite polyhedral
cell complex of dimension d. Informally, the theorem states that if X has sufficiently
strong higher-dimensional expansion properties (which generalize edge expansion
of graphs and are defined in terms of cellular cochains of X) then X has the following
topological overlap property: for every continuous map (Formula presented.) there
exists a point (Formula presented.) that is contained in the images of a positive
fraction (Formula presented.) of the d-cells of X. More generally, the conclusion
holds if (Formula presented.) is replaced by any d-dimensional piecewise-linear
manifold M, with a constant (Formula presented.) that depends only on d and on
the expansion properties of X, but not on M.'
article_processing_charge: Yes (via OA deal)
author:
- first_name: Dominic
full_name: Dotterrer, Dominic
last_name: Dotterrer
- first_name: Tali
full_name: Kaufman, Tali
last_name: Kaufman
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Dotterrer D, Kaufman T, Wagner U. On expansion and topological overlap. Geometriae
Dedicata. 2018;195(1):307–317. doi:10.1007/s10711-017-0291-4
apa: Dotterrer, D., Kaufman, T., & Wagner, U. (2018). On expansion and topological
overlap. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0291-4
chicago: Dotterrer, Dominic, Tali Kaufman, and Uli Wagner. “On Expansion and Topological
Overlap.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0291-4.
ieee: D. Dotterrer, T. Kaufman, and U. Wagner, “On expansion and topological overlap,”
Geometriae Dedicata, vol. 195, no. 1. Springer, pp. 307–317, 2018.
ista: Dotterrer D, Kaufman T, Wagner U. 2018. On expansion and topological overlap.
Geometriae Dedicata. 195(1), 307–317.
mla: Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae
Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4.
short: D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.
corr_author: '1'
date_created: 2018-12-11T11:48:16Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2025-06-03T11:41:00Z
day: '01'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.1007/s10711-017-0291-4
external_id:
isi:
- '000437122700017'
file:
- access_level: open_access
checksum: d2f70fc132156504aa4c626aa378a7ab
content_type: application/pdf
creator: kschuh
date_created: 2019-01-15T13:44:05Z
date_updated: 2020-07-14T12:47:58Z
file_id: '5835'
file_name: s10711-017-0291-4.pdf
file_size: 412486
relation: main_file
file_date_updated: 2020-07-14T12:47:58Z
has_accepted_license: '1'
intvolume: ' 195'
isi: 1
issue: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 307–317
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication: Geometriae Dedicata
publication_status: published
publisher: Springer
publist_id: '6925'
pubrep_id: '912'
quality_controlled: '1'
related_material:
record:
- id: '1378'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: On expansion and topological overlap
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: 195
year: '2018'
...
---
_id: '7458'
abstract:
- lang: eng
text: The coupling between magnetic and electric subsystems in composites of ferromagnetic
and ferroelectric phases is a product property that is facilitated by mechanical
strain that arises due to magnetostriction and the piezoelectric effect in the
constituent phases. Such multiferroic composites are of immense interests for
studies on the physics of electromagnetic coupling and for use in a variety of
applications. Here, we focus on magneto-electric (ME) coupling in nanocomposites.
Particular emphasis is on core-shell particles and coaxial fibers, thin film heterostructures,
and planar structures with a variety of mechanical connectivity. A brief review
of models that predict strong ME effects in nanostructures is followed by synthesis
and characterization. Core-shell particulate composites can be prepared by hydrothermal
processes and chemical or deoxyribonucleic acid-assisted assembly. Electrospinning
techniques have been utilized to prepare defect free core-shell nanofibers. Core-shell
particles and fibers can be assembled into superstructures with the aid of magnetic
and electric fields and characterized for possible use in advanced technologies.
Chemical-vapor deposition techniques have been shown to be effective for the preparation
of heterostructures of ferrites and ferroelectrics. Exotic planar multiferroic
structures with potential for enhancing ME coupling strengths are also considered.
Scanning probe microscopy techniques are ideal for probing the nature of direct-
and converse-ME coupling in individual nanostructures. Magnetoelectric characterization
of assemblies of nanocomposites can be done by ME voltage coefficient, magnetic
field induced polarization, and magneto-dielectric effects. We conclude with a
brief discussion on possible avenues for strengthening the product properties
in the nanocomposites.
article_number: '061101'
article_processing_charge: No
article_type: original
author:
- first_name: Dwight
full_name: Viehland, Dwight
last_name: Viehland
- first_name: Jie Fang
full_name: Li, Jie Fang
last_name: Li
- first_name: Yaodong
full_name: Yang, Yaodong
last_name: Yang
- first_name: Tommaso
full_name: Costanzo, Tommaso
id: D93824F4-D9BA-11E9-BB12-F207E6697425
last_name: Costanzo
orcid: 0000-0001-9732-3815
- first_name: Amin
full_name: Yourdkhani, Amin
last_name: Yourdkhani
- first_name: Gabriel
full_name: Caruntu, Gabriel
last_name: Caruntu
- first_name: Peng
full_name: Zhou, Peng
last_name: Zhou
- first_name: Tianjin
full_name: Zhang, Tianjin
last_name: Zhang
- first_name: Tianqian
full_name: Li, Tianqian
last_name: Li
- first_name: Arunava
full_name: Gupta, Arunava
last_name: Gupta
- first_name: Maksym
full_name: Popov, Maksym
last_name: Popov
- first_name: Gopalan
full_name: Srinivasan, Gopalan
last_name: Srinivasan
citation:
ama: 'Viehland D, Li JF, Yang Y, et al. Tutorial: Product properties in multiferroic
nanocomposites. Journal of Applied Physics. 2018;124(6). doi:10.1063/1.5038726'
apa: 'Viehland, D., Li, J. F., Yang, Y., Costanzo, T., Yourdkhani, A., Caruntu,
G., … Srinivasan, G. (2018). Tutorial: Product properties in multiferroic nanocomposites.
Journal of Applied Physics. AIP. https://doi.org/10.1063/1.5038726'
chicago: 'Viehland, Dwight, Jie Fang Li, Yaodong Yang, Tommaso Costanzo, Amin Yourdkhani,
Gabriel Caruntu, Peng Zhou, et al. “Tutorial: Product Properties in Multiferroic
Nanocomposites.” Journal of Applied Physics. AIP, 2018. https://doi.org/10.1063/1.5038726.'
ieee: 'D. Viehland et al., “Tutorial: Product properties in multiferroic
nanocomposites,” Journal of Applied Physics, vol. 124, no. 6. AIP, 2018.'
ista: 'Viehland D, Li JF, Yang Y, Costanzo T, Yourdkhani A, Caruntu G, Zhou P, Zhang
T, Li T, Gupta A, Popov M, Srinivasan G. 2018. Tutorial: Product properties in
multiferroic nanocomposites. Journal of Applied Physics. 124(6), 061101.'
mla: 'Viehland, Dwight, et al. “Tutorial: Product Properties in Multiferroic Nanocomposites.”
Journal of Applied Physics, vol. 124, no. 6, 061101, AIP, 2018, doi:10.1063/1.5038726.'
short: D. Viehland, J.F. Li, Y. Yang, T. Costanzo, A. Yourdkhani, G. Caruntu, P.
Zhou, T. Zhang, T. Li, A. Gupta, M. Popov, G. Srinivasan, Journal of Applied Physics
124 (2018).
date_created: 2020-02-05T14:18:22Z
date_published: 2018-08-10T00:00:00Z
date_updated: 2023-02-23T13:08:29Z
day: '10'
doi: 10.1063/1.5038726
extern: '1'
intvolume: ' 124'
issue: '6'
language:
- iso: eng
month: '08'
oa_version: None
publication: Journal of Applied Physics
publication_identifier:
issn:
- 0021-8979
- 1089-7550
publication_status: published
publisher: AIP
quality_controlled: '1'
status: public
title: 'Tutorial: Product properties in multiferroic nanocomposites'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 124
year: '2018'
...
---
_id: '75'
abstract:
- lang: eng
text: We prove that any convex body in the plane can be partitioned into m convex
parts of equal areas and perimeters for any integer m≥2; this result was previously
known for prime powers m=pk. We also give a higher-dimensional generalization.
article_number: '1804.03057'
article_processing_charge: No
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
orcid: 0000-0002-7840-5062
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
citation:
ama: Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number
of pieces. 2018. doi:10.48550/arXiv.1804.03057
apa: Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions
into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057
chicago: Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions
into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057.
ieee: A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary
number of pieces.” arXiv, 2018.
ista: Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary
number of pieces. 1804.03057.
mla: Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of
Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.
short: A. Akopyan, S. Avvakumov, R. Karasev, (2018).
corr_author: '1'
date_created: 2018-12-11T11:44:30Z
date_published: 2018-09-13T00:00:00Z
date_updated: 2026-04-08T07:25:54Z
day: '13'
department:
- _id: HeEd
- _id: JaMa
doi: 10.48550/arXiv.1804.03057
ec_funded: 1
external_id:
arxiv:
- '1804.03057'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.03057
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
publication_status: published
publisher: arXiv
related_material:
record:
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Convex fair partitions into arbitrary number of pieces
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '9915'
abstract:
- lang: eng
text: 'The evolution of assortative mating is a key part of the speciation process.
Stronger assortment, or greater divergence in mating traits, between species pairs
with overlapping ranges is commonly observed, but possible causes of this pattern
of reproductive character displacement are difficult to distinguish. We use a
multidisciplinary approach to provide a rare example where it is possible to distinguish
among hypotheses concerning the evolution of reproductive character displacement.
We build on an earlier comparative analysis that illustrated a strong pattern
of greater divergence in penis form between pairs of sister species with overlapping
ranges than between allopatric sister-species pairs, in a large clade of marine
gastropods (Littorinidae). We investigate both assortative mating and divergence
in male genitalia in one of the sister-species pairs, discriminating among three
contrasting processes each of which can generate a pattern of reproductive character
displacement: reinforcement, reproductive interference and the Templeton effect.
We demonstrate reproductive character displacement in assortative mating, but
not in genital form between this pair of sister species and use demographic models
to distinguish among the different processes. Our results support a model with
no gene flow since secondary contact and thus favor reproductive interference
as the cause of reproductive character displacement for mate choice, rather than
reinforcement. High gene flow within species argues against the Templeton effect.
Secondary contact appears to have had little impact on genital divergence.'
acknowledgement: The authors express a special thanks to Dr Richard Willan at the
Museum and Art Gallery of the Northern Territory for guidance and support in the
field, and to Carole Smadja for reading and commenting on the manuscript. The authors
thank the Government of Western Australia Department of Parks and Wildlife (license
no. 009254) and Fishery Research Division (exemption no. 2262) for assistance with
permits. Khalid Belkhir modified the coalescent sampler msnsam for the specific
needs of this project and Martin Hirsch helped to set up the ABC pipeline and to
modify the summary statistic calculator mscalc. The authors are grateful to the
Crafoord Foundation for supporting this project. R.K.B., A.M.W., and L.D. were supported
by grants from the Natural Environment Research Council, R.K.B. and A.M.W. were
also supported by the European Research Council and R.K.B. and L.D. by the Leverhulme
Trust. M.M.R. was supported by Consejo Nacional de Ciencia y Tecnología and Secretaría
de Educación Pública, Mexico. G.B. was supported by the Centre for Animal Movement
Research (CAnMove) financed by a Linnaeus grant (No. 349-2007-8690) from the Swedish
Research Council and Lund University.
article_processing_charge: Yes
article_type: letter_note
author:
- first_name: Johan
full_name: Hollander, Johan
last_name: Hollander
- first_name: Mauricio
full_name: Montaño-Rendón, Mauricio
last_name: Montaño-Rendón
- first_name: Giuseppe
full_name: Bianco, Giuseppe
last_name: Bianco
- first_name: Xi
full_name: Yang, Xi
last_name: Yang
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Ludovic
full_name: Duvaux, Ludovic
last_name: Duvaux
- first_name: David G.
full_name: Reid, David G.
last_name: Reid
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: Hollander J, Montaño-Rendón M, Bianco G, et al. Are assortative mating and
genital divergence driven by reinforcement? Evolution Letters. 2018;2(6):557-566.
doi:10.1002/evl3.85
apa: Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux,
L., … Butlin, R. K. (2018). Are assortative mating and genital divergence driven
by reinforcement? Evolution Letters. Wiley. https://doi.org/10.1002/evl3.85
chicago: Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja
M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Are Assortative
Mating and Genital Divergence Driven by Reinforcement?” Evolution Letters.
Wiley, 2018. https://doi.org/10.1002/evl3.85.
ieee: J. Hollander et al., “Are assortative mating and genital divergence
driven by reinforcement?,” Evolution Letters, vol. 2, no. 6. Wiley, pp.
557–566, 2018.
ista: Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid
DG, Butlin RK. 2018. Are assortative mating and genital divergence driven by reinforcement?
Evolution Letters. 2(6), 557–566.
mla: Hollander, Johan, et al. “Are Assortative Mating and Genital Divergence Driven
by Reinforcement?” Evolution Letters, vol. 2, no. 6, Wiley, 2018, pp. 557–66,
doi:10.1002/evl3.85.
short: J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux,
D.G. Reid, R.K. Butlin, Evolution Letters 2 (2018) 557–566.
date_created: 2021-08-16T07:30:00Z
date_published: 2018-12-13T00:00:00Z
date_updated: 2024-10-21T06:02:42Z
day: '13'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1002/evl3.85
external_id:
isi:
- '000452990000002'
pmid:
- '30564439'
file:
- access_level: open_access
checksum: 997a78ac41c809975ca69cbdea441f88
content_type: application/pdf
creator: asandaue
date_created: 2021-08-16T07:37:28Z
date_updated: 2021-08-16T07:37:28Z
file_id: '9916'
file_name: 2018_EvolutionLetters_Hollander.pdf
file_size: 584606
relation: main_file
success: 1
file_date_updated: 2021-08-16T07:37:28Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '6'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 557-566
pmid: 1
publication: Evolution Letters
publication_identifier:
eissn:
- 2056-3744
issn:
- ' 2056-3744'
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '9929'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Are assortative mating and genital divergence driven by reinforcement?
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: 2
year: '2018'
...
---
_id: '9917'
abstract:
- lang: eng
text: Adaptive divergence and speciation may happen despite opposition by gene flow.
Identifying the genomic basis underlying divergence with gene flow is a major
task in evolutionary genomics. Most approaches (e.g., outlier scans) focus on
genomic regions of high differentiation. However, not all genomic architectures
potentially underlying divergence are expected to show extreme differentiation.
Here, we develop an approach that combines hybrid zone analysis (i.e., focuses
on spatial patterns of allele frequency change) with system-specific simulations
to identify loci inconsistent with neutral evolution. We apply this to a genome-wide
SNP set from an ideally suited study organism, the intertidal snail Littorina
saxatilis, which shows primary divergence between ecotypes associated with different
shore habitats. We detect many SNPs with clinal patterns, most of which are consistent
with neutrality. Among non-neutral SNPs, most are located within three large putative
inversions differentiating ecotypes. Many non-neutral SNPs show relatively low
levels of differentiation. We discuss potential reasons for this pattern, including
loose linkage to selected variants, polygenic adaptation and a component of balancing
selection within populations (which may be expected for inversions). Our work
is in line with theory predicting a role for inversions in divergence, and emphasizes
that genomic regions contributing to divergence may not always be accessible with
methods purely based on allele frequency differences. These conclusions call for
approaches that take spatial patterns of allele frequency change into account
in other systems.
acknowledgement: We are very grateful to people who helped with fieldwork, snail processing,
and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo,
Anne-Lise Liabot and Irena Senčić. We would also like to thank Magnus Alm Rosenblad
and Mats Töpel for their contribution to assembling the Littorina saxatilis genome,
Carl André, Pasi Rastas, and Romain Villoutreix for discussion, and two anonymous
reviewers for their helpful comments on the manuscript. We are grateful to RapidGenomics
for library preparation and sequencing. We thank the Natural Environment Research
Council, the European Research Council and the Swedish Research Councils VR and
Formas (Linnaeus grant to the Centre for Marine Evolutionary Biology and Tage Erlander
Guest Professorship) for funding. P.C. was funded by the University of Sheffield
Vice-chancellor's India scholarship. R.F. is funded by the European Union's Horizon
2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement
no. 706376. M. Raf. was supported by the Adlerbert Research Foundation.
article_processing_charge: Yes
article_type: letter_note
author:
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Pragya
full_name: Chaube, Pragya
last_name: Chaube
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Tomas
full_name: Larsson, Tomas
last_name: Larsson
- first_name: Marina
full_name: Panova, Marina
last_name: Panova
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
- first_name: Anders
full_name: Blomberg, Anders
last_name: Blomberg
- first_name: Bernhard
full_name: Mehlig, Bernhard
last_name: Mehlig
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger
full_name: Butlin, Roger
last_name: Butlin
citation:
ama: 'Westram AM, Rafajlović M, Chaube P, et al. Clines on the seashore: The genomic
architecture underlying rapid divergence in the face of gene flow. Evolution
Letters. 2018;2(4):297-309. doi:10.1002/evl3.74'
apa: 'Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova,
M., … Butlin, R. (2018). Clines on the seashore: The genomic architecture underlying
rapid divergence in the face of gene flow. Evolution Letters. Wiley. https://doi.org/10.1002/evl3.74'
chicago: 'Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson,
Marina Panova, Mark Ravinet, et al. “Clines on the Seashore: The Genomic Architecture
Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters.
Wiley, 2018. https://doi.org/10.1002/evl3.74.'
ieee: 'A. M. Westram et al., “Clines on the seashore: The genomic architecture
underlying rapid divergence in the face of gene flow,” Evolution Letters,
vol. 2, no. 4. Wiley, pp. 297–309, 2018.'
ista: 'Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet
M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Clines on the seashore:
The genomic architecture underlying rapid divergence in the face of gene flow.
Evolution Letters. 2(4), 297–309.'
mla: 'Westram, Anja M., et al. “Clines on the Seashore: The Genomic Architecture
Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters,
vol. 2, no. 4, Wiley, 2018, pp. 297–309, doi:10.1002/evl3.74.'
short: A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova,
M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, Evolution Letters
2 (2018) 297–309.
date_created: 2021-08-16T07:45:38Z
date_published: 2018-08-20T00:00:00Z
date_updated: 2024-10-21T06:02:42Z
day: '20'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1002/evl3.74
external_id:
isi:
- '000446774400004'
pmid:
- '30283683'
file:
- access_level: open_access
checksum: 8524e72507d521416be3f8ccfcd5e3f5
content_type: application/pdf
creator: asandaue
date_created: 2021-08-16T07:48:03Z
date_updated: 2021-08-16T07:48:03Z
file_id: '9918'
file_name: 2018_EvolutionLetters_Westram.pdf
file_size: 764299
relation: main_file
success: 1
file_date_updated: 2021-08-16T07:48:03Z
has_accepted_license: '1'
intvolume: ' 2'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 297-309
pmid: 1
publication: Evolution Letters
publication_identifier:
eissn:
- 2056-3744
issn:
- 2056-3744
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '9930'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'Clines on the seashore: The genomic architecture underlying rapid divergence
in the face of gene flow'
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: 2
year: '2018'
...
---
_id: '9929'
abstract:
- lang: eng
text: 'The evolution of assortative mating is a key part of the speciation process.
Stronger assortment, or greater divergence in mating traits, between species pairs
with overlapping ranges is commonly observed, but possible causes of this pattern
of reproductive character displacement are difficult to distinguish. We use a
multidisciplinary approach to provide a rare example where it is possible to distinguish
among hypotheses concerning the evolution of reproductive character displacement.
We build on an earlier comparative analysis that illustrated a strong pattern
of greater divergence in penis form between pairs of sister species with overlapping
ranges than between allopatric sister-species pairs, in a large clade of marine
gastropods (Littorinidae). We investigate both assortative mating and divergence
in male genitalia in one of the sister-species pairs, discriminating among three
contrasting processes each of which can generate a pattern of reproductive character
displacement: reinforcement, reproductive interference and the Templeton effect.
We demonstrate reproductive character displacement in assortative mating, but
not in genital form between this pair of sister species and use demographic models
to distinguish among the different processes. Our results support a model with
no gene flow since secondary contact and thus favour reproductive interference
as the cause of reproductive character displacement for mate choice, rather than
reinforcement. High gene flow within species argues against the Templeton effect.
Secondary contact appears to have had little impact on genital divergence.'
article_processing_charge: No
author:
- first_name: Johan
full_name: Hollander, Johan
last_name: Hollander
- first_name: Mauricio
full_name: Montaño-Rendón, Mauricio
last_name: Montaño-Rendón
- first_name: Giuseppe
full_name: Bianco, Giuseppe
last_name: Bianco
- first_name: Xi
full_name: Yang, Xi
last_name: Yang
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Ludovic
full_name: Duvaux, Ludovic
last_name: Duvaux
- first_name: David G.
full_name: Reid, David G.
last_name: Reid
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: 'Hollander J, Montaño-Rendón M, Bianco G, et al. Data from: Are assortative
mating and genital divergence driven by reinforcement? 2018. doi:10.5061/dryad.51sd2p5'
apa: 'Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux,
L., … Butlin, R. K. (2018). Data from: Are assortative mating and genital divergence
driven by reinforcement? Dryad. https://doi.org/10.5061/dryad.51sd2p5'
chicago: 'Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja
M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Data from: Are
Assortative Mating and Genital Divergence Driven by Reinforcement?” Dryad, 2018.
https://doi.org/10.5061/dryad.51sd2p5.'
ieee: 'J. Hollander et al., “Data from: Are assortative mating and genital
divergence driven by reinforcement?” Dryad, 2018.'
ista: 'Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid
DG, Butlin RK. 2018. Data from: Are assortative mating and genital divergence
driven by reinforcement?, Dryad, 10.5061/dryad.51sd2p5.'
mla: 'Hollander, Johan, et al. Data from: Are Assortative Mating and Genital
Divergence Driven by Reinforcement? Dryad, 2018, doi:10.5061/dryad.51sd2p5.'
short: J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux,
D.G. Reid, R.K. Butlin, (2018).
date_created: 2021-08-17T08:51:06Z
date_published: 2018-10-17T00:00:00Z
date_updated: 2024-10-21T06:02:42Z
day: '17'
department:
- _id: BeVi
doi: 10.5061/dryad.51sd2p5
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.51sd2p5
month: '10'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9915'
relation: used_in_publication
status: public
status: public
title: 'Data from: Are assortative mating and genital divergence driven by reinforcement?'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...
---
_id: '9930'
abstract:
- lang: eng
text: Adaptive divergence and speciation may happen despite opposition by gene flow.
Identifying the genomic basis underlying divergence with gene flow is a major
task in evolutionary genomics. Most approaches (e.g. outlier scans) focus on genomic
regions of high differentiation. However, not all genomic architectures potentially
underlying divergence are expected to show extreme differentiation. Here, we develop
an approach that combines hybrid zone analysis (i.e. focuses on spatial patterns
of allele frequency change) with system-specific simulations to identify loci
inconsistent with neutral evolution. We apply this to a genome-wide SNP set from
an ideally-suited study organism, the intertidal snail Littorina saxatilis, which
shows primary divergence between ecotypes associated with different shore habitats.
We detect many SNPs with clinal patterns, most of which are consistent with neutrality.
Among non-neutral SNPs, most are located within three large putative inversions
differentiating ecotypes. Many non-neutral SNPs show relatively low levels of
differentiation. We discuss potential reasons for this pattern, including loose
linkage to selected variants, polygenic adaptation and a component of balancing
selection within populations (which may be expected for inversions). Our work
is in line with theory predicting a role for inversions in divergence, and emphasises
that genomic regions contributing to divergence may not always be accessible with
methods purely based on allele frequency differences. These conclusions call for
approaches that take spatial patterns of allele frequency change into account
in other systems.
article_processing_charge: No
author:
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Marina
full_name: Rafajlović, Marina
last_name: Rafajlović
- first_name: Pragya
full_name: Chaube, Pragya
last_name: Chaube
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Tomas
full_name: Larsson, Tomas
last_name: Larsson
- first_name: Marina
full_name: Panova, Marina
last_name: Panova
- first_name: Mark
full_name: Ravinet, Mark
last_name: Ravinet
- first_name: Anders
full_name: Blomberg, Anders
last_name: Blomberg
- first_name: Bernhard
full_name: Mehlig, Bernhard
last_name: Mehlig
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Roger
full_name: Butlin, Roger
last_name: Butlin
citation:
ama: 'Westram AM, Rafajlović M, Chaube P, et al. Data from: Clines on the seashore:
the genomic architecture underlying rapid divergence in the face of gene flow.
2018. doi:10.5061/dryad.bp25b65'
apa: 'Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova,
M., … Butlin, R. (2018). Data from: Clines on the seashore: the genomic architecture
underlying rapid divergence in the face of gene flow. Dryad. https://doi.org/10.5061/dryad.bp25b65'
chicago: 'Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson,
Marina Panova, Mark Ravinet, et al. “Data from: Clines on the Seashore: The Genomic
Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Dryad, 2018.
https://doi.org/10.5061/dryad.bp25b65.'
ieee: 'A. M. Westram et al., “Data from: Clines on the seashore: the genomic
architecture underlying rapid divergence in the face of gene flow.” Dryad, 2018.'
ista: 'Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet
M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Data from: Clines on the
seashore: the genomic architecture underlying rapid divergence in the face of
gene flow, Dryad, 10.5061/dryad.bp25b65.'
mla: 'Westram, Anja M., et al. Data from: Clines on the Seashore: The Genomic
Architecture Underlying Rapid Divergence in the Face of Gene Flow. Dryad,
2018, doi:10.5061/dryad.bp25b65.'
short: A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova,
M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, (2018).
date_created: 2021-08-17T08:58:47Z
date_published: 2018-07-23T00:00:00Z
date_updated: 2024-10-21T06:02:42Z
day: '23'
department:
- _id: BeVi
doi: 10.5061/dryad.bp25b65
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.bp25b65
month: '07'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '9917'
relation: used_in_publication
status: public
status: public
title: 'Data from: Clines on the seashore: the genomic architecture underlying rapid
divergence in the face of gene flow'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2018'
...
---
_id: '309'
abstract:
- lang: eng
text: 'We present an efficient algorithm for a problem in the interface between
clustering and graph embeddings. An embedding '' : G ! M of a graph G into a 2manifold
M maps the vertices in V (G) to distinct points and the edges in E(G) to interior-disjoint
Jordan arcs between the corresponding vertices. In applications in clustering,
cartography, and visualization, nearby vertices and edges are often bundled to
a common node or arc, due to data compression or low resolution. This raises the
computational problem of deciding whether a given map '' : G ! M comes from an
embedding. A map '' : G ! M is a weak embedding if it can be perturbed into an
embedding ψ: G ! M with k'' "k < " for every " > 0. A polynomial-time
algorithm for recognizing weak embeddings was recently found by Fulek and Kyncl
[14], which reduces to solving a system of linear equations over Z2. It runs in
O(n2!) O(n4:75) time, where 2:373 is the matrix multiplication exponent and n
is the number of vertices and edges of G. We improve the running time to O(n log
n). Our algorithm is also conceptually simpler than [14]: We perform a sequence
of local operations that gradually "untangles" the image ''(G) into
an embedding (G), or reports that '' is not a weak embedding. It generalizes a
recent technique developed for the case that G is a cycle and the embedding is
a simple polygon [1], and combines local constraints on the orientation of subgraphs
directly, thereby eliminating the need for solving large systems of linear equations.'
acknowledgement: '∗Research supported in part by the NSF awards CCF-1422311 and CCF-1423615,
and the Science Without Borders program. The second author gratefully acknowledges
support from Austrian Science Fund (FWF): M2281-N35.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Hugo
full_name: Akitaya, Hugo
last_name: Akitaya
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Csaba
full_name: Tóth, Csaba
last_name: Tóth
citation:
ama: 'Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. In: ACM;
2018:274-292. doi:10.1137/1.9781611975031.20'
apa: 'Akitaya, H., Fulek, R., & Tóth, C. (2018). Recognizing weak embeddings
of graphs (pp. 274–292). Presented at the SODA: Symposium on Discrete Algorithms,
New Orleans, LA, USA: ACM. https://doi.org/10.1137/1.9781611975031.20'
chicago: Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings
of Graphs,” 274–92. ACM, 2018. https://doi.org/10.1137/1.9781611975031.20.
ieee: 'H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,”
presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA,
2018, pp. 274–292.'
ista: 'Akitaya H, Fulek R, Tóth C. 2018. Recognizing weak embeddings of graphs.
SODA: Symposium on Discrete Algorithms, 274–292.'
mla: Akitaya, Hugo, et al. Recognizing Weak Embeddings of Graphs. ACM, 2018,
pp. 274–92, doi:10.1137/1.9781611975031.20.
short: H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292.
conference:
end_date: 2018-01-10
location: New Orleans, LA, USA
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2018-01-07
date_created: 2018-12-11T11:45:45Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2025-04-14T13:52:37Z
day: '01'
department:
- _id: UlWa
doi: 10.1137/1.9781611975031.20
external_id:
arxiv:
- '1709.09209'
isi:
- '000483921200021'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1709.09209
month: '01'
oa: 1
oa_version: Preprint
page: 274 - 292
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication_status: published
publisher: ACM
publist_id: '7556'
quality_controlled: '1'
related_material:
record:
- id: '6982'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Recognizing weak embeddings of graphs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '31'
abstract:
- lang: eng
text: Correlations in sensory neural networks have both extrinsic and intrinsic
origins. Extrinsic or stimulus correlations arise from shared inputs to the network
and, thus, depend strongly on the stimulus ensemble. Intrinsic or noise correlations
reflect biophysical mechanisms of interactions between neurons, which are expected
to be robust to changes in the stimulus ensemble. Despite the importance of this
distinction for understanding how sensory networks encode information collectively,
no method exists to reliably separate intrinsic interactions from extrinsic correlations
in neural activity data, limiting our ability to build predictive models of the
network response. In this paper we introduce a general strategy to infer population
models of interacting neurons that collectively encode stimulus information. The
key to disentangling intrinsic from extrinsic correlations is to infer the couplings
between neurons separately from the encoding model and to combine the two using
corrections calculated in a mean-field approximation. We demonstrate the effectiveness
of this approach in retinal recordings. The same coupling network is inferred
from responses to radically different stimulus ensembles, showing that these couplings
indeed reflect stimulus-independent interactions between neurons. The inferred
model predicts accurately the collective response of retinal ganglion cell populations
as a function of the stimulus.
acknowledgement: This work was supported by ANR Trajectory, the French State program
Investissements d’Avenir managed by the Agence Nationale de la Recherche (LIFESENSES;
ANR-10-LABX-65), EC Grant No. H2020-785907 from the Human Brain Project, NIH Grant
No. U01NS090501, and an AVIESAN-UNADEV grant to O.M. M.C. was supported by the Agence
Nationale de la Recherche Jeune Chercheur/Jeune Chercheuse grant (ANR-17-CE37-0013).
article_number: '042410'
article_processing_charge: No
article_type: original
author:
- first_name: Ulisse
full_name: Ferrari, Ulisse
last_name: Ferrari
- first_name: Stephane
full_name: Deny, Stephane
last_name: Deny
- first_name: Matthew J
full_name: Chalk, Matthew J
last_name: Chalk
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Thierry
full_name: Mora, Thierry
last_name: Mora
citation:
ama: Ferrari U, Deny S, Chalk MJ, Tkačik G, Marre O, Mora T. Separating intrinsic
interactions from extrinsic correlations in a network of sensory neurons. Physical
Review E. 2018;98(4). doi:10.1103/PhysRevE.98.042410
apa: Ferrari, U., Deny, S., Chalk, M. J., Tkačik, G., Marre, O., & Mora, T.
(2018). Separating intrinsic interactions from extrinsic correlations in a network
of sensory neurons. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.98.042410
chicago: Ferrari, Ulisse, Stephane Deny, Matthew J Chalk, Gašper Tkačik, Olivier
Marre, and Thierry Mora. “Separating Intrinsic Interactions from Extrinsic Correlations
in a Network of Sensory Neurons.” Physical Review E. American Physical
Society, 2018. https://doi.org/10.1103/PhysRevE.98.042410.
ieee: U. Ferrari, S. Deny, M. J. Chalk, G. Tkačik, O. Marre, and T. Mora, “Separating
intrinsic interactions from extrinsic correlations in a network of sensory neurons,”
Physical Review E, vol. 98, no. 4. American Physical Society, 2018.
ista: Ferrari U, Deny S, Chalk MJ, Tkačik G, Marre O, Mora T. 2018. Separating intrinsic
interactions from extrinsic correlations in a network of sensory neurons. Physical
Review E. 98(4), 042410.
mla: Ferrari, Ulisse, et al. “Separating Intrinsic Interactions from Extrinsic Correlations
in a Network of Sensory Neurons.” Physical Review E, vol. 98, no. 4, 042410,
American Physical Society, 2018, doi:10.1103/PhysRevE.98.042410.
short: U. Ferrari, S. Deny, M.J. Chalk, G. Tkačik, O. Marre, T. Mora, Physical Review
E 98 (2018).
date_created: 2018-12-11T11:44:15Z
date_published: 2018-10-17T00:00:00Z
date_updated: 2025-05-05T13:48:04Z
day: '17'
department:
- _id: GaTk
doi: 10.1103/PhysRevE.98.042410
ec_funded: 1
external_id:
isi:
- '000447486100004'
intvolume: ' 98'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/10.1101/243816v2.full
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 26436750-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '785907'
name: Human Brain Project Specific Grant Agreement 2
publication: Physical Review E
publication_identifier:
issn:
- 2470-0045
publication_status: published
publisher: American Physical Society
publist_id: '8024'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Separating intrinsic interactions from extrinsic correlations in a network
of sensory neurons
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 98
year: '2018'
...
---
_id: '310'
abstract:
- lang: eng
text: A model of computation that is widely used in the formal analysis of reactive
systems is symbolic algorithms. In this model the access to the input graph is
restricted to consist of symbolic operations, which are expensive in comparison
to the standard RAM operations. We give lower bounds on the number of symbolic
operations for basic graph problems such as the computation of the strongly connected
components and of the approximate diameter as well as for fundamental problems
in model checking such as safety, liveness, and coliveness. Our lower bounds are
linear in the number of vertices of the graph, even for constant-diameter graphs.
For none of these problems lower bounds on the number of symbolic operations were
known before. The lower bounds show an interesting separation of these problems
from the reachability problem, which can be solved with O(D) symbolic operations,
where D is the diameter of the graph. Additionally we present an approximation
algorithm for the graph diameter which requires Õ(n/D) symbolic steps to achieve
a (1 +ϵ)-approximation for any constant > 0. This compares to O(n/D) symbolic
steps for the (naive) exact algorithm and O(D) symbolic steps for a 2-approximation.
Finally we also give a refined analysis of the strongly connected components algorithms
of [15], showing that it uses an optimal number of symbolic steps that is proportional
to the sum of the diameters of the strongly connected components.
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- 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
citation:
ama: 'Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. Lower bounds for symbolic
computation on graphs: Strongly connected components, liveness, safety, and diameter.
In: ACM; 2018:2341-2356. doi:10.1137/1.9781611975031.151'
apa: 'Chatterjee, K., Dvorák, W., Henzinger, M., & Loitzenbauer, V. (2018).
Lower bounds for symbolic computation on graphs: Strongly connected components,
liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium
on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. https://doi.org/10.1137/1.9781611975031.151'
chicago: 'Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika
Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected
Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. https://doi.org/10.1137/1.9781611975031.151.'
ieee: 'K. Chatterjee, W. Dvorák, M. Henzinger, and V. Loitzenbauer, “Lower bounds
for symbolic computation on graphs: Strongly connected components, liveness, safety,
and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans,
Louisiana, United States, 2018, pp. 2341–2356.'
ista: 'Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2018. Lower bounds for
symbolic computation on graphs: Strongly connected components, liveness, safety,
and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.'
mla: 'Chatterjee, Krishnendu, et al. Lower Bounds for Symbolic Computation on
Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. ACM,
2018, pp. 2341–56, doi:10.1137/1.9781611975031.151.'
short: K. Chatterjee, W. Dvorák, M. Henzinger, V. Loitzenbauer, in:, ACM, 2018,
pp. 2341–2356.
conference:
end_date: 2018-01-10
location: New Orleans, Louisiana, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2018-01-07
date_created: 2018-12-11T11:45:45Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2025-04-14T13:51:04Z
day: '01'
department:
- _id: KrCh
doi: 10.1137/1.9781611975031.151
ec_funded: 1
external_id:
arxiv:
- '1711.09148'
isi:
- '000483921200152'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1711.09148
month: '01'
oa: 1
oa_version: Preprint
page: 2341 - 2356
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _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
publication_status: published
publisher: ACM
publist_id: '7555'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Lower bounds for symbolic computation on graphs: Strongly connected components,
liveness, safety, and diameter'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '314'
abstract:
- lang: eng
text: The interface of physics and biology pro-vides a fruitful environment for
generatingnew concepts and exciting ways forwardto understanding living matter.
Examplesof successful studies include the estab-lishment and readout of morphogen
gra-dients during development, signal pro-cessing in protein and genetic networks,the
role of fluctuations in determining thefates of cells and tissues, and collectiveeffects
in proteins and in tissues. It is nothard to envision that significant further
ad-vances will translate to societal benefitsby initiating the development of new
de-vices and strategies for curing disease.However, research at the interface
posesvarious challenges, in particular for youngscientists, and current institutions
arerarely designed to facilitate such scientificprograms. In this Letter, we propose
aninternational initiative that addressesthese challenges through the establish-ment
of a worldwide network of platformsfor cross-disciplinary training and incuba-tors
for starting new collaborations.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Guntram
full_name: Bauer, Guntram
last_name: Bauer
- first_name: Nikta
full_name: Fakhri, Nikta
last_name: Fakhri
- first_name: Anna
full_name: Kicheva, Anna
id: 3959A2A0-F248-11E8-B48F-1D18A9856A87
last_name: Kicheva
orcid: 0000-0003-4509-4998
- first_name: Jané
full_name: Kondev, Jané
last_name: Kondev
- first_name: Karsten
full_name: Kruse, Karsten
last_name: Kruse
- first_name: Hiroyuki
full_name: Noji, Hiroyuki
last_name: Noji
- first_name: Daniel
full_name: Riveline, Daniel
last_name: Riveline
- first_name: Timothy
full_name: Saunders, Timothy
last_name: Saunders
- first_name: Mukund
full_name: Thatta, Mukund
last_name: Thatta
- first_name: Eric
full_name: Wieschaus, Eric
last_name: Wieschaus
citation:
ama: Bauer G, Fakhri N, Kicheva A, et al. The science of living matter for tomorrow.
Cell Systems. 2018;6(4):400-402. doi:10.1016/j.cels.2018.04.003
apa: Bauer, G., Fakhri, N., Kicheva, A., Kondev, J., Kruse, K., Noji, H., … Wieschaus,
E. (2018). The science of living matter for tomorrow. Cell Systems. Cell
Press. https://doi.org/10.1016/j.cels.2018.04.003
chicago: Bauer, Guntram, Nikta Fakhri, Anna Kicheva, Jané Kondev, Karsten Kruse,
Hiroyuki Noji, Daniel Riveline, Timothy Saunders, Mukund Thatta, and Eric Wieschaus.
“The Science of Living Matter for Tomorrow.” Cell Systems. Cell Press,
2018. https://doi.org/10.1016/j.cels.2018.04.003.
ieee: G. Bauer et al., “The science of living matter for tomorrow,” Cell
Systems, vol. 6, no. 4. Cell Press, pp. 400–402, 2018.
ista: Bauer G, Fakhri N, Kicheva A, Kondev J, Kruse K, Noji H, Riveline D, Saunders
T, Thatta M, Wieschaus E. 2018. The science of living matter for tomorrow. Cell
Systems. 6(4), 400–402.
mla: Bauer, Guntram, et al. “The Science of Living Matter for Tomorrow.” Cell
Systems, vol. 6, no. 4, Cell Press, 2018, pp. 400–02, doi:10.1016/j.cels.2018.04.003.
short: G. Bauer, N. Fakhri, A. Kicheva, J. Kondev, K. Kruse, H. Noji, D. Riveline,
T. Saunders, M. Thatta, E. Wieschaus, Cell Systems 6 (2018) 400–402.
date_created: 2018-12-11T11:45:46Z
date_published: 2018-04-25T00:00:00Z
date_updated: 2026-06-18T18:38:14Z
day: '25'
ddc:
- '570'
department:
- _id: AnKi
doi: 10.1016/j.cels.2018.04.003
external_id:
isi:
- '000432192100003'
pmid:
- '29698645'
intvolume: ' 6'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cels.2018.04.003
month: '04'
oa: 1
oa_version: Published Version
page: 400 - 402
pmid: 1
publication: Cell Systems
publication_identifier:
eissn:
- 2405-4712
publication_status: published
publisher: Cell Press
publist_id: '7551'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The science of living matter for tomorrow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2018'
...