---
_id: '7214'
abstract:
- lang: eng
text: "Background: Many cancer genomes are extensively rearranged with highly aberrant
chromosomal karyotypes. Structural and copy number variations in cancer genomes
can be determined via abnormal mapping of sequenced reads to the reference genome.
Recently it became possible to reconcile both of these types of large-scale variations
into a karyotype graph representation of the rearranged cancer genomes. Such a
representation, however, does not directly describe the linear and/or circular
structure of the underlying rearranged cancer chromosomes, thus limiting possible
analysis of cancer genomes somatic evolutionary process as well as functional
genomic changes brought by the large-scale genome rearrangements.\r\n\r\nResults:
Here we address the aforementioned limitation by introducing a novel methodological
framework for recovering rearranged cancer chromosomes from karyotype graphs.
For a cancer karyotype graph we formulate an Eulerian Decomposition Problem (EDP)
of finding a collection of linear and/or circular rearranged cancer chromosomes
that are determined by the graph. We derive and prove computational complexities
for several variations of the EDP. We then demonstrate that Eulerian decomposition
of the cancer karyotype graphs is not always unique and present the Consistent
Contig Covering Problem (CCCP) of recovering unambiguous cancer contigs from the
cancer karyotype graph, and describe a novel algorithm CCR capable of solving
CCCP in polynomial time. We apply CCR on a prostate cancer dataset and demonstrate
that it is capable of consistently recovering large cancer contigs even when underlying
cancer genomes are highly rearranged.\r\n\r\nConclusions: CCR can recover rearranged
cancer contigs from karyotype graphs thereby addressing existing limitation in
inferring chromosomal structures of rearranged cancer genomes and advancing our
understanding of both patient/cancer-specific as well as the overall genetic instability
in cancer."
article_number: '641'
article_processing_charge: No
article_type: original
author:
- first_name: Sergey
full_name: Aganezov, Sergey
last_name: Aganezov
- first_name: Ilya
full_name: Zban, Ilya
last_name: Zban
- first_name: Vitalii
full_name: Aksenov, Vitalii
id: 2980135A-F248-11E8-B48F-1D18A9856A87
last_name: Aksenov
- first_name: Nikita
full_name: Alexeev, Nikita
last_name: Alexeev
- first_name: Michael C.
full_name: Schatz, Michael C.
last_name: Schatz
citation:
ama: Aganezov S, Zban I, Aksenov V, Alexeev N, Schatz MC. Recovering rearranged
cancer chromosomes from karyotype graphs. BMC Bioinformatics. 2019;20.
doi:10.1186/s12859-019-3208-4
apa: Aganezov, S., Zban, I., Aksenov, V., Alexeev, N., & Schatz, M. C. (2019).
Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics.
BMC. https://doi.org/10.1186/s12859-019-3208-4
chicago: Aganezov, Sergey, Ilya Zban, Vitalii Aksenov, Nikita Alexeev, and Michael
C. Schatz. “Recovering Rearranged Cancer Chromosomes from Karyotype Graphs.” BMC
Bioinformatics. BMC, 2019. https://doi.org/10.1186/s12859-019-3208-4.
ieee: S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, and M. C. Schatz, “Recovering
rearranged cancer chromosomes from karyotype graphs,” BMC Bioinformatics,
vol. 20. BMC, 2019.
ista: Aganezov S, Zban I, Aksenov V, Alexeev N, Schatz MC. 2019. Recovering rearranged
cancer chromosomes from karyotype graphs. BMC Bioinformatics. 20, 641.
mla: Aganezov, Sergey, et al. “Recovering Rearranged Cancer Chromosomes from Karyotype
Graphs.” BMC Bioinformatics, vol. 20, 641, BMC, 2019, doi:10.1186/s12859-019-3208-4.
short: S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, M.C. Schatz, BMC Bioinformatics
20 (2019).
date_created: 2019-12-29T23:00:46Z
date_published: 2019-12-17T00:00:00Z
date_updated: 2023-09-06T14:51:06Z
day: '17'
ddc:
- '570'
department:
- _id: DaAl
doi: 10.1186/s12859-019-3208-4
external_id:
isi:
- '000511618800007'
file:
- access_level: open_access
checksum: 7a30357efdcf8f66587ed495c0927724
content_type: application/pdf
creator: dernst
date_created: 2020-01-02T16:10:58Z
date_updated: 2020-07-14T12:47:54Z
file_id: '7221'
file_name: 2019_BMCBioinfo_Aganezov.pdf
file_size: 1917374
relation: main_file
file_date_updated: 2020-07-14T12:47:54Z
has_accepted_license: '1'
intvolume: ' 20'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '12'
oa: 1
oa_version: Published Version
publication: BMC Bioinformatics
publication_identifier:
eissn:
- '14712105'
publication_status: published
publisher: BMC
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recovering rearranged cancer chromosomes from karyotype graphs
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: 20
year: '2019'
...
---
_id: '7225'
abstract:
- lang: eng
text: "This is a literature teaching resource review for biologically inspired microfluidics
courses\r\nor exploring the diverse applications of microfluidics. The structure
is around key papers and model\r\norganisms. While courses gradually change over
time, a focus remains on understanding how\r\nmicrofluidics has developed as well
as what it can and cannot do for researchers. As a primary\r\nstarting point,
we cover micro-fluid mechanics principles and microfabrication of devices. A variety\r\nof
applications are discussed using model prokaryotic and eukaryotic organisms from
the set\r\nof bacteria (Escherichia coli), trypanosomes (Trypanosoma brucei),
yeast (Saccharomyces cerevisiae),\r\nslime molds (Physarum polycephalum), worms
(Caenorhabditis elegans), flies (Drosophila melangoster),\r\nplants (Arabidopsis
thaliana), and mouse immune cells (Mus musculus). Other engineering and\r\nbiochemical
methods discussed include biomimetics, organ on a chip, inkjet, droplet microfluidics,\r\nbiotic
games, and diagnostics. While we have not yet reached the end-all lab on a chip,\r\nmicrofluidics
can still be used effectively for specific applications."
article_number: '109'
article_processing_charge: Yes
article_type: review
author:
- first_name: Jack
full_name: Merrin, Jack
id: 4515C308-F248-11E8-B48F-1D18A9856A87
last_name: Merrin
orcid: 0000-0001-5145-4609
citation:
ama: Merrin J. Frontiers in microfluidics, a teaching resource review. Bioengineering.
2019;6(4). doi:10.3390/bioengineering6040109
apa: Merrin, J. (2019). Frontiers in microfluidics, a teaching resource review.
Bioengineering. MDPI. https://doi.org/10.3390/bioengineering6040109
chicago: Merrin, Jack. “Frontiers in Microfluidics, a Teaching Resource Review.”
Bioengineering. MDPI, 2019. https://doi.org/10.3390/bioengineering6040109.
ieee: J. Merrin, “Frontiers in microfluidics, a teaching resource review,” Bioengineering,
vol. 6, no. 4. MDPI, 2019.
ista: Merrin J. 2019. Frontiers in microfluidics, a teaching resource review. Bioengineering.
6(4), 109.
mla: Merrin, Jack. “Frontiers in Microfluidics, a Teaching Resource Review.” Bioengineering,
vol. 6, no. 4, 109, MDPI, 2019, doi:10.3390/bioengineering6040109.
short: J. Merrin, Bioengineering 6 (2019).
date_created: 2020-01-05T23:00:45Z
date_published: 2019-12-03T00:00:00Z
date_updated: 2023-09-06T14:52:49Z
day: '03'
ddc:
- '620'
department:
- _id: NanoFab
doi: 10.3390/bioengineering6040109
external_id:
isi:
- '000505590000024'
pmid:
- '31816954'
file:
- access_level: open_access
checksum: 80f1499e2a4caccdf3aa54b137fd99a0
content_type: application/pdf
creator: dernst
date_created: 2020-01-07T14:49:59Z
date_updated: 2020-07-14T12:47:54Z
file_id: '7243'
file_name: 2019_Bioengineering_Merrin.pdf
file_size: 2660780
relation: main_file
file_date_updated: 2020-07-14T12:47:54Z
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: Bioengineering
publication_identifier:
eissn:
- '23065354'
publication_status: published
publisher: MDPI
quality_controlled: '1'
scopus_import: '1'
status: public
title: Frontiers in microfluidics, a teaching resource review
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: 6
year: '2019'
...
---
_id: '7228'
abstract:
- lang: eng
text: "Traditional concurrent programming involves manipulating shared mutable state.
Alternatives to this programming style are communicating sequential processes
(CSP) and actor models, which share data via explicit communication. These models
have been known for almost half a century, and have recently had started to gain
significant traction among modern programming languages. The common abstraction
for communication between several processes is the channel. Although channels
are similar to producer-consumer data structures, they have different semantics
and support additional operations, such as the select expression. Despite their
growing popularity, most known implementations of channels use lock-based data
structures and can be rather inefficient.\r\n\r\nIn this paper, we present the
first efficient lock-free algorithm for implementing a communication channel for
CSP programming. We provide implementations and experimental results in the Kotlin
and Go programming languages. Our new algorithm outperforms existing implementations
on many workloads, while providing non-blocking progress guarantee. Our design
can serve as an example of how to construct general communication data structures
for CSP and actor models. "
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- 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: Roman
full_name: Elizarov, Roman
last_name: Elizarov
citation:
ama: 'Koval N, Alistarh D-A, Elizarov R. Scalable FIFO channels for programming
via communicating sequential processes. In: 25th Anniversary of Euro-Par.
Vol 11725. Springer Nature; 2019:317-333. doi:10.1007/978-3-030-29400-7_23'
apa: 'Koval, N., Alistarh, D.-A., & Elizarov, R. (2019). Scalable FIFO channels
for programming via communicating sequential processes. In 25th Anniversary
of Euro-Par (Vol. 11725, pp. 317–333). Göttingen, Germany: Springer Nature.
https://doi.org/10.1007/978-3-030-29400-7_23'
chicago: Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Scalable FIFO
Channels for Programming via Communicating Sequential Processes.” In 25th Anniversary
of Euro-Par, 11725:317–33. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29400-7_23.
ieee: N. Koval, D.-A. Alistarh, and R. Elizarov, “Scalable FIFO channels for programming
via communicating sequential processes,” in 25th Anniversary of Euro-Par,
Göttingen, Germany, 2019, vol. 11725, pp. 317–333.
ista: 'Koval N, Alistarh D-A, Elizarov R. 2019. Scalable FIFO channels for programming
via communicating sequential processes. 25th Anniversary of Euro-Par. Euro-Par:
European Conference on Parallel Processing, LNCS, vol. 11725, 317–333.'
mla: Koval, Nikita, et al. “Scalable FIFO Channels for Programming via Communicating
Sequential Processes.” 25th Anniversary of Euro-Par, vol. 11725, Springer
Nature, 2019, pp. 317–33, doi:10.1007/978-3-030-29400-7_23.
short: N. Koval, D.-A. Alistarh, R. Elizarov, in:, 25th Anniversary of Euro-Par,
Springer Nature, 2019, pp. 317–333.
conference:
end_date: 2019-08-30
location: Göttingen, Germany
name: 'Euro-Par: European Conference on Parallel Processing'
start_date: 2019-08-26
date_created: 2020-01-05T23:00:46Z
date_published: 2019-08-13T00:00:00Z
date_updated: 2023-09-06T14:53:59Z
day: '13'
department:
- _id: DaAl
doi: 10.1007/978-3-030-29400-7_23
external_id:
isi:
- '000851061400023'
intvolume: ' 11725'
isi: 1
language:
- iso: eng
month: '08'
oa_version: None
page: 317-333
publication: 25th Anniversary of Euro-Par
publication_identifier:
eissn:
- 1611-3349
isbn:
- 978-3-0302-9399-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scalable FIFO channels for programming via communicating sequential processes
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11725
year: '2019'
...
---
_id: '7216'
abstract:
- lang: eng
text: 'We present LiveTraVeL (Live Transit Vehicle Labeling), a real-time system
to label a stream of noisy observations of transit vehicle trajectories with the
transit routes they are serving (e.g., northbound bus #5). In order to scale efficiently
to large transit networks, our system first retrieves a small set of candidate
routes from a geometrically indexed data structure, then applies a fine-grained
scoring step to choose the best match. Given that real-time data remains unavailable
for the majority of the world’s transit agencies, these inferences can help feed
a real-time map of a transit system’s trips, infer transit trip delays in real
time, or measure and correct noisy transit tracking data. This system can run
on vehicle observations from a variety of sources that don’t attach route information
to vehicle observations, such as public imagery streams or user-contributed transit
vehicle sightings.We abstract away the specifics of the sensing system and demonstrate
the effectiveness of our system on a "semisynthetic" dataset of all New York City
buses, where we simulate sensed trajectories by starting with fully labeled vehicle
trajectories reported via the GTFS-Realtime protocol, removing the transit route
IDs, and perturbing locations with synthetic noise. Using just the geometric shapes
of the trajectories, we demonstrate that our system converges on the correct route
ID within a few minutes, even after a vehicle switches from serving one trip to
the next.'
article_number: '8917514'
article_processing_charge: No
author:
- first_name: Georg F
full_name: Osang, Georg F
id: 464B40D6-F248-11E8-B48F-1D18A9856A87
last_name: Osang
orcid: 0000-0002-8882-5116
- first_name: James
full_name: Cook, James
last_name: Cook
- first_name: Alex
full_name: Fabrikant, Alex
last_name: Fabrikant
- first_name: Marco
full_name: Gruteser, Marco
last_name: Gruteser
citation:
ama: 'Osang GF, Cook J, Fabrikant A, Gruteser M. LiveTraVeL: Real-time matching
of transit vehicle trajectories to transit routes at scale. In: 2019 IEEE Intelligent
Transportation Systems Conference. IEEE; 2019. doi:10.1109/ITSC.2019.8917514'
apa: 'Osang, G. F., Cook, J., Fabrikant, A., & Gruteser, M. (2019). LiveTraVeL:
Real-time matching of transit vehicle trajectories to transit routes at scale.
In 2019 IEEE Intelligent Transportation Systems Conference. Auckland, New
Zealand: IEEE. https://doi.org/10.1109/ITSC.2019.8917514'
chicago: 'Osang, Georg F, James Cook, Alex Fabrikant, and Marco Gruteser. “LiveTraVeL:
Real-Time Matching of Transit Vehicle Trajectories to Transit Routes at Scale.”
In 2019 IEEE Intelligent Transportation Systems Conference. IEEE, 2019.
https://doi.org/10.1109/ITSC.2019.8917514.'
ieee: 'G. F. Osang, J. Cook, A. Fabrikant, and M. Gruteser, “LiveTraVeL: Real-time
matching of transit vehicle trajectories to transit routes at scale,” in 2019
IEEE Intelligent Transportation Systems Conference, Auckland, New Zealand,
2019.'
ista: 'Osang GF, Cook J, Fabrikant A, Gruteser M. 2019. LiveTraVeL: Real-time matching
of transit vehicle trajectories to transit routes at scale. 2019 IEEE Intelligent
Transportation Systems Conference. ITSC: Intelligent Transportation Systems Conference,
8917514.'
mla: 'Osang, Georg F., et al. “LiveTraVeL: Real-Time Matching of Transit Vehicle
Trajectories to Transit Routes at Scale.” 2019 IEEE Intelligent Transportation
Systems Conference, 8917514, IEEE, 2019, doi:10.1109/ITSC.2019.8917514.'
short: G.F. Osang, J. Cook, A. Fabrikant, M. Gruteser, in:, 2019 IEEE Intelligent
Transportation Systems Conference, IEEE, 2019.
conference:
end_date: 2019-10-30
location: Auckland, New Zealand
name: 'ITSC: Intelligent Transportation Systems Conference'
start_date: 2019-10-27
date_created: 2019-12-29T23:00:47Z
date_published: 2019-11-28T00:00:00Z
date_updated: 2023-09-06T14:50:28Z
day: '28'
department:
- _id: HeEd
doi: 10.1109/ITSC.2019.8917514
external_id:
isi:
- '000521238102050'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
publication: 2019 IEEE Intelligent Transportation Systems Conference
publication_identifier:
isbn:
- '9781538670248'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'LiveTraVeL: Real-time matching of transit vehicle trajectories to transit
routes at scale'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '7231'
abstract:
- lang: eng
text: Piecewise Barrier Tubes (PBT) is a new technique for flowpipe overapproximation
for nonlinear systems with polynomial dynamics, which leverages a combination
of barrier certificates. PBT has advantages over traditional time-step based methods
in dealing with those nonlinear dynamical systems in which there is a large difference
in speed between trajectories, producing an overapproximation that is time independent.
However, the existing approach for PBT is not efficient due to the application
of interval methods for enclosure-box computation, and it can only deal with continuous
dynamical systems without uncertainty. In this paper, we extend the approach with
the ability to handle both continuous and hybrid dynamical systems with uncertainty
that can reside in parameters and/or noise. We also improve the efficiency of
the method significantly, by avoiding the use of interval-based methods for the
enclosure-box computation without loosing soundness. We have developed a C++ prototype
implementing the proposed approach and we evaluate it on several benchmarks. The
experiments show that our approach is more efficient and precise than other methods
in the literature.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Kong H, Bartocci E, Jiang Y, Henzinger TA. Piecewise robust barrier tubes
for nonlinear hybrid systems with uncertainty. In: 17th International Conference
on Formal Modeling and Analysis of Timed Systems. Vol 11750. Springer Nature;
2019:123-141. doi:10.1007/978-3-030-29662-9_8'
apa: 'Kong, H., Bartocci, E., Jiang, Y., & Henzinger, T. A. (2019). Piecewise
robust barrier tubes for nonlinear hybrid systems with uncertainty. In 17th
International Conference on Formal Modeling and Analysis of Timed Systems
(Vol. 11750, pp. 123–141). Amsterdam, The Netherlands: Springer Nature. https://doi.org/10.1007/978-3-030-29662-9_8'
chicago: Kong, Hui, Ezio Bartocci, Yu Jiang, and Thomas A Henzinger. “Piecewise
Robust Barrier Tubes for Nonlinear Hybrid Systems with Uncertainty.” In 17th
International Conference on Formal Modeling and Analysis of Timed Systems,
11750:123–41. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29662-9_8.
ieee: H. Kong, E. Bartocci, Y. Jiang, and T. A. Henzinger, “Piecewise robust barrier
tubes for nonlinear hybrid systems with uncertainty,” in 17th International
Conference on Formal Modeling and Analysis of Timed Systems, Amsterdam, The
Netherlands, 2019, vol. 11750, pp. 123–141.
ista: 'Kong H, Bartocci E, Jiang Y, Henzinger TA. 2019. Piecewise robust barrier
tubes for nonlinear hybrid systems with uncertainty. 17th International Conference
on Formal Modeling and Analysis of Timed Systems. FORMATS: Formal Modeling and
Analysis of Timed Systems, LNCS, vol. 11750, 123–141.'
mla: Kong, Hui, et al. “Piecewise Robust Barrier Tubes for Nonlinear Hybrid Systems
with Uncertainty.” 17th International Conference on Formal Modeling and Analysis
of Timed Systems, vol. 11750, Springer Nature, 2019, pp. 123–41, doi:10.1007/978-3-030-29662-9_8.
short: H. Kong, E. Bartocci, Y. Jiang, T.A. Henzinger, in:, 17th International Conference
on Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 123–141.
conference:
end_date: 2019-08-29
location: Amsterdam, The Netherlands
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2019-08-27
date_created: 2020-01-05T23:00:47Z
date_published: 2019-08-13T00:00:00Z
date_updated: 2023-09-06T14:55:15Z
day: '13'
department:
- _id: ToHe
doi: 10.1007/978-3-030-29662-9_8
external_id:
arxiv:
- '1907.11514'
isi:
- '000611677700008'
intvolume: ' 11750'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1907.11514
month: '08'
oa: 1
oa_version: Preprint
page: 123-141
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 17th International Conference on Formal Modeling and Analysis of Timed
Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- 978-3-0302-9661-2
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Piecewise robust barrier tubes for nonlinear hybrid systems with uncertainty
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11750
year: '2019'
...
---
_id: '7340'
abstract:
- lang: eng
text: Coupling of endoplasmic reticulum stress to dimerisation‑dependent activation
of the UPR transducer IRE1 is incompletely understood. Whilst the luminal co-chaperone
ERdj4 promotes a complex between the Hsp70 BiP and IRE1's stress-sensing luminal
domain (IRE1LD) that favours the latter's monomeric inactive state and loss of
ERdj4 de-represses IRE1, evidence linking these cellular and in vitro observations
is presently lacking. We report that enforced loading of endogenous BiP onto endogenous
IRE1α repressed UPR signalling in CHO cells and deletions in the IRE1α locus that
de-repressed the UPR in cells, encode flexible regions of IRE1LD that mediated
BiP‑induced monomerisation in vitro. Changes in the hydrogen exchange mass spectrometry
profile of IRE1LD induced by ERdj4 and BiP confirmed monomerisation and were consistent
with active destabilisation of the IRE1LD dimer. Together, these observations
support a competition model whereby waning ER stress passively partitions ERdj4
and BiP to IRE1LD to initiate active repression of UPR signalling.
acknowledgement: We thank the CIMR flow cytometry core facility team (Reiner Schulte,
Chiara Cossetti and Gabriela Grondys-Kotarba) for assistance with FACS, the Huntington
lab for access to the Octet machine, Steffen Preissler for advice on data interpretation,
Roman Kityk and Nicole Luebbehusen for help and advice with HX-MS experiments.
article_number: e50793
article_processing_charge: No
article_type: original
author:
- first_name: Niko Paresh
full_name: Amin-Wetzel, Niko Paresh
id: E95D3014-9D8C-11E9-9C80-D2F8E5697425
last_name: Amin-Wetzel
- first_name: Lisa
full_name: Neidhardt, Lisa
last_name: Neidhardt
- first_name: Yahui
full_name: Yan, Yahui
last_name: Yan
- first_name: Matthias P.
full_name: Mayer, Matthias P.
last_name: Mayer
- first_name: David
full_name: Ron, David
last_name: Ron
citation:
ama: Amin-Wetzel NP, Neidhardt L, Yan Y, Mayer MP, Ron D. Unstructured regions in
IRE1α specify BiP-mediated destabilisation of the luminal domain dimer and repression
of the UPR. eLife. 2019;8. doi:10.7554/eLife.50793
apa: Amin-Wetzel, N. P., Neidhardt, L., Yan, Y., Mayer, M. P., & Ron, D. (2019).
Unstructured regions in IRE1α specify BiP-mediated destabilisation of the luminal
domain dimer and repression of the UPR. ELife. eLife Sciences Publications.
https://doi.org/10.7554/eLife.50793
chicago: Amin-Wetzel, Niko Paresh, Lisa Neidhardt, Yahui Yan, Matthias P. Mayer,
and David Ron. “Unstructured Regions in IRE1α Specify BiP-Mediated Destabilisation
of the Luminal Domain Dimer and Repression of the UPR.” ELife. eLife Sciences
Publications, 2019. https://doi.org/10.7554/eLife.50793.
ieee: N. P. Amin-Wetzel, L. Neidhardt, Y. Yan, M. P. Mayer, and D. Ron, “Unstructured
regions in IRE1α specify BiP-mediated destabilisation of the luminal domain dimer
and repression of the UPR,” eLife, vol. 8. eLife Sciences Publications,
2019.
ista: Amin-Wetzel NP, Neidhardt L, Yan Y, Mayer MP, Ron D. 2019. Unstructured regions
in IRE1α specify BiP-mediated destabilisation of the luminal domain dimer and
repression of the UPR. eLife. 8, e50793.
mla: Amin-Wetzel, Niko Paresh, et al. “Unstructured Regions in IRE1α Specify BiP-Mediated
Destabilisation of the Luminal Domain Dimer and Repression of the UPR.” ELife,
vol. 8, e50793, eLife Sciences Publications, 2019, doi:10.7554/eLife.50793.
short: N.P. Amin-Wetzel, L. Neidhardt, Y. Yan, M.P. Mayer, D. Ron, ELife 8 (2019).
date_created: 2020-01-19T23:00:39Z
date_published: 2019-12-24T00:00:00Z
date_updated: 2023-09-06T14:58:02Z
day: '24'
ddc:
- '570'
department:
- _id: MaDe
doi: 10.7554/eLife.50793
external_id:
isi:
- '000512303700001'
pmid:
- '31873072'
file:
- access_level: open_access
checksum: 29fcbcd8c1fc7f11a596ed7f14ea1c82
content_type: application/pdf
creator: dernst
date_created: 2020-11-19T11:37:41Z
date_updated: 2020-11-19T11:37:41Z
file_id: '8777'
file_name: 2019_eLife_AminWetzel.pdf
file_size: 4817384
relation: main_file
success: 1
file_date_updated: 2020-11-19T11:37:41Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: eLife
publication_identifier:
eissn:
- 2050084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unstructured regions in IRE1α specify BiP-mediated destabilisation of the luminal
domain dimer and repression of the UPR
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: '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
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: '7230'
abstract:
- lang: eng
text: Simple drawings of graphs are those in which each pair of edges share at most
one point, either a common endpoint or a proper crossing. In this paper we study
the problem of extending a simple drawing D(G) of a graph G by inserting a set
of edges from the complement of G into D(G) such that the result is a simple drawing.
In the context of rectilinear drawings, the problem is trivial. For pseudolinear
drawings, the existence of such an extension follows from Levi’s enlargement lemma.
In contrast, we prove that deciding if a given set of edges can be inserted into
a simple drawing is NP-complete. Moreover, we show that the maximization version
of the problem is APX-hard. We also present a polynomial-time algorithm for deciding
whether one edge uv can be inserted into D(G) when {u,v} is a dominating set for
the graph G.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alan M
full_name: Arroyo Guevara, Alan M
id: 3207FDC6-F248-11E8-B48F-1D18A9856A87
last_name: Arroyo Guevara
orcid: 0000-0003-2401-8670
- first_name: Martin
full_name: Derka, Martin
last_name: Derka
- first_name: Irene
full_name: Parada, Irene
last_name: Parada
citation:
ama: 'Arroyo Guevara AM, Derka M, Parada I. Extending simple drawings. In: 27th
International Symposium on Graph Drawing and Network Visualization. Vol 11904.
Springer Nature; 2019:230-243. doi:10.1007/978-3-030-35802-0_18'
apa: 'Arroyo Guevara, A. M., Derka, M., & Parada, I. (2019). Extending simple
drawings. In 27th International Symposium on Graph Drawing and Network Visualization
(Vol. 11904, pp. 230–243). Prague, Czech Republic: Springer Nature. https://doi.org/10.1007/978-3-030-35802-0_18'
chicago: Arroyo Guevara, Alan M, Martin Derka, and Irene Parada. “Extending Simple
Drawings.” In 27th International Symposium on Graph Drawing and Network Visualization,
11904:230–43. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-35802-0_18.
ieee: A. M. Arroyo Guevara, M. Derka, and I. Parada, “Extending simple drawings,”
in 27th International Symposium on Graph Drawing and Network Visualization,
Prague, Czech Republic, 2019, vol. 11904, pp. 230–243.
ista: 'Arroyo Guevara AM, Derka M, Parada I. 2019. Extending simple drawings. 27th
International Symposium on Graph Drawing and Network Visualization. GD: Graph
Drawing and Network Visualization, LNCS, vol. 11904, 230–243.'
mla: Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.” 27th International
Symposium on Graph Drawing and Network Visualization, vol. 11904, Springer
Nature, 2019, pp. 230–43, doi:10.1007/978-3-030-35802-0_18.
short: A.M. Arroyo Guevara, M. Derka, I. Parada, in:, 27th International Symposium
on Graph Drawing and Network Visualization, Springer Nature, 2019, pp. 230–243.
conference:
end_date: 2019-09-20
location: Prague, Czech Republic
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2019-09-17
date_created: 2020-01-05T23:00:47Z
date_published: 2019-11-28T00:00:00Z
date_updated: 2023-09-06T14:56:00Z
day: '28'
department:
- _id: UlWa
doi: 10.1007/978-3-030-35802-0_18
ec_funded: 1
external_id:
arxiv:
- '1908.08129'
isi:
- '000612918800018'
intvolume: ' 11904'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1908.08129
month: '11'
oa: 1
oa_version: Preprint
page: 230-243
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: 27th International Symposium on Graph Drawing and Network Visualization
publication_identifier:
eissn:
- 1611-3349
isbn:
- 978-3-0303-5801-3
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extending simple drawings
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11904
year: '2019'
...
---
_id: '7232'
abstract:
- lang: eng
text: 'We present Mixed-time Signal Temporal Logic (STL−MX), a specification formalism
which extends STL by capturing the discrete/ continuous time duality found in
many cyber-physical systems (CPS), as well as mixed-signal electronic designs.
In STL−MX, properties of components with continuous dynamics are expressed in
STL, while specifications of components with discrete dynamics are written in
LTL. To combine the two layers, we evaluate formulas on two traces, discrete-
and continuous-time, and introduce two interface operators that map signals, properties
and their satisfaction signals across the two time domains. We show that STL-mx
has the expressive power of STL supplemented with an implicit T-periodic clock
signal. We develop and implement an algorithm for monitoring STL-mx formulas and
illustrate the approach using a mixed-signal example. '
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: 'Ferrere T, Maler O, Nickovic D. Mixed-time signal temporal logic. In: 17th
International Conference on Formal Modeling and Analysis of Timed Systems.
Vol 11750. Springer Nature; 2019:59-75. doi:10.1007/978-3-030-29662-9_4'
apa: 'Ferrere, T., Maler, O., & Nickovic, D. (2019). Mixed-time signal temporal
logic. In 17th International Conference on Formal Modeling and Analysis of
Timed Systems (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer
Nature. https://doi.org/10.1007/978-3-030-29662-9_4'
chicago: Ferrere, Thomas, Oded Maler, and Dejan Nickovic. “Mixed-Time Signal Temporal
Logic.” In 17th International Conference on Formal Modeling and Analysis of
Timed Systems, 11750:59–75. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29662-9_4.
ieee: T. Ferrere, O. Maler, and D. Nickovic, “Mixed-time signal temporal logic,”
in 17th International Conference on Formal Modeling and Analysis of Timed Systems,
Amsterdam, The Netherlands, 2019, vol. 11750, pp. 59–75.
ista: 'Ferrere T, Maler O, Nickovic D. 2019. Mixed-time signal temporal logic. 17th
International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS:
Formal Modeling and Anaysis of Timed Systems, LNCS, vol. 11750, 59–75.'
mla: Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.” 17th International
Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer
Nature, 2019, pp. 59–75, doi:10.1007/978-3-030-29662-9_4.
short: T. Ferrere, O. Maler, D. Nickovic, in:, 17th International Conference on
Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 59–75.
conference:
end_date: 2019-08-29
location: Amsterdam, The Netherlands
name: 'FORMATS: Formal Modeling and Anaysis of Timed Systems'
start_date: 2019-08-27
date_created: 2020-01-05T23:00:48Z
date_published: 2019-08-13T00:00:00Z
date_updated: 2023-09-06T14:57:17Z
day: '13'
department:
- _id: ToHe
doi: 10.1007/978-3-030-29662-9_4
external_id:
isi:
- '000611677700004'
intvolume: ' 11750'
isi: 1
language:
- iso: eng
month: '08'
oa_version: None
page: 59-75
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 17th International Conference on Formal Modeling and Analysis of Timed
Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- 978-3-0302-9661-2
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mixed-time signal temporal logic
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11750
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: '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
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: '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: '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: '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: '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
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: '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
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: '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: '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
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: '7393'
abstract:
- lang: eng
text: The study of parallel ecological divergence provides important clues to the
operation of natural selection. Parallel divergence often occurs in heterogeneous
environments with different kinds of environmental gradients in different locations,
but the genomic basis underlying this process is unknown. We investigated the
genomics of rapid parallel adaptation in the marine snail Littorina saxatilis
in response to two independent environmental axes (crab-predation versus wave-action
and low-shore versus high-shore). Using pooled whole-genome resequencing, we show
that sharing of genomic regions of high differentiation between environments is
generally low but increases at smaller spatial scales. We identify different shared
genomic regions of divergence for each environmental axis and show that most of
these regions overlap with candidate chromosomal inversions. Several inversion
regions are divergent and polymorphic across many localities. We argue that chromosomal
inversions could store shared variation that fuels rapid parallel adaptation to
heterogeneous environments, possibly as balanced polymorphism shared by adaptive
gene flow.
article_number: eaav9963
article_processing_charge: No
article_type: original
author:
- first_name: Hernán E.
full_name: Morales, Hernán E.
last_name: Morales
- first_name: Rui
full_name: Faria, Rui
last_name: Faria
- first_name: Kerstin
full_name: Johannesson, Kerstin
last_name: Johannesson
- first_name: Tomas
full_name: Larsson, Tomas
last_name: Larsson
- first_name: Marina
full_name: Panova, Marina
last_name: Panova
- first_name: Anja M
full_name: Westram, Anja M
id: 3C147470-F248-11E8-B48F-1D18A9856A87
last_name: Westram
orcid: 0000-0003-1050-4969
- first_name: Roger K.
full_name: Butlin, Roger K.
last_name: Butlin
citation:
ama: 'Morales HE, Faria R, Johannesson K, et al. Genomic architecture of parallel
ecological divergence: Beyond a single environmental contrast. Science Advances.
2019;5(12). doi:10.1126/sciadv.aav9963'
apa: 'Morales, H. E., Faria, R., Johannesson, K., Larsson, T., Panova, M., Westram,
A. M., & Butlin, R. K. (2019). Genomic architecture of parallel ecological
divergence: Beyond a single environmental contrast. Science Advances. AAAS.
https://doi.org/10.1126/sciadv.aav9963'
chicago: 'Morales, Hernán E., Rui Faria, Kerstin Johannesson, Tomas Larsson, Marina
Panova, Anja M Westram, and Roger K. Butlin. “Genomic Architecture of Parallel
Ecological Divergence: Beyond a Single Environmental Contrast.” Science Advances.
AAAS, 2019. https://doi.org/10.1126/sciadv.aav9963.'
ieee: 'H. E. Morales et al., “Genomic architecture of parallel ecological
divergence: Beyond a single environmental contrast,” Science Advances,
vol. 5, no. 12. AAAS, 2019.'
ista: 'Morales HE, Faria R, Johannesson K, Larsson T, Panova M, Westram AM, Butlin
RK. 2019. Genomic architecture of parallel ecological divergence: Beyond a single
environmental contrast. Science Advances. 5(12), eaav9963.'
mla: 'Morales, Hernán E., et al. “Genomic Architecture of Parallel Ecological Divergence:
Beyond a Single Environmental Contrast.” Science Advances, vol. 5, no.
12, eaav9963, AAAS, 2019, doi:10.1126/sciadv.aav9963.'
short: H.E. Morales, R. Faria, K. Johannesson, T. Larsson, M. Panova, A.M. Westram,
R.K. Butlin, Science Advances 5 (2019).
date_created: 2020-01-29T15:58:27Z
date_published: 2019-12-04T00:00:00Z
date_updated: 2023-09-06T15:35:56Z
day: '04'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1126/sciadv.aav9963
ec_funded: 1
external_id:
isi:
- '000505069600008'
pmid:
- '31840052'
file:
- access_level: open_access
checksum: af99a5dcdc66c6d6102051faf3be48d8
content_type: application/pdf
creator: dernst
date_created: 2020-02-03T13:33:25Z
date_updated: 2020-07-14T12:47:57Z
file_id: '7442'
file_name: 2019_ScienceAdvances_Morales.pdf
file_size: 1869449
relation: main_file
file_date_updated: 2020-07-14T12:47:57Z
has_accepted_license: '1'
intvolume: ' 5'
isi: 1
issue: '12'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 265B41B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '797747'
name: Theoretical and empirical approaches to understanding Parallel Adaptation
publication: Science Advances
publication_identifier:
issn:
- 2375-2548
publication_status: published
publisher: AAAS
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Genomic architecture of parallel ecological divergence: Beyond a single environmental
contrast'
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 5
year: '2019'
...
---
_id: '7397'
abstract:
- lang: eng
text: Polymer additives can substantially reduce the drag of turbulent flows and
the upperlimit, the so called “maximum drag reduction” (MDR) asymptote is universal,
i.e. inde-pendent of the type of polymer and solvent used. Until recently, the
consensus was that,in this limit, flows are in a marginal state where only a minimal
level of turbulence activ-ity persists. Observations in direct numerical simulations
using minimal sized channelsappeared to support this view and reported long “hibernation” periods where turbu-lence
is marginalized. In simulations of pipe flow we find that, indeed, with increasingWeissenberg
number (Wi), turbulence expresses long periods of hibernation if the domainsize
is small. However, with increasing pipe length, the temporal hibernation continuouslyalters
to spatio-temporal intermittency and here the flow consists of turbulent puffs
sur-rounded by laminar flow. Moreover, upon an increase in Wi, the flow fully
relaminarises,in agreement with recent experiments. At even larger Wi, a different
instability is en-countered causing a drag increase towards MDR. Our findings
hence link earlier minimalflow unit simulations with recent experiments and confirm
that the addition of polymersinitially suppresses Newtonian turbulence and leads
to a reverse transition. The MDRstate on the other hand results from a separate
instability and the underlying dynamicscorresponds to the recently proposed state
of elasto-inertial-turbulence (EIT).
article_processing_charge: No
article_type: original
author:
- first_name: Jose M
full_name: Lopez Alonso, Jose M
id: 40770848-F248-11E8-B48F-1D18A9856A87
last_name: Lopez Alonso
orcid: 0000-0002-0384-2022
- first_name: George H
full_name: Choueiri, George H
id: 448BD5BC-F248-11E8-B48F-1D18A9856A87
last_name: Choueiri
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Lopez Alonso JM, Choueiri GH, Hof B. Dynamics of viscoelastic pipe flow at
low Reynolds numbers in the maximum drag reduction limit. Journal of Fluid
Mechanics. 2019;874:699-719. doi:10.1017/jfm.2019.486
apa: Lopez Alonso, J. M., Choueiri, G. H., & Hof, B. (2019). Dynamics of viscoelastic
pipe flow at low Reynolds numbers in the maximum drag reduction limit. Journal
of Fluid Mechanics. CUP. https://doi.org/10.1017/jfm.2019.486
chicago: Lopez Alonso, Jose M, George H Choueiri, and Björn Hof. “Dynamics of Viscoelastic
Pipe Flow at Low Reynolds Numbers in the Maximum Drag Reduction Limit.” Journal
of Fluid Mechanics. CUP, 2019. https://doi.org/10.1017/jfm.2019.486.
ieee: J. M. Lopez Alonso, G. H. Choueiri, and B. Hof, “Dynamics of viscoelastic
pipe flow at low Reynolds numbers in the maximum drag reduction limit,” Journal
of Fluid Mechanics, vol. 874. CUP, pp. 699–719, 2019.
ista: Lopez Alonso JM, Choueiri GH, Hof B. 2019. Dynamics of viscoelastic pipe flow
at low Reynolds numbers in the maximum drag reduction limit. Journal of Fluid
Mechanics. 874, 699–719.
mla: Lopez Alonso, Jose M., et al. “Dynamics of Viscoelastic Pipe Flow at Low Reynolds
Numbers in the Maximum Drag Reduction Limit.” Journal of Fluid Mechanics,
vol. 874, CUP, 2019, pp. 699–719, doi:10.1017/jfm.2019.486.
short: J.M. Lopez Alonso, G.H. Choueiri, B. Hof, Journal of Fluid Mechanics 874
(2019) 699–719.
date_created: 2020-01-29T16:05:19Z
date_published: 2019-09-10T00:00:00Z
date_updated: 2023-09-06T15:36:36Z
day: '10'
department:
- _id: BjHo
doi: 10.1017/jfm.2019.486
external_id:
arxiv:
- '1808.04080'
isi:
- '000475349900001'
intvolume: ' 874'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.04080
month: '09'
oa: 1
oa_version: Preprint
page: 699-719
publication: Journal of Fluid Mechanics
publication_identifier:
eissn:
- 1469-7645
issn:
- 0022-1120
publication_status: published
publisher: CUP
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamics of viscoelastic pipe flow at low Reynolds numbers in the maximum drag
reduction limit
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 874
year: '2019'
...