---
_id: '10882'
abstract:
- lang: eng
text: 'We introduce Intelligent Annotation Dialogs for bounding box annotation.
We train an agent to automatically choose a sequence of actions for a human annotator
to produce a bounding box in a minimal amount of time. Specifically, we consider
two actions: box verification [34], where the annotator verifies a box generated
by an object detector, and manual box drawing. We explore two kinds of agents,
one based on predicting the probability that a box will be positively verified,
and the other based on reinforcement learning. We demonstrate that (1) our agents
are able to learn efficient annotation strategies in several scenarios, automatically
adapting to the image difficulty, the desired quality of the boxes, and the detector
strength; (2) in all scenarios the resulting annotation dialogs speed up annotation
compared to manual box drawing alone and box verification alone, while also outperforming
any fixed combination of verification and drawing in most scenarios; (3) in a
realistic scenario where the detector is iteratively re-trained, our agents evolve
a series of strategies that reflect the shifting trade-off between verification
and drawing as the detector grows stronger.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Jasper
full_name: Uijlings, Jasper
last_name: Uijlings
- first_name: Ksenia
full_name: Konyushkova, Ksenia
last_name: Konyushkova
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
citation:
ama: 'Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs
for bounding box annotation. In: 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. IEEE; 2018:9175-9184. doi:10.1109/cvpr.2018.00956'
apa: 'Uijlings, J., Konyushkova, K., Lampert, C., & Ferrari, V. (2018). Learning
intelligent dialogs for bounding box annotation. In 2018 IEEE/CVF Conference
on Computer Vision and Pattern Recognition (pp. 9175–9184). Salt Lake City,
UT, United States: IEEE. https://doi.org/10.1109/cvpr.2018.00956'
chicago: Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari.
“Learning Intelligent Dialogs for Bounding Box Annotation.” In 2018 IEEE/CVF
Conference on Computer Vision and Pattern Recognition, 9175–84. IEEE, 2018.
https://doi.org/10.1109/cvpr.2018.00956.
ieee: J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent
dialogs for bounding box annotation,” in 2018 IEEE/CVF Conference on Computer
Vision and Pattern Recognition, Salt Lake City, UT, United States, 2018, pp.
9175–9184.
ista: 'Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent
dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition,
9175–9184.'
mla: Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.”
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE,
2018, pp. 9175–84, doi:10.1109/cvpr.2018.00956.
short: J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference
on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.
conference:
end_date: 2018-06-23
location: Salt Lake City, UT, United States
name: 'CVF: Conference on Computer Vision and Pattern Recognition'
start_date: 2018-06-18
corr_author: '1'
date_created: 2022-03-18T12:45:09Z
date_published: 2018-12-17T00:00:00Z
date_updated: 2024-10-09T21:02:26Z
day: '17'
department:
- _id: ChLa
doi: 10.1109/cvpr.2018.00956
external_id:
arxiv:
- '1712.08087'
isi:
- '000457843609036'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1712.08087'
month: '12'
oa: 1
oa_version: Preprint
page: 9175-9184
publication: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
publication_identifier:
eissn:
- 2575-7075
isbn:
- '9781538664209'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning intelligent dialogs for bounding box annotation
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '10883'
abstract:
- lang: eng
text: 'Solving parity games, which are equivalent to modal μ-calculus model checking,
is a central algorithmic problem in formal methods, with applications in reactive
synthesis, program repair, verification of branching-time properties, etc. Besides
the standard compu- tation model with the explicit representation of games, another
important theoretical model of computation is that of set-based symbolic algorithms.
Set-based symbolic algorithms use basic set operations and one-step predecessor
operations on the implicit description of games, rather than the explicit representation.
The significance of symbolic algorithms is that they provide scalable algorithms
for large finite-state systems, as well as for infinite-state systems with finite
quotient. Consider parity games on graphs with n vertices and parity conditions
with d priorities. While there is a rich literature of explicit algorithms for
parity games, the main results for set-based symbolic algorithms are as follows:
(a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic
space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations
and O(n) symbolic space. In this work, our contributions are as follows: (1) We
present a black-box set-based symbolic algorithm based on the explicit progress
measure algorithm. Two important consequences of our algorithm are as follows:
(a) a set-based symbolic algorithm for parity games that requires quasi-polynomially
many symbolic operations and O(n) symbolic space; and (b) any future improvement
in progress measure based explicit algorithms immediately imply an efficiency
improvement in our set-based symbolic algorithm for parity games. (2) We present
a set-based symbolic algorithm that requires quasi-polynomially many symbolic
operations and O(d · log n) symbolic space. Moreover, for the important special
case of d ≤ log n, our algorithm requires only polynomially many symbolic operations
and poly-logarithmic symbolic space.'
acknowledgement: 'A. S. is fully supported by the Vienna Science and Technology Fund
(WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund
(FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph
Games). For M.H the research leading to these results has received funding from
the European Research Council under the European Union’s Seventh Framework Programme
(FP/2007-2013) /ERC Grant Agreement no. 340506.'
alternative_title:
- EPiC Series in Computing
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvořák W, Henzinger M, Svozil A. Quasipolynomial set-based symbolic
algorithms for parity games. In: 22nd International Conference on Logic for
Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253.
doi:10.29007/5z5k'
apa: 'Chatterjee, K., Dvořák, W., Henzinger, M., & Svozil, A. (2018). Quasipolynomial
set-based symbolic algorithms for parity games. In 22nd International Conference
on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57,
pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k'
chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander
Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd
International Conference on Logic for Programming, Artificial Intelligence and
Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
ieee: K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Quasipolynomial set-based
symbolic algorithms for parity games,” in 22nd International Conference on
Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia,
2018, vol. 57, pp. 233–253.
ista: 'Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2018. Quasipolynomial set-based
symbolic algorithms for parity games. 22nd International Conference on Logic for
Programming, Artificial Intelligence and Reasoning. LPAR: Logic for Programming,
Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.'
mla: Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms
for Parity Games.” 22nd International Conference on Logic for Programming,
Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53,
doi:10.29007/5z5k.
short: K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, in:, 22nd International
Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair,
2018, pp. 233–253.
conference:
end_date: 2018-11-21
location: Awassa, Ethiopia
name: 'LPAR: Logic for Programming, Artificial Intelligence and Reasoning'
start_date: 2018-11-17
date_created: 2022-03-18T12:46:32Z
date_published: 2018-10-23T00:00:00Z
date_updated: 2025-07-10T11:50:02Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.29007/5z5k
ec_funded: 1
external_id:
arxiv:
- '1909.04983'
file:
- access_level: open_access
checksum: 1229aa8640bd6db610c85decf2265480
content_type: application/pdf
creator: dernst
date_created: 2022-05-17T07:51:08Z
date_updated: 2022-05-17T07:51:08Z
file_id: '11392'
file_name: 2018_EPiCs_Chatterjee.pdf
file_size: 720893
relation: main_file
success: 1
file_date_updated: 2022-05-17T07:51:08Z
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 233-253
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: 22nd International Conference on Logic for Programming, Artificial Intelligence
and Reasoning
publication_identifier:
issn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quasipolynomial set-based symbolic algorithms for parity games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2018'
...
---
_id: '11'
abstract:
- lang: eng
text: We report on a novel strategy to derive mean-field limits of quantum mechanical
systems in which a large number of particles weakly couple to a second-quantized
radiation field. The technique combines the method of counting and the coherent
state approach to study the growth of the correlations among the particles and
in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon
system of equations from the Nelson model with ultraviolet cutoff and possibly
massless scalar field. In particular, we prove the convergence of the reduced
density matrices (of the nonrelativistic particles and the field bosons) associated
with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon
equations in trace norm. Furthermore, we derive explicit bounds on the rate of
convergence of the one-particle reduced density matrix of the nonrelativistic
particles in Sobolev norm.
arxiv: 1
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Peter
full_name: Pickl, Peter
last_name: Pickl
citation:
ama: 'Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised
radiation fields. In: Vol 270. Springer; 2018:185-214. doi:10.1007/978-3-030-01602-9_9'
apa: 'Leopold, N. K., & Pickl, P. (2018). Mean-field limits of particles in
interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented
at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer.
https://doi.org/10.1007/978-3-030-01602-9_9'
chicago: Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in
Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. https://doi.org/10.1007/978-3-030-01602-9_9.
ieee: 'N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction
with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits
of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.'
ista: 'Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction
with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems
vol. 270, 185–214.'
mla: Leopold, Nikolai K., and Peter Pickl. Mean-Field Limits of Particles in
Interaction with Quantised Radiation Fields. Vol. 270, Springer, 2018, pp.
185–214, doi:10.1007/978-3-030-01602-9_9.
short: N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.
conference:
end_date: 2017-04-01
location: Munich, Germany
name: 'MaLiQS: Macroscopic Limits of Quantum Systems'
start_date: 2017-03-30
date_created: 2018-12-11T11:44:08Z
date_published: 2018-10-27T00:00:00Z
date_updated: 2021-01-12T06:48:16Z
day: '27'
department:
- _id: RoSe
doi: 10.1007/978-3-030-01602-9_9
ec_funded: 1
external_id:
arxiv:
- '1806.10843'
intvolume: ' 270'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.10843
month: '10'
oa: 1
oa_version: Preprint
page: 185 - 214
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication_status: published
publisher: Springer
publist_id: '8045'
quality_controlled: '1'
scopus_import: 1
status: public
title: Mean-field limits of particles in interaction with quantised radiation fields
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 270
year: '2018'
...
---
_id: '23'
abstract:
- lang: eng
text: The strong atomistic spin–orbit coupling of holes makes single-shot spin readout
measurements difficult because it reduces the spin lifetimes. By integrating the
charge sensor into a high bandwidth radio frequency reflectometry setup, we were
able to demonstrate single-shot readout of a germanium quantum dot hole spin and
measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT
are reported, with a total readout visibility of about 70%. By analyzing separately
the spin-to-charge conversion and charge readout fidelities, we have obtained
insight into the processes limiting the visibilities of hole spins. The analyses
suggest that high hole visibilities are feasible at realistic experimental conditions,
underlying the potential of hole spins for the realization of viable qubit devices.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukušić, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukušić
orcid: 0000-0003-2424-8636
- first_name: Josip
full_name: Kukucka, Josip
id: 3F5D8856-F248-11E8-B48F-1D18A9856A87
last_name: Kukucka
- first_name: Hannes
full_name: Watzinger, Hannes
id: 35DF8E50-F248-11E8-B48F-1D18A9856A87
last_name: Watzinger
- first_name: Joshua M
full_name: Milem, Joshua M
id: 4CDE0A96-F248-11E8-B48F-1D18A9856A87
last_name: Milem
- first_name: Friedrich
full_name: Schäffler, Friedrich
last_name: Schäffler
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
citation:
ama: Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot
readout of hole spins in Ge. Nano Letters. 2018;18(11):7141-7145. doi:10.1021/acs.nanolett.8b03217
apa: Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., &
Katsaros, G. (2018). Single-shot readout of hole spins in Ge. Nano Letters.
American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b03217
chicago: Vukušić, Lada, Josip Kukucka, Hannes Watzinger, Joshua M Milem, Friedrich
Schäffler, and Georgios Katsaros. “Single-Shot Readout of Hole Spins in Ge.” Nano
Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b03217.
ieee: L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros,
“Single-shot readout of hole spins in Ge,” Nano Letters, vol. 18, no. 11.
American Chemical Society, pp. 7141–7145, 2018.
ista: Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. 2018.
Single-shot readout of hole spins in Ge. Nano Letters. 18(11), 7141–7145.
mla: Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters,
vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:10.1021/acs.nanolett.8b03217.
short: L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros,
Nano Letters 18 (2018) 7141–7145.
date_created: 2018-12-11T11:44:13Z
date_published: 2018-10-25T00:00:00Z
date_updated: 2026-04-08T14:09:47Z
day: '25'
ddc:
- '530'
department:
- _id: GeKa
doi: 10.1021/acs.nanolett.8b03217
ec_funded: 1
external_id:
isi:
- '000451102100064'
pmid:
- '30359041'
file:
- access_level: open_access
checksum: 3e6034a94c6b5335e939145d88bdb371
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:08Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5194'
file_name: IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf
file_size: 1361441
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
issue: '11'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 7141 - 7145
pmid: 1
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335497'
name: Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires
publication: Nano Letters
publication_identifier:
issn:
- 1530-6984
publication_status: published
publisher: American Chemical Society
publist_id: '8032'
pubrep_id: '1065'
quality_controlled: '1'
related_material:
record:
- id: '7977'
relation: popular_science
- id: '7996'
relation: dissertation_contains
status: public
- id: '69'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Single-shot readout of hole spins in Ge
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: 18
year: '2018'
...
---
_id: '24'
abstract:
- lang: eng
text: Partially-observable Markov decision processes (POMDPs) with discounted-sum
payoff are a standard framework to model a wide range of problems related to decision
making under uncertainty. Traditionally, the goal has been to obtain policies
that optimize the expectation of the discounted-sum payoff. A key drawback of
the expectation measure is that even low probability events with extreme payoff
can significantly affect the expectation, and thus the obtained policies are not
necessarily risk-averse. An alternate approach is to optimize the probability
that the payoff is above a certain threshold, which allows obtaining risk-averse
policies, but ignores optimization of the expectation. We consider the expectation
optimization with probabilistic guarantee (EOPG) problem, where the goal is to
optimize the expectation ensuring that the payoff is above a given threshold with
at least a specified probability. We present several results on the EOPG problem,
including the first algorithm to solve it.
acknowledgement: "This research was supported by the Vienna Science and Technology
Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and
an ERC Start Grant (279307:Graph Games).\r\n"
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: Adrian
full_name: Elgyütt, Adrian
id: 4A2E9DBA-F248-11E8-B48F-1D18A9856A87
last_name: Elgyütt
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Owen
full_name: Rouillé, Owen
last_name: Rouillé
citation:
ama: 'Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with
probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018.
IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652'
apa: 'Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation
optimization with probabilistic guarantees in POMDPs with discounted-sum objectives
(Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference
on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652'
chicago: Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé.
“Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum
Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.
ieee: 'K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization
with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented
at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm,
Sweden, 2018, vol. 2018, pp. 4692–4699.'
ista: 'Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization
with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI:
International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.'
mla: Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic
Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018,
pp. 4692–99, doi:10.24963/ijcai.2018/652.
short: K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp.
4692–4699.
conference:
end_date: 2018-07-19
location: Stockholm, Sweden
name: 'IJCAI: International Joint Conference on Artificial Intelligence'
start_date: 2018-07-13
date_created: 2018-12-11T11:44:13Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2025-04-14T13:51:04Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.24963/ijcai.2018/652
ec_funded: 1
external_id:
arxiv:
- '1804.10601'
isi:
- '000764175404117'
intvolume: ' 2018'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.10601
month: '07'
oa: 1
oa_version: Preprint
page: 4692 - 4699
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: IJCAI
publist_id: '8031'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum
objectives
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2018
year: '2018'
...
---
_id: '25'
abstract:
- lang: eng
text: 'Partially observable Markov decision processes (POMDPs) are the standard
models for planning under uncertainty with both finite and infinite horizon. Besides
the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs)
is another classical objective for POMDPs. In this case, given a set of target
states and a positive cost for each transition, the optimization objective is
to minimize the expected total cost until a target state is reached. In the literature,
RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving
Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees,
and HSVI may even fail to terminate its trials. We give the following contributions:
(1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they
prevent the original HSVI from converging. (2) We present a novel algorithm inspired
by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees.
(3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples.'
acknowledgement: '∗This work has been supported by Vienna Science and Technology Fund
(WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE),
and ERC Starting grant (279307: Graph Games). This research was sponsored by the
Army Research Laboratory and was accomplished under Cooperative Agreement Number
W911NF-13-2-0045 (ARL Cyber Security CRA). '
article_processing_charge: No
author:
- first_name: Karel
full_name: Horák, Karel
last_name: Horák
- first_name: Branislav
full_name: Bošanský, Branislav
last_name: Bošanský
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration
for goal-POMDPs. In: Proceedings of the Twenty-Seventh International Joint
Conference on Artificial Intelligence. Vol 2018-July. IJCAI; 2018:4764-4770.
doi:10.24963/ijcai.2018/662'
apa: 'Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic
search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh
International Joint Conference on Artificial Intelligence (Vol. 2018–July,
pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662'
chicago: 'Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI:
Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh
International Joint Conference on Artificial Intelligence, 2018–July:4764–70.
IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.'
ieee: 'K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value
iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International
Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol.
2018–July, pp. 4764–4770.'
ista: 'Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value
iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint
Conference on Artificial Intelligence. IJCAI: International Joint Conference on
Artificial Intelligence vol. 2018–July, 4764–4770.'
mla: 'Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.”
Proceedings of the Twenty-Seventh International Joint Conference on Artificial
Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.'
short: K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh
International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.
conference:
end_date: 2018-07-19
location: Stockholm, Sweden
name: 'IJCAI: International Joint Conference on Artificial Intelligence'
start_date: 2018-07-13
date_created: 2018-12-11T11:44:13Z
date_published: 2018-07-01T00:00:00Z
date_updated: 2026-06-18T18:34:17Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.24963/ijcai.2018/662
ec_funded: 1
external_id:
isi:
- '000764175404127'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.24963/ijcai.2018/662
month: '07'
oa: 1
oa_version: Published Version
page: 4764 - 4770
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Proceedings of the Twenty-Seventh International Joint Conference on Artificial
Intelligence
publication_status: published
publisher: IJCAI
publist_id: '8030'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Goal-HSVI: Heuristic search value iteration for goal-POMDPs'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2018-July
year: '2018'
...
---
_id: '273'
abstract:
- lang: eng
text: The accuracy of information retrieval systems is often measured using complex
loss functions such as the average precision (AP) or the normalized discounted
cumulative gain (NDCG). Given a set of positive and negative samples, the parameters
of a retrieval system can be estimated by minimizing these loss functions. However,
the non-differentiability and non-decomposability of these loss functions does
not allow for simple gradient based optimization algorithms. This issue is generally
circumvented by either optimizing a structured hinge-loss upper bound to the loss
function or by using asymptotic methods like the direct-loss minimization framework.
Yet, the high computational complexity of loss-augmented inference, which is necessary
for both the frameworks, prohibits its use in large training data sets. To alleviate
this deficiency, we present a novel quicksort flavored algorithm for a large class
of non-decomposable loss functions. We provide a complete characterization of
the loss functions that are amenable to our algorithm, and show that it includes
both AP and NDCG based loss functions. Furthermore, we prove that no comparison
based algorithm can improve upon the computational complexity of our approach
asymptotically. We demonstrate the effectiveness of our approach in the context
of optimizing the structured hinge loss upper bound of AP and NDCG loss for learning
models for a variety of vision tasks. We show that our approach provides significantly
better results than simpler decomposable loss functions, while requiring a comparable
training time.
article_processing_charge: No
arxiv: 1
author:
- first_name: Pritish
full_name: Mohapatra, Pritish
last_name: Mohapatra
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
- first_name: C V
full_name: Jawahar, C V
last_name: Jawahar
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: M Pawan
full_name: Kumar, M Pawan
last_name: Kumar
citation:
ama: 'Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization
for rank-based loss functions. In: 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. IEEE; 2018:3693-3701. doi:10.1109/cvpr.2018.00389'
apa: 'Mohapatra, P., Rolinek, M., Jawahar, C. V., Kolmogorov, V., & Kumar, M.
P. (2018). Efficient optimization for rank-based loss functions. In 2018 IEEE/CVF
Conference on Computer Vision and Pattern Recognition (pp. 3693–3701). Salt
Lake City, UT, USA: IEEE. https://doi.org/10.1109/cvpr.2018.00389'
chicago: Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and
M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.” In 2018
IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701.
IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00389.
ieee: P. Mohapatra, M. Rolinek, C. V. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient
optimization for rank-based loss functions,” in 2018 IEEE/CVF Conference on
Computer Vision and Pattern Recognition, Salt Lake City, UT, USA, 2018, pp.
3693–3701.
ista: 'Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. 2018. Efficient
optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer
Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern
Recognition, 3693–3701.'
mla: Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.”
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE,
2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
short: P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018
IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp.
3693–3701.
conference:
end_date: 2018-06-22
location: Salt Lake City, UT, USA
name: 'CVPR: Conference on Computer Vision and Pattern Recognition'
start_date: 2018-06-18
date_created: 2018-12-11T11:45:33Z
date_published: 2018-06-28T00:00:00Z
date_updated: 2024-11-04T13:52:32Z
day: '28'
department:
- _id: VlKo
doi: 10.1109/cvpr.2018.00389
ec_funded: 1
external_id:
arxiv:
- '1604.08269'
isi:
- '000457843603087'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.08269
month: '06'
oa: 1
oa_version: Preprint
page: 3693-3701
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
publication_identifier:
isbn:
- '9781538664209'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient optimization for rank-based loss functions
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '275'
abstract:
- lang: eng
text: Lymphatic endothelial cells (LECs) release extracellular chemokines to guide
the migration of dendritic cells. In this study, we report that LECs also release
basolateral exosome-rich endothelial vesicles (EEVs) that are secreted in greater
numbers in the presence of inflammatory cytokines and accumulate in the perivascular
stroma of small lymphatic vessels in human chronic inflammatory diseases. Proteomic
analyses of EEV fractions identified > 1,700 cargo proteins and revealed a
dominant motility-promoting protein signature. In vitro and ex vivo EEV fractions
augmented cellular protrusion formation in a CX3CL1/fractalkine-dependent fashion
and enhanced the directional migratory response of human dendritic cells along
guidance cues. We conclude that perilymphatic LEC exosomes enhance exploratory
behavior and thus promote directional migration of CX3CR1-expressing cells in
complex tissue environments.
acknowledgement: M. Brown was supported by the Cell Communication in Health and Disease
Graduate Study Program of the Austrian Science Fund and Medizinische Universität
Wien, M. Sixt by the European Research Council (ERC GA 281556) and an Austrian Science
Fund START award, K.L. Bennett by the Austrian Academy of Sciences, D.G. Jackson
and L.A. Johnson by Unit Funding (MC_UU_12010/2) and project grants from the Medical
Research Council (G1100134 and MR/L008610/1), and M. Detmar by the Schweizerischer
Nationalfonds zur Förderung der Wissenschaftlichen Forschung and Advanced European
Research Council grant LYVICAM. K. Vaahtomeri was supported by an Academy of Finland
postdoctoral research grant (287853). This project has received funding from the
European Union’s Horizon 2020 research and innovation program under grant agreement
No. 668036 (RELENT).
article_processing_charge: No
author:
- first_name: Markus
full_name: Brown, Markus
id: 3DAB9AFC-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Louise
full_name: Johnson, Louise
last_name: Johnson
- first_name: Dario
full_name: Leone, Dario
last_name: Leone
- first_name: Peter
full_name: Májek, Peter
last_name: Májek
- first_name: Kari
full_name: Vaahtomeri, Kari
id: 368EE576-F248-11E8-B48F-1D18A9856A87
last_name: Vaahtomeri
orcid: 0000-0001-7829-3518
- first_name: Daniel
full_name: Senfter, Daniel
last_name: Senfter
- first_name: Nora
full_name: Bukosza, Nora
last_name: Bukosza
- first_name: Helga
full_name: Schachner, Helga
last_name: Schachner
- first_name: Gabriele
full_name: Asfour, Gabriele
last_name: Asfour
- first_name: Brigitte
full_name: Langer, Brigitte
last_name: Langer
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Katja
full_name: Parapatics, Katja
last_name: Parapatics
- first_name: Young
full_name: Hong, Young
last_name: Hong
- first_name: Keiryn
full_name: Bennett, Keiryn
last_name: Bennett
- first_name: Renate
full_name: Kain, Renate
last_name: Kain
- first_name: Michael
full_name: Detmar, Michael
last_name: Detmar
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: David
full_name: Jackson, David
last_name: Jackson
- first_name: Dontscho
full_name: Kerjaschki, Dontscho
last_name: Kerjaschki
citation:
ama: Brown M, Johnson L, Leone D, et al. Lymphatic exosomes promote dendritic cell
migration along guidance cues. Journal of Cell Biology. 2018;217(6):2205-2221.
doi:10.1083/jcb.201612051
apa: Brown, M., Johnson, L., Leone, D., Májek, P., Vaahtomeri, K., Senfter, D.,
… Kerjaschki, D. (2018). Lymphatic exosomes promote dendritic cell migration along
guidance cues. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.201612051
chicago: Brown, Markus, Louise Johnson, Dario Leone, Peter Májek, Kari Vaahtomeri,
Daniel Senfter, Nora Bukosza, et al. “Lymphatic Exosomes Promote Dendritic Cell
Migration along Guidance Cues.” Journal of Cell Biology. Rockefeller University
Press, 2018. https://doi.org/10.1083/jcb.201612051.
ieee: M. Brown et al., “Lymphatic exosomes promote dendritic cell migration
along guidance cues,” Journal of Cell Biology, vol. 217, no. 6. Rockefeller
University Press, pp. 2205–2221, 2018.
ista: Brown M, Johnson L, Leone D, Májek P, Vaahtomeri K, Senfter D, Bukosza N,
Schachner H, Asfour G, Langer B, Hauschild R, Parapatics K, Hong Y, Bennett K,
Kain R, Detmar M, Sixt MK, Jackson D, Kerjaschki D. 2018. Lymphatic exosomes promote
dendritic cell migration along guidance cues. Journal of Cell Biology. 217(6),
2205–2221.
mla: Brown, Markus, et al. “Lymphatic Exosomes Promote Dendritic Cell Migration
along Guidance Cues.” Journal of Cell Biology, vol. 217, no. 6, Rockefeller
University Press, 2018, pp. 2205–21, doi:10.1083/jcb.201612051.
short: M. Brown, L. Johnson, D. Leone, P. Májek, K. Vaahtomeri, D. Senfter, N. Bukosza,
H. Schachner, G. Asfour, B. Langer, R. Hauschild, K. Parapatics, Y. Hong, K. Bennett,
R. Kain, M. Detmar, M.K. Sixt, D. Jackson, D. Kerjaschki, Journal of Cell Biology
217 (2018) 2205–2221.
corr_author: '1'
date_created: 2018-12-11T11:45:33Z
date_published: 2018-04-12T00:00:00Z
date_updated: 2025-04-14T13:10:20Z
day: '12'
ddc:
- '570'
department:
- _id: MiSi
- _id: Bio
doi: 10.1083/jcb.201612051
ec_funded: 1
external_id:
isi:
- '000438077800026'
pmid:
- '29650776'
file:
- access_level: open_access
checksum: 9c7eba51a35c62da8c13f98120b64df4
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:50:07Z
date_updated: 2020-07-14T12:45:45Z
file_id: '5704'
file_name: 2018_JournalCellBiology_Brown.pdf
file_size: 2252043
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: ' 217'
isi: 1
issue: '6'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 2205 - 2221
pmid: 1
project:
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y 564-B12
name: Cytoskeletal force generation and force transduction of migrating leukocytes
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Journal of Cell Biology
publication_status: published
publisher: Rockefeller University Press
publist_id: '7627'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lymphatic exosomes promote dendritic cell migration along guidance cues
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: 217
year: '2018'
...
---
_id: '276'
abstract:
- lang: eng
text: Directed migration of cells relies on their ability to sense directional guidance
cues and to interact with pericellular structures in order to transduce contractile
cytoskeletal- into mechanical forces. These biomechanical processes depend highly
on microenvironmental factors such as exposure to 2D surfaces or 3D matrices.
In vivo, the majority of cells are exposed to 3D environments. Data on 3D cell
migration are mostly derived from intravital microscopy or collagen-based in vitro
assays. Both approaches offer only limited controlla-bility of experimental conditions.
Here, we developed an automated microfluidic system that allows positioning of
cells in 3D microenvironments containing highly controlled diffusion-based chemokine
gradients. Tracking migration in such gradients was feasible in real time at the
single cell level. Moreover, the setup allowed on-chip immunocytochemistry and
thus linking of functional with phenotypical properties in individual cells. Spatially
defined retrieval of cells from the device allows down-stream off-chip analysis.
Using dendritic cells as a model, our setup specifically allowed us for the first
time to quantitate key migration characteristics of cells exposed to identical
gradients of the chemokine CCL19 yet placed on 2D vs in 3D environments. Migration
properties between 2D and 3D migration were distinct. Morphological features of
cells migrating in an in vitro 3D environment were similar to those of cells migrating
in animal tissues, but different from cells migrating on a surface. Our system
thus offers a highly controllable in vitro-mimic of a 3D environment that cells
traffic in vivo.
acknowledgement: This work was supported by the Swiss National Science Foundation
(MD-PhD fellowships, 323530_164221 to C.F.; and 323630_151483 to A.J.; grant PZ00P3_144863
to M.R, grant 31003A_156431 to T.S.; PZ00P3_148000 to C.T.B.; PZ00P3_154733 to M.M.),
a Novartis “FreeNovation” grant to M.M. and T.S. and an EMBO long-term fellowship
(ALTF 1396-2014) co-funded by the European Commission (LTFCOFUND2013, GA-2013-609409)
to J.R.. M.R. was supported by the Gebert Rüf Foundation (GRS 058/14). The funders
had no role in study design, data collection and analysis, decision to publish,
or preparation of the manuscript.
article_number: e0198330
article_processing_charge: No
article_type: original
author:
- first_name: Corina
full_name: Frick, Corina
last_name: Frick
- first_name: Philip
full_name: Dettinger, Philip
last_name: Dettinger
- first_name: Jörg
full_name: Renkawitz, Jörg
id: 3F0587C8-F248-11E8-B48F-1D18A9856A87
last_name: Renkawitz
orcid: 0000-0003-2856-3369
- first_name: Annaïse
full_name: Jauch, Annaïse
last_name: Jauch
- first_name: Christoph
full_name: Berger, Christoph
last_name: Berger
- first_name: Mike
full_name: Recher, Mike
last_name: Recher
- first_name: Timm
full_name: Schroeder, Timm
last_name: Schroeder
- first_name: Matthias
full_name: Mehling, Matthias
last_name: Mehling
citation:
ama: Frick C, Dettinger P, Renkawitz J, et al. Nano-scale microfluidics to study
3D chemotaxis at the single cell level. PLoS One. 2018;13(6). doi:10.1371/journal.pone.0198330
apa: Frick, C., Dettinger, P., Renkawitz, J., Jauch, A., Berger, C., Recher, M.,
… Mehling, M. (2018). Nano-scale microfluidics to study 3D chemotaxis at the single
cell level. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0198330
chicago: Frick, Corina, Philip Dettinger, Jörg Renkawitz, Annaïse Jauch, Christoph
Berger, Mike Recher, Timm Schroeder, and Matthias Mehling. “Nano-Scale Microfluidics
to Study 3D Chemotaxis at the Single Cell Level.” PLoS One. Public Library
of Science, 2018. https://doi.org/10.1371/journal.pone.0198330.
ieee: C. Frick et al., “Nano-scale microfluidics to study 3D chemotaxis at
the single cell level,” PLoS One, vol. 13, no. 6. Public Library of Science,
2018.
ista: Frick C, Dettinger P, Renkawitz J, Jauch A, Berger C, Recher M, Schroeder
T, Mehling M. 2018. Nano-scale microfluidics to study 3D chemotaxis at the single
cell level. PLoS One. 13(6), e0198330.
mla: Frick, Corina, et al. “Nano-Scale Microfluidics to Study 3D Chemotaxis at the
Single Cell Level.” PLoS One, vol. 13, no. 6, e0198330, Public Library
of Science, 2018, doi:10.1371/journal.pone.0198330.
short: C. Frick, P. Dettinger, J. Renkawitz, A. Jauch, C. Berger, M. Recher, T.
Schroeder, M. Mehling, PLoS One 13 (2018).
date_created: 2018-12-11T11:45:34Z
date_published: 2018-06-07T00:00:00Z
date_updated: 2023-09-13T09:00:15Z
day: '07'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1371/journal.pone.0198330
external_id:
isi:
- '000434384900031'
file:
- access_level: open_access
checksum: 95fc5dc3938b3ad3b7697d10c83cc143
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T14:10:32Z
date_updated: 2020-07-14T12:45:45Z
file_id: '5709'
file_name: 2018_Plos_Frick.pdf
file_size: 7682167
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '7626'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nano-scale microfluidics to study 3D chemotaxis at the single cell level
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: 13
year: '2018'
...
---
_id: '277'
abstract:
- lang: eng
text: 'Arabidopsis and human ARM protein interact with telomerase. Deregulated mRNA
levels of DNA repair and ribosomal protein genes in an Arabidopsis arm mutant
suggest non-telomeric ARM function. The human homolog ARMC6 interacts with hTRF2.
Abstract: Telomerase maintains telomeres and has proposed non-telomeric functions.
We previously identified interaction of the C-terminal domain of Arabidopsis telomerase
reverse transcriptase (AtTERT) with an armadillo/β-catenin-like repeat (ARM) containing
protein. Here we explore protein–protein interactions of the ARM protein, AtTERT
domains, POT1a, TRF-like family and SMH family proteins, and the chromatin remodeling
protein CHR19 using bimolecular fluorescence complementation (BiFC), yeast two-hybrid
(Y2H) analysis, and co-immunoprecipitation. The ARM protein interacts with both
the N- and C-terminal domains of AtTERT in different cellular compartments. ARM
interacts with CHR19 and TRF-like I family proteins that also bind AtTERT directly
or through interaction with POT1a. The putative human ARM homolog co-precipitates
telomerase activity and interacts with hTRF2 protein in vitro. Analysis of Arabidopsis
arm mutants shows no obvious changes in telomere length or telomerase activity,
suggesting that ARM is not essential for telomere maintenance. The observed interactions
with telomerase and Myb-like domain proteins (TRF-like family I) may therefore
reflect possible non-telomeric functions. Transcript levels of several DNA repair
and ribosomal genes are affected in arm mutants, and ARM, likely in association
with other proteins, suppressed expression of XRCC3 and RPSAA promoter constructs
in luciferase reporter assays. In conclusion, ARM can participate in non-telomeric
functions of telomerase, and can also perform its own telomerase-independent functions.'
article_processing_charge: No
article_type: original
author:
- first_name: Ladislav
full_name: Dokládal, Ladislav
last_name: Dokládal
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: David
full_name: Honys, David
last_name: Honys
- first_name: Nikoleta
full_name: Dupláková, Nikoleta
last_name: Dupláková
- first_name: Lan
full_name: Lee, Lan
last_name: Lee
- first_name: Stanton
full_name: Gelvin, Stanton
last_name: Gelvin
- first_name: Eva
full_name: Sýkorová, Eva
last_name: Sýkorová
citation:
ama: Dokládal L, Benková E, Honys D, et al. An armadillo-domain protein participates
in a telomerase interaction network. Plant Molecular Biology. 2018;97(5):407-420.
doi:10.1007/s11103-018-0747-4
apa: Dokládal, L., Benková, E., Honys, D., Dupláková, N., Lee, L., Gelvin, S., &
Sýkorová, E. (2018). An armadillo-domain protein participates in a telomerase
interaction network. Plant Molecular Biology. Springer. https://doi.org/10.1007/s11103-018-0747-4
chicago: Dokládal, Ladislav, Eva Benková, David Honys, Nikoleta Dupláková, Lan Lee,
Stanton Gelvin, and Eva Sýkorová. “An Armadillo-Domain Protein Participates in
a Telomerase Interaction Network.” Plant Molecular Biology. Springer, 2018.
https://doi.org/10.1007/s11103-018-0747-4.
ieee: L. Dokládal et al., “An armadillo-domain protein participates in a
telomerase interaction network,” Plant Molecular Biology, vol. 97, no.
5. Springer, pp. 407–420, 2018.
ista: Dokládal L, Benková E, Honys D, Dupláková N, Lee L, Gelvin S, Sýkorová E.
2018. An armadillo-domain protein participates in a telomerase interaction network.
Plant Molecular Biology. 97(5), 407–420.
mla: Dokládal, Ladislav, et al. “An Armadillo-Domain Protein Participates in a Telomerase
Interaction Network.” Plant Molecular Biology, vol. 97, no. 5, Springer,
2018, pp. 407–20, doi:10.1007/s11103-018-0747-4.
short: L. Dokládal, E. Benková, D. Honys, N. Dupláková, L. Lee, S. Gelvin, E. Sýkorová,
Plant Molecular Biology 97 (2018) 407–420.
date_created: 2018-12-11T11:45:34Z
date_published: 2018-06-12T00:00:00Z
date_updated: 2023-09-08T13:21:05Z
day: '12'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.1007/s11103-018-0747-4
external_id:
isi:
- '000438981700009'
file:
- access_level: open_access
checksum: 451ae47616e6af2533099f596b2a47fb
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T12:23:08Z
date_updated: 2020-07-14T12:45:45Z
file_id: '7834'
file_name: 2018_PlantMolecBio_Dokladal.pdf
file_size: 1150679
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
has_accepted_license: '1'
intvolume: ' 97'
isi: 1
issue: '5'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 407 - 420
publication: Plant Molecular Biology
publication_status: published
publisher: Springer
publist_id: '7625'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An armadillo-domain protein participates in a telomerase interaction network
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 97
year: '2018'
...
---
OA_place: publisher
_id: '278'
abstract:
- lang: eng
text: 'Consortial subscription contracts regulate the digital access to publications
between publishers and scientific libraries. However, since a couple of years
the tendency towards a freely accessible publishing (Open Access) intensifies.
As a consequence of this trend the contractual relationship between licensor and
licensee is gradually changing as well: More and more contracts exercise influence
on open access publishing. The present study attempts to compare Austrian examples
of consortial licence contracts, which include components of open access. It describes
the difference between pure subscription contracts and differing innovative deals
including open access components. Thereby it becomes obvious that for the evaluation
of this licence contracts new methods are needed. An essential new element of
such analyses is the evaluation of the open access publication numbers. So this
study tries to carry out such publication analyses for Austrian open access deals
focusing on quantitative questions: How does the number of publications evolve?
How does the open access share change? Publications reports of the publishers
and database queries from Scopus form the data basis. The analysis of the data
points out that differing approaches of contracts result in highly divergent results:
Particular deals can prioritize a saving in costs or else the increase of the
open access rate. It is to be assumed that within the following years further
numerous open access deals will be negotiated. The finding of this study shall
provide guidance.'
article_processing_charge: No
author:
- first_name: Márton
full_name: Villányi, Márton
id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
last_name: Villányi
orcid: 0000-0001-8126-0426
citation:
ama: Villányi M. Lizenzverträge mit Open-Access-Komponenten an österreichischen
Bibliotheken. 2018.
apa: Villányi, M. (2018). Lizenzverträge mit Open-Access-Komponenten an österreichischen
Bibliotheken. Universität Wien.
chicago: Villányi, Márton. “Lizenzverträge mit Open-Access-Komponenten an österreichischen
Bibliotheken.” Universität Wien, 2018.
ieee: M. Villányi, “Lizenzverträge mit Open-Access-Komponenten an österreichischen
Bibliotheken,” Universität Wien, 2018.
ista: Villányi M. 2018. Lizenzverträge mit Open-Access-Komponenten an österreichischen
Bibliotheken. Universität Wien.
mla: Villányi, Márton. Lizenzverträge mit Open-Access-Komponenten an österreichischen
Bibliotheken. Universität Wien, 2018.
short: M. Villányi, Lizenzverträge mit Open-Access-Komponenten an österreichischen
Bibliotheken, Universität Wien, 2018.
date_created: 2018-12-11T11:45:34Z
date_published: 2018-04-06T00:00:00Z
date_updated: 2026-06-18T18:35:07Z
day: '06'
ddc:
- '020'
department:
- _id: E-Lib
language:
- iso: ger
main_file_link:
- open_access: '1'
url: http://othes.univie.ac.at/51113/
month: '04'
oa: 1
oa_version: Published Version
page: '94'
publication_status: published
publisher: Universität Wien
publist_id: '7624'
related_material:
record:
- id: '5577'
relation: dissertation_contains
status: public
- id: '5574'
relation: dissertation_contains
status: public
- id: '5578'
relation: dissertation_contains
status: public
- id: '5579'
relation: dissertation_contains
status: public
- id: '5576'
relation: dissertation_contains
status: public
- id: '5575'
relation: dissertation_contains
status: public
- id: '5582'
relation: dissertation_contains
status: public
- id: '5581'
relation: dissertation_contains
status: public
- id: '5580'
relation: dissertation_contains
status: public
status: public
supervisor:
- first_name: Brigitte
full_name: Kromp, Brigitte
last_name: Kromp
title: Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '279'
abstract:
- lang: eng
text: 'Background: Natural selection shapes cancer genomes. Previous studies used
signatures of positive selection to identify genes driving malignant transformation.
However, the contribution of negative selection against somatic mutations that
affect essential tumor functions or specific domains remains a controversial topic.
Results: Here, we analyze 7546 individual exomes from 26 tumor types from TCGA
data to explore the portion of the cancer exome under negative selection. Although
we find most of the genes neutrally evolving in a pan-cancer framework, we identify
essential cancer genes and immune-exposed protein regions under significant negative
selection. Moreover, our simulations suggest that the amount of negative selection
is underestimated. We therefore choose an empirical approach to identify genes,
functions, and protein regions under negative selection. We find that expression
and mutation status of negatively selected genes is indicative of patient survival.
Processes that are most strongly conserved are those that play fundamental cellular
roles such as protein synthesis, glucose metabolism, and molecular transport.
Intriguingly, we observe strong signals of selection in the immunopeptidome and
proteins controlling peptide exposition, highlighting the importance of immune
surveillance evasion. Additionally, tumor type-specific immune activity correlates
with the strength of negative selection on human epitopes. Conclusions: In summary,
our results show that negative selection is a hallmark of cell essentiality and
immune response in cancer. The functional domains identified could be exploited
therapeutically, ultimately allowing for the development of novel cancer treatments.'
article_number: '67'
article_processing_charge: No
author:
- first_name: Luis
full_name: Zapata, Luis
last_name: Zapata
- first_name: Oriol
full_name: Pich, Oriol
last_name: Pich
- first_name: Luis
full_name: Serrano, Luis
last_name: Serrano
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Stephan
full_name: Ossowski, Stephan
last_name: Ossowski
- first_name: Martin
full_name: Schaefer, Martin
last_name: Schaefer
citation:
ama: Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. Negative
selection in tumor genome evolution acts on essential cellular functions and the
immunopeptidome. Genome Biology. 2018;19. doi:10.1186/s13059-018-1434-0
apa: Zapata, L., Pich, O., Serrano, L., Kondrashov, F., Ossowski, S., & Schaefer,
M. (2018). Negative selection in tumor genome evolution acts on essential cellular
functions and the immunopeptidome. Genome Biology. BioMed Central. https://doi.org/10.1186/s13059-018-1434-0
chicago: Zapata, Luis, Oriol Pich, Luis Serrano, Fyodor Kondrashov, Stephan Ossowski,
and Martin Schaefer. “Negative Selection in Tumor Genome Evolution Acts on Essential
Cellular Functions and the Immunopeptidome.” Genome Biology. BioMed Central,
2018. https://doi.org/10.1186/s13059-018-1434-0.
ieee: L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, and M. Schaefer,
“Negative selection in tumor genome evolution acts on essential cellular functions
and the immunopeptidome,” Genome Biology, vol. 19. BioMed Central, 2018.
ista: Zapata L, Pich O, Serrano L, Kondrashov F, Ossowski S, Schaefer M. 2018. Negative
selection in tumor genome evolution acts on essential cellular functions and the
immunopeptidome. Genome Biology. 19, 67.
mla: Zapata, Luis, et al. “Negative Selection in Tumor Genome Evolution Acts on
Essential Cellular Functions and the Immunopeptidome.” Genome Biology,
vol. 19, 67, BioMed Central, 2018, doi:10.1186/s13059-018-1434-0.
short: L. Zapata, O. Pich, L. Serrano, F. Kondrashov, S. Ossowski, M. Schaefer,
Genome Biology 19 (2018).
date_created: 2018-12-11T11:45:35Z
date_published: 2018-05-31T00:00:00Z
date_updated: 2025-04-15T08:30:30Z
day: '31'
ddc:
- '570'
department:
- _id: FyKo
doi: 10.1186/s13059-018-1434-0
ec_funded: 1
external_id:
isi:
- '000433986200001'
file:
- access_level: open_access
checksum: f3e4922486bd9bf1483271bdbed394a7
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T14:05:01Z
date_updated: 2020-07-14T12:45:47Z
file_id: '5708'
file_name: 2018_GenomeBiology_Zapata.pdf
file_size: 1414722
relation: main_file
file_date_updated: 2020-07-14T12:45:47Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 26120F5C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335980'
name: Systematic investigation of epistasis in molecular evolution
publication: Genome Biology
publication_status: published
publisher: BioMed Central
publist_id: '7620'
quality_controlled: '1'
related_material:
record:
- id: '9811'
relation: research_data
status: public
- id: '9812'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Negative selection in tumor genome evolution acts on essential cellular functions
and the immunopeptidome
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: 19
year: '2018'
...
---
_id: '280'
abstract:
- lang: eng
text: Flowers have a species-specific functional life span that determines the time
window in which pollination, fertilization and seed set can occur. The stigma
tissue plays a key role in flower receptivity by intercepting pollen and initiating
pollen tube growth toward the ovary. In this article, we show that a developmentally
controlled cell death programme terminates the functional life span of stigma
cells in Arabidopsis. We identified the leaf senescence regulator ORESARA1 (also
known as ANAC092) and the previously uncharacterized KIRA1 (also known as ANAC074)
as partially redundant transcription factors that modulate stigma longevity by
controlling the expression of programmed cell death-associated genes. KIRA1 expression
is sufficient to induce cell death and terminate floral receptivity, whereas lack
of both KIRA1 and ORESARA1 substantially increases stigma life span. Surprisingly,
the extension of stigma longevity is accompanied by only a moderate extension
of flower receptivity, suggesting that additional processes participate in the
control of the flower's receptive life span.
acknowledgement: We gratefully acknowledge funding from the Chinese Scholarship Council
(CSC; project number 201206910025 to Z.G.), the Fonds Wetenschappelijk Onderzoek
(FWO; project number G005112N to A.D.; fellowship number 12I7417N to Z.L.), the
Belgian Federal Science Policy Office (BELSPO; to Y.S.), the Agency for Innovation
by Science and Technology of Belgium (IWT; fellowship number 121110 to M.V.D.),
the Hercules foundation (grant AUGE-09-029 to K.D.), and the ERC StG PROCELLDEATH
(project number 639234 to M.K.N.).
article_processing_charge: No
author:
- first_name: Zhen
full_name: Gao, Zhen
last_name: Gao
- first_name: Anna
full_name: Daneva, Anna
last_name: Daneva
- first_name: Yuliya
full_name: Salanenka, Yuliya
id: 46DAAE7E-F248-11E8-B48F-1D18A9856A87
last_name: Salanenka
- first_name: Matthias
full_name: Van Durme, Matthias
last_name: Van Durme
- first_name: Marlies
full_name: Huysmans, Marlies
last_name: Huysmans
- first_name: Zongcheng
full_name: Lin, Zongcheng
last_name: Lin
- first_name: Freya
full_name: De Winter, Freya
last_name: De Winter
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Mansour
full_name: Karimi, Mansour
last_name: Karimi
- first_name: Jan
full_name: Van De Velde, Jan
last_name: Van De Velde
- first_name: Klaas
full_name: Vandepoele, Klaas
last_name: Vandepoele
- first_name: Davy
full_name: Van De Walle, Davy
last_name: Van De Walle
- first_name: Koen
full_name: Dewettinck, Koen
last_name: Dewettinck
- first_name: Bart
full_name: Lambrecht, Bart
last_name: Lambrecht
- first_name: Moritz
full_name: Nowack, Moritz
last_name: Nowack
citation:
ama: Gao Z, Daneva A, Salanenka Y, et al. KIRA1 and ORESARA1 terminate flower receptivity
by promoting cell death in the stigma of Arabidopsis. Nature Plants. 2018;4(6):365-375.
doi:10.1038/s41477-018-0160-7
apa: Gao, Z., Daneva, A., Salanenka, Y., Van Durme, M., Huysmans, M., Lin, Z., …
Nowack, M. (2018). KIRA1 and ORESARA1 terminate flower receptivity by promoting
cell death in the stigma of Arabidopsis. Nature Plants. Nature Publishing
Group. https://doi.org/10.1038/s41477-018-0160-7
chicago: Gao, Zhen, Anna Daneva, Yuliya Salanenka, Matthias Van Durme, Marlies Huysmans,
Zongcheng Lin, Freya De Winter, et al. “KIRA1 and ORESARA1 Terminate Flower Receptivity
by Promoting Cell Death in the Stigma of Arabidopsis.” Nature Plants. Nature
Publishing Group, 2018. https://doi.org/10.1038/s41477-018-0160-7.
ieee: Z. Gao et al., “KIRA1 and ORESARA1 terminate flower receptivity by
promoting cell death in the stigma of Arabidopsis,” Nature Plants, vol.
4, no. 6. Nature Publishing Group, pp. 365–375, 2018.
ista: Gao Z, Daneva A, Salanenka Y, Van Durme M, Huysmans M, Lin Z, De Winter F,
Vanneste S, Karimi M, Van De Velde J, Vandepoele K, Van De Walle D, Dewettinck
K, Lambrecht B, Nowack M. 2018. KIRA1 and ORESARA1 terminate flower receptivity
by promoting cell death in the stigma of Arabidopsis. Nature Plants. 4(6), 365–375.
mla: Gao, Zhen, et al. “KIRA1 and ORESARA1 Terminate Flower Receptivity by Promoting
Cell Death in the Stigma of Arabidopsis.” Nature Plants, vol. 4, no. 6,
Nature Publishing Group, 2018, pp. 365–75, doi:10.1038/s41477-018-0160-7.
short: Z. Gao, A. Daneva, Y. Salanenka, M. Van Durme, M. Huysmans, Z. Lin, F. De
Winter, S. Vanneste, M. Karimi, J. Van De Velde, K. Vandepoele, D. Van De Walle,
K. Dewettinck, B. Lambrecht, M. Nowack, Nature Plants 4 (2018) 365–375.
date_created: 2018-12-11T11:45:35Z
date_published: 2018-05-28T00:00:00Z
date_updated: 2023-09-13T08:24:17Z
day: '28'
department:
- _id: JiFr
doi: 10.1038/s41477-018-0160-7
external_id:
isi:
- '000435571000017'
intvolume: ' 4'
isi: 1
issue: '6'
language:
- iso: eng
month: '05'
oa_version: None
page: 365 - 375
publication: Nature Plants
publication_status: published
publisher: Nature Publishing Group
publist_id: '7619'
quality_controlled: '1'
scopus_import: '1'
status: public
title: KIRA1 and ORESARA1 terminate flower receptivity by promoting cell death in
the stigma of Arabidopsis
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 4
year: '2018'
...
---
_id: '281'
abstract:
- lang: eng
text: 'Although cells respond specifically to environments, how environmental identity
is encoded intracellularly is not understood. Here, we study this organization
of information in budding yeast by estimating the mutual information between environmental
transitions and the dynamics of nuclear translocation for 10 transcription factors.
Our method of estimation is general, scalable, and based on decoding from single
cells. The dynamics of the transcription factors are necessary to encode the highest
amounts of extracellular information, and we show that information is transduced
through two channels: Generalists (Msn2/4, Tod6 and Dot6, Maf1, and Sfp1) can
encode the nature of multiple stresses, but only if stress is high; specialists
(Hog1, Yap1, and Mig1/2) encode one particular stress, but do so more quickly
and for a wider range of magnitudes. In particular, Dot6 encodes almost as much
information as Msn2, the master regulator of the environmental stress response.
Each transcription factor reports differently, and it is only their collective
behavior that distinguishes between multiple environmental states. Changes in
the dynamics of the localization of transcription factors thus constitute a precise,
distributed internal representation of extracellular change. We predict that such
multidimensional representations are common in cellular decision-making.'
acknowledgement: This work was supported by the Biotechnology and Biological Sciences
Research Council (J.M.J.P., I.F., and P.S.S.), the Engineering and Physical Sciences
Research Council (EPSRC) (A.A.G.), and Austrian Science Fund Grant FWF P28844 (to
G.T.).
article_processing_charge: No
article_type: original
author:
- first_name: Alejandro
full_name: Granados, Alejandro
last_name: Granados
- first_name: Julian
full_name: Pietsch, Julian
last_name: Pietsch
- first_name: Sarah A
full_name: Cepeda Humerez, Sarah A
id: 3DEE19A4-F248-11E8-B48F-1D18A9856A87
last_name: Cepeda Humerez
- first_name: Isebail
full_name: Farquhar, Isebail
last_name: Farquhar
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Peter
full_name: Swain, Peter
last_name: Swain
citation:
ama: Granados A, Pietsch J, Cepeda Humerez SA, Farquhar I, Tkačik G, Swain P. Distributed
and dynamic intracellular organization of extracellular information. PNAS.
2018;115(23):6088-6093. doi:10.1073/pnas.1716659115
apa: Granados, A., Pietsch, J., Cepeda Humerez, S. A., Farquhar, I., Tkačik, G.,
& Swain, P. (2018). Distributed and dynamic intracellular organization of
extracellular information. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1716659115
chicago: Granados, Alejandro, Julian Pietsch, Sarah A Cepeda Humerez, Isebail Farquhar,
Gašper Tkačik, and Peter Swain. “Distributed and Dynamic Intracellular Organization
of Extracellular Information.” PNAS. National Academy of Sciences, 2018.
https://doi.org/10.1073/pnas.1716659115.
ieee: A. Granados, J. Pietsch, S. A. Cepeda Humerez, I. Farquhar, G. Tkačik, and
P. Swain, “Distributed and dynamic intracellular organization of extracellular
information,” PNAS, vol. 115, no. 23. National Academy of Sciences, pp.
6088–6093, 2018.
ista: Granados A, Pietsch J, Cepeda Humerez SA, Farquhar I, Tkačik G, Swain P. 2018.
Distributed and dynamic intracellular organization of extracellular information.
PNAS. 115(23), 6088–6093.
mla: Granados, Alejandro, et al. “Distributed and Dynamic Intracellular Organization
of Extracellular Information.” PNAS, vol. 115, no. 23, National Academy
of Sciences, 2018, pp. 6088–93, doi:10.1073/pnas.1716659115.
short: A. Granados, J. Pietsch, S.A. Cepeda Humerez, I. Farquhar, G. Tkačik, P.
Swain, PNAS 115 (2018) 6088–6093.
date_created: 2018-12-11T11:45:35Z
date_published: 2018-06-05T00:00:00Z
date_updated: 2026-04-08T13:55:45Z
day: '05'
department:
- _id: GaTk
doi: 10.1073/pnas.1716659115
external_id:
isi:
- '000434114900071'
pmid:
- '29784812'
intvolume: ' 115'
isi: 1
issue: '23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/early/2017/09/21/192039
month: '06'
oa: 1
oa_version: Preprint
page: 6088 - 6093
pmid: 1
project:
- _id: 254E9036-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P28844-B27
name: Biophysics of information processing in gene regulation
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '7618'
quality_controlled: '1'
related_material:
record:
- id: '6473'
relation: part_of_dissertation
status: public
scopus_import: '1'
status: public
title: Distributed and dynamic intracellular organization of extracellular information
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 115
year: '2018'
...
---
_id: '282'
abstract:
- lang: eng
text: Adaptive introgression is common in nature and can be driven by selection
acting on multiple, linked genes. We explore the effects of polygenic selection
on introgression under the infinitesimal model with linkage. This model assumes
that the introgressing block has an effectively infinite number of genes, each
with an infinitesimal effect on the trait under selection. The block is assumed
to introgress under directional selection within a native population that is genetically
homogeneous. We use individual-based simulations and a branching process approximation
to compute various statistics of the introgressing block, and explore how these
depend on parameters such as the map length and initial trait value associated
with the introgressing block, the genetic variability along the block, and the
strength of selection. Our results show that the introgression dynamics of a block
under infinitesimal selection is qualitatively different from the dynamics of
neutral introgression. We also find that in the long run, surviving descendant
blocks are likely to have intermediate lengths, and clarify how the length is
shaped by the interplay between linkage and infinitesimal selection. Our results
suggest that it may be difficult to distinguish introgression of single loci from
that of genomic blocks with multiple, tightly linked and weakly selected loci.
article_processing_charge: No
author:
- first_name: Himani
full_name: Sachdeva, Himani
id: 42377A0A-F248-11E8-B48F-1D18A9856A87
last_name: Sachdeva
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Sachdeva H, Barton NH. Introgression of a block of genome under infinitesimal
selection. Genetics. 2018;209(4):1279-1303. doi:10.1534/genetics.118.301018
apa: Sachdeva, H., & Barton, N. H. (2018). Introgression of a block of genome
under infinitesimal selection. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.118.301018
chicago: Sachdeva, Himani, and Nicholas H Barton. “Introgression of a Block of Genome
under Infinitesimal Selection.” Genetics. Genetics Society of America,
2018. https://doi.org/10.1534/genetics.118.301018.
ieee: H. Sachdeva and N. H. Barton, “Introgression of a block of genome under infinitesimal
selection,” Genetics, vol. 209, no. 4. Genetics Society of America, pp.
1279–1303, 2018.
ista: Sachdeva H, Barton NH. 2018. Introgression of a block of genome under infinitesimal
selection. Genetics. 209(4), 1279–1303.
mla: Sachdeva, Himani, and Nicholas H. Barton. “Introgression of a Block of Genome
under Infinitesimal Selection.” Genetics, vol. 209, no. 4, Genetics Society
of America, 2018, pp. 1279–303, doi:10.1534/genetics.118.301018.
short: H. Sachdeva, N.H. Barton, Genetics 209 (2018) 1279–1303.
date_created: 2018-12-11T11:45:36Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-09-13T08:22:32Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.118.301018
external_id:
isi:
- '000440014100020'
intvolume: ' 209'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.biorxiv.org/content/early/2017/11/30/227082
month: '08'
oa: 1
oa_version: Submitted Version
page: 1279 - 1303
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '7617'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Introgression of a block of genome under infinitesimal selection
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 209
year: '2018'
...
---
_id: '283'
abstract:
- lang: eng
text: Light represents the principal signal driving circadian clock entrainment.
However, how light influences the evolution of the clock remains poorly understood.
The cavefish Phreatichthys andruzzii represents a fascinating model to explore
how evolution under extreme aphotic conditions shapes the circadian clock, since
in this species the clock is unresponsive to light. We have previously demonstrated
that loss-of-function mutations targeting non-visual opsins contribute in part
to this blind clock phenotype. Here, we have compared orthologs of two core clock
genes that play a key role in photic entrainment, cry1a and per2, in both zebrafish
and P. andruzzii. We encountered aberrantly spliced variants for the P. andruzzii
per2 transcript. The most abundant transcript encodes a truncated protein lacking
the C-terminal Cry binding domain and incorporating an intronic, transposon-derived
coding sequence. We demonstrate that the transposon insertion leads to a predominantly
cytoplasmic localization of the cavefish Per2 protein in contrast to the zebrafish
ortholog which is distributed in both the nucleus and cytoplasm. Thus, it seems
that during evolution in complete darkness, the photic entrainment pathway of
the circadian clock has been subject to mutation at multiple levels, extending
from opsin photoreceptors to nuclear effectors.
article_number: '8754'
article_processing_charge: No
author:
- first_name: Rosa Maria
full_name: Ceinos, Rosa Maria
last_name: Ceinos
- first_name: Elena
full_name: Frigato, Elena
last_name: Frigato
- first_name: Cristina
full_name: Pagano, Cristina
last_name: Pagano
- first_name: Nadine
full_name: Frohlich, Nadine
last_name: Frohlich
- first_name: Pietro
full_name: Negrini, Pietro
last_name: Negrini
- first_name: Nicola
full_name: Cavallari, Nicola
id: 457160E6-F248-11E8-B48F-1D18A9856A87
last_name: Cavallari
- first_name: Daniela
full_name: Vallone, Daniela
last_name: Vallone
- first_name: Silvia
full_name: Fuselli, Silvia
last_name: Fuselli
- first_name: Cristiano
full_name: Bertolucci, Cristiano
last_name: Bertolucci
- first_name: Nicholas S
full_name: Foulkes, Nicholas S
last_name: Foulkes
citation:
ama: Ceinos RM, Frigato E, Pagano C, et al. Mutations in blind cavefish target the
light regulated circadian clock gene period 2. Scientific Reports. 2018;8(1).
doi:10.1038/s41598-018-27080-2
apa: Ceinos, R. M., Frigato, E., Pagano, C., Frohlich, N., Negrini, P., Cavallari,
N., … Foulkes, N. S. (2018). Mutations in blind cavefish target the light regulated
circadian clock gene period 2. Scientific Reports. Nature Publishing Group.
https://doi.org/10.1038/s41598-018-27080-2
chicago: Ceinos, Rosa Maria, Elena Frigato, Cristina Pagano, Nadine Frohlich, Pietro
Negrini, Nicola Cavallari, Daniela Vallone, Silvia Fuselli, Cristiano Bertolucci,
and Nicholas S Foulkes. “Mutations in Blind Cavefish Target the Light Regulated
Circadian Clock Gene Period 2.” Scientific Reports. Nature Publishing Group,
2018. https://doi.org/10.1038/s41598-018-27080-2.
ieee: R. M. Ceinos et al., “Mutations in blind cavefish target the light
regulated circadian clock gene period 2,” Scientific Reports, vol. 8, no.
1. Nature Publishing Group, 2018.
ista: Ceinos RM, Frigato E, Pagano C, Frohlich N, Negrini P, Cavallari N, Vallone
D, Fuselli S, Bertolucci C, Foulkes NS. 2018. Mutations in blind cavefish target
the light regulated circadian clock gene period 2. Scientific Reports. 8(1), 8754.
mla: Ceinos, Rosa Maria, et al. “Mutations in Blind Cavefish Target the Light Regulated
Circadian Clock Gene Period 2.” Scientific Reports, vol. 8, no. 1, 8754,
Nature Publishing Group, 2018, doi:10.1038/s41598-018-27080-2.
short: R.M. Ceinos, E. Frigato, C. Pagano, N. Frohlich, P. Negrini, N. Cavallari,
D. Vallone, S. Fuselli, C. Bertolucci, N.S. Foulkes, Scientific Reports 8 (2018).
date_created: 2018-12-11T11:45:36Z
date_published: 2018-06-08T00:00:00Z
date_updated: 2023-09-13T08:59:27Z
day: '08'
ddc:
- '570'
department:
- _id: EvBe
doi: 10.1038/s41598-018-27080-2
external_id:
isi:
- '000434640800008'
file:
- access_level: open_access
checksum: 9c3942d772f84f3df032ffde0ed9a8ea
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T13:04:46Z
date_updated: 2020-07-14T12:45:49Z
file_id: '5707'
file_name: 2018_ScientificReports_Ceinos.pdf
file_size: 1855324
relation: main_file
file_date_updated: 2020-07-14T12:45:49Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
publist_id: '7616'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mutations in blind cavefish target the light regulated circadian clock gene
period 2
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8
year: '2018'
...
---
_id: '284'
abstract:
- lang: eng
text: "Borel probability measures living on metric spaces are fundamental\r\nmathematical
objects. There are several meaningful distance functions that make the collection
of the probability measures living on a certain space a metric space. We are interested
in the description of the structure of the isometries of such metric spaces. We
overview some of the recent results of the topic and we also provide some new
ones concerning the Wasserstein distance. More specifically, we consider the space
of all Borel probability measures on the unit sphere of a Euclidean space endowed
with the Wasserstein metric W_p for arbitrary p >= 1, and we show that the
action of a Wasserstein isometry on the set of Dirac measures is induced by an
isometry of the underlying unit sphere."
acknowledgement: The author was supported by the ISTFELLOW program of the Institute
of Science and Technol- ogy Austria (project code IC1027FELL01) and partially supported
by the Hungarian National Research, Development and Innovation Office, NKFIH (grant
no. K124152).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Daniel
full_name: Virosztek, Daniel
id: 48DB45DA-F248-11E8-B48F-1D18A9856A87
last_name: Virosztek
orcid: 0000-0003-1109-5511
citation:
ama: Virosztek D. Maps on probability measures preserving certain distances - a
survey and some new results. Acta Scientiarum Mathematicarum. 2018;84(1-2):65-80.
doi:10.14232/actasm-018-753-y
apa: Virosztek, D. (2018). Maps on probability measures preserving certain distances
- a survey and some new results. Acta Scientiarum Mathematicarum. Springer
Nature. https://doi.org/10.14232/actasm-018-753-y
chicago: Virosztek, Daniel. “Maps on Probability Measures Preserving Certain Distances
- a Survey and Some New Results.” Acta Scientiarum Mathematicarum. Springer
Nature, 2018. https://doi.org/10.14232/actasm-018-753-y.
ieee: D. Virosztek, “Maps on probability measures preserving certain distances -
a survey and some new results,” Acta Scientiarum Mathematicarum, vol. 84,
no. 1–2. Springer Nature, pp. 65–80, 2018.
ista: Virosztek D. 2018. Maps on probability measures preserving certain distances
- a survey and some new results. Acta Scientiarum Mathematicarum. 84(1–2), 65–80.
mla: Virosztek, Daniel. “Maps on Probability Measures Preserving Certain Distances
- a Survey and Some New Results.” Acta Scientiarum Mathematicarum, vol.
84, no. 1–2, Springer Nature, 2018, pp. 65–80, doi:10.14232/actasm-018-753-y.
short: D. Virosztek, Acta Scientiarum Mathematicarum 84 (2018) 65–80.
date_created: 2018-12-11T11:45:36Z
date_published: 2018-06-04T00:00:00Z
date_updated: 2025-04-15T06:50:21Z
day: '04'
department:
- _id: LaEr
doi: 10.14232/actasm-018-753-y
ec_funded: 1
external_id:
arxiv:
- '1802.03305'
intvolume: ' 84'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.03305
month: '06'
oa: 1
oa_version: Preprint
page: 65 - 80
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Acta Scientiarum Mathematicarum
publication_identifier:
eissn:
- 2064-8316
issn:
- 0001-6969
publication_status: published
publisher: Springer Nature
publist_id: '7615'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maps on probability measures preserving certain distances - a survey and some
new results
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 84
year: '2018'
...
---
_id: '285'
abstract:
- lang: eng
text: In graph theory, as well as in 3-manifold topology, there exist several width-type
parameters to describe how "simple" or "thin" a given graph
or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs,
or the concept of thin position for 3-manifolds, play an important role when studying
algorithmic problems; in particular, there is a variety of problems in computational
3-manifold topology - some of them known to be computationally hard in general
- that become solvable in polynomial time as soon as the dual graph of the input
triangulation has bounded treewidth. In view of these algorithmic results, it
is natural to ask whether every 3-manifold admits a triangulation of bounded treewidth.
We show that this is not the case, i.e., that there exists an infinite family
of closed 3-manifolds not admitting triangulations of bounded pathwidth or treewidth
(the latter implies the former, but we present two separate proofs). We derive
these results from work of Agol and of Scharlemann and Thompson, by exhibiting
explicit connections between the topology of a 3-manifold M on the one hand and
width-type parameters of the dual graphs of triangulations of M on the other hand,
answering a question that had been raised repeatedly by researchers in computational
3-manifold topology. In particular, we show that if a closed, orientable, irreducible,
non-Haken 3-manifold M has a triangulation of treewidth (resp. pathwidth) k then
the Heegaard genus of M is at most 48(k+1) (resp. 4(3k+1)).
acknowledgement: Research of the second author was supported by the Einstein Foundation
(project “Einstein Visiting Fellow Santos”) and by the Simons Foundation (“Simons
Visiting Professors” program).
alternative_title:
- LIPIcs
article_number: '46'
article_processing_charge: No
arxiv: 1
author:
- first_name: Kristóf
full_name: Huszár, Kristóf
id: 33C26278-F248-11E8-B48F-1D18A9856A87
last_name: Huszár
orcid: 0000-0002-5445-5057
- first_name: Jonathan
full_name: Spreer, Jonathan
last_name: Spreer
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds.
In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.46'
apa: 'Huszár, K., Spreer, J., & Wagner, U. (2018). On the treewidth of triangulated
3-manifolds (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry,
Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.46'
chicago: Huszár, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of
Triangulated 3-Manifolds,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.46.
ieee: 'K. Huszár, J. Spreer, and U. Wagner, “On the treewidth of triangulated 3-manifolds,”
presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary,
2018, vol. 99.'
ista: 'Huszár K, Spreer J, Wagner U. 2018. On the treewidth of triangulated 3-manifolds.
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 46.'
mla: Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds.
Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.46.
short: K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-06-14
location: Budapest, Hungary
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2018-06-11
date_created: 2018-12-11T11:45:37Z
date_published: 2018-06-01T00:00:00Z
date_updated: 2025-07-10T11:52:21Z
day: '01'
ddc:
- '516'
- '000'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2018.46
external_id:
arxiv:
- '1712.00434'
file:
- access_level: open_access
checksum: 530d084116778135d5bffaa317479cac
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T15:32:38Z
date_updated: 2020-07-14T12:45:51Z
file_id: '5713'
file_name: 2018_LIPIcs_Huszar.pdf
file_size: 642522
relation: main_file
file_date_updated: 2020-07-14T12:45:51Z
has_accepted_license: '1'
intvolume: ' 99'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7614'
quality_controlled: '1'
related_material:
record:
- id: '7093'
relation: later_version
status: public
scopus_import: '1'
status: public
title: On the treewidth of triangulated 3-manifolds
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: 99
year: '2018'
...
---
_id: '286'
abstract:
- lang: eng
text: 'Pedigree and sibship reconstruction are important methods in quantifying
relationships and fitness of individuals in natural populations. Current methods
employ a Markov chain-based algorithm to explore plausible possible pedigrees
iteratively. This provides accurate results, but is time-consuming. Here, we develop
a method to infer sibship and paternity relationships from half-sibling arrays
of known maternity using hierarchical clustering. Given 50 or more unlinked SNP
markers and empirically derived error rates, the method performs as well as the
widely used package Colony, but is faster by two orders of magnitude. Using simulations,
we show that the method performs well across contrasting mating scenarios, even
when samples are large. We then apply the method to open-pollinated arrays of
the snapdragon Antirrhinum majus and find evidence for a high degree of multiple
mating. Although we focus on diploid SNP data, the method does not depend on marker
type and as such has broad applications in nonmodel systems. '
acknowledgement: 'ERC, Grant/Award Number: 250152'
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Ellis T, Field D, Barton NH. Efficient inference of paternity and sibship inference
given known maternity via hierarchical clustering. Molecular Ecology Resources.
2018;18(5):988-999. doi:10.1111/1755-0998.12782
apa: Ellis, T., Field, D., & Barton, N. H. (2018). Efficient inference of paternity
and sibship inference given known maternity via hierarchical clustering. Molecular
Ecology Resources. Wiley. https://doi.org/10.1111/1755-0998.12782
chicago: Ellis, Thomas, David Field, and Nicholas H Barton. “Efficient Inference
of Paternity and Sibship Inference given Known Maternity via Hierarchical Clustering.”
Molecular Ecology Resources. Wiley, 2018. https://doi.org/10.1111/1755-0998.12782.
ieee: T. Ellis, D. Field, and N. H. Barton, “Efficient inference of paternity and
sibship inference given known maternity via hierarchical clustering,” Molecular
Ecology Resources, vol. 18, no. 5. Wiley, pp. 988–999, 2018.
ista: Ellis T, Field D, Barton NH. 2018. Efficient inference of paternity and sibship
inference given known maternity via hierarchical clustering. Molecular Ecology
Resources. 18(5), 988–999.
mla: Ellis, Thomas, et al. “Efficient Inference of Paternity and Sibship Inference
given Known Maternity via Hierarchical Clustering.” Molecular Ecology Resources,
vol. 18, no. 5, Wiley, 2018, pp. 988–99, doi:10.1111/1755-0998.12782.
short: T. Ellis, D. Field, N.H. Barton, Molecular Ecology Resources 18 (2018) 988–999.
date_created: 2018-12-11T11:45:37Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2025-04-15T07:11:03Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/1755-0998.12782
ec_funded: 1
external_id:
isi:
- '000441753000007'
intvolume: ' 18'
isi: 1
issue: '5'
language:
- iso: eng
month: '09'
oa_version: None
page: 988 - 999
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Molecular Ecology Resources
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '5583'
relation: popular_science
status: public
scopus_import: '1'
status: public
title: Efficient inference of paternity and sibship inference given known maternity
via hierarchical clustering
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 18
year: '2018'
...
---
_id: '287'
abstract:
- lang: eng
text: In this paper, we discuss biological effects of electromagnetic (EM) fields
in the context of cancer biology. In particular, we review the nanomechanical
properties of microtubules (MTs), the latter being one of the most successful
targets for cancer therapy. We propose an investigation on the coupling of electromagnetic
radiation to mechanical vibrations of MTs as an important basis for biological
and medical applications. In our opinion, optomechanical methods can accurately
monitor and control the mechanical properties of isolated MTs in a liquid environment.
Consequently, studying nanomechanical properties of MTs may give useful information
for future applications to diagnostic and therapeutic technologies involving non-invasive
externally applied physical fields. For example, electromagnetic fields or high
intensity ultrasound can be used therapeutically avoiding harmful side effects
of chemotherapeutic agents or classical radiation therapy.
acknowledgement: The work of SB has been supported by the European Unions Horizon
2020 research and innovation program under the Marie Sklodowska Curie grant agreement
No MSC-IF 707438 SUPEREOM. JAT gratefully acknowledges funding support from NSERC
(Canada) for his research. MC acknowledges support from the Czech Science Foundation,
projects 15-17102S and 17-11898S and he participates in COST Action BM1309, CA15211
and bilateral exchange project between Czech and Slovak Academies of Sciences, SAV-15-22.
article_processing_charge: No
author:
- first_name: Vahid
full_name: Salari, Vahid
last_name: Salari
- first_name: Shabir
full_name: Barzanjeh, Shabir
id: 2D25E1F6-F248-11E8-B48F-1D18A9856A87
last_name: Barzanjeh
orcid: 0000-0003-0415-1423
- first_name: Michal
full_name: Cifra, Michal
last_name: Cifra
- first_name: Christoph
full_name: Simon, Christoph
last_name: Simon
- first_name: Felix
full_name: Scholkmann, Felix
last_name: Scholkmann
- first_name: Zahra
full_name: Alirezaei, Zahra
last_name: Alirezaei
- first_name: Jack
full_name: Tuszynski, Jack
last_name: Tuszynski
citation:
ama: Salari V, Barzanjeh S, Cifra M, et al. Electromagnetic fields and optomechanics
In cancer diagnostics and treatment. Frontiers in Bioscience - Landmark.
2018;23(8):1391-1406. doi:10.2741/4651
apa: Salari, V., Barzanjeh, S., Cifra, M., Simon, C., Scholkmann, F., Alirezaei,
Z., & Tuszynski, J. (2018). Electromagnetic fields and optomechanics In cancer
diagnostics and treatment. Frontiers in Bioscience - Landmark. Frontiers
in Bioscience. https://doi.org/10.2741/4651
chicago: Salari, Vahid, Shabir Barzanjeh, Michal Cifra, Christoph Simon, Felix Scholkmann,
Zahra Alirezaei, and Jack Tuszynski. “Electromagnetic Fields and Optomechanics
In Cancer Diagnostics and Treatment.” Frontiers in Bioscience - Landmark.
Frontiers in Bioscience, 2018. https://doi.org/10.2741/4651.
ieee: V. Salari et al., “Electromagnetic fields and optomechanics In cancer
diagnostics and treatment,” Frontiers in Bioscience - Landmark, vol. 23,
no. 8. Frontiers in Bioscience, pp. 1391–1406, 2018.
ista: Salari V, Barzanjeh S, Cifra M, Simon C, Scholkmann F, Alirezaei Z, Tuszynski
J. 2018. Electromagnetic fields and optomechanics In cancer diagnostics and treatment.
Frontiers in Bioscience - Landmark. 23(8), 1391–1406.
mla: Salari, Vahid, et al. “Electromagnetic Fields and Optomechanics In Cancer Diagnostics
and Treatment.” Frontiers in Bioscience - Landmark, vol. 23, no. 8, Frontiers
in Bioscience, 2018, pp. 1391–406, doi:10.2741/4651.
short: V. Salari, S. Barzanjeh, M. Cifra, C. Simon, F. Scholkmann, Z. Alirezaei,
J. Tuszynski, Frontiers in Bioscience - Landmark 23 (2018) 1391–1406.
date_created: 2018-12-11T11:45:37Z
date_published: 2018-03-01T00:00:00Z
date_updated: 2024-10-22T09:36:28Z
day: '01'
department:
- _id: JoFi
doi: 10.2741/4651
ec_funded: 1
external_id:
isi:
- '000439042800001'
pmid:
- '29293441'
intvolume: ' 23'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.bioscience.org/2018/v23/af/4651/fulltext.htm
month: '03'
oa: 1
oa_version: Submitted Version
page: 1391 - 1406
pmid: 1
project:
- _id: 258047B6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '707438'
name: 'Microwave-to-Optical Quantum Link: Quantum Teleportation and Quantum Illumination
with cavity Optomechanics'
publication: Frontiers in Bioscience - Landmark
publication_status: published
publisher: Frontiers in Bioscience
quality_controlled: '1'
scopus_import: '1'
status: public
title: Electromagnetic fields and optomechanics In cancer diagnostics and treatment
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 23
year: '2018'
...