---
_id: '11631'
abstract:
- lang: eng
text: "The recently launched NASA Transiting Exoplanet Survey Satellite (TESS) mission
is going to collect lightcurves for a few hundred million of stars and we expect
to increase the number of pulsating stars to analyze compared to the few thousand
stars observed by the CoRoT, Kepler and K2 missions. However, most of the TESS
targets have not yet been properly classified and characterized. In order to improve
the analysis of the TESS data, it is crucial to determine the type of stellar
pulsations in a timely manner. We propose an automatic method to classify stars
attending to their pulsation properties, in particular, to identify solar-like
pulsators among all TESS targets. It relies on the use of the global amount of
power contained in the power spectrum (already known as the FliPer method) as
a key parameter, along with\r\nthe effective temperature, to feed into a machine
learning classifier. Our study, based on TESS simulated datasets, shows that we
are able to classify pulsators with a 98% accuracy."
article_number: '1811.12140'
article_processing_charge: No
arxiv: 1
author:
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: G. R.
full_name: Davies, G. R.
last_name: Davies
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
- first_name: O. J.
full_name: Hall, O. J.
last_name: Hall
- first_name: B. M.
full_name: Rendle, B. M.
last_name: Rendle
citation:
ama: 'Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying
TESS pulsating stars. arXiv. doi:10.48550/arXiv.1811.12140'
apa: 'Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Hall, O. J., &
Rendle, B. M. (n.d.). FliPer: Classifying TESS pulsating stars. arXiv.
https://doi.org/10.48550/arXiv.1811.12140'
chicago: 'Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, O. J. Hall,
and B. M. Rendle. “FliPer: Classifying TESS Pulsating Stars.” ArXiv, n.d.
https://doi.org/10.48550/arXiv.1811.12140.'
ieee: 'L. A. Bugnet, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M.
Rendle, “FliPer: Classifying TESS pulsating stars,” arXiv. .'
ista: 'Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying
TESS pulsating stars. arXiv, 1811.12140.'
mla: 'Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.”
ArXiv, 1811.12140, doi:10.48550/arXiv.1811.12140.'
short: L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle,
ArXiv (n.d.).
date_created: 2022-07-21T07:05:23Z
date_published: 2018-11-29T00:00:00Z
date_updated: 2022-08-22T08:41:55Z
day: '29'
doi: 10.48550/arXiv.1811.12140
extern: '1'
external_id:
arxiv:
- '1811.12140'
keyword:
- asteroseismology - methods
- data analysis - stars
- oscillations
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1811.12140'
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
status: public
title: 'FliPer: Classifying TESS pulsating stars'
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '11657'
abstract:
- lang: eng
text: The minimum cut problem for an undirected edge-weighted graph asks us to divide
its set of nodes into two blocks while minimizing the weight sum of the cut edges.
Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm
is based on cluster contraction using label propagation and Padberg and Rinaldi’s
contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory
parallel implementations of our algorithm. Extensive experiments on both real-world
and generated instances show that our algorithm finds the optimal cut on nearly
all instances significantly faster than other state-of-the-art exact algorithms,
and our error rate is lower than that of other heuristic algorithms. In addition,
our parallel algorithm runs a factor 7.5× faster on average when using 32 threads.
To further speed up computations, we also give a version of our algorithm that
performs random edge contractions as preprocessing. This version achieves a lower
running time and better parallel scalability at the expense of a higher error
rate.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Alexander
full_name: Noe, Alexander
last_name: Noe
- first_name: Christian
full_name: Schulz, Christian
last_name: Schulz
- first_name: Darren
full_name: Strash, Darren
last_name: Strash
citation:
ama: Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms.
ACM Journal of Experimental Algorithmics. 2018;23:1-22. doi:10.1145/3274662
apa: Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum
cut algorithms. ACM Journal of Experimental Algorithmics. Association for
Computing Machinery. https://doi.org/10.1145/3274662
chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash.
“Practical Minimum Cut Algorithms.” ACM Journal of Experimental Algorithmics.
Association for Computing Machinery, 2018. https://doi.org/10.1145/3274662.
ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut
algorithms,” ACM Journal of Experimental Algorithmics, vol. 23. Association
for Computing Machinery, pp. 1–22, 2018.
ista: Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms.
ACM Journal of Experimental Algorithmics. 23, 1–22.
mla: Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” ACM Journal
of Experimental Algorithmics, vol. 23, Association for Computing Machinery,
2018, pp. 1–22, doi:10.1145/3274662.
short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental
Algorithmics 23 (2018) 1–22.
date_created: 2022-07-27T08:28:26Z
date_published: 2018-10-01T00:00:00Z
date_updated: 2022-09-09T11:32:52Z
day: '01'
doi: 10.1145/3274662
extern: '1'
external_id:
arxiv:
- '1708.06127'
intvolume: ' 23'
keyword:
- Theoretical Computer Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1708.06127
month: '10'
oa: 1
oa_version: Preprint
page: 1-22
publication: ACM Journal of Experimental Algorithmics
publication_identifier:
eissn:
- 1084-6654
issn:
- 1084-6654
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Practical minimum cut algorithms
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2018'
...
---
_id: '11664'
abstract:
- lang: eng
text: "We present a deterministic incremental algorithm for exactly maintaining
the size of a minimum cut with O(log3 n log log2 n) amortized time per edge insertion
and O(1) query time. This result partially answers an open question posed by Thorup
(2007). It also stays in sharp contrast to a polynomial conditional lower bound
for the fully dynamic weighted minimum cut problem. Our algorithm is obtained
by combining a sparsification technique of Kawarabayashi and Thorup (2015) or
its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental
algorithm of Henzinger (1997).\r\n\r\nWe also study space-efficient incremental
algorithms for the minimum cut problem. Concretely, we show that there exists
an O(nlog n/ε2) space Monte Carlo algorithm that can process a stream of edge
insertions starting from an empty graph, and with high probability, the algorithm
maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n)
log3 n)/ε 2) amortized update time and constant query time, where α (n) stands
for the inverse of Ackermann function."
acknowledgement: "We thank the two anonymous reviewers for their suggestions and comments,
which improved the\r\nquality of the article."
article_number: '17'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Mikkel
full_name: Thorup, Mikkel
last_name: Thorup
citation:
ama: Goranci G, Henzinger MH, Thorup M. Incremental exact min-cut in polylogarithmic
amortized update time. ACM Transactions on Algorithms. 2018;14(2). doi:10.1145/3174803
apa: Goranci, G., Henzinger, M. H., & Thorup, M. (2018). Incremental exact min-cut
in polylogarithmic amortized update time. ACM Transactions on Algorithms.
Association for Computing Machinery. https://doi.org/10.1145/3174803
chicago: Goranci, Gramoz, Monika H Henzinger, and Mikkel Thorup. “Incremental Exact
Min-Cut in Polylogarithmic Amortized Update Time.” ACM Transactions on Algorithms.
Association for Computing Machinery, 2018. https://doi.org/10.1145/3174803.
ieee: G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in
polylogarithmic amortized update time,” ACM Transactions on Algorithms,
vol. 14, no. 2. Association for Computing Machinery, 2018.
ista: Goranci G, Henzinger MH, Thorup M. 2018. Incremental exact min-cut in polylogarithmic
amortized update time. ACM Transactions on Algorithms. 14(2), 17.
mla: Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Polylogarithmic Amortized
Update Time.” ACM Transactions on Algorithms, vol. 14, no. 2, 17, Association
for Computing Machinery, 2018, doi:10.1145/3174803.
short: G. Goranci, M.H. Henzinger, M. Thorup, ACM Transactions on Algorithms 14
(2018).
date_created: 2022-07-27T11:29:39Z
date_published: 2018-04-01T00:00:00Z
date_updated: 2022-09-09T11:38:14Z
day: '01'
doi: 10.1145/3174803
extern: '1'
external_id:
arxiv:
- '1611.06500'
intvolume: ' 14'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1611.06500
month: '04'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Algorithms
publication_identifier:
eissn:
- 1549-6333
issn:
- 1549-6325
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental exact min-cut in polylogarithmic amortized update time
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2018'
...
---
_id: '11667'
abstract:
- lang: eng
text: The focus of classic mechanism design has been on truthful direct-revelation
mechanisms. In the context of combinatorial auctions, the truthful direct-revelation
mechanism that maximizes social welfare is the Vickrey-Clarke-Groves mechanism.
For many valuation spaces, computing the allocation and payments of the VCG mechanism,
however, is a computationally hard problem. We thus study the performance of the
VCG mechanism when bidders are forced to choose bids from a subspace of the valuation
space for which the VCG outcome can be computed efficiently. We prove improved
upper bounds on the welfare loss for restrictions to additive bids and upper and
lower bounds for restrictions to non-additive bids. These bounds show that increased
expressiveness can give rise to additional equilibria of poorer efficiency.
article_number: '5'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- 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: Martin
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based
combinatorial auctions. ACM Transactions on Economics and Computation.
2018;6(2). doi:10.1145/3232860
apa: Dütting, P., Henzinger, M. H., & Starnberger, M. (2018). Valuation compressions
in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation.
Association for Computing Machinery. https://doi.org/10.1145/3232860
chicago: Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions
in VCG-Based Combinatorial Auctions.” ACM Transactions on Economics and Computation.
Association for Computing Machinery, 2018. https://doi.org/10.1145/3232860.
ieee: P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in
VCG-based combinatorial auctions,” ACM Transactions on Economics and Computation,
vol. 6, no. 2. Association for Computing Machinery, 2018.
ista: Dütting P, Henzinger MH, Starnberger M. 2018. Valuation compressions in VCG-based
combinatorial auctions. ACM Transactions on Economics and Computation. 6(2), 5.
mla: Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.”
ACM Transactions on Economics and Computation, vol. 6, no. 2, 5, Association
for Computing Machinery, 2018, doi:10.1145/3232860.
short: P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics
and Computation 6 (2018).
date_created: 2022-07-27T11:46:46Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2022-09-09T12:04:42Z
day: '01'
doi: 10.1145/3232860
extern: '1'
external_id:
arxiv:
- '1310.3153'
intvolume: ' 6'
issue: '2'
keyword:
- Theory of computation
- Algorithmic game theory and mechanism design
- Applied computing
- Economics
- Simplified mechanisms
- Combinatorial auctions with item bidding
- Price of anarchy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1310.3153
month: '05'
oa: 1
oa_version: Preprint
publication: ACM Transactions on Economics and Computation
publication_identifier:
eissn:
- 2167-8383
issn:
- 2167-8375
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Valuation compressions in VCG-based combinatorial auctions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2018'
...
---
_id: '11757'
abstract:
- lang: eng
text: We develop a dynamic version of the primal-dual method for optimization problems,
and apply it to obtain the following results. (1) For the dynamic set-cover problem,
we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n))
amortized update time, where f is the maximum “frequency” of an element, n is
the number of sets, and m is the maximum number of elements in the universe at
any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately
optimal solution in O (log3 n) amortized update time, where n is the number of
nodes in the graph.
article_processing_charge: No
article_type: original
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- 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: Giuseppe
full_name: Italiano, Giuseppe
last_name: Italiano
citation:
ama: Bhattacharya S, Henzinger MH, Italiano G. Dynamic algorithms via the primal-dual
method. Information and Computation. 2018;261(08):219-239. doi:10.1016/j.ic.2018.02.005
apa: Bhattacharya, S., Henzinger, M. H., & Italiano, G. (2018). Dynamic algorithms
via the primal-dual method. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2018.02.005
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe Italiano. “Dynamic
Algorithms via the Primal-Dual Method.” Information and Computation. Elsevier,
2018. https://doi.org/10.1016/j.ic.2018.02.005.
ieee: S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via
the primal-dual method,” Information and Computation, vol. 261, no. 08.
Elsevier, pp. 219–239, 2018.
ista: Bhattacharya S, Henzinger MH, Italiano G. 2018. Dynamic algorithms via the
primal-dual method. Information and Computation. 261(08), 219–239.
mla: Bhattacharya, Sayan, et al. “Dynamic Algorithms via the Primal-Dual Method.”
Information and Computation, vol. 261, no. 08, Elsevier, 2018, pp. 219–39,
doi:10.1016/j.ic.2018.02.005.
short: S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation
261 (2018) 219–239.
date_created: 2022-08-08T11:20:03Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-02-10T07:27:39Z
day: '01'
doi: 10.1016/j.ic.2018.02.005
extern: '1'
intvolume: ' 261'
issue: '08'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.ic.2018.02.005
month: '08'
oa: 1
oa_version: Published Version
page: 219-239
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic algorithms via the primal-dual method
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 261
year: '2018'
...
---
_id: '11768'
abstract:
- lang: eng
text: "In the decremental single-source shortest paths (SSSP) problem, we want to
maintain the distances between a given source node s and every other node in an
n-node m-edge graph G undergoing edge deletions. While its static counterpart
can be solved in near-linear time, this decremental problem is much more challenging
even in the undirected unweighted case. In this case, the classic O(mn) total
update time of Even and Shiloach [16] has been the fastest known algorithm for
three decades. At the cost of a (1+ϵ)-approximation factor, the running time was
recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we
bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm
with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover,
we obtain m1+o(1) log W time for the weighted case, where the edge weights are
integers from 1 to W. The only prior work on weighted graphs in o(mn) time is
the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for
directed graphs with quasi-polynomial edge weights. The expected running time
bound of our algorithm holds against an oblivious adversary.\r\n\r\nIn contrast
to the previous results, which rely on maintaining a sparse emulator, our algorithm
relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12]
in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted
edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated
by their h-hop distance (given by a path containing at most h edges) on G′=(V,
E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in
near-linear time under edge deletions. It is the first of its kind to the best
of our knowledge. To maintain approximate distances using this hop set, we extend
the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the
bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools
might be of independent interest."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest
paths on undirected graphs in near-linear total update time. Journal of the
ACM. 2018;65(6):1-40. doi:10.1145/3218657
apa: Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2018). Decremental single-source
shortest paths on undirected graphs in near-linear total update time. Journal
of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3218657
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental
Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update
Time.” Journal of the ACM. Association for Computing Machinery, 2018. https://doi.org/10.1145/3218657.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source
shortest paths on undirected graphs in near-linear total update time,” Journal
of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40,
2018.
ista: Henzinger MH, Krinninger S, Nanongkai D. 2018. Decremental single-source shortest
paths on undirected graphs in near-linear total update time. Journal of the ACM.
65(6), 1–40.
mla: Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected
Graphs in near-Linear Total Update Time.” Journal of the ACM, vol. 65,
no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:10.1145/3218657.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018)
1–40.
date_created: 2022-08-08T12:33:17Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2023-02-21T16:30:41Z
day: '01'
doi: 10.1145/3218657
extern: '1'
external_id:
arxiv:
- '1512.08148'
intvolume: ' 65'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1512.08148
month: '12'
oa: 1
oa_version: Preprint
page: 1-40
publication: Journal of the ACM
publication_identifier:
eissn:
- 1557-735X
issn:
- 0004-5411
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '11855'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Decremental single-source shortest paths on undirected graphs in near-linear
total update time
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 65
year: '2018'
...
---
_id: '7783'
abstract:
- lang: eng
text: The Drosophila Genetic Reference Panel (DGRP) serves as a valuable resource
to better understand the genetic landscapes underlying quantitative traits. However,
such DGRP studies have so far only focused on nuclear genetic variants. To address
this, we sequenced the mitochondrial genomes of >170 DGRP lines, identifying 229
variants including 21 indels and 7 frameshifts. We used our mitochondrial variation
data to identify 12 genetically distinct mitochondrial haplotypes, thus revealing
important population structure at the mitochondrial level. We further examined
whether this population structure was reflected on the nuclear genome by screening
for the presence of potential mito-nuclear genetic incompatibilities in the form
of significant genotype ratio distortions (GRDs) between mitochondrial and nuclear
variants. In total, we detected a remarkable 1,845 mito-nuclear GRDs, with the
highest enrichment observed in a 40 kb region around the gene Sex-lethal (Sxl).
Intriguingly, downstream phenotypic analyses did not uncover major fitness effects
associated with these GRDs, suggesting that a large number of mito-nuclear GRDs
may reflect population structure at the mitochondrial level rather than actual
genomic incompatibilities. This is further supported by the GRD landscape showing
particular large genomic regions associated with a single mitochondrial haplotype.
Next, we explored the functional relevance of the detected mitochondrial haplotypes
through an association analysis on a set of 259 assembled, non-correlating DGRP
phenotypes. We found multiple significant associations with stress- and metabolism-related
phenotypes, including food intake in males. We validated the latter observation
by reciprocal swapping of mitochondrial genomes from high food intake DGRP lines
to low food intake ones. In conclusion, our study uncovered important mitochondrial
population structure and haplotype-specific metabolic variation in the DGRP, thus
demonstrating the significance of incorporating mitochondrial haplotypes in geno-phenotype
relationship studies.
article_processing_charge: No
author:
- first_name: Roel P.J.
full_name: Bevers, Roel P.J.
last_name: Bevers
- first_name: Maria
full_name: Litovchenko, Maria
last_name: Litovchenko
- first_name: Adamandia
full_name: Kapopoulou, Adamandia
last_name: Kapopoulou
- first_name: Virginie S.
full_name: Braman, Virginie S.
last_name: Braman
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
- first_name: Johan
full_name: Auwerx, Johan
last_name: Auwerx
- first_name: Brian
full_name: Hollis, Brian
last_name: Hollis
- first_name: Bart
full_name: Deplancke, Bart
last_name: Deplancke
citation:
ama: Bevers RPJ, Litovchenko M, Kapopoulou A, et al. Extensive mitochondrial population
structure and haplotype-specific phenotypic variation in the Drosophila Genetic
Reference Panel. bioRxiv. 2018.
apa: Bevers, R. P. J., Litovchenko, M., Kapopoulou, A., Braman, V. S., Robinson,
M. R., Auwerx, J., … Deplancke, B. (2018). Extensive mitochondrial population
structure and haplotype-specific phenotypic variation in the Drosophila Genetic
Reference Panel. bioRxiv. Cold Spring Harbor Laboratory.
chicago: Bevers, Roel P.J., Maria Litovchenko, Adamandia Kapopoulou, Virginie S.
Braman, Matthew Richard Robinson, Johan Auwerx, Brian Hollis, and Bart Deplancke.
“Extensive Mitochondrial Population Structure and Haplotype-Specific Phenotypic
Variation in the Drosophila Genetic Reference Panel.” BioRxiv. Cold Spring
Harbor Laboratory, 2018.
ieee: R. P. J. Bevers et al., “Extensive mitochondrial population structure
and haplotype-specific phenotypic variation in the Drosophila Genetic Reference
Panel,” bioRxiv. Cold Spring Harbor Laboratory, 2018.
ista: Bevers RPJ, Litovchenko M, Kapopoulou A, Braman VS, Robinson MR, Auwerx J,
Hollis B, Deplancke B. 2018. Extensive mitochondrial population structure and
haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel.
bioRxiv, .
mla: Bevers, Roel P. J., et al. “Extensive Mitochondrial Population Structure and
Haplotype-Specific Phenotypic Variation in the Drosophila Genetic Reference Panel.”
BioRxiv, Cold Spring Harbor Laboratory, 2018.
short: R.P.J. Bevers, M. Litovchenko, A. Kapopoulou, V.S. Braman, M.R. Robinson,
J. Auwerx, B. Hollis, B. Deplancke, BioRxiv (2018).
date_created: 2020-04-30T13:09:37Z
date_published: 2018-11-09T00:00:00Z
date_updated: 2021-01-12T08:15:30Z
day: '09'
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'https://doi.org/10.1101/466771 '
month: '11'
oa: 1
oa_version: Preprint
page: '49'
publication: bioRxiv
publication_status: published
publisher: Cold Spring Harbor Laboratory
status: public
title: Extensive mitochondrial population structure and haplotype-specific phenotypic
variation in the Drosophila Genetic Reference Panel
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '78'
abstract:
- lang: eng
text: We provide a procedure for detecting the sub-segments of an incrementally
observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern
specification language, we use timed regular expressions, a formalism well-suited
for expressing properties of concurrent asynchronous behaviors embedded in metric
time. We construct a timed automaton accepting the timed language denoted by ϕ
and modify it slightly for the purpose of matching. We then apply zone-based reachability
computation to this automaton while it reads ω, and retrieve all the matching
segments from the results. Since the procedure is automaton based, it can be applied
to patterns specified by other formalisms such as timed temporal logics reducible
to timed automata or directly encoded as timed automata. The procedure has been
implemented and its performance on synthetic examples is demonstrated.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexey
full_name: Bakhirkin, Alexey
last_name: Bakhirkin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Dejan
full_name: Nickovic, Dejan
last_name: Nickovic
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Eugene
full_name: Asarin, Eugene
last_name: Asarin
citation:
ama: 'Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern
matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:10.1007/978-3-030-00151-3_13'
apa: 'Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., & Asarin, E. (2018).
Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented
at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China:
Springer. https://doi.org/10.1007/978-3-030-00151-3_13'
chicago: Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene
Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer,
2018. https://doi.org/10.1007/978-3-030-00151-3_13.
ieee: 'A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed
pattern matching using automata,” presented at the FORMATS: Formal Modeling and
Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.'
ista: 'Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed
pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed
Systems, LNCS, vol. 11022, 215–232.'
mla: Bakhirkin, Alexey, et al. Online Timed Pattern Matching Using Automata.
Vol. 11022, Springer, 2018, pp. 215–32, doi:10.1007/978-3-030-00151-3_13.
short: A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer,
2018, pp. 215–232.
conference:
end_date: 2018-09-06
location: Bejing, China
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:31Z
date_published: 2018-08-26T00:00:00Z
date_updated: 2023-09-13T09:35:46Z
day: '26'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-00151-3_13
external_id:
isi:
- '000884993200013'
file:
- access_level: open_access
checksum: 436b7574934324cfa7d1d3986fddc65b
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T11:34:34Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7831'
file_name: 2018_LNCS_Bakhirkin.pdf
file_size: 374851
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
intvolume: ' 11022'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 215 - 232
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
publication_identifier:
isbn:
- 978-3-030-00150-6
publication_status: published
publisher: Springer
publist_id: '7976'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online timed pattern matching using automata
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11022
year: '2018'
...
---
_id: '7812'
abstract:
- lang: eng
text: Deep neural networks (DNNs) continue to make significant advances, solving
tasks from image classification to translation or reinforcement learning. One
aspect of the field receiving considerable attention is efficiently executing
deep models in resource-constrained environments, such as mobile or embedded devices.
This paper focuses on this problem, and proposes two new compression methods,
which jointly leverage weight quantization and distillation of larger teacher
networks into smaller student networks. The first method we propose is called
quantized distillation and leverages distillation during the training process,
by incorporating distillation loss, expressed with respect to the teacher, into
the training of a student network whose weights are quantized to a limited set
of levels. The second method, differentiable quantization, optimizes the location
of quantization points through stochastic gradient descent, to better fit the
behavior of the teacher model. We validate both methods through experiments on
convolutional and recurrent architectures. We show that quantized shallow students
can reach similar accuracy levels to full-precision teacher models, while providing
order of magnitude compression, and inference speedup that is linear in the depth
reduction. In sum, our results enable DNNs for resource-constrained environments
to leverage architecture and accuracy advances developed on more powerful devices.
article_processing_charge: No
arxiv: 1
author:
- first_name: Antonio
full_name: Polino, Antonio
last_name: Polino
- first_name: Razvan
full_name: Pascanu, Razvan
last_name: Pascanu
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and
quantization. In: 6th International Conference on Learning Representations.
; 2018.'
apa: Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via
distillation and quantization. In 6th International Conference on Learning
Representations. Vancouver, Canada.
chicago: Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression
via Distillation and Quantization.” In 6th International Conference on Learning
Representations, 2018.
ieee: A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation
and quantization,” in 6th International Conference on Learning Representations,
Vancouver, Canada, 2018.
ista: 'Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation
and quantization. 6th International Conference on Learning Representations. ICLR:
International Conference on Learning Representations.'
mla: Polino, Antonio, et al. “Model Compression via Distillation and Quantization.”
6th International Conference on Learning Representations, 2018.
short: A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference
on Learning Representations, 2018.
conference:
end_date: 2018-05-03
location: Vancouver, Canada
name: 'ICLR: International Conference on Learning Representations'
start_date: 2018-04-30
date_created: 2020-05-10T22:00:51Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2023-02-23T13:18:41Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
arxiv:
- '1802.05668'
file:
- access_level: open_access
checksum: a4336c167978e81891970e4e4517a8c3
content_type: application/pdf
creator: dernst
date_created: 2020-05-26T13:02:00Z
date_updated: 2020-07-14T12:48:03Z
file_id: '7894'
file_name: 2018_ICLR_Polino.pdf
file_size: 308339
relation: main_file
file_date_updated: 2020-07-14T12:48:03Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: 6th International Conference on Learning Representations
publication_status: published
quality_controlled: '1'
scopus_import: 1
status: public
title: Model compression via distillation and quantization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '79'
abstract:
- lang: eng
text: 'Markov Decision Processes (MDPs) are a popular class of models suitable for
solving control decision problems in probabilistic reactive systems. We consider
parametric MDPs (pMDPs) that include parameters in some of the transition probabilities
to account for stochastic uncertainties of the environment such as noise or input
disturbances. We study pMDPs with reachability objectives where the parameter
values are unknown and impossible to measure directly during execution, but there
is a probability distribution known over the parameter values. We study for the
first time computing parameter-independent strategies that are expectation optimal,
i.e., optimize the expected reachability probability under the probability distribution
over the parameters. We present an encoding of our problem to partially observable
MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies
in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating
(repeated) learner model; a series of benchmarks of varying configurations of
a robot moving on a grid; and a consensus protocol.'
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Sebastian
full_name: Arming, Sebastian
last_name: Arming
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Joost P
full_name: Katoen, Joost P
id: 4524F760-F248-11E8-B48F-1D18A9856A87
last_name: Katoen
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
citation:
ama: 'Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent
strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:10.1007/978-3-319-99154-2_4'
apa: 'Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., & Sokolova, A.
(2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp.
53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China:
Springer. https://doi.org/10.1007/978-3-319-99154-2_4'
chicago: Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen,
and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70.
Springer, 2018. https://doi.org/10.1007/978-3-319-99154-2_4.
ieee: 'S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent
strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation
of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.'
ista: 'Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent
strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS,
vol. 11024, 53–70.'
mla: Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via
POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4.
short: S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer,
2018, pp. 53–70.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'QEST: Quantitative Evaluation of Systems'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:31Z
date_published: 2018-08-15T00:00:00Z
date_updated: 2023-09-13T09:38:28Z
day: '15'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-99154-2_4
external_id:
arxiv:
- '1806.05126'
isi:
- '000548912200004'
intvolume: ' 11024'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.05126
month: '08'
oa: 1
oa_version: Preprint
page: 53-70
publication_status: published
publisher: Springer
publist_id: '7975'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parameter-independent strategies for pMDPs via POMDPs
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11024
year: '2018'
...
---
_id: '7983'
abstract:
- lang: ger
text: 'Feste Alkalicarbonate sind universelle Bestandteile von Passivierungsschichten
an Materialien für Interkalationsbatterien, übliche Nebenprodukte in Metall‐O2‐Batterien,
und es wird angenommen, dass sie sich reversibel in Metall‐O2 /CO2‐Zellen bilden
und zersetzen. In all diesen Kathoden zersetzt sich Li2CO3 zu CO2, sobald es Spannungen
>3.8 V vs. Li/Li+ ausgesetzt wird. Beachtenswert ist, dass keine O2‐Entwicklung
detektiert wird, wie gemäß der Zersetzungsreaktion 2 Li2CO3 → 4 Li+ + 4 e− + 2 CO2
+ O2 zu erwarten wäre. Deswegen war der Verbleib eines der O‐Atome ungeklärt und
wurde nicht identifizierten parasitären Reaktionen zugerechnet. Hier zeigen wir,
dass hochreaktiver Singulett‐Sauerstoff (1O2) bei der Oxidation von Li2CO3 in
einem aprotischen Elektrolyten gebildet und daher nicht als O2 freigesetzt wird.
Diese Ergebnisse haben weitreichende Auswirkungen auf die langfristige Zyklisierbarkeit
von Batterien: sie untermauern die Wichtigkeit, 1O2 in Metall‐O2‐Batterien zu
verhindern, stellen die Möglichkeit einer reversiblen Metall‐O2 /CO2‐Batterie
basierend auf einem Carbonat‐Entladeprodukt in Frage und helfen, Grenzflächenreaktivität
von Übergangsmetallkathoden mit Li2CO3‐Resten zu erklären.'
article_processing_charge: No
article_type: original
author:
- first_name: Nika
full_name: Mahne, Nika
last_name: Mahne
- first_name: Sara E.
full_name: Renfrew, Sara E.
last_name: Renfrew
- first_name: Bryan D.
full_name: McCloskey, Bryan D.
last_name: McCloskey
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. Elektrochemische Oxidation
von Lithiumcarbonat generiert Singulett-Sauerstoff. Angewandte Chemie.
2018;130(19):5627-5631. doi:10.1002/ange.201802277
apa: Mahne, N., Renfrew, S. E., McCloskey, B. D., & Freunberger, S. A. (2018).
Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff.
Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201802277
chicago: Mahne, Nika, Sara E. Renfrew, Bryan D. McCloskey, and Stefan Alexander
Freunberger. “Elektrochemische Oxidation von Lithiumcarbonat Generiert Singulett-Sauerstoff.”
Angewandte Chemie. Wiley, 2018. https://doi.org/10.1002/ange.201802277.
ieee: N. Mahne, S. E. Renfrew, B. D. McCloskey, and S. A. Freunberger, “Elektrochemische
Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff,” Angewandte Chemie,
vol. 130, no. 19. Wiley, pp. 5627–5631, 2018.
ista: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. 2018. Elektrochemische
Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff. Angewandte Chemie.
130(19), 5627–5631.
mla: Mahne, Nika, et al. “Elektrochemische Oxidation von Lithiumcarbonat Generiert
Singulett-Sauerstoff.” Angewandte Chemie, vol. 130, no. 19, Wiley, 2018,
pp. 5627–31, doi:10.1002/ange.201802277.
short: N. Mahne, S.E. Renfrew, B.D. McCloskey, S.A. Freunberger, Angewandte Chemie
130 (2018) 5627–5631.
date_created: 2020-06-19T08:33:24Z
date_published: 2018-05-04T00:00:00Z
date_updated: 2021-01-12T08:16:21Z
day: '04'
ddc:
- '540'
doi: 10.1002/ange.201802277
extern: '1'
file:
- access_level: open_access
checksum: 81506e0f7079e1e3591f3cd9f626bf67
content_type: application/pdf
creator: dernst
date_created: 2020-06-19T11:58:06Z
date_updated: 2020-07-14T12:48:06Z
file_id: '7988'
file_name: 2018_AngChemieDT_Mahne.pdf
file_size: 674789
relation: main_file
file_date_updated: 2020-07-14T12:48:06Z
has_accepted_license: '1'
intvolume: ' 130'
issue: '19'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: 5627-5631
publication: Angewandte Chemie
publication_identifier:
issn:
- 0044-8249
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff
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: 130
year: '2018'
...
---
_id: '8015'
abstract:
- lang: eng
text: 'The neural code of cortical processing remains uncracked; however, it must
necessarily rely on faithful signal propagation between cortical areas. In this
issue of Neuron, Joglekar et al. (2018) show that strong inter-areal excitation
balanced by local inhibition can enable reliable signal propagation in data-constrained
network models of macaque cortex. '
article_processing_charge: No
article_type: original
author:
- first_name: Jake P.
full_name: Stroud, Jake P.
last_name: Stroud
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
citation:
ama: 'Stroud JP, Vogels TP. Cortical signal propagation: Balance, amplify, transmit.
Neuron. 2018;98(1):8-9. doi:10.1016/j.neuron.2018.03.028'
apa: 'Stroud, J. P., & Vogels, T. P. (2018). Cortical signal propagation: Balance,
amplify, transmit. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2018.03.028'
chicago: 'Stroud, Jake P., and Tim P Vogels. “Cortical Signal Propagation: Balance,
Amplify, Transmit.” Neuron. Elsevier, 2018. https://doi.org/10.1016/j.neuron.2018.03.028.'
ieee: 'J. P. Stroud and T. P. Vogels, “Cortical signal propagation: Balance, amplify,
transmit,” Neuron, vol. 98, no. 1. Elsevier, pp. 8–9, 2018.'
ista: 'Stroud JP, Vogels TP. 2018. Cortical signal propagation: Balance, amplify,
transmit. Neuron. 98(1), 8–9.'
mla: 'Stroud, Jake P., and Tim P. Vogels. “Cortical Signal Propagation: Balance,
Amplify, Transmit.” Neuron, vol. 98, no. 1, Elsevier, 2018, pp. 8–9, doi:10.1016/j.neuron.2018.03.028.'
short: J.P. Stroud, T.P. Vogels, Neuron 98 (2018) 8–9.
date_created: 2020-06-25T12:53:39Z
date_published: 2018-04-04T00:00:00Z
date_updated: 2021-01-12T08:16:31Z
day: '04'
doi: 10.1016/j.neuron.2018.03.028
extern: '1'
external_id:
pmid:
- '29621492'
intvolume: ' 98'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.neuron.2018.03.028
month: '04'
oa: 1
oa_version: Published Version
page: 8-9
pmid: 1
publication: Neuron
publication_identifier:
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: 'Cortical signal propagation: Balance, amplify, transmit'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 98
year: '2018'
...
---
_id: '806'
abstract:
- lang: eng
text: Social insect colonies have evolved many collectively performed adaptations
that reduce the impact of infectious disease and that are expected to maximize
their fitness. This colony-level protection is termed social immunity, and it
enhances the health and survival of the colony. In this review, we address how
social immunity emerges from its mechanistic components to produce colony-level
disease avoidance, resistance, and tolerance. To understand the evolutionary causes
and consequences of social immunity, we highlight the need for studies that evaluate
the effects of social immunity on colony fitness. We discuss the role that host
life history and ecology have on predicted eco-evolutionary dynamics, which differ
among the social insect lineages. Throughout the review, we highlight current
gaps in our knowledge and promising avenues for future research, which we hope
will bring us closer to an integrated understanding of socio-eco-evo-immunology.
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
- first_name: Christopher
full_name: Pull, Christopher
id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
last_name: Pull
orcid: 0000-0003-1122-3982
- first_name: Matthias
full_name: Fürst, Matthias
id: 393B1196-F248-11E8-B48F-1D18A9856A87
last_name: Fürst
orcid: 0000-0002-3712-925X
citation:
ama: 'Cremer S, Pull C, Fürst M. Social immunity: Emergence and evolution of colony-level
disease protection. Annual Review of Entomology. 2018;63:105-123. doi:10.1146/annurev-ento-020117-043110'
apa: 'Cremer, S., Pull, C., & Fürst, M. (2018). Social immunity: Emergence and
evolution of colony-level disease protection. Annual Review of Entomology.
Annual Reviews. https://doi.org/10.1146/annurev-ento-020117-043110'
chicago: 'Cremer, Sylvia, Christopher Pull, and Matthias Fürst. “Social Immunity:
Emergence and Evolution of Colony-Level Disease Protection.” Annual Review
of Entomology. Annual Reviews, 2018. https://doi.org/10.1146/annurev-ento-020117-043110.'
ieee: 'S. Cremer, C. Pull, and M. Fürst, “Social immunity: Emergence and evolution
of colony-level disease protection,” Annual Review of Entomology, vol.
63. Annual Reviews, pp. 105–123, 2018.'
ista: 'Cremer S, Pull C, Fürst M. 2018. Social immunity: Emergence and evolution
of colony-level disease protection. Annual Review of Entomology. 63, 105–123.'
mla: 'Cremer, Sylvia, et al. “Social Immunity: Emergence and Evolution of Colony-Level
Disease Protection.” Annual Review of Entomology, vol. 63, Annual Reviews,
2018, pp. 105–23, doi:10.1146/annurev-ento-020117-043110.'
short: S. Cremer, C. Pull, M. Fürst, Annual Review of Entomology 63 (2018) 105–123.
date_created: 2018-12-11T11:48:36Z
date_published: 2018-01-07T00:00:00Z
date_updated: 2023-09-19T09:29:45Z
day: '07'
department:
- _id: SyCr
doi: 10.1146/annurev-ento-020117-043110
external_id:
isi:
- '000424633700008'
intvolume: ' 63'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 105 - 123
publication: Annual Review of Entomology
publication_identifier:
issn:
- 1545-4487
publication_status: published
publisher: Annual Reviews
publist_id: '6844'
quality_controlled: '1'
related_material:
record:
- id: '819'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Social immunity: Emergence and evolution of colony-level disease protection'
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 63
year: '2018'
...
---
_id: '8073'
abstract:
- lang: eng
text: Motor cortex (M1) exhibits a rich repertoire of neuronal activities to support
the generation of complex movements. Although recent neuronal-network models capture
many qualitative aspects of M1 dynamics, they can generate only a few distinct
movements. Additionally, it is unclear how M1 efficiently controls movements over
a wide range of shapes and speeds. We demonstrate that modulation of neuronal
input–output gains in recurrent neuronal-network models with a fixed architecture
can dramatically reorganize neuronal activity and thus downstream muscle outputs.
Consistent with the observation of diffuse neuromodulatory projections to M1,
a relatively small number of modulatory control units provide sufficient flexibility
to adjust high-dimensional network activity using a simple reward-based learning
rule. Furthermore, it is possible to assemble novel movements from previously
learned primitives, and one can separately change movement speed while preserving
movement shape. Our results provide a new perspective on the role of modulatory
systems in controlling recurrent cortical activity.
article_processing_charge: No
article_type: original
author:
- first_name: Jake P.
full_name: Stroud, Jake P.
last_name: Stroud
- first_name: Mason A.
full_name: Porter, Mason A.
last_name: Porter
- first_name: Guillaume
full_name: Hennequin, Guillaume
last_name: Hennequin
- first_name: Tim P
full_name: Vogels, Tim P
id: CB6FF8D2-008F-11EA-8E08-2637E6697425
last_name: Vogels
orcid: 0000-0003-3295-6181
citation:
ama: Stroud JP, Porter MA, Hennequin G, Vogels TP. Motor primitives in space and
time via targeted gain modulation in cortical networks. Nature Neuroscience.
2018;21(12):1774-1783. doi:10.1038/s41593-018-0276-0
apa: Stroud, J. P., Porter, M. A., Hennequin, G., & Vogels, T. P. (2018). Motor
primitives in space and time via targeted gain modulation in cortical networks.
Nature Neuroscience. Springer Nature. https://doi.org/10.1038/s41593-018-0276-0
chicago: Stroud, Jake P., Mason A. Porter, Guillaume Hennequin, and Tim P Vogels.
“Motor Primitives in Space and Time via Targeted Gain Modulation in Cortical Networks.”
Nature Neuroscience. Springer Nature, 2018. https://doi.org/10.1038/s41593-018-0276-0.
ieee: J. P. Stroud, M. A. Porter, G. Hennequin, and T. P. Vogels, “Motor primitives
in space and time via targeted gain modulation in cortical networks,” Nature
Neuroscience, vol. 21, no. 12. Springer Nature, pp. 1774–1783, 2018.
ista: Stroud JP, Porter MA, Hennequin G, Vogels TP. 2018. Motor primitives in space
and time via targeted gain modulation in cortical networks. Nature Neuroscience.
21(12), 1774–1783.
mla: Stroud, Jake P., et al. “Motor Primitives in Space and Time via Targeted Gain
Modulation in Cortical Networks.” Nature Neuroscience, vol. 21, no. 12,
Springer Nature, 2018, pp. 1774–83, doi:10.1038/s41593-018-0276-0.
short: J.P. Stroud, M.A. Porter, G. Hennequin, T.P. Vogels, Nature Neuroscience
21 (2018) 1774–1783.
date_created: 2020-06-30T13:18:02Z
date_published: 2018-12-01T00:00:00Z
date_updated: 2021-01-12T08:16:46Z
day: '01'
doi: 10.1038/s41593-018-0276-0
extern: '1'
external_id:
pmid:
- '30482949'
intvolume: ' 21'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6276991/
month: '12'
oa: 1
oa_version: Submitted Version
page: 1774-1783
pmid: 1
publication: Nature Neuroscience
publication_identifier:
issn:
- 1097-6256
- 1546-1726
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1038/s41593-018-0307-x
status: public
title: Motor primitives in space and time via targeted gain modulation in cortical
networks
type: journal_article
user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425
volume: 21
year: '2018'
...
---
_id: '81'
abstract:
- lang: eng
text: We solve the offline monitoring problem for timed propositional temporal logic
(TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider
extends linear temporal logic (LTL) with clock variables and reset quantifiers,
providing a mechanism to specify real-time constraints. We first describe a general
monitoring algorithm based on an exhaustive computation of the set of satisfying
clock assignments as a finite union of zones. We then propose a specialized monitoring
algorithm for the one-variable case using a partition of the time domain based
on the notion of region equivalence, whose complexity is linear in the length
of the signal, thereby generalizing a known result regarding the monitoring of
metric temporal logic (MTL). The region and zone representations of time constraints
are known from timed automata verification and can also be used in the discrete-time
case. Our prototype implementation appears to outperform previous discrete-time
implementations of TPTL monitoring,
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Adrian
full_name: Elgyütt, Adrian
id: 4A2E9DBA-F248-11E8-B48F-1D18A9856A87
last_name: Elgyütt
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- 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: 'Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables.
In: Vol 11022. Springer; 2018:53-70. doi:10.1007/978-3-030-00151-3_4'
apa: 'Elgyütt, A., Ferrere, T., & Henzinger, T. A. (2018). Monitoring temporal
logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS:
Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_4'
chicago: Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal
Logic with Clock Variables,” 11022:53–70. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_4.
ieee: 'A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with
clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed
Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.'
ista: 'Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with
clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS,
vol. 11022, 53–70.'
mla: Elgyütt, Adrian, et al. Monitoring Temporal Logic with Clock Variables.
Vol. 11022, Springer, 2018, pp. 53–70, doi:10.1007/978-3-030-00151-3_4.
short: A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.
conference:
end_date: 2018-09-06
location: Beijing, China
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:31Z
date_published: 2018-08-26T00:00:00Z
date_updated: 2023-09-13T08:58:34Z
day: '26'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-00151-3_4
external_id:
isi:
- '000884993200004'
file:
- access_level: open_access
checksum: e5d81c9b50a6bd9d8a2c16953aad7e23
content_type: application/pdf
creator: dernst
date_created: 2020-10-09T06:24:21Z
date_updated: 2020-10-09T06:24:21Z
file_id: '8638'
file_name: 2018_LNCS_Elgyuett.pdf
file_size: 537219
relation: main_file
success: 1
file_date_updated: 2020-10-09T06:24:21Z
has_accepted_license: '1'
intvolume: ' 11022'
isi: 1
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 53 - 70
project:
- _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
publication_status: published
publisher: Springer
publist_id: '7973'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Monitoring temporal logic with clock variables
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11022
year: '2018'
...
---
_id: '82'
abstract:
- lang: eng
text: In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage,
bacterial cells resistant to the phage commonly emerge and become the dominant
population of bacteria. Following the ascent of resistant mutants, the densities
of bacteria in these simple communities become limited by resources rather than
the phage. Despite the evolution of resistant hosts, upon which the phage cannot
replicate, the lytic phage population is most commonly maintained in an apparently
stable state with the resistant bacteria. Several mechanisms have been put forward
to account for this result. Here we report the results of population dynamic/evolution
experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli
in serial transfer cultures. We show that, following the ascent of λVIR-resistant
bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal
media and in all cases in nutrient-rich broth. Using mathematical models and experiments,
we show that the dominant mechanism responsible for maintenance of λVIRin these
resource-limited populations dominated by resistant E. coli is a high rate of
either phenotypic or genetic transition from resistance to susceptibility—a hitherto
undemonstrated mechanism we term "leaky resistance." We discuss the
implications of leaky resistance to our understanding of the conditions for the
maintenance of phage in populations of bacteria—their “existence conditions.”.
article_number: '2005971'
article_processing_charge: Yes
author:
- first_name: Waqas
full_name: Chaudhry, Waqas
last_name: Chaudhry
- first_name: Maros
full_name: Pleska, Maros
id: 4569785E-F248-11E8-B48F-1D18A9856A87
last_name: Pleska
orcid: 0000-0001-7460-7479
- first_name: Nilang
full_name: Shah, Nilang
last_name: Shah
- first_name: Howard
full_name: Weiss, Howard
last_name: Weiss
- first_name: Ingrid
full_name: Mccall, Ingrid
last_name: Mccall
- first_name: Justin
full_name: Meyer, Justin
last_name: Meyer
- first_name: Animesh
full_name: Gupta, Animesh
last_name: Gupta
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Bruce
full_name: Levin, Bruce
last_name: Levin
citation:
ama: Chaudhry W, Pleska M, Shah N, et al. Leaky resistance and the conditions for
the existence of lytic bacteriophage. PLoS Biology. 2018;16(8). doi:10.1371/journal.pbio.2005971
apa: Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin,
B. (2018). Leaky resistance and the conditions for the existence of lytic bacteriophage.
PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005971
chicago: Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall,
Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Leaky Resistance
and the Conditions for the Existence of Lytic Bacteriophage.” PLoS Biology.
Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005971.
ieee: W. Chaudhry et al., “Leaky resistance and the conditions for the existence
of lytic bacteriophage,” PLoS Biology, vol. 16, no. 8. Public Library of
Science, 2018.
ista: Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC,
Levin B. 2018. Leaky resistance and the conditions for the existence of lytic
bacteriophage. PLoS Biology. 16(8), 2005971.
mla: Chaudhry, Waqas, et al. “Leaky Resistance and the Conditions for the Existence
of Lytic Bacteriophage.” PLoS Biology, vol. 16, no. 8, 2005971, Public
Library of Science, 2018, doi:10.1371/journal.pbio.2005971.
short: W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta,
C.C. Guet, B. Levin, PLoS Biology 16 (2018).
date_created: 2018-12-11T11:44:32Z
date_published: 2018-08-16T00:00:00Z
date_updated: 2023-09-13T08:45:41Z
day: '16'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.1371/journal.pbio.2005971
external_id:
isi:
- '000443383300024'
file:
- access_level: open_access
checksum: 527076f78265cd4ea192cd1569851587
content_type: application/pdf
creator: dernst
date_created: 2018-12-17T12:55:31Z
date_updated: 2020-07-14T12:48:10Z
file_id: '5706'
file_name: 2018_Plos_Chaudhry.pdf
file_size: 4007095
relation: main_file
file_date_updated: 2020-07-14T12:48:10Z
has_accepted_license: '1'
intvolume: ' 16'
isi: 1
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: PLoS Biology
publication_status: published
publisher: Public Library of Science
publist_id: '7972'
quality_controlled: '1'
related_material:
record:
- id: '9810'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Leaky resistance and the conditions for the existence of lytic bacteriophage
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: 16
year: '2018'
...
---
_id: '8231'
article_processing_charge: No
article_type: letter_note
author:
- first_name: Judit
full_name: Fazekas-Singer, Judit
id: 36432834-F248-11E8-B48F-1D18A9856A87
last_name: Fazekas-Singer
orcid: 0000-0002-8777-3502
- first_name: Josef
full_name: Singer, Josef
last_name: Singer
- first_name: Kristina M.
full_name: Ilieva, Kristina M.
last_name: Ilieva
- first_name: Miroslawa
full_name: Matz, Miroslawa
last_name: Matz
- first_name: Ina
full_name: Herrmann, Ina
last_name: Herrmann
- first_name: Edzard
full_name: Spillner, Edzard
last_name: Spillner
- first_name: Sophia N.
full_name: Karagiannis, Sophia N.
last_name: Karagiannis
- first_name: Erika
full_name: Jensen-Jarolim, Erika
last_name: Jensen-Jarolim
citation:
ama: 'Singer J, Singer J, Ilieva KM, et al. AllergoOncology: Generating a canine
anticancer IgE against the epidermal growth factor receptor. Journal of Allergy
and Clinical Immunology. 2018;142(3):973-976.e11. doi:10.1016/j.jaci.2018.04.021'
apa: 'Singer, J., Singer, J., Ilieva, K. M., Matz, M., Herrmann, I., Spillner, E.,
… Jensen-Jarolim, E. (2018). AllergoOncology: Generating a canine anticancer IgE
against the epidermal growth factor receptor. Journal of Allergy and Clinical
Immunology. Elsevier. https://doi.org/10.1016/j.jaci.2018.04.021'
chicago: 'Singer, Judit, Josef Singer, Kristina M. Ilieva, Miroslawa Matz, Ina Herrmann,
Edzard Spillner, Sophia N. Karagiannis, and Erika Jensen-Jarolim. “AllergoOncology:
Generating a Canine Anticancer IgE against the Epidermal Growth Factor Receptor.”
Journal of Allergy and Clinical Immunology. Elsevier, 2018. https://doi.org/10.1016/j.jaci.2018.04.021.'
ieee: 'J. Singer et al., “AllergoOncology: Generating a canine anticancer
IgE against the epidermal growth factor receptor,” Journal of Allergy and Clinical
Immunology, vol. 142, no. 3. Elsevier, p. 973–976.e11, 2018.'
ista: 'Singer J, Singer J, Ilieva KM, Matz M, Herrmann I, Spillner E, Karagiannis
SN, Jensen-Jarolim E. 2018. AllergoOncology: Generating a canine anticancer IgE
against the epidermal growth factor receptor. Journal of Allergy and Clinical
Immunology. 142(3), 973–976.e11.'
mla: 'Singer, Judit, et al. “AllergoOncology: Generating a Canine Anticancer IgE
against the Epidermal Growth Factor Receptor.” Journal of Allergy and Clinical
Immunology, vol. 142, no. 3, Elsevier, 2018, p. 973–976.e11, doi:10.1016/j.jaci.2018.04.021.'
short: J. Singer, J. Singer, K.M. Ilieva, M. Matz, I. Herrmann, E. Spillner, S.N.
Karagiannis, E. Jensen-Jarolim, Journal of Allergy and Clinical Immunology 142
(2018) 973–976.e11.
date_created: 2020-08-10T11:51:36Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2021-01-12T08:17:37Z
day: '01'
doi: 10.1016/j.jaci.2018.04.021
extern: '1'
intvolume: ' 142'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.jaci.2018.04.021
month: '09'
oa: 1
oa_version: Published Version
page: 973-976.e11
publication: Journal of Allergy and Clinical Immunology
publication_identifier:
issn:
- 0091-6749
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: 'AllergoOncology: Generating a canine anticancer IgE against the epidermal
growth factor receptor'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 142
year: '2018'
...
---
_id: '8232'
abstract:
- lang: eng
text: 'Anti-epidermal growth factor receptor (EGFR) antibody therapy is used in
EGFR expressing cancers including lung, colon, head and neck, and bladder cancers,
however results have been modest. Near infrared photoimmunotherapy (NIR-PIT) is
a highly selective tumor treatment that employs an antibody-photo-absorber conjugate
which is activated by NIR light. NIR-PIT is in clinical trials in patients with
recurrent head and neck cancers using cetuximab-IR700 as the conjugate. However,
its use has otherwise been restricted to mouse models. This is an effort to explore
larger animal models with NIR-PIT. We describe the use of a recombinant canine
anti-EGFR monoclonal antibody (mAb), can225IgG, conjugated to the photo-absorber,
IR700DX, in three EGFR expressing canine transitional cell carcinoma (TCC) cell
lines as a prelude to possible canine clinical studies. Can225-IR700 conjugate
showed specific binding and cell-specific killing after NIR-PIT on EGFR expressing
cells in vitro. In the in vivo study, can225-IR700 conjugate demonstrated accumulation
of the fluorescent conjugate with high tumor-to-background ratio. Tumor-bearing
mice were separated into 4 groups: (1) no treatment; (2) 100 μg of can225-IR700
i.v. only; (3) NIR light exposure only; (4) 100 μg of can225-IR700 i.v., NIR light
exposure. Tumor growth was significantly inhibited by NIR-PIT treatment compared
with the other groups (p < 0.001), and significantly prolonged survival was achieved
(p < 0.001 vs. other groups) in the treatment groups. In conclusion, NIR-PIT with
can225-IR700 is a promising treatment for canine EGFR-expressing cancers, including
invasive transitional cell carcinoma in pet dogs, that could provide a pathway
to translation to humans.'
article_processing_charge: No
article_type: original
author:
- first_name: Tadanobu
full_name: Nagaya, Tadanobu
last_name: Nagaya
- first_name: Shuhei
full_name: Okuyama, Shuhei
last_name: Okuyama
- first_name: Fusa
full_name: Ogata, Fusa
last_name: Ogata
- first_name: Yasuhiro
full_name: Maruoka, Yasuhiro
last_name: Maruoka
- first_name: Deborah W.
full_name: Knapp, Deborah W.
last_name: Knapp
- first_name: Sophia N.
full_name: Karagiannis, Sophia N.
last_name: Karagiannis
- first_name: Judit
full_name: Fazekas-Singer, Judit
id: 36432834-F248-11E8-B48F-1D18A9856A87
last_name: Fazekas-Singer
orcid: 0000-0002-8777-3502
- first_name: Peter L.
full_name: Choyke, Peter L.
last_name: Choyke
- first_name: Amy K.
full_name: LeBlanc, Amy K.
last_name: LeBlanc
- first_name: Erika
full_name: Jensen-Jarolim, Erika
last_name: Jensen-Jarolim
- first_name: Hisataka
full_name: Kobayashi, Hisataka
last_name: Kobayashi
citation:
ama: Nagaya T, Okuyama S, Ogata F, et al. Near infrared photoimmunotherapy targeting
bladder cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody.
Oncotarget. 2018;9:19026-19038. doi:10.18632/oncotarget.24876
apa: Nagaya, T., Okuyama, S., Ogata, F., Maruoka, Y., Knapp, D. W., Karagiannis,
S. N., … Kobayashi, H. (2018). Near infrared photoimmunotherapy targeting bladder
cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody. Oncotarget.
Impact Journals. https://doi.org/10.18632/oncotarget.24876
chicago: Nagaya, Tadanobu, Shuhei Okuyama, Fusa Ogata, Yasuhiro Maruoka, Deborah
W. Knapp, Sophia N. Karagiannis, Judit Singer, et al. “Near Infrared Photoimmunotherapy
Targeting Bladder Cancer with a Canine Anti-Epidermal Growth Factor Receptor (EGFR)
Antibody.” Oncotarget. Impact Journals, 2018. https://doi.org/10.18632/oncotarget.24876.
ieee: T. Nagaya et al., “Near infrared photoimmunotherapy targeting bladder
cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody,” Oncotarget,
vol. 9. Impact Journals, pp. 19026–19038, 2018.
ista: Nagaya T, Okuyama S, Ogata F, Maruoka Y, Knapp DW, Karagiannis SN, Singer
J, Choyke PL, LeBlanc AK, Jensen-Jarolim E, Kobayashi H. 2018. Near infrared photoimmunotherapy
targeting bladder cancer with a canine anti-epidermal growth factor receptor (EGFR)
antibody. Oncotarget. 9, 19026–19038.
mla: Nagaya, Tadanobu, et al. “Near Infrared Photoimmunotherapy Targeting Bladder
Cancer with a Canine Anti-Epidermal Growth Factor Receptor (EGFR) Antibody.” Oncotarget,
vol. 9, Impact Journals, 2018, pp. 19026–38, doi:10.18632/oncotarget.24876.
short: T. Nagaya, S. Okuyama, F. Ogata, Y. Maruoka, D.W. Knapp, S.N. Karagiannis,
J. Singer, P.L. Choyke, A.K. LeBlanc, E. Jensen-Jarolim, H. Kobayashi, Oncotarget
9 (2018) 19026–19038.
date_created: 2020-08-10T11:52:54Z
date_published: 2018-04-10T00:00:00Z
date_updated: 2021-01-12T08:17:37Z
day: '10'
doi: 10.18632/oncotarget.24876
extern: '1'
intvolume: ' 9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.18632/oncotarget.24876
month: '04'
oa: 1
oa_version: Published Version
page: 19026-19038
publication: Oncotarget
publication_identifier:
eissn:
- 1949-2553
publication_status: published
publisher: Impact Journals
quality_controlled: '1'
status: public
title: Near infrared photoimmunotherapy targeting bladder cancer with a canine anti-epidermal
growth factor receptor (EGFR) antibody
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2018'
...
---
_id: '8233'
abstract:
- lang: eng
text: The M2a subtype of macrophages plays an important role in human immunoglobulin
E (IgE-mediated allergies) and other Th2 type immune reactions. In contrast, very
little is known about these cells in the dog. Here we describe an in vitro method
to activate canine histiocytic DH82 cells and primary canine monocyte-derived
macrophages (MDMs) toward the M2a macrophages using human cytokines. For a side-by-side
comparison, we compared the canine cells to human MDMs, and the human monocytic
cell line U937 activated towards M1 and M2a cells on the cellular and molecular
level. In analogy to activated human M2a cells, canine M2a, differentiated from
both DH82 and MDMs, showed an increase in CD206 surface receptor expression compared
to M1. Interestingly, canine M2a, but not M1 derived from MDM, upregulated the
high-affinity IgE receptor (FcεRI). Transcription levels of M2a-associated genes
(IL10, CCL22, TGFβ, CD163) showed a diverse pattern between the human and dog
species, whereas M1 genes (IDO1, CXCL11, IL6, TNF-α) were similarly upregulated
in canine and human M1 cells (cell lines and MDMs). We suggest that our novel
in vitro method will be suitable in comparative allergology studies focussing
on macrophages.
article_processing_charge: No
article_type: original
author:
- first_name: Ina
full_name: Herrmann, Ina
last_name: Herrmann
- first_name: Jelena
full_name: Gotovina, Jelena
last_name: Gotovina
- first_name: Judit
full_name: Fazekas-Singer, Judit
id: 36432834-F248-11E8-B48F-1D18A9856A87
last_name: Fazekas-Singer
orcid: 0000-0002-8777-3502
- first_name: Michael B.
full_name: Fischer, Michael B.
last_name: Fischer
- first_name: Karin
full_name: Hufnagl, Karin
last_name: Hufnagl
- first_name: Rodolfo
full_name: Bianchini, Rodolfo
last_name: Bianchini
- first_name: Erika
full_name: Jensen-Jarolim, Erika
last_name: Jensen-Jarolim
citation:
ama: Herrmann I, Gotovina J, Singer J, et al. Canine macrophages can like human
macrophages be in vitro activated toward the M2a subtype relevant in allergy.
Developmental & Comparative Immunology. 2018;82(5):118-127. doi:10.1016/j.dci.2018.01.005
apa: Herrmann, I., Gotovina, J., Singer, J., Fischer, M. B., Hufnagl, K., Bianchini,
R., & Jensen-Jarolim, E. (2018). Canine macrophages can like human macrophages
be in vitro activated toward the M2a subtype relevant in allergy. Developmental
& Comparative Immunology. Elsevier. https://doi.org/10.1016/j.dci.2018.01.005
chicago: Herrmann, Ina, Jelena Gotovina, Judit Singer, Michael B. Fischer, Karin
Hufnagl, Rodolfo Bianchini, and Erika Jensen-Jarolim. “Canine Macrophages Can
like Human Macrophages Be in Vitro Activated toward the M2a Subtype Relevant in
Allergy.” Developmental & Comparative Immunology. Elsevier, 2018. https://doi.org/10.1016/j.dci.2018.01.005.
ieee: I. Herrmann et al., “Canine macrophages can like human macrophages
be in vitro activated toward the M2a subtype relevant in allergy,” Developmental
& Comparative Immunology, vol. 82, no. 5. Elsevier, pp. 118–127, 2018.
ista: Herrmann I, Gotovina J, Singer J, Fischer MB, Hufnagl K, Bianchini R, Jensen-Jarolim
E. 2018. Canine macrophages can like human macrophages be in vitro activated toward
the M2a subtype relevant in allergy. Developmental & Comparative Immunology.
82(5), 118–127.
mla: Herrmann, Ina, et al. “Canine Macrophages Can like Human Macrophages Be in Vitro
Activated toward the M2a Subtype Relevant in Allergy.” Developmental &
Comparative Immunology, vol. 82, no. 5, Elsevier, 2018, pp. 118–27, doi:10.1016/j.dci.2018.01.005.
short: I. Herrmann, J. Gotovina, J. Singer, M.B. Fischer, K. Hufnagl, R. Bianchini,
E. Jensen-Jarolim, Developmental & Comparative Immunology 82 (2018) 118–127.
date_created: 2020-08-10T11:53:01Z
date_published: 2018-05-01T00:00:00Z
date_updated: 2021-01-12T08:17:38Z
day: '01'
doi: 10.1016/j.dci.2018.01.005
extern: '1'
intvolume: ' 82'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.dci.2018.01.005
month: '05'
oa: 1
oa_version: Published Version
page: 118-127
publication: Developmental & Comparative Immunology
publication_identifier:
issn:
- 0145-305X
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Canine macrophages can like human macrophages be in vitro activated toward
the M2a subtype relevant in allergy
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2018'
...
---
_id: '8234'
abstract:
- lang: eng
text: Molecular imaging probes such as PET-tracers have the potential to improve
the accuracy of tumor characterization by directly visualizing the biochemical
situation. Thus, molecular changes can be detected early before morphological
manifestation. The A3 adenosine receptor (A3AR) is described to be highly expressed
in colon cancer cell lines and human colorectal cancer (CRC), suggesting this
receptor as a tumor marker. The aim of this preclinical study was the evaluation
of FE@SUPPY as a PET-tracer for CRC using in vitro imaging and in vivo PET imaging.
First, affinity and selectivity of FE@SUPPY and its metabolites were determined,
proving the favorable binding profile of FE@SUPPY. The human adenocarcinoma cell
line HT-29 was characterized regarding its hA3AR expression and was subsequently
chosen as tumor graft. Promising results regarding the potential of FE@SUPPY as
a PET-tracer for CRC imaging were obtained by autoradiography as ≥2.3-fold higher
accumulation of FE@SUPPY was found in CRC tissue compared to adjacent healthy
colon tissue from the same patient. Nevertheless, first in vivo studies using
HT-29 xenografts showed insufficient tumor uptake due to (1) poor conservation
of target expression in xenografts and (2) unfavorable pharmacokinetics of FE@SUPPY
in mice. We therefore conclude that HT-29 xenografts are not adequate to visualize
hA3ARs using FE@SUPPY.
article_number: '1269830'
article_processing_charge: No
article_type: original
author:
- first_name: T.
full_name: Balber, T.
last_name: Balber
- first_name: Judit
full_name: Singer, Judit
id: 36432834-F248-11E8-B48F-1D18A9856A87
last_name: Singer
orcid: 0000-0002-8777-3502
- first_name: N.
full_name: Berroterán-Infante, N.
last_name: Berroterán-Infante
- first_name: M.
full_name: Dumanic, M.
last_name: Dumanic
- first_name: L.
full_name: Fetty, L.
last_name: Fetty
- first_name: J.
full_name: Fazekas-Singer, J.
last_name: Fazekas-Singer
orcid: 0000-0002-8777-3502
- first_name: C.
full_name: Vraka, C.
last_name: Vraka
- first_name: L.
full_name: Nics, L.
last_name: Nics
- first_name: M.
full_name: Bergmann, M.
last_name: Bergmann
- first_name: K.
full_name: Pallitsch, K.
last_name: Pallitsch
- first_name: H.
full_name: Spreitzer, H.
last_name: Spreitzer
- first_name: W.
full_name: Wadsak, W.
last_name: Wadsak
orcid: 0000-0003-4479-8053
- first_name: M.
full_name: Hacker, M.
last_name: Hacker
- first_name: E.
full_name: Jensen-Jarolim, E.
last_name: Jensen-Jarolim
- first_name: H.
full_name: Viernstein, H.
last_name: Viernstein
- first_name: M.
full_name: Mitterhauser, M.
last_name: Mitterhauser
orcid: 0000-0003-3173-5272
citation:
ama: 'Balber T, Singer J, Berroterán-Infante N, et al. Preclinical in vitro and
in vivo evaluation of [18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft
model for colorectal cancer. Contrast Media & Molecular Imaging. 2018;2018.
doi:10.1155/2018/1269830'
apa: 'Balber, T., Singer, J., Berroterán-Infante, N., Dumanic, M., Fetty, L., Fazekas-Singer,
J., … Mitterhauser, M. (2018). Preclinical in vitro and in vivo evaluation of
[18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft model for colorectal
cancer. Contrast Media & Molecular Imaging. Hindawi. https://doi.org/10.1155/2018/1269830'
chicago: 'Balber, T., Judit Singer, N. Berroterán-Infante, M. Dumanic, L. Fetty,
J. Fazekas-Singer, C. Vraka, et al. “Preclinical in Vitro and in Vivo Evaluation
of [18F]FE@SUPPY for Cancer PET Imaging: Limitations of a Xenograft Model for
Colorectal Cancer.” Contrast Media & Molecular Imaging. Hindawi, 2018.
https://doi.org/10.1155/2018/1269830.'
ieee: 'T. Balber et al., “Preclinical in vitro and in vivo evaluation of
[18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft model for colorectal
cancer,” Contrast Media & Molecular Imaging, vol. 2018. Hindawi, 2018.'
ista: 'Balber T, Singer J, Berroterán-Infante N, Dumanic M, Fetty L, Fazekas-Singer
J, Vraka C, Nics L, Bergmann M, Pallitsch K, Spreitzer H, Wadsak W, Hacker M,
Jensen-Jarolim E, Viernstein H, Mitterhauser M. 2018. Preclinical in vitro and
in vivo evaluation of [18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft
model for colorectal cancer. Contrast Media & Molecular Imaging. 2018, 1269830.'
mla: 'Balber, T., et al. “Preclinical in Vitro and in Vivo Evaluation of [18F]FE@SUPPY
for Cancer PET Imaging: Limitations of a Xenograft Model for Colorectal Cancer.”
Contrast Media & Molecular Imaging, vol. 2018, 1269830, Hindawi, 2018,
doi:10.1155/2018/1269830.'
short: T. Balber, J. Singer, N. Berroterán-Infante, M. Dumanic, L. Fetty, J. Fazekas-Singer,
C. Vraka, L. Nics, M. Bergmann, K. Pallitsch, H. Spreitzer, W. Wadsak, M. Hacker,
E. Jensen-Jarolim, H. Viernstein, M. Mitterhauser, Contrast Media & Molecular
Imaging 2018 (2018).
date_created: 2020-08-10T11:53:07Z
date_published: 2018-02-13T00:00:00Z
date_updated: 2021-01-12T08:17:38Z
day: '13'
doi: 10.1155/2018/1269830
extern: '1'
intvolume: ' 2018'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1155/2018/1269830
month: '02'
oa: 1
oa_version: Published Version
publication: Contrast Media & Molecular Imaging
publication_identifier:
issn:
- 1555-4309
- 1555-4317
publication_status: published
publisher: Hindawi
quality_controlled: '1'
status: public
title: 'Preclinical in vitro and in vivo evaluation of [18F]FE@SUPPY for cancer PET
imaging: Limitations of a xenograft model for colorectal cancer'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2018
year: '2018'
...