---
_id: '85'
abstract:
- lang: eng
text: Concurrent accesses to shared data structures must be synchronized to avoid
data races. Coarse-grained synchronization, which locks the entire data structure,
is easy to implement but does not scale. Fine-grained synchronization can scale
well, but can be hard to reason about. Hand-over-hand locking, in which operations
are pipelined as they traverse the data structure, combines fine-grained synchronization
with ease of use. However, the traditional implementation suffers from inherent
overheads. This paper introduces snapshot-based synchronization (SBS), a novel
hand-over-hand locking mechanism. SBS decouples the synchronization state from
the data, significantly improving cache utilization. Further, it relies on guarantees
provided by pipelining to minimize synchronization that requires cross-thread
communication. Snapshot-based synchronization thus scales much better than traditional
hand-over-hand locking, while maintaining the same ease of use.
acknowledgement: Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14)
and by a NSERC post-doctoral fellowship.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Eran
full_name: Gilad, Eran
last_name: Gilad
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Mark
full_name: Oskin, Mark
last_name: Oskin
- first_name: Yoav
full_name: Etsion, Yoav
last_name: Etsion
citation:
ama: 'Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast
replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479.
doi:10.1007/978-3-319-96983-1_33'
apa: 'Gilad, E., Brown, T. A., Oskin, M., & Etsion, Y. (2018). Snapshot based
synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp.
465–479). Presented at the Euro-Par: European Conference on Parallel Processing,
Turin, Italy: Springer. https://doi.org/10.1007/978-3-319-96983-1_33'
chicago: 'Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based
Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79.
Springer, 2018. https://doi.org/10.1007/978-3-319-96983-1_33.'
ieee: 'E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization:
A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European
Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.'
ista: 'Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization:
A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on
Parallel Processing, LNCS, vol. 11014, 465–479.'
mla: 'Gilad, Eran, et al. Snapshot Based Synchronization: A Fast Replacement
for Hand-over-Hand Locking. Vol. 11014, Springer, 2018, pp. 465–79, doi:10.1007/978-3-319-96983-1_33.'
short: E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479.
conference:
end_date: 2018-08-31
location: Turin, Italy
name: 'Euro-Par: European Conference on Parallel Processing'
start_date: 2018-08-27
date_created: 2018-12-11T11:44:33Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-18T09:32:36Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.1007/978-3-319-96983-1_33
external_id:
isi:
- '000851042300031'
file:
- access_level: open_access
checksum: 13a3f250be8878405e791b53c19722ad
content_type: application/pdf
creator: dernst
date_created: 2019-02-12T07:40:40Z
date_updated: 2020-07-14T12:48:14Z
file_id: '5954'
file_name: 2018_Brown.pdf
file_size: 665372
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
has_accepted_license: '1'
intvolume: ' 11014'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Preprint
page: 465 - 479
project:
- _id: 26450934-B435-11E9-9278-68D0E5697425
name: NSERC Postdoctoral fellowship
publication_identifier:
issn:
- '03029743'
publication_status: published
publisher: Springer
publist_id: '7969'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Snapshot based synchronization: A fast replacement for Hand-over-Hand locking'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11014
year: '2018'
...
---
_id: '327'
abstract:
- lang: eng
text: Many-body quantum systems typically display fast dynamics and ballistic spreading
of information. Here we address the open problem of how slow the dynamics can
be after a generic breaking of integrability by local interactions. We develop
a method based on degenerate perturbation theory that reveals slow dynamical regimes
and delocalization processes in general translation invariant models, along with
accurate estimates of their delocalization time scales. Our results shed light
on the fundamental questions of the robustness of quantum integrable systems and
the possibility of many-body localization without disorder. As an example, we
construct a large class of one-dimensional lattice models where, despite the absence
of asymptotic localization, the transient dynamics is exceptionally slow, i.e.,
the dynamics is indistinguishable from that of many-body localized systems for
the system sizes and time scales accessible in experiments and numerical simulations.
acknowledgement: 'We thank F. Huveneers for useful discussions. Z.P. and A.M. acknowledge
support by EPSRC Grant No. EP/P009409/1 and and the Royal Society Research Grant
No. RG160635. Statement of compliance with EPSRC policy framework on research data:
This publication is theoretical work that does not require supporting research data.
D.A. acknowledges support by the Swiss National Science Foundation. M.Z., M.M. and
T.P. acknowledge Grants J1-7279 (M.Z.) and N1-0025 (M.M. and T.P.) of Slovenian
Research Agency, and Advanced Grant of European Research Council, Grant No. 694544
- OMNES (T.P.).'
article_number: '104307'
article_processing_charge: No
author:
- first_name: Alexios
full_name: Michailidis, Alexios
id: 36EBAD38-F248-11E8-B48F-1D18A9856A87
last_name: Michailidis
orcid: 0000-0002-8443-1064
- first_name: Marko
full_name: Žnidarič, Marko
last_name: Žnidarič
- first_name: Mariya
full_name: Medvedyeva, Mariya
last_name: Medvedyeva
- first_name: Dmitry
full_name: Abanin, Dmitry
last_name: Abanin
- first_name: Tomaž
full_name: Prosen, Tomaž
last_name: Prosen
- first_name: Zlatko
full_name: Papić, Zlatko
last_name: Papić
citation:
ama: Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. Slow
dynamics in translation-invariant quantum lattice models. Physical Review B.
2018;97(10). doi:10.1103/PhysRevB.97.104307
apa: Michailidis, A., Žnidarič, M., Medvedyeva, M., Abanin, D., Prosen, T., &
Papić, Z. (2018). Slow dynamics in translation-invariant quantum lattice models.
Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.97.104307
chicago: Michailidis, Alexios, Marko Žnidarič, Mariya Medvedyeva, Dmitry Abanin,
Tomaž Prosen, and Zlatko Papić. “Slow Dynamics in Translation-Invariant Quantum
Lattice Models.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/PhysRevB.97.104307.
ieee: A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, and Z. Papić,
“Slow dynamics in translation-invariant quantum lattice models,” Physical Review
B, vol. 97, no. 10. American Physical Society, 2018.
ista: Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. 2018.
Slow dynamics in translation-invariant quantum lattice models. Physical Review
B. 97(10), 104307.
mla: Michailidis, Alexios, et al. “Slow Dynamics in Translation-Invariant Quantum
Lattice Models.” Physical Review B, vol. 97, no. 10, 104307, American Physical
Society, 2018, doi:10.1103/PhysRevB.97.104307.
short: A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, Z. Papić,
Physical Review B 97 (2018).
date_created: 2018-12-11T11:45:50Z
date_published: 2018-03-19T00:00:00Z
date_updated: 2023-09-18T09:31:46Z
day: '19'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.97.104307
external_id:
isi:
- '000427798800005'
intvolume: ' 97'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1706.05026
month: '03'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '7538'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Slow dynamics in translation-invariant quantum lattice models
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 97
year: '2018'
...
---
_id: '29'
abstract:
- lang: eng
text: Social insects have evolved enormous capacities to collectively build nests
and defend their colonies against both predators and pathogens. The latter is
achieved by a combination of individual immune responses and sophisticated collective
behavioral and organizational disease defenses, that is, social immunity. We investigated
how the presence or absence of these social defense lines affects individual-level
immunity in ant queens after bacterial infection. To this end, we injected queens
of the ant Linepithema humile with a mix of gram+ and gram− bacteria or a control
solution, reared them either with workers or alone and analyzed their gene expression
patterns at 2, 4, 8, and 12 hr post-injection, using RNA-seq. This allowed us
to test for the effect of bacterial infection, social context, as well as the
interaction between the two over the course of infection and raising of an immune
response. We found that social isolation per se affected queen gene expression
for metabolism genes, but not for immune genes. When infected, queens reared with
and without workers up-regulated similar numbers of innate immune genes revealing
activation of Toll and Imd signaling pathways and melanization. Interestingly,
however, they mostly regulated different genes along the pathways and showed a
different pattern of overall gene up-regulation or down-regulation. Hence, we
can conclude that the absence of workers does not compromise the onset of an individual
immune response by the queens, but that the social environment impacts the route
of the individual innate immune responses.
article_processing_charge: No
author:
- first_name: Lumi
full_name: Viljakainen, Lumi
last_name: Viljakainen
- first_name: Jaana
full_name: Jurvansuu, Jaana
last_name: Jurvansuu
- first_name: Ida
full_name: Holmberg, Ida
last_name: Holmberg
- first_name: Tobias
full_name: Pamminger, Tobias
last_name: Pamminger
- first_name: Silvio
full_name: Erler, Silvio
last_name: Erler
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Viljakainen L, Jurvansuu J, Holmberg I, Pamminger T, Erler S, Cremer S. Social
environment affects the transcriptomic response to bacteria in ant queens. Ecology
and Evolution. 2018;8(22):11031-11070. doi:10.1002/ece3.4573
apa: Viljakainen, L., Jurvansuu, J., Holmberg, I., Pamminger, T., Erler, S., &
Cremer, S. (2018). Social environment affects the transcriptomic response to bacteria
in ant queens. Ecology and Evolution. Wiley. https://doi.org/10.1002/ece3.4573
chicago: Viljakainen, Lumi, Jaana Jurvansuu, Ida Holmberg, Tobias Pamminger, Silvio
Erler, and Sylvia Cremer. “Social Environment Affects the Transcriptomic Response
to Bacteria in Ant Queens.” Ecology and Evolution. Wiley, 2018. https://doi.org/10.1002/ece3.4573.
ieee: L. Viljakainen, J. Jurvansuu, I. Holmberg, T. Pamminger, S. Erler, and S.
Cremer, “Social environment affects the transcriptomic response to bacteria in
ant queens,” Ecology and Evolution, vol. 8, no. 22. Wiley, pp. 11031–11070,
2018.
ista: Viljakainen L, Jurvansuu J, Holmberg I, Pamminger T, Erler S, Cremer S. 2018.
Social environment affects the transcriptomic response to bacteria in ant queens.
Ecology and Evolution. 8(22), 11031–11070.
mla: Viljakainen, Lumi, et al. “Social Environment Affects the Transcriptomic Response
to Bacteria in Ant Queens.” Ecology and Evolution, vol. 8, no. 22, Wiley,
2018, pp. 11031–70, doi:10.1002/ece3.4573.
short: L. Viljakainen, J. Jurvansuu, I. Holmberg, T. Pamminger, S. Erler, S. Cremer,
Ecology and Evolution 8 (2018) 11031–11070.
date_created: 2018-12-11T11:44:15Z
date_published: 2018-11-01T00:00:00Z
date_updated: 2023-09-19T09:29:12Z
day: '01'
ddc:
- '576'
- '591'
department:
- _id: SyCr
doi: 10.1002/ece3.4573
external_id:
isi:
- '000451611000032'
file:
- access_level: open_access
checksum: 0d1355c78627ca7210aadd9a17a01915
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T08:27:04Z
date_updated: 2020-07-14T12:45:52Z
file_id: '5682'
file_name: Viljakainen_et_al-2018-Ecology_and_Evolution.pdf
file_size: 1272096
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '22'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 11031-11070
publication: Ecology and Evolution
publication_identifier:
issn:
- '20457758'
publication_status: published
publisher: Wiley
publist_id: '8026'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Social environment affects the transcriptomic response to bacteria in ant queens
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: 8
year: '2018'
...
---
_id: '140'
abstract:
- lang: eng
text: Reachability analysis is difficult for hybrid automata with affine differential
equations, because the reach set needs to be approximated. Promising abstraction
techniques usually employ interval methods or template polyhedra. Interval methods
account for dense time and guarantee soundness, and there are interval-based tools
that overapproximate affine flowpipes. But interval methods impose bounded and
rigid shapes, which make refinement expensive and fixpoint detection difficult.
Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded,
but sound template refinement for unbounded reachability analysis has been implemented
only for systems with piecewise constant dynamics. We capitalize on the advantages
of both techniques, combining interval arithmetic and template polyhedra, using
the former to abstract time and the latter to abstract space. During a CEGAR loop,
whenever a spurious error trajectory is found, we compute additional space constraints
and split time intervals, and use these space-time interpolants to eliminate the
counterexample. Space-time interpolation offers a lazy, flexible framework for
increasing precision while guaranteeing soundness, both for error avoidance and
fixpoint detection. To the best of out knowledge, this is the first abstraction
refinement scheme for the reachability analysis over unbounded and dense time
of affine hybrid systems, which is both sound and automatic. We demonstrate the
effectiveness of our algorithm with several benchmark examples, which cannot be
handled by other tools.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981.
Springer; 2018:468-486. doi:10.1007/978-3-319-96145-3_25'
apa: 'Frehse, G., Giacobbe, M., & Henzinger, T. A. (2018). Space-time interpolants
(Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96145-3_25'
chicago: Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,”
10981:468–86. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_25.
ieee: 'G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented
at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981,
pp. 468–486.'
ista: 'Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer
Aided Verification, LNCS, vol. 10981, 468–486.'
mla: Frehse, Goran, et al. Space-Time Interpolants. Vol. 10981, Springer,
2018, pp. 468–86, doi:10.1007/978-3-319-96145-3_25.
short: G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:50Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-19T09:30:43Z
day: '18'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-96145-3_25
external_id:
isi:
- '000491481600025'
file:
- access_level: open_access
checksum: 6dca832f575d6b3f0ea9dff56f579142
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:53Z
date_updated: 2020-07-14T12:44:50Z
file_id: '5310'
file_name: IST-2018-1010-v1+1_space-time_interpolants.pdf
file_size: 563710
relation: main_file
file_date_updated: 2020-07-14T12:44:50Z
has_accepted_license: '1'
intvolume: ' 10981'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 468 - 486
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- '03029743'
publication_status: published
publisher: Springer
publist_id: '7783'
pubrep_id: '1010'
quality_controlled: '1'
related_material:
record:
- id: '6894'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Space-time interpolants
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10981
year: '2018'
...
---
_id: '154'
abstract:
- lang: eng
text: We give a lower bound on the ground state energy of a system of two fermions
of one species interacting with two fermions of another species via point interactions.
We show that there is a critical mass ratio m2 ≈ 0.58 such that the system is
stable, i.e., the energy is bounded from below, for m∈[m2,m2−1]. So far it was
not known whether this 2 + 2 system exhibits a stable region at all or whether
the formation of four-body bound states causes an unbounded spectrum for all mass
ratios, similar to the Thomas effect. Our result gives further evidence for the
stability of the more general N + M system.
acknowledgement: Open access funding provided by Austrian Science Fund (FWF).
article_number: '19'
article_processing_charge: No
article_type: original
author:
- first_name: Thomas
full_name: Moser, Thomas
id: 2B5FC9A4-F248-11E8-B48F-1D18A9856A87
last_name: Moser
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Moser T, Seiringer R. Stability of the 2+2 fermionic system with point interactions.
Mathematical Physics Analysis and Geometry. 2018;21(3). doi:10.1007/s11040-018-9275-3
apa: Moser, T., & Seiringer, R. (2018). Stability of the 2+2 fermionic system
with point interactions. Mathematical Physics Analysis and Geometry. Springer.
https://doi.org/10.1007/s11040-018-9275-3
chicago: Moser, Thomas, and Robert Seiringer. “Stability of the 2+2 Fermionic System
with Point Interactions.” Mathematical Physics Analysis and Geometry. Springer,
2018. https://doi.org/10.1007/s11040-018-9275-3.
ieee: T. Moser and R. Seiringer, “Stability of the 2+2 fermionic system with point
interactions,” Mathematical Physics Analysis and Geometry, vol. 21, no.
3. Springer, 2018.
ista: Moser T, Seiringer R. 2018. Stability of the 2+2 fermionic system with point
interactions. Mathematical Physics Analysis and Geometry. 21(3), 19.
mla: Moser, Thomas, and Robert Seiringer. “Stability of the 2+2 Fermionic System
with Point Interactions.” Mathematical Physics Analysis and Geometry, vol.
21, no. 3, 19, Springer, 2018, doi:10.1007/s11040-018-9275-3.
short: T. Moser, R. Seiringer, Mathematical Physics Analysis and Geometry 21 (2018).
date_created: 2018-12-11T11:44:55Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2023-09-19T09:31:15Z
day: '01'
ddc:
- '530'
department:
- _id: RoSe
doi: 10.1007/s11040-018-9275-3
ec_funded: 1
external_id:
isi:
- '000439639700001'
file:
- access_level: open_access
checksum: 411c4db5700d7297c9cd8ebc5dd29091
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:49:02Z
date_updated: 2020-07-14T12:45:01Z
file_id: '5729'
file_name: 2018_MathPhysics_Moser.pdf
file_size: 496973
relation: main_file
file_date_updated: 2020-07-14T12:45:01Z
has_accepted_license: '1'
intvolume: ' 21'
isi: 1
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Mathematical Physics Analysis and Geometry
publication_identifier:
eissn:
- '15729656'
issn:
- '13850172'
publication_status: published
publisher: Springer
publist_id: '7767'
quality_controlled: '1'
related_material:
record:
- id: '52'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Stability of the 2+2 fermionic system with point interactions
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: 21
year: '2018'
...
---
_id: '5787'
abstract:
- lang: eng
text: "Branching morphogenesis remains a subject of abiding interest. Although
\ much is \r\nknown about the gene regulatory programs and signaling pathways
that operate at \r\nthe cellular scale, it has remained unclear how the macroscopic
features of branched \r\norgans, including their size, network topology and
\ spatial patterning, are encoded. \r\nLately, it has been proposed that,
these features can be explained quantitatively in \r\nseveral organs within a
single unifying framework. Based on large-\r\nscale organ recon\r\n-\r\nstructions
\ and cell lineage tracing, it has been argued that morphogenesis follows
\ \r\nfrom the collective dynamics of sublineage- \r\nrestricted self- \r\nrenewing
progenitor cells, \r\nlocalized at ductal tips, that act cooperatively to drive
a serial process of ductal elon\r\n-\r\ngation and stochastic tip bifurcation.
By correlating differentiation or cell cycle exit \r\nwith proximity to maturing
ducts, this dynamic results in the specification of a com-\r\nplex network of
\ defined density and statistical organization. These results suggest \r\nthat,
for several mammalian tissues, branched epithelial structures develop as a self-
\r\norganized process, reliant upon a strikingly simple, but generic,
\ set of local rules, \r\nwithout recourse to a rigid and deterministic
\ sequence of genetically programmed \r\nevents. Here, we review the basis
of these findings and discuss their implications."
article_processing_charge: No
author:
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Benjamin D.
full_name: Simons, Benjamin D.
last_name: Simons
citation:
ama: Hannezo EB, Simons BD. Statistical theory of branching morphogenesis. Development
Growth and Differentiation. 2018;60(9):512-521. doi:10.1111/dgd.12570
apa: Hannezo, E. B., & Simons, B. D. (2018). Statistical theory of branching
morphogenesis. Development Growth and Differentiation. Wiley. https://doi.org/10.1111/dgd.12570
chicago: Hannezo, Edouard B, and Benjamin D. Simons. “Statistical Theory of Branching
Morphogenesis.” Development Growth and Differentiation. Wiley, 2018. https://doi.org/10.1111/dgd.12570.
ieee: E. B. Hannezo and B. D. Simons, “Statistical theory of branching morphogenesis,”
Development Growth and Differentiation, vol. 60, no. 9. Wiley, pp. 512–521,
2018.
ista: Hannezo EB, Simons BD. 2018. Statistical theory of branching morphogenesis.
Development Growth and Differentiation. 60(9), 512–521.
mla: Hannezo, Edouard B., and Benjamin D. Simons. “Statistical Theory of Branching
Morphogenesis.” Development Growth and Differentiation, vol. 60, no. 9,
Wiley, 2018, pp. 512–21, doi:10.1111/dgd.12570.
short: E.B. Hannezo, B.D. Simons, Development Growth and Differentiation 60 (2018)
512–521.
date_created: 2018-12-30T22:59:14Z
date_published: 2018-12-09T00:00:00Z
date_updated: 2023-09-19T09:32:49Z
day: '09'
ddc:
- '570'
department:
- _id: EdHa
doi: 10.1111/dgd.12570
external_id:
isi:
- '000453555100002'
file:
- access_level: open_access
checksum: a6d30b0785db902c734a84fecb2eadd9
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T10:40:46Z
date_updated: 2020-07-14T12:47:11Z
file_id: '5933'
file_name: 2018_DevGrowh_Hannezo.pdf
file_size: 1313606
relation: main_file
file_date_updated: 2020-07-14T12:47:11Z
has_accepted_license: '1'
intvolume: ' 60'
isi: 1
issue: '9'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 512-521
publication: Development Growth and Differentiation
publication_identifier:
issn:
- '00121592'
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Statistical theory of branching morphogenesis
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: 60
year: '2018'
...
---
_id: '297'
abstract:
- lang: eng
text: Graph games played by two players over finite-state graphs are central in
many problems in computer science. In particular, graph games with ω -regular
winning conditions, specified as parity objectives, which can express properties
such as safety, liveness, fairness, are the basic framework for verification and
synthesis of reactive systems. The decisions for a player at various states of
the graph game are represented as strategies. While the algorithmic problem for
solving graph games with parity objectives has been widely studied, the most prominent
data-structure for strategy representation in graph games has been binary decision
diagrams (BDDs). However, due to the bit-level representation, BDDs do not retain
the inherent flavor of the decisions of strategies, and are notoriously hard to
minimize to obtain succinct representation. In this work we propose decision trees
for strategy representation in graph games. Decision trees retain the flavor of
decisions of strategies and allow entropy-based minimization to obtain succinct
trees. However, decision trees work in settings (e.g., probabilistic models) where
errors are allowed, and overfitting of data is typically avoided. In contrast,
for strategies in graph games no error is allowed, and the decision tree must
represent the entire strategy. We develop new techniques to extend decision trees
to overcome the above obstacles, while retaining the entropy-based techniques
to obtain succinct trees. We have implemented our techniques to extend the existing
decision tree solvers. We present experimental results for problems in reactive
synthesis to show that decision trees provide a much more efficient data-structure
for strategy representation as compared to BDDs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. Strategy representation by
decision trees in reactive synthesis. In: Vol 10805. Springer; 2018:385-407. doi:10.1007/978-3-319-89960-2_21'
apa: 'Brázdil, T., Chatterjee, K., Kretinsky, J., & Toman, V. (2018). Strategy
representation by decision trees in reactive synthesis (Vol. 10805, pp. 385–407).
Presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis
of Systems, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89960-2_21'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman.
“Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407.
Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.
ieee: 'T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation
by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and
Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece,
2018, vol. 10805, pp. 385–407.'
ista: 'Brázdil T, Chatterjee K, Kretinsky J, Toman V. 2018. Strategy representation
by decision trees in reactive synthesis. TACAS 2018: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 10805, 385–407.'
mla: Brázdil, Tomáš, et al. Strategy Representation by Decision Trees in Reactive
Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.
short: T. Brázdil, K. Chatterjee, J. Kretinsky, V. Toman, in:, Springer, 2018, pp.
385–407.
conference:
end_date: 2018-04-20
location: Thessaloniki, Greece
name: 'TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2018-04-14
date_created: 2018-12-11T11:45:41Z
date_published: 2018-04-12T00:00:00Z
date_updated: 2023-09-19T09:57:08Z
day: '12'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-89960-2_21
ec_funded: 1
external_id:
isi:
- '000546326300021'
file:
- access_level: open_access
checksum: b13874ffb114932ad9cc2586b7469db4
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T16:29:08Z
date_updated: 2020-07-14T12:45:57Z
file_id: '5723'
file_name: 2018_LNCS_Brazdil.pdf
file_size: 1829940
relation: main_file
file_date_updated: 2020-07-14T12:45:57Z
has_accepted_license: '1'
intvolume: ' 10805'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 385 - 407
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7584'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Strategy representation by decision trees in reactive synthesis
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10805
year: '2018'
...
---
_id: '141'
abstract:
- lang: eng
text: 'Given a model and a specification, the fundamental model-checking problem
asks for algorithmic verification of whether the model satisfies the specification.
We consider graphs and Markov decision processes (MDPs), which are fundamental
models for reactive systems. One of the very basic specifications that arise in
verification of reactive systems is the strong fairness (aka Streett) objective.
Given different types of requests and corresponding grants, the objective requires
that for each type, if the request event happens infinitely often, then the corresponding
grant event must also happen infinitely often. All ω -regular objectives can be
expressed as Streett objectives and hence they are canonical in verification.
To handle the state-space explosion, symbolic algorithms are required that operate
on a succinct implicit representation of the system rather than explicitly accessing
the system. While explicit algorithms for graphs and MDPs with Streett objectives
have been widely studied, there has been no improvement of the basic symbolic
algorithms. The worst-case numbers of symbolic steps required for the basic symbolic
algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work
we present the first sub-quadratic symbolic algorithm for graphs with Streett
objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic
insights we present an implementation of the new symbolic approach and show that
it improves the existing approach on several academic benchmark examples.'
acknowledgement: 'Acknowledgements. K. C. and M. H. are partially supported by the
Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported
by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant
(279307: Graph Games). V. T. is partially supported by the European Union’s Horizon
2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement
No. 665385.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
- first_name: Simin
full_name: Oraee, Simin
last_name: Oraee
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms
for graphs and Markov decision processes with fairness objectives. In: Vol 10982.
Springer; 2018:178-197. doi:10.1007/978-3-319-96142-2_13'
apa: 'Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., & Toman,
V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness
objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification,
Oxford, United Kingdom: Springer. https://doi.org/10.1007/978-3-319-96142-2_13'
chicago: Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin
Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes
with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
ieee: 'K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman,
“Symbolic algorithms for graphs and Markov decision processes with fairness objectives,”
presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018,
vol. 10982, pp. 178–197.'
ista: 'Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic
algorithms for graphs and Markov decision processes with fairness objectives.
CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.'
mla: Chatterjee, Krishnendu, et al. Symbolic Algorithms for Graphs and Markov
Decision Processes with Fairness Objectives. Vol. 10982, Springer, 2018, pp.
178–97, doi:10.1007/978-3-319-96142-2_13.
short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:,
Springer, 2018, pp. 178–197.
conference:
end_date: 2018-07-17
location: Oxford, United Kingdom
name: 'CAV: Computer Aided Verification'
start_date: 2018-07-14
date_created: 2018-12-11T11:44:51Z
date_published: 2018-07-18T00:00:00Z
date_updated: 2023-09-19T09:59:55Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-319-96142-2_13
ec_funded: 1
external_id:
isi:
- '000491469700013'
file:
- access_level: open_access
checksum: 1a6ffa4febe8bb8ac28be3adb3eafebc
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T08:52:38Z
date_updated: 2020-07-14T12:44:53Z
file_id: '5737'
file_name: 2018_LNCS_Chatterjee.pdf
file_size: 675606
relation: main_file
file_date_updated: 2020-07-14T12:44:53Z
has_accepted_license: '1'
intvolume: ' 10982'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 178-197
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_status: published
publisher: Springer
publist_id: '7782'
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Symbolic algorithms for graphs and Markov decision processes with fairness
objectives
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10982
year: '2018'
...
---
_id: '298'
abstract:
- lang: eng
text: "Memory-hard functions (MHF) are functions whose evaluation cost is dominated
by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated
hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf hardware
(like x86 CPUs). MHFs have interesting cryptographic applications, most notably
to password hashing and securing blockchains.\r\n\r\nAlwen and Serbinenko [STOC’15]
define the cumulative memory complexity (cmc) of a function as the sum (over all
time-steps) of the amount of memory required to compute the function. They advocate
that a good MHF must have high cmc. Unlike previous notions, cmc takes into account
that dedicated hardware might exploit amortization and parallelism. Still, cmc
has been critizised as insufficient, as it fails to capture possible time-memory
trade-offs; as memory cost doesn’t scale linearly, functions with the same cmc
could still have very different actual hardware cost.\r\n\r\nIn this work we address
this problem, and introduce the notion of sustained-memory complexity, which requires
that any algorithm evaluating the function must use a large amount of memory for
many steps. We construct functions (in the parallel random oracle model) whose
sustained-memory complexity is almost optimal: our function can be evaluated using
n steps and O(n/log(n)) memory, in each step making one query to the (fixed-input
length) random oracle, while any algorithm that can make arbitrary many parallel
queries to the random oracle, still needs Ω(n/log(n)) memory for Ω(n) steps.\r\n\r\nAs
has been done for various notions (including cmc) before, we reduce the task of
constructing an MHFs with high sustained-memory complexity to proving pebbling
lower bounds on DAGs. Our main technical contribution is the construction is a
family of DAGs on n nodes with constant indegree with high “sustained-space complexity”,
meaning that any parallel black-pebbling strategy requires Ω(n/log(n)) pebbles
for at least Ω(n) steps.\r\n\r\nAlong the way we construct a family of maximally
“depth-robust” DAGs with maximum indegree O(logn) , improving upon the construction
of Mahmoody et al. [ITCS’13] which had maximum indegree O(log2n⋅"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Jeremiah
full_name: Blocki, Jeremiah
last_name: Blocki
- 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: 'Alwen JF, Blocki J, Pietrzak KZ. Sustained space complexity. In: Vol 10821.
Springer; 2018:99-130. doi:10.1007/978-3-319-78375-8_4'
apa: 'Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2018). Sustained space complexity
(Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology,
Tel Aviv, Israel: Springer. https://doi.org/10.1007/978-3-319-78375-8_4'
chicago: Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Sustained Space
Complexity,” 10821:99–130. Springer, 2018. https://doi.org/10.1007/978-3-319-78375-8_4.
ieee: 'J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,”
presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018,
vol. 10821, pp. 99–130.'
ista: 'Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt
2018: Advances in Cryptology, LNCS, vol. 10821, 99–130.'
mla: Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer,
2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4.
short: J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 99–130.
conference:
end_date: 2018-05-03
location: Tel Aviv, Israel
name: 'Eurocrypt 2018: Advances in Cryptology'
start_date: 2018-04-29
date_created: 2018-12-11T11:45:41Z
date_published: 2018-03-31T00:00:00Z
date_updated: 2023-09-19T09:59:30Z
day: '31'
department:
- _id: KrPi
doi: 10.1007/978-3-319-78375-8_4
ec_funded: 1
external_id:
arxiv:
- '1705.05313'
isi:
- '000517098700004'
intvolume: ' 10821'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.05313
month: '03'
oa: 1
oa_version: Preprint
page: 99 - 130
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_status: published
publisher: Springer
publist_id: '7583'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sustained space complexity
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10821
year: '2018'
...
---
_id: '36'
abstract:
- lang: eng
text: Wheat (Triticum ssp.) is one of the most important human food sources. However,
this crop is very sensitive to temperature changes. Specifically, processes during
wheat leaf, flower, and seed development and photosynthesis, which all contribute
to the yield of this crop, are affected by high temperature. While this has to
some extent been investigated on physiological, developmental, and molecular levels,
very little is known about early signalling events associated with an increase
in temperature. Phosphorylation-mediated signalling mechanisms, which are quick
and dynamic, are associated with plant growth and development, also under abiotic
stress conditions. Therefore, we probed the impact of a short-term and mild increase
in temperature on the wheat leaf and spikelet phosphoproteome. In total, 3822
(containing 5178 phosphosites) and 5581 phosphopeptides (containing 7023 phosphosites)
were identified in leaf and spikelet samples, respectively. Following statistical
analysis, the resulting data set provides the scientific community with a first
large-scale plant phosphoproteome under the control of higher ambient temperature.
This community resource on the high temperature-mediated wheat phosphoproteome
will be valuable for future studies. Our analyses also revealed a core set of
common proteins between leaf and spikelet, suggesting some level of conserved
regulatory mechanisms. Furthermore, we observed temperature-regulated interconversion
of phosphoforms, which probably impacts protein activity.
acknowledgement: TZ is supported by a grant from the Chinese Scholarship Council.
article_processing_charge: No
author:
- first_name: Lam
full_name: Vu, Lam
last_name: Vu
- first_name: Tingting
full_name: Zhu, Tingting
last_name: Zhu
- first_name: Inge
full_name: Verstraeten, Inge
id: 362BF7FE-F248-11E8-B48F-1D18A9856A87
last_name: Verstraeten
orcid: 0000-0001-7241-2328
- first_name: Brigitte
full_name: Van De Cotte, Brigitte
last_name: Van De Cotte
- first_name: Kris
full_name: Gevaert, Kris
last_name: Gevaert
- first_name: Ive
full_name: De Smet, Ive
last_name: De Smet
citation:
ama: Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. Temperature-induced
changes in the wheat phosphoproteome reveal temperature-regulated interconversion
of phosphoforms. Journal of Experimental Botany. 2018;69(19):4609-4624.
doi:10.1093/jxb/ery204
apa: Vu, L., Zhu, T., Verstraeten, I., Van De Cotte, B., Gevaert, K., & De Smet,
I. (2018). Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated
interconversion of phosphoforms. Journal of Experimental Botany. Oxford
University Press. https://doi.org/10.1093/jxb/ery204
chicago: Vu, Lam, Tingting Zhu, Inge Verstraeten, Brigitte Van De Cotte, Kris Gevaert,
and Ive De Smet. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal
Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental
Botany. Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery204.
ieee: L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, and I. De Smet,
“Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated
interconversion of phosphoforms,” Journal of Experimental Botany, vol.
69, no. 19. Oxford University Press, pp. 4609–4624, 2018.
ista: Vu L, Zhu T, Verstraeten I, Van De Cotte B, Gevaert K, De Smet I. 2018. Temperature-induced
changes in the wheat phosphoproteome reveal temperature-regulated interconversion
of phosphoforms. Journal of Experimental Botany. 69(19), 4609–4624.
mla: Vu, Lam, et al. “Temperature-Induced Changes in the Wheat Phosphoproteome Reveal
Temperature-Regulated Interconversion of Phosphoforms.” Journal of Experimental
Botany, vol. 69, no. 19, Oxford University Press, 2018, pp. 4609–24, doi:10.1093/jxb/ery204.
short: L. Vu, T. Zhu, I. Verstraeten, B. Van De Cotte, K. Gevaert, I. De Smet, Journal
of Experimental Botany 69 (2018) 4609–4624.
date_created: 2018-12-11T11:44:17Z
date_published: 2018-08-31T00:00:00Z
date_updated: 2023-09-19T10:00:46Z
day: '31'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1093/jxb/ery204
external_id:
isi:
- '000443568700010'
file:
- access_level: open_access
checksum: 34cb0a1611588b75bd6f4913fb4e30f1
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T09:47:51Z
date_updated: 2020-07-14T12:46:13Z
file_id: '5741'
file_name: 2018_JournalExperimBotany_Vu.pdf
file_size: 3359316
relation: main_file
file_date_updated: 2020-07-14T12:46:13Z
has_accepted_license: '1'
intvolume: ' 69'
isi: 1
issue: '19'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 4609 - 4624
publication: Journal of Experimental Botany
publication_status: published
publisher: Oxford University Press
publist_id: '8019'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Temperature-induced changes in the wheat phosphoproteome reveal temperature-regulated
interconversion of phosphoforms
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: 69
year: '2018'
...