---
_id: '7399'
abstract:
- lang: eng
text: Long non-coding (lnc) RNAs are numerous and found throughout the mammalian
genome, and many are thought to be involved in the regulation of gene expression.
However, the majority remain relatively uncharacterised and of uncertain function
making the use of model systems to uncover their mode of action valuable. Imprinted
lncRNAs target and recruit epigenetic silencing factors to a cluster of imprinted
genes on the same chromosome, making them one of the best characterized lncRNAs
for silencing distant genes in cis. In this study we examined silencing of the
distant imprinted gene Slc22a3 by the lncRNA Airn in the Igf2r imprinted cluster
in mouse. Previously we proposed that imprinted lncRNAs may silence distant imprinted
genes by disrupting promoter-enhancer interactions by being transcribed through
the enhancer, which we called the enhancer interference hypothesis. Here we tested
this hypothesis by first using allele-specific chromosome conformation capture
(3C) to detect interactions between the Slc22a3 promoter and the locus of the
Airn lncRNA that silences it on the paternal chromosome. In agreement with the
model, we found interactions enriched on the maternal allele across the entire
Airn gene consistent with multiple enhancer-promoter interactions. Therefore,
to test the enhancer interference hypothesis we devised an approach to delete
the entire Airn gene. However, the deletion showed that there are no essential
enhancers for Slc22a2, Pde10a and Slc22a3 within the Airn gene, strongly indicating
that the Airn RNA rather than its transcription is responsible for silencing distant
imprinted genes. Furthermore, we found that silent imprinted genes were covered
with large blocks of H3K27me3 on the repressed paternal allele. Therefore we propose
an alternative hypothesis whereby the chromosome interactions may initially guide
the lncRNA to target imprinted promoters and recruit repressive chromatin, and
that these interactions are lost once silencing is established.
article_number: e1008268
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Andergassen, Daniel
last_name: Andergassen
- first_name: Markus
full_name: Muckenhuber, Markus
last_name: Muckenhuber
- first_name: Philipp C.
full_name: Bammer, Philipp C.
last_name: Bammer
- first_name: Tomasz M.
full_name: Kulinski, Tomasz M.
last_name: Kulinski
- first_name: Hans-Christian
full_name: Theussl, Hans-Christian
last_name: Theussl
- first_name: Takahiko
full_name: Shimizu, Takahiko
last_name: Shimizu
- first_name: Josef M.
full_name: Penninger, Josef M.
last_name: Penninger
- first_name: Florian
full_name: Pauler, Florian
id: 48EA0138-F248-11E8-B48F-1D18A9856A87
last_name: Pauler
orcid: 0000-0002-7462-0048
- first_name: Quanah J.
full_name: Hudson, Quanah J.
last_name: Hudson
citation:
ama: Andergassen D, Muckenhuber M, Bammer PC, et al. The Airn lncRNA does not require
any DNA elements within its locus to silence distant imprinted genes. PLoS
Genetics. 2019;15(7). doi:10.1371/journal.pgen.1008268
apa: Andergassen, D., Muckenhuber, M., Bammer, P. C., Kulinski, T. M., Theussl,
H.-C., Shimizu, T., … Hudson, Q. J. (2019). The Airn lncRNA does not require any
DNA elements within its locus to silence distant imprinted genes. PLoS Genetics.
Public Library of Science. https://doi.org/10.1371/journal.pgen.1008268
chicago: Andergassen, Daniel, Markus Muckenhuber, Philipp C. Bammer, Tomasz M. Kulinski,
Hans-Christian Theussl, Takahiko Shimizu, Josef M. Penninger, Florian Pauler,
and Quanah J. Hudson. “The Airn LncRNA Does Not Require Any DNA Elements within
Its Locus to Silence Distant Imprinted Genes.” PLoS Genetics. Public Library
of Science, 2019. https://doi.org/10.1371/journal.pgen.1008268.
ieee: D. Andergassen et al., “The Airn lncRNA does not require any DNA elements
within its locus to silence distant imprinted genes,” PLoS Genetics, vol.
15, no. 7. Public Library of Science, 2019.
ista: Andergassen D, Muckenhuber M, Bammer PC, Kulinski TM, Theussl H-C, Shimizu
T, Penninger JM, Pauler F, Hudson QJ. 2019. The Airn lncRNA does not require any
DNA elements within its locus to silence distant imprinted genes. PLoS Genetics.
15(7), e1008268.
mla: Andergassen, Daniel, et al. “The Airn LncRNA Does Not Require Any DNA Elements
within Its Locus to Silence Distant Imprinted Genes.” PLoS Genetics, vol.
15, no. 7, e1008268, Public Library of Science, 2019, doi:10.1371/journal.pgen.1008268.
short: D. Andergassen, M. Muckenhuber, P.C. Bammer, T.M. Kulinski, H.-C. Theussl,
T. Shimizu, J.M. Penninger, F. Pauler, Q.J. Hudson, PLoS Genetics 15 (2019).
date_created: 2020-01-29T16:14:07Z
date_published: 2019-07-22T00:00:00Z
date_updated: 2023-10-17T12:30:27Z
day: '22'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.1371/journal.pgen.1008268
external_id:
isi:
- '000478689100025'
pmid:
- '31329595'
file:
- access_level: open_access
checksum: 2f51fc91e4a4199827adc51d432ad864
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T10:11:55Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7446'
file_name: 2019_PlosGenetics_Andergassen.pdf
file_size: 2302307
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS Genetics
publication_identifier:
issn:
- 1553-7404
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Airn lncRNA does not require any DNA elements within its locus to silence
distant imprinted genes
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: 15
year: '2019'
...
---
_id: '7400'
abstract:
- lang: eng
text: 'Suppressed recombination allows divergence between homologous sex chromosomes
and the functionality of their genes. Here, we reveal patterns of the earliest
stages of sex-chromosome evolution in the diploid dioecious herb Mercurialis annua
on the basis of cytological analysis, de novo genome assembly and annotation,
genetic mapping, exome resequencing of natural populations, and transcriptome
analysis. The genome assembly contained 34,105 expressed genes, of which 10,076
were assigned to linkage groups. Genetic mapping and exome resequencing of individuals
across the species range both identified the largest linkage group, LG1, as the
sex chromosome. Although the sex chromosomes of M. annua are karyotypically homomorphic,
we estimate that about one-third of the Y chromosome, containing 568 transcripts
and spanning 22.3 cM in the corresponding female map, has ceased recombining.
Nevertheless, we found limited evidence for Y-chromosome degeneration in terms
of gene loss and pseudogenization, and most X- and Y-linked genes appear to have
diverged in the period subsequent to speciation between M. annua and its sister
species M. huetii, which shares the same sex-determining region. Taken together,
our results suggest that the M. annua Y chromosome has at least two evolutionary
strata: a small old stratum shared with M. huetii, and a more recent larger stratum
that is probably unique to M. annua and that stopped recombining ∼1 MYA. Patterns
of gene expression within the nonrecombining region are consistent with the idea
that sexually antagonistic selection may have played a role in favoring suppressed
recombination.'
article_processing_charge: No
article_type: original
author:
- first_name: Paris
full_name: Veltsos, Paris
last_name: Veltsos
- first_name: Kate E.
full_name: Ridout, Kate E.
last_name: Ridout
- first_name: Melissa A
full_name: Toups, Melissa A
id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
last_name: Toups
orcid: 0000-0002-9752-7380
- first_name: Santiago C.
full_name: González-Martínez, Santiago C.
last_name: González-Martínez
- first_name: Aline
full_name: Muyle, Aline
last_name: Muyle
- first_name: Olivier
full_name: Emery, Olivier
last_name: Emery
- first_name: Pasi
full_name: Rastas, Pasi
last_name: Rastas
- first_name: Vojtech
full_name: Hudzieczek, Vojtech
last_name: Hudzieczek
- first_name: Roman
full_name: Hobza, Roman
last_name: Hobza
- first_name: Boris
full_name: Vyskot, Boris
last_name: Vyskot
- first_name: Gabriel A. B.
full_name: Marais, Gabriel A. B.
last_name: Marais
- first_name: Dmitry A.
full_name: Filatov, Dmitry A.
last_name: Filatov
- first_name: John R.
full_name: Pannell, John R.
last_name: Pannell
citation:
ama: Veltsos P, Ridout KE, Toups MA, et al. Early sex-chromosome evolution in the
diploid dioecious plant Mercurialis annua. Genetics. 2019;212(3):815-835.
doi:10.1534/genetics.119.302045
apa: Veltsos, P., Ridout, K. E., Toups, M. A., González-Martínez, S. C., Muyle,
A., Emery, O., … Pannell, J. R. (2019). Early sex-chromosome evolution in the
diploid dioecious plant Mercurialis annua. Genetics. Genetics Society of
America. https://doi.org/10.1534/genetics.119.302045
chicago: Veltsos, Paris, Kate E. Ridout, Melissa A Toups, Santiago C. González-Martínez,
Aline Muyle, Olivier Emery, Pasi Rastas, et al. “Early Sex-Chromosome Evolution
in the Diploid Dioecious Plant Mercurialis Annua.” Genetics. Genetics Society
of America, 2019. https://doi.org/10.1534/genetics.119.302045.
ieee: P. Veltsos et al., “Early sex-chromosome evolution in the diploid dioecious
plant Mercurialis annua,” Genetics, vol. 212, no. 3. Genetics Society of
America, pp. 815–835, 2019.
ista: Veltsos P, Ridout KE, Toups MA, González-Martínez SC, Muyle A, Emery O, Rastas
P, Hudzieczek V, Hobza R, Vyskot B, Marais GAB, Filatov DA, Pannell JR. 2019.
Early sex-chromosome evolution in the diploid dioecious plant Mercurialis annua.
Genetics. 212(3), 815–835.
mla: Veltsos, Paris, et al. “Early Sex-Chromosome Evolution in the Diploid Dioecious
Plant Mercurialis Annua.” Genetics, vol. 212, no. 3, Genetics Society of
America, 2019, pp. 815–35, doi:10.1534/genetics.119.302045.
short: P. Veltsos, K.E. Ridout, M.A. Toups, S.C. González-Martínez, A. Muyle, O.
Emery, P. Rastas, V. Hudzieczek, R. Hobza, B. Vyskot, G.A.B. Marais, D.A. Filatov,
J.R. Pannell, Genetics 212 (2019) 815–835.
date_created: 2020-01-29T16:15:44Z
date_published: 2019-07-01T00:00:00Z
date_updated: 2023-09-07T14:49:29Z
day: '01'
department:
- _id: BeVi
doi: 10.1534/genetics.119.302045
ec_funded: 1
external_id:
isi:
- '000474809300015'
pmid:
- '31113811'
intvolume: ' 212'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1534/genetics.119.302045
month: '07'
oa: 1
oa_version: Published Version
page: 815-835
pmid: 1
project:
- _id: 250BDE62-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715257'
name: Prevalence and Influence of Sexual Antagonism on Genome Evolution
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
quality_controlled: '1'
scopus_import: '1'
status: public
title: Early sex-chromosome evolution in the diploid dioecious plant Mercurialis annua
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 212
year: '2019'
...
---
_id: '7401'
abstract:
- lang: eng
text: 'The genus g(G) of a graph G is the minimum g such that G has an embedding
on the orientable surface M_g of genus g. A drawing of a graph on a surface is
independently even if every pair of nonadjacent edges in the drawing crosses an
even number of times. The Z_2-genus of a graph G, denoted by g_0(G), is the minimum
g such that G has an independently even drawing on M_g. By a result of Battle,
Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected
blocks. In 2013, Schaefer and Stefankovic proved that the Z_2-genus of a graph
is additive over 2-connected blocks as well, and asked whether this result can
be extended to so-called 2-amalgamations, as an analogue of results by Decker,
Glover, Huneke, and Stahl for the genus. We give the following partial answer.
If G=G_1 cup G_2, G_1 and G_2 intersect in two vertices u and v, and G-u-v has
k connected components (among which we count the edge uv if present), then |g_0(G)-(g_0(G_1)+g_0(G_2))|<=k+1.
For complete bipartite graphs K_{m,n}, with n >= m >= 3, we prove that g_0(K_{m,n})/g(K_{m,n})=1-O(1/n).
Similar results are proved also for the Euler Z_2-genus. We express the Z_2-genus
of a graph using the minimum rank of partial symmetric matrices over Z_2; a problem
that might be of independent interest. '
alternative_title:
- LIPIcs
article_number: '39'
article_processing_charge: No
arxiv: 1
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kyncl, Jan
last_name: Kyncl
citation:
ama: 'Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric
matrices. In: 35th International Symposium on Computational Geometry (SoCG
2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39'
apa: 'Fulek, R., & Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of
partial symmetric matrices. In 35th International Symposium on Computational
Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.39'
chicago: Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of
Partial Symmetric Matrices.” In 35th International Symposium on Computational
Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019. https://doi.org/10.4230/LIPICS.SOCG.2019.39.
ieee: R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric
matrices,” in 35th International Symposium on Computational Geometry (SoCG
2019), Portland, OR, United States, 2019, vol. 129.
ista: 'Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric
matrices. 35th International Symposium on Computational Geometry (SoCG 2019).
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39.'
mla: Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial
Symmetric Matrices.” 35th International Symposium on Computational Geometry
(SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2019, doi:10.4230/LIPICS.SOCG.2019.39.
short: R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry
(SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
conference:
end_date: 2019-06-21
location: Portland, OR, United States
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2019-06-18
date_created: 2020-01-29T16:17:05Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2021-01-12T08:13:24Z
day: '01'
ddc:
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPICS.SOCG.2019.39
external_id:
arxiv:
- '1903.08637'
file:
- access_level: open_access
checksum: aac37b09118cc0ab58cf77129e691f8c
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T09:14:31Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7445'
file_name: 2019_LIPIcs_Fulek.pdf
file_size: 628347
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 129'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 261FA626-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02281
name: Eliminating intersections in drawings of graphs
publication: 35th International Symposium on Computational Geometry (SoCG 2019)
publication_identifier:
isbn:
- 978-3-95977-104-7
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: 1
status: public
title: Z_2-Genus of graphs and minimum rank of partial symmetric matrices
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 129
year: '2019'
...
---
_id: '7402'
abstract:
- lang: eng
text: Graph planning gives rise to fundamental algorithmic questions such as shortest
path, traveling salesman problem, etc. A classical problem in discrete planning
is to consider a weighted graph and construct a path that maximizes the sum of
weights for a given time horizon T. However, in many scenarios, the time horizon
is not fixed, but the stopping time is chosen according to some distribution such
that the expected stopping time is T. If the stopping time distribution is not
known, then to ensure robustness, the distribution is chosen by an adversary,
to represent the worst-case scenario. A stationary plan for every vertex always
chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution,
stationary plans are not sufficient for optimality. Quite surprisingly we show
that when an adversary chooses the stopping-time distribution with expected stopping
time T, then stationary plans are sufficient. While computing optimal stationary
plans for fixed horizon is NP-complete, we show that computing optimal stationary
plans under adversarial stopping-time distribution can be achieved in polynomial
time. Consequently, our polynomial-time algorithm for adversarial stopping time
also computes an optimal plan among all possible plans.
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Graph planning with expected finite horizon. In: 34th
Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2019:1-13. doi:10.1109/lics.2019.8785706'
apa: 'Chatterjee, K., & Doyen, L. (2019). Graph planning with expected finite
horizon. In 34th Annual ACM/IEEE Symposium on Logic in Computer Science
(pp. 1–13). Vancouver, BC, Canada: IEEE. https://doi.org/10.1109/lics.2019.8785706'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected
Finite Horizon.” In 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
1–13. IEEE, 2019. https://doi.org/10.1109/lics.2019.8785706.
ieee: K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,”
in 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Vancouver,
BC, Canada, 2019, pp. 1–13.
ista: 'Chatterjee K, Doyen L. 2019. Graph planning with expected finite horizon.
34th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on
Logic in Computer Science, 1–13.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite
Horizon.” 34th Annual ACM/IEEE Symposium on Logic in Computer Science,
IEEE, 2019, pp. 1–13, doi:10.1109/lics.2019.8785706.
short: K. Chatterjee, L. Doyen, in:, 34th Annual ACM/IEEE Symposium on Logic in
Computer Science, IEEE, 2019, pp. 1–13.
conference:
end_date: 2019-06-27
location: Vancouver, BC, Canada
name: 'LICS: Symposium on Logic in Computer Science'
start_date: 2019-06-24
date_created: 2020-01-29T16:18:33Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2025-07-14T09:09:54Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/lics.2019.8785706
external_id:
arxiv:
- '1802.03642'
isi:
- '000805002800001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.03642
month: '06'
oa: 1
oa_version: Preprint
page: 1-13
publication: 34th Annual ACM/IEEE Symposium on Logic in Computer Science
publication_identifier:
isbn:
- '9781728136080'
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '11402'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Graph planning with expected finite horizon
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7404'
abstract:
- lang: eng
text: The formation of neuronal dendrite branches is fundamental for the wiring
and function of the nervous system. Indeed, dendrite branching enhances the coverage
of the neuron's receptive field and modulates the initial processing of incoming
stimuli. Complex dendrite patterns are achieved in vivo through a dynamic process
of de novo branch formation, branch extension and retraction. The first step towards
branch formation is the generation of a dynamic filopodium-like branchlet. The
mechanisms underlying the initiation of dendrite branchlets are therefore crucial
to the shaping of dendrites. Through in vivo time-lapse imaging of the subcellular
localization of actin during the process of branching of Drosophila larva sensory
neurons, combined with genetic analysis and electron tomography, we have identified
the Actin-related protein (Arp) 2/3 complex as the major actin nucleator involved
in the initiation of dendrite branchlet formation, under the control of the activator
WAVE and of the small GTPase Rac1. Transient recruitment of an Arp2/3 component
marks the site of branchlet initiation in vivo. These data position the activation
of Arp2/3 as an early hub for the initiation of branchlet formation.
article_number: dev171397
article_processing_charge: No
article_type: original
author:
- first_name: Tomke
full_name: Stürner, Tomke
last_name: Stürner
- first_name: Anastasia
full_name: Tatarnikova, Anastasia
last_name: Tatarnikova
- first_name: Jan
full_name: Müller, Jan
id: AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D
last_name: Müller
- first_name: Barbara
full_name: Schaffran, Barbara
last_name: Schaffran
- first_name: Hermann
full_name: Cuntz, Hermann
last_name: Cuntz
- first_name: Yun
full_name: Zhang, Yun
last_name: Zhang
- first_name: Maria
full_name: Nemethova, Maria
id: 34E27F1C-F248-11E8-B48F-1D18A9856A87
last_name: Nemethova
- first_name: Sven
full_name: Bogdan, Sven
last_name: Bogdan
- first_name: Vic
full_name: Small, Vic
last_name: Small
- first_name: Gaia
full_name: Tavosanis, Gaia
last_name: Tavosanis
citation:
ama: Stürner T, Tatarnikova A, Müller J, et al. Transient localization of the Arp2/3
complex initiates neuronal dendrite branching in vivo. Development. 2019;146(7).
doi:10.1242/dev.171397
apa: Stürner, T., Tatarnikova, A., Müller, J., Schaffran, B., Cuntz, H., Zhang,
Y., … Tavosanis, G. (2019). Transient localization of the Arp2/3 complex initiates
neuronal dendrite branching in vivo. Development. The Company of Biologists.
https://doi.org/10.1242/dev.171397
chicago: Stürner, Tomke, Anastasia Tatarnikova, Jan Müller, Barbara Schaffran, Hermann
Cuntz, Yun Zhang, Maria Nemethova, Sven Bogdan, Vic Small, and Gaia Tavosanis.
“Transient Localization of the Arp2/3 Complex Initiates Neuronal Dendrite Branching
in Vivo.” Development. The Company of Biologists, 2019. https://doi.org/10.1242/dev.171397.
ieee: T. Stürner et al., “Transient localization of the Arp2/3 complex initiates
neuronal dendrite branching in vivo,” Development, vol. 146, no. 7. The
Company of Biologists, 2019.
ista: Stürner T, Tatarnikova A, Müller J, Schaffran B, Cuntz H, Zhang Y, Nemethova
M, Bogdan S, Small V, Tavosanis G. 2019. Transient localization of the Arp2/3
complex initiates neuronal dendrite branching in vivo. Development. 146(7), dev171397.
mla: Stürner, Tomke, et al. “Transient Localization of the Arp2/3 Complex Initiates
Neuronal Dendrite Branching in Vivo.” Development, vol. 146, no. 7, dev171397,
The Company of Biologists, 2019, doi:10.1242/dev.171397.
short: T. Stürner, A. Tatarnikova, J. Müller, B. Schaffran, H. Cuntz, Y. Zhang,
M. Nemethova, S. Bogdan, V. Small, G. Tavosanis, Development 146 (2019).
date_created: 2020-01-29T16:27:10Z
date_published: 2019-04-04T00:00:00Z
date_updated: 2023-09-07T14:47:00Z
day: '04'
department:
- _id: MiSi
doi: 10.1242/dev.171397
external_id:
isi:
- '000464583200006'
pmid:
- '30910826'
intvolume: ' 146'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1242/dev.171397
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
publication: Development
publication_identifier:
eissn:
- 1477-9129
issn:
- 0950-1991
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transient localization of the Arp2/3 complex initiates neuronal dendrite branching
in vivo
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 146
year: '2019'
...
---
_id: '7405'
abstract:
- lang: eng
text: Biophysical modeling of neuronal networks helps to integrate and interpret
rapidly growing and disparate experimental datasets at multiple scales. The NetPyNE
tool (www.netpyne.org) provides both programmatic and graphical interfaces to
develop data-driven multiscale network models in NEURON. NetPyNE clearly separates
model parameters from implementation code. Users provide specifications at a high
level via a standardized declarative language, for example connectivity rules,
to create millions of cell-to-cell connections. NetPyNE then enables users to
generate the NEURON network, run efficiently parallelized simulations, optimize
and explore network parameters through automated batch runs, and use built-in
functions for visualization and analysis – connectivity matrices, voltage traces,
spike raster plots, local field potentials, and information theoretic measures.
NetPyNE also facilitates model sharing by exporting and importing standardized
formats (NeuroML and SONATA). NetPyNE is already being used to teach computational
neuroscience students and by modelers to investigate brain regions and phenomena.
article_number: e44494
article_processing_charge: No
article_type: original
author:
- first_name: Salvador
full_name: Dura-Bernal, Salvador
last_name: Dura-Bernal
- first_name: Benjamin
full_name: Suter, Benjamin
id: 4952F31E-F248-11E8-B48F-1D18A9856A87
last_name: Suter
orcid: 0000-0002-9885-6936
- first_name: Padraig
full_name: Gleeson, Padraig
last_name: Gleeson
- first_name: Matteo
full_name: Cantarelli, Matteo
last_name: Cantarelli
- first_name: Adrian
full_name: Quintana, Adrian
last_name: Quintana
- first_name: Facundo
full_name: Rodriguez, Facundo
last_name: Rodriguez
- first_name: David J
full_name: Kedziora, David J
last_name: Kedziora
- first_name: George L
full_name: Chadderdon, George L
last_name: Chadderdon
- first_name: Cliff C
full_name: Kerr, Cliff C
last_name: Kerr
- first_name: Samuel A
full_name: Neymotin, Samuel A
last_name: Neymotin
- first_name: Robert A
full_name: McDougal, Robert A
last_name: McDougal
- first_name: Michael
full_name: Hines, Michael
last_name: Hines
- first_name: Gordon MG
full_name: Shepherd, Gordon MG
last_name: Shepherd
- first_name: William W
full_name: Lytton, William W
last_name: Lytton
citation:
ama: Dura-Bernal S, Suter B, Gleeson P, et al. NetPyNE, a tool for data-driven multiscale
modeling of brain circuits. eLife. 2019;8. doi:10.7554/elife.44494
apa: Dura-Bernal, S., Suter, B., Gleeson, P., Cantarelli, M., Quintana, A., Rodriguez,
F., … Lytton, W. W. (2019). NetPyNE, a tool for data-driven multiscale modeling
of brain circuits. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.44494
chicago: Dura-Bernal, Salvador, Benjamin Suter, Padraig Gleeson, Matteo Cantarelli,
Adrian Quintana, Facundo Rodriguez, David J Kedziora, et al. “NetPyNE, a Tool
for Data-Driven Multiscale Modeling of Brain Circuits.” ELife. eLife Sciences
Publications, 2019. https://doi.org/10.7554/elife.44494.
ieee: S. Dura-Bernal et al., “NetPyNE, a tool for data-driven multiscale
modeling of brain circuits,” eLife, vol. 8. eLife Sciences Publications,
2019.
ista: Dura-Bernal S, Suter B, Gleeson P, Cantarelli M, Quintana A, Rodriguez F,
Kedziora DJ, Chadderdon GL, Kerr CC, Neymotin SA, McDougal RA, Hines M, Shepherd
GM, Lytton WW. 2019. NetPyNE, a tool for data-driven multiscale modeling of brain
circuits. eLife. 8, e44494.
mla: Dura-Bernal, Salvador, et al. “NetPyNE, a Tool for Data-Driven Multiscale Modeling
of Brain Circuits.” ELife, vol. 8, e44494, eLife Sciences Publications,
2019, doi:10.7554/elife.44494.
short: S. Dura-Bernal, B. Suter, P. Gleeson, M. Cantarelli, A. Quintana, F. Rodriguez,
D.J. Kedziora, G.L. Chadderdon, C.C. Kerr, S.A. Neymotin, R.A. McDougal, M. Hines,
G.M. Shepherd, W.W. Lytton, ELife 8 (2019).
date_created: 2020-01-30T09:08:01Z
date_published: 2019-05-31T00:00:00Z
date_updated: 2023-09-07T14:27:52Z
day: '31'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.7554/elife.44494
external_id:
isi:
- '000468968400001'
pmid:
- '31025934'
file:
- access_level: open_access
checksum: 7014189c11c10a12feeeae37f054871d
content_type: application/pdf
creator: dernst
date_created: 2020-02-04T08:41:47Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7444'
file_name: 2019_eLife_DuraBernal.pdf
file_size: 6182359
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: NetPyNE, a tool for data-driven multiscale modeling of brain circuits
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: '2019'
...
---
_id: '7406'
abstract:
- lang: eng
text: "Background\r\nSynaptic vesicles (SVs) are an integral part of the neurotransmission
machinery, and isolation of SVs from their host neuron is necessary to reveal
their most fundamental biochemical and functional properties in in vitro assays.
Isolated SVs from neurons that have been genetically engineered, e.g. to introduce
genetically encoded indicators, are not readily available but would permit new
insights into SV structure and function. Furthermore, it is unclear if cultured
neurons can provide sufficient starting material for SV isolation procedures.\r\n\r\nNew
method\r\nHere, we demonstrate an efficient ex vivo procedure to obtain functional
SVs from cultured rat cortical neurons after genetic engineering with a lentivirus.\r\n\r\nResults\r\nWe
show that ∼108 plated cortical neurons allow isolation of suitable SV amounts
for functional analysis and imaging. We found that SVs isolated from cultured
neurons have neurotransmitter uptake comparable to that of SVs isolated from intact
cortex. Using total internal reflection fluorescence (TIRF) microscopy, we visualized
an exogenous SV-targeted marker protein and demonstrated the high efficiency of
SV modification.\r\n\r\nComparison with existing methods\r\nObtaining SVs from
genetically engineered neurons currently generally requires the availability of
transgenic animals, which is constrained by technical (e.g. cost and time) and
biological (e.g. developmental defects and lethality) limitations.\r\n\r\nConclusions\r\nThese
results demonstrate the modification and isolation of functional SVs using cultured
neurons and viral transduction. The ability to readily obtain SVs from genetically
engineered neurons will permit linking in situ studies to in vitro experiments
in a variety of genetic contexts."
acknowledged_ssus:
- _id: Bio
- _id: EM-Fac
article_processing_charge: No
article_type: original
author:
- first_name: Catherine
full_name: Mckenzie, Catherine
id: 3EEDE19A-F248-11E8-B48F-1D18A9856A87
last_name: Mckenzie
- first_name: Miroslava
full_name: Spanova, Miroslava
id: 44A924DC-F248-11E8-B48F-1D18A9856A87
last_name: Spanova
- first_name: Alexander J
full_name: Johnson, Alexander J
id: 46A62C3A-F248-11E8-B48F-1D18A9856A87
last_name: Johnson
orcid: 0000-0002-2739-8843
- first_name: Stephanie
full_name: Kainrath, Stephanie
id: 32CFBA64-F248-11E8-B48F-1D18A9856A87
last_name: Kainrath
- first_name: Vanessa
full_name: Zheden, Vanessa
id: 39C5A68A-F248-11E8-B48F-1D18A9856A87
last_name: Zheden
orcid: 0000-0002-9438-4783
- first_name: Harald H.
full_name: Sitte, Harald H.
last_name: Sitte
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: Mckenzie C, Spanova M, Johnson AJ, et al. Isolation of synaptic vesicles from
genetically engineered cultured neurons. Journal of Neuroscience Methods.
2019;312:114-121. doi:10.1016/j.jneumeth.2018.11.018
apa: Mckenzie, C., Spanova, M., Johnson, A. J., Kainrath, S., Zheden, V., Sitte,
H. H., & Janovjak, H. L. (2019). Isolation of synaptic vesicles from genetically
engineered cultured neurons. Journal of Neuroscience Methods. Elsevier.
https://doi.org/10.1016/j.jneumeth.2018.11.018
chicago: Mckenzie, Catherine, Miroslava Spanova, Alexander J Johnson, Stephanie
Kainrath, Vanessa Zheden, Harald H. Sitte, and Harald L Janovjak. “Isolation of
Synaptic Vesicles from Genetically Engineered Cultured Neurons.” Journal of
Neuroscience Methods. Elsevier, 2019. https://doi.org/10.1016/j.jneumeth.2018.11.018.
ieee: C. Mckenzie et al., “Isolation of synaptic vesicles from genetically
engineered cultured neurons,” Journal of Neuroscience Methods, vol. 312.
Elsevier, pp. 114–121, 2019.
ista: Mckenzie C, Spanova M, Johnson AJ, Kainrath S, Zheden V, Sitte HH, Janovjak
HL. 2019. Isolation of synaptic vesicles from genetically engineered cultured
neurons. Journal of Neuroscience Methods. 312, 114–121.
mla: Mckenzie, Catherine, et al. “Isolation of Synaptic Vesicles from Genetically
Engineered Cultured Neurons.” Journal of Neuroscience Methods, vol. 312,
Elsevier, 2019, pp. 114–21, doi:10.1016/j.jneumeth.2018.11.018.
short: C. Mckenzie, M. Spanova, A.J. Johnson, S. Kainrath, V. Zheden, H.H. Sitte,
H.L. Janovjak, Journal of Neuroscience Methods 312 (2019) 114–121.
date_created: 2020-01-30T09:12:19Z
date_published: 2019-01-15T00:00:00Z
date_updated: 2023-09-06T15:27:29Z
day: '15'
department:
- _id: HaJa
- _id: Bio
doi: 10.1016/j.jneumeth.2018.11.018
ec_funded: 1
external_id:
isi:
- '000456220900013'
pmid:
- '30496761'
intvolume: ' 312'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 114-121
pmid: 1
project:
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 26538374-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I03630
name: Molecular mechanisms of endocytic cargo recognition in plants
- _id: 2548AE96-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: W1232-B24
name: Molecular Drug Targets
publication: Journal of Neuroscience Methods
publication_identifier:
issn:
- 0165-0270
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Isolation of synaptic vesicles from genetically engineered cultured neurons
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 312
year: '2019'
...
---
_id: '7411'
abstract:
- lang: eng
text: "Proofs of sequential work (PoSW) are proof systems where a prover, upon receiving
a statement χ and a time parameter T computes a proof ϕ(χ,T) which is efficiently
and publicly verifiable. The proof can be computed in T sequential steps, but
not much less, even by a malicious party having large parallelism. A PoSW thus
serves as a proof that T units of time have passed since χ\r\n\r\nwas received.\r\n\r\nPoSW
were introduced by Mahmoody, Moran and Vadhan [MMV11], a simple and practical
construction was only recently proposed by Cohen and Pietrzak [CP18].\r\n\r\nIn
this work we construct a new simple PoSW in the random permutation model which
is almost as simple and efficient as [CP18] but conceptually very different. Whereas
the structure underlying [CP18] is a hash tree, our construction is based on skip
lists and has the interesting property that computing the PoSW is a reversible
computation.\r\nThe fact that the construction is reversible can potentially be
used for new applications like constructing proofs of replication. We also show
how to “embed” the sloth function of Lenstra and Weselowski [LW17] into our PoSW
to get a PoSW where one additionally can verify correctness of the output much
more efficiently than recomputing it (though recent constructions of “verifiable
delay functions” subsume most of the applications this construction was aiming
at)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Hamza M
full_name: Abusalah, Hamza M
id: 40297222-F248-11E8-B48F-1D18A9856A87
last_name: Abusalah
- 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: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michael
full_name: Walter, Michael
id: 488F98B0-F248-11E8-B48F-1D18A9856A87
last_name: Walter
orcid: 0000-0003-3186-2482
citation:
ama: 'Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible
proofs of sequential work. In: Advances in Cryptology – EUROCRYPT 2019.
Vol 11477. Springer International Publishing; 2019:277-291. doi:10.1007/978-3-030-17656-3_10'
apa: 'Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter,
M. (2019). Reversible proofs of sequential work. In Advances in Cryptology
– EUROCRYPT 2019 (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International
Publishing. https://doi.org/10.1007/978-3-030-17656-3_10'
chicago: Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak,
and Michael Walter. “Reversible Proofs of Sequential Work.” In Advances in
Cryptology – EUROCRYPT 2019, 11477:277–91. Springer International Publishing,
2019. https://doi.org/10.1007/978-3-030-17656-3_10.
ieee: H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter,
“Reversible proofs of sequential work,” in Advances in Cryptology – EUROCRYPT
2019, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.
ista: Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible
proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. International
Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol.
11477, 277–291.
mla: Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances
in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing,
2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.
short: H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:,
Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019,
pp. 277–291.
conference:
end_date: 2019-05-23
location: Darmstadt, Germany
name: International Conference on the Theory and Applications of Cryptographic Techniques
start_date: 2019-05-19
date_created: 2020-01-30T09:26:14Z
date_published: 2019-04-24T00:00:00Z
date_updated: 2023-09-06T15:26:06Z
day: '24'
department:
- _id: KrPi
doi: 10.1007/978-3-030-17656-3_10
ec_funded: 1
external_id:
isi:
- '000483516200010'
intvolume: ' 11477'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/252
month: '04'
oa: 1
oa_version: Submitted Version
page: 277-291
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication: Advances in Cryptology – EUROCRYPT 2019
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783030176556'
- '9783030176563'
issn:
- 0302-9743
publication_status: published
publisher: Springer International Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reversible proofs of sequential work
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11477
year: '2019'
...
---
_id: '7412'
abstract:
- lang: eng
text: We develop a framework for the rigorous analysis of focused stochastic local
search algorithms. These algorithms search a state space by repeatedly selecting
some constraint that is violated in the current state and moving to a random nearby
state that addresses the violation, while (we hope) not introducing many new violations.
An important class of focused local search algorithms with provable performance
guarantees has recently arisen from algorithmizations of the Lovász local lemma
(LLL), a nonconstructive tool for proving the existence of satisfying states by
introducing a background measure on the state space. While powerful, the state
transitions of algorithms in this class must be, in a precise sense, perfectly
compatible with the background measure. In many applications this is a very restrictive
requirement, and one needs to step outside the class. Here we introduce the notion
of measure distortion and develop a framework for analyzing arbitrary focused
stochastic local search algorithms, recovering LLL algorithmizations as the special
case of no distortion. Our framework takes as input an arbitrary algorithm of
such type and an arbitrary probability measure and shows how to use the measure
as a yardstick of algorithmic progress, even for algorithms designed independently
of the measure.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Dimitris
full_name: Achlioptas, Dimitris
last_name: Achlioptas
- first_name: Fotis
full_name: Iliopoulos, Fotis
last_name: Iliopoulos
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Achlioptas D, Iliopoulos F, Kolmogorov V. A local lemma for focused stochastical
algorithms. SIAM Journal on Computing. 2019;48(5):1583-1602. doi:10.1137/16m109332x
apa: Achlioptas, D., Iliopoulos, F., & Kolmogorov, V. (2019). A local lemma
for focused stochastical algorithms. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16m109332x
chicago: Achlioptas, Dimitris, Fotis Iliopoulos, and Vladimir Kolmogorov. “A Local
Lemma for Focused Stochastical Algorithms.” SIAM Journal on Computing.
SIAM, 2019. https://doi.org/10.1137/16m109332x.
ieee: D. Achlioptas, F. Iliopoulos, and V. Kolmogorov, “A local lemma for focused
stochastical algorithms,” SIAM Journal on Computing, vol. 48, no. 5. SIAM,
pp. 1583–1602, 2019.
ista: Achlioptas D, Iliopoulos F, Kolmogorov V. 2019. A local lemma for focused
stochastical algorithms. SIAM Journal on Computing. 48(5), 1583–1602.
mla: Achlioptas, Dimitris, et al. “A Local Lemma for Focused Stochastical Algorithms.”
SIAM Journal on Computing, vol. 48, no. 5, SIAM, 2019, pp. 1583–602, doi:10.1137/16m109332x.
short: D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48
(2019) 1583–1602.
date_created: 2020-01-30T09:27:32Z
date_published: 2019-10-31T00:00:00Z
date_updated: 2023-09-06T15:25:29Z
day: '31'
department:
- _id: VlKo
doi: 10.1137/16m109332x
ec_funded: 1
external_id:
arxiv:
- '1809.01537'
isi:
- '000493900200005'
intvolume: ' 48'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1809.01537
month: '10'
oa: 1
oa_version: Preprint
page: 1583-1602
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: SIAM
quality_controlled: '1'
scopus_import: '1'
status: public
title: A local lemma for focused stochastical algorithms
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 48
year: '2019'
...
---
_id: '7413'
abstract:
- lang: eng
text: We consider Bose gases consisting of N particles trapped in a box with volume
one and interacting through a repulsive potential with scattering length of order
N−1 (Gross–Pitaevskii regime). We determine the ground state energy and the low-energy
excitation spectrum, up to errors vanishing as N→∞. Our results confirm Bogoliubov’s
predictions.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chiara
full_name: Boccato, Chiara
id: 342E7E22-F248-11E8-B48F-1D18A9856A87
last_name: Boccato
- first_name: Christian
full_name: Brennecke, Christian
last_name: Brennecke
- first_name: Serena
full_name: Cenatiempo, Serena
last_name: Cenatiempo
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
citation:
ama: Boccato C, Brennecke C, Cenatiempo S, Schlein B. Bogoliubov theory in the Gross–Pitaevskii
limit. Acta Mathematica. 2019;222(2):219-335. doi:10.4310/acta.2019.v222.n2.a1
apa: Boccato, C., Brennecke, C., Cenatiempo, S., & Schlein, B. (2019). Bogoliubov
theory in the Gross–Pitaevskii limit. Acta Mathematica. International Press
of Boston. https://doi.org/10.4310/acta.2019.v222.n2.a1
chicago: Boccato, Chiara, Christian Brennecke, Serena Cenatiempo, and Benjamin Schlein.
“Bogoliubov Theory in the Gross–Pitaevskii Limit.” Acta Mathematica. International
Press of Boston, 2019. https://doi.org/10.4310/acta.2019.v222.n2.a1.
ieee: C. Boccato, C. Brennecke, S. Cenatiempo, and B. Schlein, “Bogoliubov theory
in the Gross–Pitaevskii limit,” Acta Mathematica, vol. 222, no. 2. International
Press of Boston, pp. 219–335, 2019.
ista: Boccato C, Brennecke C, Cenatiempo S, Schlein B. 2019. Bogoliubov theory in
the Gross–Pitaevskii limit. Acta Mathematica. 222(2), 219–335.
mla: Boccato, Chiara, et al. “Bogoliubov Theory in the Gross–Pitaevskii Limit.”
Acta Mathematica, vol. 222, no. 2, International Press of Boston, 2019,
pp. 219–335, doi:10.4310/acta.2019.v222.n2.a1.
short: C. Boccato, C. Brennecke, S. Cenatiempo, B. Schlein, Acta Mathematica 222
(2019) 219–335.
date_created: 2020-01-30T09:30:41Z
date_published: 2019-06-07T00:00:00Z
date_updated: 2023-09-06T15:24:31Z
day: '07'
department:
- _id: RoSe
doi: 10.4310/acta.2019.v222.n2.a1
external_id:
arxiv:
- '1801.01389'
isi:
- '000495865300001'
intvolume: ' 222'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1801.01389
month: '06'
oa: 1
oa_version: Preprint
page: 219-335
publication: Acta Mathematica
publication_identifier:
eissn:
- 1871-2509
issn:
- 0001-5962
publication_status: published
publisher: International Press of Boston
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bogoliubov theory in the Gross–Pitaevskii limit
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 222
year: '2019'
...
---
_id: '7414'
article_processing_charge: No
article_type: original
author:
- first_name: Lisa
full_name: Knaus, Lisa
id: 3B2ABCF4-F248-11E8-B48F-1D18A9856A87
last_name: Knaus
- first_name: Dora-Clara
full_name: Tarlungeanu, Dora-Clara
id: 2ABCE612-F248-11E8-B48F-1D18A9856A87
last_name: Tarlungeanu
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Knaus L, Tarlungeanu D-C, Novarino G. S.16.03 A homozygous missense mutation
in SLC7A5 leads to autism spectrum disorder and microcephaly. European Neuropsychopharmacology.
2019;29(Supplement 6):S11. doi:10.1016/j.euroneuro.2019.09.039
apa: Knaus, L., Tarlungeanu, D.-C., & Novarino, G. (2019). S.16.03 A homozygous
missense mutation in SLC7A5 leads to autism spectrum disorder and microcephaly.
European Neuropsychopharmacology. Elsevier. https://doi.org/10.1016/j.euroneuro.2019.09.039
chicago: Knaus, Lisa, Dora-Clara Tarlungeanu, and Gaia Novarino. “S.16.03 A Homozygous
Missense Mutation in SLC7A5 Leads to Autism Spectrum Disorder and Microcephaly.”
European Neuropsychopharmacology. Elsevier, 2019. https://doi.org/10.1016/j.euroneuro.2019.09.039.
ieee: L. Knaus, D.-C. Tarlungeanu, and G. Novarino, “S.16.03 A homozygous missense
mutation in SLC7A5 leads to autism spectrum disorder and microcephaly,” European
Neuropsychopharmacology, vol. 29, no. Supplement 6. Elsevier, p. S11, 2019.
ista: Knaus L, Tarlungeanu D-C, Novarino G. 2019. S.16.03 A homozygous missense
mutation in SLC7A5 leads to autism spectrum disorder and microcephaly. European
Neuropsychopharmacology. 29(Supplement 6), S11.
mla: Knaus, Lisa, et al. “S.16.03 A Homozygous Missense Mutation in SLC7A5 Leads
to Autism Spectrum Disorder and Microcephaly.” European Neuropsychopharmacology,
vol. 29, no. Supplement 6, Elsevier, 2019, p. S11, doi:10.1016/j.euroneuro.2019.09.039.
short: L. Knaus, D.-C. Tarlungeanu, G. Novarino, European Neuropsychopharmacology
29 (2019) S11.
date_created: 2020-01-30T10:06:15Z
date_published: 2019-12-13T00:00:00Z
date_updated: 2023-09-07T14:55:23Z
day: '13'
department:
- _id: GaNo
doi: 10.1016/j.euroneuro.2019.09.039
external_id:
isi:
- '000502657500020'
intvolume: ' 29'
isi: 1
issue: Supplement 6
language:
- iso: eng
month: '12'
oa_version: None
page: S11
publication: European Neuropsychopharmacology
publication_identifier:
issn:
- 0924-977X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: S.16.03 A homozygous missense mutation in SLC7A5 leads to autism spectrum disorder
and microcephaly
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 29
year: '2019'
...
---
_id: '7415'
article_processing_charge: No
article_type: original
author:
- first_name: Jasmin
full_name: Morandell, Jasmin
id: 4739D480-F248-11E8-B48F-1D18A9856A87
last_name: Morandell
- first_name: Armel
full_name: Nicolas, Armel
id: 2A103192-F248-11E8-B48F-1D18A9856A87
last_name: Nicolas
- first_name: Lena A
full_name: Schwarz, Lena A
id: 29A8453C-F248-11E8-B48F-1D18A9856A87
last_name: Schwarz
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
citation:
ama: Morandell J, Nicolas A, Schwarz LA, Novarino G. S.16.05 Illuminating the role
of the e3 ubiquitin ligase cullin3 in brain development and autism. European
Neuropsychopharmacology. 2019;29(Supplement 6):S11-S12. doi:10.1016/j.euroneuro.2019.09.040
apa: Morandell, J., Nicolas, A., Schwarz, L. A., & Novarino, G. (2019). S.16.05
Illuminating the role of the e3 ubiquitin ligase cullin3 in brain development
and autism. European Neuropsychopharmacology. Elsevier. https://doi.org/10.1016/j.euroneuro.2019.09.040
chicago: Morandell, Jasmin, Armel Nicolas, Lena A Schwarz, and Gaia Novarino. “S.16.05
Illuminating the Role of the E3 Ubiquitin Ligase Cullin3 in Brain Development
and Autism.” European Neuropsychopharmacology. Elsevier, 2019. https://doi.org/10.1016/j.euroneuro.2019.09.040.
ieee: J. Morandell, A. Nicolas, L. A. Schwarz, and G. Novarino, “S.16.05 Illuminating
the role of the e3 ubiquitin ligase cullin3 in brain development and autism,”
European Neuropsychopharmacology, vol. 29, no. Supplement 6. Elsevier,
pp. S11–S12, 2019.
ista: Morandell J, Nicolas A, Schwarz LA, Novarino G. 2019. S.16.05 Illuminating
the role of the e3 ubiquitin ligase cullin3 in brain development and autism. European
Neuropsychopharmacology. 29(Supplement 6), S11–S12.
mla: Morandell, Jasmin, et al. “S.16.05 Illuminating the Role of the E3 Ubiquitin
Ligase Cullin3 in Brain Development and Autism.” European Neuropsychopharmacology,
vol. 29, no. Supplement 6, Elsevier, 2019, pp. S11–12, doi:10.1016/j.euroneuro.2019.09.040.
short: J. Morandell, A. Nicolas, L.A. Schwarz, G. Novarino, European Neuropsychopharmacology
29 (2019) S11–S12.
date_created: 2020-01-30T10:07:41Z
date_published: 2019-12-13T00:00:00Z
date_updated: 2023-09-07T14:56:17Z
day: '13'
department:
- _id: GaNo
- _id: LifeSc
doi: 10.1016/j.euroneuro.2019.09.040
external_id:
isi:
- '000502657500021'
intvolume: ' 29'
isi: 1
issue: Supplement 6
language:
- iso: eng
month: '12'
oa_version: None
page: S11-S12
publication: European Neuropsychopharmacology
publication_identifier:
issn:
- 0924-977X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: S.16.05 Illuminating the role of the e3 ubiquitin ligase cullin3 in brain development
and autism
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 29
year: '2019'
...
---
_id: '7418'
abstract:
- lang: eng
text: Multiple importance sampling (MIS) has become an indispensable tool in Monte
Carlo rendering, widely accepted as a near-optimal solution for combining different
sampling techniques. But an MIS combination, using the common balance or power
heuristics, often results in an overly defensive estimator, leading to high variance.
We show that by generalizing the MIS framework, variance can be substantially
reduced. Specifically, we optimize one of the combined sampling techniques so
as to decrease the overall variance of the resulting MIS estimator. We apply the
approach to the computation of direct illumination due to an HDR environment map
and to the computation of global illumination using a path guiding algorithm.
The implementation can be as simple as subtracting a constant value from the tabulated
sampling density done entirely in a preprocessing step. This produces a consistent
noise reduction in all our tests with no negative influence on run time, no artifacts
or bias, and no failure cases.
article_number: '151'
article_processing_charge: No
article_type: original
author:
- first_name: Ondřej
full_name: Karlík, Ondřej
last_name: Karlík
- first_name: Martin
full_name: Šik, Martin
last_name: Šik
- first_name: Petr
full_name: Vévoda, Petr
last_name: Vévoda
- first_name: Tomas
full_name: Skrivan, Tomas
id: 486A5A46-F248-11E8-B48F-1D18A9856A87
last_name: Skrivan
- first_name: Jaroslav
full_name: Křivánek, Jaroslav
last_name: Křivánek
citation:
ama: 'Karlík O, Šik M, Vévoda P, Skrivan T, Křivánek J. MIS compensation: Optimizing
sampling techniques in multiple importance sampling. ACM Transactions on Graphics.
2019;38(6). doi:10.1145/3355089.3356565'
apa: 'Karlík, O., Šik, M., Vévoda, P., Skrivan, T., & Křivánek, J. (2019). MIS
compensation: Optimizing sampling techniques in multiple importance sampling.
ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356565'
chicago: 'Karlík, Ondřej, Martin Šik, Petr Vévoda, Tomas Skrivan, and Jaroslav Křivánek.
“MIS Compensation: Optimizing Sampling Techniques in Multiple Importance Sampling.”
ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356565.'
ieee: 'O. Karlík, M. Šik, P. Vévoda, T. Skrivan, and J. Křivánek, “MIS compensation:
Optimizing sampling techniques in multiple importance sampling,” ACM Transactions
on Graphics, vol. 38, no. 6. ACM, 2019.'
ista: 'Karlík O, Šik M, Vévoda P, Skrivan T, Křivánek J. 2019. MIS compensation:
Optimizing sampling techniques in multiple importance sampling. ACM Transactions
on Graphics. 38(6), 151.'
mla: 'Karlík, Ondřej, et al. “MIS Compensation: Optimizing Sampling Techniques in
Multiple Importance Sampling.” ACM Transactions on Graphics, vol. 38, no.
6, 151, ACM, 2019, doi:10.1145/3355089.3356565.'
short: O. Karlík, M. Šik, P. Vévoda, T. Skrivan, J. Křivánek, ACM Transactions on
Graphics 38 (2019).
date_created: 2020-01-30T10:19:43Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2023-09-06T15:22:23Z
day: '01'
department:
- _id: ChWo
doi: 10.1145/3355089.3356565
external_id:
isi:
- '000498397300001'
intvolume: ' 38'
isi: 1
issue: '6'
language:
- iso: eng
month: '11'
oa_version: None
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: ACM
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'MIS compensation: Optimizing sampling techniques in multiple importance sampling'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 38
year: '2019'
...
---
_id: '7420'
abstract:
- lang: eng
text: β1-integrins mediate cell–matrix interactions and their trafficking is important
in the dynamic regulation of cell adhesion, migration and malignant processes,
including cancer cell invasion. Here, we employ an RNAi screen to characterize
regulators of integrin traffic and identify the association of Golgi-localized
gamma ear-containing Arf-binding protein 2 (GGA2) with β1-integrin, and its role
in recycling of active but not inactive β1-integrin receptors. Silencing of GGA2
limits active β1-integrin levels in focal adhesions and decreases cancer cell
migration and invasion, which is in agreement with its ability to regulate the
dynamics of active integrins. By using the proximity-dependent biotin identification
(BioID) method, we identified two RAB family small GTPases, i.e. RAB13 and RAB10,
as novel interactors of GGA2. Functionally, RAB13 silencing triggers the intracellular
accumulation of active β1-integrin, and reduces integrin activity in focal adhesions
and cell migration similarly to GGA2 depletion, indicating that both facilitate
active β1-integrin recycling to the plasma membrane. Thus, GGA2 and RAB13 are
important specificity determinants for integrin activity-dependent traffic.
article_number: jcs233387
article_processing_charge: No
article_type: original
author:
- first_name: Pranshu
full_name: Sahgal, Pranshu
last_name: Sahgal
- first_name: Jonna H
full_name: Alanko, Jonna H
id: 2CC12E8C-F248-11E8-B48F-1D18A9856A87
last_name: Alanko
orcid: 0000-0002-7698-3061
- first_name: Jaroslav
full_name: Icha, Jaroslav
last_name: Icha
- first_name: Ilkka
full_name: Paatero, Ilkka
last_name: Paatero
- first_name: Hellyeh
full_name: Hamidi, Hellyeh
last_name: Hamidi
- first_name: Antti
full_name: Arjonen, Antti
last_name: Arjonen
- first_name: Mika
full_name: Pietilä, Mika
last_name: Pietilä
- first_name: Anne
full_name: Rokka, Anne
last_name: Rokka
- first_name: Johanna
full_name: Ivaska, Johanna
last_name: Ivaska
citation:
ama: Sahgal P, Alanko JH, Icha J, et al. GGA2 and RAB13 promote activity-dependent
β1-integrin recycling. Journal of Cell Science. 2019;132(11). doi:10.1242/jcs.233387
apa: Sahgal, P., Alanko, J. H., Icha, J., Paatero, I., Hamidi, H., Arjonen, A.,
… Ivaska, J. (2019). GGA2 and RAB13 promote activity-dependent β1-integrin recycling.
Journal of Cell Science. The Company of Biologists. https://doi.org/10.1242/jcs.233387
chicago: Sahgal, Pranshu, Jonna H Alanko, Jaroslav Icha, Ilkka Paatero, Hellyeh
Hamidi, Antti Arjonen, Mika Pietilä, Anne Rokka, and Johanna Ivaska. “GGA2 and
RAB13 Promote Activity-Dependent Β1-Integrin Recycling.” Journal of Cell Science.
The Company of Biologists, 2019. https://doi.org/10.1242/jcs.233387.
ieee: P. Sahgal et al., “GGA2 and RAB13 promote activity-dependent β1-integrin
recycling,” Journal of Cell Science, vol. 132, no. 11. The Company of Biologists,
2019.
ista: Sahgal P, Alanko JH, Icha J, Paatero I, Hamidi H, Arjonen A, Pietilä M, Rokka
A, Ivaska J. 2019. GGA2 and RAB13 promote activity-dependent β1-integrin recycling.
Journal of Cell Science. 132(11), jcs233387.
mla: Sahgal, Pranshu, et al. “GGA2 and RAB13 Promote Activity-Dependent Β1-Integrin
Recycling.” Journal of Cell Science, vol. 132, no. 11, jcs233387, The Company
of Biologists, 2019, doi:10.1242/jcs.233387.
short: P. Sahgal, J.H. Alanko, J. Icha, I. Paatero, H. Hamidi, A. Arjonen, M. Pietilä,
A. Rokka, J. Ivaska, Journal of Cell Science 132 (2019).
date_created: 2020-01-30T10:31:42Z
date_published: 2019-06-07T00:00:00Z
date_updated: 2023-09-06T15:01:00Z
day: '07'
department:
- _id: MiSi
doi: 10.1242/jcs.233387
external_id:
isi:
- '000473327900017'
pmid:
- '31076515'
intvolume: ' 132'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1242/jcs.233387
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
publication: Journal of Cell Science
publication_identifier:
eissn:
- 1477-9137
issn:
- 0021-9533
publication_status: published
publisher: The Company of Biologists
quality_controlled: '1'
status: public
title: GGA2 and RAB13 promote activity-dependent β1-integrin recycling
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 132
year: '2019'
...
---
_id: '7421'
abstract:
- lang: eng
text: X and Y chromosomes can diverge when rearrangements block recombination between
them. Here we present the first genomic view of a reciprocal translocation that
causes two physically unconnected pairs of chromosomes to be coinherited as sex
chromosomes. In a population of the common frog (Rana temporaria), both pairs
of X and Y chromosomes show extensive sequence differentiation, but not degeneration
of the Y chromosomes. A new method based on gene trees shows both chromosomes
are sex‐linked. Furthermore, the gene trees from the two Y chromosomes have identical
topologies, showing they have been coinherited since the reciprocal translocation
occurred. Reciprocal translocations can thus reshape sex linkage on a much greater
scale compared with inversions, the type of rearrangement that is much better
known in sex chromosome evolution, and they can greatly amplify the power of sexually
antagonistic selection to drive genomic rearrangement. Two more populations show
evidence of other rearrangements, suggesting that this species has unprecedented
structural polymorphism in its sex chromosomes.
article_processing_charge: No
article_type: original
author:
- first_name: Melissa A
full_name: Toups, Melissa A
id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
last_name: Toups
orcid: 0000-0002-9752-7380
- first_name: Nicolas
full_name: Rodrigues, Nicolas
last_name: Rodrigues
- first_name: Nicolas
full_name: Perrin, Nicolas
last_name: Perrin
- first_name: Mark
full_name: Kirkpatrick, Mark
last_name: Kirkpatrick
citation:
ama: Toups MA, Rodrigues N, Perrin N, Kirkpatrick M. A reciprocal translocation
radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology.
2019;28(8):1877-1889. doi:10.1111/mec.14990
apa: Toups, M. A., Rodrigues, N., Perrin, N., & Kirkpatrick, M. (2019). A reciprocal
translocation radically reshapes sex‐linked inheritance in the common frog. Molecular
Ecology. Wiley. https://doi.org/10.1111/mec.14990
chicago: Toups, Melissa A, Nicolas Rodrigues, Nicolas Perrin, and Mark Kirkpatrick.
“A Reciprocal Translocation Radically Reshapes Sex‐linked Inheritance in the Common
Frog.” Molecular Ecology. Wiley, 2019. https://doi.org/10.1111/mec.14990.
ieee: M. A. Toups, N. Rodrigues, N. Perrin, and M. Kirkpatrick, “A reciprocal translocation
radically reshapes sex‐linked inheritance in the common frog,” Molecular Ecology,
vol. 28, no. 8. Wiley, pp. 1877–1889, 2019.
ista: Toups MA, Rodrigues N, Perrin N, Kirkpatrick M. 2019. A reciprocal translocation
radically reshapes sex‐linked inheritance in the common frog. Molecular Ecology.
28(8), 1877–1889.
mla: Toups, Melissa A., et al. “A Reciprocal Translocation Radically Reshapes Sex‐linked
Inheritance in the Common Frog.” Molecular Ecology, vol. 28, no. 8, Wiley,
2019, pp. 1877–89, doi:10.1111/mec.14990.
short: M.A. Toups, N. Rodrigues, N. Perrin, M. Kirkpatrick, Molecular Ecology 28
(2019) 1877–1889.
date_created: 2020-01-30T10:33:05Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2023-09-06T15:00:13Z
day: '01'
department:
- _id: BeVi
doi: 10.1111/mec.14990
external_id:
isi:
- '000468200800004'
pmid:
- '30576024'
intvolume: ' 28'
isi: 1
issue: '8'
language:
- iso: eng
month: '04'
oa_version: None
page: 1877-1889
pmid: 1
publication: Molecular Ecology
publication_identifier:
eissn:
- 1365-294X
issn:
- 0962-1083
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: A reciprocal translocation radically reshapes sex‐linked inheritance in the
common frog
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 28
year: '2019'
...
---
_id: '7422'
abstract:
- lang: eng
text: Biochemical reactions often occur at low copy numbers but at once in crowded
and diverse environments. Space and stochasticity therefore play an essential
role in biochemical networks. Spatial-stochastic simulations have become a prominent
tool for understanding how stochasticity at the microscopic level influences the
macroscopic behavior of such systems. While particle-based models guarantee the
level of detail necessary to accurately describe the microscopic dynamics at very
low copy numbers, the algorithms used to simulate them typically imply trade-offs
between computational efficiency and biochemical accuracy. eGFRD (enhanced Green’s
Function Reaction Dynamics) is an exact algorithm that evades such trade-offs
by partitioning the N-particle system into M ≤ N analytically tractable one- and
two-particle systems; the analytical solutions (Green’s functions) then are used
to implement an event-driven particle-based scheme that allows particles to make
large jumps in time and space while retaining access to their state variables
at arbitrary simulation times. Here we present “eGFRD2,” a new eGFRD version that
implements the principle of eGFRD in all dimensions, thus enabling efficient particle-based
simulation of biochemical reaction-diffusion processes in the 3D cytoplasm, on
2D planes representing membranes, and on 1D elongated cylinders representative
of, e.g., cytoskeletal tracks or DNA; in 1D, it also incorporates convective motion
used to model active transport. We find that, for low particle densities, eGFRD2
is up to 6 orders of magnitude faster than conventional Brownian dynamics. We
exemplify the capabilities of eGFRD2 by simulating an idealized model of Pom1
gradient formation, which involves 3D diffusion, active transport on microtubules,
and autophosphorylation on the membrane, confirming recent experimental and theoretical
results on this system to hold under genuinely stochastic conditions.
article_number: '054108'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Thomas R
full_name: Sokolowski, Thomas R
id: 3E999752-F248-11E8-B48F-1D18A9856A87
last_name: Sokolowski
orcid: 0000-0002-1287-3779
- first_name: Joris
full_name: Paijmans, Joris
last_name: Paijmans
- first_name: Laurens
full_name: Bossen, Laurens
last_name: Bossen
- first_name: Thomas
full_name: Miedema, Thomas
last_name: Miedema
- first_name: Martijn
full_name: Wehrens, Martijn
last_name: Wehrens
- first_name: Nils B.
full_name: Becker, Nils B.
last_name: Becker
- first_name: Kazunari
full_name: Kaizu, Kazunari
last_name: Kaizu
- first_name: Koichi
full_name: Takahashi, Koichi
last_name: Takahashi
- first_name: Marileen
full_name: Dogterom, Marileen
last_name: Dogterom
- first_name: Pieter Rein
full_name: ten Wolde, Pieter Rein
last_name: ten Wolde
citation:
ama: Sokolowski TR, Paijmans J, Bossen L, et al. eGFRD in all dimensions. The
Journal of Chemical Physics. 2019;150(5). doi:10.1063/1.5064867
apa: Sokolowski, T. R., Paijmans, J., Bossen, L., Miedema, T., Wehrens, M., Becker,
N. B., … ten Wolde, P. R. (2019). eGFRD in all dimensions. The Journal of Chemical
Physics. AIP Publishing. https://doi.org/10.1063/1.5064867
chicago: Sokolowski, Thomas R, Joris Paijmans, Laurens Bossen, Thomas Miedema, Martijn
Wehrens, Nils B. Becker, Kazunari Kaizu, Koichi Takahashi, Marileen Dogterom,
and Pieter Rein ten Wolde. “EGFRD in All Dimensions.” The Journal of Chemical
Physics. AIP Publishing, 2019. https://doi.org/10.1063/1.5064867.
ieee: T. R. Sokolowski et al., “eGFRD in all dimensions,” The Journal
of Chemical Physics, vol. 150, no. 5. AIP Publishing, 2019.
ista: Sokolowski TR, Paijmans J, Bossen L, Miedema T, Wehrens M, Becker NB, Kaizu
K, Takahashi K, Dogterom M, ten Wolde PR. 2019. eGFRD in all dimensions. The Journal
of Chemical Physics. 150(5), 054108.
mla: Sokolowski, Thomas R., et al. “EGFRD in All Dimensions.” The Journal of
Chemical Physics, vol. 150, no. 5, 054108, AIP Publishing, 2019, doi:10.1063/1.5064867.
short: T.R. Sokolowski, J. Paijmans, L. Bossen, T. Miedema, M. Wehrens, N.B. Becker,
K. Kaizu, K. Takahashi, M. Dogterom, P.R. ten Wolde, The Journal of Chemical Physics
150 (2019).
date_created: 2020-01-30T10:34:36Z
date_published: 2019-02-07T00:00:00Z
date_updated: 2023-09-06T14:59:28Z
day: '07'
department:
- _id: GaTk
doi: 10.1063/1.5064867
external_id:
arxiv:
- '1708.09364'
isi:
- '000458109300009'
intvolume: ' 150'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.09364
month: '02'
oa: 1
oa_version: Preprint
publication: The Journal of Chemical Physics
publication_identifier:
eissn:
- 1089-7690
issn:
- 0021-9606
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
status: public
title: eGFRD in all dimensions
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 150
year: '2019'
...
---
_id: '7423'
abstract:
- lang: eng
text: 'We compare finite rank perturbations of the following three ensembles of
complex rectangular random matrices: First, a generalised Wishart ensemble with
one random and two fixed correlation matrices introduced by Borodin and Péché,
second, the product of two independent random matrices where one has correlated
entries, and third, the case when the two random matrices become also coupled
through a fixed matrix. The singular value statistics of all three ensembles is
shown to be determinantal and we derive double contour integral representations
for their respective kernels. Three different kernels are found in the limit of
infinite matrix dimension at the origin of the spectrum. They depend on finite
rank perturbations of the correlation and coupling matrices and are shown to be
integrable. The first kernel (I) is found for two independent matrices from the
second, and two weakly coupled matrices from the third ensemble. It generalises
the Meijer G-kernel for two independent and uncorrelated matrices. The third kernel
(III) is obtained for the generalised Wishart ensemble and for two strongly coupled
matrices. It further generalises the perturbed Bessel kernel of Desrosiers and
Forrester. Finally, kernel (II), found for the ensemble of two coupled matrices,
provides an interpolation between the kernels (I) and (III), generalising previous
findings of part of the authors.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gernot
full_name: Akemann, Gernot
last_name: Akemann
- first_name: Tomasz
full_name: Checinski, Tomasz
last_name: Checinski
- first_name: Dangzheng
full_name: Liu, Dangzheng
id: 2F947E34-F248-11E8-B48F-1D18A9856A87
last_name: Liu
- first_name: Eugene
full_name: Strahov, Eugene
last_name: Strahov
citation:
ama: 'Akemann G, Checinski T, Liu D, Strahov E. Finite rank perturbations in products
of coupled random matrices: From one correlated to two Wishart ensembles. Annales
de l’Institut Henri Poincaré, Probabilités et Statistiques. 2019;55(1):441-479.
doi:10.1214/18-aihp888'
apa: 'Akemann, G., Checinski, T., Liu, D., & Strahov, E. (2019). Finite rank
perturbations in products of coupled random matrices: From one correlated to two
Wishart ensembles. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques.
Institute of Mathematical Statistics. https://doi.org/10.1214/18-aihp888'
chicago: 'Akemann, Gernot, Tomasz Checinski, Dangzheng Liu, and Eugene Strahov.
“Finite Rank Perturbations in Products of Coupled Random Matrices: From One Correlated
to Two Wishart Ensembles.” Annales de l’Institut Henri Poincaré, Probabilités
et Statistiques. Institute of Mathematical Statistics, 2019. https://doi.org/10.1214/18-aihp888.'
ieee: 'G. Akemann, T. Checinski, D. Liu, and E. Strahov, “Finite rank perturbations
in products of coupled random matrices: From one correlated to two Wishart ensembles,”
Annales de l’Institut Henri Poincaré, Probabilités et Statistiques, vol.
55, no. 1. Institute of Mathematical Statistics, pp. 441–479, 2019.'
ista: 'Akemann G, Checinski T, Liu D, Strahov E. 2019. Finite rank perturbations
in products of coupled random matrices: From one correlated to two Wishart ensembles.
Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. 55(1), 441–479.'
mla: 'Akemann, Gernot, et al. “Finite Rank Perturbations in Products of Coupled
Random Matrices: From One Correlated to Two Wishart Ensembles.” Annales de
l’Institut Henri Poincaré, Probabilités et Statistiques, vol. 55, no. 1, Institute
of Mathematical Statistics, 2019, pp. 441–79, doi:10.1214/18-aihp888.'
short: G. Akemann, T. Checinski, D. Liu, E. Strahov, Annales de l’Institut Henri
Poincaré, Probabilités et Statistiques 55 (2019) 441–479.
date_created: 2020-01-30T10:36:50Z
date_published: 2019-02-01T00:00:00Z
date_updated: 2023-09-06T14:58:39Z
day: '01'
department:
- _id: LaEr
doi: 10.1214/18-aihp888
external_id:
arxiv:
- '1704.05224'
isi:
- '000456070200013'
intvolume: ' 55'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.05224
month: '02'
oa: 1
oa_version: Preprint
page: 441-479
publication: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
publication_identifier:
issn:
- 0246-0203
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
status: public
title: 'Finite rank perturbations in products of coupled random matrices: From one
correlated to two Wishart ensembles'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 55
year: '2019'
...
---
_id: '7436'
abstract:
- lang: eng
text: 'For an ordinary K3 surface over an algebraically closed field of positive
characteristic we show that every automorphism lifts to characteristic zero. Moreover,
we show that the Fourier-Mukai partners of an ordinary K3 surface are in one-to-one
correspondence with the Fourier-Mukai partners of the geometric generic fiber
of its canonical lift. We also prove that the explicit counting formula for Fourier-Mukai
partners of the K3 surfaces with Picard rank two and with discriminant equal to
minus of a prime number, in terms of the class number of the prime, holds over
a field of positive characteristic as well. We show that the image of the derived
autoequivalence group of a K3 surface of finite height in the group of isometries
of its crystalline cohomology has index at least two. Moreover, we provide a conditional
upper bound on the kernel of this natural cohomological descent map. Further,
we give an extended remark in the appendix on the possibility of an F-crystal
structure on the crystalline cohomology of a K3 surface over an algebraically
closed field of positive characteristic and show that the naive F-crystal structure
fails in being compatible with inner product. '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tanya K
full_name: Srivastava, Tanya K
id: 4D046628-F248-11E8-B48F-1D18A9856A87
last_name: Srivastava
citation:
ama: Srivastava TK. On derived equivalences of k3 surfaces in positive characteristic.
Documenta Mathematica. 2019;24:1135-1177. doi:10.25537/dm.2019v24.1135-1177
apa: Srivastava, T. K. (2019). On derived equivalences of k3 surfaces in positive
characteristic. Documenta Mathematica. EMS Press. https://doi.org/10.25537/dm.2019v24.1135-1177
chicago: Srivastava, Tanya K. “On Derived Equivalences of K3 Surfaces in Positive
Characteristic.” Documenta Mathematica. EMS Press, 2019. https://doi.org/10.25537/dm.2019v24.1135-1177.
ieee: T. K. Srivastava, “On derived equivalences of k3 surfaces in positive characteristic,”
Documenta Mathematica, vol. 24. EMS Press, pp. 1135–1177, 2019.
ista: Srivastava TK. 2019. On derived equivalences of k3 surfaces in positive characteristic.
Documenta Mathematica. 24, 1135–1177.
mla: Srivastava, Tanya K. “On Derived Equivalences of K3 Surfaces in Positive Characteristic.”
Documenta Mathematica, vol. 24, EMS Press, 2019, pp. 1135–77, doi:10.25537/dm.2019v24.1135-1177.
short: T.K. Srivastava, Documenta Mathematica 24 (2019) 1135–1177.
date_created: 2020-02-02T23:01:06Z
date_published: 2019-05-20T00:00:00Z
date_updated: 2023-10-17T07:42:21Z
day: '20'
ddc:
- '510'
department:
- _id: TaHa
doi: 10.25537/dm.2019v24.1135-1177
external_id:
arxiv:
- '1809.08970'
isi:
- '000517806400019'
file:
- access_level: open_access
checksum: 9a1a64bd49ab03fa4f738fb250fc4f90
content_type: application/pdf
creator: dernst
date_created: 2020-02-03T06:26:12Z
date_updated: 2020-07-14T12:47:58Z
file_id: '7438'
file_name: 2019_DocumMath_Srivastava.pdf
file_size: 469730
relation: main_file
file_date_updated: 2020-07-14T12:47:58Z
has_accepted_license: '1'
intvolume: ' 24'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1135-1177
publication: Documenta Mathematica
publication_identifier:
eissn:
- 1431-0643
issn:
- 1431-0635
publication_status: published
publisher: EMS Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: On derived equivalences of k3 surfaces in positive characteristic
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: 24
year: '2019'
...
---
_id: '7437'
abstract:
- lang: eng
text: 'Most of today''s distributed machine learning systems assume reliable networks:
whenever two machines exchange information (e.g., gradients or models), the network
should guarantee the delivery of the message. At the same time, recent work exhibits
the impressive tolerance of machine learning algorithms to errors or noise arising
from relaxed communication or synchronization. In this paper, we connect these
two trends, and consider the following question: Can we design machine learning
systems that are tolerant to network unreliability during training? With this
motivation, we focus on a theoretical problem of independent interest-given a
standard distributed parameter server architecture, if every communication between
the worker and the server has a non-zero probability p of being dropped, does
there exist an algorithm that still converges, and at what speed? The technical
contribution of this paper is a novel theoretical analysis proving that distributed
learning over unreliable network can achieve comparable convergence rate to centralized
or distributed learning over reliable networks. Further, we prove that the influence
of the packet drop rate diminishes with the growth of the number of parameter
servers. We map this theoretical result onto a real-world scenario, training deep
neural networks over an unreliable network layer, and conduct network simulation
to validate the system improvement by allowing the networks to be unreliable.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Chen
full_name: Yu, Chen
last_name: Yu
- first_name: Hanlin
full_name: Tang, Hanlin
last_name: Tang
- first_name: Cedric
full_name: Renggli, Cedric
last_name: Renggli
- first_name: Simon
full_name: Kassing, Simon
last_name: Kassing
- first_name: Ankit
full_name: Singla, Ankit
last_name: Singla
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Ce
full_name: Zhang, Ce
last_name: Zhang
- first_name: Ji
full_name: Liu, Ji
last_name: Liu
citation:
ama: 'Yu C, Tang H, Renggli C, et al. Distributed learning over unreliable networks.
In: 36th International Conference on Machine Learning, ICML 2019. Vol 2019-June.
IMLS; 2019:12481-12512.'
apa: 'Yu, C., Tang, H., Renggli, C., Kassing, S., Singla, A., Alistarh, D.-A., …
Liu, J. (2019). Distributed learning over unreliable networks. In 36th International
Conference on Machine Learning, ICML 2019 (Vol. 2019–June, pp. 12481–12512).
Long Beach, CA, United States: IMLS.'
chicago: Yu, Chen, Hanlin Tang, Cedric Renggli, Simon Kassing, Ankit Singla, Dan-Adrian
Alistarh, Ce Zhang, and Ji Liu. “Distributed Learning over Unreliable Networks.”
In 36th International Conference on Machine Learning, ICML 2019, 2019–June:12481–512.
IMLS, 2019.
ieee: C. Yu et al., “Distributed learning over unreliable networks,” in 36th
International Conference on Machine Learning, ICML 2019, Long Beach, CA, United
States, 2019, vol. 2019–June, pp. 12481–12512.
ista: 'Yu C, Tang H, Renggli C, Kassing S, Singla A, Alistarh D-A, Zhang C, Liu
J. 2019. Distributed learning over unreliable networks. 36th International Conference
on Machine Learning, ICML 2019. ICML: International Conference on Machine Learning
vol. 2019–June, 12481–12512.'
mla: Yu, Chen, et al. “Distributed Learning over Unreliable Networks.” 36th International
Conference on Machine Learning, ICML 2019, vol. 2019–June, IMLS, 2019, pp.
12481–512.
short: C. Yu, H. Tang, C. Renggli, S. Kassing, A. Singla, D.-A. Alistarh, C. Zhang,
J. Liu, in:, 36th International Conference on Machine Learning, ICML 2019, IMLS,
2019, pp. 12481–12512.
conference:
end_date: 2019-06-15
location: Long Beach, CA, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2019-06-10
date_created: 2020-02-02T23:01:06Z
date_published: 2019-06-01T00:00:00Z
date_updated: 2023-09-06T15:21:48Z
day: '01'
department:
- _id: DaAl
external_id:
arxiv:
- '1810.07766'
isi:
- '000684034307036'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1810.07766
month: '06'
oa: 1
oa_version: Preprint
page: 12481-12512
publication: 36th International Conference on Machine Learning, ICML 2019
publication_identifier:
isbn:
- '9781510886988'
publication_status: published
publisher: IMLS
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distributed learning over unreliable networks
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2019-June
year: '2019'
...
---
_id: '7451'
abstract:
- lang: eng
text: We prove that the observable telegraph signal accompanying the bistability
in the photon-blockade-breakdown regime of the driven and lossy Jaynes–Cummings
model is the finite-size precursor of what in the thermodynamic limit is a genuine
first-order phase transition. We construct a finite-size scaling of the system
parameters to a well-defined thermodynamic limit, in which the system remains
the same microscopic system, but the telegraph signal becomes macroscopic both
in its timescale and intensity. The existence of such a finite-size scaling completes
and justifies the classification of the photon-blockade-breakdown effect as a
first-order dissipative quantum phase transition.
article_number: '150'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: A.
full_name: Vukics, A.
last_name: Vukics
- first_name: A.
full_name: Dombi, A.
last_name: Dombi
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: P.
full_name: Domokos, P.
last_name: Domokos
citation:
ama: Vukics A, Dombi A, Fink JM, Domokos P. Finite-size scaling of the photon-blockade
breakdown dissipative quantum phase transition. Quantum. 2019;3. doi:10.22331/q-2019-06-03-150
apa: Vukics, A., Dombi, A., Fink, J. M., & Domokos, P. (2019). Finite-size scaling
of the photon-blockade breakdown dissipative quantum phase transition. Quantum.
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften.
https://doi.org/10.22331/q-2019-06-03-150
chicago: Vukics, A., A. Dombi, Johannes M Fink, and P. Domokos. “Finite-Size Scaling
of the Photon-Blockade Breakdown Dissipative Quantum Phase Transition.” Quantum.
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften,
2019. https://doi.org/10.22331/q-2019-06-03-150.
ieee: A. Vukics, A. Dombi, J. M. Fink, and P. Domokos, “Finite-size scaling of the
photon-blockade breakdown dissipative quantum phase transition,” Quantum,
vol. 3. Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften,
2019.
ista: Vukics A, Dombi A, Fink JM, Domokos P. 2019. Finite-size scaling of the photon-blockade
breakdown dissipative quantum phase transition. Quantum. 3, 150.
mla: Vukics, A., et al. “Finite-Size Scaling of the Photon-Blockade Breakdown Dissipative
Quantum Phase Transition.” Quantum, vol. 3, 150, Verein zur Förderung des
Open Access Publizierens in den Quantenwissenschaften, 2019, doi:10.22331/q-2019-06-03-150.
short: A. Vukics, A. Dombi, J.M. Fink, P. Domokos, Quantum 3 (2019).
date_created: 2020-02-05T09:57:57Z
date_published: 2019-06-03T00:00:00Z
date_updated: 2023-09-07T14:57:39Z
day: '03'
ddc:
- '530'
department:
- _id: JoFi
doi: 10.22331/q-2019-06-03-150
external_id:
arxiv:
- '1809.09737'
isi:
- '000469987500004'
file:
- access_level: open_access
checksum: 26b9ba8f0155d183f1ee55295934a17f
content_type: application/pdf
creator: dernst
date_created: 2020-02-11T09:25:23Z
date_updated: 2020-07-14T12:47:58Z
file_id: '7483'
file_name: 2019_Quantum_Vukics.pdf
file_size: 5805248
relation: main_file
file_date_updated: 2020-07-14T12:47:58Z
has_accepted_license: '1'
intvolume: ' 3'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Quantum
publication_identifier:
issn:
- 2521-327X
publication_status: published
publisher: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
quality_controlled: '1'
status: public
title: Finite-size scaling of the photon-blockade breakdown dissipative quantum phase
transition
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: 3
year: '2019'
...