---
_id: '1579'
abstract:
- lang: eng
text: We show that the Galois group of any Schubert problem involving lines in projective
space contains the alternating group. This constitutes the largest family of enumerative
problems whose Galois groups have been largely determined. Using a criterion of
Vakil and a special position argument due to Schubert, our result follows from
a particular inequality among Kostka numbers of two-rowed tableaux. In most cases,
a combinatorial injection proves the inequality. For the remaining cases, we use
the Weyl integral formulas to obtain an integral formula for these Kostka numbers.
This rewrites the inequality as an integral, which we estimate to establish the
inequality.
acknowledgement: "This research was supported in part by NSF grant DMS-915211 and
the Institut Mittag-Leffler.\r\n"
article_processing_charge: No
author:
- first_name: Christopher
full_name: Brooks, Christopher
last_name: Brooks
- first_name: Abraham
full_name: Martin Del Campo Sanchez, Abraham
id: 4CF47F6A-F248-11E8-B48F-1D18A9856A87
last_name: Martin Del Campo Sanchez
- first_name: Frank
full_name: Sottile, Frank
last_name: Sottile
citation:
ama: Brooks C, Martin del Campo Sanchez A, Sottile F. Galois groups of Schubert
problems of lines are at least alternating. Transactions of the American Mathematical
Society. 2015;367(6):4183-4206. doi:10.1090/S0002-9947-2014-06192-8
apa: Brooks, C., Martin del Campo Sanchez, A., & Sottile, F. (2015). Galois
groups of Schubert problems of lines are at least alternating. Transactions
of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/S0002-9947-2014-06192-8
chicago: Brooks, Christopher, Abraham Martin del Campo Sanchez, and Frank Sottile.
“Galois Groups of Schubert Problems of Lines Are at Least Alternating.” Transactions
of the American Mathematical Society. American Mathematical Society, 2015.
https://doi.org/10.1090/S0002-9947-2014-06192-8.
ieee: C. Brooks, A. Martin del Campo Sanchez, and F. Sottile, “Galois groups of
Schubert problems of lines are at least alternating,” Transactions of the American
Mathematical Society, vol. 367, no. 6. American Mathematical Society, pp.
4183–4206, 2015.
ista: Brooks C, Martin del Campo Sanchez A, Sottile F. 2015. Galois groups of Schubert
problems of lines are at least alternating. Transactions of the American Mathematical
Society. 367(6), 4183–4206.
mla: Brooks, Christopher, et al. “Galois Groups of Schubert Problems of Lines Are
at Least Alternating.” Transactions of the American Mathematical Society,
vol. 367, no. 6, American Mathematical Society, 2015, pp. 4183–206, doi:10.1090/S0002-9947-2014-06192-8.
short: C. Brooks, A. Martin del Campo Sanchez, F. Sottile, Transactions of the American
Mathematical Society 367 (2015) 4183–4206.
date_created: 2018-12-11T11:52:50Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:51:43Z
day: '01'
department:
- _id: CaUh
doi: 10.1090/S0002-9947-2014-06192-8
intvolume: ' 367'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1207.4280
month: '06'
oa: 1
oa_version: Preprint
page: 4183 - 4206
publication: Transactions of the American Mathematical Society
publication_status: published
publisher: American Mathematical Society
publist_id: '5592'
quality_controlled: '1'
scopus_import: 1
status: public
title: Galois groups of Schubert problems of lines are at least alternating
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 367
year: '2015'
...
---
_id: '1580'
abstract:
- lang: eng
text: Synapsins (Syns) are an evolutionarily conserved family of presynaptic proteins
crucial for the fine-tuning of synaptic function. A large amount of experimental
evidences has shown that Syns are involved in the development of epileptic phenotypes
and several mutations in Syn genes have been associated with epilepsy in humans
and animal models. Syn mutations induce alterations in circuitry and neurotransmitter
release, differentially affecting excitatory and inhibitory synapses, thus causing
an excitation/inhibition imbalance in network excitability toward hyperexcitability
that may be a determinant with regard to the development of epilepsy. Another
approach to investigate epileptogenic mechanisms is to understand how silencing
Syn affects the cellular behavior of single neurons and is associated with the
hyperexcitable phenotypes observed in epilepsy. Here, we examined the functional
effects of antisense-RNA inhibition of Syn expression on individually identified
and isolated serotonergic cells of the Helix land snail. We found that Helix synapsin
silencing increases cell excitability characterized by a slightly depolarized
resting membrane potential, decreases the rheobase, reduces the threshold for
action potential (AP) firing and increases the mean and instantaneous firing rates,
with respect to control cells. The observed increase of Ca2+ and BK currents in
Syn-silenced cells seems to be related to changes in the shape of the AP waveform.
These currents sustain the faster spiking in Syn-deficient cells by increasing
the after hyperpolarization and limiting the Na+ and Ca2+ channel inactivation
during repetitive firing. This in turn speeds up the depolarization phase by reaching
the AP threshold faster. Our results provide evidence that Syn silencing increases
intrinsic cell excitability associated with increased Ca2+ and Ca2+-dependent
BK currents in the absence of excitatory or inhibitory inputs.
article_processing_charge: No
article_type: original
author:
- first_name: Oscar
full_name: Brenes, Oscar
last_name: Brenes
- first_name: David H
full_name: Vandael, David H
id: 3AE48E0A-F248-11E8-B48F-1D18A9856A87
last_name: Vandael
orcid: 0000-0001-7577-1676
- first_name: Emilio
full_name: Carbone, Emilio
last_name: Carbone
- first_name: Pier
full_name: Montarolo, Pier
last_name: Montarolo
- first_name: Mirella
full_name: Ghirardi, Mirella
last_name: Ghirardi
citation:
ama: Brenes O, Vandael DH, Carbone E, Montarolo P, Ghirardi M. Knock-down of synapsin
alters cell excitability and action potential waveform by potentiating BK and
voltage gated Ca2 currents in Helix serotonergic neurons. Neuroscience.
2015;311:430-443. doi:10.1016/j.neuroscience.2015.10.046
apa: Brenes, O., Vandael, D. H., Carbone, E., Montarolo, P., & Ghirardi, M.
(2015). Knock-down of synapsin alters cell excitability and action potential waveform
by potentiating BK and voltage gated Ca2 currents in Helix serotonergic neurons.
Neuroscience. Elsevier. https://doi.org/10.1016/j.neuroscience.2015.10.046
chicago: Brenes, Oscar, David H Vandael, Emilio Carbone, Pier Montarolo, and Mirella
Ghirardi. “Knock-down of Synapsin Alters Cell Excitability and Action Potential
Waveform by Potentiating BK and Voltage Gated Ca2 Currents in Helix Serotonergic
Neurons.” Neuroscience. Elsevier, 2015. https://doi.org/10.1016/j.neuroscience.2015.10.046.
ieee: O. Brenes, D. H. Vandael, E. Carbone, P. Montarolo, and M. Ghirardi, “Knock-down
of synapsin alters cell excitability and action potential waveform by potentiating
BK and voltage gated Ca2 currents in Helix serotonergic neurons,” Neuroscience,
vol. 311. Elsevier, pp. 430–443, 2015.
ista: Brenes O, Vandael DH, Carbone E, Montarolo P, Ghirardi M. 2015. Knock-down
of synapsin alters cell excitability and action potential waveform by potentiating
BK and voltage gated Ca2 currents in Helix serotonergic neurons. Neuroscience.
311, 430–443.
mla: Brenes, Oscar, et al. “Knock-down of Synapsin Alters Cell Excitability and
Action Potential Waveform by Potentiating BK and Voltage Gated Ca2 Currents in
Helix Serotonergic Neurons.” Neuroscience, vol. 311, Elsevier, 2015, pp.
430–43, doi:10.1016/j.neuroscience.2015.10.046.
short: O. Brenes, D.H. Vandael, E. Carbone, P. Montarolo, M. Ghirardi, Neuroscience
311 (2015) 430–443.
date_created: 2018-12-11T11:52:50Z
date_published: 2015-12-17T00:00:00Z
date_updated: 2021-01-12T06:51:44Z
day: '17'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.neuroscience.2015.10.046
file:
- access_level: open_access
checksum: af2c4c994718c7be417eba0dc746aac9
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T06:50:20Z
date_updated: 2020-07-14T12:45:02Z
file_id: '7849'
file_name: 2015_Neuroscience_Brenes.pdf
file_size: 5563015
relation: main_file
file_date_updated: 2020-07-14T12:45:02Z
has_accepted_license: '1'
intvolume: ' 311'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Submitted Version
page: 430 - 443
publication: Neuroscience
publication_status: published
publisher: Elsevier
publist_id: '5591'
quality_controlled: '1'
scopus_import: 1
status: public
title: Knock-down of synapsin alters cell excitability and action potential waveform
by potentiating BK and voltage gated Ca2 currents in Helix serotonergic neurons
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 311
year: '2015'
...
---
_id: '1581'
abstract:
- lang: eng
text: In animal embryos, morphogen gradients determine tissue patterning and morphogenesis.
Shyer et al. provide evidence that, during vertebrate gut formation, tissue folding
generates graded activity of signals required for subsequent steps of gut growth
and differentiation, thereby revealing an intriguing link between tissue morphogenesis
and morphogen gradient formation.
article_processing_charge: No
author:
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Bollenbach MT, Heisenberg C-PJ. Gradients are shaping up. Cell. 2015;161(3):431-432.
doi:10.1016/j.cell.2015.04.009
apa: Bollenbach, M. T., & Heisenberg, C.-P. J. (2015). Gradients are shaping
up. Cell. Cell Press. https://doi.org/10.1016/j.cell.2015.04.009
chicago: Bollenbach, Mark Tobias, and Carl-Philipp J Heisenberg. “Gradients Are
Shaping Up.” Cell. Cell Press, 2015. https://doi.org/10.1016/j.cell.2015.04.009.
ieee: M. T. Bollenbach and C.-P. J. Heisenberg, “Gradients are shaping up,” Cell,
vol. 161, no. 3. Cell Press, pp. 431–432, 2015.
ista: Bollenbach MT, Heisenberg C-PJ. 2015. Gradients are shaping up. Cell. 161(3),
431–432.
mla: Bollenbach, Mark Tobias, and Carl-Philipp J. Heisenberg. “Gradients Are Shaping
Up.” Cell, vol. 161, no. 3, Cell Press, 2015, pp. 431–32, doi:10.1016/j.cell.2015.04.009.
short: M.T. Bollenbach, C.-P.J. Heisenberg, Cell 161 (2015) 431–432.
date_created: 2018-12-11T11:52:50Z
date_published: 2015-04-23T00:00:00Z
date_updated: 2022-08-25T13:56:10Z
day: '23'
department:
- _id: ToBo
- _id: CaHe
doi: 10.1016/j.cell.2015.04.009
intvolume: ' 161'
issue: '3'
language:
- iso: eng
month: '04'
oa_version: None
page: 431 - 432
publication: Cell
publication_status: published
publisher: Cell Press
publist_id: '5590'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Gradients are shaping up
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 161
year: '2015'
...
---
_id: '1582'
abstract:
- lang: eng
text: We investigate weighted straight skeletons from a geometric, graph-theoretical,
and combinatorial point of view. We start with a thorough definition and shed
light on some ambiguity issues in the procedural definition. We investigate the
geometry, combinatorics, and topology of faces and the roof model, and we discuss
in which cases a weighted straight skeleton is connected. Finally, we show that
the weighted straight skeleton of even a simple polygon may be non-planar and
may contain cycles, and we discuss under which restrictions on the weights and/or
the input polygon the weighted straight skeleton still behaves similar to its
unweighted counterpart. In particular, we obtain a non-procedural description
and a linear-time construction algorithm for the straight skeleton of strictly
convex polygons with arbitrary weights.
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Dominik
full_name: Kaaser, Dominik
last_name: Kaaser
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
citation:
ama: 'Biedl T, Held M, Huber S, Kaaser D, Palfrader P. Weighted straight skeletons
in the plane. Computational Geometry: Theory and Applications. 2015;48(2):120-133.
doi:10.1016/j.comgeo.2014.08.006'
apa: 'Biedl, T., Held, M., Huber, S., Kaaser, D., & Palfrader, P. (2015). Weighted
straight skeletons in the plane. Computational Geometry: Theory and Applications.
Elsevier. https://doi.org/10.1016/j.comgeo.2014.08.006'
chicago: 'Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader.
“Weighted Straight Skeletons in the Plane.” Computational Geometry: Theory
and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2014.08.006.'
ieee: 'T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “Weighted straight
skeletons in the plane,” Computational Geometry: Theory and Applications,
vol. 48, no. 2. Elsevier, pp. 120–133, 2015.'
ista: 'Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. Weighted straight
skeletons in the plane. Computational Geometry: Theory and Applications. 48(2),
120–133.'
mla: 'Biedl, Therese, et al. “Weighted Straight Skeletons in the Plane.” Computational
Geometry: Theory and Applications, vol. 48, no. 2, Elsevier, 2015, pp. 120–33,
doi:10.1016/j.comgeo.2014.08.006.'
short: 'T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Computational Geometry:
Theory and Applications 48 (2015) 120–133.'
date_created: 2018-12-11T11:52:51Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2023-02-23T10:05:27Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1016/j.comgeo.2014.08.006
file:
- access_level: open_access
checksum: c1ef67f6ec925e12f73a96b8fe285ab4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:28Z
date_updated: 2020-07-14T12:45:02Z
file_id: '5215'
file_name: IST-2016-474-v1+1_1-s2.0-S0925772114000807-main.pdf
file_size: 505987
relation: main_file
file_date_updated: 2020-07-14T12:45:02Z
has_accepted_license: '1'
intvolume: ' 48'
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 120 - 133
publication: 'Computational Geometry: Theory and Applications'
publication_status: published
publisher: Elsevier
publist_id: '5589'
pubrep_id: '474'
quality_controlled: '1'
related_material:
record:
- id: '1584'
relation: other
status: public
scopus_import: 1
status: public
title: Weighted straight skeletons in the plane
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2015'
...
---
_id: '1583'
abstract:
- lang: eng
text: We study the characteristics of straight skeletons of monotone polygonal chains
and use them to devise an algorithm for computing positively weighted straight
skeletons of monotone polygons. Our algorithm runs in O(nlogn) time and O(n) space,
where n denotes the number of vertices of the polygon.
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Dominik
full_name: Kaaser, Dominik
last_name: Kaaser
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
citation:
ama: Biedl T, Held M, Huber S, Kaaser D, Palfrader P. A simple algorithm for computing
positively weighted straight skeletons of monotone polygons. Information Processing
Letters. 2015;115(2):243-247. doi:10.1016/j.ipl.2014.09.021
apa: Biedl, T., Held, M., Huber, S., Kaaser, D., & Palfrader, P. (2015). A simple
algorithm for computing positively weighted straight skeletons of monotone polygons.
Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2014.09.021
chicago: Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader.
“A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone
Polygons.” Information Processing Letters. Elsevier, 2015. https://doi.org/10.1016/j.ipl.2014.09.021.
ieee: T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “A simple algorithm
for computing positively weighted straight skeletons of monotone polygons,” Information
Processing Letters, vol. 115, no. 2. Elsevier, pp. 243–247, 2015.
ista: Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. A simple algorithm
for computing positively weighted straight skeletons of monotone polygons. Information
Processing Letters. 115(2), 243–247.
mla: Biedl, Therese, et al. “A Simple Algorithm for Computing Positively Weighted
Straight Skeletons of Monotone Polygons.” Information Processing Letters,
vol. 115, no. 2, Elsevier, 2015, pp. 243–47, doi:10.1016/j.ipl.2014.09.021.
short: T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Information Processing
Letters 115 (2015) 243–247.
date_created: 2018-12-11T11:52:51Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2021-01-12T06:51:45Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1016/j.ipl.2014.09.021
file:
- access_level: open_access
checksum: 2779a648610c9b5c86d0b51a62816d23
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:45Z
date_updated: 2020-07-14T12:45:03Z
file_id: '5367'
file_name: IST-2016-473-v1+1_1-s2.0-S0020019014001987-main.pdf
file_size: 270137
relation: main_file
file_date_updated: 2020-07-14T12:45:03Z
has_accepted_license: '1'
intvolume: ' 115'
issue: '2'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 243 - 247
publication: Information Processing Letters
publication_status: published
publisher: Elsevier
publist_id: '5588'
pubrep_id: '473'
quality_controlled: '1'
scopus_import: 1
status: public
title: A simple algorithm for computing positively weighted straight skeletons of
monotone polygons
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 115
year: '2015'
...
---
_id: '1584'
abstract:
- lang: eng
text: We investigate weighted straight skeletons from a geometric, graph-theoretical,
and combinatorial point of view. We start with a thorough definition and shed
light on some ambiguity issues in the procedural definition. We investigate the
geometry, combinatorics, and topology of faces and the roof model, and we discuss
in which cases a weighted straight skeleton is connected. Finally, we show that
the weighted straight skeleton of even a simple polygon may be non-planar and
may contain cycles, and we discuss under which restrictions on the weights and/or
the input polygon the weighted straight skeleton still behaves similar to its
unweighted counterpart. In particular, we obtain a non-procedural description
and a linear-time construction algorithm for the straight skeleton of strictly
convex polygons with arbitrary weights.
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Dominik
full_name: Kaaser, Dominik
last_name: Kaaser
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
citation:
ama: 'Biedl T, Held M, Huber S, Kaaser D, Palfrader P. Reprint of: Weighted straight
skeletons in the plane. Computational Geometry: Theory and Applications.
2015;48(5):429-442. doi:10.1016/j.comgeo.2015.01.004'
apa: 'Biedl, T., Held, M., Huber, S., Kaaser, D., & Palfrader, P. (2015). Reprint
of: Weighted straight skeletons in the plane. Computational Geometry: Theory
and Applications. Elsevier. https://doi.org/10.1016/j.comgeo.2015.01.004'
chicago: 'Biedl, Therese, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader.
“Reprint of: Weighted Straight Skeletons in the Plane.” Computational Geometry:
Theory and Applications. Elsevier, 2015. https://doi.org/10.1016/j.comgeo.2015.01.004.'
ieee: 'T. Biedl, M. Held, S. Huber, D. Kaaser, and P. Palfrader, “Reprint of: Weighted
straight skeletons in the plane,” Computational Geometry: Theory and Applications,
vol. 48, no. 5. Elsevier, pp. 429–442, 2015.'
ista: 'Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. Reprint of: Weighted
straight skeletons in the plane. Computational Geometry: Theory and Applications.
48(5), 429–442.'
mla: 'Biedl, Therese, et al. “Reprint of: Weighted Straight Skeletons in the Plane.”
Computational Geometry: Theory and Applications, vol. 48, no. 5, Elsevier,
2015, pp. 429–42, doi:10.1016/j.comgeo.2015.01.004.'
short: 'T. Biedl, M. Held, S. Huber, D. Kaaser, P. Palfrader, Computational Geometry:
Theory and Applications 48 (2015) 429–442.'
date_created: 2018-12-11T11:52:51Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2023-02-23T10:05:22Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1016/j.comgeo.2015.01.004
file:
- access_level: open_access
checksum: 5b33719a86f7f4c8e5dc62c1b6893f49
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:36Z
date_updated: 2020-07-14T12:45:03Z
file_id: '5292'
file_name: IST-2016-475-v1+1_1-s2.0-S092577211500005X-main.pdf
file_size: 508379
relation: main_file
file_date_updated: 2020-07-14T12:45:03Z
has_accepted_license: '1'
intvolume: ' 48'
issue: '5'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 429 - 442
publication: 'Computational Geometry: Theory and Applications'
publication_status: published
publisher: Elsevier
publist_id: '5587'
pubrep_id: '475'
quality_controlled: '1'
related_material:
record:
- id: '1582'
relation: other
status: public
scopus_import: 1
status: public
title: 'Reprint of: Weighted straight skeletons in the plane'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 48
year: '2015'
...
---
_id: '1585'
abstract:
- lang: eng
text: In this paper, we consider the fluctuation of mutual information statistics
of a multiple input multiple output channel communication systems without assuming
that the entries of the channel matrix have zero pseudovariance. To this end,
we also establish a central limit theorem of the linear spectral statistics for
sample covariance matrices under general moment conditions by removing the restrictions
imposed on the second moment and fourth moment on the matrix entries in Bai and
Silverstein (2004).
acknowledgement: "G. Pan was supported by MOE Tier 2 under Grant 2014-T2-2-060 and
in part by Tier 1 under Grant RG25/14 through the Nanyang Technological University,
Singapore. W. Zhou was supported by the National University of Singapore, Singapore,
under Grant R-155-000-131-112.\r\n"
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
ama: Bao Z, Pan G, Zhou W. Asymptotic mutual information statistics of MIMO channels
and CLT of sample covariance matrices. IEEE Transactions on Information Theory.
2015;61(6):3413-3426. doi:10.1109/TIT.2015.2421894
apa: Bao, Z., Pan, G., & Zhou, W. (2015). Asymptotic mutual information statistics
of MIMO channels and CLT of sample covariance matrices. IEEE Transactions on
Information Theory. IEEE. https://doi.org/10.1109/TIT.2015.2421894
chicago: Bao, Zhigang, Guangming Pan, and Wang Zhou. “Asymptotic Mutual Information
Statistics of MIMO Channels and CLT of Sample Covariance Matrices.” IEEE Transactions
on Information Theory. IEEE, 2015. https://doi.org/10.1109/TIT.2015.2421894.
ieee: Z. Bao, G. Pan, and W. Zhou, “Asymptotic mutual information statistics of
MIMO channels and CLT of sample covariance matrices,” IEEE Transactions on
Information Theory, vol. 61, no. 6. IEEE, pp. 3413–3426, 2015.
ista: Bao Z, Pan G, Zhou W. 2015. Asymptotic mutual information statistics of MIMO
channels and CLT of sample covariance matrices. IEEE Transactions on Information
Theory. 61(6), 3413–3426.
mla: Bao, Zhigang, et al. “Asymptotic Mutual Information Statistics of MIMO Channels
and CLT of Sample Covariance Matrices.” IEEE Transactions on Information Theory,
vol. 61, no. 6, IEEE, 2015, pp. 3413–26, doi:10.1109/TIT.2015.2421894.
short: Z. Bao, G. Pan, W. Zhou, IEEE Transactions on Information Theory 61 (2015)
3413–3426.
date_created: 2018-12-11T11:52:52Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:51:46Z
day: '01'
department:
- _id: LaEr
doi: 10.1109/TIT.2015.2421894
intvolume: ' 61'
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 3413 - 3426
publication: IEEE Transactions on Information Theory
publication_status: published
publisher: IEEE
publist_id: '5586'
quality_controlled: '1'
scopus_import: 1
status: public
title: Asymptotic mutual information statistics of MIMO channels and CLT of sample
covariance matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2015'
...
---
_id: '1586'
abstract:
- lang: eng
text: Through metabolic engineering cyanobacteria can be employed in biotechnology.
Combining the capacity for oxygenic photosynthesis and carbon fixation with an
engineered metabolic pathway allows carbon-based product formation from CO2, light,
and water directly. Such cyanobacterial 'cell factories' are constructed to produce
biofuels, bioplastics, and commodity chemicals. Efforts of metabolic engineers
and synthetic biologists allow the modification of the intermediary metabolism
at various branching points, expanding the product range. The new biosynthesis
routes 'tap' the metabolism ever more efficiently, particularly through the engineering
of driving forces and utilization of cofactors generated during the light reactions
of photosynthesis, resulting in higher product titers. High rates of carbon rechanneling
ultimately allow an almost-complete allocation of fixed carbon to product above
biomass.
author:
- first_name: Andreas
full_name: Angermayr, Andreas
id: 4677C796-F248-11E8-B48F-1D18A9856A87
last_name: Angermayr
orcid: 0000-0001-8619-2223
- first_name: Aleix
full_name: Gorchs, Aleix
last_name: Gorchs
- first_name: Klaas
full_name: Hellingwerf, Klaas
last_name: Hellingwerf
citation:
ama: Angermayr A, Gorchs A, Hellingwerf K. Metabolic engineering of cyanobacteria
for the synthesis of commodity products. Trends in Biotechnology. 2015;33(6):352-361.
doi:10.1016/j.tibtech.2015.03.009
apa: Angermayr, A., Gorchs, A., & Hellingwerf, K. (2015). Metabolic engineering
of cyanobacteria for the synthesis of commodity products. Trends in Biotechnology.
Elsevier. https://doi.org/10.1016/j.tibtech.2015.03.009
chicago: Angermayr, Andreas, Aleix Gorchs, and Klaas Hellingwerf. “Metabolic Engineering
of Cyanobacteria for the Synthesis of Commodity Products.” Trends in Biotechnology.
Elsevier, 2015. https://doi.org/10.1016/j.tibtech.2015.03.009.
ieee: A. Angermayr, A. Gorchs, and K. Hellingwerf, “Metabolic engineering of cyanobacteria
for the synthesis of commodity products,” Trends in Biotechnology, vol.
33, no. 6. Elsevier, pp. 352–361, 2015.
ista: Angermayr A, Gorchs A, Hellingwerf K. 2015. Metabolic engineering of cyanobacteria
for the synthesis of commodity products. Trends in Biotechnology. 33(6), 352–361.
mla: Angermayr, Andreas, et al. “Metabolic Engineering of Cyanobacteria for the
Synthesis of Commodity Products.” Trends in Biotechnology, vol. 33, no.
6, Elsevier, 2015, pp. 352–61, doi:10.1016/j.tibtech.2015.03.009.
short: A. Angermayr, A. Gorchs, K. Hellingwerf, Trends in Biotechnology 33 (2015)
352–361.
date_created: 2018-12-11T11:52:52Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:51:46Z
day: '01'
department:
- _id: ToBo
doi: 10.1016/j.tibtech.2015.03.009
intvolume: ' 33'
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 352 - 361
publication: Trends in Biotechnology
publication_status: published
publisher: Elsevier
publist_id: '5585'
quality_controlled: '1'
scopus_import: 1
status: public
title: Metabolic engineering of cyanobacteria for the synthesis of commodity products
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2015'
...
---
_id: '1587'
abstract:
- lang: eng
text: We investigate the quantum interference shifts between energetically close
states, where the state structure is observed by laser spectroscopy. We report
a compact and analytical expression that models the quantum interference induced
shift for any admixture of circular polarization of the incident laser and angle
of observation. An experimental scenario free of quantum interference can thus
be predicted with this formula. Although this study is exemplified here for muonic
deuterium, it can be applied to any other laser spectroscopy measurement of ns-n′p
frequencies of a nonrelativistic atomic system, via an ns→n′p→n′′s scheme.
article_number: '062506'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Pedro
full_name: Amaro, Pedro
last_name: Amaro
- first_name: Filippo
full_name: Fratini, Filippo
last_name: Fratini
- first_name: Laleh
full_name: Safari, Laleh
id: 3C325E5E-F248-11E8-B48F-1D18A9856A87
last_name: Safari
- first_name: Aldo
full_name: Antognini, Aldo
last_name: Antognini
- first_name: Paul
full_name: Indelicato, Paul
last_name: Indelicato
- first_name: Randolf
full_name: Pohl, Randolf
last_name: Pohl
- first_name: José
full_name: Santos, José
last_name: Santos
citation:
ama: Amaro P, Fratini F, Safari L, et al. Quantum interference shifts in laser spectroscopy
with elliptical polarization. Physical Review A - Atomic, Molecular, and Optical
Physics. 2015;92(6). doi:10.1103/PhysRevA.92.062506
apa: Amaro, P., Fratini, F., Safari, L., Antognini, A., Indelicato, P., Pohl, R.,
& Santos, J. (2015). Quantum interference shifts in laser spectroscopy with
elliptical polarization. Physical Review A - Atomic, Molecular, and Optical
Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.92.062506
chicago: Amaro, Pedro, Filippo Fratini, Laleh Safari, Aldo Antognini, Paul Indelicato,
Randolf Pohl, and José Santos. “Quantum Interference Shifts in Laser Spectroscopy
with Elliptical Polarization.” Physical Review A - Atomic, Molecular, and Optical
Physics. American Physical Society, 2015. https://doi.org/10.1103/PhysRevA.92.062506.
ieee: P. Amaro et al., “Quantum interference shifts in laser spectroscopy
with elliptical polarization,” Physical Review A - Atomic, Molecular, and Optical
Physics, vol. 92, no. 6. American Physical Society, 2015.
ista: Amaro P, Fratini F, Safari L, Antognini A, Indelicato P, Pohl R, Santos J.
2015. Quantum interference shifts in laser spectroscopy with elliptical polarization.
Physical Review A - Atomic, Molecular, and Optical Physics. 92(6), 062506.
mla: Amaro, Pedro, et al. “Quantum Interference Shifts in Laser Spectroscopy with
Elliptical Polarization.” Physical Review A - Atomic, Molecular, and Optical
Physics, vol. 92, no. 6, 062506, American Physical Society, 2015, doi:10.1103/PhysRevA.92.062506.
short: P. Amaro, F. Fratini, L. Safari, A. Antognini, P. Indelicato, R. Pohl, J.
Santos, Physical Review A - Atomic, Molecular, and Optical Physics 92 (2015).
date_created: 2018-12-11T11:52:53Z
date_published: 2015-12-31T00:00:00Z
date_updated: 2021-01-12T06:51:47Z
day: '31'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.92.062506
ec_funded: 1
external_id:
arxiv:
- '1511.03585'
intvolume: ' 92'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.03585
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review A - Atomic, Molecular, and Optical Physics
publication_status: published
publisher: American Physical Society
publist_id: '5584'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantum interference shifts in laser spectroscopy with elliptical polarization
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2015'
...
---
_id: '1588'
abstract:
- lang: eng
text: 'We investigate the Taylor-Couette system where the radius ratio is close
to unity. Systematically increasing the Reynolds number, we observe a number of
previously known transitions, such as one from the classical Taylor vortex flow
(TVF) to wavy vortex flow (WVF) and the transition to fully developed turbulence.
Prior to the onset of turbulence, we observe intermittent bursting patterns of
localized turbulent patches, confirming the experimentally observed pattern of
very short wavelength bursts (VSWBs). A striking finding is that, for a Reynolds
number larger than that for the onset of VSWBs, a new type of intermittently bursting
behavior emerges: patterns of azimuthally closed rings of various orders. We call
them ring-bursting patterns, which surround the cylinder completely but remain
localized and separated in the axial direction through nonturbulent wavy structures.
We employ a number of quantitative measures including the cross-flow energy to
characterize the ring-bursting patterns and to distinguish them from the background
flow. These patterns are interesting because they do not occur in the wide-gap
Taylor-Couette flow systems. The narrow-gap regime is less studied but certainly
deserves further attention to gain deeper insights into complex flow dynamics
in fluids.'
article_number: '053018'
author:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Ying
full_name: Lai, Ying
last_name: Lai
citation:
ama: Altmeyer S, Do Y, Lai Y. Ring-bursting behavior en route to turbulence in narrow-gap
Taylor-Couette flows. Physical Review E. 2015;92(5). doi:10.1103/PhysRevE.92.053018
apa: Altmeyer, S., Do, Y., & Lai, Y. (2015). Ring-bursting behavior en route
to turbulence in narrow-gap Taylor-Couette flows. Physical Review E. American
Physical Society. https://doi.org/10.1103/PhysRevE.92.053018
chicago: Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Ring-Bursting Behavior
En Route to Turbulence in Narrow-Gap Taylor-Couette Flows.” Physical Review
E. American Physical Society, 2015. https://doi.org/10.1103/PhysRevE.92.053018.
ieee: S. Altmeyer, Y. Do, and Y. Lai, “Ring-bursting behavior en route to turbulence
in narrow-gap Taylor-Couette flows,” Physical Review E, vol. 92, no. 5.
American Physical Society, 2015.
ista: Altmeyer S, Do Y, Lai Y. 2015. Ring-bursting behavior en route to turbulence
in narrow-gap Taylor-Couette flows. Physical Review E. 92(5), 053018.
mla: Altmeyer, Sebastian, et al. “Ring-Bursting Behavior En Route to Turbulence
in Narrow-Gap Taylor-Couette Flows.” Physical Review E, vol. 92, no. 5,
053018, American Physical Society, 2015, doi:10.1103/PhysRevE.92.053018.
short: S. Altmeyer, Y. Do, Y. Lai, Physical Review E 92 (2015).
date_created: 2018-12-11T11:52:53Z
date_published: 2015-11-24T00:00:00Z
date_updated: 2021-01-12T06:51:47Z
day: '24'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.92.053018
intvolume: ' 92'
issue: '5'
language:
- iso: eng
month: '11'
oa_version: None
publication: Physical Review E
publication_status: published
publisher: American Physical Society
publist_id: '5583'
quality_controlled: '1'
scopus_import: 1
status: public
title: Ring-bursting behavior en route to turbulence in narrow-gap Taylor-Couette
flows
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2015'
...
---
_id: '1589'
abstract:
- lang: eng
text: We investigate the dynamics of ferrofluidic wavy vortex flows in the counter-rotating
Taylor-Couette system, with a focus on wavy flows with a mixture of the dominant
azimuthal modes. Without external magnetic field flows are stable and pro-grade
with respect to the rotation of the inner cylinder. More complex behaviors can
arise when an axial or a transverse magnetic field is applied. Depending on the
direction and strength of the field, multi-stable wavy states and bifurcations
can occur. We uncover the phenomenon of flow pattern reversal as the strength
of the magnetic field is increased through a critical value. In between the regimes
of pro-grade and retrograde flow rotations, standing waves with zero angular velocities
can emerge. A striking finding is that, under a transverse magnetic field, a second
reversal in the flow pattern direction can occur, where the flow pattern evolves
into pro-grade rotation again from a retrograde state. Flow reversal is relevant
to intriguing phenomena in nature such as geomagnetic reversal. Our results suggest
that, in ferrofluids, flow pattern reversal can be induced by varying a magnetic
field in a controlled manner, which can be realized in laboratory experiments
with potential applications in the development of modern fluid devices.
article_number: '18589'
article_type: original
author:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Ying
full_name: Lai, Ying
last_name: Lai
citation:
ama: Altmeyer S, Do Y, Lai Y. Magnetic field induced flow pattern reversal in a
ferrofluidic Taylor-Couette system. Scientific Reports. 2015;5. doi:10.1038/srep18589
apa: Altmeyer, S., Do, Y., & Lai, Y. (2015). Magnetic field induced flow pattern
reversal in a ferrofluidic Taylor-Couette system. Scientific Reports. Nature
Publishing Group. https://doi.org/10.1038/srep18589
chicago: Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Magnetic Field Induced
Flow Pattern Reversal in a Ferrofluidic Taylor-Couette System.” Scientific
Reports. Nature Publishing Group, 2015. https://doi.org/10.1038/srep18589.
ieee: S. Altmeyer, Y. Do, and Y. Lai, “Magnetic field induced flow pattern reversal
in a ferrofluidic Taylor-Couette system,” Scientific Reports, vol. 5. Nature
Publishing Group, 2015.
ista: Altmeyer S, Do Y, Lai Y. 2015. Magnetic field induced flow pattern reversal
in a ferrofluidic Taylor-Couette system. Scientific Reports. 5, 18589.
mla: Altmeyer, Sebastian, et al. “Magnetic Field Induced Flow Pattern Reversal in
a Ferrofluidic Taylor-Couette System.” Scientific Reports, vol. 5, 18589,
Nature Publishing Group, 2015, doi:10.1038/srep18589.
short: S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 5 (2015).
date_created: 2018-12-11T11:52:53Z
date_published: 2015-12-21T00:00:00Z
date_updated: 2021-01-12T06:51:48Z
day: '21'
ddc:
- '530'
- '540'
department:
- _id: BjHo
doi: 10.1038/srep18589
file:
- access_level: open_access
checksum: 927e151674347661ce36eae2818dafdc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:49Z
date_updated: 2020-07-14T12:45:03Z
file_id: '5036'
file_name: IST-2016-472-v1+1_srep18589.pdf
file_size: 2771236
relation: main_file
file_date_updated: 2020-07-14T12:45:03Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
publist_id: '5582'
pubrep_id: '472'
quality_controlled: '1'
scopus_import: 1
status: public
title: Magnetic field induced flow pattern reversal in a ferrofluidic Taylor-Couette
system
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2015'
...
---
_id: '1590'
abstract:
- lang: eng
text: 'The straight skeleton of a polygon is the geometric graph obtained by tracing
the vertices during a mitered offsetting process. It is known that the straight
skeleton of a simple polygon is a tree, and one can naturally derive directions
on the edges of the tree from the propagation of the shrinking process. In this
paper, we ask the reverse question: Given a tree with directed edges, can it be
the straight skeleton of a polygon? And if so, can we find a suitable simple polygon?
We answer these questions for all directed trees where the order of edges around
each node is fixed.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Oswin
full_name: Aichholzer, Oswin
last_name: Aichholzer
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Thomas
full_name: Hackl, Thomas
last_name: Hackl
- first_name: Martin
full_name: Held, Martin
last_name: Held
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
- first_name: Birgit
full_name: Vogtenhuber, Birgit
last_name: Vogtenhuber
citation:
ama: 'Aichholzer O, Biedl T, Hackl T, et al. Representing directed trees as straight
skeletons. In: Graph Drawing and Network Visualization. Vol 9411. Springer
Nature; 2015:335-347. doi:10.1007/978-3-319-27261-0_28'
apa: 'Aichholzer, O., Biedl, T., Hackl, T., Held, M., Huber, S., Palfrader, P.,
& Vogtenhuber, B. (2015). Representing directed trees as straight skeletons.
In Graph Drawing and Network Visualization (Vol. 9411, pp. 335–347). Los
Angeles, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-319-27261-0_28'
chicago: Aichholzer, Oswin, Therese Biedl, Thomas Hackl, Martin Held, Stefan Huber,
Peter Palfrader, and Birgit Vogtenhuber. “Representing Directed Trees as Straight
Skeletons.” In Graph Drawing and Network Visualization, 9411:335–47. Springer
Nature, 2015. https://doi.org/10.1007/978-3-319-27261-0_28.
ieee: O. Aichholzer et al., “Representing directed trees as straight skeletons,”
in Graph Drawing and Network Visualization, vol. 9411, Springer Nature,
2015, pp. 335–347.
ista: 'Aichholzer O, Biedl T, Hackl T, Held M, Huber S, Palfrader P, Vogtenhuber
B. 2015.Representing directed trees as straight skeletons. In: Graph Drawing and
Network Visualization. LNCS, vol. 9411, 335–347.'
mla: Aichholzer, Oswin, et al. “Representing Directed Trees as Straight Skeletons.”
Graph Drawing and Network Visualization, vol. 9411, Springer Nature, 2015,
pp. 335–47, doi:10.1007/978-3-319-27261-0_28.
short: O. Aichholzer, T. Biedl, T. Hackl, M. Held, S. Huber, P. Palfrader, B. Vogtenhuber,
in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 335–347.
conference:
end_date: 2015-09-26
location: Los Angeles, CA, United States
name: 'GD: International Symposium on Graph Drawing'
start_date: 2015-09-24
date_created: 2018-12-11T11:52:54Z
date_published: 2015-11-27T00:00:00Z
date_updated: 2022-01-28T09:10:37Z
day: '27'
department:
- _id: HeEd
doi: 10.1007/978-3-319-27261-0_28
intvolume: ' 9411'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1508.01076
month: '11'
oa: 1
oa_version: Preprint
page: 335 - 347
publication: Graph Drawing and Network Visualization
publication_identifier:
eisbn:
- 978-3-319-27261-0
isbn:
- 978-3-319-27260-3
publication_status: published
publisher: Springer Nature
publist_id: '5581'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Representing directed trees as straight skeletons
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9411
year: '2015'
...
---
_id: '1591'
abstract:
- lang: eng
text: Auxin participates in a multitude of developmental processes, as well as responses
to environmental cues. Compared with other plant hormones, auxin exhibits a unique
property, as it undergoes directional, cell-to-cell transport facilitated by plasma
membrane-localized transport proteins. Among them, a prominent role has been ascribed
to the PIN family of auxin efflux facilitators. PIN proteins direct polar auxin
transport on account of their asymmetric subcellular localizations. In this review,
we provide an overview of the multiple developmental roles of PIN proteins, including
the atypical endoplasmic reticulum-localized members of the family, and look at
the family from an evolutionary perspective. Next, we cover the cell biological
and molecular aspects of PIN function, in particular the establishment of their
polar subcellular localization. Hormonal and environmental inputs into the regulation
of PIN action are summarized as well.
author:
- first_name: Maciek
full_name: Adamowski, Maciek
id: 45F536D2-F248-11E8-B48F-1D18A9856A87
last_name: Adamowski
orcid: 0000-0001-6463-5257
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Adamowski M, Friml J. PIN-dependent auxin transport: Action, regulation, and
evolution. Plant Cell. 2015;27(1):20-32. doi:10.1105/tpc.114.134874'
apa: 'Adamowski, M., & Friml, J. (2015). PIN-dependent auxin transport: Action,
regulation, and evolution. Plant Cell. American Society of Plant Biologists.
https://doi.org/10.1105/tpc.114.134874'
chicago: 'Adamowski, Maciek, and Jiří Friml. “PIN-Dependent Auxin Transport: Action,
Regulation, and Evolution.” Plant Cell. American Society of Plant Biologists,
2015. https://doi.org/10.1105/tpc.114.134874.'
ieee: 'M. Adamowski and J. Friml, “PIN-dependent auxin transport: Action, regulation,
and evolution,” Plant Cell, vol. 27, no. 1. American Society of Plant Biologists,
pp. 20–32, 2015.'
ista: 'Adamowski M, Friml J. 2015. PIN-dependent auxin transport: Action, regulation,
and evolution. Plant Cell. 27(1), 20–32.'
mla: 'Adamowski, Maciek, and Jiří Friml. “PIN-Dependent Auxin Transport: Action,
Regulation, and Evolution.” Plant Cell, vol. 27, no. 1, American Society
of Plant Biologists, 2015, pp. 20–32, doi:10.1105/tpc.114.134874.'
short: M. Adamowski, J. Friml, Plant Cell 27 (2015) 20–32.
date_created: 2018-12-11T11:52:54Z
date_published: 2015-01-20T00:00:00Z
date_updated: 2023-09-07T12:06:09Z
day: '20'
department:
- _id: JiFr
doi: 10.1105/tpc.114.134874
external_id:
pmid:
- '25604445'
intvolume: ' 27'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4330589/
month: '01'
oa: 1
oa_version: Submitted Version
page: 20 - 32
pmid: 1
publication: Plant Cell
publication_status: published
publisher: American Society of Plant Biologists
publist_id: '5580'
quality_controlled: '1'
related_material:
record:
- id: '938'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: 'PIN-dependent auxin transport: Action, regulation, and evolution'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2015'
...
---
_id: '1593'
abstract:
- lang: eng
text: 'Plants are sessile organisms that are permanently restricted to their site
of germination. To compensate for their lack of mobility, plants evolved unique
mechanisms enabling them to rapidly react to ever changing environmental conditions
and flexibly adapt their postembryonic developmental program. A prominent demonstration
of this developmental plasticity is their ability to bend organs in order to reach
the position most optimal for growth and utilization of light, nutrients, and
other resources. Shortly after germination, dicotyledonous seedlings form a bended
structure, the so-called apical hook, to protect the delicate shoot meristem and
cotyledons from damage when penetrating through the soil. Upon perception of a
light stimulus, the apical hook rapidly opens and the photomorphogenic developmental
program is activated. After germination, plant organs are able to align their
growth with the light source and adopt the most favorable orientation through
bending, in a process named phototropism. On the other hand, when roots and shoots
are diverted from their upright orientation, they immediately detect a change
in the gravity vector and bend to maintain a vertical growth direction. Noteworthy,
despite the diversity of external stimuli perceived by different plant organs,
all plant tropic movements share a common mechanistic basis: differential cell
growth. In our review, we will discuss the molecular principles underlying various
tropic responses with the focus on mechanisms mediating the perception of external
signals, transduction cascades and downstream responses that regulate differential
cell growth and consequently, organ bending. In particular, we highlight common
and specific features of regulatory pathways in control of the bending of organs
and a role for the plant hormone auxin as a key regulatory component.'
author:
- first_name: Petra
full_name: Žádníková, Petra
last_name: Žádníková
- first_name: Dajo
full_name: Smet, Dajo
last_name: Smet
- first_name: Qiang
full_name: Zhu, Qiang
id: 40A4B9E6-F248-11E8-B48F-1D18A9856A87
last_name: Zhu
- first_name: Dominique
full_name: Van Der Straeten, Dominique
last_name: Van Der Straeten
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: 'Žádníková P, Smet D, Zhu Q, Van Der Straeten D, Benková E. Strategies of seedlings
to overcome their sessile nature: Auxin in mobility control. Frontiers in Plant
Science. 2015;6(4). doi:10.3389/fpls.2015.00218'
apa: 'Žádníková, P., Smet, D., Zhu, Q., Van Der Straeten, D., & Benková, E.
(2015). Strategies of seedlings to overcome their sessile nature: Auxin in mobility
control. Frontiers in Plant Science. Frontiers Research Foundation. https://doi.org/10.3389/fpls.2015.00218'
chicago: 'Žádníková, Petra, Dajo Smet, Qiang Zhu, Dominique Van Der Straeten, and
Eva Benková. “Strategies of Seedlings to Overcome Their Sessile Nature: Auxin
in Mobility Control.” Frontiers in Plant Science. Frontiers Research Foundation,
2015. https://doi.org/10.3389/fpls.2015.00218.'
ieee: 'P. Žádníková, D. Smet, Q. Zhu, D. Van Der Straeten, and E. Benková, “Strategies
of seedlings to overcome their sessile nature: Auxin in mobility control,” Frontiers
in Plant Science, vol. 6, no. 4. Frontiers Research Foundation, 2015.'
ista: 'Žádníková P, Smet D, Zhu Q, Van Der Straeten D, Benková E. 2015. Strategies
of seedlings to overcome their sessile nature: Auxin in mobility control. Frontiers
in Plant Science. 6(4).'
mla: 'Žádníková, Petra, et al. “Strategies of Seedlings to Overcome Their Sessile
Nature: Auxin in Mobility Control.” Frontiers in Plant Science, vol. 6,
no. 4, Frontiers Research Foundation, 2015, doi:10.3389/fpls.2015.00218.'
short: P. Žádníková, D. Smet, Q. Zhu, D. Van Der Straeten, E. Benková, Frontiers
in Plant Science 6 (2015).
date_created: 2018-12-11T11:52:55Z
date_published: 2015-04-14T00:00:00Z
date_updated: 2021-01-12T06:51:50Z
day: '14'
ddc:
- '570'
department:
- _id: EvBe
doi: 10.3389/fpls.2015.00218
ec_funded: 1
file:
- access_level: open_access
checksum: c454d642e18dfa86820b97a86cd6d3cc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:23Z
date_updated: 2020-07-14T12:45:03Z
file_id: '5142'
file_name: IST-2016-471-v1+1_fpls-06-00218.pdf
file_size: 965690
relation: main_file
file_date_updated: 2020-07-14T12:45:03Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
publication: Frontiers in Plant Science
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '5578'
pubrep_id: '471'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Strategies of seedlings to overcome their sessile nature: Auxin in mobility
control'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2015'
...
---
_id: '1594'
abstract:
- lang: eng
text: Quantitative extensions of temporal logics have recently attracted significant
attention. In this work, we study frequency LTL (fLTL), an extension of LTL which
allows to speak about frequencies of events along an execution. Such an extension
is particularly useful for probabilistic systems that often cannot fulfil strict
qualitative guarantees on the behaviour. It has been recently shown that controller
synthesis for Markov decision processes and fLTL is decidable when all the bounds
on frequencies are 1. As a step towards a complete quantitative solution, we show
that the problem is decidable for the fragment fLTL\GU, where U does not occur
in the scope of G (but still F can). Our solution is based on a novel translation
of such quantitative formulae into equivalent deterministic automata.
acknowledgement: "This work is partly supported by the German Research Council (DFG)
as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14), by
the Czech Science Foundation under grant agreement P202/12/G061, by the EU 7th Framework
Programme under grant agreement no. 295261 (MEALS) and 318490 (SENSATION), by the
CDZ project 1023 (CAP), by the CAS/SAFEA International Partnership Program for Creative
Research Teams, by the EPSRC grant EP/M023656/1, by the People Programme (Marie
Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013)
REA Grant No 291734, by the Austrian Science Fund (FWF) S11407-N23 (RiSE/SHiNE),
and by the ERC Start Grant (279307: Graph Games).\r\n"
alternative_title:
- LNCS
author:
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Jan
full_name: Krčál, Jan
last_name: Krčál
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Forejt V, Krčál J, Kretinsky J. Controller synthesis for MDPs and frequency
LTL\GU. In: Vol 9450. Springer; 2015:162-177. doi:10.1007/978-3-662-48899-7_12'
apa: 'Forejt, V., Krčál, J., & Kretinsky, J. (2015). Controller synthesis for
MDPs and frequency LTL\GU (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic
for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer.
https://doi.org/10.1007/978-3-662-48899-7_12'
chicago: Forejt, Vojtěch, Jan Krčál, and Jan Kretinsky. “Controller Synthesis for
MDPs and Frequency LTL\GU,” 9450:162–77. Springer, 2015. https://doi.org/10.1007/978-3-662-48899-7_12.
ieee: 'V. Forejt, J. Krčál, and J. Kretinsky, “Controller synthesis for MDPs and
frequency LTL\GU,” presented at the LPAR: Logic for Programming, Artificial Intelligence,
and Reasoning, Suva, Fiji, 2015, vol. 9450, pp. 162–177.'
ista: 'Forejt V, Krčál J, Kretinsky J. 2015. Controller synthesis for MDPs and frequency
LTL\GU. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS,
vol. 9450, 162–177.'
mla: Forejt, Vojtěch, et al. Controller Synthesis for MDPs and Frequency LTL\GU.
Vol. 9450, Springer, 2015, pp. 162–77, doi:10.1007/978-3-662-48899-7_12.
short: V. Forejt, J. Krčál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.
conference:
end_date: 2015-11-28
location: Suva, Fiji
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2015-11-24
date_created: 2018-12-11T11:52:55Z
date_published: 2015-11-22T00:00:00Z
date_updated: 2021-01-12T06:51:50Z
day: '22'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-662-48899-7_12
ec_funded: 1
intvolume: ' 9450'
language:
- iso: eng
month: '11'
oa_version: None
page: 162 - 177
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '5577'
quality_controlled: '1'
scopus_import: 1
status: public
title: Controller synthesis for MDPs and frequency LTL\GU
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9450
year: '2015'
...
---
_id: '1595'
abstract:
- lang: eng
text: 'A drawing of a graph G is radial if the vertices of G are placed on concentric
circles C1, . . . , Ck with common center c, and edges are drawn radially: every
edge intersects every circle centered at c at most once. G is radial planar if
it has a radial embedding, that is, a crossing- free radial drawing. If the vertices
of G are ordered or partitioned into ordered levels (as they are for leveled graphs),
we require that the assignment of vertices to circles corresponds to the given
ordering or leveling. We show that a graph G is radial planar if G has a radial
drawing in which every two edges cross an even number of times; the radial embedding
has the same leveling as the radial drawing. In other words, we establish the
weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes
a result by Pach and Tóth.'
acknowledgement: The research leading to these results has received funding from the
People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme (FP7/2007-2013) under REA grant agreement no [291734].
alternative_title:
- LNCS
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Michael
full_name: Pelsmajer, Michael
last_name: Pelsmajer
- first_name: Marcus
full_name: Schaefer, Marcus
last_name: Schaefer
citation:
ama: 'Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. In: Vol
9411. Springer; 2015:99-110. doi:10.1007/978-3-319-27261-0_9'
apa: 'Fulek, R., Pelsmajer, M., & Schaefer, M. (2015). Hanani-Tutte for radial
planarity (Vol. 9411, pp. 99–110). Presented at the GD: Graph Drawing and Network
Visualization, Los Angeles, CA, USA: Springer. https://doi.org/10.1007/978-3-319-27261-0_9'
chicago: Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte
for Radial Planarity,” 9411:99–110. Springer, 2015. https://doi.org/10.1007/978-3-319-27261-0_9.
ieee: 'R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,”
presented at the GD: Graph Drawing and Network Visualization, Los Angeles, CA,
USA, 2015, vol. 9411, pp. 99–110.'
ista: 'Fulek R, Pelsmajer M, Schaefer M. 2015. Hanani-Tutte for radial planarity.
GD: Graph Drawing and Network Visualization, LNCS, vol. 9411, 99–110.'
mla: Fulek, Radoslav, et al. Hanani-Tutte for Radial Planarity. Vol. 9411,
Springer, 2015, pp. 99–110, doi:10.1007/978-3-319-27261-0_9.
short: R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2015, pp. 99–110.
conference:
end_date: 2015-09-26
location: Los Angeles, CA, USA
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2015-09-24
date_created: 2018-12-11T11:52:55Z
date_published: 2015-11-27T00:00:00Z
date_updated: 2023-02-21T16:23:36Z
day: '27'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/978-3-319-27261-0_9
ec_funded: 1
file:
- access_level: open_access
checksum: 685f91bd077a951ba067d42cce75409e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:36Z
date_updated: 2020-07-14T12:45:03Z
file_id: '4697'
file_name: IST-2016-594-v1+1_HTCylinder_GD_Revision.pdf
file_size: 330135
relation: main_file
file_date_updated: 2020-07-14T12:45:03Z
has_accepted_license: '1'
intvolume: ' 9411'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 99 - 110
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5576'
pubrep_id: '594'
quality_controlled: '1'
related_material:
record:
- id: '1113'
relation: later_version
status: public
- id: '1164'
relation: later_version
status: public
scopus_import: 1
status: public
title: Hanani-Tutte for radial planarity
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 9411
year: '2015'
...
---
_id: '1596'
abstract:
- lang: eng
text: Let C={C1,...,Cn} denote a collection of translates of a regular convex k-gon
in the plane with the stacking order. The collection C forms a visibility clique
if for everyi < j the intersection Ci and (Ci ∩ Cj)\⋃i<l<jCl =∅.elements
that are stacked between them, i.e., We show that if C forms a visibility clique
its size is bounded from above by O(k4) thereby improving the upper bound of 22k
from the aforementioned paper. We also obtain an upper bound of 22(k/2)+2 on the
size of a visibility clique for homothetes of a convex (not necessarily regular)
k-gon.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Radoš
full_name: Radoičić, Radoš
last_name: Radoičić
citation:
ama: 'Fulek R, Radoičić R. Vertical visibility among parallel polygons in three
dimensions. In: Graph Drawing and Network Visualization. Vol 9411. Springer
Nature; 2015:373-379. doi:10.1007/978-3-319-27261-0_31'
apa: 'Fulek, R., & Radoičić, R. (2015). Vertical visibility among parallel polygons
in three dimensions. In Graph Drawing and Network Visualization (Vol. 9411,
pp. 373–379). Los Angeles, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-319-27261-0_31'
chicago: Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel
Polygons in Three Dimensions.” In Graph Drawing and Network Visualization,
9411:373–79. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-27261-0_31.
ieee: R. Fulek and R. Radoičić, “Vertical visibility among parallel polygons in
three dimensions,” in Graph Drawing and Network Visualization, vol. 9411,
Springer Nature, 2015, pp. 373–379.
ista: 'Fulek R, Radoičić R. 2015.Vertical visibility among parallel polygons in
three dimensions. In: Graph Drawing and Network Visualization. LNCS, vol. 9411,
373–379.'
mla: Fulek, Radoslav, and Radoš Radoičić. “Vertical Visibility among Parallel Polygons
in Three Dimensions.” Graph Drawing and Network Visualization, vol. 9411,
Springer Nature, 2015, pp. 373–79, doi:10.1007/978-3-319-27261-0_31.
short: R. Fulek, R. Radoičić, in:, Graph Drawing and Network Visualization, Springer
Nature, 2015, pp. 373–379.
conference:
end_date: 2015-09-26
location: Los Angeles, CA, United States
name: 'GD: Graph Drawing and Network Visualization'
start_date: 2015-09-24
date_created: 2018-12-11T11:52:56Z
date_published: 2015-11-27T00:00:00Z
date_updated: 2022-01-28T09:20:50Z
day: '27'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1007/978-3-319-27261-0_31
ec_funded: 1
file:
- access_level: open_access
checksum: eec04f86c5921d04f025d5791db9b965
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:06Z
date_updated: 2020-07-14T12:45:04Z
file_id: '5258'
file_name: IST-2016-595-v1+1_VerticalVisibilityGDRevision.pdf
file_size: 312992
relation: main_file
file_date_updated: 2020-07-14T12:45:04Z
has_accepted_license: '1'
intvolume: ' 9411'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 373 - 379
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Graph Drawing and Network Visualization
publication_identifier:
isbn:
- 978-3-319-27260-3
publication_status: published
publisher: Springer Nature
publist_id: '5575'
pubrep_id: '595'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Vertical visibility among parallel polygons in three dimensions
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9411
year: '2015'
...
---
_id: '1598'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with specifications given as
Büchi (liveness) objectives, and examine the problem of computing the set of almost-sure
winning vertices such that the objective can be ensured with probability 1 from
these vertices. We study for the first time the average-case complexity of the
classical algorithm for computing the set of almost-sure winning vertices for
MDPs with Büchi objectives. Our contributions are as follows: First, we show that
for MDPs with constant out-degree the expected number of iterations is at most
logarithmic and the average-case running time is linear (as compared to the worst-case
linear number of iterations and quadratic time complexity). Second, for the average-case
analysis over all MDPs we show that the expected number of iterations is constant
and the average-case running time is linear (again as compared to the worst-case
linear number of iterations and quadratic time complexity). Finally we also show
that when all MDPs are equally likely, the probability that the classical algorithm
requires more than a constant number of iterations is exponentially small.'
acknowledgement: "The research was supported by FWF Grant No. P 23499-N23, FWF NFN
Grant No. S11407-N23 (RiSE), ERC Start Grant (279307: Graph Games), and the Microsoft
Faculty Fellows Award. Nisarg Shah is also supported by NSF Grant CCF-1215883.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Manas
full_name: Joglekar, Manas
last_name: Joglekar
- first_name: Nisarg
full_name: Shah, Nisarg
last_name: Shah
citation:
ama: Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm
for Markov decision processes with Büchi objectives. Theoretical Computer Science.
2015;573(3):71-89. doi:10.1016/j.tcs.2015.01.050
apa: Chatterjee, K., Joglekar, M., & Shah, N. (2015). Average case analysis
of the classical algorithm for Markov decision processes with Büchi objectives.
Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.050
chicago: Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case
Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.”
Theoretical Computer Science. Elsevier, 2015. https://doi.org/10.1016/j.tcs.2015.01.050.
ieee: K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives,” Theoretical
Computer Science, vol. 573, no. 3. Elsevier, pp. 71–89, 2015.
ista: Chatterjee K, Joglekar M, Shah N. 2015. Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives. Theoretical Computer
Science. 573(3), 71–89.
mla: Chatterjee, Krishnendu, et al. “Average Case Analysis of the Classical Algorithm
for Markov Decision Processes with Büchi Objectives.” Theoretical Computer
Science, vol. 573, no. 3, Elsevier, 2015, pp. 71–89, doi:10.1016/j.tcs.2015.01.050.
short: K. Chatterjee, M. Joglekar, N. Shah, Theoretical Computer Science 573 (2015)
71–89.
date_created: 2018-12-11T11:52:56Z
date_published: 2015-03-30T00:00:00Z
date_updated: 2023-02-23T10:55:03Z
day: '30'
department:
- _id: KrCh
doi: 10.1016/j.tcs.2015.01.050
ec_funded: 1
external_id:
arxiv:
- '1202.4175'
intvolume: ' 573'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1202.4175
month: '03'
oa: 1
oa_version: Preprint
page: 71 - 89
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5571'
quality_controlled: '1'
related_material:
record:
- id: '2715'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Average case analysis of the classical algorithm for Markov decision processes
with Büchi objectives
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 573
year: '2015'
...
---
_id: '1601'
abstract:
- lang: eng
text: We propose a flexible exchange format for ω-automata, as typically used in
formal verification, and implement support for it in a range of established tools.
Our aim is to simplify the interaction of tools, helping the research community
to build upon other people’s work. A key feature of the format is the use of very
generic acceptance conditions, specified by Boolean combinations of acceptance
primitives, rather than being limited to common cases such as Büchi, Streett,
or Rabin. Such flexibility in the choice of acceptance conditions can be exploited
in applications, for example in probabilistic model checking, and furthermore
encourages the development of acceptance-agnostic tools for automata manipulations.
The format allows acceptance conditions that are either state-based or transition-based,
and also supports alternating automata.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tomáš
full_name: Babiak, Tomáš
last_name: Babiak
- first_name: František
full_name: Blahoudek, František
last_name: Blahoudek
- first_name: Alexandre
full_name: Duret Lutz, Alexandre
last_name: Duret Lutz
- first_name: Joachim
full_name: Klein, Joachim
last_name: Klein
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Daniel
full_name: Mueller, Daniel
last_name: Mueller
- first_name: David
full_name: Parker, David
last_name: Parker
- first_name: Jan
full_name: Strejček, Jan
last_name: Strejček
citation:
ama: 'Babiak T, Blahoudek F, Duret Lutz A, et al. The Hanoi omega-automata format.
In: Vol 9206. Springer; 2015:479-486. doi:10.1007/978-3-319-21690-4_31'
apa: 'Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller,
D., … Strejček, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486).
Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States:
Springer. https://doi.org/10.1007/978-3-319-21690-4_31'
chicago: Babiak, Tomáš, František Blahoudek, Alexandre Duret Lutz, Joachim Klein,
Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejček. “The Hanoi Omega-Automata
Format,” 9206:479–86. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_31.
ieee: 'T. Babiak et al., “The Hanoi omega-automata format,” presented at
the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015,
vol. 9206, pp. 479–486.'
ista: 'Babiak T, Blahoudek F, Duret Lutz A, Klein J, Kretinsky J, Mueller D, Parker
D, Strejček J. 2015. The Hanoi omega-automata format. CAV: Computer Aided Verification,
LNCS, vol. 9206, 479–486.'
mla: Babiak, Tomáš, et al. The Hanoi Omega-Automata Format. Vol. 9206, Springer,
2015, pp. 479–86, doi:10.1007/978-3-319-21690-4_31.
short: T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller,
D. Parker, J. Strejček, in:, Springer, 2015, pp. 479–486.
conference:
end_date: 2015-07-24
location: San Francisco, CA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2015-07-18
date_created: 2018-12-11T11:52:57Z
date_published: 2015-07-16T00:00:00Z
date_updated: 2021-01-12T06:51:54Z
day: '16'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-319-21690-4_31
ec_funded: 1
file:
- access_level: open_access
checksum: 5885236fa88a439baba9ac6f3e801e93
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:38:12Z
date_updated: 2020-07-14T12:45:04Z
file_id: '7850'
file_name: 2015_CAV_Babiak.pdf
file_size: 1651779
relation: main_file
file_date_updated: 2020-07-14T12:45:04Z
has_accepted_license: '1'
intvolume: ' 9206'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 479 - 486
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5566'
quality_controlled: '1'
scopus_import: 1
status: public
title: The Hanoi omega-automata format
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9206
year: '2015'
...
---
_id: '1602'
abstract:
- lang: eng
text: Interprocedural analysis is at the heart of numerous applications in programming
languages, such as alias analysis, constant propagation, etc. Recursive state
machines (RSMs) are standard models for interprocedural analysis. We consider
a general framework with RSMs where the transitions are labeled from a semiring,
and path properties are algebraic with semiring operations. RSMs with algebraic
path properties can model interprocedural dataflow analysis problems, the shortest
path problem, the most probable path problem, etc. The traditional algorithms
for interprocedural analysis focus on path properties where the starting point
is fixed as the entry point of a specific method. In this work, we consider possible
multiple queries as required in many applications such as in alias analysis. The
study of multiple queries allows us to bring in a very important algorithmic distinction
between the resource usage of the one-time preprocessing vs for each individual
query. The second aspect that we consider is that the control flow graphs for
most programs have constant treewidth. Our main contributions are simple and implementable
algorithms that supportmultiple queries for algebraic path properties for RSMs
that have constant treewidth. Our theoretical results show that our algorithms
have small additional one-time preprocessing, but can answer subsequent queries
significantly faster as compared to the current best-known solutions for several
important problems, such as interprocedural reachability and shortest path. We
provide a prototype implementation for interprocedural reachability and intraprocedural
shortest path that gives a significant speed-up on several benchmarks.
acknowledgement: We thank anonymous reviewers for helpful comments to improve the
presentation of the paper.
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Prateesh
full_name: Goyal, Prateesh
last_name: Goyal
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. Faster algorithms for
algebraic path properties in recursive state machines with constant treewidth.
ACM SIGPLAN Notices. 2015;50(1):97-109. doi:10.1145/2676726.2676979
apa: 'Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A., & Goyal, P. (2015).
Faster algorithms for algebraic path properties in recursive state machines with
constant treewidth. ACM SIGPLAN Notices. Mumbai, India: ACM. https://doi.org/10.1145/2676726.2676979'
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and
Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive
State Machines with Constant Treewidth.” ACM SIGPLAN Notices. ACM, 2015.
https://doi.org/10.1145/2676726.2676979.
ieee: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms
for algebraic path properties in recursive state machines with constant treewidth,”
ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. 2015. Faster algorithms
for algebraic path properties in recursive state machines with constant treewidth.
ACM SIGPLAN Notices. 50(1), 97–109.
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Algebraic Path Properties
in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices,
vol. 50, no. 1, ACM, 2015, pp. 97–109, doi:10.1145/2676726.2676979.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal, ACM SIGPLAN Notices
50 (2015) 97–109.
conference:
end_date: 2015-01-17
location: Mumbai, India
name: 'SIGPLAN: Symposium on Principles of Programming Languages'
start_date: 2015-01-15
date_created: 2018-12-11T11:52:58Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-09-07T12:01:58Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2676726.2676979
ec_funded: 1
external_id:
arxiv:
- '1410.7724'
intvolume: ' 50'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1410.7724
month: '01'
oa: 1
oa_version: Preprint
page: 97 - 109
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: ACM SIGPLAN Notices
publication_status: published
publisher: ACM
publist_id: '5565'
quality_controlled: '1'
related_material:
record:
- id: '821'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Faster algorithms for algebraic path properties in recursive state machines
with constant treewidth
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2015'
...