---
_id: '1697'
abstract:
- lang: eng
text: Motion tracking is a challenge the visual system has to solve by reading out
the retinal population. It is still unclear how the information from different
neurons can be combined together to estimate the position of an object. Here we
recorded a large population of ganglion cells in a dense patch of salamander and
guinea pig retinas while displaying a bar moving diffusively. We show that the
bar’s position can be reconstructed from retinal activity with a precision in
the hyperacuity regime using a linear decoder acting on 100+ cells. We then took
advantage of this unprecedented precision to explore the spatial structure of
the retina’s population code. The classical view would have suggested that the
firing rates of the cells form a moving hill of activity tracking the bar’s position.
Instead, we found that most ganglion cells in the salamander fired sparsely and
idiosyncratically, so that their neural image did not track the bar. Furthermore,
ganglion cell activity spanned an area much larger than predicted by their receptive
fields, with cells coding for motion far in their surround. As a result, population
redundancy was high, and we could find multiple, disjoint subsets of neurons that
encoded the trajectory with high precision. This organization allows for diverse
collections of ganglion cells to represent high-accuracy motion information in
a form easily read out by downstream neural circuits.
acknowledgement: 'This work was supported by grants EY 014196 and EY 017934 to MJB,
ANR OPTIMA, the French State program Investissements d’Avenir managed by the Agence
Nationale de la Recherche [LIFESENSES: ANR-10-LABX-65], and by a EC grant from the
Human Brain Project (CLAP) to OM, the Austrian Research Foundation FWF P25651 to
VBS and GT. VBS is partially supported by contracts MEC, Spain (Grant No. AYA2010-
22111-C03-02, Grant No. AYA2013-48623-C2-2 and FEDER Funds).'
article_number: e1004304
author:
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Vicente
full_name: Botella Soler, Vicente
id: 421234E8-F248-11E8-B48F-1D18A9856A87
last_name: Botella Soler
orcid: 0000-0002-8790-1914
- first_name: Kristina
full_name: Simmons, Kristina
last_name: Simmons
- first_name: Thierry
full_name: Mora, Thierry
last_name: Mora
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Michael
full_name: Berry, Michael
last_name: Berry
citation:
ama: Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. High accuracy
decoding of dynamical motion from a large retinal population. PLoS Computational
Biology. 2015;11(7). doi:10.1371/journal.pcbi.1004304
apa: Marre, O., Botella Soler, V., Simmons, K., Mora, T., Tkačik, G., & Berry,
M. (2015). High accuracy decoding of dynamical motion from a large retinal population.
PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004304
chicago: Marre, Olivier, Vicente Botella Soler, Kristina Simmons, Thierry Mora,
Gašper Tkačik, and Michael Berry. “High Accuracy Decoding of Dynamical Motion
from a Large Retinal Population.” PLoS Computational Biology. Public Library
of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004304.
ieee: O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, and M. Berry,
“High accuracy decoding of dynamical motion from a large retinal population,”
PLoS Computational Biology, vol. 11, no. 7. Public Library of Science,
2015.
ista: Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. 2015. High
accuracy decoding of dynamical motion from a large retinal population. PLoS Computational
Biology. 11(7), e1004304.
mla: Marre, Olivier, et al. “High Accuracy Decoding of Dynamical Motion from a Large
Retinal Population.” PLoS Computational Biology, vol. 11, no. 7, e1004304,
Public Library of Science, 2015, doi:10.1371/journal.pcbi.1004304.
short: O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, M. Berry, PLoS
Computational Biology 11 (2015).
date_created: 2018-12-11T11:53:31Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2021-01-12T06:52:35Z
day: '01'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004304
file:
- access_level: open_access
checksum: 472b979f3f1cffb37b3e503f085115ca
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:25Z
date_updated: 2020-07-14T12:45:12Z
file_id: '5212'
file_name: IST-2016-455-v1+1_journal.pcbi.1004304.pdf
file_size: 4673930
relation: main_file
file_date_updated: 2020-07-14T12:45:12Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 254D1A94-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 25651-N26
name: Sensitivity to higher-order statistics in natural scenes
publication: PLoS Computational Biology
publication_status: published
publisher: Public Library of Science
publist_id: '5447'
pubrep_id: '455'
quality_controlled: '1'
scopus_import: 1
status: public
title: High accuracy decoding of dynamical motion from a large retinal population
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: 11
year: '2015'
...
---
_id: '1698'
abstract:
- lang: eng
text: 'In mean-payoff games, the objective of the protagonist is to ensure that
the limit average of an infinite sequence of numeric weights is nonnegative. In
energy games, the objective is to ensure that the running sum of weights is always
nonnegative. Multi-mean-payoff and multi-energy games replace individual weights
by tuples, and the limit average (resp., running sum) of each coordinate must
be (resp., remain) nonnegative. We prove finite-memory determinacy of multi-energy
games and show inter-reducibility of multi-mean-payoff and multi-energy games
for finite-memory strategies. We improve the computational complexity for solving
both classes with finite-memory strategies: we prove coNP-completeness improving
the previous known EXPSPACE bound. For memoryless strategies, we show that deciding
the existence of a winning strategy for the protagonist is NP-complete. We present
the first solution of multi-mean-payoff games with infinite-memory strategies:
we show that mean-payoff-sup objectives can be decided in NP∩coNP, whereas mean-payoff-inf
objectives are coNP-complete.'
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 and S11402-N23 (RiSE), ERC Start
grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant
QUAREM (267989: Quantitative Reactive Modeling), European project Cassting (FP7-601148),
ERC Start grant (279499: inVEST).'
author:
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- 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: Alexander
full_name: Rabinovich, Alexander
last_name: Rabinovich
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The
complexity of multi-mean-payoff and multi-energy games. Information and Computation.
2015;241(4):177-196. doi:10.1016/j.ic.2015.03.001
apa: Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &
Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games.
Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.001
chicago: Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger,
Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and
Multi-Energy Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.001.
ieee: Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J.
Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information
and Computation, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.
ista: Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015.
The complexity of multi-mean-payoff and multi-energy games. Information and Computation.
241(4), 177–196.
mla: Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy
Games.” Information and Computation, vol. 241, no. 4, Elsevier, 2015, pp.
177–96, doi:10.1016/j.ic.2015.03.001.
short: Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin,
Information and Computation 241 (2015) 177–196.
date_created: 2018-12-11T11:53:32Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2021-01-12T06:52:36Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2015.03.001
ec_funded: 1
intvolume: ' 241'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1209.3234
month: '04'
oa: 1
oa_version: Preprint
page: 177 - 196
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: 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'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '5443'
quality_controlled: '1'
scopus_import: 1
status: public
title: The complexity of multi-mean-payoff and multi-energy games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 241
year: '2015'
...
---
_id: '1699'
abstract:
- lang: eng
text: By hybridization and backcrossing, alleles can surmount species boundaries
and be incorporated into the genome of a related species. This introgression of
genes is of particular evolutionary relevance if it involves the transfer of adaptations
between populations. However, any beneficial allele will typically be associated
with other alien alleles that are often deleterious and hamper the introgression
process. In order to describe the introgression of an adaptive allele, we set
up a stochastic model with an explicit genetic makeup of linked and unlinked deleterious
alleles. Based on the theory of reducible multitype branching processes, we derive
a recursive expression for the establishment probability of the beneficial allele
after a single hybridization event. We furthermore study the probability that
slightly deleterious alleles hitchhike to fixation. The key to the analysis is
a split of the process into a stochastic phase in which the advantageous alleles
establishes and a deterministic phase in which it sweeps to fixation. We thereafter
apply the theory to a set of biologically relevant scenarios such as introgression
in the presence of many unlinked or few closely linked deleterious alleles. A
comparison to computer simulations shows that the approximations work well over
a large parameter range.
acknowledgement: This work was made possible with financial support by the Vienna
Science and Technology Fund (WWTF), by the Deutsche Forschungsgemeinschaft (DFG),
Research Unit 1078 Natural selection in structured populations, by the Austrian
Science Fund (FWF) via funding for the Vienna Graduate School for Population Genetics,
and by a “For Women in Science” fellowship (L’Oréal Österreich in cooperation with
the Austrian Commission for UNESCO and the Austrian Academy of Sciences with financial
support from the Federal Ministry for Science and Research Austria).
author:
- first_name: Hildegard
full_name: Uecker, Hildegard
id: 2DB8F68A-F248-11E8-B48F-1D18A9856A87
last_name: Uecker
orcid: 0000-0001-9435-2813
- first_name: Derek
full_name: Setter, Derek
last_name: Setter
- first_name: Joachim
full_name: Hermisson, Joachim
last_name: Hermisson
citation:
ama: Uecker H, Setter D, Hermisson J. Adaptive gene introgression after secondary
contact. Journal of Mathematical Biology. 2015;70(7):1523-1580. doi:10.1007/s00285-014-0802-y
apa: Uecker, H., Setter, D., & Hermisson, J. (2015). Adaptive gene introgression
after secondary contact. Journal of Mathematical Biology. Springer. https://doi.org/10.1007/s00285-014-0802-y
chicago: Uecker, Hildegard, Derek Setter, and Joachim Hermisson. “Adaptive Gene
Introgression after Secondary Contact.” Journal of Mathematical Biology.
Springer, 2015. https://doi.org/10.1007/s00285-014-0802-y.
ieee: H. Uecker, D. Setter, and J. Hermisson, “Adaptive gene introgression after
secondary contact,” Journal of Mathematical Biology, vol. 70, no. 7. Springer,
pp. 1523–1580, 2015.
ista: Uecker H, Setter D, Hermisson J. 2015. Adaptive gene introgression after secondary
contact. Journal of Mathematical Biology. 70(7), 1523–1580.
mla: Uecker, Hildegard, et al. “Adaptive Gene Introgression after Secondary Contact.”
Journal of Mathematical Biology, vol. 70, no. 7, Springer, 2015, pp. 1523–80,
doi:10.1007/s00285-014-0802-y.
short: H. Uecker, D. Setter, J. Hermisson, Journal of Mathematical Biology 70 (2015)
1523–1580.
date_created: 2018-12-11T11:53:32Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-02-23T10:10:36Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1007/s00285-014-0802-y
file:
- access_level: open_access
checksum: 00e3a67bda05d4cc165b3a48b41ef9ad
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:27Z
date_updated: 2020-07-14T12:45:12Z
file_id: '5079'
file_name: IST-2016-458-v1+1_s00285-014-0802-y.pdf
file_size: 1321527
relation: main_file
file_date_updated: 2020-07-14T12:45:12Z
has_accepted_license: '1'
intvolume: ' 70'
issue: '7'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1523 - 1580
project:
- _id: 25B67606-B435-11E9-9278-68D0E5697425
name: L'OREAL Fellowship
publication: Journal of Mathematical Biology
publication_status: published
publisher: Springer
publist_id: '5442'
pubrep_id: '458'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adaptive gene introgression after secondary contact
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: 70
year: '2015'
...
---
_id: '1700'
abstract:
- lang: eng
text: We use the dual boson approach to reveal the phase diagram of the Fermi-Hubbard
model with long-range dipole-dipole interactions. By using a large-scale finite-temperature
calculation on a 64×64 square lattice we demonstrate the existence of a novel
phase, possessing an "ultralong-range" order. The fingerprint of this
phase - the density correlation function - features a nontrivial behavior on a
scale of tens of lattice sites. We study the properties and the stability of the
ultralong-range-ordered phase, and show that it is accessible in modern experiments
with ultracold polar molecules and magnetic atoms.
acknowledgement: The work is supported by European Research Council (ERC) Advanced
Grant No. 338957 FEMTO/NANO.
article_number: '081106'
author:
- first_name: Erik
full_name: Van Loon, Erik
last_name: Van Loon
- first_name: Mikhail
full_name: Katsnelson, Mikhail
last_name: Katsnelson
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Van Loon E, Katsnelson M, Lemeshko M. Ultralong-range order in the Fermi-Hubbard
model with long-range interactions. Physical Review B. 2015;92(8). doi:10.1103/PhysRevB.92.081106
apa: Van Loon, E., Katsnelson, M., & Lemeshko, M. (2015). Ultralong-range order
in the Fermi-Hubbard model with long-range interactions. Physical Review B.
American Physical Society. https://doi.org/10.1103/PhysRevB.92.081106
chicago: Van Loon, Erik, Mikhail Katsnelson, and Mikhail Lemeshko. “Ultralong-Range
Order in the Fermi-Hubbard Model with Long-Range Interactions.” Physical Review
B. American Physical Society, 2015. https://doi.org/10.1103/PhysRevB.92.081106.
ieee: E. Van Loon, M. Katsnelson, and M. Lemeshko, “Ultralong-range order in the
Fermi-Hubbard model with long-range interactions,” Physical Review B, vol.
92, no. 8. American Physical Society, 2015.
ista: Van Loon E, Katsnelson M, Lemeshko M. 2015. Ultralong-range order in the Fermi-Hubbard
model with long-range interactions. Physical Review B. 92(8), 081106.
mla: Van Loon, Erik, et al. “Ultralong-Range Order in the Fermi-Hubbard Model with
Long-Range Interactions.” Physical Review B, vol. 92, no. 8, 081106, American
Physical Society, 2015, doi:10.1103/PhysRevB.92.081106.
short: E. Van Loon, M. Katsnelson, M. Lemeshko, Physical Review B 92 (2015).
date_created: 2018-12-11T11:53:32Z
date_published: 2015-08-10T00:00:00Z
date_updated: 2021-01-12T06:52:37Z
day: '10'
department:
- _id: MiLe
doi: 10.1103/PhysRevB.92.081106
intvolume: ' 92'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1506.06007
month: '08'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '5441'
scopus_import: 1
status: public
title: Ultralong-range order in the Fermi-Hubbard model with long-range interactions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2015'
...
---
_id: '1701'
abstract:
- lang: eng
text: 'The activity of a neural network is defined by patterns of spiking and silence
from the individual neurons. Because spikes are (relatively) sparse, patterns
of activity with increasing numbers of spikes are less probable, but, with more
spikes, the number of possible patterns increases. This tradeoff between probability
and numerosity is mathematically equivalent to the relationship between entropy
and energy in statistical physics. We construct this relationship for populations
of up to N = 160 neurons in a small patch of the vertebrate retina, using a combination
of direct and model-based analyses of experiments on the response of this network
to naturalistic movies. We see signs of a thermodynamic limit, where the entropy
per neuron approaches a smooth function of the energy per neuron as N increases.
The form of this function corresponds to the distribution of activity being poised
near an unusual kind of critical point. We suggest further tests of criticality,
and give a brief discussion of its functional significance. '
acknowledgement: "Research was supported in part by National Science Foundation Grants
PHY-1305525, PHY-1451171, and CCF-0939370, by National Institutes of Health Grant
R01 EY14196, and by Austrian Science Foundation Grant FWF P25651. Additional support
was provided by the\r\nFannie and John Hertz Foundation, by the Swartz Foundation,
by the W. M. Keck Foundation, and by the Simons Foundation."
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Thierry
full_name: Mora, Thierry
last_name: Mora
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Dario
full_name: Amodei, Dario
last_name: Amodei
- first_name: Stephanie
full_name: Palmer, Stephanie
last_name: Palmer
- first_name: Michael
full_name: Berry Ii, Michael
last_name: Berry Ii
- first_name: William
full_name: Bialek, William
last_name: Bialek
citation:
ama: Tkačik G, Mora T, Marre O, et al. Thermodynamics and signatures of criticality
in a network of neurons. PNAS. 2015;112(37):11508-11513. doi:10.1073/pnas.1514188112
apa: Tkačik, G., Mora, T., Marre, O., Amodei, D., Palmer, S., Berry Ii, M., &
Bialek, W. (2015). Thermodynamics and signatures of criticality in a network of
neurons. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1514188112
chicago: Tkačik, Gašper, Thierry Mora, Olivier Marre, Dario Amodei, Stephanie Palmer,
Michael Berry Ii, and William Bialek. “Thermodynamics and Signatures of Criticality
in a Network of Neurons.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1514188112.
ieee: G. Tkačik et al., “Thermodynamics and signatures of criticality in
a network of neurons,” PNAS, vol. 112, no. 37. National Academy of Sciences,
pp. 11508–11513, 2015.
ista: Tkačik G, Mora T, Marre O, Amodei D, Palmer S, Berry Ii M, Bialek W. 2015.
Thermodynamics and signatures of criticality in a network of neurons. PNAS. 112(37),
11508–11513.
mla: Tkačik, Gašper, et al. “Thermodynamics and Signatures of Criticality in a Network
of Neurons.” PNAS, vol. 112, no. 37, National Academy of Sciences, 2015,
pp. 11508–13, doi:10.1073/pnas.1514188112.
short: G. Tkačik, T. Mora, O. Marre, D. Amodei, S. Palmer, M. Berry Ii, W. Bialek,
PNAS 112 (2015) 11508–11513.
date_created: 2018-12-11T11:53:33Z
date_published: 2015-09-15T00:00:00Z
date_updated: 2021-01-12T06:52:37Z
day: '15'
department:
- _id: GaTk
doi: 10.1073/pnas.1514188112
external_id:
pmid:
- '26330611'
intvolume: ' 112'
issue: '37'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4577210/
month: '09'
oa: 1
oa_version: Submitted Version
page: 11508 - 11513
pmid: 1
project:
- _id: 254D1A94-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 25651-N26
name: Sensitivity to higher-order statistics in natural scenes
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5440'
quality_controlled: '1'
scopus_import: 1
status: public
title: Thermodynamics and signatures of criticality in a network of neurons
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...
---
_id: '1703'
abstract:
- lang: eng
text: Vegetation clearing and land-use change have depleted many natural plant communities
to the point where restoration is required. A major impediment to the success
of rebuilding complex vegetation communities is having regular access to sufficient
quantities of high-quality seed. Seed-production areas (SPAs) can help generate
this seed, but these must be underpinned by a broad genetic base to maximise the
evolutionary potential of restored populations. However, genetic bottlenecks can
occur at the collection, establishment and production stages in SPAs, requiring
genetic evaluation. This is especially relevant for species that may take many
years before a return on SPA investment is realised. Two recently established
yellow box (Eucalyptus melliodora A.Cunn. ex Schauer, Myrtaceae) SPAs were evaluated
to determine whether genetic bottlenecks had occurred between seed collection
and SPA establishment. No evidence was found to suggest that a significant loss
of genetic diversity had occurred at this stage, although there was a significant
difference in diversity between the two SPAs. Complex population genetic structure
was also observed in the seed used to source the SPAs, with up to eight groups
identified. Plant survival in the SPAs was influenced by seed collection location
but not by SPA location and was not associated with genetic diversity. There were
also no associations between genetic diversity and plant growth. These data highlighted
the importance of chance events when establishing SPAs and indicated that the
two yellow box SPAs are likely to provide genetically diverse seed sources for
future restoration projects, especially by pooling seed from both SPAs.
author:
- first_name: Linda
full_name: Broadhurst, Linda
last_name: Broadhurst
- first_name: Graham
full_name: Fifield, Graham
last_name: Fifield
- first_name: Bindi
full_name: Vanzella, Bindi
last_name: Vanzella
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
citation:
ama: Broadhurst L, Fifield G, Vanzella B, Pickup M. An evaluation of the genetic
structure of seed sources and the maintenance of genetic diversity during establishment
of two yellow box (Eucalyptus melliodora) seed-production areas. Australian
Journal of Botany. 2015;63(5):455-466. doi:10.1071/BT15023
apa: Broadhurst, L., Fifield, G., Vanzella, B., & Pickup, M. (2015). An evaluation
of the genetic structure of seed sources and the maintenance of genetic diversity
during establishment of two yellow box (Eucalyptus melliodora) seed-production
areas. Australian Journal of Botany. CSIRO. https://doi.org/10.1071/BT15023
chicago: Broadhurst, Linda, Graham Fifield, Bindi Vanzella, and Melinda Pickup.
“An Evaluation of the Genetic Structure of Seed Sources and the Maintenance of
Genetic Diversity during Establishment of Two Yellow Box (Eucalyptus Melliodora)
Seed-Production Areas.” Australian Journal of Botany. CSIRO, 2015. https://doi.org/10.1071/BT15023.
ieee: L. Broadhurst, G. Fifield, B. Vanzella, and M. Pickup, “An evaluation of the
genetic structure of seed sources and the maintenance of genetic diversity during
establishment of two yellow box (Eucalyptus melliodora) seed-production areas,”
Australian Journal of Botany, vol. 63, no. 5. CSIRO, pp. 455–466, 2015.
ista: Broadhurst L, Fifield G, Vanzella B, Pickup M. 2015. An evaluation of the
genetic structure of seed sources and the maintenance of genetic diversity during
establishment of two yellow box (Eucalyptus melliodora) seed-production areas.
Australian Journal of Botany. 63(5), 455–466.
mla: Broadhurst, Linda, et al. “An Evaluation of the Genetic Structure of Seed Sources
and the Maintenance of Genetic Diversity during Establishment of Two Yellow Box
(Eucalyptus Melliodora) Seed-Production Areas.” Australian Journal of Botany,
vol. 63, no. 5, CSIRO, 2015, pp. 455–66, doi:10.1071/BT15023.
short: L. Broadhurst, G. Fifield, B. Vanzella, M. Pickup, Australian Journal of
Botany 63 (2015) 455–466.
date_created: 2018-12-11T11:53:34Z
date_published: 2015-05-26T00:00:00Z
date_updated: 2021-01-12T06:52:38Z
day: '26'
department:
- _id: NiBa
doi: 10.1071/BT15023
intvolume: ' 63'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
page: 455 - 466
publication: Australian Journal of Botany
publication_status: published
publisher: CSIRO
publist_id: '5434'
quality_controlled: '1'
scopus_import: 1
status: public
title: An evaluation of the genetic structure of seed sources and the maintenance
of genetic diversity during establishment of two yellow box (Eucalyptus melliodora)
seed-production areas
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 63
year: '2015'
...
---
_id: '1704'
abstract:
- lang: eng
text: Given a convex function (Formula presented.) and two hermitian matrices A
and B, Lewin and Sabin study in (Lett Math Phys 104:691–705, 2014) the relative
entropy defined by (Formula presented.). Among other things, they prove that the
so-defined quantity is monotone if and only if (Formula presented.) is operator
monotone. The monotonicity is then used to properly define (Formula presented.)
for bounded self-adjoint operators acting on an infinite-dimensional Hilbert space
by a limiting procedure. More precisely, for an increasing sequence of finite-dimensional
projections (Formula presented.) with (Formula presented.) strongly, the limit
(Formula presented.) is shown to exist and to be independent of the sequence of
projections (Formula presented.). The question whether this sequence converges
to its "obvious" limit, namely (Formula presented.), has been left open.
We answer this question in principle affirmatively and show that (Formula presented.).
If the operators A and B are regular enough, that is (A − B), (Formula presented.)
and (Formula presented.) are trace-class, the identity (Formula presented.) holds.
author:
- first_name: Andreas
full_name: Deuchert, Andreas
last_name: Deuchert
orcid: 0000-0003-3146-6746
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Deuchert A, Hainzl C, Seiringer R. Note on a family of monotone quantum relative
entropies. Letters in Mathematical Physics. 2015;105(10):1449-1466. doi:10.1007/s11005-015-0787-5
apa: Deuchert, A., Hainzl, C., & Seiringer, R. (2015). Note on a family of monotone
quantum relative entropies. Letters in Mathematical Physics. Springer.
https://doi.org/10.1007/s11005-015-0787-5
chicago: Deuchert, Andreas, Christian Hainzl, and Robert Seiringer. “Note on a Family
of Monotone Quantum Relative Entropies.” Letters in Mathematical Physics.
Springer, 2015. https://doi.org/10.1007/s11005-015-0787-5.
ieee: A. Deuchert, C. Hainzl, and R. Seiringer, “Note on a family of monotone quantum
relative entropies,” Letters in Mathematical Physics, vol. 105, no. 10.
Springer, pp. 1449–1466, 2015.
ista: Deuchert A, Hainzl C, Seiringer R. 2015. Note on a family of monotone quantum
relative entropies. Letters in Mathematical Physics. 105(10), 1449–1466.
mla: Deuchert, Andreas, et al. “Note on a Family of Monotone Quantum Relative Entropies.”
Letters in Mathematical Physics, vol. 105, no. 10, Springer, 2015, pp.
1449–66, doi:10.1007/s11005-015-0787-5.
short: A. Deuchert, C. Hainzl, R. Seiringer, Letters in Mathematical Physics 105
(2015) 1449–1466.
date_created: 2018-12-11T11:53:34Z
date_published: 2015-08-05T00:00:00Z
date_updated: 2021-01-12T06:52:38Z
day: '05'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s11005-015-0787-5
file:
- access_level: open_access
checksum: fd7307282a314cc1fbbaef77b187516b
content_type: application/pdf
creator: dernst
date_created: 2019-01-15T14:42:07Z
date_updated: 2020-07-14T12:45:13Z
file_id: '5836'
file_name: 2015_LettersMathPhys_Deuchert.pdf
file_size: 484967
relation: main_file
file_date_updated: 2020-07-14T12:45:13Z
has_accepted_license: '1'
intvolume: ' 105'
issue: '10'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1502.07205
month: '08'
oa: 1
oa_version: Preprint
page: 1449 - 1466
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '5432'
quality_controlled: '1'
scopus_import: 1
status: public
title: Note on a family of monotone quantum relative entropies
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 105
year: '2015'
...
---
_id: '1706'
abstract:
- lang: eng
text: We consider a problem of learning kernels for use in SVM classification in
the multi-task and lifelong scenarios and provide generalization bounds on the
error of a large margin classifier. Our results show that, under mild conditions
on the family of kernels used for learning, solving several related tasks simultaneously
is beneficial over single task learning. In particular, as the number of observed
tasks grows, assuming that in the considered family of kernels there exists one
that yields low approximation error on all tasks, the overhead associated with
learning such a kernel vanishes and the complexity converges to that of learning
when this good kernel is given to the learner.
alternative_title:
- LNCS
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Shai
full_name: Ben David, Shai
last_name: Ben David
citation:
ama: 'Pentina A, Ben David S. Multi-task and lifelong learning of kernels. In: Vol
9355. Springer; 2015:194-208. doi:10.1007/978-3-319-24486-0_13'
apa: 'Pentina, A., & Ben David, S. (2015). Multi-task and lifelong learning
of kernels (Vol. 9355, pp. 194–208). Presented at the ALT: Algorithmic Learning
Theory, Banff, AB, Canada: Springer. https://doi.org/10.1007/978-3-319-24486-0_13'
chicago: Pentina, Anastasia, and Shai Ben David. “Multi-Task and Lifelong Learning
of Kernels,” 9355:194–208. Springer, 2015. https://doi.org/10.1007/978-3-319-24486-0_13.
ieee: 'A. Pentina and S. Ben David, “Multi-task and lifelong learning of kernels,”
presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada, 2015, vol.
9355, pp. 194–208.'
ista: 'Pentina A, Ben David S. 2015. Multi-task and lifelong learning of kernels.
ALT: Algorithmic Learning Theory, LNCS, vol. 9355, 194–208.'
mla: Pentina, Anastasia, and Shai Ben David. Multi-Task and Lifelong Learning
of Kernels. Vol. 9355, Springer, 2015, pp. 194–208, doi:10.1007/978-3-319-24486-0_13.
short: A. Pentina, S. Ben David, in:, Springer, 2015, pp. 194–208.
conference:
end_date: 2015-10-06
location: Banff, AB, Canada
name: 'ALT: Algorithmic Learning Theory'
start_date: 2015-10-04
date_created: 2018-12-11T11:53:35Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:39Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-3-319-24486-0_13
ec_funded: 1
intvolume: ' 9355'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1602.06531
month: '01'
oa: 1
oa_version: Preprint
page: 194 - 208
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Springer
publist_id: '5430'
quality_controlled: '1'
scopus_import: 1
status: public
title: Multi-task and lifelong learning of kernels
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9355
year: '2015'
...
---
_id: '1709'
abstract:
- lang: eng
text: The competition for resources among cells, individuals or species is a fundamental
characteristic of evolution. Biological all-pay auctions have been used to model
situations where multiple individuals compete for a single resource. However,
in many situations multiple resources with various values exist and single reward
auctions are not applicable. We generalize the model to multiple rewards and study
the evolution of strategies. In biological all-pay auctions the bid of an individual
corresponds to its strategy and is equivalent to its payment in the auction. The
decreasingly ordered rewards are distributed according to the decreasingly ordered
bids of the participating individuals. The reproductive success of an individual
is proportional to its fitness given by the sum of the rewards won minus its payments.
Hence, successful bidding strategies spread in the population. We find that the
results for the multiple reward case are very different from the single reward
case. While the mixed strategy equilibrium in the single reward case with more
than two players consists of mostly low-bidding individuals, we show that the
equilibrium can convert to many high-bidding individuals and a few low-bidding
individuals in the multiple reward case. Some reward values lead to a specialization
among the individuals where one subpopulation competes for the rewards and the
other subpopulation largely avoids costly competitions. Whether the mixed strategy
equilibrium is an evolutionarily stable strategy (ESS) depends on the specific
values of the rewards.
acknowledgement: 'This work was supported by grants from the John Templeton Foundation,
ERC Start Grant (279307: Graph Games), FWF NFN Grant (No S11407N23 RiSE/SHiNE),
FWF Grant (No P23499N23) and a Microsoft faculty fellows award.'
article_processing_charge: No
article_type: original
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. Biological auctions with
multiple rewards. Proceedings of the Royal Society of London Series B Biological
Sciences. 2015;282(1812). doi:10.1098/rspb.2015.1041
apa: Reiter, J., Kanodia, A., Gupta, R., Nowak, M., & Chatterjee, K. (2015).
Biological auctions with multiple rewards. Proceedings of the Royal Society
of London Series B Biological Sciences. Royal Society. https://doi.org/10.1098/rspb.2015.1041
chicago: Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu
Chatterjee. “Biological Auctions with Multiple Rewards.” Proceedings of the
Royal Society of London Series B Biological Sciences. Royal Society, 2015.
https://doi.org/10.1098/rspb.2015.1041.
ieee: J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological
auctions with multiple rewards,” Proceedings of the Royal Society of London
Series B Biological Sciences, vol. 282, no. 1812. Royal Society, 2015.
ista: Reiter J, Kanodia A, Gupta R, Nowak M, Chatterjee K. 2015. Biological auctions
with multiple rewards. Proceedings of the Royal Society of London Series B Biological
Sciences. 282(1812).
mla: Reiter, Johannes, et al. “Biological Auctions with Multiple Rewards.” Proceedings
of the Royal Society of London Series B Biological Sciences, vol. 282, no.
1812, Royal Society, 2015, doi:10.1098/rspb.2015.1041.
short: J. Reiter, A. Kanodia, R. Gupta, M. Nowak, K. Chatterjee, Proceedings of
the Royal Society of London Series B Biological Sciences 282 (2015).
date_created: 2018-12-11T11:53:35Z
date_published: 2015-07-15T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '15'
department:
- _id: KrCh
doi: 10.1098/rspb.2015.1041
external_id:
pmid:
- '26180069'
intvolume: ' 282'
issue: '1812'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4528522/
month: '07'
oa: 1
oa_version: Submitted Version
pmid: 1
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: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the Royal Society of London Series B Biological Sciences
publication_status: published
publisher: Royal Society
publist_id: '5425'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Biological auctions with multiple rewards
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 282
year: '2015'
...
---
_id: '1710'
abstract:
- lang: eng
text: 'We consider the hollow on the half-plane {(x, y) : y ≤ 0} ⊂ ℝ2 defined by
a function u : (-1, 1) → ℝ, u(x) < 0, and a vertical flow of point particles
incident on the hollow. It is assumed that u satisfies the so-called single impact
condition (SIC): each incident particle is elastically reflected by graph(u) and
goes away without hitting the graph of u anymore. We solve the problem: find the
function u minimizing the force of resistance created by the flow. We show that
the graph of the minimizer is formed by two arcs of parabolas symmetric to each
other with respect to the y-axis. Assuming that the resistance of u ≡ 0 equals
1, we show that the minimal resistance equals π/2 - 2arctan(1/2) ≈ 0.6435. This
result completes the previously obtained result [SIAM J. Math. Anal., 46 (2014),
pp. 2730-2742] stating in particular that the minimal resistance of a hollow in
higher dimensions equals 0.5. We additionally consider a similar problem of minimal
resistance, where the hollow in the half-space {(x1,...,xd,y) : y ≤ 0} ⊂ ℝd+1
is defined by a radial function U satisfying the SIC, U(x) = u(|x|), with x =
(x1,...,xd), u(ξ) < 0 for 0 ≤ ξ < 1, and u(ξ) = 0 for ξ ≥ 1, and the flow
is parallel to the y-axis. The minimal resistance is greater than 0.5 (and coincides
with 0.6435 when d = 1) and converges to 0.5 as d → ∞.'
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexander
full_name: Plakhov, Alexander
last_name: Plakhov
citation:
ama: Akopyan A, Plakhov A. Minimal resistance of curves under the single impact
assumption. Society for Industrial and Applied Mathematics. 2015;47(4):2754-2769.
doi:10.1137/140993843
apa: Akopyan, A., & Plakhov, A. (2015). Minimal resistance of curves under the
single impact assumption. Society for Industrial and Applied Mathematics.
SIAM. https://doi.org/10.1137/140993843
chicago: Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves
under the Single Impact Assumption.” Society for Industrial and Applied Mathematics.
SIAM, 2015. https://doi.org/10.1137/140993843.
ieee: A. Akopyan and A. Plakhov, “Minimal resistance of curves under the single
impact assumption,” Society for Industrial and Applied Mathematics, vol.
47, no. 4. SIAM, pp. 2754–2769, 2015.
ista: Akopyan A, Plakhov A. 2015. Minimal resistance of curves under the single
impact assumption. Society for Industrial and Applied Mathematics. 47(4), 2754–2769.
mla: Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under
the Single Impact Assumption.” Society for Industrial and Applied Mathematics,
vol. 47, no. 4, SIAM, 2015, pp. 2754–69, doi:10.1137/140993843.
short: A. Akopyan, A. Plakhov, Society for Industrial and Applied Mathematics 47
(2015) 2754–2769.
date_created: 2018-12-11T11:53:36Z
date_published: 2015-07-14T00:00:00Z
date_updated: 2021-01-12T06:52:41Z
day: '14'
department:
- _id: HeEd
doi: 10.1137/140993843
ec_funded: 1
intvolume: ' 47'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.3736
month: '07'
oa: 1
oa_version: Preprint
page: 2754 - 2769
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Society for Industrial and Applied Mathematics
publication_status: published
publisher: SIAM
publist_id: '5423'
quality_controlled: '1'
scopus_import: 1
status: public
title: Minimal resistance of curves under the single impact assumption
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2015'
...
---
_id: '1712'
abstract:
- lang: eng
text: The majority of immune cells in Drosophila melanogaster are plasmatocytes;
they carry out similar functions to vertebrate macrophages, influencing development
as well as protecting against infection and cancer. Plasmatocytes, sometimes referred
to with the broader term of hemocytes, migrate widely during embryonic development
and cycle in the larvae between sessile and circulating positions. Here we discuss
the similarities of plasmatocyte developmental migration and its functions to
that of vertebrate macrophages, considering the recent controversy regarding the
functions of Drosophila PDGF/VEGF related ligands. We also examine recent findings
on the significance of adhesion for plasmatocyte migration in the embryo, as well
as proliferation, trans-differentiation, and tumor responses in the larva. We
spotlight parallels throughout to vertebrate immune responses.
author:
- first_name: Aparna
full_name: Ratheesh, Aparna
id: 2F064CFE-F248-11E8-B48F-1D18A9856A87
last_name: Ratheesh
- first_name: Vera
full_name: Belyaeva, Vera
id: 47F080FE-F248-11E8-B48F-1D18A9856A87
last_name: Belyaeva
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
citation:
ama: Ratheesh A, Belyaeva V, Siekhaus DE. Drosophila immune cell migration and adhesion
during embryonic development and larval immune responses. Current Opinion in
Cell Biology. 2015;36(10):71-79. doi:10.1016/j.ceb.2015.07.003
apa: Ratheesh, A., Belyaeva, V., & Siekhaus, D. E. (2015). Drosophila immune
cell migration and adhesion during embryonic development and larval immune responses.
Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2015.07.003
chicago: Ratheesh, Aparna, Vera Belyaeva, and Daria E Siekhaus. “Drosophila Immune
Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.”
Current Opinion in Cell Biology. Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.07.003.
ieee: A. Ratheesh, V. Belyaeva, and D. E. Siekhaus, “Drosophila immune cell migration
and adhesion during embryonic development and larval immune responses,” Current
Opinion in Cell Biology, vol. 36, no. 10. Elsevier, pp. 71–79, 2015.
ista: Ratheesh A, Belyaeva V, Siekhaus DE. 2015. Drosophila immune cell migration
and adhesion during embryonic development and larval immune responses. Current
Opinion in Cell Biology. 36(10), 71–79.
mla: Ratheesh, Aparna, et al. “Drosophila Immune Cell Migration and Adhesion during
Embryonic Development and Larval Immune Responses.” Current Opinion in Cell
Biology, vol. 36, no. 10, Elsevier, 2015, pp. 71–79, doi:10.1016/j.ceb.2015.07.003.
short: A. Ratheesh, V. Belyaeva, D.E. Siekhaus, Current Opinion in Cell Biology
36 (2015) 71–79.
date_created: 2018-12-11T11:53:36Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:52:41Z
day: '01'
ddc:
- '573'
department:
- _id: DaSi
doi: 10.1016/j.ceb.2015.07.003
ec_funded: 1
file:
- access_level: open_access
checksum: bbb1ee39ca52929aefe4f48752b166ee
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:44Z
date_updated: 2020-07-14T12:45:13Z
file_id: '5098'
file_name: IST-2015-346-v1+1_Current_Opinion_Review_Ratheesh_et_al_2015.pdf
file_size: 1023680
relation: main_file
file_date_updated: 2020-07-14T12:45:13Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 71 - 79
project:
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '5421'
pubrep_id: '346'
quality_controlled: '1'
scopus_import: 1
status: public
title: Drosophila immune cell migration and adhesion during embryonic development
and larval immune responses
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: 36
year: '2015'
...
---
_id: '1714'
abstract:
- lang: eng
text: 'We present a flexible framework for the automated competitive analysis of
on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective
graphs: Given a task set and an on-line scheduling algorithm specified as a labeled
transition system, along with some optional safety, liveness, and/or limit-average
constraints for the adversary, we automatically compute the competitive ratio
of the algorithm w.r.t. A clairvoyant scheduler. We demonstrate the flexibility
and power of our approach by comparing the competitive ratio of several on-line
algorithms, including Dover, that have been proposed in the past, for various
task sets. Our experimental results reveal that none of these algorithms is universally
optimal, in the sense that there are task sets where other schedulers provide
better performance. Our framework is hence a very useful design tool for selecting
optimal algorithms for a given application.'
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Alexander
full_name: Kößler, Alexander
last_name: Kößler
- first_name: Ulrich
full_name: Schmid, Ulrich
last_name: Schmid
citation:
ama: 'Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. A framework for automated
competitive analysis of on-line scheduling of firm-deadline tasks. In: Real-Time
Systems Symposium. Vol 2015. IEEE; 2015:118-127. doi:10.1109/RTSS.2014.9'
apa: 'Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2015). A framework
for automated competitive analysis of on-line scheduling of firm-deadline tasks.
In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE.
https://doi.org/10.1109/RTSS.2014.9'
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich
Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling
of Firm-Deadline Tasks.” In Real-Time Systems Symposium, 2015:118–27. IEEE,
2015. https://doi.org/10.1109/RTSS.2014.9.
ieee: K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for
automated competitive analysis of on-line scheduling of firm-deadline tasks,”
in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January,
pp. 118–127.
ista: 'Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2015. A framework for automated
competitive analysis of on-line scheduling of firm-deadline tasks. Real-Time Systems
Symposium. RTSS: Real-Time Systems Symposium vol. 2015, 118–127.'
mla: Chatterjee, Krishnendu, et al. “A Framework for Automated Competitive Analysis
of On-Line Scheduling of Firm-Deadline Tasks.” Real-Time Systems Symposium,
vol. 2015, no. January, IEEE, 2015, pp. 118–27, doi:10.1109/RTSS.2014.9.
short: K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, in:, Real-Time Systems
Symposium, IEEE, 2015, pp. 118–127.
conference:
end_date: 2014-12-05
location: Rome, Italy
name: 'RTSS: Real-Time Systems Symposium'
start_date: 2014-12-02
date_created: 2018-12-11T11:53:37Z
date_published: 2015-01-15T00:00:00Z
date_updated: 2023-09-07T12:01:59Z
day: '15'
department:
- _id: KrCh
doi: 10.1109/RTSS.2014.9
intvolume: ' 2015'
issue: January
language:
- iso: eng
month: '01'
oa_version: None
page: 118 - 127
publication: Real-Time Systems Symposium
publication_status: published
publisher: IEEE
publist_id: '5417'
quality_controlled: '1'
related_material:
record:
- id: '5423'
relation: earlier_version
status: public
- id: '821'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: A framework for automated competitive analysis of on-line scheduling of firm-deadline
tasks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015
year: '2015'
...
---
_id: '1729'
abstract:
- lang: eng
text: We present a computer-aided programming approach to concurrency. The approach
allows programmers to program assuming a friendly, non-preemptive scheduler, and
our synthesis procedure inserts synchronization to ensure that the final program
works even with a preemptive scheduler. The correctness specification is implicit,
inferred from the non-preemptive behavior. Let us consider sequences of calls
that the program makes to an external interface. The specification requires that
any such sequence produced under a preemptive scheduler should be included in
the set of such sequences produced under a non-preemptive scheduler. The solution
is based on a finitary abstraction, an algorithm for bounded language inclusion
modulo an independence relation, and rules for inserting synchronization. We apply
the approach to device-driver programming, where the driver threads call the software
interface of the device and the API provided by the operating system. Our experiments
demonstrate that our synthesis method is precise and efficient, and, since it
does not require explicit specifications, is more practical than the conventional
approach based on user-provided assertions.
alternative_title:
- LNCS
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Edmund
full_name: Clarke, Edmund
last_name: Clarke
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Leonid
full_name: Ryzhyk, Leonid
last_name: Ryzhyk
- first_name: Roopsha
full_name: Samanta, Roopsha
id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87
last_name: Samanta
- first_name: Thorsten
full_name: Tarrach, Thorsten
id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
last_name: Tarrach
orcid: 0000-0003-4409-8487
citation:
ama: Cerny P, Clarke E, Henzinger TA, et al. From non-preemptive to preemptive scheduling
using synchronization synthesis. 2015;9207:180-197. doi:10.1007/978-3-319-21668-3_11
apa: 'Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta,
R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using
synchronization synthesis. Presented at the CAV: Computer Aided Verification,
San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11'
chicago: Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid
Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive
Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science.
Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.
ieee: P. Cerny et al., “From non-preemptive to preemptive scheduling using
synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
ista: Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach
T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis.
9207, 180–197.
mla: Cerny, Pavol, et al. From Non-Preemptive to Preemptive Scheduling Using
Synchronization Synthesis. Vol. 9207, Springer, 2015, pp. 180–97, doi:10.1007/978-3-319-21668-3_11.
short: P. Cerny, E. Clarke, T.A. Henzinger, A. Radhakrishna, L. Ryzhyk, R. Samanta,
T. Tarrach, 9207 (2015) 180–197.
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:53:42Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2023-09-20T11:13:50Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-21668-3_11
ec_funded: 1
file:
- access_level: local
checksum: 6ff58ac220e2f20cb001ba35d4924495
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:53Z
date_updated: 2020-07-14T12:45:13Z
file_id: '4715'
file_name: IST-2015-336-v1+1_long_version.pdf
file_size: 481922
relation: main_file
file_date_updated: 2020-07-14T12:45:13Z
has_accepted_license: '1'
intvolume: ' 9207'
language:
- iso: eng
month: '07'
oa_version: Submitted Version
page: 180 - 197
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: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5398'
pubrep_id: '336'
quality_controlled: '1'
related_material:
record:
- id: '1130'
relation: dissertation_contains
status: public
- id: '1338'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: From non-preemptive to preemptive scheduling using synchronization synthesis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9207
year: '2015'
...
---
_id: '1730'
abstract:
- lang: eng
text: How much cutting is needed to simplify the topology of a surface? We provide
bounds for several instances of this question, for the minimum length of topologically
non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial
map in triangulated combinatorial surfaces (or their dual cross-metric counterpart).
Our work builds upon Riemannian systolic inequalities, which bound the minimum
length of non-trivial closed curves in terms of the genus and the area of the
surface. We first describe a systematic way to translate Riemannian systolic inequalities
to a discrete setting, and vice-versa. This implies a conjecture by Przytycka
and Przytycki (Graph structure theory. Contemporary Mathematics, vol. 147, 1993),
a number of new systolic inequalities in the discrete setting, and the fact that
a theorem of Hutchinson on the edge-width of triangulated surfaces and Gromov’s
systolic inequality for surfaces are essentially equivalent. We also discuss how
these proofs generalize to higher dimensions. Then we focus on topological decompositions
of surfaces. Relying on ideas of Buser, we prove the existence of pants decompositions
of length O(g^(3/2)n^(1/2)) for any triangulated combinatorial surface of genus
g with n triangles, and describe an O(gn)-time algorithm to compute such a decomposition.
Finally, we consider the problem of embedding a cut graph (or more generally a
cellular graph) with a given combinatorial map on a given surface. Using random
triangulations, we prove (essentially) that, for any choice of a combinatorial
map, there are some surfaces on which any cellular embedding with that combinatorial
map has length superlinear in the number of triangles of the triangulated combinatorial
surface. There is also a similar result for graphs embedded on polyhedral triangulations.
author:
- first_name: Éric
full_name: Colin De Verdière, Éric
last_name: Colin De Verdière
- first_name: Alfredo
full_name: Hubard, Alfredo
last_name: Hubard
- first_name: Arnaud N
full_name: De Mesmay, Arnaud N
id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87
last_name: De Mesmay
citation:
ama: Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities
and decompositions of triangulated surfaces. Discrete & Computational Geometry.
2015;53(3):587-620. doi:10.1007/s00454-015-9679-9
apa: Colin De Verdière, É., Hubard, A., & de Mesmay, A. N. (2015). Discrete
systolic inequalities and decompositions of triangulated surfaces. Discrete
& Computational Geometry. Springer. https://doi.org/10.1007/s00454-015-9679-9
chicago: Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete
Systolic Inequalities and Decompositions of Triangulated Surfaces.” Discrete
& Computational Geometry. Springer, 2015. https://doi.org/10.1007/s00454-015-9679-9.
ieee: É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities
and decompositions of triangulated surfaces,” Discrete & Computational
Geometry, vol. 53, no. 3. Springer, pp. 587–620, 2015.
ista: Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities
and decompositions of triangulated surfaces. Discrete & Computational Geometry.
53(3), 587–620.
mla: Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions
of Triangulated Surfaces.” Discrete & Computational Geometry, vol.
53, no. 3, Springer, 2015, pp. 587–620, doi:10.1007/s00454-015-9679-9.
short: É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete & Computational
Geometry 53 (2015) 587–620.
date_created: 2018-12-11T11:53:42Z
date_published: 2015-04-02T00:00:00Z
date_updated: 2021-01-12T06:52:49Z
day: '02'
department:
- _id: UlWa
doi: 10.1007/s00454-015-9679-9
intvolume: ' 53'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1408.4036
month: '04'
oa: 1
oa_version: Preprint
page: 587 - 620
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '5397'
quality_controlled: '1'
scopus_import: 1
status: public
title: Discrete systolic inequalities and decompositions of triangulated surfaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 53
year: '2015'
...
---
_id: '1731'
abstract:
- lang: eng
text: 'We consider two-player zero-sum games on graphs. These games can be classified
on the basis of the information of the players and on the mode of interaction
between them. On the basis of information the classification is as follows: (a)
partial-observation (both players have partial view of the game); (b) one-sided
complete-observation (one player has complete observation); and (c) complete-observation
(both players have complete view of the game). On the basis of mode of interaction
we have the following classification: (a) concurrent (both players interact simultaneously);
and (b) turn-based (both players interact in turn). The two sources of randomness
in these games are randomness in transition function and randomness in strategies.
In general, randomized strategies are more powerful than deterministic strategies,
and randomness in transitions gives more general classes of games. In this work
we present a complete characterization for the classes of games where randomness
is not helpful in: (a) the transition function probabilistic transition can be
simulated by deterministic transition); and (b) strategies (pure strategies are
as powerful as randomized strategies). As consequence of our characterization
we obtain new undecidability results for these games. '
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Hugo
full_name: Gimbert, Hugo
last_name: Gimbert
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Chatterjee K, Doyen L, Gimbert H, Henzinger TA. Randomness for free. Information
and Computation. 2015;245(12):3-16. doi:10.1016/j.ic.2015.06.003
apa: Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2015). Randomness
for free. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.06.003
chicago: Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger.
“Randomness for Free.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.06.003.
ieee: K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for
free,” Information and Computation, vol. 245, no. 12. Elsevier, pp. 3–16,
2015.
ista: Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2015. Randomness for free.
Information and Computation. 245(12), 3–16.
mla: Chatterjee, Krishnendu, et al. “Randomness for Free.” Information and Computation,
vol. 245, no. 12, Elsevier, 2015, pp. 3–16, doi:10.1016/j.ic.2015.06.003.
short: K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation
245 (2015) 3–16.
date_created: 2018-12-11T11:53:42Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2023-02-23T11:45:42Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2015.06.003
ec_funded: 1
intvolume: ' 245'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1006.0673
month: '12'
oa: 1
oa_version: Preprint
page: 3 - 16
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
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '5395'
quality_controlled: '1'
related_material:
record:
- id: '3856'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Randomness for free
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 245
year: '2015'
...
---
_id: '1732'
abstract:
- lang: eng
text: We consider partially observable Markov decision processes (POMDPs), that
are a standard framework for robotics applications to model uncertainties present
in the real world, with temporal logic specifications. All temporal logic specifications
in linear-time temporal logic (LTL) can be expressed as parity objectives. We
study the qualitative analysis problem for POMDPs with parity objectives that
asks whether there is a controller (policy) to ensure that the objective holds
with probability 1 (almost-surely). While the qualitative analysis of POMDPs with
parity objectives is undecidable, recent results show that when restricted to
finite-memory policies the problem is EXPTIME-complete. While the problem is intractable
in theory, we present a practical approach to solve the qualitative analysis problem.
We designed several heuristics to deal with the exponential complexity, and have
used our implementation on a number of well-known POMDP examples for robotics
applications. Our results provide the first practical approach to solve the qualitative
analysis of robot motion planning with LTL properties in the presence of uncertainty.
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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
citation:
ama: 'Chatterjee K, Chmelik M, Gupta R, Kanodia A. Qualitative analysis of POMDPs
with temporal logic specifications for robotics applications. In: IEEE; 2015:325-330.
doi:10.1109/ICRA.2015.7139019'
apa: 'Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Qualitative
analysis of POMDPs with temporal logic specifications for robotics applications
(pp. 325–330). Presented at the ICRA: International Conference on Robotics and
Automation, Seattle, WA, United States: IEEE. https://doi.org/10.1109/ICRA.2015.7139019'
chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia.
“Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics
Applications,” 325–30. IEEE, 2015. https://doi.org/10.1109/ICRA.2015.7139019.
ieee: 'K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis
of POMDPs with temporal logic specifications for robotics applications,” presented
at the ICRA: International Conference on Robotics and Automation, Seattle, WA,
United States, 2015, pp. 325–330.'
ista: 'Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of
POMDPs with temporal logic specifications for robotics applications. ICRA: International
Conference on Robotics and Automation, 325–330.'
mla: Chatterjee, Krishnendu, et al. Qualitative Analysis of POMDPs with Temporal
Logic Specifications for Robotics Applications. IEEE, 2015, pp. 325–30, doi:10.1109/ICRA.2015.7139019.
short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.
conference:
end_date: 2015-05-30
location: Seattle, WA, United States
name: 'ICRA: International Conference on Robotics and Automation'
start_date: 2015-05-26
date_created: 2018-12-11T11:53:43Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:52Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/ICRA.2015.7139019
ec_funded: 1
external_id:
arxiv:
- '1409.3360'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1409.3360
month: '01'
oa: 1
oa_version: Preprint
page: 325 - 330
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_status: published
publisher: IEEE
publist_id: '5394'
quality_controlled: '1'
related_material:
record:
- id: '5424'
relation: earlier_version
status: public
- id: '5426'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Qualitative analysis of POMDPs with temporal logic specifications for robotics
applications
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1734'
abstract:
- lang: eng
text: Facial appearance capture is now firmly established within academic research
and used extensively across various application domains, perhaps most prominently
in the entertainment industry through the design of virtual characters in video
games and films. While significant progress has occurred over the last two decades,
no single survey currently exists that discusses the similarities, differences,
and practical considerations of the available appearance capture techniques as
applied to human faces. A central difficulty of facial appearance capture is the
way light interacts with skin-which has a complex multi-layered structure-and
the interactions that occur below the skin surface can, by definition, only be
observed indirectly. In this report, we distinguish between two broad strategies
for dealing with this complexity. "Image-based methods" try to exhaustively
capture the exact face appearance under different lighting and viewing conditions,
and then render the face through weighted image combinations. "Parametric
methods" instead fit the captured reflectance data to some parametric appearance
model used during rendering, allowing for a more lightweight and flexible representation
but at the cost of potentially increased rendering complexity or inexact reproduction.
The goal of this report is to provide an overview that can guide practitioners
and researchers in assessing the tradeoffs between current approaches and identifying
directions for future advances in facial appearance capture.
author:
- first_name: Oliver
full_name: Klehm, Oliver
last_name: Klehm
- first_name: Fabrice
full_name: Rousselle, Fabrice
last_name: Rousselle
- first_name: Marios
full_name: Papas, Marios
last_name: Papas
- first_name: Derek
full_name: Bradley, Derek
last_name: Bradley
- first_name: Christophe
full_name: Hery, Christophe
last_name: Hery
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Wojciech
full_name: Jarosz, Wojciech
last_name: Jarosz
- first_name: Thabo
full_name: Beeler, Thabo
last_name: Beeler
citation:
ama: Klehm O, Rousselle F, Papas M, et al. Recent advances in facial appearance
capture. Computer Graphics Forum. 2015;34(2):709-733. doi:10.1111/cgf.12594
apa: Klehm, O., Rousselle, F., Papas, M., Bradley, D., Hery, C., Bickel, B., … Beeler,
T. (2015). Recent advances in facial appearance capture. Computer Graphics
Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12594
chicago: Klehm, Oliver, Fabrice Rousselle, Marios Papas, Derek Bradley, Christophe
Hery, Bernd Bickel, Wojciech Jarosz, and Thabo Beeler. “Recent Advances in Facial
Appearance Capture.” Computer Graphics Forum. Wiley-Blackwell, 2015. https://doi.org/10.1111/cgf.12594.
ieee: O. Klehm et al., “Recent advances in facial appearance capture,” Computer
Graphics Forum, vol. 34, no. 2. Wiley-Blackwell, pp. 709–733, 2015.
ista: Klehm O, Rousselle F, Papas M, Bradley D, Hery C, Bickel B, Jarosz W, Beeler
T. 2015. Recent advances in facial appearance capture. Computer Graphics Forum.
34(2), 709–733.
mla: Klehm, Oliver, et al. “Recent Advances in Facial Appearance Capture.” Computer
Graphics Forum, vol. 34, no. 2, Wiley-Blackwell, 2015, pp. 709–33, doi:10.1111/cgf.12594.
short: O. Klehm, F. Rousselle, M. Papas, D. Bradley, C. Hery, B. Bickel, W. Jarosz,
T. Beeler, Computer Graphics Forum 34 (2015) 709–733.
date_created: 2018-12-11T11:53:43Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2021-01-12T06:52:52Z
day: '01'
department:
- _id: BeBi
doi: 10.1111/cgf.12594
intvolume: ' 34'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://graphics.ethz.ch/~mpapas/publications/fac_star.pdf
month: '05'
oa_version: None
page: 709 - 733
publication: Computer Graphics Forum
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5391'
quality_controlled: '1'
scopus_import: 1
status: public
title: Recent advances in facial appearance capture
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1735'
abstract:
- lang: eng
text: This work presents a method for efficiently simplifying the pressure projection
step in a liquid simulation. We first devise a straightforward dimension reduction
technique that dramatically reduces the cost of solving the pressure projection.
Next, we introduce a novel change of basis that satisfies free-surface boundary
conditions exactly, regardless of the accuracy of the pressure solve. When combined,
these ideas greatly reduce the computational complexity of the pressure solve
without compromising free surface boundary conditions at the highest level of
detail. Our techniques are easy to parallelize, and they effectively eliminate
the computational bottleneck for large liquid simulations.
acknowledgement: The first author was supported by a JSPS Postdoctoral Fellowship
for Research Abroad
author:
- first_name: Ryoichi
full_name: Ando, Ryoichi
last_name: Ando
- first_name: Nils
full_name: Thürey, Nils
last_name: Thürey
- 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: Ando R, Thürey N, Wojtan C. A dimension-reduced pressure solver for liquid
simulations. Computer Graphics Forum. 2015;34(2):473-480. doi:10.1111/cgf.12576
apa: Ando, R., Thürey, N., & Wojtan, C. (2015). A dimension-reduced pressure
solver for liquid simulations. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12576
chicago: Ando, Ryoichi, Nils Thürey, and Chris Wojtan. “A Dimension-Reduced Pressure
Solver for Liquid Simulations.” Computer Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12576.
ieee: R. Ando, N. Thürey, and C. Wojtan, “A dimension-reduced pressure solver for
liquid simulations,” Computer Graphics Forum, vol. 34, no. 2. Wiley, pp.
473–480, 2015.
ista: Ando R, Thürey N, Wojtan C. 2015. A dimension-reduced pressure solver for
liquid simulations. Computer Graphics Forum. 34(2), 473–480.
mla: Ando, Ryoichi, et al. “A Dimension-Reduced Pressure Solver for Liquid Simulations.”
Computer Graphics Forum, vol. 34, no. 2, Wiley, 2015, pp. 473–80, doi:10.1111/cgf.12576.
short: R. Ando, N. Thürey, C. Wojtan, Computer Graphics Forum 34 (2015) 473–480.
date_created: 2018-12-11T11:53:44Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2023-02-23T10:12:11Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/cgf.12576
file:
- access_level: open_access
checksum: 590752bf977855b337a80f78a9bc2404
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:30Z
date_updated: 2020-07-14T12:45:15Z
file_id: '5218'
file_name: IST-2016-607-v1+1_coarsegrid.pdf
file_size: 6312352
relation: main_file
file_date_updated: 2020-07-14T12:45:15Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 473 - 480
publication: Computer Graphics Forum
publication_status: published
publisher: Wiley
publist_id: '5389'
pubrep_id: '607'
quality_controlled: '1'
scopus_import: 1
status: public
title: A dimension-reduced pressure solver for liquid simulations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1789'
abstract:
- lang: eng
text: Intellectual disability (ID) has an estimated prevalence of 2-3%. Due to its
extreme heterogeneity, the genetic basis of ID remains elusive in many cases.
Recently, whole exome sequencing (WES) studies revealed that a large proportion
of sporadic cases are caused by de novo gene variants. To identify further genes
involved in ID, we performed WES in 250 patients with unexplained ID and their
unaffected parents and included exomes of 51 previously sequenced child-parents
trios in the analysis. Exome analysis revealed de novo intragenic variants in
SET domain-containing 5 (SETD5) in two patients. One patient carried a nonsense
variant, and the other an 81 bp deletion located across a splice-donor site. Chromosomal
microarray diagnostics further identified four de novo non-recurrent microdeletions
encompassing SETD5. CRISPR/Cas9 mutation modelling of the two intragenic variants
demonstrated nonsense-mediated decay of the resulting transcripts, pointing to
a loss-of-function (LoF) and haploinsufficiency as the common disease-causing
mechanism of intragenic SETD5 sequence variants and SETD5-containing microdeletions.
In silico domain prediction of SETD5, a predicted SET domain-containing histone
methyltransferase (HMT), substantiated the presence of a SET domain and identified
a novel putative PHD domain, strengthening a functional link to well-known histone-modifying
ID genes. All six patients presented with ID and certain facial dysmorphisms,
suggesting that SETD5 sequence variants contribute substantially to the microdeletion
3p25.3 phenotype. The present report of two SETD5 LoF variants in 301 patients
demonstrates a prevalence of 0.7% and thus SETD5 variants as a relatively frequent
cause of ID.
author:
- first_name: Alma
full_name: Kuechler, Alma
last_name: Kuechler
- first_name: Alexander
full_name: Zink, Alexander
last_name: Zink
- first_name: Thomas
full_name: Wieland, Thomas
last_name: Wieland
- first_name: Hermann
full_name: Lüdecke, Hermann
last_name: Lüdecke
- first_name: Kirsten
full_name: Cremer, Kirsten
last_name: Cremer
- first_name: Leonardo
full_name: Salviati, Leonardo
last_name: Salviati
- first_name: Pamela
full_name: Magini, Pamela
last_name: Magini
- first_name: Kimia
full_name: Najafi, Kimia
last_name: Najafi
- first_name: Christiane
full_name: Zweier, Christiane
last_name: Zweier
- first_name: Johanna
full_name: Czeschik, Johanna
last_name: Czeschik
- first_name: Stefan
full_name: Aretz, Stefan
last_name: Aretz
- first_name: Sabine
full_name: Endele, Sabine
last_name: Endele
- first_name: Federica
full_name: Tamburrino, Federica
last_name: Tamburrino
- first_name: Claudia
full_name: Pinato, Claudia
last_name: Pinato
- first_name: Maurizio
full_name: Clementi, Maurizio
last_name: Clementi
- first_name: Jasmin
full_name: Gundlach, Jasmin
last_name: Gundlach
- first_name: Carina
full_name: Maylahn, Carina
last_name: Maylahn
- first_name: Laura
full_name: Mazzanti, Laura
last_name: Mazzanti
- first_name: Eva
full_name: Wohlleber, Eva
last_name: Wohlleber
- first_name: Thomas
full_name: Schwarzmayr, Thomas
last_name: Schwarzmayr
- first_name: Roxana
full_name: Kariminejad, Roxana
last_name: Kariminejad
- first_name: Avner
full_name: Schlessinger, Avner
last_name: Schlessinger
- first_name: Dagmar
full_name: Wieczorek, Dagmar
last_name: Wieczorek
- first_name: Tim
full_name: Strom, Tim
last_name: Strom
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Hartmut
full_name: Engels, Hartmut
last_name: Engels
citation:
ama: Kuechler A, Zink A, Wieland T, et al. Loss-of-function variants of SETD5 cause
intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome.
European Journal of Human Genetics. 2015;23(6):753-760. doi:10.1038/ejhg.2014.165
apa: Kuechler, A., Zink, A., Wieland, T., Lüdecke, H., Cremer, K., Salviati, L.,
… Engels, H. (2015). Loss-of-function variants of SETD5 cause intellectual disability
and the core phenotype of microdeletion 3p25.3 syndrome. European Journal of
Human Genetics. Nature Publishing Group. https://doi.org/10.1038/ejhg.2014.165
chicago: Kuechler, Alma, Alexander Zink, Thomas Wieland, Hermann Lüdecke, Kirsten
Cremer, Leonardo Salviati, Pamela Magini, et al. “Loss-of-Function Variants of
SETD5 Cause Intellectual Disability and the Core Phenotype of Microdeletion 3p25.3
Syndrome.” European Journal of Human Genetics. Nature Publishing Group,
2015. https://doi.org/10.1038/ejhg.2014.165.
ieee: A. Kuechler et al., “Loss-of-function variants of SETD5 cause intellectual
disability and the core phenotype of microdeletion 3p25.3 syndrome,” European
Journal of Human Genetics, vol. 23, no. 6. Nature Publishing Group, pp. 753–760,
2015.
ista: Kuechler A, Zink A, Wieland T, Lüdecke H, Cremer K, Salviati L, Magini P,
Najafi K, Zweier C, Czeschik J, Aretz S, Endele S, Tamburrino F, Pinato C, Clementi
M, Gundlach J, Maylahn C, Mazzanti L, Wohlleber E, Schwarzmayr T, Kariminejad
R, Schlessinger A, Wieczorek D, Strom T, Novarino G, Engels H. 2015. Loss-of-function
variants of SETD5 cause intellectual disability and the core phenotype of microdeletion
3p25.3 syndrome. European Journal of Human Genetics. 23(6), 753–760.
mla: Kuechler, Alma, et al. “Loss-of-Function Variants of SETD5 Cause Intellectual
Disability and the Core Phenotype of Microdeletion 3p25.3 Syndrome.” European
Journal of Human Genetics, vol. 23, no. 6, Nature Publishing Group, 2015,
pp. 753–60, doi:10.1038/ejhg.2014.165.
short: A. Kuechler, A. Zink, T. Wieland, H. Lüdecke, K. Cremer, L. Salviati, P.
Magini, K. Najafi, C. Zweier, J. Czeschik, S. Aretz, S. Endele, F. Tamburrino,
C. Pinato, M. Clementi, J. Gundlach, C. Maylahn, L. Mazzanti, E. Wohlleber, T.
Schwarzmayr, R. Kariminejad, A. Schlessinger, D. Wieczorek, T. Strom, G. Novarino,
H. Engels, European Journal of Human Genetics 23 (2015) 753–760.
date_created: 2018-12-11T11:54:01Z
date_published: 2015-06-15T00:00:00Z
date_updated: 2021-01-12T06:53:12Z
day: '15'
department:
- _id: GaNo
doi: 10.1038/ejhg.2014.165
external_id:
pmid:
- '25138099'
intvolume: ' 23'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4795044/
month: '06'
oa: 1
oa_version: Submitted Version
page: 753 - 760
pmid: 1
publication: European Journal of Human Genetics
publication_status: published
publisher: Nature Publishing Group
publist_id: '5324'
quality_controlled: '1'
status: public
title: Loss-of-function variants of SETD5 cause intellectual disability and the core
phenotype of microdeletion 3p25.3 syndrome
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2015'
...
---
_id: '1792'
abstract:
- lang: eng
text: Motivated by recent ideas of Harman (Unif. Distrib. Theory, 2010) we develop
a new concept of variation of multivariate functions on a compact Hausdorff space
with respect to a collection D of subsets. We prove a general version of the Koksma-Hlawka
theorem that holds for this notion of variation and discrepancy with respect to
D. As special cases, we obtain Koksma-Hlawka inequalities for classical notions,
such as extreme or isotropic discrepancy. For extreme discrepancy, our result
coincides with the usual Koksma-Hlawka theorem. We show that the space of functions
of bounded D-variation contains important discontinuous functions and is closed
under natural algebraic operations. Finally, we illustrate the results on concrete
integration problems from integral geometry and stereology.
acknowledgement: F.P. is supported by the Graduate School of IST Austria, A.M.S is
supported by the Centre for Stochastic Geometry and Advanced Bioimaging funded by
a grant from the Villum Foundation.
author:
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
- first_name: Anne
full_name: Svane, Anne
last_name: Svane
citation:
ama: Pausinger F, Svane A. A Koksma-Hlawka inequality for general discrepancy systems.
Journal of Complexity. 2015;31(6):773-797. doi:10.1016/j.jco.2015.06.002
apa: Pausinger, F., & Svane, A. (2015). A Koksma-Hlawka inequality for general
discrepancy systems. Journal of Complexity. Academic Press. https://doi.org/10.1016/j.jco.2015.06.002
chicago: Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General
Discrepancy Systems.” Journal of Complexity. Academic Press, 2015. https://doi.org/10.1016/j.jco.2015.06.002.
ieee: F. Pausinger and A. Svane, “A Koksma-Hlawka inequality for general discrepancy
systems,” Journal of Complexity, vol. 31, no. 6. Academic Press, pp. 773–797,
2015.
ista: Pausinger F, Svane A. 2015. A Koksma-Hlawka inequality for general discrepancy
systems. Journal of Complexity. 31(6), 773–797.
mla: Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General
Discrepancy Systems.” Journal of Complexity, vol. 31, no. 6, Academic Press,
2015, pp. 773–97, doi:10.1016/j.jco.2015.06.002.
short: F. Pausinger, A. Svane, Journal of Complexity 31 (2015) 773–797.
date_created: 2018-12-11T11:54:02Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2023-09-07T11:41:25Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.jco.2015.06.002
intvolume: ' 31'
issue: '6'
language:
- iso: eng
month: '12'
oa_version: None
page: 773 - 797
publication: Journal of Complexity
publication_status: published
publisher: Academic Press
publist_id: '5320'
quality_controlled: '1'
related_material:
record:
- id: '1399'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: A Koksma-Hlawka inequality for general discrepancy systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2015'
...