---
_id: '747'
abstract:
- lang: eng
text: Bradykinin (BK), a component of the kallikrein-kininogen-kinin system exerts
multiple effects via B1 and B2 receptor activation. In the cardiovascular system,
bradykinin has cardioprotective and vasodilator properties. We investigated the
effect of BK on cardiac-projecting neurons of nucleus ambiguus, a key site for
the parasympathetic cardiac regulation. BK produced a dose-dependent increase
in cytosolic Ca2+ concentration. Pretreatment with HOE140, a B2 receptor antagonist,
but not with R715, a B1 receptor antagonist, abolished the response to BK. A selective
B2 receptor agonist, but not a B1 receptor agonist, elicited an increase in cytosolic
Ca2+ similarly to BK. Inhibition of N-type voltage-gated Ca2+ channels with ω-conotoxin
GVIA had no effect on the Ca2+ signal produced by BK, while pretreatment with
ω-conotoxin MVIIC, a blocker of P/Q-type of Ca2+ channels, significantly diminished
the effect of BK. Pretreatment with xestospongin C and 2-aminoethoxydiphenyl borate,
antagonists of inositol 1,4,5-trisphosphate receptors, abolished the response
to BK. Inhibition of ryanodine receptors reduced the BK-induced Ca2+ increase,
while disruption of lysosomal Ca2+ stores with bafilomycin A1 did not affect the
response. BK produced a dose-dependent depolarization of nucleus ambiguus neurons,
which was prevented by the B2 receptor antagonist. In vivo studies indicate that
microinjection of BK into nucleus ambiguus elicited bradycardia in conscious rats
via B2 receptors. In summary, in cardiac vagal neurons of nucleus ambiguus, BK
activates B2 receptors promoting Ca2+ influx and Ca2+ release from endoplasmic
reticulum, and membrane depolarization; these effects are translated in vivo by
bradycardia.
article_processing_charge: No
article_type: original
author:
- first_name: Eugen
full_name: Brǎiloiu, Eugen
last_name: Brǎiloiu
- first_name: Matthew
full_name: Mcguire, Matthew
last_name: Mcguire
- first_name: Shadaria
full_name: Shuler, Shadaria
last_name: Shuler
- first_name: Elena
full_name: Deliu, Elena
id: 37A40D7E-F248-11E8-B48F-1D18A9856A87
last_name: Deliu
orcid: 0000-0002-7370-5293
- first_name: Jeffrey
full_name: Barr, Jeffrey
last_name: Barr
- first_name: Mary
full_name: Abood, Mary
last_name: Abood
- first_name: Gabriela
full_name: Brailoiu, Gabriela
last_name: Brailoiu
citation:
ama: Brǎiloiu E, Mcguire M, Shuler S, et al. Modulation of cardiac vagal tone by
bradykinin acting on nucleus ambiguus. Neuroscience. 2017;365:23-32. doi:10.1016/j.neuroscience.2017.09.034
apa: Brǎiloiu, E., Mcguire, M., Shuler, S., Deliu, E., Barr, J., Abood, M., &
Brailoiu, G. (2017). Modulation of cardiac vagal tone by bradykinin acting on
nucleus ambiguus. Neuroscience. Elsevier. https://doi.org/10.1016/j.neuroscience.2017.09.034
chicago: Brǎiloiu, Eugen, Matthew Mcguire, Shadaria Shuler, Elena Deliu, Jeffrey
Barr, Mary Abood, and Gabriela Brailoiu. “Modulation of Cardiac Vagal Tone by
Bradykinin Acting on Nucleus Ambiguus.” Neuroscience. Elsevier, 2017. https://doi.org/10.1016/j.neuroscience.2017.09.034.
ieee: E. Brǎiloiu et al., “Modulation of cardiac vagal tone by bradykinin
acting on nucleus ambiguus,” Neuroscience, vol. 365. Elsevier, pp. 23–32,
2017.
ista: Brǎiloiu E, Mcguire M, Shuler S, Deliu E, Barr J, Abood M, Brailoiu G. 2017.
Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus. Neuroscience.
365, 23–32.
mla: Brǎiloiu, Eugen, et al. “Modulation of Cardiac Vagal Tone by Bradykinin Acting
on Nucleus Ambiguus.” Neuroscience, vol. 365, Elsevier, 2017, pp. 23–32,
doi:10.1016/j.neuroscience.2017.09.034.
short: E. Brǎiloiu, M. Mcguire, S. Shuler, E. Deliu, J. Barr, M. Abood, G. Brailoiu,
Neuroscience 365 (2017) 23–32.
date_created: 2018-12-11T11:48:17Z
date_published: 2017-12-04T00:00:00Z
date_updated: 2023-09-27T12:26:59Z
day: '04'
department:
- _id: GaNo
doi: 10.1016/j.neuroscience.2017.09.034
external_id:
isi:
- '000415966200003'
pmid:
- '28951324'
intvolume: ' 365'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5798458
month: '12'
oa: 1
oa_version: Submitted Version
page: 23 - 32
pmid: 1
publication: Neuroscience
publication_identifier:
issn:
- '03064522'
publication_status: published
publisher: Elsevier
publist_id: '6911'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Modulation of cardiac vagal tone by bradykinin acting on nucleus ambiguus
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 365
year: '2017'
...
---
_id: '749'
abstract:
- lang: eng
text: 'Synaptotagmin 7 (Syt7) is thought to be a Ca2+ sensor that mediates asynchronous
transmitter release and facilitation at synapses. However, Syt7 is strongly expressed
in fast-spiking, parvalbumin-expressing GABAergic interneurons, and the output
synapses of these neurons produce only minimal asynchronous release and show depression
rather than facilitation. To resolve this apparent contradiction, we examined
the effects of genetic elimination of Syt7 on synaptic transmission at the GABAergic
basket cell (BC)-Purkinje cell (PC) synapse in cerebellum. Our results indicate
that at the BC-PC synapse, Syt7 contributes to asynchronous release, pool replenishment,
and facilitation. In combination, these three effects ensure efficient transmitter
release during high-frequency activity and guarantee frequency independence of
inhibition. Our results identify a distinct function of Syt7: ensuring the efficiency
of high-frequency inhibitory synaptic transmission'
acknowledged_ssus:
- _id: PreCl
article_processing_charge: No
author:
- first_name: Chong
full_name: Chen, Chong
id: 3DFD581A-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Rachel
full_name: Satterfield, Rachel
last_name: Satterfield
- first_name: Samuel
full_name: Young, Samuel
last_name: Young
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Chen C, Satterfield R, Young S, Jonas PM. Triple function of Synaptotagmin
7 ensures efficiency of high-frequency transmission at central GABAergic synapses.
Cell Reports. 2017;21(8):2082-2089. doi:10.1016/j.celrep.2017.10.122
apa: Chen, C., Satterfield, R., Young, S., & Jonas, P. M. (2017). Triple function
of Synaptotagmin 7 ensures efficiency of high-frequency transmission at central
GABAergic synapses. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.10.122
chicago: Chen, Chong, Rachel Satterfield, Samuel Young, and Peter M Jonas. “Triple
Function of Synaptotagmin 7 Ensures Efficiency of High-Frequency Transmission
at Central GABAergic Synapses.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.10.122.
ieee: C. Chen, R. Satterfield, S. Young, and P. M. Jonas, “Triple function of Synaptotagmin
7 ensures efficiency of high-frequency transmission at central GABAergic synapses,”
Cell Reports, vol. 21, no. 8. Cell Press, pp. 2082–2089, 2017.
ista: Chen C, Satterfield R, Young S, Jonas PM. 2017. Triple function of Synaptotagmin
7 ensures efficiency of high-frequency transmission at central GABAergic synapses.
Cell Reports. 21(8), 2082–2089.
mla: Chen, Chong, et al. “Triple Function of Synaptotagmin 7 Ensures Efficiency
of High-Frequency Transmission at Central GABAergic Synapses.” Cell Reports,
vol. 21, no. 8, Cell Press, 2017, pp. 2082–89, doi:10.1016/j.celrep.2017.10.122.
short: C. Chen, R. Satterfield, S. Young, P.M. Jonas, Cell Reports 21 (2017) 2082–2089.
date_created: 2018-12-11T11:48:18Z
date_published: 2017-11-21T00:00:00Z
date_updated: 2023-09-27T12:26:04Z
day: '21'
ddc:
- '570'
- '571'
department:
- _id: PeJo
doi: 10.1016/j.celrep.2017.10.122
ec_funded: 1
external_id:
isi:
- '000416216700007'
file:
- access_level: open_access
checksum: a6afa3764909bf6edafa07982d8e1cee
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:14Z
date_updated: 2020-07-14T12:47:59Z
file_id: '4737'
file_name: IST-2017-874-v1+1_PIIS2211124717316029.pdf
file_size: 2759195
relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
has_accepted_license: '1'
intvolume: ' 21'
isi: 1
issue: '8'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 2082 - 2089
project:
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glumatergic synapse
publication: Cell Reports
publication_identifier:
issn:
- '22111247'
publication_status: published
publisher: Cell Press
publist_id: '6907'
pubrep_id: '874'
quality_controlled: '1'
related_material:
record:
- id: '324'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Triple function of Synaptotagmin 7 ensures efficiency of high-frequency transmission
at central GABAergic synapses
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 21
year: '2017'
...
---
_id: '750'
abstract:
- lang: eng
text: Modern communication technologies allow first responders to contact thousands
of potential volunteers simultaneously for support during a crisis or disaster
event. However, such volunteer efforts must be well coordinated and monitored,
in order to offer an effective relief to the professionals. In this paper we extend
earlier work on optimally assigning volunteers to selected landmark locations.
In particular, we emphasize the aspect that obtaining good assignments requires
not only advanced computational tools, but also a realistic measure of distance
between volunteers and landmarks. Specifically, we propose the use of the Open
Street Map (OSM) driving distance instead of he previously used flight distance.
We find the OSM driving distance to be better aligned with the interests of volunteers
and first responders. Furthermore, we show that relying on the flying distance
leads to a substantial underestimation of the number of required volunteers, causing
negative side effects in case of an actual crisis situation.
author:
- first_name: Jasmin
full_name: Pielorz, Jasmin
id: 49BC895A-F248-11E8-B48F-1D18A9856A87
last_name: Pielorz
- first_name: Matthias
full_name: Prandtstetter, Matthias
last_name: Prandtstetter
- first_name: Markus
full_name: Straub, Markus
last_name: Straub
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pielorz J, Prandtstetter M, Straub M, Lampert C. Optimal geospatial volunteer
allocation needs realistic distances. In: 2017 IEEE International Conference
on Big Data. IEEE; 2017:3760-3763. doi:10.1109/BigData.2017.8258375'
apa: 'Pielorz, J., Prandtstetter, M., Straub, M., & Lampert, C. (2017). Optimal
geospatial volunteer allocation needs realistic distances. In 2017 IEEE International
Conference on Big Data (pp. 3760–3763). Boston, MA, United States: IEEE. https://doi.org/10.1109/BigData.2017.8258375'
chicago: Pielorz, Jasmin, Matthias Prandtstetter, Markus Straub, and Christoph Lampert.
“Optimal Geospatial Volunteer Allocation Needs Realistic Distances.” In 2017
IEEE International Conference on Big Data, 3760–63. IEEE, 2017. https://doi.org/10.1109/BigData.2017.8258375.
ieee: J. Pielorz, M. Prandtstetter, M. Straub, and C. Lampert, “Optimal geospatial
volunteer allocation needs realistic distances,” in 2017 IEEE International
Conference on Big Data, Boston, MA, United States, 2017, pp. 3760–3763.
ista: Pielorz J, Prandtstetter M, Straub M, Lampert C. 2017. Optimal geospatial
volunteer allocation needs realistic distances. 2017 IEEE International Conference
on Big Data. Big Data, 3760–3763.
mla: Pielorz, Jasmin, et al. “Optimal Geospatial Volunteer Allocation Needs Realistic
Distances.” 2017 IEEE International Conference on Big Data, IEEE, 2017,
pp. 3760–63, doi:10.1109/BigData.2017.8258375.
short: J. Pielorz, M. Prandtstetter, M. Straub, C. Lampert, in:, 2017 IEEE International
Conference on Big Data, IEEE, 2017, pp. 3760–3763.
conference:
end_date: 2017-12-14
location: Boston, MA, United States
name: Big Data
start_date: 2017-12-11
date_created: 2018-12-11T11:48:18Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2021-01-12T08:13:55Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/BigData.2017.8258375
language:
- iso: eng
month: '12'
oa_version: None
page: 3760 - 3763
publication: 2017 IEEE International Conference on Big Data
publication_identifier:
isbn:
- 978-153862714-3
publication_status: published
publisher: IEEE
publist_id: '6906'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optimal geospatial volunteer allocation needs realistic distances
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '751'
abstract:
- lang: eng
text: The basement membrane (BM) is a thin layer of extracellular matrix (ECM) beneath
nearly all epithelial cell types that is critical for cellular and tissue function.
It is composed of numerous components conserved among all bilaterians [1]; however,
it is unknown how all of these components are generated and subsequently constructed
to form a fully mature BM in the living animal. Although BM formation is thought
to simply involve a process of self-assembly [2], this concept suffers from a
number of logistical issues when considering its construction in vivo. First,
incorporation of BM components appears to be hierarchical [3-5], yet it is unclear
whether their production during embryogenesis must also be regulated in a temporal
fashion. Second, many BM proteins are produced not only by the cells residing
on the BM but also by surrounding cell types [6-9], and it is unclear how large,
possibly insoluble protein complexes [10] are delivered into the matrix. Here
we exploit our ability to live image and genetically dissect de novo BM formation
during Drosophila development. This reveals that there is a temporal hierarchy
of BM protein production that is essential for proper component incorporation.
Furthermore, we show that BM components require secretion by migrating macrophages
(hemocytes) during their developmental dispersal, which is critical for embryogenesis.
Indeed, hemocyte migration is essential to deliver a subset of ECM components
evenly throughout the embryo. This reveals that de novo BM construction requires
a combination of both production and distribution logistics allowing for the timely
delivery of core components.
article_processing_charge: No
author:
- first_name: Yutaka
full_name: Matsubayashi, Yutaka
last_name: Matsubayashi
- first_name: Adam
full_name: Louani, Adam
last_name: Louani
- first_name: Anca
full_name: Dragu, Anca
last_name: Dragu
- first_name: Besaiz
full_name: Sanchez Sanchez, Besaiz
last_name: Sanchez Sanchez
- first_name: Eduardo
full_name: Serna Morales, Eduardo
last_name: Serna Morales
- first_name: Lawrence
full_name: Yolland, Lawrence
last_name: Yolland
- first_name: Attila
full_name: György, Attila
id: 3BCEDBE0-F248-11E8-B48F-1D18A9856A87
last_name: György
orcid: 0000-0002-1819-198X
- first_name: Gema
full_name: Vizcay, Gema
last_name: Vizcay
- first_name: Roland
full_name: Fleck, Roland
last_name: Fleck
- first_name: John
full_name: Heddleston, John
last_name: Heddleston
- first_name: Teng
full_name: Chew, Teng
last_name: Chew
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Brian
full_name: Stramer, Brian
last_name: Stramer
citation:
ama: Matsubayashi Y, Louani A, Dragu A, et al. A moving source of matrix components
is essential for De Novo basement membrane formation. Current Biology.
2017;27(22):3526-3534e.4. doi:10.1016/j.cub.2017.10.001
apa: Matsubayashi, Y., Louani, A., Dragu, A., Sanchez Sanchez, B., Serna Morales,
E., Yolland, L., … Stramer, B. (2017). A moving source of matrix components is
essential for De Novo basement membrane formation. Current Biology. Cell
Press. https://doi.org/10.1016/j.cub.2017.10.001
chicago: Matsubayashi, Yutaka, Adam Louani, Anca Dragu, Besaiz Sanchez Sanchez,
Eduardo Serna Morales, Lawrence Yolland, Attila György, et al. “A Moving Source
of Matrix Components Is Essential for De Novo Basement Membrane Formation.” Current
Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.10.001.
ieee: Y. Matsubayashi et al., “A moving source of matrix components is essential
for De Novo basement membrane formation,” Current Biology, vol. 27, no.
22. Cell Press, p. 3526–3534e.4, 2017.
ista: Matsubayashi Y, Louani A, Dragu A, Sanchez Sanchez B, Serna Morales E, Yolland
L, György A, Vizcay G, Fleck R, Heddleston J, Chew T, Siekhaus DE, Stramer B.
2017. A moving source of matrix components is essential for De Novo basement membrane
formation. Current Biology. 27(22), 3526–3534e.4.
mla: Matsubayashi, Yutaka, et al. “A Moving Source of Matrix Components Is Essential
for De Novo Basement Membrane Formation.” Current Biology, vol. 27, no.
22, Cell Press, 2017, p. 3526–3534e.4, doi:10.1016/j.cub.2017.10.001.
short: Y. Matsubayashi, A. Louani, A. Dragu, B. Sanchez Sanchez, E. Serna Morales,
L. Yolland, A. György, G. Vizcay, R. Fleck, J. Heddleston, T. Chew, D.E. Siekhaus,
B. Stramer, Current Biology 27 (2017) 3526–3534e.4.
date_created: 2018-12-11T11:48:18Z
date_published: 2017-11-09T00:00:00Z
date_updated: 2023-09-27T12:25:31Z
day: '09'
ddc:
- '570'
- '576'
department:
- _id: DaSi
doi: 10.1016/j.cub.2017.10.001
external_id:
isi:
- '000415815800031'
file:
- access_level: open_access
checksum: 264cf6c6c3551486ba5ea786850e000a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:45Z
date_updated: 2020-07-14T12:47:59Z
file_id: '4770'
file_name: IST-2017-875-v1+1_1-s2.0-S0960982217312691-main.pdf
file_size: 4770657
relation: main_file
file_date_updated: 2020-07-14T12:47:59Z
has_accepted_license: '1'
intvolume: ' 27'
isi: 1
issue: '22'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 3526 - 3534e.4
publication: Current Biology
publication_identifier:
issn:
- '09609822'
publication_status: published
publisher: Cell Press
publist_id: '6905'
pubrep_id: '875'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A moving source of matrix components is essential for De Novo basement membrane
formation
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 27
year: '2017'
...
---
_id: '459'
abstract:
- lang: eng
text: The social insects bees, wasps, ants, and termites are species-rich, occur
in many habitats, and often constitute a large part of the biomass. Many are also
invasive, including species of termites, the red imported fire ant, and the Argentine
ant. While invasive social insects have been a problem in Southern Europe for
some time, Central Europa was free of invasive ant species until recently because
most ants are adapted to warmer climates. Only in the 1990s, did Lasius neglectus,
a close relative of the common black garden ant, arrive in Germany. First described
in 1990 based on individuals collected in Budapest, the species has since been
detected for example in France, Germany, Spain, England, and Kyrgyzstan. The species
is spread with soil during construction work or plantings, and L. neglectus therefore
is often found in parks and botanical gardens. Another invasive ant now spreading
in southern Germany is Formica fuscocinerea, which occurs along rivers, including
in the sandy floodplains of the river Isar. As is typical of pioneer species,
F. fuscocinerea quickly becomes extremely abundant and therefore causes problems
for example on playgrounds in Munich. All invasive ant species are characterized
by cooperation across nests, leading to strongly interconnected, very large super-colonies.
The resulting dominance results in the extinction of native ant species as well
as other arthropod species and thus in the reduction of biodiversity.
article_processing_charge: No
author:
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Cremer S. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische
Fauna verändern. Rundgespräche Forum Ökologie. 2017;46:105-116.'
apa: 'Cremer, S. (2017). Invasive Ameisen in Europa: Wie sie sich ausbreiten und
die heimische Fauna verändern. Rundgespräche Forum Ökologie. Verlag Dr.
Friedrich Pfeil.'
chicago: 'Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und
Die Heimische Fauna Verändern.” Rundgespräche Forum Ökologie. Verlag Dr.
Friedrich Pfeil, 2017.'
ieee: 'S. Cremer, “Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische
Fauna verändern,” Rundgespräche Forum Ökologie, vol. 46. Verlag Dr. Friedrich
Pfeil, pp. 105–116, 2017.'
ista: 'Cremer S. 2017. Invasive Ameisen in Europa: Wie sie sich ausbreiten und die
heimische Fauna verändern. Rundgespräche Forum Ökologie. 46, 105–116.'
mla: 'Cremer, Sylvia. “Invasive Ameisen in Europa: Wie Sie Sich Ausbreiten Und Die
Heimische Fauna Verändern.” Rundgespräche Forum Ökologie, vol. 46, Verlag
Dr. Friedrich Pfeil, 2017, pp. 105–16.'
short: S. Cremer, Rundgespräche Forum Ökologie 46 (2017) 105–116.
date_created: 2018-12-11T11:46:35Z
date_published: 2017-04-04T00:00:00Z
date_updated: 2023-10-17T12:28:13Z
day: '04'
ddc:
- '592'
department:
- _id: SyCr
file:
- access_level: open_access
checksum: 4919baf9050415ca151fe22497379f78
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:52Z
date_updated: 2020-07-14T12:46:32Z
file_id: '5175'
file_name: IST-2018-962-v1+1_044676698_07_Cremer__Invasive_Ameisen_in_Europa_...__BY-ND_.pdf
file_size: 1711131
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 46'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '04'
oa: 1
oa_version: Published Version
page: 105 - 116
publication: Rundgespräche Forum Ökologie
publication_identifier:
issn:
- 2366-2875
publication_status: published
publisher: Verlag Dr. Friedrich Pfeil
publist_id: '7362'
pubrep_id: '962'
quality_controlled: '1'
status: public
title: 'Invasive Ameisen in Europa: Wie sie sich ausbreiten und die heimische Fauna
verändern'
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 46
year: '2017'
...
---
_id: '463'
abstract:
- lang: eng
text: We investigate transient behaviors induced by magnetic fields on the dynamics
of the flow of a ferrofluid in the gap between two concentric, independently rotating
cylinders. Without applying any magnetic fields, we uncover emergence of flow
states constituted by a combination of a localized spiral state (SPIl) in the
top and bottom of the annulus and different multi-cell flow states (SPI2v, SPI3v)
with toroidally closed vortices in the interior of the bulk (SPIl+2v = SPIl +
SPI2v and SPIl+3v = SPIl + SPI3v). However, when a magnetic field is presented,
we observe the transient behaviors between multi-cell states passing through two
critical thresholds in a strength of an axial (transverse) magnetic field. Before
the first critical threshold of a magnetic field strength, multi-stable states
with different number of cells could be observed. After the first critical threshold,
we find the transient behavior between the three- and two-cell flow states. For
more strength of magnetic field or after the second critical threshold, we discover
that multi-cell states are disappeared and a localized spiral state remains to
be stimulated. The studied transient behavior could be understood by the investigation
of various quantities including a modal kinetic energy, a mode amplitude of the
radial velocity, wavenumber, angular momentum, and torque. In addition, the emergence
of new flow states and the transient behavior between their states in ferrofluidic
flows indicate that richer and potentially controllable dynamics through magnetic
fields could be possible in ferrofluic flow.
article_number: '113112'
article_processing_charge: No
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: Soorok
full_name: Ryu, Soorok
last_name: Ryu
citation:
ama: Altmeyer S, Do Y, Ryu S. Transient behavior between multi-cell flow states
in ferrofluidic Taylor-Couette flow. Chaos. 2017;27(11). doi:10.1063/1.5002771
apa: Altmeyer, S., Do, Y., & Ryu, S. (2017). Transient behavior between multi-cell
flow states in ferrofluidic Taylor-Couette flow. Chaos. AIP Publishing.
https://doi.org/10.1063/1.5002771
chicago: Altmeyer, Sebastian, Younghae Do, and Soorok Ryu. “Transient Behavior between
Multi-Cell Flow States in Ferrofluidic Taylor-Couette Flow.” Chaos. AIP
Publishing, 2017. https://doi.org/10.1063/1.5002771.
ieee: S. Altmeyer, Y. Do, and S. Ryu, “Transient behavior between multi-cell flow
states in ferrofluidic Taylor-Couette flow,” Chaos, vol. 27, no. 11. AIP
Publishing, 2017.
ista: Altmeyer S, Do Y, Ryu S. 2017. Transient behavior between multi-cell flow
states in ferrofluidic Taylor-Couette flow. Chaos. 27(11), 113112.
mla: Altmeyer, Sebastian, et al. “Transient Behavior between Multi-Cell Flow States
in Ferrofluidic Taylor-Couette Flow.” Chaos, vol. 27, no. 11, 113112, AIP
Publishing, 2017, doi:10.1063/1.5002771.
short: S. Altmeyer, Y. Do, S. Ryu, Chaos 27 (2017).
date_created: 2018-12-11T11:46:37Z
date_published: 2017-11-01T00:00:00Z
date_updated: 2024-02-28T13:02:12Z
day: '01'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1063/1.5002771
file:
- access_level: open_access
checksum: 0731f9d416760c1062db258ca51f8bdc
content_type: application/pdf
creator: dernst
date_created: 2019-10-24T15:14:30Z
date_updated: 2020-07-14T12:46:32Z
file_id: '6970'
file_name: 2017_Chaos_Altmeyer.pdf
file_size: 7714020
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 27'
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: Chaos
publication_identifier:
issn:
- '10541500'
publication_status: published
publisher: AIP Publishing
publist_id: '7358'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Transient behavior between multi-cell flow states in ferrofluidic Taylor-Couette
flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2017'
...
---
_id: '464'
abstract:
- lang: eng
text: The computation of the winning set for parity objectives and for Streett objectives
in graphs as well as in game graphs are central problems in computer-aided verification,
with application to the verification of closed systems with strong fairness conditions,
the verification of open systems, checking interface compatibility, well-formedness
of specifications, and the synthesis of reactive systems. We show how to compute
the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives
in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs
in time O(n2+nklogn). For both problems this gives faster algorithms for dense
graphs and represents the first improvement in asymptotic running time in 15 years.
article_number: '26'
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: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity
and Streett objectives. Logical Methods in Computer Science. 2017;13(3).
doi:10.23638/LMCS-13(3:26)2017
apa: Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms
for parity and Streett objectives. Logical Methods in Computer Science.
International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017
chicago: Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer.
“Improved Algorithms for Parity and Streett Objectives.” Logical Methods in
Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.
ieee: K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms
for parity and Streett objectives,” Logical Methods in Computer Science,
vol. 13, no. 3. International Federation of Computational Logic, 2017.
ista: Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for
parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.
mla: Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett
Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International
Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.
short: K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer
Science 13 (2017).
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-26T00:00:00Z
date_updated: 2025-06-02T08:53:41Z
day: '26'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(3:26)2017
ec_funded: 1
external_id:
arxiv:
- '1410.0833'
file:
- access_level: open_access
checksum: 12d469ae69b80361333d7dead965cf5d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:27Z
date_updated: 2020-07-14T12:46:32Z
file_id: '5010'
file_name: IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf
file_size: 582940
relation: main_file
file_date_updated: 2020-07-14T12:46:32Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
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: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- 1860-5974
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7357'
pubrep_id: '956'
quality_controlled: '1'
related_material:
record:
- id: '1661'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Improved algorithms for parity and Streett objectives
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '465'
abstract:
- lang: eng
text: 'The edit distance between two words w 1 , w 2 is the minimal number of word
operations (letter insertions, deletions, and substitutions) necessary to transform
w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the
edit distance from L 1 to L 2 is the minimal number k such that for every word
from L 1 there exists a word in L 2 with edit distance at most k . We study the
edit distance computation problem between pushdown automata and their subclasses.
The problem of computing edit distance to a pushdown automaton is undecidable,
and in practice, the interesting question is to compute the edit distance from
a pushdown automaton (the implementation, a standard model for programs with recursion)
to a regular language (the specification). In this work, we present a complete
picture of decidability and complexity for the following problems: (1) deciding
whether, for a given threshold k , the edit distance from a pushdown automaton
to a finite automaton is at most k , and (2) deciding whether the edit distance
from a pushdown automaton to a finite automaton is finite. '
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- 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: Jan
full_name: Otop, Jan
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown
automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017
apa: Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017).
Edit distance for pushdown automata. Logical Methods in Computer Science.
International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science.
International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance
for pushdown automata,” Logical Methods in Computer Science, vol. 13, no.
3. International Federation of Computational Logic, 2017.
ista: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for
pushdown automata. Logical Methods in Computer Science. 13(3).
mla: Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical
Methods in Computer Science, vol. 13, no. 3, International Federation of Computational
Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods
in Computer Science 13 (2017).
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-13T00:00:00Z
date_updated: 2023-02-23T12:26:25Z
day: '13'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.23638/LMCS-13(3:23)2017
ec_funded: 1
file:
- access_level: open_access
checksum: 08041379ba408d40664f449eb5907a8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:37Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5090'
file_name: IST-2015-321-v1+1_main.pdf
file_size: 279071
relation: main_file
- access_level: open_access
checksum: 08041379ba408d40664f449eb5907a8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:38Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5091'
file_name: IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf
file_size: 279071
relation: main_file
file_date_updated: 2020-07-14T12:46:33Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- '18605974'
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7356'
pubrep_id: '955'
quality_controlled: '1'
related_material:
record:
- id: '1610'
relation: earlier_version
status: public
- id: '5438'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Edit distance for pushdown automata
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '466'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. There exist two different views: (i) the expectation
semantics, where the goal is to optimize the expected mean-payoff objective, and
(ii) the satisfaction semantics, where the goal is to maximize the probability
of runs such that the mean-payoff value stays above a given vector. We consider
optimization with respect to both objectives at once, thus unifying the existing
semantics. Precisely, the goal is to optimize the expectation while ensuring the
satisfaction constraint. Our problem captures the notion of optimization with
respect to strategies that are risk-averse (i.e., ensure certain probabilistic
guarantee). Our main results are as follows: First, we present algorithms for
the decision problems which are always polynomial in the size of the MDP. We also
show that an approximation of the Pareto-curve can be computed in time polynomial
in the size of the MDP, and the approximation factor, but exponential in the number
of dimensions. Second, we present a complete characterization of the strategy
complexity (in terms of memory bounds and randomization) required to solve our
problem. '
article_number: '15'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Zuzana
full_name: Křetínská, Zuzana
last_name: Křetínská
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff
objectives in Markov decision processes. Logical Methods in Computer Science.
2017;13(2). doi:10.23638/LMCS-13(2:15)2017
apa: Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views
on multiple mean-payoff objectives in Markov decision processes. Logical Methods
in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017
chicago: Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical
Methods in Computer Science. International Federation of Computational Logic,
2017. https://doi.org/10.23638/LMCS-13(2:15)2017.
ieee: K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple
mean-payoff objectives in Markov decision processes,” Logical Methods in Computer
Science, vol. 13, no. 2. International Federation of Computational Logic,
2017.
ista: Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple
mean-payoff objectives in Markov decision processes. Logical Methods in Computer
Science. 13(2), 15.
mla: Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes.” Logical Methods in Computer Science,
vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.
short: K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science
13 (2017).
date_created: 2018-12-11T11:46:38Z
date_published: 2017-07-03T00:00:00Z
date_updated: 2023-02-23T12:26:16Z
day: '03'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.23638/LMCS-13(2:15)2017
ec_funded: 1
file:
- access_level: open_access
checksum: bfa405385ec6229ad5ead89ab5751639
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:32Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5354'
file_name: IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf
file_size: 511832
relation: main_file
file_date_updated: 2020-07-14T12:46:33Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '2'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _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: 2590DB08-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '701309'
name: Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes
(H2020)
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- '18605974'
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '7355'
pubrep_id: '957'
quality_controlled: '1'
related_material:
record:
- id: '1657'
relation: earlier_version
status: public
- id: '5429'
relation: earlier_version
status: public
- id: '5435'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '467'
abstract:
- lang: eng
text: Recently there has been a significant effort to handle quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, some basic system properties such as average
response time cannot be expressed using weighted automata or in any other known
decidable formalism. In this work, we introduce nested weighted automata as a
natural extension of weighted automata, which makes it possible to express important
quantitative properties such as average response time. In nested weighted automata,
a master automaton spins off and collects results from weighted slave automata,
each of which computes a quantity along a finite portion of an infinite word.
Nested weighted automata can be viewed as the quantitative analogue of monitor
automata, which are used in runtime verification. We establish an almost-complete
decidability picture for the basic decision problems about nested weighted automata
and illustrate their applicability in several domains. In particular, nested weighted
automata can be used to decide average response time properties.
article_number: '31'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions
on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata.
ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM
Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.
ista: Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions
on Computational Logic (TOCL). 18(4), 31.
mla: Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions
on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
short: K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational
Logic (TOCL) 18 (2017).
date_created: 2018-12-11T11:46:38Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2023-02-23T12:26:19Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3152769
ec_funded: 1
external_id:
arxiv:
- '1606.03598'
intvolume: ' 18'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.03598
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _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 Transactions on Computational Logic (TOCL)
publication_identifier:
issn:
- '15293785'
publication_status: published
publisher: ACM
publist_id: '7354'
quality_controlled: '1'
related_material:
record:
- id: '1656'
relation: earlier_version
status: public
- id: '5415'
relation: earlier_version
status: public
- id: '5436'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Nested weighted automata
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2017'
...
---
_id: '470'
abstract:
- lang: eng
text: This paper presents a method for simulating water surface waves as a displacement
field on a 2D domain. Our method relies on Lagrangian particles that carry packets
of water wave energy; each packet carries information about an entire group of
wave trains, as opposed to only a single wave crest. Our approach is unconditionally
stable and can simulate high resolution geometric details. This approach also
presents a straightforward interface for artistic control, because it is essentially
a particle system with intuitive parameters like wavelength and amplitude. Our
implementation parallelizes well and runs in real time for moderately challenging
scenarios.
acknowledged_ssus:
- _id: ScienComp
article_number: '103'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics.
2017;36(4). doi:10.1145/3072959.3073678
apa: Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions
on Graphics. ACM. https://doi.org/10.1145/3072959.3073678
chicago: Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions
on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678.
ieee: S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics,
vol. 36, no. 4. ACM, 2017.
ista: Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics.
36(4), 103.
mla: Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions
on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.
short: S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).
date_created: 2018-12-11T11:46:39Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-02-23T12:20:26Z
day: '01'
ddc:
- '006'
department:
- _id: ChWo
doi: 10.1145/3072959.3073678
ec_funded: 1
file:
- access_level: open_access
checksum: 82a3b2bfeee4ddef16ecc21675d1a48a
content_type: application/pdf
creator: wojtan
date_created: 2020-01-24T09:32:35Z
date_updated: 2020-07-14T12:46:34Z
file_id: '7359'
file_name: wavepackets_final.pdf
file_size: 13131683
relation: main_file
file_date_updated: 2020-07-14T12:46:34Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- '07300301'
publication_status: published
publisher: ACM
publist_id: '7350'
quality_controlled: '1'
scopus_import: 1
status: public
title: Water wave packets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2017'
...
---
_id: '471'
abstract:
- lang: eng
text: 'We present a new algorithm for the statistical model checking of Markov chains
with respect to unbounded temporal properties, including full linear temporal
logic. The main idea is that we monitor each simulation run on the fly, in order
to detect quickly if a bottom strongly connected component is entered with high
probability, in which case the simulation run can be terminated early. As a result,
our simulation runs are often much shorter than required by termination bounds
that are computed a priori for a desired level of confidence on a large state
space. In comparison to previous algorithms for statistical model checking our
method is not only faster in many cases but also requires less information about
the system, namely, only the minimum transition probability that occurs in the
Markov chain. In addition, our method can be generalised to unbounded quantitative
properties such as mean-payoff bounds. '
article_number: '12'
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking
for unbounded temporal properties. ACM Transactions on Computational Logic
(TOCL). 2017;18(2). doi:10.1145/3060139
apa: Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster
statistical model checking for unbounded temporal properties. ACM Transactions
on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139
chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov.
“Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM
Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139.
ieee: P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical
model checking for unbounded temporal properties,” ACM Transactions on Computational
Logic (TOCL), vol. 18, no. 2. ACM, 2017.
ista: Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model
checking for unbounded temporal properties. ACM Transactions on Computational
Logic (TOCL). 18(2), 12.
mla: Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal
Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no.
2, 12, ACM, 2017, doi:10.1145/3060139.
short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational
Logic (TOCL) 18 (2017).
date_created: 2018-12-11T11:46:39Z
date_published: 2017-05-01T00:00:00Z
date_updated: 2023-02-21T16:48:11Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/3060139
ec_funded: 1
intvolume: ' 18'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.05739
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _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
publication: ACM Transactions on Computational Logic (TOCL)
publication_identifier:
issn:
- '15293785'
publication_status: published
publisher: ACM
publist_id: '7349'
quality_controlled: '1'
related_material:
record:
- id: '1234'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Faster statistical model checking for unbounded temporal properties
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2017'
...
---
_id: '481'
abstract:
- lang: eng
text: We introduce planar matchings on directed pseudo-line arrangements, which
yield a planar set of pseudo-line segments such that only matching-partners are
adjacent. By translating the planar matching problem into a corresponding stable
roommates problem we show that such matchings always exist. Using our new framework,
we establish, for the first time, a complete, rigorous definition of weighted
straight skeletons, which are based on a so-called wavefront propagation process.
We present a generalized and unified approach to treat structural changes in the
wavefront that focuses on the restoration of weak planarity by finding planar
matchings.
acknowledgement: 'Supported by NSERC and the Ross and Muriel Cheriton Fellowship.
Research supported by Austrian Science Fund (FWF): P25816-N15.'
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- 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
citation:
ama: Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons.
International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229.
doi:10.1142/S0218195916600050
apa: Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted
straight skeletons. International Journal of Computational Geometry and Applications.
World Scientific Publishing. https://doi.org/10.1142/S0218195916600050
chicago: Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for
Weighted Straight Skeletons.” International Journal of Computational Geometry
and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050.
ieee: T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight
skeletons,” International Journal of Computational Geometry and Applications,
vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.
ista: Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight
skeletons. International Journal of Computational Geometry and Applications. 26(3–4),
211–229.
mla: Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”
International Journal of Computational Geometry and Applications, vol.
26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.
short: T. Biedl, S. Huber, P. Palfrader, International Journal of Computational
Geometry and Applications 26 (2017) 211–229.
date_created: 2018-12-11T11:46:43Z
date_published: 2017-04-13T00:00:00Z
date_updated: 2023-02-21T16:06:22Z
day: '13'
ddc:
- '004'
- '514'
- '516'
department:
- _id: HeEd
doi: 10.1142/S0218195916600050
file:
- access_level: open_access
checksum: f79e8558bfe4b368dfefeb8eec2e3a5e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:34Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4758'
file_name: IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf
file_size: 769296
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 26'
issue: 3-4
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 211 - 229
publication: International Journal of Computational Geometry and Applications
publication_status: published
publisher: World Scientific Publishing
publist_id: '7338'
pubrep_id: '949'
quality_controlled: '1'
related_material:
record:
- id: '10892'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Planar matchings for weighted straight skeletons
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2017'
...
---
_id: '483'
abstract:
- lang: eng
text: We prove the universality for the eigenvalue gap statistics in the bulk of
the spectrum for band matrices, in the regime where the band width is comparable
with the dimension of the matrix, W ~ N. All previous results concerning universality
of non-Gaussian random matrices are for mean-field models. By relying on a new
mean-field reduction technique, we deduce universality from quantum unique ergodicity
for band matrices.
author:
- first_name: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
- first_name: Jun
full_name: Yin, Jun
last_name: Yin
citation:
ama: Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band
matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800.
doi:10.4310/ATMP.2017.v21.n3.a5
apa: Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a
class of random band matrices. Advances in Theoretical and Mathematical Physics.
International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5
chicago: Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for
a Class of Random Band Matrices.” Advances in Theoretical and Mathematical
Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.
ieee: P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random
band matrices,” Advances in Theoretical and Mathematical Physics, vol.
21, no. 3. International Press, pp. 739–800, 2017.
ista: Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random
band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.
mla: Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.”
Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International
Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.
short: P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical
Physics 21 (2017) 739–800.
date_created: 2018-12-11T11:46:43Z
date_published: 2017-08-25T00:00:00Z
date_updated: 2021-01-12T08:00:57Z
day: '25'
department:
- _id: LaEr
doi: 10.4310/ATMP.2017.v21.n3.a5
ec_funded: 1
intvolume: ' 21'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1602.02312
month: '08'
oa: 1
oa_version: Submitted Version
page: 739 - 800
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Advances in Theoretical and Mathematical Physics
publication_identifier:
issn:
- '10950761'
publication_status: published
publisher: International Press
publist_id: '7337'
quality_controlled: '1'
scopus_import: 1
status: public
title: Universality for a class of random band matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2017'
...
---
_id: '484'
abstract:
- lang: eng
text: We consider the dynamics of a large quantum system of N identical bosons in
3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed
0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution
in the Nparticle Hilbert space. The leading order behaviour of the dynamics is
determined by Hartree theory while the second order is given by Bogoliubov theory.
author:
- first_name: Phan
full_name: Nam, Phan
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Nam
- first_name: Marcin M
full_name: Napiórkowski, Marcin M
id: 4197AD04-F248-11E8-B48F-1D18A9856A87
last_name: Napiórkowski
citation:
ama: Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of
interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738.
doi:10.4310/ATMP.2017.v21.n3.a4
apa: Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field
dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics.
International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4
chicago: Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field
Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics.
International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.
ieee: P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics
of interacting bosons,” Advances in Theoretical and Mathematical Physics,
vol. 21, no. 3. International Press, pp. 683–738, 2017.
ista: Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics
of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3),
683–738.
mla: Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field
Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics,
vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.
short: P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics
21 (2017) 683–738.
date_created: 2018-12-11T11:46:43Z
date_published: 2017-01-01T00:00:00Z
date_updated: 2021-01-12T08:00:58Z
day: '01'
department:
- _id: RoSe
doi: 10.4310/ATMP.2017.v21.n3.a4
ec_funded: 1
intvolume: ' 21'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1509.04631
month: '01'
oa: 1
oa_version: Submitted Version
page: 683 - 738
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25C878CE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27533_N27
name: Structure of the Excitation Spectrum for Many-Body Quantum Systems
publication: Advances in Theoretical and Mathematical Physics
publication_identifier:
issn:
- '10950761'
publication_status: published
publisher: International Press
publist_id: '7336'
quality_controlled: '1'
scopus_import: 1
status: public
title: Bogoliubov correction to the mean-field dynamics of interacting bosons
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2017'
...
---
_id: '485'
abstract:
- lang: eng
text: We present results on nonlinear electro-optical conversion of microwave radiation
into the optical telecommunication band with more than 0.1% photon number conversion
efficiency with MHz bandwidth, in a crystalline whispering gallery mode resonator
article_number: NM3A.1
article_processing_charge: No
author:
- first_name: Alfredo R
full_name: Rueda Sanchez, Alfredo R
id: 3B82B0F8-F248-11E8-B48F-1D18A9856A87
last_name: Rueda Sanchez
orcid: 0000-0001-6249-5860
- 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 Sanchez AR, Sedlmeir F, Collodo M, et al. Single sideband microwave
to optical photon conversion-an-electro-optic-realization. In: Optics InfoBase
Conference Papers. Vol F54. Optica Publishing Group; 2017. doi:10.1364/NLO.2017.NM3A.1'
apa: 'Rueda Sanchez, A. R., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk,
G., … Schwefel, H. (2017). Single sideband microwave to optical photon conversion-an-electro-optic-realization.
In Optics InfoBase Conference Papers (Vol. F54). Waikoloa, HI, United States:
Optica Publishing Group. https://doi.org/10.1364/NLO.2017.NM3A.1'
chicago: Rueda Sanchez, Alfredo R, Florian Sedlmeir, Michele Collodo, Ulrich Vogl,
Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Single Sideband Microwave
to Optical Photon Conversion-an-Electro-Optic-Realization.” In Optics InfoBase
Conference Papers, Vol. F54. Optica Publishing Group, 2017. https://doi.org/10.1364/NLO.2017.NM3A.1.
ieee: A. R. Rueda Sanchez et al., “Single sideband microwave to optical photon
conversion-an-electro-optic-realization,” in Optics InfoBase Conference Papers,
Waikoloa, HI, United States, 2017, vol. F54.
ista: 'Rueda Sanchez AR, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov
D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2017. Single sideband
microwave to optical photon conversion-an-electro-optic-realization. Optics InfoBase
Conference Papers. NLO: Nonlinear Optics vol. F54, NM3A.1.'
mla: Rueda Sanchez, Alfredo R., et al. “Single Sideband Microwave to Optical Photon
Conversion-an-Electro-Optic-Realization.” Optics InfoBase Conference Papers,
vol. F54, NM3A.1, Optica Publishing Group, 2017, doi:10.1364/NLO.2017.NM3A.1.
short: A.R. Rueda Sanchez, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk,
D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:,
Optics InfoBase Conference Papers, Optica Publishing Group, 2017.
conference:
end_date: 2017-07-21
location: Waikoloa, HI, United States
name: 'NLO: Nonlinear Optics'
start_date: 2017-07-17
date_created: 2018-12-11T11:46:44Z
date_published: 2017-07-01T00:00:00Z
date_updated: 2023-10-17T12:15:38Z
day: '01'
department:
- _id: JoFi
doi: 10.1364/NLO.2017.NM3A.1
language:
- iso: eng
month: '07'
oa_version: None
publication: Optics InfoBase Conference Papers
publication_identifier:
isbn:
- 978-155752820-9
publication_status: published
publisher: Optica Publishing Group
publist_id: '7335'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single sideband microwave to optical photon conversion-an-electro-optic-realization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: F54
year: '2017'
...
---
_id: '486'
abstract:
- lang: eng
text: Color texture reproduction in 3D printing commonly ignores volumetric light
transport (cross-talk) between surface points on a 3D print. Such light diffusion
leads to significant blur of details and color bleeding, and is particularly severe
for highly translucent resin-based print materials. Given their widely varying
scattering properties, this cross-talk between surface points strongly depends
on the internal structure of the volume surrounding each surface point. Existing
scattering-aware methods use simplified models for light diffusion, and often
accept the visual blur as an immutable property of the print medium. In contrast,
our work counteracts heterogeneous scattering to obtain the impression of a crisp
albedo texture on top of the 3D print, by optimizing for a fully volumetric material
distribution that preserves the target appearance. Our method employs an efficient
numerical optimizer on top of a general Monte-Carlo simulation of heterogeneous
scattering, supported by a practical calibration procedure to obtain scattering
parameters from a given set of printer materials. Despite the inherent translucency
of the medium, we reproduce detailed surface textures on 3D prints. We evaluate
our system using a commercial, five-tone 3D print process and compare against
the printer’s native color texturing mode, demonstrating that our method preserves
high-frequency features well without having to compromise on color gamut.
article_number: '241'
article_processing_charge: No
article_type: original
author:
- first_name: Oskar
full_name: Elek, Oskar
last_name: Elek
- first_name: Denis
full_name: Sumin, Denis
last_name: Sumin
- first_name: Ran
full_name: Zhang, Ran
id: 4DDBCEB0-F248-11E8-B48F-1D18A9856A87
last_name: Zhang
orcid: 0000-0002-3808-281X
- first_name: Tim
full_name: Weyrich, Tim
last_name: Weyrich
- first_name: Karol
full_name: Myszkowski, Karol
last_name: Myszkowski
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Alexander
full_name: Wilkie, Alexander
last_name: Wilkie
- first_name: Jaroslav
full_name: Krivanek, Jaroslav
last_name: Krivanek
citation:
ama: Elek O, Sumin D, Zhang R, et al. Scattering-aware texture reproduction for
3D printing. ACM Transactions on Graphics. 2017;36(6). doi:10.1145/3130800.3130890
apa: Elek, O., Sumin, D., Zhang, R., Weyrich, T., Myszkowski, K., Bickel, B., …
Krivanek, J. (2017). Scattering-aware texture reproduction for 3D printing. ACM
Transactions on Graphics. ACM. https://doi.org/10.1145/3130800.3130890
chicago: Elek, Oskar, Denis Sumin, Ran Zhang, Tim Weyrich, Karol Myszkowski, Bernd
Bickel, Alexander Wilkie, and Jaroslav Krivanek. “Scattering-Aware Texture Reproduction
for 3D Printing.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3130800.3130890.
ieee: O. Elek et al., “Scattering-aware texture reproduction for 3D printing,”
ACM Transactions on Graphics, vol. 36, no. 6. ACM, 2017.
ista: Elek O, Sumin D, Zhang R, Weyrich T, Myszkowski K, Bickel B, Wilkie A, Krivanek
J. 2017. Scattering-aware texture reproduction for 3D printing. ACM Transactions
on Graphics. 36(6), 241.
mla: Elek, Oskar, et al. “Scattering-Aware Texture Reproduction for 3D Printing.”
ACM Transactions on Graphics, vol. 36, no. 6, 241, ACM, 2017, doi:10.1145/3130800.3130890.
short: O. Elek, D. Sumin, R. Zhang, T. Weyrich, K. Myszkowski, B. Bickel, A. Wilkie,
J. Krivanek, ACM Transactions on Graphics 36 (2017).
date_created: 2018-12-11T11:46:44Z
date_published: 2017-11-20T00:00:00Z
date_updated: 2023-09-07T13:11:15Z
day: '20'
ddc:
- '003'
- '000'
- '005'
department:
- _id: BeBi
doi: 10.1145/3130800.3130890
ec_funded: 1
file:
- access_level: open_access
checksum: 48386fa6956c3645fc89594dc898b147
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:46Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4836'
file_name: IST-2018-1052-v1+1_ElekSumin2017SGA.pdf
file_size: 107349827
relation: main_file
- access_level: open_access
checksum: 21c89c28fb8d70f6602f752bf997aa0f
content_type: application/pdf
creator: bbickel
date_created: 2019-12-16T14:48:57Z
date_updated: 2020-07-14T12:46:35Z
file_id: '7189'
file_name: ElekSumin2017SGA_reduced_file_size.pdf
file_size: 4683145
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 2508E324-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '642841'
name: Distributed 3D Object Design
- _id: 24F9549A-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '715767'
name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and
Modeling'
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- '07300301'
publication_status: published
publisher: ACM
publist_id: '7334'
pubrep_id: '1052'
quality_controlled: '1'
related_material:
record:
- id: '8386'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Scattering-aware texture reproduction for 3D printing
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2017'
...
---
_id: '487'
abstract:
- lang: eng
text: In this paper we study network architecture for unlicensed cellular networking
for outdoor coverage in TV white spaces. The main technology proposed for TV white
spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af
is originally designed for improved indoor propagation. We show that long links,
typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed
terminal, and significantly reduce its efficiency. Instead, we propose CellFi,
an alternative architecture based on LTE. LTE is designed for long-range coverage
and throughput efficiency, but it is also designed to operate in tightly controlled
and centrally managed networks. CellFi overcomes these problems by designing an
LTE-compatible spectrum database component, mandatory for TV white space networking,
and introducing an interference management component for distributed coordination.
CellFi interference management is compatible with existing LTE mechanisms, requires
no explicit communication between base stations, and is more efficient than CSMA
for long links. We evaluate our design through extensive real world evaluation
on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af,
it increases coverage by 40% and reduces median flow completion times by 2.3x.
author:
- first_name: Ghufran
full_name: Baig, Ghufran
last_name: Baig
- first_name: Bozidar
full_name: Radunovic, Bozidar
last_name: Radunovic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Matthew
full_name: Balkwill, Matthew
last_name: Balkwill
- first_name: Thomas
full_name: Karagiannis, Thomas
last_name: Karagiannis
- first_name: Lili
full_name: Qiu, Lili
last_name: Qiu
citation:
ama: 'Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards
unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017
13th International Conference on Emerging Networking EXperiments and Technologies.
ACM; 2017:2-14. doi:10.1145/3143361.3143367'
apa: 'Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., &
Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings
of the 2017 13th International Conference on emerging Networking EXperiments and
Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367'
chicago: Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill,
Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV
White Spaces.” In Proceedings of the 2017 13th International Conference on
Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367.
ieee: G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L.
Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings
of the 2017 13th International Conference on emerging Networking EXperiments and
Technologies, Incheon, South Korea, 2017, pp. 2–14.
ista: 'Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017.
Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017
13th International Conference on emerging Networking EXperiments and Technologies.
CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.'
mla: Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.”
Proceedings of the 2017 13th International Conference on Emerging Networking
EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.
short: G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu,
in:, Proceedings of the 2017 13th International Conference on Emerging Networking
EXperiments and Technologies, ACM, 2017, pp. 2–14.
conference:
end_date: 2017-12-15
location: Incheon, South Korea
name: 'CoNEXT: Conference on emerging Networking EXperiments and Technologies'
start_date: 2017-12-12
date_created: 2018-12-11T11:46:45Z
date_published: 2017-11-28T00:00:00Z
date_updated: 2023-02-23T12:21:11Z
day: '28'
department:
- _id: DaAl
doi: 10.1145/3143361.3143367
language:
- iso: eng
month: '11'
oa_version: None
page: 2 - 14
publication: Proceedings of the 2017 13th International Conference on emerging Networking
EXperiments and Technologies
publication_identifier:
isbn:
- 978-145035422-6
publication_status: published
publisher: ACM
publist_id: '7333'
quality_controlled: '1'
scopus_import: 1
status: public
title: Towards unlicensed cellular networks in TV white spaces
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2017'
...
---
_id: '512'
abstract:
- lang: eng
text: 'The fixation probability is the probability that a new mutant introduced
in a homogeneous population eventually takes over the entire population. The fixation
probability is a fundamental quantity of natural selection, and known to depend
on the population structure. Amplifiers of natural selection are population structures
which increase the fixation probability of advantageous mutants, as compared to
the baseline case of well-mixed populations. In this work we focus on symmetric
population structures represented as undirected graphs. In the regime of undirected
graphs, the strongest amplifier known has been the Star graph, and the existence
of undirected graphs with stronger amplification properties has remained open
for over a decade. In this work we present the Comet and Comet-swarm families
of undirected graphs. We show that for a range of fitness values of the mutants,
the Comet and Cometswarm graphs have fixation probability strictly larger than
the fixation probability of the Star graph, for fixed population size and at the
limit of large populations, respectively. '
article_number: '82'
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected
population structures: Comets beat stars. Scientific Reports. 2017;7(1).
doi:10.1038/s41598-017-00107-w'
apa: 'Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification
on undirected population structures: Comets beat stars. Scientific Reports.
Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w'
chicago: 'Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.”
Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.'
ieee: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification
on undirected population structures: Comets beat stars,” Scientific Reports,
vol. 7, no. 1. Nature Publishing Group, 2017.'
ista: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on
undirected population structures: Comets beat stars. Scientific Reports. 7(1),
82.'
mla: 'Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures:
Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing
Group, 2017, doi:10.1038/s41598-017-00107-w.'
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports
7 (2017).
date_created: 2018-12-11T11:46:53Z
date_published: 2017-03-06T00:00:00Z
date_updated: 2023-02-23T12:26:57Z
day: '06'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1038/s41598-017-00107-w
ec_funded: 1
file:
- access_level: open_access
checksum: 7d05cbdd914e194a019c0f91fb64e9a8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:35Z
date_updated: 2020-07-14T12:46:36Z
file_id: '5357'
file_name: IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf
file_size: 1536783
relation: main_file
file_date_updated: 2020-07-14T12:46:36Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
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'
publication: Scientific Reports
publication_identifier:
issn:
- '20452322'
publication_status: published
publisher: Nature Publishing Group
publist_id: '7307'
pubrep_id: '938'
quality_controlled: '1'
related_material:
record:
- id: '5449'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Amplification on undirected population structures: Comets beat stars'
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: 7
year: '2017'
...
---
_id: '513'
abstract:
- lang: eng
text: 'We present an experimental setup that creates a shear flow with zero mean
advection velocity achieved by counterbalancing the nonzero streamwise pressure
gradient by moving boundaries, which generates plane Couette-Poiseuille flow.
We obtain experimental results in the transitional regime for this flow. Using
flow visualization, we characterize the subcritical transition to turbulence in
Couette-Poiseuille flow and show the existence of turbulent spots generated by
a permanent perturbation. Due to the zero mean advection velocity of the base
profile, these turbulent structures are nearly stationary. We distinguish two
regions of the turbulent spot: the active turbulent core, which is characterized
by waviness of the streaks similar to traveling waves, and the surrounding region,
which includes in addition the weak undisturbed streaks and oblique waves at the
laminar-turbulent interface. We also study the dependence of the size of these
two regions on Reynolds number. Finally, we show that the traveling waves move
in the downstream (Poiseuille) direction.'
article_number: '043904'
author:
- first_name: Lukasz
full_name: Klotz, Lukasz
id: 2C9AF1C2-F248-11E8-B48F-1D18A9856A87
last_name: Klotz
orcid: 0000-0003-1740-7635
- first_name: Grégoire M
full_name: Lemoult, Grégoire M
id: 4787FE80-F248-11E8-B48F-1D18A9856A87
last_name: Lemoult
- first_name: Idalia
full_name: Frontczak, Idalia
last_name: Frontczak
- first_name: Laurette
full_name: Tuckerman, Laurette
last_name: Tuckerman
- first_name: José
full_name: Wesfreid, José
last_name: Wesfreid
citation:
ama: 'Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille
flow experiment with zero mean advection velocity: Subcritical transition to turbulence.
Physical Review Fluids. 2017;2(4). doi:10.1103/PhysRevFluids.2.043904'
apa: 'Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., & Wesfreid, J.
(2017). Couette-Poiseuille flow experiment with zero mean advection velocity:
Subcritical transition to turbulence. Physical Review Fluids. American
Physical Society. https://doi.org/10.1103/PhysRevFluids.2.043904'
chicago: 'Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman,
and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection
Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids.
American Physical Society, 2017. https://doi.org/10.1103/PhysRevFluids.2.043904.'
ieee: 'L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille
flow experiment with zero mean advection velocity: Subcritical transition to turbulence,”
Physical Review Fluids, vol. 2, no. 4. American Physical Society, 2017.'
ista: 'Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille
flow experiment with zero mean advection velocity: Subcritical transition to turbulence.
Physical Review Fluids. 2(4), 043904.'
mla: 'Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection
Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids,
vol. 2, no. 4, 043904, American Physical Society, 2017, doi:10.1103/PhysRevFluids.2.043904.'
short: L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical
Review Fluids 2 (2017).
date_created: 2018-12-11T11:46:54Z
date_published: 2017-04-01T00:00:00Z
date_updated: 2021-01-12T08:01:16Z
day: '01'
department:
- _id: BjHo
doi: 10.1103/PhysRevFluids.2.043904
intvolume: ' 2'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1704.02619
month: '04'
oa: 1
oa_version: Preprint
publication: Physical Review Fluids
publication_status: published
publisher: American Physical Society
publist_id: '7306'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical
transition to turbulence'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2017'
...