---
_id: '7158'
abstract:
- lang: eng
text: "Interprocedural analysis is at the heart of numerous applications in programming
languages, such as alias analysis, constant propagation, and so on. Recursive
state machines (RSMs) are standard models for interprocedural analysis. We consider
a general framework with RSMs where the transitions are labeled from a semiring
and path properties are algebraic with semiring operations. RSMs with algebraic
path properties can model interprocedural dataflow analysis problems, the shortest
path problem, the most probable path problem, and so on. The traditional algorithms
for interprocedural analysis focus on path properties where the starting point
is fixed as the entry point of a specific method. In this work, we consider possible
multiple queries as required in many applications such as in alias analysis. The
study of multiple queries allows us to bring in an important algorithmic distinction
between the resource usage of the one-time preprocessing vs for each individual
query. The second aspect we consider is that the control flow graphs for most
programs have constant treewidth.\r\n\r\nOur main contributions are simple and
implementable algorithms that support multiple queries for algebraic path properties
for RSMs that have constant treewidth. Our theoretical results show that our algorithms
have small additional one-time preprocessing but can answer subsequent queries
significantly faster as compared to the current algorithmic solutions for interprocedural
dataflow analysis. We have also implemented our algorithms and evaluated their
performance for performing on-demand interprocedural dataflow analysis on various
domains, such as for live variable analysis and reaching definitions, on a standard
benchmark set. Our experimental results align with our theoretical statements
and show that after a lightweight preprocessing, on-demand queries are answered
much faster than the standard existing algorithmic approaches.\r\n"
article_number: '23'
article_processing_charge: No
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Prateesh
full_name: Goyal, Prateesh
last_name: Goyal
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster
algorithms for dynamic algebraic queries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525
apa: Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis,
A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with
constant treewidth. ACM Transactions on Programming Languages and Systems.
ACM. https://doi.org/10.1145/3363525
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus
Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic
Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming
Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
ieee: K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis,
“Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,”
ACM Transactions on Programming Languages and Systems, vol. 41, no. 4.
ACM, 2019.
ista: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019.
Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth.
ACM Transactions on Programming Languages and Systems. 41(4), 23.
mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries
in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages
and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.
short: K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis,
ACM Transactions on Programming Languages and Systems 41 (2019).
date_created: 2019-12-09T08:33:33Z
date_published: 2019-11-01T00:00:00Z
date_updated: 2026-09-13T22:31:00Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3363525
ec_funded: 1
external_id:
isi:
- '000564108400004'
file:
- access_level: open_access
checksum: 291cc86a07bd010d4815e177dac57b70
content_type: application/pdf
creator: dernst
date_created: 2020-10-08T12:58:10Z
date_updated: 2020-10-08T12:58:10Z
file_id: '8632'
file_name: 2019_ACMTransactions_Chatterjee.pdf
file_size: 667357
relation: main_file
success: 1
file_date_updated: 2020-10-08T12:58:10Z
fulldoi: https://doi.org/10.1145/3363525
has_accepted_license: '1'
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: ACM Transactions on Programming Languages and Systems
publication_identifier:
issn:
- 0164-0925
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Faster algorithms for dynamic algebraic queries in basic RSMs with constant
treewidth
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 41
year: '2019'
...
---
_id: '6378'
abstract:
- lang: eng
text: 'In today''s cryptocurrencies, Hashcash proof of work is the most commonly-adopted
approach to mining. In Hashcash, when a miner decides to add a block to the chain,
she has to solve the difficult computational puzzle of inverting a hash function.
While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it
has attracted significant and harsh criticism due to its massive waste of electricity,
its carbon footprint and environmental effects, and the inherent lack of usefulness
in inverting a hash function. Various other mining protocols have been suggested,
including proof of stake, in which a miner''s chance of adding the next block
is proportional to her current balance. However, such protocols lead to a higher
entry cost for new miners who might not still have any stake in the cryptocurrency,
and can in the worst case lead to an oligopoly, where the rich have complete control
over mining. In this paper, we propose Hybrid Mining: a new mining protocol that
combines solving real-world useful problems with Hashcash. Our protocol allows
new miners to join the network by taking part in Hashcash mining without having
to own an initial stake. It also allows nodes of the network to submit hard computational
problems whose solutions are of interest in the real world, e.g.~protein folding
problems. Then, miners can choose to compete in solving these problems, in lieu
of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners
to solve useful problems, such as hard computational problems arising in biology,
in a distributed manner. It also gives researchers in other areas an easy-to-use
tool to outsource their hard computations to the blockchain network, which has
enormous computational power, by paying a reward to the miner who solves the problem
for them. Moreover, our protocol provides strong security guarantees and is at
least as resilient to double spending as Bitcoin.'
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: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Arash
full_name: Pourdamghani, Arash
last_name: Pourdamghani
citation:
ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s
computational power for distributed problem solving. In: Proceedings of the
34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:374-381.
doi:10.1145/3297280.3297319'
apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining:
Exploiting blockchain’s computational power for distributed problem solving. In
Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772,
pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319'
chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani.
“Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem
Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing,
Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.'
ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting
blockchain’s computational power for distributed problem solving,” in Proceedings
of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol.
Part F147772, pp. 374–381.'
ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting
blockchain’s computational power for distributed problem solving. Proceedings
of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing
vol. Part F147772, 374–381.'
mla: 'Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational
Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium
on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.'
short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the
34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381.
conference:
end_date: 2019-04-12
location: Limassol, Cyprus
name: ACM Symposium on Applied Computing
start_date: 2019-04-08
date_created: 2019-05-06T12:11:36Z
date_published: 2019-04-01T00:00:00Z
date_updated: 2026-09-13T22:31:00Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3297280.3297319
ec_funded: 1
external_id:
isi:
- '000474685800049'
file:
- access_level: open_access
checksum: fbfbcd5a0c7a743862bfc3045539a614
content_type: application/pdf
creator: dernst
date_created: 2019-05-06T12:09:27Z
date_updated: 2020-07-14T12:47:29Z
file_id: '6379'
file_name: 2019_ACM_Chatterjee.pdf
file_size: 1023934
relation: main_file
file_date_updated: 2020-07-14T12:47:29Z
fulldoi: https://doi.org/10.1145/3297280.3297319
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 374-381
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 34th ACM Symposium on Applied Computing
publication_identifier:
isbn:
- '9781450359337'
publication_status: published
publisher: ACM
pubrep_id: '1069'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Hybrid Mining: Exploiting blockchain’s computational power for distributed
problem solving'
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: Part F147772
year: '2019'
...
---
_id: '6175'
abstract:
- lang: eng
text: "We consider the problem of expected cost analysis over nondeterministic probabilistic
programs,\r\nwhich aims at automated methods for analyzing the resource-usage
of such programs.\r\nPrevious approaches for this problem could only handle nonnegative
bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis
of cryptocurrency protocols,\r\nboth positive and negative costs are necessary
and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and
efficient approach to obtain polynomial bounds on the\r\nexpected accumulated
cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a)
general positive and negative costs with bounded updates in\r\nvariables; and
(b) nonnegative costs with general updates to variables.\r\nWe show that several
natural examples which could not be\r\nhandled by previous approaches are captured
in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time
algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs
could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our
approach using experimental results on a variety of programs for which we efficiently
synthesize tight resource-usage bounds."
article_processing_charge: No
arxiv: 1
author:
- first_name: Peixin
full_name: Wang, Peixin
last_name: Wang
- first_name: Hongfei
full_name: Fu, Hongfei
id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Xudong
full_name: Qin, Xudong
last_name: Qin
- first_name: Wenjun
full_name: Shi, Wenjun
last_name: Shi
citation:
ama: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of
nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the
40th ACM SIGPLAN Conference on Programming Language Design and Implementation.
Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581'
apa: 'Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W.
(2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019:
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design
and Implementation (pp. 204–220). Phoenix, AZ, United States: Association
for Computing Machinery. https://doi.org/10.1145/3314221.3314581'
chicago: 'Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee,
Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.”
In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming
Language Design and Implementation, 204–20. Association for Computing Machinery,
2019. https://doi.org/10.1145/3314221.3314581.'
ieee: 'P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost
analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings
of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation,
Phoenix, AZ, United States, 2019, pp. 204–220.'
ista: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis
of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th
ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI:
Conference on Programming Language Design and Implementation, 204–220.'
mla: 'Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.”
PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language
Design and Implementation, Association for Computing Machinery, 2019, pp.
204–20, doi:10.1145/3314221.3314581.'
short: 'P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI
2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design
and Implementation, Association for Computing Machinery, 2019, pp. 204–220.'
conference:
end_date: 2019-06-26
location: Phoenix, AZ, United States
name: 'PLDI: Conference on Programming Language Design and Implementation'
start_date: 2019-06-22
date_created: 2019-03-25T10:13:25Z
date_published: 2019-06-08T00:00:00Z
date_updated: 2026-09-13T22:31:00Z
day: '08'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3314221.3314581
ec_funded: 1
external_id:
arxiv:
- '1902.04659'
isi:
- '000523190300014'
file:
- access_level: open_access
checksum: 703a5e9b8c8587f2a44085ffd9a4db64
content_type: application/pdf
creator: akafshda
date_created: 2019-03-25T10:11:22Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6176'
file_name: paper.pdf
file_size: 4051066
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
fulldoi: https://doi.org/10.1145/3314221.3314581
has_accepted_license: '1'
isi: 1
keyword:
- Program Cost Analysis
- Program Termination
- Probabilistic Programs
- Martingales
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 204-220
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided 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: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: 'PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming
Language Design and Implementation'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '5457'
relation: earlier_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Cost analysis of nondeterministic probabilistic programs
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
year: '2019'
...
---
_id: '7014'
abstract:
- lang: eng
text: "We study the problem of developing efficient approaches for proving\r\nworst-case
bounds of non-deterministic recursive programs. Ranking functions\r\nare sound
and complete for proving termination and worst-case bounds of\r\nnonrecursive
programs. First, we apply ranking functions to recursion,\r\nresulting in measure
functions. We show that measure functions provide a sound\r\nand complete approach
to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second
contribution is the synthesis of measure functions in\r\nnonpolynomial forms.
We show that non-polynomial measure functions with\r\nlogarithm and exponentiation
can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms,
Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous
methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds
of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$
is not an integer. We present\r\nexperimental results to demonstrate that our
approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms
such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair
problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii)
Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm
for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that
$r$ is not an integer and\r\nclose to the best-known bounds for the respective
algorithms."
article_number: '20'
article_processing_charge: No
article_type: original
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: Hongfei
full_name: Fu, Hongfei
last_name: Fu
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
citation:
ama: Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive
programs. ACM Transactions on Programming Languages and Systems. 2019;41(4).
doi:10.1145/3339984
apa: Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case
analysis of recursive programs. ACM Transactions on Programming Languages and
Systems. ACM. https://doi.org/10.1145/3339984
chicago: Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial
Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming
Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984.
ieee: K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis
of recursive programs,” ACM Transactions on Programming Languages and Systems,
vol. 41, no. 4. ACM, 2019.
ista: Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis
of recursive programs. ACM Transactions on Programming Languages and Systems.
41(4), 20.
mla: Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive
Programs.” ACM Transactions on Programming Languages and Systems, vol.
41, no. 4, 20, ACM, 2019, doi:10.1145/3339984.
short: K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages
and Systems 41 (2019).
date_created: 2019-11-13T08:33:43Z
date_published: 2019-10-01T00:00:00Z
date_updated: 2026-09-13T22:31:00Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/3339984
ec_funded: 1
external_id:
arxiv:
- '1705.00317'
isi:
- '000564108400001'
fulldoi: https://doi.org/10.1145/3339984
intvolume: ' 41'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1705.00317
month: '10'
oa: 1
oa_version: Preprint
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _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: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies
- _id: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
publication: ACM Transactions on Programming Languages and Systems
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
record:
- id: '639'
relation: earlier_version
status: public
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Non-polynomial worst-case analysis of recursive programs
type: journal_article
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 41
year: '2019'
...
---
OA_place: publisher
OA_type: hybrid
_id: '6380'
abstract:
- lang: eng
text: 'There is a huge gap between the speeds of modern caches and main memories,
and therefore cache misses account for a considerable loss of efficiency in programs.
The predominant technique to address this issue has been Data Packing: data elements
that are frequently accessed within time proximity are packed into the same cache
block, thereby minimizing accesses to the main memory. We consider the algorithmic
problem of Data Packing on a two-level memory system. Given a reference sequence
R of accesses to data elements, the task is to partition the elements into cache
blocks such that the number of cache misses on R is minimized. The problem is
notoriously difficult: it is NP-hard even when the cache has size 1, and is hard
to approximate for any cache size larger than 4. Therefore, all existing techniques
for Data Packing are based on heuristics and lack theoretical guarantees. In this
work, we present the first positive theoretical results for Data Packing, along
with new and stronger negative results. We consider the problem under the lens
of the underlying access hypergraphs, which are hypergraphs of affinities between
the data elements, where the order of an access hypergraph corresponds to the
size of the affinity group. We study the problem parameterized by the treewidth
of access hypergraphs, which is a standard notion in graph theory to measure the
closeness of a graph to a tree. Our main results are as follows: We show there
is a number q* depending on the cache parameters such that (a) if the access hypergraph
of order q* has constant treewidth, then there is a linear-time algorithm for
Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph
of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy
depending on a single parameter, namely, the highest order among access hypegraphs
that have constant treewidth; and establish the optimal value q* of this parameter.
Finally, we present an experimental evaluation of a prototype implementation of
our algorithm. Our results demonstrate that, in practice, access hypergraphs of
many commonly-used algorithms have small treewidth. We compare our approach with
several state-of-the-art heuristic-based algorithms and show that our algorithm
leads to significantly fewer cache-misses. '
acknowledgement: "The research was partially supported by Vienna Science and Technology
Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23
(RiSE/SHiNE), ERC\r\nStarting Grant (279307: Graph Games), and the IBM PhD Fellowship
program."
article_number: '53'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Nastaran
full_name: Okati, Nastaran
last_name: Okati
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. Efficient parameterized
algorithms for data packing. Proceedings of the ACM on Programming Languages.
2019;3(POPL). doi:10.1145/3290366
apa: Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019).
Efficient parameterized algorithms for data packing. Proceedings of the ACM
on Programming Languages. ACM. https://doi.org/10.1145/3290366
chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas
Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings
of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366.
ieee: K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient
parameterized algorithms for data packing,” Proceedings of the ACM on Programming
Languages, vol. 3, no. POPL. ACM, 2019.
ista: Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized
algorithms for data packing. Proceedings of the ACM on Programming Languages.
3(POPL), 53.
mla: Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data
Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no.
POPL, 53, ACM, 2019, doi:10.1145/3290366.
short: K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of
the ACM on Programming Languages 3 (2019).
date_created: 2019-05-06T12:18:17Z
date_published: 2019-01-01T00:00:00Z
date_updated: 2026-09-13T22:31:01Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.1145/3290366
ec_funded: 1
file:
- access_level: open_access
checksum: c157752f96877b36685ad7063ada4524
content_type: application/pdf
creator: dernst
date_created: 2019-05-06T12:23:11Z
date_updated: 2020-07-14T12:47:29Z
file_id: '6381'
file_name: 2019_ACM_POPL_Chatterjee.pdf
file_size: 1294962
relation: main_file
file_date_updated: 2020-07-14T12:47:29Z
fulldoi: https://doi.org/10.1145/3290366
has_accepted_license: '1'
intvolume: ' 3'
issue: POPL
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
issn:
- 2475-1421
publication_status: published
publisher: ACM
pubrep_id: '1056'
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Efficient parameterized algorithms for data packing
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: 3
year: '2019'
...
---
_id: '6056'
abstract:
- lang: eng
text: In today's programmable blockchains, smart contracts are limited to being
deterministic and non-probabilistic. This lack of randomness is a consequential
limitation, given that a wide variety of real-world financial contracts, such
as casino games and lotteries, depend entirely on randomness. As a result, several
ad-hoc random number generation approaches have been developed to be used in smart
contracts. These include ideas such as using an oracle or relying on the block
hash. However, these approaches are manipulatable, i.e. their output can be tampered
with by parties who might not be neutral, such as the owner of the oracle or the
miners.We propose a novel game-theoretic approach for generating provably unmanipulatable
pseudorandom numbers on the blockchain. Our approach allows smart contracts to
access a trustworthy source of randomness that does not rely on potentially compromised
miners or oracles, hence enabling the creation of a new generation of smart contracts
that are not limited to being non-probabilistic and can be drawn from the much
more general class of probabilistic programs.
article_number: '8751326'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Amir Kafshdar
full_name: Goharshady, Amir Kafshdar
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Arash
full_name: Pourdamghani, Arash
last_name: Pourdamghani
citation:
ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts:
Secure randomness on the blockchain. In: IEEE International Conference on Blockchain
and Cryptocurrency. IEEE; 2019. doi:10.1109/BLOC.2019.8751326'
apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic
smart contracts: Secure randomness on the blockchain. In IEEE International
Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326'
chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani.
“Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE
International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.'
ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart
contracts: Secure randomness on the blockchain,” in IEEE International Conference
on Blockchain and Cryptocurrency, Seoul, Korea, 2019.'
ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts:
Secure randomness on the blockchain. IEEE International Conference on Blockchain
and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency,
8751326.'
mla: 'Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness
on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency,
8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.'
short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International
Conference on Blockchain and Cryptocurrency, IEEE, 2019.
conference:
end_date: 2019-05-17
location: Seoul, Korea
name: IEEE International Conference on Blockchain and Cryptocurrency
start_date: 2019-05-14
date_created: 2019-02-26T09:03:15Z
date_published: 2019-05-01T00:00:00Z
date_updated: 2026-09-13T22:31:01Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/BLOC.2019.8751326
ec_funded: 1
external_id:
arxiv:
- '1902.07986'
isi:
- '000491257000076'
fulldoi: https://doi.org/10.1109/BLOC.2019.8751326
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1902.07986
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _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: 266EEEC0-B435-11E9-9278-68D0E5697425
name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart
Contracts
- _id: 267066CE-B435-11E9-9278-68D0E5697425
name: Quantitative Analysis of Probabilistic Systems with a focus on Crypto-Currencies
publication: IEEE International Conference on Blockchain and Cryptocurrency
publication_status: published
publisher: IEEE
quality_controlled: '1'
related_material:
record:
- id: '8934'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Probabilistic smart contracts: Secure randomness on the blockchain'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2019'
...
---
_id: '6187'
abstract:
- lang: eng
text: Aberrant display of the truncated core1 O-glycan T-antigen is a common feature
of human cancer cells that correlates with metastasis. Here we show that T-antigen
in Drosophila melanogaster macrophages is involved in their developmentally programmed
tissue invasion. Higher macrophage T-antigen levels require an atypical major
facilitator superfamily (MFS) member that we named Minerva which enables macrophage
dissemination and invasion. We characterize for the first time the T and Tn glycoform
O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva
increases the presence of T-antigen on proteins in pathways previously linked
to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required
for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the
minerva mutant’s migration and T-antigen glycosylation defects. We thus identify
a key conserved regulator that orchestrates O-glycosylation on a protein subset
to activate a program governing migration steps important for both development
and cancer metastasis.
acknowledged_ssus:
- _id: LifeSc
article_number: e41801
article_processing_charge: No
author:
- first_name: Katarina
full_name: Valosková, Katarina
id: 46F146FC-F248-11E8-B48F-1D18A9856A87
last_name: Valosková
orcid: 0000-0002-7926-0221
- first_name: Julia
full_name: Biebl, Julia
id: 3CCBB46E-F248-11E8-B48F-1D18A9856A87
last_name: Biebl
- first_name: Marko
full_name: Roblek, Marko
id: 3047D808-F248-11E8-B48F-1D18A9856A87
last_name: Roblek
orcid: 0000-0001-9588-1389
- first_name: Shamsi
full_name: Emtenani, Shamsi
id: 49D32318-F248-11E8-B48F-1D18A9856A87
last_name: Emtenani
orcid: 0000-0001-6981-6938
- first_name: Attila
full_name: György, Attila
id: 3BCEDBE0-F248-11E8-B48F-1D18A9856A87
last_name: György
orcid: 0000-0002-1819-198X
- first_name: Michaela
full_name: Misova, Michaela
id: 495A3C32-F248-11E8-B48F-1D18A9856A87
last_name: Misova
orcid: 0000-0003-2427-6856
- first_name: Aparna
full_name: Ratheesh, Aparna
id: 2F064CFE-F248-11E8-B48F-1D18A9856A87
last_name: Ratheesh
orcid: 0000-0001-7190-0776
- first_name: Patricia
full_name: Dos Reis Rodrigues, Patricia
id: 26E95904-5160-11E9-9C0B-C5B0DC97E90F
last_name: Dos Reis Rodrigues
orcid: 0000-0003-1681-508X
- first_name: Katerina
full_name: Shkarina, Katerina
last_name: Shkarina
- first_name: Ida Signe Bohse
full_name: Larsen, Ida Signe Bohse
last_name: Larsen
- first_name: Sergey Y
full_name: Vakhrushev, Sergey Y
last_name: Vakhrushev
- first_name: Henrik
full_name: Clausen, Henrik
last_name: Clausen
- 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: Valosková K, Bicher J, Roblek M, et al. A conserved major facilitator superfamily
member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion.
eLife. 2019;8. doi:10.7554/elife.41801
apa: Valosková, K., Bicher, J., Roblek, M., Emtenani, S., György, A., Misova, M.,
… Siekhaus, D. E. (2019). A conserved major facilitator superfamily member orchestrates
a subset of O-glycosylation to aid macrophage tissue invasion. ELife. eLife
Sciences Publications. https://doi.org/10.7554/elife.41801
chicago: Valosková, Katarina, Julia Bicher, Marko Roblek, Shamsi Emtenani, Attila
György, Michaela Misova, Aparna Ratheesh, et al. “A Conserved Major Facilitator
Superfamily Member Orchestrates a Subset of O-Glycosylation to Aid Macrophage
Tissue Invasion.” ELife. eLife Sciences Publications, 2019. https://doi.org/10.7554/elife.41801.
ieee: K. Valosková et al., “A conserved major facilitator superfamily member
orchestrates a subset of O-glycosylation to aid macrophage tissue invasion,” eLife,
vol. 8. eLife Sciences Publications, 2019.
ista: Valosková K, Bicher J, Roblek M, Emtenani S, György A, Misova M, Ratheesh
A, Dos Reis Rodrigues P, Shkarina K, Larsen ISB, Vakhrushev SY, Clausen H, Siekhaus
DE. 2019. A conserved major facilitator superfamily member orchestrates a subset
of O-glycosylation to aid macrophage tissue invasion. eLife. 8, e41801.
mla: Valosková, Katarina, et al. “A Conserved Major Facilitator Superfamily Member
Orchestrates a Subset of O-Glycosylation to Aid Macrophage Tissue Invasion.” ELife,
vol. 8, e41801, eLife Sciences Publications, 2019, doi:10.7554/elife.41801.
short: K. Valosková, J. Bicher, M. Roblek, S. Emtenani, A. György, M. Misova, A.
Ratheesh, P. Dos Reis Rodrigues, K. Shkarina, I.S.B. Larsen, S.Y. Vakhrushev,
H. Clausen, D.E. Siekhaus, ELife 8 (2019).
date_created: 2019-03-28T13:37:45Z
date_published: 2019-03-26T00:00:00Z
date_updated: 2026-09-13T22:31:13Z
day: '26'
ddc:
- '570'
department:
- _id: DaSi
doi: 10.7554/elife.41801
ec_funded: 1
external_id:
isi:
- '000462530200001'
file:
- access_level: open_access
checksum: cc0d1a512559d52e7e7cb0e9b9854b40
content_type: application/pdf
creator: dernst
date_created: 2019-03-28T14:00:41Z
date_updated: 2020-07-14T12:47:23Z
file_id: '6188'
file_name: 2019_eLife_Valoskova.pdf
file_size: 4496017
relation: main_file
file_date_updated: 2020-07-14T12:47:23Z
fulldoi: https://doi.org/10.7554/elife.41801
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
project:
- _id: 253CDE40-B435-11E9-9278-68D0E5697425
grant_number: '24283'
name: Examination of the role of a MFS transporter in the migration of Drosophila
immune cells
- _id: 253B6E48-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P29638
name: The role of Drosophila TNF alpha in immune cell invasion
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
- _id: 25388084-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '329540'
name: 'Breaking barriers: Investigating the junctional and mechanobiological changes
underlying the ability of Drosophila immune cells to invade an epithelium'
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication: eLife
publication_identifier:
issn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
related_material:
link:
- description: News on IST Homepage
relation: press_release
url: https://ist.ac.at/en/news/new-gene-potentially-involved-in-metastasis-identified/
record:
- id: '6530'
relation: dissertation_contains
- id: '8983'
relation: dissertation_contains
status: public
- id: '6546'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation
to aid macrophage tissue invasion
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 8
year: '2019'
...
---
OA_place: publisher
_id: '6546'
abstract:
- lang: eng
text: "Invasive migration plays a crucial role not only during development and homeostasis
but also in pathological states, such as tumor metastasis. Drosophila macrophage
migration into the extended germband is an interesting system to study invasive
migration. It carries similarities to immune cell transmigration and cancer cell
invasion, therefore studying this process could also bring new understanding of
invasion in higher organisms. In our work, we uncover a highly conserved member
of the major facilitator family that plays a role in tissue invasion through regulation
of glycosylation on a subgroup of proteins and/or by aiding the precise timing
of DN-Cadherin downregulation. \r\n\r\nAberrant display of the truncated core1
O-glycan T-antigen is a common feature of human cancer cells that correlates with
metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages
is involved in their developmentally programmed tissue invasion. Higher macrophage
T-antigen levels require an atypical major facilitator superfamily (MFS) member
that we named Minerva which enables macrophage dissemination and invasion. We
characterize for the first time the T and Tn glycoform O-glycoproteome of the
Drosophila melanogaster embryo, and determine that Minerva increases the presence
of T-antigen on proteins in pathways previously linked to cancer, most strongly
on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue
entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration
and T-antigen glycosylation defects. We thus identify \r\na key conserved regulator
that orchestrates O-glycosylation on a protein subset to activate \r\na program
governing migration steps important for both development and cancer metastasis.
\r\n"
acknowledged_ssus:
- _id: Bio
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Katarina
full_name: Valosková, Katarina
id: 46F146FC-F248-11E8-B48F-1D18A9856A87
last_name: Valosková
orcid: 0000-0002-7926-0221
citation:
ama: Valosková K. The role of a highly conserved major facilitator superfamily member
in Drosophila embryonic macrophage migration. 2019. doi:10.15479/AT:ISTA:6546
apa: Valosková, K. (2019). The role of a highly conserved major facilitator superfamily
member in Drosophila embryonic macrophage migration. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:6546
chicago: Valosková, Katarina. “The Role of a Highly Conserved Major Facilitator
Superfamily Member in Drosophila Embryonic Macrophage Migration.” Institute of
Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6546.
ieee: K. Valosková, “The role of a highly conserved major facilitator superfamily
member in Drosophila embryonic macrophage migration,” Institute of Science and
Technology Austria, 2019.
ista: Valosková K. 2019. The role of a highly conserved major facilitator superfamily
member in Drosophila embryonic macrophage migration. Institute of Science and
Technology Austria.
mla: Valosková, Katarina. The Role of a Highly Conserved Major Facilitator Superfamily
Member in Drosophila Embryonic Macrophage Migration. Institute of Science
and Technology Austria, 2019, doi:10.15479/AT:ISTA:6546.
short: K. Valosková, The Role of a Highly Conserved Major Facilitator Superfamily
Member in Drosophila Embryonic Macrophage Migration, Institute of Science and
Technology Austria, 2019.
corr_author: '1'
date_created: 2019-06-07T12:49:19Z
date_published: 2019-06-07T00:00:00Z
date_updated: 2026-09-03T06:37:27Z
day: '07'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: DaSi
- _id: GradSch
doi: 10.15479/AT:ISTA:6546
doi_confirm: '1'
file:
- access_level: closed
checksum: 68949c2d96210b45b981a23e9c9cd93c
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: khribikova
date_created: 2019-06-07T13:00:04Z
date_updated: 2020-07-14T12:47:33Z
embargo_to: open_access
file_id: '6549'
file_name: Katarina Valoskova_PhD thesis_final version.docx
file_size: 14110626
relation: source_file
- access_level: open_access
checksum: 555329cd76e196c96f5278c480ee2e6e
content_type: application/pdf
creator: khribikova
date_created: 2019-06-07T13:00:08Z
date_updated: 2021-02-11T11:17:14Z
embargo: 2020-06-07
file_id: '6550'
file_name: Katarina Valoskova_PhD thesis_final version.pdf
file_size: 10054156
relation: main_file
file_date_updated: 2021-02-11T11:17:14Z
fulldoi: https://doi.org/10.15479/AT:ISTA:6546
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '141'
project:
- _id: 253CDE40-B435-11E9-9278-68D0E5697425
grant_number: '24283'
name: Examination of the role of a MFS transporter in the migration of Drosophila
immune cells
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '544'
relation: part_of_dissertation
status: public
- id: '6187'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
title: The role of a highly conserved major facilitator superfamily member in Drosophila
embryonic macrophage migration
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...
---
OA_place: publisher
_id: '6849'
abstract:
- lang: eng
text: 'Brain function is mediated by complex dynamical interactions between excitatory
and inhibitory cell types. The Cholecystokinin-expressing inhibitory cells (CCK-interneurons)
are one of the least studied types, despite being suspected to play important
roles in cognitive processes. We studied the network effects of optogenetic silencing
of CCK-interneurons in the CA1 hippocampal area during exploration and sleep states.
The cell firing pattern in response to light pulses allowed us to classify the
recorded neurons in 5 classes, including disinhibited and non-responsive pyramidal
cell and interneurons, and the inhibited interneurons corresponding to the CCK
group. The light application, which inhibited the activity of CCK interneurons
triggered wider changes in the firing dynamics of cells. We observed rate changes
(i.e. remapping) of pyramidal cells during the exploration session in which the
light was applied relative to the previous control session that was not restricted
neither in time nor space to the light delivery. Also, the disinhibited pyramidal
cells had higher increase in bursting than in single spike firing rate as a result
of CCK silencing. In addition, the firing activity patterns during exploratory
periods were more weakly reactivated in sleep for those periods in which CCK-interneuron
were silenced than in the unaffected periods. Furthermore, light pulses during
sleep disrupted the reactivation of recent waking patterns. Hence, silencing CCK
neurons during exploration suppressed the reactivation of waking firing patterns
in sleep and CCK interneuron activity was also required during sleep for the normal
reactivation of waking patterns. These findings demonstrate the involvement of
CCK cells in reactivation-related memory consolidation. An important part of our
analysis was to test the relationship of the identified CCKinterneurons to brain
oscillations. Our findings showed that these cells exhibited different oscillatory
behaviour during anaesthesia and natural waking and sleep conditions. We showed
that: 1) Contrary to the past studies performed under anaesthesia, the identified
CCKinterneurons fired on the descending portion of the theta phase in waking exploration.
2) CCKinterneuron preferred phases around the trough of gamma oscillations. 3)
Contrary to anaesthesia conditions, the average firing rate of the CCK-interneurons
increased around the peak activity of the sharp-wave ripple (SWR) events in natural
sleep, which is congruent with new reports about their functional connectivity.
We also found that light driven CCK-interneuron silencing altered the dynamics
on the CA1 network oscillatory activity: 1) Pyramidal cells negatively shifted
their preferred theta phases when the light was applied, while interneurons responses
were less consistent. 2) As a population, pyramidal cells negatively shifted their
preferred activity during gamma oscillations, albeit we did not find gamma modulation
differences related to the light application when pyramidal cells were subdivided
into the disinhibited and unaffected groups. 3) During the peak of SWR events,
all but the CCK-interneurons had a reduction in their relative firing rate change
during the light application as compared to the change observed at SWR initiation.
Finally, regarding to the place field activity of the recorded pyramidal neurons,
we showed that the disinhibited pyramidal cells had reduced place field similarity,
coherence and spatial information, but only during the light application. The
mechanisms behind such observed behaviours might involve eCB signalling and plastic
changes in CCK-interneuron synapses. In conclusion, the observed changes related
to the light-mediated silencing of CCKinterneurons have unravelled characteristics
of this interneuron subpopulation that might change the understanding not only
of their particular network interactions, but also of the current theories about
the emergence of certain cognitive processes such as place coding needed for navigation
or hippocampus-dependent memory consolidation. '
acknowledged_ssus:
- _id: Bio
- _id: PreCl
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Dámaris K
full_name: Rangel Guerrero, Dámaris K
id: 4871BCE6-F248-11E8-B48F-1D18A9856A87
last_name: Rangel Guerrero
orcid: 0000-0002-8602-4374
citation:
ama: Rangel Guerrero DK. The role of CCK-interneurons in regulating hippocampal
network dynamics. 2019. doi:10.15479/AT:ISTA:6849
apa: Rangel Guerrero, D. K. (2019). The role of CCK-interneurons in regulating
hippocampal network dynamics. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:6849
chicago: Rangel Guerrero, Dámaris K. “The Role of CCK-Interneurons in Regulating
Hippocampal Network Dynamics.” Institute of Science and Technology Austria, 2019.
https://doi.org/10.15479/AT:ISTA:6849.
ieee: D. K. Rangel Guerrero, “The role of CCK-interneurons in regulating hippocampal
network dynamics,” Institute of Science and Technology Austria, 2019.
ista: Rangel Guerrero DK. 2019. The role of CCK-interneurons in regulating hippocampal
network dynamics. Institute of Science and Technology Austria.
mla: Rangel Guerrero, Dámaris K. The Role of CCK-Interneurons in Regulating Hippocampal
Network Dynamics. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6849.
short: D.K. Rangel Guerrero, The Role of CCK-Interneurons in Regulating Hippocampal
Network Dynamics, Institute of Science and Technology Austria, 2019.
corr_author: '1'
date_created: 2019-09-06T06:54:16Z
date_published: 2019-09-09T00:00:00Z
date_updated: 2026-09-03T06:40:36Z
day: '09'
ddc:
- '570'
degree_awarded: PhD
department:
- _id: JoCs
- _id: GradSch
doi: 10.15479/AT:ISTA:6849
doi_confirm: '1'
file:
- access_level: closed
checksum: 244dc4f74dbfc94f414156092298831f
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: drangel
date_created: 2019-09-09T13:09:45Z
date_updated: 2021-02-10T23:30:09Z
embargo_to: open_access
file_id: '6865'
file_name: Thesis_Damaris_Rangel_source.docx
file_size: 18253100
relation: source_file
- access_level: open_access
checksum: 59c73be40eeaa1c4db24067270151555
content_type: application/pdf
creator: drangel
date_created: 2019-09-09T13:09:52Z
date_updated: 2020-09-11T22:30:04Z
embargo: 2020-09-10
file_id: '6866'
file_name: Thesis_Damaris_Rangel_pdfa.pdf
file_size: 2160109
relation: main_file
request_a_copy: 0
file_date_updated: 2021-02-10T23:30:09Z
fulldoi: https://doi.org/10.15479/AT:ISTA:6849
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '97'
publication_identifier:
isbn:
- 978-3-99078-003-9
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '5914'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
title: The role of CCK-interneurons in regulating hippocampal network dynamics
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2019'
...
---
OA_place: publisher
_id: '7132'
abstract:
- lang: eng
text: "A major challenge in neuroscience research is to dissect the circuits that
orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian
species, such as microbial opsins, have been successfully transplanted to specific
neuronal targets to override their natural communication patterns. The goal of
our work is to manipulate synaptic communication in a manner that closely incorporates
the functional intricacies of synapses by preserving temporal encoding (i.e. the
firing pattern of the presynaptic neuron) and connectivity (i.e. target specific
synapses rather than specific neurons). Our strategy to achieve this goal builds
on the use of non-mammalian transplants to create a synthetic synapse. The mode
of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN)
into synaptic vesicles by means of a genetically targeted transporter selective
for the SN. Upon natural vesicular release, exposure of the SN to the synaptic
cleft will modify the post-synaptic potential through an orthogonal ligand gated
ion channel. To achieve this goal we have functionally characterized a mixed cationic
methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally
characterize a synthetic transporter in isolated synaptic vesicles without the
need for transgenic animals, identified and extracted multiple prokaryotic uptake
systems that are substrate specific for methionine (Met), and established a primary/cell
line co-culture system that would allow future combinatorial testing of this orthogonal
transmitter-transporter-channel trifecta.\r\nSynthetic synapses will provide a
unique opportunity to manipulate synaptic communication while maintaining the
electrophysiological integrity of the pre-synaptic cell. In this way, information
may be preserved that was generated in upstream circuits and that could be essential
for concerted function and information processing."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Catherine
full_name: Mckenzie, Catherine
id: 3EEDE19A-F248-11E8-B48F-1D18A9856A87
last_name: Mckenzie
citation:
ama: Mckenzie C. Design and characterization of methods and biological components
to realize synthetic neurotransmission. 2019. doi:10.15479/at:ista:7132
apa: Mckenzie, C. (2019). Design and characterization of methods and biological
components to realize synthetic neurotransmission. Institute of Science and
Technology Austria. https://doi.org/10.15479/at:ista:7132
chicago: Mckenzie, Catherine. “Design and Characterization of Methods and Biological
Components to Realize Synthetic Neurotransmission.” Institute of Science and Technology
Austria, 2019. https://doi.org/10.15479/at:ista:7132.
ieee: C. Mckenzie, “Design and characterization of methods and biological components
to realize synthetic neurotransmission,” Institute of Science and Technology Austria,
2019.
ista: Mckenzie C. 2019. Design and characterization of methods and biological components
to realize synthetic neurotransmission. Institute of Science and Technology Austria.
mla: Mckenzie, Catherine. Design and Characterization of Methods and Biological
Components to Realize Synthetic Neurotransmission. Institute of Science and
Technology Austria, 2019, doi:10.15479/at:ista:7132.
short: C. Mckenzie, Design and Characterization of Methods and Biological Components
to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria,
2019.
corr_author: '1'
date_created: 2019-11-27T09:07:14Z
date_published: 2019-06-27T00:00:00Z
date_updated: 2026-09-13T22:31:13Z
day: '27'
ddc:
- '571'
- '573'
degree_awarded: PhD
department:
- _id: HaJa
doi: 10.15479/at:ista:7132
file:
- access_level: closed
checksum: 34d0fe0f6e0af97b5937205a3e350423
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: dernst
date_created: 2019-11-27T09:06:10Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7133'
file_name: McKenzie PhD Thesis August 2018 - Corrected Final.docx
file_size: 5054633
relation: source_file
- access_level: open_access
checksum: 140dfb5e3df7edca34f4b6fcc55d876f
content_type: application/pdf
creator: dernst
date_created: 2019-11-27T09:06:10Z
date_updated: 2020-07-14T12:47:50Z
file_id: '7134'
file_name: McKenzie PhD Thesis August 2018 - Corrected Final.pdf
file_size: 3231837
relation: main_file
file_date_updated: 2020-07-14T12:47:50Z
fulldoi: https://doi.org/10.15479/at:ista:7132
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '95'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '6266'
relation: old_edition
status: public
status: public
supervisor:
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
title: Design and characterization of methods and biological components to realize
synthetic neurotransmission
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2019'
...
---
_id: '10864'
abstract:
- lang: eng
text: We prove that every congruence distributive variety has directed Jónsson terms,
and every congruence modular variety has directed Gumm terms. The directed terms
we construct witness every case of absorption witnessed by the original Jónsson
or Gumm terms. This result is equivalent to a pair of claims about absorption
for admissible preorders in congruence distributive and congruence modular varieties,
respectively. For finite algebras, these absorption theorems have already seen
significant applications, but until now, it was not clear if the theorems hold
for general algebras as well. Our method also yields a novel proof of a result
by P. Lipparini about the existence of a chain of terms (which we call Pixley
terms) in varieties that are at the same time congruence distributive and k-permutable
for some k.
acknowledgement: The second author was supported by National Science Center grant
DEC-2011-/01/B/ST6/01006.
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
- first_name: Marcin
full_name: Kozik, Marcin
last_name: Kozik
- first_name: Ralph
full_name: McKenzie, Ralph
last_name: McKenzie
- first_name: Matthew
full_name: Moore, Matthew
last_name: Moore
citation:
ama: 'Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms.
In: Czelakowski J, ed. Don Pigozzi on Abstract Algebraic Logic, Universal Algebra,
and Computer Science. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:10.1007/978-3-319-74772-9_7'
apa: 'Kazda, A., Kozik, M., McKenzie, R., & Moore, M. (2018). Absorption and
directed Jónsson terms. In J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic
Logic, Universal Algebra, and Computer Science (Vol. 16, pp. 203–220). Cham:
Springer Nature. https://doi.org/10.1007/978-3-319-74772-9_7'
chicago: 'Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption
and Directed Jónsson Terms.” In Don Pigozzi on Abstract Algebraic Logic, Universal
Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham:
Springer Nature, 2018. https://doi.org/10.1007/978-3-319-74772-9_7.'
ieee: 'A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson
terms,” in Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and
Computer Science, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018,
pp. 203–220.'
ista: 'Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson
terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science. vol. 16, 203–220.'
mla: Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” Don Pigozzi
on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited
by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:10.1007/978-3-319-74772-9_7.
short: A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don
Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science,
Springer Nature, Cham, 2018, pp. 203–220.
corr_author: '1'
date_created: 2022-03-18T10:30:32Z
date_published: 2018-03-21T00:00:00Z
date_updated: 2024-10-09T21:01:50Z
day: '21'
department:
- _id: VlKo
doi: 10.1007/978-3-319-74772-9_7
editor:
- first_name: J
full_name: Czelakowski, J
last_name: Czelakowski
external_id:
arxiv:
- '1502.01072'
fulldoi: https://doi.org/10.1007/978-3-319-74772-9_7
intvolume: ' 16'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1502.01072
month: '03'
oa: 1
oa_version: Preprint
page: 203-220
place: Cham
publication: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer
Science
publication_identifier:
eisbn:
- '9783319747729'
eissn:
- 2211-2766
isbn:
- '9783319747712'
issn:
- 2211-2758
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: OCTR
status: public
title: Absorption and directed Jónsson terms
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 16
year: '2018'
...
---
_id: '10880'
abstract:
- lang: eng
text: Acquisition of evolutionary novelties is a fundamental process for adapting
to the external environment and invading new niches and results in the diversification
of life, which we can see in the world today. How such novel phenotypic traits
are acquired in the course of evolution and are built up in developing embryos
has been a central question in biology. Whole-genome duplication (WGD) is a process
of genome doubling that supplies raw genetic materials and increases genome complexity.
Recently, it has been gradually revealed that WGD and subsequent fate changes
of duplicated genes can facilitate phenotypic evolution. Here, we review the current
understanding of the relationship between WGD and the acquisition of evolutionary
novelties. We show some examples of this link and discuss how WGD and subsequent
duplicated genes can facilitate phenotypic evolution as well as when such genomic
doubling can be advantageous for adaptation.
acknowledgement: This work was supported by JSPS overseas research fellowships (Y.M.)
and SENSHIN Medical Research Foundation (K.K.T.).
article_processing_charge: No
article_type: original
author:
- first_name: Moriyama
full_name: Yuuta, Moriyama
id: 4968E7C8-F248-11E8-B48F-1D18A9856A87
last_name: Yuuta
orcid: 0000-0002-2853-8051
- first_name: Kazuko
full_name: Koshiba-Takeuchi, Kazuko
last_name: Koshiba-Takeuchi
citation:
ama: Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the
emergence of evolutionary novelties. Briefings in Functional Genomics.
2018;17(5):329-338. doi:10.1093/bfgp/ely007
apa: Yuuta, M., & Koshiba-Takeuchi, K. (2018). Significance of whole-genome
duplications on the emergence of evolutionary novelties. Briefings in Functional
Genomics. Oxford University Press. https://doi.org/10.1093/bfgp/ely007
chicago: Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome
Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional
Genomics. Oxford University Press, 2018. https://doi.org/10.1093/bfgp/ely007.
ieee: M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications
on the emergence of evolutionary novelties,” Briefings in Functional Genomics,
vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018.
ista: Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications
on the emergence of evolutionary novelties. Briefings in Functional Genomics.
17(5), 329–338.
mla: Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome
Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional
Genomics, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:10.1093/bfgp/ely007.
short: M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018)
329–338.
corr_author: '1'
date_created: 2022-03-18T12:40:35Z
date_published: 2018-09-01T00:00:00Z
date_updated: 2026-06-18T10:44:32Z
day: '01'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1093/bfgp/ely007
external_id:
isi:
- '000456054400004'
pmid:
- '29579140'
fulldoi: https://doi.org/10.1093/bfgp/ely007
intvolume: ' 17'
isi: 1
issue: '5'
keyword:
- Genetics
- Molecular Biology
- Biochemistry
- General Medicine
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1093/bfgp/ely007
month: '09'
oa: 1
oa_version: Published Version
page: 329-338
pmid: 1
publication: Briefings in Functional Genomics
publication_identifier:
eissn:
- 2041-2657
issn:
- 2041-2649
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Significance of whole-genome duplications on the emergence of evolutionary
novelties
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2018'
...
---
_id: '10881'
abstract:
- lang: eng
text: Strigolactones (SLs) are a relatively recent addition to the list of plant
hormones that control different aspects of plant development. SL signalling is
perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN
INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called
karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2
1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome
targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated
distinct developmental roles for each, but very little is known about these repressors
in terms of their sequence features. In this study, we performed an extensive
comparative analysis of SMXLs and determined their phylogenetic and evolutionary
history in the plant lineage. Our results show that SMXL family members can be
sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1.
Further, we identified the clade-specific motifs that have evolved and that might
act as determinants of SL-KAR signalling specificity. These specificities resulted
from functional diversities among the clades. Our results suggest that a gradual
co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an
increased specificity to both the SL perception and response in land plants.
acknowledgement: "This project received funding from the European Union’s Horizon
2020 research and innovation programme under the Marie Skłodowska-Curie Actions
and it is co-financed by the South Moravian Region under grant agreement No. 665860
(SS). Access to computing and storage facilities owned by parties and projects contributing
to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects
of Large Infrastructure for Research, Development, and Innovations’ (LM2010005)
was greatly appreciated (RSV). The project was funded by The Ministry of Education,
Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601)
(TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG
20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr
Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore
Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly
the authors’ views, and the EU is not responsible for any use that may be made of
the information it contains. "
article_processing_charge: No
article_type: original
author:
- first_name: Taraka Ramji
full_name: Moturu, Taraka Ramji
last_name: Moturu
- first_name: Sravankumar
full_name: Thula, Sravankumar
last_name: Thula
- first_name: Ravi Kumar
full_name: Singh, Ravi Kumar
last_name: Singh
- first_name: Tomasz
full_name: Nodzyński, Tomasz
last_name: Nodzyński
- first_name: Radka Svobodová
full_name: Vařeková, Radka Svobodová
last_name: Vařeková
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Sibu
full_name: Simon, Sibu
last_name: Simon
citation:
ama: Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification
of the SMXL gene family. Journal of Experimental Botany. 2018;69(9):2367-2378.
doi:10.1093/jxb/ery097
apa: Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml,
J., & Simon, S. (2018). Molecular evolution and diversification of the SMXL
gene family. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery097
chicago: Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński,
Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and
Diversification of the SMXL Gene Family.” Journal of Experimental Botany.
Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery097.
ieee: T. R. Moturu et al., “Molecular evolution and diversification of the
SMXL gene family,” Journal of Experimental Botany, vol. 69, no. 9. Oxford
University Press, pp. 2367–2378, 2018.
ista: Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S.
2018. Molecular evolution and diversification of the SMXL gene family. Journal
of Experimental Botany. 69(9), 2367–2378.
mla: Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the
SMXL Gene Family.” Journal of Experimental Botany, vol. 69, no. 9, Oxford
University Press, 2018, pp. 2367–78, doi:10.1093/jxb/ery097.
short: T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml,
S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.
date_created: 2022-03-18T12:43:22Z
date_published: 2018-04-13T00:00:00Z
date_updated: 2025-04-15T07:48:01Z
day: '13'
department:
- _id: JiFr
doi: 10.1093/jxb/ery097
ec_funded: 1
external_id:
isi:
- '000430727000016'
pmid:
- '29538714'
fulldoi: https://doi.org/10.1093/jxb/ery097
intvolume: ' 69'
isi: 1
issue: '9'
keyword:
- Plant Science
- Physiology
language:
- iso: eng
month: '04'
oa_version: None
page: 2367-2378
pmid: 1
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Journal of Experimental Botany
publication_identifier:
eissn:
- 1460-2431
issn:
- 0022-0957
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular evolution and diversification of the SMXL gene family
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 69
year: '2018'
...
---
_id: '10882'
abstract:
- lang: eng
text: 'We introduce Intelligent Annotation Dialogs for bounding box annotation.
We train an agent to automatically choose a sequence of actions for a human annotator
to produce a bounding box in a minimal amount of time. Specifically, we consider
two actions: box verification [34], where the annotator verifies a box generated
by an object detector, and manual box drawing. We explore two kinds of agents,
one based on predicting the probability that a box will be positively verified,
and the other based on reinforcement learning. We demonstrate that (1) our agents
are able to learn efficient annotation strategies in several scenarios, automatically
adapting to the image difficulty, the desired quality of the boxes, and the detector
strength; (2) in all scenarios the resulting annotation dialogs speed up annotation
compared to manual box drawing alone and box verification alone, while also outperforming
any fixed combination of verification and drawing in most scenarios; (3) in a
realistic scenario where the detector is iteratively re-trained, our agents evolve
a series of strategies that reflect the shifting trade-off between verification
and drawing as the detector grows stronger.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Jasper
full_name: Uijlings, Jasper
last_name: Uijlings
- first_name: Ksenia
full_name: Konyushkova, Ksenia
last_name: Konyushkova
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
citation:
ama: 'Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs
for bounding box annotation. In: 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. IEEE; 2018:9175-9184. doi:10.1109/cvpr.2018.00956'
apa: 'Uijlings, J., Konyushkova, K., Lampert, C., & Ferrari, V. (2018). Learning
intelligent dialogs for bounding box annotation. In 2018 IEEE/CVF Conference
on Computer Vision and Pattern Recognition (pp. 9175–9184). Salt Lake City,
UT, United States: IEEE. https://doi.org/10.1109/cvpr.2018.00956'
chicago: Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari.
“Learning Intelligent Dialogs for Bounding Box Annotation.” In 2018 IEEE/CVF
Conference on Computer Vision and Pattern Recognition, 9175–84. IEEE, 2018.
https://doi.org/10.1109/cvpr.2018.00956.
ieee: J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent
dialogs for bounding box annotation,” in 2018 IEEE/CVF Conference on Computer
Vision and Pattern Recognition, Salt Lake City, UT, United States, 2018, pp.
9175–9184.
ista: 'Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent
dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision
and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition,
9175–9184.'
mla: Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.”
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE,
2018, pp. 9175–84, doi:10.1109/cvpr.2018.00956.
short: J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference
on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.
conference:
end_date: 2018-06-23
location: Salt Lake City, UT, United States
name: 'CVF: Conference on Computer Vision and Pattern Recognition'
start_date: 2018-06-18
corr_author: '1'
date_created: 2022-03-18T12:45:09Z
date_published: 2018-12-17T00:00:00Z
date_updated: 2024-10-09T21:02:26Z
day: '17'
department:
- _id: ChLa
doi: 10.1109/cvpr.2018.00956
external_id:
arxiv:
- '1712.08087'
isi:
- '000457843609036'
fulldoi: https://doi.org/10.1109/cvpr.2018.00956
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1712.08087'
month: '12'
oa: 1
oa_version: Preprint
page: 9175-9184
publication: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
publication_identifier:
eissn:
- 2575-7075
isbn:
- '9781538664209'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning intelligent dialogs for bounding box annotation
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '10883'
abstract:
- lang: eng
text: 'Solving parity games, which are equivalent to modal μ-calculus model checking,
is a central algorithmic problem in formal methods, with applications in reactive
synthesis, program repair, verification of branching-time properties, etc. Besides
the standard compu- tation model with the explicit representation of games, another
important theoretical model of computation is that of set-based symbolic algorithms.
Set-based symbolic algorithms use basic set operations and one-step predecessor
operations on the implicit description of games, rather than the explicit representation.
The significance of symbolic algorithms is that they provide scalable algorithms
for large finite-state systems, as well as for infinite-state systems with finite
quotient. Consider parity games on graphs with n vertices and parity conditions
with d priorities. While there is a rich literature of explicit algorithms for
parity games, the main results for set-based symbolic algorithms are as follows:
(a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic
space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations
and O(n) symbolic space. In this work, our contributions are as follows: (1) We
present a black-box set-based symbolic algorithm based on the explicit progress
measure algorithm. Two important consequences of our algorithm are as follows:
(a) a set-based symbolic algorithm for parity games that requires quasi-polynomially
many symbolic operations and O(n) symbolic space; and (b) any future improvement
in progress measure based explicit algorithms immediately imply an efficiency
improvement in our set-based symbolic algorithm for parity games. (2) We present
a set-based symbolic algorithm that requires quasi-polynomially many symbolic
operations and O(d · log n) symbolic space. Moreover, for the important special
case of d ≤ log n, our algorithm requires only polynomially many symbolic operations
and poly-logarithmic symbolic space.'
acknowledgement: 'A. S. is fully supported by the Vienna Science and Technology Fund
(WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund
(FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph
Games). For M.H the research leading to these results has received funding from
the European Research Council under the European Union’s Seventh Framework Programme
(FP/2007-2013) /ERC Grant Agreement no. 340506.'
alternative_title:
- EPiC Series in Computing
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- 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: Svozil, Alexander
last_name: Svozil
citation:
ama: 'Chatterjee K, Dvořák W, Henzinger M, Svozil A. Quasipolynomial set-based symbolic
algorithms for parity games. In: 22nd International Conference on Logic for
Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253.
doi:10.29007/5z5k'
apa: 'Chatterjee, K., Dvořák, W., Henzinger, M., & Svozil, A. (2018). Quasipolynomial
set-based symbolic algorithms for parity games. In 22nd International Conference
on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57,
pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k'
chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika Henzinger, and Alexander
Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd
International Conference on Logic for Programming, Artificial Intelligence and
Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
ieee: K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Quasipolynomial set-based
symbolic algorithms for parity games,” in 22nd International Conference on
Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia,
2018, vol. 57, pp. 233–253.
ista: 'Chatterjee K, Dvořák W, Henzinger M, Svozil A. 2018. Quasipolynomial set-based
symbolic algorithms for parity games. 22nd International Conference on Logic for
Programming, Artificial Intelligence and Reasoning. LPAR: Logic for Programming,
Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.'
mla: Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms
for Parity Games.” 22nd International Conference on Logic for Programming,
Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53,
doi:10.29007/5z5k.
short: K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, in:, 22nd International
Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair,
2018, pp. 233–253.
conference:
end_date: 2018-11-21
location: Awassa, Ethiopia
name: 'LPAR: Logic for Programming, Artificial Intelligence and Reasoning'
start_date: 2018-11-17
date_created: 2022-03-18T12:46:32Z
date_published: 2018-10-23T00:00:00Z
date_updated: 2025-07-10T11:50:02Z
day: '23'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.29007/5z5k
ec_funded: 1
external_id:
arxiv:
- '1909.04983'
file:
- access_level: open_access
checksum: 1229aa8640bd6db610c85decf2265480
content_type: application/pdf
creator: dernst
date_created: 2022-05-17T07:51:08Z
date_updated: 2022-05-17T07:51:08Z
file_id: '11392'
file_name: 2018_EPiCs_Chatterjee.pdf
file_size: 720893
relation: main_file
success: 1
file_date_updated: 2022-05-17T07:51:08Z
fulldoi: https://doi.org/10.29007/5z5k
has_accepted_license: '1'
intvolume: ' 57'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 233-253
project:
- _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: 22nd International Conference on Logic for Programming, Artificial Intelligence
and Reasoning
publication_identifier:
issn:
- 2398-7340
publication_status: published
publisher: EasyChair
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quasipolynomial set-based symbolic algorithms for parity games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2018'
...
---
_id: '1092'
abstract:
- lang: eng
text: 'A graphical model encodes conditional independence relations via the Markov
properties. For an undirected graph these conditional independence relations can
be represented by a simple polytope known as the graph associahedron, which can
be constructed as a Minkowski sum of standard simplices. We show that there is
an analogous polytope for conditional independence relations coming from a regular
Gaussian model, and it can be defined using multiinformation or relative entropy.
For directed acyclic graphical models we give a construction of this polytope
as a Minkowski sum of matroid polytopes. Finally, we apply this geometric insight
to construct a new ordering-based search algorithm for causal inference via directed
acyclic graphical models. '
author:
- first_name: Fatemeh
full_name: Mohammadi, Fatemeh
id: 2C29581E-F248-11E8-B48F-1D18A9856A87
last_name: Mohammadi
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Charles
full_name: Wang, Charles
last_name: Wang
- first_name: Josephine
full_name: Yu, Josephine
last_name: Yu
citation:
ama: Mohammadi F, Uhler C, Wang C, Yu J. Generalized permutohedra from probabilistic
graphical models. SIAM Journal on Discrete Mathematics. 2018;32(1):64-93.
doi:10.1137/16M107894X
apa: Mohammadi, F., Uhler, C., Wang, C., & Yu, J. (2018). Generalized permutohedra
from probabilistic graphical models. SIAM Journal on Discrete Mathematics.
SIAM. https://doi.org/10.1137/16M107894X
chicago: Mohammadi, Fatemeh, Caroline Uhler, Charles Wang, and Josephine Yu. “Generalized
Permutohedra from Probabilistic Graphical Models.” SIAM Journal on Discrete
Mathematics. SIAM, 2018. https://doi.org/10.1137/16M107894X.
ieee: F. Mohammadi, C. Uhler, C. Wang, and J. Yu, “Generalized permutohedra from
probabilistic graphical models,” SIAM Journal on Discrete Mathematics,
vol. 32, no. 1. SIAM, pp. 64–93, 2018.
ista: Mohammadi F, Uhler C, Wang C, Yu J. 2018. Generalized permutohedra from probabilistic
graphical models. SIAM Journal on Discrete Mathematics. 32(1), 64–93.
mla: Mohammadi, Fatemeh, et al. “Generalized Permutohedra from Probabilistic Graphical
Models.” SIAM Journal on Discrete Mathematics, vol. 32, no. 1, SIAM, 2018,
pp. 64–93, doi:10.1137/16M107894X.
short: F. Mohammadi, C. Uhler, C. Wang, J. Yu, SIAM Journal on Discrete Mathematics
32 (2018) 64–93.
date_created: 2018-12-11T11:50:06Z
date_published: 2018-01-01T00:00:00Z
date_updated: 2021-01-12T06:48:13Z
day: '01'
doi: 10.1137/16M107894X
extern: '1'
fulldoi: https://doi.org/10.1137/16M107894X
intvolume: ' 32'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.01814
month: '01'
oa: 1
oa_version: Preprint
page: 64-93
publication: SIAM Journal on Discrete Mathematics
publication_status: published
publisher: SIAM
publist_id: '6284'
quality_controlled: '1'
status: public
title: Generalized permutohedra from probabilistic graphical models
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2018'
...
---
_id: '11'
abstract:
- lang: eng
text: We report on a novel strategy to derive mean-field limits of quantum mechanical
systems in which a large number of particles weakly couple to a second-quantized
radiation field. The technique combines the method of counting and the coherent
state approach to study the growth of the correlations among the particles and
in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon
system of equations from the Nelson model with ultraviolet cutoff and possibly
massless scalar field. In particular, we prove the convergence of the reduced
density matrices (of the nonrelativistic particles and the field bosons) associated
with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon
equations in trace norm. Furthermore, we derive explicit bounds on the rate of
convergence of the one-particle reduced density matrix of the nonrelativistic
particles in Sobolev norm.
arxiv: 1
author:
- first_name: Nikolai K
full_name: Leopold, Nikolai K
id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87
last_name: Leopold
orcid: 0000-0002-0495-6822
- first_name: Peter
full_name: Pickl, Peter
last_name: Pickl
citation:
ama: 'Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised
radiation fields. In: Vol 270. Springer; 2018:185-214. doi:10.1007/978-3-030-01602-9_9'
apa: 'Leopold, N. K., & Pickl, P. (2018). Mean-field limits of particles in
interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented
at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer.
https://doi.org/10.1007/978-3-030-01602-9_9'
chicago: Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in
Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. https://doi.org/10.1007/978-3-030-01602-9_9.
ieee: 'N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction
with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits
of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.'
ista: 'Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction
with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems
vol. 270, 185–214.'
mla: Leopold, Nikolai K., and Peter Pickl. Mean-Field Limits of Particles in
Interaction with Quantised Radiation Fields. Vol. 270, Springer, 2018, pp.
185–214, doi:10.1007/978-3-030-01602-9_9.
short: N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.
conference:
end_date: 2017-04-01
location: Munich, Germany
name: 'MaLiQS: Macroscopic Limits of Quantum Systems'
start_date: 2017-03-30
date_created: 2018-12-11T11:44:08Z
date_published: 2018-10-27T00:00:00Z
date_updated: 2021-01-12T06:48:16Z
day: '27'
department:
- _id: RoSe
doi: 10.1007/978-3-030-01602-9_9
ec_funded: 1
external_id:
arxiv:
- '1806.10843'
fulldoi: https://doi.org/10.1007/978-3-030-01602-9_9
intvolume: ' 270'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1806.10843
month: '10'
oa: 1
oa_version: Preprint
page: 185 - 214
project:
- _id: 25C6DC12-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '694227'
name: Analysis of quantum many-body systems
publication_status: published
publisher: Springer
publist_id: '8045'
quality_controlled: '1'
scopus_import: 1
status: public
title: Mean-field limits of particles in interaction with quantised radiation fields
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 270
year: '2018'
...
---
_id: '11063'
abstract:
- lang: eng
text: The total number of nuclear pore complexes (NPCs) per nucleus varies greatly
between different cell types and is known to change during cell differentiation
and cell transformation. However, the underlying mechanisms that control how many
nuclear transport channels are assembled into a given nuclear envelope remain
unclear. Here, we report that depletion of the NPC basket protein Tpr, but not
Nup153, dramatically increases the total NPC number in various cell types. This
negative regulation of Tpr occurs via a phosphorylation cascade of extracellular
signal-regulated kinase (ERK), the central kinase of the mitogen-activated protein
kinase (MAPK) pathway. Tpr serves as a scaffold for ERK to phosphorylate the nucleoporin
(Nup) Nup153, which is critical for early stages of NPC biogenesis. Our results
reveal a critical role of the Nup Tpr in coordinating signal transduction pathways
during cell proliferation and the dynamic organization of the nucleus.
article_processing_charge: No
article_type: original
author:
- first_name: Asako
full_name: McCloskey, Asako
last_name: McCloskey
- first_name: Arkaitz
full_name: Ibarra, Arkaitz
last_name: Ibarra
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: McCloskey A, Ibarra A, Hetzer M. Tpr regulates the total number of nuclear
pore complexes per cell nucleus. Genes & Development. 2018;32(19-20):1321-1331.
doi:10.1101/gad.315523.118
apa: McCloskey, A., Ibarra, A., & Hetzer, M. (2018). Tpr regulates the total
number of nuclear pore complexes per cell nucleus. Genes & Development.
Cold Spring Harbor Laboratory. https://doi.org/10.1101/gad.315523.118
chicago: McCloskey, Asako, Arkaitz Ibarra, and Martin Hetzer. “Tpr Regulates the
Total Number of Nuclear Pore Complexes per Cell Nucleus.” Genes & Development.
Cold Spring Harbor Laboratory, 2018. https://doi.org/10.1101/gad.315523.118.
ieee: A. McCloskey, A. Ibarra, and M. Hetzer, “Tpr regulates the total number of
nuclear pore complexes per cell nucleus,” Genes & Development, vol.
32, no. 19–20. Cold Spring Harbor Laboratory, pp. 1321–1331, 2018.
ista: McCloskey A, Ibarra A, Hetzer M. 2018. Tpr regulates the total number of nuclear
pore complexes per cell nucleus. Genes & Development. 32(19–20), 1321–1331.
mla: McCloskey, Asako, et al. “Tpr Regulates the Total Number of Nuclear Pore Complexes
per Cell Nucleus.” Genes & Development, vol. 32, no. 19–20, Cold Spring
Harbor Laboratory, 2018, pp. 1321–31, doi:10.1101/gad.315523.118.
short: A. McCloskey, A. Ibarra, M. Hetzer, Genes & Development 32 (2018) 1321–1331.
date_created: 2022-04-07T07:45:30Z
date_published: 2018-09-18T00:00:00Z
date_updated: 2024-10-14T11:19:35Z
day: '18'
doi: 10.1101/gad.315523.118
extern: '1'
external_id:
pmid:
- '30228202'
fulldoi: https://doi.org/10.1101/gad.315523.118
intvolume: ' 32'
issue: 19-20
keyword:
- Developmental Biology
- Genetics
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1101/gad.315523.118
month: '09'
oa: 1
oa_version: Published Version
page: 1321-1331
pmid: 1
publication: Genes & Development
publication_identifier:
issn:
- 0890-9369
- 1549-5477
publication_status: published
publisher: Cold Spring Harbor Laboratory
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tpr regulates the total number of nuclear pore complexes per cell nucleus
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2018'
...
---
_id: '11064'
abstract:
- lang: eng
text: Biomarkers of aging can be used to assess the health of individuals and to
study aging and age-related diseases. We generate a large dataset of genome-wide
RNA-seq profiles of human dermal fibroblasts from 133 people aged 1 to 94 years
old to test whether signatures of aging are encoded within the transcriptome.
We develop an ensemble machine learning method that predicts age to a median error
of 4 years, outperforming previous methods used to predict age. The ensemble was
further validated by testing it on ten progeria patients, and our method is the
only one that predicts accelerated aging in these patients.
article_number: '221'
article_processing_charge: No
article_type: original
author:
- first_name: Jason G.
full_name: Fleischer, Jason G.
last_name: Fleischer
- first_name: Roberta
full_name: Schulte, Roberta
last_name: Schulte
- first_name: Hsiao H.
full_name: Tsai, Hsiao H.
last_name: Tsai
- first_name: Swati
full_name: Tyagi, Swati
last_name: Tyagi
- first_name: Arkaitz
full_name: Ibarra, Arkaitz
last_name: Ibarra
- first_name: Maxim N.
full_name: Shokhirev, Maxim N.
last_name: Shokhirev
- first_name: Ling
full_name: Huang, Ling
last_name: Huang
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
- first_name: Saket
full_name: Navlakha, Saket
last_name: Navlakha
citation:
ama: Fleischer JG, Schulte R, Tsai HH, et al. Predicting age from the transcriptome
of human dermal fibroblasts. Genome Biology. 2018;19. doi:10.1186/s13059-018-1599-6
apa: Fleischer, J. G., Schulte, R., Tsai, H. H., Tyagi, S., Ibarra, A., Shokhirev,
M. N., … Navlakha, S. (2018). Predicting age from the transcriptome of human dermal
fibroblasts. Genome Biology. BioMed Central. https://doi.org/10.1186/s13059-018-1599-6
chicago: Fleischer, Jason G., Roberta Schulte, Hsiao H. Tsai, Swati Tyagi, Arkaitz
Ibarra, Maxim N. Shokhirev, Ling Huang, Martin Hetzer, and Saket Navlakha. “Predicting
Age from the Transcriptome of Human Dermal Fibroblasts.” Genome Biology.
BioMed Central, 2018. https://doi.org/10.1186/s13059-018-1599-6.
ieee: J. G. Fleischer et al., “Predicting age from the transcriptome of human
dermal fibroblasts,” Genome Biology, vol. 19. BioMed Central, 2018.
ista: Fleischer JG, Schulte R, Tsai HH, Tyagi S, Ibarra A, Shokhirev MN, Huang L,
Hetzer M, Navlakha S. 2018. Predicting age from the transcriptome of human dermal
fibroblasts. Genome Biology. 19, 221.
mla: Fleischer, Jason G., et al. “Predicting Age from the Transcriptome of Human
Dermal Fibroblasts.” Genome Biology, vol. 19, 221, BioMed Central, 2018,
doi:10.1186/s13059-018-1599-6.
short: J.G. Fleischer, R. Schulte, H.H. Tsai, S. Tyagi, A. Ibarra, M.N. Shokhirev,
L. Huang, M. Hetzer, S. Navlakha, Genome Biology 19 (2018).
date_created: 2022-04-07T07:45:40Z
date_published: 2018-12-20T00:00:00Z
date_updated: 2024-10-14T11:20:00Z
day: '20'
doi: 10.1186/s13059-018-1599-6
extern: '1'
external_id:
pmid:
- '30567591'
fulldoi: https://doi.org/10.1186/s13059-018-1599-6
intvolume: ' 19'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1186/s13059-018-1599-6
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: Genome Biology
publication_identifier:
issn:
- 1474-760X
publication_status: published
publisher: BioMed Central
quality_controlled: '1'
scopus_import: '1'
status: public
title: Predicting age from the transcriptome of human dermal fibroblasts
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2018'
...
---
_id: '11508'
abstract:
- lang: eng
text: Distant luminous Lyman-α emitters (LAEs) are excellent targets for spectroscopic
observations of galaxies in the epoch of reionisation (EoR). We present deep high-resolution
(R = 5000) VLT/X-shooter observations, along with an extensive collection of photometric
data of COLA1, a proposed double peaked LAE at z = 6.6. We rule out the possibility
that COLA1’s emission line is an [OII] doublet at z = 1.475 on the basis of i)
the asymmetric red line-profile and flux ratio of the peaks (blue/red=0.31 ± 0.03)
and ii) an unphysical [OII]/Hα ratio ([OII]/Hα > 22). We show that COLA1’s observed
B-band flux is explained by a faint extended foreground LAE, for which we detect
Lyα and [OIII] at z = 2.142. We thus conclude that COLA1 is a real double-peaked
LAE at z = 6.593, the first discovered at z > 6. COLA1 is UV luminous (M1500 = −21.6 ± 0.3),
has a high equivalent width (EW0,Lyα = 120−40+50 Å) and very compact Lyα emission
(r50,Lyα = 0.33−0.04+0.07 kpc). Relatively weak inferred Hβ+[OIII] line-emission
from Spitzer/IRAC indicates an extremely low metallicity of Z < 1/20 Z⊙ or reduced
strength of nebular lines due to high escape of ionising photons. The small Lyα
peak separation of 220 ± 20 km s−1 implies a low HI column density and an ionising
photon escape fraction of ≈15 − 30%, providing the first direct evidence that
such galaxies contribute actively to the reionisation of the Universe at z > 6.
Based on simple estimates, we find that COLA1 could have provided just enough
photons to reionise its own ≈0.3 pMpc (2.3 cMpc) bubble, allowing the blue Lyα
line to be observed. However, we also discuss alternative scenarios explaining
the detected double peaked nature of COLA1. Our results show that future high-resolution
observations of statistical samples of double peaked LAEs at z > 5 are a promising
probe of the occurrence of ionised regions around galaxies in the EoR.
acknowledgement: JM acknowledges the award of a Huygens PhD fellowship from Leiden
University. MG acknowledges support from NASA grant NNX17AK58G. APA, PhD::SPACE
fellow, acknowledges support from the FCT through the fellowship PD/BD/52706/2014.
Based on observations made with ESO Telescopes at the La Silla Paranal Observatory
under programme IDs 294.A-5018, 098.A-0819, 099.A-0254 and 0100.A-0213. We are grateful
for the excellent data-sets from the COSMOS and UltraVISTA survey teams. This research
was supported by the Munich Institute for Astro- and Particle Physics (MIAPP) of
the DFG cluster of excellence “Origin and Structure of the Universe”. We thank the
referee for their comments that improved the paper. We also thank Christoph Behrens,
Len Cowie, Koki Kakiichi, Peter Laursen, Charlotte Mason, Eros Vanzella, Lewis Weinberger
and Johannes Zabl for discussions. We have benefited from the public available programming
language Python, including the numpy, matplotlib, scipy and astropy packages (Hunter
2007; Astropy Collaboration 2013), the astronomical imaging tools Swarp (Bertin
2010) and ds9 and the Topcat analysis tool (Taylor 2013).
article_number: A136
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: David
full_name: Sobral, David
last_name: Sobral
- first_name: Max
full_name: Gronke, Max
last_name: Gronke
- first_name: Ana
full_name: Paulino-Afonso, Ana
last_name: Paulino-Afonso
- first_name: Mauro
full_name: Stefanon, Mauro
last_name: Stefanon
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
citation:
ama: 'Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering H.
Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly
contributing to the reionisation of the universe. Astronomy & Astrophysics.
2018;619. doi:10.1051/0004-6361/201833528'
apa: 'Matthee, J. J., Sobral, D., Gronke, M., Paulino-Afonso, A., Stefanon, M.,
& Röttgering, H. (2018). Confirmation of double peaked Lyα emission at z =
6.593: Witnessing a galaxy directly contributing to the reionisation of the universe.
Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833528'
chicago: 'Matthee, Jorryt J, David Sobral, Max Gronke, Ana Paulino-Afonso, Mauro
Stefanon, and Huub Röttgering. “Confirmation of Double Peaked Lyα Emission at
z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the
Universe.” Astronomy & Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201833528.'
ieee: 'J. J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, and
H. Röttgering, “Confirmation of double peaked Lyα emission at z = 6.593: Witnessing
a galaxy directly contributing to the reionisation of the universe,” Astronomy
& Astrophysics, vol. 619. EDP Sciences, 2018.'
ista: 'Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering
H. 2018. Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a
galaxy directly contributing to the reionisation of the universe. Astronomy &
Astrophysics. 619, A136.'
mla: 'Matthee, Jorryt J., et al. “Confirmation of Double Peaked Lyα Emission at
z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the
Universe.” Astronomy & Astrophysics, vol. 619, A136, EDP Sciences,
2018, doi:10.1051/0004-6361/201833528.'
short: J.J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, H. Röttgering,
Astronomy & Astrophysics 619 (2018).
date_created: 2022-07-06T11:14:23Z
date_published: 2018-11-19T00:00:00Z
date_updated: 2024-10-14T11:31:36Z
day: '19'
doi: 10.1051/0004-6361/201833528
extern: '1'
external_id:
arxiv:
- '1805.11621'
fulldoi: https://doi.org/10.1051/0004-6361/201833528
intvolume: ' 619'
keyword:
- Space and Planetary Science
- Astronomy and Astrophysics
- 'galaxies: high-redshift / galaxies: formation / dark ages / reionization / first
stars / techniques: spectroscopic / intergalactic medium'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1805.11621
month: '11'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy
directly contributing to the reionisation of the universe'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 619
year: '2018'
...