---
OA_place: publisher
_id: '992'
abstract:
- lang: eng
  text: "An instance of the Constraint Satisfaction Problem (CSP) is given by a finite
    set of\r\nvariables, a finite domain of labels, and a set of constraints, each
    constraint acting on\r\na subset of the variables. The goal is to find an assignment
    of labels to its variables\r\nthat satisfies all constraints (or decide whether
    one exists). If we allow more general\r\n“soft” constraints, which come with (possibly
    infinite) costs of particular assignments,\r\nwe obtain instances from a richer
    class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal
    is to find an assignment with minimum total cost.\r\nIn this thesis, we focus
    (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity
    of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent
    of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage,
    that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe
    complexity classification modulo (missing pieces of) complexity classification
    for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’
    perfect\r\nmatching algorithm. This generalization contributes to complexity classfications
    in two\r\nways. First, it gives a new (largest known) polynomial-time solvable
    class of Boolean\r\nCSPs in which every variable may appear in at most two constraints
    and second, it\r\nsettles full classification of Boolean CSPs with planar drawing
    (again parametrized by a\r\nconstraint language)."
acknowledgement: FP7/2007-2013/ERC grant agreement no 616160
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Michal
  full_name: Rolinek, Michal
  id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
  last_name: Rolinek
citation:
  ama: Rolinek M. Complexity of constraint satisfaction. 2017. doi:<a href="https://doi.org/10.15479/AT:ISTA:th_815">10.15479/AT:ISTA:th_815</a>
  apa: Rolinek, M. (2017). <i>Complexity of constraint satisfaction</i>. Institute
    of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:th_815">https://doi.org/10.15479/AT:ISTA:th_815</a>
  chicago: Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of
    Science and Technology Austria, 2017. <a href="https://doi.org/10.15479/AT:ISTA:th_815">https://doi.org/10.15479/AT:ISTA:th_815</a>.
  ieee: M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science
    and Technology Austria, 2017.
  ista: Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science
    and Technology Austria.
  mla: Rolinek, Michal. <i>Complexity of Constraint Satisfaction</i>. Institute of
    Science and Technology Austria, 2017, doi:<a href="https://doi.org/10.15479/AT:ISTA:th_815">10.15479/AT:ISTA:th_815</a>.
  short: M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and
    Technology Austria, 2017.
corr_author: '1'
date_created: 2018-12-11T11:49:35Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2026-04-08T14:17:06Z
day: '01'
ddc:
- '004'
degree_awarded: PhD
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:th_815
ec_funded: 1
file:
- access_level: open_access
  checksum: 81761fb939acb7585c36629f765b4373
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:07:55Z
  date_updated: 2020-07-14T12:48:18Z
  file_id: '4654'
  file_name: IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf
  file_size: 786145
  relation: main_file
- access_level: closed
  checksum: 2b2d7e1d6c1c79a9795a7aa0f860baf3
  content_type: application/zip
  creator: dernst
  date_created: 2019-04-05T08:43:24Z
  date_updated: 2020-07-14T12:48:18Z
  file_id: '6208'
  file_name: 2017_Thesis_Rolinek_source.zip
  file_size: 5936337
  relation: source_file
file_date_updated: 2020-07-14T12:48:18Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '97'
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '616160'
  name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6407'
pubrep_id: '815'
status: public
supervisor:
- first_name: Vladimir
  full_name: Kolmogorov, Vladimir
  id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
  last_name: Kolmogorov
title: Complexity of constraint satisfaction
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2017'
...
---
_id: '1177'
abstract:
- lang: eng
  text: Boldyreva, Palacio and Warinschi introduced a multiple forking game as an
    extension of general forking. The notion of (multiple) forking is a useful abstraction
    from the actual simulation of cryptographic scheme to the adversary in a security
    reduction, and is achieved through the intermediary of a so-called wrapper algorithm.
    Multiple forking has turned out to be a useful tool in the security argument of
    several cryptographic protocols. However, a reduction employing multiple forking
    incurs a significant degradation of (Formula presented.) , where (Formula presented.)
    denotes the upper bound on the underlying random oracle calls and (Formula presented.)
    , the number of forkings. In this work we take a closer look at the reasons for
    the degradation with a tighter security bound in mind. We nail down the exact
    set of conditions for success in the multiple forking game. A careful analysis
    of the cryptographic schemes and corresponding security reduction employing multiple
    forking leads to the formulation of ‘dependence’ and ‘independence’ conditions
    pertaining to the output of the wrapper in different rounds. Based on the (in)dependence
    conditions we propose a general framework of multiple forking and a General Multiple
    Forking Lemma. Leveraging (in)dependence to the full allows us to improve the
    degradation factor in the multiple forking game by a factor of (Formula presented.).
    By implication, the cost of a single forking involving two random oracles (augmented
    forking) matches that involving a single random oracle (elementary forking). Finally,
    we study the effect of these observations on the concrete security of existing
    schemes employing multiple forking. We conclude that by careful design of the
    protocol (and the wrapper in the security reduction) it is possible to harness
    our observations to the full extent.
acknowledgement: "We are grateful to the anonymous reviewers for their insightful
  comments. The\r\ndetailed reports helped us a lot to address the technical mistakes
  as well as to improve the overall presentation of the paper."
article_processing_charge: No
author:
- first_name: Chethan
  full_name: Kamath Hosdurg, Chethan
  id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87
  last_name: Kamath Hosdurg
  orcid: 0009-0006-6812-7317
- first_name: Sanjit
  full_name: Chatterjee, Sanjit
  last_name: Chatterjee
citation:
  ama: 'Kamath Hosdurg C, Chatterjee S. A closer look at multiple-forking: Leveraging
    (in)dependence for a tighter bound. <i>Algorithmica</i>. 2016;74(4):1321-1362.
    doi:<a href="https://doi.org/10.1007/s00453-015-9997-6">10.1007/s00453-015-9997-6</a>'
  apa: 'Kamath Hosdurg, C., &#38; Chatterjee, S. (2016). A closer look at multiple-forking:
    Leveraging (in)dependence for a tighter bound. <i>Algorithmica</i>. Springer.
    <a href="https://doi.org/10.1007/s00453-015-9997-6">https://doi.org/10.1007/s00453-015-9997-6</a>'
  chicago: 'Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking:
    Leveraging (in)Dependence for a Tighter Bound.” <i>Algorithmica</i>. Springer,
    2016. <a href="https://doi.org/10.1007/s00453-015-9997-6">https://doi.org/10.1007/s00453-015-9997-6</a>.'
  ieee: 'C. Kamath Hosdurg and S. Chatterjee, “A closer look at multiple-forking:
    Leveraging (in)dependence for a tighter bound,” <i>Algorithmica</i>, vol. 74,
    no. 4. Springer, pp. 1321–1362, 2016.'
  ista: 'Kamath Hosdurg C, Chatterjee S. 2016. A closer look at multiple-forking:
    Leveraging (in)dependence for a tighter bound. Algorithmica. 74(4), 1321–1362.'
  mla: 'Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking:
    Leveraging (in)Dependence for a Tighter Bound.” <i>Algorithmica</i>, vol. 74,
    no. 4, Springer, 2016, pp. 1321–62, doi:<a href="https://doi.org/10.1007/s00453-015-9997-6">10.1007/s00453-015-9997-6</a>.'
  short: C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.
cryptoeprintid: 1
das_tickbox: '1'
date_created: 2018-12-11T11:50:33Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2026-06-22T14:07:33Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00453-015-9997-6
external_id:
  cryptoeprintid:
  - 2013/651
  isi:
  - '000373640000005'
intvolume: '        74'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://eprint.iacr.org/2013/651
month: '04'
oa: 1
oa_version: Submitted Version
page: 1321 - 1362
publication: Algorithmica
publication_status: published
publisher: Springer
publist_id: '6177'
quality_controlled: '1'
status: public
title: 'A closer look at multiple-forking: Leveraging (in)dependence for a tighter
  bound'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 74
year: '2016'
...
---
_id: '11834'
abstract:
- lang: eng
  text: "We present a deterministic incremental algorithm for exactly maintaining
    the size of a minimum cut with ~O(1) amortized time per edge insertion and O(1)
    query time. This result partially answers an open question posed by Thorup [Combinatorica
    2007]. It also stays in sharp contrast to a polynomial conditional lower-bound
    for the fully-dynamic weighted minimum cut problem. Our algorithm is obtained
    by combining a recent sparsification technique of Kawarabayashi and Thorup [STOC
    2015] and an exact incremental algorithm of Henzinger [J. of Algorithm 1997].\r\n\r\nWe
    also study space-efficient incremental algorithms for the minimum cut problem.
    Concretely, we show that there exists an O(n log n/epsilon^2) space Monte-Carlo
    algorithm that can process a stream of edge insertions starting from an empty
    graph, and with high probability, the algorithm maintains a (1+epsilon)-approximation
    to the minimum cut. The algorithm has ~O(1) amortized update-time and constant
    query-time."
alternative_title:
- LIPIcs
article_number: '46'
article_processing_charge: No
arxiv: 1
author:
- first_name: Gramoz
  full_name: Goranci, Gramoz
  last_name: Goranci
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Mikkel
  full_name: Thorup, Mikkel
  last_name: Thorup
citation:
  ama: 'Goranci G, Henzinger M, Thorup M. Incremental exact min-cut in poly-logarithmic
    amortized update time. In: <i>24th Annual European Symposium on Algorithms</i>.
    Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href="https://doi.org/10.4230/LIPICS.ESA.2016.46">10.4230/LIPICS.ESA.2016.46</a>'
  apa: 'Goranci, G., Henzinger, M., &#38; Thorup, M. (2016). Incremental exact min-cut
    in poly-logarithmic amortized update time. In <i>24th Annual European Symposium
    on Algorithms</i> (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.4230/LIPICS.ESA.2016.46">https://doi.org/10.4230/LIPICS.ESA.2016.46</a>'
  chicago: Goranci, Gramoz, Monika Henzinger, and Mikkel Thorup. “Incremental Exact
    Min-Cut in Poly-Logarithmic Amortized Update Time.” In <i>24th Annual European
    Symposium on Algorithms</i>, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2016. <a href="https://doi.org/10.4230/LIPICS.ESA.2016.46">https://doi.org/10.4230/LIPICS.ESA.2016.46</a>.
  ieee: G. Goranci, M. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic
    amortized update time,” in <i>24th Annual European Symposium on Algorithms</i>,
    Aarhus, Denmark, 2016, vol. 57.
  ista: 'Goranci G, Henzinger M, Thorup M. 2016. Incremental exact min-cut in poly-logarithmic
    amortized update time. 24th Annual European Symposium on Algorithms. ESA: Annual
    European Symposium on Algorithms, LIPIcs, vol. 57, 46.'
  mla: Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized
    Update Time.” <i>24th Annual European Symposium on Algorithms</i>, vol. 57, 46,
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href="https://doi.org/10.4230/LIPICS.ESA.2016.46">10.4230/LIPICS.ESA.2016.46</a>.
  short: G. Goranci, M. Henzinger, M. Thorup, in:, 24th Annual European Symposium
    on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
conference:
  end_date: 2016-08-24
  location: Aarhus, Denmark
  name: 'ESA: Annual European Symposium on Algorithms'
  start_date: 2016-08-22
date_created: 2022-08-12T10:58:32Z
date_published: 2016-08-18T00:00:00Z
date_updated: 2024-11-06T11:58:55Z
day: '18'
doi: 10.4230/LIPICS.ESA.2016.46
extern: '1'
external_id:
  arxiv:
  - '1611.06500'
intvolume: '        57'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.4230/LIPIcs.ESA.2016.46
month: '08'
oa: 1
oa_version: Published Version
publication: 24th Annual European Symposium on Algorithms
publication_identifier:
  isbn:
  - 978-3-95977-015-6
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental exact min-cut in poly-logarithmic amortized update time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '11835'
abstract:
- lang: eng
  text: "During the last 10 years it has become popular to study dynamic graph problems
    in a emergency planning or sensitivity setting: Instead of considering the general
    fully dynamic problem, we only have to process a single batch update of size d;
    after the update we have to answer queries.\r\n\r\nIn this paper, we consider
    the dynamic subgraph connectivity problem with sensitivity d: We are given a graph
    of which some vertices are activated and some are deactivated. After that we get
    a single update in which the states of up to $d$ vertices are changed. Then we
    get a sequence of connectivity queries in the subgraph of activated vertices.\r\n\r\nWe
    present the first fully dynamic algorithm for this problem which has an update
    and query time only slightly worse than the best decremental algorithm. In addition,
    we present the first incremental algorithm which is tight with respect to the
    best known conditional lower bound; moreover, the algorithm is simple and we believe
    it is implementable and efficient in practice."
alternative_title:
- LIPIcs
article_number: '48'
article_processing_charge: No
arxiv: 1
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Stefan
  full_name: Neumann, Stefan
  last_name: Neumann
citation:
  ama: 'Henzinger M, Neumann S. Incremental and fully dynamic subgraph connectivity
    for emergency planning. In: <i>24th Annual European Symposium on Algorithms</i>.
    Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href="https://doi.org/10.4230/LIPICS.ESA.2016.48">10.4230/LIPICS.ESA.2016.48</a>'
  apa: 'Henzinger, M., &#38; Neumann, S. (2016). Incremental and fully dynamic subgraph
    connectivity for emergency planning. In <i>24th Annual European Symposium on Algorithms</i>
    (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
    <a href="https://doi.org/10.4230/LIPICS.ESA.2016.48">https://doi.org/10.4230/LIPICS.ESA.2016.48</a>'
  chicago: Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph
    Connectivity for Emergency Planning.” In <i>24th Annual European Symposium on
    Algorithms</i>, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
    <a href="https://doi.org/10.4230/LIPICS.ESA.2016.48">https://doi.org/10.4230/LIPICS.ESA.2016.48</a>.
  ieee: M. Henzinger and S. Neumann, “Incremental and fully dynamic subgraph connectivity
    for emergency planning,” in <i>24th Annual European Symposium on Algorithms</i>,
    Aarhus, Denmark, 2016, vol. 57.
  ista: 'Henzinger M, Neumann S. 2016. Incremental and fully dynamic subgraph connectivity
    for emergency planning. 24th Annual European Symposium on Algorithms. ESA: Annual
    European Symposium on Algorithms, LIPIcs, vol. 57, 48.'
  mla: Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph
    Connectivity for Emergency Planning.” <i>24th Annual European Symposium on Algorithms</i>,
    vol. 57, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href="https://doi.org/10.4230/LIPICS.ESA.2016.48">10.4230/LIPICS.ESA.2016.48</a>.
  short: M. Henzinger, S. Neumann, in:, 24th Annual European Symposium on Algorithms,
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
conference:
  end_date: 2016-08-24
  location: Aarhus, Denmark
  name: 'ESA: Annual European Symposium on Algorithms'
  start_date: 2016-08-22
date_created: 2022-08-12T11:05:41Z
date_published: 2016-08-18T00:00:00Z
date_updated: 2024-11-06T11:59:06Z
day: '18'
doi: 10.4230/LIPICS.ESA.2016.48
extern: '1'
external_id:
  arxiv:
  - '1611.05248'
intvolume: '        57'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.4230/LIPIcs.ESA.2016.48
month: '08'
oa: 1
oa_version: Published Version
publication: 24th Annual European Symposium on Algorithms
publication_identifier:
  isbn:
  - 978-3-95977-015-6
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental and fully dynamic subgraph connectivity for emergency planning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '11836'
abstract:
- lang: eng
  text: "Given a graph where vertices are partitioned into k terminals and non-terminals,
    the goal is to compress the graph (i.e., reduce the number of non-terminals) using
    minor operations while preserving terminal distances approximately. The distortion
    of a compressed graph is the maximum multiplicative blow-up of distances between
    all pairs of terminals. We study the trade-off between the number of non-terminals
    and the distortion. This problem generalizes the Steiner Point Removal (SPR) problem,
    in which all non-terminals must be removed.\r\n\r\nWe introduce a novel black-box
    reduction to convert any lower bound on distortion for the SPR problem into a
    super-linear lower bound on the number of non-terminals, with the same distortion,
    for our problem. This allows us to show that there exist graphs such that every
    minor with distortion less than 2 / 2.5 / 3 must have Omega(k^2) / Omega(k^{5/4})
    / Omega(k^{6/5}) non-terminals, plus more trade-offs in between. The black-box
    reduction has an interesting consequence: if the tight lower bound on distortion
    for the SPR problem is super-constant, then allowing any O(k) non-terminals will
    not help improving the lower bound to a constant.\r\n\r\nWe also build on the
    existing results on spanners, distance oracles and connected 0-extensions to show
    a number of upper bounds for general graphs, planar graphs, graphs that exclude
    a fixed minor and bounded treewidth graphs. Among others, we show that any graph
    admits a minor with O(log k) distortion and O(k^2) non-terminals, and any planar
    graph admits a minor with\r\n1 + epsilon distortion and ~O((k/epsilon)^2) non-terminals."
alternative_title:
- LIPIcs
article_number: '131'
article_processing_charge: No
arxiv: 1
author:
- first_name: Yun Kuen
  full_name: Cheung, Yun Kuen
  last_name: Cheung
- first_name: Gramoz
  full_name: Goranci, Gramoz
  last_name: Goranci
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: 'Cheung YK, Goranci G, Henzinger M. Graph minors for preserving terminal distances
    approximately - lower and upper bounds. In: <i>43rd International Colloquium on
    Automata, Languages, and Programming</i>. Vol 55. Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik; 2016. doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2016.131">10.4230/LIPICS.ICALP.2016.131</a>'
  apa: 'Cheung, Y. K., Goranci, G., &#38; Henzinger, M. (2016). Graph minors for preserving
    terminal distances approximately - lower and upper bounds. In <i>43rd International
    Colloquium on Automata, Languages, and Programming</i> (Vol. 55). Rome, Italy:
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPICS.ICALP.2016.131">https://doi.org/10.4230/LIPICS.ICALP.2016.131</a>'
  chicago: Cheung, Yun Kuen, Gramoz Goranci, and Monika Henzinger. “Graph Minors for
    Preserving Terminal Distances Approximately - Lower and Upper Bounds.” In <i>43rd
    International Colloquium on Automata, Languages, and Programming</i>, Vol. 55.
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href="https://doi.org/10.4230/LIPICS.ICALP.2016.131">https://doi.org/10.4230/LIPICS.ICALP.2016.131</a>.
  ieee: Y. K. Cheung, G. Goranci, and M. Henzinger, “Graph minors for preserving terminal
    distances approximately - lower and upper bounds,” in <i>43rd International Colloquium
    on Automata, Languages, and Programming</i>, Rome, Italy, 2016, vol. 55.
  ista: 'Cheung YK, Goranci G, Henzinger M. 2016. Graph minors for preserving terminal
    distances approximately - lower and upper bounds. 43rd International Colloquium
    on Automata, Languages, and Programming. ICALP: International Colloquium on Automata,
    Languages, and Programming, LIPIcs, vol. 55, 131.'
  mla: Cheung, Yun Kuen, et al. “Graph Minors for Preserving Terminal Distances Approximately
    - Lower and Upper Bounds.” <i>43rd International Colloquium on Automata, Languages,
    and Programming</i>, vol. 55, 131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2016, doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2016.131">10.4230/LIPICS.ICALP.2016.131</a>.
  short: Y.K. Cheung, G. Goranci, M. Henzinger, in:, 43rd International Colloquium
    on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für
    Informatik, 2016.
conference:
  end_date: 2016-07-15
  location: Rome, Italy
  name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
  start_date: 2016-07-12
date_created: 2022-08-12T11:16:01Z
date_published: 2016-08-23T00:00:00Z
date_updated: 2024-11-06T11:58:15Z
day: '23'
doi: 10.4230/LIPICS.ICALP.2016.131
extern: '1'
external_id:
  arxiv:
  - '1604.08342'
intvolume: '        55'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.4230/LIPICS.ICALP.2016.131
month: '08'
oa: 1
oa_version: Published Version
publication: 43rd International Colloquium on Automata, Languages, and Programming
publication_identifier:
  isbn:
  - 978-3-95977-013-2
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Graph minors for preserving terminal distances approximately - lower and upper
  bounds
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2016'
...
---
_id: '1212'
abstract:
- lang: eng
  text: 'Plants adjust their growth according to gravity. Gravitropism involves gravity
    perception, signal transduction, and asymmetric growth response, with organ bending
    as a consequence [1]. Asymmetric growth results from the asymmetric distribution
    of the plant-specific signaling molecule auxin [2] that is generated by lateral
    transport, mediated in the hypocotyl predominantly by the auxin transporter PIN-FORMED3
    (PIN3) [3–5]. Gravity stimulation polarizes PIN3 to the bottom sides of endodermal
    cells, correlating with increased auxin accumulation in adjacent tissues at the
    lower side of the stimulated organ, where auxin induces cell elongation and, hence,
    organ bending. A curvature response allows the hypocotyl to resume straight growth
    at a defined angle [6], implying that at some point auxin symmetry is restored
    to prevent overbending. Here, we present initial insights into cellular and molecular
    mechanisms that lead to the termination of the tropic response. We identified
    an auxin feedback on PIN3 polarization as underlying mechanism that restores symmetry
    of the PIN3-dependent auxin flow. Thus, two mechanistically distinct PIN3 polarization
    events redirect auxin fluxes at different time points of the gravity response:
    first, gravity-mediated redirection of PIN3-mediated auxin flow toward the lower
    hypocotyl side, where auxin gradually accumulates and promotes growth, and later
    PIN3 polarization to the opposite cell side, depleting this auxin maximum to end
    the bending. Accordingly, genetic or pharmacological interference with the late
    PIN3 polarization prevents termination of the response and leads to hypocotyl
    overbending. This observation reveals a role of auxin feedback on PIN polarity
    in the termination of the tropic response. © 2016 Elsevier Ltd'
acknowledgement: "We thank Dr. Jie Li (Key Laboratory of Plant Molecular Physiology,
  Chinese Academy of Science, China) for the pPIN3::PIN3-GFP/DII::VENUS line and Martine
  De Cock for help in preparing the manuscript. This work was supported by the European
  Research Council (project ERC-2011-StG-20101109-PSDP), by the Czech Science Foundation
  GAČR (GA13-40637S) to J.F., and by the Ministry of Education, Youth and Sports of
  the Czech Republic under the project CEITEC 2020 (LQ1601) to H.S.R. H.R. is indebted
  to the Agency for Innovation by Science and Technology (IWT) for a predoctoral fellowship.\r\n"
article_processing_charge: No
author:
- first_name: Hana
  full_name: Rakusová, Hana
  last_name: Rakusová
- first_name: Mohamad
  full_name: Abbas, Mohamad
  id: 47E8FC1C-F248-11E8-B48F-1D18A9856A87
  last_name: Abbas
- first_name: Huibin
  full_name: Han, Huibin
  id: 31435098-F248-11E8-B48F-1D18A9856A87
  last_name: Han
- first_name: Siyuan
  full_name: Song, Siyuan
  last_name: Song
- first_name: Hélène
  full_name: Robert, Hélène
  last_name: Robert
- first_name: Jirí
  full_name: Friml, Jirí
  id: 4159519E-F248-11E8-B48F-1D18A9856A87
  last_name: Friml
  orcid: 0000-0002-8302-7596
citation:
  ama: Rakusová H, Abbas M, Han H, Song S, Robert H, Friml J. Termination of shoot
    gravitropic responses by auxin feedback on PIN3 polarity. <i>Current Biology</i>.
    2016;26(22):3026-3032. doi:<a href="https://doi.org/10.1016/j.cub.2016.08.067">10.1016/j.cub.2016.08.067</a>
  apa: Rakusová, H., Abbas, M., Han, H., Song, S., Robert, H., &#38; Friml, J. (2016).
    Termination of shoot gravitropic responses by auxin feedback on PIN3 polarity.
    <i>Current Biology</i>. Cell Press. <a href="https://doi.org/10.1016/j.cub.2016.08.067">https://doi.org/10.1016/j.cub.2016.08.067</a>
  chicago: Rakusová, Hana, Mohamad Abbas, Huibin Han, Siyuan Song, Hélène Robert,
    and Jiří Friml. “Termination of Shoot Gravitropic Responses by Auxin Feedback
    on PIN3 Polarity.” <i>Current Biology</i>. Cell Press, 2016. <a href="https://doi.org/10.1016/j.cub.2016.08.067">https://doi.org/10.1016/j.cub.2016.08.067</a>.
  ieee: H. Rakusová, M. Abbas, H. Han, S. Song, H. Robert, and J. Friml, “Termination
    of shoot gravitropic responses by auxin feedback on PIN3 polarity,” <i>Current
    Biology</i>, vol. 26, no. 22. Cell Press, pp. 3026–3032, 2016.
  ista: Rakusová H, Abbas M, Han H, Song S, Robert H, Friml J. 2016. Termination of
    shoot gravitropic responses by auxin feedback on PIN3 polarity. Current Biology.
    26(22), 3026–3032.
  mla: Rakusová, Hana, et al. “Termination of Shoot Gravitropic Responses by Auxin
    Feedback on PIN3 Polarity.” <i>Current Biology</i>, vol. 26, no. 22, Cell Press,
    2016, pp. 3026–32, doi:<a href="https://doi.org/10.1016/j.cub.2016.08.067">10.1016/j.cub.2016.08.067</a>.
  short: H. Rakusová, M. Abbas, H. Han, S. Song, H. Robert, J. Friml, Current Biology
    26 (2016) 3026–3032.
date_created: 2018-12-11T11:50:44Z
date_published: 2016-11-21T00:00:00Z
date_updated: 2026-04-28T08:29:26Z
day: '21'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1016/j.cub.2016.08.067
ec_funded: 1
external_id:
  isi:
  - '000388545900020'
file:
- access_level: open_access
  checksum: 79ed2498185a027cf51a8f88100379e6
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:09:33Z
  date_updated: 2020-07-14T12:44:39Z
  file_id: '4757'
  file_name: IST-2018-1008-v1+1_Rakusova_CurrBiol_2016_proof.pdf
  file_size: 5391923
  relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: '        26'
isi: 1
issue: '22'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 3026 - 3032
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '282300'
  name: Polarity and subcellular dynamics in plants
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '6138'
pubrep_id: '1008'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Termination of shoot gravitropic responses by auxin feedback on PIN3 polarity
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 26
year: '2016'
...
---
_id: '1222'
abstract:
- lang: eng
  text: We consider packings of congruent circles on a square flat torus, i.e., periodic
    (w.r.t. a square lattice) planar circle packings, with the maximal circle radius.
    This problem is interesting due to a practical reason—the problem of “super resolution
    of images.” We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly,
    for the case N=7 there are three different optimal arrangements. Our proof is
    based on a computer enumeration of toroidal irreducible contact graphs.
acknowledgement: We wish to thank Alexey Tarasov, Vladislav Volkov and Brittany Fasy
  for some useful comments and remarks, and especially Thom Sulanke for modifying
  surftri to suit our purposes. Oleg R. Musin was partially supported by the NSF Grant
  DMS-1400876 and by the RFBR Grant 15-01-99563. Anton V. Nikitenko was supported
  by the Chebyshev Laboratory (Department of Mathematics and Mechanics, St. Petersburg
  State University) under RF Government Grant 11.G34.31.0026.
article_processing_charge: No
arxiv: 1
author:
- first_name: Oleg
  full_name: Musin, Oleg
  last_name: Musin
- first_name: Anton
  full_name: Nikitenko, Anton
  id: 3E4FF1BA-F248-11E8-B48F-1D18A9856A87
  last_name: Nikitenko
  orcid: 0000-0002-0659-3201
citation:
  ama: Musin O, Nikitenko A. Optimal packings of congruent circles on a square flat
    torus. <i>Discrete &#38; Computational Geometry</i>. 2016;55(1):1-20. doi:<a href="https://doi.org/10.1007/s00454-015-9742-6">10.1007/s00454-015-9742-6</a>
  apa: Musin, O., &#38; Nikitenko, A. (2016). Optimal packings of congruent circles
    on a square flat torus. <i>Discrete &#38; Computational Geometry</i>. Springer.
    <a href="https://doi.org/10.1007/s00454-015-9742-6">https://doi.org/10.1007/s00454-015-9742-6</a>
  chicago: Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles
    on a Square Flat Torus.” <i>Discrete &#38; Computational Geometry</i>. Springer,
    2016. <a href="https://doi.org/10.1007/s00454-015-9742-6">https://doi.org/10.1007/s00454-015-9742-6</a>.
  ieee: O. Musin and A. Nikitenko, “Optimal packings of congruent circles on a square
    flat torus,” <i>Discrete &#38; Computational Geometry</i>, vol. 55, no. 1. Springer,
    pp. 1–20, 2016.
  ista: Musin O, Nikitenko A. 2016. Optimal packings of congruent circles on a square
    flat torus. Discrete &#38; Computational Geometry. 55(1), 1–20.
  mla: Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles on
    a Square Flat Torus.” <i>Discrete &#38; Computational Geometry</i>, vol. 55, no.
    1, Springer, 2016, pp. 1–20, doi:<a href="https://doi.org/10.1007/s00454-015-9742-6">10.1007/s00454-015-9742-6</a>.
  short: O. Musin, A. Nikitenko, Discrete &#38; Computational Geometry 55 (2016) 1–20.
date_created: 2018-12-11T11:50:48Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2025-09-22T09:32:23Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s00454-015-9742-6
external_id:
  arxiv:
  - '1212.0649'
  isi:
  - '000367625500001'
intvolume: '        55'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1212.0649
month: '01'
oa: 1
oa_version: Preprint
page: 1 - 20
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '6111'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal packings of congruent circles on a square flat torus
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 55
year: '2016'
...
---
_id: '12615'
abstract:
- lang: eng
  text: 'We apply the process-based, distributed TOPKAPI-ETH glacio-hydrological model
    to a glacierized catchment (19% glacierized) in the semiarid Andes of central
    Chile. The semiarid Andes provides vital freshwater resources to valleys in Chile
    and Argentina, but only few glacio-hydrological modelling studies have been conducted,
    and its dominant hydrological processes remain poorly understood. The catchment
    contains two debris-free glaciers reaching down to 3900 m asl (Bello and Yeso
    glaciers) and one debris-covered avalanche-fed glacier reaching to 3200 m asl
    (Piramide Glacier). Our main objective is to compare the mass balance and runoff
    contributions of both glacier types under current climatic conditions. We use
    a unique dataset of field measurements collected over two ablation seasons combined
    with the distributed TOPKAPI-ETH model that includes physically oriented parameterizations
    of snow and ice ablation, gravitational distribution of snow, snow albedo evolution
    and the ablation of debris-covered ice. Model outputs indicate that while the
    mass balance of Bello and Yeso glaciers is mostly explained by temperature gradients,
    the Piramide Glacier mass balance is governed by debris thickness and avalanches
    and has a clear non-linear profile with elevation as a result. Despite the thermal
    insulation effect of the debris cover, the mass balance and contribution to runoff
    from debris-free and debris-covered glaciers are similar in magnitude, mainly
    because of elevation differences. However, runoff contributions are distinct in
    time and seasonality with ice melt starting approximately four weeks earlier from
    the debris-covered glacier, what is of relevance for water resources management.
    At the catchment scale, snowmelt is the dominant contributor to runoff during
    both years. However, during the driest year of our simulations, ice melt contributes
    42 ± 8% and 67 ± 6% of the annual and summer runoff, respectively. Sensitivity
    analyses show that runoff is most sensitive to temperature and precipitation gradients,
    melt factors and debris cover thickness. '
article_processing_charge: No
article_type: original
author:
- first_name: A.
  full_name: Ayala, A.
  last_name: Ayala
- first_name: Francesca
  full_name: Pellicciotti, Francesca
  id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
  last_name: Pellicciotti
- first_name: S.
  full_name: MacDonell, S.
  last_name: MacDonell
- first_name: J.
  full_name: McPhee, J.
  last_name: McPhee
- first_name: S.
  full_name: Vivero, S.
  last_name: Vivero
- first_name: C.
  full_name: Campos, C.
  last_name: Campos
- first_name: P.
  full_name: Egli, P.
  last_name: Egli
citation:
  ama: Ayala A, Pellicciotti F, MacDonell S, et al. Modelling the hydrological response
    of debris-free and debris-covered glaciers to present climatic conditions in the
    semiarid Andes of central Chile. <i>Hydrological Processes</i>. 2016;30(22):4036-4058.
    doi:<a href="https://doi.org/10.1002/hyp.10971">10.1002/hyp.10971</a>
  apa: Ayala, A., Pellicciotti, F., MacDonell, S., McPhee, J., Vivero, S., Campos,
    C., &#38; Egli, P. (2016). Modelling the hydrological response of debris-free
    and debris-covered glaciers to present climatic conditions in the semiarid Andes
    of central Chile. <i>Hydrological Processes</i>. Wiley. <a href="https://doi.org/10.1002/hyp.10971">https://doi.org/10.1002/hyp.10971</a>
  chicago: Ayala, A., Francesca Pellicciotti, S. MacDonell, J. McPhee, S. Vivero,
    C. Campos, and P. Egli. “Modelling the Hydrological Response of Debris-Free and
    Debris-Covered Glaciers to Present Climatic Conditions in the Semiarid Andes of
    Central Chile.” <i>Hydrological Processes</i>. Wiley, 2016. <a href="https://doi.org/10.1002/hyp.10971">https://doi.org/10.1002/hyp.10971</a>.
  ieee: A. Ayala <i>et al.</i>, “Modelling the hydrological response of debris-free
    and debris-covered glaciers to present climatic conditions in the semiarid Andes
    of central Chile,” <i>Hydrological Processes</i>, vol. 30, no. 22. Wiley, pp.
    4036–4058, 2016.
  ista: Ayala A, Pellicciotti F, MacDonell S, McPhee J, Vivero S, Campos C, Egli P.
    2016. Modelling the hydrological response of debris-free and debris-covered glaciers
    to present climatic conditions in the semiarid Andes of central Chile. Hydrological
    Processes. 30(22), 4036–4058.
  mla: Ayala, A., et al. “Modelling the Hydrological Response of Debris-Free and Debris-Covered
    Glaciers to Present Climatic Conditions in the Semiarid Andes of Central Chile.”
    <i>Hydrological Processes</i>, vol. 30, no. 22, Wiley, 2016, pp. 4036–58, doi:<a
    href="https://doi.org/10.1002/hyp.10971">10.1002/hyp.10971</a>.
  short: A. Ayala, F. Pellicciotti, S. MacDonell, J. McPhee, S. Vivero, C. Campos,
    P. Egli, Hydrological Processes 30 (2016) 4036–4058.
date_created: 2023-02-20T08:14:40Z
date_published: 2016-07-28T00:00:00Z
date_updated: 2023-02-24T11:29:28Z
day: '28'
doi: 10.1002/hyp.10971
extern: '1'
intvolume: '        30'
issue: '22'
keyword:
- Water Science and Technology
language:
- iso: eng
month: '07'
oa_version: None
page: 4036-4058
publication: Hydrological Processes
publication_identifier:
  issn:
  - 0885-6087
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modelling the hydrological response of debris-free and debris-covered glaciers
  to present climatic conditions in the semiarid Andes of central Chile
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2016'
...
---
_id: '12617'
abstract:
- lang: eng
  text: This study presents volume and mass changes of seven (five partially debris-covered,
    two debris-free) glaciers in the upper Langtang catchment in Nepal. We use a digital
    elevation model (DEM) from 1974 stereo Hexagon satellite data and seven DEMs derived
    from 2006–2015 stereo or tri-stereo satellite imagery (e.g., SPOT6/7). The availability
    of multiple independent DEM differences allows the identification of a robust
    signal and narrowing down of the uncertainty about recent volume changes. The
    volume changes calculated over several multiyear periods between 2006 and 2015
    consistently indicate that glacier thinning has accelerated with respect to the
    period 1974–2006. We calculate an ensemble-mean elevation change rate of –0.45 ± 0.18 m a−1
    for 2006–2015, while for the period 1974–2006 we compute a rate of −0.24 ± 0.08 m a−1.
    However, the behavior of glaciers in the study area is heterogeneous, and the
    presence or absence of debris does not seem to be a good predictor for mass balance
    trends. Debris-covered tongues have nonlinear thinning profiles, and we show that
    recent accelerations in thinning correlate with the presence of supraglacial cliffs
    and lakes. At stagnating glacier areas near the glacier front, however, thinning
    rates decreased with time or remained constant. The April 2015 Nepal earthquake
    triggered large avalanches in the study catchment. Analysis of two post-earthquake
    DEMs revealed that the avalanche deposit volumes remaining 6 months after the
    earthquake are negligible in comparison to 2006–2015 elevation changes. However,
    the deposits compensate about 40 % the mass loss of debris-covered tongues of
    1 average year.
article_processing_charge: No
article_type: original
author:
- first_name: Silvan
  full_name: Ragettli, Silvan
  last_name: Ragettli
- first_name: Tobias
  full_name: Bolch, Tobias
  last_name: Bolch
- first_name: Francesca
  full_name: Pellicciotti, Francesca
  id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
  last_name: Pellicciotti
citation:
  ama: Ragettli S, Bolch T, Pellicciotti F. Heterogeneous glacier thinning patterns
    over the last 40 years in Langtang Himal, Nepal. <i>The Cryosphere</i>. 2016;10(5):2075-2097.
    doi:<a href="https://doi.org/10.5194/tc-10-2075-2016">10.5194/tc-10-2075-2016</a>
  apa: Ragettli, S., Bolch, T., &#38; Pellicciotti, F. (2016). Heterogeneous glacier
    thinning patterns over the last 40 years in Langtang Himal, Nepal. <i>The Cryosphere</i>.
    Copernicus Publications. <a href="https://doi.org/10.5194/tc-10-2075-2016">https://doi.org/10.5194/tc-10-2075-2016</a>
  chicago: Ragettli, Silvan, Tobias Bolch, and Francesca Pellicciotti. “Heterogeneous
    Glacier Thinning Patterns over the Last 40 Years in Langtang Himal, Nepal.” <i>The
    Cryosphere</i>. Copernicus Publications, 2016. <a href="https://doi.org/10.5194/tc-10-2075-2016">https://doi.org/10.5194/tc-10-2075-2016</a>.
  ieee: S. Ragettli, T. Bolch, and F. Pellicciotti, “Heterogeneous glacier thinning
    patterns over the last 40 years in Langtang Himal, Nepal,” <i>The Cryosphere</i>,
    vol. 10, no. 5. Copernicus Publications, pp. 2075–2097, 2016.
  ista: Ragettli S, Bolch T, Pellicciotti F. 2016. Heterogeneous glacier thinning
    patterns over the last 40 years in Langtang Himal, Nepal. The Cryosphere. 10(5),
    2075–2097.
  mla: Ragettli, Silvan, et al. “Heterogeneous Glacier Thinning Patterns over the
    Last 40 Years in Langtang Himal, Nepal.” <i>The Cryosphere</i>, vol. 10, no. 5,
    Copernicus Publications, 2016, pp. 2075–97, doi:<a href="https://doi.org/10.5194/tc-10-2075-2016">10.5194/tc-10-2075-2016</a>.
  short: S. Ragettli, T. Bolch, F. Pellicciotti, The Cryosphere 10 (2016) 2075–2097.
date_created: 2023-02-20T08:14:51Z
date_published: 2016-09-14T00:00:00Z
date_updated: 2023-02-24T10:54:02Z
day: '14'
doi: 10.5194/tc-10-2075-2016
extern: '1'
intvolume: '        10'
issue: '5'
keyword:
- Earth-Surface Processes
- Water Science and Technology
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.5194/tc-10-2075-2016
month: '09'
oa: 1
oa_version: Published Version
page: 2075-2097
publication: The Cryosphere
publication_identifier:
  issn:
  - 1994-0424
publication_status: published
publisher: Copernicus Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Heterogeneous glacier thinning patterns over the last 40 years in Langtang
  Himal, Nepal
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2016'
...
---
_id: '12625'
abstract:
- lang: eng
  text: Debris-covered glaciers play an important role in the high-altitude water
    cycle in the Himalaya, yet their dynamics are poorly understood, partly because
    of the difficult fieldwork conditions. In this study we therefore deploy an unmanned
    aerial vehicle (UAV) three times (May 2013, October 2013 and May 2014) over the
    debris-covered Lirung Glacier in Nepal. The acquired data are processed into orthomosaics
    and elevation models by a Structure from Motion workflow, and seasonal surface
    velocity is derived using frequency cross-correlation. In order to obtain optimal
    surface velocity products, the effects of different input data and correlator
    configurations are evaluated, which reveals that the orthomosaic as input paired
    with moderate correlator settings provides the best results. The glacier has considerable
    spatial and seasonal differences in surface velocity, with maximum summer and
    winter velocities 6 and 2.5 m a-1, respectively, in the upper part of the tongue,
    while the lower part is nearly stagnant. It is hypothesized that the higher velocities
    during summer are caused by basal sliding due to increased lubrication of the
    bed. We conclude that UAVs have great potential to quantify seasonal and annual
    variations in flow and can help to further our understanding of debris-covered
    glaciers.
article_processing_charge: No
article_type: original
author:
- first_name: Philip
  full_name: Kraaijenbrink, Philip
  last_name: Kraaijenbrink
- first_name: Sander W.
  full_name: Meijer, Sander W.
  last_name: Meijer
- first_name: Joseph M.
  full_name: Shea, Joseph M.
  last_name: Shea
- first_name: Francesca
  full_name: Pellicciotti, Francesca
  id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
  last_name: Pellicciotti
- first_name: Steven M.
  full_name: De Jong, Steven M.
  last_name: De Jong
- first_name: Walter W.
  full_name: Immerzeel, Walter W.
  last_name: Immerzeel
citation:
  ama: Kraaijenbrink P, Meijer SW, Shea JM, Pellicciotti F, De Jong SM, Immerzeel
    WW. Seasonal surface velocities of a Himalayan glacier derived by automated correlation
    of unmanned aerial vehicle imagery. <i>Annals of Glaciology</i>. 2016;57(71):103-113.
    doi:<a href="https://doi.org/10.3189/2016aog71a072">10.3189/2016aog71a072</a>
  apa: Kraaijenbrink, P., Meijer, S. W., Shea, J. M., Pellicciotti, F., De Jong, S.
    M., &#38; Immerzeel, W. W. (2016). Seasonal surface velocities of a Himalayan
    glacier derived by automated correlation of unmanned aerial vehicle imagery. <i>Annals
    of Glaciology</i>. International Glaciological Society. <a href="https://doi.org/10.3189/2016aog71a072">https://doi.org/10.3189/2016aog71a072</a>
  chicago: Kraaijenbrink, Philip, Sander W. Meijer, Joseph M. Shea, Francesca Pellicciotti,
    Steven M. De Jong, and Walter W. Immerzeel. “Seasonal Surface Velocities of a
    Himalayan Glacier Derived by Automated Correlation of Unmanned Aerial Vehicle
    Imagery.” <i>Annals of Glaciology</i>. International Glaciological Society, 2016.
    <a href="https://doi.org/10.3189/2016aog71a072">https://doi.org/10.3189/2016aog71a072</a>.
  ieee: P. Kraaijenbrink, S. W. Meijer, J. M. Shea, F. Pellicciotti, S. M. De Jong,
    and W. W. Immerzeel, “Seasonal surface velocities of a Himalayan glacier derived
    by automated correlation of unmanned aerial vehicle imagery,” <i>Annals of Glaciology</i>,
    vol. 57, no. 71. International Glaciological Society, pp. 103–113, 2016.
  ista: Kraaijenbrink P, Meijer SW, Shea JM, Pellicciotti F, De Jong SM, Immerzeel
    WW. 2016. Seasonal surface velocities of a Himalayan glacier derived by automated
    correlation of unmanned aerial vehicle imagery. Annals of Glaciology. 57(71),
    103–113.
  mla: Kraaijenbrink, Philip, et al. “Seasonal Surface Velocities of a Himalayan Glacier
    Derived by Automated Correlation of Unmanned Aerial Vehicle Imagery.” <i>Annals
    of Glaciology</i>, vol. 57, no. 71, International Glaciological Society, 2016,
    pp. 103–13, doi:<a href="https://doi.org/10.3189/2016aog71a072">10.3189/2016aog71a072</a>.
  short: P. Kraaijenbrink, S.W. Meijer, J.M. Shea, F. Pellicciotti, S.M. De Jong,
    W.W. Immerzeel, Annals of Glaciology 57 (2016) 103–113.
date_created: 2023-02-20T08:15:56Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2023-02-24T10:11:46Z
day: '01'
doi: 10.3189/2016aog71a072
extern: '1'
intvolume: '        57'
issue: '71'
keyword:
- Earth-Surface Processes
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.3189/2016AoG71A072
month: '03'
oa: 1
oa_version: Published Version
page: 103-113
publication: Annals of Glaciology
publication_identifier:
  eissn:
  - 1727-5644
  issn:
  - 0260-3055
publication_status: published
publisher: International Glaciological Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Seasonal surface velocities of a Himalayan glacier derived by automated correlation
  of unmanned aerial vehicle imagery
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2016'
...
---
_id: '1331'
abstract:
- lang: eng
  text: 'Cytokinin is a phytohormone that is well known for its roles in numerous
    plant growth and developmental processes, yet it has also been linked to abiotic
    stress response in a less defined manner. Arabidopsis (Arabidopsis thaliana) Cytokinin
    Response Factor 6 (CRF6) is a cytokinin-responsive AP2/ERF-family transcription
    factor that, through the cytokinin signaling pathway, plays a key role in the
    inhibition of dark-induced senescence. CRF6 expression is also induced by oxidative
    stress, and here we show a novel function for CRF6 in relation to oxidative stress
    and identify downstream transcriptional targets of CRF6 that are repressed in
    response to oxidative stress. Analysis of transcriptomic changes in wild-type
    and crf6 mutant plants treated with H2O2 identified CRF6-dependent differentially
    expressed transcripts, many of which were repressed rather than induced. Moreover,
    many repressed genes also show decreased expression in 35S:CRF6 overexpressing
    plants. Together, these findings suggest that CRF6 functions largely as a transcriptional
    repressor. Interestingly, among the H2O2 repressed CRF6-dependent transcripts
    was a set of five genes associated with cytokinin processes: (signaling) ARR6,
    ARR9, ARR11, (biosynthesis) LOG7, and (transport) ABCG14. We have examined mutants
    of these cytokinin-associated target genes to reveal novel connections to oxidative
    stress. Further examination of CRF6-DNA interactions indicated that CRF6 may regulate
    its targets both directly and indirectly. Together, this shows that CRF6 functions
    during oxidative stress as a negative regulator to control this cytokinin-associated
    module of CRF6- dependent genes and establishes a novel connection between cytokinin
    and oxidative stress response.'
acknowledgement: "This work was financially supported by the following: The Alabama
  Agricultural Experiment Station HATCH grants 370222-310010-2055 and 370225-310006-2055
  for funding to P.J.Z., E.A.K, A.M.P., and A.M.R. P.J.Z. and E.A.K were supported
  by an Auburn University Cellular and Molecular Biosciences Research Fellowship.
  I.D.C. is a postdoctoral fellow of the Research Foundation Flanders (FWO) (FWO/PDO14/043)
  and is also supported by FWO travel\r\ngrant 12N2415N. F.V.B. was supported by grants
  from the Interuniversity Attraction Poles Programme (IUAP P7/29 MARS) initiated
  by the Belgian Science Policy Office and Ghent University (Multidisciplinary Research
  Partnership Biotechnology for a Sustainable Economy, grant 01MRB510W)."
article_processing_charge: No
article_type: original
author:
- first_name: Paul
  full_name: Zwack, Paul
  last_name: Zwack
- first_name: Inge
  full_name: De Clercq, Inge
  last_name: De Clercq
- first_name: Timothy
  full_name: Howton, Timothy
  last_name: Howton
- first_name: H Tucker
  full_name: Hallmark, H Tucker
  last_name: Hallmark
- first_name: Andrej
  full_name: Hurny, Andrej
  id: 4DC4AF46-F248-11E8-B48F-1D18A9856A87
  last_name: Hurny
  orcid: 0000-0003-3638-1426
- first_name: Erika
  full_name: Keshishian, Erika
  last_name: Keshishian
- first_name: Alyssa
  full_name: Parish, Alyssa
  last_name: Parish
- first_name: Eva
  full_name: Benková, Eva
  id: 38F4F166-F248-11E8-B48F-1D18A9856A87
  last_name: Benková
  orcid: 0000-0002-8510-9739
- first_name: M Shahid
  full_name: Mukhtar, M Shahid
  last_name: Mukhtar
- first_name: Frank
  full_name: Van Breusegem, Frank
  last_name: Van Breusegem
- first_name: Aaron
  full_name: Rashotte, Aaron
  last_name: Rashotte
citation:
  ama: Zwack P, De Clercq I, Howton T, et al. Cytokinin response factor 6 represses
    cytokinin-associated genes during oxidative stress. <i>Plant Physiology</i>. 2016;172(2):1249-1258.
    doi:<a href="https://doi.org/10.1104/pp.16.00415">10.1104/pp.16.00415</a>
  apa: Zwack, P., De Clercq, I., Howton, T., Hallmark, H. T., Hurny, A., Keshishian,
    E., … Rashotte, A. (2016). Cytokinin response factor 6 represses cytokinin-associated
    genes during oxidative stress. <i>Plant Physiology</i>. American Society of Plant
    Biologists. <a href="https://doi.org/10.1104/pp.16.00415">https://doi.org/10.1104/pp.16.00415</a>
  chicago: Zwack, Paul, Inge De Clercq, Timothy Howton, H Tucker Hallmark, Andrej
    Hurny, Erika Keshishian, Alyssa Parish, et al. “Cytokinin Response Factor 6 Represses
    Cytokinin-Associated Genes during Oxidative Stress.” <i>Plant Physiology</i>.
    American Society of Plant Biologists, 2016. <a href="https://doi.org/10.1104/pp.16.00415">https://doi.org/10.1104/pp.16.00415</a>.
  ieee: P. Zwack <i>et al.</i>, “Cytokinin response factor 6 represses cytokinin-associated
    genes during oxidative stress,” <i>Plant Physiology</i>, vol. 172, no. 2. American
    Society of Plant Biologists, pp. 1249–1258, 2016.
  ista: Zwack P, De Clercq I, Howton T, Hallmark HT, Hurny A, Keshishian E, Parish
    A, Benková E, Mukhtar MS, Van Breusegem F, Rashotte A. 2016. Cytokinin response
    factor 6 represses cytokinin-associated genes during oxidative stress. Plant Physiology.
    172(2), 1249–1258.
  mla: Zwack, Paul, et al. “Cytokinin Response Factor 6 Represses Cytokinin-Associated
    Genes during Oxidative Stress.” <i>Plant Physiology</i>, vol. 172, no. 2, American
    Society of Plant Biologists, 2016, pp. 1249–58, doi:<a href="https://doi.org/10.1104/pp.16.00415">10.1104/pp.16.00415</a>.
  short: P. Zwack, I. De Clercq, T. Howton, H.T. Hallmark, A. Hurny, E. Keshishian,
    A. Parish, E. Benková, M.S. Mukhtar, F. Van Breusegem, A. Rashotte, Plant Physiology
    172 (2016) 1249–1258.
date_created: 2018-12-11T11:51:25Z
date_published: 2016-10-02T00:00:00Z
date_updated: 2026-06-18T17:30:26Z
day: '02'
ddc:
- '580'
department:
- _id: EvBe
doi: 10.1104/pp.16.00415
external_id:
  isi:
  - '000391147700047'
intvolume: '       172'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1104/pp.16.00415
month: '10'
oa: 1
oa_version: Published Version
page: 1249 - 1258
publication: Plant Physiology
publication_identifier:
  eissn:
  - 1532-2548
  issn:
  - 0032-0889
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '5937'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cytokinin response factor 6 represses cytokinin-associated genes during oxidative
  stress
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 172
year: '2016'
...
---
_id: '1522'
abstract:
- lang: eng
  text: 'We classify smooth Brunnian (i.e., unknotted on both components) embeddings
    (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to
    an explicitly constructed embedding fk,m,n for some integers k, m, n such that
    m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if
    k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification
    of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2
    × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show
    that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such
    that the componentwise embedded connected sum f # g is isotopic to f # g′ but
    g is not isotopic to g′.'
acknowledgement: "I thank A. Skopenkov for telling me about the problem and for his
  useful remarks.  I also thank A. Sossinsky,\r\nA. Zhubr, M. Skopenkov, P. Akhmetiev,
  and an anonymous referee for their feedback.  Author was partially\r\nsupported
  by Dobrushin fellowship, 2013, and by RFBR grant 15-01-06302."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Serhii
  full_name: Avvakumov, Serhii
  id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
  last_name: Avvakumov
citation:
  ama: Avvakumov S. The classification of certain linked 3-manifolds in 6-space. <i>Moscow
    Mathematical Journal</i>. 2016;16(1):1-25. doi:<a href="https://doi.org/10.17323/1609-4514-2016-16-1-1-25">10.17323/1609-4514-2016-16-1-1-25</a>
  apa: Avvakumov, S. (2016). The classification of certain linked 3-manifolds in 6-space.
    <i>Moscow Mathematical Journal</i>. Independent University of Moscow. <a href="https://doi.org/10.17323/1609-4514-2016-16-1-1-25">https://doi.org/10.17323/1609-4514-2016-16-1-1-25</a>
  chicago: Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in
    6-Space.” <i>Moscow Mathematical Journal</i>. Independent University of Moscow,
    2016. <a href="https://doi.org/10.17323/1609-4514-2016-16-1-1-25">https://doi.org/10.17323/1609-4514-2016-16-1-1-25</a>.
  ieee: S. Avvakumov, “The classification of certain linked 3-manifolds in 6-space,”
    <i>Moscow Mathematical Journal</i>, vol. 16, no. 1. Independent University of
    Moscow, pp. 1–25, 2016.
  ista: Avvakumov S. 2016. The classification of certain linked 3-manifolds in 6-space.
    Moscow Mathematical Journal. 16(1), 1–25.
  mla: Avvakumov, Sergey. “The Classification of Certain Linked 3-Manifolds in 6-Space.”
    <i>Moscow Mathematical Journal</i>, vol. 16, no. 1, Independent University of
    Moscow, 2016, pp. 1–25, doi:<a href="https://doi.org/10.17323/1609-4514-2016-16-1-1-25">10.17323/1609-4514-2016-16-1-1-25</a>.
  short: S. Avvakumov, Moscow Mathematical Journal 16 (2016) 1–25.
corr_author: '1'
date_created: 2018-12-11T11:52:30Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2024-10-09T20:56:44Z
day: '01'
department:
- _id: UlWa
doi: 10.17323/1609-4514-2016-16-1-1-25
external_id:
  arxiv:
  - '1408.3918'
intvolume: '        16'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/1408.3918
month: '01'
oa: 1
oa_version: Preprint
page: 1 - 25
publication: Moscow Mathematical Journal
publication_identifier:
  eissn:
  - 1609-4514
publication_status: published
publisher: Independent University of Moscow
publist_id: '5652'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The classification of certain linked 3-manifolds in 6-space
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2016'
...
---
_id: '15245'
abstract:
- lang: eng
  text: 'eXTP is a science mission designed to study the state of matter under extreme
    conditions of density, gravity and magnetism. Primary goals are the determination
    of the equation of state of matter at supra-nuclear density, the measurement of
    QED effects in highly magnetized star, and the study of accretion in the strong-field
    regime of gravity. Primary targets include isolated and binary neutron stars,
    strong magnetic field systems like magnetars, and stellar-mass and supermassive
    black holes. The mission carries a unique and unprecedented suite of state-of-the-art
    scientific instruments enabling for the first time ever the simultaneous spectral-timing-polarimetry
    studies of cosmic sources in the energy range from 0.5-30 keV (and beyond). Key
    elements of the payload are: the Spectroscopic Focusing Array (SFA) - a set of
    11 X-ray optics for a total effective area of ∼0.9 m2 and 0.6 m2 at 2 keV and
    6 keV respectively, equipped with Silicon Drift Detectors offering <180 eV spectral
    resolution; the Large Area Detector (LAD) - a deployable set of 640 Silicon Drift
    Detectors, for a total effective area of ∼3.4 m2, between 6 and 10 keV, and spectral
    resolution better than 250 eV; the Polarimetry Focusing Array (PFA) - a set of
    2 X-ray telescope, for a total effective area of 250 cm2 at 2 keV, equipped with
    imaging gas pixel photoelectric polarimeters; the Wide Field Monitor (WFM) - a
    set of 3 coded mask wide field units, equipped with position-sensitive Silicon
    Drift Detectors, each covering a 90 degrees x 90 degrees field of view. The eXTP
    international consortium includes major institutions of the Chinese Academy of
    Sciences and Universities in China, as well as major institutions in several European
    countries and the United States. The predecessor of eXTP, the XTP mission concept,
    has been selected and funded as one of the so-called background missions in the
    Strategic Priority Space Science Program of the Chinese Academy of Sciences since
    2011. The strong European participation has significantly enhanced the scientific
    capabilities of eXTP. The planned launch date of the mission is earlier than 2025.'
article_number: '99051Q '
article_processing_charge: No
arxiv: 1
author:
- first_name: S. N.
  full_name: Zhang, S. N.
  last_name: Zhang
- first_name: M.
  full_name: Feroci, M.
  last_name: Feroci
- first_name: A.
  full_name: Santangelo, A.
  last_name: Santangelo
- first_name: Y. W.
  full_name: Dong, Y. W.
  last_name: Dong
- first_name: H.
  full_name: Feng, H.
  last_name: Feng
- first_name: F. J.
  full_name: Lu, F. J.
  last_name: Lu
- first_name: K.
  full_name: Nandra, K.
  last_name: Nandra
- first_name: Z. S.
  full_name: Wang, Z. S.
  last_name: Wang
- first_name: S.
  full_name: Zhang, S.
  last_name: Zhang
- first_name: E.
  full_name: Bozzo, E.
  last_name: Bozzo
- first_name: S.
  full_name: Brandt, S.
  last_name: Brandt
- first_name: A.
  full_name: De Rosa, A.
  last_name: De Rosa
- first_name: L. J.
  full_name: Gou, L. J.
  last_name: Gou
- first_name: M.
  full_name: Hernanz, M.
  last_name: Hernanz
- first_name: M.
  full_name: van der Klis, M.
  last_name: van der Klis
- first_name: X. D.
  full_name: Li, X. D.
  last_name: Li
- first_name: Y.
  full_name: Liu, Y.
  last_name: Liu
- first_name: P.
  full_name: Orleanski, P.
  last_name: Orleanski
- first_name: G.
  full_name: Pareschi, G.
  last_name: Pareschi
- first_name: M.
  full_name: Pohl, M.
  last_name: Pohl
- first_name: J.
  full_name: Poutanen, J.
  last_name: Poutanen
- first_name: J. L.
  full_name: Qu, J. L.
  last_name: Qu
- first_name: S.
  full_name: Schanne, S.
  last_name: Schanne
- first_name: L.
  full_name: Stella, L.
  last_name: Stella
- first_name: P.
  full_name: Uttley, P.
  last_name: Uttley
- first_name: A.
  full_name: Watts, A.
  last_name: Watts
- first_name: R. X.
  full_name: Xu, R. X.
  last_name: Xu
- first_name: W. F.
  full_name: Yu, W. F.
  last_name: Yu
- first_name: J. J. M.
  full_name: in ’t Zand, J. J. M.
  last_name: in ’t Zand
- first_name: S.
  full_name: Zane, S.
  last_name: Zane
- first_name: L.
  full_name: Alvarez, L.
  last_name: Alvarez
- first_name: L.
  full_name: Amati, L.
  last_name: Amati
- first_name: L.
  full_name: Baldini, L.
  last_name: Baldini
- first_name: C.
  full_name: Bambi, C.
  last_name: Bambi
- first_name: S.
  full_name: Basso, S.
  last_name: Basso
- first_name: S.
  full_name: Bhattacharyya, S.
  last_name: Bhattacharyya
- first_name: R.
  full_name: Bellazzini, R.
  last_name: Bellazzini
- first_name: T.
  full_name: Belloni, T.
  last_name: Belloni
- first_name: P.
  full_name: Bellutti, P.
  last_name: Bellutti
- first_name: S.
  full_name: Bianchi, S.
  last_name: Bianchi
- first_name: A.
  full_name: Brez, A.
  last_name: Brez
- first_name: M.
  full_name: Bursa, M.
  last_name: Bursa
- first_name: V.
  full_name: Burwitz, V.
  last_name: Burwitz
- first_name: C.
  full_name: Budtz-Jørgensen, C.
  last_name: Budtz-Jørgensen
- first_name: Ilaria
  full_name: Caiazzo, Ilaria
  id: 8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d
  last_name: Caiazzo
  orcid: 0000-0002-4770-5388
- first_name: R.
  full_name: Campana, R.
  last_name: Campana
- first_name: X. L.
  full_name: Cao, X. L.
  last_name: Cao
- first_name: P.
  full_name: Casella, P.
  last_name: Casella
- first_name: C. Y.
  full_name: Chen, C. Y.
  last_name: Chen
- first_name: L.
  full_name: Chen, L.
  last_name: Chen
- first_name: T.
  full_name: Chen, T.
  last_name: Chen
- first_name: Y.
  full_name: Chen, Y.
  last_name: Chen
- first_name: Y.
  full_name: Chen, Y.
  last_name: Chen
- first_name: Y. P.
  full_name: Chen, Y. P.
  last_name: Chen
- first_name: M.
  full_name: Civitani, M.
  last_name: Civitani
- first_name: F.
  full_name: Coti Zelati, F.
  last_name: Coti Zelati
- first_name: W.
  full_name: Cui, W.
  last_name: Cui
- first_name: W. W.
  full_name: Cui, W. W.
  last_name: Cui
- first_name: Z. G.
  full_name: Dai, Z. G.
  last_name: Dai
- first_name: E.
  full_name: Del Monte, E.
  last_name: Del Monte
- first_name: D.
  full_name: de Martino, D.
  last_name: de Martino
- first_name: S.
  full_name: Di Cosimo, S.
  last_name: Di Cosimo
- first_name: S.
  full_name: Diebold, S.
  last_name: Diebold
- first_name: M.
  full_name: Dovciak, M.
  last_name: Dovciak
- first_name: I.
  full_name: Donnarumma, I.
  last_name: Donnarumma
- first_name: V.
  full_name: Doroshenko, V.
  last_name: Doroshenko
- first_name: P.
  full_name: Esposito, P.
  last_name: Esposito
- first_name: Y.
  full_name: Evangelista, Y.
  last_name: Evangelista
- first_name: Y.
  full_name: Favre, Y.
  last_name: Favre
- first_name: P.
  full_name: Friedrich, P.
  last_name: Friedrich
- first_name: F.
  full_name: Fuschino, F.
  last_name: Fuschino
- first_name: J. L.
  full_name: Galvez, J. L.
  last_name: Galvez
- first_name: Z. L.
  full_name: Gao, Z. L.
  last_name: Gao
- first_name: M. Y.
  full_name: Ge, M. Y.
  last_name: Ge
- first_name: O.
  full_name: Gevin, O.
  last_name: Gevin
- first_name: D.
  full_name: Goetz, D.
  last_name: Goetz
- first_name: D. W.
  full_name: Han, D. W.
  last_name: Han
- first_name: J.
  full_name: Heyl, J.
  last_name: Heyl
- first_name: J.
  full_name: Horak, J.
  last_name: Horak
- first_name: W.
  full_name: Hu, W.
  last_name: Hu
- first_name: F.
  full_name: Huang, F.
  last_name: Huang
- first_name: Q. S.
  full_name: Huang, Q. S.
  last_name: Huang
- first_name: R.
  full_name: Hudec, R.
  last_name: Hudec
- first_name: D.
  full_name: Huppenkothen, D.
  last_name: Huppenkothen
- first_name: G. L.
  full_name: Israel, G. L.
  last_name: Israel
- first_name: A.
  full_name: Ingram, A.
  last_name: Ingram
- first_name: V.
  full_name: Karas, V.
  last_name: Karas
- first_name: D.
  full_name: Karelin, D.
  last_name: Karelin
- first_name: P. A.
  full_name: Jenke, P. A.
  last_name: Jenke
- first_name: L.
  full_name: Ji, L.
  last_name: Ji
- first_name: S.
  full_name: Korpela, S.
  last_name: Korpela
- first_name: D.
  full_name: Kunneriath, D.
  last_name: Kunneriath
- first_name: C.
  full_name: Labanti, C.
  last_name: Labanti
- first_name: G.
  full_name: Li, G.
  last_name: Li
- first_name: X.
  full_name: Li, X.
  last_name: Li
- first_name: Z. S.
  full_name: Li, Z. S.
  last_name: Li
- first_name: E. W.
  full_name: Liang, E. W.
  last_name: Liang
- first_name: O.
  full_name: Limousin, O.
  last_name: Limousin
- first_name: L.
  full_name: Lin, L.
  last_name: Lin
- first_name: Z. X.
  full_name: Ling, Z. X.
  last_name: Ling
- first_name: H. B.
  full_name: Liu, H. B.
  last_name: Liu
- first_name: H. W.
  full_name: Liu, H. W.
  last_name: Liu
- first_name: Z.
  full_name: Liu, Z.
  last_name: Liu
- first_name: B.
  full_name: Lu, B.
  last_name: Lu
- first_name: N.
  full_name: Lund, N.
  last_name: Lund
- first_name: D.
  full_name: Lai, D.
  last_name: Lai
- first_name: B.
  full_name: Luo, B.
  last_name: Luo
- first_name: T.
  full_name: Luo, T.
  last_name: Luo
- first_name: B.
  full_name: Ma, B.
  last_name: Ma
- first_name: S.
  full_name: Mahmoodifar, S.
  last_name: Mahmoodifar
- first_name: M.
  full_name: Marisaldi, M.
  last_name: Marisaldi
- first_name: A.
  full_name: Martindale, A.
  last_name: Martindale
- first_name: N.
  full_name: Meidinger, N.
  last_name: Meidinger
- first_name: Y. P.
  full_name: Men, Y. P.
  last_name: Men
- first_name: M.
  full_name: Michalska, M.
  last_name: Michalska
- first_name: R.
  full_name: Mignani, R.
  last_name: Mignani
- first_name: M.
  full_name: Minuti, M.
  last_name: Minuti
- first_name: S.
  full_name: Motta, S.
  last_name: Motta
- first_name: F.
  full_name: Muleri, F.
  last_name: Muleri
- first_name: J.
  full_name: Neilsen, J.
  last_name: Neilsen
- first_name: M.
  full_name: Orlandini, M.
  last_name: Orlandini
- first_name: A. T.
  full_name: Pan, A. T.
  last_name: Pan
- first_name: A.
  full_name: Patruno, A.
  last_name: Patruno
- first_name: E.
  full_name: Perinati, E.
  last_name: Perinati
- first_name: A.
  full_name: Picciotto, A.
  last_name: Picciotto
- first_name: C.
  full_name: Piemonte, C.
  last_name: Piemonte
- first_name: M.
  full_name: Pinchera, M.
  last_name: Pinchera
- first_name: A.
  full_name: Rachevski, A.
  last_name: Rachevski
- first_name: M.
  full_name: Rapisarda, M.
  last_name: Rapisarda
- first_name: N.
  full_name: Rea, N.
  last_name: Rea
- first_name: E. M. R.
  full_name: Rossi, E. M. R.
  last_name: Rossi
- first_name: A.
  full_name: Rubini, A.
  last_name: Rubini
- first_name: G.
  full_name: Sala, G.
  last_name: Sala
- first_name: X. W.
  full_name: Shu, X. W.
  last_name: Shu
- first_name: C.
  full_name: Sgro, C.
  last_name: Sgro
- first_name: Z. X.
  full_name: Shen, Z. X.
  last_name: Shen
- first_name: P.
  full_name: Soffitta, P.
  last_name: Soffitta
- first_name: L. M.
  full_name: Song, L. M.
  last_name: Song
- first_name: G.
  full_name: Spandre, G.
  last_name: Spandre
- first_name: G.
  full_name: Stratta, G.
  last_name: Stratta
- first_name: T. E.
  full_name: Strohmayer, T. E.
  last_name: Strohmayer
- first_name: L.
  full_name: Sun, L.
  last_name: Sun
- first_name: J.
  full_name: Svoboda, J.
  last_name: Svoboda
- first_name: G.
  full_name: Tagliaferri, G.
  last_name: Tagliaferri
- first_name: C.
  full_name: Tenzer, C.
  last_name: Tenzer
- first_name: T.
  full_name: Hong, T.
  last_name: Hong
- first_name: R.
  full_name: Taverna, R.
  last_name: Taverna
- first_name: G.
  full_name: Torok, G.
  last_name: Torok
- first_name: R.
  full_name: Turolla, R.
  last_name: Turolla
- first_name: S.
  full_name: Vacchi, S.
  last_name: Vacchi
- first_name: J.
  full_name: Wang, J.
  last_name: Wang
- first_name: D.
  full_name: Walton, D.
  last_name: Walton
- first_name: K.
  full_name: Wang, K.
  last_name: Wang
- first_name: J. F.
  full_name: Wang, J. F.
  last_name: Wang
- first_name: R. J.
  full_name: Wang, R. J.
  last_name: Wang
- first_name: Y. F.
  full_name: Wang, Y. F.
  last_name: Wang
- first_name: S. S.
  full_name: Weng, S. S.
  last_name: Weng
- first_name: J.
  full_name: Wilms, J.
  last_name: Wilms
- first_name: B.
  full_name: Winter, B.
  last_name: Winter
- first_name: X.
  full_name: Wu, X.
  last_name: Wu
- first_name: X. F.
  full_name: Wu, X. F.
  last_name: Wu
- first_name: S. L.
  full_name: Xiong, S. L.
  last_name: Xiong
- first_name: Y. P.
  full_name: Xu, Y. P.
  last_name: Xu
- first_name: Y. Q.
  full_name: Xue, Y. Q.
  last_name: Xue
- first_name: Z.
  full_name: Yan, Z.
  last_name: Yan
- first_name: S.
  full_name: Yang, S.
  last_name: Yang
- first_name: X.
  full_name: Yang, X.
  last_name: Yang
- first_name: Y. J.
  full_name: Yang, Y. J.
  last_name: Yang
- first_name: F.
  full_name: Yuan, F.
  last_name: Yuan
- first_name: W. M.
  full_name: Yuan, W. M.
  last_name: Yuan
- first_name: Y. F.
  full_name: Yuan, Y. F.
  last_name: Yuan
- first_name: G.
  full_name: Zampa, G.
  last_name: Zampa
- first_name: N.
  full_name: Zampa, N.
  last_name: Zampa
- first_name: A.
  full_name: Zdziarski, A.
  last_name: Zdziarski
- first_name: C.
  full_name: Zhang, C.
  last_name: Zhang
- first_name: C. L.
  full_name: Zhang, C. L.
  last_name: Zhang
- first_name: L.
  full_name: Zhang, L.
  last_name: Zhang
- first_name: X.
  full_name: Zhang, X.
  last_name: Zhang
- first_name: Z.
  full_name: Zhang, Z.
  last_name: Zhang
- first_name: W. D.
  full_name: Zhang, W. D.
  last_name: Zhang
- first_name: S. J.
  full_name: Zheng, S. J.
  last_name: Zheng
- first_name: P.
  full_name: Zhou, P.
  last_name: Zhou
- first_name: X. L.
  full_name: Zhou, X. L.
  last_name: Zhou
citation:
  ama: 'Zhang SN, Feroci M, Santangelo A, et al. eXTP: Enhanced X-ray timing and polarization
    mission. In: <i>Proceedings of the SPIE</i>. Vol 9905. SPIE; 2016. doi:<a href="https://doi.org/10.1117/12.2232034">10.1117/12.2232034</a>'
  apa: 'Zhang, S. N., Feroci, M., Santangelo, A., Dong, Y. W., Feng, H., Lu, F. J.,
    … Zhou, X. L. (2016). eXTP: Enhanced X-ray timing and polarization mission. In
    <i>Proceedings of the SPIE</i> (Vol. 9905). SPIE. <a href="https://doi.org/10.1117/12.2232034">https://doi.org/10.1117/12.2232034</a>'
  chicago: 'Zhang, S. N., M. Feroci, A. Santangelo, Y. W. Dong, H. Feng, F. J. Lu,
    K. Nandra, et al. “EXTP: Enhanced X-Ray Timing and Polarization Mission.” In <i>Proceedings
    of the SPIE</i>, Vol. 9905. SPIE, 2016. <a href="https://doi.org/10.1117/12.2232034">https://doi.org/10.1117/12.2232034</a>.'
  ieee: 'S. N. Zhang <i>et al.</i>, “eXTP: Enhanced X-ray timing and polarization
    mission,” in <i>Proceedings of the SPIE</i>, 2016, vol. 9905.'
  ista: 'Zhang SN et al. 2016. eXTP: Enhanced X-ray timing and polarization mission.
    Proceedings of the SPIE. vol. 9905, 99051Q.'
  mla: 'Zhang, S. N., et al. “EXTP: Enhanced X-Ray Timing and Polarization Mission.”
    <i>Proceedings of the SPIE</i>, vol. 9905, 99051Q, SPIE, 2016, doi:<a href="https://doi.org/10.1117/12.2232034">10.1117/12.2232034</a>.'
  short: S.N. Zhang, M. Feroci, A. Santangelo, Y.W. Dong, H. Feng, F.J. Lu, K. Nandra,
    Z.S. Wang, S. Zhang, E. Bozzo, S. Brandt, A. De Rosa, L.J. Gou, M. Hernanz, M.
    van der Klis, X.D. Li, Y. Liu, P. Orleanski, G. Pareschi, M. Pohl, J. Poutanen,
    J.L. Qu, S. Schanne, L. Stella, P. Uttley, A. Watts, R.X. Xu, W.F. Yu, J.J.M.
    in ’t Zand, S. Zane, L. Alvarez, L. Amati, L. Baldini, C. Bambi, S. Basso, S.
    Bhattacharyya, R. Bellazzini, T. Belloni, P. Bellutti, S. Bianchi, A. Brez, M.
    Bursa, V. Burwitz, C. Budtz-Jørgensen, I. Caiazzo, R. Campana, X.L. Cao, P. Casella,
    C.Y. Chen, L. Chen, T. Chen, Y. Chen, Y. Chen, Y.P. Chen, M. Civitani, F. Coti
    Zelati, W. Cui, W.W. Cui, Z.G. Dai, E. Del Monte, D. de Martino, S. Di Cosimo,
    S. Diebold, M. Dovciak, I. Donnarumma, V. Doroshenko, P. Esposito, Y. Evangelista,
    Y. Favre, P. Friedrich, F. Fuschino, J.L. Galvez, Z.L. Gao, M.Y. Ge, O. Gevin,
    D. Goetz, D.W. Han, J. Heyl, J. Horak, W. Hu, F. Huang, Q.S. Huang, R. Hudec,
    D. Huppenkothen, G.L. Israel, A. Ingram, V. Karas, D. Karelin, P.A. Jenke, L.
    Ji, S. Korpela, D. Kunneriath, C. Labanti, G. Li, X. Li, Z.S. Li, E.W. Liang,
    O. Limousin, L. Lin, Z.X. Ling, H.B. Liu, H.W. Liu, Z. Liu, B. Lu, N. Lund, D.
    Lai, B. Luo, T. Luo, B. Ma, S. Mahmoodifar, M. Marisaldi, A. Martindale, N. Meidinger,
    Y.P. Men, M. Michalska, R. Mignani, M. Minuti, S. Motta, F. Muleri, J. Neilsen,
    M. Orlandini, A.T. Pan, A. Patruno, E. Perinati, A. Picciotto, C. Piemonte, M.
    Pinchera, A. Rachevski, M. Rapisarda, N. Rea, E.M.R. Rossi, A. Rubini, G. Sala,
    X.W. Shu, C. Sgro, Z.X. Shen, P. Soffitta, L.M. Song, G. Spandre, G. Stratta,
    T.E. Strohmayer, L. Sun, J. Svoboda, G. Tagliaferri, C. Tenzer, T. Hong, R. Taverna,
    G. Torok, R. Turolla, S. Vacchi, J. Wang, D. Walton, K. Wang, J.F. Wang, R.J.
    Wang, Y.F. Wang, S.S. Weng, J. Wilms, B. Winter, X. Wu, X.F. Wu, S.L. Xiong, Y.P.
    Xu, Y.Q. Xue, Z. Yan, S. Yang, X. Yang, Y.J. Yang, F. Yuan, W.M. Yuan, Y.F. Yuan,
    G. Zampa, N. Zampa, A. Zdziarski, C. Zhang, C.L. Zhang, L. Zhang, X. Zhang, Z.
    Zhang, W.D. Zhang, S.J. Zheng, P. Zhou, X.L. Zhou, in:, Proceedings of the SPIE,
    SPIE, 2016.
date_created: 2024-03-26T10:42:21Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2024-03-27T08:23:11Z
day: '01'
doi: 10.1117/12.2232034
extern: '1'
external_id:
  arxiv:
  - '1607.08823'
intvolume: '      9905'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.1607.08823
month: '07'
oa: 1
oa_version: Preprint
publication: Proceedings of the SPIE
publication_identifier:
  issn:
  - 0277-786X
publication_status: published
publisher: SPIE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'eXTP: Enhanced X-ray timing and polarization mission'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9905
year: '2016'
...
---
_id: '1616'
abstract:
- lang: eng
  text: The hippocampus plays a key role in learning and memory. Previous studies
    suggested that the main types of principal neurons, dentate gyrus granule cells
    (GCs), CA3 pyramidal neurons, and CA1 pyramidal neurons, differ in their activity
    pattern, with sparse firing in GCs and more frequent firing in CA3 and CA1 pyramidal
    neurons. It has been assumed but never shown that such different activity may
    be caused by differential synaptic excitation. To test this hypothesis, we performed
    high-resolution whole-cell patch-clamp recordings in anesthetized rats in vivo.
    In contrast to previous in vitro data, both CA3 and CA1 pyramidal neurons fired
    action potentials spontaneously, with a frequency of ∼3–6 Hz, whereas GCs were
    silent. Furthermore, both CA3 and CA1 cells primarily fired in bursts. To determine
    the underlying mechanisms, we quantitatively assessed the frequency of spontaneous
    excitatory synaptic input, the passive membrane properties, and the active membrane
    characteristics. Surprisingly, GCs showed comparable synaptic excitation to CA3
    and CA1 cells and the highest ratio of excitation versus hyperpolarizing inhibition.
    Thus, differential synaptic excitation is not responsible for differences in firing.
    Moreover, the three types of hippocampal neurons markedly differed in their passive
    properties. While GCs showed the most negative membrane potential, CA3 pyramidal
    neurons had the highest input resistance and the slowest membrane time constant.
    The three types of neurons also differed in the active membrane characteristics.
    GCs showed the highest action potential threshold, but displayed the largest gain
    of the input-output curves. In conclusion, our results reveal that differential
    firing of the three main types of hippocampal principal neurons in vivo is not
    primarily caused by differences in the characteristics of the synaptic input,
    but by the distinct properties of synaptic integration and input-output transformation.
acknowledgement: "The authors thank Jose Guzman for critically reading prior versions
  of the manuscript. They also thank T. Asenov for\r\nengineering mechanical devices,
  A. Schlögl for efﬁcient pro-gramming, F. Marr for technical assistance, and E. Kramberger
  for manuscript editing."
article_processing_charge: No
author:
- first_name: Janina
  full_name: Kowalski, Janina
  id: 3F3CA136-F248-11E8-B48F-1D18A9856A87
  last_name: Kowalski
- first_name: Jian
  full_name: Gan, Jian
  id: 3614E438-F248-11E8-B48F-1D18A9856A87
  last_name: Gan
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
- first_name: Alejandro
  full_name: Pernia-Andrade, Alejandro
  id: 36963E98-F248-11E8-B48F-1D18A9856A87
  last_name: Pernia-Andrade
citation:
  ama: Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. Intrinsic membrane properties
    determine hippocampal differential firing pattern in vivo in anesthetized rats.
    <i>Hippocampus</i>. 2016;26(5):668-682. doi:<a href="https://doi.org/10.1002/hipo.22550">10.1002/hipo.22550</a>
  apa: Kowalski, J., Gan, J., Jonas, P. M., &#38; Pernia-Andrade, A. (2016). Intrinsic
    membrane properties determine hippocampal differential firing pattern in vivo
    in anesthetized rats. <i>Hippocampus</i>. Wiley. <a href="https://doi.org/10.1002/hipo.22550">https://doi.org/10.1002/hipo.22550</a>
  chicago: Kowalski, Janina, Jian Gan, Peter M Jonas, and Alejandro Pernia-Andrade.
    “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern
    in Vivo in Anesthetized Rats.” <i>Hippocampus</i>. Wiley, 2016. <a href="https://doi.org/10.1002/hipo.22550">https://doi.org/10.1002/hipo.22550</a>.
  ieee: J. Kowalski, J. Gan, P. M. Jonas, and A. Pernia-Andrade, “Intrinsic membrane
    properties determine hippocampal differential firing pattern in vivo in anesthetized
    rats,” <i>Hippocampus</i>, vol. 26, no. 5. Wiley, pp. 668–682, 2016.
  ista: Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. 2016. Intrinsic membrane properties
    determine hippocampal differential firing pattern in vivo in anesthetized rats.
    Hippocampus. 26(5), 668–682.
  mla: Kowalski, Janina, et al. “Intrinsic Membrane Properties Determine Hippocampal
    Differential Firing Pattern in Vivo in Anesthetized Rats.” <i>Hippocampus</i>,
    vol. 26, no. 5, Wiley, 2016, pp. 668–82, doi:<a href="https://doi.org/10.1002/hipo.22550">10.1002/hipo.22550</a>.
  short: J. Kowalski, J. Gan, P.M. Jonas, A. Pernia-Andrade, Hippocampus 26 (2016)
    668–682.
corr_author: '1'
date_created: 2018-12-11T11:53:03Z
date_published: 2016-05-01T00:00:00Z
date_updated: 2025-09-18T10:58:31Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1002/hipo.22550
external_id:
  isi:
  - '000374666700011'
file:
- access_level: open_access
  checksum: 284b72b12fbe15474833ed3d4549f86b
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:13:47Z
  date_updated: 2020-07-14T12:45:07Z
  file_id: '5033'
  file_name: IST-2016-469-v1+1_Kowalski_et_al-Hippocampus.pdf
  file_size: 905348
  relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: '        26'
isi: 1
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: 668 - 682
publication: Hippocampus
publication_identifier:
  eissn:
  - 1098-1063
  issn:
  - 1050-9631
publication_status: published
publisher: Wiley
publist_id: '5550'
pubrep_id: '469'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intrinsic membrane properties determine hippocampal differential firing pattern
  in vivo in anesthetized rats
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 26
year: '2016'
...
---
_id: '482'
abstract:
- lang: eng
  text: Nonlinear electro-optical conversion of microwave radiation into the optical
    telecommunication band is achieved within a crystalline whispering gallery mode
    resonator, reaching 0.1% photon number conversion efficiency with MHz bandwidth.
alternative_title:
- Optics InfoBase Conference Papers
article_processing_charge: No
author:
- first_name: Alfredo
  full_name: Rueda, Alfredo
  last_name: Rueda
- first_name: Florian
  full_name: Sedlmeir, Florian
  last_name: Sedlmeir
- first_name: Michele
  full_name: Collodo, Michele
  last_name: Collodo
- first_name: Ulrich
  full_name: Vogl, Ulrich
  last_name: Vogl
- first_name: Birgit
  full_name: Stiller, Birgit
  last_name: Stiller
- first_name: Gerhard
  full_name: Schunk, Gerhard
  last_name: Schunk
- first_name: Dmitry
  full_name: Strekalov, Dmitry
  last_name: Strekalov
- first_name: Christoph
  full_name: Marquardt, Christoph
  last_name: Marquardt
- first_name: Johannes M
  full_name: Fink, Johannes M
  id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
  last_name: Fink
  orcid: 0000-0001-8112-028X
- first_name: Oskar
  full_name: Painter, Oskar
  last_name: Painter
- first_name: Gerd
  full_name: Leuchs, Gerd
  last_name: Leuchs
- first_name: Harald
  full_name: Schwefel, Harald
  last_name: Schwefel
citation:
  ama: 'Rueda A, Sedlmeir F, Collodo M, et al. Nonlinear single sideband microwave
    to optical conversion using an electro-optic WGM-resonator. In: Optica Publishing
    Group; 2016. doi:<a href="https://doi.org/10.1364/NP.2016.NTh3A.6">10.1364/NP.2016.NTh3A.6</a>'
  apa: 'Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., …
    Schwefel, H. (2016). Nonlinear single sideband microwave to optical conversion
    using an electro-optic WGM-resonator. Presented at the NP: Nonlinear Photonics,
    Sydney, Australia: Optica Publishing Group. <a href="https://doi.org/10.1364/NP.2016.NTh3A.6">https://doi.org/10.1364/NP.2016.NTh3A.6</a>'
  chicago: Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit
    Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Nonlinear Single Sideband Microwave
    to Optical Conversion Using an Electro-Optic WGM-Resonator.” Optica Publishing
    Group, 2016. <a href="https://doi.org/10.1364/NP.2016.NTh3A.6">https://doi.org/10.1364/NP.2016.NTh3A.6</a>.
  ieee: 'A. Rueda <i>et al.</i>, “Nonlinear single sideband microwave to optical conversion
    using an electro-optic WGM-resonator,” presented at the NP: Nonlinear Photonics,
    Sydney, Australia, 2016.'
  ista: 'Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D,
    Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Nonlinear single
    sideband microwave to optical conversion using an electro-optic WGM-resonator.
    NP: Nonlinear Photonics, Optics InfoBase Conference Papers, .'
  mla: Rueda, Alfredo, et al. <i>Nonlinear Single Sideband Microwave to Optical Conversion
    Using an Electro-Optic WGM-Resonator</i>. Optica Publishing Group, 2016, doi:<a
    href="https://doi.org/10.1364/NP.2016.NTh3A.6">10.1364/NP.2016.NTh3A.6</a>.
  short: A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov,
    C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optica Publishing
    Group, 2016.
conference:
  end_date: 2016-09-08
  location: Sydney, Australia
  name: 'NP: Nonlinear Photonics'
  start_date: 2016-09-05
date_created: 2018-12-11T11:46:43Z
date_published: 2016-08-29T00:00:00Z
date_updated: 2023-10-17T12:16:43Z
day: '29'
department:
- _id: JoFi
doi: 10.1364/NP.2016.NTh3A.6
language:
- iso: eng
month: '08'
oa_version: None
publication_status: published
publisher: Optica Publishing Group
publist_id: '7339'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonlinear single sideband microwave to optical conversion using an electro-optic
  WGM-resonator
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5551'
abstract:
- lang: eng
  text: "Data from array experiments investigating pollinator behaviour on snapdragons
    in controlled conditions, and their effect on plant mating. Data were collected
    as part of Tom Ellis' PhD thesis , submitted February 2016.\r\n\r\nWe placed a
    total of 36 plants in a grid inside a closed organza tent, with a single hive
    of commercially bred bumblebees (Bombus hortorum). We used only the yellow-flowered
    Antirrhinum majus striatum and the magenta-flowered Antirrhinum majus pseudomajus,
    at ratios of 6:36, 12:24, 18:18, 24:12 and 30:6.\r\n\r\nAfter 24 hours to learn
    how to deal with snapdragons, I observed pollinators foraging on plants, and recorded
    the transitions between plants. Thereafter seeds on plants were allowed to develops.
    A sample of these were grown to maturity when their flower colour could be determined,
    and they were scored as yellow, magenta, or hybrid."
article_processing_charge: No
author:
- first_name: Thomas
  full_name: Ellis, Thomas
  id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
  last_name: Ellis
  orcid: 0000-0002-8511-0254
citation:
  ama: Ellis T. Data on pollinator observations and offpsring phenotypes. 2016. doi:<a
    href="https://doi.org/10.15479/AT:ISTA:35">10.15479/AT:ISTA:35</a>
  apa: Ellis, T. (2016). Data on pollinator observations and offpsring phenotypes.
    Institute of Science and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:35">https://doi.org/10.15479/AT:ISTA:35</a>
  chicago: Ellis, Thomas. “Data on Pollinator Observations and Offpsring Phenotypes.”
    Institute of Science and Technology Austria, 2016. <a href="https://doi.org/10.15479/AT:ISTA:35">https://doi.org/10.15479/AT:ISTA:35</a>.
  ieee: T. Ellis, “Data on pollinator observations and offpsring phenotypes.” Institute
    of Science and Technology Austria, 2016.
  ista: Ellis T. 2016. Data on pollinator observations and offpsring phenotypes, Institute
    of Science and Technology Austria, <a href="https://doi.org/10.15479/AT:ISTA:35">10.15479/AT:ISTA:35</a>.
  mla: Ellis, Thomas. <i>Data on Pollinator Observations and Offpsring Phenotypes</i>.
    Institute of Science and Technology Austria, 2016, doi:<a href="https://doi.org/10.15479/AT:ISTA:35">10.15479/AT:ISTA:35</a>.
  short: T. Ellis, (2016).
contributor:
- first_name: David
  id: 419049E2-F248-11E8-B48F-1D18A9856A87
  last_name: Field
- first_name: Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
datarep_id: '35'
date_created: 2018-12-12T12:31:29Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2026-04-09T10:52:07Z
day: '19'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:35
file:
- access_level: open_access
  checksum: aa3eb85d52b110cd192aa23147c4d4f3
  content_type: application/zip
  creator: system
  date_created: 2018-12-12T13:05:12Z
  date_updated: 2020-07-14T12:47:01Z
  file_id: '5640'
  file_name: IST-2016-35-v1+1_array_data.zip
  file_size: 32775
  relation: main_file
file_date_updated: 2020-07-14T12:47:01Z
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '1398'
    relation: part_of_dissertation
    status: public
status: public
title: Data on pollinator observations and offpsring phenotypes
tmp:
  image: /images/cc_0.png
  legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
  name: Creative Commons Public Domain Dedication (CC0 1.0)
  short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5557'
abstract:
- lang: eng
  text: "Small synthetic discrete tomography problems.\r\nSizes are 32x32, 64z64 and
    256x256.\r\nProjection angles are 2, 4, and 6.\r\nNumber of labels are 3 and 5."
article_processing_charge: No
author:
- first_name: Paul
  full_name: Swoboda, Paul
  id: 446560C6-F248-11E8-B48F-1D18A9856A87
  last_name: Swoboda
citation:
  ama: Swoboda P. Synthetic discrete tomography problems. 2016. doi:<a href="https://doi.org/10.15479/AT:ISTA:46">10.15479/AT:ISTA:46</a>
  apa: Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science
    and Technology Austria. <a href="https://doi.org/10.15479/AT:ISTA:46">https://doi.org/10.15479/AT:ISTA:46</a>
  chicago: Swoboda, Paul. “Synthetic Discrete Tomography Problems.” Institute of Science
    and Technology Austria, 2016. <a href="https://doi.org/10.15479/AT:ISTA:46">https://doi.org/10.15479/AT:ISTA:46</a>.
  ieee: P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science
    and Technology Austria, 2016.
  ista: Swoboda P. 2016. Synthetic discrete tomography problems, Institute of Science
    and Technology Austria, <a href="https://doi.org/10.15479/AT:ISTA:46">10.15479/AT:ISTA:46</a>.
  mla: Swoboda, Paul. <i>Synthetic Discrete Tomography Problems</i>. Institute of
    Science and Technology Austria, 2016, doi:<a href="https://doi.org/10.15479/AT:ISTA:46">10.15479/AT:ISTA:46</a>.
  short: P. Swoboda, (2016).
contributor:
- contributor_type: data_collector
  first_name: Jan
  last_name: Kuske
datarep_id: '46'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-09-20T00:00:00Z
date_updated: 2024-02-21T13:50:21Z
day: '20'
ddc:
- '006'
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:46
file:
- access_level: open_access
  checksum: aa5a16a0dc888da7186fb8fc45e88439
  content_type: application/zip
  creator: system
  date_created: 2018-12-12T13:05:19Z
  date_updated: 2020-07-14T12:47:02Z
  file_id: '5645'
  file_name: IST-2016-46-v1+1_discrete_tomography_synthetic.zip
  file_size: 36058401
  relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
has_accepted_license: '1'
keyword:
- discrete tomography
month: '09'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Synthetic discrete tomography problems
tmp:
  image: /images/cc_0.png
  legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
  name: Creative Commons Public Domain Dedication (CC0 1.0)
  short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5806'
abstract:
- lang: eng
  text: Although the concept of functional plane for naive plane is studied and reported
    in the literature in great detail, no similar study is yet found for naive sphere.
    This article exposes the first study in this line, opening up further prospects
    of analyzing the topological properties of sphere in the discrete space. We show
    that each quadraginta octant Q of a naive sphere forms a bijection with its projected
    pixel set on a unique coordinate plane, which thereby serves as the functional
    plane of Q, and hence gives rise to merely mono-jumps during back projection.
    The other two coordinate planes serve as para-functional and dia-functional planes
    for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds
    neither of the two. Owing to this, the quadraginta octants form symmetry groups
    and subgroups with equivalent jump conditions. We also show a potential application
    in generating a special class of discrete 3D circles based on back projection
    and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry,
    uniqueness, and bounded distance from the underlying real sphere and real plane.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ranita
  full_name: Biswas, Ranita
  id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
  last_name: Biswas
  orcid: 0000-0002-5372-7890
- first_name: Partha
  full_name: Bhowmick, Partha
  last_name: Bhowmick
citation:
  ama: 'Biswas R, Bhowmick P. On functionality of quadraginta octants of naive sphere
    with application to circle drawing. In: <i>Discrete Geometry for Computer Imagery</i>.
    Vol 9647. Cham: Springer Nature; 2016:256-267. doi:<a href="https://doi.org/10.1007/978-3-319-32360-2_20">10.1007/978-3-319-32360-2_20</a>'
  apa: 'Biswas, R., &#38; Bhowmick, P. (2016). On functionality of quadraginta octants
    of naive sphere with application to circle drawing. In <i>Discrete Geometry for
    Computer Imagery</i> (Vol. 9647, pp. 256–267). Cham: Springer Nature. <a href="https://doi.org/10.1007/978-3-319-32360-2_20">https://doi.org/10.1007/978-3-319-32360-2_20</a>'
  chicago: 'Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta
    Octants of Naive Sphere with Application to Circle Drawing.” In <i>Discrete Geometry
    for Computer Imagery</i>, 9647:256–67. Cham: Springer Nature, 2016. <a href="https://doi.org/10.1007/978-3-319-32360-2_20">https://doi.org/10.1007/978-3-319-32360-2_20</a>.'
  ieee: R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive
    sphere with application to circle drawing,” in <i>Discrete Geometry for Computer
    Imagery</i>, Nantes, France, 2016, vol. 9647, pp. 256–267.
  ista: 'Biswas R, Bhowmick P. 2016. On functionality of quadraginta octants of naive
    sphere with application to circle drawing. Discrete Geometry for Computer Imagery.
    DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS,
    vol. 9647, 256–267.'
  mla: Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants
    of Naive Sphere with Application to Circle Drawing.” <i>Discrete Geometry for
    Computer Imagery</i>, vol. 9647, Springer Nature, 2016, pp. 256–67, doi:<a href="https://doi.org/10.1007/978-3-319-32360-2_20">10.1007/978-3-319-32360-2_20</a>.
  short: R. Biswas, P. Bhowmick, in:, Discrete Geometry for Computer Imagery, Springer
    Nature, Cham, 2016, pp. 256–267.
conference:
  end_date: 2016-04-20
  location: Nantes, France
  name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery'
  start_date: 2016-04-18
date_created: 2019-01-08T20:44:37Z
date_published: 2016-04-09T00:00:00Z
date_updated: 2022-01-28T08:10:11Z
day: '09'
department:
- _id: HeEd
doi: 10.1007/978-3-319-32360-2_20
extern: '1'
intvolume: '      9647'
language:
- iso: eng
month: '04'
oa_version: None
page: 256-267
place: Cham
publication: Discrete Geometry for Computer Imagery
publication_identifier:
  eisbn:
  - 978-3-319-32360-2
  isbn:
  - 978-3-319-32359-6
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On functionality of quadraginta octants of naive sphere with application to
  circle drawing
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9647
year: '2016'
...
---
_id: '17618'
abstract:
- lang: eng
  text: The largest observed supermassive black holes (SMBHs) have a mass of M_BH
    ~ 10^{10} M_sun, nearly independent of redshift, from the local (z~0) to the early
    (z>6) Universe. We suggest that the growth of SMBHs above a few 10^{10} M_sun
    is prevented by small-scale accretion physics, independent of the properties of
    their host galaxies or of cosmology. Growing more massive BHs requires a gas supply
    rate from galactic scales onto a nuclear region as high as >10^3 M_sun/yr. At
    such a high accretion rate, most of the gas converts to stars at large radii (~10-100
    pc), well before reaching the BH. We adopt a simple model (Thompson et al. 2005)
    for a star-forming accretion disk, and find that the accretion rate in the sub-pc
    nuclear region is reduced to the smaller value of at most a few M_sun/yr. This
    prevents SMBHs from growing above ~10^{11} M_sun in the age of the Universe. Furthermore,
    once a SMBH reaches a sufficiently high mass, this rate falls below the critical
    value at which the accretion flow becomes advection dominated. Once this transition
    occurs, BH feeding can be suppressed by strong outflows and jets from hot gas
    near the BH. We find that the maximum SMBH mass, given by this transition, is
    between M_{BH,max} ~ (1-6) * 10^{10} M_sun, depending primarily on the efficiency
    of angular momentum transfer inside the galactic disk, and not on other properties
    of the host galaxy.
article_number: '110'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Kohei
  full_name: Inayoshi, Kohei
  last_name: Inayoshi
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
citation:
  ama: Inayoshi K, Haiman Z. Is there a maximum mass for black holes in galactic nuclei?
    <i>The Astrophysical Journal</i>. 2016;828(2). doi:<a href="https://doi.org/10.3847/0004-637x/828/2/110">10.3847/0004-637x/828/2/110</a>
  apa: Inayoshi, K., &#38; Haiman, Z. (2016). Is there a maximum mass for black holes
    in galactic nuclei? <i>The Astrophysical Journal</i>. American Astronomical Society.
    <a href="https://doi.org/10.3847/0004-637x/828/2/110">https://doi.org/10.3847/0004-637x/828/2/110</a>
  chicago: Inayoshi, Kohei, and Zoltán Haiman. “Is There a Maximum Mass for Black
    Holes in Galactic Nuclei?” <i>The Astrophysical Journal</i>. American Astronomical
    Society, 2016. <a href="https://doi.org/10.3847/0004-637x/828/2/110">https://doi.org/10.3847/0004-637x/828/2/110</a>.
  ieee: K. Inayoshi and Z. Haiman, “Is there a maximum mass for black holes in galactic
    nuclei?,” <i>The Astrophysical Journal</i>, vol. 828, no. 2. American Astronomical
    Society, 2016.
  ista: Inayoshi K, Haiman Z. 2016. Is there a maximum mass for black holes in galactic
    nuclei? The Astrophysical Journal. 828(2), 110.
  mla: Inayoshi, Kohei, and Zoltán Haiman. “Is There a Maximum Mass for Black Holes
    in Galactic Nuclei?” <i>The Astrophysical Journal</i>, vol. 828, no. 2, 110, American
    Astronomical Society, 2016, doi:<a href="https://doi.org/10.3847/0004-637x/828/2/110">10.3847/0004-637x/828/2/110</a>.
  short: K. Inayoshi, Z. Haiman, The Astrophysical Journal 828 (2016).
date_created: 2024-09-05T13:44:44Z
date_published: 2016-09-12T00:00:00Z
date_updated: 2024-09-24T08:11:51Z
day: '12'
doi: 10.3847/0004-637x/828/2/110
extern: '1'
external_id:
  arxiv:
  - '1601.02611'
intvolume: '       828'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ' https://doi.org/10.48550/arXiv.1601.02611'
month: '09'
oa: 1
oa_version: Preprint
publication: The Astrophysical Journal
publication_identifier:
  issn:
  - 0004-637X
  - 1538-4357
publication_status: published
publisher: American Astronomical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Is there a maximum mass for black holes in galactic nuclei?
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 828
year: '2016'
...
---
_id: '17709'
abstract:
- lang: eng
  text: 'We study very-high rate spherically symmetric accretion flows onto a massive
    black hole (BH; 10^2 < M_BH < 10^6 Msun) embedded in a dense gas cloud with a
    low abundance of metals, performing one-dimensional hydrodynamical simulations
    which include multi-frequency radiation transfer and non-equilibrium primordial
    chemistry. We find that rapid gas supply from the Bondi radius at a hyper-Eddington
    rate can occur without being impeded by radiation feedback when (n/10^5 cm^-3)
    > (M_BH/10^4Msun)^{-1}(T/10^4 K)^{3/2}, where n and T are the density and temperature
    of ambient gas outside of the Bondi radius. The resulting accretion rate in this
    regime is steady, and larger than 3000 times the Eddington rate. At lower Bondi
    rates, the accretion is episodic due to radiative feedback and the average rate
    is limited below the Eddington rate. For the hyper-Eddington case, the steady
    solution consists of two parts: a radiation-dominated central core, where photon
    trapping due to electron scattering is important, and an accreting envelope which
    follows a Bondi profile with T~8000 K. When the emergent luminosity is limited
    below the Eddington luminosity because of photon trapping, radiation from the
    central region does not affect the gas dynamics at larger scales. We apply our
    result to the rapid formation of massive BHs in protogalaxies with a virial temperature
    of T_vir> 10^4 K. Once a seed BH forms at the center of the galaxy, it can grow
    up to a maximum ~10^5 (T_vir/10^4 K) Msun via gas accretion independent of the
    initial BH mass. Finally, we discuss possible observational signatures of rapidly
    accreting BHs with/without allowance for dust. We suggest that these systems could
    explain Lya emitters without X-rays and luminous infrared sources with hot dust
    emission, respectively.'
article_processing_charge: No
article_type: original
author:
- first_name: Kohei
  full_name: Inayoshi, Kohei
  last_name: Inayoshi
- first_name: Zoltán
  full_name: Haiman, Zoltán
  id: 7c006e8c-cc0d-11ee-8322-cb904ef76f36
  last_name: Haiman
- first_name: Jeremiah P.
  full_name: Ostriker, Jeremiah P.
  last_name: Ostriker
citation:
  ama: Inayoshi K, Haiman Z, Ostriker JP. Hyper-Eddington accretion flows on to massive
    black holes. <i>Monthly Notices of the Royal Astronomical Society</i>. 2016;459(4):3738-3755.
    doi:<a href="https://doi.org/10.1093/mnras/stw836">10.1093/mnras/stw836</a>
  apa: Inayoshi, K., Haiman, Z., &#38; Ostriker, J. P. (2016). Hyper-Eddington accretion
    flows on to massive black holes. <i>Monthly Notices of the Royal Astronomical
    Society</i>. Oxford University Press. <a href="https://doi.org/10.1093/mnras/stw836">https://doi.org/10.1093/mnras/stw836</a>
  chicago: Inayoshi, Kohei, Zoltán Haiman, and Jeremiah P. Ostriker. “Hyper-Eddington
    Accretion Flows on to Massive Black Holes.” <i>Monthly Notices of the Royal Astronomical
    Society</i>. Oxford University Press, 2016. <a href="https://doi.org/10.1093/mnras/stw836">https://doi.org/10.1093/mnras/stw836</a>.
  ieee: K. Inayoshi, Z. Haiman, and J. P. Ostriker, “Hyper-Eddington accretion flows
    on to massive black holes,” <i>Monthly Notices of the Royal Astronomical Society</i>,
    vol. 459, no. 4. Oxford University Press, pp. 3738–3755, 2016.
  ista: Inayoshi K, Haiman Z, Ostriker JP. 2016. Hyper-Eddington accretion flows on
    to massive black holes. Monthly Notices of the Royal Astronomical Society. 459(4),
    3738–3755.
  mla: Inayoshi, Kohei, et al. “Hyper-Eddington Accretion Flows on to Massive Black
    Holes.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 459, no.
    4, Oxford University Press, 2016, pp. 3738–55, doi:<a href="https://doi.org/10.1093/mnras/stw836">10.1093/mnras/stw836</a>.
  short: K. Inayoshi, Z. Haiman, J.P. Ostriker, Monthly Notices of the Royal Astronomical
    Society 459 (2016) 3738–3755.
date_created: 2024-09-06T08:54:12Z
date_published: 2016-04-12T00:00:00Z
date_updated: 2024-09-25T12:00:22Z
day: '12'
doi: 10.1093/mnras/stw836
extern: '1'
intvolume: '       459'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1093/mnras/stw836
month: '04'
oa: 1
oa_version: Published Version
page: 3738-3755
publication: Monthly Notices of the Royal Astronomical Society
publication_identifier:
  issn:
  - 0035-8711
  - 1365-2966
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Hyper-Eddington accretion flows on to massive black holes
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 459
year: '2016'
...
