---
_id: '621'
abstract:
- lang: eng
text: The mammalian cerebral cortex is responsible for higher cognitive functions
such as perception, consciousness, and acquiring and processing information. The
neocortex is organized into six distinct laminae, each composed of a rich diversity
of cell types which assemble into highly complex cortical circuits. Radial glia
progenitors (RGPs) are responsible for producing all neocortical neurons and certain
glia lineages. Here, we discuss recent discoveries emerging from clonal lineage
analysis at the single RGP cell level that provide us with an inaugural quantitative
framework of RGP lineage progression. We further discuss the importance of the
relative contribution of intrinsic gene functions and non-cell-autonomous or community
effects in regulating RGP proliferation behavior and lineage progression.
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Robert J
full_name: Beattie, Robert J
id: 2E26DF60-F248-11E8-B48F-1D18A9856A87
last_name: Beattie
orcid: 0000-0002-8483-8753
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: Beattie RJ, Hippenmeyer S. Mechanisms of radial glia progenitor cell lineage
progression. FEBS letters. 2017;591(24):3993-4008. doi:10.1002/1873-3468.12906
apa: Beattie, R. J., & Hippenmeyer, S. (2017). Mechanisms of radial glia progenitor
cell lineage progression. FEBS Letters. Wiley-Blackwell. https://doi.org/10.1002/1873-3468.12906
chicago: Beattie, Robert J, and Simon Hippenmeyer. “Mechanisms of Radial Glia Progenitor
Cell Lineage Progression.” FEBS Letters. Wiley-Blackwell, 2017. https://doi.org/10.1002/1873-3468.12906.
ieee: R. J. Beattie and S. Hippenmeyer, “Mechanisms of radial glia progenitor cell
lineage progression,” FEBS letters, vol. 591, no. 24. Wiley-Blackwell,
pp. 3993–4008, 2017.
ista: Beattie RJ, Hippenmeyer S. 2017. Mechanisms of radial glia progenitor cell
lineage progression. FEBS letters. 591(24), 3993–4008.
mla: Beattie, Robert J., and Simon Hippenmeyer. “Mechanisms of Radial Glia Progenitor
Cell Lineage Progression.” FEBS Letters, vol. 591, no. 24, Wiley-Blackwell,
2017, pp. 3993–4008, doi:10.1002/1873-3468.12906.
short: R.J. Beattie, S. Hippenmeyer, FEBS Letters 591 (2017) 3993–4008.
date_created: 2018-12-11T11:47:32Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2024-02-14T12:02:08Z
day: '01'
ddc:
- '571'
- '610'
department:
- _id: SiHi
doi: 10.1002/1873-3468.12906
ec_funded: 1
external_id:
pmid:
- '29121403'
file:
- access_level: open_access
checksum: a46dadc84e0c28d389dd3e9e954464db
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:24Z
date_updated: 2020-07-14T12:47:24Z
file_id: '5211'
file_name: IST-2018-928-v1+1_Beattie_et_al-2017-FEBS_Letters.pdf
file_size: 644149
relation: main_file
file_date_updated: 2020-07-14T12:47:24Z
has_accepted_license: '1'
intvolume: ' 591'
issue: '24'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 3993 - 4008
pmid: 1
project:
- _id: 25D7962E-B435-11E9-9278-68D0E5697425
grant_number: RGP0053/2014
name: Quantitative Structure-Function Analysis of Cerebral Cortex Assembly at Clonal
Level
- _id: 25D61E48-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618444'
name: Molecular Mechanisms of Cerebral Cortex Development
publication: FEBS letters
publication_identifier:
issn:
- '00145793'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7183'
pubrep_id: '928'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mechanisms of radial glia progenitor cell lineage progression
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 591
year: '2017'
...
---
_id: '623'
abstract:
- lang: eng
text: Genetic factors might be largely responsible for the development of autism
spectrum disorder (ASD) that alone or in combination with specific environmental
risk factors trigger the pathology. Multiple mutations identified in ASD patients
that impair synaptic function in the central nervous system are well studied in
animal models. How these mutations might interact with other risk factors is not
fully understood though. Additionally, how systems outside of the brain are altered
in the context of ASD is an emerging area of research. Extracerebral influences
on the physiology could begin in utero and contribute to changes in the brain
and in the development of other body systems and further lead to epigenetic changes.
Therefore, multiple recent studies have aimed at elucidating the role of gene-environment
interactions in ASD. Here we provide an overview on the extracerebral systems
that might play an important associative role in ASD and review evidence regarding
the potential roles of inflammation, trace metals, metabolism, genetic susceptibility,
enteric nervous system function and the microbiota of the gastrointestinal (GI)
tract on the development of endophenotypes in animal models of ASD. By influencing
environmental conditions, it might be possible to reduce or limit the severity
of ASD pathology.
alternative_title:
- ADVSANAT
author:
- first_name: Elisa
full_name: Hill Yardin, Elisa
last_name: Hill Yardin
- first_name: Sonja
full_name: Mckeown, Sonja
last_name: Mckeown
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Andreas
full_name: Grabrucker, Andreas
last_name: Grabrucker
citation:
ama: 'Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. Extracerebral dysfunction
in animal models of autism spectrum disorder. In: Schmeisser M, Boekers T, eds.
Translational Anatomy and Cell Biology of Autism Spectrum Disorder. Vol
224. Advances in Anatomy Embryology and Cell Biology. Springer; 2017:159-187.
doi:10.1007/978-3-319-52498-6_9'
apa: Hill Yardin, E., Mckeown, S., Novarino, G., & Grabrucker, A. (2017). Extracerebral
dysfunction in animal models of autism spectrum disorder. In M. Schmeisser &
T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum
Disorder (Vol. 224, pp. 159–187). Springer. https://doi.org/10.1007/978-3-319-52498-6_9
chicago: Hill Yardin, Elisa, Sonja Mckeown, Gaia Novarino, and Andreas Grabrucker.
“Extracerebral Dysfunction in Animal Models of Autism Spectrum Disorder.” In Translational
Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser
and Tobias Boekers, 224:159–87. Advances in Anatomy Embryology and Cell Biology.
Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_9.
ieee: E. Hill Yardin, S. Mckeown, G. Novarino, and A. Grabrucker, “Extracerebral
dysfunction in animal models of autism spectrum disorder,” in Translational
Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser
and T. Boekers, Eds. Springer, 2017, pp. 159–187.
ista: 'Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. 2017.Extracerebral dysfunction
in animal models of autism spectrum disorder. In: Translational Anatomy and Cell
Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 159–187.'
mla: Hill Yardin, Elisa, et al. “Extracerebral Dysfunction in Animal Models of Autism
Spectrum Disorder.” Translational Anatomy and Cell Biology of Autism Spectrum
Disorder, edited by Michael Schmeisser and Tobias Boekers, vol. 224, Springer,
2017, pp. 159–87, doi:10.1007/978-3-319-52498-6_9.
short: E. Hill Yardin, S. Mckeown, G. Novarino, A. Grabrucker, in:, M. Schmeisser,
T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder,
Springer, 2017, pp. 159–187.
date_created: 2018-12-11T11:47:33Z
date_published: 2017-05-28T00:00:00Z
date_updated: 2021-01-12T08:06:46Z
day: '28'
department:
- _id: GaNo
doi: 10.1007/978-3-319-52498-6_9
editor:
- first_name: Michael
full_name: Schmeisser, Michael
last_name: Schmeisser
- first_name: Tobias
full_name: Boekers, Tobias
last_name: Boekers
intvolume: ' 224'
language:
- iso: eng
month: '05'
oa_version: None
page: 159 - 187
publication: Translational Anatomy and Cell Biology of Autism Spectrum Disorder
publication_identifier:
isbn:
- 978-3-319-52496-2
issn:
- '03015556'
publication_status: published
publisher: Springer
publist_id: '7177'
quality_controlled: '1'
scopus_import: 1
series_title: Advances in Anatomy Embryology and Cell Biology
status: public
title: Extracerebral dysfunction in animal models of autism spectrum disorder
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 224
year: '2017'
...
---
_id: '624'
abstract:
- lang: eng
text: Bacteria adapt to adverse environmental conditions by altering gene expression
patterns. Recently, a novel stress adaptation mechanism has been described that
allows Escherichia coli to alter gene expression at the post-transcriptional level.
The key player in this regulatory pathway is the endoribonuclease MazF, the toxin
component of the toxin-antitoxin module mazEF that is triggered by various stressful
conditions. In general, MazF degrades the majority of transcripts by cleaving
at ACA sites, which results in the retardation of bacterial growth. Furthermore,
MazF can process a small subset of mRNAs and render them leaderless by removing
their ribosome binding site. MazF concomitantly modifies ribosomes, making them
selective for the translation of leaderless mRNAs. In this study, we employed
fluorescent reporter-systems to investigate mazEF expression during stressful
conditions, and to infer consequences of the mRNA processing mediated by MazF
on gene expression at the single-cell level. Our results suggest that mazEF transcription
is maintained at low levels in single cells encountering adverse conditions, such
as antibiotic stress or amino acid starvation. Moreover, using the grcA mRNA as
a model for MazF-mediated mRNA processing, we found that MazF activation promotes
heterogeneity in the grcA reporter expression, resulting in a subpopulation of
cells with increased levels of GrcA reporter protein.
acknowledgement: 'Austrian Science Fund (FWF): M1697, P22249; Swiss National Science
Foundation (SNF): 145706; European Commission;FWF Special Research Program: RNA-REG
F43'
article_number: '3830'
author:
- first_name: Nela
full_name: Nikolic, Nela
id: 42D9CABC-F248-11E8-B48F-1D18A9856A87
last_name: Nikolic
orcid: 0000-0001-9068-6090
- first_name: Zrinka
full_name: Didara, Zrinka
last_name: Didara
- first_name: Isabella
full_name: Moll, Isabella
last_name: Moll
citation:
ama: Nikolic N, Didara Z, Moll I. MazF activation promotes translational heterogeneity
of the grcA mRNA in Escherichia coli populations. PeerJ. 2017;2017(9).
doi:10.7717/peerj.3830
apa: Nikolic, N., Didara, Z., & Moll, I. (2017). MazF activation promotes translational
heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ.
PeerJ. https://doi.org/10.7717/peerj.3830
chicago: Nikolic, Nela, Zrinka Didara, and Isabella Moll. “MazF Activation Promotes
Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.”
PeerJ. PeerJ, 2017. https://doi.org/10.7717/peerj.3830.
ieee: N. Nikolic, Z. Didara, and I. Moll, “MazF activation promotes translational
heterogeneity of the grcA mRNA in Escherichia coli populations,” PeerJ,
vol. 2017, no. 9. PeerJ, 2017.
ista: Nikolic N, Didara Z, Moll I. 2017. MazF activation promotes translational
heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017(9),
3830.
mla: Nikolic, Nela, et al. “MazF Activation Promotes Translational Heterogeneity
of the GrcA MRNA in Escherichia Coli Populations.” PeerJ, vol. 2017, no.
9, 3830, PeerJ, 2017, doi:10.7717/peerj.3830.
short: N. Nikolic, Z. Didara, I. Moll, PeerJ 2017 (2017).
date_created: 2018-12-11T11:47:33Z
date_published: 2017-09-21T00:00:00Z
date_updated: 2021-01-12T08:06:48Z
day: '21'
ddc:
- '579'
department:
- _id: CaGu
doi: 10.7717/peerj.3830
file:
- access_level: open_access
checksum: 3d79ae6b6eabc90b0eaaed82ff3493b0
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:51Z
date_updated: 2020-07-14T12:47:24Z
file_id: '4908'
file_name: IST-2017-909-v1+1_peerj-3830.pdf
file_size: 682064
relation: main_file
file_date_updated: 2020-07-14T12:47:24Z
has_accepted_license: '1'
intvolume: ' 2017'
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: PeerJ
publication_identifier:
issn:
- '21678359'
publication_status: published
publisher: PeerJ
publist_id: '7172'
pubrep_id: '909'
quality_controlled: '1'
scopus_import: 1
status: public
title: MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia
coli populations
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: 2017
year: '2017'
...
---
_id: '625'
abstract:
- lang: eng
text: In the analysis of reactive systems a quantitative objective assigns a real
value to every trace of the system. The value decision problem for a quantitative
objective requires a trace whose value is at least a given threshold, and the
exact value decision problem requires a trace whose value is exactly the threshold.
We compare the computational complexity of the value and exact value decision
problems for classical quantitative objectives, such as sum, discounted sum, energy,
and mean-payoff for two standard models of reactive systems, namely, graphs and
graph games.
acknowledgement: 'This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 and S11407-N23 (RiSE/SHiNE), and Z211-N23 (Wittgenstein
Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund
(WWTF) through project ICT15-003.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative
reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds.
Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science
and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18'
apa: Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness
in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay,
& R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460,
pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost
of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and
Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay,
and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues.
Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.
ieee: K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative
reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L.
Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017,
pp. 367–381.
ista: 'Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative
reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.'
mla: Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.”
Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol.
10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.
short: K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir,
A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017,
pp. 367–381.
date_created: 2018-12-11T11:47:34Z
date_published: 2017-07-25T00:00:00Z
date_updated: 2025-06-02T08:53:45Z
day: '25'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-63121-9_18
ec_funded: 1
editor:
- first_name: Luca
full_name: Aceto, Luca
last_name: Aceto
- first_name: Giorgio
full_name: Bacci, Giorgio
last_name: Bacci
- first_name: Anna
full_name: Ingólfsdóttir, Anna
last_name: Ingólfsdóttir
- first_name: Axel
full_name: Legay, Axel
last_name: Legay
- first_name: Radu
full_name: Mardare, Radu
last_name: Mardare
file:
- access_level: open_access
checksum: b2402766ec02c79801aac634bd8f9f6c
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:06:50Z
date_updated: 2020-07-14T12:47:25Z
file_id: '7048'
file_name: 2017_ModelsAlgorithms_Chatterjee.pdf
file_size: 192826
relation: main_file
file_date_updated: 2020-07-14T12:47:25Z
has_accepted_license: '1'
intvolume: ' 10460'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 367 - 381
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _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: Models, Algorithms, Logics and Tools
publication_identifier:
isbn:
- 978-3-319-63120-2
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '7170'
quality_controlled: '1'
scopus_import: '1'
series_title: Theoretical Computer Science and General Issues
status: public
title: The cost of exactness in quantitative reachability
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10460
year: '2017'
...
---
_id: '626'
abstract:
- lang: eng
text: 'Our focus here is on the infinitesimal model. In this model, one or several
quantitative traits are described as the sum of a genetic and a non-genetic component,
the first being distributed within families as a normal random variable centred
at the average of the parental genetic components, and with a variance independent
of the parental traits. Thus, the variance that segregates within families is
not perturbed by selection, and can be predicted from the variance components.
This does not necessarily imply that the trait distribution across the whole population
should be Gaussian, and indeed selection or population structure may have a substantial
effect on the overall trait distribution. One of our main aims is to identify
some general conditions on the allelic effects for the infinitesimal model to
be accurate. We first review the long history of the infinitesimal model in quantitative
genetics. Then we formulate the model at the phenotypic level in terms of individual
trait values and relationships between individuals, but including different evolutionary
processes: genetic drift, recombination, selection, mutation, population structure,
…. We give a range of examples of its application to evolutionary questions related
to stabilising selection, assortative mating, effective population size and response
to selection, habitat preference and speciation. We provide a mathematical justification
of the model as the limit as the number M of underlying loci tends to infinity
of a model with Mendelian inheritance, mutation and environmental noise, when
the genetic component of the trait is purely additive. We also show how the model
generalises to include epistatic effects. We prove in particular that, within
each family, the genetic components of the individual trait values in the current
generation are indeed normally distributed with a variance independent of ancestral
traits, up to an error of order 1∕M. Simulations suggest that in some cases the
convergence may be as fast as 1∕M.'
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
- first_name: Amandine
full_name: Véber, Amandine
last_name: Véber
citation:
ama: 'Barton NH, Etheridge A, Véber A. The infinitesimal model: Definition derivation
and implications. Theoretical Population Biology. 2017;118:50-73. doi:10.1016/j.tpb.2017.06.001'
apa: 'Barton, N. H., Etheridge, A., & Véber, A. (2017). The infinitesimal model:
Definition derivation and implications. Theoretical Population Biology.
Academic Press. https://doi.org/10.1016/j.tpb.2017.06.001'
chicago: 'Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “The Infinitesimal
Model: Definition Derivation and Implications.” Theoretical Population Biology.
Academic Press, 2017. https://doi.org/10.1016/j.tpb.2017.06.001.'
ieee: 'N. H. Barton, A. Etheridge, and A. Véber, “The infinitesimal model: Definition
derivation and implications,” Theoretical Population Biology, vol. 118.
Academic Press, pp. 50–73, 2017.'
ista: 'Barton NH, Etheridge A, Véber A. 2017. The infinitesimal model: Definition
derivation and implications. Theoretical Population Biology. 118, 50–73.'
mla: 'Barton, Nicholas H., et al. “The Infinitesimal Model: Definition Derivation
and Implications.” Theoretical Population Biology, vol. 118, Academic Press,
2017, pp. 50–73, doi:10.1016/j.tpb.2017.06.001.'
short: N.H. Barton, A. Etheridge, A. Véber, Theoretical Population Biology 118 (2017)
50–73.
date_created: 2018-12-11T11:47:34Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2021-01-12T08:06:50Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1016/j.tpb.2017.06.001
ec_funded: 1
file:
- access_level: open_access
checksum: 7dd02bfcfe8f244f4a6c19091aedf2c8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:45Z
date_updated: 2020-07-14T12:47:25Z
file_id: '4964'
file_name: IST-2017-908-v1+1_1-s2.0-S0040580917300886-main_1_.pdf
file_size: 1133924
relation: main_file
file_date_updated: 2020-07-14T12:47:25Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 50 - 73
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Theoretical Population Biology
publication_identifier:
issn:
- '00405809'
publication_status: published
publisher: Academic Press
publist_id: '7169'
pubrep_id: '908'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The infinitesimal model: Definition derivation and implications'
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: 118
year: '2017'
...
---
_id: '627'
abstract:
- lang: eng
text: Beige adipocytes are a new type of recruitable brownish adipocytes, with highly
mitochondrial membrane uncoupling protein 1 expression and thermogenesis. Beige
adipocytes were found among white adipocytes, especially in subcutaneous white
adipose tissue (sWAT). Therefore, beige adipocytes may be involved in the regulation
of energy metabolism and fat deposition. Transient receptor potential melastatin
8 (TRPM8), a Ca2+-permeable non-selective cation channel, plays vital roles in
the regulation of various cellular functions. It has been reported that TRPM8
activation enhanced the thermogenic function of brown adiposytes. However, the
involvement of TRPM8 in the thermogenic function of WAT remains unexplored. Our
data revealed that TRPM8 was expressed in mouse white adipocytes at mRNA, protein
and functional levels. The mRNA expression of Trpm8 was significantly increased
in the differentiated white adipocytes than pre-adipocytes. Moreover, activation
of TRPM8 by menthol enhanced the expression of thermogenic genes in cultured white
aidpocytes. And menthol-induced increases of the thermogenic genes in white adipocytes
was inhibited by either KT5720 (a protein kinase A inhibitor) or BAPTA-AM. In
addition, high fat diet (HFD)-induced obesity in mice was significantly recovered
by co-treatment with menthol. Dietary menthol enhanced WAT "browning"
and improved glucose metabolism in HFD-induced obesity mice as well. Therefore,
we concluded that TRPM8 might be involved in WAT "browning" by increasing
the expression levels of genes related to thermogenesis and energy metabolism.
And dietary menthol could be a novel approach for combating human obesity and
related metabolic diseases.
article_processing_charge: No
author:
- first_name: Changyu
full_name: Jiang, Changyu
last_name: Jiang
- first_name: Ming-Zhu
full_name: Zhai, Ming-Zhu
id: 34009CFA-F248-11E8-B48F-1D18A9856A87
last_name: Zhai
- first_name: Dong
full_name: Yan, Dong
last_name: Yan
- first_name: Da
full_name: Li, Da
last_name: Li
- first_name: Chen
full_name: Li, Chen
last_name: Li
- first_name: Yonghong
full_name: Zhang, Yonghong
last_name: Zhang
- first_name: Lizu
full_name: Xiao, Lizu
last_name: Xiao
- first_name: Donglin
full_name: Xiong, Donglin
last_name: Xiong
- first_name: Qiwen
full_name: Deng, Qiwen
last_name: Deng
- first_name: Wuping
full_name: Sun, Wuping
last_name: Sun
citation:
ama: Jiang C, Zhai M-Z, Yan D, et al. Dietary menthol-induced TRPM8 activation enhances
WAT “browning” and ameliorates diet-induced obesity. Oncotarget. 2017;8(43):75114-75126.
doi:10.18632/oncotarget.20540
apa: Jiang, C., Zhai, M.-Z., Yan, D., Li, D., Li, C., Zhang, Y., … Sun, W. (2017).
Dietary menthol-induced TRPM8 activation enhances WAT “browning” and ameliorates
diet-induced obesity. Oncotarget. Impact Journals. https://doi.org/10.18632/oncotarget.20540
chicago: Jiang, Changyu, Ming-Zhu Zhai, Dong Yan, Da Li, Chen Li, Yonghong Zhang,
Lizu Xiao, Donglin Xiong, Qiwen Deng, and Wuping Sun. “Dietary Menthol-Induced
TRPM8 Activation Enhances WAT ‘Browning’ and Ameliorates Diet-Induced Obesity.”
Oncotarget. Impact Journals, 2017. https://doi.org/10.18632/oncotarget.20540.
ieee: C. Jiang et al., “Dietary menthol-induced TRPM8 activation enhances
WAT ‘browning’ and ameliorates diet-induced obesity,” Oncotarget, vol.
8, no. 43. Impact Journals, pp. 75114–75126, 2017.
ista: Jiang C, Zhai M-Z, Yan D, Li D, Li C, Zhang Y, Xiao L, Xiong D, Deng Q, Sun
W. 2017. Dietary menthol-induced TRPM8 activation enhances WAT “browning” and
ameliorates diet-induced obesity. Oncotarget. 8(43), 75114–75126.
mla: Jiang, Changyu, et al. “Dietary Menthol-Induced TRPM8 Activation Enhances WAT
‘Browning’ and Ameliorates Diet-Induced Obesity.” Oncotarget, vol. 8, no.
43, Impact Journals, 2017, pp. 75114–26, doi:10.18632/oncotarget.20540.
short: C. Jiang, M.-Z. Zhai, D. Yan, D. Li, C. Li, Y. Zhang, L. Xiao, D. Xiong,
Q. Deng, W. Sun, Oncotarget 8 (2017) 75114–75126.
date_created: 2018-12-11T11:47:34Z
date_published: 2017-08-24T00:00:00Z
date_updated: 2023-10-17T08:56:37Z
day: '24'
ddc:
- '571'
department:
- _id: RySh
doi: 10.18632/oncotarget.20540
file:
- access_level: open_access
checksum: 2219e5348bbfe1aac2725aa620c33280
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:15Z
date_updated: 2020-07-14T12:47:26Z
file_id: '5201'
file_name: IST-2017-907-v1+1_20540-294640-4-PB.pdf
file_size: 6101606
relation: main_file
file_date_updated: 2020-07-14T12:47:26Z
has_accepted_license: '1'
intvolume: ' 8'
issue: '43'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 75114 - 75126
publication: Oncotarget
publication_identifier:
issn:
- 1949-2553
publication_status: published
publisher: Impact Journals
publist_id: '7167'
pubrep_id: '907'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dietary menthol-induced TRPM8 activation enhances WAT “browning” and ameliorates
diet-induced obesity
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: 8
year: '2017'
...
---
_id: '628'
abstract:
- lang: eng
text: We consider the problem of developing automated techniques for solving recurrence
relations to aid the expected-runtime analysis of programs. The motivation is
that several classical textbook algorithms have quite efficient expected-runtime
complexity, whereas the corresponding worst-case bounds are either inefficient
(e.g., Quick-Sort), or completely ineffective (e.g., Coupon-Collector). Since
the main focus of expected-runtime analysis is to obtain efficient bounds, we
consider bounds that are either logarithmic, linear or almost-linear (O(log n),
O(n), O(n · log n), respectively, where n represents the input size). Our main
contribution is an efficient (simple linear-time algorithm) sound approach for
deriving such expected-runtime bounds for the analysis of recurrence relations
induced by randomized algorithms. The experimental results show that our approach
can efficiently derive asymptotically optimal expected-runtime bounds for recurrences
of classical randomized algorithms, including Randomized-Search, Quick-Sort, Quick-Select,
Coupon-Collector, where the worst-case bounds are either inefficient (such as
linear as compared to logarithmic expected-runtime complexity, or quadratic as
compared to linear or almost-linear expected-runtime complexity), or ineffective.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Aniket
full_name: Murhekar, Aniket
last_name: Murhekar
citation:
ama: 'Chatterjee K, Fu H, Murhekar A. Automated recurrence analysis for almost linear
expected runtime bounds. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:118-139.
doi:10.1007/978-3-319-63387-9_6'
apa: 'Chatterjee, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis
for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.)
(Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification,
Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_6'
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence
Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar
and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6.
ieee: 'K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for
almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification,
Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.'
ista: 'Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost
linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426,
118–139.'
mla: Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost
Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kunčak,
vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.
short: K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer,
2017, pp. 118–139.
conference:
end_date: 2017-07-28
location: Heidelberg, Germany
name: 'CAV: Computer Aided Verification'
start_date: 2017-07-24
date_created: 2018-12-11T11:47:35Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:06:55Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-319-63387-9_6
ec_funded: 1
editor:
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
- first_name: Viktor
full_name: Kunčak, Viktor
last_name: Kunčak
intvolume: ' 10426'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.00314
month: '01'
oa: 1
oa_version: Submitted Version
page: 118 - 139
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
isbn:
- 978-331963386-2
publication_status: published
publisher: Springer
publist_id: '7166'
quality_controlled: '1'
scopus_import: 1
status: public
title: Automated recurrence analysis for almost linear expected runtime bounds
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 10426
year: '2017'
...
---
_id: '6287'
abstract:
- lang: eng
text: The main objects considered in the present work are simplicial and CW-complexes
with vertices forming a random point cloud. In particular, we consider a Poisson
point process in R^n and study Delaunay and Voronoi complexes of the first and
higher orders and weighted Delaunay complexes obtained as sections of Delaunay
complexes, as well as the Čech complex. Further, we examine theDelaunay complex
of a Poisson point process on the sphere S^n, as well as of a uniform point cloud,
which is equivalent to the convex hull, providing a connection to the theory of
random polytopes. Each of the complexes in question can be endowed with a radius
function, which maps its cells to the radii of appropriately chosen circumspheres,
called the radius of the cell. Applying and developing discrete Morse theory for
these functions, joining it together with probabilistic and sometimes analytic
machinery, and developing several integral geometric tools, we aim at getting
the distributions of circumradii of typical cells. For all considered complexes,
we are able to generalize and obtain up to constants the distribution of radii
of typical intervals of all types. In low dimensions the constants can be computed
explicitly, thus providing the explicit expressions for the expected numbers of
cells. In particular, it allows to find the expected density of simplices of every
dimension for a Poisson point process in R^4, whereas the result for R^3 was known
already in 1970's.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Anton
full_name: Nikitenko, Anton
id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
last_name: Nikitenko
orcid: 0000-0002-0659-3201
citation:
ama: Nikitenko A. Discrete Morse theory for random complexes . 2017. doi:10.15479/AT:ISTA:th_873
apa: Nikitenko, A. (2017). Discrete Morse theory for random complexes . Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_873
chicago: Nikitenko, Anton. “Discrete Morse Theory for Random Complexes .” Institute
of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_873.
ieee: A. Nikitenko, “Discrete Morse theory for random complexes ,” Institute of
Science and Technology Austria, 2017.
ista: Nikitenko A. 2017. Discrete Morse theory for random complexes . Institute
of Science and Technology Austria.
mla: Nikitenko, Anton. Discrete Morse Theory for Random Complexes . Institute
of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_873.
short: A. Nikitenko, Discrete Morse Theory for Random Complexes , Institute of Science
and Technology Austria, 2017.
date_created: 2019-04-09T15:04:32Z
date_published: 2017-10-27T00:00:00Z
date_updated: 2023-09-15T12:10:34Z
day: '27'
ddc:
- '514'
- '516'
- '519'
degree_awarded: PhD
department:
- _id: HeEd
doi: 10.15479/AT:ISTA:th_873
file:
- access_level: open_access
checksum: ece7e598a2f060b263c2febf7f3fe7f9
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T14:54:51Z
date_updated: 2020-07-14T12:47:26Z
file_id: '6289'
file_name: 2017_Thesis_Nikitenko.pdf
file_size: 2324870
relation: main_file
- access_level: closed
checksum: 99b7ad76e317efd447af60f91e29b49b
content_type: application/zip
creator: dernst
date_created: 2019-04-09T14:54:51Z
date_updated: 2020-07-14T12:47:26Z
file_id: '6290'
file_name: 2017_Thesis_Nikitenko_source.zip
file_size: 2863219
relation: source_file
file_date_updated: 2020-07-14T12:47:26Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '86'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
pubrep_id: '873'
related_material:
record:
- id: '718'
relation: part_of_dissertation
status: public
- id: '5678'
relation: part_of_dissertation
status: public
- id: '87'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
title: 'Discrete Morse theory for random complexes '
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: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '629'
abstract:
- lang: eng
text: Even simple cells like bacteria have precisely regulated cellular anatomies,
which allow them to grow, divide and to respond to internal or external cues with
high fidelity. How spatial and temporal intracellular organization in prokaryotic
cells is achieved and maintained on the basis of locally interacting proteins
still remains largely a mystery. Bulk biochemical assays with purified components
and in vivo experiments help us to approach key cellular processes from two opposite
ends, in terms of minimal and maximal complexity. However, to understand how cellular
phenomena emerge, that are more than the sum of their parts, we have to assemble
cellular subsystems step by step from the bottom up. Here, we review recent in
vitro reconstitution experiments with proteins of the bacterial cell division
machinery and illustrate how they help to shed light on fundamental cellular mechanisms
that constitute spatiotemporal order and regulate cell division.
author:
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Katja
full_name: Zieske, Katja
last_name: Zieske
- first_name: Petra
full_name: Schwille, Petra
last_name: Schwille
citation:
ama: 'Loose M, Zieske K, Schwille P. Reconstitution of protein dynamics involved
in bacterial cell division. In: Prokaryotic Cytoskeletons. Vol 84. Sub-Cellular
Biochemistry. Springer; 2017:419-444. doi:10.1007/978-3-319-53047-5_15'
apa: Loose, M., Zieske, K., & Schwille, P. (2017). Reconstitution of protein
dynamics involved in bacterial cell division. In Prokaryotic Cytoskeletons
(Vol. 84, pp. 419–444). Springer. https://doi.org/10.1007/978-3-319-53047-5_15
chicago: Loose, Martin, Katja Zieske, and Petra Schwille. “Reconstitution of Protein
Dynamics Involved in Bacterial Cell Division.” In Prokaryotic Cytoskeletons,
84:419–44. Sub-Cellular Biochemistry. Springer, 2017. https://doi.org/10.1007/978-3-319-53047-5_15.
ieee: M. Loose, K. Zieske, and P. Schwille, “Reconstitution of protein dynamics
involved in bacterial cell division,” in Prokaryotic Cytoskeletons, vol.
84, Springer, 2017, pp. 419–444.
ista: 'Loose M, Zieske K, Schwille P. 2017.Reconstitution of protein dynamics involved
in bacterial cell division. In: Prokaryotic Cytoskeletons. vol. 84, 419–444.'
mla: Loose, Martin, et al. “Reconstitution of Protein Dynamics Involved in Bacterial
Cell Division.” Prokaryotic Cytoskeletons, vol. 84, Springer, 2017, pp.
419–44, doi:10.1007/978-3-319-53047-5_15.
short: M. Loose, K. Zieske, P. Schwille, in:, Prokaryotic Cytoskeletons, Springer,
2017, pp. 419–444.
date_created: 2018-12-11T11:47:35Z
date_published: 2017-05-13T00:00:00Z
date_updated: 2021-01-12T08:06:57Z
day: '13'
department:
- _id: MaLo
doi: 10.1007/978-3-319-53047-5_15
external_id:
pmid:
- '28500535'
intvolume: ' 84'
language:
- iso: eng
month: '05'
oa_version: None
page: 419 - 444
pmid: 1
publication: Prokaryotic Cytoskeletons
publication_identifier:
eisbn:
- 978-3-319-53047-5
publication_status: published
publisher: Springer
publist_id: '7165'
quality_controlled: '1'
scopus_import: 1
series_title: Sub-Cellular Biochemistry
status: public
title: Reconstitution of protein dynamics involved in bacterial cell division
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 84
year: '2017'
...
---
_id: '6291'
abstract:
- lang: eng
text: Bacteria and their pathogens – phages – are the most abundant living entities
on Earth. Throughout their coevolution, bacteria have evolved multiple immune
systems to overcome the ubiquitous threat from the phages. Although the molecu-
lar details of these immune systems’ functions are relatively well understood,
their epidemiological consequences for the phage-bacterial communities have been
largely neglected. In this thesis we employed both experimental and theoretical
methods to explore whether herd and social immunity may arise in bacterial popu-
lations. Using our experimental system consisting of Escherichia coli strains
with a CRISPR based immunity to the T7 phage we show that herd immunity arises
in phage-bacterial communities and that it is accentuated when the populations
are spatially structured. By fitting a mathematical model, we inferred expressions
for the herd immunity threshold and the velocity of spread of a phage epidemic
in partially resistant bacterial populations, which both depend on the bacterial
growth rate, phage burst size and phage latent period. We also investigated the
poten- tial for social immunity in Streptococcus thermophilus and its phage 2972
using a bioinformatic analysis of potentially coding short open reading frames
with a signalling signature, encoded within the CRISPR associated genes. Subsequently,
we tested one identified potentially signalling peptide and found that its addition
to a phage-challenged culture increases probability of survival of bacteria two
fold, although the results were only marginally significant. Together, these results
demonstrate that the ubiquitous arms races between bacteria and phages have further
consequences at the level of the population.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Pavel
full_name: Payne, Pavel
id: 35F78294-F248-11E8-B48F-1D18A9856A87
last_name: Payne
orcid: 0000-0002-2711-9453
citation:
ama: Payne P. Bacterial herd and social immunity to phages. 2017.
apa: Payne, P. (2017). Bacterial herd and social immunity to phages. Institute
of Science and Technology Austria.
chicago: Payne, Pavel. “Bacterial Herd and Social Immunity to Phages.” Institute
of Science and Technology Austria, 2017.
ieee: P. Payne, “Bacterial herd and social immunity to phages,” Institute of Science
and Technology Austria, 2017.
ista: Payne P. 2017. Bacterial herd and social immunity to phages. Institute of
Science and Technology Austria.
mla: Payne, Pavel. Bacterial Herd and Social Immunity to Phages. Institute
of Science and Technology Austria, 2017.
short: P. Payne, Bacterial Herd and Social Immunity to Phages, Institute of Science
and Technology Austria, 2017.
date_created: 2019-04-09T15:16:45Z
date_published: 2017-02-01T00:00:00Z
date_updated: 2023-09-07T12:00:00Z
day: '01'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: NiBa
- _id: JoBo
file:
- access_level: closed
checksum: a0fc5c26a89c0ea759947ffba87d0d8f
content_type: application/pdf
creator: dernst
date_created: 2019-04-09T15:15:32Z
date_updated: 2020-07-14T12:47:27Z
file_id: '6292'
file_name: thesis_pavel_payne_final_w_signature_page.pdf
file_size: 3025175
relation: main_file
- access_level: open_access
checksum: af531e921a7f64a9e0af4cd8783b2226
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T13:45:59Z
date_updated: 2021-02-22T13:45:59Z
file_id: '9187'
file_name: 2017_Payne_Thesis.pdf
file_size: 3111536
relation: main_file
success: 1
file_date_updated: 2021-02-22T13:45:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '83'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
title: Bacterial herd and social immunity to phages
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '630'
abstract:
- lang: eng
text: 'Background: Standards have become available to share semantically encoded
vital parameters from medical devices, as required for example by personal healthcare
records. Standardised sharing of biosignal data largely remains open. Objectives:
The goal of this work is to explore available biosignal file format and data exchange
standards and profiles, and to conceptualise end-To-end solutions. Methods: The
authors reviewed and discussed available biosignal file format standards with
other members of international standards development organisations (SDOs). Results:
A raw concept for standards based acquisition, storage, archiving and sharing
of biosignals was developed. The GDF format may serve for storing biosignals.
Signals can then be shared using FHIR resources and may be stored on FHIR servers
or in DICOM archives, with DICOM waveforms as one possible format. Conclusion:
Currently a group of international SDOs (e.g. HL7, IHE, DICOM, IEEE) is engaged
in intensive discussions. This discussion extends existing work that already was
adopted by large implementer communities. The concept presented here only reports
the current status of the discussion in Austria. The discussion will continue
internationally, with results to be expected over the coming years.'
alternative_title:
- Studies in Health Technology and Informatics
author:
- first_name: Stefan
full_name: Sauermann, Stefan
last_name: Sauermann
- first_name: Veronika
full_name: David, Veronika
last_name: David
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Reinhard
full_name: Egelkraut, Reinhard
last_name: Egelkraut
- first_name: Matthias
full_name: Frohner, Matthias
last_name: Frohner
- first_name: Birgit
full_name: Pohn, Birgit
last_name: Pohn
- first_name: Philipp
full_name: Urbauer, Philipp
last_name: Urbauer
- first_name: Alexander
full_name: Mense, Alexander
last_name: Mense
citation:
ama: 'Sauermann S, David V, Schlögl A, et al. Biosignals standards and FHIR: The
way to go. In: Vol 236. IOS Press; 2017:356-362. doi:10.3233/978-1-61499-759-7-356'
apa: 'Sauermann, S., David, V., Schlögl, A., Egelkraut, R., Frohner, M., Pohn, B.,
… Mense, A. (2017). Biosignals standards and FHIR: The way to go (Vol. 236, pp.
356–362). Presented at the eHealth: Health Informatics Meets eHealth, Vienna,
Austria: IOS Press. https://doi.org/10.3233/978-1-61499-759-7-356'
chicago: 'Sauermann, Stefan, Veronika David, Alois Schlögl, Reinhard Egelkraut,
Matthias Frohner, Birgit Pohn, Philipp Urbauer, and Alexander Mense. “Biosignals
Standards and FHIR: The Way to Go,” 236:356–62. IOS Press, 2017. https://doi.org/10.3233/978-1-61499-759-7-356.'
ieee: 'S. Sauermann et al., “Biosignals standards and FHIR: The way to go,”
presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria, 2017,
vol. 236, pp. 356–362.'
ista: 'Sauermann S, David V, Schlögl A, Egelkraut R, Frohner M, Pohn B, Urbauer
P, Mense A. 2017. Biosignals standards and FHIR: The way to go. eHealth: Health
Informatics Meets eHealth, Studies in Health Technology and Informatics, vol.
236, 356–362.'
mla: 'Sauermann, Stefan, et al. Biosignals Standards and FHIR: The Way to Go.
Vol. 236, IOS Press, 2017, pp. 356–62, doi:10.3233/978-1-61499-759-7-356.'
short: S. Sauermann, V. David, A. Schlögl, R. Egelkraut, M. Frohner, B. Pohn, P.
Urbauer, A. Mense, in:, IOS Press, 2017, pp. 356–362.
conference:
end_date: 2017-05-24
location: Vienna, Austria
name: 'eHealth: Health Informatics Meets eHealth'
start_date: 2017-05-23
date_created: 2018-12-11T11:47:36Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:06:59Z
day: '01'
ddc:
- '005'
department:
- _id: ScienComp
- _id: PeJo
doi: 10.3233/978-1-61499-759-7-356
file:
- access_level: open_access
checksum: 1254dcc5b04a996d97fad9a726b42727
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:56Z
date_updated: 2020-07-14T12:47:27Z
file_id: '4913'
file_name: IST-2017-906-v1+1_SHTI236-0356.pdf
file_size: 443635
relation: main_file
file_date_updated: 2020-07-14T12:47:27Z
has_accepted_license: '1'
intvolume: ' 236'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 356 - 362
publication_identifier:
isbn:
- 978-161499758-0
publication_status: published
publisher: IOS Press
publist_id: '7164'
pubrep_id: '906'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Biosignals standards and FHIR: The way to go'
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 236
year: '2017'
...
---
_id: '631'
abstract:
- lang: eng
text: Template polyhedra generalize intervals and octagons to polyhedra whose facets
are orthogonal to a given set of arbitrary directions. They have been employed
in the abstract interpretation of programs and, with particular success, in the
reachability analysis of hybrid automata. While previously, the choice of directions
has been left to the user or a heuristic, we present a method for the automatic
discovery of directions that generalize and eliminate spurious counterexamples.
We show that for the class of convex hybrid automata, i.e., hybrid automata with
(possibly nonlinear) convex constraints on derivatives, such directions always
exist and can be found using convex optimization. We embed our method inside a
CEGAR loop, thus enabling the time-unbounded reachability analysis of an important
and richer class of hybrid automata than was previously possible. We evaluate
our method on several benchmarks, demonstrating also its superior efficiency for
the special case of linear hybrid automata.
acknowledgement: This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), by
the European Commission under grant 643921 (UnCoVerCPS), and by the ARC project
DP140104219 (Robust AI Planning for Hybrid Systems).
alternative_title:
- LNCS
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. Counterexample guided refinement
of template polyhedra. In: Vol 10205. Springer; 2017:589-606. doi:10.1007/978-3-662-54577-5_34'
apa: 'Bogomolov, S., Frehse, G., Giacobbe, M., & Henzinger, T. A. (2017). Counterexample
guided refinement of template polyhedra (Vol. 10205, pp. 589–606). Presented at
the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Uppsala, Sweden: Springer. https://doi.org/10.1007/978-3-662-54577-5_34'
chicago: Bogomolov, Sergiy, Goran Frehse, Mirco Giacobbe, and Thomas A Henzinger.
“Counterexample Guided Refinement of Template Polyhedra,” 10205:589–606. Springer,
2017. https://doi.org/10.1007/978-3-662-54577-5_34.
ieee: 'S. Bogomolov, G. Frehse, M. Giacobbe, and T. A. Henzinger, “Counterexample
guided refinement of template polyhedra,” presented at the TACAS: Tools and Algorithms
for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205,
pp. 589–606.'
ista: 'Bogomolov S, Frehse G, Giacobbe M, Henzinger TA. 2017. Counterexample guided
refinement of template polyhedra. TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, LNCS, vol. 10205, 589–606.'
mla: Bogomolov, Sergiy, et al. Counterexample Guided Refinement of Template Polyhedra.
Vol. 10205, Springer, 2017, pp. 589–606, doi:10.1007/978-3-662-54577-5_34.
short: S. Bogomolov, G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2017,
pp. 589–606.
conference:
end_date: 2017-04-29
location: Uppsala, Sweden
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2017-04-22
date_created: 2018-12-11T11:47:36Z
date_published: 2017-03-31T00:00:00Z
date_updated: 2023-09-07T12:53:00Z
day: '31'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-662-54577-5_34
file:
- access_level: open_access
checksum: f395d0d20102b89aeaad8b4ef4f18f4f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:41Z
date_updated: 2020-07-14T12:47:27Z
file_id: '4897'
file_name: IST-2017-741-v1+1_main.pdf
file_size: 569863
relation: main_file
- access_level: open_access
checksum: f416ee1ae4497b23ecdf28b1f18bb8df
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:42Z
date_updated: 2020-07-14T12:47:27Z
file_id: '4898'
file_name: IST-2018-741-v2+2_main.pdf
file_size: 563276
relation: main_file
file_date_updated: 2020-07-14T12:47:27Z
has_accepted_license: '1'
intvolume: ' 10205'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 589 - 606
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- 978-366254576-8
publication_status: published
publisher: Springer
publist_id: '7162'
pubrep_id: '966'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Counterexample guided refinement of template polyhedra
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10205
year: '2017'
...
---
_id: '632'
abstract:
- lang: eng
text: 'We consider a 2D quantum system of N bosons in a trapping potential |x|s,
interacting via a pair potential of the form N2β−1 w(Nβ x). We show that for all
0 < β < (s + 1)/(s + 2), the leading order behavior of ground states of
the many-body system is described in the large N limit by the corresponding cubic
nonlinear Schrödinger energy functional. Our result covers the focusing case (w
< 0) where even the stability of the many-body system is not obvious. This
answers an open question mentioned by X. Chen and J. Holmer for harmonic traps
(s = 2). Together with the BBGKY hierarchy approach used by these authors, our
result implies the convergence of the many-body quantum dynamics to the focusing
NLS equation with harmonic trap for all 0 < β < 3/4. '
author:
- first_name: Mathieu
full_name: Lewin, Mathieu
last_name: Lewin
- first_name: Phan
full_name: Nam, Phan
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Nam
- first_name: Nicolas
full_name: Rougerie, Nicolas
last_name: Rougerie
citation:
ama: Lewin M, Nam P, Rougerie N. A note on 2D focusing many boson systems. Proceedings
of the American Mathematical Society. 2017;145(6):2441-2454. doi:10.1090/proc/13468
apa: Lewin, M., Nam, P., & Rougerie, N. (2017). A note on 2D focusing many boson
systems. Proceedings of the American Mathematical Society. American Mathematical
Society. https://doi.org/10.1090/proc/13468
chicago: Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “A Note on 2D Focusing
Many Boson Systems.” Proceedings of the American Mathematical Society.
American Mathematical Society, 2017. https://doi.org/10.1090/proc/13468.
ieee: M. Lewin, P. Nam, and N. Rougerie, “A note on 2D focusing many boson systems,”
Proceedings of the American Mathematical Society, vol. 145, no. 6. American
Mathematical Society, pp. 2441–2454, 2017.
ista: Lewin M, Nam P, Rougerie N. 2017. A note on 2D focusing many boson systems.
Proceedings of the American Mathematical Society. 145(6), 2441–2454.
mla: Lewin, Mathieu, et al. “A Note on 2D Focusing Many Boson Systems.” Proceedings
of the American Mathematical Society, vol. 145, no. 6, American Mathematical
Society, 2017, pp. 2441–54, doi:10.1090/proc/13468.
short: M. Lewin, P. Nam, N. Rougerie, Proceedings of the American Mathematical Society
145 (2017) 2441–2454.
date_created: 2018-12-11T11:47:36Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:03Z
day: '01'
department:
- _id: RoSe
doi: 10.1090/proc/13468
ec_funded: 1
intvolume: ' 145'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1509.09045
month: '01'
oa: 1
oa_version: Submitted Version
page: 2441 - 2454
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Proceedings of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '7160'
quality_controlled: '1'
scopus_import: 1
status: public
title: A note on 2D focusing many boson systems
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 145
year: '2017'
...
---
_id: '633'
abstract:
- lang: eng
text: A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex
region of space by incrementally building a space-filling tree. The tree is constructed
from random points drawn from system’s state space and is biased to grow towards
large unexplored areas in the system. RRT can provide better coverage of a system’s
possible behaviors compared with random simulations, but is more lightweight than
full reachability analysis. In this paper, we explore some of the design decisions
encountered while implementing a hybrid extension of the RRT algorithm, which
have not been elaborated on before. In particular, we focus on handling non-determinism,
which arises due to discrete transitions. We introduce the notion of important
points to account for this phenomena. We showcase our ideas using heater and navigation
benchmarks.
alternative_title:
- LNCS
author:
- first_name: Stanley
full_name: Bak, Stanley
last_name: Bak
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Aviral
full_name: Kumar, Aviral
last_name: Kumar
citation:
ama: 'Bak S, Bogomolov S, Henzinger TA, Kumar A. Challenges and tool implementation
of hybrid rapidly exploring random trees. In: Abate A, Bodo S, eds. Vol 10381.
Springer; 2017:83-89. doi:10.1007/978-3-319-63501-9_6'
apa: 'Bak, S., Bogomolov, S., Henzinger, T. A., & Kumar, A. (2017). Challenges
and tool implementation of hybrid rapidly exploring random trees. In A. Abate
& S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical
Software Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63501-9_6'
chicago: Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, and Aviral Kumar. “Challenges
and Tool Implementation of Hybrid Rapidly Exploring Random Trees.” edited by Alessandro
Abate and Sylvie Bodo, 10381:83–89. Springer, 2017. https://doi.org/10.1007/978-3-319-63501-9_6.
ieee: 'S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool
implementation of hybrid rapidly exploring random trees,” presented at the NSV:
Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.'
ista: 'Bak S, Bogomolov S, Henzinger TA, Kumar A. 2017. Challenges and tool implementation
of hybrid rapidly exploring random trees. NSV: Numerical Software Verification,
LNCS, vol. 10381, 83–89.'
mla: Bak, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly
Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381,
Springer, 2017, pp. 83–89, doi:10.1007/978-3-319-63501-9_6.
short: S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.),
Springer, 2017, pp. 83–89.
conference:
end_date: 2017-07-23
location: Heidelberg, Germany
name: 'NSV: Numerical Software Verification'
start_date: 2017-07-22
date_created: 2018-12-11T11:47:37Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:06Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-319-63501-9_6
editor:
- first_name: Alessandro
full_name: Abate, Alessandro
last_name: Abate
- first_name: Sylvie
full_name: Bodo, Sylvie
last_name: Bodo
intvolume: ' 10381'
language:
- iso: eng
month: '01'
oa_version: None
page: 83 - 89
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- 978-331963500-2
publication_status: published
publisher: Springer
publist_id: '7159'
quality_controlled: '1'
scopus_import: 1
status: public
title: Challenges and tool implementation of hybrid rapidly exploring random trees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10381
year: '2017'
...
---
_id: '634'
abstract:
- lang: eng
text: As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental
condition, long-time consensus was that its hallmark features are irreversible.
However, several studies from recent years using defined mouse models of ASD have
provided clear evidence that in mice neurobiological and behavioural alterations
can be ameliorated or even reversed by genetic restoration or pharmacological
treatment either before or after symptom onset. Here, we review findings on genetic
and pharmacological reversibility of phenotypes in mouse models of ASD. Our review
should give a comprehensive overview on both aspects and encourage future studies
to better understand the underlying molecular mechanisms that might be translatable
from animals to humans.
alternative_title:
- ADVSANAT
author:
- first_name: Jan
full_name: Schroeder, Jan
last_name: Schroeder
- first_name: Elena
full_name: Deliu, Elena
id: 37A40D7E-F248-11E8-B48F-1D18A9856A87
last_name: Deliu
orcid: 0000-0002-7370-5293
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Michael
full_name: Schmeisser, Michael
last_name: Schmeisser
citation:
ama: 'Schroeder J, Deliu E, Novarino G, Schmeisser M. Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder. In: Schmeisser
M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum
Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer;
2017:189-211. doi:10.1007/978-3-319-52498-6_10'
apa: Schroeder, J., Deliu, E., Novarino, G., & Schmeisser, M. (2017). Genetic
and pharmacological reversibility of phenotypes in mouse models of autism spectrum
disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and
Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 189–211). Springer.
https://doi.org/10.1007/978-3-319-52498-6_10
chicago: Schroeder, Jan, Elena Deliu, Gaia Novarino, and Michael Schmeisser. “Genetic
and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum
Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder,
edited by Michael Schmeisser and Tobias Boekers, 224:189–211. Advances in Anatomy
Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_10.
ieee: J. Schroeder, E. Deliu, G. Novarino, and M. Schmeisser, “Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder,” in Translational
Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser
and T. Boekers, Eds. Springer, 2017, pp. 189–211.
ista: 'Schroeder J, Deliu E, Novarino G, Schmeisser M. 2017.Genetic and pharmacological
reversibility of phenotypes in mouse models of autism spectrum disorder. In: Translational
Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 189–211.'
mla: Schroeder, Jan, et al. “Genetic and Pharmacological Reversibility of Phenotypes
in Mouse Models of Autism Spectrum Disorder.” Translational Anatomy and Cell
Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias
Boekers, vol. 224, Springer, 2017, pp. 189–211, doi:10.1007/978-3-319-52498-6_10.
short: J. Schroeder, E. Deliu, G. Novarino, M. Schmeisser, in:, M. Schmeisser, T.
Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder,
Springer, 2017, pp. 189–211.
date_created: 2018-12-11T11:47:37Z
date_published: 2017-05-28T00:00:00Z
date_updated: 2021-01-12T08:07:08Z
day: '28'
department:
- _id: GaNo
doi: 10.1007/978-3-319-52498-6_10
editor:
- first_name: Michael
full_name: Schmeisser, Michael
last_name: Schmeisser
- first_name: Tobias
full_name: Boekers, Tobias
last_name: Boekers
intvolume: ' 224'
language:
- iso: eng
month: '05'
oa_version: None
page: 189 - 211
project:
- _id: 25473368-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: F03523
name: Transmembrane Transporters in Health and Disease
publication: Translational Anatomy and Cell Biology of Autism Spectrum Disorder
publication_identifier:
eisbn:
- 978-3-319-52498-6
publication_status: published
publisher: Springer
publist_id: '7156'
quality_controlled: '1'
scopus_import: 1
series_title: Advances in Anatomy Embryology and Cell Biology
status: public
title: Genetic and pharmacological reversibility of phenotypes in mouse models of
autism spectrum disorder
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 224
year: '2017'
...
---
_id: '635'
abstract:
- lang: eng
text: Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is
dominated by memory cost. As memory, unlike computation, costs about the same
across different platforms, MHFs cannot be evaluated at significantly lower cost
on dedicated hardware like ASICs. MHFs have found widespread applications including
password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt,
a simple candidate MHF designed by Percival, and described in RFC 7914. It has
been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and
has been an inspiration for Argon2d, one of the winners of the recent password-hashing
competition. Despite its popularity, no rigorous lower bounds on its memory complexity
are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative
memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w
and n are the output length and number of invocations of the underlying hash function,
respectively. High cmc is a strong security target for MHFs introduced by Alwen
and Serbinenko (STOC’15) which implies high memory cost even for adversaries who
can amortize the cost over many evaluations and evaluate the underlying hash functions
many times in parallel. Our proof is the first showing optimal memory-hardness
for any MHF. Our result improves both quantitatively and qualitatively upon the
recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of
Ω(n2w/ log2 n) for a restricted class of adversaries.
alternative_title:
- LNCS
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Binchi
full_name: Chen, Binchi
last_name: Chen
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Leonid
full_name: Reyzin, Leonid
last_name: Reyzin
- first_name: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: 'Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory
hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:10.1007/978-3-319-56617-7_2'
apa: 'Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., & Tessaro, S. (2017).
Scrypt is maximally memory hard. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol.
10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic
Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_2'
chicago: Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano
Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and
Jesper Buus Nielsen, 10212:33–62. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_2.
ieee: 'J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt
is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.'
ista: 'Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally
memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS,
vol. 10212, 33–62.'
mla: Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien
Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.
short: J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron,
J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
conference:
end_date: 2017-05-04
location: Paris, France
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2017-04-30
date_created: 2018-12-11T11:47:37Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:07:10Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-56617-7_2
ec_funded: 1
editor:
- first_name: Jean-Sébastien
full_name: Coron, Jean-Sébastien
last_name: Coron
- first_name: Jesper
full_name: Buus Nielsen, Jesper
last_name: Buus Nielsen
intvolume: ' 10212'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2016/989
month: '01'
oa: 1
oa_version: Submitted Version
page: 33 - 62
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331956616-0
publication_status: published
publisher: Springer
publist_id: '7154'
quality_controlled: '1'
scopus_import: 1
status: public
title: Scrypt is maximally memory hard
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 10212
year: '2017'
...
---
_id: '636'
abstract:
- lang: eng
text: Signal regular expressions can specify sequential properties of real-valued
signals based on threshold conditions, regular operations, and duration constraints.
In this paper we endow them with a quantitative semantics which indicates how
robustly a signal matches or does not match a given expression. First, we show
that this semantics is a safe approximation of a distance between the signal and
the language defined by the expression. Then, we consider the robust matching
problem, that is, computing the quantitative semantics of every segment of a given
signal relative to an expression. We present an algorithm that solves this problem
for piecewise-constant and piecewise-linear signals and show that for such signals
the robustness map is a piecewise-linear function. The availability of an indicator
describing how robustly a signal segment matches some regular pattern provides
a general framework for quantitative monitoring of cyber-physical systems.
alternative_title:
- LNCS
author:
- first_name: Alexey
full_name: Bakhirkin, Alexey
last_name: Bakhirkin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Dogan
full_name: Ulus, Dogan
last_name: Ulus
citation:
ama: 'Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of
regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol
10419. Springer; 2017:189-206. doi:10.1007/978-3-319-65765-3_11'
apa: 'Bakhirkin, A., Ferrere, T., Maler, O., & Ulus, D. (2017). On the quantitative
semantics of regular expressions over real-valued signals. In A. Abate & G.
Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling
and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_11'
chicago: Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the
Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited
by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_11.
ieee: 'A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics
of regular expressions over real-valued signals,” presented at the FORMATS: Formal
Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp.
189–206.'
ista: 'Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics
of regular expressions over real-valued signals. FORMATS: Formal Modelling and
Analysis of Timed Systems, LNCS, vol. 10419, 189–206.'
mla: Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions
over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts,
vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.
short: A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts
(Eds.), Springer, 2017, pp. 189–206.
conference:
end_date: 2017-09-07
location: Berlin, Germany
name: 'FORMATS: Formal Modelling and Analysis of Timed Systems'
start_date: 2017-09-05
date_created: 2018-12-11T11:47:38Z
date_published: 2017-08-03T00:00:00Z
date_updated: 2021-01-12T08:07:14Z
day: '03'
department:
- _id: ToHe
doi: 10.1007/978-3-319-65765-3_11
editor:
- first_name: Alessandro
full_name: Abate, Alessandro
last_name: Abate
- first_name: Gilles
full_name: Geeraerts, Gilles
last_name: Geeraerts
intvolume: ' 10419'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01552132
month: '08'
oa: 1
oa_version: Submitted Version
page: 189 - 206
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- 978-331965764-6
publication_status: published
publisher: Springer
publist_id: '7152'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the quantitative semantics of regular expressions over real-valued signals
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10419
year: '2017'
...
---
_id: '637'
abstract:
- lang: eng
text: For many cryptographic primitives, it is relatively easy to achieve selective
security (where the adversary commits a-priori to some of the choices to be made
later in the attack) but appears difficult to achieve the more natural notion
of adaptive security (where the adversary can make all choices on the go as the
attack progresses). A series of several recent works shows how to cleverly achieve
adaptive security in several such scenarios including generalized selective decryption
(Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer
et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b).
Although the above works expressed vague intuition that they share a common technique,
the connection was never made precise. In this work we present a new framework
that connects all of these works and allows us to present them in a unified and
simplified fashion. Moreover, we use the framework to derive a new result for
adaptively secure secret sharing over access structures defined via monotone circuits.
We envision that further applications will follow in the future. Underlying our
framework is the following simple idea. It is well known that selective security,
where the adversary commits to n-bits of information about his future choices,
automatically implies adaptive security at the cost of amplifying the adversary’s
advantage by a factor of up to 2n. However, in some cases the proof of selective
security proceeds via a sequence of hybrids, where each pair of adjacent hybrids
locally only requires some smaller partial information consisting of m ≪ n bits.
The partial information needed might be completely different between different
pairs of hybrids, and if we look across all the hybrids we might rely on the entire
n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security,
at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n.
In all of our examples using the above framework, the different hybrids are captured
by some sort of a graph pebbling game and the amount of information that the adversary
needs to commit to in each pair of hybrids is bounded by the maximum number of
pebbles in play at any point in time. Therefore, coming up with better strategies
for proving adaptive security translates to various pebbling strategies for different
types of graphs.
alternative_title:
- LNCS
author:
- first_name: Zahra
full_name: Jafargholi, Zahra
last_name: Jafargholi
- first_name: Chethan
full_name: Kamath Hosdurg, Chethan
id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
last_name: Kamath Hosdurg
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Ilan
full_name: Komargodski, Ilan
last_name: Komargodski
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs
D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer;
2017:133-163. doi:10.1007/978-3-319-63688-7_5'
apa: 'Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak,
K. Z., & Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz &
H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology,
Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-319-63688-7_5'
chicago: Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski,
Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited
by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_5.
ieee: 'Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak,
and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology,
Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.'
ista: 'Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs
D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401,
133–163.'
mla: Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by
Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.
short: Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak,
D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
conference:
end_date: 2017-07-24
location: Santa Barbara, CA, United States
name: 'CRYPTO: Cryptology'
start_date: 2017-07-20
date_created: 2018-12-11T11:47:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-07T13:32:11Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-63688-7_5
ec_funded: 1
editor:
- first_name: Jonathan
full_name: Katz, Jonathan
last_name: Katz
- first_name: Hovav
full_name: Shacham, Hovav
last_name: Shacham
intvolume: ' 10401'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/515
month: '01'
oa: 1
oa_version: Submitted Version
page: 133 - 163
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
isbn:
- 978-331963687-0
publication_status: published
publisher: Springer
publist_id: '7151'
quality_controlled: '1'
related_material:
record:
- id: '10035'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Be adaptive avoid overcommitting
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 10401
year: '2017'
...
---
_id: '638'
abstract:
- lang: eng
text: "This book constitutes the refereed proceedings of the 9th InternationalWorkshop
on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July
2011 - colocated with CAV 2016, the 28th International Conference on Computer
Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical
and mathematical techniques for the reasoning about programmability and reliability."
article_processing_charge: No
citation:
ama: Bogomolov S, Martel M, Prabhakar P, eds. Numerical Software Verification.
Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8
apa: 'Bogomolov, S., Martel, M., & Prabhakar, P. (Eds.). (2017). Numerical
Software Verification (Vol. 10152). Presented at the NSV: Numerical Software
Verification, Toronto, ON, Canada: Springer. https://doi.org/10.1007/978-3-319-54292-8'
chicago: Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical
Software Verification. Vol. 10152. LNCS. Springer, 2017. https://doi.org/10.1007/978-3-319-54292-8.
ieee: S. Bogomolov, M. Martel, and P. Prabhakar, Eds., Numerical Software Verification,
vol. 10152. Springer, 2017.
ista: Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification,
Springer,p.
mla: Bogomolov, Sergiy, et al., editors. Numerical Software Verification.
Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.
short: S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification,
Springer, 2017.
conference:
end_date: 2016-07-18
location: Toronto, ON, Canada
name: 'NSV: Numerical Software Verification'
start_date: 2016-07-17
date_created: 2018-12-11T11:47:38Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2022-05-24T07:09:52Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-319-54292-8
editor:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Matthieu
full_name: Martel, Matthieu
last_name: Martel
- first_name: Pavithra
full_name: Prabhakar, Pavithra
last_name: Prabhakar
intvolume: ' 10152'
language:
- iso: eng
month: '01'
oa_version: None
publication_identifier:
eisbn:
- 978-3-319-54292-8
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '7150'
quality_controlled: '1'
series_title: LNCS
status: public
title: Numerical Software Verification
type: conference_editor
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10152
year: '2017'
...
---
_id: '639'
abstract:
- lang: eng
text: We study the problem of developing efficient approaches for proving worst-case
bounds of non-deterministic recursive programs. Ranking functions are sound and
complete for proving termination and worst-case bounds of non-recursive programs.
First, we apply ranking functions to recursion, resulting in measure functions,
and show that they provide a sound and complete approach to prove worst-case bounds
of non-deterministic recursive programs. Our second contribution is the synthesis
of measure functions in non-polynomial forms. We show that non-polynomial measure
functions with logarithm and exponentiation can be synthesized through abstraction
of logarithmic or exponentiation terms, Farkas’ Lemma, and Handelman’s Theorem
using linear programming. While previous methods obtain worst-case polynomial
bounds, our approach can synthesize bounds of the form O(n log n) as well as O(nr)
where r is not an integer. We present experimental results to demonstrate that
our approach can efficiently obtain worst-case bounds of classical recursive algorithms
such as Merge-Sort, Closest-Pair, Karatsuba’s algorithm and Strassen’s algorithm.
alternative_title:
- LNCS
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: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
citation:
ama: 'Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst case analysis of recursive
programs. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:41-63. doi:10.1007/978-3-319-63390-9_3'
apa: 'Chatterjee, K., Fu, H., & Goharshady, A. K. (2017). Non-polynomial worst
case analysis of recursive programs. In R. Majumdar & V. Kunčak (Eds.) (Vol.
10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg,
Germany: Springer. https://doi.org/10.1007/978-3-319-63390-9_3'
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial
Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor
Kunčak, 10427:41–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63390-9_3.
ieee: 'K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst case analysis
of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg,
Germany, 2017, vol. 10427, pp. 41–63.'
ista: 'Chatterjee K, Fu H, Goharshady AK. 2017. Non-polynomial worst case analysis
of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427, 41–63.'
mla: Chatterjee, Krishnendu, et al. Non-Polynomial Worst Case Analysis of Recursive
Programs. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer,
2017, pp. 41–63, doi:10.1007/978-3-319-63390-9_3.
short: K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.),
Springer, 2017, pp. 41–63.
conference:
end_date: 2017-07-28
location: Heidelberg, Germany
name: 'CAV: Computer Aided Verification'
start_date: 2017-07-24
date_created: 2018-12-11T11:47:39Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2025-06-02T08:53:47Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-319-63390-9_3
ec_funded: 1
editor:
- first_name: Rupak
full_name: Majumdar, Rupak
last_name: Majumdar
- first_name: Viktor
full_name: Kunčak, Viktor
last_name: Kunčak
external_id:
arxiv:
- '1705.00317'
intvolume: ' 10427'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.00317
month: '01'
oa: 1
oa_version: Submitted Version
page: 41 - 63
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
isbn:
- 978-331963389-3
publication_status: published
publisher: Springer
publist_id: '7149'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
- id: '7014'
relation: later_version
status: public
scopus_import: 1
status: public
title: Non-polynomial worst case analysis of recursive programs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10427
year: '2017'
...