---
_id: '837'
abstract:
- lang: eng
text: 'The hippocampus is a key brain region for memory and notably for spatial
memory, and is needed for both spatial working and reference memories. Hippocampal
place cells selectively discharge in specific locations of the environment to
form mnemonic represen tations of space. Several behavioral protocols have been
designed to test spatial memory which requires the experimental subject to utilize
working memory and reference memory. However, less is known about how these memory
traces are presented in the hippo campus, especially considering tasks that require
both spatial working and long -term reference memory demand. The aim of my thesis
was to elucidate how spatial working memory, reference memory, and the combination
of both are represented in the hippocampus. In this thesis, using a radial eight
-arm maze, I examined how the combined demand on these memories influenced place
cell assemblies while reference memories were partially updated by changing some
of the reward- arms. This was contrasted with task varian ts requiring working
or reference memories only. Reference memory update led to gradual place field
shifts towards the rewards on the switched arms. Cells developed enhanced firing
in passes between newly -rewarded arms as compared to those containing an unchanged
reward. The working memory task did not show such gradual changes. Place assemblies
on occasions replayed trajectories of the maze; at decision points the next arm
choice was preferentially replayed in tasks needing reference memory while in
the pure working memory task the previously visited arm was replayed. Hence trajectory
replay only reflected the decision of the animal in tasks needing reference memory
update. At the reward locations, in all three tasks outbound trajectories of the
current arm were preferentially replayed, showing the animals’ next path to the
center. At reward locations trajectories were replayed preferentially in reverse
temporal order. Moreover, in the center reverse replay was seen in the working
memory task but in the other tasks forward replay was seen. Hence, the direction
of reactivation was determined by the goal locations so that part of the trajectory
which was closer to the goal was reactivated later in an HSE while places further
away from the goal were reactivated earlier. Altogether my work demonstrated that
reference memory update triggers several levels of reorganization of the hippocampal
cognitive map which are not seen in simpler working memory demand s. Moreover,
hippocampus is likely to be involved in spatial decisions through reactivating
planned trajectories when reference memory recall is required for such a decision. '
acknowledgement: 'I am very grateful for the opportunity I have had as a graduate
student to explore and incredibly interesting branch of neuroscience, and for the
people who made it possible. Firstly, I would like to offer my thanks to my supervisor
Professor Jozsef Csicsvari for his great support, guidance and patience offered
over the years. The door to his office was always open whenever I had questions.
I have learned a lot from him about carefully designing experiments, asking interesting
questions and how to integrate results into a broader picture. I also express my
gratitude to the remarkable post- doc , Dr. Joseph O’Neill. He is a gre at scientific
role model who is always willing to teach , and advice and talk through problems
with his full attention. Many thanks to my wonderful “office mates” over the years
and their support and encouragement, Alice Avernhe, Philipp Schönenberger, Desiree
Dickerson, Karel Blahna, Charlotte Boccara, Igor Gridchyn, Peter Baracskay, Krisztián
Kovács, Dámaris Rangel, Karola Käfer and Federico Stella. They were the ones in
the lab for the many useful discussions about science and for making the laboratory
such a nice and friendly place to work in. A special thank goes to Michael LoBianco
and Jago Wallenschus for wonderful technical support. I would also like to thank
Professor Peter Jonas and Professor David M Bannerman for being my qualifying exam
and thesi s committee members despite their busy schedule. I am also very thankful
to IST Austria for their support all throughout my PhD. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Haibing
full_name: Xu, Haibing
id: 310349D0-F248-11E8-B48F-1D18A9856A87
last_name: Xu
citation:
ama: Xu H. Reactivation of the hippocampal cognitive map in goal-directed spatial
tasks. 2017. doi:10.15479/AT:ISTA:th_858
apa: Xu, H. (2017). Reactivation of the hippocampal cognitive map in goal-directed
spatial tasks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_858
chicago: Xu, Haibing. “Reactivation of the Hippocampal Cognitive Map in Goal-Directed
Spatial Tasks.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_858.
ieee: H. Xu, “Reactivation of the hippocampal cognitive map in goal-directed spatial
tasks,” Institute of Science and Technology Austria, 2017.
ista: Xu H. 2017. Reactivation of the hippocampal cognitive map in goal-directed
spatial tasks. Institute of Science and Technology Austria.
mla: Xu, Haibing. Reactivation of the Hippocampal Cognitive Map in Goal-Directed
Spatial Tasks. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_858.
short: H. Xu, Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial
Tasks, Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:46Z
date_published: 2017-08-23T00:00:00Z
date_updated: 2023-09-07T12:06:38Z
day: '23'
ddc:
- '571'
degree_awarded: PhD
department:
- _id: JoCs
doi: 10.15479/AT:ISTA:th_858
file:
- access_level: closed
checksum: f11925fbbce31e495124b6bc4f10573c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T08:59:51Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6213'
file_name: 2017_Xu_Haibing_Thesis_Source.docx
file_size: 3589490
relation: source_file
- access_level: open_access
checksum: ffb10749a537d615fab1ef0937ccb157
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T08:59:51Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6214'
file_name: 2017_Xu_Thesis_IST.pdf
file_size: 11668613
relation: main_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: '93'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6811'
pubrep_id: '858'
related_material:
record:
- id: '5828'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
title: Reactivation of the hippocampal cognitive map in goal-directed spatial tasks
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '838'
abstract:
- lang: eng
text: 'In this thesis we discuss the exact security of message authentications codes
HMAC , NMAC , and PMAC . NMAC is a mode of operation which turns a fixed input-length
keyed hash function f into a variable input-length function. A practical single-key
variant of NMAC called HMAC is a very popular and widely deployed message authentication
code (MAC). PMAC is a block-cipher based mode of operation, which also happens
to be the most famous fully parallel MAC. NMAC was introduced by Bellare, Canetti
and Krawczyk Crypto’96, who proved it to be a secure pseudorandom function (PRF),
and thus also a MAC, under two assumptions. Unfortunately, for many instantiations
of HMAC one of them has been found to be wrong. To restore the provable guarantees
for NMAC , Bellare [Crypto’06] showed its security without this assumption. PMAC
was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a
pseudorandom permutation over n -bit strings, PMAC constitutes a provably secure
variable input-length PRF. For adversaries making q queries, each of length at
most ` (in n -bit blocks), and of total length σ ≤ q` , the original paper proves
an upper bound on the distinguishing advantage of O ( σ 2 / 2 n ), while the currently
best bound is O ( qσ/ 2 n ). In this work we show that this bound is tight by
giving an attack with advantage Ω( q 2 `/ 2 n ). In the PMAC construction one
initially XORs a mask to every message block, where the mask for the i th block
is computed as τ i := γ i · L , where L is a (secret) random value, and γ i is
the i -th codeword of the Gray code. Our attack applies more generally to any
sequence of γ i ’s which contains a large coset of a subgroup of GF (2 n ). As
for NMAC , our first contribution is a simpler and uniform proof: If f is an ε
-secure PRF (against q queries) and a δ - non-adaptively secure PRF (against q
queries), then NMAC f is an ( ε + `qδ )-secure PRF against q queries of length
at most ` blocks each. We also show that this ε + `qδ bound is basically tight
by constructing an f for which an attack with advantage `qδ exists. Moreover,
we analyze the PRF-security of a modification of NMAC called NI by An and Bellare
that avoids the constant rekeying on multi-block messages in NMAC and allows for
an information-theoretic analysis. We carry out such an analysis, obtaining a
tight `q 2 / 2 c bound for this step, improving over the trivial bound of ` 2
q 2 / 2 c . Finally, we investigate, if the security of PMAC can be further improved
by using τ i ’s that are k -wise independent, for k > 1 (the original has k
= 1). We observe that the security of PMAC will not increase in general if k =
2, and then prove that the security increases to O ( q 2 / 2 n ), if the k = 4.
Due to simple extension attacks, this is the best bound one can hope for, using
any distribution on the masks. Whether k = 3 is already sufficient to get this
level of security is left as an open problem. Keywords: Message authentication
codes, Pseudorandom functions, HMAC, PMAC. '
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
citation:
ama: Rybar M. (The exact security of) Message authentication codes. 2017. doi:10.15479/AT:ISTA:th_828
apa: Rybar, M. (2017). (The exact security of) Message authentication codes.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_828
chicago: Rybar, Michal. “(The Exact Security of) Message Authentication Codes.”
Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_828.
ieee: M. Rybar, “(The exact security of) Message authentication codes,” Institute
of Science and Technology Austria, 2017.
ista: Rybar M. 2017. (The exact security of) Message authentication codes. Institute
of Science and Technology Austria.
mla: Rybar, Michal. (The Exact Security of) Message Authentication Codes.
Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_828.
short: M. Rybar, (The Exact Security of) Message Authentication Codes, Institute
of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:46Z
date_published: 2017-06-26T00:00:00Z
date_updated: 2023-09-07T12:02:28Z
day: '26'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrPi
doi: 10.15479/AT:ISTA:th_828
file:
- access_level: open_access
checksum: ff8639ec4bded6186f44c7bd3ee26804
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:13Z
date_updated: 2020-07-14T12:48:12Z
file_id: '4799'
file_name: IST-2017-828-v1+3_2017_Rybar_thesis.pdf
file_size: 847400
relation: main_file
- access_level: closed
checksum: 3462101745ce8ad199c2d0f75dae4a7e
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:24:11Z
date_updated: 2020-07-14T12:48:12Z
file_id: '6202'
file_name: 2017_Thesis_Rybar_source.zip
file_size: 26054879
relation: source_file
file_date_updated: 2020-07-14T12:48:12Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '86'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6810'
pubrep_id: '828'
related_material:
record:
- id: '2082'
relation: part_of_dissertation
status: public
- id: '6196'
relation: part_of_dissertation
status: public
status: public
title: (The exact security of) Message authentication codes
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '839'
abstract:
- lang: eng
text: 'This thesis describes a brittle fracture simulation method for visual effects
applications. Building upon a symmetric Galerkin boundary element method, we first
compute stress intensity factors following the theory of linear elastic fracture
mechanics. We then use these stress intensities to simulate the motion of a propagating
crack front at a significantly higher resolution than the overall deformation
of the breaking object. Allowing for spatial variations of the material''s toughness
during crack propagation produces visually realistic, highly-detailed fracture
surfaces. Furthermore, we introduce approximations for stress intensities and
crack opening displacements, resulting in both practical speed-up and theoretically
superior runtime complexity compared to previous methods. While we choose a quasi-static
approach to fracture mechanics, ignoring dynamic deformations, we also couple
our fracture simulation framework to a standard rigid-body dynamics solver, enabling
visual effects artists to simulate both large scale motion, as well as fracturing
due to collision forces in a combined system. As fractures inside of an object
grow, their geometry must be represented both in the coarse boundary element mesh,
as well as at the desired fine output resolution. Using a boundary element method,
we avoid complicated volumetric meshing operations. Instead we describe a simple
set of surface meshing operations that allow us to progressively add cracks to
the mesh of an object and still re-use all previously computed entries of the
linear boundary element system matrix. On the high resolution level, we opt for
an implicit surface representation. We then describe how to capture fracture surfaces
during crack propagation, as well as separate the individual fragments resulting
from the fracture process, based on this implicit representation. We show results
obtained with our method, either solving the full boundary element system in every
time step, or alternatively using our fast approximations. These results demonstrate
that both of these methods perform well in basic test cases and produce realistic
fracture surfaces. Furthermore we show that our fast approximations substantially
out-perform the standard approach in more demanding scenarios. Finally, these
two methods naturally combine, using the full solution while the problem size
is manageably small and switching to the fast approximations later on. The resulting
hybrid method gives the user a direct way to choose between speed and accuracy
of the simulation. '
acknowledgement: "ERC H2020 programme (grant agreement no. 638176)\r\nFirst of all,
let me thank my committee members, especially my supervisor, Chris\r\nWojtan, for
supporting me throughout my PhD. Obviously, none of this work would\r\nhave been
possible without you.\r\nFurthermore, Thank You to all the people who have contributed
to this work in various\r\nways, in particular Martin Schanz and his group for providing
and supporting the\r\nHyENA boundary element library, as well as Eder Miguel and
Morten Bojsen-Hansen\r\nfor (repeatedly) proof reading and providing valuable suggestions
during the writing\r\nof this thesis.\r\nI would also like to thank Bernd Bickel,
and all the members – past and present – of his\r\nand Chris’ research groups at
IST Austria for always providing honest and insightful\r\nfeedback throughout many
joint group meetings, as well as Christopher Batty, Eitan\r\nGrinspun, and Fang
Da for many insights into boundary element methods during our\r\ncollaboration.\r\nAs
only virtual objects have been harmed in the process of creating this work, I would\r\nlike
to acknowledge the Stanford scanning repository for providing the “Bunny” and\r\n“Armadillo”
models, the AIM@SHAPE repository for “Pierre’s hand, watertight”, and\r\nS. Gainsbourg
for the “Column” via Archive3D.net. Sorry for breaking these models\r\nin many different
ways.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: David
full_name: Hahn, David
id: 357A6A66-F248-11E8-B48F-1D18A9856A87
last_name: Hahn
citation:
ama: Hahn D. Brittle fracture simulation with boundary elements for computer graphics.
2017. doi:10.15479/AT:ISTA:th_855
apa: Hahn, D. (2017). Brittle fracture simulation with boundary elements for
computer graphics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_855
chicago: Hahn, David. “Brittle Fracture Simulation with Boundary Elements for Computer
Graphics.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_855.
ieee: D. Hahn, “Brittle fracture simulation with boundary elements for computer
graphics,” Institute of Science and Technology Austria, 2017.
ista: Hahn D. 2017. Brittle fracture simulation with boundary elements for computer
graphics. Institute of Science and Technology Austria.
mla: Hahn, David. Brittle Fracture Simulation with Boundary Elements for Computer
Graphics. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_855.
short: D. Hahn, Brittle Fracture Simulation with Boundary Elements for Computer
Graphics, Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:48:47Z
date_published: 2017-08-14T00:00:00Z
date_updated: 2024-02-21T13:48:02Z
day: '14'
ddc:
- '004'
- '005'
- '006'
- '531'
- '621'
degree_awarded: PhD
department:
- _id: ChWo
doi: 10.15479/AT:ISTA:th_855
ec_funded: 1
file:
- access_level: open_access
checksum: 6c1ae8c90bfaba5e089417fefbc4a272
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:46Z
date_updated: 2020-07-14T12:48:13Z
file_id: '5100'
file_name: IST-2017-855-v1+1_thesis_online_pdfA.pdf
file_size: 14596191
relation: main_file
- access_level: closed
checksum: 421672f68d563b029869c5cf1713f919
content_type: application/zip
creator: dernst
date_created: 2019-04-05T08:40:30Z
date_updated: 2020-07-14T12:48:13Z
file_id: '6207'
file_name: 2017_thesis_Hahn_source.zip
file_size: 15060566
relation: source_file
file_date_updated: 2020-07-14T12:48:13Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: '124'
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6809'
pubrep_id: '855'
related_material:
record:
- id: '1362'
relation: part_of_dissertation
status: public
- id: '1633'
relation: part_of_dissertation
status: public
- id: '5568'
relation: popular_science
status: public
status: public
supervisor:
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
title: Brittle fracture simulation with boundary elements for computer graphics
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '84'
abstract:
- lang: eng
text: The advent of high-throughput technologies and the concurrent advances in
information sciences have led to a data revolution in biology. This revolution
is most significant in molecular biology, with an increase in the number and scale
of the “omics” projects over the last decade. Genomics projects, for example,
have produced impressive advances in our knowledge of the information concealed
into genomes, from the many genes that encode for the proteins that are responsible
for most if not all cellular functions, to the noncoding regions that are now
known to provide regulatory functions. Proteomics initiatives help to decipher
the role of post-translation modifications on the protein structures and provide
maps of protein-protein interactions, while functional genomics is the field that
attempts to make use of the data produced by these projects to understand protein
functions. The biggest challenge today is to assimilate the wealth of information
provided by these initiatives into a conceptual framework that will help us decipher
life. For example, the current views of the relationship between protein structure
and function remain fragmented. We know of their sequences, more and more about
their structures, we have information on their biological activities, but we have
difficulties connecting this dotted line into an informed whole. We lack the experimental
and computational tools for directly studying protein structure, function, and
dynamics at the molecular and supra-molecular levels. In this chapter, we review
some of the current developments in building the computational tools that are
needed, focusing on the role that geometry and topology play in these efforts.
One of our goals is to raise the general awareness about the importance of geometric
methods in elucidating the mysterious foundations of our very existence. Another
goal is the broadening of what we consider a geometric algorithm. There is plenty
of valuable no-man’s-land between combinatorial and numerical algorithms, and
it seems opportune to explore this land with a computational-geometric frame of
mind.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Patrice
full_name: Koehl, Patrice
last_name: Koehl
citation:
ama: 'Edelsbrunner H, Koehl P. Computational topology for structural molecular biology.
In: Toth C, O’Rourke J, Goodman J, eds. Handbook of Discrete and Computational
Geometry, Third Edition. Handbook of Discrete and Computational Geometry.
Taylor & Francis; 2017:1709-1735. doi:10.1201/9781315119601'
apa: Edelsbrunner, H., & Koehl, P. (2017). Computational topology for structural
molecular biology. In C. Toth, J. O’Rourke, & J. Goodman (Eds.), Handbook
of Discrete and Computational Geometry, Third Edition (pp. 1709–1735). Taylor
& Francis. https://doi.org/10.1201/9781315119601
chicago: Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural
Molecular Biology.” In Handbook of Discrete and Computational Geometry, Third
Edition, edited by Csaba Toth, Joseph O’Rourke, and Jacob Goodman, 1709–35.
Handbook of Discrete and Computational Geometry. Taylor & Francis, 2017. https://doi.org/10.1201/9781315119601.
ieee: H. Edelsbrunner and P. Koehl, “Computational topology for structural molecular
biology,” in Handbook of Discrete and Computational Geometry, Third Edition,
C. Toth, J. O’Rourke, and J. Goodman, Eds. Taylor & Francis, 2017, pp. 1709–1735.
ista: 'Edelsbrunner H, Koehl P. 2017.Computational topology for structural molecular
biology. In: Handbook of Discrete and Computational Geometry, Third Edition. ,
1709–1735.'
mla: Edelsbrunner, Herbert, and Patrice Koehl. “Computational Topology for Structural
Molecular Biology.” Handbook of Discrete and Computational Geometry, Third
Edition, edited by Csaba Toth et al., Taylor & Francis, 2017, pp. 1709–35,
doi:10.1201/9781315119601.
short: H. Edelsbrunner, P. Koehl, in:, C. Toth, J. O’Rourke, J. Goodman (Eds.),
Handbook of Discrete and Computational Geometry, Third Edition, Taylor & Francis,
2017, pp. 1709–1735.
date_created: 2018-12-11T11:44:32Z
date_published: 2017-11-09T00:00:00Z
date_updated: 2023-10-16T11:15:22Z
day: '09'
department:
- _id: HeEd
doi: 10.1201/9781315119601
editor:
- first_name: Csaba
full_name: Toth, Csaba
last_name: Toth
- first_name: Joseph
full_name: O'Rourke, Joseph
last_name: O'Rourke
- first_name: Jacob
full_name: Goodman, Jacob
last_name: Goodman
language:
- iso: eng
month: '11'
oa_version: None
page: 1709 - 1735
publication: Handbook of Discrete and Computational Geometry, Third Edition
publication_identifier:
eisbn:
- '9781498711425'
publication_status: published
publisher: Taylor & Francis
publist_id: '7970'
quality_controlled: '1'
scopus_import: '1'
series_title: Handbook of Discrete and Computational Geometry
status: public
title: Computational topology for structural molecular biology
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '840'
abstract:
- lang: eng
text: Heavy holes confined in quantum dots are predicted to be promising candidates
for the realization of spin qubits with long coherence times. Here we focus on
such heavy-hole states confined in germanium hut wires. By tuning the growth density
of the latter we can realize a T-like structure between two neighboring wires.
Such a structure allows the realization of a charge sensor, which is electrostatically
and tunnel coupled to a quantum dot, with charge-transfer signals as high as 0.3
e. By integrating the T-like structure into a radiofrequency reflectometry setup,
single-shot measurements allowing the extraction of hole tunneling times are performed.
The extracted tunneling times of less than 10 μs are attributed to the small effective
mass of Ge heavy-hole states and pave the way toward projective spin readout measurements.
acknowledged_ssus:
- _id: M-Shop
article_processing_charge: No
author:
- first_name: Lada
full_name: Vukusic, Lada
id: 31E9F056-F248-11E8-B48F-1D18A9856A87
last_name: Vukusic
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: 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, Katsaros G. Fast hole tunneling times in
germanium hut wires probed by single-shot reflectometry. Nano Letters.
2017;17(9):5706-5710. doi:10.1021/acs.nanolett.7b02627
apa: Vukušić, L., Kukucka, J., Watzinger, H., & Katsaros, G. (2017). Fast hole
tunneling times in germanium hut wires probed by single-shot reflectometry. Nano
Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.7b02627
chicago: Vukušić, Lada, Josip Kukucka, Hannes Watzinger, and Georgios Katsaros.
“Fast Hole Tunneling Times in Germanium Hut Wires Probed by Single-Shot Reflectometry.”
Nano Letters. American Chemical Society, 2017. https://doi.org/10.1021/acs.nanolett.7b02627.
ieee: L. Vukušić, J. Kukucka, H. Watzinger, and G. Katsaros, “Fast hole tunneling
times in germanium hut wires probed by single-shot reflectometry,” Nano Letters,
vol. 17, no. 9. American Chemical Society, pp. 5706–5710, 2017.
ista: Vukušić L, Kukucka J, Watzinger H, Katsaros G. 2017. Fast hole tunneling times
in germanium hut wires probed by single-shot reflectometry. Nano Letters. 17(9),
5706–5710.
mla: Vukušić, Lada, et al. “Fast Hole Tunneling Times in Germanium Hut Wires Probed
by Single-Shot Reflectometry.” Nano Letters, vol. 17, no. 9, American Chemical
Society, 2017, pp. 5706–10, doi:10.1021/acs.nanolett.7b02627.
short: L. Vukušić, J. Kukucka, H. Watzinger, G. Katsaros, Nano Letters 17 (2017)
5706–5710.
date_created: 2018-12-11T11:48:47Z
date_published: 2017-08-10T00:00:00Z
date_updated: 2023-09-26T15:50:22Z
day: '10'
ddc:
- '539'
department:
- _id: GeKa
doi: 10.1021/acs.nanolett.7b02627
ec_funded: 1
external_id:
isi:
- '000411043500078'
file:
- access_level: open_access
checksum: 761371a0129b2aa442424b9561450ece
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:33Z
date_updated: 2020-07-14T12:48:13Z
file_id: '4951'
file_name: IST-2017-865-v1+1_acs.nanolett.7b02627.pdf
file_size: 2449546
relation: main_file
file_date_updated: 2020-07-14T12:48:13Z
has_accepted_license: '1'
intvolume: ' 17'
isi: 1
issue: '9'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 5706 - 5710
project:
- _id: 25517E86-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '335497'
name: Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires
publication: Nano Letters
publication_identifier:
issn:
- '15306984'
publication_status: published
publisher: American Chemical Society
publist_id: '6808'
pubrep_id: '865'
quality_controlled: '1'
related_material:
record:
- id: '7977'
relation: popular_science
- id: '69'
relation: dissertation_contains
status: public
- id: '7996'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Fast hole tunneling times in germanium hut wires probed by single-shot reflectometry
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: 17
year: '2017'
...
---
_id: '909'
abstract:
- lang: eng
text: We study the lengths of curves passing through a fixed number of points on
the boundary of a convex shape in the plane. We show that, for any convex shape
K, there exist four points on the boundary of K such that the length of any curve
passing through these points is at least half of the perimeter of K. It is also
shown that the same statement does not remain valid with the additional constraint
that the points are extreme points of K. Moreover, the factor ½ cannot
be achieved with any fixed number of extreme points. We conclude the paper with
a few other inequalities related to the perimeter of a convex shape.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Vladislav
full_name: Vysotsky, Vladislav
last_name: Vysotsky
citation:
ama: Akopyan A, Vysotsky V. On the lengths of curves passing through boundary points
of a planar convex shape. The American Mathematical Monthly. 2017;124(7):588-596.
doi:10.4169/amer.math.monthly.124.7.588
apa: Akopyan, A., & Vysotsky, V. (2017). On the lengths of curves passing through
boundary points of a planar convex shape. The American Mathematical Monthly.
Mathematical Association of America. https://doi.org/10.4169/amer.math.monthly.124.7.588
chicago: Akopyan, Arseniy, and Vladislav Vysotsky. “On the Lengths of Curves Passing
through Boundary Points of a Planar Convex Shape.” The American Mathematical
Monthly. Mathematical Association of America, 2017. https://doi.org/10.4169/amer.math.monthly.124.7.588.
ieee: A. Akopyan and V. Vysotsky, “On the lengths of curves passing through boundary
points of a planar convex shape,” The American Mathematical Monthly, vol.
124, no. 7. Mathematical Association of America, pp. 588–596, 2017.
ista: Akopyan A, Vysotsky V. 2017. On the lengths of curves passing through boundary
points of a planar convex shape. The American Mathematical Monthly. 124(7), 588–596.
mla: Akopyan, Arseniy, and Vladislav Vysotsky. “On the Lengths of Curves Passing
through Boundary Points of a Planar Convex Shape.” The American Mathematical
Monthly, vol. 124, no. 7, Mathematical Association of America, 2017, pp. 588–96,
doi:10.4169/amer.math.monthly.124.7.588.
short: A. Akopyan, V. Vysotsky, The American Mathematical Monthly 124 (2017) 588–596.
date_created: 2018-12-11T11:49:09Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-10-17T11:24:57Z
day: '01'
department:
- _id: HeEd
doi: 10.4169/amer.math.monthly.124.7.588
ec_funded: 1
external_id:
arxiv:
- '1605.07997'
isi:
- '000413947300002'
intvolume: ' 124'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1605.07997
month: '01'
oa: 1
oa_version: Submitted Version
page: 588 - 596
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: The American Mathematical Monthly
publication_identifier:
issn:
- '00029890'
publication_status: published
publisher: Mathematical Association of America
publist_id: '6534'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the lengths of curves passing through boundary points of a planar convex
shape
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 124
year: '2017'
...
---
_id: '910'
abstract:
- lang: eng
text: "Frequency-independent selection is generally considered as a force that acts
to reduce the genetic variation in evolving populations, yet rigorous arguments
for this idea are scarce. When selection fluctuates in time, it is unclear whether
frequency-independent selection may maintain genetic polymorphism without invoking
additional mechanisms. We show that constant frequency-independent selection with
arbitrary epistasis on a well-mixed haploid population eliminates genetic variation
if we assume linkage equilibrium between alleles. To this end, we introduce the
notion of frequency-independent selection at the level of alleles, which is sufficient
to prove our claim and contains the notion of frequency-independent selection
on haploids. When selection and recombination are weak but of the same order,
there may be strong linkage disequilibrium; numerical calculations show that stable
equilibria are highly unlikely. Using the example of a diallelic two-locus model,
we then demonstrate that frequency-independent selection that fluctuates in time
can maintain stable polymorphism if linkage disequilibrium changes its sign periodically.
We put our findings in the context of results from the existing literature and
point out those scenarios in which the possible role of frequency-independent
selection in maintaining genetic variation remains unclear.\r\n"
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- 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: Novak S, Barton NH. When does frequency-independent selection maintain genetic
variation? Genetics. 2017;207(2):653-668. doi:10.1534/genetics.117.300129
apa: Novak, S., & Barton, N. H. (2017). When does frequency-independent selection
maintain genetic variation? Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.117.300129
chicago: Novak, Sebastian, and Nicholas H Barton. “When Does Frequency-Independent
Selection Maintain Genetic Variation?” Genetics. Genetics Society of America,
2017. https://doi.org/10.1534/genetics.117.300129.
ieee: S. Novak and N. H. Barton, “When does frequency-independent selection maintain
genetic variation?,” Genetics, vol. 207, no. 2. Genetics Society of America,
pp. 653–668, 2017.
ista: Novak S, Barton NH. 2017. When does frequency-independent selection maintain
genetic variation? Genetics. 207(2), 653–668.
mla: Novak, Sebastian, and Nicholas H. Barton. “When Does Frequency-Independent
Selection Maintain Genetic Variation?” Genetics, vol. 207, no. 2, Genetics
Society of America, 2017, pp. 653–68, doi:10.1534/genetics.117.300129.
short: S. Novak, N.H. Barton, Genetics 207 (2017) 653–668.
date_created: 2018-12-11T11:49:09Z
date_published: 2017-10-01T00:00:00Z
date_updated: 2023-09-26T15:49:15Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1534/genetics.117.300129
ec_funded: 1
external_id:
isi:
- '000412232600019'
file:
- access_level: open_access
checksum: f7c32dabf52e6d9e709d9203761e39fd
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:12Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5264'
file_name: IST-2018-974-v1+1_manuscript.pdf
file_size: 494268
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 207'
isi: 1
issue: '2'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 653 - 668
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '6533'
pubrep_id: '974'
quality_controlled: '1'
scopus_import: '1'
status: public
title: When does frequency-independent selection maintain genetic variation?
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 207
year: '2017'
...
---
_id: '911'
abstract:
- lang: eng
text: We develop a probabilistic technique for colorizing grayscale natural images.
In light of the intrinsic uncertainty of this task, the proposed probabilistic
framework has numerous desirable properties. In particular, our model is able
to produce multiple plausible and vivid colorizations for a given grayscale image
and is one of the first colorization models to provide a proper stochastic sampling
scheme. Moreover, our training procedure is supported by a rigorous theoretical
framework that does not require any ad hoc heuristics and allows for efficient
modeling and learning of the joint pixel color distribution.We demonstrate strong
quantitative and qualitative experimental results on the CIFAR-10 dataset and
the challenging ILSVRC 2012 dataset.
article_processing_charge: No
arxiv: 1
author:
- first_name: Amélie
full_name: Royer, Amélie
id: 3811D890-F248-11E8-B48F-1D18A9856A87
last_name: Royer
orcid: 0000-0002-8407-0705
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Royer A, Kolesnikov A, Lampert C. Probabilistic image colorization. In: BMVA
Press; 2017:85.1-85.12. doi:10.5244/c.31.85'
apa: 'Royer, A., Kolesnikov, A., & Lampert, C. (2017). Probabilistic image colorization
(p. 85.1-85.12). Presented at the BMVC: British Machine Vision Conference, London,
United Kingdom: BMVA Press. https://doi.org/10.5244/c.31.85'
chicago: Royer, Amélie, Alexander Kolesnikov, and Christoph Lampert. “Probabilistic
Image Colorization,” 85.1-85.12. BMVA Press, 2017. https://doi.org/10.5244/c.31.85.
ieee: 'A. Royer, A. Kolesnikov, and C. Lampert, “Probabilistic image colorization,”
presented at the BMVC: British Machine Vision Conference, London, United Kingdom,
2017, p. 85.1-85.12.'
ista: 'Royer A, Kolesnikov A, Lampert C. 2017. Probabilistic image colorization.
BMVC: British Machine Vision Conference, 85.1-85.12.'
mla: Royer, Amélie, et al. Probabilistic Image Colorization. BMVA Press,
2017, p. 85.1-85.12, doi:10.5244/c.31.85.
short: A. Royer, A. Kolesnikov, C. Lampert, in:, BMVA Press, 2017, p. 85.1-85.12.
conference:
end_date: 2017-09-07
location: London, United Kingdom
name: 'BMVC: British Machine Vision Conference'
start_date: 2017-09-04
date_created: 2018-12-11T11:49:09Z
date_published: 2017-09-01T00:00:00Z
date_updated: 2023-10-16T10:04:02Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.5244/c.31.85
ec_funded: 1
external_id:
arxiv:
- '1705.04258'
file:
- access_level: open_access
content_type: application/pdf
creator: dernst
date_created: 2020-08-10T07:14:33Z
date_updated: 2020-08-10T07:14:33Z
file_id: '8224'
file_name: 2017_BMVC_Royer.pdf
file_size: 1625363
relation: main_file
success: 1
file_date_updated: 2020-08-10T07:14:33Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 85.1-85.12
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_identifier:
eisbn:
- 190172560X
publication_status: published
publisher: BMVA Press
publist_id: '6532'
quality_controlled: '1'
related_material:
record:
- id: '8390'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Probabilistic image colorization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '912'
abstract:
- lang: eng
text: "We consider a many-body system of fermionic atoms interacting via a local
pair potential and subject to an external potential within the framework of Bardeen-Cooper-Schrieffer
(BCS) theory. We measure the free energy of the whole sample with respect to the
free energy of a reference state which allows us to define a BCS functional with
boundary conditions at infinity. Our main result is a lower bound for this energy
functional in terms of expressions that typically appear in Ginzburg-Landau functionals.\r\n"
article_number: '081901'
article_processing_charge: No
author:
- first_name: Andreas
full_name: Deuchert, Andreas
id: 4DA65CD0-F248-11E8-B48F-1D18A9856A87
last_name: Deuchert
orcid: 0000-0003-3146-6746
citation:
ama: Deuchert A. A lower bound for the BCS functional with boundary conditions at
infinity. Journal of Mathematical Physics. 2017;58(8). doi:10.1063/1.4996580
apa: Deuchert, A. (2017). A lower bound for the BCS functional with boundary conditions
at infinity. Journal of Mathematical Physics. AIP Publishing. https://doi.org/10.1063/1.4996580
chicago: Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary
Conditions at Infinity.” Journal of Mathematical Physics. AIP Publishing,
2017. https://doi.org/10.1063/1.4996580.
ieee: A. Deuchert, “A lower bound for the BCS functional with boundary conditions
at infinity,” Journal of Mathematical Physics, vol. 58, no. 8. AIP Publishing,
2017.
ista: Deuchert A. 2017. A lower bound for the BCS functional with boundary conditions
at infinity. Journal of Mathematical Physics. 58(8), 081901.
mla: Deuchert, Andreas. “A Lower Bound for the BCS Functional with Boundary Conditions
at Infinity.” Journal of Mathematical Physics, vol. 58, no. 8, 081901,
AIP Publishing, 2017, doi:10.1063/1.4996580.
short: A. Deuchert, Journal of Mathematical Physics 58 (2017).
date_created: 2018-12-11T11:49:10Z
date_published: 2017-08-01T00:00:00Z
date_updated: 2024-02-28T13:07:56Z
day: '01'
department:
- _id: RoSe
doi: 10.1063/1.4996580
ec_funded: 1
external_id:
isi:
- '000409197200015'
intvolume: ' 58'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1703.04616
month: '08'
oa: 1
oa_version: Submitted Version
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication: ' Journal of Mathematical Physics'
publication_identifier:
issn:
- '00222488'
publication_status: published
publisher: AIP Publishing
publist_id: '6531'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A lower bound for the BCS functional with boundary conditions at infinity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 58
year: '2017'
...
---
_id: '914'
abstract:
- lang: eng
text: Infections with potentially lethal pathogens may negatively affect an individual’s
lifespan and decrease its reproductive value. The terminal investment hypothesis
predicts that individuals faced with a reduced survival should invest more into
reproduction instead of maintenance and growth. Several studies suggest that individuals
are indeed able to estimate their body condition and to increase their reproductive
effort with approaching death, while other studies gave ambiguous results. We
investigate whether queens of a perennial social insect (ant) are able to boost
their reproduction following infection with an obligate killing pathogen. Social
insect queens are special with regard to reproduction and aging, as they outlive
conspecific non-reproductive workers. Moreover, in the ant Cardiocondyla obscurior,
fecundity increases with queen age. However, it remained unclear whether this
reflects negative reproductive senescence or terminal investment in response to
approaching death. Here, we test whether queens of C. obscurior react to infection
with the entomopathogenic fungus Metarhizium brunneum by an increased egg-laying
rate. We show that a fungal infection triggers a reinforced investment in reproduction
in queens. This adjustment of the reproductive rate by ant queens is consistent
with predictions of the terminal investment hypothesis and is reported for the
first time in a social insect.
acknowledgement: We thank two anonymous reviewers for helpful suggestions on the manuscript.
article_number: '170547'
article_processing_charge: No
author:
- first_name: Julia
full_name: Giehr, Julia
last_name: Giehr
- first_name: Anna V
full_name: Grasse, Anna V
id: 406F989C-F248-11E8-B48F-1D18A9856A87
last_name: Grasse
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Alexandra
full_name: Schrempf, Alexandra
last_name: Schrempf
citation:
ama: Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. Ant queens increase their
reproductive efforts after pathogen infection. Royal Society Open Science.
2017;4(7). doi:10.1098/rsos.170547
apa: Giehr, J., Grasse, A. V., Cremer, S., Heinze, J., & Schrempf, A. (2017).
Ant queens increase their reproductive efforts after pathogen infection. Royal
Society Open Science. Royal Society, The. https://doi.org/10.1098/rsos.170547
chicago: Giehr, Julia, Anna V Grasse, Sylvia Cremer, Jürgen Heinze, and Alexandra
Schrempf. “Ant Queens Increase Their Reproductive Efforts after Pathogen Infection.”
Royal Society Open Science. Royal Society, The, 2017. https://doi.org/10.1098/rsos.170547.
ieee: J. Giehr, A. V. Grasse, S. Cremer, J. Heinze, and A. Schrempf, “Ant queens
increase their reproductive efforts after pathogen infection,” Royal Society
Open Science, vol. 4, no. 7. Royal Society, The, 2017.
ista: Giehr J, Grasse AV, Cremer S, Heinze J, Schrempf A. 2017. Ant queens increase
their reproductive efforts after pathogen infection. Royal Society Open Science.
4(7), 170547.
mla: Giehr, Julia, et al. “Ant Queens Increase Their Reproductive Efforts after
Pathogen Infection.” Royal Society Open Science, vol. 4, no. 7, 170547,
Royal Society, The, 2017, doi:10.1098/rsos.170547.
short: J. Giehr, A.V. Grasse, S. Cremer, J. Heinze, A. Schrempf, Royal Society Open
Science 4 (2017).
date_created: 2018-12-11T11:49:10Z
date_published: 2017-07-05T00:00:00Z
date_updated: 2023-09-26T15:45:47Z
day: '05'
ddc:
- '576'
- '592'
department:
- _id: SyCr
doi: 10.1098/rsos.170547
external_id:
isi:
- '000406670000025'
file:
- access_level: open_access
checksum: 351ae5e7a37e6e7d9295cd41146c4190
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:24Z
date_updated: 2020-07-14T12:48:15Z
file_id: '4684'
file_name: IST-2017-849-v1+1_2017_Grasse_Cremer_AntQueens.pdf
file_size: 530412
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Royal Society Open Science
publication_identifier:
issn:
- '20545703'
publication_status: published
publisher: Royal Society, The
publist_id: '6527'
pubrep_id: '849'
quality_controlled: '1'
related_material:
record:
- id: '9853'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Ant queens increase their reproductive efforts after pathogen infection
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: 4
year: '2017'
...
---
_id: '915'
abstract:
- lang: eng
text: We propose a dual decomposition and linear program relaxation of the NP-hard
minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut
polytope, it is amenable to efficient optimization by message passing. Like other
polyhedral relaxations, it can be tightened efficiently by cutting planes. We
define an algorithm that alternates between message passing and efficient separation
of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art
algorithms based on linear programming, including algorithms written in the framework
of leading commercial software, as we show in experiments with large instances
of the problem from applications in computer vision, biomedical image analysis
and data mining.
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Bjoern
full_name: Andres, Bjoern
last_name: Andres
citation:
ama: 'Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut
problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530'
apa: 'Swoboda, P., & Andres, B. (2017). A message passing algorithm for the
minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR:
Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.530'
chicago: Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the
Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.530.
ieee: 'P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost
multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition,
Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.'
ista: 'Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost
multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.'
mla: Swoboda, Paul, and Bjoern Andres. A Message Passing Algorithm for the Minimum
Cost Multicut Problem. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:10.1109/CVPR.2017.530.
short: P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:11Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-09-26T15:43:27Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/CVPR.2017.530
ec_funded: 1
external_id:
isi:
- '000418371405009'
file:
- access_level: open_access
checksum: 7e51dacefa693574581a32da3eff63dc
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T12:52:46Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5849'
file_name: Swoboda_A_Message_Passing_CVPR_2017_paper.pdf
file_size: 883264
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 4990-4999
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6526'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A message passing algorithm for the minimum cost multicut problem
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...
---
_id: '916'
abstract:
- lang: eng
text: We study the quadratic assignment problem, in computer vision also known as
graph matching. Two leading solvers for this problem optimize the Lagrange decomposition
duals with sub-gradient and dual ascent (also known as message passing) updates.
We explore this direction further and propose several additional Lagrangean relaxations
of the graph matching problem along with corresponding algorithms, which are all
based on a common dual ascent framework. Our extensive empirical evaluation gives
several theoretical insights and suggests a new state-of-the-art anytime solver
for the considered problem. Our improvement over state-of-the-art is particularly
visible on a new dataset with large-scale sparse problem instances containing
more than 500 graph nodes each.
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Carsten
full_name: Abu Alhaija, Carsten
last_name: Abu Alhaija
- first_name: Dagmar
full_name: Kainmueller, Dagmar
last_name: Kainmueller
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: 'Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study
of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol
2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747'
apa: 'Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., & Savchynskyy,
B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph
matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and
Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.747'
chicago: Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller,
and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent
Solvers for Graph Matching,” 2017:7062–71. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.747.
ieee: 'P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy,
“A study of lagrangean decompositions and dual ascent solvers for graph matching,”
presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA,
United States, 2017, vol. 2017, pp. 7062–7071.'
ista: 'Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A
study of lagrangean decompositions and dual ascent solvers for graph matching.
CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.'
mla: Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent
Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.
short: P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:,
IEEE, 2017, pp. 7062–7071.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:11Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2023-09-26T15:41:40Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/CVPR.2017.747
ec_funded: 1
external_id:
isi:
- '000418371407018'
file:
- access_level: open_access
checksum: e38a2740daad1ea178465843b5072906
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T12:49:38Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5848'
file_name: 2017_CVPR_Swoboda2.pdf
file_size: 944332
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 7062-7071
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6525'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A study of lagrangean decompositions and dual ascent solvers for graph matching
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...
---
_id: '917'
abstract:
- lang: eng
text: We propose a general dual ascent framework for Lagrangean decomposition
of combinatorial problems. Although methods of this type have shown their efficiency
for a number of problems, so far there was no general algorithm applicable to
multiple problem types. In this work, we propose such a general algorithm. It
depends on several parameters, which can be used to optimize its performance in
each particular setting. We demonstrate efficacy of our method on graph matching
and multicut problems, where it outperforms state-of-the-art solvers including
those based on subgradient optimization and off-the-shelf linear programming solvers.
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
- first_name: Jan
full_name: Kuske, Jan
last_name: Kuske
- first_name: Bogdan
full_name: Savchynskyy, Bogdan
last_name: Savchynskyy
citation:
ama: 'Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean
decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526'
apa: 'Swoboda, P., Kuske, J., & Savchynskyy, B. (2017). A dual ascent framework
for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960).
Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA,
United States: IEEE. https://doi.org/10.1109/CVPR.2017.526'
chicago: Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “A Dual Ascent Framework
for Lagrangean Decomposition of Combinatorial Problems,” 2017:4950–60. IEEE, 2017.
https://doi.org/10.1109/CVPR.2017.526.
ieee: 'P. Swoboda, J. Kuske, and B. Savchynskyy, “A dual ascent framework for Lagrangean
decomposition of combinatorial problems,” presented at the CVPR: Computer Vision
and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4950–4960.'
ista: 'Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean
decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition
vol. 2017, 4950–4960.'
mla: Swoboda, Paul, et al. A Dual Ascent Framework for Lagrangean Decomposition
of Combinatorial Problems. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:10.1109/CVPR.2017.526.
short: P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960.
conference:
end_date: 2017-07-26
location: Honolulu, HA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2017-07-21
date_created: 2018-12-11T11:49:11Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-09-26T15:41:11Z
day: '01'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/CVPR.2017.526
ec_funded: 1
external_id:
isi:
- '000418371405005'
file:
- access_level: open_access
checksum: 72fd291046bd8e5717961bd68f6b6f03
content_type: application/pdf
creator: dernst
date_created: 2019-01-18T12:45:55Z
date_updated: 2020-07-14T12:48:15Z
file_id: '5847'
file_name: 2017_CVPR_Swoboda.pdf
file_size: 898652
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
intvolume: ' 2017'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 4950-4960
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
isbn:
- 978-153860457-1
publication_status: published
publisher: IEEE
publist_id: '6524'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A dual ascent framework for Lagrangean decomposition of combinatorial problems
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 2017
year: '2017'
...
---
_id: '938'
abstract:
- lang: eng
text: The thesis encompasses several topics of plant cell biology which were studied
in the model plant Arabidopsis thaliana. Chapter 1 concerns the plant hormone
auxin and its polar transport through cells and tissues. The highly controlled,
directional transport of auxin is facilitated by plasma membrane-localized transporters.
Transporters from the PIN family direct auxin transport due to their polarized
localizations at cell membranes. Substantial effort has been put into research
on cellular trafficking of PIN proteins, which is thought to underlie their polar
distribution. I participated in a forward genetic screen aimed at identifying
novel regulators of PIN polarity. The screen yielded several genes which may be
involved in PIN polarity regulation or participate in polar auxin transport by
other means. Chapter 2 focuses on the endomembrane system, with particular attention
to clathrin-mediated endocytosis. The project started with identification of several
proteins that interact with clathrin light chains. Among them, I focused on two
putative homologues of auxilin, which in non-plant systems is an endocytotic factor
known for uncoating clathrin-coated vesicles in the final step of endocytosis.
The body of my work consisted of an in-depth characterization of transgenic A.
thaliana lines overexpressing these putative auxilins in an inducible manner.
Overexpression of these proteins leads to an inhibition of endocytosis, as documented
by imaging of cargoes and clathrin-related endocytic machinery. An extension of
this work is an investigation into a concept of homeostatic regulation acting
between distinct transport processes in the endomembrane system. With auxilin
overexpressing lines, where endocytosis is blocked specifically, I made observations
on the mutual relationship between two opposite trafficking processes of secretion
and endocytosis. In Chapter 3, I analyze cortical microtubule arrays and their
relationship to auxin signaling and polarized growth in elongating cells. In plants,
microtubules are organized into arrays just below the plasma membrane, and it
is thought that their function is to guide membrane-docked cellulose synthase
complexes. These, in turn, influence cell wall structure and cell shape by directed
deposition of cellulose fibres. In elongating cells, cortical microtubule arrays
are able to reorient in relation to long cell axis, and these reorientations have
been linked to cell growth and to signaling of growth-regulating factors such
as auxin or light. In this chapter, I am addressing the causal relationship between
microtubule array reorientation, growth, and auxin signaling. I arrive at a model
where array reorientation is not guided by auxin directly, but instead is only
controlled by growth, which, in turn, is regulated by auxin.
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Maciek
full_name: Adamowski, Maciek
id: 45F536D2-F248-11E8-B48F-1D18A9856A87
last_name: Adamowski
orcid: 0000-0001-6463-5257
citation:
ama: Adamowski M. Investigations into cell polarity and trafficking in the plant
model Arabidopsis thaliana . 2017. doi:10.15479/AT:ISTA:th_842
apa: Adamowski, M. (2017). Investigations into cell polarity and trafficking
in the plant model Arabidopsis thaliana . Institute of Science and Technology
Austria. https://doi.org/10.15479/AT:ISTA:th_842
chicago: Adamowski, Maciek. “Investigations into Cell Polarity and Trafficking in
the Plant Model Arabidopsis Thaliana .” Institute of Science and Technology Austria,
2017. https://doi.org/10.15479/AT:ISTA:th_842.
ieee: M. Adamowski, “Investigations into cell polarity and trafficking in the plant
model Arabidopsis thaliana ,” Institute of Science and Technology Austria, 2017.
ista: Adamowski M. 2017. Investigations into cell polarity and trafficking in the
plant model Arabidopsis thaliana . Institute of Science and Technology Austria.
mla: Adamowski, Maciek. Investigations into Cell Polarity and Trafficking in
the Plant Model Arabidopsis Thaliana . Institute of Science and Technology
Austria, 2017, doi:10.15479/AT:ISTA:th_842.
short: M. Adamowski, Investigations into Cell Polarity and Trafficking in the Plant
Model Arabidopsis Thaliana , Institute of Science and Technology Austria, 2017.
date_created: 2018-12-11T11:49:18Z
date_published: 2017-06-02T00:00:00Z
date_updated: 2023-09-07T12:06:09Z
day: '02'
ddc:
- '581'
- '583'
- '580'
degree_awarded: PhD
department:
- _id: JiFr
doi: 10.15479/AT:ISTA:th_842
file:
- access_level: closed
checksum: 193425764d9aaaed3ac57062a867b315
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-04-05T09:03:20Z
date_updated: 2020-07-14T12:48:15Z
file_id: '6215'
file_name: 2017_Adamowski-Thesis_Source.docx
file_size: 46903863
relation: source_file
- access_level: open_access
checksum: df5ab01be81f821e1b958596a1ec8d21
content_type: application/pdf
creator: dernst
date_created: 2019-04-05T09:03:19Z
date_updated: 2020-07-14T12:48:15Z
file_id: '6216'
file_name: 2017_Adamowski-Thesis.pdf
file_size: 8698888
relation: main_file
file_date_updated: 2020-07-14T12:48:15Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '117'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6483'
pubrep_id: '842'
related_material:
record:
- id: '1591'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
title: 'Investigations into cell polarity and trafficking in the plant model Arabidopsis
thaliana '
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2017'
...
---
_id: '939'
abstract:
- lang: eng
text: We reveal the existence of continuous families of guided single-mode solitons
in planar waveguides with weakly nonlinear active core and absorbing boundaries.
Stable propagation of TE and TM-polarized solitons is accompanied by attenuation
of all other modes, i.e., the waveguide features properties of conservative and
dissipative systems. If the linear spectrum of the waveguide possesses exceptional
points, which occurs in the case of TM polarization, an originally focusing (defocusing)
material nonlinearity may become effectively defocusing (focusing). This occurs
due to the geometric phase of the carried eigenmode when the surface impedance
encircles the exceptional point. In its turn, the change of the effective nonlinearity
ensures the existence of dark (bright) solitons in spite of focusing (defocusing)
Kerr nonlinearity of the core. The existence of an exceptional point can also
result in anomalous enhancement of the effective nonlinearity. In terms of practical
applications, the nonlinearity of the reported waveguide can be manipulated by
controlling the properties of the absorbing cladding.
article_number: '033905'
article_processing_charge: No
author:
- first_name: Bikashkali
full_name: Midya, Bikashkali
id: 456187FC-F248-11E8-B48F-1D18A9856A87
last_name: Midya
- first_name: Vladimir
full_name: Konotop, Vladimir
last_name: Konotop
citation:
ama: 'Midya B, Konotop V. Waveguides with absorbing boundaries: Nonlinearity controlled
by an exceptional point and solitons. Physical Review Letters. 2017;119(3).
doi:10.1103/PhysRevLett.119.033905'
apa: 'Midya, B., & Konotop, V. (2017). Waveguides with absorbing boundaries:
Nonlinearity controlled by an exceptional point and solitons. Physical Review
Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.119.033905'
chicago: 'Midya, Bikashkali, and Vladimir Konotop. “Waveguides with Absorbing Boundaries:
Nonlinearity Controlled by an Exceptional Point and Solitons.” Physical Review
Letters. American Physical Society, 2017. https://doi.org/10.1103/PhysRevLett.119.033905.'
ieee: 'B. Midya and V. Konotop, “Waveguides with absorbing boundaries: Nonlinearity
controlled by an exceptional point and solitons,” Physical Review Letters,
vol. 119, no. 3. American Physical Society, 2017.'
ista: 'Midya B, Konotop V. 2017. Waveguides with absorbing boundaries: Nonlinearity
controlled by an exceptional point and solitons. Physical Review Letters. 119(3),
033905.'
mla: 'Midya, Bikashkali, and Vladimir Konotop. “Waveguides with Absorbing Boundaries:
Nonlinearity Controlled by an Exceptional Point and Solitons.” Physical Review
Letters, vol. 119, no. 3, 033905, American Physical Society, 2017, doi:10.1103/PhysRevLett.119.033905.'
short: B. Midya, V. Konotop, Physical Review Letters 119 (2017).
date_created: 2018-12-11T11:49:18Z
date_published: 2017-07-18T00:00:00Z
date_updated: 2023-09-26T15:39:46Z
day: '18'
department:
- _id: MiLe
doi: 10.1103/PhysRevLett.119.033905
ec_funded: 1
external_id:
isi:
- '000405718200012'
intvolume: ' 119'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'https://arxiv.org/abs/1706.04085 '
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review Letters
publication_identifier:
issn:
- '00319007'
publication_status: published
publisher: American Physical Society
publist_id: '6481'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Waveguides with absorbing boundaries: Nonlinearity controlled by an exceptional
point and solitons'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 119
year: '2017'
...
---
_id: '693'
abstract:
- lang: eng
text: 'Many central synapses contain a single presynaptic active zone and a single
postsynaptic density. Vesicular release statistics at such “simple synapses” indicate
that they contain a small complement of docking sites where vesicles repetitively
dock and fuse. In this work, we investigate functional and morphological aspects
of docking sites at simple synapses made between cerebellar parallel fibers and
molecular layer interneurons. Using immunogold labeling of SDS-treated freeze-fracture
replicas, we find that Cav2.1 channels form several clusters per active zone with
about nine channels per cluster. The mean value and range of intersynaptic variation
are similar for Cav2.1 cluster numbers and for functional estimates of docking-site
numbers obtained from the maximum numbers of released vesicles per action potential.
Both numbers grow in relation with synaptic size and decrease by a similar extent
with age between 2 wk and 4 wk postnatal. Thus, the mean docking-site numbers
were 3.15 at 2 wk (range: 1–10) and 2.03 at 4 wk (range: 1–4), whereas the mean
numbers of Cav2.1 clusters were 2.84 at 2 wk (range: 1–8) and 2.37 at 4 wk (range:
1–5). These changes were accompanied by decreases of miniature current amplitude
(from 93 pA to 56 pA), active-zone surface area (from 0.0427 μm2 to 0.0234 μm2),
and initial success rate (from 0.609 to 0.353), indicating a tightening of synaptic
transmission with development. Altogether, these results suggest a close correspondence
between the number of functionally defined vesicular docking sites and that of
clusters of voltage-gated calcium channels. '
article_processing_charge: Yes (in subscription journal)
author:
- first_name: Takafumi
full_name: Miki, Takafumi
last_name: Miki
- first_name: Walter
full_name: Kaufmann, Walter
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Gerardo
full_name: Malagon, Gerardo
last_name: Malagon
- first_name: Laura
full_name: Gomez, Laura
last_name: Gomez
- first_name: Katsuhiko
full_name: Tabuchi, Katsuhiko
last_name: Tabuchi
- first_name: Masahiko
full_name: Watanabe, Masahiko
last_name: Watanabe
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Alain
full_name: Marty, Alain
last_name: Marty
citation:
ama: Miki T, Kaufmann W, Malagon G, et al. Numbers of presynaptic Ca2+ channel clusters
match those of functionally defined vesicular docking sites in single central
synapses. PNAS. 2017;114(26):E5246-E5255. doi:10.1073/pnas.1704470114
apa: Miki, T., Kaufmann, W., Malagon, G., Gomez, L., Tabuchi, K., Watanabe, M.,
… Marty, A. (2017). Numbers of presynaptic Ca2+ channel clusters match those of
functionally defined vesicular docking sites in single central synapses. PNAS.
National Academy of Sciences. https://doi.org/10.1073/pnas.1704470114
chicago: Miki, Takafumi, Walter Kaufmann, Gerardo Malagon, Laura Gomez, Katsuhiko
Tabuchi, Masahiko Watanabe, Ryuichi Shigemoto, and Alain Marty. “Numbers of Presynaptic
Ca2+ Channel Clusters Match Those of Functionally Defined Vesicular Docking Sites
in Single Central Synapses.” PNAS. National Academy of Sciences, 2017.
https://doi.org/10.1073/pnas.1704470114.
ieee: T. Miki et al., “Numbers of presynaptic Ca2+ channel clusters match
those of functionally defined vesicular docking sites in single central synapses,”
PNAS, vol. 114, no. 26. National Academy of Sciences, pp. E5246–E5255,
2017.
ista: Miki T, Kaufmann W, Malagon G, Gomez L, Tabuchi K, Watanabe M, Shigemoto R,
Marty A. 2017. Numbers of presynaptic Ca2+ channel clusters match those of functionally
defined vesicular docking sites in single central synapses. PNAS. 114(26), E5246–E5255.
mla: Miki, Takafumi, et al. “Numbers of Presynaptic Ca2+ Channel Clusters Match
Those of Functionally Defined Vesicular Docking Sites in Single Central Synapses.”
PNAS, vol. 114, no. 26, National Academy of Sciences, 2017, pp. E5246–55,
doi:10.1073/pnas.1704470114.
short: T. Miki, W. Kaufmann, G. Malagon, L. Gomez, K. Tabuchi, M. Watanabe, R. Shigemoto,
A. Marty, PNAS 114 (2017) E5246–E5255.
date_created: 2018-12-11T11:47:57Z
date_published: 2017-06-27T00:00:00Z
date_updated: 2023-02-23T12:54:57Z
day: '27'
ddc:
- '570'
department:
- _id: EM-Fac
- _id: RySh
doi: 10.1073/pnas.1704470114
external_id:
pmid:
- '28607047'
file:
- access_level: open_access
checksum: 2ab75d554f3df4a34d20fa8040589b7e
content_type: application/pdf
creator: kschuh
date_created: 2020-01-03T13:27:29Z
date_updated: 2020-07-14T12:47:44Z
file_id: '7223'
file_name: 2017_PNAS_Miki.pdf
file_size: 2721544
relation: main_file
file_date_updated: 2020-07-14T12:47:44Z
has_accepted_license: '1'
intvolume: ' 114'
issue: '26'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: E5246 - E5255
pmid: 1
publication: PNAS
publication_identifier:
issn:
- '00278424'
publication_status: published
publisher: National Academy of Sciences
publist_id: '7013'
quality_controlled: '1'
scopus_import: 1
status: public
title: Numbers of presynaptic Ca2+ channel clusters match those of functionally defined
vesicular docking sites in single central synapses
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2017'
...
---
_id: '694'
abstract:
- lang: eng
text: A change regarding the extent of adhesion - hereafter referred to as adhesion
plasticity - between adhesive and less-adhesive states of mammalian cells is important
for their behavior. To investigate adhesion plasticity, we have selected a stable
isogenic subpopulation of human MDA-MB-468 breast carcinoma cells growing in suspension.
These suspension cells are unable to re-adhere to various matrices or to contract
three-dimensional collagen lattices. By using transcriptome analysis, we identified
the focal adhesion protein tensin3 (Tns3) as a determinant of adhesion plasticity.
Tns3 is strongly reduced at mRNA and protein levels in suspension cells. Furthermore,
by transiently challenging breast cancer cells to grow under non-adherent conditions
markedly reduces Tns3 protein expression, which is regained upon re-adhesion.
Stable knockdown of Tns3 in parental MDA-MB-468 cells results in defective adhesion,
spreading and migration. Tns3-knockdown cells display impaired structure and dynamics
of focal adhesion complexes as determined by immunostaining. Restoration of Tns3
protein expression in suspension cells partially rescues adhesion and focal contact
composition. Our work identifies Tns3 as a crucial focal adhesion component regulated
by, and functionally contributing to, the switch between adhesive and non-adhesive
states in MDA-MB-468 cancer cells.
article_type: original
author:
- first_name: Astrid
full_name: Veß, Astrid
last_name: Veß
- first_name: Ulrich
full_name: Blache, Ulrich
last_name: Blache
- first_name: Laura
full_name: Leitner, Laura
last_name: Leitner
- first_name: Angela
full_name: Kurz, Angela
last_name: Kurz
- first_name: Anja
full_name: Ehrenpfordt, Anja
last_name: Ehrenpfordt
- 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: Guido
full_name: Posern, Guido
last_name: Posern
citation:
ama: Veß A, Blache U, Leitner L, et al. A dual phenotype of MDA MB 468 cancer cells
reveals mutual regulation of tensin3 and adhesion plasticity. Journal of Cell
Science. 2017;130(13):2172-2184. doi:10.1242/jcs.200899
apa: Veß, A., Blache, U., Leitner, L., Kurz, A., Ehrenpfordt, A., Sixt, M. K., &
Posern, G. (2017). A dual phenotype of MDA MB 468 cancer cells reveals mutual
regulation of tensin3 and adhesion plasticity. Journal of Cell Science.
Company of Biologists. https://doi.org/10.1242/jcs.200899
chicago: Veß, Astrid, Ulrich Blache, Laura Leitner, Angela Kurz, Anja Ehrenpfordt,
Michael K Sixt, and Guido Posern. “A Dual Phenotype of MDA MB 468 Cancer Cells
Reveals Mutual Regulation of Tensin3 and Adhesion Plasticity.” Journal of Cell
Science. Company of Biologists, 2017. https://doi.org/10.1242/jcs.200899.
ieee: A. Veß et al., “A dual phenotype of MDA MB 468 cancer cells reveals
mutual regulation of tensin3 and adhesion plasticity,” Journal of Cell Science,
vol. 130, no. 13. Company of Biologists, pp. 2172–2184, 2017.
ista: Veß A, Blache U, Leitner L, Kurz A, Ehrenpfordt A, Sixt MK, Posern G. 2017.
A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3
and adhesion plasticity. Journal of Cell Science. 130(13), 2172–2184.
mla: Veß, Astrid, et al. “A Dual Phenotype of MDA MB 468 Cancer Cells Reveals Mutual
Regulation of Tensin3 and Adhesion Plasticity.” Journal of Cell Science,
vol. 130, no. 13, Company of Biologists, 2017, pp. 2172–84, doi:10.1242/jcs.200899.
short: A. Veß, U. Blache, L. Leitner, A. Kurz, A. Ehrenpfordt, M.K. Sixt, G. Posern,
Journal of Cell Science 130 (2017) 2172–2184.
date_created: 2018-12-11T11:47:58Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2021-01-12T08:09:41Z
day: '01'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1242/jcs.200899
external_id:
pmid:
- '28515231'
file:
- access_level: open_access
checksum: 42c81a0a4fc3128883b391c3af3f74bc
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T09:43:56Z
date_updated: 2020-07-14T12:47:45Z
file_id: '6966'
file_name: 2017_CellScience_Vess.pdf
file_size: 10847596
relation: main_file
file_date_updated: 2020-07-14T12:47:45Z
has_accepted_license: '1'
intvolume: ' 130'
issue: '13'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 2172 - 2184
pmid: 1
publication: Journal of Cell Science
publication_identifier:
issn:
- '00219533'
publication_status: published
publisher: Company of Biologists
publist_id: '7008'
quality_controlled: '1'
scopus_import: 1
status: public
title: A dual phenotype of MDA MB 468 cancer cells reveals mutual regulation of tensin3
and adhesion plasticity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 130
year: '2017'
...
---
_id: '696'
abstract:
- lang: eng
text: Mutator strains are expected to evolve when the availability and effect of
beneficial mutations are high enough to counteract the disadvantage from deleterious
mutations that will inevitably accumulate. As the population becomes more adapted
to its environment, both availability and effect of beneficial mutations necessarily
decrease and mutation rates are predicted to decrease. It has been shown that
certain molecular mechanisms can lead to increased mutation rates when the organism
finds itself in a stressful environment. While this may be a correlated response
to other functions, it could also be an adaptive mechanism, raising mutation rates
only when it is most advantageous. Here, we use a mathematical model to investigate
the plausibility of the adaptive hypothesis. We show that such a mechanism can
be mantained if the population is subjected to diverse stresses. By simulating
various antibiotic treatment schemes, we find that combination treatments can
reduce the effectiveness of second-order selection on stress-induced mutagenesis.
We discuss the implications of our results to strategies of antibiotic therapy.
article_number: e1005609
article_type: original
author:
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: 'Lukacisinova M, Novak S, Paixao T. Stress induced mutagenesis: Stress diversity
facilitates the persistence of mutator genes. PLoS Computational Biology.
2017;13(7). doi:10.1371/journal.pcbi.1005609'
apa: 'Lukacisinova, M., Novak, S., & Paixao, T. (2017). Stress induced mutagenesis:
Stress diversity facilitates the persistence of mutator genes. PLoS Computational
Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1005609'
chicago: 'Lukacisinova, Marta, Sebastian Novak, and Tiago Paixao. “Stress Induced
Mutagenesis: Stress Diversity Facilitates the Persistence of Mutator Genes.” PLoS
Computational Biology. Public Library of Science, 2017. https://doi.org/10.1371/journal.pcbi.1005609.'
ieee: 'M. Lukacisinova, S. Novak, and T. Paixao, “Stress induced mutagenesis: Stress
diversity facilitates the persistence of mutator genes,” PLoS Computational
Biology, vol. 13, no. 7. Public Library of Science, 2017.'
ista: 'Lukacisinova M, Novak S, Paixao T. 2017. Stress induced mutagenesis: Stress
diversity facilitates the persistence of mutator genes. PLoS Computational Biology.
13(7), e1005609.'
mla: 'Lukacisinova, Marta, et al. “Stress Induced Mutagenesis: Stress Diversity
Facilitates the Persistence of Mutator Genes.” PLoS Computational Biology,
vol. 13, no. 7, e1005609, Public Library of Science, 2017, doi:10.1371/journal.pcbi.1005609.'
short: M. Lukacisinova, S. Novak, T. Paixao, PLoS Computational Biology 13 (2017).
date_created: 2018-12-11T11:47:58Z
date_published: 2017-07-18T00:00:00Z
date_updated: 2024-03-25T23:30:14Z
day: '18'
ddc:
- '576'
department:
- _id: ToBo
- _id: NiBa
- _id: CaGu
doi: 10.1371/journal.pcbi.1005609
ec_funded: 1
file:
- access_level: open_access
checksum: 9143c290fa6458ed2563bff4b295554a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:01Z
date_updated: 2020-07-14T12:47:46Z
file_id: '5117'
file_name: IST-2017-894-v1+1_journal.pcbi.1005609.pdf
file_size: 3775716
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: PLoS Computational Biology
publication_identifier:
issn:
- 1553734X
publication_status: published
publisher: Public Library of Science
publist_id: '7004'
pubrep_id: '894'
quality_controlled: '1'
related_material:
record:
- id: '9849'
relation: research_data
status: public
- id: '9850'
relation: research_data
status: public
- id: '9851'
relation: research_data
status: public
- id: '9852'
relation: research_data
status: public
- id: '6263'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: 'Stress induced mutagenesis: Stress diversity facilitates the persistence of
mutator genes'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '697'
abstract:
- lang: eng
text: 'De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over
n-bit strings which has constant statistical distance to uniform (e.g., the output
of a pseudorandom generator mapping n-1 to n bit strings), can be distinguished
from the uniform distribution with advantage epsilon by a circuit of size O( 2^n
epsilon^2). We generalize this result, showing that a distribution which has less
than k bits of min-entropy, can be distinguished from any distribution with k
bits of delta-smooth min-entropy with advantage epsilon by a circuit of size O(2^k
epsilon^2/delta^2). As a special case, this implies that any distribution with
support at most 2^k (e.g., the output of a pseudoentropy generator mapping k to
n bit strings) can be distinguished from any given distribution with min-entropy
k+1 with advantage epsilon by a circuit of size O(2^k epsilon^2). Our result thus
shows that pseudoentropy distributions face basically the same non-uniform attacks
as pseudorandom distributions. '
alternative_title:
- LIPIcs
article_number: '39'
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Maciej
full_name: Skórski, Maciej
id: EC09FA6A-02D0-11E9-8223-86B7C91467DD
last_name: Skórski
citation:
ama: 'Pietrzak KZ, Skórski M. Non uniform attacks against pseudoentropy. In: Vol
80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.ICALP.2017.39'
apa: 'Pietrzak, K. Z., & Skórski, M. (2017). Non uniform attacks against pseudoentropy
(Vol. 80). Presented at the ICALP: International Colloquium on Automata, Languages,
and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.ICALP.2017.39'
chicago: Pietrzak, Krzysztof Z, and Maciej Skórski. “Non Uniform Attacks against
Pseudoentropy,” Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
https://doi.org/10.4230/LIPIcs.ICALP.2017.39.
ieee: 'K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,”
presented at the ICALP: International Colloquium on Automata, Languages, and Programming,
Warsaw, Poland, 2017, vol. 80.'
ista: 'Pietrzak KZ, Skórski M. 2017. Non uniform attacks against pseudoentropy.
ICALP: International Colloquium on Automata, Languages, and Programming, LIPIcs,
vol. 80, 39.'
mla: Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against
Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017, doi:10.4230/LIPIcs.ICALP.2017.39.
short: K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2017.
conference:
end_date: 2017-07-14
location: Warsaw, Poland
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2017-07-10
date_created: 2018-12-11T11:47:59Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2021-01-12T08:11:15Z
day: '01'
ddc:
- '005'
department:
- _id: KrPi
doi: 10.4230/LIPIcs.ICALP.2017.39
ec_funded: 1
file:
- access_level: open_access
checksum: e95618a001692f1af2d68f5fde43bc1f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:40Z
date_updated: 2020-07-14T12:47:46Z
file_id: '4701'
file_name: IST-2017-893-v1+1_LIPIcs-ICALP-2017-39.pdf
file_size: 601004
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 80'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 258AA5B2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '682815'
name: Teaching Old Crypto New Tricks
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7003'
pubrep_id: '893'
quality_controlled: '1'
scopus_import: 1
status: public
title: Non uniform attacks against pseudoentropy
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2017'
...
---
_id: '698'
abstract:
- lang: eng
text: 'Extracellular matrix signals from the microenvironment regulate gene expression
patterns and cell behavior. Using a combination of experiments and geometric models,
we demonstrate correlations between cell geometry, three-dimensional (3D) organization
of chromosome territories, and gene expression. Fluorescence in situ hybridization
experiments showed that micropatterned fibroblasts cultured on anisotropic versus
isotropic substrates resulted in repositioning of specific chromosomes, which
contained genes that were differentially regulated by cell geometries. Experiments
combined with ellipsoid packing models revealed that the mechanosensitivity of
chromosomes was correlated with their orientation in the nucleus. Transcription
inhibition experiments suggested that the intermingling degree was more sensitive
to global changes in transcription than to chromosome radial positioning and its
orientations. These results suggested that cell geometry modulated 3D chromosome
arrangement, and their neighborhoods correlated with gene expression patterns
in a predictable manner. This is central to understanding geometric control of
genetic programs involved in cellular homeostasis and the associated diseases. '
author:
- first_name: Yejun
full_name: Wang, Yejun
last_name: Wang
- first_name: Mallika
full_name: Nagarajan, Mallika
last_name: Nagarajan
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Gv
full_name: Shivashankar, Gv
last_name: Shivashankar
citation:
ama: Wang Y, Nagarajan M, Uhler C, Shivashankar G. Orientation and repositioning
of chromosomes correlate with cell geometry dependent gene expression. Molecular
Biology of the Cell. 2017;28(14):1997-2009. doi:10.1091/mbc.E16-12-0825
apa: Wang, Y., Nagarajan, M., Uhler, C., & Shivashankar, G. (2017). Orientation
and repositioning of chromosomes correlate with cell geometry dependent gene expression.
Molecular Biology of the Cell. American Society for Cell Biology. https://doi.org/10.1091/mbc.E16-12-0825
chicago: Wang, Yejun, Mallika Nagarajan, Caroline Uhler, and Gv Shivashankar. “Orientation
and Repositioning of Chromosomes Correlate with Cell Geometry Dependent Gene Expression.”
Molecular Biology of the Cell. American Society for Cell Biology, 2017.
https://doi.org/10.1091/mbc.E16-12-0825.
ieee: Y. Wang, M. Nagarajan, C. Uhler, and G. Shivashankar, “Orientation and repositioning
of chromosomes correlate with cell geometry dependent gene expression,” Molecular
Biology of the Cell, vol. 28, no. 14. American Society for Cell Biology, pp.
1997–2009, 2017.
ista: Wang Y, Nagarajan M, Uhler C, Shivashankar G. 2017. Orientation and repositioning
of chromosomes correlate with cell geometry dependent gene expression. Molecular
Biology of the Cell. 28(14), 1997–2009.
mla: Wang, Yejun, et al. “Orientation and Repositioning of Chromosomes Correlate
with Cell Geometry Dependent Gene Expression.” Molecular Biology of the Cell,
vol. 28, no. 14, American Society for Cell Biology, 2017, pp. 1997–2009, doi:10.1091/mbc.E16-12-0825.
short: Y. Wang, M. Nagarajan, C. Uhler, G. Shivashankar, Molecular Biology of the
Cell 28 (2017) 1997–2009.
date_created: 2018-12-11T11:47:59Z
date_published: 2017-07-07T00:00:00Z
date_updated: 2021-01-12T08:11:17Z
day: '07'
ddc:
- '519'
department:
- _id: CaUh
doi: 10.1091/mbc.E16-12-0825
file:
- access_level: open_access
checksum: de01dac9e30970cfa6ae902480a4e04d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:53Z
date_updated: 2020-07-14T12:47:46Z
file_id: '4844'
file_name: IST-2017-892-v1+1_Mol._Biol._Cell-2017-Wang-1997-2009.pdf
file_size: 1086097
relation: main_file
file_date_updated: 2020-07-14T12:47:46Z
has_accepted_license: '1'
intvolume: ' 28'
issue: '14'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: 1997 - 2009
project:
- _id: 2530CA10-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y 903-N35
name: 'Gaussian Graphical Models: Theory and Applications'
publication: Molecular Biology of the Cell
publication_identifier:
issn:
- '10591524'
publication_status: published
publisher: American Society for Cell Biology
publist_id: '7001'
pubrep_id: '892'
quality_controlled: '1'
scopus_import: 1
status: public
title: Orientation and repositioning of chromosomes correlate with cell geometry dependent
gene expression
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2017'
...